{"version":3,"file":"js/2416-790116828a26a9d2261b.chunk.js","mappings":"odAAA,IAAIA,EAAW,CACbC,OAAQC,KAAKC,QACbC,UAAWF,KAAKE,WAGdH,EAAS,CACX,GAAAI,IAAOC,GACDC,KAAKC,UACPF,EAASG,KAAKC,KAAKC,OACnBX,EAASC,OAAOI,IAAI,mBAAoBC,GAE5C,GAGF,MAAMK,EAAM,KAAM,IAAKD,MAAME,UAEvBC,EAAeC,IAASH,IAAQG,GAAQ,IAE9C,MAAMC,EACJ,WAAAC,CAAYC,GACVV,KAAKW,oBAAsBX,KAAKW,oBAAoBC,KAAKZ,MACzDA,KAAKU,WAAaA,EAClBV,KAAKa,kBAAoB,CAC3B,CACA,KAAAC,GACOd,KAAKe,cACRf,KAAKgB,UAAYZ,WACVJ,KAAKiB,UACZjB,KAAKkB,eACLC,iBAAiB,mBAAoBnB,KAAKW,qBAC1CjB,EAAOI,IAAI,gDAAgDE,KAAKS,YAAYW,oBAEhF,CACA,IAAAC,GACMrB,KAAKe,cACPf,KAAKiB,UAAYb,IACjBJ,KAAKsB,cACLC,oBAAoB,mBAAoBvB,KAAKW,qBAC7CjB,EAAOI,IAAI,6BAEf,CACA,SAAAiB,GACE,OAAOf,KAAKgB,YAAchB,KAAKiB,SACjC,CACA,UAAAO,GACExB,KAAKyB,SAAWrB,GAClB,CACA,aAAAsB,GACE1B,KAAKa,kBAAoB,EACzBb,KAAKwB,oBACExB,KAAK2B,eACZjC,EAAOI,IAAI,qCACb,CACA,gBAAA8B,GACE5B,KAAK2B,eAAiBvB,IACtBV,EAAOI,IAAI,wCACb,CACA,YAAAoB,GACElB,KAAKsB,cACLtB,KAAK6B,MACP,CACA,WAAAP,GACEQ,aAAa9B,KAAK+B,YACpB,CACA,IAAAF,GACE7B,KAAK+B,YAAcC,YAAW,KAC5BhC,KAAKiC,mBACLjC,KAAK6B,MACN,GAAG7B,KAAKkC,kBACX,CACA,eAAAA,GACE,MAAOd,eAAgBA,EAAgBe,wBAAyBA,GAA2BnC,KAAKS,YAIhG,OAAwB,IAAjBW,EAHSgB,KAAKC,IAAI,EAAIF,EAAyBC,KAAKE,IAAItC,KAAKa,kBAAmB,MAG9C,GAFI,IAA3Bb,KAAKa,kBAA0B,EAAIsB,GAC1BC,KAAKG,SAElC,CACA,gBAAAN,GACMjC,KAAKwC,sBACP9C,EAAOI,IAAI,oEAAoEE,KAAKa,mCAAmCP,EAAaN,KAAKyC,qCAAqCzC,KAAKS,YAAYW,oBAC/LpB,KAAKa,oBACDb,KAAK0C,uBACPhD,EAAOI,IAAI,+EAA+EQ,EAAaN,KAAK2B,sBAE5GjC,EAAOI,IAAI,+BACXE,KAAKU,WAAWiC,UAGtB,CACA,eAAIF,GACF,OAAOzC,KAAKyB,SAAWzB,KAAKyB,SAAWzB,KAAKgB,SAC9C,CACA,iBAAAwB,GACE,OAAOlC,EAAaN,KAAKyC,aAAezC,KAAKS,YAAYW,cAC3D,CACA,oBAAAsB,GACE,OAAO1C,KAAK2B,gBAAkBrB,EAAaN,KAAK2B,gBAAkB3B,KAAKS,YAAYW,cACrF,CACA,mBAAAT,GACmC,YAA7BiC,SAASC,iBACXb,YAAW,MACLhC,KAAKwC,qBAAwBxC,KAAKU,WAAWoC,WAC/CpD,EAAOI,IAAI,uFAAuF8C,SAASC,mBAC3G7C,KAAKU,WAAWiC,SAEnB,GAAG,IAER,EAGFnC,EAAkBY,eAAiB,EAEnCZ,EAAkB2B,wBAA0B,IAE5C,IAAIY,EAAW,CACbC,cAAe,CACbC,QAAS,UACTC,WAAY,aACZC,KAAM,OACNC,aAAc,uBACdC,UAAW,uBAEbC,mBAAoB,CAClBC,aAAc,eACdC,gBAAiB,kBACjBC,eAAgB,kBAElBC,mBAAoB,SACpBC,UAAW,CAAE,sBAAuB,4BAGtC,MAAOX,cAAeA,EAAeW,UAAWA,GAAaZ,EAEvDa,EAAqBD,EAAUE,MAAM,EAAGF,EAAUG,OAAS,GAE3DC,EAAU,GAAGA,QAEnB,MAAMC,EACJ,WAAAvD,CAAYwD,GACVjE,KAAKkE,KAAOlE,KAAKkE,KAAKtD,KAAKZ,MAC3BA,KAAKiE,SAAWA,EAChBjE,KAAKmE,cAAgBnE,KAAKiE,SAASE,cACnCnE,KAAKoE,QAAU,IAAI5D,EAAkBR,MACrCA,KAAKqE,cAAe,CACtB,CACA,IAAAC,CAAKC,GACH,QAAIvE,KAAK8C,WACP9C,KAAKwE,UAAUF,KAAKG,KAAKC,UAAUH,KAC5B,EAIX,CACA,IAAAL,GACE,OAAIlE,KAAK2E,YACPjF,EAAOI,IAAI,uDAAuDE,KAAK4E,eAChE,IAEPlF,EAAOI,IAAI,uCAAuCE,KAAK4E,6BAA6BjB,KAChF3D,KAAKwE,WACPxE,KAAK6E,yBAEP7E,KAAKwE,UAAY,IAAI/E,EAASI,UAAUG,KAAKiE,SAASa,IAAKnB,GAC3D3D,KAAK+E,uBACL/E,KAAKoE,QAAQtD,SACN,EAEX,CACA,KAAAkE,EAAOC,eAAgBA,GAAkB,CACvCA,gBAAgB,IAKhB,GAHKA,GACHjF,KAAKoE,QAAQ/C,OAEXrB,KAAK8C,SACP,OAAO9C,KAAKwE,UAAUQ,OAE1B,CACA,MAAArC,GAEE,GADAjD,EAAOI,IAAI,yCAAyCE,KAAK4E,eACrD5E,KAAK2E,WAUP,OAAO3E,KAAKkE,OATZ,IACE,OAAOlE,KAAKgF,OACd,CAAE,MAAOE,GACPxF,EAAOI,IAAI,6BAA8BoF,EAC3C,CAAE,QACAxF,EAAOI,IAAI,0BAA0BE,KAAKS,YAAY0E,iBACtDnD,WAAWhC,KAAKkE,KAAMlE,KAAKS,YAAY0E,YACzC,CAIJ,CACA,WAAAC,GACE,GAAIpF,KAAKwE,UACP,OAAOxE,KAAKwE,UAAUa,QAE1B,CACA,MAAAvC,GACE,OAAO9C,KAAKsF,QAAQ,OACtB,CACA,QAAAX,GACE,OAAO3E,KAAKsF,QAAQ,OAAQ,aAC9B,CACA,mBAAAC,GACE,OAAOxB,EAAQyB,KAAK5B,EAAoB5D,KAAKoF,gBAAkB,CACjE,CACA,OAAAE,IAAWG,GACT,OAAO1B,EAAQyB,KAAKC,EAAQzF,KAAK4E,aAAe,CAClD,CACA,QAAAA,GACE,GAAI5E,KAAKwE,UACP,IAAK,IAAIkB,KAASjG,EAASI,UACzB,GAAIJ,EAASI,UAAU6F,KAAW1F,KAAKwE,UAAUmB,WAC/C,OAAOD,EAAME,cAInB,OAAO,IACT,CACA,oBAAAb,GACE,IAAK,IAAIc,KAAa7F,KAAK8F,OAAQ,CACjC,MAAMC,EAAU/F,KAAK8F,OAAOD,GAAWjF,KAAKZ,MAC5CA,KAAKwE,UAAU,KAAKqB,KAAeE,CACrC,CACF,CACA,sBAAAlB,GACE,IAAK,IAAIgB,KAAa7F,KAAK8F,OACzB9F,KAAKwE,UAAU,KAAKqB,KAAe,WAAY,CAEnD,EAGF7B,EAAWmB,YAAc,IAEzBnB,EAAWgC,UAAUF,OAAS,CAC5B,OAAAG,CAAQC,GACN,IAAKlG,KAAKuF,sBACR,OAEF,MAAOY,WAAYA,EAAYF,QAASA,EAASG,OAAQA,EAAQC,UAAWA,EAAWC,KAAMA,GAAQ7B,KAAK8B,MAAML,EAAM3B,MACtH,OAAQ+B,GACP,KAAKtD,EAAcC,QAElB,OADAjD,KAAKoE,QAAQ1C,gBACN1B,KAAKmE,cAAcqC,SAE3B,KAAKxD,EAAcE,WAElB,OADAxD,EAAOI,IAAI,0BAA0BsG,KAC9BpG,KAAKgF,MAAM,CAChBC,eAAgBoB,IAGnB,KAAKrD,EAAcG,KAClB,OAAOnD,KAAKoE,QAAQ5C,aAErB,KAAKwB,EAAcI,aAElB,OADApD,KAAKmE,cAAcsC,oBAAoBN,GAChCnG,KAAKmE,cAAcuC,OAAOP,EAAY,aAE9C,KAAKnD,EAAcK,UAClB,OAAOrD,KAAKmE,cAAcwC,OAAOR,GAElC,QACC,OAAOnG,KAAKmE,cAAcuC,OAAOP,EAAY,WAAYF,GAE7D,EACA,IAAA/B,GAGE,GAFAxE,EAAOI,IAAI,kCAAkCE,KAAKoF,8BAClDpF,KAAKqE,cAAe,GACfrE,KAAKuF,sBAER,OADA7F,EAAOI,IAAI,gEACJE,KAAKgF,MAAM,CAChBC,gBAAgB,GAGtB,EACA,KAAAD,CAAMkB,GAEJ,GADAxG,EAAOI,IAAI,4BACPE,KAAKqE,aAKT,OAFArE,KAAKqE,cAAe,EACpBrE,KAAKoE,QAAQxC,mBACN5B,KAAKmE,cAAcyC,UAAU,eAAgB,CAClDC,qBAAsB7G,KAAKoE,QAAQrD,aAEvC,EACA,KAAAmE,GACExF,EAAOI,IAAI,0BACb,GAaF,MAAMgH,EACJ,WAAArG,CAAYwD,EAAU8C,EAAS,CAAC,EAAGC,GACjChH,KAAKiE,SAAWA,EAChBjE,KAAKmG,WAAa1B,KAAKC,UAAUqC,GAbtB,SAASE,EAAQC,GAC9B,GAAkB,MAAdA,EACF,IAAK,IAAIC,KAAOD,EAAY,CAC1B,MAAME,EAAQF,EAAWC,GACzBF,EAAOE,GAAOC,CAChB,CAGJ,CAMIC,CAAOrH,KAAMgH,EACf,CACA,OAAAM,CAAQC,EAAQhD,EAAO,CAAC,GAEtB,OADAA,EAAKgD,OAASA,EACPvH,KAAKsE,KAAKC,EACnB,CACA,IAAAD,CAAKC,GACH,OAAOvE,KAAKiE,SAASK,KAAK,CACxBkD,QAAS,UACTrB,WAAYnG,KAAKmG,WACjB5B,KAAME,KAAKC,UAAUH,IAEzB,CACA,WAAAkD,GACE,OAAOzH,KAAKiE,SAASE,cAAcuD,OAAO1H,KAC5C,EAGF,MAAM2H,EACJ,WAAAlH,CAAY0D,GACVnE,KAAKmE,cAAgBA,EACrBnE,KAAK4H,qBAAuB,EAC9B,CACA,SAAAC,CAAUC,IACgD,GAApD9H,KAAK4H,qBAAqB7D,QAAQ+D,IACpCpI,EAAOI,IAAI,sCAAsCgI,EAAa3B,cAC9DnG,KAAK4H,qBAAqB1H,KAAK4H,IAE/BpI,EAAOI,IAAI,8CAA8CgI,EAAa3B,cAExEnG,KAAK+H,mBACP,CACA,MAAAC,CAAOF,GACLpI,EAAOI,IAAI,oCAAoCgI,EAAa3B,cAC5DnG,KAAK4H,qBAAuB5H,KAAK4H,qBAAqBK,QAAQC,GAAKA,IAAMJ,GAC3E,CACA,iBAAAC,GACE/H,KAAKmI,mBACLnI,KAAKoI,kBACP,CACA,gBAAAD,GACErG,aAAa9B,KAAKqI,aACpB,CACA,gBAAAD,GACEpI,KAAKqI,aAAerG,YAAW,KACzBhC,KAAKmE,eAAyD,oBAAjCnE,KAAKmE,cAAcmE,WAClDtI,KAAK4H,qBAAqBW,KAAKT,IAC7BpI,EAAOI,IAAI,uCAAuCgI,EAAa3B,cAC/DnG,KAAKmE,cAAcmE,UAAUR,EAC9B,GAEJ,GAAG,IACN,EAGF,MAAMU,EACJ,WAAA/H,CAAYwD,GACVjE,KAAKiE,SAAWA,EAChBjE,KAAKyI,UAAY,IAAId,EAAsB3H,MAC3CA,KAAKmE,cAAgB,EACvB,CACA,MAAAuE,CAAOC,EAAa3B,GAClB,MACMD,EAA4B,kBADlB4B,IACuC,CACrDC,QAFcD,GAIVb,EAAe,IAAIhB,EAAa9G,KAAKiE,SAAU8C,EAAQC,GAC7D,OAAOhH,KAAK6I,IAAIf,EAClB,CACA,GAAAe,CAAIf,GAKF,OAJA9H,KAAKmE,cAAcjE,KAAK4H,GACxB9H,KAAKiE,SAAS6E,yBACd9I,KAAK0G,OAAOoB,EAAc,eAC1B9H,KAAKsI,UAAUR,GACRA,CACT,CACA,MAAAJ,CAAOI,GAKL,OAJA9H,KAAKgI,OAAOF,GACP9H,KAAK+I,QAAQjB,EAAa3B,YAAYrC,QACzC9D,KAAKgJ,YAAYlB,EAAc,eAE1BA,CACT,CACA,MAAAnB,CAAOR,GACL,OAAOnG,KAAK+I,QAAQ5C,GAAYoC,KAAKT,IACnC9H,KAAKgI,OAAOF,GACZ9H,KAAK0G,OAAOoB,EAAc,YACnBA,IAEX,CACA,MAAAE,CAAOF,GAGL,OAFA9H,KAAKyI,UAAUT,OAAOF,GACtB9H,KAAKmE,cAAgBnE,KAAKmE,cAAc8D,QAAQC,GAAKA,IAAMJ,IACpDA,CACT,CACA,OAAAiB,CAAQ5C,GACN,OAAOnG,KAAKmE,cAAc8D,QAAQC,GAAKA,EAAE/B,aAAeA,GAC1D,CACA,MAAAK,GACE,OAAOxG,KAAKmE,cAAcoE,KAAKT,GAAgB9H,KAAKsI,UAAUR,IAChE,CACA,SAAAlB,CAAUqC,KAAiBC,GACzB,OAAOlJ,KAAKmE,cAAcoE,KAAKT,GAAgB9H,KAAK0G,OAAOoB,EAAcmB,KAAiBC,IAC5F,CACA,MAAAxC,CAAOoB,EAAcmB,KAAiBC,GACpC,IAAI/E,EAMJ,OAJEA,EAD0B,kBAAjB2D,EACO9H,KAAK+I,QAAQjB,GAEb,CAAEA,GAEb3D,EAAcoE,KAAKT,GAAsD,oBAA/BA,EAAamB,GAA+BnB,EAAamB,MAAiBC,QAAQC,GACrI,CACA,SAAAb,CAAUR,GACJ9H,KAAKgJ,YAAYlB,EAAc,cACjC9H,KAAKyI,UAAUZ,UAAUC,EAE7B,CACA,mBAAArB,CAAoBN,GAClBzG,EAAOI,IAAI,0BAA0BqG,KACrCnG,KAAK+I,QAAQ5C,GAAYoC,KAAKT,GAAgB9H,KAAKyI,UAAUT,OAAOF,IACtE,CACA,WAAAkB,CAAYlB,EAAcN,GACxB,MAAOrB,WAAYA,GAAc2B,EACjC,OAAO9H,KAAKiE,SAASK,KAAK,CACxBkD,QAASA,EACTrB,WAAYA,GAEhB,EAGF,MAAMiD,EACJ,WAAA3I,CAAYqE,GACV9E,KAAKqJ,KAAOvE,EACZ9E,KAAKmE,cAAgB,IAAIqE,EAAcxI,MACvCA,KAAKU,WAAa,IAAIsD,EAAWhE,KACnC,CACA,OAAI8E,GACF,OAoBJ,SAA4BA,GACP,oBAARA,IACTA,EAAMA,KAER,GAAIA,IAAQ,UAAUwE,KAAKxE,GAAM,CAC/B,MAAMyE,EAAI3G,SAAS4G,cAAc,KAIjC,OAHAD,EAAEE,KAAO3E,EACTyE,EAAEE,KAAOF,EAAEE,KACXF,EAAElE,SAAWkE,EAAElE,SAASqE,QAAQ,OAAQ,MACjCH,EAAEE,IACX,CACE,OAAO3E,CAEX,CAjCW6E,CAAmB3J,KAAKqJ,KACjC,CACA,IAAA/E,CAAKC,GACH,OAAOvE,KAAKU,WAAW4D,KAAKC,EAC9B,CACA,OAAAqF,GACE,OAAO5J,KAAKU,WAAWwD,MACzB,CACA,UAAAhB,GACE,OAAOlD,KAAKU,WAAWsE,MAAM,CAC3BC,gBAAgB,GAEpB,CACA,sBAAA6D,GACE,IAAK9I,KAAKU,WAAWiE,WACnB,OAAO3E,KAAKU,WAAWwD,MAE3B,EAkBF,SAAS2F,EAAe/E,EAIxB,SAAmBgF,GACjB,MAAMC,EAAUnH,SAASoH,KAAKC,cAAc,2BAA2BH,OACvE,GAAIC,EACF,OAAOA,EAAQG,aAAa,UAEhC,CAT8BC,CAAU,QAAUpH,EAASW,oBACzD,OAAO,IAAI0F,EAAStE,EACtB,C,wBC/dA,MAAMsF,EAAS,EAAQ,OACjBC,EAAY,EAAQ,OAC1B,MAAMC,UAAwBF,EAAOG,WACjC,WAAA9J,CAAY+J,GACRC,QACAzK,KAAK0K,MAAQF,EAAQE,MACrB1K,KAAK2I,YAAc6B,EAAQ7B,aAAe,iBAC1C3I,KAAK2K,WAAaH,EAAQG,YAAc,UACxC3K,KAAK4K,iBAAmBJ,EAAQI,kBAAoB,CAAC,CACzD,CAGA,OAAAC,CAAQC,EAAWC,GACf,OAAO,IAAIX,EAAOY,YAAYC,IAC1B,IAAIC,EAAY9I,KAAK+I,MAAMhL,KAAKC,MAAwB,IAAhBgC,KAAKG,UAAmB6I,SAAS,IACrET,EAAa3K,KAAK2K,WAClBC,EAAqD,oBAA1B5K,KAAK4K,iBAChC5K,KAAK4K,iBAAiBE,GAAa9K,KAAK4K,iBACxChC,EAAU5I,KAAK0K,MAAMvG,cAAcuE,OAAO2C,OAAOC,OAAO,CAAC,EAAG,CAC5D1C,QAAS5I,KAAK2I,YACduC,UAAWA,GACZN,GAAmB,CAClBW,UAAW,WACPvL,KAAKsH,QAAQqD,EAAY,CACrBa,MAAOV,EAAUU,OAAQ,EAAInB,EAAUoB,OAAOX,EAAUU,OAAS,KACjEE,UAAWZ,EAAUY,UAErBC,YAAab,EAAUa,YACvBC,cAAed,EAAUc,eAEjC,EACAC,SAAU,SAAUC,GAChB,IAAIC,EAAIC,IACyE,QAA3ED,EAAiB,OAAZD,QAAgC,IAAZA,OAAqB,EAASA,EAAQG,cAA2B,IAAPF,OAAgB,EAASA,EAAGxH,QAAsF,QAA3EyH,EAAiB,OAAZF,QAAgC,IAAZA,OAAqB,EAASA,EAAQG,cAA2B,IAAPD,OAAgB,EAASA,EAAGE,UAC3OjB,EAASkB,KAAKL,EAAQG,QAErBH,EAAQM,MACTnB,EAASoB,UAEjB,IAGJ,OAAOhB,OAAOC,OAAO1C,EAAS,CAAE0D,QAAQ,GAAQ,GAExD,EAEJC,EAAQ,EAAUjC,C,iLCjBX,IAAIkC,EAAW,WAQlB,OAPAA,EAAWnB,OAAOC,QAAU,SAAkBmB,GAC1C,IAAK,IAAIvE,EAAGwE,EAAI,EAAGC,EAAIC,UAAU9I,OAAQ4I,EAAIC,EAAGD,IAE5C,IAAK,IAAIG,KADT3E,EAAI0E,UAAUF,GACOrB,OAAOrF,UAAU8G,eAAetH,KAAK0C,EAAG2E,KAAIJ,EAAEI,GAAK3E,EAAE2E,IAE9E,OAAOJ,CACX,EACOD,EAASO,MAAM/M,KAAM4M,UAChC,EAmE6BvB,OAAO3C,OA0GX2C,OAAO3C,O,eCnN5BsE,EAAW,IAAIC,IACfC,EAAoB,IAAID,IACxBE,GAAwB,EACxBC,GAAgC,EACpC,SAASC,EAAUC,GACf,OAAOA,EAAO5D,QAAQ,UAAW,KAAK6D,MAC1C,CAIA,SAASC,EAAiBC,GACtB,IAAIC,EAAW,IAAIC,IACfC,EAAc,GA0BlB,OAzBAH,EAAIG,YAAYC,SAAQ,SAAUC,GAC9B,GAAgC,uBAA5BA,EAAmBC,KAA+B,CAClD,IAAIC,EAAeF,EAAmBhE,KAAK1C,MACvC6G,EARLZ,GADca,EASmBJ,EAAmBI,KARtCC,OAAOC,KAAKC,UAAUH,EAAIpN,MAAOoN,EAAII,MAS9CC,EAAerB,EAAkBsB,IAAIR,GACrCO,IAAiBA,EAAaE,IAAIR,GAC9Bd,GACAvN,QAAQ8O,KAAK,+BAAiCV,EAAjC,iMAKXO,GACNrB,EAAkByB,IAAIX,EAAcO,EAAe,IAAIZ,KAE3DY,EAAa1F,IAAIoF,GACZP,EAASe,IAAIR,KACdP,EAAS7E,IAAIoF,GACbL,EAAY1N,KAAK4N,GAEzB,MAEIF,EAAY1N,KAAK4N,GA5B7B,IAAyBI,CA8BrB,IACO1B,EAASA,EAAS,CAAC,EAAGiB,GAAM,CAAEG,YAAaA,GACtD,CAoBA,SAASgB,EAAcT,GACnB,IAAIU,EAAWxB,EAAUc,GACzB,IAAKnB,EAASyB,IAAII,GAAW,CACzB,IAAIC,GAAS,QAAMX,EAAQ,CACvBf,8BAA+BA,EAC/B2B,6BAA8B3B,IAElC,IAAK0B,GAA0B,aAAhBA,EAAOf,KAClB,MAAM,IAAIiB,MAAM,iCAEpBhC,EAAS2B,IAAIE,EA7BrB,SAAkBI,GACd,IAAIC,EAAU,IAAIvB,IAAIsB,EAAIrB,aAC1BsB,EAAQrB,SAAQ,SAAUsB,GAClBA,EAAKjB,YACEiB,EAAKjB,IAChB7C,OAAO+D,KAAKD,GAAMtB,SAAQ,SAAU1G,GAChC,IAAIC,EAAQ+H,EAAKhI,GACbC,GAA0B,kBAAVA,GAChB8H,EAAQrG,IAAIzB,EAEpB,GACJ,IACA,IAAI8G,EAAMe,EAAIf,IAKd,OAJIA,WACOA,EAAImB,kBACJnB,EAAIoB,UAERL,CACX,CAW+BM,CAAS/B,EAAiBsB,IACrD,CACA,OAAO9B,EAASwB,IAAIK,EACxB,CACO,SAASW,EAAIC,GAEhB,IADA,IAAIvG,EAAO,GACFwG,EAAK,EAAGA,EAAK9C,UAAU9I,OAAQ4L,IACpCxG,EAAKwG,EAAK,GAAK9C,UAAU8C,GAEL,kBAAbD,IACPA,EAAW,CAACA,IAEhB,IAAIxD,EAASwD,EAAS,GAUtB,OATAvG,EAAK2E,SAAQ,SAAU8B,EAAKjD,GACpBiD,GAAoB,aAAbA,EAAI5B,KACX9B,GAAU0D,EAAIzB,IAAIC,OAAOC,KAGzBnC,GAAU0D,EAEd1D,GAAUwD,EAAS/C,EAAI,EAC3B,IACOkC,EAAc3C,EACzB,CACO,SAAS2D,IACZ5C,EAAS6C,QACT3C,EAAkB2C,OACtB,CACO,SAASC,IACZ3C,GAAwB,CAC5B,CACO,SAAS4C,IACZ3C,GAAgC,CACpC,CACO,SAAS4C,IACZ5C,GAAgC,CACpC,CACA,IAOW6C,EAPPC,EACKV,EADLU,EAEaN,EAFbM,EAGyBJ,EAHzBI,EAIqCH,EAJrCG,EAKsCF,GAE/BC,EAERT,IAAQA,EAAM,CAAC,IADRA,IAAMU,EAAYD,EAAML,YAAcM,EAAoBD,EAAMH,wBAA0BI,EAAgCD,EAAMF,oCAAsCG,EAA4CD,EAAMD,qCAAuCE,EAEzQV,EAAa,QAAIA,EACjB,O,+JCjHIW,EAA6B,WAC7B,SAASA,IACLnQ,KAAKoQ,wBAAyB,EAG9BpQ,KAAKqQ,gBAAiB,QAAK,KAA0B,CACjDC,IAAK,IAAW,iCACZ,IACJC,MAAO,KAEf,CAmHA,OA5GAJ,EAAYnK,UAAUwK,MAAQ,SAAUhG,GACpC,IAIIiG,EAJAC,EAAQ1Q,KACR2Q,EAA6C,kBAAvBnG,EAAQoG,WAA0BpG,EAAQoG,YACvC,IAAvBpG,EAAQoG,WAAuB,UAC3B,EAGV,OADA5Q,KAAK6Q,oBAAmB,WAAc,OAAQJ,EAAejG,EAAQsG,OAAOJ,EAAS,GAAGC,GACjFF,CACX,EACAN,EAAYnK,UAAU+K,4BAA8B,SAAUC,EAAaL,GACvE3Q,KAAK6Q,mBAAmBG,EAAaL,EACzC,EAIAR,EAAYnK,UAAUiL,kBAAoB,SAAUrO,GAChD,OAAOA,CACX,EAGAuN,EAAYnK,UAAUkL,iBAAmB,SAAUtO,GAC/C,OAAOA,CACX,EACAuN,EAAYnK,UAAUmL,SAAW,SAAUlK,GAE3C,EACAkJ,EAAYnK,UAAUoL,GAAK,WACvB,MAAO,EACX,EACAjB,EAAYnK,UAAUqL,OAAS,SAAU7G,GACrC,OAAO,CACX,EAEA2F,EAAYnK,UAAUsL,UAAY,SAAU9G,EAASoG,GAEjD,YADmB,IAAfA,IAAyBA,IAAepG,EAAQoG,YAC7C5Q,KAAKuR,MAAK,SAAS,QAAS,CAAC,EAAG/G,GAAU,CAAEgH,OAAQhH,EAAQiH,IAAM,aAAcb,WAAYA,IACvG,EAEAT,EAAYnK,UAAU0L,cAAgB,SAAUlH,GAC5C,IAQImH,EARAjB,EAAQ1Q,KACR4R,EAAWpH,EAAQoH,SAAU5D,EAAexD,EAAQwD,aAAc6D,EAAOrH,EAAQqH,KAAM9F,EAAKvB,EAAQoG,WAAYA,OAAoB,IAAP7E,GAAuBA,EACpJ+F,EAAc,CACdC,mBAAmB,EACnBN,GAAoB,kBAATI,EAAoBA,EAAO7R,KAAKmR,SAASU,GACpDrG,MAAOxL,KAAKqQ,eAAeuB,EAAU5D,GACrC4C,WAAYA,GAGhB,OAAO,IAAI,KAAW,SAAU3F,GAC5B,OAAOyF,EAAMsB,OAAM,SAAS,QAAS,CAAC,EAAGF,GAAc,CAAEG,WAAW,EAAMzG,MAAOkF,EAAML,eAAeuB,EAAU5D,GAAekE,SAAU,SAAUC,GAC3I,KAAI,OAAMA,EAAMR,GAAhB,CAGA,IAAI1F,EAAS,CACT1H,KAAM4N,EAAKlG,OACXI,WAAY8F,EAAK9F,UAEjB8F,EAAKC,UACLnG,EAAOmG,SAAU,QAAeD,EAAKC,QAAQ7J,KAAI,SAAUrD,GAAS,OAAOA,EAAMkN,OAAS,MAE9FT,EAAaQ,EACblH,EAASkB,KAAKF,EATd,CAUJ,IACR,GACJ,EACAkE,EAAYnK,UAAUqM,aAAe,SAAU7H,EAASoG,GAEpD,YADmB,IAAfA,IAAyBA,IAAepG,EAAQoG,YAC7C5Q,KAAKuR,MAAK,SAAS,QAAS,CAAC,EAAG/G,GAAU,CAAEgB,MAAOxL,KAAKqQ,eAAe7F,EAAQoH,SAAUpH,EAAQwD,cAAewD,OAAQhH,EAAQiH,GAAIb,WAAYA,IAC3J,EACAT,EAAYnK,UAAUsM,WAAa,SAAUvG,GACzC,IAAI0F,EAAK1F,EAAG0F,GAAIlN,EAAOwH,EAAGxH,KAAMiG,GAAU,QAAOuB,EAAI,CAAC,KAAM,SAC5D,OAAO/L,KAAKuS,MAAMlH,OAAOC,OAAOd,EAAS,CACrCgI,OAAQf,GAAM,aACdxF,OAAQ1H,IAEhB,EACA4L,EAAYnK,UAAUyM,cAAgB,SAAU1G,GAC5C,IAAI0F,EAAK1F,EAAG0F,GAAIlN,EAAOwH,EAAGxH,KAAMqN,EAAW7F,EAAG6F,SAAU5D,EAAejC,EAAGiC,aAAcxD,GAAU,QAAOuB,EAAI,CAAC,KAAM,OAAQ,WAAY,iBACxI,OAAO/L,KAAKuS,MAAMlH,OAAOC,OAAOd,EAAS,CACrCgB,MAAOxL,KAAKqQ,eAAeuB,EAAU5D,GACrCwE,OAAQf,EACRxF,OAAQ1H,IAEhB,EACA4L,EAAYnK,UAAU0M,YAAc,SAAUlI,EAASsG,GACnD,OAAO9Q,KAAKwQ,MAAM,CACdM,OAAQ,SAAUP,GACd,IAAInJ,EAAQmJ,EAAMe,UAAU9G,GACxBjG,EAAOuM,EAAO1J,GAClB,YAAa,IAAT7C,GAA4B,OAATA,EACZ6C,GACXmJ,EAAM+B,YAAW,SAAS,QAAS,CAAC,EAAG9H,GAAU,CAAEjG,KAAMA,KAClDA,EACX,GAER,EACA4L,EAAYnK,UAAU2M,eAAiB,SAAUnI,EAASsG,GACtD,OAAO9Q,KAAKwQ,MAAM,CACdM,OAAQ,SAAUP,GACd,IAAInJ,EAAQmJ,EAAM8B,aAAa7H,GAC3BjG,EAAOuM,EAAO1J,GAClB,YAAa,IAAT7C,GAA4B,OAATA,EACZ6C,GACXmJ,EAAMkC,eAAc,SAAS,QAAS,CAAC,EAAGjI,GAAU,CAAEjG,KAAMA,KACrDA,EACX,GAER,EACO4L,CACX,CA9HgC,IAgIL,IAAvByC,WAAWC,UACX1C,EAAYnK,UAAU8M,mBAAqB,K,uECtI3CC,EAAmC,SAAUC,GAE7C,SAASD,EAAkB9M,EAASgN,EAAMzH,EAAOE,GAC7C,IAAIK,EAEA2E,EAAQsC,EAAOxN,KAAKxF,KAAMiG,IAAYjG,KAK1C,GAJA0Q,EAAMzK,QAAUA,EAChByK,EAAMuC,KAAOA,EACbvC,EAAMlF,MAAQA,EACdkF,EAAMhF,UAAYA,EACdwH,MAAMC,QAAQzC,EAAMuC,MAAO,CAC3BvC,EAAM0B,QAAU1B,EAAMzK,QACtB,IAAK,IAAIyG,EAAIgE,EAAMuC,KAAKnP,OAAS,EAAG4I,GAAK,IAAKA,EAC1CgE,EAAM0B,UAAWrG,EAAK,CAAC,GAAM2E,EAAMuC,KAAKvG,IAAMgE,EAAM0B,QAASrG,EAErE,MAEI2E,EAAM0B,QAAU1B,EAAMuC,KAK1B,OADAvC,EAAM0C,UAAYL,EAAkB/M,UAC7B0K,CACX,CACA,OAvBA,QAAUqC,EAAmBC,GAuBtBD,CACX,CAzBsC,CAyBpC/D,M,qYCzBSqE,EAAShI,OAAOrF,UAAU8G,eAC9B,SAASwG,EAAUlM,GACtB,OAAiB,OAAVA,QAA4B,IAAVA,CAC7B,CAEO,SAASmM,EAAwBxH,EAAIyH,GACxC,IAAIC,EAAa1H,EAAG0H,WAAYhC,EAAK1F,EAAG0F,GAAIiC,EAAM3H,EAAG2H,IACrD,GAA0B,kBAAfD,IACHD,IACAA,EAAQG,UACHL,EAAU7B,GACJ6B,EAAUI,QACP,EADc,CAAEA,IAAKA,GADd,CAAEjC,GAAIA,IAK3B6B,EAAU7B,KAAQ6B,EAAUI,KAC5BjC,EAAKiC,IAEJJ,EAAU7B,IACX,MAAO,GAAGmC,OAAOH,EAAY,KAAKG,OAAqB,kBAAPnC,GAAiC,kBAAPA,EACtEA,EACEhN,KAAKC,UAAU+M,GAGjC,CACA,IAAIoC,EAAgB,CAChBC,iBAAkBP,EAClBQ,aAAa,EACbC,eAAe,EAGfC,iBAAiB,GAEd,SAASC,EAAgBC,GAC5B,OAAO,OAAQN,EAAeM,EAClC,CACO,SAASC,EAAsBD,GAClC,IAAI/M,EAAQ+M,EAAOF,gBACnB,YAAiB,IAAV7M,EAAmByM,EAAcI,gBAAkB7M,CAC9D,CACO,SAASiN,EAA2BC,EAAOC,GAC9C,OAAO,QAAYA,GACfD,EAAM9F,IAAI+F,EAAkBC,MAAO,cACjCD,GAAqBA,EAAkBd,UACjD,CACO,IAAIgB,EAAwB,qBAC5B,SAASC,EAAuBC,GACnC,IAAIC,EAAQD,EAAeC,MAAMH,GACjC,OAAOG,EAAQA,EAAM,GAAKD,CAC9B,CACO,SAASE,EAA0BC,EAAc7I,EAAQP,GAC5D,SAAI,OAAgBO,MACT,OAAQA,GACXA,EAAO8I,OAAM,SAAUC,GACnB,OAAOH,EAA0BC,EAAcE,EAAMtJ,EACzD,IACEoJ,EAAaG,WAAWF,OAAM,SAAUG,GACtC,IAAI,QAAQA,KAAU,QAAcA,EAAOxJ,GAAY,CACnD,IAAIvE,GAAM,QAAuB+N,GACjC,OAAQ7B,EAAO7N,KAAKyG,EAAQ9E,MACtB+N,EAAMJ,cACJD,EAA0BK,EAAMJ,aAAc7I,EAAO9E,GAAMuE,GACvE,CAMA,OAAO,CACX,IAGZ,CACO,SAASyJ,EAAwB/N,GACpC,OAAO,OAAgBA,MAAW,QAAYA,MAAW,OAAQA,EACrE,CACO,SAASgO,IACZ,OAAO,IAAI,IACf,CACO,SAASC,EAAuBzS,EAAU0S,GAG7C,IAAIC,GAAc,SAAkB,QAAuB3S,IAC3D,MAAO,CACH2S,YAAaA,EACbC,eAAgB,SAAU1L,GACtB,IAAI2L,EAAMF,EAAYzL,GAItB,OAHK2L,GAAOH,IACRG,EAAMH,EAAUI,OAAO5L,IAEpB2L,GAAO,IAClB,EAER,C,wTCvFIE,EAAStK,OAAO3C,OAAO,MACvBkN,EAAc,WAAc,OAAOD,CAAQ,EAC3CE,EAAaxK,OAAO3C,OAAO,MAC3BoN,EAA6B,WAC7B,SAASA,EAAYC,EAAUC,GAC3B,IAAItF,EAAQ1Q,KACZA,KAAK+V,SAAWA,EAChB/V,KAAKgW,MAAQA,EACbhW,KAAKuE,KAAO8G,OAAO3C,OAAO,MAI1B1I,KAAKiW,QAAU5K,OAAO3C,OAAO,MAE7B1I,KAAKkW,KAAO7K,OAAO3C,OAAO,MAG1B1I,KAAKmW,cAAgB,SAAU5B,EAAmBI,GAC9C,OAAO,EAAAyB,EAAA,IAAgB,QAAY7B,GAC/B7D,EAAMlC,IAAI+F,EAAkBC,MAAOG,GACjCJ,GAAqBA,EAAkBI,GACjD,EAIA3U,KAAKqW,QAAU,SAAUC,GACrB,OAAO,QAAYA,GACf5F,EAAMjC,IAAI6H,EAAS9B,OACG,kBAAb8B,CACjB,EAKAtW,KAAKuW,YAAc,SAAUC,EAAcC,GACvC,GAA4B,kBAAjBD,EACP,OAAO,QAAcA,GAEzB,IAAI,QAAYA,GACZ,OAAOA,EAEX,IAAI/E,EAAKf,EAAMqF,SAAS5E,SAASqF,GAAc,GAC/C,GAAI/E,EAAI,CACJ,IAAIiF,GAAM,QAAcjF,GAIxB,OAHIgF,GACA/F,EAAMiG,MAAMlF,EAAI+E,GAEbE,CACX,CACJ,CACJ,CA+XA,OA3XAZ,EAAY9P,UAAU4Q,SAAW,WAC7B,OAAO,QAAS,CAAC,EAAG5W,KAAKuE,KAC7B,EACAuR,EAAY9P,UAAUyI,IAAM,SAAU+D,GAClC,YAAqC,IAA9BxS,KAAK0V,OAAOlD,GAAQ,EAC/B,EACAsD,EAAY9P,UAAUwI,IAAM,SAAUgE,EAAQqE,GAE1C,GADA7W,KAAKgW,MAAMc,OAAOtE,EAAQqE,GACtB,KAAOrR,KAAKxF,KAAKuE,KAAMiO,GAAS,CAChC,IAAIuE,EAAc/W,KAAKuE,KAAKiO,GAC5B,GAAIuE,GAAe,KAAOvR,KAAKuR,EAAaF,GACxC,OAAOE,EAAYF,EAE3B,CACA,MAAkB,eAAdA,GACA,KAAOrR,KAAKxF,KAAK+V,SAASiB,kBAAmBxE,GACtCxS,KAAK+V,SAASiB,kBAAkBxE,GAEvCxS,gBAAgBiX,EACTjX,KAAKkX,OAAO1I,IAAIgE,EAAQqE,QADnC,CAGJ,EACAf,EAAY9P,UAAU0P,OAAS,SAAUlD,EAAQ2E,GAQ7C,OAFIA,GACAnX,KAAKgW,MAAMc,OAAOtE,EAAQ,YAC1B,KAAOhN,KAAKxF,KAAKuE,KAAMiO,GAChBxS,KAAKuE,KAAKiO,GAEjBxS,gBAAgBiX,EACTjX,KAAKkX,OAAOxB,OAAOlD,EAAQ2E,GAElCnX,KAAK+V,SAASiB,kBAAkBxE,GACzBnH,OAAO3C,OAAO,WADzB,CAGJ,EACAoN,EAAY9P,UAAU2Q,MAAQ,SAAUS,EAAOC,GAC3C,IACI7E,EADA9B,EAAQ1Q,MAGR,QAAYoX,KACZA,EAAQA,EAAM5C,QACd,QAAY6C,KACZA,EAAQA,EAAM7C,OAClB,IAAI8C,EAA4B,kBAAVF,EAAqBpX,KAAK0V,OAAQlD,EAAS4E,GAAUA,EACvEG,EAA4B,kBAAVF,EAAqBrX,KAAK0V,OAAQlD,EAAS6E,GAAUA,EAG3E,GAAKE,EAAL,EAEA,QAA4B,kBAAX/E,EAAqB,GACtC,IAAIgF,EAAS,IAAI,KAAWC,GAAuBd,MAAMW,EAAUC,GAInE,GADAvX,KAAKuE,KAAKiO,GAAUgF,EAChBA,IAAWF,WACJtX,KAAKkW,KAAK1D,GACbxS,KAAKgW,MAAM0B,SAAS,CACpB,IAAIC,EAAkBtM,OAAO3C,OAAO,MAI/B4O,IACDK,EAAgBC,SAAW,GAG/BvM,OAAO+D,KAAKmI,GAAU1J,SAAQ,SAAU8G,GACpC,IAAK2C,GACDA,EAAS3C,KAAoB6C,EAAO7C,GAAiB,CAGrDgD,EAAgBhD,GAAkB,EAQlC,IAAIkC,GAAY,QAAuBlC,GACnCkC,IAAclC,GACbjE,EAAMqF,SAAS8B,WAAWL,EAAO/D,WAAYoD,KAC9Cc,EAAgBd,GAAa,QAKF,IAA3BW,EAAO7C,IAAgCjE,aAAiBuG,UACjDO,EAAO7C,EAEtB,CACJ,KACIgD,EAAgBlE,YACd6D,GAAYA,EAAS7D,YAKvBzT,KAAK+V,SAASiB,kBAAkBxE,KAAYgF,EAAO/D,mBAC5CkE,EAAgBlE,WAE3BpI,OAAO+D,KAAKuI,GAAiB9J,SAAQ,SAAUgJ,GAC3C,OAAOnG,EAAMsF,MAAM8B,MAAMtF,EAAQqE,EACrC,GACJ,CAvDM,CAyDd,EACAf,EAAY9P,UAAUqL,OAAS,SAAUmB,EAAQuF,GAC7C,IAAIrH,EAAQ1Q,KACR+W,EAAc/W,KAAK0V,OAAOlD,GAC9B,GAAIuE,EAAa,CACb,IAAIiB,EAAkB3M,OAAO3C,OAAO,MAChCuP,GAAgB,EAChBC,GAAe,EACfC,EAAkB,CAClBxC,OAAQA,EACRE,WAAYA,EACZuC,YAAa,KACb7B,YAAavW,KAAKuW,YAClBF,QAASrW,KAAKqW,QACdgC,UAAW,SAAUC,EAAoBzG,GACrC,OAAOnB,EAAMqF,SAASsC,UAAwC,kBAAvBC,EACnC,CACIzB,UAAWyB,EACXzG,KAAMA,IAAQ,QAAcW,IAE9B8F,EAAoB,CAAEhE,MAAO5D,GACvC,GAkEJ,GAhEArF,OAAO+D,KAAK2H,GAAalJ,SAAQ,SAAU8G,GACvC,IAAIkC,GAAY,QAAuBlC,GACnC4D,EAAaxB,EAAYpC,GAC7B,QAAmB,IAAf4D,EAAJ,CAEA,IAAIlH,EAA2B,oBAAX0G,EAAwBA,EAAUA,EAAOpD,IAAmBoD,EAAOlB,GACvF,GAAIxF,EAAQ,CACR,IAAImH,EAAWnH,IAAWuE,EAAcD,EAAUtE,GAAO,EAAA+E,EAAA,GAAgBmC,IAAa,SAAS,QAAS,CAAC,EAAGJ,GAAkB,CAAEtB,UAAWA,EAAWlC,eAAgBA,EAAgB8D,QAAS/H,EAAMgI,WAAWlG,EAAQmC,MACxN,GAAI6D,IAAa3C,EACbnF,EAAMsF,MAAM8B,MAAMtF,EAAQmC,QAK1B,GAFI6D,IAAa7C,IACb6C,OAAW,GACXA,IAAaD,IACbP,EAAgBrD,GAAkB6D,EAClCP,GAAgB,EAChBM,EAAaC,GACc,IAAvB5F,WAAWC,SAAmB,CAC9B,IAAI8F,EAAiB,SAAUjC,GAC3B,QAAgCvN,IAA5BuH,EAAMgF,OAAOgB,EAAIlC,OAEjB,OADuB,IAAvB5B,WAAWC,SAAqB,KAAUnE,KAAK,EAAGgI,IAC3C,CAEf,EACA,IAAI,QAAY8B,GACZG,EAAeH,QAEd,GAAItF,MAAMC,QAAQqF,GAInB,IAFA,IAAII,GAAgB,EAChBC,OAAmB,EACdnJ,EAAK,EAAGoJ,EAAaN,EAAU9I,EAAKoJ,EAAWhV,OAAQ4L,IAAM,CAClE,IAAItI,EAAQ0R,EAAWpJ,GACvB,IAAI,QAAYtI,IAEZ,GADAwR,GAAgB,EACZD,EAAevR,GACf,WAKJ,GAAqB,kBAAVA,GAAwBA,EACtBsJ,EAAMqF,SAAS5E,SAAS/J,GAAO,KAGpCyR,EAAmBzR,GAI/B,GAAIwR,QAAsCzP,IAArB0P,EAAgC,EAC1B,IAAvBjG,WAAWC,SAAqB,KAAUnE,KAAK,EAAGmK,GAClD,KACJ,CACJ,CAER,CAGZ,MACmB,IAAfN,IACAL,GAAe,EAzDT,CA2Dd,IACID,EAWA,OAVAjY,KAAK2W,MAAMnE,EAAQwF,GACfE,IACIlY,gBAAgBiX,EAChBjX,KAAKuE,KAAKiO,QAAU,SAGbxS,KAAKuE,KAAKiO,GAErBxS,KAAKgW,MAAM8B,MAAMtF,EAAQ,cAEtB,CAEf,CACA,OAAO,CACX,EAOAsD,EAAY9P,UAAU+S,OAAS,SAAUvG,EAAQqE,EAAW3N,GACxD,IAAI6C,EACAgL,EAAc/W,KAAK0V,OAAOlD,GAC9B,GAAIuE,EAAa,CACb,IAAIiC,EAAWhZ,KAAKmW,cAAcY,EAAa,cAC3CpC,EAAiBkC,GAAa3N,EAC9BlJ,KAAK+V,SAASkD,kBAAkB,CAAED,SAAUA,EAAUnC,UAAWA,EAAW3N,KAAMA,IAChF2N,EACN,OAAO7W,KAAKqR,OAAOmB,EAAQmC,IAAkB5I,EAAK,CAAC,GAC5C4I,GAAkBiB,EACrB7J,GAAM6J,EACd,CACA,OAAO,CACX,EACAE,EAAY9P,UAAUkT,MAAQ,SAAU1O,EAAS2O,GAC7C,IAAIC,GAAU,EAgBd,OAfI5O,EAAQiH,KACJ,KAAOjM,KAAKxF,KAAKuE,KAAMiG,EAAQiH,MAC/B2H,EAAUpZ,KAAK+Y,OAAOvO,EAAQiH,GAAIjH,EAAQqM,UAAWrM,EAAQtB,OAE7DlJ,gBAAgBiX,GAASjX,OAASmZ,IAClCC,EAAUpZ,KAAKkX,OAAOgC,MAAM1O,EAAS2O,IAAUC,IAM/C5O,EAAQqM,WAAauC,IACrBpZ,KAAKgW,MAAM8B,MAAMtN,EAAQiH,GAAIjH,EAAQqM,WAAa,aAGnDuC,CACX,EACAtD,EAAY9P,UAAU6J,MAAQ,WAC1B7P,KAAK0J,QAAQ,KACjB,EACAoM,EAAY9P,UAAUqT,QAAU,WAC5B,IAAI3I,EAAQ1Q,KACRsZ,EAAMtZ,KAAK4W,WACX2C,EAAe,GASnB,OARAvZ,KAAKwZ,eAAe3L,SAAQ,SAAU4D,GAC7B,KAAOjM,KAAKkL,EAAMqF,SAASiB,kBAAmBvF,IAC/C8H,EAAarZ,KAAKuR,EAE1B,IACI8H,EAAazV,SACbwV,EAAIG,OAAS,CAAEF,aAAcA,EAAaG,SAEvCJ,CACX,EACAxD,EAAY9P,UAAU0D,QAAU,SAAUiQ,GACtC,IAAIjJ,EAAQ1Q,KAMZ,GALAqL,OAAO+D,KAAKpP,KAAKuE,MAAMsJ,SAAQ,SAAU2E,GAC/BmH,GAAW,KAAOnU,KAAKmU,EAASnH,IAClC9B,EAAMqI,OAAOvG,EAErB,IACImH,EAAS,CACT,IAAIF,EAASE,EAAQF,OAAQG,GAAS,QAAOD,EAAS,CAAC,WACvDtO,OAAO+D,KAAKwK,GAAQ/L,SAAQ,SAAU2E,GAClC9B,EAAMiG,MAAMnE,EAAQoH,EAAOpH,GAC/B,IACIiH,GACAA,EAAOF,aAAa1L,QAAQ7N,KAAK6Z,OAAQ7Z,KAEjD,CACJ,EACA8V,EAAY9P,UAAU6T,OAAS,SAAUrI,GACrC,OAAQxR,KAAKiW,QAAQzE,IAAWxR,KAAKiW,QAAQzE,IAAW,GAAK,CACjE,EACAsE,EAAY9P,UAAU8T,QAAU,SAAUtI,GACtC,GAAIxR,KAAKiW,QAAQzE,GAAU,EAAG,CAC1B,IAAIuI,IAAU/Z,KAAKiW,QAAQzE,GAG3B,OAFKuI,UACM/Z,KAAKiW,QAAQzE,GACjBuI,CACX,CACA,OAAO,CACX,EAGAjE,EAAY9P,UAAUwT,aAAe,SAAUQ,GAY3C,YAXY,IAARA,IAAkBA,EAAM,IAAIrM,KAChCtC,OAAO+D,KAAKpP,KAAKiW,SAASpI,QAAQmM,EAAInR,IAAKmR,GACvCha,gBAAgBiX,EAChBjX,KAAKkX,OAAOsC,aAAaQ,GAMzB3O,OAAO+D,KAAKpP,KAAK+V,SAASiB,mBAAmBnJ,QAAQmM,EAAInR,IAAKmR,GAE3DA,CACX,EAKAlE,EAAY9P,UAAUoL,GAAK,WACvB,IAAIV,EAAQ1Q,KACRga,EAAMha,KAAKwZ,eACXS,EAAWja,KAAK4W,WACpBoD,EAAInM,SAAQ,SAAU4D,GACd,KAAOjM,KAAKyU,EAAUxI,KAItBpG,OAAO+D,KAAKsB,EAAMwJ,gBAAgBzI,IAAK5D,QAAQmM,EAAInR,IAAKmR,UAGjDC,EAASxI,GAExB,IACA,IAAI0I,EAAc9O,OAAO+D,KAAK6K,GAC9B,GAAIE,EAAYrW,OAAQ,CAEpB,IADA,IAAIsW,EAASpa,KACNoa,aAAkBnD,GACrBmD,EAASA,EAAOlD,OACpBiD,EAAYtM,SAAQ,SAAU4D,GAAM,OAAO2I,EAAOrB,OAAOtH,EAAK,GAClE,CACA,OAAO0I,CACX,EACArE,EAAY9P,UAAUkU,gBAAkB,SAAU1H,GAC9C,IAAK,KAAOhN,KAAKxF,KAAKkW,KAAM1D,GAAS,CACjC,IAAI6H,EAAWra,KAAKkW,KAAK1D,GAAUnH,OAAO3C,OAAO,MAC7C4R,EAAOta,KAAKuE,KAAKiO,GACrB,IAAK8H,EACD,OAAOD,EACX,IAAIE,EAAY,IAAI5M,IAAI,CAAC2M,IAGzBC,EAAU1M,SAAQ,SAAUyL,IACpB,QAAYA,KACZe,EAAQf,EAAI9E,QAAS,IASrB,OAAgB8E,IAChBjO,OAAO+D,KAAKkK,GAAKzL,SAAQ,SAAU1G,GAC/B,IAAIqT,EAAQlB,EAAInS,IAGZ,OAAgBqT,IAChBD,EAAU1R,IAAI2R,EAEtB,GAER,GACJ,CACA,OAAOxa,KAAKkW,KAAK1D,EACrB,EACAsD,EAAY9P,UAAUyU,aAAe,WACjC,OAAOza,KAAKgW,MAAM0E,SAASC,YAAY/N,UAC3C,EACOkJ,CACX,CA/agC,GA8b5B8E,EAA4B,WAC5B,SAASA,EAAWlD,EAASR,QACV,IAAXA,IAAqBA,EAAS,MAClClX,KAAK0X,QAAUA,EACf1X,KAAKkX,OAASA,EACdlX,KAAK6a,EAAI,KACT7a,KAAK8a,cACT,CAmCA,OAlCAF,EAAW5U,UAAU8U,aAAe,WAChC9a,KAAK6a,EAAI7a,KAAK0X,SAAU,UAAQ,KAChC1X,KAAK0a,SAAW,IAAI,IAAKK,EAAA,GAC7B,EACAH,EAAW5U,UAAU8Q,OAAS,SAAUtE,EAAQmC,GAC5C,GAAI3U,KAAK6a,EAAG,CACR7a,KAAK6a,EAAEG,EAAWxI,EAAQmC,IAC1B,IAAIkC,GAAY,QAAuBlC,GACnCkC,IAAclC,GAMd3U,KAAK6a,EAAEG,EAAWxI,EAAQqE,IAE1B7W,KAAKkX,QACLlX,KAAKkX,OAAOJ,OAAOtE,EAAQmC,EAEnC,CACJ,EACAiG,EAAW5U,UAAU8R,MAAQ,SAAUtF,EAAQmC,GACvC3U,KAAK6a,GACL7a,KAAK6a,EAAE/C,MAAMkD,EAAWxI,EAAQmC,GAQb,aAAnBA,EAAgC,SAAW,WAEnD,EACOiG,CACX,CA3C+B,GA4C/B,SAASI,EAAWxI,EAAQmC,GAIxB,OAAOA,EAAiB,IAAMnC,CAClC,CACO,SAASyI,EAA+B3G,EAAO4G,GAC9CC,EAAsB7G,IAStBA,EAAM0B,MAAMc,OAAOoE,EAAU,WAErC,EACA,SAAWpF,GAEP,IAAIsF,EAAsB,SAAUpI,GAEhC,SAASoI,EAAKrP,GACV,IAAIgK,EAAWhK,EAAGgK,SAAU/J,EAAKD,EAAGiI,cAAeA,OAAuB,IAAPhI,GAAuBA,EAAIqP,EAAOtP,EAAGsP,KACpG3K,EAAQsC,EAAOxN,KAAKxF,KAAM+V,EAAU,IAAI6E,EAAW5G,KAAmBhU,KAK1E,OAJA0Q,EAAM4K,MAAQ,IAAIC,EAAM7K,GACxBA,EAAM8K,YAAc,IAAI,IAAKT,EAAA,IACzBM,GACA3K,EAAMhH,QAAQ2R,GACX3K,CACX,CAcA,OAvBA,QAAU0K,EAAMpI,GAUhBoI,EAAKpV,UAAUyV,SAAW,SAAUC,EAASC,GAIzC,OAAO3b,KAAKsb,MAAMG,SAASC,EAASC,EACxC,EACAP,EAAKpV,UAAU4V,YAAc,WAEzB,OAAO5b,IACX,EACAob,EAAKpV,UAAU0S,WAAa,WACxB,OAAO1Y,KAAKwb,YAAYb,YAAY/N,UACxC,EACOwO,CACX,CAzByB,CAyBvBtF,GACFA,EAAYsF,KAAOA,CACtB,CA7BD,CA6BGtF,IAAgBA,EAAc,CAAC,IAGlC,IAAImB,EAAuB,SAAUjE,GAEjC,SAASiE,EAAMxF,EAAIyF,EAAQyE,EAAQ3F,GAC/B,IAAItF,EAAQsC,EAAOxN,KAAKxF,KAAMkX,EAAOnB,SAAUC,IAAUhW,KAMzD,OALA0Q,EAAMe,GAAKA,EACXf,EAAMwG,OAASA,EACfxG,EAAMiL,OAASA,EACfjL,EAAMsF,MAAQA,EACd2F,EAAOjL,GACAA,CACX,CAsEA,OA/EA,QAAUuG,EAAOjE,GAUjBiE,EAAMjR,UAAUyV,SAAW,SAAUC,EAASC,GAC1C,OAAO,IAAI1E,EAAMyE,EAAS1b,KAAM2b,EAAQ3b,KAAKgW,MACjD,EACAiB,EAAMjR,UAAU4V,YAAc,SAAUF,GACpC,IAAIhL,EAAQ1Q,KAERkX,EAASlX,KAAKkX,OAAO0E,YAAYF,GACrC,OAAIA,IAAY1b,KAAKyR,IACbzR,KAAKgW,MAAM0B,SAKXrM,OAAO+D,KAAKpP,KAAKuE,MAAMsJ,SAAQ,SAAU2E,GACrC,IAAIqJ,EAAiBnL,EAAMnM,KAAKiO,GAC5BsJ,EAAoB5E,EAAe,OAAE1E,GACpCsJ,EAQKD,EAUDA,IAAmBC,GAIxBzQ,OAAO+D,KAAKyM,GAAgBhO,SAAQ,SAAU8G,IACrC,OAAMkH,EAAelH,GAAiBmH,EAAkBnH,KACzDjE,EAAMsF,MAAM8B,MAAMtF,EAAQmC,EAElC,KAbAjE,EAAMsF,MAAM8B,MAAMtF,EAAQ,YAC1BnH,OAAO+D,KAAK0M,GAAmBjO,SAAQ,SAAU8G,GAC7CjE,EAAMsF,MAAM8B,MAAMtF,EAAQmC,EAC9B,KAVAjE,EAAMqI,OAAOvG,EAsBrB,IAEG0E,GAGPA,IAAWlX,KAAKkX,OACTlX,KAEJkX,EAAOuE,SAASzb,KAAKyR,GAAIzR,KAAK2b,OACzC,EACA1E,EAAMjR,UAAU4Q,SAAW,WACvB,OAAO,SAAS,QAAS,CAAC,EAAG5W,KAAKkX,OAAON,YAAa5W,KAAKuE,KAC/D,EACA0S,EAAMjR,UAAUkU,gBAAkB,SAAU1H,GACxC,IAAIuJ,EAAa/b,KAAKkX,OAAOgD,gBAAgB1H,GAC7C,OAAO,KAAOhN,KAAKxF,KAAKuE,KAAMiO,IAAU,SAAS,QAAS,CAAC,EAAGuJ,GAAa/I,EAAOhN,UAAUkU,gBAAgB1U,KAAKxF,KAAMwS,IAAWuJ,CACtI,EACA9E,EAAMjR,UAAU0S,WAAa,WAEzB,IADA,IAAI7L,EAAI7M,KAAKkX,OACNrK,EAAEqK,QACLrK,EAAIA,EAAEqK,OACV,OAAOrK,EAAE6L,WAAW3L,MAAMF,EAE1BD,UACJ,EACOqK,CACX,CAjF0B,CAiFxBnB,GAKEyF,EAAuB,SAAUvI,GAEjC,SAASuI,EAAMjB,GACX,OAAOtH,EAAOxN,KAAKxF,KAAM,oBAAqBsa,GAAM,WAAc,GAAG,IAAIM,EAAWN,EAAKtE,MAAM0B,QAAS4C,EAAKtE,SAAWhW,IAC5H,CAaA,OAhBA,QAAUub,EAAOvI,GAIjBuI,EAAMvV,UAAU4V,YAAc,WAE1B,OAAO5b,IACX,EACAub,EAAMvV,UAAU2Q,MAAQ,SAAUS,EAAOC,GAMrC,OAAOrX,KAAKkX,OAAOP,MAAMS,EAAOC,EACpC,EACOkE,CACX,CAlB0B,CAkBxBtE,GACF,SAASQ,EAAsBuE,EAAgBC,EAAgBC,GAC3D,IAAIC,EAAgBH,EAAeE,GAC/BE,EAAgBH,EAAeC,GAMnC,OAAO,OAAMC,EAAeC,GAAiBD,EAAgBC,CACjE,CACO,SAASjB,EAAsB7G,GAElC,SAAUA,aAAiBwB,GAAexB,EAAM0B,MAAM0B,QAC1D,C,eC1lBA,IAAI2E,EAA6B,WAC7B,SAASA,IAGLrc,KAAKsc,MAAQ,IAAKvB,EAAA,GAAgBwB,QAAU5O,KAE5C3N,KAAKwc,KAAO,IAAI,IAAKzB,EAAA,IAGrB/a,KAAKyc,OAAS,IAAIC,QAGlB1c,KAAK2c,WAAa,IAAI1P,IAEtBjN,KAAK4c,MAAQ5c,KAAK6c,MAAM,CAAC,EAC7B,CA+FA,OA9FAR,EAAYrW,UAAU8W,QAAU,SAAU1V,GACtC,OAAO,OAAgBA,IAAUpH,KAAKsc,MAAM7N,IAAIrH,EACpD,EACAiV,EAAYrW,UAAU+W,KAAO,SAAU3V,GACnC,IAAI,OAAgBA,GAAQ,CACxB,IAAI4V,EApFhB,SAAqB5V,GACjB,OAAI,OAAgBA,IACT,OAAQA,GACXA,EAAMvD,MAAM,IACV,QAAS,CAAEuP,UAAW/H,OAAO4R,eAAe7V,IAAUA,GAEzDA,CACX,CA6EuB8V,CAAY9V,GAEvB,OADApH,KAAKyc,OAAO9N,IAAIqO,EAAM5V,GACf4V,CACX,CACA,OAAO5V,CACX,EACAiV,EAAYrW,UAAU6W,MAAQ,SAAUzV,GACpC,IAAIsJ,EAAQ1Q,KACZ,IAAI,OAAgBoH,GAAQ,CACxB,IAAI+V,EAAWnd,KAAKyc,OAAOjO,IAAIpH,GAC/B,GAAI+V,EACA,OAAOA,EAEX,OADY9R,OAAO4R,eAAe7V,IAE9B,KAAK8L,MAAMlN,UACP,GAAIhG,KAAKsc,MAAM7N,IAAIrH,GACf,OAAOA,EACX,IAAIgW,EAAQhW,EAAMmB,IAAIvI,KAAK6c,MAAO7c,MAclC,OAVImP,EAAOnP,KAAKwc,KAAK7B,YAAYyC,IACvBA,QACNpd,KAAKsc,MAAMzT,IAAKsG,EAAKiO,MAAQA,IAIF,IAAvBxK,WAAWC,SACXxH,OAAOgS,OAAOD,IAGfjO,EAAKiO,MAEhB,KAAK,KACL,KAAK/R,OAAOrF,UACR,GAAIhG,KAAKsc,MAAM7N,IAAIrH,GACf,OAAOA,EACX,IAAIkW,EAAUjS,OAAO4R,eAAe7V,GAChCmW,EAAU,CAACD,GACXlO,EAAOpP,KAAKwd,WAAWpW,GAC3BmW,EAAQrd,KAAKkP,EAAKqO,MAClB,IAYItO,EAZAuO,EAAoBH,EAAQzZ,OAahC,GAZAsL,EAAKuO,OAAO9P,SAAQ,SAAU1G,GAC1BoW,EAAQrd,KAAKwQ,EAAMmM,MAAMzV,EAAMD,IACnC,MASIgI,EAAOnP,KAAKwc,KAAK7B,YAAY4C,IACvBtW,OAAQ,CACd,IAAI2W,EAASzO,EAAKlI,OAASoE,OAAO3C,OAAO4U,GACzCtd,KAAKsc,MAAMzT,IAAI+U,GACfxO,EAAKuO,OAAO9P,SAAQ,SAAU1G,EAAKuF,GAC/BkR,EAAMzW,GAAOoW,EAAQG,EAAoBhR,EAC7C,KAI2B,IAAvBkG,WAAWC,SACXxH,OAAOgS,OAAOO,EAEtB,CACA,OAAOzO,EAAKlI,OAGxB,CACA,OAAOG,CACX,EAKAiV,EAAYrW,UAAUwX,WAAa,SAAUlE,GACzC,IAAIlK,EAAO/D,OAAO+D,KAAKkK,GACnBnK,EAAOnP,KAAKwc,KAAK7B,YAAYvL,GACjC,IAAKD,EAAKC,KAAM,CACZA,EAAKsK,OACL,IAAI+D,EAAOhZ,KAAKC,UAAU0K,IACpBD,EAAKC,KAAOpP,KAAK2c,WAAWnO,IAAIiP,KAClCzd,KAAK2c,WAAWhO,IAAI8O,EAAOtO,EAAKC,KAAO,CAAEuO,OAAQvO,EAAMqO,KAAMA,GAErE,CACA,OAAOtO,EAAKC,IAChB,EACOiN,CACX,CA/GgC,GC1DhC,SAASwB,EAAwBrT,GAC7B,MAAO,CACHA,EAAQsK,aACRtK,EAAQ+J,kBACR/J,EAAQgJ,QAGRhJ,EAAQgJ,QAAQS,gBAExB,CACA,IAAI6J,EAA6B,WAC7B,SAASA,EAAY3J,GACjB,IAAIzD,EAAQ1Q,KACZA,KAAK+d,aAAe,IAAKhD,EAAA,GAAgB2B,QAAUzP,KACnDjN,KAAKmU,QAAS,EAAA6J,EAAA,GAAQ7J,EAAQ,CAC1BJ,aAAoC,IAAvBI,EAAOJ,YACpBE,iBAAiB,QAAsBE,KAE3CnU,KAAKie,MAAQ9J,EAAO8J,OAAS,IAAI5B,EAKjCrc,KAAKke,qBAAsB,SAAK,SAAU1T,GACtC,IAAIuB,EACAkI,EAAkBzJ,EAAQgJ,QAAQS,gBAClCkK,EAAWN,EAAwBrT,GAGvC2T,EAAS,IAAMlK,EACf,IAAImK,GAASrS,EAAK2E,EAAMwN,qBAAqBG,KAAKtR,MAAMhB,EAAIoS,GAC5D,OAAIC,EACInK,GACO,SAAS,QAAS,CAAC,EAAGmK,GAAQ,CAGjCnS,OAAQyE,EAAMuN,MAAMpB,MAAMuB,EAAMnS,UAIjCmS,GAEXnD,EAA+BzQ,EAAQgJ,QAAQc,MAAO9J,EAAQ8T,aAAa9J,OAGpE9D,EAAM6N,qBAAqB/T,GACtC,GAAG,CACC8F,IAAKtQ,KAAKmU,OAAOqK,oBACb,IAAW,sCACX,IACJC,QAASZ,EAGTpD,aAAc,SAAU3F,EAAcoC,EAAQ1D,EAASS,GACnD,GAAIkH,EAAsB3H,EAAQc,OAC9B,OAAOd,EAAQc,MAAMmG,aAAa3F,GAAc,QAAYoC,GAAUA,EAAO1C,MAAQ0C,EAAQ1D,EAAQkL,UAAWzK,EAExH,IAEJjU,KAAK2e,yBAA0B,SAAK,SAAUnU,GAE1C,OADAyQ,EAA+BzQ,EAAQgJ,QAAQc,MAAO9J,EAAQ8T,aAAa9J,OACpE9D,EAAMkO,yBAAyBpU,EAC1C,GAAG,CACC8F,IAAKtQ,KAAKmU,OAAOqK,oBACb,IAAW,0CACX,IACJ/D,aAAc,SAAU1O,GACpB,IAAImJ,EAAQnJ,EAAGmJ,MAAOkI,EAAQrR,EAAGqR,MAAO5J,EAAUzH,EAAGyH,QACrD,GAAI2H,EAAsB3H,EAAQc,OAC9B,OAAOd,EAAQc,MAAMmG,aAAavF,EAAOkI,EAAO5J,EAAQkL,UAEhE,GAER,CAyNA,OAxNAZ,EAAY9X,UAAU6Y,WAAa,WAC/B7e,KAAKie,MAAQ,IAAI5B,CACrB,EAKAyB,EAAY9X,UAAU8Y,sBAAwB,SAAU/S,GACpD,IAAIuI,EAAQvI,EAAGuI,MAAO9I,EAAQO,EAAGP,MAAOQ,EAAKD,EAAGyF,OAAQA,OAAgB,IAAPxF,EAAgB,aAAeA,EAAIN,EAAYK,EAAGL,UAAWqT,EAAKhT,EAAGgG,kBAAmBA,OAA2B,IAAPgN,GAAuBA,EAAIC,EAAKjT,EAAGkI,gBAAiBA,OAAyB,IAAP+K,EAAgBhf,KAAKmU,OAAOF,gBAAkB+K,EAC7RjJ,EAAW/V,KAAKmU,OAAO5D,MAAMwF,SACjCrK,GAAY,SAAS,QAAS,CAAC,GAAG,SAAiB,QAAmBF,KAAUE,GAChF,IAOI0G,EAPA6M,GAAU,QAAczN,GACxB0N,EAAalf,KAAKke,oBAAoB,CACtCpJ,cAAc,QAAkBtJ,GAAOsJ,aACvCP,kBAAmB0K,EACnBX,aAAcW,EACdzL,SAAS,QAAS,CAAEc,MAAOA,EAAO9I,MAAOA,EAAOuK,SAAUA,EAAUrK,UAAWA,EAAWgT,WAAW,EAAAS,EAAA,GAAmBzT,GAAYuI,gBAAiBA,IAAmB,QAAuBzI,EAAOxL,KAAKmU,OAAOmB,cAGtN,GAAI4J,EAAW9M,UAKXA,EAAU,CACN,IAAI,IAAkBgN,EAAaF,EAAW9M,SAAU8M,EAAW9M,QAAS5G,EAAOE,KAElFqG,GACD,MAAMK,EAAQ,GAGtB,MAAO,CACHnG,OAAQiT,EAAWjT,OACnBI,UAAW+F,EACXA,QAASA,EAEjB,EACA0L,EAAY9X,UAAUqZ,QAAU,SAAUpT,EAAQiL,EAAQpC,EAActB,GACpE,GAAI2H,EAAsB3H,EAAQc,QAC9BtU,KAAK+d,aAAavP,IAAIvC,KAAY6I,EAAc,CAChD,IAAIwK,EAAStf,KAAKke,oBAAoBG,KAAKvJ,EAAcoC,EAAQ1D,EAIjExT,KAAKie,MAAMnB,QAAQ7Q,IACnB,GAAIqT,GAAUrT,IAAWqT,EAAOrT,OAC5B,OAAO,CAEf,CACA,OAAO,CACX,EAEA6R,EAAY9X,UAAUuY,qBAAuB,SAAUxS,GACnD,IAAI2E,EAAQ1Q,KACR8U,EAAe/I,EAAG+I,aAAcP,EAAoBxI,EAAGwI,kBAAmB+J,EAAevS,EAAGuS,aAAc9K,EAAUzH,EAAGyH,QAC3H,IAAI,QAAYe,KACXf,EAAQuC,SAASiB,kBAAkBzC,EAAkBC,SACrDhB,EAAQc,MAAM7F,IAAI8F,EAAkBC,OACrC,MAAO,CACHvI,OAAQjM,KAAKie,MAAMrB,MACnBxK,QAAS,iCAAiCwB,OAAOW,EAAkBC,MAAO,YAGlF,IAGIpC,EAHA1G,EAAY8H,EAAQ9H,UAAWqK,EAAWvC,EAAQuC,SAClDiD,EADoExF,EAAQc,MAC3D6B,cAAc5B,EAAmB,cAClDgL,EAAiB,GAEjBC,EAAgB,IAAI,KASxB,SAASC,EAAcxT,EAAQyT,GAC3B,IAAI3T,EAMJ,OALIE,EAAOmG,UACPA,EAAUoN,EAAc7I,MAAMvE,IAAUrG,EAAK,CAAC,GACvC2T,GAAczT,EAAOmG,QACxBrG,KAEDE,EAAOA,MAClB,CAhBIjM,KAAKmU,OAAOJ,aACQ,kBAAbiF,IACNjD,EAAS4J,kBAAkB3G,IAI5BuG,EAAerf,KAAK,CAAEuT,WAAYuF,IAWtC,IAAI9J,EAAU,IAAIvB,IAAImH,EAAaG,YACnC/F,EAAQrB,SAAQ,SAAU+R,GACtB,IAAI7T,EAAIC,EAGR,IAAK,QAAc4T,EAAWlU,GAE9B,IAAI,QAAQkU,GAAY,CACpB,IAAIrH,EAAaxC,EAASsC,UAAU,CAChCxB,UAAW+I,EAAU9V,KAAK1C,MAC1B8N,MAAO0K,EACPlU,UAAW8H,EAAQ9H,UACnBmG,KAAM0C,GACPf,GACCkM,GAAa,QAAuBE,QACrB,IAAfrH,EACK,KAAsBsH,MAAMD,KAC7BxN,EAAUoN,EAAc7I,MAAMvE,IAAUrG,EAAK,CAAC,GACvC2T,GAAc,qBAAqB9L,OAAOgM,EAAU9V,KAAK1C,MAAO,SAASwM,QAAO,QAAYW,GAC3FA,EAAkBC,MAAQ,UACxB,UAAY/P,KAAKC,UAAU6P,EAAmB,KAAM,IAC1DxI,MAGH,OAAQwM,GACTA,EAAWzU,OAAS,IACpByU,EAAakH,EAAc/O,EAAMiO,wBAAwB,CACrDzJ,MAAO0K,EACPxC,MAAO7E,EACP+F,aAAcA,EACd9K,QAASA,IACTkM,IAGFE,EAAU9K,aASG,MAAdyD,IAILA,EAAakH,EAAc/O,EAAMwN,oBAAoB,CACjDpJ,aAAc8K,EAAU9K,aACxBP,kBAAmBgE,EACnB+F,cAAc,QAAY/F,GAAcA,EAAa+F,EACrD9K,QAASA,IACTkM,IAbAlM,EAAQS,kBACRsE,EAAa7H,EAAMuN,MAAMlB,KAAKxE,SAcnB,IAAfA,GACAgH,EAAerf,OAAM8L,EAAK,CAAC,GAAM0T,GAAcnH,EAAYvM,GAEnE,KACK,CACD,IAAI4F,GAAW,QAAyBgO,EAAWpM,EAAQgC,gBAC3D,IAAK5D,GAAYgO,EAAU7R,OAAS,IAAK+R,gBACrC,MAAM,QAAkB,EAAGF,EAAU9V,KAAK1C,OAE1CwK,GAAYmE,EAASgK,gBAAgBnO,EAAUoH,IAC/CpH,EAASkD,aAAaG,WAAWpH,QAAQqB,EAAQrG,IAAKqG,EAE9D,CACJ,IACA,IACI8Q,EAAc,CAAE/T,QADP,EAAAgU,EAAA,IAAeV,GACQnN,QAASA,GACzC8N,EAAS1M,EAAQS,gBACjBjU,KAAKie,MAAMpB,MAAMmD,IAGf,EAAA5J,EAAA,GAAgB4J,GAMtB,OAHIE,EAAOjU,QACPjM,KAAK+d,aAAapP,IAAIuR,EAAOjU,OAAQ6I,GAElCoL,CACX,EAEApC,EAAY9X,UAAU4Y,yBAA2B,SAAU7S,GACvD,IAEIqG,EAFA1B,EAAQ1Q,KACRkV,EAAQnJ,EAAGmJ,MAAOkI,EAAQrR,EAAGqR,MAAOkB,EAAevS,EAAGuS,aAAc9K,EAAUzH,EAAGyH,QAEjFgM,EAAgB,IAAI,KACxB,SAASC,EAAcU,EAAazT,GAChC,IAAIX,EAIJ,OAHIoU,EAAY/N,UACZA,EAAUoN,EAAc7I,MAAMvE,IAAUrG,EAAK,CAAC,GAAMW,GAAKyT,EAAY/N,QAASrG,KAE3EoU,EAAYlU,MACvB,CAgCA,OA/BIiJ,EAAMJ,eACNsI,EAAQA,EAAMnV,OAAOuL,EAAQc,MAAM+B,UAEvC+G,EAAQA,EAAM7U,KAAI,SAAUyM,EAAMtI,GAE9B,OAAa,OAATsI,EACO,MAGP,OAAQA,GACDyK,EAAc/O,EAAMiO,wBAAwB,CAC/CzJ,MAAOA,EACPkI,MAAOpI,EACPsJ,aAAcA,EACd9K,QAASA,IACT9G,GAGJwI,EAAMJ,aACC2K,EAAc/O,EAAMwN,oBAAoB,CAC3CpJ,aAAcI,EAAMJ,aACpBP,kBAAmBS,EACnBsJ,cAAc,QAAYtJ,GAAQA,EAAOsJ,EACzC9K,QAASA,IACT9G,KAEmB,IAAvBkG,WAAWC,SAyB3B,SAAsCyB,EAAOY,EAAOqD,GAChD,IAAKrD,EAAMJ,aAAc,CACrB,IAAIyF,EAAY,IAAI5M,IAAI,CAAC4K,IACzBgC,EAAU1M,SAAQ,SAAUzG,IACpB,OAAgBA,MAChB,UACK,QAAYA,GACb,IACA,QAA2BkN,EAAOlN,GAClC8N,EAAMpL,KAAK1C,OAEfiE,OAAO+U,OAAOhZ,GAAOyG,QAAQ0M,EAAU1R,IAAK0R,GAEpD,GACJ,CACJ,CAvCgB8F,CAA6B7M,EAAQc,MAAOY,EAAOF,GAEhDA,EACX,IACO,CACH/I,OAAQuH,EAAQS,gBAAkBjU,KAAKie,MAAMpB,MAAMO,GAASA,EAC5DhL,QAASA,EAEjB,EACO0L,CACX,CAzRgC,GA2RhC,SAASsB,EAAakB,GAClB,IACI7b,KAAKC,UAAU4b,GAAM,SAAUC,EAAGnZ,GAC9B,GAAqB,kBAAVA,EACP,MAAMA,EACV,OAAOA,CACX,GACJ,CACA,MAAO6E,GACH,OAAOA,CACX,CACJ,C,qCCrTIuU,EAAqBnV,OAAO3C,OAAO,MACvC,SAAS+X,EAAoBC,GAIzB,IAAI7R,EAAWpK,KAAKC,UAAUgc,GAC9B,OAAQF,EAAmB3R,KACtB2R,EAAmB3R,GAAYxD,OAAO3C,OAAO,MACtD,CACO,SAASiY,EAAyBC,GACrC,IAAIC,EAAOJ,EAAoBG,GAC/B,OAAQC,EAAKC,cAAgBD,EAAKC,YAAc,SAAU7Z,EAAQuM,GAC1D,IAAI6F,EAAU,SAAUxH,EAAM1K,GAC1B,OAAOqM,EAAQ6E,UAAUlR,EAAK0K,EAClC,EACI8B,EAAaH,EAAQG,UAAYoN,EAAsBH,GAAW,SAAUI,GAC5E,IAAIC,EAAYC,EAAe1N,EAAQuD,YAAaiK,EAIpD3H,GAgBA,YAfkB,IAAd4H,GACAha,IAAWuM,EAAQuD,aACnB,KAAOvR,KAAKyB,EAAQ+Z,EAAc,MAUlCC,EAAYC,EAAeja,EAAQ+Z,EAAeG,KAEtD,aAAwB,IAAdF,EAAsB,EAAGD,EAAcI,KAAK,KAAMna,GACrDga,CACX,IACA,MAAO,GAAGrN,OAAOJ,EAAQwF,SAAU,KAAKpF,OAAOnP,KAAKC,UAAUiP,GAClE,EACR,CAQO,SAAS0N,EAAuBT,GACnC,IAAIC,EAAOJ,EAAoBG,GAC/B,OAAQC,EAAKS,YACRT,EAAKS,UAAY,SAAUpY,EAAM6C,GAC9B,IAAImJ,EAAQnJ,EAAGmJ,MAAOxJ,EAAYK,EAAGL,UAAWmL,EAAY9K,EAAG8K,UAC3D0K,EAAYR,EAAsBH,GAAW,SAAUY,GACvD,IAAIC,EAAWD,EAAQ,GACnBE,EAAYD,EAASE,OAAO,GAChC,GAAkB,MAAdD,EA4BJ,GAAkB,MAAdA,GAYJ,GAAIxY,EACA,OAAOgY,EAAehY,EAAMsY,OAbhC,CACI,IAAII,EAAeH,EAAS5d,MAAM,GAClC,GAAI6H,GAAa,KAAOlG,KAAKkG,EAAWkW,GAAe,CACnD,IAAIC,EAAaL,EAAQ3d,MAAM,GAE/B,OADAge,EAAW,GAAKD,EACTV,EAAexV,EAAWmW,EACrC,CAKJ,MAtCI,GAAI3M,IAAS,OAAgBA,EAAM4M,YAAa,CAC5C,IAAIC,EAAkBN,EAAS5d,MAAM,GAIjCgX,EAAI3F,EAAM4M,WAAWE,MAAK,SAAUnH,GAAK,OAAOA,EAAE/Q,KAAK1C,QAAU2a,CAAiB,IAElFE,EAAgBpH,IAAK,QAAyBA,EAAGnP,GAQrD,OAAQuW,GACJf,EAAee,EAIfT,EAAQ3d,MAAM,GACtB,CAqBR,IACIqe,EAASzd,KAAKC,UAAU6c,GAS5B,OAHIrY,GAAmB,OAAXgZ,KACRrL,GAAa,IAAMqL,GAEhBrL,CACX,EACR,CACO,SAASkK,EAAsBH,EAAWuB,GAG7C,IAAIC,EAAS,IAAI,KACjB,OAAOC,EAAkBzB,GAAW0B,QAAO,SAAUf,EAAWtO,GAC5D,IAAIlH,EACAwW,EAAUJ,EAAUlP,GACxB,QAAgB,IAAZsP,EAAoB,CAGpB,IAAK,IAAI7V,EAAIuG,EAAKnP,OAAS,EAAG4I,GAAK,IAAKA,GACzBX,EAAK,CAAC,GAAMkH,EAAKvG,IAAM6V,EAAlCA,EAA2CxW,EAE/CwV,EAAYa,EAAOzL,MAAM4K,EAAWgB,EACxC,CACA,OAAOhB,CACX,GAAGlW,OAAO3C,OAAO,MACrB,CACO,SAAS2Z,EAAkB3B,GAC9B,IAAIG,EAAOJ,EAAoBC,GAC/B,IAAKG,EAAK2B,MAAO,CACb,IAAIC,EAAW5B,EAAK2B,MAAQ,GACxBE,EAAgB,GACpBhC,EAAK7S,SAAQ,SAAU3F,EAAGwE,IAClB,OAAQxE,IACRma,EAAkBna,GAAG2F,SAAQ,SAAUhB,GAAK,OAAO4V,EAAQviB,KAAKwiB,EAAc9O,OAAO/G,GAAK,IAC1F6V,EAAc5e,OAAS,IAGvB4e,EAAcxiB,KAAKgI,IACd,OAAQwY,EAAKhU,EAAI,MAClB+V,EAAQviB,KAAKwiB,EAAc7e,MAAM,IACjC6e,EAAc5e,OAAS,GAGnC,GACJ,CACA,OAAO+c,EAAK2B,KAChB,CACA,SAASrB,EAAWla,EAAQE,GACxB,OAAOF,EAAOE,EAClB,CACO,SAAS+Z,EAAeja,EAAQgM,EAAMoG,GAazC,OADAA,EAAUA,GAAW8H,EACd9T,EAAU4F,EAAKqP,QAAO,SAASK,EAAQrJ,EAAKnS,GAC/C,OAAO,OAAQmS,GACXA,EAAI/Q,KAAI,SAAUiS,GAAS,OAAOmI,EAAQnI,EAAOrT,EAAM,IACrDmS,GAAOD,EAAQC,EAAKnS,EAC9B,GAAGF,GACP,CACA,SAASoG,EAAUjG,GAIf,OAAI,OAAgBA,IACZ,OAAQA,GACDA,EAAMmB,IAAI8E,GAEd0T,EAAsB1V,OAAO+D,KAAKhI,GAAOsS,QAAQ,SAAUzG,GAC9D,OAAOiO,EAAe9Z,EAAO6L,EACjC,IAEG7L,CACX,CCxLA,SAASwb,GAAuBlC,GAC5B,YAAsB,IAAdA,EAAKxX,KAAkBwX,EAAKxX,KAC9BwX,EAAKxL,OAAQ,QAAyBwL,EAAKxL,MAAOwL,EAAKhV,WACnD,IACd,CACA,IAAImX,GAAkB,WAA6B,EAC/CC,GAAkB,SAAUC,EAAOvP,GAAW,OAAOA,EAAQqD,SAAW,EAGxEmM,GAAc,SAAU1L,EAAUC,EAAUxL,GAE5C,OAAOkX,EADYlX,EAAGkX,cACF3L,EAAUC,EAClC,EACI2L,GAAe,SAAU3C,EAAGhJ,GAAY,OAAOA,CAAU,EACzD4L,GAA0B,WAC1B,SAASA,EAAShP,GACdnU,KAAKmU,OAASA,EACdnU,KAAKojB,aAAe/X,OAAO3C,OAAO,MAClC1I,KAAKqjB,UAAYhY,OAAO3C,OAAO,MAK/B1I,KAAKsjB,aAAe,IAAIrW,IAKxBjN,KAAKujB,cAAgB,IAAItW,IACzBjN,KAAK2f,kBAAoBtU,OAAO3C,OAAO,MACvC1I,KAAKgX,kBAAoB3L,OAAO3C,OAAO,MACvC1I,KAAKwjB,oBAAqB,EAC1BxjB,KAAKmU,QAAS,QAAS,CAAEL,iBAAkB,MAA2BK,GACtEnU,KAAKuQ,MAAQvQ,KAAKmU,OAAO5D,MACzBvQ,KAAKyjB,gBAAgB,SACrBzjB,KAAKyjB,gBAAgB,YACrBzjB,KAAKyjB,gBAAgB,gBACjBtP,EAAOuP,eACP1jB,KAAK2jB,iBAAiBxP,EAAOuP,eAE7BvP,EAAOiP,cACPpjB,KAAK4jB,gBAAgBzP,EAAOiP,aAEpC,CA2cA,OA1cAD,EAASnd,UAAUmL,SAAW,SAAUlK,EAAQ4c,GAC5C,IAAI9X,EACAgK,EAAW/V,KACXgZ,EAAY6K,IACXA,EAAe7K,WAAmD,QAArCjN,EAAK8X,EAAe9M,mBAAgC,IAAPhL,OAAgB,EAASA,EAAG0H,cACvGxM,EAAOwM,WAMX,GAAIuF,IAAahZ,KAAKgX,kBAAkB8M,WACpC,MAAO,CAAC,cAeZ,IAZA,IASIrS,EATAsF,EAAe8M,GAAkBA,EAAe9M,aAAgB9P,EAChEuM,GAAU,SAAS,QAAS,CAAC,EAAGqQ,GAAiB,CAAE7K,SAAUA,EAAUjC,YAAaA,EAAasB,UAAYwL,GAAkBA,EAAexL,WAC1I,WACI,IAAI7N,EAAUuZ,GAA0BnX,UAAWmK,GACnD,OAAOhB,EAASsC,UAAU7N,EAAS,CAC/B8J,MAAOyB,EAASxF,MAAY,KAC5B7E,UAAWlB,EAAQkB,WAE3B,IAEJsY,EAAShL,GAAYhZ,KAAKikB,cAAcjL,GACxCkL,EAASF,GAAUA,EAAOE,OAAUlkB,KAAKmU,OAAOL,iBAC7CoQ,GAAO,CACV,IAAIC,EAAgBD,GAAM,SAAS,QAAS,CAAC,EAAGjd,GAAS8P,GAAcvD,GACvE,KAAI,OAAQ2Q,GAGP,CACD1S,EAAK0S,EACL,KACJ,CALID,EAAQvD,EAAyBwD,EAMzC,CAEA,OADA1S,EAAKA,EAAK2S,OAAO3S,QAAM,EAChB+B,EAAQG,UAAY,CAAClC,EAAI+B,EAAQG,WAAa,CAAClC,EAC1D,EACA0R,EAASnd,UAAU4d,gBAAkB,SAAUR,GAC3C,IAAI1S,EAAQ1Q,KACZqL,OAAO+D,KAAKgU,GAAcvV,SAAQ,SAAUmL,GACxC,IAAIjN,EAAKqX,EAAapK,GAAWqL,EAAYtY,EAAGsY,UAAWC,EAAevY,EAAGuY,aAAcC,EAAmBxY,EAAGwY,iBAAkBhN,GAAW,QAAOxL,EAAI,CAAC,YAAa,eAAgB,qBAenLsY,GACA3T,EAAM+S,gBAAgB,QAASzK,GAC/BsL,GACA5T,EAAM+S,gBAAgB,WAAYzK,GAClCuL,GACA7T,EAAM+S,gBAAgB,eAAgBzK,GACtC,KAAOxT,KAAKkL,EAAM2S,UAAWrK,GAC7BtI,EAAM2S,UAAUrK,GAAU9Y,KAAKqX,GAG/B7G,EAAM2S,UAAUrK,GAAY,CAACzB,EAErC,GACJ,EACA4L,EAASnd,UAAUwe,iBAAmB,SAAUxL,EAAUzB,GACtD,IAAI7G,EAAQ1Q,KACRsX,EAAWtX,KAAKikB,cAAcjL,GAC9ByL,EAAYlN,EAASkN,UAAW1M,EAASR,EAASQ,OACtD,SAAS2M,EAASpN,EAAUX,GACxBW,EAASX,MACY,oBAAVA,EAAuBA,GAGd,IAAVA,EAAiBqM,IAGH,IAAVrM,EAAkBuM,GACd5L,EAASX,KAC/B,CAGA+N,EAASpN,EAAUC,EAASZ,OAC5BW,EAAS4M,OAES,IAAdO,EAAsB5B,IAGhB,OAAQ4B,GAAa9D,EAAyB8D,GAErB,oBAAdA,EAA2BA,EAE9BnN,EAAS4M,MACvBnM,GACA1M,OAAO+D,KAAK2I,GAAQlK,SAAQ,SAAUgJ,GAClC,IAAIS,EAAW5G,EAAMiU,eAAe3L,EAAUnC,GAAW,GACrDU,EAAWQ,EAAOlB,GACtB,GAAwB,oBAAbU,EACPD,EAAS/F,KAAOgG,MAEf,CACD,IAAIkH,EAAUlH,EAASkH,QAASlN,EAAOgG,EAAShG,KAAMoF,EAAQY,EAASZ,MACvEW,EAAS4M,OAGO,IAAZzF,EAAoBqE,IAGd,OAAQrE,GAAW4C,EAAuB5C,GAEnB,oBAAZA,EAAyBA,EAE5BnH,EAAS4M,MACP,oBAAT3S,IACP+F,EAAS/F,KAAOA,GAEpBmT,EAASpN,EAAUX,EACvB,CACIW,EAAS/F,MAAQ+F,EAASX,QAM1BW,EAAS4M,MAAQ5M,EAAS4M,OAASpB,GAE3C,GAER,EACAK,EAASnd,UAAUyd,gBAAkB,SAAUmB,EAAO5L,QACjC,IAAbA,IAAuBA,EAAW4L,GACtC,IAAIpT,EAAS,QAAUoT,EAAMC,cACzBC,EAAM9kB,KAAKgX,kBAAkBxF,GAC7BwH,IAAa8L,KACb,SAAWA,GAAOA,IAAQF,EAAO,EAAGA,GAGhCE,UACO9kB,KAAK2f,kBAAkBmF,GAElC9kB,KAAK2f,kBAAkB3G,GAAYxH,EAEnCxR,KAAKgX,kBAAkBxF,GAAUwH,EAEzC,EACAmK,EAASnd,UAAU2d,iBAAmB,SAAUD,GAC5C,IAAIhT,EAAQ1Q,KACZA,KAAKwjB,oBAAqB,EAC1BnY,OAAO+D,KAAKsU,GAAe7V,SAAQ,SAAUkX,GAIzCrU,EAAMsU,gBAAgBD,GAAW,GACjCrB,EAAcqB,GAAWlX,SAAQ,SAAUoX,GACvCvU,EAAMsU,gBAAgBC,GAAS,GAAMpc,IAAIkc,GACzC,IAAInQ,EAAQqQ,EAAQrQ,MAAM,MACrBA,GAASA,EAAM,KAAOqQ,GAEvBvU,EAAM6S,cAAc5U,IAAIsW,EAAS,IAAIC,OAAOD,GAEpD,GACJ,GACJ,EACA9B,EAASnd,UAAUie,cAAgB,SAAUjL,GACzC,IAAItI,EAAQ1Q,KACZ,IAAK,KAAOwF,KAAKxF,KAAKojB,aAAcpK,GAAW,CAC3C,IAAImM,EAAYnlB,KAAKojB,aAAapK,GAAY3N,OAAO3C,OAAO,MAC5Dyc,EAASpN,OAAS1M,OAAO3C,OAAO,MAsBhC,IAAI0c,EAAeplB,KAAKsjB,aAAa9U,IAAIwK,IACpCoM,GAAgBplB,KAAKujB,cAAc8B,OAIpCD,EAAeplB,KAAKglB,gBAAgBhM,GAAU,GAM9ChZ,KAAKujB,cAAc1V,SAAQ,SAAUyX,EAAQC,GACzC,GAAID,EAAOhc,KAAK0P,GAAW,CAIvB,IAAIwM,EAAkB9U,EAAM4S,aAAa9U,IAAI+W,GACzCC,GACAA,EAAgB3X,SAAQ,SAAUkX,GAC9B,OAAOK,EAAavc,IAAIkc,EAC5B,GAER,CACJ,KAEAK,GAAgBA,EAAaC,MAC7BD,EAAavX,SAAQ,SAAUkX,GAC3B,IAAIhZ,EAAK2E,EAAMuT,cAAcc,GAAYhN,EAAShM,EAAGgM,OAAQ0N,GAAO,QAAO1Z,EAAI,CAAC,WAChFV,OAAOC,OAAO6Z,EAAUM,GACxBpa,OAAOC,OAAO6Z,EAASpN,OAAQA,EACnC,GAER,CACA,IAAI2N,EAAQ1lB,KAAKqjB,UAAUrK,GAQ3B,OAPI0M,GAASA,EAAM5hB,QAGf4hB,EAAMC,OAAO,GAAG9X,SAAQ,SAAUmW,GAC9BtT,EAAM8T,iBAAiBxL,EAAUgL,EACrC,IAEGhkB,KAAKojB,aAAapK,EAC7B,EACAmK,EAASnd,UAAU2e,eAAiB,SAAU3L,EAAUnC,EAAW+O,GAC/D,GAAI5M,EAAU,CACV,IAAI6M,EAAgB7lB,KAAKikB,cAAcjL,GAAUjB,OACjD,OAAQ8N,EAAchP,IACjB+O,IAAoBC,EAAchP,GAAaxL,OAAO3C,OAAO,MACtE,CACJ,EACAya,EAASnd,UAAUgf,gBAAkB,SAAUC,EAASW,GACpD,IAAIE,EAAe9lB,KAAKsjB,aAAa9U,IAAIyW,GAIzC,OAHKa,GAAgBF,GACjB5lB,KAAKsjB,aAAa3U,IAAIsW,EAAUa,EAAe,IAAInY,KAEhDmY,CACX,EACA3C,EAASnd,UAAU+Z,gBAAkB,SAAUnO,EAAUoH,EAAU/M,EAAQP,GACvE,IAAIgF,EAAQ1Q,KACZ,IAAK4R,EAASmU,cACV,OAAO,EAGX,IAAK/M,EACD,OAAO,EACX,IAAI+L,EAAYnT,EAASmU,cAAcjc,KAAK1C,MAE5C,GAAI4R,IAAa+L,EACb,OAAO,EACX,GAAI/kB,KAAKwjB,oBAAsBxjB,KAAKsjB,aAAa7U,IAAIsW,GAqBjD,IApBA,IAAIiB,EAAuBhmB,KAAKglB,gBAAgBhM,GAAU,GACtDiN,EAAc,CAACD,GACfE,EAAiB,SAAUjB,GAC3B,IAAIa,EAAepV,EAAMsU,gBAAgBC,GAAS,GAC9Ca,GACAA,EAAaT,MACbY,EAAYliB,QAAQ+hB,GAAgB,GACpCG,EAAY/lB,KAAK4lB,EAEzB,EAOIK,KAA8Bla,IAAUjM,KAAKujB,cAAc8B,MAC3De,GAAwB,EAGnB1Z,EAAI,EAAGA,EAAIuZ,EAAYniB,SAAU4I,EAAG,CACzC,IAAIoZ,EAAeG,EAAYvZ,GAC/B,GAAIoZ,EAAarX,IAAIsW,GAWjB,OAVKiB,EAAqBvX,IAAIsW,KACtBqB,IACuB,IAAvBxT,WAAWC,SAAqB,KAAUnE,KAAK,EAAGsK,EAAU+L,GAMhEiB,EAAqBnd,IAAIkc,KAEtB,EAEXe,EAAajY,QAAQqY,GACjBC,GAGAzZ,IAAMuZ,EAAYniB,OAAS,IAK3B,QAA0B8N,EAASkD,aAAc7I,EAAQP,KAIzDya,GAA2B,EAC3BC,GAAwB,EAKxBpmB,KAAKujB,cAAc1V,SAAQ,SAAUyX,EAAQe,GACzC,IAAIzR,EAAQoE,EAASpE,MAAM0Q,GACvB1Q,GAASA,EAAM,KAAOoE,GACtBkN,EAAeG,EAEvB,IAER,CAEJ,OAAO,CACX,EACAlD,EAASnd,UAAU6R,WAAa,SAAUmB,EAAUnC,GAChD,IAAImN,EAAShkB,KAAK2kB,eAAe3L,EAAUnC,GAAW,GACtD,SAAUmN,IAAUA,EAAOE,MAC/B,EACAf,EAASnd,UAAUiT,kBAAoB,SAAUqN,GAC7C,IAEI3R,EAFAqE,EAAWsN,EAAUtN,SAAUnC,EAAYyP,EAAUzP,UACrDmN,EAAShkB,KAAK2kB,eAAe3L,EAAUnC,GAAW,GAElDqN,EAAQF,GAAUA,EAAOE,MAC7B,GAAIA,GAASlL,EAQT,IAPA,IAAIxF,EAAU,CACVwF,SAAUA,EACVnC,UAAWA,EACX3B,MAAOoR,EAAUpR,OAAS,KAC1BxJ,UAAW4a,EAAU5a,WAErBxC,EAAO0Z,GAAuB0D,GAC3BpC,GAAO,CACV,IAAIqC,EAAoBrC,EAAMhb,EAAMsK,GACpC,KAAI,OAAQ+S,GAGP,CAGD5R,EAAiB4R,GAAqB1P,EACtC,KACJ,CAPIqN,EAAQ7C,EAAuBkF,EAQvC,CAUJ,YARuB,IAAnB5R,IACAA,EACI2R,EAAUpR,OACN,QAAsBoR,EAAUpR,MAAOoR,EAAU5a,YAC/C,QAAgBmL,EAAW+L,GAAuB0D,MAIzC,IAAnB3R,EACOkC,EAKJA,KAAc,QAAuBlC,GAAkBA,EACxDkC,EAAY,IAAMlC,CAC5B,EACAwO,EAASnd,UAAUqS,UAAY,SAAU7N,EAASgJ,GAC9C,IAAIe,EAAoB/J,EAAQqH,KAChC,GAAK0C,IAEa/J,EAAQ0K,OAAS1K,EAAQqM,WAC3C,CAEA,QAAyB,IAArBrM,EAAQwO,SAAqB,CAC7B,IAAIA,EAAWxF,EAAQc,MAAM6B,cAAc5B,EAAmB,cAC1DyE,IACAxO,EAAQwO,SAAWA,EAC3B,CACA,IAAIrE,EAAiB3U,KAAKiZ,kBAAkBzO,GACxCqM,GAAY,QAAuBlC,GACnC2C,EAAW9D,EAAQc,MAAM6B,cAAc5B,EAAmBI,GAC1DqP,EAAShkB,KAAK2kB,eAAena,EAAQwO,SAAUnC,GAAW,GAC1DtF,EAAOyS,GAAUA,EAAOzS,KAC5B,GAAIA,EAAM,CACN,IAAIiV,EAAcC,GAAyBzmB,KAAMuU,EAAmB/J,EAASgJ,EAASA,EAAQc,MAAMoE,YAAW,QAAYnE,GACvHA,EAAkBC,MAChBD,EAAmBI,IAEzB,OAAO,KAAU+R,UAAU1mB,KAAKuQ,MAAOgB,EAAM,CACzC+F,EACAkP,GAER,CACA,OAAOlP,CArBG,CAsBd,EACA6L,EAASnd,UAAU2gB,gBAAkB,SAAU3N,EAAUnC,GACrD,IAAImN,EAAShkB,KAAK2kB,eAAe3L,EAAUnC,GAAW,GACtD,OAAOmN,GAAUA,EAAOzS,IAC5B,EACA4R,EAASnd,UAAU4gB,iBAAmB,SAAUC,EAAgBhQ,EAAWiQ,GACvE,IAAI9C,EAAShkB,KAAK2kB,eAAekC,EAAgBhQ,GAAW,GACxDF,EAAQqN,GAAUA,EAAOrN,MAK7B,OAJKA,GAASmQ,IAEVnQ,GADAqN,EAAShkB,KAAKikB,cAAc6C,KACV9C,EAAOrN,OAEtBA,CACX,EACAwM,EAASnd,UAAU+gB,iBAAmB,SAAUzP,EAAUC,EAAUxL,EAAIyH,EAASiF,GAC7E,IAAIvD,EAAQnJ,EAAGmJ,MAAO8D,EAAWjN,EAAGiN,SAAUrC,EAAQ5K,EAAG4K,MACzD,OAAIA,IAAUqM,GAIHgE,GAAyBxT,EAAQc,MAAjC0S,CAAwC1P,EAAUC,GAEzDZ,IAAUuM,GAEH3L,GAMP/D,EAAQyT,YACR3P,OAAW,GAERX,EAAMW,EAAUC,EAAUkP,GAAyBzmB,UAY1D,EAAQ,CACJgZ,SAAUA,EACVnC,UAAW3B,EAAMpL,KAAK1C,MACtB8N,MAAOA,EACPxJ,UAAW8H,EAAQ9H,WACpB8H,EAASiF,GAAWpN,OAAO3C,OAAO,QACzC,EACOya,CACX,CAze6B,GA2e7B,SAASsD,GAAyB1Q,EAAUxB,EAAmB+R,EAAW9S,EAASiF,GAC/E,IAAI9D,EAAiBoB,EAASkD,kBAAkBqN,GAC5CzP,GAAY,QAAuBlC,GACnCjJ,EAAY4a,EAAU5a,WAAa8H,EAAQ9H,UAC3CK,EAAKyH,EAAQc,MAAOiC,EAAcxK,EAAGwK,YAAaF,EAAUtK,EAAGsK,QACnE,MAAO,CACHnN,KAAM0Z,GAAuB0D,GAC7BpR,MAAOoR,EAAUpR,OAAS,KAC1B2B,UAAWA,EACXlC,eAAgBA,EAChBjJ,UAAWA,EACX0M,YAAa,KACb7B,YAAaA,EACbkC,QAASA,EACTlI,MAAOwF,EAASxF,MAChB8F,QAASA,EACTgC,UAAW,WACP,OAAOtC,EAASsC,UAAU0L,GAA0BnX,UAAW2H,EAAmB7I,GAAY8H,EAClG,EACAyP,aAAc+D,GAAyBxT,EAAQc,OAEvD,CACO,SAASyP,GAA0BmD,EAAe3S,EAAmB7I,GACxE,IACIlB,EADA8N,EAAqB4O,EAAc,GAAIrV,EAAOqV,EAAc,GAAIC,EAAOD,EAAcpjB,OAyBzF,MAvBkC,kBAAvBwU,EACP9N,EAAU,CACNqM,UAAWyB,EAIXzG,KAAMsV,EAAO,EAAItV,EAAO0C,IAI5B/J,GAAU,QAAS,CAAC,EAAG8N,GAGlB,KAAO9S,KAAKgF,EAAS,UACtBA,EAAQqH,KAAO0C,KAGI,IAAvB3B,WAAWC,cAAsC,IAAjBrI,EAAQqH,OACjB,IAAvBe,WAAWC,SAAqB,KAAUnE,KAAK,GAAG,EAAA0Y,EAAA,GAAoBlU,MAAMrB,KAAKqV,UAEjF,IAAW1c,EAAQkB,YACnBlB,EAAQkB,UAAYA,GAEjBlB,CACX,CACA,SAASwc,GAAyB1S,GAC9B,OAAO,SAAsBgD,EAAUC,GACnC,IAAI,OAAQD,KAAa,OAAQC,GAC7B,MAAM,QAAkB,GAM5B,IAAI,OAAgBD,KAAa,OAAgBC,GAAW,CACxD,IAAI8P,EAAQ/S,EAAM6B,cAAcmB,EAAU,cACtCgQ,EAAQhT,EAAM6B,cAAcoB,EAAU,cAE1C,GADkB8P,GAASC,GAASD,IAAUC,EAE1C,OAAO/P,EAEX,IAAI,QAAYD,KAAa,QAAwBC,GAKjD,OADAjD,EAAMqC,MAAMW,EAAS9C,MAAO+C,GACrBD,EAEX,IAAI,QAAwBA,KAAa,QAAYC,GAMjD,OADAjD,EAAMqC,MAAMW,EAAUC,EAAS/C,OACxB+C,EAEX,IAAI,QAAwBD,KACxB,QAAwBC,GACxB,OAAO,SAAS,QAAS,CAAC,EAAGD,GAAWC,EAEhD,CACA,OAAOA,CACX,CACJ,CC1kBA,SAASgQ,GAAiB/T,EAASgU,EAAYC,GAC3C,IAAItgB,EAAM,GAAGyM,OAAO4T,GAAY5T,OAAO6T,GACnCC,EAAWlU,EAAQmU,QAAQnZ,IAAIrH,GAOnC,OANKugB,GACDlU,EAAQmU,QAAQhZ,IAAIxH,EAAMugB,EACtBlU,EAAQgU,aAAeA,GAAchU,EAAQiU,WAAaA,EACtDjU,GACE,SAAS,QAAS,CAAC,EAAGA,GAAU,CAAEgU,WAAYA,EAAYC,SAAUA,KAE3EC,CACX,CACA,IAAIE,GAA6B,WAC7B,SAASA,EAAYrX,EAAOsX,EAAQvS,GAChCtV,KAAKuQ,MAAQA,EACbvQ,KAAK6nB,OAASA,EACd7nB,KAAKsV,UAAYA,CACrB,CAiZA,OAhZAsS,EAAY5hB,UAAU8hB,aAAe,SAAUxT,EAAOvI,GAClD,IAAI2E,EAAQ1Q,KACRwL,EAAQO,EAAGP,MAAOS,EAASF,EAAGE,OAAQuG,EAASzG,EAAGyG,OAAQ9G,EAAYK,EAAGL,UAAWub,EAAYlb,EAAGkb,UACnGc,GAAsB,QAAuBvc,GAC7C4W,GAAS,UACb1W,GAAY,SAAS,QAAS,CAAC,GAAG,QAAiBqc,IAAuBrc,GAC1E,IAAI8H,GAAU,SAAS,QAAS,CAAEc,MAAOA,EAAO0T,QAAS3c,OAAO3C,OAAO,MAAOiO,MAAO,SAAUW,EAAUC,GACjG,OAAO6K,EAAOzL,MAAMW,EAAUC,EAClC,EAAG7L,UAAWA,EAAWgT,WAAW,EAAAS,EAAA,GAAmBzT,KAAc,QAAuBF,EAAOxL,KAAKsV,YAAa,CAAE2R,YAAaA,EAAWgB,aAAc,IAAIhb,IAAOua,YAAY,EAAOC,UAAU,EAAOE,QAAS,IAAI1a,MACzNyJ,EAAM1W,KAAKkoB,oBAAoB,CAC/Bjc,OAAQA,GAAUZ,OAAO3C,OAAO,MAChC8J,OAAQA,EACRsC,aAAciT,EAAoBjT,aAClCqT,UAAW,CAAE5f,IAAK,IAAI0E,KACtBuG,QAASA,IAEb,KAAK,QAAYkD,GACb,MAAM,QAAkB,GAAIzK,GAqDhC,OAjDAuH,EAAQyU,aAAapa,SAAQ,SAAU9B,EAAIyG,GACvC,IAAIuE,EAAchL,EAAGgL,YAAaoR,EAAYpc,EAAGoc,UAAWC,EAAerc,EAAGqc,aAC1EC,GAAY,QAAc7V,GAC9B,GAAI2V,GAAaA,EAAU5f,IAAI8c,KAAM,CACjC,IAAIiD,EAAU5X,EAAM6X,YAAYJ,EAAWE,EAAWtR,EAAavD,GACnE,IAAI,QAAY8U,GAIZ,OAIJvR,EAAcuR,CAClB,CACA,IAA2B,IAAvB1V,WAAWC,UAAsBW,EAAQyT,UAAW,CACpD,IAAIuB,EAA4Bnd,OAAO3C,OAAO,MAC9C0f,EAAava,SAAQ,SAAUqH,GACvBA,EAAMJ,eACN0T,EAA0BtT,EAAMpL,KAAK1C,QAAS,EAEtD,IASAiE,OAAO+D,KAAK2H,GAAalJ,SAAQ,SAAU8G,IARnB,SAAUA,GAC9B,OACI,IADG6T,GAA0B,QAAuB7T,GAE5D,EAUQ8T,CAAkB9T,KATD,SAAUA,GAC/B,IAAI+T,EAAYP,GAAaA,EAAU5f,IAAIiG,IAAImG,GAC/C,OAAOgU,QAAQD,GAAaA,EAAU7H,MAAQ6H,EAAU7H,KAAKlK,MACjE,CAOSiS,CAAmBjU,IAuY5C,SAA2BkU,EAAaC,EAAanU,EAAgBL,GACjE,IAAIyU,EAAW,SAAUzS,GACrB,IAAIkE,EAAQlG,EAAM6B,cAAcG,EAAU3B,GAC1C,MAAwB,kBAAV6F,GAAsBA,CACxC,EACIlD,EAAWyR,EAASF,GACxB,IAAKvR,EACD,OACJ,IAAIC,EAAWwR,EAASD,GACxB,IAAKvR,EACD,OAGJ,IAAI,QAAYD,GACZ,OAGJ,IAAI,OAAMA,EAAUC,GAChB,OAIJ,GAAIlM,OAAO+D,KAAKkI,GAAUvC,OAAM,SAAU5N,GAAO,YAA8C,IAAvCmN,EAAM6B,cAAcoB,EAAUpQ,EAAiB,IACnG,OAEJ,IAAI6hB,EAAa1U,EAAM6B,cAAc0S,EAAa,eAC9CvU,EAAM6B,cAAc2S,EAAa,cACjCjS,GAAY,QAAuBlC,GACnCsU,EAAc,GAAGrV,OAAOoV,EAAY,KAAKpV,OAAOiD,GAEpD,GAAIqS,GAASza,IAAIwa,GACb,OACJC,GAASrgB,IAAIogB,GACb,IAAIE,EAAiB,IAGhB,OAAQ7R,KAAc,OAAQC,IAC/B,CAACD,EAAUC,GAAU1J,SAAQ,SAAU2M,GACnC,IAAIxB,EAAW1E,EAAM6B,cAAcqE,EAAO,cAClB,kBAAbxB,GAA0BmQ,EAAeC,SAASpQ,IACzDmQ,EAAejpB,KAAK8Y,EAE5B,KAEmB,IAAvBpG,WAAWC,SAAqB,KAAUnE,KAAK,GAAImI,EAAWmS,EAAYG,EAAerlB,OACrF,qCACIqlB,EAAe/H,KAAK,SACpB,8CACF,GAAI6H,EAAa3R,EAAUC,EACrC,CAvbwB8R,CAAkBhB,EAAWtR,EAAapC,EAAgBnB,EAAQc,MAE1E,GACJ,CACAA,EAAMqC,MAAMnE,EAAQuE,EACxB,IAMAzC,EAAMuF,OAAOnD,EAAIlC,OACVkC,CACX,EACAkR,EAAY5hB,UAAUkiB,oBAAsB,SAAUnc,GAClD,IAAI2E,EAAQ1Q,KACRwS,EAASzG,EAAGyG,OAAQvG,EAASF,EAAGE,OAAQ6I,EAAe/I,EAAG+I,aAActB,EAAUzH,EAAGyH,QAGzF2U,EAAYpc,EAAGoc,UACXpS,EAAW/V,KAAKuQ,MAAMwF,SAGtBwB,EAAWlM,OAAO3C,OAAO,MAIzBsQ,EAAYxG,GAAUuD,EAASiB,kBAAkBxE,KACjD,QAAsBvG,EAAQ6I,EAActB,EAAQ+B,cACnD/C,GAAUgB,EAAQc,MAAM9F,IAAIgE,EAAQ,cACrC,kBAAoBwG,IACpBzB,EAAS9D,WAAauF,GAU1B,IAAIX,EAAY,WACZ,IAAI7N,EAAUuZ,GAA0BnX,UAAW2K,EAAU/D,EAAQ9H,WACrE,IAAI,QAAYlB,EAAQqH,MAAO,CAC3B,IAAIgP,EAAOrN,EAAQyU,aAAazZ,IAAIhE,EAAQqH,KAAK2C,OACjD,GAAIqM,EAAM,CACN,IAAIyI,EAAWvT,EAASsC,WAAU,SAAS,QAAS,CAAC,EAAG7N,GAAU,CAAEqH,KAAMgP,EAAK9J,cAAgBvD,GAC/F,QAAiB,IAAb8V,EACA,OAAOA,CAEf,CACJ,CACA,OAAOvT,EAASsC,UAAU7N,EAASgJ,EACvC,EACI4U,EAAe,IAAIza,IACvB3N,KAAKupB,cAAczU,EAAc7I,EAIjCuH,EAASwF,GAAUnL,SAAQ,SAAU2F,EAAS0B,GAC1C,IAAInJ,EACAyd,GAAiB,QAAuBtU,GACxC9N,EAAQ6E,EAAOud,GAEnB,GADApB,EAAavf,IAAIqM,QACH,IAAV9N,EAAkB,CAClB,IAAIuN,EAAiBoB,EAASkD,kBAAkB,CAC5CD,SAAUA,EACVnC,UAAW3B,EAAMpL,KAAK1C,MACtB8N,MAAOA,EACPxJ,UAAW8H,EAAQ9H,YAEnBgd,EAAYe,GAAkBtB,EAAWxT,GACzCyH,EAAgB1L,EAAMgZ,kBAAkBtiB,EAAO8N,EAGnDA,EAAMJ,aACFyS,GAAiB/T,GAAS,GAAO,GAC/BA,EAASkV,GAIX5B,OAAgB,EAGhB5R,EAAMJ,gBACL,QAAYsH,KAAkB,QAAwBA,MACvD0K,EAAgBzO,EAAU,aAAc+D,IAE5C,IAAIzF,EAAQZ,EAAS6Q,iBAAiB5N,EAAU9D,EAAMpL,KAAK1C,MAAO0f,GAC9DnQ,EACA+R,EAAU7H,KAAO,CAEb3L,MAAOA,EACP8D,SAAUA,EACVrC,MAAOA,GAIXgT,GAA2BxB,EAAWxT,GAE1C4C,EAAW/D,EAAQmD,MAAMY,IAAWxL,EAAK,CAAC,GACnC4I,GAAkByH,EACrBrQ,GACR,MACgC,IAAvB6G,WAAWC,SACfW,EAAQgU,YACRhU,EAAQiU,UACR,KAAsB5H,MAAM3K,IAI5Ba,EAAS4Q,gBAAgB3N,EAAU9D,EAAMpL,KAAK1C,SACxB,IAAvBwL,WAAWC,SAAqB,KAAU3N,MAAM,IAAI,QAAuBgQ,GAAQjJ,EAE3F,IAGA,IACI,IAAID,EAAK+J,EAAS5E,SAASlF,EAAQ,CAC/B+M,SAAUA,EACVlE,aAAcA,EACdS,YAAa/B,EAAQ+B,YACrBwB,YAAaQ,EACbc,UAAWA,IACX5G,EAAKzF,EAAG,GAAI2H,EAAY3H,EAAG,GAG/BwG,EAASA,GAAUf,EAGfkC,IAEA4D,EAAW/D,EAAQmD,MAAMY,EAAU5D,GAE3C,CACA,MAAOiW,GAEH,IAAKpX,EACD,MAAMoX,CACd,CACA,GAAI,kBAAoBpX,EAAQ,CAC5B,IAAIqX,GAAU,QAAcrX,GAMxBsX,EAAOtW,EAAQwU,QAAQxV,KAAYgB,EAAQwU,QAAQxV,GAAU,IACjE,GAAIsX,EAAK/lB,QAAQ+Q,IAAiB,EAC9B,OAAO+U,EAOX,GANAC,EAAK5pB,KAAK4U,GAMN9U,KAAK6nB,QACL7nB,KAAK6nB,OAAOxI,QAAQpT,EAAQ4d,EAAS/U,EAActB,GACnD,OAAOqW,EAEX,IAAIE,EAAavW,EAAQyU,aAAazZ,IAAIgE,GAgB1C,OAfIuX,GACAA,EAAWhT,YAAcvD,EAAQmD,MAAMoT,EAAWhT,YAAaQ,GAC/DwS,EAAW5B,UAAY6B,GAAgBD,EAAW5B,UAAWA,GAC7DC,EAAava,SAAQ,SAAUqH,GAAS,OAAO6U,EAAW3B,aAAavf,IAAIqM,EAAQ,KAGnF1B,EAAQyU,aAAatZ,IAAI6D,EAAQ,CAC7BuE,YAAaQ,EAIb4Q,UAAW8B,GAAiB9B,QAAa,EAASA,EAClDC,aAAcA,IAGfyB,CACX,CACA,OAAOtS,CACX,EACAqQ,EAAY5hB,UAAU0jB,kBAAoB,SAAUtiB,EAAO8N,EAAO1B,EAAS2U,GACvE,IAAIzX,EAAQ1Q,KACZ,OAAKkV,EAAMJ,cAA0B,OAAV1N,GAMvB,OAAQA,GACDA,EAAMmB,KAAI,SAAUyM,EAAMtI,GAC7B,IAAItF,EAAQsJ,EAAMgZ,kBAAkB1U,EAAME,EAAO1B,EAASiW,GAAkBtB,EAAWzb,IAEvF,OADAid,GAA2BxB,EAAWzb,GAC/BtF,CACX,IAEGpH,KAAKkoB,oBAAoB,CAC5Bjc,OAAQ7E,EACR0N,aAAcI,EAAMJ,aACpBtB,QAASA,EACT2U,UAAWA,KAbmB,IAAvBvV,WAAWC,SAAoB,EAAAqX,EAAA,GAAU9iB,GAASA,CAejE,EAGAwgB,EAAY5hB,UAAUujB,cAAgB,SAAUzU,EAAc7I,EAAQuH,EAASwF,QAC1D,IAAbA,IAAuBA,GAAW,QAAsB/M,EAAQ6I,EAActB,EAAQ+B,cAC1F,IAAI4U,EAAW,IAAIld,IACf8I,EAAW/V,KAAKuQ,MAAMwF,SACtBqU,EAAe,IAAI,KAAK,GA8D5B,OA7DA,SAAUC,EAAQvV,EAAcwV,GAC5B,IAAIC,EAAcH,EAAa1U,OAAOZ,EAKtCwV,EAAiB9C,WAAY8C,EAAiB7C,UAC1C8C,EAAYC,UAEhBD,EAAYC,SAAU,EACtB1V,EAAaG,WAAWpH,SAAQ,SAAU+R,GACtC,IAAK,QAAcA,EAAWpM,EAAQ9H,WAAtC,CAEA,IAAI8b,EAAa8C,EAAiB9C,WAAYC,EAAW6C,EAAiB7C,SAyB1E,GApBED,GAAcC,KACZ,OAAgB7H,EAAUkC,aAC1BlC,EAAUkC,WAAWjU,SAAQ,SAAU4c,GACnC,IAAI3gB,EAAO2gB,EAAI3gB,KAAK1C,MAGpB,GAFa,WAAT0C,IACA0d,GAAa,GACJ,UAAT1d,EAAkB,CAClB,IAAIZ,GAAO,QAAyBuhB,EAAKjX,EAAQ9H,WAK5CxC,IAAoB,IAAZA,EAAKwhB,KACdjD,GAAW,EAInB,CACJ,KAEA,QAAQ7H,GAAY,CACpB,IAAItI,EAAW6S,EAAS3b,IAAIoR,GACxBtI,IAIAkQ,EAAaA,GAAclQ,EAASkQ,WACpCC,EAAWA,GAAYnQ,EAASmQ,UAEpC0C,EAASxb,IAAIiR,EAAW2H,GAAiB/T,EAASgU,EAAYC,GAClE,KACK,CACD,IAAI7V,GAAW,QAAyBgO,EAAWpM,EAAQgC,gBAC3D,IAAK5D,GAAYgO,EAAU7R,OAAS,IAAK+R,gBACrC,MAAM,QAAkB,GAAIF,EAAU9V,KAAK1C,OAE3CwK,GACAmE,EAASgK,gBAAgBnO,EAAUoH,EAAU/M,EAAQuH,EAAQ9H,YAC7D2e,EAAQzY,EAASkD,aAAcyS,GAAiB/T,EAASgU,EAAYC,GAE7E,CA9CU,CA+Cd,IACH,CA5DD,CA4DG3S,EAActB,GACV2W,CACX,EACAvC,EAAY5hB,UAAUuiB,YAAc,SAAUJ,EAAW7Q,EAAUC,EAAU/D,EAASmX,GAClF,IAAI5e,EACA2E,EAAQ1Q,KACZ,GAAImoB,EAAU5f,IAAI8c,QAAS,QAAY9N,GAAW,CAC9C,IA2BIS,EA3BA4S,GAIF,OAAQrT,MAIL,QAAYD,MAAa,QAAwBA,QAEhD,EADFA,EAKAuT,EAAMtT,EAKNqT,IAAQD,IACRA,EAAiB,EAAC,QAAYC,GAAOA,EAAIpW,MAAQoW,IAQrD,IAAIE,EAAa,SAAUjZ,EAAM/H,GAC7B,OAAQ,OAAQ+H,GACI,kBAAT/H,EACH+H,EAAK/H,QACH,EACJ0J,EAAQc,MAAM6B,cAActE,EAAMuS,OAAOta,GACnD,EACAqe,EAAU5f,IAAIsF,SAAQ,SAAU6a,EAAW/T,GACvC,IAAIoW,EAAOD,EAAWF,EAAKjW,GACvBqW,EAAOF,EAAWD,EAAKlW,GAE3B,QAAI,IAAWqW,EAAf,CAEIL,GACAA,EAAezqB,KAAKyU,GAExB,IAAIsW,EAAOva,EAAM6X,YAAYG,EAAWqC,EAAMC,EAAMxX,EAASmX,GACzDM,IAASD,IACThT,EAAkBA,GAAmB,IAAI/K,KACzB0B,IAAIgG,EAAgBsW,GAEpCN,IACA,QAAUA,EAAeO,QAAUvW,EAV7B,CAYd,IACIqD,IAEAT,GAAY,OAAQsT,GAAOA,EAAIhnB,MAAM,IAAK,QAAS,CAAC,EAAGgnB,GACvD7S,EAAgBnK,SAAQ,SAAUzG,EAAO0C,GACrCyN,EAASzN,GAAQ1C,CACrB,IAER,CACA,OAAI+gB,EAAUtH,KACH7gB,KAAKuQ,MAAMwF,SAASgR,iBAAiBzP,EAAUC,EAAU4Q,EAAUtH,KAAMrN,EAASmX,IAAmB5e,EAAKyH,EAAQc,OAAOoE,WAAW3L,MAAMhB,EAAI4e,IAElJpT,CACX,EACOqQ,CACX,CAvZgC,GAyZ5BuD,GAAqB,GACzB,SAAS1B,GAAkB1d,EAAIjC,GAC3B,IAAIvB,EAAMwD,EAAGxD,IAIb,OAHKA,EAAIkG,IAAI3E,IACTvB,EAAIoG,IAAI7E,EAAMqhB,GAAmBD,OAAS,CAAE3iB,IAAK,IAAI0E,MAElD1E,EAAIiG,IAAI1E,EACnB,CACA,SAASkgB,GAAgBoB,EAAMC,GAC3B,GAAID,IAASC,IAAUA,GAASpB,GAAiBoB,GAC7C,OAAOD,EACX,IAAKA,GAAQnB,GAAiBmB,GAC1B,OAAOC,EACX,IAAIxK,EAAOuK,EAAKvK,MAAQwK,EAAMxK,MAAO,SAAS,QAAS,CAAC,EAAGuK,EAAKvK,MAAOwK,EAAMxK,MAAQuK,EAAKvK,MAAQwK,EAAMxK,KACpGyK,EAAkBF,EAAK7iB,IAAI8c,MAAQgG,EAAM9iB,IAAI8c,KAI7C7N,EAAS,CAAEqJ,KAAMA,EAAMtY,IAHjB+iB,EAAkB,IAAIre,IAC1Bme,EAAK7iB,IAAI8c,KAAO+F,EAAK7iB,IACjB8iB,EAAM9iB,KAEhB,GAAI+iB,EAAiB,CACjB,IAAIC,EAAuB,IAAI5d,IAAI0d,EAAM9iB,IAAI6G,QAC7Cgc,EAAK7iB,IAAIsF,SAAQ,SAAU2d,EAAUrkB,GACjCqQ,EAAOjP,IAAIoG,IAAIxH,EAAK6iB,GAAgBwB,EAAUH,EAAM9iB,IAAIiG,IAAIrH,KAC5DokB,EAAqBxS,OAAO5R,EAChC,IACAokB,EAAqB1d,SAAQ,SAAU1G,GACnCqQ,EAAOjP,IAAIoG,IAAIxH,EAAK6iB,GAAgBqB,EAAM9iB,IAAIiG,IAAIrH,GAAMikB,EAAK7iB,IAAIiG,IAAIrH,IACzE,GACJ,CACA,OAAOqQ,CACX,CACA,SAASyS,GAAiB3J,GACtB,OAAQA,KAAUA,EAAKO,MAAQP,EAAK/X,IAAI8c,KAC5C,CACA,SAASsE,GAA2B5d,EAAIjC,GACpC,IAAIvB,EAAMwD,EAAGxD,IACTmgB,EAAYngB,EAAIiG,IAAI1E,GACpB4e,GAAauB,GAAiBvB,KAC9ByC,GAAmBjrB,KAAKwoB,GACxBngB,EAAIwQ,OAAOjP,GAEnB,CACA,IAAIof,GAAW,IAAIvb,I,gBC3cf8d,GAA+B,SAAUzY,GAEzC,SAASyY,EAActX,QACJ,IAAXA,IAAqBA,EAAS,CAAC,GACnC,IAAIzD,EAAQsC,EAAOxN,KAAKxF,OAASA,KAiBjC,OAhBA0Q,EAAMgb,QAAU,IAAI/d,IACpB+C,EAAMib,qBAAuB,IAAIC,EAAA,EAAkB,MAGnDlb,EAAMN,wBAAyB,EAC/BM,EAAMmb,QAAU,KAChBnb,EAAMob,QAAU,EAChBpb,EAAMyD,QAAS,QAAgBA,GAC/BzD,EAAMqD,cAAgBrD,EAAMyD,OAAOJ,YACnCrD,EAAMqF,SAAW,IAAIoN,GAAS,CAC1B5S,MAAOG,EACPoD,iBAAkBpD,EAAMyD,OAAOL,iBAC/B4P,cAAehT,EAAMyD,OAAOuP,cAC5BN,aAAc1S,EAAMyD,OAAOiP,eAE/B1S,EAAMqb,OACCrb,CACX,CA2aA,OAhcA,QAAU+a,EAAezY,GAsBzByY,EAAczlB,UAAU+lB,KAAO,WAI3B,IAAIC,EAAahsB,KAAKuE,KAAO,IAAIuR,EAAYsF,KAAK,CAC9CrF,SAAU/V,KAAK+V,SACf/B,cAAehU,KAAKmU,OAAOH,gBAO/BhU,KAAKisB,eAAiBD,EAAU1Q,MAChCtb,KAAKksB,kBACT,EACAT,EAAczlB,UAAUkmB,iBAAmB,SAAUC,GACjD,IAAIzb,EAAQ1Q,KACRosB,EAAiBpsB,KAAKqsB,YACtB/W,EAAYtV,KAAKmU,OAAOmB,UAI5BtV,KAAKssB,YAAc,IAAI1E,GAAY5nB,KAAOA,KAAKqsB,YAAc,IAAIvO,EAAY,CACzEvN,MAAOvQ,KACP+T,YAAa/T,KAAK+T,YAClByK,mBAAoBxe,KAAKmU,OAAOqK,mBAChCvK,iBAAiB,QAAsBjU,KAAKmU,QAC5C8J,MAAOkO,OAAwB,EAAUC,GAAkBA,EAAenO,MAC1E3I,UAAWA,IACVA,GACLtV,KAAKusB,qBAAsB,SAAK,SAAUC,EAAGhiB,GACzC,OAAOkG,EAAM+b,eAAeD,EAAGhiB,EACnC,GAAG,CACC8F,IAAKtQ,KAAKmU,OAAOqK,oBACb,IAAW,sCACX,IACJ/D,aAAc,SAAU+R,GAGpB,IAAIlY,EAAQkY,EAAE5b,WAAaF,EAAMub,eAAiBvb,EAAMnM,KACxD,GAAI4W,EAAsB7G,GAAQ,CAC9B,IAAI1D,EAAa4b,EAAE5b,WAAYa,EAAK+a,EAAE/a,GAAI/F,EAAY8gB,EAAE9gB,UACxD,OAAO4I,EAAMmG,aAAa+R,EAAEhhB,MAO5BghB,EAAEta,UAAU,EAAAiN,EAAA,GAAmB,CAAEvO,WAAYA,EAAYa,GAAIA,EAAI/F,UAAWA,IAChF,CACJ,IAKJ,IAAIiC,IAAI,CAAC3N,KAAKuE,KAAKyR,MAAOhW,KAAKisB,eAAejW,QAAQnI,SAAQ,SAAUmI,GACpE,OAAOA,EAAM8E,cACjB,GACJ,EACA2Q,EAAczlB,UAAU0mB,QAAU,SAAUnoB,GAOxC,OANAvE,KAAK+rB,OAIDxnB,GACAvE,KAAKuE,KAAKmF,QAAQnF,GACfvE,IACX,EACAyrB,EAAczlB,UAAUqT,QAAU,SAAUzI,GAExC,YADmB,IAAfA,IAAyBA,GAAa,IAClCA,EAAa5Q,KAAKisB,eAAiBjsB,KAAKuE,MAAM8U,SAC1D,EACAoS,EAAczlB,UAAUuL,KAAO,SAAU/G,GACrC,IAQAuB,EAAKvB,EAAQuH,kBAQbA,OAA2B,IAAPhG,GAAwBA,EAC5C,IACI,OAAQ/L,KAAKqsB,YAAYvN,uBAAsB,SAAS,QAAS,CAAC,EAAGtU,GAAU,CAAE8J,MAAO9J,EAAQoG,WAAa5Q,KAAKisB,eAAiBjsB,KAAKuE,KAAM4P,OAAQnU,KAAKmU,OAAQpC,kBAAmBA,KAAsB9F,QAAU,IAC1N,CACA,MAAO2d,GACH,GAAIA,aAAa,IAMb,OAAO,KAEX,MAAMA,CACV,CACJ,EACA6B,EAAczlB,UAAUuM,MAAQ,SAAU/H,GACtC,IAEI,QADExK,KAAK8rB,QACA9rB,KAAKssB,YAAYxE,aAAa9nB,KAAKuE,KAAMiG,EACpD,CACA,UACWxK,KAAK8rB,UAAiC,IAAtBthB,EAAQmiB,WAC3B3sB,KAAK4sB,kBAEb,CACJ,EACAnB,EAAczlB,UAAUqL,OAAS,SAAU7G,GACvC,GAAI,KAAOhF,KAAKgF,EAAS,QAAUA,EAAQiH,GAUvC,OAAO,EAEX,IAAI6C,EAAU9J,EACd,WACIxK,KAAKisB,eACHjsB,KAAKuE,KACX,IAEI,QADEvE,KAAK8rB,QACAxX,EAAMjD,OAAO7G,EAAQiH,IAAM,aAAcjH,EAAQuN,OAC5D,CACA,UACW/X,KAAK8rB,UAAiC,IAAtBthB,EAAQmiB,WAC3B3sB,KAAK4sB,kBAEb,CACJ,EACAnB,EAAczlB,UAAUmM,KAAO,SAAU3H,GACrC,OAAOxK,KAAKqsB,YAAYvN,uBAAsB,SAAS,QAAS,CAAC,EAAGtU,GAAU,CAAE8J,MAAO9J,EAAQoG,WAAa5Q,KAAKisB,eAAiBjsB,KAAKuE,KAAMiN,OAAQhH,EAAQiH,IAAM,aAAc0C,OAAQnU,KAAKmU,SAClM,EACAsX,EAAczlB,UAAUgM,MAAQ,SAAUA,GACtC,IAAItB,EAAQ1Q,KAkBZ,OAjBKA,KAAK0rB,QAAQrG,OAWd,QAAYrlB,MAEhBA,KAAK0rB,QAAQ7iB,IAAImJ,GACbA,EAAMC,WACNjS,KAAKusB,oBAAoBva,GAEtB,WAICtB,EAAMgb,QAAQ3S,OAAO/G,KAAWtB,EAAMgb,QAAQrG,OAC9C,QAAY3U,GAKhBA,EAAM6b,oBAAoBvkB,OAAOgK,EACrC,CACJ,EACAyZ,EAAczlB,UAAUoL,GAAK,SAAU5G,GACnC,IAAIuB,EACJoT,EAAA,EAAmB0N,QACnBphB,EAAA,EAAMohB,QACN7sB,KAAK2rB,qBAAqBmB,aACO,QAAhC/gB,EAAK/L,KAAKmU,OAAOmB,iBAA8B,IAAPvJ,GAAyBA,EAAG6D,cACrE,IAAIoK,EAAMha,KAAKisB,eAAe7a,KAS9B,OARI5G,IAAYxK,KAAK8rB,UACbthB,EAAQ0hB,iBACRlsB,KAAKksB,iBAAiB1hB,EAAQ2hB,uBAEzB3hB,EAAQ2hB,uBACbnsB,KAAKqsB,YAAYxN,cAGlB7E,CACX,EAQAyR,EAAczlB,UAAU6T,OAAS,SAAUrI,EAAQZ,GAC/C,OAAQA,EAAa5Q,KAAKisB,eAAiBjsB,KAAKuE,MAAMsV,OAAOrI,EACjE,EAMAia,EAAczlB,UAAU8T,QAAU,SAAUtI,EAAQZ,GAChD,OAAQA,EAAa5Q,KAAKisB,eAAiBjsB,KAAKuE,MAAMuV,QAAQtI,EAClE,EAOAia,EAAczlB,UAAUmL,SAAW,SAAUlK,GACzC,IAAI,QAAYA,GACZ,OAAOA,EAAOuN,MAClB,IACI,OAAOxU,KAAK+V,SAAS5E,SAASlK,GAAQ,EAC1C,CACA,MAAO2iB,IACoB,IAAvBhX,WAAWC,SAAqB,KAAUnE,KAAKkb,EACnD,CACJ,EACA6B,EAAczlB,UAAUkT,MAAQ,SAAU1O,GACtC,IAAKA,EAAQiH,GAAI,CACb,GAAI,KAAOjM,KAAKgF,EAAS,MAGrB,OAAO,EAEXA,GAAU,SAAS,QAAS,CAAC,EAAGA,GAAU,CAAEiH,GAAI,cACpD,CACA,IASI,QAJEzR,KAAK8rB,QAIA9rB,KAAKisB,eAAe/S,MAAM1O,EAASxK,KAAKuE,KACnD,CACA,UACWvE,KAAK8rB,UAAiC,IAAtBthB,EAAQmiB,WAC3B3sB,KAAK4sB,kBAEb,CACJ,EACAnB,EAAczlB,UAAU6mB,MAAQ,SAAUriB,GACtC,IAAIkG,EAAQ1Q,KAmBZ,OAlBAA,KAAK+rB,OACL5M,EAAA,EAAmB0N,QACfriB,GAAWA,EAAQuiB,gBAGnB/sB,KAAK0rB,QAAQ7d,SAAQ,SAAUmE,GAAS,OAAOtB,EAAM6b,oBAAoBvkB,OAAOgK,EAAQ,IACxFhS,KAAK0rB,QAAQ7b,SACb,QAAY7P,OASZA,KAAK4sB,mBAEFI,QAAQC,SACnB,EACAxB,EAAczlB,UAAUknB,iBAAmB,SAAUC,GACjD,IAAIC,EAAoBptB,KAAKisB,eAAerQ,YAAYuR,GACpDC,IAAsBptB,KAAKisB,iBAC3BjsB,KAAKisB,eAAiBmB,EACtBptB,KAAK4sB,mBAEb,EACAnB,EAAczlB,UAAUwK,MAAQ,SAAUhG,GACtC,IAEIiG,EAFAC,EAAQ1Q,KACR8Q,EAAStG,EAAQsG,OAAQ/E,EAAKvB,EAAQoG,WAAYA,OAAoB,IAAP7E,GAAuBA,EAAImhB,EAAmB1iB,EAAQ0iB,iBAAkBG,EAAiB7iB,EAAQ6iB,eAEhK/lB,EAAU,SAAUgmB,GACpB,IAAIvhB,EAAK2E,EAAOnM,EAAOwH,EAAGxH,KAAM0nB,EAAiBlgB,EAAGkgB,iBAClDvb,EAAMob,QACJwB,IACA5c,EAAMnM,KAAOmM,EAAMub,eAAiBqB,GAExC,IACI,OAAQ7c,EAAeK,EAAOJ,EAClC,CACA,UACMA,EAAMob,QACRpb,EAAMnM,KAAOA,EACbmM,EAAMub,eAAiBA,CAC3B,CACJ,EACIsB,EAAe,IAAI5f,IAgEvB,OA/DI0f,IAAmBrtB,KAAK8rB,SAUxB9rB,KAAK4sB,kBAAiB,SAAS,QAAS,CAAC,EAAGpiB,GAAU,CAAE6iB,eAAgB,SAAUrb,GAE1E,OADAub,EAAa1kB,IAAImJ,IACV,CACX,KAEkB,kBAAfpB,EAIP5Q,KAAKisB,eAAiBjsB,KAAKisB,eAAexQ,SAAS7K,EAAYtJ,IAE3C,IAAfsJ,EAMLtJ,EAAQtH,KAAKuE,MAKb+C,IAE4B,kBAArB4lB,IACPltB,KAAKisB,eAAiBjsB,KAAKisB,eAAerQ,YAAYsR,IAKtDG,GAAkBE,EAAalI,MAC/BrlB,KAAK4sB,kBAAiB,SAAS,QAAS,CAAC,EAAGpiB,GAAU,CAAE6iB,eAAgB,SAAUrb,EAAOG,GACjF,IAAIlG,EAASohB,EAAe7nB,KAAKxF,KAAMgS,EAAOG,GAO9C,OANe,IAAXlG,GAIAshB,EAAaxU,OAAO/G,GAEjB/F,CACX,KAGAshB,EAAalI,MACbkI,EAAa1f,SAAQ,SAAUmE,GAAS,OAAOtB,EAAM6b,oBAAoBzU,MAAM9F,EAAQ,KAO3FhS,KAAK4sB,iBAAiBpiB,GAEnBiG,CACX,EACAgb,EAAczlB,UAAU6K,mBAAqB,SAAUC,EAAQH,GAC3D,OAAO3Q,KAAKwQ,MAAM,CACdM,OAAQA,EACRF,WAAYD,GAAiC,OAAjBA,GAEpC,EACA8a,EAAczlB,UAAUiL,kBAAoB,SAAUrO,GAClD,OAAO5C,KAAKwtB,sBAAsBxtB,KAAKytB,uBAAuB7qB,GAClE,EACA6oB,EAAczlB,UAAU4mB,iBAAmB,SAAUpiB,GACjD,IAAIkG,EAAQ1Q,KACPA,KAAK8rB,SACN9rB,KAAK0rB,QAAQ7d,SAAQ,SAAU2e,GAAK,OAAO9b,EAAM6b,oBAAoBC,EAAGhiB,EAAU,GAE1F,EACAihB,EAAczlB,UAAUynB,uBAAyB,SAAU7qB,GACvD,IAAI0S,EAAYtV,KAAKmU,OAAOmB,UAC5B,OAAOA,EAAYA,EAAUoY,UAAU9qB,GAAYA,CACvD,EACA6oB,EAAczlB,UAAUwnB,sBAAwB,SAAU5qB,GACtD,OAAI5C,KAAK+T,YACE/T,KAAK2rB,qBAAqB1a,kBAAkBrO,GAEhDA,CACX,EAOA6oB,EAAczlB,UAAUymB,eAAiB,SAAUD,EAAGhiB,GAClD,IAAImjB,EAAWnB,EAAEmB,SAObxb,EAAOnS,KAAKmS,KAAKqa,GACjBhiB,IACIgiB,EAAE5b,YAA4C,kBAAvBpG,EAAQoG,aAC/BuB,EAAKyb,2BAA4B,GAEjCpjB,EAAQ6iB,iBACiD,IAAzD7iB,EAAQ6iB,eAAe7nB,KAAKxF,KAAMwsB,EAAGra,EAAMwb,KAM9CA,IAAa,OAAMA,EAAS1hB,OAAQkG,EAAKlG,SAC1CugB,EAAEta,SAAUsa,EAAEmB,SAAWxb,EAAOwb,EAExC,EACOlC,CACX,CAlckC,CAkchC,MAEyB,IAAvB7Y,WAAWC,UACX4Y,GAAczlB,UAAU8M,mBAAqB,M,gJCldtC+a,EAAY,IAAI,KACvBC,EAAe,IAAIpR,QACvB,SAASqR,EAAaxd,GAClB,IAAIsQ,EAAOiN,EAAatf,IAAI+B,GAO5B,OANKsQ,GACDiN,EAAanf,IAAI4B,EAAQsQ,EAAO,CAC5BmN,KAAM,IAAIrgB,IACVsgB,KAAK,YAGNpN,CACX,CACO,SAASqN,EAAY3d,GACxBwd,EAAaxd,GAAOyd,KAAKngB,SAAQ,SAAUsgB,GAAM,OAAOA,EAAGD,YAAY3d,EAAQ,GACnF,CASO,SAAS6d,EAAY7d,GACxBwd,EAAaxd,GAAOyd,KAAKngB,SAAQ,SAAUsgB,GAAM,OAAOA,EAAGE,YAAY9d,EAAQ,GACnF,CACO,SAASsb,EAAQzkB,GACpB,IAAIknB,EAAS,IAAI3gB,IACb4gB,EAAY,IAAI5gB,IAChBwgB,EAAK,SAAU3V,GACf,GAAI5L,UAAU9I,OAAS,GACnB,GAAIsD,IAAUoR,EAAU,CACpBpR,EAAQoR,EACR8V,EAAOzgB,SAAQ,SAAU0C,GAIrBwd,EAAaxd,GAAO0d,IAAInW,MAAMqW,GAqClD,SAAmB5d,GACXA,EAAMqc,kBACNrc,EAAMqc,kBAEd,CAtCoBD,CAAUpc,EACd,IAEA,IAAIie,EAAetb,MAAMrB,KAAK0c,GAC9BA,EAAU1e,QACV2e,EAAa3gB,SAAQ,SAAU4gB,GAAY,OAAOA,EAASrnB,EAAQ,GACvE,MAEC,CAID,IAAImJ,EAAQsd,EAAUa,WAClBne,IACAoe,EAAOpe,GACPwd,EAAaxd,GAAO0d,IAAIE,GAEhC,CACA,OAAO/mB,CACX,EACA+mB,EAAGS,aAAe,SAAUH,GAExB,OADAF,EAAU1lB,IAAI4lB,GACP,WACHF,EAAUxV,OAAO0V,EACrB,CACJ,EACA,IAAIE,EAAUR,EAAGE,YAAc,SAAU9d,GAGrC,OAFA+d,EAAOzlB,IAAI0H,GACXwd,EAAaxd,GAAOyd,KAAKnlB,IAAIslB,GACtBA,CACX,EAEA,OADAA,EAAGD,YAAc,SAAU3d,GAAS,OAAO+d,EAAOvV,OAAOxI,EAAQ,EAC1D4d,CACX,C,0MCzEO,SAASU,EAASC,EAAYC,EAAOC,GACxC,OAAO,IAAI,KAAW,SAAU/jB,GAC5B,IAAIgkB,EAAe,CAIfC,KAAM,SAAUhd,GACZ,OAAO,IAAI8a,SAAQ,SAAUC,GAAW,OAAOA,EAAQ/a,IAAa,GACxE,GAEJ,SAASid,EAAaC,EAAUjoB,GAC5B,OAAO,SAAUwI,GACb,GAAIyf,EAAU,CACV,IAAIC,EAAO,WAGP,OAAOpkB,EAASqB,OACY,EACtB8iB,EAASzf,EACnB,EACAsf,EAAeA,EAAaC,KAAKG,EAAMA,GAAMH,MAAK,SAAUjjB,GAAU,OAAOhB,EAASkB,KAAKF,EAAS,IAAG,SAAU/G,GAAS,OAAO+F,EAAS/F,MAAMA,EAAQ,GAC5J,MAEI+F,EAAS9D,GAAKwI,EAEtB,CACJ,CACA,IAAI5J,EAAU,CACVoG,KAAMgjB,EAAaJ,EAAO,QAC1B7pB,MAAOiqB,EAAaH,EAAS,SAC7B3iB,SAAU,WAGc4iB,EAAaC,MAAK,WAAc,OAAOjkB,EAASoB,UAAY,GACpF,GAEAijB,EAAMR,EAAWxmB,UAAUvC,GAC/B,OAAO,WAAc,OAAOupB,EAAI7nB,aAAe,CACnD,GACJ,C,eCxCO,SAAS8nB,EAAsBtjB,GAClC,IAAIC,EAASsjB,EAA2BvjB,GACxC,OAAO,OAAgBC,EAC3B,CACO,SAASsjB,EAA2BvjB,GACvC,IAAIwjB,GAAgB,OAAgBxjB,EAAOC,QAAUD,EAAOC,OAAOrI,MAAM,GAAK,GAS9E,OARI,QAAkCoI,KAClC,OAAgBA,EAAOyjB,cACvBzjB,EAAOyjB,YAAY7hB,SAAQ,SAAU8hB,GAC7BA,EAAkBzjB,QAClBujB,EAAcvvB,KAAK6M,MAAM0iB,EAAeE,EAAkBzjB,OAElE,IAEGujB,CACX,C,sECbA,SAASG,EAAcxoB,GACnB,OAAOA,GAA+B,oBAAfA,EAAM8nB,IACjC,CA8BA,IAAIW,EAAyB,SAAU7c,GAInC,SAAS6c,EAAQC,GACb,IAAIpf,EAAQsC,EAAOxN,KAAKxF,MAAM,SAAUiL,GAEpC,OADAyF,EAAMqf,YAAY9kB,GACX,WAAc,OAAOyF,EAAMsf,eAAe/kB,EAAW,CAChE,KAAMjL,KA8FN,OA1FA0Q,EAAMuf,UAAY,IAAItiB,IACtB+C,EAAMwf,QAAU,IAAIlD,SAAQ,SAAUC,EAAStmB,GAC3C+J,EAAMuc,QAAUA,EAChBvc,EAAM/J,OAASA,CACnB,IAGA+J,EAAMyf,SAAW,CACbhkB,KAAM,SAAUF,GACM,OAAdyE,EAAM4e,MACN5e,EAAM4O,OAAS,CAAC,OAAQrT,GACxByE,EAAMhK,OAAO,OAAQuF,IACrB,OAAuByE,EAAMuf,UAAW,OAAQhkB,GAExD,EACA/G,MAAO,SAAUA,GACb,IAAIoqB,EAAM5e,EAAM4e,IACJ,OAARA,IAIIA,GACAttB,YAAW,WAAc,OAAOstB,EAAI7nB,aAAe,IACvDiJ,EAAM4e,IAAM,KACZ5e,EAAM4O,OAAS,CAAC,QAASpa,GACzBwL,EAAM/J,OAAOzB,GACbwL,EAAMhK,OAAO,QAASxB,IACtB,OAAuBwL,EAAMuf,UAAW,QAAS/qB,GAEzD,EACAmH,SAAU,WACN,IAAIN,EAAK2E,EAAO4e,EAAMvjB,EAAGujB,IAAKtjB,EAAKD,EAAG+jB,QACtC,GAAY,OAARR,EAAc,CAMd,IAAIloB,QAPwD,IAAP4E,EAAgB,GAAKA,GAOtDokB,QACfhpB,EAmBIwoB,EAAcxoB,GACnBA,EAAM8nB,MAAK,SAAUmB,GAAO,OAAQ3f,EAAM4e,IAAMe,EAAI/nB,UAAUoI,EAAMyf,SAAY,GAAGzf,EAAMyf,SAASjrB,OAGlGwL,EAAM4e,IAAMloB,EAAMkB,UAAUoI,EAAMyf,WAtB9Bb,GACAttB,YAAW,WAAc,OAAOstB,EAAI7nB,aAAe,IACvDiJ,EAAM4e,IAAM,KACR5e,EAAM4O,QAA8B,SAApB5O,EAAM4O,OAAO,GAC7B5O,EAAMuc,QAAQvc,EAAM4O,OAAO,IAG3B5O,EAAMuc,UAEVvc,EAAMhK,OAAO,aAOb,OAAuBgK,EAAMuf,UAAW,YAQhD,CACJ,GAEJvf,EAAM4f,oBAAsB,IAAI3iB,IAEhC+C,EAAM6f,OAAS,SAAUnqB,GACrBsK,EAAM/J,OAAOP,GACbsK,EAAMof,QAAU,GAChBpf,EAAMyf,SAAS9jB,UACnB,EAIAqE,EAAMwf,QAAQM,OAAM,SAAUjQ,GAAK,IAIZ,oBAAZuP,IACPA,EAAU,CAAC,IAAI,IAAWA,KAE1BF,EAAcE,GACdA,EAAQZ,MAAK,SAAUuB,GAAY,OAAO/f,EAAM5P,MAAM2vB,EAAW,GAAG/f,EAAMyf,SAASjrB,OAGnFwL,EAAM5P,MAAMgvB,GAETpf,CACX,CAsEA,OA5KA,QAAUmf,EAAS7c,GAuGnB6c,EAAQ7pB,UAAUlF,MAAQ,SAAUgvB,QACf,IAAb9vB,KAAKsvB,MAKTtvB,KAAK8vB,QAAU5c,MAAMrB,KAAKie,GAK1B9vB,KAAKmwB,SAAS9jB,WAClB,EACAwjB,EAAQ7pB,UAAU0qB,mBAAqB,SAAUzlB,GAC7C,GAAIjL,KAAKsf,OAAQ,CACb,IAAIqR,EAAc3wB,KAAKsf,OAAO,GAC1BsR,EAAS3lB,EAAS0lB,GAClBC,GACAA,EAAOprB,KAAKyF,EAAUjL,KAAKsf,OAAO,IAKrB,OAAbtf,KAAKsvB,KAAgC,SAAhBqB,GAA0B1lB,EAASoB,UACxDpB,EAASoB,UAEjB,CACJ,EACAwjB,EAAQ7pB,UAAU+pB,YAAc,SAAU9kB,GACjCjL,KAAKiwB,UAAUxhB,IAAIxD,KAGpBjL,KAAK0wB,mBAAmBzlB,GACxBjL,KAAKiwB,UAAUpnB,IAAIoC,GAE3B,EACA4kB,EAAQ7pB,UAAUgqB,eAAiB,SAAU/kB,GACrCjL,KAAKiwB,UAAUlX,OAAO9N,IAAajL,KAAKiwB,UAAU5K,KAAO,GAKzDrlB,KAAKmwB,SAAS9jB,UAEtB,EACAwjB,EAAQ7pB,UAAUU,OAAS,SAAUkqB,EAAQjhB,GACzC,IAAI2gB,EAAsBtwB,KAAKswB,oBAC3BA,EAAoBjL,OAGpBrlB,KAAKswB,oBAAsB,IAAI3iB,IAC/B2iB,EAAoBziB,SAAQ,SAAU4gB,GAAY,OAAOA,EAASmC,EAAQjhB,EAAM,IAExF,EAOAkgB,EAAQ7pB,UAAU6qB,WAAa,SAAU3e,GACrC,IAAI4e,GAAS,EACb9wB,KAAKswB,oBAAoBznB,KAAI,SAAU+nB,EAAQjhB,GACtCmhB,IACDA,GAAS,EACT5e,EAAS0e,EAAQjhB,GAEzB,GACJ,EACOkgB,CACX,CA9K4B,CA8K1B,MAIF,OAAsBA,G,2FCjNlBkB,EAA4B,WAC5B,SAASA,EAAWhlB,GAChB,IAAIwE,EAAQxE,EAAGwE,MAAOygB,EAASjlB,EAAGilB,OAAQC,EAAYllB,EAAGklB,UAAWC,EAAkBnlB,EAAGmlB,gBACzFlxB,KAAKmxB,yBAA2B,IAAIzU,QACpC1c,KAAKuQ,MAAQA,EACTygB,IACAhxB,KAAKgxB,OAASA,GAEdC,GACAjxB,KAAKoxB,aAAaH,GAElBC,GACAlxB,KAAKqxB,mBAAmBH,EAEhC,CA6UA,OA5UAH,EAAW/qB,UAAUorB,aAAe,SAAUH,GAC1C,IAAIvgB,EAAQ1Q,KACZA,KAAKixB,UAAYjxB,KAAKixB,WAAa,CAAC,EAChC/d,MAAMC,QAAQ8d,GACdA,EAAUpjB,SAAQ,SAAUyjB,GACxB5gB,EAAMugB,WAAY,EAAAhR,EAAA,IAAUvP,EAAMugB,UAAWK,EACjD,IAGAtxB,KAAKixB,WAAY,EAAAhR,EAAA,IAAUjgB,KAAKixB,UAAWA,EAEnD,EACAF,EAAW/qB,UAAUurB,aAAe,SAAUN,GAC1CjxB,KAAKixB,UAAY,CAAC,EAClBjxB,KAAKoxB,aAAaH,EACtB,EACAF,EAAW/qB,UAAUwrB,aAAe,WAChC,OAAOxxB,KAAKixB,WAAa,CAAC,CAC9B,EAKAF,EAAW/qB,UAAUyrB,aAAe,SAAU1lB,GAC1C,OAAO,QAAU/L,KAAM4M,eAAW,GAAQ,SAAUZ,GAChD,IAAIpJ,EAAWoJ,EAAGpJ,SAAU8uB,EAAe1lB,EAAG0lB,aAAcle,EAAUxH,EAAGwH,QAAS9H,EAAYM,EAAGN,UAAWqT,EAAK/S,EAAG2lB,uBAAwBA,OAAgC,IAAP5S,GAAwBA,EAC7L,OAAO,QAAY/e,MAAM,SAAUgf,GAC/B,OAAIpc,EACO,CAAC,EAAc5C,KAAK4xB,gBAAgBhvB,EAAU8uB,EAAantB,KAAMiP,EAAS9H,EAAW1L,KAAKkxB,gBAAiBS,GAAwBzC,MAAK,SAAU2C,GAAe,OAAQ,SAAS,QAAS,CAAC,EAAGH,GAAe,CAAEntB,KAAMstB,EAAY5lB,QAAY,KAElP,CAAC,EAAcylB,EAC1B,GACJ,GACJ,EACAX,EAAW/qB,UAAUqrB,mBAAqB,SAAUH,GAChDlxB,KAAKkxB,gBAAkBA,CAC3B,EACAH,EAAW/qB,UAAU8rB,mBAAqB,WACtC,OAAO9xB,KAAKkxB,eAChB,EAGAH,EAAW/qB,UAAU+rB,YAAc,SAAUnvB,GACzC,OAAI,QAAc,CAAC,UAAWA,IACtB5C,KAAKixB,UACEruB,EAGR,IACX,EAEAmuB,EAAW/qB,UAAUgsB,YAAc,SAAUpvB,GACzC,OAAO,QAA6BA,EACxC,EACAmuB,EAAW/qB,UAAUisB,eAAiB,SAAUze,GAC5C,IAAIjD,EAAQvQ,KAAKuQ,MACjB,OAAO,SAAS,QAAS,CAAC,EAAGiD,GAAU,CAAEjD,MAAOA,EAE5C2hB,YAAa,SAAU5Y,GACnB,OAAO/I,EAAMY,SAASmI,EAC1B,GACR,EAIAyX,EAAW/qB,UAAUmsB,qBAAuB,SAAUC,GAClD,OAAO,QAAUpyB,KAAM4M,eAAW,GAAQ,SAAUhK,EAAU8I,EAAW8H,GAGrE,YAFkB,IAAd9H,IAAwBA,EAAY,CAAC,QACzB,IAAZ8H,IAAsBA,EAAU,CAAC,IAC9B,QAAYxT,MAAM,SAAU+L,GAC/B,OAAInJ,EACO,CAAC,EAAc5C,KAAK4xB,gBAAgBhvB,EAAU5C,KAAKqyB,wBAAwBzvB,EAAU8I,IAAc,CAAC,EAAG1L,KAAKiyB,eAAeze,GAAU9H,GAAWwjB,MAAK,SAAU3qB,GAAQ,OAAQ,SAAS,QAAS,CAAC,EAAGmH,GAAYnH,EAAK+tB,kBAAqB,KAE/O,CAAC,GAAc,QAAS,CAAC,EAAG5mB,GACvC,GACJ,GACJ,EACAqlB,EAAW/qB,UAAUusB,qBAAuB,SAAU3vB,GAClD,IAAI4vB,GAAiB,EAiBrB,OAhBA,QAAM5vB,EAAU,CACZ6vB,UAAW,CACPC,MAAO,SAAUvjB,GACb,GAAwB,WAApBA,EAAKrF,KAAK1C,OAAsB+H,EAAKvC,YACrC4lB,EAAiBrjB,EAAKvC,UAAU+lB,MAAK,SAAUhjB,GAC3C,MAA0B,WAAnBA,EAAI7F,KAAK1C,OACO,iBAAnBuI,EAAIvI,MAAM2G,OACU,IAApB4B,EAAIvI,MAAMA,KAClB,KAEI,OAAO,IAGnB,KAGDorB,CACX,EAEAzB,EAAW/qB,UAAUqsB,wBAA0B,SAAUzvB,EAAU8I,GAC/D,OAAO1L,KAAKuQ,MAAM4B,KAAK,CACnB3G,OAAO,QAA2B5I,GAClC8I,UAAWA,EACXqG,mBAAmB,EACnBnB,YAAY,IACb3E,MACP,EACA8kB,EAAW/qB,UAAU4rB,gBAAkB,SAAUQ,EAAYQ,GACzD,OAAO,QAAU5yB,KAAM4M,eAAW,GAAQ,SAAUhK,EAAUiwB,EAAWrf,EAAS9H,EAAWwlB,EAAiBS,GAC1G,IAAImB,EAAgBxd,EAAWC,EAAawd,EAAqBC,EAAqBC,EAAsBlnB,EAAIwE,EAAOygB,EAAQkC,EAK/H,YAJgB,IAAZ1f,IAAsBA,EAAU,CAAC,QACnB,IAAd9H,IAAwBA,EAAY,CAAC,QACjB,IAApBwlB,IAA8BA,EAAkB,WAAc,OAAO,CAAM,QAChD,IAA3BS,IAAqCA,GAAyB,IAC3D,QAAY3xB,MAAM,SAAUgM,GAsB/B,OArBA8mB,GAAiB,QAAkBlwB,GACnC0S,GAAY,QAAuB1S,GACnC2S,GAAc,QAAkBD,GAChCyd,EAAsB/yB,KAAKmzB,2BAA2BL,EAAgBvd,GACtEyd,EAAsBF,EAAehoB,UACrCmoB,EAAuBD,EACnBA,EAAoBrR,OAAO,GAAGkD,cAC1BmO,EAAoBnvB,MAAM,GAC5B,QACK0M,GAAXxE,EAAK/L,MAAiBuQ,MAAOygB,EAASjlB,EAAGilB,OACzCkC,EAAc,CACV3d,YAAaA,EACb/B,SAAS,SAAS,QAAS,CAAC,EAAGA,GAAU,CAAEjD,MAAOA,EAAOygB,OAAQA,IACjEtlB,UAAWA,EACXwlB,gBAAiBA,EACjB+B,qBAAsBA,EACtBX,kBAAmB,CAAC,EACpBS,oBAAqBA,EACrBpB,uBAAwBA,GAGrB,CAAC,EAAc3xB,KAAKozB,oBAAoBN,EAAehe,aADpC,MAC2E+d,EAAWK,GAAahE,MAAK,SAAUjjB,GAAU,MAAO,CACrJA,OAAQA,EACRqmB,kBAAmBY,EAAYZ,kBAC/B,IACZ,GACJ,GACJ,EACAvB,EAAW/qB,UAAUotB,oBAAsB,SAAUte,EAAcue,EAAyBR,EAAWK,GACnG,OAAO,QAAUlzB,UAAM,OAAQ,GAAQ,WACnC,IAAIuV,EAAa/B,EAAS9H,EAAW4nB,EAAgBC,EACjD7iB,EAAQ1Q,KACZ,OAAO,QAAYA,MAAM,SAAU+L,GA6C/B,OA5CAwJ,EAAc2d,EAAY3d,YAAa/B,EAAU0f,EAAY1f,QAAS9H,EAAYwnB,EAAYxnB,UAC9F4nB,EAAiB,CAACT,GAClBU,EAAU,SAAU3T,GAAa,OAAO,QAAUlP,OAAO,OAAQ,GAAQ,WACrE,IAAIkB,EAAUmU,EACd,OAAO,QAAY/lB,MAAM,SAAU+L,GAC/B,OAAKsnB,GACAH,EAAYH,oBAAoBtkB,IAAImR,MAKpC,QAAcA,EAAWlU,IAI1B,QAAQkU,GACD,CAAC,EAAc5f,KAAKwzB,aAAa5T,EAAWyT,EAAyBR,EAAWK,GAAahE,MAAK,SAAUuE,GAC3G,IAAI1nB,EACuB,qBAAhB0nB,GACPH,EAAepzB,OAAM6L,EAAK,CAAC,IACpB,QAAuB6T,IAAc6T,EACxC1nB,GAEZ,OAEJ,QAAiB6T,GACjBhO,EAAWgO,GAIXhO,EAAW2D,EAAYqK,EAAU9V,KAAK1C,QACtC,QAAUwK,EAAU,GAAIgO,EAAU9V,KAAK1C,QAEvCwK,GAAYA,EAASmU,gBACrBA,EAAgBnU,EAASmU,cAAcjc,KAAK1C,MACxC8rB,EAAYhC,gBAAgB2B,EAAW9M,EAAevS,IAC/C,CAAC,EAAcxT,KAAKozB,oBAAoBxhB,EAASkD,aAAcue,EAAyBR,EAAWK,GAAahE,MAAK,SAAUwE,GAC9HJ,EAAepzB,KAAKwzB,EACxB,KAGL,CAAC,IAhCG,CAAC,EAiChB,GACJ,GAAI,EACG,CAAC,EAAc1G,QAAQ2G,IAAI7e,EAAaG,WAAW1M,IAAIgrB,IAAUrE,MAAK,WACrE,OAAO,EAAAjP,EAAA,IAAeqT,EAC1B,IACR,GACJ,GACJ,EACAvC,EAAW/qB,UAAUwtB,aAAe,SAAUte,EAAOme,EAAyBR,EAAWK,GACrF,OAAO,QAAUlzB,UAAM,OAAQ,GAAQ,WACnC,IAAI0L,EAAWmL,EAAW+c,EAAkBC,EAAWC,EAAeC,EAAeC,EAAcC,EAAahH,EAC5Gvc,EAAQ1Q,KACZ,OAAO,QAAYA,MAAM,SAAU+L,GAC/B,OAAK8mB,GAGLnnB,EAAYwnB,EAAYxnB,UACxBmL,EAAY3B,EAAMpL,KAAK1C,MACvBwsB,GAAmB,QAAuB1e,GAC1C2e,EAAYhd,IAAc+c,EAC1BE,EAAgBjB,EAAUe,IAAqBf,EAAUhc,GACzDkd,EAAgB/G,QAAQC,QAAQ6G,GAK3BZ,EAAYvB,yBACb3xB,KAAKuyB,qBAAqBrd,KAC1B8e,EAAenB,EAAUpf,YAAcyf,EAAYD,sBACnDgB,EAAcj0B,KAAKixB,WAAajxB,KAAKixB,UAAU+C,MAE3C/G,EAAUgH,EAAYJ,EAAYhd,EAAY+c,MAE1CG,EAAgB/G,QAAQC,QAGxB,KAAUvG,UAAU1mB,KAAKuQ,MAAO0c,EAAS,CACrC4F,GACA,QAAyB3d,EAAOxJ,GAChCwnB,EAAY1f,QACZ,CAAE0B,MAAOA,EAAOK,YAAa2d,EAAY3d,kBAKlD,CAAC,EAAcwe,EAAc7E,MAAK,SAAUjjB,GAC3C,IAAIF,EAAIC,EAgBR,QAfe,IAAXC,IAAqBA,EAAS6nB,GAG9B5e,EAAM4M,YACN5M,EAAM4M,WAAWjU,SAAQ,SAAUqmB,GACF,WAAzBA,EAAUpqB,KAAK1C,OAAsB8sB,EAAUtnB,WAC/CsnB,EAAUtnB,UAAUiB,SAAQ,SAAU8B,GACX,OAAnBA,EAAI7F,KAAK1C,OAAqC,gBAAnBuI,EAAIvI,MAAM2G,OACrCmlB,EAAYZ,kBAAkB3iB,EAAIvI,MAAMA,OAAS6E,EAEzD,GAER,KAGCiJ,EAAMJ,aACP,OAAO7I,EAIX,GAAc,MAAVA,EAEA,OAAOA,EAEX,IAAIkoB,EAAoJ,QAAnInoB,EAAiC,QAA3BD,EAAKmJ,EAAM4M,kBAA+B,IAAP/V,OAAgB,EAASA,EAAG4mB,MAAK,SAAU9X,GAAK,MAAwB,WAAjBA,EAAE/Q,KAAK1C,KAAoB,WAAuB,IAAP4E,GAAgBA,EAChL,OAAIkH,MAAMC,QAAQlH,GACPyE,EAAM0jB,wBAAwBlf,EAAOme,GAA2Bc,EAAeloB,EAAQinB,GAG9Fhe,EAAMJ,aACCpE,EAAM0iB,oBAAoBle,EAAMJ,aAAcue,GAA2Bc,EAAeloB,EAAQinB,QAD3G,CAGJ,MAjEO,CAAC,EAAc,KAkE9B,GACJ,GACJ,EACAnC,EAAW/qB,UAAUouB,wBAA0B,SAAUlf,EAAOme,EAAyBpnB,EAAQinB,GAC7F,IAAIxiB,EAAQ1Q,KACZ,OAAOgtB,QAAQ2G,IAAI1nB,EAAO1D,KAAI,SAAUyM,GACpC,OAAa,OAATA,EACO,KAGP9B,MAAMC,QAAQ6B,GACPtE,EAAM0jB,wBAAwBlf,EAAOme,EAAyBre,EAAMke,GAG3Ehe,EAAMJ,aACCpE,EAAM0iB,oBAAoBle,EAAMJ,aAAcue,EAAyBre,EAAMke,QADxF,CAGJ,IACJ,EAIAnC,EAAW/qB,UAAUmtB,2BAA6B,SAAUL,EAAgBvd,GACxE,IAAI8e,EAAkB,SAAUllB,GAAQ,OAAQ+D,MAAMC,QAAQhE,EAAO,EACjEgiB,EAA2BnxB,KAAKmxB,yBAqCpC,OApCA,SAASmD,EAAoBC,GACzB,IAAKpD,EAAyB1iB,IAAI8lB,GAAiB,CAC/C,IAAIC,EAAY,IAAI7mB,IACpBwjB,EAAyBxiB,IAAI4lB,EAAgBC,IAC7C,QAAMD,EAAgB,CAClB9B,UAAW,SAAUtjB,EAAMoR,EAAGkU,EAAIC,EAAKC,GACX,WAApBxlB,EAAKrF,KAAK1C,OACVutB,EAAU9mB,SAAQ,SAAUsB,GACpBklB,EAAgBllB,KAAS,QAAgBA,IACzCqlB,EAAU3rB,IAAIsG,EAEtB,GAER,EACAylB,eAAgB,SAAUC,EAAQtU,EAAGkU,EAAIC,EAAKC,GAC1C,IAAI/iB,EAAW2D,EAAYsf,EAAO/qB,KAAK1C,QACvC,QAAUwK,EAAU,GAAIijB,EAAO/qB,KAAK1C,OACpC,IAAI0tB,EAAqBR,EAAoB1iB,GACzCkjB,EAAmBzP,KAAO,IAG1BsP,EAAU9mB,SAAQ,SAAUsB,GACpBklB,EAAgBllB,KAAS,QAAgBA,IACzCqlB,EAAU3rB,IAAIsG,EAEtB,IACAqlB,EAAU3rB,IAAIgsB,GACdC,EAAmBjnB,SAAQ,SAAU+R,GACjC4U,EAAU3rB,IAAI+W,EAClB,IAER,GAER,CACA,OAAOuR,EAAyB3iB,IAAI+lB,EACxC,CACOD,CAAoBxB,EAC/B,EACO/B,CACX,CA5V+B,GCE3BgE,EAA0B,I,QAAK,GAAgBrY,QAAUzP,KAC7D,SAAS+nB,EAA2BzkB,EAAO0kB,GACvC,IAAI9X,EAAW5M,EAAM0kB,GACG,oBAAb9X,IAEP5M,EAAM0kB,GAAc,WAQhB,OAPAF,EAAwBpmB,IAAI4B,GAK3BwkB,EAAwBvmB,IAAI+B,GAAS,GAAK,MAEpC4M,EAASpQ,MAAM/M,KAAM4M,UAChC,EAER,CACA,SAASsoB,EAAoBrU,GACrBA,EAAoB,gBACpB/e,aAAa+e,EAAoB,eACjCA,EAAoB,mBAAI,EAEhC,CAaA,IAAIsU,EAA2B,WAC3B,SAASA,EAAUC,EAAcC,QACb,IAAZA,IAAsBA,EAAUD,EAAaE,mBACjDt1B,KAAKq1B,QAAUA,EACfr1B,KAAKuuB,UAAY,IAAI5gB,IACrB3N,KAAK4C,SAAW,KAChB5C,KAAKu1B,cAAgB,EACrBv1B,KAAKw1B,SAAU,EACfx1B,KAAK8X,OAAQ,EACb9X,KAAKy1B,gBAAkB,KACvB,IAAIllB,EAASvQ,KAAKuQ,MAAQ6kB,EAAa7kB,MAMlCwkB,EAAwBtmB,IAAI8B,KAC7BwkB,EAAwBpmB,IAAI4B,EAAO,GACnCykB,EAA2BzkB,EAAO,SAClCykB,EAA2BzkB,EAAO,UAClCykB,EAA2BzkB,EAAO,SAE1C,CAsUA,OArUA4kB,EAAUnvB,UAAU+lB,KAAO,SAAUvgB,GACjC,IAAIkqB,EAAgBlqB,EAAMkqB,eAAiB,KAAcC,QAsBzD,OArBI31B,KAAK0L,WACL1L,KAAK01B,gBAAkB,KAAcC,WACpC,OAAM31B,KAAK0L,UAAWF,EAAME,aAC7BgqB,EAAgB,KAAcE,eAE7B,OAAMpqB,EAAME,UAAW1L,KAAK0L,aAC7B1L,KAAK2tB,cAAW,GAEpBtiB,OAAOC,OAAOtL,KAAM,CAChB4C,SAAU4I,EAAM5I,SAChB8I,UAAWF,EAAME,UACjBmqB,aAAc,KACdpG,cAAezvB,KAAKyvB,eAAiB,GACrCiG,cAAeA,IAEflqB,EAAMiqB,iBACNz1B,KAAK81B,mBAAmBtqB,EAAMiqB,iBAE9BjqB,EAAM+pB,gBACNv1B,KAAKu1B,cAAgB/pB,EAAM+pB,eAExBv1B,IACX,EACAm1B,EAAUnvB,UAAU6mB,MAAQ,WACxBqI,EAAoBl1B,MACpBA,KAAK8X,OAAQ,CACjB,EACAqd,EAAUnvB,UAAU+vB,UAAY,WAC5B/1B,KAAK2tB,cAAW,CACpB,EACAwH,EAAUnvB,UAAUgwB,QAAU,WAC1B,IAAIxrB,EAAUxK,KAAKi2B,iBACnB,GAAIj2B,KAAK2tB,WAAY,OAAMnjB,EAASxK,KAAK2tB,SAASnjB,SAC9C,OAAOxK,KAAK2tB,SAASxb,KAEzBnS,KAAKk2B,YAAYl2B,KAAK0L,WACtB,IAAIyqB,EAAKn2B,KAAKy1B,gBACd,GAAIU,GAAiC,aAA3BA,EAAG3rB,QAAQ4rB,YACjB,MAAO,CAAE/pB,UAAU,GAEvB,IAAI8F,EAAOnS,KAAKuQ,MAAM4B,KAAK3H,GAE3B,OADAxK,KAAKq2B,eAAelkB,EAAM3H,GACnB2H,CACX,EACAgjB,EAAUnvB,UAAUqwB,eAAiB,SAAUlkB,EAAM3H,GACjDxK,KAAK2tB,SACDxb,EACI,CACIA,KAAMA,EACN3H,QAASA,GAAWxK,KAAKi2B,uBAE3B,CACd,EACAd,EAAUnvB,UAAUiwB,eAAiB,SAAUvqB,GAC3C,IAAIK,EAEJ,YADkB,IAAdL,IAAwBA,EAAY1L,KAAK0L,WACtC,CACHF,MAAOxL,KAAK4C,SACZ8I,UAAWA,EACXqG,mBAAmB,EACnBnB,YAAY,EACZqD,gBAAiD,QAA/BlI,EAAK/L,KAAKy1B,uBAAoC,IAAP1pB,OAAgB,EAASA,EAAGvB,QAAQyJ,gBAErG,EACAkhB,EAAUnvB,UAAUswB,QAAU,SAAUnkB,GACpC,IACIpG,EADA2E,EAAQ1Q,KAERu2B,EAAUv2B,KAAK2tB,UAAY3tB,KAAK2tB,SAASxb,OAQzCA,GACCA,EAAK9F,WAC4B,QAA/BN,EAAK/L,KAAKy1B,uBAAoC,IAAP1pB,OAAgB,EAASA,EAAGvB,QAAQuH,oBAI5EwkB,GAAWA,EAAQlqB,YAGzBrM,KAAKq2B,eAAelkB,GACfnS,KAAK8X,QAAU,OAAMye,GAAWA,EAAQtqB,OAAQkG,GAAQA,EAAKlG,UAC9DjM,KAAK8X,OAAQ,EACR9X,KAAKw2B,gBACNx2B,KAAKw2B,cAAgBx0B,YAAW,WAAc,OAAO0O,EAAMhK,QAAU,GAAG,KAGpF,EACAyuB,EAAUnvB,UAAU8vB,mBAAqB,SAAUK,GAC/C,IAAIzlB,EAAQ1Q,KACRm2B,IAAOn2B,KAAKy1B,kBAEZz1B,KAAKy2B,YACLz2B,KAAKuuB,UAAUxV,OAAO/Y,KAAKy2B,YAE/Bz2B,KAAKy1B,gBAAkBU,EACnBA,GACAA,EAAc,UAAIn2B,KAClBA,KAAKuuB,UAAU1lB,IAAK7I,KAAKy2B,WAAa,WACvB/lB,EAAMslB,UACRpI,0BAMLuI,EAAY,WAWZ,QAAoBA,EAE5B,WAGOn2B,KAAKy2B,WAEpB,EACAtB,EAAUnvB,UAAUU,OAAS,WACzB,IAAIgK,EAAQ1Q,KACZk1B,EAAoBl1B,MAChBA,KAAK02B,gBACL12B,KAAKuuB,UAAU1gB,SAAQ,SAAU4gB,GAAY,OAAOA,EAAS/d,EAAQ,IAEzE1Q,KAAK8X,OAAQ,CACjB,EACAqd,EAAUnvB,UAAU0wB,aAAe,WAC/B,IAAK12B,KAAK8X,QAAU9X,KAAKuuB,UAAUlJ,KAC/B,OAAO,EAEX,IAAI,QAAyBrlB,KAAK01B,gBAAkB11B,KAAKy1B,gBAAiB,CACtE,IAAIW,EAAcp2B,KAAKy1B,gBAAgBjrB,QAAQ4rB,YAC/C,GAAoB,eAAhBA,GAAgD,sBAAhBA,EAChC,OAAO,CAEf,CACA,OAAO,CACX,EACAjB,EAAUnvB,UAAU3E,KAAO,WACvB,IAAKrB,KAAKw1B,QAAS,CACfx1B,KAAKw1B,SAAU,EAEfx1B,KAAK6sB,QACL7sB,KAAKuwB,SAGLvwB,KAAKuwB,OAAS4E,EAAUnvB,UAAUuqB,OAClC,IAAI4F,EAAKn2B,KAAKy1B,gBACVU,GACAA,EAAG70B,aACX,CACJ,EAGA6zB,EAAUnvB,UAAUuqB,OAAS,WAAc,EAC3C4E,EAAUnvB,UAAUkwB,YAAc,SAAUxqB,GACxC,IAAIgF,EAAQ1Q,UACM,IAAd0L,IAAwBA,EAAY1L,KAAK0L,WAC7C,IAAIyqB,EAAKn2B,KAAKy1B,gBACd,IAAIU,GAAiC,aAA3BA,EAAG3rB,QAAQ4rB,YAArB,CAGA,IAAIO,GAAe,SAAS,QAAS,CAAC,EAAG32B,KAAKi2B,eAAevqB,IAAa,CAAEkrB,QAAS52B,KAAMkS,SAAU,SAAUC,GAAQ,OAAOzB,EAAM4lB,QAAQnkB,EAAO,IAC9InS,KAAK62B,YAAc,OAAMF,EAAc32B,KAAK62B,aAC7C72B,KAAKuwB,SACLvwB,KAAKuwB,OAASvwB,KAAKuQ,MAAMyB,MAAOhS,KAAK62B,UAAYF,GAJrD,CAMJ,EACAxB,EAAUnvB,UAAU8wB,eAAiB,WACjC92B,KAAK+2B,eAAY,CACrB,EACA5B,EAAUnvB,UAAUgxB,YAAc,SAAU/qB,EAAQP,GAChD,IAAIqrB,EAAY/2B,KAAK+2B,UACrB,QAASA,GAILA,EAAUE,UAAYlC,EAAwBvmB,IAAIxO,KAAKuQ,SACvD,OAAM7E,EAAWqrB,EAAUrrB,aAC3B,OAAMO,EAAO1H,KAAMwyB,EAAU9qB,OAAO1H,MAC5C,EACA4wB,EAAUnvB,UAAUkxB,WAAa,SAAUjrB,EAAQrJ,EAAU4H,EAAS2sB,GAClE,IAAIzmB,EAAQ1Q,KACRoiB,EAAS,IAAI,KACbqN,GAAgB,OAAgBxjB,EAAOC,QAAUD,EAAOC,OAAOrI,MAAM,GAAK,GAI9E,GADA7D,KAAK6sB,QACD,gBAAiB5gB,IAAU,OAAgBA,EAAOyjB,aAAc,CAChE,IAAI0H,GAAa,QAAqBp3B,KAAKg2B,UAAU/pB,OAAQA,GAC7DA,EAAO1H,KAAO6yB,CAMlB,MACK,GAAI,YAAanrB,GAAUA,EAAOorB,QAAS,CAC5C,IAAIllB,EAAOnS,KAAKg2B,UAChB/pB,EAAO1H,KAAO6d,EAAOzL,MAAMxE,EAAKlG,OAAQA,EAAO1H,KACnD,CACAvE,KAAKyvB,cAAgBA,EACO,aAAxBjlB,EAAQ4rB,YACRp2B,KAAKq2B,eAAe,CAAEpqB,OAAQA,EAAO1H,KAAM8H,UAAU,GAAQrM,KAAKi2B,eAAezrB,EAAQkB,YAE7D,IAAvByrB,IACDG,EAAkBrrB,EAAQzB,EAAQ+sB,aAKlCv3B,KAAKuQ,MAAMM,oBAAmB,SAAUN,GACpC,GAAIG,EAAMsmB,YAAY/qB,EAAQzB,EAAQkB,WAClC6E,EAAM+B,WAAW,CACb9G,MAAO5I,EACP2B,KAAM0H,EAAO1H,KACbmH,UAAWlB,EAAQkB,UACnBub,UAAkC,IAAvBkQ,IAEfzmB,EAAMqmB,UAAY,CACd9qB,OAAQA,EACRP,UAAWlB,EAAQkB,UACnBurB,QAASlC,EAAwBvmB,IAAIkC,EAAMH,aAoC/C,GAAIG,EAAMid,UAAYjd,EAAMid,SAASxb,KAAK9F,SAItC,YADAJ,EAAO1H,KAAOmM,EAAMid,SAASxb,KAAKlG,QAM1C,IAAI6F,EAAcpB,EAAMulB,eAAezrB,EAAQkB,WAC3CyG,EAAO5B,EAAM4B,KAAKL,IAOjBpB,EAAM8kB,UAAW,OAAM9kB,EAAMhF,UAAWlB,EAAQkB,YAGjDgF,EAAMwlB,YAAY1rB,EAAQkB,WAO9BgF,EAAM2lB,eAAelkB,EAAML,GACvBK,EAAK9F,WACLJ,EAAO1H,KAAO4N,EAAKlG,OAE3B,IAGAjM,KAAK+2B,eAAY,EAG7B,EACA5B,EAAUnvB,UAAUwxB,UAAY,WAE5B,OADAx3B,KAAK61B,aAAe,KACZ71B,KAAK01B,cAAgB,KAAc+B,KAC/C,EACAtC,EAAUnvB,UAAU0xB,UAAY,SAAUxyB,GAUtC,OATAlF,KAAK01B,cAAgB,KAAcxwB,MACnClF,KAAK+2B,eAAY,EACjB/2B,KAAK6sB,QACD3nB,EAAMuqB,gBACNzvB,KAAKyvB,cAAgBvqB,EAAMuqB,eAE3BvqB,EAAM2wB,eACN71B,KAAK61B,aAAe3wB,EAAM2wB,cAEvB3wB,CACX,EACOiwB,CACX,CA7V8B,GA+VvB,SAASmC,EAAkBrrB,EAAQsrB,QAClB,IAAhBA,IAA0BA,EAAc,QAC5C,IAAII,EAA+B,WAAhBJ,GAA4C,QAAhBA,EAC3CK,GAAmBrI,EAAsBtjB,GAI7C,OAHK2rB,GAAmBD,GAAgB1rB,EAAO1H,OAC3CqzB,GAAkB,GAEfA,CACX,C,8CClYI,EAAiBvsB,OAAOrF,UAAU8G,eAClC+qB,EAASxsB,OAAO3C,OAAO,MAGvBovB,EAA8B,WAC9B,SAASA,EAAa/rB,GAClB,IAAIwE,EAAQxE,EAAGwE,MAAOwnB,EAAOhsB,EAAGgsB,KAAMC,EAAiBjsB,EAAGisB,eAAgBC,EAAoBlsB,EAAGksB,kBAAmBjsB,EAAKD,EAAGmsB,mBAAoBA,OAA4B,IAAPlsB,GAAwBA,EAAImsB,EAAcpsB,EAAGosB,YAAapZ,EAAKhT,EAAGqsB,QAASA,OAAiB,IAAPrZ,GAAwBA,EAAIC,EAAKjT,EAAGssB,gBAAiBA,OAAyB,IAAPrZ,EAAgB,CAAC,EAAIA,EAAIsZ,EAAavsB,EAAGusB,WAAYC,EAAKxsB,EAAGqE,uBAAwBA,OAAgC,IAAPmoB,IAAkBhoB,EAAMH,uBAAyBmoB,EAAIC,EAAiBzsB,EAAGysB,eACpf9nB,EAAQ1Q,KACZA,KAAKq4B,gBAAkB,CAAC,EAGxBr4B,KAAKy4B,QAAU,IAAIxrB,IAKnBjN,KAAK04B,eAAiB,IAAIzrB,IAC1BjN,KAAK24B,eAAiB,IAAI,EAAAC,EAAqB,IAAW,iCACtD,KACJ54B,KAAK64B,eAAiB,EACtB74B,KAAK84B,iBAAmB,EACxB94B,KAAK+4B,kBAAoB,EAGzB/4B,KAAKg5B,wBAA0B,IAAI,KAAK,GACxC,IAAIC,EAA2B,IAAIrN,EAAA,GAAkB,SAAUhpB,GAAY,OAAO8N,EAAMH,MAAMU,kBAAkBrO,EAAW,GAE3H,CAAE2N,OAAO,IACTvQ,KAAKuQ,MAAQA,EACbvQ,KAAK+3B,KAAOA,EACZ/3B,KAAKg4B,eAAiBA,GAAkB3sB,OAAO3C,OAAO,MACtD1I,KAAKk4B,mBAAqBA,EAC1Bl4B,KAAKq4B,gBAAkBA,EACvBr4B,KAAKs4B,WAAaA,GAAc,IAAIvH,EAAW,CAAExgB,MAAOA,IACxDvQ,KAAKo4B,QAAUA,EACfp4B,KAAKoQ,uBAAyBA,EAC9BpQ,KAAKi4B,kBACDA,EACIgB,EACKrlB,OAAOqkB,GAKPrkB,OAAOqlB,GACVA,EACVj5B,KAAKw4B,eAAiBA,GAAkBntB,OAAO3C,OAAO,OACjD1I,KAAKm4B,YAAcA,KACpBn4B,KAAKk5B,cAAgB7tB,OAAO3C,OAAO,MAE3C,CA8hCA,OAzhCAovB,EAAa9xB,UAAU3E,KAAO,WAC1B,IAAIqP,EAAQ1Q,KACZA,KAAKy4B,QAAQ5qB,SAAQ,SAAUsrB,EAAO9D,GAClC3kB,EAAM0oB,qBAAqB/D,EAC/B,IACAr1B,KAAKq5B,sBAAqB,QAAkB,IAChD,EACAvB,EAAa9xB,UAAUqzB,qBAAuB,SAAUn0B,GACpDlF,KAAK04B,eAAe7qB,SAAQ,SAAU0iB,GAAU,OAAOA,EAAOrrB,EAAQ,IACtElF,KAAK04B,eAAe7oB,OACxB,EACAioB,EAAa9xB,UAAUszB,OAAS,SAAUvtB,GACtC,OAAO,QAAU/L,KAAM4M,eAAW,GAAQ,SAAUZ,GAChD,IAAIutB,EAAYC,EAAkBC,EAAoBC,EAAc/5B,EAChEof,EAAIC,EACJ2a,EAAW3tB,EAAG2tB,SAAUjuB,EAAYM,EAAGN,UAAWkuB,EAAqB5tB,EAAG4tB,mBAAoBC,EAAgB7tB,EAAG6tB,cAAetB,EAAKvsB,EAAG8tB,eAAgBA,OAAwB,IAAPvB,EAAgB,GAAKA,EAAIwB,EAAK/tB,EAAGguB,oBAAqBA,OAA6B,IAAPD,GAAwBA,EAAIE,EAAoBjuB,EAAG8E,OAAQopB,EAAiBluB,EAAGkuB,eAAgBC,EAAKnuB,EAAGoqB,YAAaA,OAAqB,IAAP+D,GAAuD,QAArCpb,EAAK/e,KAAKg4B,eAAesB,cAA2B,IAAPva,OAAgB,EAASA,EAAGqX,cAAgB,eAAiB+D,EAAIC,EAAKpuB,EAAGurB,YAAaA,OAAqB,IAAP6C,GAAuD,QAArCpb,EAAKhf,KAAKg4B,eAAesB,cAA2B,IAAPta,OAAgB,EAASA,EAAGuY,cAAgB,OAAS6C,EAAIC,EAAiBruB,EAAGquB,eAAgB7mB,EAAUxH,EAAGwH,QACvsB,OAAO,QAAYxT,MAAM,SAAUs6B,GAC/B,OAAQA,EAAGC,OACP,KAAK,EAOD,OANA,QAAUZ,EAAU,KACpB,QAA0B,iBAAhBvD,GAAkD,aAAhBA,EAA4B,IACxEmD,EAAav5B,KAAKw6B,qBAClBb,EAAW35B,KAAKuQ,MAAMW,iBAAiBlR,KAAK0tB,UAAUiM,IACtDH,EAAmBx5B,KAAKy6B,gBAAgBd,GAAUH,iBAClD9tB,EAAY1L,KAAK06B,aAAaf,EAAUjuB,GACnC8tB,EACE,CAAC,EAAax5B,KAAKs4B,WAAWnG,qBAAqBwH,EAAUjuB,EAAW8H,IADjD,CAAC,EAAa,GAEhD,KAAK,EACD9H,EAAa4uB,EAAGK,OAChBL,EAAGC,MAAQ,EACf,KAAK,EAsBD,OArBAd,EAAqBz5B,KAAKk5B,gBACrBl5B,KAAKk5B,cAAcK,GAAc,CAC9BI,SAAUA,EACVjuB,UAAWA,EACXiqB,SAAS,EACTzwB,MAAO,OAEfw0B,EAAeE,GACX55B,KAAK46B,uBAAuBhB,EAAoB,CAC5CL,WAAYA,EACZ32B,SAAU+2B,EACVjuB,UAAWA,EACX0qB,YAAaA,EACbmB,YAAaA,EACb/jB,QAASA,EACTqmB,cAAeA,EACf/oB,OAAQmpB,EACRI,eAAgBA,IAExBr6B,KAAK66B,mBACLl7B,EAAOK,KACA,CAAC,EAAc,IAAIgtB,SAAQ,SAAUC,EAAStmB,GAC7C,OAAOkoB,EAASlvB,EAAKm7B,sBAAsBnB,GAAU,SAAS,QAAS,CAAC,EAAGnmB,GAAU,CAAEomB,mBAAoBF,EAAeE,OAAqB,IAAWluB,GAAW,IAAQ,SAAUO,GACnL,GAAIsjB,EAAsBtjB,IAA2B,SAAhBsrB,EACjC,MAAM,IAAI,KAAY,CAClB9H,cAAeD,EAA2BvjB,KAG9CwtB,IACAA,EAAmB9D,SAAU,EAC7B8D,EAAmBv0B,MAAQ,MAE/B,IAAI61B,GAAc,QAAS,CAAC,EAAG9uB,GAO/B,MAN8B,oBAAnB6tB,IACPA,EAAiBA,EAAeiB,IAEhB,WAAhBxD,GAA4BhI,EAAsBwL,WAC3CA,EAAY7uB,OAEhBvM,EAAKq7B,mBAAmB,CAC3BzB,WAAYA,EACZttB,OAAQ8uB,EACRn4B,SAAU+2B,EACVjuB,UAAWA,EACX0qB,YAAaA,EACbmB,YAAaA,EACb/jB,QAASA,EACT1C,OAAQmpB,EACRJ,cAAeA,EACfG,oBAAqBA,EACrBF,eAAgBA,EAChB5M,iBAAkBwM,EAAeH,OAAa,EAC9CW,eAAgBA,EAChBG,eAAgBA,GAExB,IAAG/xB,UAAU,CACT6D,KAAM,SAAU4uB,GACZp7B,EAAKk7B,mBAMC,YAAaE,IAAwC,IAAxBA,EAAY1D,SAC3CpK,EAAQ8N,EAEhB,EACA71B,MAAO,SAAU+1B,GACTxB,IACAA,EAAmB9D,SAAU,EAC7B8D,EAAmBv0B,MAAQ+1B,GAE3BvB,GACA/5B,EAAK4Q,MAAM2c,iBAAiBqM,GAEhC55B,EAAKk7B,mBACLl0B,EAAOs0B,aAAe,KAAcA,EAAM,IAAK,KAAY,CACvDpF,aAAcoF,IAEtB,GAER,KAEhB,GACJ,GACJ,EACAnD,EAAa9xB,UAAUg1B,mBAAqB,SAAUrB,EAAUppB,GAC5D,IAAIG,EAAQ1Q,UACE,IAAVuQ,IAAoBA,EAAQvQ,KAAKuQ,OACrC,IAAItE,EAAS0tB,EAAS1tB,OAClBivB,EAAc,GACdC,EAAqC,aAAzBxB,EAASvD,YACzB,IAAK+E,GAAa7D,EAAkBrrB,EAAQ0tB,EAASpC,aAAc,CAS/D,IARK,QAAkCtrB,IACnCivB,EAAYh7B,KAAK,CACb+L,OAAQA,EAAO1H,KACfiO,OAAQ,gBACRhH,MAAOmuB,EAAS/2B,SAChB8I,UAAWiuB,EAASjuB,aAGxB,QAAkCO,KAClC,OAAgBA,EAAOyjB,aAAc,CACrC,IAAIvd,EAAO5B,EAAM4B,KAAK,CAClBV,GAAI,gBAIJjG,MAAOxL,KAAKy6B,gBAAgBd,EAAS/2B,UAAUw4B,QAC/C1vB,UAAWiuB,EAASjuB,UACpBkF,YAAY,EACZmB,mBAAmB,IAEnBqlB,OAAa,EACbjlB,EAAKlG,SACLmrB,GAAa,QAAqBjlB,EAAKlG,OAAQA,IAEzB,qBAAfmrB,IAGPnrB,EAAO1H,KAAO6yB,EACd8D,EAAYh7B,KAAK,CACb+L,OAAQmrB,EACR5kB,OAAQ,gBACRhH,MAAOmuB,EAAS/2B,SAChB8I,UAAWiuB,EAASjuB,YAGhC,CACA,IAAI2vB,EAAkB1B,EAASE,cAC3BwB,GACAr7B,KAAKy4B,QAAQ5qB,SAAQ,SAAU9B,EAAIspB,GAC/B,IAAII,EAAkB1pB,EAAG0pB,gBACrB6F,EAAY7F,GAAmBA,EAAgB6F,UACnD,GAAKA,GAAc,EAAe91B,KAAK61B,EAAiBC,GAAxD,CAGA,IAAIC,EAAUF,EAAgBC,GAC1BtvB,EAAK0E,EAAM+nB,QAAQjqB,IAAI6mB,GAAUzyB,EAAWoJ,EAAGpJ,SAAU8I,EAAYM,EAAGN,UAExEqT,EAAKxO,EAAM4B,KAAK,CAChB3G,MAAO5I,EACP8I,UAAWA,EACXqG,mBAAmB,EACnBnB,YAAY,IACZ4qB,EAAqBzc,EAAG9S,OAC5B,GAD+C8S,EAAG1S,UAClCmvB,EAAoB,CAEhC,IAAIC,EAAkBF,EAAQC,EAAoB,CAC9CE,eAAgBzvB,EAChBqvB,UAAY14B,IAAY,QAAiBA,SAAc,EACvD+4B,eAAgBjwB,IAGhB+vB,GACAP,EAAYh7B,KAAK,CACb+L,OAAQwvB,EACRjpB,OAAQ,aACRhH,MAAO5I,EACP8I,UAAWA,GAGvB,CA1BA,CA2BJ,GAER,CACA,GAAIwvB,EAAYp3B,OAAS,IACpB61B,EAASG,gBAAkB,IAAIh2B,OAAS,GACzC61B,EAAS7oB,QACT6oB,EAASO,gBACTP,EAASzM,iBAAkB,CAC3B,IAAI0O,EAAY,GA0EhB,GAzEA57B,KAAK85B,eAAe,CAChB+B,YAAa,SAAUtrB,GACd4qB,GACDD,EAAYrtB,SAAQ,SAAU0E,GAAS,OAAOhC,EAAMgC,MAAMA,EAAQ,IAKtE,IAAIzB,EAAS6oB,EAAS7oB,OAGlBgrB,IAAiB,QAAuB7vB,KACvC,QAAkCA,KAAYA,EAAOorB,QAC1D,GAAIvmB,EAAQ,CACR,IAAKqqB,EAAW,CAKZ,IAAIhpB,EAAO5B,EAAM4B,KAAK,CAClBV,GAAI,gBAIJjG,MAAOkF,EAAM+pB,gBAAgBd,EAAS/2B,UAAUw4B,QAChD1vB,UAAWiuB,EAASjuB,UACpBkF,YAAY,EACZmB,mBAAmB,IAEnBI,EAAK9F,WAED,gBADJJ,GAAS,SAAS,QAAS,CAAC,EAAGA,GAAS,CAAE1H,KAAM4N,EAAKlG,kBAE1CA,EAAOyjB,YAEd,YAAazjB,UACNA,EAAOorB,QAG1B,CAIIyE,GACAhrB,EAAOP,EAAOtE,EAAQ,CAClBuH,QAASmmB,EAASnmB,QAClB9H,UAAWiuB,EAASjuB,WAGhC,CAGKyvB,GAAcxB,EAASU,iBAAkByB,GAC1CvrB,EAAMc,OAAO,CACTI,GAAI,gBACJsG,OAAQ,SAAU3Q,EAAO2E,GACrB,IAAI8K,EAAY9K,EAAG8K,UAAWlB,EAAS5J,EAAG4J,OAC1C,MAAqB,eAAdkB,EAA6BzP,EAAQuO,CAChD,GAGZ,EACAomB,QAASpC,EAASG,eAElBlpB,YAAY,EAGZsc,iBAAkByM,EAASzM,iBAK3BgN,eAAgBP,EAASO,gBAAkB,OAC5CrsB,SAAQ,SAAU5B,GAAU,OAAO2vB,EAAU17B,KAAK+L,EAAS,IAC1D0tB,EAASK,qBAAuBL,EAASO,eAIzC,OAAOlN,QAAQ2G,IAAIiI,GAAW1M,MAAK,WAAc,OAAOjjB,CAAQ,GAExE,CACA,OAAO+gB,QAAQC,QAAQhhB,EAC3B,EACA6rB,EAAa9xB,UAAU40B,uBAAyB,SAAUhB,EAAoBD,GAC1E,IAAIjpB,EAAQ1Q,KACRuE,EAAqC,oBAAvBq1B,EACdA,EAAmBD,EAASjuB,UAAW,CAAEmsB,OAAQA,IAC/C+B,EACN,OAAIr1B,IAASszB,IAGb73B,KAAKuQ,MAAMQ,6BAA4B,SAAUR,GAC7C,IACIG,EAAMsqB,oBAAmB,SAAS,QAAS,CAAC,EAAGrB,GAAW,CAAE1tB,OAAQ,CAAE1H,KAAMA,KAAWgM,EAC3F,CACA,MAAOrL,IACoB,IAAvB0N,WAAWC,SAAqB,KAAU3N,MAAMA,EACpD,CACJ,GAAGy0B,EAASJ,aACL,EACX,EACAzB,EAAa9xB,UAAUg2B,WAAa,SAAU3G,EAAS7qB,EAASkrB,GAC5D,OAAO11B,KAAKi8B,qBAAqB5G,EAAS7qB,EAASkrB,GAAewG,QAC7DhM,OACT,EACA4H,EAAa9xB,UAAUm2B,cAAgB,WACnC,IAAI7nB,EAAQjJ,OAAO3C,OAAO,MAS1B,OARA1I,KAAKy4B,QAAQ5qB,SAAQ,SAAUgT,EAAMwU,GACjC/gB,EAAM+gB,GAAW,CACb3pB,UAAWmV,EAAKnV,UAChBgqB,cAAe7U,EAAK6U,cACpBG,aAAchV,EAAKgV,aACnBpG,cAAe5O,EAAK4O,cAE5B,IACOnb,CACX,EACAwjB,EAAa9xB,UAAUo2B,YAAc,SAAU/G,GAC3C,IAAIgH,EAAYr8B,KAAKy4B,QAAQjqB,IAAI6mB,GAC7BgH,IACAA,EAAUxG,kBAAe1sB,EACzBkzB,EAAU5M,cAAgB,GAElC,EACAqI,EAAa9xB,UAAU0nB,UAAY,SAAU9qB,GACzC,OAAO5C,KAAKi4B,kBAAkBhnB,kBAAkBrO,EACpD,EACAk1B,EAAa9xB,UAAUy0B,gBAAkB,SAAU73B,GAC/C,IAAI+1B,EAAiB34B,KAAK24B,eAC1B,IAAKA,EAAelqB,IAAI7L,GAAW,CAC/B,IAAI05B,EAAa,CAMb9C,kBAAkB,QAAiB52B,GACnC25B,mBAAoBv8B,KAAKs4B,WAAW/F,qBAAqB3vB,GACzD45B,yBAAyB,QAAc,CAAC,eAAgB55B,GACxDmvB,YAAa/xB,KAAKs4B,WAAWvG,YAAYnvB,GACzCovB,aAAa,QAA6B,CACtC,CAAEloB,KAAM,SAAUpC,QAAQ,GAC1B,CAAEoC,KAAM,cACR,CAAEA,KAAM,gBACTlH,GACH65B,aAAa,SAAiB,QAAuB75B,IAGrDw4B,SAAS,SAAS,QAAS,CAAC,EAAGx4B,GAAW,CAAEgL,YAAahL,EAASgL,YAAYrF,KAAI,SAAUkN,GACpF,MAAiB,wBAAbA,EAAI1H,MACc,UAAlB0H,EAAI3K,WACG,SAAS,QAAS,CAAC,EAAG2K,GAAM,CAAE3K,UAAW,UAE7C2K,CACX,OAERkjB,EAAehqB,IAAI/L,EAAU05B,EACjC,CACA,OAAO3D,EAAenqB,IAAI5L,EAC9B,EACAk1B,EAAa9xB,UAAU00B,aAAe,SAAU93B,EAAU8I,GACtD,OAAO,SAAS,QAAS,CAAC,EAAG1L,KAAKy6B,gBAAgB73B,GAAU65B,aAAc/wB,EAC9E,EACAosB,EAAa9xB,UAAU02B,WAAa,SAAUlyB,GAC1C,IAAIgB,EAAQxL,KAAK0tB,UAAUljB,EAAQgB,OAKgB,qBADnDhB,GAAU,SAAS,QAAS,CAAC,EAAGA,GAAU,CAAEkB,UAAW1L,KAAK06B,aAAalvB,EAAOhB,EAAQkB,cACrEixB,8BACfnyB,EAAQmyB,6BAA8B,GAE1C,IAAIN,EAAY,IAAIlH,EAAUn1B,MAC1B8uB,EAAa,IAAI8N,EAAA,GAAgB,CACjCxH,aAAcp1B,KACdq8B,UAAWA,EACX7xB,QAASA,IAWb,OATAskB,EAAsB,UAAItjB,EAC1BxL,KAAKy4B,QAAQ9pB,IAAImgB,EAAWuG,QAASgH,GAGrCA,EAAUtQ,KAAK,CACXnpB,SAAU4I,EACViqB,gBAAiB3G,EACjBpjB,UAAWojB,EAAWpjB,YAEnBojB,CACX,EACAgJ,EAAa9xB,UAAUwF,MAAQ,SAAUhB,EAAS6qB,GAC9C,IAAI3kB,EAAQ1Q,KAMZ,YALgB,IAAZq1B,IAAsBA,EAAUr1B,KAAKs1B,oBACzC,QAAU9qB,EAAQgB,MAAO,KACzB,QAAiC,aAAvBhB,EAAQgB,MAAMuC,KAAqB,KAC7C,SAAWvD,EAAQuH,kBAAmB,KACtC,SAAWvH,EAAQqyB,aAAc,IAC1B78B,KAAKg8B,WAAW3G,GAAS,SAAS,QAAS,CAAC,EAAG7qB,GAAU,CAAEgB,MAAOxL,KAAK0tB,UAAUljB,EAAQgB,UAAWsxB,SAAQ,WAAc,OAAOpsB,EAAMqsB,UAAU1H,EAAU,GACtK,EACAyC,EAAa9xB,UAAUsvB,gBAAkB,WACrC,OAAOlR,OAAOpkB,KAAK64B,iBACvB,EACAf,EAAa9xB,UAAUg3B,kBAAoB,WACvC,OAAOh9B,KAAK84B,kBAChB,EACAhB,EAAa9xB,UAAUw0B,mBAAqB,WACxC,OAAOpW,OAAOpkB,KAAK+4B,oBACvB,EACAjB,EAAa9xB,UAAUi3B,iBAAmB,SAAU5H,GAChDr1B,KAAKk9B,4BAA4B7H,GACjCr1B,KAAK66B,kBACT,EACA/C,EAAa9xB,UAAUk3B,4BAA8B,SAAU7H,GAC3D,IAAIgH,EAAYr8B,KAAKy4B,QAAQjqB,IAAI6mB,GAC7BgH,GACAA,EAAUh7B,MAClB,EACAy2B,EAAa9xB,UAAUm3B,WAAa,SAAU3yB,GAwB1C,YAvBgB,IAAZA,IAAsBA,EAAU,CAChCuiB,gBAAgB,IAOpB/sB,KAAKq5B,sBAAqB,QAAkB,KAC5Cr5B,KAAKy4B,QAAQ5qB,SAAQ,SAAUwuB,GACvBA,EAAU5G,gBAGV4G,EAAU3G,cAAgB,KAAcC,QAGxC0G,EAAUh7B,MAElB,IACIrB,KAAKk5B,gBACLl5B,KAAKk5B,cAAgB7tB,OAAO3C,OAAO,OAGhC1I,KAAKuQ,MAAMsc,MAAMriB,EAC5B,EACAstB,EAAa9xB,UAAUo3B,qBAAuB,SAAUrB,GACpD,IAAIrrB,EAAQ1Q,UACI,IAAZ+7B,IAAsBA,EAAU,UACpC,IAAItD,EAAU,IAAIxrB,IACdowB,EAAoB,IAAIpwB,IACxBqwB,EAAqB,IAAI3vB,IAgE7B,OA/DIuF,MAAMC,QAAQ4oB,IACdA,EAAQluB,SAAQ,SAAU0vB,GACF,kBAATA,EACPF,EAAkB1uB,IAAI4uB,GAAM,IAEvB,QAAeA,GACpBF,EAAkB1uB,IAAI+B,EAAMgd,UAAU6P,IAAO,IAExC,OAAgBA,IAASA,EAAK/xB,OACnC8xB,EAAmBz0B,IAAI00B,EAE/B,IAEJv9B,KAAKy4B,QAAQ5qB,SAAQ,SAAU9B,EAAIspB,GAC/B,IAAIc,EAAKpqB,EAAG0pB,gBAAiB7yB,EAAWmJ,EAAGnJ,SAC3C,GAAIuzB,EAAI,CACJ,GAAgB,QAAZ4F,EAEA,YADAtD,EAAQ9pB,IAAI0mB,EAASc,GAGzB,IAAImF,EAAYnF,EAAGmF,UACnB,GAAoB,YADwBnF,EAAG3rB,QAAQ4rB,aAEtC,WAAZ2F,IAAyB5F,EAAGqH,eAC7B,QAEY,WAAZzB,GACCT,GAAa+B,EAAkB5uB,IAAI6sB,IACnC14B,GAAYy6B,EAAkB5uB,IAAI7L,MACnC61B,EAAQ9pB,IAAI0mB,EAASc,GACjBmF,GACA+B,EAAkB1uB,IAAI2sB,GAAW,GACjC14B,GACAy6B,EAAkB1uB,IAAI/L,GAAU,GAE5C,CACJ,IACI06B,EAAmBjY,MACnBiY,EAAmBzvB,SAAQ,SAAUrD,GAIjC,IAAI6qB,GAAU,EAAAoI,EAAA,GAAa,sBACvBpB,EAAY3rB,EAAMgtB,SAASrI,GAAStJ,KAAK,CACzCnpB,SAAU4H,EAAQgB,MAClBE,UAAWlB,EAAQkB,YAEnByqB,EAAK,IAAIyG,EAAA,GAAgB,CACzBxH,aAAc1kB,EACd2rB,UAAWA,EACX7xB,SAAS,SAAS,QAAS,CAAC,EAAGA,GAAU,CAAE4rB,YAAa,oBAE5D,QAAUD,EAAGd,UAAYA,GACzBgH,EAAUvG,mBAAmBK,GAC7BsC,EAAQ9pB,IAAI0mB,EAASc,EACzB,KAEuB,IAAvBvjB,WAAWC,SAAqBwqB,EAAkBhY,MAClDgY,EAAkBxvB,SAAQ,SAAU8vB,EAAUC,GACrCD,IACsB,IAAvB/qB,WAAWC,SAAqB,KAAUnE,KAA0B,kBAAdkvB,EAAyB,GAAK,GAAIA,EAEhG,IAEGnF,CACX,EACAX,EAAa9xB,UAAU63B,yBAA2B,SAAUC,GACxD,IAAIptB,EAAQ1Q,UACW,IAAnB89B,IAA6BA,GAAiB,GAClD,IAAIC,EAA0B,GAW9B,OAVA/9B,KAAKo9B,qBAAqBU,EAAiB,MAAQ,UAAUjwB,SAAQ,SAAU4nB,EAAiBJ,GAC5F,IAAIe,EAAcX,EAAgBjrB,QAAQ4rB,YAC1CX,EAAgBuI,oBACZF,GACiB,YAAhB1H,GAA6C,eAAhBA,IAC9B2H,EAAwB79B,KAAKu1B,EAAgBwI,WAEjDvtB,EAAMgtB,SAASrI,GAASiB,QAAQ,KACpC,IACAt2B,KAAK66B,mBACE7N,QAAQ2G,IAAIoK,EACvB,EACAjG,EAAa9xB,UAAU8vB,mBAAqB,SAAUL,GAClDz1B,KAAK09B,SAASjI,EAAgBJ,SAASS,mBAAmBL,EAC9D,EACAqC,EAAa9xB,UAAUk4B,yBAA2B,SAAUnyB,GACxD,IAAI2E,EAAQ1Q,KACRwL,EAAQO,EAAGP,MAAO4qB,EAAcrqB,EAAGqqB,YAAapqB,EAAKD,EAAGwrB,YAAaA,OAAqB,IAAPvrB,EAAgB,OAASA,EAAIN,EAAYK,EAAGL,UAAWqT,EAAKhT,EAAGyH,QAASA,OAAiB,IAAPuL,EAAgB,CAAC,EAAIA,EAC9LvT,EAAQxL,KAAK0tB,UAAUliB,GACvBE,EAAY1L,KAAK06B,aAAalvB,EAAOE,GACrC,IAAIyyB,EAAiB,SAAUzyB,GAC3B,OAAOgF,EAAMoqB,sBAAsBtvB,EAAOgI,EAAS9H,GAAWnD,KAAI,SAAU0D,GACpD,aAAhBmqB,IAGIkB,EAAkBrrB,EAAQsrB,IAC1B7mB,EAAMH,MAAMgC,MAAM,CACd/G,MAAOA,EACPS,OAAQA,EAAO1H,KACfiO,OAAQ,oBACR9G,UAAWA,IAGnBgF,EAAMmqB,oBAEV,IAAIuD,EAAY7O,EAAsBtjB,GAClCoyB,GAAoB,QAA+BpyB,GACvD,GAAImyB,GAAaC,EAAmB,CAChC,IAAInyB,EAAS,CAAC,EAUd,GATIkyB,IACAlyB,EAAOujB,cAAgBxjB,EAAOC,QAE9BmyB,IACAnyB,EAAOoyB,eAAiBryB,EAAOsyB,WAAW,OAK1B,SAAhBhH,GAA0B8G,EAC1B,MAAM,IAAI,KAAYnyB,EAE9B,CAIA,MAHoB,WAAhBqrB,UACOtrB,EAAOC,OAEXD,CACX,GACJ,EACA,GAAIjM,KAAKy6B,gBAAgBjvB,GAAOguB,iBAAkB,CAC9C,IAAIgF,EAAsBx+B,KAAKs4B,WAC1BnG,qBAAqB3mB,EAAOE,EAAW8H,GACvC0b,KAAKiP,GACV,OAAO,IAAI,KAAW,SAAUlzB,GAC5B,IAAIqkB,EAAM,KAEV,OADAkP,EAAoBtP,MAAK,SAAUJ,GAAc,OAAQQ,EAAMR,EAAWxmB,UAAU2C,EAAY,GAAGA,EAAS/F,OACrG,WAAc,OAAOoqB,GAAOA,EAAI7nB,aAAe,CAC1D,GACJ,CACA,OAAO02B,EAAezyB,EAC1B,EACAosB,EAAa9xB,UAAU+2B,UAAY,SAAU1H,GACzCr1B,KAAKo5B,qBAAqB/D,GAC1Br1B,KAAK66B,kBACT,EACA/C,EAAa9xB,UAAUozB,qBAAuB,SAAU/D,GACpDr1B,KAAKk9B,4BAA4B7H,GACjCr1B,KAAKy+B,YAAYpJ,EACrB,EACAyC,EAAa9xB,UAAUy4B,YAAc,SAAUpJ,GAM3Cr1B,KAAK04B,eAAe3f,OAAOsc,GACvBr1B,KAAKy4B,QAAQhqB,IAAI4mB,KACjBr1B,KAAK09B,SAASrI,GAASh0B,OACvBrB,KAAKy4B,QAAQ1f,OAAOsc,GAE5B,EACAyC,EAAa9xB,UAAU60B,iBAAmB,WAClC76B,KAAKm4B,aACLn4B,KAAKm4B,cACTn4B,KAAKy4B,QAAQ5qB,SAAQ,SAAUgT,GAAQ,OAAOA,EAAKna,QAAU,GACjE,EACAoxB,EAAa9xB,UAAU04B,cAAgB,WACnC,OAAO1+B,KAAKs4B,UAChB,EACAR,EAAa9xB,UAAU80B,sBAAwB,SAAUtvB,EAAOgI,EAAS9H,EAEzEizB,GACI,IACI5yB,EAEA+iB,EAHApe,EAAQ1Q,UAEU,IAAlB2+B,IAA4BA,EAAwG,QAAvF5yB,EAAiB,OAAZyH,QAAgC,IAAZA,OAAqB,EAASA,EAAQ0kB,0BAAuC,IAAPnsB,EAAgBA,EAAK/L,KAAKk4B,oBAE1K,IAAIlsB,EAAKhM,KAAKy6B,gBAAgBjvB,GAAQwmB,EAAchmB,EAAGgmB,YAAaD,EAAc/lB,EAAG+lB,YACrF,GAAIC,EAAa,CACb,IAAe4M,EAAN5+B,KAAqCg5B,wBAAyBjB,EAA9D/3B,KAAwE+3B,KAC7EjtB,EAAY,CACZU,MAAOwmB,EACPtmB,UAAWA,EACXE,eAAe,QAAiBomB,SAAgB,EAChDxe,QAASxT,KAAKiyB,gBAAe,SAAS,QAAS,CAAC,EAAGze,GAAU,CAAEqrB,YAAaF,MAGhF,GADAnrB,EAAU1I,EAAU0I,QAChBmrB,EAAe,CACf,IAAIG,GAAuB,EAAArzB,EAAA,GAAMumB,GAC7B+M,GAAY,EAAA5f,EAAA,GAAmBzT,GAC/BszB,EAAQJ,EAA0BlpB,OAAOopB,EAAsBC,GAEnE,KADAjQ,EAAakQ,EAAMlQ,YACF,CACb,IAAIoN,EAAU,IAAIrM,EAAQ,EACtB,EAAA0D,EAAA,GAAQwE,EAAMjtB,KAElBgkB,EAAakQ,EAAMlQ,WAAaoN,EAChCA,EAAQrL,YAAW,WACf+N,EAA0Bl3B,OAAOo3B,EAAsBC,EAC3D,GACJ,CACJ,MAEIjQ,EAAa,IAAIe,EAAQ,EACrB,EAAA0D,EAAA,GAAQwE,EAAMjtB,IAG1B,MAEIgkB,EAAa,IAAIe,EAAQ,CAAC,IAAWoP,GAAG,CAAE16B,KAAM,CAAC,MACjDiP,EAAUxT,KAAKiyB,eAAeze,GAYlC,OAVIue,IACAjD,EAAaD,EAASC,GAAY,SAAU7iB,GACxC,OAAOyE,EAAM4nB,WAAW7G,aAAa,CACjC7uB,SAAUmvB,EACVL,aAAczlB,EACduH,QAASA,EACT9H,UAAWA,GAEnB,KAEGojB,CACX,EACAgJ,EAAa9xB,UAAUk5B,mBAAqB,SAAU7C,EAAWlF,EAAoB3sB,GACjF,IAAI20B,EAAa9C,EAAU9G,cAAgBv1B,KAAKg9B,oBAI5CoC,EAAep/B,KAAKuQ,MAAMW,iBAAiB1G,EAAQgB,OACvD,OAAOqjB,EAAS7uB,KAAK86B,sBAAsBsE,EAAc50B,EAAQgJ,QAAShJ,EAAQkB,YAAY,SAAUO,GACpG,IAAIwjB,EAAgBD,EAA2BvjB,GAC3CmyB,EAAY3O,EAAc3rB,OAAS,EAGvC,GAAIq7B,GAAa9C,EAAU9G,cAAe,CACtC,GAAI6I,GAAqC,SAAxB5zB,EAAQ+sB,YAErB,MAAM8E,EAAU3E,UAAU,IAAI,KAAY,CACtCjI,cAAeA,KAMvB4M,EAAUnF,WAAWjrB,EAAQmzB,EAAc50B,EAAS2sB,GACpDkF,EAAU7E,WACd,CACA,IAAI6H,EAAM,CACN96B,KAAM0H,EAAO1H,KACboxB,SAAS,EACTD,cAAe,KAAc+B,OAMjC,OAJI2G,GAAqC,WAAxB5zB,EAAQ+sB,cACrB8H,EAAInzB,OAASujB,EACb4P,EAAI3J,cAAgB,KAAcxwB,OAE/Bm6B,CACX,IAAG,SAAUxJ,GACT,IAAI3wB,GAAQ,QAAc2wB,GAAgBA,EAAe,IAAK,KAAY,CAAEA,aAAcA,IAK1F,MAHIsJ,GAAa9C,EAAU9G,eACvB8G,EAAU3E,UAAUxyB,GAElBA,CACV,GACJ,EACA4yB,EAAa9xB,UAAUi2B,qBAAuB,SAAU5G,EAAS7qB,EAIjEkrB,EAAelqB,GACX,IAAIkF,EAAQ1Q,UACU,IAAlB01B,IAA4BA,EAAgB,KAAcC,cAChD,IAAVnqB,IAAoBA,EAAQhB,EAAQgB,OACxC,IAuCI0wB,EAASoD,EAvCT5zB,EAAY1L,KAAK06B,aAAalvB,EAAOhB,EAAQkB,WAC7C2wB,EAAYr8B,KAAK09B,SAASrI,GAC1BkK,EAAWv/B,KAAKg4B,eAAe0E,WAC/B3wB,EAAKvB,EAAQ4rB,YAAaA,OAAqB,IAAPrqB,EAAiBwzB,GAAYA,EAASnJ,aAAgB,cAAgBrqB,EAAIC,EAAKxB,EAAQ+sB,YAAaA,OAAqB,IAAPvrB,EAAiBuzB,GAAYA,EAAShI,aAAgB,OAASvrB,EAAI+S,EAAKvU,EAAQuH,kBAAmBA,OAA2B,IAAPgN,GAAwBA,EAAIC,EAAKxU,EAAQmyB,4BAA6BA,OAAqC,IAAP3d,GAAwBA,EAAIuZ,EAAK/tB,EAAQgJ,QAASA,OAAiB,IAAP+kB,EAAgB,CAAC,EAAIA,EACtciH,EAAan0B,OAAOC,OAAO,CAAC,EAAGd,EAAS,CACxCgB,MAAOA,EACPE,UAAWA,EACX0qB,YAAaA,EACbmB,YAAaA,EACbxlB,kBAAmBA,EACnB4qB,4BAA6BA,EAC7BnpB,QAASA,IAETisB,EAAgB,SAAU/zB,GAI1B8zB,EAAW9zB,UAAYA,EACvB,IAAIg0B,EAAkBhvB,EAAMivB,mBAAmBtD,EAAWmD,EAAY9J,GAWtE,MAP2B,YAA3B8J,EAAWpJ,aAGPsJ,EAAgB5P,QAAQhsB,OAAS,GACjCu4B,EAAU5G,iBACV4G,EAAU5G,gBAAsC,qBAAE,cAAejrB,GAE9Dk1B,CACX,EAGIE,EAAkB,WAAc,OAAOlvB,EAAMgoB,eAAe3f,OAAOsc,EAAU,EAcjF,GAbAr1B,KAAK04B,eAAe/pB,IAAI0mB,GAAS,SAAUjvB,GACvCw5B,IAEA59B,YAAW,WAAc,OAAOk6B,EAAQ3L,OAAOnqB,EAAS,GAC5D,IASIpG,KAAKy6B,gBAAgB+E,EAAWh0B,OAAOguB,iBACvC0C,EAAU,IAAIrM,EAAQ7vB,KAAKs4B,WACtBnG,qBAAqBqN,EAAWh0B,MAAOg0B,EAAW9zB,UAAW8zB,EAAWhsB,SACxE0b,KAAKuQ,GACLvQ,MAAK,SAAUwQ,GAAmB,OAAOA,EAAgB5P,OAAS,KAMvEwP,GAAuB,MAEtB,CACD,IAAII,EAAkBD,EAAcD,EAAW9zB,WAC/C4zB,EAAuBI,EAAgBG,SACvC3D,EAAU,IAAIrM,EAAQ6P,EAAgB5P,QAC1C,CAEA,OADAoM,EAAQhM,QAAQhB,KAAK0Q,EAAiBA,GAC/B,CACH1D,QAASA,EACT2D,SAAUP,EAElB,EACAxH,EAAa9xB,UAAU8zB,eAAiB,SAAU/tB,GAC9C,IAAI2E,EAAQ1Q,KACR67B,EAAc9vB,EAAG8vB,YAAaE,EAAUhwB,EAAGgwB,QAAS/vB,EAAKD,EAAG6E,WAAYA,OAAoB,IAAP5E,GAAwBA,EAAI+S,EAAKhT,EAAGmhB,iBAAkBA,OAA0B,IAAPnO,EAAgBnO,GAAa,EAAA6sB,EAAA,GAAa,uBAAoB,EAAS1e,EAAImb,EAAiBnuB,EAAGmuB,eAC7P4F,EAAsB,IAAI7yB,IAC1B8uB,GACA/7B,KAAKo9B,qBAAqBrB,GAASluB,SAAQ,SAAUsoB,EAAId,GACrDyK,EAAoBnxB,IAAI0mB,EAAS,CAC7Bc,GAAIA,EACJxI,SAAUjd,EAAMgtB,SAASrI,GAASW,WAE1C,IAEJ,IAAI+J,EAAU,IAAI9yB,IA+GlB,OA9GI4uB,GACA77B,KAAKuQ,MAAMC,MAAM,CACbM,OAAQ+qB,EA8BRjrB,WAAaA,GAAcsc,IAAqB,EAQhDA,iBAAkBA,EAClBG,eAAgB,SAAUrb,EAAOG,EAAMwb,GACnC,IAAIwI,EAAKnkB,EAAM4kB,mBAAmBzB,GAAanjB,EAAM4kB,QAAQnB,gBAC7D,GAAIU,EAAI,CACJ,GAAI+D,EAAgB,CAIhB4F,EAAoB/mB,OAAOod,EAAGd,SAC9B,IAAIppB,EAASiuB,EAAe/D,EAAIhkB,EAAMwb,GAatC,OAZe,IAAX1hB,IAGAA,EAASkqB,EAAG8H,YAID,IAAXhyB,GACA8zB,EAAQpxB,IAAIwnB,EAAIlqB,GAIbA,CACX,CACuB,OAAnBiuB,GAIA4F,EAAoBnxB,IAAIwnB,EAAGd,QAAS,CAAEc,GAAIA,EAAIxI,SAAUA,EAAUxb,KAAMA,GAEhF,CACJ,IAGJ2tB,EAAoBza,MACpBya,EAAoBjyB,SAAQ,SAAU9B,EAAIspB,GACtC,IACIppB,EADAkqB,EAAKpqB,EAAGoqB,GAAIxI,EAAW5hB,EAAG4hB,SAAUxb,EAAOpG,EAAGoG,KAIlD,GAAI+nB,EAAgB,CAChB,IAAK/nB,EAAM,CACP,IAAI0O,EAAOsV,EAAc,UACzBtV,EAAKgM,QACL1a,EAAO0O,EAAKmV,SAChB,CACA/pB,EAASiuB,EAAe/D,EAAIhkB,EAAMwb,EACtC,CAEKuM,IAA6B,IAAXjuB,IACnBA,EAASkqB,EAAG8H,YAED,IAAXhyB,GACA8zB,EAAQpxB,IAAIwnB,EAAIlqB,GAEhBopB,EAAQtxB,QAAQ,uBAAyB,GACzC2M,EAAM0oB,qBAAqB/D,EAEnC,IAEAnI,GAQAltB,KAAKuQ,MAAM2c,iBAAiBA,GAEzB6S,CACX,EACAjI,EAAa9xB,UAAU25B,mBAAqB,SAAUtD,EAAWtwB,EAIjE2pB,GACI,IAAIhlB,EAAQ1Q,KACRwL,EAAQO,EAAGP,MAAOE,EAAYK,EAAGL,UAAW0qB,EAAcrqB,EAAGqqB,YAAa4J,EAAqBj0B,EAAGi0B,mBAAoBzI,EAAcxrB,EAAGwrB,YAAaxlB,EAAoBhG,EAAGgG,kBAAmByB,EAAUzH,EAAGyH,QAASmpB,EAA8B5wB,EAAG4wB,4BACrPsD,EAAmB5D,EAAU3G,cACjC2G,EAAUtQ,KAAK,CACXnpB,SAAU4I,EACVE,UAAWA,EACXgqB,cAAeA,IAEnB,IAAIwK,EAAY,WAAc,OAAO7D,EAAUrG,SAAW,EACtDmK,EAAmB,SAAUhuB,EAAMujB,QACb,IAAlBA,IAA4BA,EAAgB2G,EAAU3G,eAAiB,KAAcC,SACzF,IAAIpxB,EAAO4N,EAAKlG,QACW,IAAvB2G,WAAWC,SAAsBd,IAAsB,OAAMxN,EAAM,CAAC,KACpE,QAAsB4N,EAAKC,SAE/B,IAAIguB,EAAW,SAAU77B,GACrB,OAAO,IAAW06B,IAAG,QAAS,CAAE16B,KAAMA,EAAMoxB,SAAS,QAAyBD,GAAgBA,cAAeA,GAAkBvjB,EAAK9F,SAAW,KAAO,CAAEg0B,SAAS,IACrK,EACA,OAAI97B,GAAQmM,EAAM+pB,gBAAgBjvB,GAAO+wB,mBAC9B7rB,EAAM4nB,WACR7G,aAAa,CACd7uB,SAAU4I,EACVkmB,aAAc,CAAEntB,KAAMA,GACtBiP,QAASA,EACT9H,UAAWA,EACXimB,wBAAwB,IAEvBzC,MAAK,SAAUoR,GAAY,OAAOF,EAASE,EAAS/7B,WAAQ,EAAS,IAM1D,SAAhBgzB,GACA7B,IAAkB,KAAcuI,SAChC/qB,MAAMC,QAAQhB,EAAKC,SACZguB,OAAS,GAEbA,EAAS77B,EACpB,EACI4yB,EAAqC,aAAhBf,EAA6B,EAG/CV,IAAkB,KAAcuI,SACR,UAAvB+B,EACA,EACE,EACNO,EAAkB,WAClB,OAAO7vB,EAAMwuB,mBAAmB7C,EAAWlF,EAAoB,CAC3D3rB,MAAOA,EACPE,UAAWA,EACX8H,QAASA,EACT4iB,YAAaA,EACbmB,YAAaA,GAErB,EACIb,EAAeiG,GACa,kBAArBsD,GACPA,IAAqBvK,IACrB,QAAyBA,GAC7B,OAAQU,GACJ,QACA,IAAK,cAED,OADIjkB,EAAO+tB,KACF7zB,SACE,CACHwzB,UAAU,EACV/P,QAAS,CAACqQ,EAAiBhuB,EAAMkqB,EAAU7E,eAG/CzlB,GAAqB2kB,EACd,CACHmJ,UAAU,EACV/P,QAAS,CAACqQ,EAAiBhuB,GAAOouB,MAGnC,CAAEV,UAAU,EAAM/P,QAAS,CAACyQ,MAEvC,IAAK,oBACD,IAAIpuB,EACJ,OADIA,EAAO+tB,KACF7zB,UAAY0F,GAAqB2kB,EAC/B,CACHmJ,UAAU,EACV/P,QAAS,CAACqQ,EAAiBhuB,GAAOouB,MAGnC,CAAEV,UAAU,EAAM/P,QAAS,CAACyQ,MAEvC,IAAK,aACD,MAAO,CACHV,UAAU,EACV/P,QAAS,CAACqQ,EAAiBD,IAAa7D,EAAU7E,eAE1D,IAAK,eACD,OAAId,EACO,CACHmJ,UAAU,EACV/P,QAAS,CAACqQ,EAAiBD,KAAcK,MAG1C,CAAEV,UAAU,EAAM/P,QAAS,CAACyQ,MACvC,IAAK,WACD,OAAI7J,EACO,CACHmJ,UAAU,EAIV/P,QAAS,CAACqQ,EAAiB9D,EAAUrG,WAAYuK,MAGlD,CAAEV,UAAU,EAAM/P,QAAS,CAACyQ,MACvC,IAAK,UACD,MAAO,CAAEV,UAAU,EAAO/P,QAAS,IAE/C,EACAgI,EAAa9xB,UAAU03B,SAAW,SAAUrI,GAIxC,OAHIA,IAAYr1B,KAAKy4B,QAAQhqB,IAAI4mB,IAC7Br1B,KAAKy4B,QAAQ9pB,IAAI0mB,EAAS,IAAIF,EAAUn1B,KAAMq1B,IAE3Cr1B,KAAKy4B,QAAQjqB,IAAI6mB,EAC5B,EACAyC,EAAa9xB,UAAUisB,eAAiB,SAAUze,QAC9B,IAAZA,IAAsBA,EAAU,CAAC,GACrC,IAAIgtB,EAAaxgC,KAAKs4B,WAAWrG,eAAeze,GAChD,OAAO,SAAS,SAAS,QAAS,CAAC,EAAGxT,KAAKw4B,gBAAiBgI,GAAa,CAAEnI,gBAAiBr4B,KAAKq4B,iBACrG,EACOP,CACX,CA7kCiC,G,sBCZ7B2I,GAAuB,EAcvBC,EAA8B,WA2B9B,SAASA,EAAal2B,GAClB,IAAIkG,EAAQ1Q,KAGZ,GAFAA,KAAK2gC,oBAAsB,GAC3B3gC,KAAK4gC,oBAAsB,IACtBp2B,EAAQ+F,MACT,MAAM,QAAkB,IAE5B,IAAIswB,EAAMr2B,EAAQq2B,IAAKC,EAAct2B,EAAQs2B,YAAaC,EAAUv2B,EAAQu2B,QAASxwB,EAAQ/F,EAAQ+F,MAAO0nB,EAAoBztB,EAAQytB,kBAAmBlsB,EAAKvB,EAAQ4tB,QAASA,OAAiB,IAAPrsB,GAAwBA,EAAIC,EAAKxB,EAAQw2B,mBAAoBA,OAA4B,IAAPh1B,EAAgB,EAAIA,EAIjS+S,EAAKvU,EAAQy2B,kBAIbA,OAA2B,IAAPliB,EAAkC,kBAAXmiB,SACtCA,OAAOC,oBACe,IAAvBvuB,WAAWC,QAAoBkM,EAAIC,EAAKxU,EAAQ0tB,mBAAoBA,OAA4B,IAAPlZ,GAAuBA,EAAIgZ,EAAiBxtB,EAAQwtB,eAAgBQ,EAAiBhuB,EAAQguB,eAAgBD,EAAK/tB,EAAQ4F,uBAAwBA,OAAgC,IAAPmoB,EAAgBhoB,EAAMH,uBAAyBmoB,EAAItH,EAAYzmB,EAAQymB,UAAWmQ,EAAW52B,EAAQ42B,SAAUlQ,EAAkB1mB,EAAQ0mB,gBAAiBmQ,EAAsB72B,EAAQV,KAAMw3B,EAAyB92B,EAAQ+2B,QACnexJ,EAAOvtB,EAAQutB,KACdA,IACDA,EACI8I,EAAM,IAAIW,EAAA,EAAS,CAAEX,IAAKA,EAAKC,YAAaA,EAAaC,QAASA,IAAax2B,EAAA,EAAWqS,SAElG5c,KAAK+3B,KAAOA,EACZ/3B,KAAKuQ,MAAQA,EACbvQ,KAAKyhC,sBAAwBrJ,GAAW4I,EAAqB,EAC7DhhC,KAAKk4B,mBAAqBA,EAC1Bl4B,KAAKg4B,eAAiBA,GAAkB3sB,OAAO3C,OAAO,MACtD1I,KAAKohC,SAAWA,EACZJ,GACAh/B,YAAW,WAAc,OAAQ0O,EAAM+wB,uBAAwB,CAAQ,GAAGT,GAE9EhhC,KAAK08B,WAAa18B,KAAK08B,WAAW97B,KAAKZ,MACvCA,KAAKwL,MAAQxL,KAAKwL,MAAM5K,KAAKZ,MAC7BA,KAAKs5B,OAASt5B,KAAKs5B,OAAO14B,KAAKZ,MAC/BA,KAAK0R,cAAgB1R,KAAK0R,cAAc9Q,KAAKZ,MAC7CA,KAAK0hC,WAAa1hC,KAAK0hC,WAAW9gC,KAAKZ,MACvCA,KAAK69B,yBAA2B79B,KAAK69B,yBAAyBj9B,KAAKZ,MACnEA,KAAKuhC,QAAUA,EAAA,EACfvhC,KAAKs4B,WAAa,IAAIvH,EAAW,CAC7BxgB,MAAOA,EACPygB,OAAQhxB,KACRixB,UAAWA,EACXC,gBAAiBA,IAErBlxB,KAAKo1B,aAAe,IAAI0C,EAAa,CACjCvnB,MAAOvQ,KAAKuQ,MACZwnB,KAAM/3B,KAAK+3B,KACXC,eAAgBh4B,KAAKg4B,eACrBQ,eAAgBA,EAChBP,kBAAmBA,EACnBC,mBAAoBA,EACpBE,QAASA,EACTC,gBAAiB,CACbvuB,KAAMu3B,EACNE,QAASD,GAEbhJ,WAAYt4B,KAAKs4B,WACjBloB,uBAAwBA,EACxB+nB,YAAa8I,EACT,WACQvwB,EAAMixB,gBACNjxB,EAAMixB,eAAe,CACjBp6B,OAAQ,CAAC,EACT7B,MAAO,CACH+yB,QAAS/nB,EAAM0kB,aAAa+G,gBAC5ByF,UAAWlxB,EAAM0kB,aAAa8D,eAAiB,CAAC,GAEpD2I,0BAA2BnxB,EAAMH,MAAM8I,SAAQ,IAG3D,OACE,IAEN4nB,GACAjhC,KAAKihC,mBACb,CA6YA,OA5YAP,EAAa16B,UAAUi7B,kBAAoB,WACvC,GAAsB,kBAAXC,OAAqB,CAC5B,IAAIY,EAAqBZ,OACrBa,EAAiBC,OAAOC,IAAI,oBAC/BH,EAAmBC,GAChBD,EAAmBC,IAAmB,IAAI7hC,KAAKF,MACnD8hC,EAAmBX,kBAAoBnhC,IAC3C,CAIKygC,IAA+C,IAAvB7tB,WAAWC,UACpC4tB,GAAuB,EACvBz+B,YAAW,WACP,GAAsB,qBAAXk/B,QACPA,OAAOt+B,UACPs+B,OAAOgB,MAAQhB,OAAOvhC,OACrBuhC,OAAOiB,gCAAiC,CACzC,IAAIC,EAAMlB,OAAOmB,UACbC,EAAKF,GAAOA,EAAIG,UAChBz9B,OAAM,EACQ,kBAAPw9B,IACHA,EAAGv+B,QAAQ,YAAc,EACzBe,EACI,uGAGCw9B,EAAGv+B,QAAQ,aAAe,IAC/Be,EACI,2EAGRA,IACuB,IAAvB8N,WAAWC,SAAqB,KAAU/S,IAAI,uEACxBgF,EAE9B,CACJ,GAAG,KAEX,EACAuG,OAAOm3B,eAAe9B,EAAa16B,UAAW,oBAAqB,CAM/DwI,IAAK,WACD,OAAOxO,KAAKo1B,aAAa6C,iBAC7B,EACAwK,YAAY,EACZC,cAAc,IAMlBhC,EAAa16B,UAAU3E,KAAO,WAC1BrB,KAAKo1B,aAAa/zB,MACtB,EAoBAq/B,EAAa16B,UAAU02B,WAAa,SAAUlyB,GAU1C,OATIxK,KAAKg4B,eAAe0E,aACpBlyB,GAAU,EAAAm4B,EAAA,GAAa3iC,KAAKg4B,eAAe0E,WAAYlyB,KAGvDxK,KAAKyhC,uBACoB,iBAAxBj3B,EAAQ4rB,aACmB,sBAAxB5rB,EAAQ4rB,cACZ5rB,GAAU,SAAS,QAAS,CAAC,EAAGA,GAAU,CAAE4rB,YAAa,iBAEtDp2B,KAAKo1B,aAAasH,WAAWlyB,EACxC,EAUAk2B,EAAa16B,UAAUwF,MAAQ,SAAUhB,GAQrC,OAPIxK,KAAKg4B,eAAexsB,QACpBhB,GAAU,EAAAm4B,EAAA,GAAa3iC,KAAKg4B,eAAexsB,MAAOhB,KAEtD,QAAkC,sBAAxBA,EAAQ4rB,YAAqC,IACnDp2B,KAAKyhC,uBAAiD,iBAAxBj3B,EAAQ4rB,cACtC5rB,GAAU,SAAS,QAAS,CAAC,EAAGA,GAAU,CAAE4rB,YAAa,iBAEtDp2B,KAAKo1B,aAAa5pB,MAAMhB,EACnC,EASAk2B,EAAa16B,UAAUszB,OAAS,SAAU9uB,GAItC,OAHIxK,KAAKg4B,eAAesB,SACpB9uB,GAAU,EAAAm4B,EAAA,GAAa3iC,KAAKg4B,eAAesB,OAAQ9uB,IAEhDxK,KAAKo1B,aAAakE,OAAO9uB,EACpC,EAKAk2B,EAAa16B,UAAUsC,UAAY,SAAUkC,GACzC,OAAOxK,KAAKo1B,aAAa8I,yBAAyB1zB,EACtD,EAUAk2B,EAAa16B,UAAUsL,UAAY,SAAU9G,EAASoG,GAElD,YADmB,IAAfA,IAAyBA,GAAa,GACnC5Q,KAAKuQ,MAAMe,UAAU9G,EAASoG,EACzC,EAiBA8vB,EAAa16B,UAAU0L,cAAgB,SAAUlH,GAC7C,OAAOxK,KAAKuQ,MAAMmB,cAAclH,EACpC,EAeAk2B,EAAa16B,UAAUqM,aAAe,SAAU7H,EAASoG,GAErD,YADmB,IAAfA,IAAyBA,GAAa,GACnC5Q,KAAKuQ,MAAM8B,aAAa7H,EAASoG,EAC5C,EAMA8vB,EAAa16B,UAAUsM,WAAa,SAAU9H,GAC1C,IAAIkM,EAAM1W,KAAKuQ,MAAM+B,WAAW9H,GAIhC,OAH0B,IAAtBA,EAAQmiB,WACR3sB,KAAKo1B,aAAayF,mBAEfnkB,CACX,EAYAgqB,EAAa16B,UAAUyM,cAAgB,SAAUjI,GAC7C,IAAIkM,EAAM1W,KAAKuQ,MAAMkC,cAAcjI,GAInC,OAH0B,IAAtBA,EAAQmiB,WACR3sB,KAAKo1B,aAAayF,mBAEfnkB,CACX,EACAgqB,EAAa16B,UAAU48B,wBAA0B,SAAUC,GACvD7iC,KAAK2hC,eAAiBkB,CAC1B,EACAnC,EAAa16B,UAAU88B,aAAe,SAAUh3B,GAC5C,OAAO,EAAAynB,EAAA,GAAQvzB,KAAK+3B,KAAMjsB,EAC9B,EAiBA40B,EAAa16B,UAAU07B,WAAa,WAChC,IAAIhxB,EAAQ1Q,KACZ,OAAOgtB,QAAQC,UACViC,MAAK,WACN,OAAOxe,EAAM0kB,aAAa+H,WAAW,CACjCpQ,gBAAgB,GAExB,IACKmC,MAAK,WAAc,OAAOlC,QAAQ2G,IAAIjjB,EAAMiwB,oBAAoBp4B,KAAI,SAAUw6B,GAAM,OAAOA,GAAM,IAAK,IACtG7T,MAAK,WAAc,OAAOxe,EAAMmtB,0BAA4B,GACrE,EAKA6C,EAAa16B,UAAUm3B,WAAa,WAChC,IAAIzsB,EAAQ1Q,KACZ,OAAOgtB,QAAQC,UACViC,MAAK,WACN,OAAOxe,EAAM0kB,aAAa+H,WAAW,CACjCpQ,gBAAgB,GAExB,IACKmC,MAAK,WAAc,OAAOlC,QAAQ2G,IAAIjjB,EAAMkwB,oBAAoBr4B,KAAI,SAAUw6B,GAAM,OAAOA,GAAM,IAAK,GAC/G,EAMArC,EAAa16B,UAAUg9B,aAAe,SAAUH,GAC5C,IAAInyB,EAAQ1Q,KAEZ,OADAA,KAAK2gC,oBAAoBzgC,KAAK2iC,GACvB,WACHnyB,EAAMiwB,oBAAsBjwB,EAAMiwB,oBAAoB14B,QAAO,SAAUukB,GAAK,OAAOA,IAAMqW,CAAI,GACjG,CACJ,EAMAnC,EAAa16B,UAAUi9B,aAAe,SAAUJ,GAC5C,IAAInyB,EAAQ1Q,KAEZ,OADAA,KAAK4gC,oBAAoB1gC,KAAK2iC,GACvB,WACHnyB,EAAMkwB,oBAAsBlwB,EAAMkwB,oBAAoB34B,QAAO,SAAUukB,GAAK,OAAOA,IAAMqW,CAAI,GACjG,CACJ,EAaAnC,EAAa16B,UAAU63B,yBAA2B,SAAUC,GACxD,OAAO99B,KAAKo1B,aAAayI,yBAAyBC,EACtD,EAYA4C,EAAa16B,UAAU8zB,eAAiB,SAAUtvB,GAC9C,IAAIjC,EAAMvI,KAAKo1B,aAAa0E,eAAetvB,GACvCiuB,EAAU,GACVsH,EAAU,GACdx3B,EAAIsF,SAAQ,SAAU5B,EAAQi3B,GAC1BzK,EAAQv4B,KAAKgjC,GACbnD,EAAQ7/B,KAAK+L,EACjB,IACA,IAAIA,EAAS+gB,QAAQ2G,IAAIoM,GAWzB,OARA9zB,EAAOwsB,QAAUA,EACjBxsB,EAAO8zB,QAAUA,EAIjB9zB,EAAOukB,OAAM,SAAUtrB,IACI,IAAvB0N,WAAWC,SAAqB,KAAUswB,MAAM,GAAIj+B,EACxD,IACO+G,CACX,EAYAy0B,EAAa16B,UAAUo3B,qBAAuB,SAAUrB,GAEpD,YADgB,IAAZA,IAAsBA,EAAU,UAC7B/7B,KAAKo1B,aAAagI,qBAAqBrB,EAClD,EAIA2E,EAAa16B,UAAUqT,QAAU,SAAUzI,GACvC,OAAO5Q,KAAKuQ,MAAM8I,QAAQzI,EAC9B,EAQA8vB,EAAa16B,UAAU0mB,QAAU,SAAU0W,GACvC,OAAOpjC,KAAKuQ,MAAMmc,QAAQ0W,EAC9B,EAIA1C,EAAa16B,UAAUorB,aAAe,SAAUH,GAC5CjxB,KAAKs4B,WAAWlH,aAAaH,EACjC,EAIAyP,EAAa16B,UAAUurB,aAAe,SAAUN,GAC5CjxB,KAAKs4B,WAAW/G,aAAaN,EACjC,EAIAyP,EAAa16B,UAAUwrB,aAAe,WAClC,OAAOxxB,KAAKs4B,WAAW9G,cAC3B,EAIAkP,EAAa16B,UAAUq9B,6BAA+B,SAAUnS,GAC5DlxB,KAAKs4B,WAAWjH,mBAAmBH,EACvC,EAIAwP,EAAa16B,UAAUs9B,QAAU,SAAUC,GACvCvjC,KAAK+3B,KAAO/3B,KAAKo1B,aAAa2C,KAAOwL,CACzC,EACAl4B,OAAOm3B,eAAe9B,EAAa16B,UAAW,iBAAkB,CAC5DwI,IAAK,WACD,OAAOxO,KAAKo1B,aAAaoD,cAC7B,EACAiK,YAAY,EACZC,cAAc,IAEXhC,CACX,CArfiC,IAufN,IAAvB9tB,WAAWC,UACX6tB,EAAa16B,UAAU8M,mBAAqB,K,4PCxgBzC,SAAS0wB,EAAah4B,EAAOO,EAAIC,EAAIN,GACxC,IAAI+3B,EAAQ13B,EAAGxH,KAAMm/B,GAAQ,QAAO33B,EAAI,CAAC,SACrC43B,EAAQ33B,EAAGzH,KAAMq/B,GAAQ,QAAO53B,EAAI,CAAC,SACzC,OAAQ,OAAM03B,EAAOE,IACjBC,GAAoB,QAAkBr4B,GAAOsJ,aAAc2uB,EAAOE,EAAO,CACrEpuB,aAAa,SAAkB,QAAuB/J,IACtDE,UAAWA,GAEvB,CACA,SAASm4B,EAAoB/uB,EAAcgvB,EAASC,EAASvwB,GACzD,GAAIswB,IAAYC,EACZ,OAAO,EAEX,IAAIC,EAAiB,IAAIr2B,IAIzB,OAAOmH,EAAaG,WAAWF,OAAM,SAAU6K,GAG3C,GAAIokB,EAAev1B,IAAImR,GACnB,OAAO,EAGX,GAFAokB,EAAen7B,IAAI+W,KAEd,QAAcA,EAAWpM,EAAQ9H,WAClC,OAAO,EAGX,GAAIu4B,EAAiCrkB,GACjC,OAAO,EACX,IAAI,QAAQA,GAAY,CACpB,IAAIskB,GAAY,QAAuBtkB,GACnCukB,EAAeL,GAAWA,EAAQI,GAClCE,EAAeL,GAAWA,EAAQG,GAClCG,EAAoBzkB,EAAU9K,aAClC,IAAKuvB,EAGD,OAAO,OAAMF,EAAcC,GAE/B,IAAIE,EAAgBpxB,MAAMC,QAAQgxB,GAC9BI,EAAgBrxB,MAAMC,QAAQixB,GAClC,GAAIE,IAAkBC,EAClB,OAAO,EACX,GAAID,GAAiBC,EAAe,CAChC,IAAIC,EAAWL,EAAargC,OAC5B,GAAIsgC,EAAatgC,SAAW0gC,EACxB,OAAO,EAEX,IAAK,IAAI93B,EAAI,EAAGA,EAAI83B,IAAY93B,EAC5B,IAAKm3B,EAAoBQ,EAAmBF,EAAaz3B,GAAI03B,EAAa13B,GAAI8G,GAC1E,OAAO,EAGf,OAAO,CACX,CACA,OAAOqwB,EAAoBQ,EAAmBF,EAAcC,EAAc5wB,EAC9E,CAEI,IAAI5B,GAAW,QAAyBgO,EAAWpM,EAAQ+B,aAC3D,OAAI3D,IAGIqyB,EAAiCryB,IAE9BiyB,EAAoBjyB,EAASkD,aAKpCgvB,EAASC,EAASvwB,QAVtB,CAaR,GACJ,CACA,SAASywB,EAAiCrkB,GACtC,QAAUA,EAAUkC,YAAclC,EAAUkC,WAAW6Q,KAAK8R,EAChE,CACA,SAASA,EAAuBha,GAC5B,MAA0B,gBAAnBA,EAAI3gB,KAAK1C,KACpB,CC/EA,IAAI,EAASiE,OAAOC,OAAQ,EAAiBD,OAAOyB,eAChD8vB,EAAiC,SAAU5pB,GAE3C,SAAS4pB,EAAgB7wB,GACrB,IAAIqpB,EAAerpB,EAAGqpB,aAAciH,EAAYtwB,EAAGswB,UAAW7xB,EAAUuB,EAAGvB,QACvEkG,EAAQsC,EAAOxN,KAAKxF,MAAM,SAAUiL,GAGpC,IACI,IAAIy5B,EAAcz5B,EAAS05B,cAAcC,UACrCF,IAAgBA,EAAYx/B,QAC5Bw/B,EAAYx/B,MAAQ2/B,EAE5B,CACA,MAAO94B,GAAM,CACb,IAAI+4B,GAASp0B,EAAMuf,UAAU5K,KAC7B3U,EAAMuf,UAAUpnB,IAAIoC,GAEpB,IAAI85B,EAAOr0B,EAAMq0B,KAgBjB,OAfIA,GAAQA,EAAK7/B,MACb+F,EAAS/F,OAAS+F,EAAS/F,MAAM6/B,EAAK7/B,OAEjC6/B,GAAQA,EAAK94B,QAClBhB,EAASkB,MAAQlB,EAASkB,KAAK44B,EAAK94B,QAIpC64B,GAKAp0B,EAAMs0B,YAAYxU,OAAM,WAAc,IAEnC,WACC9f,EAAMuf,UAAUlX,OAAO9N,KAAcyF,EAAMuf,UAAU5K,MACrD3U,EAAMu0B,eAEd,CACJ,KAAMjlC,KACN0Q,EAAMuf,UAAY,IAAItiB,IACtB+C,EAAMvM,cAAgB,IAAIwJ,IAE1B+C,EAAM2rB,UAAYA,EAClB3rB,EAAM0kB,aAAeA,EAErB1kB,EAAMw0B,iBAAmBC,EAAiB36B,EAAQ4rB,aAClD1lB,EAAM00B,YAAa,EACnB,IAAIp5B,EAAKopB,EAAa4C,eAAe0E,WAA0C1d,QAAlB,IAAPhT,EAAgB,CAAC,EAAIA,GAAYoqB,YAAaiP,OAA4B,IAAPrmB,EAAgB,cAAgBA,EACrJuZ,EAAK/tB,EAAQ4rB,YAAaA,OAAqB,IAAPmC,EAAgB8M,EAAqB9M,EAEjFwB,EAAKvvB,EAAQ86B,mBAEbA,OAA4B,IAAPvL,EAAgC,YAAhB3D,EAA4BiP,EAAqB,EAAgBtL,EACtGrpB,EAAMlG,SAAU,SAAS,QAAS,CAAC,EAAGA,GAAU,CAI5C86B,mBAAoBA,EAGpBlP,YAAaA,IACjB1lB,EAAM2kB,QAAUgH,EAAUhH,SAAWD,EAAaE,kBAClD,IAAIiQ,GAAQ,QAAuB70B,EAAMlF,OAEzC,OADAkF,EAAM4qB,UAAYiK,GAASA,EAAMz7B,MAAQy7B,EAAMz7B,KAAK1C,MAC7CsJ,CACX,CAyqBA,OAzuBA,QAAUksB,EAAiB5pB,GAiE3B3H,OAAOm3B,eAAe5F,EAAgB52B,UAAW,QAAS,CAKtDwI,IAAK,WACD,OAAOxO,KAAKwlC,WAAaxlC,KAAKwK,QAAQgB,KAC1C,EACAi3B,YAAY,EACZC,cAAc,IAElBr3B,OAAOm3B,eAAe5F,EAAgB52B,UAAW,YAAa,CAM1DwI,IAAK,WACD,OAAOxO,KAAKwK,QAAQkB,SACxB,EACA+2B,YAAY,EACZC,cAAc,IAElB9F,EAAgB52B,UAAUiG,OAAS,WAC/B,IAAIyE,EAAQ1Q,KACZ,OAAO,IAAIgtB,SAAQ,SAAUC,EAAStmB,GAIlC,IAAIsE,EAAW,CACXkB,KAAM,SAAUF,GACZghB,EAAQhhB,GAWRyE,EAAMuf,UAAUlX,OAAO9N,GAClByF,EAAMuf,UAAU5K,MACjB3U,EAAM0kB,aAAaqJ,YAAY/tB,EAAM2kB,SAEzCrzB,YAAW,WACP8F,EAAaL,aACjB,GAAG,EACP,EACAvC,MAAOyB,GAEPmB,EAAe4I,EAAMpI,UAAU2C,EACvC,GACJ,EAEA2xB,EAAgB52B,UAAU+vB,UAAY,WAClC/1B,KAAKq8B,UAAUtG,WACnB,EACA6G,EAAgB52B,UAAUy/B,iBAAmB,SAAUC,QAC1B,IAArBA,IAA+BA,GAAmB,GAEtD,IAAIC,EAAa3lC,KAAK4lC,eAAc,GAChClQ,EAAgB11B,KAAKq8B,UAAU3G,eAC9BiQ,GAAcA,EAAWjQ,eAC1B,KAAc+B,MACdxrB,GAAS,SAAS,QAAS,CAAC,EAAG05B,GAAa,CAAEhQ,SAAS,QAAyBD,GAAgBA,cAAeA,IAC/G3pB,EAAK/L,KAAKwK,QAAQ4rB,YAAaA,OAAqB,IAAPrqB,EAAgB,cAAgBA,EACjF,GAGAo5B,EAAiB/O,IAKbp2B,KAAKo1B,aAAaqF,gBAAgBz6B,KAAKwL,OAAO+wB,yBAG7C,GAAIv8B,KAAKklC,iBAIVllC,KAAKq8B,UAAuB,kBAE3B,CACD,IAAIlqB,EAAOnS,KAAKq8B,UAAUrG,WACtB7jB,EAAK9F,UAAYrM,KAAKwK,QAAQuH,qBAC9B9F,EAAO1H,KAAO4N,EAAKlG,SAEnB,OAAMA,EAAO1H,KAAM,CAAC,KACpB0H,EAAO1H,UAAO,GAEd4N,EAAK9F,iBAGEJ,EAAOo0B,SAIVluB,EAAK9F,UACLJ,EAAOypB,gBAAkB,KAAcC,SACtB,gBAAhBS,GAAiD,eAAhBA,IAClCnqB,EAAOypB,cAAgB,KAAc+B,MACrCxrB,EAAO0pB,SAAU,IAIrB1pB,EAAOo0B,SAAU,GAEM,IAAvBztB,WAAWC,SACVV,EAAK9F,UACLrM,KAAKwK,QAAQq7B,gBACb55B,EAAO0pB,SACP1pB,EAAO1H,MACP0H,EAAO/G,OACR4gC,EAAsB3zB,EAAKC,QAEnC,CAIA,OAHIszB,GACA1lC,KAAK+lC,iBAAiB95B,GAEnBA,CACX,EAGA2wB,EAAgB52B,UAAUggC,0BAA4B,SAAUC,EAAWv6B,GACvE,OAAK1L,KAAK+kC,QAGc/kC,KAAKo1B,aAAaqF,gBAAgBz6B,KAAKwL,OAAOgxB,yBACjEgH,EAAaxjC,KAAKwL,MAAOxL,KAAK+kC,KAAK94B,OAAQg6B,EAAWjmC,KAAK0L,aACzD,OAAM1L,KAAK+kC,KAAK94B,OAAQg6B,KACDv6B,KAAc,OAAM1L,KAAK+kC,KAAKr5B,UAAWA,GAC3E,EACAkxB,EAAgB52B,UAAUkgC,QAAU,SAAU/+B,EAAKg/B,GAC/C,IAAIpB,EAAO/kC,KAAK+kC,KAChB,GAAIA,GACAA,EAAK59B,MACHg/B,IAAsB,OAAMpB,EAAKr5B,UAAW1L,KAAK0L,YACnD,OAAOq5B,EAAK59B,EAEpB,EACAy1B,EAAgB52B,UAAU4/B,cAAgB,SAAUO,GAChD,OAAOnmC,KAAKkmC,QAAQ,SAAUC,EAClC,EACAvJ,EAAgB52B,UAAUogC,aAAe,SAAUD,GAC/C,OAAOnmC,KAAKkmC,QAAQ,QAASC,EACjC,EACAvJ,EAAgB52B,UAAUg4B,iBAAmB,kBAClCh+B,KAAK+kC,KACZ/kC,KAAKolC,YAAa,CACtB,EACAxI,EAAgB52B,UAAUqgC,sBAAwB,WAC9CrmC,KAAKo1B,aAAagH,YAAYp8B,KAAKq1B,QACvC,EAQAuH,EAAgB52B,UAAUi4B,QAAU,SAAUvyB,GAC1C,IAAIK,EACAu6B,EAAmB,CAEnBzJ,aAAc,GAKdzG,EAAcp2B,KAAKwK,QAAQ4rB,YAU/B,GARIkQ,EAAiBlQ,YADD,sBAAhBA,EAC+BA,EAEV,aAAhBA,EAC0B,WAGA,gBAER,IAAvBxjB,WAAWC,SAAqBnH,GAAa,EAAelG,KAAKkG,EAAW,aAAc,CAC1F,IAAI66B,GAAW,QAAmBvmC,KAAKwL,OACnCwiB,EAAOuY,EAASC,oBACfxY,GAASA,EAAK2E,MAAK,SAAU8T,GAAK,MAAiC,cAA1BA,EAAEC,SAAS58B,KAAK1C,KAAuB,MAC1D,IAAvBwL,WAAWC,SAAqB,KAAUnE,KACtC,GACAhD,GAC0B,QAAxBK,EAAKw6B,EAASz8B,YAAyB,IAAPiC,OAAgB,EAASA,EAAG3E,QAAUm/B,EAGpF,CAMA,OALI76B,KAAc,OAAM1L,KAAKwK,QAAQkB,UAAWA,KAE5C46B,EAAiB56B,UAAY1L,KAAKwK,QAAQkB,WAAY,SAAS,QAAS,CAAC,EAAG1L,KAAKwK,QAAQkB,WAAYA,IAEzG1L,KAAKq8B,UAAUvF,iBACR92B,KAAKglC,UAAUsB,EAAkB,KAAcrI,QAC1D,EAIArB,EAAgB52B,UAAU2gC,UAAY,SAAUC,GAC5C,IAAIl2B,EAAQ1Q,KACR6mC,GAAkB,SAAS,QAAS,CAAC,EAAID,EAAiBp7B,MAAQo7B,GAAoB,SAAS,SAAS,SAAS,QAAS,CAAC,EAAG5mC,KAAKwK,SAAU,CAAEgB,MAAOxL,KAAKwK,QAAQgB,QAAUo7B,GAAmB,CAAEl7B,WAAW,SAAS,QAAS,CAAC,EAAG1L,KAAKwK,QAAQkB,WAAYk7B,EAAiBl7B,cAAkB,CAM/R0qB,YAAa,aACjByQ,EAAgBr7B,MAAQxL,KAAKiR,kBAAkB41B,EAAgBr7B,OAC/D,IAAIs7B,EAAM9mC,KAAKo1B,aAAaE,kBAM5Bt1B,KAAKwlC,UACDoB,EAAiBp7B,MACbxL,KAAKiR,kBAAkBjR,KAAKwK,QAAQgB,OAClCq7B,EAAgBr7B,MAG1B,IAAI6wB,EAAYr8B,KAAKq8B,UACjB0K,EAAwB1K,EAAU3G,cACtC2G,EAAU3G,cAAgB,KAAciR,UACpCE,EAAgBlK,6BAChB38B,KAAKgnC,UAET,IAAIC,EAAkB,IAAIt5B,IAC1B,OAAO3N,KAAKo1B,aACP4G,WAAW8K,EAAKD,EAAiB,KAAcF,WAC/CzX,MAAK,SAAUgY,GA6ChB,OA5CAx2B,EAAM0kB,aAAaqJ,YAAYqI,GAC3BzK,EAAU3G,gBAAkB,KAAciR,YAC1CtK,EAAU3G,cAAgBqR,GAO9Br2B,EAAM0kB,aAAa7kB,MAAMC,MAAM,CAC3BM,OAAQ,SAAUP,GACd,IAAImC,EAAck0B,EAAiBl0B,YAC/BA,EACAnC,EAAMmC,YAAY,CACdlH,MAAOkF,EAAMlF,MACbE,UAAWgF,EAAMhF,UACjBqG,mBAAmB,EACnBnB,YAAY,IACb,SAAUu2B,GACT,OAAOz0B,EAAYy0B,EAAU,CACzBD,gBAAiBA,EAAgB3iC,KACjCmH,UAAWm7B,EAAgBn7B,WAEnC,IAQA6E,EAAM+B,WAAW,CACb9G,MAAOq7B,EAAgBr7B,MACvBE,UAAWm7B,EAAgBn7B,UAC3BnH,KAAM2iC,EAAgB3iC,MAGlC,EACA8oB,eAAgB,SAAUrb,GAGtBi1B,EAAgBp+B,IAAImJ,EAAMxG,MAC9B,IAEG07B,CACX,IACKpK,SAAQ,WAMJmK,EAAgBx4B,IAAIiC,EAAMlF,QAC3B47B,EAAoB12B,EAE5B,GACJ,EASAksB,EAAgB52B,UAAUqhC,gBAAkB,SAAU78B,GAClD,IAAIkG,EAAQ1Q,KACR8H,EAAe9H,KAAKo1B,aACnB8I,yBAAyB,CAC1B1yB,MAAOhB,EAAQ5H,SACf8I,UAAWlB,EAAQkB,UACnB8H,QAAShJ,EAAQgJ,UAEhBlL,UAAU,CACX6D,KAAM,SAAUm7B,GACZ,IAAI50B,EAAclI,EAAQkI,YACtBA,GACAhC,EAAMgC,aAAY,SAAUy0B,EAAUp7B,GAClC,IAAIL,EAAYK,EAAGL,UACnB,OAAOgH,EAAYy0B,EAAU,CACzBG,iBAAkBA,EAClB57B,UAAWA,GAEnB,GAER,EACAxG,MAAO,SAAU+1B,GACTzwB,EAAQ+8B,QACR/8B,EAAQ+8B,QAAQtM,IAGG,IAAvBroB,WAAWC,SAAqB,KAAU3N,MAAM,GAAI+1B,EACxD,IAGJ,OADAj7B,KAAKmE,cAAc0E,IAAIf,GAChB,WACC4I,EAAMvM,cAAc4U,OAAOjR,IAC3BA,EAAaL,aAErB,CACJ,EACAm1B,EAAgB52B,UAAUwhC,WAAa,SAAUC,GAC7C,OAAOznC,KAAKglC,UAAUyC,EAC1B,EACA7K,EAAgB52B,UAAU0hC,iBAAmB,SAAUD,GACnD,IAAIE,GAAgB,EAAA3pB,EAAA,GAAQhe,KAAKwK,QAASi9B,GAAc,CAAC,GACzD,EAAOznC,KAAKwK,QAASm9B,EACzB,EAmBA/K,EAAgB52B,UAAU4vB,aAAe,SAAUlqB,GAC/C,OAAI,OAAM1L,KAAK0L,UAAWA,GAIf1L,KAAKiwB,UAAU5K,KAAOrlB,KAAKiM,SAAW+gB,QAAQC,WAEzDjtB,KAAKwK,QAAQkB,UAAYA,EAEpB1L,KAAKiwB,UAAU5K,KAGbrlB,KAAKglC,UAAU,CAElB5O,YAAap2B,KAAKwK,QAAQ86B,mBAC1B55B,UAAWA,GACZ,KAAckqB,cANN5I,QAAQC,UAOvB,EAMA2P,EAAgB52B,UAAU0M,YAAc,SAAUqc,GAC9C,IAAIqG,EAAep1B,KAAKo1B,aAOpB6Q,EAAYlX,EANHqG,EAAa7kB,MAAM4B,KAAK,CACjC3G,MAAOxL,KAAKwK,QAAQgB,MACpBE,UAAW1L,KAAK0L,UAChBqG,mBAAmB,EACnBnB,YAAY,IACb3E,OAC2B,CAC1BP,UAAW1L,KAAK0L,YAEhBu6B,IACA7Q,EAAa7kB,MAAM+B,WAAW,CAC1B9G,MAAOxL,KAAKwK,QAAQgB,MACpBjH,KAAM0hC,EACNv6B,UAAW1L,KAAK0L,YAEpB0pB,EAAayF,mBAErB,EAIA+B,EAAgB52B,UAAU9E,aAAe,SAAU27B,GAC/C78B,KAAKwK,QAAQqyB,aAAeA,EAC5B78B,KAAK4nC,eACT,EAIAhL,EAAgB52B,UAAU1E,YAAc,WACpCtB,KAAKwK,QAAQqyB,aAAe,EAC5B78B,KAAK4nC,eACT,EAEAhL,EAAgB52B,UAAU6hC,qBAAuB,SAAUzhC,EAK3DoE,GACI,GAAIA,EAAQs9B,gBAAiB,CACzB,IAAI/7B,EAAKvB,EAAQ4rB,YAAaA,OAAqB,IAAPrqB,EAAgB,cAAgBA,EAAIC,EAAKxB,EAAQ86B,mBAAoBA,OAA4B,IAAPt5B,EAAgBoqB,EAAcpqB,EAChJ,YAAhBoqB,IAGwC,oBAA5B5rB,EAAQs9B,gBAWpBt9B,EAAQ4rB,YAAc5rB,EAAQs9B,gBAAgB1R,EAAa,CACvDhwB,OAAQA,EACRoE,QAASA,EACTskB,WAAY9uB,KACZslC,mBAAoBA,IAIxB96B,EAAQ4rB,YADQ,sBAAXhwB,EACiBk/B,EAGA96B,EAAQs9B,gBAEtC,CACA,OAAOt9B,EAAQ4rB,WACnB,EACAwG,EAAgB52B,UAAU+hC,MAAQ,SAAUv9B,EAASw9B,EAAkBx8B,GAInE,OADAxL,KAAKo1B,aAAaU,mBAAmB91B,MAC9BA,KAAKo1B,aAAmC,qBAAEp1B,KAAKq1B,QAAS7qB,EAASw9B,EAAkBx8B,EAC9F,EAEAoxB,EAAgB52B,UAAU4hC,cAAgB,WACtC,IAAIl3B,EAAQ1Q,KAEZ,IAAIA,KAAKo1B,aAAagD,QAAtB,CAGA,IAAe6P,EAANjoC,KAAuBioC,YAAapL,EAApC78B,KAAsDwK,QAAQqyB,aACvE,GAAKA,GAOL,IAAIoL,GAAeA,EAAYC,WAAarL,EAA5C,EAGA,QAAUA,EAAc,KACboL,IAAgBjoC,KAAKioC,YAAc,CAAC,IAC1CC,SAAWrL,EAChB,IAAIsL,EAAa,WACb,IAAIp8B,EAAIC,EACJ0E,EAAMu3B,eACD,QAAyBv3B,EAAM2rB,UAAU3G,iBACQ,QAA/C1pB,GAAMD,EAAK2E,EAAMlG,SAAS49B,uBAAoC,IAAPp8B,OAAgB,EAASA,EAAGxG,KAAKuG,IAY3FlK,IAXA6O,EAAMs0B,UAAU,CAKZ5O,YAAkD,aAArC1lB,EAAMlG,QAAQ86B,mBACvB,WACE,gBACP,KAAczjC,MAAMqtB,KAAKrtB,EAAMA,GAM9C,EACIA,EAAO,WACP,IAAIgf,EAAOnQ,EAAMu3B,YACbpnB,IACA/e,aAAa+e,EAAKwnB,SAClBxnB,EAAKwnB,QAAUrmC,WAAWmmC,EAAYtnB,EAAKqnB,UAEnD,EACArmC,GA/BA,OARQomC,IACAnmC,aAAammC,EAAYI,gBAClBroC,KAAKioC,YALpB,CA2CJ,EACArL,EAAgB52B,UAAU+/B,iBAAmB,SAAUE,EAAWv6B,QAC5C,IAAdA,IAAwBA,EAAY1L,KAAK0L,WAC7C,IAAIxG,EAAQlF,KAAKomC,eAKjB,OAHIlhC,GAASlF,KAAK+kC,QAAS,OAAMr5B,EAAW1L,KAAK+kC,KAAKr5B,aAClDxG,OAAQ,GAEJlF,KAAK+kC,MAAO,QAAS,CAAE94B,OAAQjM,KAAKo1B,aAAahlB,uBACjD61B,GACE,EAAA/b,EAAA,GAAU+b,GAAYv6B,UAAWA,GAAcxG,EAAQ,CAAEA,MAAOA,GAAU,KACxF,EACA03B,EAAgB52B,UAAUsiC,mBAAqB,SAAUb,EAAYO,GACjE,IAAIt3B,EAAQ1Q,KACZA,KAAKolC,YAAa,EAClB,IAAImD,EAIJP,IAAqB,KAAc/J,SAG/B+J,IAAqB,KAAcrB,WAGnCqB,IAAqB,KAAcnmC,KAEnC2mC,EAAexoC,KAAKwK,QAAQkB,UAC5B+8B,EAAiBzoC,KAAKwK,QAAQ4rB,YAC9BuR,GAAgB,EAAA3pB,EAAA,GAAQhe,KAAKwK,QAASi9B,GAAc,CAAC,GACrDj9B,EAAU+9B,EAGVZ,EACE,EAAO3nC,KAAKwK,QAASm9B,GAKvBn8B,EAAQxL,KAAKiR,kBAAkBzG,EAAQgB,OAC3CxL,KAAKwlC,UAAYh6B,EACZ+8B,IAEDvoC,KAAK4nC,gBAGDH,GACAA,EAAW/7B,aACV,OAAM+7B,EAAW/7B,UAAW88B,IAEL,YAAxBh+B,EAAQ4rB,aAGR5rB,EAAQ4rB,cAAgBqS,IACxBzoC,KAAK6nC,qBAAqB,oBAAqBr9B,QACtB,IAArBw9B,IACAA,EAAmB,KAAcpS,gBAI7C51B,KAAKklC,mBAAqBllC,KAAKklC,iBAAmBC,EAAiB36B,EAAQ4rB,cAC3E,IAAIsS,EAA4B,WACxBh4B,EAAMwrB,UAAYA,IAClBxrB,EAAMw0B,kBAAmB,EAEjC,EACIx5B,EAAYlB,EAAQkB,YAAa,QAAS,CAAC,EAAGlB,EAAQkB,WACtDK,EAAK/L,KAAK+nC,MAAMv9B,EAASw9B,EAAkBx8B,GAAQ0wB,EAAUnwB,EAAGmwB,QAAS2D,EAAW9zB,EAAG8zB,SACvF50B,EAAW,CACXkB,KAAM,SAAUF,IACR,OAAMyE,EAAMhF,UAAWA,KACvBg9B,IACAh4B,EAAMi4B,aAAa18B,EAAQP,GAEnC,EACAxG,MAAO,SAAUA,IACT,OAAMwL,EAAMhF,UAAWA,KACvBg9B,IACAh4B,EAAMk4B,YAAY1jC,EAAOwG,GAEjC,GAYJ,OAVK68B,IAAyB1I,GAAa7/B,KAAKk8B,UAGxCl8B,KAAKk8B,SAAWl8B,KAAKiL,UACrBjL,KAAKk8B,QAAQlM,eAAehwB,KAAKiL,UAErCjL,KAAKk8B,QAAUA,EACfl8B,KAAKiL,SAAWA,GAEpBixB,EAAQnM,YAAY9kB,GACbixB,CACX,EACAU,EAAgB52B,UAAUg/B,UAAY,SAAUyC,EAAYO,GACxD,OAAOhoC,KAAKsoC,mBAAmBb,EAAYO,GACtC9X,OACT,EACA0M,EAAgB52B,UAAU6iC,sBAAwB,WAE9C,IADA,IAAI3/B,EAAO,GACFwG,EAAK,EAAGA,EAAK9C,UAAU9I,OAAQ4L,IACpCxG,EAAKwG,GAAM9C,UAAU8C,GAQzB,IAAIq1B,EAAO/kC,KAAK+kC,KAChB/kC,KAAKg+B,mBACL,IAAIl2B,EAAe9H,KAAKsI,UAAUyE,MAAM/M,KAAMkJ,GAE9C,OADAlJ,KAAK+kC,KAAOA,EACLj9B,CACX,EAGA80B,EAAgB52B,UAAUghC,QAAU,WAChChnC,KAAK2oC,aAKL3oC,KAAKylC,kBAAiB,GAAQzlC,KAAK0L,UACvC,EACAkxB,EAAgB52B,UAAU2iC,aAAe,SAAU18B,EAAQP,GACvD,IAAIo9B,EAAY9oC,KAAKomC,eACjB2C,EAAc/oC,KAAKgmC,0BAA0B/5B,EAAQP,IAKrDo9B,IAAc78B,EAAOo0B,SAAWrgC,KAAKwK,QAAQuH,oBAC7C/R,KAAK+lC,iBAAiB95B,EAAQP,IAE9Bo9B,GAAaC,KACb,OAAuB/oC,KAAKiwB,UAAW,OAAQhkB,EAEvD,EACA2wB,EAAgB52B,UAAU4iC,YAAc,SAAU1jC,EAAOwG,GAGrD,IAAIs9B,GAAc,SAAS,QAAS,CAAC,EAAGhpC,KAAK4lC,iBAAkB,CAAE1gC,MAAOA,EAAOgH,OAAQhH,EAAMuqB,cAAeiG,cAAe,KAAcxwB,MAAOywB,SAAS,IACzJ31B,KAAK+lC,iBAAiBiD,EAAat9B,IACnC,OAAuB1L,KAAKiwB,UAAW,QAAUjwB,KAAK+kC,KAAK7/B,MAAQA,EACvE,EACA03B,EAAgB52B,UAAUw3B,aAAe,WACrC,OAAOx9B,KAAKiwB,UAAU5K,KAAO,CACjC,EACAuX,EAAgB52B,UAAUi/B,cAAgB,WAClCjlC,KAAKolC,aAELplC,KAAKk8B,SAAWl8B,KAAKiL,WACrBjL,KAAKk8B,QAAQlM,eAAehwB,KAAKiL,iBAC1BjL,KAAKk8B,eACLl8B,KAAKiL,UAEhBjL,KAAKsB,cAELtB,KAAKmE,cAAc0J,SAAQ,SAAUyhB,GAAO,OAAOA,EAAI7nB,aAAe,IACtEzH,KAAKmE,cAAc0L,QACnB7P,KAAKo1B,aAAa2H,UAAU/8B,KAAKq1B,SACjCr1B,KAAKiwB,UAAUpgB,QACf7P,KAAKolC,YAAa,EACtB,EACAxI,EAAgB52B,UAAUiL,kBAAoB,SAAUrO,GACpD,OAAO5C,KAAKo1B,aAAa1H,UAAU9qB,EACvC,EACOg6B,CACX,CA3uBoC,CA2uBlC,KAYK,SAASwK,EAAoBlE,GAChC,IAAIn3B,EAAKm3B,EAAS14B,QAAS4rB,EAAcrqB,EAAGqqB,YAAa0R,EAAkB/7B,EAAG+7B,gBAC9E,MAAoB,sBAAhB1R,GAAuD,iBAAhBA,EAChC8M,EAAS8B,UAAU,CACtB5O,YAAa,cAGb0R,gBAAiB,SAAUmB,EAAoBz1B,GAM3C,OAHAxT,KAAK8nC,gBAAkBA,EAGa,oBAAzB9nC,KAAK8nC,gBACL9nC,KAAK8nC,gBAAgBmB,EAAoBz1B,GAG7C4iB,CACX,IAGD8M,EAAS8B,WACpB,CACA,SAASH,EAAyC3/B,IACvB,IAAvB0N,WAAWC,SAAqB,KAAU3N,MAAM,GAAIA,EAAMe,QAASf,EAAMgkC,MAC7E,CACO,SAASpD,EAAsB1zB,IACP,IAAvBQ,WAAWC,SAAqBT,IACT,IAAvBQ,WAAWC,SAAqB,KAAUswB,MAAM,GAAI/wB,EAE5D,CACA,SAAS+yB,EAAiB/O,GACtB,MAAwB,iBAAhBA,GACY,aAAhBA,GACgB,YAAhBA,CACR,EA3CA,OAAsBwG,E,mvDCtvBXuM,E,sDAERA,IAAUA,EAAQ,CAAC,G,iFCDXvsB,EAAQrS,EAAA,EAAWqS,MCAnB/K,EAAOtH,EAAA,EAAWsH,K,WCAlB+B,EAASrJ,EAAA,EAAWqJ,O,uDCIpBw1B,EAA0B,WACjC,GAA+B,qBAApBC,gBACP,MAAO,CAAEC,YAAY,EAAOC,QAAQ,GACxC,IAAID,EAAa,IAAID,gBAErB,MAAO,CAAEC,WAAYA,EAAYC,OADpBD,EAAWC,OAE5B,E,2CCVO,SAASC,EAAU1a,GACtB,IAAI2a,GAAY,EAChB,OAAO,IAAIzc,SAAQ,SAAUC,EAAStmB,GAClCmoB,EAAWxmB,UAAU,CACjB6D,KAAM,SAAU5H,GACRklC,GACuB,IAAvB72B,WAAWC,SAAqB,KAAUnE,KAAK,KAG/C+6B,GAAY,EACZxc,EAAQ1oB,GAEhB,EACAW,MAAOyB,GAEf,GACJ,C,eChBO,SAAS+iC,EAAYxZ,GACxB,OAAO,IAAI,KAAW,SAAUjlB,GAC5BilB,EACKhB,MAAK,SAAU9nB,GAChB6D,EAASkB,KAAK/E,GACd6D,EAASoB,UACb,IACKmkB,MAAMvlB,EAAS/F,MAAMtE,KAAKqK,GACnC,GACJ,C,uECUA,SAAoC,IAAvB2H,WAAWC,QAAoB,MAAQ,S,oLCfhD82B,EAAkC,WAClC,SAASA,EAAiB59B,GACtB,IAAI69B,EAAgB79B,EAAG69B,cAAeC,EAAgB99B,EAAG89B,cAAeC,EAAW/9B,EAAG+9B,SAAUC,EAAeh+B,EAAGg+B,aAAcC,EAAWj+B,EAAGi+B,SAE9IhqC,KAAKiqC,aAAe,IAAIh9B,IACxBjN,KAAKkqC,yBAA2B,IAAIj9B,IACpCjN,KAAK4pC,cAAgBA,EACrB5pC,KAAK6pC,cAAgBA,EACrB7pC,KAAK8pC,SAAWA,GAAY,EAC5B9pC,KAAK+pC,aAAeA,EACpB/pC,KAAKgqC,SAAWA,GAAY,WAAe,MAAO,EAAK,CAC3D,CAgIA,OA/HAL,EAAiB3jC,UAAUmkC,eAAiB,SAAUt/B,GAClD,IAAI6F,EAAQ1Q,KACRoqC,GAAc,SAAS,QAAS,CAAC,EAAGv/B,GAAU,CAAEsB,KAAM,GAAIjH,MAAO,GAAImH,SAAU,GAAIg+B,YAAa,IAAI18B,MACpGxG,EAAMnH,KAAKgqC,SAASn/B,EAAQC,WAgDhC,OA/CKs/B,EAAYtb,aACbsb,EAAYtb,WAAa,IAAI,KAAW,SAAU7jB,GAC9C,IAAIuF,EAAQE,EAAMu5B,aAAaz7B,IAAIrH,GAC9BqJ,GACDE,EAAMu5B,aAAat7B,IAAIxH,EAAMqJ,EAAQ,IAAI7C,KAI7C,IAAI28B,EAAwC,IAAf95B,EAAM6U,KAC/BklB,EAAqD,IAAjCH,EAAYC,YAAYhlB,KAuBhD,OAtBA+kB,EAAYC,YAAYxhC,IAAIoC,GACxBs/B,GACA/5B,EAAM3H,IAAIuhC,GAGVn/B,EAASkB,MACTi+B,EAAYj+B,KAAKjM,KAAK+K,EAASkB,KAAKvL,KAAKqK,IAEzCA,EAAS/F,OACTklC,EAAYllC,MAAMhF,KAAK+K,EAAS/F,MAAMtE,KAAKqK,IAE3CA,EAASoB,UACT+9B,EAAY/9B,SAASnM,KAAK+K,EAASoB,SAASzL,KAAKqK,KAGjDq/B,GAA0B55B,EAAMk5B,gBAChCl5B,EAAM85B,yBAAyBrjC,GAG/BqJ,EAAM6U,OAAS3U,EAAMo5B,UACrBp5B,EAAM+5B,aAAatjC,GAEhB,WACH,IAAI4E,EAEAq+B,EAAYC,YAAYtxB,OAAO9N,IAC/Bm/B,EAAYC,YAAYhlB,KAAO,GAE3B7U,EAAMuI,OAAOqxB,IAAgB55B,EAAM6U,KAAO,IAC1C3U,EAAM+5B,aAAatjC,GAEW,QAA7B4E,EAAKyE,EAAM1I,oBAAiC,IAAPiE,GAAyBA,EAAGtE,cAG9E,CACJ,KAEG2iC,EAAYtb,UACvB,EAGA6a,EAAiB3jC,UAAUykC,aAAe,SAAUtjC,QACpC,IAARA,IAAkBA,EAAM,IAC5B,IAAIqJ,EAAQxQ,KAAKiqC,aAAaz7B,IAAIrH,GAGlC,GADAnH,KAAKiqC,aAAalxB,OAAO5R,GACpBqJ,GAAUA,EAAM6U,KAArB,CAIA,IAAIqlB,EAAa,GACbC,EAAW,GACXC,EAAc,GACdC,EAAQ,GACR3+B,EAAS,GACT4+B,EAAY,GAIhBt6B,EAAM3C,SAAQ,SAAUhD,GACpB6/B,EAAWxqC,KAAK2K,EAAQC,WACxB6/B,EAASzqC,KAAK2K,EAAQkgC,SACtBH,EAAY1qC,KAAK2K,EAAQikB,YACzB+b,EAAM3qC,KAAK2K,EAAQsB,MACnBD,EAAOhM,KAAK2K,EAAQ3F,OACpB4lC,EAAU5qC,KAAK2K,EAAQwB,SAC3B,IACA,IAAI2+B,EAAoBhrC,KAAK+pC,aAAaW,EAAYC,IAAa,IAAW1L,KAC1EsI,EAAU,SAAUriC,GAEpBgH,EAAO2B,SAAQ,SAAUo9B,GACjBA,GAEAA,EAAUp9B,SAAQ,SAAU+b,GAAK,OAAOA,EAAE1kB,EAAQ,GAE1D,GACJ,EA2BA,OA1BAsL,EAAM1I,aAAekjC,EAAkB1iC,UAAU,CAC7C6D,KAAM,SAAU4zB,GAIZ,GAHK7sB,MAAMC,QAAQ4sB,KACfA,EAAU,CAACA,IAEX8K,EAAM/mC,SAAWi8B,EAAQj8B,OAAQ,CACjC,IAAIoB,EAAQ,IAAI8J,MAAM,uCAAuC4E,OAAOmsB,EAAQj8B,OAAQ,yBAAyB8P,OAAOi3B,EAAM/mC,SAE1H,OADAoB,EAAM+G,OAAS8zB,EACRwH,EAAQriC,EACnB,CACA66B,EAAQlyB,SAAQ,SAAU5B,EAAQi/B,GAC1BL,EAAMK,IACNL,EAAMK,GAAOr9B,SAAQ,SAAU1B,GAAQ,OAAOA,EAAKF,EAAS,GAEpE,GACJ,EACA/G,MAAOqiC,EACPl7B,SAAU,WACNy+B,EAAUj9B,SAAQ,SAAUxB,GACpBA,GAEAA,EAASwB,SAAQ,SAAU2e,GAAK,OAAOA,GAAK,GAEpD,GACJ,IAEGoe,CAtDP,CAuDJ,EACAjB,EAAiB3jC,UAAUwkC,yBAA2B,SAAUrjC,GAC5D,IAAIuJ,EAAQ1Q,KACZ8B,aAAa9B,KAAKkqC,yBAAyB17B,IAAIrH,IAC/CnH,KAAKkqC,yBAAyBv7B,IAAIxH,EAAKnF,YAAW,WAC9C0O,EAAM+5B,aAAatjC,GACnBuJ,EAAMw5B,yBAAyBnxB,OAAO5R,EAC1C,GAAGnH,KAAK6pC,eACZ,EACOF,CACX,CA5IqC,GCDjCwB,EAA2B,SAAUn4B,GAErC,SAASm4B,EAAUC,GACf,IAAI16B,EAAQsC,EAAOxN,KAAKxF,OAASA,KAC7B+L,EAAKq/B,GAAe,CAAC,EAAGxB,EAAgB79B,EAAG69B,cAAe59B,EAAKD,EAAG89B,cAAeA,OAAuB,IAAP79B,EAAgB,GAAKA,EAAI+S,EAAKhT,EAAG+9B,SAAUA,OAAkB,IAAP/qB,EAAgB,EAAIA,EAAIC,EAAKjT,EAAGg+B,aAAcA,OAAsB,IAAP/qB,EAAgB,WAAc,OAAO,IAAM,EAAIA,EAAIuZ,EAAKxsB,EAAGi+B,SAAUA,OAAkB,IAAPzR,EAAgB,WAAc,MAAO,EAAI,EAAIA,EAYrV,OAXA7nB,EAAM26B,QAAU,IAAI1B,EAAiB,CACjCC,cAAeA,EACfC,cAAeA,EACfC,SAAUA,EACVC,aAAcA,EACdC,SAAUA,IAGVoB,EAAYrB,aAAajmC,QAAU,IACnC4M,EAAM7F,QAAU,SAAUC,GAAa,OAAO4F,EAAM26B,QAAQlB,eAAe,CAAEr/B,UAAWA,GAAc,GAEnG4F,CACX,CAOA,OAvBA,QAAUy6B,EAAWn4B,GAiBrBm4B,EAAUnlC,UAAU6E,QAAU,SAAUC,EAAWigC,GAC/C,OAAO/qC,KAAKqrC,QAAQlB,eAAe,CAC/Br/B,UAAWA,EACXigC,QAASA,GAEjB,EACOI,CACX,CAzB8B,CAyB5B5gC,EAAA,G,WClBE+gC,EAA+B,SAAUt4B,GAEzC,SAASs4B,EAAcF,GACnB,IAAI16B,EAAQsC,EAAOxN,KAAKxF,OAASA,KAC7B+L,EAAKq/B,GAAe,CAAC,EAAGp/B,EAAKD,EAAG80B,IAAKA,OAAa,IAAP70B,EAAgB,WAAaA,EAE5Eu/B,EAAUx/B,EAAGg8B,MAAOhpB,EAAKhT,EAAGN,MAAOA,OAAe,IAAPsT,EAAgB,KAAiBA,EAAIysB,EAAoBz/B,EAAGy/B,kBAAmBC,EAAqB1/B,EAAG0/B,mBAAoB5B,EAAgB99B,EAAG89B,cAAeD,EAAgB79B,EAAG69B,cAAeE,EAAW/9B,EAAG+9B,SAAUE,EAAWj+B,EAAGi+B,SAAUhrB,EAAKjT,EAAG2/B,uBAAwBA,OAAgC,IAAP1sB,GAAwBA,EAAI2sB,GAAiB,QAAO5/B,EAAI,CAAC,MAAO,QAAS,QAAS,oBAAqB,qBAAsB,gBAAiB,gBAAiB,WAAY,WAAY,4BAE1gB,EAAA6/B,EAAA,GAAaL,GAIRA,IACDA,EAAUxD,OAEd,IAAI8D,EAAa,CACbC,KAAM,CAAEN,kBAAmBA,EAAmBC,mBAAoBA,GAClEjhC,QAASmhC,EAAeI,aACxBjL,YAAa6K,EAAe7K,YAC5BC,QAAS4K,EAAe5K,SAE5BrwB,EAAMk5B,cAAgBA,EACtBl5B,EAAMm5B,cAAgBA,GAAiB,GACvCn5B,EAAMo5B,SAAWA,GAAY,GAgJ7B,OApBAE,EACIA,GACI,SAAWl/B,GACP,IAAI0I,EAAU1I,EAAUkhC,aACpBC,EAAgB,CAChBH,KAAMt4B,EAAQs4B,KACdthC,QAASgJ,EAAQu4B,aACjBjL,YAAattB,EAAQstB,YACrBC,QAASvtB,EAAQutB,SAGrB,OAAO,EAAAmL,EAAA,GAAUphC,EAAW+1B,GAAOp8B,KAAKC,UAAUunC,EACrD,EACTv7B,EAAM26B,QAAU,IAAIF,EAAU,CAC1BvB,cAAel5B,EAAMk5B,cACrBC,cAAen5B,EAAMm5B,cACrBC,SAAUp5B,EAAMo5B,SAChBE,SAAUA,EACVD,aA7Ie,SAAUW,GACzB,IAAIyB,GAAY,EAAAD,EAAA,GAAUxB,EAAW,GAAI7J,GACrCrtB,EAAUk3B,EAAW,GAAGsB,aACxBI,EAAyB,CAAC,EAC9B,GAAI54B,EAAQ6kB,gBAAiB,CACzB,IAAItsB,EAAKyH,EAAQ6kB,gBAAiBgU,EAAStgC,EAAGjC,KAAMy3B,EAAUx1B,EAAGw1B,QAC7D8K,IACAD,EAAuB,6BAA+BC,GAEtD9K,IACA6K,EAAuB,gCAAkC7K,EAEjE,CACA,IAAI0K,EAAgB,CAChBH,KAAMt4B,EAAQs4B,KACdthC,QAASgJ,EAAQu4B,aACjBjL,YAAattB,EAAQstB,YACrBC,SAAS,SAAS,QAAS,CAAC,EAAGqL,GAAyB54B,EAAQutB,UAEhEtI,EAAUiS,EAAWniC,KAAI,SAAUwD,GACnC,IAAIP,EAAQO,EAAGP,MACf,OAAI,QAAc,CAAC,UAAWA,IACnB,QAA6BA,GAEjCA,CACX,IAGA,GAAIitB,EAAQ9F,MAAK,SAAUnnB,GAAS,OAAQA,CAAO,IAC/C,OAAO,EAAA8gC,EAAA,GAAU,IAAIt9B,MAAM,wMAG/B,IAsBIs6B,EAtBAiD,EAAc7B,EAAWniC,KAAI,SAAUuC,EAAWogC,GAClD,IAAIj/B,GAAS,EAAAugC,EAAA,KAAiC,SAAS,QAAS,CAAC,EAAG1hC,GAAY,CAAEU,MAAOitB,EAAQyS,KAAWz/B,EAAO,KAAoBogC,EAAYI,GAInJ,OAHIhgC,EAAOmC,KAAK1C,YAAcggC,IAC1Bz/B,EAAOmC,KAAK1C,WAAY,EAAA+gC,EAAA,GAAyBxgC,EAAOmC,KAAK1C,UAAWZ,EAAUU,QAE/ES,CACX,IACIygC,EAAaH,EAAYhkC,KAAI,SAAUwD,GAEvC,OADWA,EAAGqC,IAElB,IACI5D,EAAU+hC,EAAY,GAAG/hC,QAE7B,GAAuB,QAAnBA,EAAQomB,OACR,OAAO,EAAA0b,EAAA,GAAU,IAAIt9B,MAAM,yDAE/B,IACIxE,EAAQ4D,MAAO,EAAAu+B,EAAA,GAAwBD,EAAY,UACvD,CACA,MAAOE,GACH,OAAO,EAAAN,EAAA,GAAUM,EACrB,CAMA,OAJKpiC,EAAQ++B,QAAqC,qBAApBF,kBAC1BC,EAAa,IAAID,gBACjB7+B,EAAQ++B,OAASD,EAAWC,QAEzB,IAAI,KAAW,SAAUt+B,GAwD5B,OAvDAsgC,EAAQY,EAAW3hC,GACd0kB,MAAK,SAAU2d,GAKhB,OAHAnC,EAAW78B,SAAQ,SAAU/C,GACzB,OAAOA,EAAUgiC,WAAW,CAAED,SAAUA,GAC5C,IACOA,CACX,IACK3d,MAAK,EAAA6d,EAAA,IAA0BrC,IAC/Bxb,MAAK,SAAUjjB,GAKhB,OAJAq9B,OAAangC,EAEb8B,EAASkB,KAAKF,GACdhB,EAASoB,WACFJ,CACX,IACKukB,OAAM,SAAUyK,GACjBqO,OAAangC,EAOT8xB,EAAIhvB,QAAUgvB,EAAIhvB,OAAOC,QAAU+uB,EAAIhvB,OAAO1H,MA2B9C0G,EAASkB,KAAK8uB,EAAIhvB,QAEtBhB,EAAS/F,MAAM+1B,EACnB,IACO,WAGCqO,GACAA,EAAW0D,OACnB,CACJ,GACJ,IAqBOt8B,CACX,CAIA,OA3KA,QAAU46B,EAAet4B,GAwKzBs4B,EAActlC,UAAU6E,QAAU,SAAUC,GACxC,OAAO9K,KAAKqrC,QAAQxgC,QAAQC,EAChC,EACOwgC,CACX,CA7KkC,CA6KhC/gC,EAAA,E,4GCrLF,SAAS0iC,EAAYC,EAAInC,GACrB,OAAQA,EAAUA,EAAQmC,GAAM,IAAWjO,IAC/C,CACA,SAASkO,EAAOpnC,GACZ,MAA0B,oBAAZA,EAAyB,IAAIwE,EAAWxE,GAAWA,CACrE,CACA,SAASqnC,EAAcrV,GACnB,OAAOA,EAAKltB,QAAQ/G,QAAU,CAClC,CACA,IAAIyG,EAA4B,WAC5B,SAASA,EAAWM,GACZA,IACA7K,KAAK6K,QAAUA,EACvB,CAiFA,OAhFAN,EAAWqS,MAAQ,WACf,OAAO,IAAIrS,GAAW,WAAc,OAAO,IAAW00B,IAAM,GAChE,EACA10B,EAAWsH,KAAO,SAAUw7B,GACxB,OAAqB,IAAjBA,EAAMvpC,OACCyG,EAAWqS,QACfywB,EAAM9kC,IAAI4kC,GAAQ7qB,QAAO,SAAUgrB,EAAGC,GAAK,OAAOD,EAAE15B,OAAO25B,EAAI,GAC1E,EACAhjC,EAAWijC,MAAQ,SAAUlkC,EAAM8hB,EAAMC,GACrC,IAEIoiB,EAFAC,EAAWP,EAAO/hB,GAClBuiB,EAAYR,EAAO9hB,GAAS,IAAI9gB,EAAW0iC,IAgB/C,OAbIQ,EADAL,EAAcM,IAAaN,EAAcO,GACnC,IAAIpjC,GAAW,SAAUO,GAC3B,OAAOxB,EAAKwB,GACR4iC,EAAS7iC,QAAQC,IAAc,IAAWm0B,KACxC0O,EAAU9iC,QAAQC,IAAc,IAAWm0B,IACrD,IAGM,IAAI10B,GAAW,SAAUO,EAAWigC,GACtC,OAAOzhC,EAAKwB,GACR4iC,EAAS7iC,QAAQC,EAAWigC,IAAY,IAAW9L,KACjD0O,EAAU9iC,QAAQC,EAAWigC,IAAY,IAAW9L,IAC9D,IAEG5zB,OAAOC,OAAOmiC,EAAK,CAAEriB,KAAMsiB,EAAUriB,MAAOsiB,GACvD,EACApjC,EAAWgpB,QAAU,SAAUwE,EAAMjtB,GACjC,OAAQitB,EAAKltB,QC7Cd,SAAyB+iC,EAAU9iC,GACtC,IAAI0I,GAAU,QAAS,CAAC,EAAGo6B,GAkB3B,OARAviC,OAAOm3B,eAAe13B,EAAW,aAAc,CAC3C23B,YAAY,EACZr7B,MAXa,SAAU+E,GAEnBqH,EADgB,oBAATrH,GACG,SAAS,QAAS,CAAC,EAAGqH,GAAUrH,EAAKqH,KAGrC,SAAS,QAAS,CAAC,EAAGA,GAAUrH,EAElD,IAMAd,OAAOm3B,eAAe13B,EAAW,aAAc,CAC3C23B,YAAY,EACZr7B,MAPa,WAAc,OAAQ,QAAS,CAAC,EAAGoM,EAAW,IASxD1I,CACX,CDyB6B+iC,CAAgB/iC,EAAU0I,QE7ChD,SAA4B1I,GAC/B,IAAIgjC,EAAuB,CACvBpiC,UAAWZ,EAAUY,WAAa,CAAC,EACnC6yB,WAAYzzB,EAAUyzB,YAAc,CAAC,EACrC3yB,cAAed,EAAUc,cACzBJ,MAAOV,EAAUU,OASrB,OANKsiC,EAAqBliC,gBACtBkiC,EAAqBliC,cACqB,kBAA/BkiC,EAAqBtiC,OACxB,QAAiBsiC,EAAqBtiC,aAAUrC,EAC9C,IAEP2kC,CACX,CF8BgEC,CG7CzD,SAA2BjjC,GAQ9B,IAPA,IAAIkjC,EAAmB,CACnB,QACA,gBACA,YACA,aACA,WAEKt+B,EAAK,EAAG3D,EAAKV,OAAO+D,KAAKtE,GAAY4E,EAAK3D,EAAGjI,OAAQ4L,IAAM,CAChE,IAAIvI,EAAM4E,EAAG2D,GACb,GAAIs+B,EAAiBjqC,QAAQoD,GAAO,EAChC,MAAM,QAAkB,GAAIA,EAEpC,CACA,OAAO2D,CACX,CH8BmFmjC,CAAkBnjC,OAAiB,IAAWm0B,IAC7H,EACA10B,EAAWqJ,OAAS,SAAUkxB,EAAOoJ,GACjC,IAAIC,EAAYhB,EAAOrI,GACvB,GAAIsI,EAAce,GAEd,OADuB,IAAvBv7B,WAAWC,SAAqB,KAAUnE,KAAK,GAAIy/B,GAC5CA,EAEX,IACIV,EADAW,EAAWjB,EAAOe,GActB,OAXIT,EADAL,EAAcgB,GACR,IAAI7jC,GAAW,SAAUO,GAC3B,OAAOqjC,EAAUtjC,QAAQC,GAAW,SAAUoiC,GAAM,OAAOkB,EAASvjC,QAAQqiC,IAAO,IAAWjO,IAAM,KAAM,IAAWA,IACzH,IAGM,IAAI10B,GAAW,SAAUO,EAAWigC,GACtC,OAAQoD,EAAUtjC,QAAQC,GAAW,SAAUoiC,GAC3C,OAAOkB,EAASvjC,QAAQqiC,EAAInC,IAAY,IAAW9L,IACvD,KAAM,IAAWA,IACrB,IAEG5zB,OAAOC,OAAOmiC,EAAK,CAAEriB,KAAM+iB,EAAW9iB,MAAO+iB,GACxD,EACA7jC,EAAWvE,UAAUwnC,MAAQ,SAAUlkC,EAAM8hB,EAAMC,GAC/C,OAAOrrB,KAAK4T,OAAOrJ,EAAWijC,MAAMlkC,EAAM8hB,EAAMC,GAAS,IAAI9gB,EAAW0iC,IAC5E,EACA1iC,EAAWvE,UAAU4N,OAAS,SAAUzH,GACpC,OAAO5B,EAAWqJ,OAAO5T,KAAMmM,EACnC,EACA5B,EAAWvE,UAAU6E,QAAU,SAAUC,EAAWigC,GAChD,MAAM,QAAkB,GAC5B,EACAxgC,EAAWvE,UAAUuhC,QAAU,SAAUriC,EAAO+F,GAC5C,GAAIA,GAAYA,EAAS/F,MAQrB,OAPA+F,EAAS/F,MAAMA,IAOR,EAGX,MAAMA,CACV,EACAqF,EAAWvE,UAAUqoC,WAAa,SAAUtL,GAExC,OADA/iC,KAAKunC,QAAUxE,EACR/iC,IACX,EACOuK,CACX,CAtF+B,E,4DIXpBgpB,E,SAAU,EAAWA,O,4DCArBia,E,SAAQ,EAAWA,K,6FCEvB,SAASjG,EAAQ+G,GACpB,OAAO,IAAI,KAAW,SAAUxjC,EAAWigC,GACvC,OAAO,IAAI,KAAW,SAAU9/B,GAC5B,IAAIqkB,EACAif,EACAC,EACJ,IACIlf,EAAMyb,EAAQjgC,GAAWxC,UAAU,CAC/B6D,KAAM,SAAUF,GACRA,EAAOC,SACPsiC,EAAgBF,EAAa,CACzB7e,cAAexjB,EAAOC,OACtB2gC,SAAU5gC,EACVnB,UAAWA,EACXigC,QAASA,KAGTwD,EAAaC,EAAclmC,UAAU,CACjC6D,KAAMlB,EAASkB,KAAKvL,KAAKqK,GACzB/F,MAAO+F,EAAS/F,MAAMtE,KAAKqK,GAC3BoB,SAAUpB,EAASoB,SAASzL,KAAKqK,KAK7CA,EAASkB,KAAKF,EAClB,EACA/G,MAAO,SAAU2wB,IACb2Y,EAAgBF,EAAa,CACzBxjC,UAAWA,EACX+qB,aAAcA,EAEdpG,cAAeoG,GACXA,EAAa5pB,QACb4pB,EAAa5pB,OAAOC,OACxB6+B,QAASA,KAGTwD,EAAaC,EAAclmC,UAAU,CACjC6D,KAAMlB,EAASkB,KAAKvL,KAAKqK,GACzB/F,MAAO+F,EAAS/F,MAAMtE,KAAKqK,GAC3BoB,SAAUpB,EAASoB,SAASzL,KAAKqK,KAIzCA,EAAS/F,MAAM2wB,EACnB,EACAxpB,SAAU,WAGDmiC,GACDvjC,EAASoB,SAASzL,KAAKqK,EAAvBA,EAER,GAER,CACA,MAAO2e,GACH0kB,EAAa,CAAEzY,aAAcjM,EAAG9e,UAAWA,EAAWigC,QAASA,IAC/D9/B,EAAS/F,MAAM0kB,EACnB,CACA,OAAO,WACC0F,GACAA,EAAI7nB,cACJ8mC,GACAjf,EAAI7nB,aACZ,CACJ,GACJ,GACJ,EAC+B,SAAUuL,GAErC,SAASy7B,EAAUH,GACf,IAAI59B,EAAQsC,EAAOxN,KAAKxF,OAASA,KAEjC,OADA0Q,EAAMqnB,KAAOwP,EAAQ+G,GACd59B,CACX,EALA,QAAU+9B,EAAWz7B,GAMrBy7B,EAAUzoC,UAAU6E,QAAU,SAAUC,EAAWigC,GAC/C,OAAO/qC,KAAK+3B,KAAKltB,QAAQC,EAAWigC,EACxC,CAEJ,CAX8B,CAW5B,I,6FChFEvJ,EAA0B,SAAUxuB,GAEpC,SAASwuB,EAASh3B,QACE,IAAZA,IAAsBA,EAAU,CAAC,GACrC,IAAIkG,EAAQsC,EAAOxN,KAAKxF,MAAM,OAAewK,GAASK,UAAY7K,KAElE,OADA0Q,EAAMlG,QAAUA,EACTkG,CACX,CACA,OAPA,QAAU8wB,EAAUxuB,GAObwuB,CACX,CAT6B,CAS3B,I,uECXSoK,EAAe,SAAUL,GAChC,IAAKA,GAA4B,qBAAVxD,MACnB,MAAM,QAAkB,GAEhC,C,+NCOI2G,GAAc,SAAM,WAAc,OAAO3G,KAAO,IACzC4G,EAAiB,SAAUC,QACd,IAAhBA,IAA0BA,EAAc,CAAC,GAC7C,IAAI7iC,EAAK6iC,EAAY/N,IAAKA,OAAa,IAAP90B,EAAgB,WAAaA,EAE7D8iC,EAAiBD,EAAY7G,MAAO/7B,EAAK4iC,EAAYnjC,MAAOA,OAAe,IAAPO,EAAgB,KAAiBA,EAAIw/B,EAAoBoD,EAAYpD,kBAAmBC,EAAqBmD,EAAYnD,mBAAoBqD,EAAmBF,EAAYE,iBAAkB/vB,EAAK6vB,EAAYlD,uBAAwBA,OAAgC,IAAP3sB,GAAwBA,EAAI4sB,GAAiB,QAAOiD,EAAa,CAAC,MAAO,QAAS,QAAS,oBAAqB,qBAAsB,mBAAoB,4BACnc,IAAvBh8B,WAAWC,UAGX,OAAag8B,GAAkBH,GAEnC,IAAI7C,EAAa,CACbC,KAAM,CAAEN,kBAAmBA,EAAmBC,mBAAoBA,GAClEjhC,QAASmhC,EAAeI,aACxBjL,YAAa6K,EAAe7K,YAC5BC,QAAS4K,EAAe5K,SAE5B,OAAO,IAAI,KAAW,SAAUj2B,GAC5B,IAAIqhC,GAAY,OAAUrhC,EAAW+1B,GACjCrtB,EAAU1I,EAAUkhC,aAOpBI,EAAyB,CAAC,EAC9B,GAAI54B,EAAQ6kB,gBAAiB,CACzB,IAAItsB,EAAKyH,EAAQ6kB,gBAAiBgU,EAAStgC,EAAGjC,KAAMy3B,EAAUx1B,EAAGw1B,QAC7D8K,IACAD,EAAuB,6BAA+BC,GAEtD9K,IACA6K,EAAuB,gCAAkC7K,EAEjE,CACA,IAAIwN,GAAiB,SAAS,QAAS,CAAC,EAAG3C,GAAyB54B,EAAQutB,SACxEkL,EAAgB,CAChBH,KAAMt4B,EAAQs4B,KACdthC,QAASgJ,EAAQu4B,aACjBjL,YAAattB,EAAQstB,YACrBC,QAASgO,GAEb,IAAI,QAAc,CAAC,UAAWjkC,EAAUU,OAAQ,CAC5C,IAAIwjC,GAAmB,QAA6BlkC,EAAUU,OAC9D,IAAKwjC,EACD,OAAO,OAAU,IAAIhgC,MAAM,0MAE/BlE,EAAUU,MAAQwjC,CACtB,CAEA,IAII1F,EAJAt9B,GAAK,QAAiClB,EAAWW,EAAO,KAAoBogC,EAAYI,GAAgBzhC,EAAUwB,EAAGxB,QAAS4D,EAAOpC,EAAGoC,KACxIA,EAAK1C,YAAcggC,IACnBt9B,EAAK1C,WAAY,OAAyB0C,EAAK1C,UAAWZ,EAAUU,QAGnEhB,EAAQ++B,QAAqC,qBAApBF,kBAC1BC,EAAa,IAAID,gBACjB7+B,EAAQ++B,OAASD,EAAWC,QAGhC,IAGyC1uB,EAGrCo0B,EAFkB,yBADmBp0B,GAGK,QAAkB/P,EAAUU,QAF7DuC,MAAkD,iBAAhB8M,EAAE/P,UAI7CokC,GAAW,QAAc,CAAC,SAAUpkC,EAAUU,OAKlD,GAJIsjC,IACChkC,EAAUU,MAAMoC,YAAY+kB,MAVN,SAAU9X,GACjC,MAAkB,wBAAXA,EAAE9M,MAAkD,aAAhB8M,EAAE/P,SACjD,MASIN,EAAQomB,OAAS,OAEjBse,GAAYD,EAAgB,CAC5BzkC,EAAQu2B,QAAUv2B,EAAQu2B,SAAW,CAAC,EACtC,IAAIoO,EAAe,mBAGfF,GAAkBC,IACK,IAAvBt8B,WAAWC,SAAqB,KAAUnE,KAAK,IAE/CugC,EACAE,GACI,yDAECD,IACLC,GAAgB,uCAEpB3kC,EAAQu2B,QAAQqO,OAASD,CAC7B,CACA,GAAuB,QAAnB3kC,EAAQomB,OAAkB,CAC1B,IAAI7R,GAAK,OAAiBotB,EAAW/9B,GAAOihC,EAAStwB,EAAGswB,OAAQzC,EAAa7tB,EAAG6tB,WAChF,GAAIA,EACA,OAAO,OAAUA,GAErBT,EAAYkD,CAChB,MAEI,IACI7kC,EAAQ4D,MAAO,OAAwBA,EAAM,UACjD,CACA,MAAOw+B,GACH,OAAO,OAAUA,EACrB,CAEJ,OAAO,IAAI,KAAW,SAAU3hC,GAM5B,IAAIqkC,EAAeT,IAAkB,SAAM,WAAc,OAAO9G,KAAO,KAAM2G,EACzEa,EAAetkC,EAASkB,KAAKvL,KAAKqK,GAqBtC,OApBAqkC,EAAanD,EAAW3hC,GACnB0kB,MAAK,SAAU2d,GAChB,IAAI9gC,EACJjB,EAAUgiC,WAAW,CAAED,SAAUA,IACjC,IAAI2C,EAAoC,QAA3BzjC,EAAK8gC,EAAS9L,eAA4B,IAAPh1B,OAAgB,EAASA,EAAGyC,IAAI,gBAChF,OAAc,OAAVghC,GAAkB,qBAAqBlmC,KAAKkmC,IACrC,QAAkB3C,EAAU0C,IAG5B,QAA0BzkC,EAA1B,CAAqC+hC,GAAU3d,KAAKqgB,EAEnE,IACKrgB,MAAK,WACNoa,OAAangC,EACb8B,EAASoB,UACb,IACKmkB,OAAM,SAAUyK,GACjBqO,OAAangC,GACb,QAAY8xB,EAAKhwB,EACrB,IACO,WAGCq+B,GACAA,EAAW0D,OACnB,CACJ,GACJ,GACJ,C,kICrJe,SAASyC,EAAmBC,GACvC,IAAIC,EAAU,KACVzqC,EAAQ,KACR0qC,GAAO,EACPrrC,EAAO,GACPsrC,EAAU,GACd,SAASC,EAAOC,GACZ,IAAI7qC,EAAJ,CAEA,GAAI2qC,EAAQ/rC,OAAQ,CAChB,IAAIksC,EAAaH,EAAQzf,QACzB,GAAIld,MAAMC,QAAQ68B,IAAeA,EAAW,GACxC,OAAOA,EAAW,GAAG,CAAE5oC,MAAO2oC,EAAOH,MAAM,GAEnD,CACArrC,EAAKrE,KAAK6vC,EAPA,CAQd,CACA,SAASxI,EAAQtM,GACb/1B,EAAQ+1B,EACE4U,EAAQhsC,QACdgK,SAAQ,SAAUoiC,GAClBA,EAAK,GAAGhV,EACZ,KACC0U,GAAWA,GAChB,CACA,SAASO,IACLN,GAAO,EACGC,EAAQhsC,QACdgK,SAAQ,SAAUoiC,GAClBA,EAAK,GAAG,CAAE7oC,WAAO+B,EAAWymC,MAAM,GACtC,KACCD,GAAWA,GAChB,CACAA,EAAU,WACNA,EAAU,KACVD,EAAOS,eAAe,OAAQL,GAC9BJ,EAAOS,eAAe,QAAS5I,GAC/BmI,EAAOS,eAAe,MAAOD,GAC7BR,EAAOS,eAAe,SAAUD,GAChCR,EAAOS,eAAe,QAASD,EACnC,EACAR,EAAOU,GAAG,OAAQN,GAClBJ,EAAOU,GAAG,QAAS7I,GACnBmI,EAAOU,GAAG,MAAOF,GACjBR,EAAOU,GAAG,SAAUF,GACpBR,EAAOU,GAAG,QAASF,GAYnB,IAAIG,EAAW,CACXlkC,KAAM,WACF,OAZG,IAAI6gB,SAAQ,SAAUC,EAAStmB,GAClC,OAAIzB,EACOyB,EAAOzB,GACdX,EAAKT,OACEmpB,EAAQ,CAAE7lB,MAAO7C,EAAK6rB,QAASwf,MAAM,IAC5CA,EACO3iB,EAAQ,CAAE7lB,WAAO+B,EAAWymC,MAAM,SAC7CC,EAAQ3vC,KAAK,CAAC+sB,EAAStmB,GAC3B,GAKA,GAOJ,OALIoU,EAAA,KACAs1B,EAASrO,OAAOsO,eAAiB,WAC7B,OAAOtwC,IACX,GAEGqwC,CACX,CCpEe,SAASE,EAAe1oB,GACnC,IAAIwoB,EAAW,CACXlkC,KAAM,WACF,OAAO0b,EAAOtW,MAClB,GAOJ,OALIwJ,EAAA,KACAs1B,EAASrO,OAAOsO,eAAiB,WAC7B,OAAOtwC,IACX,GAEGqwC,CACX,CCWO,SAASG,EAAiB3D,GAC7B,ICxBI9gC,EACAskC,EDuBAjiC,EAAOy+B,EAGX,GAFmBA,EApBJz+B,OAqBXA,EAAOy+B,EAASz+B,MAhBxB,SAAiChH,GAC7B,SAAU2T,EAAA,KACN3T,EAAM46B,OAAOsO,eACrB,CAcQG,CAAwBriC,GACxB,OC3BAiiC,ED2BqBjiC,EC3BH4zB,OAAOsO,kBACtBvkC,EAAK,CACJI,KAAM,WACF,OAAOkkC,EAASlkC,MACpB,IAED61B,OAAOsO,eAAiB,WACvB,OAAOtwC,IACX,EACA+L,EDmBJ,GAtBJ,SAA0B3E,GACtB,QAASA,EAAMspC,SACnB,CAoBQC,CAAiBviC,GACjB,OAAOmiC,EAAeniC,EAAKsiC,aAG/B,GAnBJ,SAA0BtpC,GACtB,QAASA,EAAMsoC,MACnB,CAiBQkB,CAAiBxiC,GACjB,OAAOmiC,EAAeniC,EAAKshC,SAASgB,aAExC,GAnBJ,SAAgBtpC,GACZ,QAASA,EAAMypC,WACnB,CAiBQC,CAAO1iC,GACP,OErCO,SAAyB8hB,GACpC,IAAIoQ,GAAW,EACX+P,EAAW,CACXlkC,KAAM,WACF,OAAIm0B,EACOtT,QAAQC,QAAQ,CACnB7lB,WAAO+B,EACPymC,MAAM,KAEdtP,GAAW,EACJ,IAAItT,SAAQ,SAAUC,EAAStmB,GAClCupB,EACKhB,MAAK,SAAU9nB,GAChB6lB,EAAQ,CAAE7lB,MAAOA,EAAOwoC,MAAM,GAClC,IACKpf,MAAM7pB,EACf,IACJ,GAOJ,OALIoU,EAAA,KACAs1B,EAASrO,OAAOsO,eAAiB,WAC7B,OAAOtwC,IACX,GAEGqwC,CACX,CFYeU,CAAgB3iC,EAAKyiC,eAChC,GAlBJ,SAA8BzpC,GAC1B,QAASA,EAAM4pC,IACnB,CAgBQC,CAAqB7iC,GACrB,OAAOqhC,EAAmBrhC,GAC9B,MAAM,IAAIY,MAAM,6EACpB,C,oCGzCI,EAAiB3D,OAAOrF,UAAU8G,eAC/B,SAASokC,EAAkBrE,EAAUsE,GACxC,OAAO,QAAUnxC,UAAM,OAAQ,GAAQ,WACnC,IAAIoxC,EAASC,EAAaC,EAAWC,EAAaC,EAAUC,EAAQpB,EAAUqB,EAAS3lC,EAAI3E,EAAOwoC,EAAMG,EAAO4B,EAAYC,EAAI3rC,EAASyG,EAAGq0B,EAAS8Q,EAAezjC,EAAMnC,EAAQE,EAC7KH,EAAI+S,EACJC,EACJ,OAAO,QAAYhf,MAAM,SAAUu4B,GAC/B,OAAQA,EAAGgC,OACP,KAAK,EACD,QAAoBpxB,IAAhB2oC,YACA,MAAM,IAAI9iC,MAAM,6EAEpBoiC,EAAU,IAAIU,YAAY,SAC1BT,EAA0C,QAA3BryB,EAAK6tB,EAAS9L,eAA4B,IAAP/hB,OAAgB,EAASA,EAAGxQ,IAAI,gBAClF8iC,EAAY,YACZC,GAA+B,OAAhBF,QAAwC,IAAhBA,OAAyB,EAASA,EAAYjoB,SAASkoB,IAC1E,OAAhBD,QAAwC,IAAhBA,OAAyB,EAASA,EAAYhjC,WAA2B,OAAhBgjC,QAAwC,IAAhBA,OAAyB,EAASA,EAAYttC,QAAQutC,IAAcA,GAAkB5nC,QAAQ,QAAS,IAAIA,QAAQ,WAAY,IAAI6D,OAC1O,IACNikC,EAAW,SAAS59B,OAAO29B,GAC3BE,EAAS,GACTpB,EAAWG,EAAiB3D,GAC5B6E,GAAU,EACVnZ,EAAGgC,MAAQ,EACf,KAAK,EACD,OAAKmX,EACE,CAAC,EAAarB,EAASlkC,QADT,CAAC,EAAa,GAEvC,KAAK,EAOD,IANAJ,EAAKwsB,EAAGoC,OAAQvzB,EAAQ2E,EAAG3E,MAAOwoC,EAAO7jC,EAAG6jC,KAC5CG,EAAyB,kBAAV3oC,EAAqBA,EAAQgqC,EAAQW,OAAO3qC,GAC3DuqC,EAAaF,EAAO3tC,OAAS0tC,EAAS1tC,OAAS,EAC/C4tC,GAAW9B,EAEXgC,GADAH,GAAU1B,GACEhsC,QAAQytC,EAAUG,GACvBC,GAAM,GAAG,CASZ,GARA3rC,OAAU,EACV+F,EAAK,CACDylC,EAAO5tC,MAAM,EAAG+tC,GAChBH,EAAO5tC,MAAM+tC,EAAKJ,EAAS1tC,SACX2tC,EAASzlC,EAAG,GAChCU,GADGzG,EAAU+F,EAAG,IACJjI,QAAQ,YACpBg9B,EAAUiR,EAAa/rC,EAAQpC,MAAM,EAAG6I,KACxCmlC,EAAgB9Q,EAAQ,mBAEyC,IAA7D8Q,EAAcjsC,cAAc7B,QAAQ,oBACpC,MAAM,IAAIiL,MAAM,iEAGpB,GADAZ,EAAOnI,EAAQpC,MAAM6I,GAGjB,GADAT,EAASgmC,EAAcpF,EAAUz+B,GAC7B/C,OAAO+D,KAAKnD,GAAQnI,OAAS,GAC7B,SAAUmI,GACV,gBAAiBA,GACjB,WAAYA,GACZ,YAAaA,EACb,IAAI,QAAsBA,GAAS,CAE/B,GADAE,EAAO,CAAC,EACJ,YAAaF,EAAQ,CACrB,GAAmC,IAA/BZ,OAAO+D,KAAKnD,GAAQnI,QAAmC,OAAnBmI,EAAOH,QAC3C,MAAO,CAAC,GAEZK,GAAO,QAAS,CAAC,EAAGF,EAAOH,QAC/B,CACI,WAAYG,IACZE,GAAO,SAAS,QAAS,CAAC,EAAGA,GAAO,CAAEoyB,YAAY,SAAS,QAAS,CAAC,EAAI,eAAgBpyB,EAAOA,EAAKoyB,WAAa,OAASxf,EAAK,CAAC,EAAGA,EAAG,MAA0B9S,EAAOC,OAAQ6S,OAEpLoyB,EAAUhlC,EACd,MAIIglC,EAAUllC,QAGb,GAG0B,IAA/BZ,OAAO+D,KAAKnD,GAAQnI,QAChB,YAAamI,IACZA,EAAOorB,QACR,MAAO,CAAC,GAGhBua,EAAKH,EAAO1tC,QAAQytC,EACxB,CACA,MAAO,CAAC,EAAa,GACzB,KAAK,EAAG,MAAO,CAAC,GAExB,GACJ,GACJ,CACO,SAASQ,EAAaE,GACzB,IAAIC,EAAc,CAAC,EAUnB,OATAD,EAAW1E,MAAM,MAAM3/B,SAAQ,SAAUukC,GACrC,IAAI1lC,EAAI0lC,EAAKruC,QAAQ,KACrB,GAAI2I,GAAK,EAAG,CAER,IAAI2/B,EAAS+F,EAAKvuC,MAAM,EAAG6I,GAAGa,OAAO3H,cACjCwB,EAAQgrC,EAAKvuC,MAAM6I,EAAI,GAAGa,OAC9B4kC,EAAY9F,GAAUjlC,CAC1B,CACJ,IACO+qC,CACX,CACO,SAASF,EAAcpF,EAAUwF,GACpC,GAAIxF,EAASyF,QAAU,IAAK,EAUxB,EAAAC,EAAA,GAAiB1F,EARD,WACZ,IACI,OAAOpoC,KAAK8B,MAAM8rC,EACtB,CACA,MAAOpX,GACH,OAAOoX,CACX,CACJ,CAC2BG,GAAa,iDAAiD5+B,OAAOi5B,EAASyF,QAC7G,CACA,IACI,OAAO7tC,KAAK8B,MAAM8rC,EACtB,CACA,MAAOpX,GACH,IAAI2R,EAAa3R,EAKjB,MAJA2R,EAAW9iC,KAAO,mBAClB8iC,EAAWC,SAAWA,EACtBD,EAAW6F,WAAa5F,EAASyF,OACjC1F,EAAWyF,SAAWA,EAChBzF,CACV,CACJ,CACO,SAAS8F,EAAYzX,EAAKhwB,GAMzBgwB,EAAIhvB,QAAUgvB,EAAIhvB,OAAOC,QAAU+uB,EAAIhvB,OAAO1H,MA4B9C0G,EAASkB,KAAK8uB,EAAIhvB,QAEtBhB,EAAS/F,MAAM+1B,EACnB,CACO,SAAS8R,EAA0BrC,GACtC,OAAO,SAAUmC,GACb,OAAOA,EACF8F,OACAzjB,MAAK,SAAUmjB,GAAY,OAAOJ,EAAcpF,EAAUwF,EAAW,IACrEnjB,MAAK,SAAUjjB,GAShB,OARKiH,MAAMC,QAAQlH,IACd,EAAezG,KAAKyG,EAAQ,SAC5B,EAAezG,KAAKyG,EAAQ,YAE7B,EAAAsmC,EAAA,GAAiB1F,EAAU5gC,EAAQ,0CAA0C2H,OAAOV,MAAMC,QAAQu3B,GAC9FA,EAAWniC,KAAI,SAAU2kC,GAAM,OAAOA,EAAGthC,aAAe,IACtD8+B,EAAW9+B,cAAe,OAE7BK,CACX,GACJ,CACJ,C,sECzLO,SAAS2mC,EAAiBzG,EAAW/9B,GAGxC,IAAIykC,EAAc,GACdC,EAAgB,SAAU3rC,EAAKC,GAC/ByrC,EAAY3yC,KAAK,GAAG0T,OAAOzM,EAAK,KAAKyM,OAAOm/B,mBAAmB3rC,IACnE,EAOA,GANI,UAAWgH,GACX0kC,EAAc,QAAS1kC,EAAK5C,OAE5B4C,EAAKxC,eACLknC,EAAc,gBAAiB1kC,EAAKxC,eAEpCwC,EAAK1C,UAAW,CAChB,IAAIsnC,OAAsB,EAC1B,IACIA,GAAsB,OAAwB5kC,EAAK1C,UAAW,gBAClE,CACA,MAAOkhC,GACH,MAAO,CAAEA,WAAYA,EACzB,CACAkG,EAAc,YAAaE,EAC/B,CACA,GAAI5kC,EAAKmwB,WAAY,CACjB,IAAI0U,OAAuB,EAC3B,IACIA,GAAuB,OAAwB7kC,EAAKmwB,WAAY,iBACpE,CACA,MAAOqO,GACH,MAAO,CAAEA,WAAYA,EACzB,CACAkG,EAAc,aAAcG,EAChC,CAOA,IAAIrhC,EAAW,GAAIshC,EAAc/G,EAC7BgH,EAAgBhH,EAAUpoC,QAAQ,MACf,IAAnBovC,IACAvhC,EAAWu6B,EAAUiH,OAAOD,GAC5BD,EAAc/G,EAAUiH,OAAO,EAAGD,IAEtC,IAAIE,GAAkD,IAA9BH,EAAYnvC,QAAQ,KAAc,IAAM,IAEhE,MAAO,CAAEsrC,OADI6D,EAAcG,EAAoBR,EAAYzxB,KAAK,KAAOxP,EAE3E,C,2JCxBW0hC,EAAqB,CAC5BxH,KA1BqB,CACrByH,cAAc,EACd/H,mBAAmB,EACnBC,oBAAoB,GAwBpB1K,QAtBiB,CAEjBqO,OAAQ,MAaR,eAAgB,oBAQhB5kC,QANiB,CACjBomB,OAAQ,SAOD4iB,EAAiB,SAAU/lC,EAAKgmC,GAAW,OAAOA,EAAQhmC,EAAM,EACpE,SAAS++B,EAAyB1hC,EAAW4oC,GAEhD,IADA,IAAIC,EAAU,GACLjkC,EAAK,EAAGA,EAAK9C,UAAU9I,OAAQ4L,IACpCikC,EAAQjkC,EAAK,GAAK9C,UAAU8C,GAGhC,OADAikC,EAAQC,QAAQF,GACTG,EAAiC9mC,WAAM,GAAQ,QAAc,CAACjC,EACjE0oC,GAAiBG,GAAS,GAClC,CACO,SAASE,EAAiC/oC,EAAW2oC,GAExD,IADA,IAAIE,EAAU,GACLjkC,EAAK,EAAGA,EAAK9C,UAAU9I,OAAQ4L,IACpCikC,EAAQjkC,EAAK,GAAK9C,UAAU8C,GAEhC,IAAIlF,EAAU,CAAC,EACXshC,EAAO,CAAC,EACZ6H,EAAQ9lC,SAAQ,SAAUsG,GACtB3J,GAAU,SAAS,SAAS,QAAS,CAAC,EAAGA,GAAU2J,EAAO3J,SAAU,CAAEu2B,SAAS,SAAS,QAAS,CAAC,EAAGv2B,EAAQu2B,SAAU5sB,EAAO4sB,WAC1H5sB,EAAO2sB,cACPt2B,EAAQs2B,YAAc3sB,EAAO2sB,aAEjCgL,GAAO,SAAS,QAAS,CAAC,EAAGA,GAAO33B,EAAO23B,KAC/C,IACIthC,EAAQu2B,UACRv2B,EAAQu2B,QAkBhB,SAAgCA,EAAS0K,GAErC,IAAKA,EAAoB,CACrB,IAAIqI,EAAsBzoC,OAAO3C,OAAO,MAIxC,OAHA2C,OAAO+D,KAAK/D,OAAO01B,IAAUlzB,SAAQ,SAAU/D,GAC3CgqC,EAAoBhqC,EAAKlE,eAAiBm7B,EAAQj3B,EACtD,IACOgqC,CACX,CAKA,IAAIC,EAAa1oC,OAAO3C,OAAO,MAC/B2C,OAAO+D,KAAK/D,OAAO01B,IAAUlzB,SAAQ,SAAU/D,GAC3CiqC,EAAWjqC,EAAKlE,eAAiB,CAC7BouC,aAAclqC,EACd1C,MAAO25B,EAAQj3B,GAEvB,IACA,IAAImqC,EAAoB5oC,OAAO3C,OAAO,MAItC,OAHA2C,OAAO+D,KAAK2kC,GAAYlmC,SAAQ,SAAU/D,GACtCmqC,EAAkBF,EAAWjqC,GAAMkqC,cAAgBD,EAAWjqC,GAAM1C,KACxE,IACO6sC,CACX,CA3C0BC,CAAuB1pC,EAAQu2B,QAAS+K,EAAKL,qBAGnE,IAAI7/B,EAAgBd,EAAUc,cAAe2yB,EAAazzB,EAAUyzB,WAAY7yB,EAAYZ,EAAUY,UAAWF,EAAQV,EAAUU,MAC/H4C,EAAO,CAAExC,cAAeA,EAAeF,UAAWA,GAMtD,OALIogC,EAAKN,oBACLp9B,EAAKmwB,WAAaA,GAElBuN,EAAKyH,eACLnlC,EAAK5C,MAAQioC,EAAQjoC,EAAO,MACzB,CACHhB,QAASA,EACT4D,KAAMA,EAEd,C,wDCvEO,IAAI89B,EAAY,SAAUphC,EAAWqpC,GACxC,IACIC,EADUtpC,EAAUkhC,aACCnL,IACzB,OAAIuT,IAG4B,oBAAhBD,EACLA,EAAYrpC,GAGZqpC,GAAe,WAE9B,C,uECXWxH,EAA0B,SAAU9/B,EAAG0tB,GAC9C,IAAI8Z,EACJ,IACIA,EAAa5vC,KAAKC,UAAUmI,EAChC,CACA,MAAO+c,GACH,IAAIgjB,GAAa,QAAkB,GAAIrS,EAAO3Q,EAAE3jB,SAEhD,MADA2mC,EAAWA,WAAahjB,EAClBgjB,CACV,CACA,OAAOyH,CACX,C,kFCVO,SAAS5H,EAAyB/gC,EAAWF,GAChD,IAAIS,GAAS,QAAS,CAAC,EAAGP,GACtB4oC,EAAc,IAAI3mC,IAAItC,OAAO+D,KAAK1D,IAgBtC,OAfA,QAAMF,EAAO,CACT+oC,SAAU,SAAUplC,EAAMqlC,EAAMt9B,GAKxBA,GACgB,uBAAhBA,EAAOnJ,MACPumC,EAAYv7B,OAAO5J,EAAKrF,KAAK1C,MAErC,IAEJktC,EAAYzmC,SAAQ,SAAU/D,UACnBmC,EAAOnC,EAClB,IACOmC,CACX,C,uECpBO,SAASqgC,EAAUmI,GACtB,OAAO,IAAI,KAAW,SAAUxpC,GAC5BA,EAAS/F,MAAMuvC,EACnB,GACJ,C,wDCLO,IAAIlC,EAAmB,SAAU1F,EAAU5gC,EAAQhG,GACtD,IAAIf,EAAQ,IAAI8J,MAAM/I,GAKtB,MAJAf,EAAM4E,KAAO,cACb5E,EAAM2nC,SAAWA,EACjB3nC,EAAMutC,WAAa5F,EAASyF,OAC5BptC,EAAM+G,OAASA,EACT/G,CACV,C,4DC2BIwvC,E,+BAfOv1B,EAAqB9T,OAAOC,QAAO,SAA4BlE,GACtE,OAAO3C,KAAKC,UAAU0C,EAAOutC,EACjC,GAAG,CACC9nB,MAAO,WAIH6nB,EAAa,IAAI,IAAuB,IAAWv1B,oBAAsB,IAC7E,IAeJ,SAASw1B,EAAqBxtC,EAAKC,GAC/B,GAAIA,GAA0B,kBAAVA,EAAoB,CACpC,IAAIwtC,EAAQvpC,OAAO4R,eAAe7V,GAIlC,GAAIwtC,IAAUvpC,OAAOrF,WAAuB,OAAV4uC,EAAgB,CAC9C,IAAIxlC,EAAO/D,OAAO+D,KAAKhI,GAGvB,GAAIgI,EAAK2F,MAAM8/B,GACX,OAAOztC,EACX,IAAI0tC,EAAcrwC,KAAKC,UAAU0K,GAC7BoO,EAAak3B,EAAWlmC,IAAIsmC,GAChC,IAAKt3B,EAAY,CACbpO,EAAKsK,OACL,IAAIq7B,EAAYtwC,KAAKC,UAAU0K,GAG/BoO,EAAak3B,EAAWlmC,IAAIumC,IAAc3lC,EAC1CslC,EAAW/lC,IAAImmC,EAAat3B,GAC5Bk3B,EAAW/lC,IAAIomC,EAAWv3B,EAC9B,CACA,IAAIw3B,EAAiB3pC,OAAO3C,OAAOksC,GAMnC,OAHAp3B,EAAW3P,SAAQ,SAAU1G,GACzB6tC,EAAe7tC,GAAOC,EAAMD,EAChC,IACO6tC,CACX,CACJ,CACA,OAAO5tC,CACX,CAKA,SAASytC,EAAgB1tC,EAAKuF,EAAG0C,GAC7B,OAAa,IAAN1C,GAAW0C,EAAK1C,EAAI,IAAMvF,CACrC,EArD2B,IAAvByL,WAAWC,UACX,QAAoB,sBAAsB,WAAc,OAAO6hC,EAAWrvB,IAAM,IAKpFlG,EAAmB0N,O,wDCnCnB,IAAIzhB,EAAWC,OAAOrF,UAAUoF,SAIzB,SAAS8e,EAAU9iB,GACtB,OAAO6tC,EAAgB7tC,EAC3B,CACA,SAAS6tC,EAAgBC,EAAKC,GAC1B,OAAQ/pC,EAAS5F,KAAK0vC,IAClB,IAAK,iBAED,IADAC,EAAOA,GAAQ,IAAIloC,KACVwB,IAAIymC,GACT,OAAOC,EAAK3mC,IAAI0mC,GACpB,IAAIE,EAASF,EAAIrxC,MAAM,GAKvB,OAJAsxC,EAAKxmC,IAAIumC,EAAKE,GACdA,EAAOvnC,SAAQ,SAAU2M,EAAO9N,GAC5B0oC,EAAO1oC,GAAKuoC,EAAgBz6B,EAAO26B,EACvC,IACOC,EAEX,IAAK,kBAED,IADAD,EAAOA,GAAQ,IAAIloC,KACVwB,IAAIymC,GACT,OAAOC,EAAK3mC,IAAI0mC,GAGpB,IAAIG,EAAShqC,OAAO3C,OAAO2C,OAAO4R,eAAei4B,IAKjD,OAJAC,EAAKxmC,IAAIumC,EAAKG,GACdhqC,OAAO+D,KAAK8lC,GAAKrnC,SAAQ,SAAU1G,GAC/BkuC,EAAOluC,GAAO8tC,EAAgBC,EAAI/tC,GAAMguC,EAC5C,IACOE,EAEX,QACI,OAAOH,EAEnB,C,sKCjCO,SAASI,EAAkCluC,GAC9C,MAAO,gBAAiBA,CAC5B,CAIO,SAASmuC,EAAuBnuC,GACnC,OAAQkuC,EAAkCluC,IAJvC,SAAuCA,GAC1C,MAAO,YAAaA,GAAS,SAAUA,CAC3C,CAGQouC,CAA8BpuC,EACtC,CAIO,SAASquC,EAAsBruC,GAClC,OAAO,OAAgBA,IAAU,YAAaA,CAClD,CACO,SAASsuC,EAAqBC,EAAY1pC,GAC7C,IAAImrB,EAAaue,EACbvzB,EAAS,IAAI,KAejB,OAdIkzB,EAAkCrpC,KAClC,OAAgBA,EAAOyjB,cACvBzjB,EAAOyjB,YAAY7hB,SAAQ,SAAU9B,GAEjC,IADA,IAAIxH,EAAOwH,EAAGxH,KAAM0O,EAAOlH,EAAGkH,KACrBvG,EAAIuG,EAAKnP,OAAS,EAAG4I,GAAK,IAAKA,EAAG,CACvC,IAAIvF,EAAM8L,EAAKvG,GAEXkpC,GADgBC,OAAO1uC,GACG,GAAK,CAAC,EACpCyuC,EAASzuC,GAAO5C,EAChBA,EAAOqxC,CACX,CACAxe,EAAahV,EAAOzL,MAAMygB,EAAY7yB,EAC1C,IAEG6yB,CACX,C,mICnCItqB,EAAiBzB,OAAOrF,UAAU8G,eAC/B,SAASmT,IAEZ,IADA,IAAI6P,EAAU,GACLpgB,EAAK,EAAGA,EAAK9C,UAAU9I,OAAQ4L,IACpCogB,EAAQpgB,GAAM9C,UAAU8C,GAE5B,OAAOomC,EAAehmB,EAC1B,CAOO,SAASgmB,EAAehmB,GAC3B,IAAIimB,EAASjmB,EAAQ,IAAM,CAAC,EACxB/V,EAAQ+V,EAAQhsB,OACpB,GAAIiW,EAAQ,EAER,IADA,IAAIqI,EAAS,IAAI4zB,EACRtpC,EAAI,EAAGA,EAAIqN,IAASrN,EACzBqpC,EAAS3zB,EAAOzL,MAAMo/B,EAAQjmB,EAAQpjB,IAG9C,OAAOqpC,CACX,CACA,IAAIE,EAAoB,SAAUF,EAAQ5nC,EAAQ+N,GAC9C,OAAOlc,KAAK2W,MAAMo/B,EAAO75B,GAAW/N,EAAO+N,GAC/C,EACI85B,EAA4B,WAC5B,SAASA,EAAWE,QACG,IAAfA,IAAyBA,EAAaD,GAC1Cj2C,KAAKk2C,WAAaA,EAClBl2C,KAAKm2C,SAAW,IAChBn2C,KAAKo2C,WAAa,IAAIzoC,GAC1B,CAiDA,OAhDAqoC,EAAWhwC,UAAU2Q,MAAQ,SAAUo/B,EAAQ5nC,GAG3C,IAFA,IAAIuC,EAAQ1Q,KACRwT,EAAU,GACL9D,EAAK,EAAGA,EAAK9C,UAAU9I,OAAQ4L,IACpC8D,EAAQ9D,EAAK,GAAK9C,UAAU8C,GAEhC,OAAI,OAAgBvB,KAAW,OAAgB4nC,IAC3C1qC,OAAO+D,KAAKjB,GAAQN,SAAQ,SAAUI,GAClC,GAAInB,EAAetH,KAAKuwC,EAAQ9nC,GAAY,CACxC,IAAIooC,EAAcN,EAAO9nC,GACzB,GAAIE,EAAOF,KAAeooC,EAAa,CACnC,IAAIpqC,EAASyE,EAAMwlC,WAAWnpC,MAAM2D,GAAO,QAAc,CAACqlC,EACtD5nC,EACAF,GAAYuF,GAAS,IAGrBvH,IAAWoqC,KACXN,EAASrlC,EAAM4lC,oBAAoBP,IAC5B9nC,GAAahC,EAE5B,CACJ,MAII8pC,EAASrlC,EAAM4lC,oBAAoBP,IAC5B9nC,GAAaE,EAAOF,EAEnC,IACO8nC,GAGJ5nC,CACX,EACA6nC,EAAWhwC,UAAUswC,oBAAsB,SAAUlvC,GAYjD,OAXI,OAAgBA,KACXpH,KAAKo2C,WAAW3nC,IAAIrH,KAEjBA,EADA8L,MAAMC,QAAQ/L,GACNA,EAAMvD,MAAM,IAGZ,QAAS,CAAEuP,UAAW/H,OAAO4R,eAAe7V,IAAUA,GAElEpH,KAAKo2C,WAAWvtC,IAAIzB,KAGrBA,CACX,EACO4uC,CACX,CAxD+B,E,wICvB/B,SAASO,EAAS3zC,GACd,OAAOA,CACX,CACA,IAAIgpB,EAAmC,WACnC,SAASA,EAAkB8B,EAAWljB,QAClB,IAAZA,IAAsBA,EAAUa,OAAO3C,OAAO,OAClD1I,KAAKw2C,YAAc,KAAgB,IAAIj6B,QAAY,IAAI5O,IACvD3N,KAAK0tB,UAAYA,EACbljB,EAAQ0nB,cAERlyB,KAAKkyB,YAAc1nB,EAAQ0nB,aAE/BlyB,KAAKy2C,QAA2B,IAAlBjsC,EAAQ+F,MACtBvQ,KAAK8sB,YACT,CAqEA,OA/DAlB,EAAkB5lB,UAAUksB,YAAc,SAAUtvB,GAChD,MAAO,CAACA,EACZ,EACAgpB,EAAkB2qB,SAAW,WAIzB,OAAO,IAAI3qB,EAAkB2qB,EAAU,CAAEhmC,OAAO,GACpD,EACAqb,EAAkB4hB,MAAQ,SAAUkJ,EAAWtrB,EAAMC,GAEjD,YADc,IAAVA,IAAoBA,EAAQO,EAAkB2qB,YAC3ClrC,OAAOC,OAAO,IAAIsgB,GAAkB,SAAUhpB,GAEjD,OADwB8zC,EAAU9zC,GAAYwoB,EAAOC,GAC5Bpa,kBAAkBrO,EAC/C,GAEA,CAAE2N,OAAO,IAAU,CAAE6a,KAAMA,EAAMC,MAAOA,GAC5C,EAIAO,EAAkB5lB,UAAU8mB,WAAa,WACrC,IAAIpc,EAAQ1Q,KACZ,GAAIA,KAAKy2C,OAAQ,CACb,IAAIE,EAAoB,IAAI,IAAK,MACjC32C,KAAK42C,aAAc,QAAKhrB,EAAkB5lB,UAAU4wC,YAAYh2C,KAAKZ,MAAO,CACxEya,aAAc,SAAU7X,GACpB,IAAIi0C,EAAYnmC,EAAMwhB,YAAYtvB,GAClC,GAAIi0C,EAEA,OADA,QAAU3jC,MAAMC,QAAQ0jC,GAAY,IAC7BF,EAAkBh8B,YAAYk8B,EAE7C,EACAvmC,IAAK,IAAW,2BAChBC,MAAQ,EAAS,GAEzB,CACJ,EACAqb,EAAkB5lB,UAAU4wC,YAAc,SAAUh0C,GAEhD,OADA,QAAcA,GACP5C,KAAK0tB,UAAU9qB,EAC1B,EACAgpB,EAAkB5lB,UAAUiL,kBAAoB,SAAUrO,GAGtD,GAAI5C,KAAKw2C,YAAY/nC,IAAI7L,GACrB,OAAOA,EAEX,IAAIk0C,EAAsB92C,KAAK42C,YAAYh0C,GAE3C,OADA5C,KAAKw2C,YAAY3tC,IAAIiuC,GACdA,CACX,EACAlrB,EAAkB5lB,UAAU4N,OAAS,SAAUmjC,GAC3C,IAAIrmC,EAAQ1Q,KACZ,OAAOqL,OAAOC,OAAO,IAAIsgB,GAAkB,SAAUhpB,GACjD,OAAOm0C,EAAe9lC,kBAAkBP,EAAMO,kBAAkBrO,GACpE,GAEA,CAAE2N,OAAO,IAAU,CACf6a,KAAMprB,KACNqrB,MAAO0rB,GAEf,EACOnrB,CACX,CAjFsC,E,mICR/B,SAASorB,EAAcjrC,EAAIL,GAC9B,IAAIoW,EAAa/V,EAAG+V,WACpB,OAAKA,IAAeA,EAAWhe,QAqD5B,SAAgCge,GACnC,IAAI7V,EAAS,GACT6V,GAAcA,EAAWhe,QACzBge,EAAWjU,SAAQ,SAAUqmB,GACzB,GARZ,SAA8BnoB,GAC1B,IAAI3E,EAAQ2E,EAAGjC,KAAK1C,MACpB,MAAiB,SAAVA,GAA8B,YAAVA,CAC/B,CAKiB6vC,CAAqB/iB,GAA1B,CAEA,IAAIgjB,EAAqBhjB,EAAUtnB,UAC/BuqC,EAAgBjjB,EAAUpqB,KAAK1C,OACnC,QAAU8vC,GAAoD,IAA9BA,EAAmBpzC,OAAc,GAAIqzC,GACrE,IAAIC,EAAaF,EAAmB,IACpC,QAAUE,EAAWttC,MAAkC,OAA1BstC,EAAWttC,KAAK1C,MAAgB,GAAI+vC,GACjE,IAAIE,EAAUD,EAAWhwC,OAEzB,QAAUiwC,IACY,aAAjBA,EAAQtpC,MAAwC,iBAAjBspC,EAAQtpC,MAA0B,GAAIopC,GAC1ElrC,EAAO/L,KAAK,CAAEg0B,UAAWA,EAAWkjB,WAAYA,GAVtC,CAWd,IAEJ,OAAOnrC,CACX,CArEWqrC,CAAuBx1B,GAAY/M,OAAM,SAAUhJ,GACtD,IAAImoB,EAAYnoB,EAAGmoB,UAAWkjB,EAAarrC,EAAGqrC,WAC1CG,GAAc,EASlB,MAR8B,aAA1BH,EAAWhwC,MAAM2G,MACjBwpC,EACI7rC,GAAaA,EAAU0rC,EAAWhwC,MAAM0C,KAAK1C,QACjD,aAA0B,IAAhBmwC,EAAwB,GAAIrjB,EAAUpqB,KAAK1C,QAGrDmwC,EAAcH,EAAWhwC,MAAMA,MAEH,SAAzB8sB,EAAUpqB,KAAK1C,OAAoBmwC,EAAcA,CAC5D,GACJ,CAgBO,SAASC,EAAcC,EAAOn9B,EAAMqZ,GACvC,IAAI+jB,EAAU,IAAI/pC,IAAI8pC,GAClBE,EAAcD,EAAQryB,KAU1B,OATA,QAAM/K,EAAM,CACRmY,UAAW,SAAUtjB,GACjB,GAAIuoC,EAAQ3+B,OAAO5J,EAAKrF,KAAK1C,UAAYusB,IAAQ+jB,EAAQryB,MACrD,OAAO,IAEf,IAIGsO,GAAO+jB,EAAQryB,KAAOqyB,EAAQryB,KAAOsyB,CAChD,CACO,SAASne,EAAiB52B,GAC7B,OAAOA,GAAY40C,EAAc,CAAC,SAAU,UAAW50C,GAAU,EACrE,C,mIC5BO,SAASg1C,EAAyBh1C,EAAUoL,GAC/C,IAAI6pC,EAAqB7pC,EAIrBsH,EAAY,GA4ChB,OA3CA1S,EAASgL,YAAYC,SAAQ,SAAUiqC,GAGnC,GAAwB,wBAApBA,EAAW/pC,KACX,MAAM,QACF,GACA+pC,EAAWhtC,UACXgtC,EAAWhuC,KAAO,WAAW8J,OAAOkkC,EAAWhuC,KAAK1C,MAAO,KAAO,IAKlD,uBAApB0wC,EAAW/pC,MACXuH,EAAUpV,KAAK43C,EAEvB,IAGkC,qBAAvBD,KACP,QAA+B,IAArBviC,EAAUxR,OAAc,GAAIwR,EAAUxR,QAChD+zC,EAAqBviC,EAAU,GAAGxL,KAAK1C,QAI/B,SAAS,QAAS,CAAC,EAAGxE,GAAW,CAAEgL,aAAa,QAAc,CAClE,CACIG,KAAM,sBAENjD,UAAW,QACXgK,aAAc,CACV/G,KAAM,eACNkH,WAAY,CACR,CACIlH,KAAM,iBACNjE,KAAM,CACFiE,KAAM,OACN3G,MAAOywC,QAM5Bj1C,EAASgL,aAAa,IAEjC,CAGO,SAASmqC,EAAkBziC,QACZ,IAAdA,IAAwBA,EAAY,IACxC,IAAI0iC,EAAW,CAAC,EAIhB,OAHA1iC,EAAUzH,SAAQ,SAAU+D,GACxBomC,EAASpmC,EAAS9H,KAAK1C,OAASwK,CACpC,IACOomC,CACX,CACO,SAASC,EAAyBr4B,EAAWrK,GAChD,OAAQqK,EAAU7R,MACd,IAAK,iBACD,OAAO6R,EACX,IAAK,iBACD,IAAI5R,EAAe4R,EAAU9V,KAAK1C,MAClC,GAA2B,oBAAhBmO,EACP,OAAOA,EAAYvH,GAEvB,IAAI4D,EAAW2D,GAAeA,EAAYvH,GAE1C,OADA,QAAU4D,EAAU,GAAI5D,GACjB4D,GAAY,KAEvB,QACI,OAAO,KAEnB,C,2PClGO,SAASsmC,EAAcjpC,IAC1B,QAAUA,GAAoB,aAAbA,EAAIlB,KAAqB,IAC1C,IAAI28B,EAAaz7B,EAAIrB,YAChB3F,QAAO,SAAU4S,GAAK,MAAkB,uBAAXA,EAAE9M,IAA+B,IAC9DxF,KAAI,SAAUuvC,GACf,GAAwB,wBAApBA,EAAW/pC,KACX,MAAM,QAAkB,GAAI+pC,EAAW/pC,MAE3C,OAAO+pC,CACX,IAEA,OADA,QAAUpN,EAAW5mC,QAAU,EAAG,GAAI4mC,EAAW5mC,QAC1CmL,CACX,CACO,SAASkpC,EAAuBlpC,GAEnC,OADAipC,EAAcjpC,GACPA,EAAIrB,YAAY3F,QAAO,SAAU6vC,GACpC,MAA2B,wBAApBA,EAAW/pC,IACtB,IAAG,EACP,CACO,SAASqqC,EAAiBnpC,GAC7B,OAAQA,EAAIrB,YACP3F,QAAO,SAAU6vC,GAClB,MAA2B,wBAApBA,EAAW/pC,QAAoC+pC,EAAWhuC,IACrE,IACKvB,KAAI,SAAU+kC,GAAK,OAAOA,EAAExjC,KAAK1C,KAAO,IAAG,IAAM,IAC1D,CAEO,SAASixC,EAAuBppC,GACnC,OAAOA,EAAIrB,YAAY3F,QAAO,SAAU6vC,GACpC,MAA2B,uBAApBA,EAAW/pC,IACtB,GACJ,CACO,SAASuqC,EAAmBrpC,GAC/B,IAAIs3B,EAAW4R,EAAuBlpC,GAEtC,OADA,QAAUs3B,GAAmC,UAAvBA,EAASz7B,UAAuB,IAC/Cy7B,CACX,CACO,SAASgS,EAAsBtpC,IAClC,QAAuB,aAAbA,EAAIlB,KAAqB,KACnC,QAAUkB,EAAIrB,YAAY9J,QAAU,EAAG,IACvC,IAAI00C,EAAcvpC,EAAIrB,YAAY,GAElC,OADA,QAA+B,uBAArB4qC,EAAYzqC,KAA+B,IAC9CyqC,CACX,CAMO,SAASC,EAAkBC,GAE9B,IAAI5qC,EADJoqC,EAAcQ,GAEd,IAAK,IAAIhpC,EAAK,EAAG3D,EAAK2sC,EAAS9qC,YAAa8B,EAAK3D,EAAGjI,OAAQ4L,IAAM,CAC9D,IAAIooC,EAAa/rC,EAAG2D,GACpB,GAAwB,wBAApBooC,EAAW/pC,KAAgC,CAC3C,IAAIjD,EAAYgtC,EAAWhtC,UAC3B,GAAkB,UAAdA,GACc,aAAdA,GACc,iBAAdA,EACA,OAAOgtC,CAEf,CACwB,uBAApBA,EAAW/pC,MAAkCD,IAG7CA,EAAqBgqC,EAE7B,CACA,GAAIhqC,EACA,OAAOA,EAEX,MAAM,QAAkB,GAC5B,CACO,SAAS6qC,EAAiBb,GAC7B,IAAIc,EAAgBvtC,OAAO3C,OAAO,MAC9BmwC,EAAOf,GAAcA,EAAWtR,oBAQpC,OAPIqS,GAAQA,EAAK/0C,QACb+0C,EAAKhrC,SAAQ,SAAU4H,GACfA,EAAIqjC,eACJ,OAA4BF,EAAenjC,EAAIixB,SAAS58B,KAAM2L,EAAIqjC,aAE1E,IAEGF,CACX,C,4DCpFIG,E,0CACOttC,EAAQJ,OAAOC,QAAO,SAAUmC,GACvC,IAAIxB,EAAS8sC,EAAWvqC,IAAIf,GAK5B,OAJKxB,IACDA,GAAS,OAAUwB,GACnBsrC,EAAWpqC,IAAIlB,EAAKxB,IAEjBA,CACX,GAAG,CACC4gB,MAAO,WACHksB,EAAa,IAAI,EAAAngB,EAAqB,IAAWntB,OAAS,IAC9D,IAEJA,EAAMohB,SACqB,IAAvBja,WAAWC,UACX,QAAoB,SAAS,WAAc,OAAQkmC,EAAaA,EAAW1zB,KAAO,CAAI,G,wVCdnF,SAAS2zB,EAAcvnC,GAC1B,MAAO,CAAE+C,MAAO4P,OAAO3S,GAC3B,CACO,SAAS2G,EAAYkB,GACxB,OAAOqP,QAAQrP,GAAsB,kBAARA,GAAyC,kBAAdA,EAAI9E,MAChE,CACO,SAASykC,EAAe7xC,GAC3B,OAAQ,OAAgBA,IACL,aAAfA,EAAM2G,MACNmF,MAAMC,QAAQ/L,EAAMwG,YAC5B,CA4BO,SAASsrC,EAA4BC,EAAQrvC,EAAM1C,EAAOsE,GAC7D,GAtBJ,SAAoBtE,GAChB,MAAsB,aAAfA,EAAM2G,IACjB,CAoBQqrC,CAAWhyC,IAnBnB,SAAsBA,GAClB,MAAsB,eAAfA,EAAM2G,IACjB,CAiB6BsrC,CAAajyC,GAClC+xC,EAAOrvC,EAAK1C,OAASkyC,OAAOlyC,EAAMA,YAEjC,GA5BT,SAAwBA,GACpB,MAAsB,iBAAfA,EAAM2G,IACjB,CA0BawrC,CAAenyC,IA/B5B,SAAuBA,GACnB,MAAsB,gBAAfA,EAAM2G,IACjB,CA6BsCyrC,CAAcpyC,GAC5C+xC,EAAOrvC,EAAK1C,OAASA,EAAMA,WAE1B,GAnBT,SAAuBA,GACnB,MAAsB,gBAAfA,EAAM2G,IACjB,CAiBa0rC,CAAcryC,GAAQ,CAC3B,IAAIsyC,EAAiB,CAAC,EACtBtyC,EAAM2Q,OAAOxP,KAAI,SAAU+Q,GACvB,OAAO4/B,EAA4BQ,EAAgBpgC,EAAIxP,KAAMwP,EAAIlS,MAAOsE,EAC5E,IACAytC,EAAOrvC,EAAK1C,OAASsyC,CACzB,MACK,GA7BT,SAAoBtyC,GAChB,MAAsB,aAAfA,EAAM2G,IACjB,CA2Ba4rC,CAAWvyC,GAAQ,CACxB,IAAIwyC,GAAiBluC,GAAa,CAAC,GAAGtE,EAAM0C,KAAK1C,OACjD+xC,EAAOrvC,EAAK1C,OAASwyC,CACzB,MACK,GA3BT,SAAqBxyC,GACjB,MAAsB,cAAfA,EAAM2G,IACjB,CAyBa8rC,CAAYzyC,GACjB+xC,EAAOrvC,EAAK1C,OAASA,EAAMgZ,OAAO7X,KAAI,SAAUuxC,GAC5C,IAAIC,EAAoB,CAAC,EAEzB,OADAb,EAA4Ba,EAAmBjwC,EAAMgwC,EAAWpuC,GACzDquC,EAAkBjwC,EAAK1C,MAClC,SAEC,GA/BT,SAAqBA,GACjB,MAAsB,cAAfA,EAAM2G,IACjB,CA6BaisC,CAAY5yC,GACjB+xC,EAAOrvC,EAAK1C,OAASA,EAAMA,UAE1B,KA/BT,SAAqBA,GACjB,MAAsB,cAAfA,EAAM2G,IACjB,CA6BaksC,CAAY7yC,GAIjB,MAAM,QAAkB,GAAI0C,EAAK1C,MAAOA,EAAM2G,MAH9CorC,EAAOrvC,EAAK1C,OAAS,IAIzB,CACJ,CACO,SAAS8yC,EAAsBhlC,EAAOxJ,GACzC,IAAIyuC,EAAgB,KAChBjlC,EAAM4M,aACNq4B,EAAgB,CAAC,EACjBjlC,EAAM4M,WAAWjU,SAAQ,SAAUqmB,GAC/BimB,EAAcjmB,EAAUpqB,KAAK1C,OAAS,CAAC,EACnC8sB,EAAUtnB,WACVsnB,EAAUtnB,UAAUiB,SAAQ,SAAU9B,GAClC,IAAIjC,EAAOiC,EAAGjC,KAAM1C,EAAQ2E,EAAG3E,MAC/B,OAAO8xC,EAA4BiB,EAAcjmB,EAAUpqB,KAAK1C,OAAQ0C,EAAM1C,EAAOsE,EACzF,GAER,KAEJ,IAAIytC,EAAS,KAQb,OAPIjkC,EAAMtI,WAAasI,EAAMtI,UAAU9I,SACnCq1C,EAAS,CAAC,EACVjkC,EAAMtI,UAAUiB,SAAQ,SAAU9B,GAC9B,IAAIjC,EAAOiC,EAAGjC,KAAM1C,EAAQ2E,EAAG3E,MAC/B,OAAO8xC,EAA4BC,EAAQrvC,EAAM1C,EAAOsE,EAC5D,KAEG0uC,EAAgBllC,EAAMpL,KAAK1C,MAAO+xC,EAAQgB,EACrD,CACA,IAAIE,EAAmB,CACnB,aACA,UACA,OACA,SACA,OACA,SACA,eAKAC,EAAwB,IACjBF,EAAkB/uC,OAAOC,QAAO,SAAUuL,EAAW3N,EAAM4Y,GAClE,GAAI5Y,GACA4Y,GACAA,EAAuB,YACvBA,EAAuB,WAAO,IAAG,CACjC,GAAIA,EAAuB,WAAU,QACjCA,EAAuB,WAAU,OAAEhe,OAAS,EAAG,CAC/C,IAAIy2C,EAAaz4B,EAAuB,WAAU,OAC9CA,EAAuB,WAAU,OAC/B,GACNy4B,EAAW7gC,OACX,IAAI8gC,EAAiB,CAAC,EAItB,OAHAD,EAAW1sC,SAAQ,SAAU1G,GACzBqzC,EAAerzC,GAAO+B,EAAK/B,EAC/B,IACO,GAAGyM,OAAOkO,EAAuB,WAAO,IAAG,KAAKlO,OAAO0mC,EAAsBE,GAAiB,IACzG,CAEI,OAAO14B,EAAuB,WAAO,GAE7C,CACA,IAAI24B,EAAoB5jC,EACxB,GAAI3N,EAAM,CAIN,IAAIwxC,EAAkBJ,EAAsBpxC,GAC5CuxC,GAAqB,IAAI7mC,OAAO8mC,EAAiB,IACrD,CAaA,OAZI54B,GACAzW,OAAO+D,KAAK0S,GAAYjU,SAAQ,SAAU1G,IACC,IAAnCkzC,EAAiBt2C,QAAQoD,KAEzB2a,EAAW3a,IAAQkE,OAAO+D,KAAK0S,EAAW3a,IAAMrD,OAChD22C,GAAqB,IAAI7mC,OAAOzM,EAAK,KAAKyM,OAAO0mC,EAAsBx4B,EAAW3a,IAAO,KAGzFszC,GAAqB,IAAI7mC,OAAOzM,GAExC,IAEGszC,CACX,GAAG,CACCE,aAAc,SAAUzyC,GACpB,IAAIi/B,EAAWmT,EAEf,OADAA,EAAwBpyC,EACjBi/B,CACX,IAEG,SAASyT,EAAyB1lC,EAAOxJ,GAC5C,GAAIwJ,EAAMtI,WAAasI,EAAMtI,UAAU9I,OAAQ,CAC3C,IAAI+2C,EAAW,CAAC,EAKhB,OAJA3lC,EAAMtI,UAAUiB,SAAQ,SAAU9B,GAC9B,IAAIjC,EAAOiC,EAAGjC,KAAM1C,EAAQ2E,EAAG3E,MAC/B,OAAO8xC,EAA4B2B,EAAU/wC,EAAM1C,EAAOsE,EAC9D,IACOmvC,CACX,CACA,OAAO,IACX,CACO,SAASC,EAAuB5lC,GACnC,OAAOA,EAAM6lC,MAAQ7lC,EAAM6lC,MAAM3zC,MAAQ8N,EAAMpL,KAAK1C,KACxD,CACO,SAAS4zC,EAAsB/uC,EAAQ6I,EAAcS,GAExD,IADA,IAAID,EACK5F,EAAK,EAAG3D,EAAK+I,EAAaG,WAAYvF,EAAK3D,EAAGjI,OAAQ4L,IAAM,CAEjE,GAAIurC,EADAr7B,EAAY7T,EAAG2D,KAEf,GAA6B,eAAzBkQ,EAAU9V,KAAK1C,MACf,OAAO6E,EAAO6uC,EAAuBl7B,SAGpCtK,EACLA,EAAUpV,KAAK0f,GAGftK,EAAY,CAACsK,EAErB,CACA,GAAiC,kBAAtB3T,EAAOwH,WACd,OAAOxH,EAAOwH,WAElB,GAAI6B,EACA,IAAK,IAAItJ,EAAK,EAAGkvC,EAAc5lC,EAAWtJ,EAAKkvC,EAAYp3C,OAAQkI,IAAM,CACrE,IAAI4T,EAAYs7B,EAAYlvC,GACxBgN,EAAWgiC,EAAsB/uC,GAAQ,QAAyB2T,EAAWrK,GAAaT,aAAcS,GAC5G,GAAwB,kBAAbyD,EACP,OAAOA,CAEf,CAER,CACO,SAASiiC,EAAQr7B,GACpB,MAA0B,UAAnBA,EAAU7R,IACrB,CACO,SAASotC,EAAiBv7B,GAC7B,MAA0B,mBAAnBA,EAAU7R,IACrB,C,4NC5MIqtC,EAAiB,CACjBrtC,KAAM,IAAKstC,MACXvxC,KAAM,CACFiE,KAAM,IAAKutC,KACXl0C,MAAO,eAGf,SAASm0C,EAAQrO,EAAI33B,GACjB,OAAS23B,GACLA,EAAGp4B,aAAaG,WAAWF,OAAM,SAAU6K,GACvC,OAAOA,EAAU7R,OAAS,IAAK+R,iBAC3By7B,EAAQhmC,EAAYqK,EAAU9V,KAAK1C,OAAQmO,EACnD,GACR,CACA,SAASimC,EAAiBvsC,GACtB,OAAQssC,GAAQ,QAAuBtsC,KAAQ,QAAsBA,IAAM,SAAkB,QAAuBA,KAChH,KACEA,CACV,CACA,SAASwsC,EAAoB9H,GACzB,IAAI8D,EAAQ,IAAIxqC,IACZyuC,EAAQ,IAAIzuC,IAWhB,OAVA0mC,EAAQ9lC,SAAQ,SAAUqmB,GAClBA,IACIA,EAAUpqB,KACV2tC,EAAM9oC,IAAIulB,EAAUpqB,KAAMoqB,GAErBA,EAAU5qB,MACfoyC,EAAM/sC,IAAIulB,EAAU5qB,KAAM4qB,GAGtC,IACO,SAAUA,GACb,IAAI/f,EAASsjC,EAAMjpC,IAAI0lB,EAAUpqB,KAAK1C,OAQtC,OAPK+M,GAAUunC,EAAMr2B,MACjBq2B,EAAM7tC,SAAQ,SAAU8tC,EAAYryC,GAC5BA,EAAK4qB,KACL/f,EAASwnC,EAEjB,IAEGxnC,CACX,CACJ,CACA,SAASynC,EAAwBC,GAC7B,IAAItzC,EAAM,IAAI0E,IACd,OAAO,SAA6B9F,QACpB,IAARA,IAAkBA,EAAM00C,GAC5B,IAAIC,EAAQvzC,EAAIiG,IAAIrH,GAWpB,OAVK20C,GACDvzC,EAAIoG,IAAIxH,EAAM20C,EAAQ,CAKlBpwC,UAAW,IAAIiC,IACfouC,gBAAiB,IAAIpuC,MAGtBmuC,CACX,CACJ,CACO,SAASE,EAA6Bl6B,EAAY7S,IACrD,QAAcA,GAuBd,IAlBA,IAAIgtC,EAA0BL,EAAwB,IAClDM,EAAyBN,EAAwB,IACjDO,EAAW,SAAUxnB,GACrB,IAAK,IAAI9nB,EAAI,EAAGuvC,OAAW,EAAQvvC,EAAI8nB,EAAU7wB,SAAWs4C,EAAWznB,EAAU9nB,MAAOA,EACpF,KAAI,OAAQuvC,GAAZ,CAEA,GAAIA,EAASruC,OAAS,IAAKsuC,qBAEvB,OAAOJ,EAAwBG,EAAStyC,MAAQsyC,EAAStyC,KAAK1C,OAElE,GAAIg1C,EAASruC,OAAS,IAAKuuC,oBACvB,OAAOJ,EAAuBE,EAAStyC,KAAK1C,MANpC,CAUhB,OADuB,IAAvBwL,WAAWC,SAAqB,KAAU3N,MAAM,IACzC,IACX,EACIq3C,EAAiB,EACZ7vC,EAAIuC,EAAIrB,YAAY9J,OAAS,EAAG4I,GAAK,IAAKA,EAC3CuC,EAAIrB,YAAYlB,GAAGqB,OAAS,IAAKsuC,wBAC/BE,EAGV,IAAIC,EAAmBf,EAAoB35B,GACvC26B,EAAoB,SAAUC,GAC9B,OAAO,OAAgBA,IACnBA,EACKn0C,IAAIi0C,GACJ7pB,MAAK,SAAUxe,GAAU,OAAOA,GAAUA,EAAOzM,MAAQ,GACtE,EACIi1C,EAA6B,IAAI1vC,IAMjC2vC,GAAwB,EACxBC,EAA+B,CAC/BnqB,MAAO,SAAUvjB,GACb,GAAIstC,EAAkBttC,EAAK2S,YAEvB,OADA86B,GAAwB,EACjB,IAEf,GAEAE,GAA8B,QAAM7tC,EAAK,CAEzC8tC,MAAOF,EACPG,eAAgBH,EAChBI,mBAAoB,CAChBvqB,MAAO,WAKH,OAAO,CACX,GAEJ6hB,SAAU,CACN7hB,MAAO,SAAUvjB,EAAMqlC,EAAM0I,EAASC,EAAOxoB,GACzC,IAAImnB,EAAQK,EAASxnB,GACjBmnB,GACAA,EAAMpwC,UAAU7C,IAAIsG,EAAKrF,KAAK1C,MAEtC,GAEJwtB,eAAgB,CACZlC,MAAO,SAAUvjB,EAAMqlC,EAAM0I,EAASC,EAAOxoB,GACzC,GAAI8nB,EAAkBttC,EAAK2S,YAEvB,OADA86B,GAAwB,EACjB,KAEX,IAAId,EAAQK,EAASxnB,GACjBmnB,GACAA,EAAMC,gBAAgBlzC,IAAIsG,EAAKrF,KAAK1C,MAO5C,GAEJg2C,mBAAoB,CAChB1qB,MAAO,SAAUvjB,EAAMqlC,EAAM0I,EAASjqC,GAClC0pC,EAA2BhuC,IAAIlK,KAAKC,UAAUuO,GAAO9D,EACzD,EACAkuC,MAAO,SAAUluC,EAAMqlC,EAAM0I,EAASjqC,GAElC,OAAI9D,IADewtC,EAA2BnuC,IAAI/J,KAAKC,UAAUuO,IAQtD9D,EAMXotC,EAAiB,GACbptC,EAAK2F,aAAaG,WAAWF,OAAM,SAAU6K,GACzC,OAAOA,EAAU7R,OAAS,IAAKstC,OACF,eAAzBz7B,EAAU9V,KAAK1C,KACvB,KAIA80C,EAAuB/sC,EAAKrF,KAAK1C,OAAOk2C,SAAU,EAClDV,GAAwB,EACjB,WAdX,CAgBJ,GAEJnqB,UAAW,CACP4qB,MAAO,SAAUluC,GAIb,GAAIqtC,EAAiBrtC,GAEjB,OADAytC,GAAwB,EACjB,IAEf,KAGR,IAAKA,EAGD,OAAO3tC,EAOX,IAAIsuC,EAAyB,SAAUzB,GAWnC,OAVKA,EAAM0B,iBACP1B,EAAM0B,eAAiB,IAAI7vC,IAAImuC,EAAMpwC,WAChCowC,EAAMwB,SACPxB,EAAMC,gBAAgBluC,SAAQ,SAAU4vC,GACpCF,EAAuBrB,EAAuBuB,IAAoBD,eAAe3vC,SAAQ,SAAU6vC,GAC/F5B,EAAM0B,eAAe30C,IAAI60C,EAC7B,GACJ,KAGD5B,CACX,EAII6B,EAAuB,IAAIhwC,IAC/BmvC,EAA4BlvC,YAAYC,SAAQ,SAAU4H,GAClDA,EAAI1H,OAAS,IAAKsuC,qBAClBkB,EAAuBtB,EAAwBxmC,EAAI3L,MAAQ2L,EAAI3L,KAAK1C,QAAQ20C,gBAAgBluC,SAAQ,SAAU4vC,GAC1GE,EAAqB90C,IAAI40C,EAC7B,IAEKhoC,EAAI1H,OAAS,IAAKuuC,qBAKJ,IAAnBC,GACCL,EAAuBzmC,EAAI3L,KAAK1C,OAAOk2C,SACxCK,EAAqB90C,IAAI4M,EAAI3L,KAAK1C,MAE1C,IAIAu2C,EAAqB9vC,SAAQ,SAAUG,GAGnCuvC,EAAuBrB,EAAuBluC,IAAe+tC,gBAAgBluC,SAAQ,SAAU4vC,GAC3FE,EAAqB90C,IAAI40C,EAC7B,GACJ,IACA,IAQIG,EAAe,CACflrB,MAAO,SAAUvjB,GACb,GAV8BnB,EAUJmB,EAAKrF,KAAK1C,OALtCu2C,EAAqBlvC,IAAIT,IACvBkuC,EAAuBluC,GAAcsvC,QAKjC,OAAO,KAXS,IAAUtvC,CAalC,GAEJ,OAAOwtC,GAAiB,QAAMsB,EAA6B,CAGvDloB,eAAgBgpB,EAEhBR,mBAAoBQ,EACpBC,oBAAqB,CACjBR,MAAO,SAAUluC,GAGb,GAAIA,EAAKq3B,oBAAqB,CAC1B,IAAIsX,EAAsBP,EAE1BtB,EAAwB9sC,EAAKrF,MAAQqF,EAAKrF,KAAK1C,QAAQo2C,eAYvD,GAAIM,EAAoBz4B,KAAOlW,EAAKq3B,oBAAoB1iC,OACpD,OAAO,SAAS,QAAS,CAAC,EAAGqL,GAAO,CAAEq3B,oBAAqBr3B,EAAKq3B,oBAAoBv+B,QAAO,SAAU81C,GAC7F,OAAOD,EAAoBrvC,IAAIsvC,EAAOrX,SAAS58B,KAAK1C,MACxD,KAEZ,CACJ,KAGZ,CACO,IAAIomB,EAAwBniB,OAAOC,QAAO,SAAU2D,GACvD,OAAO,QAAMA,EAAK,CACd+uC,aAAc,CACVtrB,MAAO,SAAUvjB,EAAMqlC,EAAMt9B,GAEzB,IAAIA,GACAA,EAAOnJ,OACH,IAAKsuC,qBAFb,CAMA,IAAIpnC,EAAa9F,EAAK8F,WACtB,GAAKA,EAUL,IALWA,EAAW0d,MAAK,SAAU/S,GACjC,OAAQ,QAAQA,KACc,eAAzBA,EAAU9V,KAAK1C,OACkC,IAA9CwY,EAAU9V,KAAK1C,MAAM62C,YAAY,KAAM,GACnD,IACA,CAKA,IAAI/oC,EAAQgC,EACZ,MAAI,QAAQhC,IACRA,EAAM4M,YACN5M,EAAM4M,WAAW6Q,MAAK,SAAU9X,GAAK,MAAwB,WAAjBA,EAAE/Q,KAAK1C,KAAoB,KAI3E,OAAO,SAAS,QAAS,CAAC,EAAG+H,GAAO,CAAE8F,YAAY,SAAc,QAAc,GAAIA,GAAY,GAAO,CAACmmC,IAAiB,IAVvH,CAfA,CA0BJ,IAGZ,GAAG,CACCv7B,MAAO,SAAU3K,GACb,OAAOA,IAAUkmC,CACrB,IA0GG,SAAS8C,EAA2Bt7C,GAGvC,MAA4B,WAFX,QAAkBA,GACEkI,UAG1BlI,GAGO,QAAMA,EAAU,CAC9Bi7C,oBAAqB,CACjBnrB,MAAO,SAAUvjB,GACb,OAAO,SAAS,QAAS,CAAC,EAAGA,GAAO,CAAErE,UAAW,SACrD,IAIZ,CAEO,SAASqzC,EAA6Bv7C,GAQzC,OAPA,QAAcA,GACIo5C,EAA6B,CAC3C,CACI1yC,KAAM,SAAU4qB,GAAa,MAAgC,WAAzBA,EAAUpqB,KAAK1C,KAAoB,EACvEM,QAAQ,IAEb9E,EAEP,C,wBCheO,SAASw7C,EAAuBnuB,EAAWW,EAAQytB,GAItD,IAAIC,EAAsB,GAC1BruB,EAAUpiB,SAAQ,SAAUwiB,GAAO,OAAOA,EAAIO,IAAW0tB,EAAoBp+C,KAAKmwB,EAAM,IACxFiuB,EAAoBzwC,SAAQ,SAAUwiB,GAAO,OAAOA,EAAIO,GAAQytB,EAAW,GAC/E,C,gHCGO,SAASE,EAAsBC,GAClC,SAAS7vC,EAAIxH,GAITkE,OAAOm3B,eAAegc,EAAUr3C,EAAK,CAAEC,MAAO,KAClD,CAQA,OAPI,MAAgB46B,OAAOyc,SACvB9vC,EAAIqzB,OAAOyc,SAKf9vC,EAAI,aACG6vC,CACX,C,wDCpBA,MAAME,EAAkB,IAAMrzC,OAAO3C,OAAO,OAEtC,QAAEmF,EAAO,MAAEhK,GAAUqP,MAAMlN,WAC3B,eAAE8G,GAAmBzB,OAAOrF,UAC3B,MAAM24C,EACT,WAAAl+C,CAAYm+C,GAAW,EAAMC,EAAWH,GACpC1+C,KAAK4+C,SAAWA,EAChB5+C,KAAK6+C,SAAWA,CACpB,CACA,MAAAnpC,GACI,OAAO1V,KAAK2a,YAAY/N,UAC5B,CACA,WAAA+N,CAAYyC,GACR,IAAIjO,EAAOnP,KAEX,OADA6N,EAAQrI,KAAK4X,GAAOjW,GAAOgI,EAAOA,EAAK2vC,aAAa33C,KAC7C2F,EAAetH,KAAK2J,EAAM,QAC3BA,EAAK5K,KACL4K,EAAK5K,KAAOvE,KAAK6+C,SAASh7C,EAAM2B,KAAK4X,GAC/C,CACA,IAAAiB,GACI,OAAOre,KAAK++C,UAAUnyC,UAC1B,CACA,SAAAmyC,CAAU3hC,GACN,IAAIjO,EAAOnP,KACX,IAAK,IAAI0M,EAAI,EAAGsyC,EAAM5hC,EAAMtZ,OAAQqL,GAAQzC,EAAIsyC,IAAOtyC,EAAG,CACtD,MAAMnE,EAAM4G,EAAK8vC,OAAO7hC,EAAM1Q,IAAI,GAClCyC,EAAO5G,GAAOA,EAAIiG,IAAI4O,EAAM1Q,GAChC,CACA,OAAOyC,GAAQA,EAAK5K,IACxB,CACA,MAAAmD,GACI,OAAO1H,KAAKk/C,YAAYtyC,UAC5B,CACA,WAAAsyC,CAAY9hC,GACR,IAAI7Y,EACJ,GAAI6Y,EAAMtZ,OAAQ,CACd,MAAMkG,EAAOoT,EAAM,GACb7U,EAAMvI,KAAKi/C,OAAOj1C,GAAM,GACxBwQ,EAAQjS,GAAOA,EAAIiG,IAAIxE,GACzBwQ,IACAjW,EAAOiW,EAAM0kC,YAAYr7C,EAAM2B,KAAK4X,EAAO,IACtC5C,EAAMjW,MAASiW,EAAM2kC,MAAU3kC,EAAM4kC,QAAU5kC,EAAM4kC,OAAO/5B,MAC7D9c,EAAIwQ,OAAO/O,GAGvB,MAEIzF,EAAOvE,KAAKuE,YACLvE,KAAKuE,KAEhB,OAAOA,CACX,CACA,YAAAu6C,CAAa33C,GACT,MAAMoB,EAAMvI,KAAKi/C,OAAO93C,GAAK,GAC7B,IAAIqT,EAAQjS,EAAIiG,IAAIrH,GAGpB,OAFKqT,GACDjS,EAAIoG,IAAIxH,EAAKqT,EAAQ,IAAImkC,EAAK3+C,KAAK4+C,SAAU5+C,KAAK6+C,WAC/CrkC,CACX,CACA,MAAAykC,CAAO93C,EAAKuB,GACR,OAAO1I,KAAK4+C,UAKpB,SAAkBx3C,GACd,cAAeA,GACX,IAAK,SACD,GAAc,OAAVA,EACA,MAER,IAAK,WACD,OAAO,EAEf,OAAO,CACX,CAfgCi4C,CAASl4C,GAC3BnH,KAAKm/C,OAASz2C,EAAS1I,KAAKm/C,KAAO,IAAIziC,aAAU,GACjD1c,KAAKo/C,SAAW12C,EAAS1I,KAAKo/C,OAAS,IAAInyC,SAAM,EAC3D,E,8HCpEJ,SAASqyC,EAAQhmC,GAAmV,OAAtOgmC,EAArD,oBAAXtd,QAAoD,kBAApBA,OAAOqO,SAAmC,SAAiB/2B,GAAO,cAAcA,CAAK,EAAsB,SAAiBA,GAAO,OAAOA,GAAyB,oBAAX0oB,QAAyB1oB,EAAI7Y,cAAgBuhC,QAAU1oB,IAAQ0oB,OAAOh8B,UAAY,gBAAkBsT,CAAK,EAAYgmC,EAAQhmC,EAAM,CAEzX,SAASimC,EAAQt4C,EAAQu4C,GAAkB,IAAIpwC,EAAO/D,OAAO+D,KAAKnI,GAAS,GAAIoE,OAAOo0C,sBAAuB,CAAE,IAAIC,EAAUr0C,OAAOo0C,sBAAsBx4C,GAAau4C,IAAgBE,EAAUA,EAAQz3C,QAAO,SAAU03C,GAAO,OAAOt0C,OAAOu0C,yBAAyB34C,EAAQ04C,GAAKld,UAAY,KAAIrzB,EAAKlP,KAAK6M,MAAMqC,EAAMswC,EAAU,CAAE,OAAOtwC,CAAM,CAIpV,SAASywC,EAAgBvmC,EAAKnS,EAAKC,GAAiK,OAApJD,KAAOmS,EAAOjO,OAAOm3B,eAAelpB,EAAKnS,EAAK,CAAEC,MAAOA,EAAOq7B,YAAY,EAAMC,cAAc,EAAMod,UAAU,IAAkBxmC,EAAInS,GAAOC,EAAgBkS,CAAK,CAIhN,SAASymC,EAAkBhK,EAAQiK,GAAS,IAAK,IAAItzC,EAAI,EAAGA,EAAIszC,EAAMl8C,OAAQ4I,IAAK,CAAE,IAAIuzC,EAAaD,EAAMtzC,GAAIuzC,EAAWxd,WAAawd,EAAWxd,aAAc,EAAOwd,EAAWvd,cAAe,EAAU,UAAWud,IAAYA,EAAWH,UAAW,GAAMz0C,OAAOm3B,eAAeuT,EAAQkK,EAAW94C,IAAK84C,EAAa,CAAE,CAQ5T,SAASC,EAA2BvgD,EAAM6F,GAAQ,OAAIA,GAA2B,WAAlB85C,EAAQ95C,IAAsC,oBAATA,EAA8C26C,EAAuBxgD,GAAtC6F,CAA6C,CAEhL,SAAS26C,EAAuBxgD,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIygD,eAAe,6DAAgE,OAAOzgD,CAAM,CAErK,SAAS0gD,EAAiBC,GAAS,IAAIC,EAAwB,oBAARtzC,IAAqB,IAAIA,SAAQ9D,EAA8nB,OAAnnBk3C,EAAmB,SAA0BC,GAAS,GAAc,OAAVA,IAMlIvd,EANuKud,GAMjG,IAAzDE,SAASp1C,SAAS5F,KAAKu9B,GAAIh/B,QAAQ,kBAN+H,OAAOu8C,EAMjN,IAA2Bvd,EAN6L,GAAqB,oBAAVud,EAAwB,MAAM,IAAIG,UAAU,sDAAyD,GAAsB,qBAAXF,EAAwB,CAAE,GAAIA,EAAO9xC,IAAI6xC,GAAQ,OAAOC,EAAO/xC,IAAI8xC,GAAQC,EAAO5xC,IAAI2xC,EAAOI,EAAU,CAAE,SAASA,IAAY,OAAOC,EAAWL,EAAO1zC,UAAWg0C,EAAgB5gD,MAAMS,YAAc,CAAkJ,OAAhJigD,EAAQ16C,UAAYqF,OAAO3C,OAAO43C,EAAMt6C,UAAW,CAAEvF,YAAa,CAAE2G,MAAOs5C,EAASje,YAAY,EAAOqd,UAAU,EAAMpd,cAAc,KAAkBme,EAAgBH,EAASJ,EAAQ,EAAUD,EAAiBC,EAAQ,CAEtvB,SAASK,EAAWG,EAAQ53C,EAAMo3C,GAAqV,OAAzSK,EAA/BI,IAA4CC,QAAQC,UAAiC,SAAoBH,EAAQ53C,EAAMo3C,GAAS,IAAI/2C,EAAI,CAAC,MAAOA,EAAErJ,KAAK6M,MAAMxD,EAAGL,GAAO,IAAsDg4C,EAAW,IAA/CV,SAAS5/C,KAAKmM,MAAM+zC,EAAQv3C,IAA6F,OAAnD+2C,GAAOO,EAAgBK,EAAUZ,EAAMt6C,WAAmBk7C,CAAU,EAAYP,EAAW5zC,MAAM,KAAMH,UAAY,CAEja,SAASm0C,IAA8B,GAAuB,qBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUE,KAAM,OAAO,EAAO,GAAqB,oBAAVC,MAAsB,OAAO,EAAM,IAAiF,OAA3EjhD,KAAK6F,UAAUoF,SAAS5F,KAAKw7C,QAAQC,UAAU9gD,KAAM,IAAI,WAAa,MAAY,CAAM,CAAE,MAAOypB,GAAK,OAAO,CAAO,CAAE,CAInU,SAASi3B,EAAgBQ,EAAGx0C,GAA+G,OAA1Gg0C,EAAkBx1C,OAAOi2C,gBAAkB,SAAyBD,EAAGx0C,GAAsB,OAAjBw0C,EAAEjuC,UAAYvG,EAAUw0C,CAAG,EAAUR,EAAgBQ,EAAGx0C,EAAI,CAEzK,SAAS+zC,EAAgBS,GAAwJ,OAAnJT,EAAkBv1C,OAAOi2C,eAAiBj2C,OAAO4R,eAAiB,SAAyBokC,GAAK,OAAOA,EAAEjuC,WAAa/H,OAAO4R,eAAeokC,EAAI,EAAUT,EAAgBS,EAAI,CAarM,IAAIE,EAA4B,SAAUC,IA/BjD,SAAmBC,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIjB,UAAU,sDAAyDgB,EAASz7C,UAAYqF,OAAO3C,OAAOg5C,GAAcA,EAAW17C,UAAW,CAAEvF,YAAa,CAAE2G,MAAOq6C,EAAU3B,UAAU,EAAMpd,cAAc,KAAegf,GAAYb,EAAgBY,EAAUC,EAAa,CAgC9XC,CAAUJ,EAAcC,GAExB,IAhCoBI,EAAeC,EAJfC,EAAaC,EAAYC,EAoCzChvC,GAhCgB4uC,EAgCML,EAhCSM,EAA4Bd,IAAoC,WAAkC,IAAsC90C,EAAlCg2C,EAAQrB,EAAgBgB,GAAkB,GAAIC,EAA2B,CAAE,IAAIK,EAAYtB,EAAgB5gD,MAAMS,YAAawL,EAAS+0C,QAAQC,UAAUgB,EAAOr1C,UAAWs1C,EAAY,MAASj2C,EAASg2C,EAAMl1C,MAAM/M,KAAM4M,WAAc,OAAOszC,EAA2BlgD,KAAMiM,EAAS,GA2Ena,SAASs1C,EAAat7C,EAASk8C,EAAOh0C,EAAQi0C,EAAWnvC,EAAMovC,EAAe9jB,GAC5E,IAAI+jB,EAAgBC,EAAiBC,EAEjC9xC,GAtFR,SAAyBwwC,EAAUY,GAAe,KAAMZ,aAAoBY,GAAgB,MAAM,IAAIrB,UAAU,oCAAwC,CAwFpJgC,CAAgBziD,KAAMuhD,IAEtB7wC,EAAQsC,EAAOxN,KAAKxF,KAAMiG,IACpB6D,KAAO,eACb4G,EAAM2xC,cAAkC,OAAlBA,QAA4C,IAAlBA,EAA2BA,OAAgBl5C,EAE3FuH,EAAMyxC,MAAQO,EAAiBxvC,MAAMC,QAAQgvC,GAASA,EAAQA,EAAQ,CAACA,QAASh5C,GAGhF,IAFA,IAAIw5C,EAAgB,GAEXC,EAAM,EAAGC,EAAwC,QAA/BC,EAAcpyC,EAAMyxC,aAAmC,IAAhBW,EAAyBA,EAAc,GAAIF,EAAMC,EAAM/+C,OAAQ8+C,IAAO,CACtI,IAAIE,EAGA50C,EADQ20C,EAAMD,GACF10C,IAEL,MAAPA,GACFy0C,EAAcziD,KAAKgO,EAEvB,CAEAy0C,EAAgBD,EAAiBC,GAEjCjyC,EAAMvC,OAAoB,OAAXA,QAA8B,IAAXA,EAAoBA,EAA8C,QAApCm0C,EAAiBK,SAA8C,IAAnBL,OAA4B,EAASA,EAAe,GAAGn0C,OACnKuC,EAAM0xC,UAA0B,OAAdA,QAAoC,IAAdA,EAAuBA,EAAkD,QAArCG,EAAkBI,SAA+C,IAApBJ,OAA6B,EAASA,EAAgBh6C,KAAI,SAAU2F,GAC3L,OAAOA,EAAIpN,KACb,IACA4P,EAAMqyC,UAAYX,GAAaj0C,EAASi0C,EAAU75C,KAAI,SAAUy6C,GAC9D,OAAO,IAAAC,GAAY90C,EAAQ60C,EAC7B,IAA2C,QAArCR,EAAkBG,SAA+C,IAApBH,OAA6B,EAASA,EAAgBj6C,KAAI,SAAU2F,GACrH,OAAO,IAAA+0C,GAAY/0C,EAAIC,OAAQD,EAAIpN,MACrC,IACA4P,EAAMuC,KAAgB,OAATA,QAA0B,IAATA,EAAkBA,OAAO9J,EACvD,IAAI+5C,EAAuC,OAAlBb,QAA4C,IAAlBA,OAA2B,EAASA,EAAc9jB,WAwCrG,OAtCkB,MAAdA,IAAsB,OAAa2kB,GACrCxyC,EAAM6tB,WA/HZ,SAAuBwX,GAAU,IAAK,IAAIrpC,EAAI,EAAGA,EAAIE,UAAU9I,OAAQ4I,IAAK,CAAE,IAAIyB,EAAyB,MAAhBvB,UAAUF,GAAaE,UAAUF,GAAK,CAAC,EAAOA,EAAI,EAAK6yC,EAAQl0C,OAAO8C,IAAS,GAAMN,SAAQ,SAAU1G,GAAO04C,EAAgB9J,EAAQ5uC,EAAKgH,EAAOhH,GAAO,IAAekE,OAAO83C,0BAA6B93C,OAAO+3C,iBAAiBrN,EAAQ1qC,OAAO83C,0BAA0Bh1C,IAAmBoxC,EAAQl0C,OAAO8C,IAASN,SAAQ,SAAU1G,GAAOkE,OAAOm3B,eAAeuT,EAAQ5uC,EAAKkE,OAAOu0C,yBAAyBzxC,EAAQhH,GAAO,GAAM,CAAE,OAAO4uC,CAAQ,CA+H5fsN,CAAc,CAAC,EAAGH,GAErCxyC,EAAM6tB,WAA4B,OAAfA,QAAsC,IAAfA,EAAwBA,EAAa,CAAC,EAKlFlzB,OAAO+3C,iBAAiBjD,EAAuBzvC,GAAQ,CACrDzK,QAAS,CACPw8B,YAAY,GAEdsgB,UAAW,CACTtgB,WAA+B,MAAnB/xB,EAAMqyC,WAEpB9vC,KAAM,CACJwvB,WAA0B,MAAd/xB,EAAMuC,MAEpBsrB,WAAY,CACVkE,WAAgC,MAApB/xB,EAAM6tB,YAAsBlzB,OAAO+D,KAAKsB,EAAM6tB,YAAYz6B,OAAS,GAEjFgG,KAAM,CACJ24B,YAAY,GAEd0f,MAAO,CACL1f,YAAY,GAEdt0B,OAAQ,CACNs0B,YAAY,GAEd2f,UAAW,CACT3f,YAAY,GAEd4f,cAAe,CACb5f,YAAY,KAIM,OAAlB4f,QAA4C,IAAlBA,GAA4BA,EAAcnZ,OACtE79B,OAAOm3B,eAAe2d,EAAuBzvC,GAAQ,QAAS,CAC5DtJ,MAAOi7C,EAAcnZ,MACrB4W,UAAU,EACVpd,cAAc,IAETwd,EAA2BxvC,KAIhC1B,MAAMs0C,kBACRt0C,MAAMs0C,kBAAkBnD,EAAuBzvC,GAAQ6wC,GAEvDl2C,OAAOm3B,eAAe2d,EAAuBzvC,GAAQ,QAAS,CAC5DtJ,MAAO4H,QAAQk6B,MACf4W,UAAU,EACVpd,cAAc,IAIXhyB,EACT,CAgBA,OAjMoBoxC,EAmLPP,GAnLoBQ,EAmLN,CAAC,CAC1B56C,IAAK,WACLC,MAAO,WACL,OAAOm8C,EAAWvjD,KACpB,GAGC,CACDmH,IAAK,KACLqH,IAAK,WACH,MAAO,QACT,MA9L0EuxC,EAAkB+B,EAAY97C,UAAW+7C,GAAiBC,GAAajC,EAAkB+B,EAAaE,GAiM3KT,CACT,CAjKuC,CAiKvBlB,EAAiBrxC,QAEjC,SAAS0zC,EAAiBtlC,GACxB,YAAiBjU,IAAViU,GAAwC,IAAjBA,EAAMtZ,YAAeqF,EAAYiU,CACjE,CAOO,SAASmmC,EAAWr+C,GACzB,IAAIs+C,EAASt+C,EAAMe,QAEnB,GAAIf,EAAMi9C,MACR,IAAK,IAAIsB,EAAM,EAAGC,EAAgBx+C,EAAMi9C,MAAOsB,EAAMC,EAAc5/C,OAAQ2/C,IAAO,CAChF,IAAIt0C,EAAOu0C,EAAcD,GAErBt0C,EAAKjB,MACPs1C,GAAU,QAAS,OAAcr0C,EAAKjB,KAE1C,MACK,GAAIhJ,EAAMiJ,QAAUjJ,EAAM69C,UAC/B,IAAK,IAAIY,EAAM,EAAGC,EAAoB1+C,EAAM69C,UAAWY,EAAMC,EAAkB9/C,OAAQ6/C,IAAO,CAC5F,IAAIE,EAAWD,EAAkBD,GACjCH,GAAU,QAAS,OAAoBt+C,EAAMiJ,OAAQ01C,EACvD,CAGF,OAAOL,CACT,C,uECtOO,SAASM,EAAY31C,EAAQ41C,EAAUC,GAC5C,OAAO,IAAI,IAAa,iBAAiBpwC,OAAOowC,QAAc76C,EAAWgF,EAAQ,CAAC41C,GACpF,C,ooPCAO,IAAIxiB,EAAU,SAKV0iB,EAAc54C,OAAOgS,OAAO,CACrC6mC,MAAO,GACPC,MAAO,EACPC,MAAO,EACPC,cAAe,OCZF,SAASC,EAAUl9C,GAChC,MAA6E,oBAApD,OAAVA,QAA4B,IAAVA,OAAmB,EAASA,EAAM8nB,KACrE,C,gDCMA,EAXWhc,MAAMlN,UAAUgc,KAAO,SAAUuiC,EAAM7N,GAChD,OAAOxjC,MAAMlN,UAAUgc,KAAKxc,KAAK++C,EAAM7N,EACzC,EAAI,SAAU6N,EAAM7N,GAClB,IAAK,IAAIkM,EAAM,EAAGA,EAAM2B,EAAKzgD,OAAQ8+C,IAAO,CAC1C,IAAIx7C,EAAQm9C,EAAK3B,GAEjB,GAAIlM,EAAUtvC,GACZ,OAAOA,CAEX,CACF,ECJA,EANmBiE,OAAO+U,QAAU,SAAU9G,GAC5C,OAAOjO,OAAO+D,KAAKkK,GAAK/Q,KAAI,SAAUpB,GACpC,OAAOmS,EAAInS,EACb,GACF,E,WCEO,SAASq9C,EAAaC,EAAkBtC,EAAOlvC,GACpD,IAAIyxC,EAGArC,EAAgBoC,aAA4Bz1C,MAAQy1C,EAAmB,IAAIz1C,MAAM,4BAA6B,EAAA21C,EAAA,GAAQF,IAE1H,OAAIvxC,MAAMC,QAAQkvC,EAAcpvC,MACvBovC,EAGF,IAAId,EAAA,EAAac,EAAcp8C,QAA4C,QAAlCy+C,EAASrC,EAAcF,aAA8B,IAAXuC,EAAoBA,EAASvC,EAAOE,EAAcl0C,OAAQk0C,EAAcD,UAAWnvC,EAAMovC,EACrL,CCjBA,IAAIuC,EAAU,2BAKP,SAASC,EAAgB/6C,GAC9B,IAAI5E,EAAQ4/C,EAAiBh7C,GAE7B,GAAI5E,EACF,MAAMA,EAGR,OAAO4E,CACT,CAKO,SAASg7C,EAAiBh7C,GAG/B,MAFgB,kBAATA,IAAqB,EAAAi7C,EAAA,GAAU,EAAG,iCAErCj7C,EAAKhG,OAAS,GAAiB,MAAZgG,EAAK,IAA0B,MAAZA,EAAK,GACtC,IAAIy3C,EAAA,EAAa,SAAU3tC,OAAO9J,EAAM,4EAG5C86C,EAAQt7C,KAAKQ,QAAlB,EACS,IAAIy3C,EAAA,EAAa,oDAAqD3tC,OAAO9J,EAAM,eAE9F,CC5BA,IAMA,EANoBuB,OAAO25C,SAAW,SAAU1rC,GAC9C,OAAOjO,OAAO+D,KAAKkK,GAAK/Q,KAAI,SAAUpB,GACpC,MAAO,CAACA,EAAKmS,EAAInS,GACnB,GACF,E,WCiBe,SAAS89C,EAAOV,EAAMrgC,GACnC,OAAOqgC,EAAKjiC,QAAO,SAAU/Z,EAAKyM,GAEhC,OADAzM,EAAI2b,EAAMlP,IAASA,EACZzM,CACT,GAAG8C,OAAO3C,OAAO,MACnB,CCtBe,SAASw8C,EAAS38C,EAAKw6B,GAGpC,IAFA,IAAI92B,EAASZ,OAAO3C,OAAO,MAElBk6C,EAAM,EAAGuC,EAAkB,EAAc58C,GAAMq6C,EAAMuC,EAAgBrhD,OAAQ8+C,IAAO,CAC3F,IAAIwC,EAAQD,EAAgBvC,GACxBpO,EAAO4Q,EAAM,GACbC,EAASD,EAAM,GACnBn5C,EAAOuoC,GAAQzR,EAAGsiB,EAAQ7Q,EAC5B,CAEA,OAAOvoC,CACT,CChBe,SAASq5C,EAAShsC,GAE/B,GAAmC,OAA/BjO,OAAO4R,eAAe3D,GACxB,OAAOA,EAKT,IAFA,IAAI/Q,EAAM8C,OAAO3C,OAAO,MAEfk6C,EAAM,EAAGuC,EAAkB,EAAc7rC,GAAMspC,EAAMuC,EAAgBrhD,OAAQ8+C,IAAO,CAC3F,IAAIwC,EAAQD,EAAgBvC,GACxBz7C,EAAMi+C,EAAM,GACZh+C,EAAQg+C,EAAM,GAClB78C,EAAIpB,GAAOC,CACb,CAEA,OAAOmB,CACT,CCAe,SAASg9C,EAAUhB,EAAMrgC,EAAOshC,GAC7C,OAAOjB,EAAKjiC,QAAO,SAAU/Z,EAAKyM,GAEhC,OADAzM,EAAI2b,EAAMlP,IAASwwC,EAAMxwC,GAClBzM,CACT,GAAG8C,OAAO3C,OAAO,MACnB,C,eCtBI+8C,EAAkB,EAMP,SAASC,EAAWC,EAAUC,GAC3C,IAAIC,EAA2B,kBAAbF,EAAwB,CAACA,EAAUC,GAAa,MAACz8C,EAAWw8C,GAC1EG,EAAaD,EAAK,GAGlB5/C,EAAU,iBAEV6/C,IACF7/C,GAAW6/C,EAAa,KAG1B,IAAIC,EARiBF,EAAK,GAQOt9C,KAAI,SAAU+kC,GAC7C,MAAO,IAAK15B,OAAO05B,EAAG,IACxB,IAEA,OAAQyY,EAAYjiD,QAClB,KAAK,EACH,MAAO,GAET,KAAK,EACH,OAAOmC,EAAU8/C,EAAY,GAAK,IAEpC,KAAK,EACH,OAAO9/C,EAAU8/C,EAAY,GAAK,OAASA,EAAY,GAAK,IAGhE,IAAIC,EAAWD,EAAYliD,MAAM,EAAG4hD,GAChCQ,EAAWD,EAAS96B,MACxB,OAAOjlB,EAAU+/C,EAAS5kC,KAAK,MAAQ,QAAU6kC,EAAW,GAC9D,C,eChCe,SAASC,EAAa5Y,GACnC,OAAOA,CACT,C,eCEe,SAAS6Y,EAAeC,EAAMC,GAI3C,IAHA,IAAIC,EAAO,EACPC,EAAO,EAEJD,EAAOF,EAAKtiD,QAAUyiD,EAAOF,EAAKviD,QAAQ,CAC/C,IAAI0iD,EAAQJ,EAAKK,WAAWH,GACxBI,EAAQL,EAAKI,WAAWF,GAE5B,GAAII,EAAQH,IAAUG,EAAQD,GAAQ,CACpC,IAAIE,EAAO,EAEX,KACIN,EACFM,EAAc,GAAPA,EAAYJ,EAAQK,EAC3BL,EAAQJ,EAAKK,WAAWH,SACjBK,EAAQH,IAAUI,EAAO,GAElC,IAAIE,EAAO,EAEX,KACIP,EACFO,EAAc,GAAPA,EAAYJ,EAAQG,EAC3BH,EAAQL,EAAKI,WAAWF,SACjBI,EAAQD,IAAUI,EAAO,GAElC,GAAIF,EAAOE,EACT,OAAQ,EAGV,GAAIF,EAAOE,EACT,OAAO,CAEX,KAAO,CACL,GAAIN,EAAQE,EACV,OAAQ,EAGV,GAAIF,EAAQE,EACV,OAAO,IAGPJ,IACAC,CACJ,CACF,CAEA,OAAOH,EAAKtiD,OAASuiD,EAAKviD,MAC5B,CACA,IAAI+iD,EAAU,GACVE,EAAU,GAEd,SAASJ,EAAQK,GACf,OAAQnR,MAAMmR,IAASH,GAAWG,GAAQA,GAAQD,CACpD,CCtDe,SAASE,EAAeC,EAAO18C,GAK5C,IAJA,IAAI28C,EAAoB97C,OAAO3C,OAAO,MAClC0+C,EAAkB,IAAIC,EAAgBH,GACtCI,EAAYllD,KAAKmlD,MAAqB,GAAfL,EAAMpjD,QAAgB,EAExC8+C,EAAM,EAAGA,EAAMp4C,EAAQ1G,OAAQ8+C,IAAO,CAC7C,IAAI4E,EAASh9C,EAAQo4C,GACjB6E,EAAWL,EAAgBM,QAAQF,EAAQF,QAE9Bn+C,IAAbs+C,IACFN,EAAkBK,GAAUC,EAEhC,CAEA,OAAOp8C,OAAO+D,KAAK+3C,GAAmBztC,MAAK,SAAUnQ,EAAGo+C,GACtD,IAAIC,EAAeT,EAAkB59C,GAAK49C,EAAkBQ,GAC5D,OAAwB,IAAjBC,EAAqBA,EAAezB,EAAe58C,EAAGo+C,EAC/D,GACF,CAgBA,IAAIN,EAA+B,WACjC,SAASA,EAAgBH,GACvBlnD,KAAK6nD,OAASX,EACdlnD,KAAK8nD,gBAAkBZ,EAAMthD,cAC7B5F,KAAK+nD,YAAcC,EAAchoD,KAAK8nD,iBACtC9nD,KAAKioD,MAAQ,CAAC,IAAI/0C,MAAMg0C,EAAMpjD,OAAS,GAAGokD,KAAK,GAAI,IAAIh1C,MAAMg0C,EAAMpjD,OAAS,GAAGokD,KAAK,GAAI,IAAIh1C,MAAMg0C,EAAMpjD,OAAS,GAAGokD,KAAK,GAC3H,CAwEA,OAtEab,EAAgBrhD,UAEtB0hD,QAAU,SAAiBF,EAAQF,GACxC,GAAItnD,KAAK6nD,SAAWL,EAClB,OAAO,EAGT,IAAIW,EAAkBX,EAAO5hD,cAE7B,GAAI5F,KAAK8nD,kBAAoBK,EAC3B,OAAO,EAGT,IAAI5+C,EAAIy+C,EAAcG,GAClBR,EAAI3nD,KAAK+nD,YAEb,GAAIx+C,EAAEzF,OAAS6jD,EAAE7jD,OAAQ,CACvB,IAAIskD,EAAM7+C,EACVA,EAAIo+C,EACJA,EAAIS,CACN,CAEA,IAAIC,EAAU9+C,EAAEzF,OACZwkD,EAAUX,EAAE7jD,OAEhB,KAAIukD,EAAUC,EAAUhB,GAAxB,CAMA,IAFA,IAAIiB,EAAOvoD,KAAKioD,MAEPO,EAAI,EAAGA,GAAKF,EAASE,IAC5BD,EAAK,GAAGC,GAAKA,EAGf,IAAK,IAAI97C,EAAI,EAAGA,GAAK27C,EAAS37C,IAAK,CAKjC,IAJA,IAAI+7C,EAAQF,GAAM77C,EAAI,GAAK,GACvBg8C,EAAaH,EAAK77C,EAAI,GACtBi8C,EAAeD,EAAW,GAAKh8C,EAE1B4tB,EAAK,EAAGA,GAAMguB,EAAShuB,IAAM,CACpC,IAAIsuB,EAAOr/C,EAAEmD,EAAI,KAAOi7C,EAAErtB,EAAK,GAAK,EAAI,EACpCuuB,EAAczmD,KAAKE,IAAImmD,EAAMnuB,GAAM,EACvCouB,EAAWpuB,EAAK,GAAK,EACrBmuB,EAAMnuB,EAAK,GAAKsuB,GAGhB,GAAIl8C,EAAI,GAAK4tB,EAAK,GAAK/wB,EAAEmD,EAAI,KAAOi7C,EAAErtB,EAAK,IAAM/wB,EAAEmD,EAAI,KAAOi7C,EAAErtB,EAAK,GAAI,CAEvE,IAAIwuB,EAAqBP,GAAM77C,EAAI,GAAK,GAAG4tB,EAAK,GAChDuuB,EAAczmD,KAAKE,IAAIumD,EAAaC,EAAqB,EAC3D,CAEID,EAAcF,IAChBA,EAAeE,GAGjBH,EAAWpuB,GAAMuuB,CACnB,CAGA,GAAIF,EAAerB,EACjB,MAEJ,CAEA,IAAIG,EAAWc,EAAKF,EAAU,GAAGC,GACjC,OAAOb,GAAYH,EAAYG,OAAWt+C,CAxC1C,CAyCF,EAEOk+C,CACT,CA/EmC,GAiFnC,SAASW,EAAce,GAIrB,IAHA,IAAIC,EAAYD,EAAIjlD,OAChBsZ,EAAQ,IAAIlK,MAAM81C,GAEbt8C,EAAI,EAAGA,EAAIs8C,IAAat8C,EAC/B0Q,EAAM1Q,GAAKq8C,EAAItC,WAAW/5C,GAG5B,OAAO0Q,CACT,C,qCC7GO,SAAS6rC,EAAoBC,EAAWx9C,GAC7C,OAAQw9C,EAAUn7C,MAChB,KAAK,IAAKo7C,KACR,OAAO,KAET,KAAK,IAAKC,IACR,OAAOC,SAASH,EAAU9hD,MAAO,IAEnC,KAAK,IAAKkiD,MACR,OAAOC,WAAWL,EAAU9hD,OAE9B,KAAK,IAAKoiD,OACV,KAAK,IAAKC,KACV,KAAK,IAAKC,QACR,OAAOR,EAAU9hD,MAEnB,KAAK,IAAKuiD,KACR,OAAOT,EAAU9oC,OAAO7X,KAAI,SAAU4G,GACpC,OAAO85C,EAAoB95C,EAAMzD,EACnC,IAEF,KAAK,IAAKk+C,OACR,OAAOrE,EAAU2D,EAAUnxC,QAAQ,SAAU7C,GAC3C,OAAOA,EAAMpL,KAAK1C,KACpB,IAAG,SAAU8N,GACX,OAAO+zC,EAAoB/zC,EAAM9N,MAAOsE,EAC1C,IAEF,KAAK,IAAKm+C,SACR,OAAqB,OAAdn+C,QAAoC,IAAdA,OAAuB,EAASA,EAAUw9C,EAAUp/C,KAAK1C,QAIjF,EAAA0iD,EAAA,GAAU,EAAG,2BAA4B,EAAAnF,EAAA,GAAQuE,GAC5D,CCvDA,SAASnJ,EAAkBhK,EAAQiK,GAAS,IAAK,IAAItzC,EAAI,EAAGA,EAAIszC,EAAMl8C,OAAQ4I,IAAK,CAAE,IAAIuzC,EAAaD,EAAMtzC,GAAIuzC,EAAWxd,WAAawd,EAAWxd,aAAc,EAAOwd,EAAWvd,cAAe,EAAU,UAAWud,IAAYA,EAAWH,UAAW,GAAMz0C,OAAOm3B,eAAeuT,EAAQkK,EAAW94C,IAAK84C,EAAa,CAAE,CAE5T,SAAS8J,EAAajI,EAAaC,EAAYC,GAAmJ,OAAhID,GAAYhC,EAAkB+B,EAAY97C,UAAW+7C,GAAiBC,GAAajC,EAAkB+B,EAAaE,GAAqBF,CAAa,CAoB/M,SAASkI,EAAO1jD,GACrB,OAAO2jD,EAAa3jD,IAAS4jD,EAAa5jD,IAAS6jD,EAAgB7jD,IAAS8jD,EAAY9jD,IAAS+jD,EAAW/jD,IAASgkD,GAAkBhkD,IAASikD,GAAWjkD,IAASkkD,GAAclkD,EACpL,CACO,SAASmkD,EAAWnkD,GACzB,IAAK0jD,EAAO1jD,GACV,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,2BAGpD,OAAOA,CACT,CAMO,SAAS2jD,EAAa3jD,GAC3B,OAAO,EAAAokD,EAAA,GAAWpkD,EAAMqkD,GAC1B,CACO,SAASC,EAAiBtkD,GAC/B,IAAK2jD,EAAa3jD,GAChB,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,kCAGpD,OAAOA,CACT,CAEO,SAAS4jD,EAAa5jD,GAC3B,OAAO,EAAAokD,EAAA,GAAWpkD,EAAMukD,GAC1B,CACO,SAASC,EAAiBxkD,GAC/B,IAAK4jD,EAAa5jD,GAChB,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,kCAGpD,OAAOA,CACT,CAEO,SAAS6jD,EAAgB7jD,GAC9B,OAAO,EAAAokD,EAAA,GAAWpkD,EAAMykD,GAC1B,CACO,SAASC,EAAoB1kD,GAClC,IAAK6jD,EAAgB7jD,GACnB,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,qCAGpD,OAAOA,CACT,CAEO,SAAS8jD,EAAY9jD,GAC1B,OAAO,EAAAokD,EAAA,GAAWpkD,EAAM2kD,GAC1B,CACO,SAASC,EAAgB5kD,GAC9B,IAAK8jD,EAAY9jD,GACf,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,iCAGpD,OAAOA,CACT,CAEO,SAAS+jD,EAAW/jD,GACzB,OAAO,EAAAokD,EAAA,GAAWpkD,EAAM6kD,GAC1B,CACO,SAASC,EAAe9kD,GAC7B,IAAK+jD,EAAW/jD,GACd,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,gCAGpD,OAAOA,CACT,CAEO,SAASgkD,GAAkBhkD,GAChC,OAAO,EAAAokD,EAAA,GAAWpkD,EAAM+kD,GAC1B,CACO,SAASC,GAAsBhlD,GACpC,IAAKgkD,GAAkBhkD,GACrB,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,wCAGpD,OAAOA,CACT,CAEO,SAASikD,GAAWjkD,GACzB,OAAO,EAAAokD,EAAA,GAAWpkD,EAAMilD,GAC1B,CACO,SAASC,GAAellD,GAC7B,IAAKikD,GAAWjkD,GACd,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,gCAGpD,OAAOA,CACT,CAEO,SAASkkD,GAAclkD,GAC5B,OAAO,EAAAokD,EAAA,GAAWpkD,EAAMmlD,GAC1B,CACO,SAASC,GAAkBplD,GAChC,IAAKkkD,GAAclkD,GACjB,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,oCAGpD,OAAOA,CACT,CAKO,SAASqlD,GAAYrlD,GAC1B,OAAO2jD,EAAa3jD,IAAS+jD,EAAW/jD,IAASgkD,GAAkBhkD,IAASslD,GAAetlD,IAASqlD,GAAYrlD,EAAKulD,OACvH,CACO,SAASC,GAAgBxlD,GAC9B,IAAKqlD,GAAYrlD,GACf,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,iCAGpD,OAAOA,CACT,CAKO,SAASylD,GAAazlD,GAC3B,OAAO2jD,EAAa3jD,IAAS4jD,EAAa5jD,IAAS6jD,EAAgB7jD,IAAS8jD,EAAY9jD,IAAS+jD,EAAW/jD,IAASslD,GAAetlD,IAASylD,GAAazlD,EAAKulD,OACjK,CACO,SAASG,GAAiB1lD,GAC/B,IAAKylD,GAAazlD,GAChB,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,kCAGpD,OAAOA,CACT,CAKO,SAAS2lD,GAAW3lD,GACzB,OAAO2jD,EAAa3jD,IAAS+jD,EAAW/jD,EAC1C,CACO,SAAS4lD,GAAe5lD,GAC7B,IAAK2lD,GAAW3lD,GACd,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,gCAGpD,OAAOA,CACT,CAKO,SAAS6lD,GAAgB7lD,GAC9B,OAAO4jD,EAAa5jD,IAAS6jD,EAAgB7jD,IAAS8jD,EAAY9jD,EACpE,CACO,SAAS8lD,GAAoB9lD,GAClC,IAAK6lD,GAAgB7lD,GACnB,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,qCAGpD,OAAOA,CACT,CAKO,SAAS+lD,GAAe/lD,GAC7B,OAAO6jD,EAAgB7jD,IAAS8jD,EAAY9jD,EAC9C,CACO,SAASgmD,GAAmBhmD,GACjC,IAAK+lD,GAAe/lD,GAClB,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,oCAGpD,OAAOA,CACT,CA8BO,SAASilD,GAAYM,GAE1B,KAAI7rD,gBAAgBurD,IAGlB,OAAO,IAAIA,GAAYM,GAFvB7rD,KAAK6rD,OAASpB,EAAWoB,EAI7B,CAgDO,SAASJ,GAAeI,GAE7B,KAAI7rD,gBAAgByrD,IAGlB,OAAO,IAAIA,GAAeI,GAF1B7rD,KAAK6rD,OAASU,GAAmBV,EAIrC,CAqBO,SAASD,GAAetlD,GAC7B,OAAOikD,GAAWjkD,IAASkkD,GAAclkD,EAC3C,CACO,SAASkmD,GAAmBlmD,GACjC,IAAKslD,GAAetlD,GAClB,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,oCAGpD,OAAOA,CACT,CAKO,SAASmmD,GAAenmD,GAC7B,OAAO0jD,EAAO1jD,KAAUkkD,GAAclkD,EACxC,CACO,SAASimD,GAAmBjmD,GACjC,IAAKmmD,GAAenmD,GAClB,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,oCAGpD,OAAOA,CACT,CAGO,SAASomD,GAAgBpmD,GAE9B,GAAIA,EACF,OAAOkkD,GAAclkD,GAAQA,EAAKulD,OAASvlD,CAE/C,CAKO,SAASqmD,GAAYrmD,GAC1B,OAAO2jD,EAAa3jD,IAAS4jD,EAAa5jD,IAAS6jD,EAAgB7jD,IAAS8jD,EAAY9jD,IAAS+jD,EAAW/jD,IAASgkD,GAAkBhkD,EACzI,CACO,SAASsmD,GAAgBtmD,GAC9B,IAAKqmD,GAAYrmD,GACf,MAAM,IAAI0I,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,iCAGpD,OAAOA,CACT,CAGO,SAASumD,GAAavmD,GAE3B,GAAIA,EAAM,CAGR,IAFA,IAAIwmD,EAAgBxmD,EAEbslD,GAAekB,IACpBA,EAAgBA,EAAcjB,OAGhC,OAAOiB,CACT,CACF,CAMA,SAASC,GAAaC,GAEpB,MAAwB,oBAAVA,EAAuBA,IAAUA,CACjD,CAEA,SAASC,GAAgBC,GACvB,OAAOA,GAAOA,EAAIppD,OAAS,EAAIopD,OAAM/jD,CACvC,CAlJAoiD,GAAYvlD,UAAUoF,SAAW,WAC/B,MAAO,IAAMgZ,OAAOpkB,KAAK6rD,QAAU,GACrC,EAEAN,GAAYvlD,UAAUmnD,OAAS,WAC7B,OAAOntD,KAAKoL,UACd,EAEAC,OAAOm3B,eAAe+oB,GAAYvlD,UAAW,KAAsB,CACjEwI,IAAK,WACH,MAAO,aACT,KAGF,EAAA4+C,EAAA,GAAc7B,IAyCdE,GAAezlD,UAAUoF,SAAW,WAClC,OAAOgZ,OAAOpkB,KAAK6rD,QAAU,GAC/B,EAEAJ,GAAezlD,UAAUmnD,OAAS,WAChC,OAAOntD,KAAKoL,UACd,EAEAC,OAAOm3B,eAAeipB,GAAezlD,UAAW,KAAsB,CACpEwI,IAAK,WACH,MAAO,gBACT,KAGF,EAAA4+C,EAAA,GAAc3B,IAwGP,IAAId,GAAiC,WAC1C,SAASA,EAAkBx2C,GACzB,IAAIk5C,EAAoBC,EAAmBC,EAEvCC,EAA0D,QAA5CH,EAAqBl5C,EAAOq5C,kBAA+C,IAAvBH,EAAgCA,EAAqBnH,EAC3HlmD,KAAK8J,KAAOqK,EAAOrK,KACnB9J,KAAKgkD,YAAc7vC,EAAO6vC,YAC1BhkD,KAAKytD,eAAiBt5C,EAAOs5C,eAC7BztD,KAAK0tD,UAAuD,QAA1CJ,EAAoBn5C,EAAOu5C,iBAA6C,IAAtBJ,EAA+BA,EAAoBpH,EACvHlmD,KAAKwtD,WAAaA,EAClBxtD,KAAK2tD,aAAgE,QAAhDJ,EAAuBp5C,EAAOw5C,oBAAmD,IAAzBJ,EAAkCA,EAAuB,SAAUp+C,EAAMzD,GACpJ,OAAO8hD,EAAWvE,EAAoB95C,EAAMzD,GAC9C,EACA1L,KAAKu+B,WAAapqB,EAAOoqB,YAAc+mB,EAASnxC,EAAOoqB,YACvDv+B,KAAK4tD,QAAUz5C,EAAOy5C,QACtB5tD,KAAK6tD,kBAAoBZ,GAAgB94C,EAAO05C,mBACzB,kBAAhB15C,EAAOrK,OAAqB,EAAAi7C,EAAA,GAAU,EAAG,sBACvB,MAAzB5wC,EAAOs5C,gBAA2D,kBAA1Bt5C,EAAOs5C,iBAA+B,EAAA1I,EAAA,GAAU,EAAG,GAAGnxC,OAAO5T,KAAK8J,KAAM,gDAAoD,YAAY8J,QAAO,EAAA+wC,EAAA,GAAQxwC,EAAOs5C,gBAAiB,MACnM,MAApBt5C,EAAOu5C,WAAiD,oBAArBv5C,EAAOu5C,YAA4B,EAAA3I,EAAA,GAAU,EAAG,GAAGnxC,OAAO5T,KAAK8J,KAAM,iKAEpGqK,EAAOw5C,eACoB,oBAAtBx5C,EAAOq5C,YAA4D,oBAAxBr5C,EAAOw5C,eAA+B,EAAA5I,EAAA,GAAU,EAAG,GAAGnxC,OAAO5T,KAAK8J,KAAM,kEAE9H,CAEA,IAAIgkD,EAASnD,EAAkB3kD,UAkC/B,OAhCA8nD,EAAOC,SAAW,WAChB,IAAIC,EAEJ,MAAO,CACLlkD,KAAM9J,KAAK8J,KACXk6C,YAAahkD,KAAKgkD,YAClByJ,eAAgBztD,KAAKytD,eACrBC,UAAW1tD,KAAK0tD,UAChBF,WAAYxtD,KAAKwtD,WACjBG,aAAc3tD,KAAK2tD,aACnBpvB,WAAYv+B,KAAKu+B,WACjBqvB,QAAS5tD,KAAK4tD,QACdC,kBAAwE,QAApDG,EAAwBhuD,KAAK6tD,yBAAyD,IAA1BG,EAAmCA,EAAwB,GAE/I,EAEAF,EAAO1iD,SAAW,WAChB,OAAOpL,KAAK8J,IACd,EAEAgkD,EAAOX,OAAS,WACd,OAAOntD,KAAKoL,UACd,EAGA2+C,EAAaY,EAAmB,CAAC,CAC/BxjD,IAAK,KACLqH,IAAK,WACH,MAAO,mBACT,KAGKm8C,CACT,CA5D4C,IA8D5C,EAAAyC,EAAA,GAAczC,IAuCP,IAAIE,GAAiC,WAC1C,SAASA,EAAkB12C,GACzBnU,KAAK8J,KAAOqK,EAAOrK,KACnB9J,KAAKgkD,YAAc7vC,EAAO6vC,YAC1BhkD,KAAKiuD,SAAW95C,EAAO85C,SACvBjuD,KAAKu+B,WAAapqB,EAAOoqB,YAAc+mB,EAASnxC,EAAOoqB,YACvDv+B,KAAK4tD,QAAUz5C,EAAOy5C,QACtB5tD,KAAK6tD,kBAAoBZ,GAAgB94C,EAAO05C,mBAChD7tD,KAAKkuD,QAAUC,GAAevtD,UAAKuI,EAAWgL,GAC9CnU,KAAKouD,YAAcC,GAAiBztD,UAAKuI,EAAWgL,GAC7B,kBAAhBA,EAAOrK,OAAqB,EAAAi7C,EAAA,GAAU,EAAG,sBAC7B,MAAnB5wC,EAAO85C,UAA+C,oBAApB95C,EAAO85C,WAA2B,EAAAlJ,EAAA,GAAU,EAAG,GAAGnxC,OAAO5T,KAAK8J,KAAM,4CAAgD,YAAY8J,QAAO,EAAA+wC,EAAA,GAAQxwC,EAAO85C,UAAW,KACrM,CAEA,IAAIK,EAAUzD,EAAkB7kD,UA+ChC,OA7CAsoD,EAAQC,UAAY,WAKlB,MAJ4B,oBAAjBvuD,KAAKkuD,UACdluD,KAAKkuD,QAAUluD,KAAKkuD,WAGfluD,KAAKkuD,OACd,EAEAI,EAAQE,cAAgB,WAKtB,MAJgC,oBAArBxuD,KAAKouD,cACdpuD,KAAKouD,YAAcpuD,KAAKouD,eAGnBpuD,KAAKouD,WACd,EAEAE,EAAQP,SAAW,WACjB,MAAO,CACLjkD,KAAM9J,KAAK8J,KACXk6C,YAAahkD,KAAKgkD,YAClByK,WAAYzuD,KAAKwuD,gBACjBz2C,OAAQ22C,GAAqB1uD,KAAKuuD,aAClCN,SAAUjuD,KAAKiuD,SACf1vB,WAAYv+B,KAAKu+B,WACjBqvB,QAAS5tD,KAAK4tD,QACdC,kBAAmB7tD,KAAK6tD,mBAAqB,GAEjD,EAEAS,EAAQljD,SAAW,WACjB,OAAOpL,KAAK8J,IACd,EAEAwkD,EAAQnB,OAAS,WACf,OAAOntD,KAAKoL,UACd,EAGA2+C,EAAac,EAAmB,CAAC,CAC/B1jD,IAAK,KACLqH,IAAK,WACH,MAAO,mBACT,KAGKq8C,CACT,CA9D4C,GAkE5C,SAASwD,GAAiBl6C,GACxB,IAAIw6C,EAEAF,EAAmE,QAArDE,EAAgB5B,GAAa54C,EAAOs6C,mBAA2C,IAAlBE,EAA2BA,EAAgB,GAE1H,OADAz7C,MAAMC,QAAQs7C,KAAe,EAAA1J,EAAA,GAAU,EAAG,GAAGnxC,OAAOO,EAAOrK,KAAM,uEAC1D2kD,CACT,CAEA,SAASN,GAAeh6C,GACtB,IAAIgW,EAAW4iC,GAAa54C,EAAO4D,QAEnC,OADA62C,GAAWzkC,KAAa,EAAA46B,EAAA,GAAU,EAAG,GAAGnxC,OAAOO,EAAOrK,KAAM,mGACrDo7C,EAAS/6B,GAAU,SAAU0kC,EAAah4C,GAC/C,IAAIi4C,EAEJF,GAAWC,KAAgB,EAAA9J,EAAA,GAAU,EAAG,GAAGnxC,OAAOO,EAAOrK,KAAM,KAAK8J,OAAOiD,EAAW,uCACpF,iBAAkBg4C,KAAgB,EAAA9J,EAAA,GAAU,EAAG,GAAGnxC,OAAOO,EAAOrK,KAAM,KAAK8J,OAAOiD,EAAW,mEACxE,MAAvBg4C,EAAY5hC,SAAkD,oBAAxB4hC,EAAY5hC,UAA0B,EAAA83B,EAAA,GAAU,EAAG,GAAGnxC,OAAOO,EAAOrK,KAAM,KAAK8J,OAAOiD,EAAW,0CAA4C,sBAAsBjD,QAAO,EAAA+wC,EAAA,GAAQkK,EAAY5hC,SAAU,MAC9O,IAAI8hC,EAAwD,QAA1CD,EAAoBD,EAAY3lD,YAAwC,IAAtB4lD,EAA+BA,EAAoB,CAAC,EACxHF,GAAWG,KAAe,EAAAhK,EAAA,GAAU,EAAG,GAAGnxC,OAAOO,EAAOrK,KAAM,KAAK8J,OAAOiD,EAAW,yDACrF,IAAI3N,EAAO,EAAc6lD,GAAYxmD,KAAI,SAAUs9C,GACjD,IAAImJ,EAAUnJ,EAAK,GACfoJ,EAAYpJ,EAAK,GACrB,MAAO,CACL/7C,KAAMklD,EACNhL,YAAaiL,EAAUjL,YACvB19C,KAAM2oD,EAAU3oD,KAChBwyC,aAAcmW,EAAUnW,aACxBoW,kBAAmBD,EAAUC,kBAC7B3wB,WAAY0wB,EAAU1wB,YAAc+mB,EAAS2J,EAAU1wB,YACvDqvB,QAASqB,EAAUrB,QAEvB,IACA,MAAO,CACL9jD,KAAM+M,EACNmtC,YAAa6K,EAAY7K,YACzB19C,KAAMuoD,EAAYvoD,KAClB4C,KAAMA,EACN+jB,QAAS4hC,EAAY5hC,QACrB3kB,UAAWumD,EAAYvmD,UACvB6mD,aAA+C,MAAjCN,EAAYK,kBAC1BA,kBAAmBL,EAAYK,kBAC/B3wB,WAAYswB,EAAYtwB,YAAc+mB,EAASuJ,EAAYtwB,YAC3DqvB,QAASiB,EAAYjB,QAEzB,GACF,CAEA,SAASgB,GAAWt1C,GAClB,OAAO,EAAA81C,EAAA,GAAa91C,KAASpG,MAAMC,QAAQmG,EAC7C,CAEA,SAASo1C,GAAqB32C,GAC5B,OAAOmtC,EAASntC,GAAQ,SAAU7C,GAChC,MAAO,CACL8uC,YAAa9uC,EAAM8uC,YACnB19C,KAAM4O,EAAM5O,KACZ4C,KAAMmmD,GAAiBn6C,EAAMhM,MAC7B+jB,QAAS/X,EAAM+X,QACf3kB,UAAW4M,EAAM5M,UACjB4mD,kBAAmBh6C,EAAMg6C,kBACzB3wB,WAAYrpB,EAAMqpB,WAClBqvB,QAAS14C,EAAM04C,QAEnB,GACF,CAMO,SAASyB,GAAiBnmD,GAC/B,OAAOq8C,EAAUr8C,GAAM,SAAUyG,GAC/B,OAAOA,EAAI7F,IACb,IAAG,SAAU6F,GACX,MAAO,CACLq0C,YAAar0C,EAAIq0C,YACjB19C,KAAMqJ,EAAIrJ,KACVwyC,aAAcnpC,EAAImpC,aAClBoW,kBAAmBv/C,EAAIu/C,kBACvB3wB,WAAY5uB,EAAI4uB,WAChBqvB,QAASj+C,EAAIi+C,QAEjB,GACF,CACO,SAAS0B,GAAmB3/C,GACjC,OAAO66C,GAAc76C,EAAIrJ,YAA8B6C,IAArBwG,EAAImpC,YACxC,EAxFA,EAAAsU,EAAA,GAAcvC,IA4GP,IAAIE,GAAoC,WAC7C,SAASA,EAAqB52C,GAC5BnU,KAAK8J,KAAOqK,EAAOrK,KACnB9J,KAAKgkD,YAAc7vC,EAAO6vC,YAC1BhkD,KAAKuvD,YAAcp7C,EAAOo7C,YAC1BvvD,KAAKu+B,WAAapqB,EAAOoqB,YAAc+mB,EAASnxC,EAAOoqB,YACvDv+B,KAAK4tD,QAAUz5C,EAAOy5C,QACtB5tD,KAAK6tD,kBAAoBZ,GAAgB94C,EAAO05C,mBAChD7tD,KAAKkuD,QAAUC,GAAevtD,UAAKuI,EAAWgL,GAC9CnU,KAAKouD,YAAcC,GAAiBztD,UAAKuI,EAAWgL,GAC7B,kBAAhBA,EAAOrK,OAAqB,EAAAi7C,EAAA,GAAU,EAAG,sBAC1B,MAAtB5wC,EAAOo7C,aAAqD,oBAAvBp7C,EAAOo7C,cAA8B,EAAAxK,EAAA,GAAU,EAAG,GAAGnxC,OAAO5T,KAAK8J,KAAM,+CAAmD,YAAY8J,QAAO,EAAA+wC,EAAA,GAAQxwC,EAAOo7C,aAAc,KACjN,CAEA,IAAIC,EAAUzE,EAAqB/kD,UAiDnC,OA/CAwpD,EAAQjB,UAAY,WAKlB,MAJ4B,oBAAjBvuD,KAAKkuD,UACdluD,KAAKkuD,QAAUluD,KAAKkuD,WAGfluD,KAAKkuD,OACd,EAEAsB,EAAQhB,cAAgB,WAKtB,MAJgC,oBAArBxuD,KAAKouD,cACdpuD,KAAKouD,YAAcpuD,KAAKouD,eAGnBpuD,KAAKouD,WACd,EAEAoB,EAAQzB,SAAW,WACjB,IAAI0B,EAEJ,MAAO,CACL3lD,KAAM9J,KAAK8J,KACXk6C,YAAahkD,KAAKgkD,YAClByK,WAAYzuD,KAAKwuD,gBACjBz2C,OAAQ22C,GAAqB1uD,KAAKuuD,aAClCgB,YAAavvD,KAAKuvD,YAClBhxB,WAAYv+B,KAAKu+B,WACjBqvB,QAAS5tD,KAAK4tD,QACdC,kBAAyE,QAArD4B,EAAyBzvD,KAAK6tD,yBAA0D,IAA3B4B,EAAoCA,EAAyB,GAElJ,EAEAD,EAAQpkD,SAAW,WACjB,OAAOpL,KAAK8J,IACd,EAEA0lD,EAAQrC,OAAS,WACf,OAAOntD,KAAKoL,UACd,EAGA2+C,EAAagB,EAAsB,CAAC,CAClC5jD,IAAK,KACLqH,IAAK,WACH,MAAO,sBACT,KAGKu8C,CACT,CAhE+C,IAkE/C,EAAAqC,EAAA,GAAcrC,IAyBP,IAAIE,GAAgC,WACzC,SAASA,EAAiB92C,GACxBnU,KAAK8J,KAAOqK,EAAOrK,KACnB9J,KAAKgkD,YAAc7vC,EAAO6vC,YAC1BhkD,KAAKuvD,YAAcp7C,EAAOo7C,YAC1BvvD,KAAKu+B,WAAapqB,EAAOoqB,YAAc+mB,EAASnxC,EAAOoqB,YACvDv+B,KAAK4tD,QAAUz5C,EAAOy5C,QACtB5tD,KAAK6tD,kBAAoBZ,GAAgB94C,EAAO05C,mBAChD7tD,KAAK0vD,OAASC,GAAY/uD,UAAKuI,EAAWgL,GACnB,kBAAhBA,EAAOrK,OAAqB,EAAAi7C,EAAA,GAAU,EAAG,sBAC1B,MAAtB5wC,EAAOo7C,aAAqD,oBAAvBp7C,EAAOo7C,cAA8B,EAAAxK,EAAA,GAAU,EAAG,GAAGnxC,OAAO5T,KAAK8J,KAAM,+CAAmD,YAAY8J,QAAO,EAAA+wC,EAAA,GAAQxwC,EAAOo7C,aAAc,KACjN,CAEA,IAAIK,EAAU3E,EAAiBjlD,UAwC/B,OAtCA4pD,EAAQC,SAAW,WAKjB,MAJ2B,oBAAhB7vD,KAAK0vD,SACd1vD,KAAK0vD,OAAS1vD,KAAK0vD,UAGd1vD,KAAK0vD,MACd,EAEAE,EAAQ7B,SAAW,WACjB,IAAI+B,EAEJ,MAAO,CACLhmD,KAAM9J,KAAK8J,KACXk6C,YAAahkD,KAAKgkD,YAClB+L,MAAO/vD,KAAK6vD,WACZN,YAAavvD,KAAKuvD,YAClBhxB,WAAYv+B,KAAKu+B,WACjBqvB,QAAS5tD,KAAK4tD,QACdC,kBAAyE,QAArDiC,EAAyB9vD,KAAK6tD,yBAA0D,IAA3BiC,EAAoCA,EAAyB,GAElJ,EAEAF,EAAQxkD,SAAW,WACjB,OAAOpL,KAAK8J,IACd,EAEA8lD,EAAQzC,OAAS,WACf,OAAOntD,KAAKoL,UACd,EAGA2+C,EAAakB,EAAkB,CAAC,CAC9B9jD,IAAK,KACLqH,IAAK,WACH,MAAO,kBACT,KAGKy8C,CACT,CAtD2C,GA0D3C,SAAS0E,GAAYx7C,GACnB,IAAI47C,EAAQhD,GAAa54C,EAAO47C,OAEhC,OADA78C,MAAMC,QAAQ48C,KAAU,EAAAhL,EAAA,GAAU,EAAG,mFAAmFnxC,OAAOO,EAAOrK,KAAM,MACrIimD,CACT,EANA,EAAA3C,EAAA,GAAcnC,IA6BP,IAAIE,GAEI,WACb,SAASA,EAAgBh3C,GA8H3B,IAA0B67C,EAAUC,EA7HhCjwD,KAAK8J,KAAOqK,EAAOrK,KACnB9J,KAAKgkD,YAAc7vC,EAAO6vC,YAC1BhkD,KAAKu+B,WAAapqB,EAAOoqB,YAAc+mB,EAASnxC,EAAOoqB,YACvDv+B,KAAK4tD,QAAUz5C,EAAOy5C,QACtB5tD,KAAK6tD,kBAAoBZ,GAAgB94C,EAAO05C,mBAChD7tD,KAAKkwD,SAwHiBF,EAxHUhwD,KAAK8J,KAyHvC8kD,GADkCqB,EAxHW97C,EAAOiM,UAyH5B,EAAA2kC,EAAA,GAAU,EAAG,GAAGnxC,OAAOo8C,EAAU,wDAClD,EAAcC,GAAU1nD,KAAI,SAAU68C,GAC3C,IAAI+K,EAAY/K,EAAM,GAClBgL,EAAchL,EAAM,GAGxB,OAFAwJ,GAAWwB,KAAgB,EAAArL,EAAA,GAAU,EAAG,GAAGnxC,OAAOo8C,EAAU,KAAKp8C,OAAOu8C,EAAW,gDAAoD,2CAA2Cv8C,QAAO,EAAA+wC,EAAA,GAAQyL,GAAc,QAC7M,iBAAkBA,KAAgB,EAAArL,EAAA,GAAU,EAAG,GAAGnxC,OAAOo8C,EAAU,KAAKp8C,OAAOu8C,EAAW,mEACrF,CACLrmD,KAAMqmD,EACNnM,YAAaoM,EAAYpM,YACzB58C,WAA6B+B,IAAtBinD,EAAYhpD,MAAsBgpD,EAAYhpD,MAAQ+oD,EAC7DhB,aAA+C,MAAjCiB,EAAYlB,kBAC1BA,kBAAmBkB,EAAYlB,kBAC/B3wB,WAAY6xB,EAAY7xB,YAAc+mB,EAAS8K,EAAY7xB,YAC3DqvB,QAASwC,EAAYxC,QAEzB,KAvIE5tD,KAAKqwD,aAAe,IAAIpjD,IAAIjN,KAAKkwD,QAAQ3nD,KAAI,SAAU+nD,GACrD,MAAO,CAACA,EAAUlpD,MAAOkpD,EAC3B,KACAtwD,KAAKuwD,YAActL,EAAOjlD,KAAKkwD,SAAS,SAAU9oD,GAChD,OAAOA,EAAM0C,IACf,IACuB,kBAAhBqK,EAAOrK,OAAqB,EAAAi7C,EAAA,GAAU,EAAG,qBAClD,CAEA,IAAIyL,EAAUrF,EAAgBnlD,UAiG9B,OA/FAwqD,EAAQC,UAAY,WAClB,OAAOzwD,KAAKkwD,OACd,EAEAM,EAAQ9hC,SAAW,SAAkB5kB,GACnC,OAAO9J,KAAKuwD,YAAYzmD,EAC1B,EAEA0mD,EAAQ9C,UAAY,SAAmBgD,GACrC,IAAIJ,EAAYtwD,KAAKqwD,aAAa7hD,IAAIkiD,GAEtC,QAAkBvnD,IAAdmnD,EACF,MAAM,IAAI/O,EAAA,EAAa,SAAU3tC,OAAO5T,KAAK8J,KAAM,8BAA+B8J,QAAO,EAAA+wC,EAAA,GAAQ+L,KAGnG,OAAOJ,EAAUxmD,IACnB,EAEA0mD,EAAQhD,WAAa,SAAoBmD,GAGvC,GAA0B,kBAAfA,EAAyB,CAClC,IAAIC,GAAW,EAAAjM,EAAA,GAAQgM,GACvB,MAAM,IAAIpP,EAAA,EAAa,SAAU3tC,OAAO5T,KAAK8J,KAAM,yCAA0C8J,OAAOg9C,EAAU,KAAOC,GAAoB7wD,KAAM4wD,GACjJ,CAEA,IAAIN,EAAYtwD,KAAK0uB,SAASiiC,GAE9B,GAAiB,MAAbL,EACF,MAAM,IAAI/O,EAAA,EAAa,UAAW3tC,OAAO+8C,EAAY,yBAA2B/8C,OAAO5T,KAAK8J,KAAM,WAAc+mD,GAAoB7wD,KAAM2wD,IAG5I,OAAOL,EAAUlpD,KACnB,EAEAopD,EAAQ7C,aAAe,SAAsBzE,EAAW4H,GAItD,GAAI5H,EAAUn7C,OAAS,IAAK07C,KAAM,CAChC,IAAImH,GAAW,OAAM1H,GACrB,MAAM,IAAI3H,EAAA,EAAa,SAAU3tC,OAAO5T,KAAK8J,KAAM,uCAAwC8J,OAAOg9C,EAAU,KAAOC,GAAoB7wD,KAAM4wD,GAAW1H,EAC1J,CAEA,IAAIoH,EAAYtwD,KAAK0uB,SAASw6B,EAAU9hD,OAExC,GAAiB,MAAbkpD,EAAmB,CACrB,IAAIS,GAAY,OAAM7H,GAEtB,MAAM,IAAI3H,EAAA,EAAa,UAAW3tC,OAAOm9C,EAAW,yBAA2Bn9C,OAAO5T,KAAK8J,KAAM,WAAc+mD,GAAoB7wD,KAAM+wD,GAAY7H,EACvJ,CAEA,OAAOoH,EAAUlpD,KACnB,EAEAopD,EAAQzC,SAAW,WACjB,IAAIiD,EAEA5wC,EAASmlC,EAAUvlD,KAAKywD,aAAa,SAAUrpD,GACjD,OAAOA,EAAM0C,IACf,IAAG,SAAU1C,GACX,MAAO,CACL48C,YAAa58C,EAAM48C,YACnB58C,MAAOA,EAAMA,MACb8nD,kBAAmB9nD,EAAM8nD,kBACzB3wB,WAAYn3B,EAAMm3B,WAClBqvB,QAASxmD,EAAMwmD,QAEnB,IACA,MAAO,CACL9jD,KAAM9J,KAAK8J,KACXk6C,YAAahkD,KAAKgkD,YAClB5jC,OAAQA,EACRme,WAAYv+B,KAAKu+B,WACjBqvB,QAAS5tD,KAAK4tD,QACdC,kBAAyE,QAArDmD,EAAyBhxD,KAAK6tD,yBAA0D,IAA3BmD,EAAoCA,EAAyB,GAElJ,EAEAR,EAAQplD,SAAW,WACjB,OAAOpL,KAAK8J,IACd,EAEA0mD,EAAQrD,OAAS,WACf,OAAOntD,KAAKoL,UACd,EAGA2+C,EAAaoB,EAAiB,CAAC,CAC7BhkD,IAAK,KACLqH,IAAK,WACH,MAAO,iBACT,KAGK28C,CACT,CAnHe,GAuHf,SAAS0F,GAAoBI,EAAUC,GAKrC,OAAOxL,EAAW,iBADIuB,EAAeiK,EAHtBD,EAASR,YAAYloD,KAAI,SAAUnB,GAChD,OAAOA,EAAM0C,IACf,KAGF,EARA,EAAAsjD,EAAA,GAAcjC,IAiDP,IAAIE,GAAsC,WAC/C,SAASA,EAAuBl3C,GAC9BnU,KAAK8J,KAAOqK,EAAOrK,KACnB9J,KAAKgkD,YAAc7vC,EAAO6vC,YAC1BhkD,KAAKu+B,WAAapqB,EAAOoqB,YAAc+mB,EAASnxC,EAAOoqB,YACvDv+B,KAAK4tD,QAAUz5C,EAAOy5C,QACtB5tD,KAAK6tD,kBAAoBZ,GAAgB94C,EAAO05C,mBAChD7tD,KAAKkuD,QAAUiD,GAAoBvwD,UAAKuI,EAAWgL,GAC5B,kBAAhBA,EAAOrK,OAAqB,EAAAi7C,EAAA,GAAU,EAAG,qBAClD,CAEA,IAAIqM,EAAU/F,EAAuBrlD,UAiDrC,OA/CAorD,EAAQ7C,UAAY,WAKlB,MAJ4B,oBAAjBvuD,KAAKkuD,UACdluD,KAAKkuD,QAAUluD,KAAKkuD,WAGfluD,KAAKkuD,OACd,EAEAkD,EAAQrD,SAAW,WACjB,IAAIsD,EAEAt5C,EAASmtC,EAASllD,KAAKuuD,aAAa,SAAUr5C,GAChD,MAAO,CACL8uC,YAAa9uC,EAAM8uC,YACnB19C,KAAM4O,EAAM5O,KACZwyC,aAAc5jC,EAAM4jC,aACpBoW,kBAAmBh6C,EAAMg6C,kBACzB3wB,WAAYrpB,EAAMqpB,WAClBqvB,QAAS14C,EAAM04C,QAEnB,IACA,MAAO,CACL9jD,KAAM9J,KAAK8J,KACXk6C,YAAahkD,KAAKgkD,YAClBjsC,OAAQA,EACRwmB,WAAYv+B,KAAKu+B,WACjBqvB,QAAS5tD,KAAK4tD,QACdC,kBAAyE,QAArDwD,EAAyBrxD,KAAK6tD,yBAA0D,IAA3BwD,EAAoCA,EAAyB,GAElJ,EAEAD,EAAQhmD,SAAW,WACjB,OAAOpL,KAAK8J,IACd,EAEAsnD,EAAQjE,OAAS,WACf,OAAOntD,KAAKoL,UACd,EAGA2+C,EAAasB,EAAwB,CAAC,CACpClkD,IAAK,KACLqH,IAAK,WACH,MAAO,wBACT,KAGK68C,CACT,CA7DiD,GAiEjD,SAAS8F,GAAoBh9C,GAC3B,IAAIgW,EAAW4iC,GAAa54C,EAAO4D,QAEnC,OADA62C,GAAWzkC,KAAa,EAAA46B,EAAA,GAAU,EAAG,GAAGnxC,OAAOO,EAAOrK,KAAM,mGACrDo7C,EAAS/6B,GAAU,SAAU0kC,EAAah4C,GAE/C,QADE,YAAag4C,KAAgB,EAAA9J,EAAA,GAAU,EAAG,GAAGnxC,OAAOO,EAAOrK,KAAM,KAAK8J,OAAOiD,EAAW,4EACnF,CACL/M,KAAM+M,EACNmtC,YAAa6K,EAAY7K,YACzB19C,KAAMuoD,EAAYvoD,KAClBwyC,aAAc+V,EAAY/V,aAC1BoW,kBAAmBL,EAAYK,kBAC/B3wB,WAAYswB,EAAYtwB,YAAc+mB,EAASuJ,EAAYtwB,YAC3DqvB,QAASiB,EAAYjB,QAEzB,GACF,CAEO,SAAS0D,GAAqBp8C,GACnC,OAAOs1C,GAAct1C,EAAM5O,YAAgC6C,IAAvB+L,EAAM4jC,YAC5C,CC7kCO,SAASyY,GAAYC,EAAOC,GAEjC,OAAID,IAAUC,IAKVjH,GAAcgH,IAAUhH,GAAciH,OAKtClH,GAAWiH,KAAUjH,GAAWkH,MAJ3BF,GAAYC,EAAM3F,OAAQ4F,EAAM5F,OAU3C,CAMO,SAAS6F,GAAgBC,EAAQC,EAAcC,GAEpD,OAAID,IAAiBC,IAKjBrH,GAAcqH,KACZrH,GAAcoH,IACTF,GAAgBC,EAAQC,EAAa/F,OAAQgG,EAAUhG,QAM9DrB,GAAcoH,GAETF,GAAgBC,EAAQC,EAAa/F,OAAQgG,GAIlDtH,GAAWsH,KACTtH,GAAWqH,IACNF,GAAgBC,EAAQC,EAAa/F,OAAQgG,EAAUhG,SAM9DtB,GAAWqH,KAORvF,GAAewF,KAAe1H,EAAgByH,IAAiB1H,EAAa0H,KAAkBD,EAAOG,UAAUD,EAAWD,IACnI,CAWO,SAASG,GAAeJ,EAAQH,EAAOC,GAE5C,OAAID,IAAUC,IAIVpF,GAAemF,GACbnF,GAAeoF,GAGVE,EAAOK,iBAAiBR,GAAO7+B,MAAK,SAAUrsB,GACnD,OAAOqrD,EAAOG,UAAUL,EAAOnrD,EACjC,IAIKqrD,EAAOG,UAAUN,EAAOC,KAG7BpF,GAAeoF,IAEVE,EAAOG,UAAUL,EAAOD,GAKnC,EDs9BA,EAAApE,EAAA,GAAc/B,IEzjCd,IA4CA,GA5CgBn4C,MAAMrB,MAAQ,SAAUyH,EAAKyV,EAAOkjC,GAClD,GAAW,MAAP34C,EACF,MAAM,IAAImnC,UAAU,oEAItB,IAAIyR,EAAiB54C,EAAI,MAEzB,GAA8B,oBAAnB44C,EAA+B,CAKxC,IAJA,IAEIC,EAFA9hB,EAAW6hB,EAAe1sD,KAAK8T,GAC/BrN,EAAS,GAGJS,EAAI,IAAKylD,EAAO9hB,EAASlkC,QAAQyjC,OAAQljC,EAKhD,GAJAT,EAAO/L,KAAK6uB,EAAMvpB,KAAKysD,EAASE,EAAK/qD,MAAOsF,IAIxCA,EAAI,QACN,MAAM,IAAI+zC,UAAU,4BAIxB,OAAOx0C,CACT,CAGA,IAAInI,EAASwV,EAAIxV,OAEjB,GAAsB,kBAAXA,GAAuBA,GAAU,GAAKA,EAAS,IAAM,EAAG,CAGjE,IAFA,IAAIsuD,EAAU,GAEL1iD,EAAK,EAAGA,EAAK5L,IAAU4L,EAC1BrE,OAAOrF,UAAU8G,eAAetH,KAAK8T,EAAK5J,IAC5C0iD,EAAQlyD,KAAK6uB,EAAMvpB,KAAKysD,EAAS34C,EAAI5J,GAAKA,IAI9C,OAAO0iD,CACT,CAEA,MAAO,EACT,E,YCxCA,GAJuB9Y,OAAO+Y,UAAY,SAAUjrD,GAClD,MAAwB,kBAAVA,GAAsBirD,SAASjrD,EAC/C,ECJA,SAASk4C,GAAQhmC,GAAmV,OAAtOgmC,GAArD,oBAAXtd,QAAoD,kBAApBA,OAAOqO,SAAmC,SAAiB/2B,GAAO,cAAcA,CAAK,EAAsB,SAAiBA,GAAO,OAAOA,GAAyB,oBAAX0oB,QAAyB1oB,EAAI7Y,cAAgBuhC,QAAU1oB,IAAQ0oB,OAAOh8B,UAAY,gBAAkBsT,CAAK,EAAYgmC,GAAQhmC,EAAM,CAkB1W,SAASg5C,GAAcC,GACpC,IAAIxjC,EAAQniB,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,GAAmBA,UAAU,GAAK,SAAUoI,GACxF,OAAOA,CACT,EAEA,GAAkB,MAAdu9C,GAA8C,WAAxBjT,GAAQiT,GAChC,OAAO,KAGT,GAAIr/C,MAAMC,QAAQo/C,GAChB,OAAOA,EAAWhqD,IAAIwmB,GAIxB,IAAImjC,EAAiBK,EAAW,MAEhC,GAA8B,oBAAnBL,EAA+B,CAMxC,IAJA,IAEIC,EAFA9hB,EAAW6hB,EAAe1sD,KAAK+sD,GAC/BtmD,EAAS,GAGJS,EAAI,IAAKylD,EAAO9hB,EAASlkC,QAAQyjC,OAAQljC,EAChDT,EAAO/L,KAAK6uB,EAAMojC,EAAK/qD,MAAOsF,IAGhC,OAAOT,CACT,CAGA,IAAInI,EAASyuD,EAAWzuD,OAExB,GAAsB,kBAAXA,GAAuBA,GAAU,GAAKA,EAAS,IAAM,EAAG,CAGjE,IAFA,IAAIsuD,EAAU,GAEL1iD,EAAK,EAAGA,EAAK5L,IAAU4L,EAAI,CAClC,IAAKrE,OAAOrF,UAAU8G,eAAetH,KAAK+sD,EAAY7iD,GACpD,OAAO,KAGT0iD,EAAQlyD,KAAK6uB,EAAMwjC,EAAWnuC,OAAO1U,IAAMA,GAC7C,CAEA,OAAO0iD,CACT,CAEA,OAAO,IACT,CC/DA,IAIA,GAJgB9Y,OAAOkZ,WAAa,SAAUprD,GAC5C,MAAwB,kBAAVA,GAAsBirD,SAASjrD,IAAUhF,KAAKmlD,MAAMngD,KAAWA,CAC/E,ECSIqrD,GAAU,WACVC,IAAW,WAsCR,IAAIC,GAAa,IAAIhI,GAAkB,CAC5C7gD,KAAM,MACNk6C,YAAa,sIACb0J,UAvCF,SAAsBgD,GACpB,IAAIkC,EAAeC,GAAgBnC,GAEnC,GAA4B,mBAAjBkC,EACT,OAAOA,EAAe,EAAI,EAG5B,IAAIE,EAAMF,EAMV,GAJ4B,kBAAjBA,GAA8C,KAAjBA,IACtCE,EAAMxZ,OAAOsZ,KAGV,GAAUE,GACb,MAAM,IAAIvR,EAAA,EAAa,2CAA2C3tC,QAAO,EAAA+wC,EAAA,GAAQiO,KAGnF,GAAIE,EAAML,IAAWK,EAAMJ,GACzB,MAAM,IAAInR,EAAA,EAAa,0DAA2D,EAAAoD,EAAA,GAAQiO,IAG5F,OAAOE,CACT,EAkBEtF,WAhBF,SAAmBmD,GACjB,IAAK,GAAUA,GACb,MAAM,IAAIpP,EAAA,EAAa,2CAA2C3tC,QAAO,EAAA+wC,EAAA,GAAQgM,KAGnF,GAAIA,EAAa8B,IAAW9B,EAAa+B,GACvC,MAAM,IAAInR,EAAA,EAAa,yDAAyD3tC,OAAO+8C,IAGzF,OAAOA,CACT,EAOEhD,aAAc,SAAsBzE,GAClC,GAAIA,EAAUn7C,OAAS,IAAKq7C,IAC1B,MAAM,IAAI7H,EAAA,EAAa,2CAA2C3tC,QAAO,OAAMs1C,IAAaA,GAG9F,IAAI4J,EAAMzJ,SAASH,EAAU9hD,MAAO,IAEpC,GAAI0rD,EAAML,IAAWK,EAAMJ,GACzB,MAAM,IAAInR,EAAA,EAAa,yDAAyD3tC,OAAOs1C,EAAU9hD,OAAQ8hD,GAG3G,OAAO4J,CACT,IA+BK,IAAIC,GAAe,IAAIpI,GAAkB,CAC9C7gD,KAAM,QACNk6C,YAAa,8JACb0J,UA/BF,SAAwBgD,GACtB,IAAIkC,EAAeC,GAAgBnC,GAEnC,GAA4B,mBAAjBkC,EACT,OAAOA,EAAe,EAAI,EAG5B,IAAIE,EAAMF,EAMV,GAJ4B,kBAAjBA,GAA8C,KAAjBA,IACtCE,EAAMxZ,OAAOsZ,KAGV,GAASE,GACZ,MAAM,IAAIvR,EAAA,EAAa,6CAA6C3tC,QAAO,EAAA+wC,EAAA,GAAQiO,KAGrF,OAAOE,CACT,EAcEtF,WAZF,SAAqBmD,GACnB,IAAK,GAASA,GACZ,MAAM,IAAIpP,EAAA,EAAa,6CAA6C3tC,QAAO,EAAA+wC,EAAA,GAAQgM,KAGrF,OAAOA,CACT,EAOEhD,aAAc,SAAsBzE,GAClC,GAAIA,EAAUn7C,OAAS,IAAKu7C,OAASJ,EAAUn7C,OAAS,IAAKq7C,IAC3D,MAAM,IAAI7H,EAAA,EAAa,6CAA6C3tC,QAAO,OAAMs1C,IAAaA,GAGhG,OAAOK,WAAWL,EAAU9hD,MAC9B,IAKF,SAASyrD,GAAgBnC,GACvB,IAAI,EAAAtB,EAAA,GAAasB,GAAc,CAC7B,GAAmC,oBAAxBA,EAAYsC,QAAwB,CAC7C,IAAIC,EAAgBvC,EAAYsC,UAEhC,KAAK,EAAA5D,EAAA,GAAa6D,GAChB,OAAOA,CAEX,CAEA,GAAkC,oBAAvBvC,EAAYvD,OAErB,OAAOuD,EAAYvD,QAEvB,CAEA,OAAOuD,CACT,CA6BO,IAAIwC,GAAgB,IAAIvI,GAAkB,CAC/C7gD,KAAM,SACNk6C,YAAa,wLACb0J,UA9BF,SAAyBgD,GACvB,IAAIkC,EAAeC,GAAgBnC,GAGnC,GAA4B,kBAAjBkC,EACT,OAAOA,EAGT,GAA4B,mBAAjBA,EACT,OAAOA,EAAe,OAAS,QAGjC,GAAI,GAASA,GACX,OAAOA,EAAaxnD,WAGtB,MAAM,IAAIm2C,EAAA,EAAa,kCAAkC3tC,QAAO,EAAA+wC,EAAA,GAAQ+L,IAC1E,EAcElD,WAZF,SAAsBmD,GACpB,GAA0B,kBAAfA,EACT,MAAM,IAAIpP,EAAA,EAAa,+CAA+C3tC,QAAO,EAAA+wC,EAAA,GAAQgM,KAGvF,OAAOA,CACT,EAOEhD,aAAc,SAAsBzE,GAClC,GAAIA,EAAUn7C,OAAS,IAAKy7C,OAC1B,MAAM,IAAIjI,EAAA,EAAa,+CAA+C3tC,QAAO,OAAMs1C,IAAaA,GAGlG,OAAOA,EAAU9hD,KACnB,IAyBK,IAAI+rD,GAAiB,IAAIxI,GAAkB,CAChD7gD,KAAM,UACNk6C,YAAa,0DACb0J,UAzBF,SAA0BgD,GACxB,IAAIkC,EAAeC,GAAgBnC,GAEnC,GAA4B,mBAAjBkC,EACT,OAAOA,EAGT,GAAI,GAASA,GACX,OAAwB,IAAjBA,EAGT,MAAM,IAAIrR,EAAA,EAAa,iDAAiD3tC,QAAO,EAAA+wC,EAAA,GAAQiO,IACzF,EAcEpF,WAZF,SAAuBmD,GACrB,GAA0B,mBAAfA,EACT,MAAM,IAAIpP,EAAA,EAAa,iDAAiD3tC,QAAO,EAAA+wC,EAAA,GAAQgM,KAGzF,OAAOA,CACT,EAOEhD,aAAc,SAAsBzE,GAClC,GAAIA,EAAUn7C,OAAS,IAAK27C,QAC1B,MAAM,IAAInI,EAAA,EAAa,iDAAiD3tC,QAAO,OAAMs1C,IAAaA,GAGpG,OAAOA,EAAU9hD,KACnB,IA6BK,IAAIgsD,GAAY,IAAIzI,GAAkB,CAC3C7gD,KAAM,KACNk6C,YAAa,+UACb0J,UA7BF,SAAqBgD,GACnB,IAAIkC,EAAeC,GAAgBnC,GAEnC,GAA4B,kBAAjBkC,EACT,OAAOA,EAGT,GAAI,GAAUA,GACZ,OAAOxuC,OAAOwuC,GAGhB,MAAM,IAAIrR,EAAA,EAAa,8BAA8B3tC,QAAO,EAAA+wC,EAAA,GAAQ+L,IACtE,EAkBElD,WAhBF,SAAkBmD,GAChB,GAA0B,kBAAfA,EACT,OAAOA,EAGT,GAAI,GAAUA,GACZ,OAAOA,EAAWvlD,WAGpB,MAAM,IAAIm2C,EAAA,EAAa,8BAA8B3tC,QAAO,EAAA+wC,EAAA,GAAQgM,IACtE,EAOEhD,aAAc,SAAsBzE,GAClC,GAAIA,EAAUn7C,OAAS,IAAKy7C,QAAUN,EAAUn7C,OAAS,IAAKq7C,IAC5D,MAAM,IAAI7H,EAAA,EAAa,4DAA6D,OAAM2H,GAAYA,GAGxG,OAAOA,EAAU9hD,KACnB,IAESisD,GAAuBhoD,OAAOgS,OAAO,CAAC61C,GAAeP,GAAYI,GAAcI,GAAgBC,KACnG,SAASE,GAAsBhtD,GACpC,OAAO+sD,GAAqB1gC,MAAK,SAAUkzB,GACzC,IAAI/7C,EAAO+7C,EAAK/7C,KAChB,OAAOxD,EAAKwD,OAASA,CACvB,GACF,CClOO,SAASypD,GAAansD,EAAOd,GAClC,GAAIkkD,GAAclkD,GAAO,CACvB,IAAIktD,EAAWD,GAAansD,EAAOd,EAAKulD,QAExC,OAAkB,OAAb2H,QAAkC,IAAbA,OAAsB,EAASA,EAASzlD,QAAU,IAAKo7C,KACxE,KAGFqK,CACT,CAGA,GAAc,OAAVpsD,EACF,MAAO,CACL2G,KAAM,IAAKo7C,MAKf,QAAchgD,IAAV/B,EACF,OAAO,KAKT,GAAImjD,GAAWjkD,GAAO,CACpB,IAAImtD,EAAWntD,EAAKulD,OAChB6H,EAAQpB,GAAclrD,GAE1B,GAAa,MAATssD,EAAe,CAGjB,IAFA,IAAIC,EAAc,GAET/Q,EAAM,EAAGA,EAAM8Q,EAAM5vD,OAAQ8+C,IAAO,CAC3C,IACIgR,EAAWL,GADJG,EAAM9Q,GACiB6Q,GAElB,MAAZG,GACFD,EAAYzzD,KAAK0zD,EAErB,CAEA,MAAO,CACL7lD,KAAM,IAAK47C,KACXvpC,OAAQuzC,EAEZ,CAEA,OAAOJ,GAAansD,EAAOqsD,EAC7B,CAIA,GAAInJ,GAAkBhkD,GAAO,CAC3B,KAAK,EAAA8oD,EAAA,GAAahoD,GAChB,OAAO,KAKT,IAFA,IAAIysD,EAAa,GAERpQ,EAAM,EAAGqQ,EAAiB,EAAaxtD,EAAKioD,aAAc9K,EAAMqQ,EAAehwD,OAAQ2/C,IAAO,CACrG,IAAIvuC,EAAQ4+C,EAAerQ,GACvBlrC,EAAag7C,GAAansD,EAAM8N,EAAMpL,MAAOoL,EAAM5O,MAEnDiS,GACFs7C,EAAW3zD,KAAK,CACd6N,KAAM,IAAKgmD,aACXjqD,KAAM,CACJiE,KAAM,IAAKutC,KACXl0C,MAAO8N,EAAMpL,MAEf1C,MAAOmR,GAGb,CAEA,MAAO,CACLxK,KAAM,IAAK67C,OACX7xC,OAAQ87C,EAEZ,CAGA,GAAI5H,GAAW3lD,GAAO,CAGpB,IAAI+tC,EAAa/tC,EAAKonD,UAAUtmD,GAEhC,GAAkB,MAAditC,EACF,OAAO,KAIT,GAA0B,mBAAfA,EACT,MAAO,CACLtmC,KAAM,IAAK27C,QACXtiD,MAAOitC,GAKX,GAA0B,kBAAfA,GAA2B,GAASA,GAAa,CAC1D,IAAI2f,EAAY5vC,OAAOiwB,GACvB,OAAO4f,GAAoB3qD,KAAK0qD,GAAa,CAC3CjmD,KAAM,IAAKq7C,IACXhiD,MAAO4sD,GACL,CACFjmD,KAAM,IAAKu7C,MACXliD,MAAO4sD,EAEX,CAEA,GAA0B,kBAAf3f,EAET,OAAIgW,EAAW/jD,GACN,CACLyH,KAAM,IAAK07C,KACXriD,MAAOitC,GAKP/tC,IAAS8sD,IAAaa,GAAoB3qD,KAAK+qC,GAC1C,CACLtmC,KAAM,IAAKq7C,IACXhiD,MAAOitC,GAIJ,CACLtmC,KAAM,IAAKy7C,OACXpiD,MAAOitC,GAIX,MAAM,IAAIoM,UAAU,gCAAgC7sC,QAAO,EAAA+wC,EAAA,GAAQtQ,GAAa,KAClF,EAGS,EAAAyV,EAAA,GAAU,EAAG,2BAA4B,EAAAnF,EAAA,GAAQr+C,GAC5D,CAOA,IAAI2tD,GAAsB,wBCzKfC,GAAW,IAAIrJ,GAAkB,CAC1C/gD,KAAM,WACNk6C,YAAa,4MACbjsC,OAAQ,WACN,MAAO,CACLisC,YAAa,CACX19C,KAAM4sD,GACNjmC,QAAS,SAAiB0kC,GACxB,OAAOA,EAAO3N,WAChB,GAEF+L,MAAO,CACL/L,YAAa,gDACb19C,KAAM,IAAImlD,GAAe,IAAIF,GAAY,IAAIE,GAAe0I,MAC5DlnC,QAAS,SAAiB0kC,GACxB,OAAO,EAAaA,EAAOyC,aAC7B,GAEF/vC,UAAW,CACT2/B,YAAa,oDACb19C,KAAM,IAAImlD,GAAe0I,IACzBlnC,QAAS,SAAiB0kC,GACxB,OAAOA,EAAO0C,cAChB,GAEF/vC,aAAc,CACZ0/B,YAAa,yFACb19C,KAAM6tD,GACNlnC,QAAS,SAAiB0kC,GACxB,OAAOA,EAAO2C,iBAChB,GAEF/vC,iBAAkB,CAChBy/B,YAAa,gGACb19C,KAAM6tD,GACNlnC,QAAS,SAAiB0kC,GACxB,OAAOA,EAAO4C,qBAChB,GAEFzyC,WAAY,CACVkiC,YAAa,qDACb19C,KAAM,IAAImlD,GAAe,IAAIF,GAAY,IAAIE,GAAe+I,MAC5DvnC,QAAS,SAAiB0kC,GACxB,OAAOA,EAAO8C,eAChB,GAGN,IAESD,GAAc,IAAI3J,GAAkB,CAC7C/gD,KAAM,cACNk6C,YAAa,0XACbjsC,OAAQ,WACN,MAAO,CACLjO,KAAM,CACJxD,KAAM,IAAImlD,GAAeyH,IACzBjmC,QAAS,SAAiBiH,GACxB,OAAOA,EAAUpqB,IACnB,GAEFk6C,YAAa,CACX19C,KAAM4sD,GACNjmC,QAAS,SAAiBiH,GACxB,OAAOA,EAAU8vB,WACnB,GAEF0Q,aAAc,CACZpuD,KAAM,IAAImlD,GAAe0H,IACzBlmC,QAAS,SAAiBiH,GACxB,OAAOA,EAAUwgC,YACnB,GAEF3R,UAAW,CACTz8C,KAAM,IAAImlD,GAAe,IAAIF,GAAY,IAAIE,GAAekJ,MAC5D1nC,QAAS,SAAiBiH,GACxB,OAAOA,EAAU6uB,SACnB,GAEF75C,KAAM,CACJ5C,KAAM,IAAImlD,GAAe,IAAIF,GAAY,IAAIE,GAAemJ,MAC5D1rD,KAAM,CACJ2rD,kBAAmB,CACjBvuD,KAAM6sD,GACNra,cAAc,IAGlB7rB,QAAS,SAAiB/X,EAAO2wC,GAE/B,OADwBA,EAAKgP,kBACF3/C,EAAMhM,KAAOgM,EAAMhM,KAAKjB,QAAO,SAAU0H,GAClE,OAAgC,MAAzBA,EAAIu/C,iBACb,GACF,GAGN,IAESyF,GAAsB,IAAIxJ,GAAgB,CACnDrhD,KAAM,sBACNk6C,YAAa,oIACb5jC,OAAQ,CACN00C,MAAO,CACL1tD,MAAO,KAAkB0tD,MACzB9Q,YAAa,2CAEf+Q,SAAU,CACR3tD,MAAO,KAAkB2tD,SACzB/Q,YAAa,8CAEfgR,aAAc,CACZ5tD,MAAO,KAAkB4tD,aACzBhR,YAAa,kDAEf3I,MAAO,CACLj0C,MAAO,KAAkBi0C,MACzB2I,YAAa,iCAEf1H,oBAAqB,CACnBl1C,MAAO,KAAkBk1C,oBACzB0H,YAAa,+CAEflkC,gBAAiB,CACf1Y,MAAO,KAAkB0Y,gBACzBkkC,YAAa,2CAEfiR,gBAAiB,CACf7tD,MAAO,KAAkB6tD,gBACzBjR,YAAa,4CAEfkR,oBAAqB,CACnB9tD,MAAO,KAAkB8tD,oBACzBlR,YAAa,+CAEfmR,OAAQ,CACN/tD,MAAO,KAAkB+tD,OACzBnR,YAAa,6CAEfoR,OAAQ,CACNhuD,MAAO,KAAkBguD,OACzBpR,YAAa,6CAEf4F,OAAQ,CACNxiD,MAAO,KAAkBwiD,OACzB5F,YAAa,mDAEfqR,iBAAkB,CAChBjuD,MAAO,KAAkBiuD,iBACzBrR,YAAa,4CAEfsR,oBAAqB,CACnBluD,MAAO,KAAkBkuD,oBACzBtR,YAAa,gDAEfuR,UAAW,CACTnuD,MAAO,KAAkBmuD,UACzBvR,YAAa,iDAEfwR,MAAO,CACLpuD,MAAO,KAAkBouD,MACzBxR,YAAa,4CAEfyF,KAAM,CACJriD,MAAO,KAAkBqiD,KACzBzF,YAAa,4CAEfyR,WAAY,CACVruD,MAAO,KAAkBquD,WACzBzR,YAAa,kDAEf0R,aAAc,CACZtuD,MAAO,KAAkBsuD,aACzB1R,YAAa,yDAEf2R,uBAAwB,CACtBvuD,MAAO,KAAkBuuD,uBACzB3R,YAAa,6DAIRmQ,GAAS,IAAItJ,GAAkB,CACxC/gD,KAAM,SACNk6C,YAAa,siBACbjsC,OAAQ,WACN,MAAO,CACLhK,KAAM,CACJzH,KAAM,IAAImlD,GAAemK,IACzB3oC,QAAS,SAAiB3mB,GACxB,OAAI2jD,EAAa3jD,GACRuvD,GAAST,OAGdlL,EAAa5jD,GACRuvD,GAASjM,OAGdO,EAAgB7jD,GACXuvD,GAASN,UAGdnL,EAAY9jD,GACPuvD,GAASL,MAGdnL,EAAW/jD,GACNuvD,GAASpM,KAGda,GAAkBhkD,GACbuvD,GAASH,aAGdnL,GAAWjkD,GACNuvD,GAASlM,KAIda,GAAclkD,GACTuvD,GAASC,cAIT,EAAAhM,EAAA,GAAU,EAAG,qBAAsBl2C,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,MACpE,GAEFwD,KAAM,CACJxD,KAAM4sD,GACNjmC,QAAS,SAAiB3mB,GACxB,YAAqB6C,IAAd7C,EAAKwD,KAAqBxD,EAAKwD,UAAOX,CAC/C,GAEF66C,YAAa,CACX19C,KAAM4sD,GACNjmC,QAAS,SAAiB3mB,GACxB,YAA4B6C,IAArB7C,EAAK09C,YAA4B19C,EAAK09C,iBAAc76C,CAC7D,GAEFskD,eAAgB,CACdnnD,KAAM4sD,GACNjmC,QAAS,SAAiB3T,GACxB,YAA8BnQ,IAAvBmQ,EAAIm0C,eAA+Bn0C,EAAIm0C,oBAAiBtkD,CACjE,GAEF4O,OAAQ,CACNzR,KAAM,IAAIilD,GAAY,IAAIE,GAAesK,KACzC7sD,KAAM,CACJ2rD,kBAAmB,CACjBvuD,KAAM6sD,GACNra,cAAc,IAGlB7rB,QAAS,SAAiB3mB,EAAM8+C,GAC9B,IAAIyP,EAAoBzP,EAAMyP,kBAE9B,GAAI3K,EAAa5jD,IAAS6jD,EAAgB7jD,GAAO,CAC/C,IAAIyR,EAAS,EAAazR,EAAKioD,aAC/B,OAAOsG,EAAoB98C,EAASA,EAAO9P,QAAO,SAAUiN,GAC1D,OAAkC,MAA3BA,EAAMg6C,iBACf,GACF,CACF,GAEFT,WAAY,CACVnoD,KAAM,IAAIilD,GAAY,IAAIE,GAAe0I,KACzClnC,QAAS,SAAiB3mB,GACxB,GAAI4jD,EAAa5jD,IAAS6jD,EAAgB7jD,GACxC,OAAOA,EAAKkoD,eAEhB,GAEF9qC,cAAe,CACbpd,KAAM,IAAIilD,GAAY,IAAIE,GAAe0I,KACzClnC,QAAS,SAAiB3mB,EAAMyc,EAAOizC,EAAUnT,GAC/C,IAAI8O,EAAS9O,EAAM8O,OAEnB,GAAItF,GAAe/lD,GACjB,OAAOqrD,EAAOK,iBAAiB1rD,EAEnC,GAEF2vD,WAAY,CACV3vD,KAAM,IAAIilD,GAAY,IAAIE,GAAeyK,KACzChtD,KAAM,CACJ2rD,kBAAmB,CACjBvuD,KAAM6sD,GACNra,cAAc,IAGlB7rB,QAAS,SAAiB3mB,EAAM6vD,GAC9B,IAAItB,EAAoBsB,EAAMtB,kBAE9B,GAAIxK,EAAW/jD,GAAO,CACpB,IAAI8Z,EAAS9Z,EAAKmqD,YAClB,OAAOoE,EAAoBz0C,EAASA,EAAOnY,QAAO,SAAUiN,GAC1D,OAAkC,MAA3BA,EAAMg6C,iBACf,GACF,CACF,GAEFkH,YAAa,CACX9vD,KAAM,IAAIilD,GAAY,IAAIE,GAAemJ,KACzC1rD,KAAM,CACJ2rD,kBAAmB,CACjBvuD,KAAM6sD,GACNra,cAAc,IAGlB7rB,QAAS,SAAiB3mB,EAAM+vD,GAC9B,IAAIxB,EAAoBwB,EAAMxB,kBAE9B,GAAIvK,GAAkBhkD,GAAO,CAC3B,IAAI8Z,EAAS,EAAa9Z,EAAKioD,aAC/B,OAAOsG,EAAoBz0C,EAASA,EAAOnY,QAAO,SAAUiN,GAC1D,OAAkC,MAA3BA,EAAMg6C,iBACf,GACF,CACF,GAEFrD,OAAQ,CACNvlD,KAAM6tD,GACNlnC,QAAS,SAAiB3mB,GACxB,YAAuB6C,IAAhB7C,EAAKulD,OAAuBvlD,EAAKulD,YAAS1iD,CACnD,GAGN,IAES4sD,GAAU,IAAIlL,GAAkB,CACzC/gD,KAAM,UACNk6C,YAAa,8IACbjsC,OAAQ,WACN,MAAO,CACLjO,KAAM,CACJxD,KAAM,IAAImlD,GAAeyH,IACzBjmC,QAAS,SAAiB/X,GACxB,OAAOA,EAAMpL,IACf,GAEFk6C,YAAa,CACX19C,KAAM4sD,GACNjmC,QAAS,SAAiB/X,GACxB,OAAOA,EAAM8uC,WACf,GAEF96C,KAAM,CACJ5C,KAAM,IAAImlD,GAAe,IAAIF,GAAY,IAAIE,GAAemJ,MAC5D1rD,KAAM,CACJ2rD,kBAAmB,CACjBvuD,KAAM6sD,GACNra,cAAc,IAGlB7rB,QAAS,SAAiB/X,EAAOohD,GAE/B,OADwBA,EAAMzB,kBACH3/C,EAAMhM,KAAOgM,EAAMhM,KAAKjB,QAAO,SAAU0H,GAClE,OAAgC,MAAzBA,EAAIu/C,iBACb,GACF,GAEF5oD,KAAM,CACJA,KAAM,IAAImlD,GAAe0I,IACzBlnC,QAAS,SAAiB/X,GACxB,OAAOA,EAAM5O,IACf,GAEF6oD,aAAc,CACZ7oD,KAAM,IAAImlD,GAAe0H,IACzBlmC,QAAS,SAAiB/X,GACxB,OAAkC,MAA3BA,EAAMg6C,iBACf,GAEFA,kBAAmB,CACjB5oD,KAAM4sD,GACNjmC,QAAS,SAAiB/X,GACxB,OAAOA,EAAMg6C,iBACf,GAGN,IAES0F,GAAe,IAAI/J,GAAkB,CAC9C/gD,KAAM,eACNk6C,YAAa,8KACbjsC,OAAQ,WACN,MAAO,CACLjO,KAAM,CACJxD,KAAM,IAAImlD,GAAeyH,IACzBjmC,QAAS,SAAiB0jC,GACxB,OAAOA,EAAW7mD,IACpB,GAEFk6C,YAAa,CACX19C,KAAM4sD,GACNjmC,QAAS,SAAiB0jC,GACxB,OAAOA,EAAW3M,WACpB,GAEF19C,KAAM,CACJA,KAAM,IAAImlD,GAAe0I,IACzBlnC,QAAS,SAAiB0jC,GACxB,OAAOA,EAAWrqD,IACpB,GAEFwyC,aAAc,CACZxyC,KAAM4sD,GACNlP,YAAa,kFACb/2B,QAAS,SAAiB0jC,GACxB,IAAIrqD,EAAOqqD,EAAWrqD,KAElBiwD,EAAWhD,GADI5C,EAAW7X,aACYxyC,GAC1C,OAAOiwD,GAAW,OAAMA,GAAY,IACtC,GAEFpH,aAAc,CACZ7oD,KAAM,IAAImlD,GAAe0H,IACzBlmC,QAAS,SAAiB/X,GACxB,OAAkC,MAA3BA,EAAMg6C,iBACf,GAEFA,kBAAmB,CACjB5oD,KAAM4sD,GACNjmC,QAAS,SAAiB3T,GACxB,OAAOA,EAAI41C,iBACb,GAGN,IAESgH,GAAc,IAAIrL,GAAkB,CAC7C/gD,KAAM,cACNk6C,YAAa,yLACbjsC,OAAQ,WACN,MAAO,CACLjO,KAAM,CACJxD,KAAM,IAAImlD,GAAeyH,IACzBjmC,QAAS,SAAiBqjC,GACxB,OAAOA,EAAUxmD,IACnB,GAEFk6C,YAAa,CACX19C,KAAM4sD,GACNjmC,QAAS,SAAiBqjC,GACxB,OAAOA,EAAUtM,WACnB,GAEFmL,aAAc,CACZ7oD,KAAM,IAAImlD,GAAe0H,IACzBlmC,QAAS,SAAiBqjC,GACxB,OAAsC,MAA/BA,EAAUpB,iBACnB,GAEFA,kBAAmB,CACjB5oD,KAAM4sD,GACNjmC,QAAS,SAAiBqjC,GACxB,OAAOA,EAAUpB,iBACnB,GAGN,IAES2G,GAAWxqD,OAAOgS,OAAO,CAClC+3C,OAAQ,SACRxL,OAAQ,SACR2L,UAAW,YACXC,MAAO,QACP/L,KAAM,OACNiM,aAAc,eACd/L,KAAM,OACNmM,SAAU,aAEDF,GAAa,IAAIzK,GAAgB,CAC1CrhD,KAAM,aACNk6C,YAAa,4DACb5jC,OAAQ,CACNg1C,OAAQ,CACNhuD,MAAOyuD,GAAST,OAChBpR,YAAa,oCAEf4F,OAAQ,CACNxiD,MAAOyuD,GAASjM,OAChB5F,YAAa,iFAEfuR,UAAW,CACTnuD,MAAOyuD,GAASN,UAChBvR,YAAa,sGAEfwR,MAAO,CACLpuD,MAAOyuD,GAASL,MAChBxR,YAAa,qEAEfyF,KAAM,CACJriD,MAAOyuD,GAASpM,KAChBzF,YAAa,kEAEf0R,aAAc,CACZtuD,MAAOyuD,GAASH,aAChB1R,YAAa,2EAEf2F,KAAM,CACJviD,MAAOyuD,GAASlM,KAChB3F,YAAa,6DAEf8R,SAAU,CACR1uD,MAAOyuD,GAASC,SAChB9R,YAAa,oEASRwS,GAAqB,CAC9B1sD,KAAM,WACNxD,KAAM,IAAImlD,GAAeyI,IACzBlQ,YAAa,iDACb96C,KAAM,GACN+jB,QAAS,SAAiBwpC,EAAS1zC,EAAOizC,EAAUU,GAElD,OADaA,EAAM/E,MAErB,EACAxC,cAAc,EACdD,uBAAmB/lD,EACnBo1B,gBAAYp1B,EACZykD,aAASzkD,GAEAwtD,GAAmB,CAC5B7sD,KAAM,SACNxD,KAAM6tD,GACNnQ,YAAa,iDACb96C,KAAM,CAAC,CACLY,KAAM,OACNk6C,iBAAa76C,EACb7C,KAAM,IAAImlD,GAAeyH,IACzBpa,kBAAc3vC,EACd+lD,uBAAmB/lD,EACnBo1B,gBAAYp1B,EACZykD,aAASzkD,IAEX8jB,QAAS,SAAiBwpC,EAASG,EAAOZ,EAAUa,GAClD,IAAI/sD,EAAO8sD,EAAM9sD,KAEjB,OADa+sD,EAAMlF,OACLmF,QAAQhtD,EACxB,EACAqlD,cAAc,EACdD,uBAAmB/lD,EACnBo1B,gBAAYp1B,EACZykD,aAASzkD,GAEA4tD,GAAuB,CAChCjtD,KAAM,aACNxD,KAAM,IAAImlD,GAAeyH,IACzBlP,YAAa,kDACb96C,KAAM,GACN+jB,QAAS,SAAiBwpC,EAAS1zC,EAAOizC,EAAUgB,GAElD,OADiBA,EAAOhuC,WACNlf,IACpB,EACAqlD,cAAc,EACdD,uBAAmB/lD,EACnBo1B,gBAAYp1B,EACZykD,aAASzkD,GAEA8tD,GAAqB5rD,OAAOgS,OAAO,CAAC62C,GAAUM,GAAaG,GAAqBR,GAAQ4B,GAASnB,GAAcsB,GAAaN,KAChI,SAASsB,GAAoB5wD,GAClC,OAAO2wD,GAAmBtkC,MAAK,SAAUwkC,GACvC,IAAIrtD,EAAOqtD,EAAOrtD,KAClB,OAAOxD,EAAKwD,OAASA,CACvB,GACF,CChkBA,SAAS,GAAkBisC,EAAQiK,GAAS,IAAK,IAAItzC,EAAI,EAAGA,EAAIszC,EAAMl8C,OAAQ4I,IAAK,CAAE,IAAIuzC,EAAaD,EAAMtzC,GAAIuzC,EAAWxd,WAAawd,EAAWxd,aAAc,EAAOwd,EAAWvd,cAAe,EAAU,UAAWud,IAAYA,EAAWH,UAAW,GAAMz0C,OAAOm3B,eAAeuT,EAAQkK,EAAW94C,IAAK84C,EAAa,CAAE,CAoBrT,SAASmX,GAAYljC,GAC1B,OAAO,EAAAw2B,EAAA,GAAWx2B,EAAWmjC,GAC/B,CACO,SAASC,GAAgBpjC,GAC9B,IAAKkjC,GAAYljC,GACf,MAAM,IAAIllB,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQzwB,GAAY,gCAGzD,OAAOA,CACT,CAMO,IAAImjC,GAAgC,WACzC,SAASA,EAAiBljD,GACxB,IAAIojD,EAAsBC,EAE1Bx3D,KAAK8J,KAAOqK,EAAOrK,KACnB9J,KAAKgkD,YAAc7vC,EAAO6vC,YAC1BhkD,KAAK+iD,UAAY5uC,EAAO4uC,UACxB/iD,KAAK00D,aAAgE,QAAhD6C,EAAuBpjD,EAAOugD,oBAAmD,IAAzB6C,GAAkCA,EAC/Gv3D,KAAKu+B,WAAapqB,EAAOoqB,YAAc+mB,EAASnxC,EAAOoqB,YACvDv+B,KAAK4tD,QAAUz5C,EAAOy5C,QACtBz5C,EAAOrK,OAAQ,EAAAi7C,EAAA,GAAU,EAAG,4BAC5B7xC,MAAMC,QAAQgB,EAAO4uC,aAAc,EAAAgC,EAAA,GAAU,EAAG,IAAInxC,OAAOO,EAAOrK,KAAM,iCACxE,IAAIZ,EAAwC,QAAhCsuD,EAAerjD,EAAOjL,YAAmC,IAAjBsuD,EAA0BA,EAAe,CAAC,GAC9F,EAAApI,EAAA,GAAalmD,KAAUgK,MAAMC,QAAQjK,KAAS,EAAA67C,EAAA,GAAU,EAAG,IAAInxC,OAAOO,EAAOrK,KAAM,yDACnF9J,KAAKkJ,KAAO,EAAcA,GAAMX,KAAI,SAAUs9C,GAC5C,IAAImJ,EAAUnJ,EAAK,GACfoJ,EAAYpJ,EAAK,GACrB,MAAO,CACL/7C,KAAMklD,EACNhL,YAAaiL,EAAUjL,YACvB19C,KAAM2oD,EAAU3oD,KAChBwyC,aAAcmW,EAAUnW,aACxBoW,kBAAmBD,EAAUC,kBAC7B3wB,WAAY0wB,EAAU1wB,YAAc+mB,EAAS2J,EAAU1wB,YACvDqvB,QAASqB,EAAUrB,QAEvB,GACF,CAEA,IA9DoB9L,EAAaC,EAAYC,EA8DzC8L,EAASuJ,EAAiBrxD,UA8B9B,OA5BA8nD,EAAOC,SAAW,WAChB,MAAO,CACLjkD,KAAM9J,KAAK8J,KACXk6C,YAAahkD,KAAKgkD,YAClBjB,UAAW/iD,KAAK+iD,UAChB75C,KAAMmmD,GAAiBrvD,KAAKkJ,MAC5BwrD,aAAc10D,KAAK00D,aACnBn2B,WAAYv+B,KAAKu+B,WACjBqvB,QAAS5tD,KAAK4tD,QAElB,EAEAE,EAAO1iD,SAAW,WAChB,MAAO,IAAMpL,KAAK8J,IACpB,EAEAgkD,EAAOX,OAAS,WACd,OAAOntD,KAAKoL,UACd,EAlFoB02C,EAqFPuV,GArFoBtV,EAqFF,CAAC,CAC9B56C,IAAK,KACLqH,IAAK,WACH,MAAO,kBACT,MAzF0E,GAAkBszC,EAAY97C,UAAW+7C,GAAiBC,GAAa,GAAkBF,EAAaE,GA4F3KqV,CACT,CA5D2C,IA8D3C,EAAAjK,EAAA,GAAciK,IAKP,IAAII,GAA0B,IAAIJ,GAAiB,CACxDvtD,KAAM,UACNk6C,YAAa,8FACbjB,UAAW,CAAC,KAAkB1H,MAAO,KAAkBv7B,gBAAiB,KAAkBm1C,iBAC1F/rD,KAAM,CACJwhB,GAAI,CACFpkB,KAAM,IAAImlD,GAAe0H,IACzBnP,YAAa,0BAQR0T,GAAuB,IAAIL,GAAiB,CACrDvtD,KAAM,OACNk6C,YAAa,sFACbjB,UAAW,CAAC,KAAkB1H,MAAO,KAAkBv7B,gBAAiB,KAAkBm1C,iBAC1F/rD,KAAM,CACJwhB,GAAI,CACFpkB,KAAM,IAAImlD,GAAe0H,IACzBnP,YAAa,yBAQR2T,GAA6B,sBAK7BC,GAA6B,IAAIP,GAAiB,CAC3DvtD,KAAM,aACNk6C,YAAa,+DACbjB,UAAW,CAAC,KAAkBsS,iBAAkB,KAAkBC,oBAAqB,KAAkBK,uBAAwB,KAAkBF,YACnJvsD,KAAM,CACJ9C,OAAQ,CACNE,KAAM4sD,GACNlP,YAAa,sNACblL,aAAc6e,OAQTE,GAA8B,IAAIR,GAAiB,CAC5DvtD,KAAM,cACNk6C,YAAa,6DACbjB,UAAW,CAAC,KAAkBqS,QAC9BlsD,KAAM,CACJpE,IAAK,CACHwB,KAAM,IAAImlD,GAAeyH,IACzBlP,YAAa,2DAQR8T,GAAsBzsD,OAAOgS,OAAO,CAACo6C,GAAyBC,GAAsBE,GAA4BC,KACpH,SAASE,GAAqB7jC,GACnC,OAAO4jC,GAAoBnlC,MAAK,SAAUyyB,GAExC,OADWA,EAAMt7C,OACDoqB,EAAUpqB,IAC5B,GACF,CC9KA,SAAS,GAAkBisC,EAAQiK,GAAS,IAAK,IAAItzC,EAAI,EAAGA,EAAIszC,EAAMl8C,OAAQ4I,IAAK,CAAE,IAAIuzC,EAAaD,EAAMtzC,GAAIuzC,EAAWxd,WAAawd,EAAWxd,aAAc,EAAOwd,EAAWvd,cAAe,EAAU,UAAWud,IAAYA,EAAWH,UAAW,GAAMz0C,OAAOm3B,eAAeuT,EAAQkK,EAAW94C,IAAK84C,EAAa,CAAE,CAqBrT,SAAS+X,GAASrG,GACvB,OAAO,EAAAjH,EAAA,GAAWiH,EAAQsG,GAC5B,CACO,SAASC,GAAavG,GAC3B,IAAKqG,GAASrG,GACZ,MAAM,IAAI3iD,MAAM,YAAY4E,QAAO,EAAA+wC,EAAA,GAAQgN,GAAS,6BAGtD,OAAOA,CACT,CAiEO,IAAIsG,GAA6B,WAEtC,SAASA,EAAc9jD,GACrB,IAAIgkD,EAIJn4D,KAAKo4D,oBAA4C,IAAvBjkD,EAAOkkD,YAAuB,QAAKlvD,GAE7D,EAAAimD,EAAA,GAAaj7C,KAAW,EAAA4wC,EAAA,GAAU,EAAG,uCACpC5wC,EAAO47C,OAAS78C,MAAMC,QAAQgB,EAAO47C,SAAU,EAAAhL,EAAA,GAAU,EAAG,8CAAgDnxC,QAAO,EAAA+wC,EAAA,GAAQxwC,EAAO47C,OAAQ,OAC1I57C,EAAO2N,YAAc5O,MAAMC,QAAQgB,EAAO2N,cAAe,EAAAijC,EAAA,GAAU,EAAG,mDAAqD,GAAGnxC,QAAO,EAAA+wC,EAAA,GAAQxwC,EAAO2N,YAAa,MAClK9hB,KAAKgkD,YAAc7vC,EAAO6vC,YAC1BhkD,KAAKu+B,WAAapqB,EAAOoqB,YAAc+mB,EAASnxC,EAAOoqB,YACvDv+B,KAAK4tD,QAAUz5C,EAAOy5C,QACtB5tD,KAAK6tD,kBAAoB15C,EAAO05C,kBAChC7tD,KAAKs4D,WAAankD,EAAO3I,MACzBxL,KAAKu4D,cAAgBpkD,EAAOwlB,SAC5B35B,KAAKw4D,kBAAoBrkD,EAAOrM,aAEhC9H,KAAKy4D,YAA2D,QAA5CN,EAAqBhkD,EAAO2N,kBAA+C,IAAvBq2C,EAAgCA,EAAqBL,GAG7H,IAAIY,EAAqB,IAAI/qD,IAAIwG,EAAO47C,OAExC,GAAoB,MAAhB57C,EAAO47C,MACT,IAAK,IAAInN,EAAM,EAAG+V,EAAiBxkD,EAAO47C,MAAOnN,EAAM+V,EAAe70D,OAAQ8+C,IAAO,CACnF,IAAIt8C,EAAOqyD,EAAe/V,GAG1B8V,EAAmB3/C,OAAOzS,GAC1BsyD,GAAuBtyD,EAAMoyD,EAC/B,CAGqB,MAAnB14D,KAAKs4D,YACPM,GAAuB54D,KAAKs4D,WAAYI,GAGhB,MAAtB14D,KAAKu4D,eACPK,GAAuB54D,KAAKu4D,cAAeG,GAGf,MAA1B14D,KAAKw4D,mBACPI,GAAuB54D,KAAKw4D,kBAAmBE,GAGjD,IAAK,IAAIjV,EAAM,EAAGoV,EAAqB74D,KAAKy4D,YAAahV,EAAMoV,EAAmB/0D,OAAQ2/C,IAAO,CAC/F,IAAIvvB,EAAY2kC,EAAmBpV,GAGnC,GAAI2T,GAAYljC,GACd,IAAK,IAAIyvB,EAAM,EAAGmV,EAAmB5kC,EAAUhrB,KAAMy6C,EAAMmV,EAAiBh1D,OAAQ6/C,IAAO,CAEzFiV,GADUE,EAAiBnV,GACAr9C,KAAMoyD,EACnC,CAEJ,CAEAE,GAAuB1E,GAAUwE,GAEjC14D,KAAK+4D,SAAW1tD,OAAO3C,OAAO,MAC9B1I,KAAKg5D,YAAc3tD,OAAO3C,OAAO,MAEjC1I,KAAKi5D,oBAAsB5tD,OAAO3C,OAAO,MAEzC,IAAK,IAAIwwD,EAAM,EAAGC,EAAc,GAAUT,GAAqBQ,EAAMC,EAAYr1D,OAAQo1D,IAAO,CAC9F,IAAIE,EAAYD,EAAYD,GAE5B,GAAiB,MAAbE,EAAJ,CAIA,IAAIpJ,EAAWoJ,EAAUtvD,KAGzB,GAFAkmD,IAAY,EAAAjL,EAAA,GAAU,EAAG,6EAEO57C,IAA5BnJ,KAAK+4D,SAAS/I,GAChB,MAAM,IAAIhhD,MAAM,+EAAgF4E,OAAOo8C,EAAU,OAKnH,GAFAhwD,KAAK+4D,SAAS/I,GAAYoJ,EAEtBjP,EAAgBiP,GAElB,IAAK,IAAIC,EAAO,EAAGC,EAAyBF,EAAU5K,gBAAiB6K,EAAOC,EAAuBx1D,OAAQu1D,IAAQ,CACnH,IAAIE,EAAQD,EAAuBD,GAEnC,GAAIlP,EAAgBoP,GAAQ,CAC1B,IAAIC,EAAkBx5D,KAAKi5D,oBAAoBM,EAAMzvD,WAE7BX,IAApBqwD,IACFA,EAAkBx5D,KAAKi5D,oBAAoBM,EAAMzvD,MAAQ,CACvD2vD,QAAS,GACThL,WAAY,KAIhB+K,EAAgB/K,WAAWvuD,KAAKk5D,EAClC,CACF,MACK,GAAIlP,EAAakP,GAEtB,IAAK,IAAIM,EAAO,EAAGC,EAAyBP,EAAU5K,gBAAiBkL,EAAOC,EAAuB71D,OAAQ41D,IAAQ,CACnH,IAAIE,EAASD,EAAuBD,GAEpC,GAAIvP,EAAgByP,GAAS,CAC3B,IAAIC,EAAmB75D,KAAKi5D,oBAAoBW,EAAO9vD,WAE9BX,IAArB0wD,IACFA,EAAmB75D,KAAKi5D,oBAAoBW,EAAO9vD,MAAQ,CACzD2vD,QAAS,GACThL,WAAY,KAIhBoL,EAAiBJ,QAAQv5D,KAAKk5D,EAChC,CACF,CA9CF,CAgDF,CACF,CAEA,IAvNoBtX,EAAaC,EAAYC,EAuNzC8L,EAASmK,EAAcjyD,UAyG3B,OAvGA8nD,EAAOuG,aAAe,WACpB,OAAOr0D,KAAKs4D,UACd,EAEAxK,EAAOwG,gBAAkB,WACvB,OAAOt0D,KAAKu4D,aACd,EAEAzK,EAAOyG,oBAAsB,WAC3B,OAAOv0D,KAAKw4D,iBACd,EAEA1K,EAAOsG,WAAa,WAClB,OAAOp0D,KAAK+4D,QACd,EAEAjL,EAAOgJ,QAAU,SAAiBhtD,GAChC,OAAO9J,KAAKo0D,aAAatqD,EAC3B,EAEAgkD,EAAOkE,iBAAmB,SAA0B8H,GAClD,OAAO1P,EAAY0P,GAAgBA,EAAajK,WAAa7vD,KAAK+5D,mBAAmBD,GAAcL,OACrG,EAEA3L,EAAOiM,mBAAqB,SAA4BC,GACtD,IAAIR,EAAkBx5D,KAAKi5D,oBAAoBe,EAAclwD,MAC7D,OAA2B,OAApB0vD,QAAgD,IAApBA,EAA6BA,EAAkB,CAChFC,QAAS,GACThL,WAAY,GAEhB,EAGAX,EAAOmM,eAAiB,SAAwBH,EAAcI,GAC5D,OAAOl6D,KAAK8xD,UAAUgI,EAAcI,EACtC,EAEApM,EAAOgE,UAAY,SAAmBgI,EAAclI,GAClD,IAAIrpD,EAAMvI,KAAKg5D,YAAYc,EAAahwD,MAExC,QAAYX,IAARZ,EAAmB,CAGrB,GAFAA,EAAM8C,OAAO3C,OAAO,MAEhB0hD,EAAY0P,GACd,IAAK,IAAIK,EAAO,EAAGC,EAAyBN,EAAajK,WAAYsK,EAAOC,EAAuBt2D,OAAQq2D,IAAQ,CAEjH5xD,EADW6xD,EAAuBD,GACzBrwD,OAAQ,CACnB,KACK,CAGL,IAFA,IAAI0vD,EAAkBx5D,KAAK+5D,mBAAmBD,GAErCO,EAAO,EAAGC,EAAyBd,EAAgBC,QAASY,EAAOC,EAAuBx2D,OAAQu2D,IAAQ,CAEjH9xD,EADY+xD,EAAuBD,GACzBvwD,OAAQ,CACpB,CAEA,IAAK,IAAIywD,EAAO,EAAGC,EAAyBhB,EAAgB/K,WAAY8L,EAAOC,EAAuB12D,OAAQy2D,IAAQ,CAEpHhyD,EADaiyD,EAAuBD,GACzBzwD,OAAQ,CACrB,CACF,CAEA9J,KAAKg5D,YAAYc,EAAahwD,MAAQvB,CACxC,CAEA,YAAkCY,IAA3BZ,EAAIqpD,EAAa9nD,KAC1B,EAEAgkD,EAAO2G,cAAgB,WACrB,OAAOz0D,KAAKy4D,WACd,EAEA3K,EAAO2M,aAAe,SAAsB3wD,GAC1C,OAAO,EAAK9J,KAAKy0D,iBAAiB,SAAUvgC,GAC1C,OAAOA,EAAUpqB,OAASA,CAC5B,GACF,EAEAgkD,EAAOC,SAAW,WAChB,IAAIC,EAEJ,MAAO,CACLhK,YAAahkD,KAAKgkD,YAClBx4C,MAAOxL,KAAKq0D,eACZ16B,SAAU35B,KAAKs0D,kBACfxsD,aAAc9H,KAAKu0D,sBACnBxE,MAAO,EAAa/vD,KAAKo0D,cACzBtyC,WAAY9hB,KAAKy0D,gBAAgB5wD,QACjC06B,WAAYv+B,KAAKu+B,WACjBqvB,QAAS5tD,KAAK4tD,QACdC,kBAAwE,QAApDG,EAAwBhuD,KAAK6tD,yBAAyD,IAA1BG,EAAmCA,EAAwB,GAC3IqK,iBAAyClvD,IAA5BnJ,KAAKo4D,mBAEtB,EAtToBtW,EAyTPmW,GAzToBlW,EAyTL,CAAC,CAC3B56C,IAAK,KACLqH,IAAK,WACH,MAAO,eACT,MA7T0E,GAAkBszC,EAAY97C,UAAW+7C,GAAiBC,GAAa,GAAkBF,EAAaE,GAgU3KiW,CACT,CApOwC,GAsOxC,SAASW,GAAuBtyD,EAAMo0D,GACpC,IAAItB,EAAYvM,GAAavmD,GAE7B,IAAKo0D,EAAQjsD,IAAI2qD,GAGf,GAFAsB,EAAQ7xD,IAAIuwD,GAERhP,EAAYgP,GACd,IAAK,IAAIuB,EAAO,EAAGC,EAAuBxB,EAAUvJ,WAAY8K,EAAOC,EAAqB92D,OAAQ62D,IAAQ,CAE1G/B,GADiBgC,EAAqBD,GACHD,EACrC,MACK,GAAIxQ,EAAakP,IAAcjP,EAAgBiP,GAAY,CAChE,IAAK,IAAIyB,EAAO,EAAGC,EAAyB1B,EAAU5K,gBAAiBqM,EAAOC,EAAuBh3D,OAAQ+2D,IAAQ,CAEnHjC,GADoBkC,EAAuBD,GACLH,EACxC,CAEA,IAAK,IAAIK,EAAO,EAAGjH,EAAiB,EAAasF,EAAU7K,aAAcwM,EAAOjH,EAAehwD,OAAQi3D,IAAQ,CAC7G,IAAI7lD,EAAQ4+C,EAAeiH,GAC3BnC,GAAuB1jD,EAAM5O,KAAMo0D,GAEnC,IAAK,IAAIM,EAAO,EAAGC,EAAe/lD,EAAMhM,KAAM8xD,EAAOC,EAAan3D,OAAQk3D,IAAQ,CAEhFpC,GADUqC,EAAaD,GACI10D,KAAMo0D,EACnC,CACF,CACF,MAAO,GAAIpQ,GAAkB8O,GAC3B,IAAK,IAAI8B,EAAO,EAAGC,EAAiB,EAAa/B,EAAU7K,aAAc2M,EAAOC,EAAer3D,OAAQo3D,IAAQ,CAE7GtC,GADauC,EAAeD,GACE50D,KAAMo0D,EACtC,CAIJ,OAAOA,CACT,CCrVO,SAASU,GAAezJ,GAI7B,GAFAuG,GAAavG,GAETA,EAAOyG,mBACT,OAAOzG,EAAOyG,mBAIhB,IAAI5kD,EAAU,IAAI6nD,GAAwB1J,IAkD5C,SAA2Bn+C,GACzB,IAAIm+C,EAASn+C,EAAQm+C,OACjBttC,EAAYstC,EAAO0C,eAEvB,GAAKhwC,GAEE,IAAK6lC,EAAa7lC,GAAY,CACnC,IAAIi3C,EAEJ9nD,EAAQo1B,YAAY,qDAAqDh1B,QAAO,EAAA+wC,EAAA,GAAQtgC,GAAY,KAA0E,QAAnEi3C,EAAwBC,GAAqB5J,EAAQ,gBAAgD,IAA1B2J,EAAmCA,EAAwBj3C,EAAUupC,QAC7P,OALEp6C,EAAQo1B,YAAY,oCAAqC+oB,EAAO/D,SAOlE,IAGM4N,EAHFl3C,EAAeqtC,EAAO2C,kBAEtBhwC,IAAiB4lC,EAAa5lC,IAGhC9Q,EAAQo1B,YAAY,oEAAsE,GAAGh1B,QAAO,EAAA+wC,EAAA,GAAQrgC,GAAe,KAA8E,QAAvEk3C,EAAyBD,GAAqB5J,EAAQ,mBAAoD,IAA3B6J,EAAoCA,EAAyBl3C,EAAaspC,SAG7R,IAGM6N,EAHFl3C,EAAmBotC,EAAO4C,sBAE1BhwC,IAAqB2lC,EAAa3lC,IAGpC/Q,EAAQo1B,YAAY,wEAA0E,GAAGh1B,QAAO,EAAA+wC,EAAA,GAAQpgC,GAAmB,KAAkF,QAA3Ek3C,EAAyBF,GAAqB5J,EAAQ,uBAAwD,IAA3B8J,EAAoCA,EAAyBl3C,EAAiBqpC,QAE/S,CA5EE8N,CAAkBloD,GA8FpB,SAA4BA,GAC1B,IAAK,IAAIiwC,EAAM,EAAGkY,EAAyBnoD,EAAQm+C,OAAO8C,gBAAiBhR,EAAMkY,EAAuB73D,OAAQ2/C,IAAO,CACrH,IAAIvvB,EAAYynC,EAAuBlY,GAGvC,GAAK2T,GAAYljC,GAAjB,CAMA0nC,GAAapoD,EAAS0gB,GAGtB,IAAK,IAAIyvB,EAAM,EAAGmV,EAAmB5kC,EAAUhrB,KAAMy6C,EAAMmV,EAAiBh1D,OAAQ6/C,IAAO,CACzF,IASMkY,EATFlsD,EAAMmpD,EAAiBnV,GAQ3B,GANAiY,GAAapoD,EAAS7D,GAEjBg8C,GAAYh8C,EAAIrJ,OACnBkN,EAAQo1B,YAAY,gBAAgBh1B,OAAOsgB,EAAUpqB,KAAM,KAAK8J,OAAOjE,EAAI7F,KAAM,0BAA4B,YAAY8J,QAAO,EAAA+wC,EAAA,GAAQh1C,EAAIrJ,MAAO,KAAMqJ,EAAIi+C,SAG3J0B,GAAmB3/C,IAAiC,MAAzBA,EAAIu/C,kBAGjC17C,EAAQo1B,YAAY,sBAAsBh1B,OAAOsgB,EAAUpqB,KAAM,KAAK8J,OAAOjE,EAAI7F,KAAM,4BAA6B,CAACgyD,GAA2BnsD,EAAIi+C,SACnH,QAAhCiO,EAAelsD,EAAIi+C,eAAsC,IAAjBiO,OAA0B,EAASA,EAAav1D,MAE7F,CArBA,MAFEkN,EAAQo1B,YAAY,+BAA+Bh1B,QAAO,EAAA+wC,EAAA,GAAQzwB,GAAY,KAAoB,OAAdA,QAAoC,IAAdA,OAAuB,EAASA,EAAU05B,QAwBxJ,CACF,CA5HEmO,CAAmBvoD,GAuIrB,SAAuBA,GAIrB,IAHA,IAAIwoD,EA4QN,SAAgDxoD,GAI9C,IAAIyoD,EAAe5wD,OAAO3C,OAAO,MAE7BwzD,EAAY,GAEZC,EAA2B9wD,OAAO3C,OAAO,MAC7C,OAAO0zD,EAIP,SAASA,EAAqBC,GAC5B,IAAIJ,EAAaI,EAASvyD,MAA1B,CAIAmyD,EAAaI,EAASvyD,OAAQ,EAC9BqyD,EAAyBE,EAASvyD,MAAQoyD,EAAUp4D,OAGpD,IAFA,IAAIiU,EAAS,EAAaskD,EAAS9N,aAE1B+N,EAAO,EAAGA,EAAOvkD,EAAOjU,OAAQw4D,IAAQ,CAC/C,IAAIpnD,EAAQ6C,EAAOukD,GAEnB,GAAI9R,GAAct1C,EAAM5O,OAASgkD,GAAkBp1C,EAAM5O,KAAKulD,QAAS,CACrE,IAAI0Q,EAAYrnD,EAAM5O,KAAKulD,OACvB2Q,EAAaL,EAAyBI,EAAUzyD,MAGpD,GAFAoyD,EAAUh8D,KAAKgV,QAEI/L,IAAfqzD,EACFJ,EAAqBG,OAChB,CACL,IAAIE,EAAYP,EAAUr4D,MAAM24D,GAC5BE,EAAUD,EAAUl0D,KAAI,SAAUo0D,GACpC,OAAOA,EAAS7yD,IAClB,IAAGsX,KAAK,KACR5N,EAAQo1B,YAAY,kCAAmCh1B,OAAO2oD,EAAUzyD,KAAM,0DAA4D8J,OAAO8oD,EAAS,MAAQD,EAAUl0D,KAAI,SAAUo0D,GACxL,OAAOA,EAAS/O,OAClB,IACF,CAEAsO,EAAUhxC,KACZ,CACF,CAEAixC,EAAyBE,EAASvyD,WAAQX,CA9B1C,CA+BF,CACF,CA5TwCyzD,CAAuCppD,GACzEqpD,EAAUrpD,EAAQm+C,OAAOyC,aAEpB8E,EAAM,EAAGpF,EAAiB,EAAa+I,GAAU3D,EAAMpF,EAAehwD,OAAQo1D,IAAO,CAC5F,IAAI5yD,EAAOwtD,EAAeoF,GAGrBvM,GAAYrmD,IAMZ4wD,GAAoB5wD,IACvBs1D,GAAapoD,EAASlN,GAGpB4jD,EAAa5jD,IAKN6jD,EAAgB7jD,IAHzBw2D,GAAetpD,EAASlN,GAExBy2D,GAAmBvpD,EAASlN,IAMnB8jD,EAAY9jD,GAErB02D,GAAqBxpD,EAASlN,GACrB+jD,EAAW/jD,GAEpB22D,GAAmBzpD,EAASlN,GACnBgkD,GAAkBhkD,KAE3B42D,GAAoB1pD,EAASlN,GAE7B01D,EAAgC11D,KA7BhCkN,EAAQo1B,YAAY,wCAAwCh1B,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,KAAMA,EAAKsnD,QA+BjG,CACF,CA/KEuP,CAAc3pD,GAGd,IAAItH,EAASsH,EAAQ4pD,YAErB,OADAzL,EAAOyG,mBAAqBlsD,EACrBA,CACT,CAMO,SAASmxD,GAAkB1L,GAChC,IAAIzlD,EAASkvD,GAAezJ,GAE5B,GAAsB,IAAlBzlD,EAAOpI,OACT,MAAM,IAAIkL,MAAM9C,EAAO3D,KAAI,SAAUrD,GACnC,OAAOA,EAAMe,OACf,IAAGmb,KAAK,QAEZ,CAEA,IAAIi6C,GAAuC,WACzC,SAASA,EAAwB1J,GAC/B3xD,KAAKs9D,QAAU,GACft9D,KAAK2xD,OAASA,CAChB,CAEA,IAAI7D,EAASuN,EAAwBr1D,UAgBrC,OAdA8nD,EAAOllB,YAAc,SAAqB3iC,EAASk8C,GACjD,IAAIuC,EAASxxC,MAAMC,QAAQgvC,GAASA,EAAMl6C,OAAO0gB,SAAWw5B,EAE5DniD,KAAKu9D,SAAS,IAAIhc,EAAA,EAAat7C,EAASy+C,GAC1C,EAEAoJ,EAAOyP,SAAW,SAAkBr4D,GAClClF,KAAKs9D,QAAQp9D,KAAKgF,EACpB,EAEA4oD,EAAOsP,UAAY,WACjB,OAAOp9D,KAAKs9D,OACd,EAEOjC,CACT,CAvB2C,GAsD3C,SAASE,GAAqB5J,EAAQ7mD,GAKpC,IAJA,IAAI0yD,EAAiBC,GAAe9L,GAAQ,SAAUxiD,GACpD,OAAOA,EAAKuuD,cACd,IAES9a,EAAM,EAAGA,EAAM4a,EAAe15D,OAAQ8+C,IAAO,CACpD,IAAIzzC,EAAOquD,EAAe5a,GAE1B,GAAIzzC,EAAKrE,YAAcA,EACrB,OAAOqE,EAAK7I,IAEhB,CAGF,CAmCA,SAASs1D,GAAapoD,EAASrE,GAE7B,IAAIjK,EAAQ4/C,EAAiB31C,EAAKrF,MAE9B5E,GACFsO,EAAQ+pD,SAAS/Y,EAAat/C,EAAOiK,EAAKy+C,SAE9C,CA6CA,SAASkP,GAAetpD,EAASlN,GAC/B,IAAIyR,EAAS,EAAazR,EAAKioD,aAET,IAAlBx2C,EAAOjU,QACT0P,EAAQo1B,YAAY,QAAQh1B,OAAOtN,EAAKwD,KAAM,oCAAqC6zD,GAAYr3D,IAGjG,IAAK,IAAI+yD,EAAO,EAAGA,EAAOthD,EAAOjU,OAAQu1D,IAAQ,CAC/C,IAKMuE,EALF1oD,EAAQ6C,EAAOshD,GAInB,GAFAuC,GAAapoD,EAAS0B,IAEjB62C,GAAa72C,EAAM5O,MAGtBkN,EAAQo1B,YAAY,eAAeh1B,OAAOtN,EAAKwD,KAAM,KAAK8J,OAAOsB,EAAMpL,KAAM,yBAA2B,YAAY8J,QAAO,EAAA+wC,EAAA,GAAQzvC,EAAM5O,MAAO,KAA2C,QAApCs3D,EAAiB1oD,EAAM04C,eAAwC,IAAnBgQ,OAA4B,EAASA,EAAet3D,MAIzP,IAAK,IAAIozD,EAAO,EAAGuB,EAAe/lD,EAAMhM,KAAMwwD,EAAOuB,EAAan3D,OAAQ41D,IAAQ,CAChF,IAMMmE,EAMAC,EAZFnuD,EAAMsrD,EAAavB,GACnB1K,EAAUr/C,EAAI7F,KAIlB,GAFA8xD,GAAapoD,EAAS7D,IAEjBg8C,GAAYh8C,EAAIrJ,MAGnBkN,EAAQo1B,YAAY,eAAeh1B,OAAOtN,EAAKwD,KAAM,KAAK8J,OAAOsB,EAAMpL,KAAM,KAAK8J,OAAOo7C,EAAS,qBAAuB,iBAAiBp7C,QAAO,EAAA+wC,EAAA,GAAQh1C,EAAIrJ,MAAO,KAAwC,QAAjCu3D,EAAgBluD,EAAIi+C,eAAuC,IAAlBiQ,OAA2B,EAASA,EAAcv3D,MAGxQ,GAAIgpD,GAAmB3/C,IAAiC,MAAzBA,EAAIu/C,kBAGjC17C,EAAQo1B,YAAY,qBAAqBh1B,OAAOtN,EAAKwD,KAAM,KAAK8J,OAAOsB,EAAMpL,KAAM,KAAK8J,OAAOo7C,EAAS,4BAA6B,CAAC8M,GAA2BnsD,EAAIi+C,SACnI,QAAjCkQ,EAAgBnuD,EAAIi+C,eAAuC,IAAlBkQ,OAA2B,EAASA,EAAcx3D,MAEhG,CACF,CACF,CAEA,SAASy2D,GAAmBvpD,EAASlN,GAGnC,IAFA,IAAIy3D,EAAiB1yD,OAAO3C,OAAO,MAE1ByxD,EAAO,EAAG6D,EAAuB13D,EAAKkoD,gBAAiB2L,EAAO6D,EAAqBl6D,OAAQq2D,IAAQ,CAC1G,IAAIZ,EAAQyE,EAAqB7D,GAE5BhQ,EAAgBoP,GAKjBjzD,IAASizD,EAKTwE,EAAexE,EAAMzvD,MACvB0J,EAAQo1B,YAAY,QAAQh1B,OAAOtN,EAAKwD,KAAM,wBAAwB8J,OAAO2lD,EAAMzvD,KAAM,UAAWm0D,GAA+B33D,EAAMizD,KAI3IwE,EAAexE,EAAMzvD,OAAQ,EAC7Bo0D,GAAgC1qD,EAASlN,EAAMizD,GAC/C4E,GAAgC3qD,EAASlN,EAAMizD,IAX7C/lD,EAAQo1B,YAAY,QAAQh1B,OAAOtN,EAAKwD,KAAM,0EAA2Em0D,GAA+B33D,EAAMizD,IAL9J/lD,EAAQo1B,YAAY,QAAQh1B,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,0CAA4C,uBAAuBsN,QAAO,EAAA+wC,EAAA,GAAQ4U,GAAQ,KAAM0E,GAA+B33D,EAAMizD,GAiB3L,CACF,CAEA,SAAS4E,GAAgC3qD,EAASlN,EAAMizD,GAGtD,IAFA,IAAI6E,EAAe93D,EAAKioD,YAEf8L,EAAO,EAAGc,EAAiB,EAAa5B,EAAMhL,aAAc8L,EAAOc,EAAer3D,OAAQu2D,IAAQ,CACzG,IAAIgE,EAAalD,EAAed,GAC5BxjD,EAAYwnD,EAAWv0D,KACvBw0D,EAAYF,EAAavnD,GAE7B,GAAKynD,EAAL,CAQE,IAAIC,EAAqBC,EAD3B,IAAK9M,GAAgBl+C,EAAQm+C,OAAQ2M,EAAUh4D,KAAM+3D,EAAW/3D,MAG9DkN,EAAQo1B,YAAY,mBAAmBh1B,OAAO2lD,EAAMzvD,KAAM,KAAK8J,OAAOiD,EAAW,kBAAoB,GAAGjD,QAAO,EAAA+wC,EAAA,GAAQ0Z,EAAW/3D,MAAO,SAASsN,OAAOtN,EAAKwD,KAAM,KAAK8J,OAAOiD,EAAW,KAAO,WAAWjD,QAAO,EAAA+wC,EAAA,GAAQ2Z,EAAUh4D,MAAO,KAAM,CACpM,QAA9Ci4D,EAAsBF,EAAWzQ,eAA6C,IAAxB2Q,OAAiC,EAASA,EAAoBj4D,KACxE,QAA5Ck4D,EAAqBF,EAAU1Q,eAA4C,IAAvB4Q,OAAgC,EAASA,EAAmBl4D,OA6BnH,IAzBA,IAAIm4D,EAAQ,SAAelE,EAAMmE,GAC/B,IAeMC,EAAmBC,EAfrBC,EAAWH,EAAkBnE,GAC7BvL,EAAU6P,EAAS/0D,KACnBg1D,EAAU,EAAKR,EAAUp1D,MAAM,SAAUyG,GAC3C,OAAOA,EAAI7F,OAASklD,CACtB,IAEA,IAAK8P,EAEH,OADAtrD,EAAQo1B,YAAY,4BAA4Bh1B,OAAO2lD,EAAMzvD,KAAM,KAAK8J,OAAOiD,EAAW,KAAKjD,OAAOo7C,EAAS,oBAAoBp7C,OAAOtN,EAAKwD,KAAM,KAAK8J,OAAOiD,EAAW,yBAA0B,CAACgoD,EAASjR,QAAS0Q,EAAU1Q,UAC5N,WAMJ2D,GAAYsN,EAASv4D,KAAMw4D,EAAQx4D,OAGtCkN,EAAQo1B,YAAY,4BAA4Bh1B,OAAO2lD,EAAMzvD,KAAM,KAAK8J,OAAOiD,EAAW,KAAKjD,OAAOo7C,EAAS,OAAS,gBAAgBp7C,QAAO,EAAA+wC,EAAA,GAAQka,EAASv4D,MAAO,SAAW,GAAGsN,OAAOtN,EAAKwD,KAAM,KAAK8J,OAAOiD,EAAW,KAAKjD,OAAOo7C,EAAS,eAAiB,GAAGp7C,QAAO,EAAA+wC,EAAA,GAAQma,EAAQx4D,MAAO,KAAM,CAChQ,QAA1Cq4D,EAAoBE,EAASjR,eAA2C,IAAtB+Q,OAA+B,EAASA,EAAkBr4D,KACpE,QAAxCs4D,EAAmBE,EAAQlR,eAA0C,IAArBgR,OAA8B,EAASA,EAAiBt4D,MAG7G,EAESi0D,EAAO,EAAGmE,EAAoBL,EAAWn1D,KAAMqxD,EAAOmE,EAAkB56D,OAAQy2D,IAC5EkE,EAAMlE,EAAMmE,GAkBzB,IAZA,IAAIK,EAAS,SAAgBpE,EAAMqE,GACjC,IAAIF,EAAUE,EAAiBrE,GAC3B3L,EAAU8P,EAAQh1D,MACP,EAAKu0D,EAAWn1D,MAAM,SAAUyG,GAC7C,OAAOA,EAAI7F,OAASklD,CACtB,KAEiBM,GAAmBwP,IAClCtrD,EAAQo1B,YAAY,gBAAgBh1B,OAAOtN,EAAKwD,KAAM,KAAK8J,OAAOiD,EAAW,gCAAgCjD,OAAOo7C,EAAS,8CAA8Cp7C,OAAO2lD,EAAMzvD,KAAM,KAAK8J,OAAOiD,EAAW,KAAM,CAACioD,EAAQlR,QAASyQ,EAAWzQ,SAE5P,EAES+M,EAAO,EAAGqE,EAAmBV,EAAUp1D,KAAMyxD,EAAOqE,EAAiBl7D,OAAQ62D,IACpFoE,EAAOpE,EAAMqE,EA1Df,MAFExrD,EAAQo1B,YAAY,mBAAmBh1B,OAAO2lD,EAAMzvD,KAAM,KAAK8J,OAAOiD,EAAW,kBAAkBjD,OAAOtN,EAAKwD,KAAM,yBAA0B,CAACu0D,EAAWzQ,SAASh6C,OAAO+pD,GAAYr3D,IA8D3L,CACF,CAEA,SAAS43D,GAAgC1qD,EAASlN,EAAMizD,GAGtD,IAFA,IAAI0F,EAAkB34D,EAAKkoD,gBAElBqM,EAAO,EAAGqE,EAAwB3F,EAAM/K,gBAAiBqM,EAAOqE,EAAsBp7D,OAAQ+2D,IAAQ,CAC7G,IAAIsE,EAAaD,EAAsBrE,IAEM,IAAzCoE,EAAgBl7D,QAAQo7D,IAC1B3rD,EAAQo1B,YAAYu2B,IAAe74D,EAAO,QAAQsN,OAAOtN,EAAKwD,KAAM,sBAAsB8J,OAAO2lD,EAAMzvD,KAAM,kDAAoD,QAAQ8J,OAAOtN,EAAKwD,KAAM,oBAAoB8J,OAAOurD,EAAWr1D,KAAM,kCAAkC8J,OAAO2lD,EAAMzvD,KAAM,KAAM,GAAG8J,OAAOqqD,GAA+B1E,EAAO4F,GAAalB,GAA+B33D,EAAMizD,IAExY,CACF,CAEA,SAASyD,GAAqBxpD,EAAS4rD,GACrC,IAAIC,EAAcD,EAAMvP,WAEG,IAAvBwP,EAAYv7D,QACd0P,EAAQo1B,YAAY,cAAch1B,OAAOwrD,EAAMt1D,KAAM,0CAA2C6zD,GAAYyB,IAK9G,IAFA,IAAIE,EAAoBj0D,OAAO3C,OAAO,MAE7BqyD,EAAO,EAAGA,EAAOsE,EAAYv7D,OAAQi3D,IAAQ,CACpD,IAAIwE,EAAaF,EAAYtE,GAEzBuE,EAAkBC,EAAWz1D,MAC/B0J,EAAQo1B,YAAY,cAAch1B,OAAOwrD,EAAMt1D,KAAM,2BAA2B8J,OAAO2rD,EAAWz1D,KAAM,UAAW01D,GAAwBJ,EAAOG,EAAWz1D,QAI/Jw1D,EAAkBC,EAAWz1D,OAAQ,EAEhCogD,EAAaqV,IAChB/rD,EAAQo1B,YAAY,cAAch1B,OAAOwrD,EAAMt1D,KAAM,oCAAsC,qBAAqB8J,QAAO,EAAA+wC,EAAA,GAAQ4a,GAAa,KAAMC,GAAwBJ,EAAOh7C,OAAOm7C,KAE5L,CACF,CAEA,SAAStC,GAAmBzpD,EAASy9C,GACnC,IAAIgF,EAAahF,EAASR,YAEA,IAAtBwF,EAAWnyD,QACb0P,EAAQo1B,YAAY,aAAah1B,OAAOq9C,EAASnnD,KAAM,oCAAqC6zD,GAAY1M,IAG1G,IAAK,IAAI+J,EAAO,EAAGA,EAAO/E,EAAWnyD,OAAQk3D,IAAQ,CACnD,IAAI1K,EAAY2F,EAAW+E,GACvB7K,EAAYG,EAAUxmD,KAE1B8xD,GAAapoD,EAAS88C,GAEJ,SAAdH,GAAsC,UAAdA,GAAuC,SAAdA,GACnD38C,EAAQo1B,YAAY,aAAah1B,OAAOq9C,EAASnnD,KAAM,2BAA2B8J,OAAOu8C,EAAW,KAAMG,EAAU1C,QAExH,CACF,CAEA,SAASsP,GAAoB1pD,EAAS6oD,GACpC,IAAItkD,EAAS,EAAaskD,EAAS9N,aAEb,IAAlBx2C,EAAOjU,QACT0P,EAAQo1B,YAAY,qBAAqBh1B,OAAOyoD,EAASvyD,KAAM,oCAAqC6zD,GAAYtB,IAIlH,IAAK,IAAInB,EAAO,EAAGA,EAAOnjD,EAAOjU,OAAQo3D,IAAQ,CAC/C,IAKMuE,EAMAC,EAXFxqD,EAAQ6C,EAAOmjD,GAInB,GAFAU,GAAapoD,EAAS0B,IAEjBy2C,GAAYz2C,EAAM5O,MAGrBkN,EAAQo1B,YAAY,eAAeh1B,OAAOyoD,EAASvyD,KAAM,KAAK8J,OAAOsB,EAAMpL,KAAM,wBAA0B,YAAY8J,QAAO,EAAA+wC,EAAA,GAAQzvC,EAAM5O,MAAO,KAA4C,QAArCm5D,EAAkBvqD,EAAM04C,eAAyC,IAApB6R,OAA6B,EAASA,EAAgBn5D,MAG/P,GAAIgrD,GAAqBp8C,IAAqC,MAA3BA,EAAMg6C,kBAGvC17C,EAAQo1B,YAAY,wBAAwBh1B,OAAOyoD,EAASvyD,KAAM,KAAK8J,OAAOsB,EAAMpL,KAAM,0BAA2B,CAACgyD,GAA2B5mD,EAAM04C,SACjH,QAArC8R,EAAkBxqD,EAAM04C,eAAyC,IAApB8R,OAA6B,EAASA,EAAgBp5D,MAExG,CACF,CAoDA,SAASq3D,GAAY12D,GACnB,IAAI2mD,EAAU3mD,EAAO2mD,QACjBC,EAAoB5mD,EAAO4mD,kBAC/B,OAAOD,EAAUC,EAAoB,CAACD,GAASh6C,OAAOi6C,GAAqB,CAACD,GAAiC,OAAtBC,QAAoD,IAAtBA,EAA+BA,EAAoB,EAC1K,CAEA,SAAS4P,GAAex2D,EAAQ04D,GAG9B,IAFA,IAAIC,EAAW,GAENC,EAAO,EAAGC,EAAgBnC,GAAY12D,GAAS44D,EAAOC,EAAch8D,OAAQ+7D,IAAQ,CAC3F,IAAIE,EAEA5wD,EAAO2wD,EAAcD,GAEzBD,EAAWA,EAAShsD,OAAoC,QAA5BmsD,EAAUJ,EAAOxwD,UAA+B,IAAZ4wD,EAAqBA,EAAU,GACjG,CAEA,OAAOH,CACT,CAEA,SAAS3B,GAA+B33D,EAAMizD,GAC5C,OAAOkE,GAAen3D,GAAM,SAAU05D,GACpC,OAAOA,EAASvR,UAClB,IAAGxmD,QAAO,SAAUg4D,GAClB,OAAOA,EAAUn2D,KAAK1C,QAAUmyD,EAAMzvD,IACxC,GACF,CAEA,SAAS01D,GAAwBJ,EAAOpP,GACtC,OAAOyN,GAAe2B,GAAO,SAAUc,GACrC,OAAOA,EAAUnQ,KACnB,IAAG9nD,QAAO,SAAU+3D,GAClB,OAAOA,EAASl2D,KAAK1C,QAAU4oD,CACjC,GACF,CAEA,SAAS8L,GAA2BvnC,GAClC,IAAI4rC,EAGJ,OAA0B,OAAnB5rC,QAA8C,IAAnBA,GAA6F,QAAvD4rC,EAAwB5rC,EAAezS,kBAAkD,IAA1Bq+C,OAAzE,EAAqHA,EAAsBn+C,MAAK,SAAU7S,GACtN,OAAOA,EAAKrF,KAAK1C,QAAUwwD,GAA2B9tD,IACxD,GACF,C,gBCjgBO,SAASs2D,GAAYzO,EAAQqO,GAElC,IAAIK,EAEJ,OAAIL,EAASjyD,OAAS,IAAKuyD,WACzBD,EAAYD,GAAYzO,EAAQqO,EAAS15D,QACrB,IAAIilD,GAAY8U,GAGlCL,EAASjyD,OAAS,IAAKwyD,eACzBF,EAAYD,GAAYzO,EAAQqO,EAAS15D,QACrB,IAAImlD,GAAe4U,GAIrCL,EAASjyD,OAAS,IAAKyyD,WAClB7O,EAAOmF,QAAQkJ,EAASl2D,KAAK1C,YAI7B,EAAA0iD,EAAA,GAAU,EAAG,0BAA2B,EAAAnF,EAAA,GAAQqb,GAC3D,CCtBO,IAAIS,GAAwB,WACjC,SAASA,EAAS9O,EAGlB+O,EAEAC,GACE3gE,KAAK4gE,QAAUjP,EACf3xD,KAAK6gE,WAAa,GAClB7gE,KAAK8gE,iBAAmB,GACxB9gE,KAAK+gE,gBAAkB,GACvB/gE,KAAKghE,eAAiB,GACtBhhE,KAAKihE,mBAAqB,GAC1BjhE,KAAKkhE,WAAa,KAClBlhE,KAAKmhE,UAAY,KACjBnhE,KAAKohE,WAAa,KAClBphE,KAAKqhE,aAAiC,OAAlBX,QAA4C,IAAlBA,EAA2BA,EAAgBY,GAErFX,IACEhV,GAAYgV,IACd3gE,KAAK+gE,gBAAgB7gE,KAAKygE,GAGxBxU,GAAgBwU,IAClB3gE,KAAK8gE,iBAAiB5gE,KAAKygE,GAGzB5U,GAAa4U,IACf3gE,KAAK6gE,WAAW3gE,KAAKygE,GAG3B,CAEA,IAAI7S,EAAS2S,EAASz6D,UAsQtB,OApQA8nD,EAAOgJ,QAAU,WACf,GAAI92D,KAAK6gE,WAAW/8D,OAAS,EAC3B,OAAO9D,KAAK6gE,WAAW7gE,KAAK6gE,WAAW/8D,OAAS,EAEpD,EAEAgqD,EAAOyT,cAAgB,WACrB,GAAIvhE,KAAK8gE,iBAAiBh9D,OAAS,EACjC,OAAO9D,KAAK8gE,iBAAiB9gE,KAAK8gE,iBAAiBh9D,OAAS,EAEhE,EAEAgqD,EAAO0T,aAAe,WACpB,GAAIxhE,KAAK+gE,gBAAgBj9D,OAAS,EAChC,OAAO9D,KAAK+gE,gBAAgB/gE,KAAK+gE,gBAAgBj9D,OAAS,EAE9D,EAEAgqD,EAAO2T,mBAAqB,WAC1B,GAAIzhE,KAAK+gE,gBAAgBj9D,OAAS,EAChC,OAAO9D,KAAK+gE,gBAAgB/gE,KAAK+gE,gBAAgBj9D,OAAS,EAE9D,EAEAgqD,EAAOwT,YAAc,WACnB,GAAIthE,KAAKghE,eAAel9D,OAAS,EAC/B,OAAO9D,KAAKghE,eAAehhE,KAAKghE,eAAel9D,OAAS,EAE5D,EAEAgqD,EAAO4T,gBAAkB,WACvB,GAAI1hE,KAAKihE,mBAAmBn9D,OAAS,EACnC,OAAO9D,KAAKihE,mBAAmBjhE,KAAKihE,mBAAmBn9D,OAAS,EAEpE,EAEAgqD,EAAO2M,aAAe,WACpB,OAAOz6D,KAAKkhE,UACd,EAEApT,EAAO6T,YAAc,WACnB,OAAO3hE,KAAKmhE,SACd,EAEArT,EAAO8T,aAAe,WACpB,OAAO5hE,KAAKohE,UACd,EAEAtT,EAAOp7B,MAAQ,SAAevjB,GAC5B,IAAIwiD,EAAS3xD,KAAK4gE,QAKlB,OAAQzxD,EAAKpB,MACX,KAAK,IAAK8zD,cAEN,IAAIzI,EAAYvM,GAAa7sD,KAAK82D,WAElC92D,KAAK8gE,iBAAiB5gE,KAAKisD,GAAgBiN,GAAaA,OAAYjwD,GAEpE,MAGJ,KAAK,IAAKkyC,MAEN,IACIymB,EACAvF,EAFAvzC,EAAahpB,KAAKuhE,gBAIlBv4C,IACF84C,EAAW9hE,KAAKqhE,aAAa1P,EAAQ3oC,EAAY7Z,MAG/CotD,EAAYuF,EAASx7D,MAIzBtG,KAAKghE,eAAe9gE,KAAK4hE,GAEzB9hE,KAAK6gE,WAAW3gE,KAAK6rD,GAAawQ,GAAaA,OAAYpzD,GAE3D,MAGJ,KAAK,IAAK44D,UACR/hE,KAAKkhE,WAAavP,EAAO8I,aAAatrD,EAAKrF,KAAK1C,OAChD,MAEF,KAAK,IAAKi1C,qBAEN,IAAI/1C,EAEJ,OAAQ6I,EAAKrE,WACX,IAAK,QACHxE,EAAOqrD,EAAO0C,eACd,MAEF,IAAK,WACH/tD,EAAOqrD,EAAO2C,kBACd,MAEF,IAAK,eACHhuD,EAAOqrD,EAAO4C,sBAIlBv0D,KAAK6gE,WAAW3gE,KAAKgqD,EAAa5jD,GAAQA,OAAO6C,GAEjD,MAGJ,KAAK,IAAK8rD,gBACV,KAAK,IAAK3Y,oBAEN,IAAI0lB,EAAmB7yD,EAAK4W,cACxBk8C,EAAaD,EAAmB5B,GAAYzO,EAAQqQ,GAAoBnV,GAAa7sD,KAAK82D,WAE9F92D,KAAK6gE,WAAW3gE,KAAK6rD,GAAakW,GAAcA,OAAa94D,GAE7D,MAGJ,KAAK,IAAK+rD,oBAEN,IAAIgN,EAAY9B,GAAYzO,EAAQxiD,EAAK7I,MAEzCtG,KAAK+gE,gBAAgB7gE,KAAKyrD,GAAYuW,GAAaA,OAAY/4D,GAE/D,MAGJ,KAAK,IAAKg5D,SAEN,IAAIC,EAEAC,EACAC,EACAC,EAAkE,QAA9CH,EAAqBpiE,KAAKy6D,sBAAmD,IAAvB2H,EAAgCA,EAAqBpiE,KAAKshE,cAEpIiB,IACFF,EAAS,EAAKE,EAAiBr5D,MAAM,SAAUyG,GAC7C,OAAOA,EAAI7F,OAASqF,EAAKrF,KAAK1C,KAChC,OAGEk7D,EAAUD,EAAO/7D,MAIrBtG,KAAKmhE,UAAYkB,EAEjBriE,KAAKihE,mBAAmB/gE,KAAKmiE,EAASA,EAAOvpB,kBAAe3vC,GAE5DnJ,KAAK+gE,gBAAgB7gE,KAAKyrD,GAAY2W,GAAWA,OAAUn5D,GAE3D,MAGJ,KAAK,IAAKwgD,KAEN,IAAI6Y,EAAW9V,GAAgB1sD,KAAKwhE,gBAChC/N,EAAWlJ,GAAWiY,GAAYA,EAAS3W,OAAS2W,EAExDxiE,KAAKihE,mBAAmB/gE,UAAKiJ,GAE7BnJ,KAAK+gE,gBAAgB7gE,KAAKyrD,GAAY8H,GAAYA,OAAWtqD,GAE7D,MAGJ,KAAK,IAAK4qD,aAEN,IACI0O,EACAC,EAFAC,EAAa9V,GAAa7sD,KAAKwhE,gBAI/BlX,GAAkBqY,KACpBD,EAAaC,EAAWpU,YAAYp/C,EAAKrF,KAAK1C,UAG5Cq7D,EAAiBC,EAAWp8D,MAIhCtG,KAAKihE,mBAAmB/gE,KAAKwiE,EAAaA,EAAW5pB,kBAAe3vC,GAEpEnJ,KAAK+gE,gBAAgB7gE,KAAKyrD,GAAY8W,GAAkBA,OAAiBt5D,GAEzE,MAGJ,KAAK,IAAKsgD,KAEN,IACI6G,EADAW,EAAWpE,GAAa7sD,KAAKwhE,gBAG7BnX,EAAW4G,KACbX,EAAYW,EAASviC,SAASvf,EAAK/H,QAGrCpH,KAAKohE,WAAa9Q,EAI1B,EAEAxC,EAAOzQ,MAAQ,SAAeluC,GAC5B,OAAQA,EAAKpB,MACX,KAAK,IAAK8zD,cACR7hE,KAAK8gE,iBAAiB51C,MAEtB,MAEF,KAAK,IAAKmwB,MACRr7C,KAAKghE,eAAe91C,MAEpBlrB,KAAK6gE,WAAW31C,MAEhB,MAEF,KAAK,IAAK62C,UACR/hE,KAAKkhE,WAAa,KAClB,MAEF,KAAK,IAAK7kB,qBACV,KAAK,IAAK4Y,gBACV,KAAK,IAAK3Y,oBACRt8C,KAAK6gE,WAAW31C,MAEhB,MAEF,KAAK,IAAKgqC,oBACRl1D,KAAK+gE,gBAAgB71C,MAErB,MAEF,KAAK,IAAKi3C,SACRniE,KAAKmhE,UAAY,KAEjBnhE,KAAKihE,mBAAmB/1C,MAExBlrB,KAAK+gE,gBAAgB71C,MAErB,MAEF,KAAK,IAAKy+B,KACV,KAAK,IAAKoK,aACR/zD,KAAKihE,mBAAmB/1C,MAExBlrB,KAAK+gE,gBAAgB71C,MAErB,MAEF,KAAK,IAAKu+B,KACRzpD,KAAKohE,WAAa,KAGxB,EAEOX,CACT,CAxSmC,GA+SnC,SAASa,GAAY3P,EAAQ3oC,EAAY45C,GACvC,IAAI94D,EAAO84D,EAAU94D,KAAK1C,MAE1B,OAAI0C,IAAS0sD,GAAmB1sD,MAAQ6nD,EAAO0C,iBAAmBrrC,EACzDwtC,GAGL1sD,IAAS6sD,GAAiB7sD,MAAQ6nD,EAAO0C,iBAAmBrrC,EACvD2tC,GAGL7sD,IAASitD,GAAqBjtD,MAAQqiD,GAAgBnjC,GACjD+tC,GAGL7M,EAAalhC,IAAemhC,EAAgBnhC,GACvCA,EAAWulC,YAAYzkD,QADhC,CAGF,CAOO,SAAS+4D,GAAkBC,EAAUC,GAC1C,MAAO,CACLrwC,MAAO,SAAevjB,GACpB2zD,EAASpwC,MAAMvjB,GACf,IAAI4zB,GAAK,QAAWggC,EAAS5zD,EAAKpB,MAElC,GAEA,GAAIg1B,EAAI,CACN,IAAI92B,EAAS82B,EAAGh2B,MAAMg2D,EAASn2D,WAU/B,YARezD,IAAX8C,IACF62D,EAASzlB,MAAMluC,IAEX,SAAOlD,IACT62D,EAASpwC,MAAMzmB,IAIZA,CACT,CACF,EACAoxC,MAAO,SAAeluC,GACpB,IAGIlD,EAHA82B,GAAK,QAAWggC,EAAS5zD,EAAKpB,MAElC,GAQA,OALIg1B,IACF92B,EAAS82B,EAAGh2B,MAAMg2D,EAASn2D,YAG7Bk2D,EAASzlB,MAAMluC,GACRlD,CACT,EAEJ,C,gBC/WO,SAAS+2D,GAA0BxvD,GACxC,MAAO,CACLyvD,SAAU,SAAkB9zD,GAC1B,IAAK,IAAIyzC,EAAM,EAAGsgB,EAAqB/zD,EAAKvB,YAAag1C,EAAMsgB,EAAmBp/D,OAAQ8+C,IAAO,CAC/F,IAAI9K,EAAaorB,EAAmBtgB,GAEpC,KAAK,SAA2B9K,GAAa,CAC3C,IAAIqrB,EAAUrrB,EAAW/pC,OAAS,IAAKq1D,mBAAqBtrB,EAAW/pC,OAAS,IAAKs1D,iBAAmB,SAAW,IAAMvrB,EAAWhuC,KAAK1C,MAAQ,IACjJoM,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,OAAO3tC,OAAOuvD,EAAS,kCAAmCrrB,GACjG,CACF,CAEA,OAAO,CACT,EAEJ,CClBO,SAASwrB,GAAyB9vD,GACvC,IAAI+vD,EAAsBl4D,OAAO3C,OAAO,MACxC,MAAO,CACLm1C,oBAAqB,SAA6B1uC,GAChD,IAAIvD,EAAgBuD,EAAKrF,KAUzB,OARI8B,IACE23D,EAAoB33D,EAAcxE,OACpCoM,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,0CAA2C3tC,OAAOhI,EAAcxE,MAAO,MAAQ,CAACm8D,EAAoB33D,EAAcxE,OAAQwE,KAE/J23D,EAAoB33D,EAAcxE,OAASwE,IAIxC,CACT,EACAwxC,mBAAoB,WAClB,OAAO,CACT,EAEJ,CClBO,SAASomB,GAA2BhwD,GACzC,IAAI+oC,EAAiB,EACrB,MAAO,CACL0mB,SAAU,SAAkB9zD,GAC1BotC,EAAiBptC,EAAKvB,YAAY3F,QAAO,SAAU6vC,GACjD,OAAOA,EAAW/pC,OAAS,IAAKsuC,oBAClC,IAAGv4C,MACL,EACA+5C,oBAAqB,SAA6B1uC,IAC3CA,EAAKrF,MAAQyyC,EAAiB,GACjC/oC,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,+DAAgEpyC,GAEzG,EAEJ,CChBO,SAASs0D,GAA6BjwD,GAC3C,MAAO,CACLqqC,oBAAqB,SAA6B1uC,GACzB,iBAAnBA,EAAKrE,WACqC,IAAxCqE,EAAK2F,aAAaG,WAAWnR,QAC/B0P,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAapyC,EAAKrF,KAAO,iBAAkB8J,OAAOzE,EAAKrF,KAAK1C,MAAO,2CAA8C,+DAAgE+H,EAAK2F,aAAaG,WAAWpR,MAAM,IAGlP,EAEJ,CCJO,SAAS6/D,GAAmBlwD,GAKjC,IAJA,IAAIm+C,EAASn+C,EAAQmwD,YACjBC,EAAmBjS,EAASA,EAAOyC,aAAe/oD,OAAO3C,OAAO,MAChEm7D,EAAex4D,OAAO3C,OAAO,MAExBk6C,EAAM,EAAGkhB,EAAyBtwD,EAAQuwD,cAAcn2D,YAAag1C,EAAMkhB,EAAuBhgE,OAAQ8+C,IAAO,CACxH,IAAIntC,EAAMquD,EAAuBlhB,IAE7B,SAAqBntC,KACvBouD,EAAapuD,EAAI3L,KAAK1C,QAAS,EAEnC,CAEA,IAAI48D,EAAY34D,OAAO+D,KAAKw0D,GAAkBhwD,OAAOvI,OAAO+D,KAAKy0D,IACjE,MAAO,CACLI,UAAW,SAAmB90D,EAAM+0D,EAAIhtD,EAAQitD,EAAIxvC,GAClD,IA0BavtB,EA1BT4oD,EAAW7gD,EAAKrF,KAAK1C,MAEzB,IAAKw8D,EAAiB5T,KAAc6T,EAAa7T,GAAW,CAC1D,IAAIoU,EAEA7vC,EAAkD,QAAhC6vC,EAAczvC,EAAU,UAAgC,IAAhByvC,EAAyBA,EAAcltD,EACjGmtD,EAA0B,MAAlB9vC,IAoBDntB,EApBqCmtB,GAqB9CrhB,MAAMC,QAAQ/L,MAAW,SAA2BA,KAAU,SAA0BA,KAnB1F,GAAIi9D,GAcZ,SAA4BrU,GAC1B,OAAgD,IAAzCsU,GAAkBvgE,QAAQisD,EACnC,CAhBqBuU,CAAmBvU,GAC9B,OAGF,IAAIwU,EAAiBvd,EAAe+I,EAAUqU,EAAQC,GAAkB1wD,OAAOowD,GAAaA,GAC5FxwD,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,iBAAkB3tC,OAAOo8C,EAAU,MAAStK,EAAW8e,GAAiBr1D,GAC/G,CACF,EAEJ,CACA,IAAIm1D,GAAoB,GAAG1wD,OAAOy/C,GAAsB4D,IAAoB1uD,KAAI,SAAUjC,GACxF,OAAOA,EAAKwD,IACd,ICrCO,SAAS26D,GAA8BjxD,GAC5C,MAAO,CACLwpC,eAAgB,SAAwB7tC,GACtC,IAAI4W,EAAgB5W,EAAK4W,cAEzB,GAAIA,EAAe,CACjB,IAAIzf,EAAO85D,GAAY5sD,EAAQmwD,YAAa59C,GAE5C,GAAIzf,IAAS6lD,GAAgB7lD,GAAO,CAClC,IAAIo+D,GAAU,OAAM3+C,GACpBvS,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,oDAAqD3tC,OAAO8wD,EAAS,MAAQ3+C,GACpH,CACF,CACF,EACAq3B,mBAAoB,SAA4BjuC,GAC9C,IAAI7I,EAAO85D,GAAY5sD,EAAQmwD,YAAax0D,EAAK4W,eAEjD,GAAIzf,IAAS6lD,GAAgB7lD,GAAO,CAClC,IAAIo+D,GAAU,OAAMv1D,EAAK4W,eACzBvS,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,aAAc3tC,OAAOzE,EAAKrF,KAAK1C,MAAO,8CAAgDwM,OAAO8wD,EAAS,MAAQv1D,EAAK4W,eAC1J,CACF,EAEJ,CCxBO,SAAS4+C,GAA2BnxD,GACzC,MAAO,CACLypC,mBAAoB,SAA4B9tC,GAC9C,IAAI7I,EAAO85D,GAAY5sD,EAAQmwD,YAAax0D,EAAK7I,MAEjD,GAAIA,IAASqlD,GAAYrlD,GAAO,CAC9B,IAAIsb,EAAezS,EAAKu3B,SAAS58B,KAAK1C,MAClC4oD,GAAW,OAAM7gD,EAAK7I,MAC1BkN,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,cAAe3tC,OAAOgO,EAAc,gCAAkChO,OAAOo8C,EAAU,MAAQ7gD,EAAK7I,MAC3I,CACF,EAEJ,CCbO,SAASs+D,GAAgBpxD,GAC9B,MAAO,CACLupC,MAAO,SAAe5tC,GACpB,IAAI7I,EAAOkN,EAAQsjD,UACfhiD,EAAe3F,EAAK2F,aAExB,GAAIxO,EACF,GAAI2lD,GAAWY,GAAavmD,KAC1B,GAAIwO,EAAc,CAChB,IAAI+B,EAAY1H,EAAKrF,KAAK1C,MACtBs9D,GAAU,EAAA/f,EAAA,GAAQr+C,GACtBkN,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,UAAW3tC,OAAOiD,EAAW,4CAA8CjD,OAAO8wD,EAAS,uBAAyB5vD,GAC3J,OACK,IAAKA,EAAc,CACxB,IAAI+vD,EAAa11D,EAAKrF,KAAK1C,MAEvB09D,GAAW,EAAAngB,EAAA,GAAQr+C,GAEvBkN,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,UAAW3tC,OAAOixD,EAAY,eAAiBjxD,OAAOkxD,EAAU,wDAA0DlxD,OAAOixD,EAAY,cAAgB11D,GACpM,CAEJ,EAEJ,CCpBO,SAAS41D,GAAwBvxD,GACtC,MAAO,CACLupC,MAAO,SAAe5tC,GACpB,IAAI7I,EAAOkN,EAAQ+tD,gBAEnB,GAAIj7D,IACakN,EAAQ8tD,cAER,CAEb,IAAI3P,EAASn+C,EAAQmwD,YACjB9sD,EAAY1H,EAAKrF,KAAK1C,MAEtB49D,EAAatf,EAAW,+BAmBtC,SAA+BiM,EAAQrrD,EAAMuQ,GAC3C,IAAKw1C,GAAe/lD,GAElB,MAAO,GAMT,IAHA,IAAIk+D,EAAiB,IAAI72D,IACrBs3D,EAAa55D,OAAO3C,OAAO,MAEtBk6C,EAAM,EAAGsiB,EAAyBvT,EAAOK,iBAAiB1rD,GAAOs8C,EAAMsiB,EAAuBphE,OAAQ8+C,IAAO,CACpH,IAAIsX,EAAegL,EAAuBtiB,GAE1C,GAAKsX,EAAa3L,YAAY13C,GAA9B,CAKA2tD,EAAe37D,IAAIqxD,GACnB+K,EAAW/K,EAAapwD,MAAQ,EAEhC,IAAK,IAAI25C,EAAM,EAAG0hB,EAAyBjL,EAAa1L,gBAAiB/K,EAAM0hB,EAAuBrhE,OAAQ2/C,IAAO,CACnH,IAAI2hB,EAEAC,EAAoBF,EAAuB1hB,GAE1C4hB,EAAkB9W,YAAY13C,KAKnC2tD,EAAe37D,IAAIw8D,GACnBJ,EAAWI,EAAkBv7D,OAA0E,QAAhEs7D,EAAwBH,EAAWI,EAAkBv7D,aAA6C,IAA1Bs7D,EAAmCA,EAAwB,GAAK,EACjL,CAlBA,CAmBF,CAEA,OAAO,GAAUZ,GAAgB9qD,MAAK,SAAU83C,EAAOC,GAErD,IAAI6T,EAAiBL,EAAWxT,EAAM3nD,MAAQm7D,EAAWzT,EAAM1nD,MAE/D,OAAuB,IAAnBw7D,EACKA,EAILnb,EAAgBqH,IAAUG,EAAOG,UAAUN,EAAOC,IAC5C,EAGNtH,EAAgBsH,IAAUE,EAAOG,UAAUL,EAAOD,GAC7C,EAGFrL,EAAeqL,EAAM1nD,KAAM2nD,EAAM3nD,KAC1C,IAAGvB,KAAI,SAAU+kC,GACf,OAAOA,EAAExjC,IACX,GACF,CA3EsEy7D,CAAsB5T,EAAQrrD,EAAMuQ,IAE7E,KAAfmuD,IACFA,EAAatf,EA+EzB,SAAgCp/C,EAAMuQ,GACpC,GAAIqzC,EAAa5jD,IAAS6jD,EAAgB7jD,GAAO,CAE/C,OAAO2gD,EAAepwC,EADGxL,OAAO+D,KAAK9I,EAAKioD,aAE5C,CAGA,MAAO,EACT,CAvFoCiX,CAAuBl/D,EAAMuQ,KAIvDrD,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,uBAAwB3tC,OAAOiD,EAAW,eAAiBjD,OAAOtN,EAAKwD,KAAM,MAASk7D,EAAY71D,GACzI,CAEJ,EAEJ,CC/BO,SAASs2D,GAAwBjyD,GACtC,IAAIkyD,EAAqBr6D,OAAO3C,OAAO,MACvC,MAAO,CACLm1C,oBAAqB,WACnB,OAAO,CACT,EACAT,mBAAoB,SAA4BjuC,GAC9C,IAAInB,EAAemB,EAAKrF,KAAK1C,MAQ7B,OANIs+D,EAAmB13D,GACrBwF,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,yCAA0C3tC,OAAO5F,EAAc,MAAQ,CAAC03D,EAAmB13D,GAAemB,EAAKrF,QAEpJ47D,EAAmB13D,GAAgBmB,EAAKrF,MAGnC,CACT,EAEJ,CCjBO,SAAS67D,GAAuBnyD,GACrC,MAAO,CACLohB,eAAgB,SAAwBzlB,GACtC,IAAInB,EAAemB,EAAKrF,KAAK1C,MACdoM,EAAQoyD,YAAY53D,IAGjCwF,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,qBAAsB3tC,OAAO5F,EAAc,MAAQmB,EAAKrF,MAEjG,EAEJ,CCXO,SAAS+7D,GAAsBryD,GACpC,IAAIsyD,EAAgB,GAChBC,EAAe,GACnB,MAAO,CACLloB,oBAAqB,SAA6B1uC,GAEhD,OADA22D,EAAc5lE,KAAKiP,IACZ,CACT,EACAiuC,mBAAoB,SAA4BjuC,GAE9C,OADA42D,EAAa7lE,KAAKiP,IACX,CACT,EACA8zD,SAAU,CACR5lB,MAAO,WAGL,IAFA,IAAI2oB,EAAmB36D,OAAO3C,OAAO,MAE5Bk6C,EAAM,EAAGA,EAAMkjB,EAAchiE,OAAQ8+C,IAG5C,IAFA,IAAI93C,EAAYg7D,EAAcljB,GAErBa,EAAM,EAAGwiB,EAAyBzyD,EAAQ0yD,kCAAkCp7D,GAAY24C,EAAMwiB,EAAuBniE,OAAQ2/C,IAAO,CAE3IuiB,EADeC,EAAuBxiB,GACZ35C,KAAK1C,QAAS,CAC1C,CAGF,IAAK,IAAIu8C,EAAM,EAAGA,EAAMoiB,EAAajiE,OAAQ6/C,IAAO,CAClD,IAAInL,EAAcutB,EAAapiB,GAC3BwiB,EAAW3tB,EAAY1uC,KAAK1C,OAEG,IAA/B4+D,EAAiBG,IACnB3yD,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,aAAc3tC,OAAOuyD,EAAU,oBAAsB3tB,GAE9F,CACF,GAGN,CC/BO,SAAS4tB,GAA4B5yD,GAC1C,MAAO,CACLwpC,eAAgB,SAAwB7tC,GACtC,IAAIk3D,EAAW7yD,EAAQsjD,UACnB9tC,EAAaxV,EAAQ+tD,gBAEzB,GAAIpV,GAAgBka,IAAala,GAAgBnjC,KAAgB+oC,GAAev+C,EAAQmwD,YAAa0C,EAAUr9C,GAAa,CAC1H,IAAIs9C,GAAgB,EAAA3hB,EAAA,GAAQ37B,GACxBu9C,GAAc,EAAA5hB,EAAA,GAAQ0hB,GAC1B7yD,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,sDAAuD3tC,OAAO0yD,EAAe,4BAA8B1yD,OAAO2yD,EAAa,MAAQp3D,GAC9K,CACF,EACAylB,eAAgB,SAAwBzlB,GACtC,IAAIg3D,EAAWh3D,EAAKrF,KAAK1C,MACrBi/D,EAYV,SAAyB7yD,EAAS1J,GAChC,IAAI08D,EAAOhzD,EAAQoyD,YAAY97D,GAE/B,GAAI08D,EAAM,CACR,IAAIlgE,EAAO85D,GAAY5sD,EAAQmwD,YAAa6C,EAAKzgD,eAEjD,GAAIomC,GAAgB7lD,GAClB,OAAOA,CAEX,CACF,CAtBqBmgE,CAAgBjzD,EAAS2yD,GACpCn9C,EAAaxV,EAAQ+tD,gBAEzB,GAAI8E,GAAYr9C,IAAe+oC,GAAev+C,EAAQmwD,YAAa0C,EAAUr9C,GAAa,CACxF,IAAIs9C,GAAgB,EAAA3hB,EAAA,GAAQ37B,GACxBu9C,GAAc,EAAA5hB,EAAA,GAAQ0hB,GAC1B7yD,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,aAAc3tC,OAAOuyD,EAAU,gDAAkDvyD,OAAO0yD,EAAe,4BAA8B1yD,OAAO2yD,EAAa,MAAQp3D,GACxM,CACF,EAEJ,CCpCO,SAASu3D,GAAqBlzD,GAGnC,IAAImzD,EAAet7D,OAAO3C,OAAO,MAE7Bk+D,EAAa,GAEbC,EAAwBx7D,OAAO3C,OAAO,MAC1C,MAAO,CACLm1C,oBAAqB,WACnB,OAAO,CACT,EACAT,mBAAoB,SAA4BjuC,GAE9C,OADAitD,EAAqBjtD,IACd,CACT,GAKF,SAASitD,EAAqBxqD,GAC5B,IAAI+0D,EAAa/0D,EAAS9H,KAAK1C,OAA/B,CAIA,IAAI4G,EAAe4D,EAAS9H,KAAK1C,MACjCu/D,EAAa34D,IAAgB,EAC7B,IAAI84D,EAActzD,EAAQuzD,mBAAmBn1D,EAASkD,cAEtD,GAA2B,IAAvBgyD,EAAYhjE,OAAhB,CAIA+iE,EAAsB74D,GAAgB44D,EAAW9iE,OAEjD,IAAK,IAAI8+C,EAAM,EAAGA,EAAMkkB,EAAYhjE,OAAQ8+C,IAAO,CACjD,IAAIokB,EAAaF,EAAYlkB,GACzBqkB,EAAaD,EAAWl9D,KAAK1C,MAC7Bo1D,EAAaqK,EAAsBI,GAGvC,GAFAL,EAAW1mE,KAAK8mE,QAEG79D,IAAfqzD,EAA0B,CAC5B,IAAI0K,EAAiB1zD,EAAQoyD,YAAYqB,GAErCC,GACF9K,EAAqB8K,EAEzB,KAAO,CACL,IAAIzK,EAAYmK,EAAW/iE,MAAM24D,GAC7B2K,EAAU1K,EAAU54D,MAAM,GAAI,GAAG0E,KAAI,SAAUL,GACjD,MAAO,IAAMA,EAAE4B,KAAK1C,MAAQ,GAC9B,IAAGga,KAAK,MACR5N,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,2BAA4B3tC,OAAOqzD,EAAY,oBAAmC,KAAZE,EAAiB,QAAQvzD,OAAOuzD,EAAS,KAAO,KAAM1K,GACnK,CAEAmK,EAAW17C,KACb,CAEA27C,EAAsB74D,QAAgB7E,CA3BtC,CARA,CAoCF,CACF,CCtDO,SAASi+D,GAAwB5zD,GACtC,IAAI6zD,EAAqBh8D,OAAO3C,OAAO,MACvC,MAAO,CACLm1C,oBAAqB,WACnBwpB,EAAqBh8D,OAAO3C,OAAO,KACrC,EACAu0C,mBAAoB,SAA4B9tC,GAC9C,IAAIyS,EAAezS,EAAKu3B,SAAS58B,KAAK1C,MAElCigE,EAAmBzlD,GACrBpO,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,0CAA2C3tC,OAAOgO,EAAc,MAAQ,CAACylD,EAAmBzlD,GAAezS,EAAKu3B,SAAS58B,QAE9Ju9D,EAAmBzlD,GAAgBzS,EAAKu3B,SAAS58B,IAErD,EAEJ,CCfO,SAASw9D,GAAyB9zD,GACvC,IAAI+zD,EAAsBl8D,OAAO3C,OAAO,MACxC,MAAO,CACLm1C,oBAAqB,CACnBnrB,MAAO,WACL60C,EAAsBl8D,OAAO3C,OAAO,KACtC,EACA20C,MAAO,SAAevyC,GAGpB,IAFA,IAAI08D,EAASh0D,EAAQi0D,2BAA2B38D,GAEvC83C,EAAM,EAAGA,EAAM4kB,EAAO1jE,OAAQ8+C,IAAO,CAC5C,IACIzzC,EADQq4D,EAAO5kB,GACFzzC,KACbuuC,EAAUvuC,EAAKrF,KAAK1C,OAEa,IAAjCmgE,EAAoB7pB,IACtBlqC,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAaz2C,EAAUhB,KAAO,cAAe8J,OAAO8pC,EAAS,mCAAqC9pC,OAAO9I,EAAUhB,KAAK1C,MAAO,MAAS,cAAewM,OAAO8pC,EAAS,qBAAuB,CAACvuC,EAAMrE,IAEjO,CACF,GAEFmyC,mBAAoB,SAA4B9tC,GAC9Co4D,EAAoBp4D,EAAKu3B,SAAS58B,KAAK1C,QAAS,CAClD,EAEJ,CCzBO,SAASsgE,GAAsBl0D,GACpC,IAAIm0D,EAAe,GACnB,MAAO,CACL9pB,oBAAqB,CACnBnrB,MAAO,WACLi1C,EAAe,EACjB,EACAtqB,MAAO,SAAevyC,GAIpB,IAHA,IAAI88D,EAAmBv8D,OAAO3C,OAAO,MACjC8+D,EAASh0D,EAAQi0D,2BAA2B38D,GAEvC83C,EAAM,EAAGA,EAAM4kB,EAAO1jE,OAAQ8+C,IAAO,CAG5CglB,EAFYJ,EAAO5kB,GACFzzC,KACKrF,KAAK1C,QAAS,CACtC,CAEA,IAAK,IAAIq8C,EAAM,EAAGokB,EAAiBF,EAAclkB,EAAMokB,EAAe/jE,OAAQ2/C,IAAO,CACnF,IAAIqkB,EAAcD,EAAepkB,GAC7B7hC,EAAekmD,EAAYphC,SAAS58B,KAAK1C,OAEN,IAAnCwgE,EAAiBhmD,IACnBpO,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAaz2C,EAAUhB,KAAO,cAAe8J,OAAOgO,EAAc,kCAAoChO,OAAO9I,EAAUhB,KAAK1C,MAAO,MAAS,cAAewM,OAAOgO,EAAc,oBAAsBkmD,GAElO,CACF,GAEF7qB,mBAAoB,SAA4BxnC,GAC9CkyD,EAAaznE,KAAKuV,EACpB,EAEJ,CC1BO,SAASsyD,GAAoBv0D,GAKlC,IAJA,IAAIw0D,EAAe38D,OAAO3C,OAAO,MAC7BipD,EAASn+C,EAAQmwD,YACjBsE,EAAoBtW,EAASA,EAAO8C,gBAAkBqD,GAEjDlV,EAAM,EAAGA,EAAMqlB,EAAkBnkE,OAAQ8+C,IAAO,CACvD,IAAI1uB,EAAY+zC,EAAkBrlB,GAClColB,EAAa9zC,EAAUpqB,MAAQoqB,EAAU6uB,SAC3C,CAIA,IAFA,IAAImlB,EAAiB10D,EAAQuwD,cAAcn2D,YAElC61C,EAAM,EAAGA,EAAMykB,EAAepkE,OAAQ2/C,IAAO,CACpD,IAAIhuC,EAAMyyD,EAAezkB,GAErBhuC,EAAI1H,OAAS,IAAKo6D,uBACpBH,EAAavyD,EAAI3L,KAAK1C,OAASqO,EAAIstC,UAAUx6C,KAAI,SAAUuB,GACzD,OAAOA,EAAK1C,KACd,IAEJ,CAEA,MAAO,CACLqrB,UAAW,SAAmBtjB,EAAMqlC,EAAM0I,EAASC,EAAOxoB,GACxD,IAAI7qB,EAAOqF,EAAKrF,KAAK1C,MACjB27C,EAAYilB,EAAal+D,GAE7B,GAAKi5C,EAAL,CAKA,IAAIqlB,EASV,SAAwCzzC,GACtC,IAAI0zC,EAAY1zC,EAAUA,EAAU7wB,OAAS,GAG7C,QAFCoP,MAAMC,QAAQk1D,KAAc,EAAAve,EAAA,GAAU,GAE/Bue,EAAUt6D,MAChB,KAAK,IAAKsuC,qBACR,OA2DN,SAA0CvxC,GACxC,OAAQA,GACN,IAAK,QACH,OAAO,KAAkBgqD,MAE3B,IAAK,WACH,OAAO,KAAkBC,SAE3B,IAAK,eACH,OAAO,KAAkBC,cAIpB,EAAAlL,EAAA,GAAU,EAAG,0BAA2B,EAAAnF,EAAA,GAAQ75C,GAC3D,CAzEaw9D,CAAiCD,EAAUv9D,WAEpD,KAAK,IAAKuwC,MACR,OAAO,KAAkBA,MAE3B,KAAK,IAAKv7B,gBACR,OAAO,KAAkBA,gBAE3B,KAAK,IAAKm1C,gBACR,OAAO,KAAkBA,gBAE3B,KAAK,IAAK3Y,oBACR,OAAO,KAAkBA,oBAE3B,KAAK,IAAK4Y,oBACR,OAAO,KAAkBA,oBAE3B,KAAK,IAAKkO,kBACV,KAAK,IAAKC,iBACR,OAAO,KAAkBlO,OAE3B,KAAK,IAAKoT,uBACV,KAAK,IAAKC,sBACR,OAAO,KAAkBpT,OAE3B,KAAK,IAAKqT,uBACV,KAAK,IAAKC,sBACR,OAAO,KAAkB9e,OAE3B,KAAK,IAAKyL,iBACR,OAAO,KAAkBA,iBAE3B,KAAK,IAAKsT,0BACV,KAAK,IAAKC,yBACR,OAAO,KAAkBrT,UAE3B,KAAK,IAAKsT,sBACV,KAAK,IAAKC,qBACR,OAAO,KAAkBtT,MAE3B,KAAK,IAAKuT,qBACV,KAAK,IAAKC,oBACR,OAAO,KAAkBvf,KAE3B,KAAK,IAAKwf,sBACR,OAAO,KAAkBxT,WAE3B,KAAK,IAAKyT,6BACV,KAAK,IAAKC,4BACR,OAAO,KAAkBzT,aAE3B,KAAK,IAAK0T,uBAGN,OADiBz0C,EAAUA,EAAU7wB,OAAS,GAC5BiK,OAAS,IAAKm7D,6BAA+B,KAAkBvT,uBAAyB,KAAkBL,oBAGpI,CAxE8B+T,CAA+B10C,GAEnDyzC,IAA+D,IAA1CrlB,EAAUh/C,QAAQqkE,IACzC50D,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,eAAgB3tC,OAAO9J,EAAM,yBAA0B8J,OAAOw0D,EAAmB,KAAMj5D,GAL9H,MAFEqE,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,uBAAwB3tC,OAAO9J,EAAM,MAAQqF,GAStF,EAEJ,CCzCO,SAASm6D,GAAgC91D,GAK9C,IAJA,IAAI+1D,EAAqBl+D,OAAO3C,OAAO,MACnCipD,EAASn+C,EAAQmwD,YACjBsE,EAAoBtW,EAASA,EAAO8C,gBAAkBqD,GAEjDlV,EAAM,EAAGA,EAAMqlB,EAAkBnkE,OAAQ8+C,IAAO,CACvD,IAAI1uB,EAAY+zC,EAAkBrlB,GAClC2mB,EAAmBr1C,EAAUpqB,OAASoqB,EAAUwgC,YAClD,CAIA,IAFA,IAAIwT,EAAiB10D,EAAQuwD,cAAcn2D,YAElC61C,EAAM,EAAGA,EAAMykB,EAAepkE,OAAQ2/C,IAAO,CACpD,IAAIhuC,EAAMyyD,EAAezkB,GAErBhuC,EAAI1H,OAAS,IAAKo6D,uBACpBoB,EAAmB9zD,EAAI3L,KAAK1C,QAAUqO,EAAI+zD,WAE9C,CAEA,IAAIC,EAAmBp+D,OAAO3C,OAAO,MACjCghE,EAAoBr+D,OAAO3C,OAAO,MACtC,MAAO,CAILgqB,MAAO,SAAevjB,GACpB,GAAuB,MAAnBA,EAAK2S,WAAT,CAIA,IAAI6nD,EAEJ,GAAIx6D,EAAKpB,OAAS,IAAKq1D,mBAAqBj0D,EAAKpB,OAAS,IAAKs1D,iBAC7DsG,EAAiBF,OACZ,IAAI,SAAqBt6D,KAAS,SAAoBA,GAAO,CAClE,IAAI6gD,EAAW7gD,EAAKrF,KAAK1C,WAGF+B,KAFvBwgE,EAAiBD,EAAkB1Z,MAGjC0Z,EAAkB1Z,GAAY2Z,EAAiBt+D,OAAO3C,OAAO,MAEjE,MACEihE,EAAiBt+D,OAAO3C,OAAO,MAGjC,IAAK,IAAIi7C,EAAM,EAAGimB,EAAoBz6D,EAAK2S,WAAY6hC,EAAMimB,EAAkB9lE,OAAQ6/C,IAAO,CAC5F,IAAIud,EAAa0I,EAAkBjmB,GAC/BxM,EAAgB+pB,EAAWp3D,KAAK1C,MAEhCmiE,EAAmBpyB,KACjBwyB,EAAexyB,GACjB3jC,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,mBAAoB3tC,OAAOujC,EAAe,6CAA+C,CAACwyB,EAAexyB,GAAgB+pB,KAE9JyI,EAAexyB,GAAiB+pB,EAGtC,CA5BA,CA6BF,EAEJ,CCvEA,SAAS3hB,GAAQt4C,EAAQu4C,GAAkB,IAAIpwC,EAAO/D,OAAO+D,KAAKnI,GAAS,GAAIoE,OAAOo0C,sBAAuB,CAAE,IAAIC,EAAUr0C,OAAOo0C,sBAAsBx4C,GAAau4C,IAAgBE,EAAUA,EAAQz3C,QAAO,SAAU03C,GAAO,OAAOt0C,OAAOu0C,yBAAyB34C,EAAQ04C,GAAKld,UAAY,KAAIrzB,EAAKlP,KAAK6M,MAAMqC,EAAMswC,EAAU,CAAE,OAAOtwC,CAAM,CAEpV,SAASi0C,GAActN,GAAU,IAAK,IAAIrpC,EAAI,EAAGA,EAAIE,UAAU9I,OAAQ4I,IAAK,CAAE,IAAIyB,EAAyB,MAAhBvB,UAAUF,GAAaE,UAAUF,GAAK,CAAC,EAAOA,EAAI,EAAK6yC,GAAQl0C,OAAO8C,IAAS,GAAMN,SAAQ,SAAU1G,GAAO04C,GAAgB9J,EAAQ5uC,EAAKgH,EAAOhH,GAAO,IAAekE,OAAO83C,0BAA6B93C,OAAO+3C,iBAAiBrN,EAAQ1qC,OAAO83C,0BAA0Bh1C,IAAmBoxC,GAAQl0C,OAAO8C,IAASN,SAAQ,SAAU1G,GAAOkE,OAAOm3B,eAAeuT,EAAQ5uC,EAAKkE,OAAOu0C,yBAAyBzxC,EAAQhH,GAAO,GAAM,CAAE,OAAO4uC,CAAQ,CAErhB,SAAS8J,GAAgBvmC,EAAKnS,EAAKC,GAAiK,OAApJD,KAAOmS,EAAOjO,OAAOm3B,eAAelpB,EAAKnS,EAAK,CAAEC,MAAOA,EAAOq7B,YAAY,EAAMC,cAAc,EAAMod,UAAU,IAAkBxmC,EAAInS,GAAOC,EAAgBkS,CAAK,CAczM,SAASuwD,GAAuBr2D,GACrC,OAAO6vC,GAAcA,GAAc,CAAC,EAAGymB,GAAmCt2D,IAAW,CAAC,EAAG,CACvFu2D,SAAU,SAAkBC,GAC1B,IAAI3H,EAAS7uD,EAAQmuD,cACjBG,EAAWtuD,EAAQ8tD,cACnBt4C,EAAaxV,EAAQ+tD,gBAEzB,IAAKc,GAAUP,GAAY94C,EAAY,CACrC,IAAIgmC,EAAUgb,EAAQlgE,KAAK1C,MAIvB2+C,EAAckB,EAAe+H,EAHZ8S,EAAS54D,KAAKX,KAAI,SAAUoH,GAC/C,OAAOA,EAAI7F,IACb,KAEA0J,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,qBAAsB3tC,OAAOo7C,EAAS,gBAAkBp7C,OAAOoV,EAAWlf,KAAM,KAAK8J,OAAOkuD,EAASh4D,KAAM,MAAS47C,EAAWK,GAAcikB,GACpL,CACF,GAEJ,CAKO,SAASF,GAAmCt2D,GAKjD,IAJA,IAAIyO,EAAgB5W,OAAO3C,OAAO,MAC9BipD,EAASn+C,EAAQmwD,YACjBsE,EAAoBtW,EAASA,EAAO8C,gBAAkBqD,GAEjDlV,EAAM,EAAGA,EAAMqlB,EAAkBnkE,OAAQ8+C,IAAO,CACvD,IAAI1uB,EAAY+zC,EAAkBrlB,GAClC3gC,EAAciS,EAAUpqB,MAAQoqB,EAAUhrB,KAAKX,KAAI,SAAUoH,GAC3D,OAAOA,EAAI7F,IACb,GACF,CAIA,IAFA,IAAIo+D,EAAiB10D,EAAQuwD,cAAcn2D,YAElC61C,EAAM,EAAGA,EAAMykB,EAAepkE,OAAQ2/C,IAAO,CACpD,IAAIhuC,EAAMyyD,EAAezkB,GAEzB,GAAIhuC,EAAI1H,OAAS,IAAKo6D,qBAAsB,CAC1C,IAAI8B,EAGAC,EAAiD,QAApCD,EAAiBx0D,EAAI7I,iBAA0C,IAAnBq9D,EAA4BA,EAAiB,GAC1GhoD,EAAcxM,EAAI3L,KAAK1C,OAAS8iE,EAAU3hE,KAAI,SAAUoH,GACtD,OAAOA,EAAI7F,KAAK1C,KAClB,GACF,CACF,CAEA,MAAO,CACLqrB,UAAW,SAAmB03C,GAC5B,IAAIhzB,EAAgBgzB,EAAcrgE,KAAK1C,MACnCgjE,EAAYnoD,EAAck1B,GAE9B,GAAIgzB,EAAcv9D,WAAaw9D,EAC7B,IAAK,IAAIzmB,EAAM,EAAG0mB,EAAyBF,EAAcv9D,UAAW+2C,EAAM0mB,EAAuBvmE,OAAQ6/C,IAAO,CAC9G,IAAIqmB,EAAUK,EAAuB1mB,GACjCqL,EAAUgb,EAAQlgE,KAAK1C,MAE3B,IAAoC,IAAhCgjE,EAAUrmE,QAAQirD,GAAiB,CACrC,IAAIjJ,EAAckB,EAAe+H,EAASob,GAC1C52D,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,qBAAsB3tC,OAAOo7C,EAAS,qBAAuBp7C,OAAOujC,EAAe,MAASuO,EAAWK,GAAcikB,GAC5J,CACF,CAGF,OAAO,CACT,EAEJ,CChFO,SAASM,GAAwB92D,GACtC,IAAI+2D,EAAgBl/D,OAAO3C,OAAO,MAClC,MAAO,CACLq0C,MAAO,WACLwtB,EAAgBl/D,OAAO3C,OAAO,KAChC,EACA+pB,UAAW,WACT83C,EAAgBl/D,OAAO3C,OAAO,KAChC,EACAqhE,SAAU,SAAkB56D,GAC1B,IAAI6/C,EAAU7/C,EAAKrF,KAAK1C,MAQxB,OANImjE,EAAcvb,GAChBx7C,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,yCAA0C3tC,OAAOo7C,EAAS,MAAQ,CAACub,EAAcvb,GAAU7/C,EAAKrF,QAErIygE,EAAcvb,GAAW7/C,EAAKrF,MAGzB,CACT,EAEJ,CCdO,SAAS0gE,GAAwBh3D,GACtC,MAAO,CACLi3D,UAAW,SAAmBt7D,GAK5B,IAAKo7C,GAFMmC,GAAgBl5C,EAAQiuD,uBAIjC,OADAiJ,GAAiBl3D,EAASrE,IACnB,CAEX,EACAw7D,YAAa,SAAqBx7D,GAChC,IAAI7I,EAAOumD,GAAar5C,EAAQguD,gBAEhC,IAAKlX,GAAkBhkD,GAErB,OADAokE,GAAiBl3D,EAASrE,IACnB,EAQT,IAJA,IAAIy7D,EAAe3lB,EAAO91C,EAAK4I,QAAQ,SAAU7C,GAC/C,OAAOA,EAAMpL,KAAK1C,KACpB,IAESw7C,EAAM,EAAGkR,EAAiB,EAAaxtD,EAAKioD,aAAc3L,EAAMkR,EAAehwD,OAAQ8+C,IAAO,CACrG,IAAIkf,EAAWhO,EAAelR,GAG9B,IAFgBgoB,EAAa9I,EAASh4D,OAEpBwnD,GAAqBwQ,GAAW,CAChD,IAAI4C,GAAU,EAAA/f,EAAA,GAAQmd,EAASx7D,MAC/BkN,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,UAAW3tC,OAAOtN,EAAKwD,KAAM,KAAK8J,OAAOkuD,EAASh4D,KAAM,wBAA0B8J,OAAO8wD,EAAS,uBAAyBv1D,GAClK,CACF,CACF,EACA07D,YAAa,SAAqB17D,GAChC,IAAI6Z,EAAa6jC,GAAar5C,EAAQiuD,sBAGtC,IAFgBjuD,EAAQguD,gBAENlX,GAAkBthC,GAAa,CAC/C,IAAI+8B,EAAckB,EAAe93C,EAAKrF,KAAK1C,MAAOiE,OAAO+D,KAAK4Z,EAAWulC,cACzE/6C,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,UAAW3tC,OAAOzE,EAAKrF,KAAK1C,MAAO,8BAAgCwM,OAAOoV,EAAWlf,KAAM,MAAS47C,EAAWK,GAAc52C,GACpK,CACF,EACA27D,UAAW,SAAmB37D,GAC5B,IAAI7I,EAAOkN,EAAQguD,eAEfhX,GAAclkD,IAChBkN,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,2BAA4B3tC,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,aAAcsN,QAAO,OAAMzE,GAAO,KAAMA,GAEnI,EACA47D,UAAW,SAAmB57D,GAC5B,OAAOu7D,GAAiBl3D,EAASrE,EACnC,EACA67D,SAAU,SAAkB77D,GAC1B,OAAOu7D,GAAiBl3D,EAASrE,EACnC,EACA87D,WAAY,SAAoB97D,GAC9B,OAAOu7D,GAAiBl3D,EAASrE,EACnC,EACA+7D,YAAa,SAAqB/7D,GAChC,OAAOu7D,GAAiBl3D,EAASrE,EACnC,EACAg8D,aAAc,SAAsBh8D,GAClC,OAAOu7D,GAAiBl3D,EAASrE,EACnC,EAEJ,CAMA,SAASu7D,GAAiBl3D,EAASrE,GAEjC,IAAIi8D,EAAe53D,EAAQguD,eAE3B,GAAK4J,EAAL,CAIA,IAAI9kE,EAAOumD,GAAaue,GAExB,GAAKnf,GAAW3lD,GAQhB,IAKE,QAAoB6C,IAJF7C,EAAKqnD,aAAax+C,OAAMhG,GAIX,CAC7B,IAAI27D,GAAW,EAAAngB,EAAA,GAAQymB,GAEvB53D,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,2BAA4B3tC,OAAOkxD,EAAU,aAAclxD,QAAO,OAAMzE,GAAO,KAAMA,GAC5H,CACF,CAAE,MAAOjK,GACP,IAAImmE,GAAY,EAAA1mB,EAAA,GAAQymB,GAEpBlmE,aAAiBq8C,EAAA,EACnB/tC,EAAQo1B,YAAY1jC,GAEpBsO,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,2BAA4B3tC,OAAOy3D,EAAW,aAAcz3D,QAAO,OAAMzE,GAAO,MAAQjK,EAAMe,QAASkJ,OAAMhG,OAAWA,OAAWA,EAAWjE,GAEvL,KA1BA,CACE,IAAIw/D,GAAU,EAAA/f,EAAA,GAAQymB,GACtB53D,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,2BAA4B3tC,OAAO8wD,EAAS,aAAc9wD,QAAO,OAAMzE,GAAO,KAAMA,GAE3H,CARA,CA+BF,CC7HA,SAAS,GAAQlI,EAAQu4C,GAAkB,IAAIpwC,EAAO/D,OAAO+D,KAAKnI,GAAS,GAAIoE,OAAOo0C,sBAAuB,CAAE,IAAIC,EAAUr0C,OAAOo0C,sBAAsBx4C,GAAau4C,IAAgBE,EAAUA,EAAQz3C,QAAO,SAAU03C,GAAO,OAAOt0C,OAAOu0C,yBAAyB34C,EAAQ04C,GAAKld,UAAY,KAAIrzB,EAAKlP,KAAK6M,MAAMqC,EAAMswC,EAAU,CAAE,OAAOtwC,CAAM,CAEpV,SAAS,GAAc2mC,GAAU,IAAK,IAAIrpC,EAAI,EAAGA,EAAIE,UAAU9I,OAAQ4I,IAAK,CAAE,IAAIyB,EAAyB,MAAhBvB,UAAUF,GAAaE,UAAUF,GAAK,CAAC,EAAOA,EAAI,EAAK,GAAQrB,OAAO8C,IAAS,GAAMN,SAAQ,SAAU1G,GAAO,GAAgB4uC,EAAQ5uC,EAAKgH,EAAOhH,GAAO,IAAekE,OAAO83C,0BAA6B93C,OAAO+3C,iBAAiBrN,EAAQ1qC,OAAO83C,0BAA0Bh1C,IAAmB,GAAQ9C,OAAO8C,IAASN,SAAQ,SAAU1G,GAAOkE,OAAOm3B,eAAeuT,EAAQ5uC,EAAKkE,OAAOu0C,yBAAyBzxC,EAAQhH,GAAO,GAAM,CAAE,OAAO4uC,CAAQ,CAErhB,SAAS,GAAgBz8B,EAAKnS,EAAKC,GAAiK,OAApJD,KAAOmS,EAAOjO,OAAOm3B,eAAelpB,EAAKnS,EAAK,CAAEC,MAAOA,EAAOq7B,YAAY,EAAMC,cAAc,EAAMod,UAAU,IAAkBxmC,EAAInS,GAAOC,EAAgBkS,CAAK,CAgBzM,SAASgyD,GAA8B93D,GAC5C,OAAO,GAAc,GAAc,CAAC,EAAG+3D,GAA0C/3D,IAAW,CAAC,EAAG,CAC9FupC,MAAO,CAELM,MAAO,SAAeulB,GACpB,IAAI4I,EAEA1J,EAAWtuD,EAAQ8tD,cAEvB,IAAKQ,EACH,OAAO,EAST,IALA,IACI2J,EAAaxmB,EAD+C,QAAhDumB,EAAuB5I,EAAUh2D,iBAAgD,IAAzB4+D,EAAkCA,EAAuB,IAC/F,SAAU77D,GAC1C,OAAOA,EAAI7F,KAAK1C,KAClB,IAESw7C,EAAM,EAAG8oB,EAAkB5J,EAAS54D,KAAM05C,EAAM8oB,EAAgB5nE,OAAQ8+C,IAAO,CACtF,IAAIyf,EAASqJ,EAAgB9oB,GAG7B,IAFc6oB,EAAWpJ,EAAOv4D,OAEhBwlD,GAAmB+S,GAAS,CAC1C,IAAIsJ,GAAa,EAAAhnB,EAAA,GAAQ0d,EAAO/7D,MAChCkN,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,UAAW3tC,OAAOkuD,EAASh4D,KAAM,gBAAkB8J,OAAOyuD,EAAOv4D,KAAM,eAAiB8J,OAAO+3D,EAAY,2CAA6C/I,GAC/L,CACF,CACF,IAGN,CAKO,SAAS2I,GAA0C/3D,GAKxD,IAJA,IAAIo4D,EAAkBvgE,OAAO3C,OAAO,MAChCipD,EAASn+C,EAAQmwD,YACjBsE,EAAoBtW,EAASA,EAAO8C,gBAAkBqD,GAEjDrU,EAAM,EAAGA,EAAMwkB,EAAkBnkE,OAAQ2/C,IAAO,CACvD,IAAIvvB,EAAY+zC,EAAkBxkB,GAClCmoB,EAAgB13C,EAAUpqB,MAAQm7C,EAAO/wB,EAAUhrB,KAAKjB,OAAOqnD,KAAqB,SAAU3/C,GAC5F,OAAOA,EAAI7F,IACb,GACF,CAIA,IAFA,IAAIo+D,EAAiB10D,EAAQuwD,cAAcn2D,YAElC+1C,EAAM,EAAGA,EAAMukB,EAAepkE,OAAQ6/C,IAAO,CACpD,IAAIluC,EAAMyyD,EAAevkB,GAEzB,GAAIluC,EAAI1H,OAAS,IAAKo6D,qBAAsB,CAC1C,IAAI8B,EAGA4B,EAAgD,QAApC5B,EAAiBx0D,EAAI7I,iBAA0C,IAAnBq9D,EAA4BA,EAAiB,GACzG2B,EAAgBn2D,EAAI3L,KAAK1C,OAAS69C,EAAO4mB,EAAS5jE,OAAO6jE,KAAyB,SAAUn8D,GAC1F,OAAOA,EAAI7F,KAAK1C,KAClB,GACF,CACF,CAEA,MAAO,CACLqrB,UAAW,CAET4qB,MAAO,SAAe8sB,GACpB,IAAIhzB,EAAgBgzB,EAAcrgE,KAAK1C,MACnC2kE,EAAeH,EAAgBz0B,GAEnC,GAAI40B,EAUF,IATA,IAAIC,EAKAP,EAAaxmB,EAFqD,QAArD+mB,EAAwB7B,EAAcv9D,iBAAiD,IAA1Bo/D,EAAmCA,EAAwB,IAEtG,SAAUr8D,GAC3C,OAAOA,EAAI7F,KAAK1C,KAClB,IAES8xD,EAAM,EAAG+S,EAAgB5gE,OAAO+D,KAAK28D,GAAe7S,EAAM+S,EAAcnoE,OAAQo1D,IAAO,CAC9F,IAAIlK,EAAUid,EAAc/S,GAE5B,IAAKuS,EAAWzc,GAAU,CACxB,IAAIsT,EAAUyJ,EAAa/c,GAAS1oD,KAChCqlE,EAAa3hB,EAAOsY,IAAW,EAAA3d,EAAA,GAAQ2d,IAAW,OAAMA,GAC5D9uD,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,eAAgB3tC,OAAOujC,EAAe,gBAAkBvjC,OAAOo7C,EAAS,eAAiBp7C,OAAO+3D,EAAY,2CAA6CxB,GAChM,CACF,CAEJ,GAGN,CAEA,SAAS2B,GAAuBn8D,GAC9B,OAAOA,EAAIrJ,KAAKyH,OAAS,IAAKwyD,eAAqC,MAApB5wD,EAAImpC,YACrD,CC5GO,SAASozB,GAA+B14D,GAC7C,IAAI24D,EAAY9gE,OAAO3C,OAAO,MAC9B,MAAO,CACLm1C,oBAAqB,CACnBnrB,MAAO,WACLy5C,EAAY9gE,OAAO3C,OAAO,KAC5B,EACA20C,MAAO,SAAevyC,GAGpB,IAFA,IAAI08D,EAASh0D,EAAQi0D,2BAA2B38D,GAEvC83C,EAAM,EAAGA,EAAM4kB,EAAO1jE,OAAQ8+C,IAAO,CAC5C,IAAIwC,EAAQoiB,EAAO5kB,GACfzzC,EAAOi2C,EAAMj2C,KACb7I,EAAO8+C,EAAM9+C,KACbwyC,EAAesM,EAAMtM,aACrB4E,EAAUvuC,EAAKrF,KAAK1C,MACpB22C,EAASouB,EAAUzuB,GAEvB,GAAIK,GAAUz3C,EAAM,CAMlB,IAAIqrD,EAASn+C,EAAQmwD,YACjByI,EAAUhM,GAAYzO,EAAQ5T,EAAOz3C,MAEzC,GAAI8lE,IAAYC,GAAqB1a,EAAQya,EAASruB,EAAOjF,aAAcxyC,EAAMwyC,GAAe,CAC9F,IAAIwzB,GAAa,EAAA3nB,EAAA,GAAQynB,GACrB1H,GAAU,EAAA/f,EAAA,GAAQr+C,GACtBkN,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,cAAe3tC,OAAO8pC,EAAS,eAAiB9pC,OAAO04D,EAAY,uCAAyC14D,OAAO8wD,EAAS,MAAQ,CAAC3mB,EAAQ5uC,IACpL,CACF,CACF,CACF,GAEF8tC,mBAAoB,SAA4B9tC,GAC9Cg9D,EAAUh9D,EAAKu3B,SAAS58B,KAAK1C,OAAS+H,CACxC,EAEJ,CAOA,SAASk9D,GAAqB1a,EAAQya,EAASG,EAAiBnB,EAAcoB,GAC5E,OAAIhiB,GAAc4gB,KAAkB5gB,GAAc4hB,IACQ,MAAnBG,GAA2BA,EAAgBx+D,OAAS,IAAKo7C,WACvChgD,IAAzBqjE,IAOvB9a,GAAgBC,EAAQya,EADJhB,EAAavf,QAInC6F,GAAgBC,EAAQya,EAAShB,EAC1C,CC9DA,SAASqB,GAAcrmE,GACrB,OAAI8M,MAAMC,QAAQ/M,GACTA,EAAOmC,KAAI,SAAUs9C,GAC1B,IAAI6mB,EAAe7mB,EAAK,GACpB8mB,EAAY9mB,EAAK,GACrB,MAAO,cAAejyC,OAAO84D,EAAc,uBAA0BD,GAAcE,EACrF,IAAGvrD,KAAK,SAGHhb,CACT,CAUO,SAASwmE,GAAiCp5D,GAI/C,IAAIq5D,EAAwB,IAAIC,GAI5BC,EAA+B,IAAI9/D,IACvC,MAAO,CACL+wC,aAAc,SAAsBlpC,GAGlC,IAFA,IAAIk4D,EAyEV,SAAyCx5D,EAASu5D,EAA8BF,EAAuB7jD,EAAYlU,GACjH,IAAIk4D,EAAY,GAEZC,EAAwBC,GAA0B15D,EAASu5D,EAA8B/jD,EAAYlU,GACrGqV,EAAW8iD,EAAsB,GACjCE,EAAgBF,EAAsB,GAM1C,GAwIF,SAAgCz5D,EAASw5D,EAAWD,EAA8BF,EAAuB1iD,GAKvG,IAAK,IAAIijD,EAAM,EAAGjoB,EAAkB,EAAch7B,GAAWijD,EAAMjoB,EAAgBrhD,OAAQspE,IAAO,CAChG,IAAI/W,EAAQlR,EAAgBioB,GACxBV,EAAerW,EAAM,GACrBt+C,EAASs+C,EAAM,GAKnB,GAAIt+C,EAAOjU,OAAS,EAClB,IAAK,IAAI4I,EAAI,EAAGA,EAAIqL,EAAOjU,OAAQ4I,IACjC,IAAK,IAAI87C,EAAI97C,EAAI,EAAG87C,EAAIzwC,EAAOjU,OAAQ0kD,IAAK,CAC1C,IAAI6kB,EAAWC,GAAa95D,EAASu5D,EAA8BF,GAAuB,EAC1FH,EAAc30D,EAAOrL,GAAIqL,EAAOywC,IAE5B6kB,GACFL,EAAU9sE,KAAKmtE,EAEnB,CAGN,CACF,CApKEE,CAAuB/5D,EAASw5D,EAAWD,EAA8BF,EAAuB1iD,GAEnE,IAAzBgjD,EAAcrpE,OAGhB,IAAK,IAAI4I,EAAI,EAAGA,EAAIygE,EAAcrpE,OAAQ4I,IAAK,CAC7C8gE,GAAyCh6D,EAASw5D,EAAWD,EAA8BF,GAAuB,EAAO1iD,EAAUgjD,EAAczgE,IAKjJ,IAAK,IAAI87C,EAAI97C,EAAI,EAAG87C,EAAI2kB,EAAcrpE,OAAQ0kD,IAC5CilB,GAAiCj6D,EAASw5D,EAAWD,EAA8BF,GAAuB,EAAOM,EAAczgE,GAAIygE,EAAc3kB,GAErJ,CAGF,OAAOwkB,CACT,CApGsBU,CAAgCl6D,EAASu5D,EAA8BF,EAAuBr5D,EAAQ+tD,gBAAiBzsD,GAE9H8tC,EAAM,EAAGA,EAAMoqB,EAAUlpE,OAAQ8+C,IAAO,CAC/C,IAAIC,EAAQmqB,EAAUpqB,GAClB+qB,EAAS9qB,EAAM,GACf6pB,EAAeiB,EAAO,GACtBvnE,EAASunE,EAAO,GAChBC,EAAU/qB,EAAM,GAChBgrB,EAAUhrB,EAAM,GAChBirB,EAAYrB,GAAcrmE,GAC9BoN,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,WAAY3tC,OAAO84D,EAAc,uBAAwB94D,OAAOk6D,EAAW,gFAAiFF,EAAQh6D,OAAOi6D,IAClN,CACF,EAEJ,CA0FA,SAASL,GAAyCh6D,EAASw5D,EAAWD,EAA8BF,EAAuBkB,EAAsB5jD,EAAUnc,GACzJ,IAAI4D,EAAW4B,EAAQoyD,YAAY53D,GAEnC,GAAK4D,EAAL,CAIA,IAAIo8D,EAAwBC,GAAoCz6D,EAASu5D,EAA8Bn7D,GACnGs8D,EAAYF,EAAsB,GAClCG,EAAiBH,EAAsB,GAG3C,GAAI7jD,IAAa+jD,EAAjB,CAMAE,GAAwB56D,EAASw5D,EAAWD,EAA8BF,EAAuBkB,EAAsB5jD,EAAU+jD,GAGjI,IAAK,IAAIxhE,EAAI,EAAGA,EAAIyhE,EAAerqE,OAAQ4I,IACzC8gE,GAAyCh6D,EAASw5D,EAAWD,EAA8BF,EAAuBkB,EAAsB5jD,EAAUgkD,EAAezhE,GARnK,CATA,CAmBF,CAIA,SAAS+gE,GAAiCj6D,EAASw5D,EAAWD,EAA8BF,EAAuBkB,EAAsBM,EAAeC,GAEtJ,GAAID,IAAkBC,IAKlBzB,EAAsBp+D,IAAI4/D,EAAeC,EAAeP,GAA5D,CAIAlB,EAAsBhkE,IAAIwlE,EAAeC,EAAeP,GACxD,IAAIQ,EAAY/6D,EAAQoyD,YAAYyI,GAChCG,EAAYh7D,EAAQoyD,YAAY0I,GAEpC,GAAKC,GAAcC,EAAnB,CAIA,IAAIC,EAAyBR,GAAoCz6D,EAASu5D,EAA8BwB,GACpGG,EAAYD,EAAuB,GACnCE,EAAiBF,EAAuB,GAExCG,EAAyBX,GAAoCz6D,EAASu5D,EAA8ByB,GACpGN,EAAYU,EAAuB,GACnCT,EAAiBS,EAAuB,GAI5CR,GAAwB56D,EAASw5D,EAAWD,EAA8BF,EAAuBkB,EAAsBW,EAAWR,GAGlI,IAAK,IAAI1lB,EAAI,EAAGA,EAAI2lB,EAAerqE,OAAQ0kD,IACzCilB,GAAiCj6D,EAASw5D,EAAWD,EAA8BF,EAAuBkB,EAAsBM,EAAeF,EAAe3lB,IAKhK,IAAK,IAAI97C,EAAI,EAAGA,EAAIiiE,EAAe7qE,OAAQ4I,IACzC+gE,GAAiCj6D,EAASw5D,EAAWD,EAA8BF,EAAuBkB,EAAsBY,EAAejiE,GAAI4hE,EAtBrJ,CARA,CAgCF,CAgFA,SAASF,GAAwB56D,EAASw5D,EAAWD,EAA8BF,EAAuBgC,EAAkCH,EAAWR,GAMrJ,IAAK,IAAIY,EAAM,EAAG7C,EAAgB5gE,OAAO+D,KAAKs/D,GAAYI,EAAM7C,EAAcnoE,OAAQgrE,IAAO,CAC3F,IAAIpC,EAAeT,EAAc6C,GAC7BjB,EAAUK,EAAUxB,GAExB,GAAImB,EAGF,IAFA,IAAID,EAAUc,EAAUhC,GAEfhgE,EAAI,EAAGA,EAAIkhE,EAAQ9pE,OAAQ4I,IAClC,IAAK,IAAI87C,EAAI,EAAGA,EAAIqlB,EAAQ/pE,OAAQ0kD,IAAK,CACvC,IAAI6kB,EAAWC,GAAa95D,EAASu5D,EAA8BF,EAAuBgC,EAAkCnC,EAAckB,EAAQlhE,GAAImhE,EAAQrlB,IAE1J6kB,GACFL,EAAU9sE,KAAKmtE,EAEnB,CAGN,CACF,CAIA,SAASC,GAAa95D,EAASu5D,EAA8BF,EAAuBgC,EAAkCnC,EAAcqC,EAAQC,GAC1I,IAAIC,EAAcF,EAAO,GACrBG,EAAQH,EAAO,GACfI,EAAOJ,EAAO,GACdK,EAAcJ,EAAO,GACrBK,EAAQL,EAAO,GACfM,EAAON,EAAO,GASdjB,EAAuBc,GAAoCI,IAAgBG,GAAellB,EAAa+kB,IAAgB/kB,EAAaklB,GAExI,IAAKrB,EAAsB,CACzB,IAAIwB,EAAkBC,EAGlBC,EAAQP,EAAMplE,KAAK1C,MACnBsoE,EAAQL,EAAMvlE,KAAK1C,MAEvB,GAAIqoE,IAAUC,EACZ,MAAO,CAAC,CAAChD,EAAc,IAAK94D,OAAO67D,EAAO,WAAa77D,OAAO87D,EAAO,2BAA6B,CAACR,GAAQ,CAACG,IAQ9G,IAyBJ,SAAuBM,EAAYC,GACjC,GAAID,EAAW7rE,SAAW8rE,EAAW9rE,OACnC,OAAO,EAGT,OAAO6rE,EAAW56D,OAAM,SAAU86D,GAChC,IAYeC,EAAQC,EAZnBC,EAAY,EAAKJ,GAAY,SAAUvxB,GACzC,OAAOA,EAASv0C,KAAK1C,QAAUyoE,EAAU/lE,KAAK1C,KAChD,IAEA,QAAK4oE,IAQUF,EAJED,EAAUzoE,MAIJ2oE,EAJWC,EAAU5oE,OAKvC,OAAM0oE,MAAY,OAAMC,GAJ/B,GACF,CAzCSE,CAJgD,QAAxCV,EAAmBL,EAAMtiE,iBAA4C,IAArB2iE,EAA8BA,EAAmB,GAEzD,QAAxCC,EAAmBH,EAAMziE,iBAA4C,IAArB4iE,EAA8BA,EAAmB,IAG5G,MAAO,CAAC,CAAC9C,EAAc,iCAAkC,CAACwC,GAAQ,CAACG,GAEvE,CAGA,IAAIa,EAAiB,OAATf,QAA0B,IAATA,OAAkB,EAASA,EAAK7oE,KACzD6pE,EAAiB,OAATb,QAA0B,IAATA,OAAkB,EAASA,EAAKhpE,KAE7D,GAAI4pE,GAASC,GAASC,GAAgBF,EAAOC,GAC3C,MAAO,CAAC,CAACzD,EAAc,kCAAmC94D,QAAO,EAAA+wC,EAAA,GAAQurB,GAAQ,WAAat8D,QAAO,EAAA+wC,EAAA,GAAQwrB,GAAQ,MAAQ,CAACjB,GAAQ,CAACG,IAMzI,IAAIgB,EAAgBnB,EAAMp6D,aACtBw7D,EAAgBjB,EAAMv6D,aAE1B,GAAIu7D,GAAiBC,EAAe,CAClC,IAAItD,EA5JR,SAA8Cx5D,EAASu5D,EAA8BF,EAAuBkB,EAAsBkB,EAAaoB,EAAejB,EAAakB,GACzK,IAAItD,EAAY,GAEZuD,EAAyBrD,GAA0B15D,EAASu5D,EAA8BkC,EAAaoB,GACvG3B,EAAY6B,EAAuB,GACnC5B,EAAiB4B,EAAuB,GAExCC,EAAyBtD,GAA0B15D,EAASu5D,EAA8BqC,EAAakB,GACvGpC,EAAYsC,EAAuB,GACnCrC,EAAiBqC,EAAuB,GAM5C,GAHApC,GAAwB56D,EAASw5D,EAAWD,EAA8BF,EAAuBkB,EAAsBW,EAAWR,GAGpG,IAA1BC,EAAerqE,OACjB,IAAK,IAAI0kD,EAAI,EAAGA,EAAI2lB,EAAerqE,OAAQ0kD,IACzCglB,GAAyCh6D,EAASw5D,EAAWD,EAA8BF,EAAuBkB,EAAsBW,EAAWP,EAAe3lB,IAMtK,GAA8B,IAA1BmmB,EAAe7qE,OACjB,IAAK,IAAI4I,EAAI,EAAGA,EAAIiiE,EAAe7qE,OAAQ4I,IACzC8gE,GAAyCh6D,EAASw5D,EAAWD,EAA8BF,EAAuBkB,EAAsBG,EAAWS,EAAejiE,IAOtK,IAAK,IAAI+jE,EAAM,EAAGA,EAAM9B,EAAe7qE,OAAQ2sE,IAC7C,IAAK,IAAIn2C,EAAK,EAAGA,EAAK6zC,EAAerqE,OAAQw2B,IAC3CmzC,GAAiCj6D,EAASw5D,EAAWD,EAA8BF,EAAuBkB,EAAsBY,EAAe8B,GAAMtC,EAAe7zC,IAIxK,OAAO0yC,CACT,CAqHoB0D,CAAqCl9D,EAASu5D,EAA8BF,EAAuBkB,EAAsBlhB,GAAaqjB,GAAQG,EAAexjB,GAAasjB,GAAQG,GAClM,OAiIJ,SAA2BtD,EAAWN,EAAcwC,EAAOG,GACzD,GAAIrC,EAAUlpE,OAAS,EACrB,MAAO,CAAC,CAAC4oE,EAAcM,EAAUzkE,KAAI,SAAU+tD,GAE7C,OADaA,EAAM,EAErB,KAAK0W,EAAU1qD,QAAO,SAAUquD,EAAWja,GACzC,IAAIkX,EAAUlX,EAAM,GACpB,OAAOia,EAAU/8D,OAAOg6D,EAC1B,GAAG,CAACsB,IAASlC,EAAU1qD,QAAO,SAAUquD,EAAW/Z,GACjD,IAAIiX,EAAUjX,EAAM,GACpB,OAAO+Z,EAAU/8D,OAAOi6D,EAC1B,GAAG,CAACwB,IAER,CA9IWuB,CAAkB5D,EAAWN,EAAcwC,EAAOG,EAC3D,CACF,CA2BA,SAASe,GAAgBF,EAAOC,GAC9B,OAAI5lB,GAAW2lB,IACN3lB,GAAW4lB,IAASC,GAAgBF,EAAMrkB,OAAQskB,EAAMtkB,UAG7DtB,GAAW4lB,KAIX3lB,GAAc0lB,IACT1lB,GAAc2lB,IAASC,GAAgBF,EAAMrkB,OAAQskB,EAAMtkB,UAGhErB,GAAc2lB,OAIdlkB,GAAWikB,KAAUjkB,GAAWkkB,KAC3BD,IAAUC,EAIrB,CAKA,SAASjD,GAA0B15D,EAASu5D,EAA8B/jD,EAAYlU,GACpF,IAAI2hC,EAASs2B,EAA6Bv+D,IAAIsG,GAE9C,IAAK2hC,EAAQ,CACX,IAAIo6B,EAAcxlE,OAAO3C,OAAO,MAC5BykE,EAAgB9hE,OAAO3C,OAAO,MAElCooE,GAA+Bt9D,EAASwV,EAAYlU,EAAc+7D,EAAa1D,GAE/E12B,EAAS,CAACo6B,EAAaxlE,OAAO+D,KAAK+9D,IACnCJ,EAA6Bp+D,IAAImG,EAAc2hC,EACjD,CAEA,OAAOA,CACT,CAIA,SAASw3B,GAAoCz6D,EAASu5D,EAA8Bn7D,GAElF,IAAI6kC,EAASs2B,EAA6Bv+D,IAAIoD,EAASkD,cAEvD,GAAI2hC,EACF,OAAOA,EAGT,IAAIs6B,EAAe3Q,GAAY5sD,EAAQmwD,YAAa/xD,EAASmU,eAC7D,OAAOmnD,GAA0B15D,EAASu5D,EAA8BgE,EAAcn/D,EAASkD,aACjG,CAEA,SAASg8D,GAA+Bt9D,EAASwV,EAAYlU,EAAc+7D,EAAa1D,GACtF,IAAK,IAAI6D,EAAM,EAAGC,EAAyBn8D,EAAaG,WAAY+7D,EAAMC,EAAuBntE,OAAQktE,IAAO,CAC9G,IAAIpxD,EAAYqxD,EAAuBD,GAEvC,OAAQpxD,EAAU7R,MAChB,KAAK,IAAKstC,MAEN,IAAIxkC,EAAY+I,EAAU9V,KAAK1C,MAC3B06D,OAAW,GAEX5X,EAAalhC,IAAemhC,EAAgBnhC,MAC9C84C,EAAW94C,EAAWulC,YAAY13C,IAGpC,IAAI61D,EAAe9sD,EAAUm7B,MAAQn7B,EAAUm7B,MAAM3zC,MAAQyP,EAExDg6D,EAAYnE,KACfmE,EAAYnE,GAAgB,IAG9BmE,EAAYnE,GAAcxsE,KAAK,CAAC8oB,EAAYpJ,EAAWkiD,IACvD,MAGJ,KAAK,IAAKhiD,gBACRqtD,EAAcvtD,EAAU9V,KAAK1C,QAAS,EACtC,MAEF,KAAK,IAAK6tD,gBAEN,IAAIlvC,EAAgBnG,EAAUmG,cAC1BmrD,EAAqBnrD,EAAgBq6C,GAAY5sD,EAAQmwD,YAAa59C,GAAiBiD,EAE3F8nD,GAA+Bt9D,EAAS09D,EAAoBtxD,EAAU9K,aAAc+7D,EAAa1D,GAKzG,CACF,CAwBA,IC5gBIgE,GD4gBArE,GAAuB,WACzB,SAASA,IACP9sE,KAAKoxE,MAAQ/lE,OAAO3C,OAAO,KAC7B,CAEA,IAAIolD,EAASgf,EAAQ9mE,UAqCrB,OAnCA8nD,EAAOr/C,IAAM,SAAalF,EAAGo+C,EAAGomB,GAC9B,IAAIjpC,EAAQ9kC,KAAKoxE,MAAM7nE,GACnB0C,EAAS64B,GAASA,EAAM6iB,GAE5B,YAAex+C,IAAX8C,KAOyB,IAAzB8hE,IACgB,IAAX9hE,EAIX,EAEA6hD,EAAOjlD,IAAM,SAAaU,EAAGo+C,EAAGomB,GAC9B/tE,KAAKqxE,YAAY9nE,EAAGo+C,EAAGomB,GAEvB/tE,KAAKqxE,YAAY1pB,EAAGp+C,EAAGwkE,EACzB,EAEAjgB,EAAOujB,YAAc,SAAqB9nE,EAAGo+C,EAAGomB,GAC9C,IAAIxlE,EAAMvI,KAAKoxE,MAAM7nE,GAEhBhB,IACHA,EAAM8C,OAAO3C,OAAO,MACpB1I,KAAKoxE,MAAM7nE,GAAKhB,GAGlBA,EAAIo/C,GAAKomB,CACX,EAEOjB,CACT,CA3C2B,GEpgBpB,SAASwE,GAA0B99D,GACxC,IAAI+9D,EAAiB,GACjBC,EAAanmE,OAAO3C,OAAO,MAC/B,MAAO,CACLiiE,YAAa,CACXj4C,MAAO,WACL6+C,EAAerxE,KAAKsxE,GACpBA,EAAanmE,OAAO3C,OAAO,KAC7B,EACA20C,MAAO,WACLm0B,EAAaD,EAAermD,KAC9B,GAEF2/C,YAAa,SAAqB17D,GAChC,IAAI0H,EAAY1H,EAAKrF,KAAK1C,MAEtBoqE,EAAW36D,GACbrD,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,4CAA6C3tC,OAAOiD,EAAW,MAAQ,CAAC26D,EAAW36D,GAAY1H,EAAKrF,QAEzI0nE,EAAW36D,GAAa1H,EAAKrF,IAEjC,EAEJ,CCxBO,SAAS2nE,GAAyBj+D,GACvC,IAAIqyC,EAAMT,EAAOssB,EAEbC,EAAYn+D,EAAQmwD,YACpBiO,EAAgZ,QAA9X/rB,EAAoQ,QAA5PT,EAA2G,QAAlGssB,EAAmC,OAAdC,QAAoC,IAAdA,OAAuB,EAASA,EAAU/jB,eAA4C,IAAvB8jB,EAAgCA,EAAmC,OAAdC,QAAoC,IAAdA,OAAuB,EAASA,EAAUtd,sBAAsC,IAAVjP,EAAmBA,EAAsB,OAAdusB,QAAoC,IAAdA,OAAuB,EAASA,EAAUrd,yBAAwC,IAATzO,EAAkBA,EAAqB,OAAd8rB,QAAoC,IAAdA,OAAuB,EAASA,EAAUpd,sBACjfsd,EAAyB,EAC7B,MAAO,CACLC,iBAAkB,SAA0B3iE,GACtCyiE,EACFp+D,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,wDAAyDpyC,KAI5F0iE,EAAyB,GAC3Br+D,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,2CAA4CpyC,MAGjF0iE,EACJ,EAEJ,CCpBO,SAASE,GAAyBv+D,GACvC,IAAIm+C,EAASn+C,EAAQmwD,YACjBqO,EAAwB3mE,OAAO3C,OAAO,MACtCupE,EAAyBtgB,EAAS,CACpCnmD,MAAOmmD,EAAO0C,eACd16B,SAAUg4B,EAAO2C,kBACjBxsD,aAAc6pD,EAAO4C,uBACnB,CAAC,EACL,MAAO,CACLud,iBAAkBI,EAClBC,gBAAiBD,GAGnB,SAASA,EAAoB/iE,GAM3B,IALA,IAAIijE,EAGAC,EAAuE,QAAhDD,EAAuBjjE,EAAKuuD,sBAAqD,IAAzB0U,EAAkCA,EAAuB,GAEnIxvB,EAAM,EAAGA,EAAMyvB,EAAoBvuE,OAAQ8+C,IAAO,CACzD,IAAI0vB,EAAgBD,EAAoBzvB,GACpC93C,EAAYwnE,EAAcxnE,UAC1BynE,EAA8BP,EAAsBlnE,GAEpDmnE,EAAuBnnE,GACzB0I,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,YAAY3tC,OAAO9I,EAAW,2DAA4DwnE,IACtHC,EACT/+D,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,yBAAyB3tC,OAAO9I,EAAW,oBAAqB,CAACynE,EAA6BD,KAEnIN,EAAsBlnE,GAAawnE,CAEvC,CAEA,OAAO,CACT,CACF,CCnCO,SAASE,GAAoBh/D,GAClC,IAAIi/D,EAAiBpnE,OAAO3C,OAAO,MAC/BipD,EAASn+C,EAAQmwD,YACrB,MAAO,CACL+O,qBAAsBC,EACtBC,qBAAsBD,EACtBE,wBAAyBF,EACzBG,oBAAqBH,EACrBI,mBAAoBJ,EACpBK,0BAA2BL,GAG7B,SAASA,EAAcxjE,GACrB,IAAI6gD,EAAW7gD,EAAKrF,KAAK1C,MAEzB,GAAe,OAAXuqD,QAA8B,IAAXA,IAAqBA,EAAOmF,QAAQ9G,GAW3D,OANIyiB,EAAeziB,GACjBx8C,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,qCAAsC3tC,OAAOo8C,EAAU,MAAQ,CAACyiB,EAAeziB,GAAW7gD,EAAKrF,QAEpI2oE,EAAeziB,GAAY7gD,EAAKrF,MAG3B,EAVL0J,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,SAAU3tC,OAAOo8C,EAAU,sFAAwF7gD,EAAKrF,MAWjK,CACF,CC3BO,SAASmpE,GAAyBz/D,GACvC,IAAIm+C,EAASn+C,EAAQmwD,YACjBuP,EAAkBvhB,EAASA,EAAOyC,aAAe/oD,OAAO3C,OAAO,MAC/DyqE,EAAkB9nE,OAAO3C,OAAO,MACpC,MAAO,CACLqqE,mBAAoBK,EACpBC,kBAAmBD,GAGrB,SAASA,EAAqBjkE,GAC5B,IAAImkE,EAEAtjB,EAAW7gD,EAAKrF,KAAK1C,MAEpB+rE,EAAgBnjB,KACnBmjB,EAAgBnjB,GAAY3kD,OAAO3C,OAAO,OAO5C,IAHA,IAAI6qE,EAA8C,QAAhCD,EAAenkE,EAAKiR,cAAqC,IAAjBkzD,EAA0BA,EAAe,GAC/FE,EAAaL,EAAgBnjB,GAExBpN,EAAM,EAAGA,EAAM2wB,EAAWzvE,OAAQ8+C,IAAO,CAChD,IAAI6wB,EAAWF,EAAW3wB,GACtBuN,EAAYsjB,EAAS3pE,KAAK1C,MAC1BssE,EAAeR,EAAgBljB,GAE/B3F,EAAWqpB,IAAiBA,EAAahlD,SAASyhC,GACpD38C,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,eAAgB3tC,OAAOo8C,EAAU,KAAKp8C,OAAOu8C,EAAW,qFAAuFsjB,EAAS3pE,OACpL0pE,EAAWrjB,GACpB38C,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,eAAgB3tC,OAAOo8C,EAAU,KAAKp8C,OAAOu8C,EAAW,+BAAiC,CAACqjB,EAAWrjB,GAAYsjB,EAAS3pE,QAE/J0pE,EAAWrjB,GAAasjB,EAAS3pE,IAErC,CAEA,OAAO,CACT,CACF,CCtCO,SAAS6pE,GAA+BngE,GAC7C,IAAIm+C,EAASn+C,EAAQmwD,YACjBuP,EAAkBvhB,EAASA,EAAOyC,aAAe/oD,OAAO3C,OAAO,MAC/DkrE,EAAkBvoE,OAAO3C,OAAO,MACpC,MAAO,CACLsqE,0BAA2Ba,EAC3BC,yBAA0BD,EAC1BhB,wBAAyBgB,EACzBE,uBAAwBF,EACxBjB,qBAAsBiB,EACtBG,oBAAqBH,GAGvB,SAASA,EAAqB1kE,GAC5B,IAAI8kE,EAEAjkB,EAAW7gD,EAAKrF,KAAK1C,MAEpBwsE,EAAgB5jB,KACnB4jB,EAAgB5jB,GAAY3kD,OAAO3C,OAAO,OAO5C,IAHA,IAAImrD,EAA8C,QAAhCogB,EAAe9kE,EAAK4I,cAAqC,IAAjBk8D,EAA0BA,EAAe,GAC/FC,EAAaN,EAAgB5jB,GAExBpN,EAAM,EAAGA,EAAMiR,EAAW/vD,OAAQ8+C,IAAO,CAChD,IAAIkf,EAAWjO,EAAWjR,GACtB/rC,EAAYirD,EAASh4D,KAAK1C,MAE1B+sE,GAASjB,EAAgBljB,GAAWn5C,GACtCrD,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,UAAW3tC,OAAOo8C,EAAU,KAAKp8C,OAAOiD,EAAW,qFAAuFirD,EAASh4D,OAC/KoqE,EAAWr9D,GACpBrD,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,UAAW3tC,OAAOo8C,EAAU,KAAKp8C,OAAOiD,EAAW,+BAAiC,CAACq9D,EAAWr9D,GAAYirD,EAASh4D,QAE1JoqE,EAAWr9D,GAAairD,EAASh4D,IAErC,CAEA,OAAO,CACT,CACF,CAEA,SAASqqE,GAAS7tE,EAAMuQ,GACtB,SAAIqzC,EAAa5jD,IAAS6jD,EAAgB7jD,IAASgkD,GAAkBhkD,KAC7B,MAA/BA,EAAKioD,YAAY13C,EAI5B,CClDO,SAASu9D,GAAyB5gE,GACvC,IAAI6gE,EAAsBhpE,OAAO3C,OAAO,MACpCipD,EAASn+C,EAAQmwD,YACrB,MAAO,CACL2Q,oBAAqB,SAA6BnlE,GAChD,IAAIgoC,EAAgBhoC,EAAKrF,KAAK1C,MAE9B,GAAe,OAAXuqD,QAA8B,IAAXA,IAAqBA,EAAO8I,aAAatjB,GAWhE,OANIk9B,EAAoBl9B,GACtB3jC,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,2CAA4C3tC,OAAOujC,EAAe,MAAQ,CAACk9B,EAAoBl9B,GAAgBhoC,EAAKrF,QAEzJuqE,EAAoBl9B,GAAiBhoC,EAAKrF,MAGrC,EAVL0J,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,eAAgB3tC,OAAOujC,EAAe,2DAA6DhoC,EAAKrF,MAWjJ,EAEJ,CP1BA,SAAS,GAAgBwP,EAAKnS,EAAKC,GAAiK,OAApJD,KAAOmS,EAAOjO,OAAOm3B,eAAelpB,EAAKnS,EAAK,CAAEC,MAAOA,EAAOq7B,YAAY,EAAMC,cAAc,EAAMod,UAAU,IAAkBxmC,EAAInS,GAAOC,EAAgBkS,CAAK,CAgBzM,SAASi7D,GAA2B/gE,GAIzC,IAHA,IAAIm+C,EAASn+C,EAAQmwD,YACjBE,EAAex4D,OAAO3C,OAAO,MAExBk6C,EAAM,EAAGkhB,EAAyBtwD,EAAQuwD,cAAcn2D,YAAag1C,EAAMkhB,EAAuBhgE,OAAQ8+C,IAAO,CACxH,IAAIntC,EAAMquD,EAAuBlhB,IAE7B,SAAqBntC,KACvBouD,EAAapuD,EAAI3L,KAAK1C,OAASqO,EAEnC,CAEA,MAAO,CACL++D,oBAAqBC,EACrBT,oBAAqBS,EACrBV,uBAAwBU,EACxBC,mBAAoBD,EACpBpB,kBAAmBoB,EACnBX,yBAA0BW,GAG5B,SAASA,EAAetlE,GACtB,IAGIwlE,EAHA3kB,EAAW7gD,EAAKrF,KAAK1C,MACrBwtE,EAAU/Q,EAAa7T,GACvB0jB,EAA0B,OAAX/hB,QAA8B,IAAXA,OAAoB,EAASA,EAAOmF,QAAQ9G,GASlF,GANI4kB,EACFD,EAAeE,GAAiBD,EAAQ7mE,MAC/B2lE,IACTiB,EAsBN,SAAuBruE,GACrB,GAAI2jD,EAAa3jD,GACf,OAAO,IAAKkiE,sBAGd,GAAIte,EAAa5jD,GACf,OAAO,IAAKoiE,sBAGd,GAAIve,EAAgB7jD,GAClB,OAAO,IAAKsiE,yBAGd,GAAIxe,EAAY9jD,GACd,OAAO,IAAKwiE,qBAGd,GAAIze,EAAW/jD,GACb,OAAO,IAAK0iE,oBAId,GAAI1e,GAAkBhkD,GACpB,OAAO,IAAK6iE,6BAIL,EAAArf,EAAA,GAAU,EAAG,qBAAsB,EAAAnF,EAAA,GAAQr+C,GACtD,CAlDqBwuE,CAAcpB,IAG3BiB,GACF,GAAIA,IAAiBxlE,EAAKpB,KAAM,CAC9B,IAAIgnE,EA+CZ,SAAiChnE,GAC/B,OAAQA,GACN,KAAK,IAAKy6D,sBACR,MAAO,SAET,KAAK,IAAKE,sBACR,MAAO,SAET,KAAK,IAAKE,yBACR,MAAO,YAET,KAAK,IAAKE,qBACR,MAAO,QAET,KAAK,IAAKE,oBACR,MAAO,OAET,KAAK,IAAKG,4BACR,MAAO,gBAIF,EAAArf,EAAA,GAAU,EAAG,qBAAsB,EAAAnF,EAAA,GAAQ52C,GACtD,CAtEsBinE,CAAwB7lE,EAAKpB,MAC3CyF,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,qBAAqB3tC,OAAOmhE,EAAS,WAAYnhE,OAAOo8C,EAAU,MAAQ4kB,EAAU,CAACA,EAASzlE,GAAQA,GAC7I,MACK,CACL,IAAI8lE,EAAe5pE,OAAO+D,KAAKy0D,GAE3BlS,IACFsjB,EAAeA,EAAarhE,OAAOvI,OAAO+D,KAAKuiD,EAAOyC,gBAGxD,IAAIoQ,EAAiBvd,EAAe+I,EAAUilB,GAC9CzhE,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,uBAAwB3tC,OAAOo8C,EAAU,gCAAmCtK,EAAW8e,GAAiBr1D,EAAKrF,MACpJ,CACF,CACF,CACA,IAAI+qE,IAA4C,GAAxB1D,GAAoB,CAAC,EAAsC,IAAK5I,uBAAwB,IAAKC,uBAAwB,GAAgB2I,GAAmB,IAAK1I,uBAAwB,IAAKC,uBAAwB,GAAgByI,GAAmB,IAAKxI,0BAA2B,IAAKC,0BAA2B,GAAgBuI,GAAmB,IAAKtI,sBAAuB,IAAKC,sBAAuB,GAAgBqI,GAAmB,IAAKpI,qBAAsB,IAAKC,qBAAsB,GAAgBmI,GAAmB,IAAKjI,6BAA8B,IAAKC,6BAA8BgI,IQDnmB,IAAI+D,GAAiB7pE,OAAOgS,OAAO,CAAC2lD,GAA2BM,GAA0BE,GAA4BC,GAA8BC,GAAoBe,GAA+BE,GAA4BC,GAAiBG,GAAyBU,GAAyBE,GAAwBE,GAAuBO,GAA6BM,GAAsBU,GAAyBE,GAA0BI,GAAuBK,GAAqBuB,GAAiCO,GAAwBS,GAAyBE,GAAyBc,GAA+BY,GAAgCU,GAAkC0E,KAK9qB6D,GAAoB9pE,OAAOgS,OAAO,CAACo0D,GAA0BM,GAA0BS,GAAqBS,GAA0BU,GAAgCS,GAA0B1Q,GAAoBqE,GAAqBuB,GAAiCiL,GAA4BzK,GAAoCQ,GAAyBgH,GAA2B/F,KCxEzY,SAAS6J,GAAe3zB,EAAUC,GAAcD,EAASz7C,UAAYqF,OAAO3C,OAAOg5C,EAAW17C,WAAYy7C,EAASz7C,UAAUvF,YAAcghD,EAAUA,EAASruC,UAAYsuC,CAAY,CAW/K,IAAI2zB,GAAoC,WAC7C,SAASA,EAAqB5nE,EAAK85B,GACjCvnC,KAAKs1E,KAAO7nE,EACZzN,KAAKu1E,gBAAapsE,EAClBnJ,KAAKw1E,iBAAmB,IAAIvoE,IAC5BjN,KAAKy1E,gCAAkC,IAAIxoE,IAC3CjN,KAAK01E,SAAWnuC,CAClB,CAEA,IAAIumB,EAASunB,EAAqBrvE,UAsFlC,OApFA8nD,EAAOllB,YAAc,SAAqB1jC,GACxClF,KAAK01E,SAASxwE,EAChB,EAEA4oD,EAAOiW,YAAc,WACnB,OAAO/jE,KAAKs1E,IACd,EAEAxnB,EAAO8X,YAAc,SAAqB97D,GACxC,IAAIwL,EAAYtV,KAAKu1E,WAYrB,OAVKjgE,IACHtV,KAAKu1E,WAAajgE,EAAYtV,KAAK+jE,cAAcn2D,YAAY0U,QAAO,SAAUqzD,EAAOC,GAKnF,OAJIA,EAAU7nE,OAAS,IAAKuuC,sBAC1Bq5B,EAAMC,EAAU9rE,KAAK1C,OAASwuE,GAGzBD,CACT,GAAGtqE,OAAO3C,OAAO,QAGZ4M,EAAUxL,EACnB,EAEAgkD,EAAOiZ,mBAAqB,SAA4B53D,GACtD,IAAI0mE,EAAU71E,KAAKw1E,iBAAiBhnE,IAAIW,GAExC,IAAK0mE,EAAS,CACZA,EAAU,GAGV,IAFA,IAAIC,EAAc,CAAC3mE,GAEW,IAAvB2mE,EAAYhyE,QAGjB,IAFA,IAES8+C,EAAM,EAAGmzB,EAFRD,EAAY5qD,MAEmBjW,WAAY2tC,EAAMmzB,EAAiBjyE,OAAQ8+C,IAAO,CACzF,IAAIhjC,EAAYm2D,EAAiBnzB,GAE7BhjC,EAAU7R,OAAS,IAAK+R,gBAC1B+1D,EAAQ31E,KAAK0f,GACJA,EAAU9K,cACnBghE,EAAY51E,KAAK0f,EAAU9K,aAE/B,CAGF9U,KAAKw1E,iBAAiB7mE,IAAIQ,EAAM0mE,EAClC,CAEA,OAAOA,CACT,EAEA/nB,EAAOoY,kCAAoC,SAA2Cp7D,GACpF,IAAIwK,EAAYtV,KAAKy1E,gCAAgCjnE,IAAI1D,GAEzD,IAAKwK,EAAW,CACdA,EAAY,GAIZ,IAHA,IAAI0gE,EAAiB3qE,OAAO3C,OAAO,MAC/ButE,EAAe,CAACnrE,EAAUgK,cAEC,IAAxBmhE,EAAanyE,QAGlB,IAFA,IAAIqL,EAAO8mE,EAAa/qD,MAEfu4B,EAAM,EAAGyyB,EAAyBl2E,KAAK+mE,mBAAmB53D,GAAOs0C,EAAMyyB,EAAuBpyE,OAAQ2/C,IAAO,CACpH,IACI0iB,EADS+P,EAAuBzyB,GACd35C,KAAK1C,MAE3B,IAAiC,IAA7B4uE,EAAe7P,GAAoB,CACrC6P,EAAe7P,IAAY,EAC3B,IAAIv0D,EAAW5R,KAAK4lE,YAAYO,GAE5Bv0D,IACF0D,EAAUpV,KAAK0R,GACfqkE,EAAa/1E,KAAK0R,EAASkD,cAE/B,CACF,CAGF9U,KAAKy1E,gCAAgC9mE,IAAI7D,EAAWwK,EACtD,CAEA,OAAOA,CACT,EAEO+/D,CACT,CAhG+C,GAiGpCc,GAAoC,SAAUC,GAGvD,SAASD,EAAqB1oE,EAAKkkD,EAAQpqB,GACzC,IAAI72B,EAIJ,OAFAA,EAAQ0lE,EAAsB5wE,KAAKxF,KAAMyN,EAAK85B,IAAYvnC,MACpD4gE,QAAUjP,EACTjhD,CACT,CAQA,OAhBA0kE,GAAee,EAAsBC,GAUvBD,EAAqBnwE,UAE3B29D,UAAY,WAClB,OAAO3jE,KAAK4gE,OACd,EAEOuV,CACT,CAlB+C,CAkB7Cd,IACSgB,GAAiC,SAAUC,GAGpD,SAASD,EAAkB1kB,EAAQlkD,EAAKq1D,EAAUv7B,GAChD,IAAIgvC,EAOJ,OALAA,EAASD,EAAuB9wE,KAAKxF,KAAMyN,EAAK85B,IAAYvnC,MACrD4gE,QAAUjP,EACjB4kB,EAAOC,UAAY1T,EACnByT,EAAOE,gBAAkB,IAAIxpE,IAC7BspE,EAAOG,yBAA2B,IAAIzpE,IAC/BspE,CACT,CAXAnB,GAAeiB,EAAmBC,GAalC,IAAI9mB,EAAU6mB,EAAkBrwE,UAiFhC,OA/EAwpD,EAAQmU,UAAY,WAClB,OAAO3jE,KAAK4gE,OACd,EAEApR,EAAQmnB,kBAAoB,SAA2BxnE,GACrD,IAAIq4D,EAASxnE,KAAKy2E,gBAAgBjoE,IAAIW,GAEtC,IAAKq4D,EAAQ,CACX,IAAIoP,EAAY,GACZ9T,EAAW,IAAIrC,GAASzgE,KAAK4gE,UACjC,QAAMzxD,EAAM0zD,GAAkBC,EAAU,CACtC7lB,mBAAoB,WAClB,OAAO,CACT,EACA1I,SAAU,SAAkB7N,GAC1BkwC,EAAU12E,KAAK,CACbiP,KAAMu3B,EACNpgC,KAAMw8D,EAAStB,eACf1oB,aAAcgqB,EAASpB,mBAE3B,KAEF8F,EAASoP,EAET52E,KAAKy2E,gBAAgB9nE,IAAIQ,EAAMq4D,EACjC,CAEA,OAAOA,CACT,EAEAhY,EAAQiY,2BAA6B,SAAoC38D,GACvE,IAAI08D,EAASxnE,KAAK02E,yBAAyBloE,IAAI1D,GAE/C,IAAK08D,EAAQ,CACXA,EAASxnE,KAAK22E,kBAAkB7rE,GAEhC,IAAK,IAAI64C,EAAM,EAAGkzB,EAAyB72E,KAAKkmE,kCAAkCp7D,GAAY64C,EAAMkzB,EAAuB/yE,OAAQ6/C,IAAO,CACxI,IAAI6iB,EAAOqQ,EAAuBlzB,GAClC6jB,EAASA,EAAO5zD,OAAO5T,KAAK22E,kBAAkBnQ,GAChD,CAEAxmE,KAAK02E,yBAAyB/nE,IAAI7D,EAAW08D,EAC/C,CAEA,OAAOA,CACT,EAEAhY,EAAQsH,QAAU,WAChB,OAAO92D,KAAKw2E,UAAU1f,SACxB,EAEAtH,EAAQ+R,cAAgB,WACtB,OAAOvhE,KAAKw2E,UAAUjV,eACxB,EAEA/R,EAAQgS,aAAe,WACrB,OAAOxhE,KAAKw2E,UAAUhV,cACxB,EAEAhS,EAAQiS,mBAAqB,WAC3B,OAAOzhE,KAAKw2E,UAAU/U,oBACxB,EAEAjS,EAAQ8R,YAAc,WACpB,OAAOthE,KAAKw2E,UAAUlV,aACxB,EAEA9R,EAAQiL,aAAe,WACrB,OAAOz6D,KAAKw2E,UAAU/b,cACxB,EAEAjL,EAAQmS,YAAc,WACpB,OAAO3hE,KAAKw2E,UAAU7U,aACxB,EAEAnS,EAAQoS,aAAe,WACrB,OAAO5hE,KAAKw2E,UAAU5U,cACxB,EAEOyU,CACT,CAhG4C,CAgG1ChB,ICvMK,SAASyB,GAASnlB,EAAQolB,GAC/B,IAAIC,EAAQpqE,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,GAAmBA,UAAU,GAAKsoE,GAC5EpS,EAAWl2D,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,GAAmBA,UAAU,GAAK,IAAI6zD,GAAS9O,GAC5FnnD,EAAUoC,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,GAAmBA,UAAU,GAAK,CAChFqqE,eAAW9tE,GAEb4tE,IAAe,EAAAhyB,EAAA,GAAU,EAAG,0BAE5BsY,GAAkB1L,GAClB,IAAIulB,EAAW7rE,OAAOgS,OAAO,CAAC,GAC1BnR,EAAS,GACTsH,EAAU,IAAI6iE,GAAkB1kB,EAAQolB,EAAajU,GAAU,SAAU59D,GAC3E,GAAyB,MAArBsF,EAAQysE,WAAqB/qE,EAAOpI,QAAU0G,EAAQysE,UAExD,MADA/qE,EAAOhM,KAAK,IAAIqhD,EAAA,EAAa,yEACvB21B,EAGRhrE,EAAOhM,KAAKgF,EACd,IAGI69D,GAAU,QAAgBiU,EAAMzuE,KAAI,SAAU4uE,GAChD,OAAOA,EAAK3jE,EACd,KAEA,KACE,QAAMujE,EAAalU,GAAkBC,EAAUC,GACjD,CAAE,MAAOn5C,GACP,GAAIA,IAAMstD,EACR,MAAMttD,CAEV,CAEA,OAAO1d,CACT,CAKO,SAASkrE,GAAYL,EAAaM,GACvC,IAAIL,EAAQpqE,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,GAAmBA,UAAU,GAAKuoE,GAC5EjpE,EAAS,GACTsH,EAAU,IAAI2iE,GAAqBY,EAAaM,GAAgB,SAAUnyE,GAC5EgH,EAAOhM,KAAKgF,EACd,IACIoyE,EAAWN,EAAMzuE,KAAI,SAAU4uE,GACjC,OAAOA,EAAK3jE,EACd,IAEA,OADA,QAAMujE,GAAa,QAAgBO,IAC5BprE,CACT,CCvEO,SAASqrE,GAAQC,EAAMrwE,EAAK6R,GACjC,MAAO,CACLw+D,KAAMA,EACNrwE,IAAKA,EACL6R,SAAUA,EAEd,CAKO,SAASy+D,GAAYxkE,GAI1B,IAHA,IAAIykE,EAAY,GACZC,EAAO1kE,EAEJ0kE,GACLD,EAAUx3E,KAAKy3E,EAAKxwE,KACpBwwE,EAAOA,EAAKH,KAGd,OAAOE,EAAUE,SACnB,CCnBO,SAASC,GAAqBlmB,EAAQ7mD,GAC3C,GAA4B,UAAxBA,EAAUA,UAAuB,CACnC,IAAIuZ,EAAYstC,EAAO0C,eAEvB,IAAKhwC,EACH,MAAM,IAAIk9B,EAAA,EAAa,uDAAwDz2C,GAGjF,OAAOuZ,CACT,CAEA,GAA4B,aAAxBvZ,EAAUA,UAA0B,CACtC,IAAIwZ,EAAeqtC,EAAO2C,kBAE1B,IAAKhwC,EACH,MAAM,IAAIi9B,EAAA,EAAa,0CAA2Cz2C,GAGpE,OAAOwZ,CACT,CAEA,GAA4B,iBAAxBxZ,EAAUA,UAA8B,CAC1C,IAAIyZ,EAAmBotC,EAAO4C,sBAE9B,IAAKhwC,EACH,MAAM,IAAIg9B,EAAA,EAAa,8CAA+Cz2C,GAGxE,OAAOyZ,CACT,CAEA,MAAM,IAAIg9B,EAAA,EAAa,6DAA8Dz2C,EACvF,CClCe,SAASgtE,GAAe7kE,GACrC,OAAOA,EAAK1K,KAAI,SAAUpB,GACxB,MAAsB,kBAARA,EAAmB,IAAMA,EAAIiE,WAAa,IAAM,IAAMjE,CACtE,IAAGia,KAAK,GACV,CCoBO,SAAS22D,GAAa7uB,EAAW5iD,EAAMoF,GAC5C,GAAKw9C,EAAL,CAMA,GAAIA,EAAUn7C,OAAS,IAAK87C,SAAU,CACpC,IAAIjoC,EAAesnC,EAAUp/C,KAAK1C,MAElC,GAAiB,MAAbsE,QAAiDvC,IAA5BuC,EAAUkW,GAEjC,OAGF,IAAIg4B,EAAgBluC,EAAUkW,GAE9B,GAAsB,OAAlBg4B,GAA0B4Q,GAAclkD,GAC1C,OAMF,OAAOszC,CACT,CAEA,GAAI4Q,GAAclkD,GAAO,CACvB,GAAI4iD,EAAUn7C,OAAS,IAAKo7C,KAC1B,OAGF,OAAO4uB,GAAa7uB,EAAW5iD,EAAKulD,OAAQngD,EAC9C,CAEA,GAAIw9C,EAAUn7C,OAAS,IAAKo7C,KAE1B,OAAO,KAGT,GAAIoB,GAAWjkD,GAAO,CACpB,IAAImtD,EAAWntD,EAAKulD,OAEpB,GAAI3C,EAAUn7C,OAAS,IAAK47C,KAAM,CAGhC,IAFA,IAAIquB,EAAgB,GAEXp1B,EAAM,EAAGq1B,EAAqB/uB,EAAU9oC,OAAQwiC,EAAMq1B,EAAmBn0E,OAAQ8+C,IAAO,CAC/F,IAAIgR,EAAWqkB,EAAmBr1B,GAElC,GAAIs1B,GAAkBtkB,EAAUloD,GAAY,CAG1C,GAAI8+C,GAAciJ,GAChB,OAGFukB,EAAc93E,KAAK,KACrB,KAAO,CACL,IAAIi4E,EAAYJ,GAAankB,EAAUH,EAAU/nD,GAEjD,QAAkBvC,IAAdgvE,EACF,OAGFH,EAAc93E,KAAKi4E,EACrB,CACF,CAEA,OAAOH,CACT,CAEA,IAAIplB,EAAemlB,GAAa7uB,EAAWuK,EAAU/nD,GAErD,QAAqBvC,IAAjBypD,EACF,OAGF,MAAO,CAACA,EACV,CAEA,GAAItI,GAAkBhkD,GAAO,CAC3B,GAAI4iD,EAAUn7C,OAAS,IAAK67C,OAC1B,OAQF,IALA,IAAIwuB,EAAa/sE,OAAO3C,OAAO,MAC3BmrD,EAAa5O,EAAOiE,EAAUnxC,QAAQ,SAAU7C,GAClD,OAAOA,EAAMpL,KAAK1C,KACpB,IAESq8C,EAAM,EAAGqQ,EAAiB,EAAaxtD,EAAKioD,aAAc9K,EAAMqQ,EAAehwD,OAAQ2/C,IAAO,CACrG,IAAIvuC,EAAQ4+C,EAAerQ,GACvBmf,EAAY/O,EAAW3+C,EAAMpL,MAEjC,GAAK84D,IAAasV,GAAkBtV,EAAUx7D,MAAOsE,GAArD,CAUA,IAAI6M,EAAaw/D,GAAanV,EAAUx7D,MAAO8N,EAAM5O,KAAMoF,GAE3D,QAAmBvC,IAAfoP,EACF,OAGF6/D,EAAWljE,EAAMpL,MAAQyO,CARzB,MAPE,QAA2BpP,IAAvB+L,EAAM4jC,aACRs/B,EAAWljE,EAAMpL,MAAQoL,EAAM4jC,kBAC1B,GAAI0R,GAAct1C,EAAM5O,MAC7B,MAaN,CAEA,OAAO8xE,CACT,CAGA,GAAInsB,GAAW3lD,GAAO,CAIpB,IAAI2F,EAEJ,IACEA,EAAS3F,EAAKqnD,aAAazE,EAAWx9C,EACxC,CAAE,MAAO2sE,GACP,MACF,CAEA,QAAelvE,IAAX8C,EACF,OAGF,OAAOA,CACT,EAGS,EAAA69C,EAAA,GAAU,EAAG,2BAA4B,EAAAnF,EAAA,GAAQr+C,GApI1D,CAqIF,CAGA,SAAS4xE,GAAkBhvB,EAAWx9C,GACpC,OAAOw9C,EAAUn7C,OAAS,IAAK87C,WAA0B,MAAbn+C,QAAyDvC,IAApCuC,EAAUw9C,EAAUp/C,KAAK1C,OAC5F,CC3JO,SAASkxE,GAAiB3nB,EAAYrqD,GAE3C,OAAOiyE,GAAqB5nB,EAAYrqD,EAD1BsG,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,GAAmBA,UAAU,GAAK4rE,GAEpF,CAEA,SAASA,GAAevlE,EAAMwlE,EAAcvzE,GAC1C,IAAIwzE,EAAc,kBAAmB,EAAA/zB,EAAA,GAAQ8zB,GAO7C,MALIxlE,EAAKnP,OAAS,IAChB40E,GAAe,aAAc9kE,OAAOkkE,GAAe7kE,GAAO,MAG5D/N,EAAMe,QAAUyyE,EAAc,KAAOxzE,EAAMe,QACrCf,CACR,CAEA,SAASqzE,GAAqB5nB,EAAYrqD,EAAMihC,EAASt0B,GACvD,GAAIu3C,GAAclkD,GAChB,OAAkB,MAAdqqD,EACK4nB,GAAqB5nB,EAAYrqD,EAAKulD,OAAQtkB,EAASt0B,QAGhEs0B,EAAQkwC,GAAYxkE,GAAO09C,EAAY,IAAIpP,EAAA,EAAa,+BAAgC3tC,QAAO,EAAA+wC,EAAA,GAAQr+C,GAAO,uBAIhH,GAAkB,MAAdqqD,EAEF,OAAO,KAGT,GAAIpG,GAAWjkD,GAAO,CACpB,IAAImtD,EAAWntD,EAAKulD,OAChB8sB,EAAcrmB,GAAc3B,GAAY,SAAUwnB,EAAWjtC,GAC/D,IAAI0tC,EAAWrB,GAAQtkE,EAAMi4B,OAAO/hC,GACpC,OAAOovE,GAAqBJ,EAAW1kB,EAAUlsB,EAASqxC,EAC5D,IAEA,OAAmB,MAAfD,EACKA,EAIF,CAACJ,GAAqB5nB,EAAY8C,EAAUlsB,EAASt0B,GAC9D,CAEA,GAAIq3C,GAAkBhkD,GAAO,CAC3B,KAAK,EAAA8oD,EAAA,GAAauB,GAEhB,YADAppB,EAAQkwC,GAAYxkE,GAAO09C,EAAY,IAAIpP,EAAA,EAAa,kBAAmB3tC,OAAOtN,EAAKwD,KAAM,wBAO/F,IAHA,IAAI8oD,EAAe,CAAC,EAChBimB,EAAYvyE,EAAKioD,YAEZ3L,EAAM,EAAGkR,EAAiB,EAAa+kB,GAAYj2B,EAAMkR,EAAehwD,OAAQ8+C,IAAO,CAC9F,IAAI1tC,EAAQ4+C,EAAelR,GACvBrqC,EAAao4C,EAAWz7C,EAAMpL,MAElC,QAAmBX,IAAfoP,EAWJq6C,EAAa19C,EAAMpL,MAAQyuE,GAAqBhgE,EAAYrD,EAAM5O,KAAMihC,EAASgwC,GAAQtkE,EAAMiC,EAAMpL,KAAMxD,EAAKwD,YAV9G,QAA2BX,IAAvB+L,EAAM4jC,aACR8Z,EAAa19C,EAAMpL,MAAQoL,EAAM4jC,kBAC5B,GAAI0R,GAAct1C,EAAM5O,MAAO,CACpC,IAAIo+D,GAAU,EAAA/f,EAAA,GAAQzvC,EAAM5O,MAC5BihC,EAAQkwC,GAAYxkE,GAAO09C,EAAY,IAAIpP,EAAA,EAAa,UAAW3tC,OAAOsB,EAAMpL,KAAM,wBAA0B8J,OAAO8wD,EAAS,wBAClI,CAMJ,CAGA,IAAK,IAAIjhB,EAAM,EAAGwoB,EAAgB5gE,OAAO+D,KAAKuhD,GAAalN,EAAMwoB,EAAcnoE,OAAQ2/C,IAAO,CAC5F,IAAI5sC,EAAYo1D,EAAcxoB,GAE9B,IAAKo1B,EAAUhiE,GAAY,CACzB,IAAIkvC,EAAckB,EAAepwC,EAAWxL,OAAO+D,KAAK9I,EAAKioD,cAC7DhnB,EAAQkwC,GAAYxkE,GAAO09C,EAAY,IAAIpP,EAAA,EAAa,UAAW3tC,OAAOiD,EAAW,8BAAgCjD,OAAOtN,EAAKwD,KAAM,MAAS47C,EAAWK,IAC7J,CACF,CAEA,OAAO6M,CACT,CAGA,GAAI3G,GAAW3lD,GAAO,CACpB,IAAIwyE,EAIJ,IACEA,EAAcxyE,EAAKknD,WAAWmD,EAChC,CAAE,MAAOzrD,GAOP,YANIA,aAAiBq8C,EAAA,EACnBha,EAAQkwC,GAAYxkE,GAAO09C,EAAYzrD,GAEvCqiC,EAAQkwC,GAAYxkE,GAAO09C,EAAY,IAAIpP,EAAA,EAAa,kBAAmB3tC,OAAOtN,EAAKwD,KAAM,OAAU5E,EAAMe,aAASkD,OAAWA,OAAWA,OAAWA,EAAWjE,IAItK,CAMA,YAJoBiE,IAAhB2vE,GACFvxC,EAAQkwC,GAAYxkE,GAAO09C,EAAY,IAAIpP,EAAA,EAAa,kBAAmB3tC,OAAOtN,EAAKwD,KAAM,QAGxFgvE,CACT,EAGS,EAAAhvB,EAAA,GAAU,EAAG,2BAA4B,EAAAnF,EAAA,GAAQr+C,GAC5D,CCzGO,SAASyyE,GAAkBpnB,EAAQqnB,EAAaC,EAAQzuE,GAC7D,IAAI0B,EAAS,GACT+qE,EAAwB,OAAZzsE,QAAgC,IAAZA,OAAqB,EAASA,EAAQysE,UAE1E,IACE,IAAIiC,EAsBR,SAA8BvnB,EAAQqnB,EAAaC,EAAQ1xC,GAgDzD,IA/CA,IAAIywC,EAAgB,CAAC,EAEjBvZ,EAAQ,SAAe7b,GACzB,IAAIu2B,EAAaH,EAAYp2B,GACzBlF,EAAUy7B,EAAWzyC,SAAS58B,KAAK1C,MACnCglE,EAAUhM,GAAYzO,EAAQwnB,EAAW7yE,MAE7C,IAAKqlD,GAAYygB,GAAU,CAGzB,IAAIE,GAAa,OAAM6M,EAAW7yE,MAElC,OADAihC,EAAQ,IAAIga,EAAA,EAAa,cAAe3tC,OAAO8pC,EAAS,8BAAgC9pC,OAAO04D,EAAY,4CAA8C6M,EAAW7yE,OAC7J,UACT,CAEA,IAAK,GAAe2yE,EAAQv7B,GAAU,CACpC,GAAIy7B,EAAWrgC,aACbk/B,EAAct6B,GAAWq6B,GAAaoB,EAAWrgC,aAAcszB,QAC1D,GAAI5hB,GAAc4hB,GAAU,CACjC,IAAIgN,GAAc,EAAAz0B,EAAA,GAAQynB,GAE1B7kC,EAAQ,IAAIga,EAAA,EAAa,cAAe3tC,OAAO8pC,EAAS,wBAA0B9pC,OAAOwlE,EAAa,uBAAyBD,GACjI,CAEA,MAAO,UACT,CAEA,IAAI/xE,EAAQ6xE,EAAOv7B,GAEnB,GAAc,OAAVt2C,GAAkBojD,GAAc4hB,GAAU,CAC5C,IAAIiN,GAAe,EAAA10B,EAAA,GAAQynB,GAG3B,OADA7kC,EAAQ,IAAIga,EAAA,EAAa,cAAe3tC,OAAO8pC,EAAS,wBAA0B9pC,OAAOylE,EAAc,uBAAyBF,IACzH,UACT,CAEAnB,EAAct6B,GAAW46B,GAAiBlxE,EAAOglE,GAAS,SAAUn5D,EAAMwlE,EAAcvzE,GACtF,IAAIo0E,EAAS,cAAe1lE,OAAO8pC,EAAS,yBAA2B,EAAAiH,EAAA,GAAQ8zB,GAE3ExlE,EAAKnP,OAAS,IAChBw1E,GAAU,QAAS1lE,OAAO8pC,GAAS9pC,OAAOkkE,GAAe7kE,GAAO,MAGlEs0B,EAAQ,IAAIga,EAAA,EAAa+3B,EAAS,KAAOp0E,EAAMe,QAASkzE,OAAYhwE,OAAWA,OAAWA,EAAWjE,EAAMm9C,eAC7G,GACF,EAESO,EAAM,EAAGA,EAAMo2B,EAAYl1E,OAAQ8+C,IAC/B6b,EAAM7b,GAKnB,OAAOo1B,CACT,CA7EkBuB,CAAqB5nB,EAAQqnB,EAAaC,GAAQ,SAAU/zE,GACxE,GAAiB,MAAb+xE,GAAqB/qE,EAAOpI,QAAUmzE,EACxC,MAAM,IAAI11B,EAAA,EAAa,iFAGzBr1C,EAAOhM,KAAKgF,EACd,IAEA,GAAsB,IAAlBgH,EAAOpI,OACT,MAAO,CACLo1E,QAASA,EAGf,CAAE,MAAOh0E,GACPgH,EAAOhM,KAAKgF,EACd,CAEA,MAAO,CACLgH,OAAQA,EAEZ,CAsEO,SAASstE,GAAkB/jE,EAAKtG,EAAMsqE,GAU3C,IATA,IAAIC,EAEA1B,EAAgB,CAAC,EAGjBvM,EAAaxmB,EAD0C,QAAtCy0B,EAAkBvqE,EAAKvC,iBAA2C,IAApB8sE,EAA6BA,EAAkB,IAC3E,SAAU/pE,GAC/C,OAAOA,EAAI7F,KAAK1C,KAClB,IAESq8C,EAAM,EAAGk2B,EAAalkE,EAAIvM,KAAMu6C,EAAMk2B,EAAW71E,OAAQ2/C,IAAO,CACvE,IAAI4e,EAASsX,EAAWl2B,GACpB35C,EAAOu4D,EAAOv4D,KACdw4D,EAAUD,EAAO/7D,KACjBszE,EAAenO,EAAW3hE,GAE9B,GAAK8vE,EAAL,CAUA,IAAI1wB,EAAY0wB,EAAaxyE,MACzByyE,EAAS3wB,EAAUn7C,OAAS,IAAKo7C,KAErC,GAAID,EAAUn7C,OAAS,IAAK87C,SAAU,CACpC,IAAIjoC,EAAesnC,EAAUp/C,KAAK1C,MAElC,GAAsB,MAAlBqyE,IAA2B,GAAeA,EAAgB73D,GAAe,CAC3E,QAA4BzY,IAAxBk5D,EAAOvpB,aACTk/B,EAAcluE,GAAQu4D,EAAOvpB,kBACxB,GAAI0R,GAAc8X,GACvB,MAAM,IAAI/gB,EAAA,EAAa,aAAc3tC,OAAO9J,EAAM,wBAA0B8J,QAAO,EAAA+wC,EAAA,GAAQ2d,GAAU,MAAS,+BAAgC1uD,OAAOgO,EAAc,6CAA+CsnC,GAGpN,QACF,CAEA2wB,EAAyC,MAAhCJ,EAAe73D,EAC1B,CAEA,GAAIi4D,GAAUrvB,GAAc8X,GAC1B,MAAM,IAAI/gB,EAAA,EAAa,aAAc3tC,OAAO9J,EAAM,wBAA0B8J,QAAO,EAAA+wC,EAAA,GAAQ2d,GAAU,MAAS,oBAAqBpZ,GAGrI,IAAI0J,EAAemlB,GAAa7uB,EAAWoZ,EAASmX,GAEpD,QAAqBtwE,IAAjBypD,EAIF,MAAM,IAAIrR,EAAA,EAAa,aAAc3tC,OAAO9J,EAAM,wBAAyB8J,QAAO,OAAMs1C,GAAY,KAAMA,GAG5G8uB,EAAcluE,GAAQ8oD,CAlCtB,MAPE,QAA4BzpD,IAAxBk5D,EAAOvpB,aACTk/B,EAAcluE,GAAQu4D,EAAOvpB,kBACxB,GAAI0R,GAAc8X,GACvB,MAAM,IAAI/gB,EAAA,EAAa,aAAc3tC,OAAO9J,EAAM,wBAA0B8J,QAAO,EAAA+wC,EAAA,GAAQ2d,GAAU,MAAS,oBAAqBnzD,EAuCzI,CAEA,OAAO6oE,CACT,CAaO,SAAS8B,GAAmBC,EAAc5qE,EAAMsqE,GACrD,IAAItP,EAAgBh7D,EAAK2S,YAAc,EAAK3S,EAAK2S,YAAY,SAAUoS,GACrE,OAAOA,EAAUpqB,KAAK1C,QAAU2yE,EAAajwE,IAC/C,IAEA,GAAIqgE,EACF,OAAOqP,GAAkBO,EAAc5P,EAAesP,EAE1D,CAEA,SAAS,GAAengE,EAAK0gE,GAC3B,OAAO3uE,OAAOrF,UAAU8G,eAAetH,KAAK8T,EAAK0gE,EACnD,CC9JO,SAASzmD,GAAQ0mD,EAAcr3E,EAAUiwB,EAAWqnD,EAAcT,EAAgB7tE,EAAeuuE,EAAeC,GAGrH,OAAgCC,GAAJ,IAArBztE,UAAU9I,OAA2Bm2E,EAA4B,CACtEtoB,OAAQsoB,EACRr3E,SAAUA,EACViwB,UAAWA,EACXqnD,aAAcA,EACdT,eAAgBA,EAChB7tE,cAAeA,EACfuuE,cAAeA,EACfC,aAAcA,GAElB,CAOO,SAASE,GAAYpxE,GAC1B,IAAI+C,EAASouE,GAAYnxE,GAEzB,GAAIo7C,EAAUr4C,GACZ,MAAM,IAAI+C,MAAM,uDAGlB,OAAO/C,CACT,CAEA,SAASouE,GAAYnxE,GACnB,IAAIyoD,EAASzoD,EAAKyoD,OACd/uD,EAAWsG,EAAKtG,SAChBiwB,EAAY3pB,EAAK2pB,UACjBqnD,EAAehxE,EAAKgxE,aACpBT,EAAiBvwE,EAAKuwE,eACtB7tE,EAAgB1C,EAAK0C,cACrBuuE,EAAgBjxE,EAAKixE,cACrBC,EAAelxE,EAAKkxE,aAExBG,GAA8B5oB,EAAQ/uD,EAAU62E,GAGhD,IAAIe,EAAaC,GAAsB9oB,EAAQ/uD,EAAUiwB,EAAWqnD,EAAcT,EAAgB7tE,EAAeuuE,EAAeC,GAEhI,GAAIlnE,MAAMC,QAAQqnE,GAChB,MAAO,CACLtuE,OAAQsuE,GAWZ,IAAIj2E,EA8GN,SAA0Bi2E,EAAY1vE,EAAW+nB,GAC/C,IAAIvsB,EAAOuxE,GAAqB2C,EAAW7oB,OAAQ7mD,GAC/CiN,EAAS2iE,GAAcF,EAAYl0E,EAAMwE,EAAUgK,aAAczJ,OAAO3C,OAAO,MAAO2C,OAAO3C,OAAO,OACpGuK,OAAO9J,EAIX,IACE,IAAI8C,EAAiC,aAAxBnB,EAAUA,UAqB3B,SAA+B0vE,EAAYxxD,EAAY2xD,EAAa1nE,EAAM8E,GACxE,OC5OoCqI,ED4Of/U,OAAO+D,KAAK2I,GC5OW7F,ED4OF,SAAU6tB,EAAS2sC,GAC3D,IAAI7Y,EAAa97C,EAAO20D,GACpBxQ,EAAYqb,GAAQtkE,EAAMy5D,EAAc1jD,EAAWlf,MACnDmC,EAASunB,GAAagnD,EAAYxxD,EAAY2xD,EAAa9mB,EAAYqI,GAE3E,YAAe/yD,IAAX8C,EACK8zB,EAGLukB,EAAUr4C,GACLA,EAAOijB,MAAK,SAAU0rD,GAE3B,OADA76C,EAAQ2sC,GAAgBkO,EACjB76C,CACT,KAGFA,EAAQ2sC,GAAgBzgE,EACjB8zB,EACT,EC9PsD86C,ED8PnDxvE,OAAO3C,OAAO,MC7PV0X,EAAOkC,QAAO,SAAU6kB,EAAU//B,GACvC,OAAOk9C,EAAUnd,GAAYA,EAASjY,MAAK,SAAUoR,GACnD,OAAOpuB,EAASouB,EAAUl5B,EAC5B,IAAK8K,EAASi1B,EAAU//B,EAC1B,GAAGyzE,GALU,IAAuBz6D,EAAQlO,EAAU2oE,CD+PxD,CAzCsDC,CAAsBN,EAAYl0E,EAAMusB,EAAW5f,EAAM8E,GAAUgjE,GAAcP,EAAYl0E,EAAMusB,EAAW5f,EAAM8E,GAEtK,OAAIusC,EAAUr4C,GACLA,EAAOijB,UAAK/lB,GAAW,SAAUjE,GAEtC,OADAs1E,EAAWtuE,OAAOhM,KAAKgF,GAChB8nB,QAAQC,QAAQ,KACzB,IAGKhhB,CACT,CAAE,MAAO/G,GAEP,OADAs1E,EAAWtuE,OAAOhM,KAAKgF,GAChB,IACT,CACF,CApIa81E,CAAiBR,EAAYA,EAAW1vE,UAAW+nB,GAC9D,OAAOooD,GAAcT,EAAYj2E,EACnC,CAOA,SAAS02E,GAAcT,EAAYj2E,GACjC,OAAI+/C,EAAU//C,GACLA,EAAK2qB,MAAK,SAAUoR,GACzB,OAAO26C,GAAcT,EAAYl6C,EACnC,IAGkC,IAA7Bk6C,EAAWtuE,OAAOpI,OAAe,CACtCS,KAAMA,GACJ,CACF2H,OAAQsuE,EAAWtuE,OACnB3H,KAAMA,EAEV,CASO,SAASg2E,GAA8B5oB,EAAQ/uD,EAAUs4E,GAC9Dt4E,IAAY,EAAAmiD,EAAA,GAAU,EAAG,0BAEzBsY,GAAkB1L,GAEG,MAArBupB,IAA6B,EAAA9rB,EAAA,GAAa8rB,KAAsB,EAAAn2B,EAAA,GAAU,EAAG,gJAC/E,CAUO,SAAS01B,GAAsB9oB,EAAQ/uD,EAAUiwB,EAAWqnD,EAAcgB,EAAmBtvE,EAAeuuE,EAAeC,GAMhI,IALA,IAAIe,EAAkBC,EAElBtwE,EACAwK,EAAYjK,OAAO3C,OAAO,MAErBk6C,EAAM,EAAGy4B,EAAyBz4E,EAASgL,YAAag1C,EAAMy4B,EAAuBv3E,OAAQ8+C,IAAO,CAC3G,IAAI9K,EAAaujC,EAAuBz4B,GAExC,OAAQ9K,EAAW/pC,MACjB,KAAK,IAAKsuC,qBACR,GAAqB,MAAjBzwC,EAAuB,CACzB,QAAkBzC,IAAd2B,EACF,MAAO,CAAC,IAAIy2C,EAAA,EAAa,uEAG3Bz2C,EAAYgtC,CACd,MAAqD,QAAxCqjC,EAAmBrjC,EAAWhuC,YAAuC,IAArBqxE,OAA8B,EAASA,EAAiB/zE,SAAWwE,IAC9Hd,EAAYgtC,GAGd,MAEF,KAAK,IAAKwE,oBACRhnC,EAAUwiC,EAAWhuC,KAAK1C,OAAS0wC,EAGzC,CAEA,IAAKhtC,EACH,OAAqB,MAAjBc,EACK,CAAC,IAAI21C,EAAA,EAAa,4BAA6B3tC,OAAOhI,EAAe,QAGvE,CAAC,IAAI21C,EAAA,EAAa,+BAI3B,IACI+5B,EAAwBvC,GAAkBpnB,EADwC,QAA3DypB,EAAwBtwE,EAAU07B,2BAA2D,IAA1B40C,EAAmCA,EAAwB,GACxD,OAAtBF,QAAoD,IAAtBA,EAA+BA,EAAoB,CAAC,EAAG,CAC9JjE,UAAW,KAGb,OAAIqE,EAAsBpvE,OACjBovE,EAAsBpvE,OAGxB,CACLylD,OAAQA,EACRr8C,UAAWA,EACXud,UAAWA,EACXqnD,aAAcA,EACdpvE,UAAWA,EACX2uE,eAAgB6B,EAAsBpC,QACtCiB,cAAiC,OAAlBA,QAA4C,IAAlBA,EAA2BA,EAAgBoB,GACpFnB,aAA+B,OAAjBA,QAA0C,IAAjBA,EAA0BA,EAAeoB,GAChFtvE,OAAQ,GAEZ,CA6DA,SAAS6uE,GAAcP,EAAYxxD,EAAY2xD,EAAa1nE,EAAM8E,GAIhE,IAHA,IEzQuC9Q,EACnCmI,EACAqsE,EFuQA17C,EAAU10B,OAAO3C,OAAO,MACxBgzE,GAAkB,EAEbj4B,EAAM,EAAGwoB,EAAgB5gE,OAAO+D,KAAK2I,GAAS0rC,EAAMwoB,EAAcnoE,OAAQ2/C,IAAO,CACxF,IAAIipB,EAAeT,EAAcxoB,GAG7Bx3C,EAASunB,GAAagnD,EAAYxxD,EAAY2xD,EAFjC5iE,EAAO20D,GACR6K,GAAQtkE,EAAMy5D,EAAc1jD,EAAWlf,YAGxCX,IAAX8C,IACF8zB,EAAQ2sC,GAAgBzgE,EAEpBq4C,EAAUr4C,KACZyvE,GAAkB,GAGxB,CAGA,OAAKA,GE5RkCz0E,EFmSf84B,EElSpB3wB,EAAO/D,OAAO+D,KAAKnI,GACnBw0E,EAAoBrsE,EAAK7G,KAAI,SAAUuB,GACzC,OAAO7C,EAAO6C,EAChB,IACOkjB,QAAQ2G,IAAI8nD,GAAmBvsD,MAAK,SAAU9O,GACnD,OAAOA,EAAOkC,QAAO,SAAUq5D,EAAgBv0E,EAAOsF,GAEpD,OADAivE,EAAevsE,EAAK1C,IAAMtF,EACnBu0E,CACT,GAAGtwE,OAAO3C,OAAO,MACnB,KFmRSq3B,CAOX,CAaO,SAAS26C,GAAcF,EAAYoB,EAAa9mE,EAAciD,EAAQ8jE,GAC3E,IAAK,IAAIl4B,EAAM,EAAGstB,EAAyBn8D,EAAaG,WAAY0uC,EAAMstB,EAAuBntE,OAAQ6/C,IAAO,CAC9G,IAAI/jC,EAAYqxD,EAAuBttB,GAEvC,OAAQ/jC,EAAU7R,MAChB,KAAK,IAAKstC,MAEN,IAAKygC,GAAkBtB,EAAY56D,GACjC,SAGF,IAAI9V,GA4FYqF,EA5FYyQ,GA6FxBm7B,MAAQ5rC,EAAK4rC,MAAM3zC,MAAQ+H,EAAKrF,KAAK1C,MA3FpC2Q,EAAOjO,KACViO,EAAOjO,GAAQ,IAGjBiO,EAAOjO,GAAM5J,KAAK0f,GAClB,MAGJ,KAAK,IAAKq1C,gBAEN,IAAK6mB,GAAkBtB,EAAY56D,KAAem8D,GAA2BvB,EAAY56D,EAAWg8D,GAClG,SAGFlB,GAAcF,EAAYoB,EAAah8D,EAAU9K,aAAciD,EAAQ8jE,GACvE,MAGJ,KAAK,IAAK/7D,gBAEN,IAAIqmD,EAAWvmD,EAAU9V,KAAK1C,MAE9B,GAAIy0E,EAAqB1V,KAAc2V,GAAkBtB,EAAY56D,GACnE,SAGFi8D,EAAqB1V,IAAY,EACjC,IAAIv0D,EAAW4oE,EAAWllE,UAAU6wD,GAEpC,IAAKv0D,IAAamqE,GAA2BvB,EAAY5oE,EAAUgqE,GACjE,SAGFlB,GAAcF,EAAYoB,EAAahqE,EAASkD,aAAciD,EAAQ8jE,GAI9E,CAqDF,IAA0B1sE,EAnDxB,OAAO4I,CACT,CAMA,SAAS+jE,GAAkBtB,EAAYrrE,GACrC,IAAI6sE,EAAOlC,GAAmBpiB,GAAsBvoD,EAAMqrE,EAAWf,gBAErE,IAA8D,KAAhD,OAATuC,QAA0B,IAATA,OAAkB,EAASA,EAAKtxD,IACpD,OAAO,EAGT,IAAIqR,EAAU+9C,GAAmBriB,GAAyBtoD,EAAMqrE,EAAWf,gBAE3E,OAAuE,KAAtD,OAAZ19C,QAAgC,IAAZA,OAAqB,EAASA,EAAQrR,GAKjE,CAMA,SAASqxD,GAA2BvB,EAAY5oE,EAAUtL,GACxD,IAAI21E,EAAoBrqE,EAASmU,cAEjC,IAAKk2D,EACH,OAAO,EAGT,IAAIC,EAAkB9b,GAAYoa,EAAW7oB,OAAQsqB,GAErD,OAAIC,IAAoB51E,KAIpB+lD,GAAe6vB,IACV1B,EAAW7oB,OAAOG,UAAUoqB,EAAiB51E,EAIxD,CAiBA,SAASktB,GAAagnD,EAAYxxD,EAAY7a,EAAQ0lD,EAAY5gD,GAChE,IAAIkpE,EAGAtlE,EADYg9C,EAAW,GACD/pD,KAAK1C,MAC3B06D,EAAW,GAAY0Y,EAAW7oB,OAAQ3oC,EAAYnS,GAE1D,GAAKirD,EAAL,CAIA,IAAIsa,EAAata,EAASx7D,KACtB+1E,EAAuD,QAA1CF,EAAoBra,EAAS70C,eAA2C,IAAtBkvD,EAA+BA,EAAoB3B,EAAWL,cAC7Ht5D,EAAOy7D,GAAiB9B,EAAY1Y,EAAUjO,EAAY7qC,EAAY/V,GAE1E,IAIE,IAMIw2B,EADAx9B,EAASowE,EAAUluE,EALZqrE,GAAkB1X,EAAUjO,EAAW,GAAI2mB,EAAWf,gBAI7Ce,EAAWN,aACqBr5D,GAWpD,OAPE4oB,EADE6a,EAAUr4C,GACAA,EAAOijB,MAAK,SAAUoR,GAChC,OAAOi8C,GAAc/B,EAAY4B,EAAYvoB,EAAYhzC,EAAM5N,EAAMqtB,EACvE,IAEYi8C,GAAc/B,EAAY4B,EAAYvoB,EAAYhzC,EAAM5N,EAAMhH,GAGxEq4C,EAAU7a,GAGLA,EAAUva,UAAK/lB,GAAW,SAAUqzE,GAEzC,OAAOC,GADKj4B,EAAag4B,EAAU3oB,EAAY4jB,GAAYxkE,IAC5BmpE,EAAY5B,EAC7C,IAGK/wC,CACT,CAAE,MAAO+yC,GAEP,OAAOC,GADKj4B,EAAag4B,EAAU3oB,EAAY4jB,GAAYxkE,IAC5BmpE,EAAY5B,EAC7C,CAvCA,CAwCF,CAMO,SAAS8B,GAAiB9B,EAAY1Y,EAAUjO,EAAY7qC,EAAY/V,GAG7E,MAAO,CACL4D,UAAWirD,EAASh4D,KACpB+pD,WAAYA,EACZuoB,WAAYta,EAASx7D,KACrB0iB,WAAYA,EACZ/V,KAAMA,EACN0+C,OAAQ6oB,EAAW7oB,OACnBr8C,UAAWklE,EAAWllE,UACtBud,UAAW2nD,EAAW3nD,UACtB/nB,UAAW0vE,EAAW1vE,UACtB2uE,eAAgBe,EAAWf,eAE/B,CAEA,SAASgD,GAAiBv3E,EAAOk3E,EAAY5B,GAG3C,GAAIhwB,GAAc4xB,GAChB,MAAMl3E,EAMR,OADAs1E,EAAWtuE,OAAOhM,KAAKgF,GAChB,IACT,CAwBA,SAASq3E,GAAc/B,EAAY4B,EAAYvoB,EAAYhzC,EAAM5N,EAAMhH,GAErE,GAAIA,aAAkB+C,MACpB,MAAM/C,EAKR,GAAIu+C,GAAc4xB,GAAa,CAC7B,IAAI3yC,EAAY8yC,GAAc/B,EAAY4B,EAAWvwB,OAAQgI,EAAYhzC,EAAM5N,EAAMhH,GAErF,GAAkB,OAAdw9B,EACF,MAAM,IAAIz6B,MAAM,6CAA6C4E,OAAOiN,EAAKmI,WAAWlf,KAAM,KAAK8J,OAAOiN,EAAKhK,UAAW,MAGxH,OAAO4yB,CACT,CAGA,OAAc,MAAVx9B,EACK,KAILs+C,GAAW6xB,GA+BjB,SAA2B5B,EAAY4B,EAAYvoB,EAAYhzC,EAAM5N,EAAMhH,GAGzE,IAAIwnD,EAAW2oB,EAAWvwB,OACtB6vB,GAAkB,EAClBgB,EAAmBpqB,GAAcrmD,GAAQ,SAAU+I,EAAMk2B,GAG3D,IAAI0tC,EAAWrB,GAAQtkE,EAAMi4B,OAAO/hC,GAEpC,IACE,IAAIwzE,EAUJ,OAPEA,EADEr4B,EAAUtvC,GACIA,EAAKka,MAAK,SAAUoR,GAClC,OAAOi8C,GAAc/B,EAAY/mB,EAAUI,EAAYhzC,EAAM+3D,EAAUt4C,EACzE,IAEgBi8C,GAAc/B,EAAY/mB,EAAUI,EAAYhzC,EAAM+3D,EAAU5jE,GAG9EsvC,EAAUq4B,IACZjB,GAAkB,EAGXiB,EAAcztD,UAAK/lB,GAAW,SAAUqzE,GAE7C,OAAOC,GADKj4B,EAAag4B,EAAU3oB,EAAY4jB,GAAYmB,IAC5BnlB,EAAU+mB,EAC3C,KAGKmC,CACT,CAAE,MAAOH,GAEP,OAAOC,GADKj4B,EAAag4B,EAAU3oB,EAAY4jB,GAAYmB,IAC5BnlB,EAAU+mB,EAC3C,CACF,IAEA,GAAwB,MAApBkC,EACF,MAAM,IAAIn7B,EAAA,EAAa,sDAAuD3tC,OAAOiN,EAAKmI,WAAWlf,KAAM,KAAK8J,OAAOiN,EAAKhK,UAAW,OAGzI,OAAO6kE,EAAkB1uD,QAAQ2G,IAAI+oD,GAAoBA,CAC3D,CAzEWE,CAAkBpC,EAAY4B,EAAYvoB,EAAYhzC,EAAM5N,EAAMhH,GAKvEggD,GAAWmwB,GA2EjB,SAA2BA,EAAYnwE,GACrC,IAAI4wE,EAAmBT,EAAW1uB,UAAUzhD,GAE5C,QAAyB9C,IAArB0zE,EACF,MAAM,IAAI7tE,MAAM,6BAA8B4E,QAAO,EAAA+wC,EAAA,GAAQy3B,GAAa,UAAa,aAAaxoE,QAAO,EAAA+wC,EAAA,GAAQ14C,KAGrH,OAAO4wE,CACT,CAlFWC,CAAkBV,EAAYnwE,GAKnCogD,GAAe+vB,GAoFrB,SAA+B5B,EAAY4B,EAAYvoB,EAAYhzC,EAAM5N,EAAMhH,GAC7E,IAAI8wE,EAEAC,EAAqE,QAApDD,EAAwBX,EAAW7sB,mBAAmD,IAA1BwtB,EAAmCA,EAAwBvC,EAAWJ,aACnJF,EAAeM,EAAWN,aAC1B0B,EAAcoB,EAAc/wE,EAAQiuE,EAAcr5D,EAAMu7D,GAE5D,GAAI93B,EAAUs3B,GACZ,OAAOA,EAAY1sD,MAAK,SAAU+tD,GAChC,OAAOC,GAAoB1C,EAAY2C,GAAuBF,EAAqBzC,EAAY4B,EAAYvoB,EAAYhzC,EAAM5U,GAAS4nD,EAAYhzC,EAAM5N,EAAMhH,EAChK,IAGF,OAAOixE,GAAoB1C,EAAY2C,GAAuBvB,EAAapB,EAAY4B,EAAYvoB,EAAYhzC,EAAM5U,GAAS4nD,EAAYhzC,EAAM5N,EAAMhH,EACxJ,CAjGWmxE,CAAsB5C,EAAY4B,EAAYvoB,EAAYhzC,EAAM5N,EAAMhH,GAK3Ei+C,EAAakyB,GACRc,GAAoB1C,EAAY4B,EAAYvoB,EAAYhzC,EAAM5N,EAAMhH,QAIpE,EAAA69C,EAAA,GAAU,EAAG,qDAAsD,EAAAnF,EAAA,GAAQy3B,GACtF,CAwFA,SAASe,GAAuBE,EAAmB7C,EAAY4B,EAAYvoB,EAAYhzC,EAAM5U,GAC3F,GAAyB,MAArBoxE,EACF,MAAM,IAAI97B,EAAA,EAAa,kBAAmB3tC,OAAOwoE,EAAWtyE,KAAM,2DAA6D8J,OAAOiN,EAAKmI,WAAWlf,KAAM,KAAK8J,OAAOiN,EAAKhK,UAAW,mBAAqBjD,OAAOwoE,EAAWtyE,KAAM,+GAAqH+pD,GAI5V,IAAIypB,EAAkB3wB,GAAY0wB,GAAqBA,EAAkBvzE,KAAOuzE,EAEhF,GAA+B,kBAApBC,EACT,MAAM,IAAI/7B,EAAA,EAAa,kBAAmB3tC,OAAOwoE,EAAWtyE,KAAM,2DAA6D8J,OAAOiN,EAAKmI,WAAWlf,KAAM,KAAK8J,OAAOiN,EAAKhK,UAAW,WAAc,SAASjD,QAAO,EAAA+wC,EAAA,GAAQ14C,GAAS,gBAAiB2H,QAAO,EAAA+wC,EAAA,GAAQ04B,GAAoB,OAG7R,IAAIzB,EAAcpB,EAAW7oB,OAAOmF,QAAQwmB,GAE5C,GAAmB,MAAf1B,EACF,MAAM,IAAIr6B,EAAA,EAAa,kBAAmB3tC,OAAOwoE,EAAWtyE,KAAM,6BAA+B8J,OAAO0pE,EAAiB,wCAA0CzpB,GAGrK,IAAK3J,EAAa0xB,GAChB,MAAM,IAAIr6B,EAAA,EAAa,kBAAmB3tC,OAAOwoE,EAAWtyE,KAAM,wCAA0C8J,OAAO0pE,EAAiB,MAAQzpB,GAG9I,IAAK2mB,EAAW7oB,OAAOG,UAAUsqB,EAAYR,GAC3C,MAAM,IAAIr6B,EAAA,EAAa,wBAAyB3tC,OAAOgoE,EAAY9xE,KAAM,kCAAoC8J,OAAOwoE,EAAWtyE,KAAM,MAAQ+pD,GAG/I,OAAO+nB,CACT,CAMA,SAASsB,GAAoB1C,EAAY4B,EAAYvoB,EAAYhzC,EAAM5N,EAAMhH,GAI3E,GAAImwE,EAAWnuB,SAAU,CACvB,IAAIA,EAAWmuB,EAAWnuB,SAAShiD,EAAQuuE,EAAWN,aAAcr5D,GAEpE,GAAIyjC,EAAU2J,GACZ,OAAOA,EAAS/+B,MAAK,SAAUquD,GAC7B,IAAKA,EACH,MAAMC,GAAuBpB,EAAYnwE,EAAQ4nD,GAGnD,OAAO4pB,GAA2BjD,EAAY4B,EAAYvoB,EAAY5gD,EAAMhH,EAC9E,IAGF,IAAKgiD,EACH,MAAMuvB,GAAuBpB,EAAYnwE,EAAQ4nD,EAErD,CAEA,OAAO4pB,GAA2BjD,EAAY4B,EAAYvoB,EAAY5gD,EAAMhH,EAC9E,CAEA,SAASuxE,GAAuBpB,EAAYnwE,EAAQ4nD,GAClD,OAAO,IAAItS,EAAA,EAAa,2BAA4B3tC,OAAOwoE,EAAWtyE,KAAM,eAAgB8J,QAAO,EAAA+wC,EAAA,GAAQ14C,GAAS,KAAM4nD,EAC5H,CAEA,SAAS4pB,GAA2BjD,EAAY4B,EAAYvoB,EAAY5gD,EAAMhH,GAG5E,OAAO8uE,GAAcP,EAAY4B,EAAYnwE,EAAQgH,EADjCyqE,GAAiBlD,EAAY4B,EAAYvoB,GAE/D,CAQA,IGpuBiC9wB,GAC3B46C,GHmuBFD,IGpuB6B36C,GHsuBjC,SAA2By3C,EAAY4B,EAAYvoB,GAIjD,IAHA,IAAI+pB,EAAgBvyE,OAAO3C,OAAO,MAC9BmzE,EAAuBxwE,OAAO3C,OAAO,MAEhCwwD,EAAM,EAAGA,EAAMrF,EAAW/vD,OAAQo1D,IAAO,CAChD,IAAI/pD,EAAO0kD,EAAWqF,GAElB/pD,EAAK2F,eACP8oE,EAAgBlD,GAAcF,EAAY4B,EAAYjtE,EAAK2F,aAAc8oE,EAAe/B,GAE5F,CAEA,OAAO+B,CACT,EGjvBS,SAAkBC,EAAIC,EAAIC,GAC1BJ,KACHA,GAAS,IAAIjhE,SAGf,IACIshE,EADAC,EAASN,GAAOnvE,IAAIqvE,GAGxB,GAAII,GAGF,GAFAD,EAASC,EAAOzvE,IAAIsvE,GAER,CACV,IAAII,EAAcF,EAAOxvE,IAAIuvE,GAE7B,QAAoB50E,IAAhB+0E,EACF,OAAOA,CAEX,OAEAD,EAAS,IAAIvhE,QACbihE,GAAOhvE,IAAIkvE,EAAII,GAGZD,IACHA,EAAS,IAAIthE,QACbuhE,EAAOtvE,IAAImvE,EAAIE,IAGjB,IAAIxlE,EAAWuqB,GAAG86C,EAAIC,EAAIC,GAE1B,OADAC,EAAOrvE,IAAIovE,EAAIvlE,GACRA,CACT,GH+tBK,IAAIgjE,GAAsB,SAA6Bp0E,EAAO8yE,EAAcr5D,EAAMi5C,GAEvF,IAAI,EAAA1K,EAAA,GAAahoD,IAAsC,kBAArBA,EAAMqM,WACtC,OAAOrM,EAAMqM,WAOf,IAHA,IAAIiQ,EAAgB7C,EAAK8wC,OAAOK,iBAAiB8H,GAC7CqkB,EAA0B,GAErBzxE,EAAI,EAAGA,EAAIgX,EAAc5f,OAAQ4I,IAAK,CAC7C,IAAIpG,EAAOod,EAAchX,GAEzB,GAAIpG,EAAK2nD,SAAU,CACjB,IAAImwB,EAAiB93E,EAAK2nD,SAAS7mD,EAAO8yE,EAAcr5D,GAExD,GAAIyjC,EAAU85B,GACZD,EAAwBzxE,GAAK0xE,OACxB,GAAIA,EACT,OAAO93E,EAAKwD,IAEhB,CACF,CAEA,OAAIq0E,EAAwBr6E,OACnBkpB,QAAQ2G,IAAIwqD,GAAyBjvD,MAAK,SAAUmvD,GACzD,IAAK,IAAIrN,EAAM,EAAGA,EAAMqN,EAAgBv6E,OAAQktE,IAC9C,GAAIqN,EAAgBrN,GAClB,OAAOttD,EAAcstD,GAAKlnE,IAGhC,SAPF,CASF,EAQWyxE,GAAuB,SAA8BptE,EAAQjF,EAAMgxE,EAAcr5D,GAE1F,IAAI,EAAAuuC,EAAA,GAAajhD,IAA6B,oBAAXA,EAAuB,CACxD,IAAI+N,EAAW/N,EAAO0S,EAAKhK,WAE3B,MAAwB,oBAAbqF,EACF/N,EAAO0S,EAAKhK,WAAW3N,EAAMgxE,EAAcr5D,GAG7C3E,CACT,CACF,EAaO,SAAS,GAAYy1C,EAAQ3oC,EAAYnS,GAC9C,OAAIA,IAAc2/C,GAAmB1sD,MAAQ6nD,EAAO0C,iBAAmBrrC,EAC9DwtC,GACE3/C,IAAc8/C,GAAiB7sD,MAAQ6nD,EAAO0C,iBAAmBrrC,EACnE2tC,GACE9/C,IAAckgD,GAAqBjtD,KACrCitD,GAGF/tC,EAAWulC,YAAY13C,EAChC,CIjyBO,SAASynE,GAAQrE,EAAc9rE,EAAQ0kB,EAAWqnD,EAAcT,EAAgB7tE,EAAeuuE,EAAeC,GACnH,IAAImE,EAAa3xE,UAIjB,OAAO,IAAIogB,SAAQ,SAAUC,GAC3B,OAAOA,EACmBuxD,GAAJ,IAAtBD,EAAWz6E,OAA2Bm2E,EAA4B,CAChEtoB,OAAQsoB,EACR9rE,OAAQA,EACR0kB,UAAWA,EACXqnD,aAAcA,EACdT,eAAgBA,EAChB7tE,cAAeA,EACfuuE,cAAeA,EACfC,aAAcA,IAElB,GACF,CAQO,SAASqE,GAAYxE,EAAc9rE,EAAQ0kB,EAAWqnD,EAAcT,EAAgB7tE,EAAeuuE,EAAeC,GAGvH,IAAInuE,EAAkCuyE,GAAJ,IAArB5xE,UAAU9I,OAA2Bm2E,EAA4B,CAC5EtoB,OAAQsoB,EACR9rE,OAAQA,EACR0kB,UAAWA,EACXqnD,aAAcA,EACdT,eAAgBA,EAChB7tE,cAAeA,EACfuuE,cAAeA,EACfC,aAAcA,IAGhB,GAAI91B,EAAUr4C,GACZ,MAAM,IAAI+C,MAAM,uDAGlB,OAAO/C,CACT,CAEA,SAASuyE,GAAYt1E,GACnB,IAkBItG,EAlBA+uD,EAASzoD,EAAKyoD,OACdxjD,EAASjF,EAAKiF,OACd0kB,EAAY3pB,EAAK2pB,UACjBqnD,EAAehxE,EAAKgxE,aACpBT,EAAiBvwE,EAAKuwE,eACtB7tE,EAAgB1C,EAAK0C,cACrBuuE,EAAgBjxE,EAAKixE,cACrBC,EAAelxE,EAAKkxE,aAEpBsE,EAAyBtjB,GAAezJ,GAE5C,GAAI+sB,EAAuB56E,OAAS,EAClC,MAAO,CACLoI,OAAQwyE,GAOZ,IACE97E,GAAW,QAAMuL,EACnB,CAAE,MAAO21C,IACP,MAAO,CACL53C,OAAQ,CAAC43C,IAEb,CAGA,IAAI66B,EAAmB7H,GAASnlB,EAAQ/uD,GAExC,OAAI+7E,EAAiB76E,OAAS,EACrB,CACLoI,OAAQyyE,GAKLprD,GAAQ,CACbo+B,OAAQA,EACR/uD,SAAUA,EACViwB,UAAWA,EACXqnD,aAAcA,EACdT,eAAgBA,EAChB7tE,cAAeA,EACfuuE,cAAeA,EACfC,aAAcA,GAElB,C,+DCtIe,SAASwE,GAAgBC,GACtC,MAAsI,oBAAhG,OAAvBA,QAAsD,IAAvBA,OAAgC,EAASA,EAAmB,MAC5G,CCDe,SAASC,GAAiBruD,EAAUve,EAAU6sE,GAE3D,IAEIC,EACAC,EAkBAC,EA/BmB5lE,EAAKnS,EAAKC,EAW7BipC,EADiB5f,EAAS,MACAjrB,KAAKirB,GAgBnC,SAAS0uD,EAAUlzE,GACjB,OAAOA,EAAO2jC,KAAO3jC,EAASmzE,GAAcnzE,EAAO7E,MAAO8K,GAAUgd,KAAKmwD,GAAgBJ,EAC3F,CAIA,GAlB+B,oBAApB5uC,EAASivC,SAClBN,EAAU3uC,EAASivC,OAEnBL,EAAc,SAAqB/5E,GACjC,IAAIq6E,EAAU,WACZ,OAAOvyD,QAAQrmB,OAAOzB,EACxB,EAEA,OAAO85E,EAAQx5E,KAAK6qC,GAAUnhB,KAAKqwD,EAASA,EAC9C,GASER,EAAgB,CAElB,IAAIp4E,EAASo4E,EAEbG,EAAY,SAAmBh6E,GAC7B,OAAOk6E,GAAcl6E,EAAOyB,GAAQuoB,KAAKmwD,GAAgBJ,EAC3D,CACF,CAKA,OA7CuB3lE,EA6CA,CACrBnN,KAAM,WACJ,OAAOkkC,EAASlkC,OAAO+iB,KAAKiwD,EAAWD,EACzC,EACAI,OAAQ,WACN,OAAON,EAAUA,EAAQx5E,KAAK6qC,GAAUnhB,KAAKiwD,EAAWD,GAAalyD,QAAQC,QAAQ,CACnF7lB,WAAO+B,EACPymC,MAAM,GAEV,EACA4vC,MAAO,SAAgBt6E,GACrB,MAA8B,oBAAnBmrC,EAASmvC,MACXnvC,EAASmvC,MAAMt6E,GAAOgqB,KAAKiwD,EAAWD,GAGxClyD,QAAQrmB,OAAOzB,GAAOsrB,MAAMyuD,EACrC,GA7D0B93E,EA8DzB,KA9D8BC,EA8DP,WACxB,OAAOpH,IACT,EAhE8CmH,KAAOmS,EAAOjO,OAAOm3B,eAAelpB,EAAKnS,EAAK,CAAEC,MAAOA,EAAOq7B,YAAY,EAAMC,cAAc,EAAMod,UAAU,IAAkBxmC,EAAInS,GAAOC,EAAgBkS,CAiE3M,CAEA,SAAS8lE,GAAch4E,EAAO8K,GAC5B,OAAO,IAAI8a,SAAQ,SAAUC,GAC3B,OAAOA,EAAQ/a,EAAS9K,GAC1B,GACF,CAEA,SAASi4E,GAAej4E,GACtB,MAAO,CACLA,MAAOA,EACPwoC,MAAM,EAEV,CCrEO,SAAStnC,GAAU2xE,EAAcr3E,EAAUiwB,EAAWqnD,EAAcT,EAAgB7tE,EAAeuuE,EAAesF,GAGvH,OAAgCC,GAAJ,IAArB9yE,UAAU9I,OAA6Bm2E,EAA8B,CAC1EtoB,OAAQsoB,EACRr3E,SAAUA,EACViwB,UAAWA,EACXqnD,aAAcA,EACdT,eAAgBA,EAChB7tE,cAAeA,EACfuuE,cAAeA,EACfsF,uBAAwBA,GAE5B,CAOA,SAASE,GAAmBz6E,GAC1B,GAAIA,aAAiBq8C,EAAA,EACnB,MAAO,CACLr1C,OAAQ,CAAChH,IAIb,MAAMA,CACR,CAEA,SAASw6E,GAAcx2E,GACrB,IAAIyoD,EAASzoD,EAAKyoD,OACd/uD,EAAWsG,EAAKtG,SAChBiwB,EAAY3pB,EAAK2pB,UACjBqnD,EAAehxE,EAAKgxE,aACpBT,EAAiBvwE,EAAKuwE,eACtB7tE,EAAgB1C,EAAK0C,cACrBuuE,EAAgBjxE,EAAKixE,cACrBsF,EAAyBv2E,EAAKu2E,uBAC9BG,EAAgBC,GAAwBluB,EAAQ/uD,EAAUiwB,EAAWqnD,EAAcT,EAAgB7tE,EAAe6zE,GAOlHK,EAAsB,SAA6Bh0E,GACrD,OAAOynB,GAAQ,CACbo+B,OAAQA,EACR/uD,SAAUA,EACViwB,UAAW/mB,EACXouE,aAAcA,EACdT,eAAgBA,EAChB7tE,cAAeA,EACfuuE,cAAeA,GAEnB,EAIA,OAAOyF,EAAc1wD,MAAK,SAAU6wD,GAClC,OACEnB,GAAgBmB,GAAkBjB,GAAiBiB,EAAgBD,EAAqBH,IAAsBI,CAElH,GACF,CA+BO,SAASF,GAAwBluB,EAAQ/uD,EAAUiwB,EAAWqnD,EAAcT,EAAgB7tE,EAAeuuE,GAIhH,OADAI,GAA8B5oB,EAAQ/uD,EAAU62E,GACzC,IAAIzsD,SAAQ,SAAUC,GAG3B,IAAIutD,EAAaC,GAAsB9oB,EAAQ/uD,EAAUiwB,EAAWqnD,EAAcT,EAAgB7tE,EAAeuuE,GACjHltD,EACA/Z,MAAMC,QAAQqnE,GAAc,CAC1BtuE,OAAQsuE,GAKd,SAA6BA,GAC3B,IAAI7oB,EAAS6oB,EAAW7oB,OACpB7mD,EAAY0vE,EAAW1vE,UACvB2uE,EAAiBe,EAAWf,eAC5B5mD,EAAY2nD,EAAW3nD,UACvBvsB,EAAOuxE,GAAqBlmB,EAAQ7mD,GACpCiN,EAAS2iE,GAAcF,EAAYl0E,EAAMwE,EAAUgK,aAAczJ,OAAO3C,OAAO,MAAO2C,OAAO3C,OAAO,OAEpGgkE,EADgBrhE,OAAO+D,KAAK2I,GACC,GAC7B87C,EAAa97C,EAAO20D,GAEpB71D,EADYg9C,EAAW,GACD/pD,KAAK1C,MAC3B06D,EAAW,GAAYnQ,EAAQrrD,EAAMuQ,GAEzC,IAAKirD,EACH,MAAM,IAAIvgB,EAAA,EAAa,2BAA4B3tC,OAAOiD,EAAW,qBAAuBg9C,GAG9F,IAAI5gD,EAAOskE,QAAQpuE,EAAWujE,EAAcpmE,EAAKwD,MAC7C+W,EAAOy7D,GAAiB9B,EAAY1Y,EAAUjO,EAAYvtD,EAAM2M,GAEpE,OAAO,IAAI+Z,SAAQ,SAAUgzD,GAC3B,IAAIC,EAMA/2E,EAAOswE,GAAkB1X,EAAUjO,EAAW,GAAI4lB,GAIlDS,EAAeM,EAAWN,aAI9B8F,GAD+D,QAA9CC,EAAsBne,EAASx5D,iBAA+C,IAAxB23E,EAAiCA,EAAsBzF,EAAWL,eACjHtnD,EAAW3pB,EAAMgxE,EAAcr5D,GACzD,IAAGqO,MAAK,SAAUgxD,GAChB,GAAIA,aAAuBlxE,MACzB,MAAMw1C,EAAa07B,EAAarsB,EAAY4jB,GAAYxkE,IAI1D,IAAK2rE,GAAgBsB,GACnB,MAAM,IAAIlxE,MAAM,kDAAoD,aAAa4E,QAAO,EAAA+wC,EAAA,GAAQu7B,GAAc,MAGhH,OAAOA,CACT,IAAG,SAAUh7E,GACX,MAAMs/C,EAAat/C,EAAO2uD,EAAY4jB,GAAYxkE,GACpD,GACF,CAvDQktE,CAAoB3F,GAC1B,IAAGhqD,MAAMmvD,GACX,CCxGO,SAASS,GAAuB5sE,GACrC,MAAO,CACLupC,MAAO,SAAe5tC,GACpB,IAAI2yD,EAAWtuD,EAAQ8tD,cACnBpS,EAAiC,OAAb4S,QAAkC,IAAbA,OAAsB,EAASA,EAAS5S,kBAErF,GAAI4S,GAAiC,MAArB5S,EAA2B,CACzC,IAAIlmC,EAAaxV,EAAQ+tD,gBACX,MAAdv4C,IAAsB,EAAA8gC,EAAA,GAAU,GAChCt2C,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,aAAa3tC,OAAOoV,EAAWlf,KAAM,KAAK8J,OAAOkuD,EAASh4D,KAAM,oBAAoB8J,OAAOs7C,GAAoB//C,GACtJ,CACF,EACA46D,SAAU,SAAkB56D,GAC1B,IAAIkzD,EAAS7uD,EAAQmuD,cACjBzS,EAA+B,OAAXmT,QAA8B,IAAXA,OAAoB,EAASA,EAAOnT,kBAE/E,GAAImT,GAA+B,MAArBnT,EAA2B,CACvC,IAAI6qB,EAAevmE,EAAQinD,eAE3B,GAAoB,MAAhBsf,EACFvmE,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,eAAgB3tC,OAAOmmE,EAAajwE,KAAM,gBAAkB8J,OAAOyuD,EAAOv4D,KAAM,qBAAsB8J,OAAOs7C,GAAoB//C,QACjK,CACL,IAAI6Z,EAAaxV,EAAQ+tD,gBACrBO,EAAWtuD,EAAQ8tD,cACT,MAAdt4C,GAAkC,MAAZ84C,IAAoB,EAAAhY,EAAA,GAAU,GACpDt2C,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,UAAW3tC,OAAOoV,EAAWlf,KAAM,KAAK8J,OAAOkuD,EAASh4D,KAAM,gBAAkB8J,OAAOyuD,EAAOv4D,KAAM,qBAAsB8J,OAAOs7C,GAAoB//C,GAC5L,CACF,CACF,EACA07D,YAAa,SAAqB17D,GAChC,IAAIkxE,EAAiBxzB,GAAar5C,EAAQiuD,sBAE1C,GAAInX,GAAkB+1B,GAAiB,CACrC,IAAIC,EAAgBD,EAAe9xB,YAAYp/C,EAAKrF,KAAK1C,OAErD8nD,EAAsC,OAAlBoxB,QAA4C,IAAlBA,OAA2B,EAASA,EAAcpxB,kBAE3E,MAArBA,GACF17C,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,mBAAmB3tC,OAAOysE,EAAev2E,KAAM,KAAK8J,OAAO0sE,EAAcx2E,KAAM,oBAAoB8J,OAAOs7C,GAAoB//C,GAEvK,CACF,EACA47D,UAAW,SAAmB57D,GAC5B,IAAIoxE,EAAe/sE,EAAQouD,eACvB1S,EAAqC,OAAjBqxB,QAA0C,IAAjBA,OAA0B,EAASA,EAAarxB,kBAEjG,GAAIqxB,GAAqC,MAArBrxB,EAA2B,CAC7C,IAAIsxB,EAAc3zB,GAAar5C,EAAQguD,gBACxB,MAAfgf,IAAuB,EAAA12B,EAAA,GAAU,GACjCt2C,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,mBAAoB3tC,OAAO4sE,EAAY12E,KAAM,KAAK8J,OAAO2sE,EAAaz2E,KAAM,qBAAsB8J,OAAOs7C,GAAoB//C,GACpK,CACF,EAEJ,CCrDO,SAASsxE,GAAgCjtE,GAC9C,MAAO,CACLupC,MAAO,SAAe5tC,GACpB,IAAI7I,EAAOumD,GAAar5C,EAAQsjD,WAE5BxwD,GAAQ4wD,GAAoB5wD,IAC9BkN,EAAQo1B,YAAY,IAAI2Y,EAAA,EAAa,yFAA0F3tC,OAAOzE,EAAKrF,KAAK1C,MAAO,MAAQ+H,GAEnK,EAEJ,CClBO,SAASuxE,GAAYx7E,GAC1B,IAAIy7E,EAEJz7E,IAAS,EAAA6/C,EAAA,GAAU,EAAG,qCACtB,IAAI9+C,EAA+C,QAApC06E,EAAiBz7E,EAAMe,eAAwC,IAAnB06E,EAA4BA,EAAiB,6BACpG59B,EAAY79C,EAAM69C,UAClB9vC,EAAO/N,EAAM+N,KACbsrB,EAAar5B,EAAMq5B,WACvB,OAAOA,GAAclzB,OAAO+D,KAAKmvB,GAAYz6B,OAAS,EAAI,CACxDmC,QAASA,EACT88C,UAAWA,EACX9vC,KAAMA,EACNsrB,WAAYA,GACV,CACFt4B,QAASA,EACT88C,UAAWA,EACX9vC,KAAMA,EAEV,C,gBCxBA,SAAS,GAAQhM,EAAQu4C,GAAkB,IAAIpwC,EAAO/D,OAAO+D,KAAKnI,GAAS,GAAIoE,OAAOo0C,sBAAuB,CAAE,IAAIC,EAAUr0C,OAAOo0C,sBAAsBx4C,GAAau4C,IAAgBE,EAAUA,EAAQz3C,QAAO,SAAU03C,GAAO,OAAOt0C,OAAOu0C,yBAAyB34C,EAAQ04C,GAAKld,UAAY,KAAIrzB,EAAKlP,KAAK6M,MAAMqC,EAAMswC,EAAU,CAAE,OAAOtwC,CAAM,CAIpV,SAAS,GAAgBkK,EAAKnS,EAAKC,GAAiK,OAApJD,KAAOmS,EAAOjO,OAAOm3B,eAAelpB,EAAKnS,EAAK,CAAEC,MAAOA,EAAOq7B,YAAY,EAAMC,cAAc,EAAMod,UAAU,IAAkBxmC,EAAInS,GAAOC,EAAgBkS,CAAK,CAEzM,SAASsnE,GAAsBp2E,GACpC,IAAIq2E,EALN,SAAuB9qC,GAAU,IAAK,IAAIrpC,EAAI,EAAGA,EAAIE,UAAU9I,OAAQ4I,IAAK,CAAE,IAAIyB,EAAyB,MAAhBvB,UAAUF,GAAaE,UAAUF,GAAK,CAAC,EAAOA,EAAI,EAAK,GAAQrB,OAAO8C,IAAS,GAAMN,SAAQ,SAAU1G,GAAO,GAAgB4uC,EAAQ5uC,EAAKgH,EAAOhH,GAAO,IAAekE,OAAO83C,0BAA6B93C,OAAO+3C,iBAAiBrN,EAAQ1qC,OAAO83C,0BAA0Bh1C,IAAmB,GAAQ9C,OAAO8C,IAASN,SAAQ,SAAU1G,GAAOkE,OAAOm3B,eAAeuT,EAAQ5uC,EAAKkE,OAAOu0C,yBAAyBzxC,EAAQhH,GAAO,GAAM,CAAE,OAAO4uC,CAAQ,CAK1f,CAAc,CACrC+qC,cAAc,EACdrzB,gBAAgB,EAChBszB,uBAAuB,EACvBC,mBAAmB,EACnBC,uBAAuB,GACtBz2E,GAECs2E,EAAeD,EAAmBC,aAAe,cAAgB,GACjErzB,EAAiBozB,EAAmBpzB,eAAiB,iBAAmB,GACxEszB,EAAwBF,EAAmBE,sBAAwB,eAAiB,GACpFC,EAAoBH,EAAmBG,kBAAoBF,EAAe,GAE9E,SAASI,EAAiBn4B,GACxB,OAAO83B,EAAmBI,sBAAwBl4B,EAAM,EAC1D,CAEA,MAAO,+DAA+Dn1C,OAAOotE,EAAmB,uMAAuMptE,OAAOktE,EAAc,gBAAgBltE,OAAOmtE,EAAuB,yCAAyCntE,OAAOstE,EAAiB,6BAA8B,8IAA8IttE,OAAOktE,EAAc,YAAYltE,OAAO65C,EAAgB,qEAAqE75C,OAAOktE,EAAc,kBAAkBltE,OAAOstE,EAAiB,6BAA8B,wKAAwKttE,OAAOstE,EAAiB,6BAA8B,4JAA4JttE,OAAOktE,EAAc,0LAA0LltE,OAAOktE,EAAc,2DAA2DltE,OAAOstE,EAAiB,gBAAiB,YAAYttE,OAAOstE,EAAiB,qBAAsB,4mBAC/iD,CClBO,SAASC,GAAgBpK,EAAanrE,GAG3C,IAFA,IAAId,EAAY,KAEP83C,EAAM,EAAGw+B,EAAyBrK,EAAYnpE,YAAag1C,EAAMw+B,EAAuBt9E,OAAQ8+C,IAAO,CAC9G,IAGMu4B,EAHFrjC,EAAaspC,EAAuBx+B,GAExC,GAAI9K,EAAW/pC,OAAS,IAAKsuC,qBAG3B,GAAqB,MAAjBzwC,EAAuB,CAIzB,GAAId,EACF,OAAO,KAGTA,EAAYgtC,CACd,MAAO,IAA8C,QAAxCqjC,EAAmBrjC,EAAWhuC,YAAuC,IAArBqxE,OAA8B,EAASA,EAAiB/zE,SAAWwE,EAC9H,OAAOksC,CAGb,CAEA,OAAOhtC,CACT,CChCA,SAAS,GAAQ7D,EAAQu4C,GAAkB,IAAIpwC,EAAO/D,OAAO+D,KAAKnI,GAAS,GAAIoE,OAAOo0C,sBAAuB,CAAE,IAAIC,EAAUr0C,OAAOo0C,sBAAsBx4C,GAAau4C,IAAgBE,EAAUA,EAAQz3C,QAAO,SAAU03C,GAAO,OAAOt0C,OAAOu0C,yBAAyB34C,EAAQ04C,GAAKld,UAAY,KAAIrzB,EAAKlP,KAAK6M,MAAMqC,EAAMswC,EAAU,CAAE,OAAOtwC,CAAM,CAIpV,SAAS,GAAgBkK,EAAKnS,EAAKC,GAAiK,OAApJD,KAAOmS,EAAOjO,OAAOm3B,eAAelpB,EAAKnS,EAAK,CAAEC,MAAOA,EAAOq7B,YAAY,EAAMC,cAAc,EAAMod,UAAU,IAAkBxmC,EAAInS,GAAOC,EAAgBkS,CAAK,CAgBzM,SAAS+nE,GAAwB1vB,EAAQnnD,GAC9C,IAAI82E,EAnBN,SAAuBvrC,GAAU,IAAK,IAAIrpC,EAAI,EAAGA,EAAIE,UAAU9I,OAAQ4I,IAAK,CAAE,IAAIyB,EAAyB,MAAhBvB,UAAUF,GAAaE,UAAUF,GAAK,CAAC,EAAOA,EAAI,EAAK,GAAQrB,OAAO8C,IAAS,GAAMN,SAAQ,SAAU1G,GAAO,GAAgB4uC,EAAQ5uC,EAAKgH,EAAOhH,GAAO,IAAekE,OAAO83C,0BAA6B93C,OAAO+3C,iBAAiBrN,EAAQ1qC,OAAO83C,0BAA0Bh1C,IAAmB,GAAQ9C,OAAO8C,IAASN,SAAQ,SAAU1G,GAAOkE,OAAOm3B,eAAeuT,EAAQ5uC,EAAKkE,OAAOu0C,yBAAyBzxC,EAAQhH,GAAO,GAAM,CAAE,OAAO4uC,CAAQ,CAmBzf,CAAc,CACtC0X,gBAAgB,EAChBszB,uBAAuB,EACvBC,mBAAmB,EACnBC,uBAAuB,GACtBz2E,GAGCyB,EAASquE,GAAY,CACvB3oB,OAAQA,EACR/uD,UAHa,QAAMg+E,GAAsBU,MAM3C,OADCr1E,EAAOC,QAAUD,EAAO1H,OAAQ,EAAAulD,EAAA,GAAU,GACpC79C,EAAO1H,IAChB,CCVO,SAASg9E,GAAkBC,EAAeh3E,IAC/C,EAAA4kD,EAAA,GAAaoyB,KAAkB,EAAApyB,EAAA,GAAaoyB,EAAcC,YAAa,EAAA18B,EAAA,GAAU,EAAG,6JAAiKnxC,QAAO,EAAA+wC,EAAA,GAAQ68B,GAAgB,MAUpR,IARA,IAAIE,EAAsBF,EAAcC,SAEpC5kB,EAAUtX,EAAUm8B,EAAoB3xB,OAAO,SAAU4xB,GAC3D,OAAOA,EAAkB73E,IAC3B,IAAG,SAAU63E,GACX,OAiFF,SAAmBr7E,GACjB,GAAY,MAARA,GAA6B,MAAbA,EAAKwD,MAA6B,MAAbxD,EAAKyH,KAC5C,OAAQzH,EAAKyH,MACX,KAAK8nD,GAAST,OACZ,OAwBC,IAAIzK,GAAkB,CAC3B7gD,MAFoB83E,EAvBMt7E,GAyBAwD,KAC1Bk6C,YAAa49B,EAAoB59B,YACjCyJ,eAAgBm0B,EAAoBn0B,iBAzBlC,KAAKoI,GAASjM,OACZ,OA4CC,IAAIiB,GAAkB,CAC3B/gD,MAFoB+3E,EA3CMv7E,GA6CAwD,KAC1Bk6C,YAAa69B,EAAoB79B,YACjCyK,WAAY,WACV,OAAOqzB,EAAyBD,EAClC,EACA9pE,OAAQ,WACN,OAAOgqE,EAAiBF,EAC1B,IAlDE,KAAKhsB,GAASN,UACZ,OAsDC,IAAIxK,GAAqB,CAC9BjhD,MAFuBk4E,EArDM17E,GAuDAwD,KAC7Bk6C,YAAag+B,EAAuBh+B,YACpCyK,WAAY,WACV,OAAOqzB,EAAyBE,EAClC,EACAjqE,OAAQ,WACN,OAAOgqE,EAAiBC,EAC1B,IA5DE,KAAKnsB,GAASL,MACZ,OA+DR,SAAuBysB,GACrB,IAAKA,EAAmBv+D,cAAe,CACrC,IAAIw+D,GAAwB,EAAAv9B,EAAA,GAAQs9B,GACpC,MAAM,IAAIjzE,MAAM,+CAA+C4E,OAAOsuE,EAAuB,KAC/F,CAEA,OAAO,IAAIj3B,GAAiB,CAC1BnhD,KAAMm4E,EAAmBn4E,KACzBk6C,YAAai+B,EAAmBj+B,YAChC+L,MAAO,WACL,OAAOkyB,EAAmBv+D,cAAcnb,IAAI45E,EAC9C,GAEJ,CA5EeC,CAAc97E,GAEvB,KAAKuvD,GAASpM,KACZ,OA2ER,SAAsB44B,GACpB,IAAKA,EAAkBpsB,WAAY,CACjC,IAAIqsB,GAAuB,EAAA39B,EAAA,GAAQ09B,GACnC,MAAM,IAAIrzE,MAAM,4CAA4C4E,OAAO0uE,EAAsB,KAC3F,CAEA,OAAO,IAAIn3B,GAAgB,CACzBrhD,KAAMu4E,EAAkBv4E,KACxBk6C,YAAaq+B,EAAkBr+B,YAC/B5jC,OAAQmlC,EAAU88B,EAAkBpsB,YAAY,SAAUssB,GACxD,OAAOA,EAAmBz4E,IAC5B,IAAG,SAAUy4E,GACX,MAAO,CACLv+B,YAAau+B,EAAmBv+B,YAChCkL,kBAAmBqzB,EAAmBrzB,kBAE1C,KAEJ,CA7FeszB,CAAal8E,GAEtB,KAAKuvD,GAASH,aACZ,OA4FR,SAA6B+sB,GAC3B,IAAKA,EAAyBrsB,YAAa,CACzC,IAAIssB,GAA8B,EAAA/9B,EAAA,GAAQ89B,GAC1C,MAAM,IAAIzzE,MAAM,6CAA6C4E,OAAO8uE,EAA6B,KACnG,CAEA,OAAO,IAAIr3B,GAAuB,CAChCvhD,KAAM24E,EAAyB34E,KAC/Bk6C,YAAay+B,EAAyBz+B,YACtCjsC,OAAQ,WACN,OAAO4qE,EAAsBF,EAAyBrsB,YACxD,GAEJ,CAzGewsB,CAAoBt8E,GA4CnC,IAA2B07E,EAb3B,IAAwBH,EAvBxB,IAAwBD,EAJtB,IAAIld,GAAU,EAAA/f,EAAA,GAAQr+C,GACtB,MAAM,IAAI0I,MAAM,iIAAiI4E,OAAO8wD,EAAS,KACnK,CA1GSme,CAAUlB,EACnB,IAES/+B,EAAM,EAAGwC,EAAQ,GAAGxxC,OAAOy/C,GAAsB4D,IAAqBrU,EAAMwC,EAAMthD,OAAQ8+C,IAAO,CACxG,IAAIkgC,EAAU19B,EAAMxC,GAEhBia,EAAQimB,EAAQh5E,QAClB+yD,EAAQimB,EAAQh5E,MAAQg5E,EAE5B,CAGA,IAAIz+D,EAAYq9D,EAAoBr9D,UAAY89D,EAAcT,EAAoBr9D,WAAa,KAC3FC,EAAeo9D,EAAoBp9D,aAAe69D,EAAcT,EAAoBp9D,cAAgB,KACpGC,EAAmBm9D,EAAoBn9D,iBAAmB49D,EAAcT,EAAoBn9D,kBAAoB,KAGhHzC,EAAa4/D,EAAoB5/D,WAAa4/D,EAAoB5/D,WAAWvZ,KAoPjF,SAAwBw6E,GACtB,IAAKA,EAAuB75E,KAAM,CAChC,IAAI85E,GAA4B,EAAAr+B,EAAA,GAAQo+B,GACxC,MAAM,IAAI/zE,MAAM,gDAAgD4E,OAAOovE,EAA2B,KACpG,CAEA,IAAKD,EAAuBhgC,UAAW,CACrC,IAAIkgC,GAA6B,EAAAt+B,EAAA,GAAQo+B,GAEzC,MAAM,IAAI/zE,MAAM,qDAAqD4E,OAAOqvE,EAA4B,KAC1G,CAEA,OAAO,IAAI5rB,GAAiB,CAC1BvtD,KAAMi5E,EAAuBj5E,KAC7Bk6C,YAAa++B,EAAuB/+B,YACpC0Q,aAAcquB,EAAuBruB,aACrC3R,UAAWggC,EAAuBhgC,UAAUl/C,QAC5CqF,KAAMy5E,EAAsBI,EAAuB75E,OAEvD,IAvQuG,GAEvG,OAAO,IAAI+uD,GAAc,CACvBjU,YAAa09B,EAAoB19B,YACjCx4C,MAAO6Y,EACPsV,SAAUrV,EACVxc,aAAcyc,EACdwrC,MAAO,EAAa8M,GACpB/6C,WAAYA,EACZu2C,YAAyB,OAAZ7tD,QAAgC,IAAZA,OAAqB,EAASA,EAAQ6tD,cAIzE,SAASvB,EAAQosB,GACf,GAAIA,EAAQn1E,OAAS8nD,GAASlM,KAAM,CAClC,IAAIw5B,EAAUD,EAAQr3B,OAEtB,IAAKs3B,EACH,MAAM,IAAIn0E,MAAM,mDAGlB,OAAO,IAAIu8C,GAAYuL,EAAQqsB,GACjC,CAEA,GAAID,EAAQn1E,OAAS8nD,GAASC,SAAU,CACtC,IAAIstB,EAAcF,EAAQr3B,OAE1B,IAAKu3B,EACH,MAAM,IAAIp0E,MAAM,mDAIlB,OAAO,IAAIy8C,GAAec,GADPuK,EAAQssB,IAE7B,CAEA,OAAOv2B,EAAaq2B,EACtB,CAEA,SAASr2B,EAAaq2B,GACpB,IAAIlzB,EAAWkzB,EAAQp5E,KAEvB,IAAKkmD,EACH,MAAM,IAAIhhD,MAAM,2BAA2B4E,QAAO,EAAA+wC,EAAA,GAAQu+B,GAAU,MAGtE,IAAI58E,EAAOu2D,EAAQ7M,GAEnB,IAAK1pD,EACH,MAAM,IAAI0I,MAAM,+CAA+C4E,OAAOo8C,EAAU,wFAGlF,OAAO1pD,CACT,CAEA,SAAS67E,EAAce,GACrB,OAAOp4B,EAAiB+B,EAAaq2B,GACvC,CAEA,SAASG,EAAiBH,GACxB,OAAOl4B,EAAoB6B,EAAaq2B,GAC1C,CAuCA,SAASpB,EAAyBwB,GAGhC,GAA6C,OAAzCA,EAA0B70B,YAAuB60B,EAA0Bv1E,OAAS8nD,GAASN,UAC/F,MAAO,GAGT,IAAK+tB,EAA0B70B,WAAY,CACzC,IAAI80B,GAA+B,EAAA5+B,EAAA,GAAQ2+B,GAC3C,MAAM,IAAIt0E,MAAM,4CAA4C4E,OAAO2vE,EAA8B,KACnG,CAEA,OAAOD,EAA0B70B,WAAWlmD,IAAI86E,EAClD,CA8EA,SAAStB,EAAiBJ,GACxB,IAAKA,EAAkB5pE,OACrB,MAAM,IAAI/I,MAAM,wCAAwC4E,QAAO,EAAA+wC,EAAA,GAAQg9B,GAAoB,MAG7F,OAAOp8B,EAAUo8B,EAAkB5pE,QAAQ,SAAUyrE,GACnD,OAAOA,EAAmB15E,IAC5B,GAAG25E,EACL,CAEA,SAASA,EAAWD,GAClB,IAAIl9E,EAAOwwD,EAAQ0sB,EAAmBl9E,MAEtC,IAAKylD,GAAazlD,GAAO,CACvB,IAAIo+D,GAAU,EAAA/f,EAAA,GAAQr+C,GACtB,MAAM,IAAI0I,MAAM,oEAAoE4E,OAAO8wD,EAAS,KACtG,CAEA,IAAK8e,EAAmBt6E,KAAM,CAC5B,IAAIw6E,GAAwB,EAAA/+B,EAAA,GAAQ6+B,GACpC,MAAM,IAAIx0E,MAAM,4CAA4C4E,OAAO8vE,EAAuB,KAC5F,CAEA,MAAO,CACL1/B,YAAaw/B,EAAmBx/B,YAChCkL,kBAAmBs0B,EAAmBt0B,kBACtC5oD,KAAMA,EACN4C,KAAMy5E,EAAsBa,EAAmBt6E,MAEnD,CAEA,SAASy5E,EAAsBgB,GAC7B,OAAOp+B,EAAUo+B,GAA0B,SAAUhzB,GACnD,OAAOA,EAAW7mD,IACpB,GAAG85E,EACL,CAEA,SAASA,EAAgBC,GACvB,IAAIv9E,EAAOwwD,EAAQ+sB,EAAwBv9E,MAE3C,IAAKqlD,GAAYrlD,GAAO,CACtB,IAAIo+D,GAAU,EAAA/f,EAAA,GAAQr+C,GACtB,MAAM,IAAI0I,MAAM,sEAAsE4E,OAAO8wD,EAAS,KACxG,CAEA,IAAI5rB,EAAuD,MAAxC+qC,EAAwB/qC,aAAuBi/B,IAAa,QAAW8L,EAAwB/qC,cAAexyC,QAAQ6C,EACzI,MAAO,CACL66C,YAAa6/B,EAAwB7/B,YACrC19C,KAAMA,EACNwyC,aAAcA,EACdoW,kBAAmB20B,EAAwB30B,kBAE/C,CAsBF,C,gBC1TA,SAAS,GAAQjoD,EAAQu4C,GAAkB,IAAIpwC,EAAO/D,OAAO+D,KAAKnI,GAAS,GAAIoE,OAAOo0C,sBAAuB,CAAE,IAAIC,EAAUr0C,OAAOo0C,sBAAsBx4C,GAAau4C,IAAgBE,EAAUA,EAAQz3C,QAAO,SAAU03C,GAAO,OAAOt0C,OAAOu0C,yBAAyB34C,EAAQ04C,GAAKld,UAAY,KAAIrzB,EAAKlP,KAAK6M,MAAMqC,EAAMswC,EAAU,CAAE,OAAOtwC,CAAM,CAEpV,SAAS,GAAc2mC,GAAU,IAAK,IAAIrpC,EAAI,EAAGA,EAAIE,UAAU9I,OAAQ4I,IAAK,CAAE,IAAIyB,EAAyB,MAAhBvB,UAAUF,GAAaE,UAAUF,GAAK,CAAC,EAAOA,EAAI,EAAK,GAAQrB,OAAO8C,IAAS,GAAMN,SAAQ,SAAU1G,GAAO,GAAgB4uC,EAAQ5uC,EAAKgH,EAAOhH,GAAO,IAAekE,OAAO83C,0BAA6B93C,OAAO+3C,iBAAiBrN,EAAQ1qC,OAAO83C,0BAA0Bh1C,IAAmB,GAAQ9C,OAAO8C,IAASN,SAAQ,SAAU1G,GAAOkE,OAAOm3B,eAAeuT,EAAQ5uC,EAAKkE,OAAOu0C,yBAAyBzxC,EAAQhH,GAAO,GAAM,CAAE,OAAO4uC,CAAQ,CAErhB,SAAS,GAAgBz8B,EAAKnS,EAAKC,GAAiK,OAApJD,KAAOmS,EAAOjO,OAAOm3B,eAAelpB,EAAKnS,EAAK,CAAEC,MAAOA,EAAOq7B,YAAY,EAAMC,cAAc,EAAMod,UAAU,IAAkBxmC,EAAInS,GAAOC,EAAgBkS,CAAK,CAuCzM,SAASwqE,GAAanyB,EAAQolB,EAAavsE,GAChD0tD,GAAavG,GACE,MAAfolB,GAAuBA,EAAYhpE,OAAS,IAAKg2E,WAAY,EAAAh/B,EAAA,GAAU,EAAG,qCAEM,KAA/D,OAAZv6C,QAAgC,IAAZA,OAAqB,EAASA,EAAQ6tD,eAAwG,KAAlE,OAAZ7tD,QAAgC,IAAZA,OAAqB,EAASA,EAAQw5E,iBtBmD9I,SAAiCjN,EAAaplB,GACnD,IAAIzlD,EAASkrE,GAAYL,EAAaplB,GAEtC,GAAsB,IAAlBzlD,EAAOpI,OACT,MAAM,IAAIkL,MAAM9C,EAAO3D,KAAI,SAAUrD,GACnC,OAAOA,EAAMe,OACf,IAAGmb,KAAK,QAEZ,CsB1DI6iE,CAAwBlN,EAAaplB,GAGvC,IAAIuyB,EAAevyB,EAAO5D,WACtBo2B,EAAiBC,GAAiBF,EAAcnN,EAAavsE,GACjE,OAAO05E,IAAiBC,EAAiBxyB,EAAS,IAAIsG,GAAcksB,EACtE,CAKO,SAASC,GAAiBF,EAAcnN,EAAavsE,GAa1D,IAZA,IAAI65E,EAAYC,EAAuBC,EAAaC,EAQhDC,EALArjD,EAAW,GACXsjD,EAAoBr5E,OAAO3C,OAAO,MAGlCi8E,EAAgB,GAGhBC,EAAmB,GAEdhiC,EAAM,EAAGw+B,EAAyBrK,EAAYnpE,YAAag1C,EAAMw+B,EAAuBt9E,OAAQ8+C,IAAO,CAC9G,IAAIntC,EAAM2rE,EAAuBx+B,GAEjC,GAAIntC,EAAI1H,OAAS,IAAKq1D,kBACpBqhB,EAAYhvE,OACP,GAAIA,EAAI1H,OAAS,IAAKs1D,iBAC3BuhB,EAAiB1kF,KAAKuV,QACjB,IAAI,SAAqBA,GAC9B2rB,EAASlhC,KAAKuV,QACT,IAAI,SAAoBA,GAAM,CACnC,IAAIovE,EAAmBpvE,EAAI3L,KAAK1C,MAC5B09E,EAAyBJ,EAAkBG,GAC/CH,EAAkBG,GAAoBC,EAAyBA,EAAuBlxE,OAAO,CAAC6B,IAAQ,CAACA,EACzG,MAAWA,EAAI1H,OAAS,IAAKo6D,sBAC3Bwc,EAAczkF,KAAKuV,EAEvB,CAIA,GAA8C,IAA1CpK,OAAO+D,KAAKs1E,GAAmB5gF,QAAoC,IAApBs9B,EAASt9B,QAAyC,IAAzB6gF,EAAc7gF,QAA4C,IAA5B8gF,EAAiB9gF,QAA6B,MAAb2gF,EACzI,OAAOP,EAKT,IAFA,IAAIrnB,EAAUxxD,OAAO3C,OAAO,MAEnB+6C,EAAM,EAAGshC,EAAuBb,EAAan0B,MAAOtM,EAAMshC,EAAqBjhF,OAAQ2/C,IAAO,CACrG,IAAIiwB,EAAeqR,EAAqBthC,GACxCoZ,EAAQ6W,EAAa5pE,MAAQk7E,EAAgBtR,EAC/C,CAEA,IAAK,IAAI/vB,EAAM,EAAGA,EAAMviB,EAASt9B,OAAQ6/C,IAAO,CAC9C,IAAIshC,EAEAjlB,EAAW5+B,EAASuiB,GACpB75C,EAAOk2D,EAASl2D,KAAK1C,MACzBy1D,EAAQ/yD,GAAkD,QAAzCm7E,EAAmBC,GAAWp7E,UAAwC,IAArBm7E,EAA8BA,EAAmBpC,EAAU7iB,EAC/H,CAEA,IAAItC,EAAiB,GAAc,GAAc,CAE/ClyD,MAAO04E,EAAa14E,OAAS25E,EAAiBjB,EAAa14E,OAC3DmuB,SAAUuqD,EAAavqD,UAAYwrD,EAAiBjB,EAAavqD,UACjE7xB,aAAco8E,EAAap8E,cAAgBq9E,EAAiBjB,EAAap8E,eACxE28E,GAAaW,EAAkB,CAACX,KAAcW,EAAkBR,IAGnE,OAAO,GAAc,GAAc,CACjC5gC,YAA0C,QAA5BqgC,EAAaI,SAAsC,IAAfJ,GAAsF,QAApDC,EAAwBD,EAAWrgC,mBAAmD,IAA1BsgC,OAAtE,EAAkHA,EAAsBl9E,OACjNs2D,GAAiB,CAAC,EAAG,CACtB3N,MAAO,EAAa8M,GACpB/6C,WAAY,GAAGlO,OAAOswE,EAAapiE,WAAWvZ,KA6BhD,SAA0B2rB,GACxB,IAAI/f,EAAS+f,EAAU65B,WACvB,OAAO,IAAIsJ,GAAiB,GAAc,GAAc,CAAC,EAAGljD,GAAS,CAAC,EAAG,CACvEjL,KAAMg8C,EAAS/wC,EAAOjL,KAAMm8E,KAEhC,IAlCuEV,EAAcp8E,KAiOrF,SAAwB4G,GACtB,IAAI4zC,EAAY5zC,EAAK4zC,UAAUx6C,KAAI,SAAUs9C,GAE3C,OADYA,EAAKz+C,KAEnB,IACA,OAAO,IAAIiwD,GAAiB,CAC1BvtD,KAAMqF,EAAKrF,KAAK1C,MAChB48C,YAAashC,GAAen2E,EAAM3E,GAClCu4C,UAAWA,EACX2R,aAAcvlD,EAAKq6D,WACnBtgE,KAAMq8E,EAAiBp2E,EAAKvC,WAC5BghD,QAASz+C,GAEb,KA7OEovB,gBAAYp1B,EACZykD,QAAuC,QAA7B22B,EAAcE,SAAuC,IAAhBF,EAAyBA,EAAcL,EAAat2B,QACnGC,kBAAmBq2B,EAAar2B,kBAAkBj6C,OAAOgxE,GACzDvsB,YAAgH,QAAlGmsB,EAAmC,OAAZh6E,QAAgC,IAAZA,OAAqB,EAASA,EAAQ6tD,mBAAkD,IAAzBmsB,GAAkCA,IAI5J,SAASgB,EAAYl/E,GACnB,OAAIikD,GAAWjkD,GAEN,IAAIilD,GAAYi6B,EAAYl/E,EAAKulD,SAGtCrB,GAAclkD,GAET,IAAImlD,GAAe+5B,EAAYl/E,EAAKulD,SAGtCs5B,EAAiB7+E,EAC1B,CAEA,SAAS6+E,EAAiB7+E,GAIxB,OAAOu2D,EAAQv2D,EAAKwD,KACtB,CASA,SAASk7E,EAAgB1+E,GACvB,OAAI4wD,GAAoB5wD,IAASgtD,GAAsBhtD,GAE9CA,EAGL2jD,EAAa3jD,GAyDnB,SAA0BA,GAOxB,IANA,IAAIm/E,EAEAtxE,EAAS7N,EAAKynD,WACdxvB,EAA2E,QAA7DknD,EAAyBf,EAAkBvwE,EAAOrK,aAA8C,IAA3B27E,EAAoCA,EAAyB,GAChJh4B,EAAiBt5C,EAAOs5C,eAEnByL,EAAM,EAAGA,EAAM36B,EAAWz6B,OAAQo1D,IAAO,CAChD,IAAIwsB,EAGJj4B,EAA6E,QAA3Di4B,EAAqBC,GADnBpnD,EAAW26B,WAC6E,IAAvBwsB,EAAgCA,EAAqBj4B,CAC5I,CAEA,OAAO,IAAI9C,GAAkB,GAAc,GAAc,CAAC,EAAGx2C,GAAS,CAAC,EAAG,CACxEs5C,eAAgBA,EAChBI,kBAAmB15C,EAAO05C,kBAAkBj6C,OAAO2qB,KAEvD,CA1EWqnD,CAAiBt/E,GAGtB4jD,EAAa5jD,GAyEnB,SAA0BA,GACxB,IAAIu/E,EAEA1xE,EAAS7N,EAAKynD,WACdxvB,EAA2E,QAA7DsnD,EAAyBnB,EAAkBvwE,EAAOrK,aAA8C,IAA3B+7E,EAAoCA,EAAyB,GACpJ,OAAO,IAAIh7B,GAAkB,GAAc,GAAc,CAAC,EAAG12C,GAAS,CAAC,EAAG,CACxEs6C,WAAY,WACV,MAAO,GAAG76C,OAAOtN,EAAKkoD,gBAAgBjmD,IAAI48E,GAAmBW,EAAgBvnD,GAC/E,EACAxmB,OAAQ,WACN,OAAO,GAAc,GAAc,CAAC,EAAGmtC,EAAS/wC,EAAO4D,OAAQguE,IAAeC,EAAcznD,GAC9F,EACAsvB,kBAAmB15C,EAAO05C,kBAAkBj6C,OAAO2qB,KAEvD,CAtFW0nD,CAAiB3/E,GAGtB6jD,EAAgB7jD,GAqFtB,SAA6BA,GAC3B,IAAI4/E,EAEA/xE,EAAS7N,EAAKynD,WACdxvB,EAA2E,QAA7D2nD,EAAyBxB,EAAkBvwE,EAAOrK,aAA8C,IAA3Bo8E,EAAoCA,EAAyB,GACpJ,OAAO,IAAIn7B,GAAqB,GAAc,GAAc,CAAC,EAAG52C,GAAS,CAAC,EAAG,CAC3Es6C,WAAY,WACV,MAAO,GAAG76C,OAAOtN,EAAKkoD,gBAAgBjmD,IAAI48E,GAAmBW,EAAgBvnD,GAC/E,EACAxmB,OAAQ,WACN,OAAO,GAAc,GAAc,CAAC,EAAGmtC,EAAS/wC,EAAO4D,OAAQguE,IAAeC,EAAcznD,GAC9F,EACAsvB,kBAAmB15C,EAAO05C,kBAAkBj6C,OAAO2qB,KAEvD,CAlGW4nD,CAAoB7/E,GAGzB8jD,EAAY9jD,GAiGlB,SAAyBA,GACvB,IAAI8/E,EAEAjyE,EAAS7N,EAAKynD,WACdxvB,EAA2E,QAA7D6nD,EAAyB1B,EAAkBvwE,EAAOrK,aAA8C,IAA3Bs8E,EAAoCA,EAAyB,GACpJ,OAAO,IAAIn7B,GAAiB,GAAc,GAAc,CAAC,EAAG92C,GAAS,CAAC,EAAG,CACvE47C,MAAO,WACL,MAAO,GAAGn8C,OAAOtN,EAAKupD,WAAWtnD,IAAI48E,GAAmBkB,EAAgB9nD,GAC1E,EACAsvB,kBAAmB15C,EAAO05C,kBAAkBj6C,OAAO2qB,KAEvD,CA3GW+nD,CAAgBhgF,GAGrB+jD,EAAW/jD,GA8BjB,SAAwBA,GACtB,IAAIigF,EAEApyE,EAAS7N,EAAKynD,WACdxvB,EAAwE,QAA1DgoD,EAAwB7B,EAAkBp+E,EAAKwD,aAA6C,IAA1By8E,EAAmCA,EAAwB,GAC/I,OAAO,IAAIp7B,GAAgB,GAAc,GAAc,CAAC,EAAGh3C,GAAS,CAAC,EAAG,CACtEiM,OAAQ,GAAc,GAAc,CAAC,EAAGjM,EAAOiM,QAASomE,EAAkBjoD,IAC1EsvB,kBAAmB15C,EAAO05C,kBAAkBj6C,OAAO2qB,KAEvD,CAtCWkoD,CAAengF,GAIpBgkD,GAAkBhkD,GAQxB,SAA+BA,GAC7B,IAAIogF,EAEAvyE,EAAS7N,EAAKynD,WACdxvB,EAA0E,QAA5DmoD,EAAwBhC,EAAkBvwE,EAAOrK,aAA6C,IAA1B48E,EAAmCA,EAAwB,GACjJ,OAAO,IAAIr7B,GAAuB,GAAc,GAAc,CAAC,EAAGl3C,GAAS,CAAC,EAAG,CAC7E4D,OAAQ,WACN,OAAO,GAAc,GAAc,CAAC,EAAGmtC,EAAS/wC,EAAO4D,QAAQ,SAAU7C,GACvE,OAAO,GAAc,GAAc,CAAC,EAAGA,GAAQ,CAAC,EAAG,CACjD5O,KAAMk/E,EAAYtwE,EAAM5O,OAE5B,KAAKqgF,EAAmBpoD,GAC1B,EACAsvB,kBAAmB15C,EAAO05C,kBAAkBj6C,OAAO2qB,KAEvD,CAtBWqoD,CAAsBtgF,QAItB,EAAAwjD,EAAA,GAAU,EAAG,qBAAsB,EAAAnF,EAAA,GAAQr+C,GACtD,CA+FA,SAASy/E,EAAY7wE,GACnB,OAAO,GAAc,GAAc,CAAC,EAAGA,GAAQ,CAAC,EAAG,CACjD5O,KAAMk/E,EAAYtwE,EAAM5O,MAExB4C,KAAMg8C,EAAShwC,EAAMhM,KAAMm8E,IAE/B,CAEA,SAASA,EAAU11E,GACjB,OAAO,GAAc,GAAc,CAAC,EAAGA,GAAM,CAAC,EAAG,CAC/CrJ,KAAMk/E,EAAY71E,EAAIrJ,OAE1B,CAEA,SAAS8+E,EAAkBjjC,GAGzB,IAFA,IAAI0kC,EAAU,CAAC,EAENxtB,EAAO,EAAGA,EAAOlX,EAAMr+C,OAAQu1D,IAOtC,IANA,IAAI+Y,EAIAC,EAAuE,QAAhDD,EAFhBjwB,EAAMkX,GAEsCqE,sBAAqD,IAAzB0U,EAAkCA,EAAuB,GAEnI1Y,EAAO,EAAGA,EAAO2Y,EAAoBvuE,OAAQ41D,IAAQ,CAC5D,IAAI4Y,EAAgBD,EAAoB3Y,GACxCmtB,EAAQvU,EAAcxnE,WAAa+hD,EAAaylB,EAAchsE,KAChE,CAMF,OAAOugF,CACT,CAEA,SAASh6B,EAAa19C,GACpB,IAAI23E,EAEAh9E,EAAOqF,EAAKrF,KAAK1C,MACjBd,EAAkD,QAA1CwgF,EAAoB5B,GAAWp7E,UAAyC,IAAtBg9E,EAA+BA,EAAoBjqB,EAAQ/yD,GAEzH,QAAaX,IAAT7C,EACF,MAAM,IAAI0I,MAAM,kBAAmB4E,OAAO9J,EAAM,OAGlD,OAAOxD,CACT,CAEA,SAASygF,EAAe53E,GACtB,OAAIA,EAAKpB,OAAS,IAAKuyD,UACd,IAAI/U,GAAYw7B,EAAe53E,EAAK7I,OAGzC6I,EAAKpB,OAAS,IAAKwyD,cACd,IAAI9U,GAAes7B,EAAe53E,EAAK7I,OAGzCumD,EAAa19C,EACtB,CAiBA,SAAS62E,EAAc7jC,GAGrB,IAFA,IAAI6kC,EAAiB37E,OAAO3C,OAAO,MAE1ByxD,EAAO,EAAGA,EAAOhY,EAAMr+C,OAAQq2D,IAOtC,IANA,IAAI8Z,EAIAgT,EAA8C,QAAhChT,EAFP9xB,EAAMgY,GAEqBpiD,cAAqC,IAAjBk8D,EAA0BA,EAAe,GAE1F5Z,EAAO,EAAGA,EAAO4sB,EAAWnjF,OAAQu2D,IAAQ,CACnD,IAAInlD,EAAQ+xE,EAAW5sB,GACvB2sB,EAAe9xE,EAAMpL,KAAK1C,OAAS,CAIjCd,KAAMygF,EAAe7xE,EAAM5O,MAC3B09C,YAAashC,GAAepwE,EAAO1K,GACnCtB,KAAMq8E,EAAiBrwE,EAAMtI,WAC7BsiD,kBAAmBg4B,GAAqBhyE,GACxC04C,QAAS14C,EAEb,CAGF,OAAO8xE,CACT,CAEA,SAASzB,EAAiBr8E,GAKxB,IAHA,IAAIghE,EAAqB,OAAThhE,QAA0B,IAATA,EAAkBA,EAAO,GACtDi+E,EAAe97E,OAAO3C,OAAO,MAExB6xD,EAAO,EAAGA,EAAO2P,EAAUpmE,OAAQy2D,IAAQ,CAClD,IAAI5qD,EAAMu6D,EAAU3P,GAIhBj0D,EAAOygF,EAAep3E,EAAIrJ,MAC9B6gF,EAAax3E,EAAI7F,KAAK1C,OAAS,CAC7Bd,KAAMA,EACN09C,YAAashC,GAAe31E,EAAKnF,GACjCsuC,aAAci/B,GAAapoE,EAAImpC,aAAcxyC,GAC7C4oD,kBAAmBg4B,GAAqBv3E,GACxCi+C,QAASj+C,EAEb,CAEA,OAAOw3E,CACT,CAEA,SAASR,EAAmBxkC,GAG1B,IAFA,IAAIilC,EAAgB/7E,OAAO3C,OAAO,MAEzBiyD,EAAO,EAAGA,EAAOxY,EAAMr+C,OAAQ62D,IAOtC,IANA,IAAI0sB,EAIAC,EAAgD,QAAjCD,EAFRllC,EAAMwY,GAEuB5iD,cAAsC,IAAlBsvE,EAA2BA,EAAgB,GAE9FxsB,EAAO,EAAGA,EAAOysB,EAAYxjF,OAAQ+2D,IAAQ,CACpD,IAAI3lD,EAAQoyE,EAAYzsB,GAIpBv0D,EAAOygF,EAAe7xE,EAAM5O,MAChC8gF,EAAclyE,EAAMpL,KAAK1C,OAAS,CAChCd,KAAMA,EACN09C,YAAashC,GAAepwE,EAAO1K,GACnCsuC,aAAci/B,GAAa7iE,EAAM4jC,aAAcxyC,GAC/C4oD,kBAAmBg4B,GAAqBhyE,GACxC04C,QAAS14C,EAEb,CAGF,OAAOkyE,CACT,CAEA,SAASZ,EAAkBrkC,GAGzB,IAFA,IAAIolC,EAAel8E,OAAO3C,OAAO,MAExBqyD,EAAO,EAAGA,EAAO5Y,EAAMr+C,OAAQi3D,IAOtC,IANA,IAAIuY,EAIA3f,EAA+C,QAAhC2f,EAFRnxB,EAAM4Y,GAEsB36C,cAAqC,IAAjBkzD,EAA0BA,EAAe,GAE3FtY,EAAO,EAAGA,EAAOrH,EAAY7vD,OAAQk3D,IAAQ,CACpD,IAAI5zD,EAAQusD,EAAYqH,GACxBusB,EAAangF,EAAM0C,KAAK1C,OAAS,CAC/B48C,YAAashC,GAAel+E,EAAOoD,GACnC0kD,kBAAmBg4B,GAAqB9/E,GACxCwmD,QAASxmD,EAEb,CAGF,OAAOmgF,CACT,CAEA,SAASzB,EAAgB3jC,GAGvB,IAFA,IAAIsM,EAAa,GAERyM,EAAO,EAAGA,EAAO/Y,EAAMr+C,OAAQo3D,IAOtC,IANA,IAAIssB,EAIAC,EAA2D,QAAxCD,EAFZrlC,EAAM+Y,GAE8BzM,kBAA6C,IAArB+4B,EAA8BA,EAAmB,GAE/GlrB,EAAO,EAAGA,EAAOmrB,EAAgB3jF,OAAQw4D,IAAQ,CACxD,IAAIh2D,EAAOmhF,EAAgBnrB,GAK3B7N,EAAWvuD,KAAK2sD,EAAavmD,GAC/B,CAGF,OAAOmoD,CACT,CAEA,SAAS43B,EAAgBlkC,GAGvB,IAFA,IAAI4N,EAAQ,GAEH8P,EAAO,EAAGA,EAAO1d,EAAMr+C,OAAQ+7D,IAOtC,IANA,IAAI6nB,EAIAC,EAA2C,QAA9BD,EAFNvlC,EAAM0d,GAEmB9P,aAAmC,IAAhB23B,EAAyBA,EAAc,GAErFE,EAAO,EAAGA,EAAOD,EAAU7jF,OAAQ8jF,IAAQ,CAClD,IAAIthF,EAAOqhF,EAAUC,GAKrB73B,EAAM7vD,KAAK2sD,EAAavmD,GAC1B,CAGF,OAAOypD,CACT,CAEA,SAAS8yB,EAAUj1B,GACjB,IAAIi6B,EAEA/9E,EAAO8jD,EAAQ9jD,KAAK1C,MACpB48C,EAAcshC,GAAe13B,EAASpjD,GACtCs9E,EAAuE,QAArDD,EAAwBnD,EAAkB56E,UAA6C,IAA1B+9E,EAAmCA,EAAwB,GAE9I,OAAQj6B,EAAQ7/C,MACd,KAAK,IAAK06D,uBAEN,IAAI5a,EAAoBi6B,EACpBC,EAAW,CAACn6B,GAASh6C,OAAOi6C,GAChC,OAAO,IAAIhD,GAAkB,CAC3B/gD,KAAMA,EACNk6C,YAAaA,EACbyK,WAAY,WACV,OAAOq3B,EAAgBiC,EACzB,EACAhwE,OAAQ,WACN,OAAOiuE,EAAc+B,EACvB,EACAn6B,QAASA,EACTC,kBAAmBA,IAIzB,KAAK,IAAK8a,0BAEN,IAAIqf,EAAqBF,EAErBG,EAAY,CAACr6B,GAASh6C,OAAOo0E,GAEjC,OAAO,IAAIj9B,GAAqB,CAC9BjhD,KAAMA,EACNk6C,YAAaA,EACbyK,WAAY,WACV,OAAOq3B,EAAgBmC,EACzB,EACAlwE,OAAQ,WACN,OAAOiuE,EAAciC,EACvB,EACAr6B,QAASA,EACTC,kBAAmBm6B,IAIzB,KAAK,IAAKjf,qBAEN,IAAImf,EAAsBJ,EAEtBK,EAAa,CAACv6B,GAASh6C,OAAOs0E,GAElC,OAAO,IAAI/8B,GAAgB,CACzBrhD,KAAMA,EACNk6C,YAAaA,EACb5jC,OAAQomE,EAAkB2B,GAC1Bv6B,QAASA,EACTC,kBAAmBq6B,IAIzB,KAAK,IAAKrf,sBAEN,IAAIuf,EAAsBN,EAEtBO,EAAa,CAACz6B,GAASh6C,OAAOw0E,GAElC,OAAO,IAAIn9B,GAAiB,CAC1BnhD,KAAMA,EACNk6C,YAAaA,EACb+L,MAAO,WACL,OAAOs2B,EAAgBgC,EACzB,EACAz6B,QAASA,EACTC,kBAAmBu6B,IAIzB,KAAK,IAAK7f,uBAEN,IAAI+f,EAAsBR,EAC1B,OAAO,IAAIn9B,GAAkB,CAC3B7gD,KAAMA,EACNk6C,YAAaA,EACbyJ,eAAgBk4B,GAAkB/3B,GAClCA,QAASA,EACTC,kBAAmBy6B,IAIzB,KAAK,IAAKpf,6BAEN,IAAIqf,EAAsBT,EAEtBU,EAAa,CAAC56B,GAASh6C,OAAO20E,GAElC,OAAO,IAAIl9B,GAAuB,CAChCvhD,KAAMA,EACNk6C,YAAaA,EACbjsC,OAAQ,WACN,OAAO4uE,EAAmB6B,EAC5B,EACA56B,QAASA,EACTC,kBAAmB06B,KAMlB,EAAAz+B,EAAA,GAAU,EAAG,qCAAsC,EAAAnF,EAAA,GAAQiJ,GACtE,CACF,CACA,IAAIs3B,GAAajgC,EAAOoO,GAAqBz/C,OAAOqjD,KAAqB,SAAU3wD,GACjF,OAAOA,EAAKwD,IACd,IAMA,SAASo9E,GAAqB/3E,GAC5B,IAAIs5E,EAAa3O,GAAmBliB,GAA4BzoD,GAChE,OAAsB,OAAfs5E,QAAsC,IAAfA,OAAwB,EAASA,EAAWriF,MAC5E,CAMA,SAASu/E,GAAkBx2E,GACzB,IAAIu5E,EAAc5O,GAAmBjiB,GAA6B1oD,GAClE,OAAuB,OAAhBu5E,QAAwC,IAAhBA,OAAyB,EAASA,EAAY5jF,GAC/E,CAaO,SAASwgF,GAAen2E,EAAM3E,GACnC,GAAI2E,EAAK60C,YACP,OAAO70C,EAAK60C,YAAY58C,MAG1B,IAAwF,KAAvE,OAAZoD,QAAgC,IAAZA,OAAqB,EAASA,EAAQm+E,qBAA+B,CAC5F,IAAIC,EAQR,SAAgCz5E,GAC9B,IAAIjB,EAAMiB,EAAKjB,IAEf,IAAKA,EACH,OAGF,IAAI26E,EAAW,GACXC,EAAQ56E,EAAImB,WAAWmoE,KAE3B,KAAgB,MAATsR,GAAiBA,EAAM/6E,OAAS,KAAUg7E,SAAWD,EAAM38E,MAAQ28E,EAAMtR,MAAQsR,EAAM12C,KAAO,IAAM02C,EAAM38E,KAAKimC,MAAQ02C,EAAM12C,OAAS02C,EAAMtR,KAAKplC,MAAM,CAC5J,IAAIhrC,EAAQgd,OAAO0kE,EAAM1hF,OACzByhF,EAAS3oF,KAAKkH,GACd0hF,EAAQA,EAAMtR,IAChB,CAEA,OAAOqR,EAAS/kF,OAAS,EAAI+kF,EAASjR,UAAUx2D,KAAK,WAAQjY,CAC/D,CAzBmB6/E,CAAuB75E,GAEtC,QAAiBhG,IAAby/E,EACF,OAAO,SAAuB,KAAOA,EAEzC,CACF,CCroBO,SAASK,GAAelS,EAAavsE,GAC3B,MAAfusE,GAAuBA,EAAYhpE,OAAS,IAAKg2E,WAAY,EAAAh/B,EAAA,GAAU,EAAG,qCAEM,KAA/D,OAAZv6C,QAAgC,IAAZA,OAAqB,EAASA,EAAQ6tD,eAAwG,KAAlE,OAAZ7tD,QAAgC,IAAZA,OAAqB,EAASA,EAAQw5E,iBvBuD9I,SAAwBjN,GAC7B,IAAI7qE,EAASkrE,GAAYL,GAEzB,GAAsB,IAAlB7qE,EAAOpI,OACT,MAAM,IAAIkL,MAAM9C,EAAO3D,KAAI,SAAUrD,GACnC,OAAOA,EAAMe,OACf,IAAGmb,KAAK,QAEZ,CuB9DI8nE,CAAenS,GAGjB,IAQI5iE,EAASiwE,GARW,CACtBpgC,iBAAa76C,EACb4mD,MAAO,GACPjuC,WAAY,GACZyc,gBAAYp1B,EACZ0kD,kBAAmB,GACnBwK,aAAa,GAEkC0e,EAAavsE,GAE9D,GAAsB,MAAlB2J,EAAOy5C,QACT,IAAK,IAAIhL,EAAM,EAAG+V,EAAiBxkD,EAAO47C,MAAOnN,EAAM+V,EAAe70D,OAAQ8+C,IAAO,CACnF,IAAIt8C,EAAOqyD,EAAe/V,GAE1B,OAAQt8C,EAAKwD,MAIX,IAAK,QACHqK,EAAO3I,MAAQlF,EACf,MAEF,IAAK,WACH6N,EAAOwlB,SAAWrzB,EAClB,MAEF,IAAK,eACH6N,EAAOrM,aAAexB,EAG5B,CAeF,IAZA,IAAIwb,EAAa3N,EAAO2N,WAEpB28C,EAAQ,SAAehb,GACzB,IAAI0lC,EAAerxB,GAAoBrU,GAEnC3hC,EAAW/M,OAAM,SAAUmf,GAC7B,OAAOA,EAAUpqB,OAASq/E,EAAar/E,IACzC,KACEgY,EAAW5hB,KAAKipF,EAEpB,EAES1lC,EAAM,EAAGA,EAAMqU,GAAoBh0D,OAAQ2/C,IAClDgb,EAAMhb,GAGR,OAAO,IAAIwU,GAAc9jD,EAC3B,CAMO,SAASi1E,GAAYj7E,EAAQ3D,GAOlC,OAAOy+E,IANQ,QAAM96E,EAAQ,CAC3Bk7E,WAAwB,OAAZ7+E,QAAgC,IAAZA,OAAqB,EAASA,EAAQ6+E,WACtEC,0BAAuC,OAAZ9+E,QAAgC,IAAZA,OAAqB,EAASA,EAAQ8+E,0BACrFC,mCAAgD,OAAZ/+E,QAAgC,IAAZA,OAAqB,EAASA,EAAQ++E,mCAC9Fn8E,8BAA2C,OAAZ5C,QAAgC,IAAZA,OAAqB,EAASA,EAAQ4C,gCAE3D,CAC9Bu7E,oBAAiC,OAAZn+E,QAAgC,IAAZA,OAAqB,EAASA,EAAQm+E,oBAC/E3E,eAA4B,OAAZx5E,QAAgC,IAAZA,OAAqB,EAASA,EAAQw5E,eAC1E3rB,YAAyB,OAAZ7tD,QAAgC,IAAZA,OAAqB,EAASA,EAAQ6tD,aAE3E,CCnGA,SAAS,GAAQpxD,EAAQu4C,GAAkB,IAAIpwC,EAAO/D,OAAO+D,KAAKnI,GAAS,GAAIoE,OAAOo0C,sBAAuB,CAAE,IAAIC,EAAUr0C,OAAOo0C,sBAAsBx4C,GAAau4C,IAAgBE,EAAUA,EAAQz3C,QAAO,SAAU03C,GAAO,OAAOt0C,OAAOu0C,yBAAyB34C,EAAQ04C,GAAKld,UAAY,KAAIrzB,EAAKlP,KAAK6M,MAAMqC,EAAMswC,EAAU,CAAE,OAAOtwC,CAAM,CAEpV,SAAS,GAAc2mC,GAAU,IAAK,IAAIrpC,EAAI,EAAGA,EAAIE,UAAU9I,OAAQ4I,IAAK,CAAE,IAAIyB,EAAyB,MAAhBvB,UAAUF,GAAaE,UAAUF,GAAK,CAAC,EAAOA,EAAI,EAAK,GAAQrB,OAAO8C,IAAS,GAAMN,SAAQ,SAAU1G,GAAO,GAAgB4uC,EAAQ5uC,EAAKgH,EAAOhH,GAAO,IAAekE,OAAO83C,0BAA6B93C,OAAO+3C,iBAAiBrN,EAAQ1qC,OAAO83C,0BAA0Bh1C,IAAmB,GAAQ9C,OAAO8C,IAASN,SAAQ,SAAU1G,GAAOkE,OAAOm3B,eAAeuT,EAAQ5uC,EAAKkE,OAAOu0C,yBAAyBzxC,EAAQhH,GAAO,GAAM,CAAE,OAAO4uC,CAAQ,CAErhB,SAAS,GAAgBz8B,EAAKnS,EAAKC,GAAiK,OAApJD,KAAOmS,EAAOjO,OAAOm3B,eAAelpB,EAAKnS,EAAK,CAAEC,MAAOA,EAAOq7B,YAAY,EAAMC,cAAc,EAAMod,UAAU,IAAkBxmC,EAAInS,GAAOC,EAAgBkS,CAAK,CAiBzM,SAASkwE,GAAwB73B,GACtC,IAAIuyB,EAAevyB,EAAO5D,WACtB8O,EAAUtX,EAAUkkC,GAAWvF,EAAan0B,QAAQ,SAAUzpD,GAChE,OAAOA,EAAKwD,IACd,IAoEA,SAAuBxD,GACrB,GAAI2jD,EAAa3jD,IAAS4wD,GAAoB5wD,GAC5C,OAAOA,EAGT,GAAI4jD,EAAa5jD,GAAO,CACtB,IAAI6N,EAAS7N,EAAKynD,WAClB,OAAO,IAAIlD,GAAkB,GAAc,GAAc,CAAC,EAAG12C,GAAS,CAAC,EAAG,CACxEs6C,WAAY,WACV,OAAOi7B,EAAUv1E,EAAOs6C,WAC1B,EACA12C,OAAQ,WACN,OAAO4xE,EAAWx1E,EAAO4D,OAC3B,IAEJ,CAEA,GAAIoyC,EAAgB7jD,GAAO,CACzB,IAAIsjF,EAAUtjF,EAAKynD,WAEnB,OAAO,IAAIhD,GAAqB,GAAc,GAAc,CAAC,EAAG6+B,GAAU,CAAC,EAAG,CAC5En7B,WAAY,WACV,OAAOi7B,EAAUE,EAAQn7B,WAC3B,EACA12C,OAAQ,WACN,OAAO4xE,EAAWC,EAAQ7xE,OAC5B,IAEJ,CAEA,GAAIqyC,EAAY9jD,GAAO,CACrB,IAAIujF,EAAWvjF,EAAKynD,WAEpB,OAAO,IAAI9C,GAAiB,GAAc,GAAc,CAAC,EAAG4+B,GAAW,CAAC,EAAG,CACzE95B,MAAO,WACL,OAAO25B,EAAUG,EAAS95B,MAC5B,IAEJ,CAEA,GAAI1F,EAAW/jD,GAAO,CACpB,IAAIwjF,EAAWxjF,EAAKynD,WAEpB,OAAO,IAAI5C,GAAgB,GAAc,GAAc,CAAC,EAAG2+B,GAAW,CAAC,EAAG,CACxE1pE,OAAQ2pE,GAAWD,EAAS1pE,UAEhC,CAGA,GAAIkqC,GAAkBhkD,GAAO,CAC3B,IAAI0jF,EAAW1jF,EAAKynD,WAEpB,OAAO,IAAI1C,GAAuB,GAAc,GAAc,CAAC,EAAG2+B,GAAW,CAAC,EAAG,CAC/EjyE,OAAQ,WACN,OAjECgyE,GAiEsBC,EAASjyE,QAjET,SAAU7C,GACrC,OAAO,GAAc,GAAc,CAAC,EAAGA,GAAQ,CAAC,EAAG,CACjD5O,KAAMk/E,EAAYtwE,EAAM5O,OAE5B,GA8DI,IAEJ,EAGS,EAAAwjD,EAAA,GAAU,EAAG,qBAAsB,EAAAnF,EAAA,GAAQr+C,GACtD,IAhIA,OAAO,IAAI2xD,GAAc,GAAc,GAAc,CAAC,EAAGisB,GAAe,CAAC,EAAG,CAC1En0B,MAAO,EAAa8M,GACpB/6C,WAAY2nE,GAAWvF,EAAapiE,YAAYvZ,KA0BlD,SAAuB2rB,GACrB,IAAI/f,EAAS+f,EAAU65B,WACvB,OAAO,IAAIsJ,GAAiB,GAAc,GAAc,CAAC,EAAGljD,GAAS,CAAC,EAAG,CACvE4uC,UAAWknC,GAAO91E,EAAO4uC,WAAW,SAAUzV,GAC5C,OAAOA,CACT,IACApkC,KAAMghF,EAAS/1E,EAAOjL,QAE1B,IAjCEsC,MAAO2+E,EAAiBjG,EAAa14E,OACrCmuB,SAAUwwD,EAAiBjG,EAAavqD,UACxC7xB,aAAcqiF,EAAiBjG,EAAap8E,iBAG9C,SAAS09E,EAAYl/E,GACnB,OAAIikD,GAAWjkD,GAEN,IAAIilD,GAAYi6B,EAAYl/E,EAAKulD,SAC/BrB,GAAclkD,GAEhB,IAAImlD,GAAe+5B,EAAYl/E,EAAKulD,SAGtCs5B,EAAiB7+E,EAC1B,CAEA,SAAS6+E,EAAiB7+E,GACxB,OAAOu2D,EAAQv2D,EAAKwD,KACtB,CAEA,SAASqgF,EAAiBC,GACxB,OAAOA,GAAajF,EAAiBiF,EACvC,CAYA,SAASF,EAAShhF,GAChB,OAAO6gF,GAAW7gF,GAAM,SAAUyG,GAChC,OAAO,GAAc,GAAc,CAAC,EAAGA,GAAM,CAAC,EAAG,CAC/CrJ,KAAMk/E,EAAY71E,EAAIrJ,OAE1B,GACF,CAEA,SAASqjF,EAAWU,GAClB,OAAON,GAAWM,GAAW,SAAUn1E,GACrC,OAAO,GAAc,GAAc,CAAC,EAAGA,GAAQ,CAAC,EAAG,CACjD5O,KAAMk/E,EAAYtwE,EAAM5O,MACxB4C,KAAMghF,EAASh1E,EAAMhM,OAEzB,GACF,CAUA,SAASwgF,EAAUx8B,GACjB,OAAOu8B,GAAWv8B,GAAK3kD,IAAI48E,EAC7B,CAgEF,CAEA,SAAS4E,GAAWxhF,EAAK+hF,GAMvB,IALA,IAAIC,EAAYl/E,OAAO3C,OAAO,MAC1B8U,EAAaysE,GAAO5+E,OAAO+D,KAAK7G,IAAM,SAAU+kC,GAClD,OAAOA,CACT,IAESsV,EAAM,EAAGA,EAAMplC,EAAW1Z,OAAQ8+C,IAAO,CAChD,IAAIz7C,EAAMqW,EAAWolC,GACjBx7C,EAAQmB,EAAIpB,GAChBojF,EAAUpjF,GAAOmjF,EAAcA,EAAYljF,GAASA,CACtD,CAEA,OAAOmjF,CACT,CAEA,SAASd,GAAWrsE,GAClB,OAAO6sE,GAAO7sE,GAAO,SAAU9D,GAC7B,OAAOA,EAAIxP,IACb,GACF,CAEA,SAASmgF,GAAO7sE,EAAOotE,GACrB,OAAOptE,EAAMvZ,QAAQ6V,MAAK,SAAU+wE,EAAMC,GAGxC,OAAOvkC,EAFIqkC,EAASC,GACTD,EAASE,GAEtB,GACF,CCtKO,SAASC,GAAYh5B,EAAQnnD,GAClC,OAAOogF,GAAoBj5B,GAAQ,SAAUhlD,GAC3C,OAAQorD,GAAqBprD,EAC/B,GAAGk+E,GAAergF,EACpB,CACO,SAASsgF,GAAyBn5B,EAAQnnD,GAC/C,OAAOogF,GAAoBj5B,EAAQoG,GAAsBb,GAAqB1sD,EAChF,CAEA,SAASqgF,GAAcvkF,GACrB,OAAQgtD,GAAsBhtD,KAAU4wD,GAAoB5wD,EAC9D,CAEA,SAASskF,GAAoBj5B,EAAQo5B,EAAiBC,EAAYxgF,GAChE,IAAIsX,EAAa6vC,EAAO8C,gBAAgBxsD,OAAO8iF,GAC3Ch7B,EAAQ,EAAa4B,EAAOyC,cAAcnsD,OAAO+iF,GACrD,MAAO,CAACC,GAAsBt5B,IAAS/9C,OAAOkO,EAAWvZ,KAAI,SAAU2rB,GACrE,OAkLJ,SAAwBA,EAAW1pB,GACjC,OAAO0gF,GAAiB1gF,EAAS0pB,GAAa,cAAgBA,EAAUpqB,KAAOqhF,GAAU3gF,EAAS0pB,EAAUhrB,OAASgrB,EAAUwgC,aAAe,cAAgB,IAAM,OAASxgC,EAAU6uB,UAAU3hC,KAAK,MACxM,CApLWgqE,CAAel3D,EAAW1pB,EACnC,IAAIulD,EAAMxnD,KAAI,SAAUjC,GACtB,OAAO+kF,GAAU/kF,EAAMkE,EACzB,KAAIvC,OAAO0gB,SAASvH,KAAK,QAAU,IACrC,CAEA,SAAS6pE,GAAsBt5B,GAC7B,GAA0B,MAAtBA,EAAO3N,cAuCb,SAA+B2N,GAC7B,IAAIttC,EAAYstC,EAAO0C,eAEvB,GAAIhwC,GAAgC,UAAnBA,EAAUva,KACzB,OAAO,EAGT,IAAIwa,EAAeqtC,EAAO2C,kBAE1B,GAAIhwC,GAAsC,aAAtBA,EAAaxa,KAC/B,OAAO,EAGT,IAAIya,EAAmBotC,EAAO4C,sBAE9B,GAAIhwC,GAA8C,iBAA1BA,EAAiBza,KACvC,OAAO,EAGT,OAAO,CACT,CA3DoCwhF,CAAsB35B,GAAxD,CAIA,IAAI+L,EAAiB,GACjBr5C,EAAYstC,EAAO0C,eAEnBhwC,GACFq5C,EAAex9D,KAAK,YAAY0T,OAAOyQ,EAAUva,OAGnD,IAAIwa,EAAeqtC,EAAO2C,kBAEtBhwC,GACFo5C,EAAex9D,KAAK,eAAe0T,OAAO0Q,EAAaxa,OAGzD,IAAIya,EAAmBotC,EAAO4C,sBAM9B,OAJIhwC,GACFm5C,EAAex9D,KAAK,mBAAmB0T,OAAO2Q,EAAiBza,OAG1DohF,GAAiB,CAAC,EAAGv5B,GAAU,aAAa/9C,OAAO8pD,EAAet8C,KAAK,MAAO,MArBrF,CAsBF,CAqCO,SAASiqE,GAAU/kF,EAAMkE,GAC9B,OAAIy/C,EAAa3jD,GA6BnB,SAAqBA,EAAMkE,GACzB,OAAO0gF,GAAiB1gF,EAASlE,GAAQ,UAAUsN,OAAOtN,EAAKwD,MAiGjE,SAA6ByhF,GAC3B,GAA6B,MAAzBA,EAAO99B,eACT,MAAO,GAGT,IACI+9B,EAASj4B,GADHg4B,EAAO99B,eACcyF,IAE/B,OADAs4B,IAAU,EAAA1hC,EAAA,GAAU,EAAG,yEAChB,uBAAwB,OAAM0hC,GAAU,GACjD,CA1GyEC,CAAoBnlF,EAC7F,CA9BWolF,CAAYplF,EAAMkE,GAGvB0/C,EAAa5jD,GAoCnB,SAAqBA,EAAMkE,GACzB,OAAO0gF,GAAiB1gF,EAASlE,GAAQ,QAAQsN,OAAOtN,EAAKwD,MAAQ6hF,GAA2BrlF,GAAQslF,GAAYphF,EAASlE,EAC/H,CArCWulF,CAAYvlF,EAAMkE,GAGvB2/C,EAAgB7jD,GAoCtB,SAAwBA,EAAMkE,GAC5B,OAAO0gF,GAAiB1gF,EAASlE,GAAQ,aAAasN,OAAOtN,EAAKwD,MAAQ6hF,GAA2BrlF,GAAQslF,GAAYphF,EAASlE,EACpI,CArCWwlF,CAAexlF,EAAMkE,GAG1B4/C,EAAY9jD,GAoClB,SAAoBA,EAAMkE,GACxB,IAAIulD,EAAQzpD,EAAKupD,WACbnsC,EAAgBqsC,EAAMjsD,OAAS,MAAQisD,EAAM3uC,KAAK,OAAS,GAC/D,OAAO8pE,GAAiB1gF,EAASlE,GAAQ,SAAWA,EAAKwD,KAAO4Z,CAClE,CAvCWqoE,CAAWzlF,EAAMkE,GAGtB6/C,EAAW/jD,GAsCjB,SAAmBA,EAAMkE,GACvB,IAAI4V,EAAS9Z,EAAKmqD,YAAYloD,KAAI,SAAUnB,EAAOsF,GACjD,OAAOw+E,GAAiB1gF,EAASpD,EAAO,MAAOsF,GAAK,KAAOtF,EAAM0C,KAAOkiF,GAAgB5kF,EAAM8nD,kBAChG,IACA,OAAOg8B,GAAiB1gF,EAASlE,GAAQ,QAAQsN,OAAOtN,EAAKwD,MAAQmiF,GAAW7rE,EAClF,CA1CW8rE,CAAU5lF,EAAMkE,GAIrB8/C,GAAkBhkD,GAwCxB,SAA0BA,EAAMkE,GAC9B,IAAIuN,EAAS,EAAazR,EAAKioD,aAAahmD,KAAI,SAAU4jF,EAAGz/E,GAC3D,OAAOw+E,GAAiB1gF,EAAS2hF,EAAG,MAAOz/E,GAAK,KAAO0/E,GAAgBD,EACzE,IACA,OAAOjB,GAAiB1gF,EAASlE,GAAQ,SAASsN,OAAOtN,EAAKwD,MAAQmiF,GAAWl0E,EACnF,CA5CWs0E,CAAiB/lF,EAAMkE,QAIvB,EAAAs/C,EAAA,GAAU,EAAG,qBAAsB,EAAAnF,EAAA,GAAQr+C,GACtD,CAMA,SAASqlF,GAA2BrlF,GAClC,IAAImoD,EAAanoD,EAAKkoD,gBACtB,OAAOC,EAAW3qD,OAAS,eAAiB2qD,EAAWlmD,KAAI,SAAUmE,GACnE,OAAOA,EAAE5C,IACX,IAAGsX,KAAK,OAAS,EACnB,CA8BA,SAASwqE,GAAYphF,EAASlE,GAI5B,OAAO2lF,GAHM,EAAa3lF,EAAKioD,aAAahmD,KAAI,SAAU4jF,EAAGz/E,GAC3D,OAAOw+E,GAAiB1gF,EAAS2hF,EAAG,MAAOz/E,GAAK,KAAOy/E,EAAEriF,KAAOqhF,GAAU3gF,EAAS2hF,EAAEjjF,KAAM,MAAQ,KAAOkb,OAAO+nE,EAAE7lF,MAAQ0lF,GAAgBG,EAAEj9B,kBAC/I,IAEF,CAEA,SAAS+8B,GAAWv4B,GAClB,OAAwB,IAAjBA,EAAM5vD,OAAe,OAAS4vD,EAAMtyC,KAAK,MAAQ,MAAQ,EAClE,CAEA,SAAS+pE,GAAU3gF,EAAStB,GAC1B,IAAIojF,EAAc1/E,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,GAAmBA,UAAU,GAAK,GAEtF,OAAoB,IAAhB1D,EAAKpF,OACA,GAILoF,EAAK6L,OAAM,SAAUpF,GACvB,OAAQA,EAAIq0C,WACd,IACS,IAAM96C,EAAKX,IAAI6jF,IAAiBhrE,KAAK,MAAQ,IAG/C,MAAQlY,EAAKX,KAAI,SAAUoH,EAAKjD,GACrC,OAAOw+E,GAAiB1gF,EAASmF,EAAK,KAAO28E,GAAc5/E,GAAK,KAAO4/E,EAAcF,GAAgBz8E,EACvG,IAAGyR,KAAK,MAAQ,KAAOkrE,EAAc,GACvC,CAEA,SAASF,GAAgBz8E,GACvB,IAAI48E,EAAah5B,GAAa5jD,EAAImpC,aAAcnpC,EAAIrJ,MAChDkmF,EAAU78E,EAAI7F,KAAO,KAAOsa,OAAOzU,EAAIrJ,MAM3C,OAJIimF,IACFC,GAAW,MAAM54E,QAAO,OAAM24E,KAGzBC,EAAUR,GAAgBr8E,EAAIu/C,kBACvC,CAMA,SAAS88B,GAAgB5lF,GACvB,GAAc,MAAVA,EACF,MAAO,GAGT,IAAIqmF,EAAYl5B,GAAantD,EAAQ8sD,IAErC,OAAIu5B,GAAarmF,IAAWuxD,GACnB,yBAA0B,OAAM80B,GAAa,IAG/C,cACT,CAaA,SAASvB,GAAiB1gF,EAASiL,GACjC,IAAI62E,EAAc1/E,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,GAAmBA,UAAU,GAAK,GAClF8/E,IAAe9/E,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,KAAmBA,UAAU,GAC9Eo3C,EAAcvuC,EAAIuuC,YAEtB,GAAmB,MAAfA,EACF,MAAO,GAGT,IAAwF,KAAvE,OAAZx5C,QAAgC,IAAZA,OAAqB,EAASA,EAAQm+E,qBAC7D,OASJ,SAAsC3kC,EAAasoC,EAAaI,GAC9D,IAAIpT,EAASgT,IAAgBI,EAAe,KAAO,GAC/CC,EAAU3oC,EAAYxW,MAAM,MAAMjlC,KAAI,SAAU6pC,GAClD,OAAOk6C,GAAwB,KAATl6C,EAAc,KAAOA,EAAO,IACpD,IAAGhxB,KAAK,MACR,OAAOk4D,EAASqT,EAAU,IAC5B,CAfWC,CAA6B5oC,EAAasoC,EAAaI,GAGhE,IAAIG,EAAsB7oC,EAAYlgD,OAAS,GAG/C,OADawoF,IAAgBI,EAAe,KAAOJ,EAAcA,IAD/C,SAAiBtoC,EAAa,GAAI6oC,GAExBnjF,QAAQ,MAAO,KAAO4iF,GAAe,IACnE,CC9PO,SAASQ,GAAUC,GAGxB,IAFA,IAAIn/E,EAAc,GAETg1C,EAAM,EAAGA,EAAMmqC,EAAUjpF,OAAQ8+C,IAAO,CAC/C,IAAI3zC,EAAM89E,EAAUnqC,GACpBh1C,EAAcA,EAAYgG,OAAO3E,EAAIrB,YACvC,CAEA,MAAO,CACLG,KAAM,WACNH,YAAaA,EAEjB,CCRO,SAASo/E,GAAmBjW,GAIjC,IAHA,IAAIrsC,EAAa,GACbuiD,EAAW5hF,OAAO3C,OAAO,MAEpBk6C,EAAM,EAAGw+B,EAAyBrK,EAAYnpE,YAAag1C,EAAMw+B,EAAuBt9E,OAAQ8+C,IAAO,CAC9G,IAAIruB,EAAiB6sD,EAAuBx+B,GAE5C,OAAQruB,EAAexmB,MACrB,KAAK,IAAKsuC,qBACR3R,EAAWxqC,KAAKq0B,GAChB,MAEF,KAAK,IAAK+nB,oBACR2wC,EAAS14D,EAAezqB,KAAK1C,OAAS8lF,GAAoB34D,EAAezf,cAG/E,CA2BA,IAvBA,IAAIq4E,EAAwB9hF,OAAO3C,OAAO,MAEtC+1D,EAAQ,SAAehb,GAIzB,IAHA,IAAI34C,EAAY4/B,EAAW+Y,GACvB2pC,EAAe,IAAIz/E,IAEdg2C,EAAM,EAAG0pC,EAAwBH,GAAoBpiF,EAAUgK,cAAe6uC,EAAM0pC,EAAsBvpF,OAAQ6/C,IAAO,CAChI,IAAI31C,EAAeq/E,EAAsB1pC,GACzC2pC,GAA8BF,EAAcH,EAAUj/E,EACxD,CAGA,IAAIpC,EAAgBd,EAAUhB,KAAOgB,EAAUhB,KAAK1C,MAAQ,GAG5D+lF,EAAsBvhF,GAAiB,CACrCmC,KAAM,IAAKg2E,SACXn2E,YAAampE,EAAYnpE,YAAY3F,QAAO,SAAUkH,GACpD,OAAOA,IAASrE,GAAaqE,EAAKpB,OAAS,IAAKuuC,qBAAuB8wC,EAAa3+E,IAAIU,EAAKrF,KAAK1C,MACpG,IAEJ,EAESq8C,EAAM,EAAGA,EAAM/Y,EAAW5mC,OAAQ2/C,IACzCgb,EAAMhb,GAGR,OAAO0pC,CACT,CAIA,SAASG,GAA8B/rE,EAAW0rE,EAAUM,GAC1D,IAAKhsE,EAAU9S,IAAI8+E,GAAW,CAC5BhsE,EAAU1Y,IAAI0kF,GACd,IAAIC,EAAgBP,EAASM,GAE7B,QAAsBpkF,IAAlBqkF,EACF,IAAK,IAAIt0B,EAAM,EAAGA,EAAMs0B,EAAc1pF,OAAQo1D,IAAO,CAEnDo0B,GAA8B/rE,EAAW0rE,EAD5BO,EAAct0B,GAE7B,CAEJ,CACF,CAEA,SAASg0B,GAAoBp4E,GAC3B,IAAIs4E,EAAe,GAMnB,OALA,QAAMt4E,EAAc,CAClB8f,eAAgB,SAAwBzlB,GACtCi+E,EAAaltF,KAAKiP,EAAKrF,KAAK1C,MAC9B,IAEKgmF,CACT,CC1BO,SAASK,GAAuBt/E,GAOrC,IANA,IAAIu/E,GAAY,QAASv/E,GAAUA,EAAS,IAAI,KAAOA,GACnDC,EAAOs/E,EAAUt/E,KACjBu/E,EAAQ,IAAI,KAAMD,GAClBE,EAAe,GACfC,GAAiC,EAE9BF,EAAMG,UAAU//E,OAAS,KAAUggF,KAAK,CAC7C,IAAIC,EAAeL,EAAM7E,MACrBmF,EAAYD,EAAajgF,KAOzBmgF,IAAmB,QAAsBF,EAAajgF,MAEtD8/E,IACEK,GAAmBF,EAAajgF,OAAS,KAAUogF,UACrDP,GAAgB,KAIpB,IAAIQ,EAAYhgF,EAAKvK,MAAMmqF,EAAaltF,MAAOktF,EAAa1/E,KAExD2/E,IAAc,KAAUI,aAC1BT,GAAgBU,GAAkBF,GAElCR,GAAgBQ,EAGlBP,EAAiCK,CACnC,CAEA,OAAON,CACT,CAEA,SAASU,GAAkBC,GAEzB,IAAIC,EAASD,EAAS1qF,MAAM,GAAI,GAC5BuK,GAAO,SAAuBogF,IAE9B,SAA0BpgF,GAAQ,IACpCA,EAAO,KAAOA,GAGhB,IAAIqgF,EAAWrgF,EAAKA,EAAKtK,OAAS,GAOlC,OANoC,MAAb2qF,GAAuC,UAAnBrgF,EAAKvK,OAAO,IAElB,OAAb4qF,KACtBrgF,GAAQ,MAGH,MAAQA,EAAO,KACxB,CChHA,SAAS,GAAQnH,EAAQu4C,GAAkB,IAAIpwC,EAAO/D,OAAO+D,KAAKnI,GAAS,GAAIoE,OAAOo0C,sBAAuB,CAAE,IAAIC,EAAUr0C,OAAOo0C,sBAAsBx4C,GAAau4C,IAAgBE,EAAUA,EAAQz3C,QAAO,SAAU03C,GAAO,OAAOt0C,OAAOu0C,yBAAyB34C,EAAQ04C,GAAKld,UAAY,KAAIrzB,EAAKlP,KAAK6M,MAAMqC,EAAMswC,EAAU,CAAE,OAAOtwC,CAAM,CAEpV,SAAS,GAAc2mC,GAAU,IAAK,IAAIrpC,EAAI,EAAGA,EAAIE,UAAU9I,OAAQ4I,IAAK,CAAE,IAAIyB,EAAyB,MAAhBvB,UAAUF,GAAaE,UAAUF,GAAK,CAAC,EAAOA,EAAI,EAAK,GAAQrB,OAAO8C,IAAS,GAAMN,SAAQ,SAAU1G,GAAO,GAAgB4uC,EAAQ5uC,EAAKgH,EAAOhH,GAAO,IAAekE,OAAO83C,0BAA6B93C,OAAO+3C,iBAAiBrN,EAAQ1qC,OAAO83C,0BAA0Bh1C,IAAmB,GAAQ9C,OAAO8C,IAASN,SAAQ,SAAU1G,GAAOkE,OAAOm3B,eAAeuT,EAAQ5uC,EAAKkE,OAAOu0C,yBAAyBzxC,EAAQhH,GAAO,GAAM,CAAE,OAAO4uC,CAAQ,CAErhB,SAAS,GAAgBz8B,EAAKnS,EAAKC,GAAiK,OAApJD,KAAOmS,EAAOjO,OAAOm3B,eAAelpB,EAAKnS,EAAK,CAAEC,MAAOA,EAAOq7B,YAAY,EAAMC,cAAc,EAAMod,UAAU,IAAkBxmC,EAAInS,GAAOC,EAAgBkS,CAAK,CAYzM,IAAIo1E,GAAqBrjF,OAAOgS,OAAO,CAC5CsxE,aAAc,eACdC,kBAAmB,oBACnBC,wBAAyB,0BACzBC,wBAAyB,0BACzBC,2BAA4B,6BAC5BC,8BAA+B,gCAC/BC,cAAe,gBACfC,mBAAoB,qBACpBC,mBAAoB,qBACpBC,YAAa,cACbC,iBAAkB,mBAClBC,kBAAmB,oBACnBC,sBAAuB,wBACvBC,6BAA8B,+BAC9BC,6BAA8B,+BAC9BC,2BAA4B,+BAEnBC,GAAsBtkF,OAAOgS,OAAO,CAC7CuyE,oBAAqB,sBACrBC,oBAAqB,sBACrBC,2BAA4B,6BAC5BC,mBAAoB,qBACpBC,4BAA6B,8BAC7BC,yBAA0B,6BAOrB,SAASC,GAAoBve,EAAWwe,GAI7C,OAHsBC,GAAkBze,EAAWwe,GAAWloF,QAAO,SAAUooF,GAC7E,OAAOA,EAAO/pF,QAAQooF,EACxB,GAEF,CAMO,SAAS4B,GAAqB3e,EAAWwe,GAI9C,OAHuBC,GAAkBze,EAAWwe,GAAWloF,QAAO,SAAUooF,GAC9E,OAAOA,EAAO/pF,QAAQqpF,EACxB,GAEF,CAEA,SAASS,GAAkBze,EAAWwe,GACpC,MAAO,GAAGv8E,OA8DZ,SAAyB+9D,EAAWwe,GAIlC,IAHA,IAAII,EAAgB,GAChBC,EAAYr+E,GAAK,EAAaw/D,EAAUvd,cAAe,EAAa+7B,EAAU/7B,eAEzEsF,EAAO,EAAG+2B,EAAsBD,EAAUlzC,QAASoc,EAAO+2B,EAAoB3sF,OAAQ41D,IAAQ,CACrG,IAAIg3B,EAAUD,EAAoB/2B,GAClC62B,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBC,aACzB3qC,YAAasP,GAAsBo9B,GAAW,mBAAmB98E,OAAO88E,EAAQ5mF,KAAM,sDAAwD,GAAG8J,OAAO88E,EAAQ5mF,KAAM,kBAE1K,CAEA,IAAK,IAAIqwD,EAAO,EAAGw2B,EAAwBH,EAAUI,UAAWz2B,EAAOw2B,EAAsB7sF,OAAQq2D,IAAQ,CAC3G,IAAIhE,EAAQw6B,EAAsBx2B,GAC9B02B,EAAW16B,EAAM,GACjB26B,EAAU36B,EAAM,GAEhB9L,EAAWwmC,IAAaxmC,EAAWymC,GACrCP,EAAcrwF,KAAK6M,MAAMwjF,EAAeQ,GAAoBF,EAAUC,IAC7D1mC,EAAYymC,IAAazmC,EAAY0mC,GAC9CP,EAAcrwF,KAAK6M,MAAMwjF,EAAeS,GAAqBH,EAAUC,IAC9DxmC,GAAkBumC,IAAavmC,GAAkBwmC,GAC1DP,EAAcrwF,KAAK6M,MAAMwjF,EAAeU,GAA2BJ,EAAUC,IACpE5mC,EAAa2mC,IAAa3mC,EAAa4mC,IAEvC3mC,EAAgB0mC,IAAa1mC,EAAgB2mC,GADtDP,EAAcrwF,KAAK6M,MAAMwjF,EAAeW,GAAiBL,EAAUC,GAASl9E,OAAOu9E,GAAiCN,EAAUC,KAGrHD,EAASpwF,cAAgBqwF,EAAQrwF,aAC1C8vF,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBE,kBACzB5qC,YAAa,GAAGpwC,OAAOi9E,EAAS/mF,KAAM,kBAAoB,GAAG8J,OAAOw9E,GAAaP,GAAW,QAAQj9E,OAAOw9E,GAAaN,GAAU,MAGxI,CAEA,OAAOP,CACT,CAlGmBc,CAAgB1f,EAAWwe,GAG9C,SAA8Bxe,EAAWwe,GAIvC,IAHA,IAAII,EAAgB,GAChBe,EAAiBn/E,GAAKw/D,EAAUld,gBAAiB07B,EAAU17B,iBAEtD7R,EAAM,EAAG2uC,EAAyBD,EAAeh0C,QAASsF,EAAM2uC,EAAuBztF,OAAQ8+C,IAAO,CAC7G,IAAI4uC,EAAeD,EAAuB3uC,GAC1C2tC,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBY,kBACzBtrC,YAAa,GAAGpwC,OAAO49E,EAAa1nF,KAAM,kBAE9C,CAEA,IAAK,IAAI25C,EAAM,EAAGguC,EAAyBH,EAAeV,UAAWntC,EAAMguC,EAAuB3tF,OAAQ2/C,IAAO,CAM/G,IALA,IAAI2B,EAAQqsC,EAAuBhuC,GAC/BiuC,EAAgBtsC,EAAM,GACtBusC,EAAevsC,EAAM,GACrBwsC,EAAWz/E,GAAKu/E,EAAcxoF,KAAMyoF,EAAazoF,MAE5Cy6C,EAAM,EAAGkuC,EAAmBD,EAAS/xE,MAAO8jC,EAAMkuC,EAAiB/tF,OAAQ6/C,IAAO,CACzF,IAAImuC,EAASD,EAAiBluC,GAE1B2L,GAAmBwiC,IACrBvB,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBc,6BACzBxrC,YAAa,kBAAkBpwC,OAAOk+E,EAAOhoF,KAAM,kBAAkB8J,OAAO89E,EAAc5nF,KAAM,gBAGtG,CAEA,IAAK,IAAIovD,EAAM,EAAG64B,EAAqBH,EAASt0C,QAAS4b,EAAM64B,EAAmBjuF,OAAQo1D,IAAO,CAC/F,IAAI84B,EAASD,EAAmB74B,GAChCq3B,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBa,sBACzBvrC,YAAa,GAAGpwC,OAAOo+E,EAAOloF,KAAM,sBAAsB8J,OAAO89E,EAAc5nF,KAAM,MAEzF,CAEI4nF,EAAch9B,eAAiBi9B,EAAaj9B,cAC9C67B,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBe,6BACzBzrC,YAAa,oCAAoCpwC,OAAO89E,EAAc5nF,KAAM,OAIhF,IAAK,IAAIuvD,EAAO,EAAG44B,EAAyBP,EAAc3uC,UAAWsW,EAAO44B,EAAuBnuF,OAAQu1D,IAAQ,CACjH,IAAIxV,EAAWouC,EAAuB54B,IAEY,IAA9Cs4B,EAAa5uC,UAAUh/C,QAAQ8/C,IACjC0sC,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBgB,2BACzB1rC,YAAa,GAAGpwC,OAAOiwC,EAAU,sBAAsBjwC,OAAO89E,EAAc5nF,KAAM,MAGxF,CACF,CAEA,OAAOymF,CACT,CA5D0D2B,CAAqBvgB,EAAWwe,GAC1F,CAmGA,SAASc,GAA2BP,EAASI,GAI3C,IAHA,IAAIP,EAAgB,GAChB4B,EAAahgF,GAAK,EAAau+E,EAAQniC,aAAc,EAAauiC,EAAQviC,cAErE8L,EAAO,EAAG+3B,EAAqBD,EAAWtyE,MAAOw6C,EAAO+3B,EAAmBtuF,OAAQu2D,IAAQ,CAClG,IAAIg4B,EAAWD,EAAmB/3B,GAE9B/I,GAAqB+gC,GACvB9B,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBK,2BACzB/qC,YAAa,oBAAoBpwC,OAAOy+E,EAASvoF,KAAM,mBAAmB8J,OAAO88E,EAAQ5mF,KAAM,iBAGjGymF,EAAcrwF,KAAK,CACjBoG,KAAMqpF,GAAoBG,2BAC1B9rC,YAAa,qBAAqBpwC,OAAOy+E,EAASvoF,KAAM,mBAAmB8J,OAAO88E,EAAQ5mF,KAAM,gBAGtG,CAEA,IAAK,IAAIywD,EAAO,EAAG+3B,EAAuBH,EAAW70C,QAASid,EAAO+3B,EAAqBxuF,OAAQy2D,IAAQ,CACxG,IAAIg4B,EAAWD,EAAqB/3B,GACpCg2B,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBO,cACzBjrC,YAAa,GAAGpwC,OAAO88E,EAAQ5mF,KAAM,KAAK8J,OAAO2+E,EAASzoF,KAAM,kBAEpE,CAEA,IAAK,IAAI6wD,EAAO,EAAG63B,EAAyBL,EAAWvB,UAAWj2B,EAAO63B,EAAuB1uF,OAAQ62D,IAAQ,CAC9G,IAAIrE,EAAQk8B,EAAuB73B,GAC/B83B,EAAYn8B,EAAM,GAClBo8B,EAAYp8B,EAAM,GACTq8B,GAA0CF,EAAUnsF,KAAMosF,EAAUpsF,OAG/EiqF,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBQ,mBACzBlrC,YAAa,GAAGpwC,OAAO88E,EAAQ5mF,KAAM,KAAK8J,OAAO6+E,EAAU3oF,KAAM,uBAAyB,GAAG8J,OAAOwQ,OAAOquE,EAAUnsF,MAAO,QAAQsN,OAAOwQ,OAAOsuE,EAAUpsF,MAAO,MAGzK,CAEA,OAAOiqF,CACT,CAEA,SAASS,GAAqBN,EAASI,GAIrC,IAHA,IAAIP,EAAgB,GAChBqC,EAAoBzgF,GAAKu+E,EAAQ7gC,WAAYihC,EAAQjhC,YAEhDgL,EAAO,EAAGg4B,EAAyBD,EAAkB/yE,MAAOg7C,EAAOg4B,EAAuB/uF,OAAQ+2D,IAAQ,CACjH,IAAIi4B,EAAkBD,EAAuBh4B,GAC7C01B,EAAcrwF,KAAK,CACjBoG,KAAMqpF,GAAoBE,oBAC1B7rC,YAAa,GAAGpwC,OAAOk/E,EAAgBhpF,KAAM,6BAA6B8J,OAAO88E,EAAQ5mF,KAAM,MAEnG,CAEA,IAAK,IAAIixD,EAAO,EAAGg4B,EAAyBH,EAAkBt1C,QAASyd,EAAOg4B,EAAuBjvF,OAAQi3D,IAAQ,CACnH,IAAIi4B,EAAkBD,EAAuBh4B,GAC7Cw1B,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBG,wBACzB7qC,YAAa,GAAGpwC,OAAOo/E,EAAgBlpF,KAAM,iCAAiC8J,OAAO88E,EAAQ5mF,KAAM,MAEvG,CAEA,OAAOymF,CACT,CAEA,SAASQ,GAAoBL,EAASI,GAIpC,IAHA,IAAIP,EAAgB,GAChB0C,EAAa9gF,GAAKu+E,EAAQjgC,YAAaqgC,EAAQrgC,aAE1CuK,EAAO,EAAGk4B,EAAqBD,EAAWpzE,MAAOm7C,EAAOk4B,EAAmBpvF,OAAQk3D,IAAQ,CAClG,IAAIxiD,EAAW06E,EAAmBl4B,GAClCu1B,EAAcrwF,KAAK,CACjBoG,KAAMqpF,GAAoBC,oBAC1B5rC,YAAa,GAAGpwC,OAAO4E,EAAS1O,KAAM,4BAA4B8J,OAAO88E,EAAQ5mF,KAAM,MAE3F,CAEA,IAAK,IAAIoxD,EAAO,EAAGi4B,EAAuBF,EAAW31C,QAAS4d,EAAOi4B,EAAqBrvF,OAAQo3D,IAAQ,CACxG,IAAIk4B,EAAWD,EAAqBj4B,GACpCq1B,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBI,wBACzB9qC,YAAa,GAAGpwC,OAAOw/E,EAAStpF,KAAM,gCAAgC8J,OAAO88E,EAAQ5mF,KAAM,MAE/F,CAEA,OAAOymF,CACT,CAEA,SAASY,GAAiCT,EAASI,GAIjD,IAHA,IAAIP,EAAgB,GAChB8C,EAAiBlhF,GAAKu+E,EAAQliC,gBAAiBsiC,EAAQtiC,iBAElD8N,EAAO,EAAGg3B,EAAyBD,EAAexzE,MAAOy8C,EAAOg3B,EAAuBxvF,OAAQw4D,IAAQ,CAC9G,IAAIi3B,EAAeD,EAAuBh3B,GAC1Ci0B,EAAcrwF,KAAK,CACjBoG,KAAMqpF,GAAoBK,4BAC1BhsC,YAAa,GAAGpwC,OAAO2/E,EAAazpF,KAAM,wCAAwC8J,OAAO88E,EAAQ5mF,KAAM,MAE3G,CAEA,IAAK,IAAI+1D,EAAO,EAAG2zB,EAAyBH,EAAe/1C,QAASuiB,EAAO2zB,EAAuB1vF,OAAQ+7D,IAAQ,CAChH,IAAI4zB,EAAeD,EAAuB3zB,GAC1C0wB,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBM,8BACzBhrC,YAAa,GAAGpwC,OAAO88E,EAAQ5mF,KAAM,oCAAoC8J,OAAO6/E,EAAa3pF,KAAM,MAEvG,CAEA,OAAOymF,CACT,CAEA,SAASW,GAAiBR,EAASI,GAIjC,IAHA,IAAIP,EAAgB,GAChB4B,EAAahgF,GAAK,EAAau+E,EAAQniC,aAAc,EAAauiC,EAAQviC,cAErEq5B,EAAO,EAAG8L,EAAuBvB,EAAW70C,QAASsqC,EAAO8L,EAAqB5vF,OAAQ8jF,IAAQ,CACxG,IAAI2K,EAAWmB,EAAqB9L,GACpC2I,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBO,cACzBjrC,YAAa,GAAGpwC,OAAO88E,EAAQ5mF,KAAM,KAAK8J,OAAO2+E,EAASzoF,KAAM,kBAEpE,CAEA,IAAK,IAAI6pF,EAAO,EAAGC,EAAyBzB,EAAWvB,UAAW+C,EAAOC,EAAuB9vF,OAAQ6vF,IAAQ,CAC9G,IAAI/8B,EAAQg9B,EAAuBD,GAC/BE,EAAaj9B,EAAM,GACnBy7B,EAAWz7B,EAAM,GACrB25B,EAAcrwF,KAAK6M,MAAMwjF,EAAeuD,GAAepD,EAASmD,EAAYxB,IAC/D0B,GAAsCF,EAAWvtF,KAAM+rF,EAAS/rF,OAG3EiqF,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBQ,mBACzBlrC,YAAa,GAAGpwC,OAAO88E,EAAQ5mF,KAAM,KAAK8J,OAAOigF,EAAW/pF,KAAM,uBAAyB,GAAG8J,OAAOwQ,OAAOyvE,EAAWvtF,MAAO,QAAQsN,OAAOwQ,OAAOiuE,EAAS/rF,MAAO,MAG1K,CAEA,OAAOiqF,CACT,CAEA,SAASuD,GAAepD,EAAS6B,EAAUF,GAIzC,IAHA,IAAI9B,EAAgB,GAChBqB,EAAWz/E,GAAKogF,EAASrpF,KAAMmpF,EAASnpF,MAEnC8qF,EAAO,EAAGC,EAAqBrC,EAASt0C,QAAS02C,EAAOC,EAAmBnwF,OAAQkwF,IAAQ,CAClG,IAAIhC,EAASiC,EAAmBD,GAChCzD,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBU,YACzBprC,YAAa,GAAGpwC,OAAO88E,EAAQ5mF,KAAM,KAAK8J,OAAO2+E,EAASzoF,KAAM,SAAS8J,OAAOo+E,EAAOloF,KAAM,kBAEjG,CAEA,IAAK,IAAIoqF,EAAO,EAAGC,EAAuBvC,EAAShB,UAAWsD,EAAOC,EAAqBrwF,OAAQowF,IAAQ,CACxG,IAAIl9B,EAASm9B,EAAqBD,GAC9BE,EAAUp9B,EAAO,GACjB86B,EAAS96B,EAAO,GAGpB,GAFa27B,GAA0CyB,EAAQ9tF,KAAMwrF,EAAOxrF,OAOrE,QAA6B6C,IAAzBirF,EAAQt7C,aACjB,QAA4B3vC,IAAxB2oF,EAAOh5C,aACTy3C,EAAcrwF,KAAK,CACjBoG,KAAMqpF,GAAoBM,yBAC1BjsC,YAAa,GAAGpwC,OAAO88E,EAAQ5mF,KAAM,KAAK8J,OAAO2+E,EAASzoF,KAAM,SAAS8J,OAAOwgF,EAAQtqF,KAAM,oCAE3F,CAIL,IAAIuqF,EAAcC,GAAeF,EAAQt7C,aAAcs7C,EAAQ9tF,MAC3DiuF,EAAcD,GAAexC,EAAOh5C,aAAcg5C,EAAOxrF,MAEzD+tF,IAAgBE,GAClBhE,EAAcrwF,KAAK,CACjBoG,KAAMqpF,GAAoBM,yBAC1BjsC,YAAa,GAAGpwC,OAAO88E,EAAQ5mF,KAAM,KAAK8J,OAAO2+E,EAASzoF,KAAM,SAAS8J,OAAOwgF,EAAQtqF,KAAM,mCAAmC8J,OAAOygF,EAAa,QAAQzgF,OAAO2gF,EAAa,MAGvL,OAvBAhE,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBW,iBACzBrrC,YAAa,GAAGpwC,OAAO88E,EAAQ5mF,KAAM,KAAK8J,OAAO2+E,EAASzoF,KAAM,SAAS8J,OAAOwgF,EAAQtqF,KAAM,2BAA6B,GAAG8J,OAAOwQ,OAAOgwE,EAAQ9tF,MAAO,QAAQsN,OAAOwQ,OAAO0tE,EAAOxrF,MAAO,MAuBrM,CAEA,IAAK,IAAIkuF,EAAO,EAAGC,EAAmB7C,EAAS/xE,MAAO20E,EAAOC,EAAiB3wF,OAAQ0wF,IAAQ,CAC5F,IAAIE,EAAUD,EAAiBD,GAE3BllC,GAAmBolC,GACrBnE,EAAcrwF,KAAK,CACjBoG,KAAMooF,GAAmBS,mBACzBnrC,YAAa,kBAAkBpwC,OAAO8gF,EAAQ5qF,KAAM,QAAQ8J,OAAO88E,EAAQ5mF,KAAM,KAAK8J,OAAO2+E,EAASzoF,KAAM,iBAG9GymF,EAAcrwF,KAAK,CACjBoG,KAAMqpF,GAAoBI,mBAC1B/rC,YAAa,mBAAmBpwC,OAAO8gF,EAAQ5qF,KAAM,QAAQ8J,OAAO88E,EAAQ5mF,KAAM,KAAK8J,OAAO2+E,EAASzoF,KAAM,gBAGnH,CAEA,OAAOymF,CACT,CAEA,SAASwD,GAAsCrD,EAASI,GACtD,OAAIvmC,GAAWmmC,GAEXnmC,GAAWumC,IAAYiD,GAAsCrD,EAAQ7kC,OAAQilC,EAAQjlC,SACrFrB,GAAcsmC,IAAYiD,GAAsCrD,EAASI,EAAQjlC,QAIjFrB,GAAckmC,GAETlmC,GAAcsmC,IAAYiD,GAAsCrD,EAAQ7kC,OAAQilC,EAAQjlC,QAI/Fc,GAAYmkC,IAAYJ,EAAQ5mF,OAASgnF,EAAQhnF,MACjD0gD,GAAcsmC,IAAYiD,GAAsCrD,EAASI,EAAQjlC,OAErF,CAEA,SAAS8mC,GAA0CjC,EAASI,GAC1D,OAAIvmC,GAAWmmC,GAENnmC,GAAWumC,IAAY6B,GAA0CjC,EAAQ7kC,OAAQilC,EAAQjlC,QAG9FrB,GAAckmC,GAGdlmC,GAAcsmC,IAAY6B,GAA0CjC,EAAQ7kC,OAAQilC,EAAQjlC,UAC3FrB,GAAcsmC,IAAY6B,GAA0CjC,EAAQ7kC,OAAQilC,GAKlFnkC,GAAYmkC,IAAYJ,EAAQ5mF,OAASgnF,EAAQhnF,IAC1D,CAEA,SAASsnF,GAAa9qF,GACpB,OAAI2jD,EAAa3jD,GACR,gBAGL4jD,EAAa5jD,GACR,iBAGL6jD,EAAgB7jD,GACX,oBAGL8jD,EAAY9jD,GACP,eAGL+jD,EAAW/jD,GACN,eAILgkD,GAAkBhkD,GACb,qBAIA,EAAAwjD,EAAA,GAAU,EAAG,qBAAsB,EAAAnF,EAAA,GAAQr+C,GACtD,CAEA,SAASguF,GAAeltF,EAAOd,GAC7B,IAAImH,EAAM8lD,GAAansD,EAAOd,GACvB,MAAPmH,IAAe,EAAAq8C,EAAA,GAAU,GACzB,IAAI6qC,GAAY,QAAMlnF,EAAK,CACzBk9D,YAAa,SAAqBiqB,GAEhC,IAAI78E,EAAS,GAAGnE,OAAOghF,EAAW78E,QAIlC,OAHAA,EAAO2B,MAAK,SAAUm7E,EAAQC,GAC5B,OAAO3uC,EAAe0uC,EAAO/qF,KAAK1C,MAAO0tF,EAAOhrF,KAAK1C,MACvD,IACO,GAAc,GAAc,CAAC,EAAGwtF,GAAa,CAAC,EAAG,CACtD78E,OAAQA,GAEZ,IAEF,OAAO,OAAM48E,EACf,CAEA,SAASxiF,GAAK4iF,EAAUC,GAatB,IAZA,IAAIn1E,EAAQ,GACRy9B,EAAU,GACVszC,EAAY,GACZqE,EAAShwC,EAAO8vC,GAAU,SAAU59B,GAEtC,OADWA,EAAOrtD,IAEpB,IACIorF,EAASjwC,EAAO+vC,GAAU,SAAUG,GAEtC,OADWA,EAAOrrF,IAEpB,IAESsrF,EAAO,EAAGA,EAAOL,EAASjxF,OAAQsxF,IAAQ,CACjD,IAAIC,EAAUN,EAASK,GACnBE,EAAUJ,EAAOG,EAAQvrF,WAEbX,IAAZmsF,EACFh4C,EAAQp9C,KAAKm1F,GAEbzE,EAAU1wF,KAAK,CAACm1F,EAASC,GAE7B,CAEA,IAAK,IAAIC,EAAO,EAAGA,EAAOP,EAASlxF,OAAQyxF,IAAQ,CACjD,IAAIC,EAAWR,EAASO,QAEMpsF,IAA1B8rF,EAAOO,EAAS1rF,OAClB+V,EAAM3f,KAAKs1F,EAEf,CAEA,MAAO,CACL31E,MAAOA,EACP+wE,UAAWA,EACXtzC,QAASA,EAEb,CCjeO,SAASm4C,GAAqB9jC,EAAQlkD,GAC3C,OAAOqpE,GAASnlB,EAAQlkD,EAAK,CAAC2yE,IAChC,C,kFCZe,SAAShzB,EAAcsoC,GACpC,IAAI3yD,EAAK2yD,EAAY1vF,UAAUmnD,OACjB,oBAAPpqB,IAAqB,OAAU,GACtC2yD,EAAY1vF,UAAU2+C,QAAU5hB,EAE5B,MACF2yD,EAAY1vF,UAAU,KAA6B+8B,EAEvD,C,wBCde,SAASgiB,EAAU4wC,EAAW1vF,GAG3C,IAFuB0iB,QAAQgtE,GAG7B,MAAM,IAAI3mF,MAAM/I,EAEpB,C,sGCNA,SAASq5C,EAAQhmC,GAAmV,OAAtOgmC,EAArD,oBAAXtd,QAAoD,kBAApBA,OAAOqO,SAAmC,SAAiB/2B,GAAO,cAAcA,CAAK,EAAsB,SAAiBA,GAAO,OAAOA,GAAyB,oBAAX0oB,QAAyB1oB,EAAI7Y,cAAgBuhC,QAAU1oB,IAAQ0oB,OAAOh8B,UAAY,gBAAkBsT,CAAK,EAAYgmC,EAAQhmC,EAAM,CAIzX,IAAIs8E,EAAmB,GACnBC,EAAsB,EAKX,SAASlxC,EAAQv9C,GAC9B,OAAO0uF,EAAY1uF,EAAO,GAC5B,CAEA,SAAS0uF,EAAY1uF,EAAO2uF,GAC1B,OAAQz2C,EAAQl4C,IACd,IAAK,SACH,OAAO3C,KAAKC,UAAU0C,GAExB,IAAK,WACH,OAAOA,EAAM0C,KAAO,aAAa8J,OAAOxM,EAAM0C,KAAM,KAAO,aAE7D,IAAK,SACH,OAAc,OAAV1C,EACK,OAUf,SAA2BA,EAAO4uF,GAChC,IAA6C,IAAzCA,EAAqBjyF,QAAQqD,GAC/B,MAAO,aAGT,IAAI2uF,EAAa,GAAGniF,OAAOoiF,EAAsB,CAAC5uF,IAC9C6uF,EA2DN,SAAqBhvF,GACnB,IAAIgvF,EAAkBhvF,EAAOmd,OAAO,MAEpC,GAA+B,oBAApB6xE,EACT,OAAOA,EAGT,GAA8B,oBAAnBhvF,EAAO09C,QAChB,OAAO19C,EAAO09C,OAElB,CArEwBuxC,CAAY9uF,GAElC,QAAwB+B,IAApB8sF,EAA+B,CACjC,IAAIE,EAAcF,EAAgBzwF,KAAK4B,GAEvC,GAAI+uF,IAAgB/uF,EAClB,MAA8B,kBAAhB+uF,EAA2BA,EAAcL,EAAYK,EAAaJ,EAEpF,MAAO,GAAI7iF,MAAMC,QAAQ/L,GACvB,OAwBJ,SAAqBgW,EAAO24E,GAC1B,GAAqB,IAAjB34E,EAAMtZ,OACR,MAAO,KAGT,GAAIiyF,EAAWjyF,OAAS+xF,EACtB,MAAO,UAOT,IAJA,IAAI72C,EAAM58C,KAAKE,IAAIszF,EAAkBx4E,EAAMtZ,QACvCsyF,EAAYh5E,EAAMtZ,OAASk7C,EAC3B0U,EAAQ,GAEHhnD,EAAI,EAAGA,EAAIsyC,IAAOtyC,EACzBgnD,EAAMxzD,KAAK41F,EAAY14E,EAAM1Q,GAAIqpF,IAGjB,IAAdK,EACF1iC,EAAMxzD,KAAK,mBACFk2F,EAAY,GACrB1iC,EAAMxzD,KAAK,OAAO0T,OAAOwiF,EAAW,gBAGtC,MAAO,IAAM1iC,EAAMtyC,KAAK,MAAQ,GAClC,CAhDWi1E,CAAYjvF,EAAO2uF,GAG5B,OAGF,SAAsB9uF,EAAQ8uF,GAC5B,IAAI3mF,EAAO/D,OAAO+D,KAAKnI,GAEvB,GAAoB,IAAhBmI,EAAKtL,OACP,MAAO,KAGT,GAAIiyF,EAAWjyF,OAAS+xF,EACtB,MAAO,IAgDX,SAAsB5uF,GACpB,IAAIqvF,EAAMjrF,OAAOrF,UAAUoF,SAAS5F,KAAKyB,GAAQyC,QAAQ,aAAc,IAAIA,QAAQ,KAAM,IAEzF,GAAY,WAAR4sF,GAAkD,oBAAvBrvF,EAAOxG,YAA4B,CAChE,IAAIqJ,EAAO7C,EAAOxG,YAAYqJ,KAE9B,GAAoB,kBAATA,GAA8B,KAATA,EAC9B,OAAOA,CAEX,CAEA,OAAOwsF,CACT,CA5DiBC,CAAatvF,GAAU,IAGtC,IAAIC,EAAakI,EAAK7G,KAAI,SAAUpB,GAElC,OAAOA,EAAM,KADD2uF,EAAY7uF,EAAOE,GAAM4uF,EAEvC,IACA,MAAO,KAAO7uF,EAAWka,KAAK,MAAQ,IACxC,CAnBSo1E,CAAapvF,EAAO2uF,EAC7B,CA1BaU,CAAkBrvF,EAAO2uF,GAElC,QACE,OAAO3xE,OAAOhd,GAEpB,C,sBCtBA,IAEA,SAAoBA,EAAO3G,GACzB,OAAO2G,aAAiB3G,CAC1B,C,wBCde,SAASqpD,EAAU6rC,EAAW1vF,GAG3C,IAFuB0iB,QAAQgtE,GAG7B,MAAM,IAAI3mF,MAAiB,MAAX/I,EAAkBA,EAAU,kCAEhD,C,uDCNA,SAASq5C,EAAQhmC,GAAmV,OAAtOgmC,EAArD,oBAAXtd,QAAoD,kBAApBA,OAAOqO,SAAmC,SAAiB/2B,GAAO,cAAcA,CAAK,EAAsB,SAAiBA,GAAO,OAAOA,GAAyB,oBAAX0oB,QAAyB1oB,EAAI7Y,cAAgBuhC,QAAU1oB,IAAQ0oB,OAAOh8B,UAAY,gBAAkBsT,CAAK,EAAYgmC,EAAQhmC,EAAM,CAM1W,SAAS81C,EAAahoD,GACnC,MAAyB,UAAlBk4C,EAAQl4C,IAAgC,OAAVA,CACvC,C,qDCPA,IAAIsvF,EAA8C,oBAAX10D,QAA+C,oBAAfA,OAAOC,IAAqBD,OAAOC,IAAI,mCAAgC94B,EAC9I,K,wHCIWwtF,EAAwB,WAoBjC,SAASA,EAAStnF,EAAYC,EAAUnB,GACtCnO,KAAKc,MAAQuO,EAAWvO,MACxBd,KAAKsO,IAAMgB,EAAShB,IACpBtO,KAAKqP,WAAaA,EAClBrP,KAAKsP,SAAWA,EAChBtP,KAAKmO,OAASA,CAChB,CAWA,OATawoF,EAAS3wF,UAEfmnD,OAAS,WACd,MAAO,CACLrsD,MAAOd,KAAKc,MACZwN,IAAKtO,KAAKsO,IAEd,EAEOqoF,CACT,CAtCmC,IAwCnC,OAAcA,GAMP,IAAIC,EAAqB,WA8B9B,SAASA,EAAM7oF,EAAMjN,EAAOwN,EAAK8jC,EAAMykD,EAAQrf,EAAMpwE,GACnDpH,KAAK+N,KAAOA,EACZ/N,KAAKc,MAAQA,EACbd,KAAKsO,IAAMA,EACXtO,KAAKoyC,KAAOA,EACZpyC,KAAK62F,OAASA,EACd72F,KAAKoH,MAAQA,EACbpH,KAAKw3E,KAAOA,EACZx3E,KAAKmM,KAAO,IACd,CAaA,OAXcyqF,EAAM5wF,UAEZmnD,OAAS,WACf,MAAO,CACLp/C,KAAM/N,KAAK+N,KACX3G,MAAOpH,KAAKoH,MACZgrC,KAAMpyC,KAAKoyC,KACXykD,OAAQ72F,KAAK62F,OAEjB,EAEOD,CACT,CArDgC,GA4DzB,SAASE,EAAOC,GACrB,OAAoB,MAAbA,GAA+C,kBAAnBA,EAAUhpF,IAC/C,EAPA,OAAc6oF,E,wBCnGP,SAASI,EAAuBC,GAErC,IAAIC,EAAQD,EAAUzpD,MAAM,gBAExB2pD,EAAeC,EAA0BH,GAE7C,GAAqB,IAAjBE,EACF,IAAK,IAAIzqF,EAAI,EAAGA,EAAIwqF,EAAMpzF,OAAQ4I,IAChCwqF,EAAMxqF,GAAKwqF,EAAMxqF,GAAG7I,MAAMszF,GAO9B,IAFA,IAAIE,EAAY,EAETA,EAAYH,EAAMpzF,QAAUwzF,EAAQJ,EAAMG,OAC7CA,EAKJ,IAFA,IAAIE,EAAUL,EAAMpzF,OAEbyzF,EAAUF,GAAaC,EAAQJ,EAAMK,EAAU,OAClDA,EAIJ,OAAOL,EAAMrzF,MAAMwzF,EAAWE,GAASn2E,KAAK,KAC9C,CAEA,SAASk2E,EAAQvuC,GACf,IAAK,IAAIr8C,EAAI,EAAGA,EAAIq8C,EAAIjlD,SAAU4I,EAChC,GAAe,MAAXq8C,EAAIr8C,IAAyB,OAAXq8C,EAAIr8C,GACxB,OAAO,EAIX,OAAO,CACT,CAMO,SAAS0qF,EAA0BhwF,GAQxC,IAPA,IAAIowF,EAEAC,GAAc,EACdC,GAAc,EACdC,EAAS,EACTR,EAAe,KAEVzqF,EAAI,EAAGA,EAAItF,EAAMtD,SAAU4I,EAClC,OAAQtF,EAAMq/C,WAAW/5C,IACvB,KAAK,GAE6B,KAA5BtF,EAAMq/C,WAAW/5C,EAAI,MACrBA,EAKN,KAAK,GAEH+qF,GAAc,EACdC,GAAc,EACdC,EAAS,EACT,MAEF,KAAK,EAEL,KAAK,KAEDA,EACF,MAEF,QACMD,IAAgBD,IAAiC,OAAjBN,GAAyBQ,EAASR,KACpEA,EAAeQ,GAGjBD,GAAc,EAIpB,OAA0C,QAAlCF,EAAgBL,SAA4C,IAAlBK,EAA2BA,EAAgB,CAC/F,CASO,SAASI,EAAiBxwF,GAC/B,IAAIklF,EAAc1/E,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,GAAmBA,UAAU,GAAK,GAClFigF,EAAsBjgF,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,IAAmBA,UAAU,GACrFirF,GAAwC,IAAzBzwF,EAAMrD,QAAQ,MAC7B+zF,EAA+B,MAAb1wF,EAAM,IAA2B,OAAbA,EAAM,GAC5C2wF,EAA+C,MAA5B3wF,EAAMA,EAAMtD,OAAS,GACxCk0F,EAA+C,OAA5B5wF,EAAMA,EAAMtD,OAAS,GACxCm0F,GAAwBJ,GAAgBE,GAAoBC,GAAoBnL,EAChF5gF,EAAS,GAYb,OAVIgsF,GAA0BJ,GAAgBC,IAC5C7rF,GAAU,KAAOqgF,GAGnBrgF,GAAUqgF,EAAcllF,EAAMsC,QAAQ,MAAO,KAAO4iF,GAAellF,EAE/D6wF,IACFhsF,GAAU,MAGL,MAAQA,EAAOvC,QAAQ,OAAQ,SAAW,KACnD,C,wICxHO,IAAIwuF,EAAoB7sF,OAAOgS,OAAO,CAE3Cy3C,MAAO,QACPC,SAAU,WACVC,aAAc,eACd3Z,MAAO,QACPiB,oBAAqB,sBACrBx8B,gBAAiB,kBACjBm1C,gBAAiB,kBACjBC,oBAAqB,sBAErBC,OAAQ,SACRC,OAAQ,SACRxL,OAAQ,SACRyL,iBAAkB,mBAClBC,oBAAqB,sBACrBC,UAAW,YACXC,MAAO,QACP/L,KAAM,OACNgM,WAAY,aACZC,aAAc,eACdC,uBAAwB,0B,wDCrBnB,IAAIwiC,EAAO9sF,OAAOgS,OAAO,CAE9Bi+B,KAAM,OAENyoC,SAAU,WACV1nC,qBAAsB,sBACtB6Y,oBAAqB,qBACrB2M,cAAe,eACfxmB,MAAO,QACP8mB,SAAU,WAEVriD,gBAAiB,iBACjBm1C,gBAAiB,iBACjB3Y,oBAAqB,qBAErBuN,SAAU,WACVT,IAAK,WACLE,MAAO,aACPE,OAAQ,cACRE,QAAS,eACTP,KAAM,YACNM,KAAM,YACNE,KAAM,YACNC,OAAQ,cACRmK,aAAc,cAEdgO,UAAW,YAEXvB,WAAY,YACZF,UAAW,WACXC,cAAe,cAEf6C,kBAAmB,mBACnBg1B,0BAA2B,0BAE3B7vB,uBAAwB,uBACxBE,uBAAwB,uBACxBpT,iBAAkB,kBAClB+T,uBAAwB,uBACxBT,0BAA2B,0BAC3BE,sBAAuB,sBACvBE,qBAAsB,qBACtBE,sBAAuB,sBACvBC,6BAA8B,4BAE9Bf,qBAAsB,sBAEtB9E,iBAAkB,kBAElBmF,sBAAuB,sBACvBE,sBAAuB,sBACvBE,yBAA0B,yBAC1BE,qBAAsB,qBACtBE,oBAAqB,oBACrBG,4BAA6B,4B,+HC5CpBkvB,EAAqB,WAgB9B,SAASA,EAAMlqF,GACb,IAAImqF,EAAmB,IAAI,KAAM,IAAUC,IAAK,EAAG,EAAG,EAAG,EAAG,MAC5Dv4F,KAAKmO,OAASA,EACdnO,KAAKw4F,UAAYF,EACjBt4F,KAAK8oF,MAAQwP,EACbt4F,KAAKoyC,KAAO,EACZpyC,KAAKy4F,UAAY,CACnB,CAMA,IAAI3qC,EAASuqC,EAAMryF,UA4BnB,OA1BA8nD,EAAOggC,QAAU,WAGf,OAFA9tF,KAAKw4F,UAAYx4F,KAAK8oF,MACV9oF,KAAK8oF,MAAQ9oF,KAAK04F,WAEhC,EAOA5qC,EAAO4qC,UAAY,WACjB,IAAI5P,EAAQ9oF,KAAK8oF,MAEjB,GAAIA,EAAM/6E,OAAS,IAAUggF,IAC3B,EAAG,CACD,IAAI4K,EAGJ7P,EAAuC,QAA9B6P,EAAc7P,EAAM38E,YAAkC,IAAhBwsF,EAAyBA,EAAc7P,EAAM38E,KAAOysF,EAAU54F,KAAM8oF,EACrH,OAASA,EAAM/6E,OAAS,IAAUg7E,SAGpC,OAAOD,CACT,EAEOuP,CACT,CA1DgC,GA+DzB,SAASQ,EAAsB9qF,GACpC,OAAOA,IAAS,IAAU+qF,MAAQ/qF,IAAS,IAAUgrF,QAAUhrF,IAAS,IAAUirF,KAAOjrF,IAAS,IAAUkrF,SAAWlrF,IAAS,IAAUmrF,SAAWnrF,IAAS,IAAUogF,QAAUpgF,IAAS,IAAUorF,OAASprF,IAAS,IAAUqrF,QAAUrrF,IAAS,IAAUsrF,IAAMtrF,IAAS,IAAUurF,WAAavrF,IAAS,IAAUwrF,WAAaxrF,IAAS,IAAUyrF,SAAWzrF,IAAS,IAAU0rF,MAAQ1rF,IAAS,IAAU2rF,OAClZ,CAEA,SAASC,EAAc3yC,GACrB,OACEnR,MAAMmR,GAAQ,IAAU+mC,IACxB/mC,EAAO,IAASviD,KAAKC,UAAU0f,OAAOw1E,aAAa5yC,IACnD,OAAQpzC,QAAQ,KAAOozC,EAAK57C,SAAS,IAAIyZ,eAAehhB,OAAO,GAAI,IAEvE,CAUA,SAAS+0F,EAAUjL,EAAOnW,GAMxB,IALA,IAAIrpE,EAASw/E,EAAMx/E,OACfC,EAAOD,EAAOC,KACdyrF,EAAazrF,EAAKtK,OAClBk/C,EAAMw0B,EAAKlpE,IAER00C,EAAM62C,GAAY,CACvB,IAAI7yC,EAAO54C,EAAKq4C,WAAWzD,GACvB82C,EAAQnM,EAAMv7C,KAEd2nD,EAAO,EAAI/2C,EAAM2qC,EAAM8K,UAG3B,OAAQzxC,GACN,KAAK,MAEL,KAAK,EAEL,KAAK,GAEL,KAAK,KAEDhE,EACF,SAEF,KAAK,KAEDA,IACA2qC,EAAMv7C,KACRu7C,EAAM8K,UAAYz1C,EAClB,SAEF,KAAK,GAE8B,KAA7B50C,EAAKq4C,WAAWzD,EAAM,GACxBA,GAAO,IAELA,IAGF2qC,EAAMv7C,KACRu7C,EAAM8K,UAAYz1C,EAClB,SAEF,KAAK,GAEH,OAAO,IAAI,KAAM,IAAU81C,KAAM91C,EAAKA,EAAM,EAAG82C,EAAOC,EAAMviB,GAE9D,KAAK,GAEH,OAAOwiB,EAAY7rF,EAAQ60C,EAAK82C,EAAOC,EAAMviB,GAE/C,KAAK,GAEH,OAAO,IAAI,KAAM,IAAUuhB,OAAQ/1C,EAAKA,EAAM,EAAG82C,EAAOC,EAAMviB,GAEhE,KAAK,GAEH,OAAO,IAAI,KAAM,IAAUwhB,IAAKh2C,EAAKA,EAAM,EAAG82C,EAAOC,EAAMviB,GAE7D,KAAK,GAEH,OAAO,IAAI,KAAM,IAAUyhB,QAASj2C,EAAKA,EAAM,EAAG82C,EAAOC,EAAMviB,GAEjE,KAAK,GAEH,OAAO,IAAI,KAAM,IAAU0hB,QAASl2C,EAAKA,EAAM,EAAG82C,EAAOC,EAAMviB,GAEjE,KAAK,GAEH,GAAiC,KAA7BppE,EAAKq4C,WAAWzD,EAAM,IAA0C,KAA7B50C,EAAKq4C,WAAWzD,EAAM,GAC3D,OAAO,IAAI,KAAM,IAAUmrC,OAAQnrC,EAAKA,EAAM,EAAG82C,EAAOC,EAAMviB,GAGhE,MAEF,KAAK,GAEH,OAAO,IAAI,KAAM,IAAU2hB,MAAOn2C,EAAKA,EAAM,EAAG82C,EAAOC,EAAMviB,GAE/D,KAAK,GAEH,OAAO,IAAI,KAAM,IAAU4hB,OAAQp2C,EAAKA,EAAM,EAAG82C,EAAOC,EAAMviB,GAEhE,KAAK,GAEH,OAAO,IAAI,KAAM,IAAU6hB,GAAIr2C,EAAKA,EAAM,EAAG82C,EAAOC,EAAMviB,GAE5D,KAAK,GAEH,OAAO,IAAI,KAAM,IAAU8hB,UAAWt2C,EAAKA,EAAM,EAAG82C,EAAOC,EAAMviB,GAEnE,KAAK,GAEH,OAAO,IAAI,KAAM,IAAU+hB,UAAWv2C,EAAKA,EAAM,EAAG82C,EAAOC,EAAMviB,GAEnE,KAAK,IAEH,OAAO,IAAI,KAAM,IAAUgiB,QAASx2C,EAAKA,EAAM,EAAG82C,EAAOC,EAAMviB,GAEjE,KAAK,IAEH,OAAO,IAAI,KAAM,IAAUiiB,KAAMz2C,EAAKA,EAAM,EAAG82C,EAAOC,EAAMviB,GAE9D,KAAK,IAEH,OAAO,IAAI,KAAM,IAAUkiB,QAAS12C,EAAKA,EAAM,EAAG82C,EAAOC,EAAMviB,GAEjE,KAAK,GAEH,OAAiC,KAA7BppE,EAAKq4C,WAAWzD,EAAM,IAA0C,KAA7B50C,EAAKq4C,WAAWzD,EAAM,GACpDi3C,EAAgB9rF,EAAQ60C,EAAK82C,EAAOC,EAAMviB,EAAMmW,GAGlDuM,EAAW/rF,EAAQ60C,EAAK82C,EAAOC,EAAMviB,GAE9C,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEH,OAAO2iB,EAAWhsF,EAAQ60C,EAAKgE,EAAM8yC,EAAOC,EAAMviB,GAEpD,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,GAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEL,KAAK,IAEH,OAAO4iB,EAASjsF,EAAQ60C,EAAK82C,EAAOC,EAAMviB,GAG9C,MAAM,OAAYrpE,EAAQ60C,EAAKq3C,EAA2BrzC,GAC5D,CAEA,IAAI5U,EAAOu7C,EAAMv7C,KACbkoD,EAAM,EAAIt3C,EAAM2qC,EAAM8K,UAC1B,OAAO,IAAI,KAAM,IAAU1K,IAAK8L,EAAYA,EAAYznD,EAAMkoD,EAAK9iB,EACrE,CAMA,SAAS6iB,EAA2BrzC,GAClC,OAAIA,EAAO,IAAmB,IAATA,GAA4B,KAATA,GAA4B,KAATA,EAClD,wCAAwCpzC,OAAO+lF,EAAc3yC,GAAO,KAGhE,KAATA,EAEK,kFAGF,yCAAyCpzC,OAAO+lF,EAAc3yC,GAAO,IAC9E,CAQA,SAASgzC,EAAY7rF,EAAQrN,EAAOsxC,EAAMkoD,EAAK9iB,GAC7C,IACIxwB,EADA54C,EAAOD,EAAOC,KAEd21C,EAAWjjD,EAEf,GACEkmD,EAAO54C,EAAKq4C,aAAa1C,UACjBlO,MAAMmR,KAChBA,EAAO,IAAmB,IAATA,IAEjB,OAAO,IAAI,KAAM,IAAU+hC,QAASjoF,EAAOijD,EAAU3R,EAAMkoD,EAAK9iB,EAAMppE,EAAKvK,MAAM/C,EAAQ,EAAGijD,GAC9F,CAUA,SAASo2C,EAAWhsF,EAAQrN,EAAOy5F,EAAWnoD,EAAMkoD,EAAK9iB,GACvD,IAAIppE,EAAOD,EAAOC,KACd44C,EAAOuzC,EACPx2C,EAAWjjD,EACX05F,GAAU,EAOd,GALa,KAATxzC,IAEFA,EAAO54C,EAAKq4C,aAAa1C,IAGd,KAATiD,GAIF,IAFAA,EAAO54C,EAAKq4C,aAAa1C,KAEb,IAAMiD,GAAQ,GACxB,MAAM,OAAY74C,EAAQ41C,EAAU,6CAA6CnwC,OAAO+lF,EAAc3yC,GAAO,WAG/GjD,EAAW02C,EAAWtsF,EAAQ41C,EAAUiD,GACxCA,EAAO54C,EAAKq4C,WAAW1C,GA0BzB,GAvBa,KAATiD,IAEFwzC,GAAU,EACVxzC,EAAO54C,EAAKq4C,aAAa1C,GACzBA,EAAW02C,EAAWtsF,EAAQ41C,EAAUiD,GACxCA,EAAO54C,EAAKq4C,WAAW1C,IAGZ,KAATiD,GAAwB,MAATA,IAEjBwzC,GAAU,EAGG,MAFbxzC,EAAO54C,EAAKq4C,aAAa1C,KAEG,KAATiD,IAEjBA,EAAO54C,EAAKq4C,aAAa1C,IAG3BA,EAAW02C,EAAWtsF,EAAQ41C,EAAUiD,GACxCA,EAAO54C,EAAKq4C,WAAW1C,IAIZ,KAATiD,GAsON,SAAqBA,GACnB,OAAgB,KAATA,GAAeA,GAAQ,IAAMA,GAAQ,IAAMA,GAAQ,IAAMA,GAAQ,GAC1E,CAxOqB0zC,CAAY1zC,GAC7B,MAAM,OAAY74C,EAAQ41C,EAAU,2CAA2CnwC,OAAO+lF,EAAc3yC,GAAO,MAG7G,OAAO,IAAI,KAAMwzC,EAAU,IAAUlxC,MAAQ,IAAUF,IAAKtoD,EAAOijD,EAAU3R,EAAMkoD,EAAK9iB,EAAMppE,EAAKvK,MAAM/C,EAAOijD,GAClH,CAMA,SAAS02C,EAAWtsF,EAAQrN,EAAOy5F,GACjC,IAAInsF,EAAOD,EAAOC,KACd21C,EAAWjjD,EACXkmD,EAAOuzC,EAEX,GAAIvzC,GAAQ,IAAMA,GAAQ,GAAI,CAE5B,GACEA,EAAO54C,EAAKq4C,aAAa1C,SAClBiD,GAAQ,IAAMA,GAAQ,IAG/B,OAAOjD,CACT,CAEA,MAAM,OAAY51C,EAAQ41C,EAAU,2CAA2CnwC,OAAO+lF,EAAc3yC,GAAO,KAC7G,CAQA,SAASkzC,EAAW/rF,EAAQrN,EAAOsxC,EAAMkoD,EAAK9iB,GAO5C,IANA,IAsJmBjuE,EAAGo+C,EAAGn7B,EAAG3R,EAtJxBzM,EAAOD,EAAOC,KACd21C,EAAWjjD,EAAQ,EACnB65F,EAAa52C,EACbiD,EAAO,EACP5/C,EAAQ,GAEL28C,EAAW31C,EAAKtK,SAAW+xC,MAAMmR,EAAO54C,EAAKq4C,WAAW1C,KACtD,KAATiD,GAA4B,KAATA,GAAiB,CAElC,GAAa,KAATA,EAEF,OADA5/C,GAASgH,EAAKvK,MAAM82F,EAAY52C,GACzB,IAAI,KAAM,IAAUyF,OAAQ1oD,EAAOijD,EAAW,EAAG3R,EAAMkoD,EAAK9iB,EAAMpwE,GAI3E,GAAI4/C,EAAO,IAAmB,IAATA,EACnB,MAAM,OAAY74C,EAAQ41C,EAAU,oCAAoCnwC,OAAO+lF,EAAc3yC,GAAO,MAKtG,KAFEjD,EAEW,KAATiD,EAAa,CAKf,OAHA5/C,GAASgH,EAAKvK,MAAM82F,EAAY52C,EAAW,GAC3CiD,EAAO54C,EAAKq4C,WAAW1C,IAGrB,KAAK,GACH38C,GAAS,IACT,MAEF,KAAK,GACHA,GAAS,IACT,MAEF,KAAK,GACHA,GAAS,KACT,MAEF,KAAK,GACHA,GAAS,KACT,MAEF,KAAK,IACHA,GAAS,KACT,MAEF,KAAK,IACHA,GAAS,KACT,MAEF,KAAK,IACHA,GAAS,KACT,MAEF,KAAK,IACHA,GAAS,KACT,MAEF,KAAK,IAGD,IAAIwzF,GAwFKrxF,EAxFkB6E,EAAKq4C,WAAW1C,EAAW,GAwF1C4D,EAxF8Cv5C,EAAKq4C,WAAW1C,EAAW,GAwFtEv3B,EAxF0Epe,EAAKq4C,WAAW1C,EAAW,GAwFlGlpC,EAxFsGzM,EAAKq4C,WAAW1C,EAAW,GAyFtJ82C,EAAStxF,IAAM,GAAKsxF,EAASlzC,IAAM,EAAIkzC,EAASruE,IAAM,EAAIquE,EAAShgF,IAvFhE,GAAI+/E,EAAW,EAAG,CAChB,IAAIE,EAAkB1sF,EAAKvK,MAAMkgD,EAAW,EAAGA,EAAW,GAC1D,MAAM,OAAY51C,EAAQ41C,EAAU,yCAAyCnwC,OAAOknF,EAAiB,KACvG,CAEA1zF,GAASgd,OAAOw1E,aAAagB,GAC7B72C,GAAY,EACZ,MAGJ,QACE,MAAM,OAAY51C,EAAQ41C,EAAU,wCAAwCnwC,OAAOwQ,OAAOw1E,aAAa5yC,GAAO,MAIlH2zC,IADE52C,CAEJ,CACF,CAEA,MAAM,OAAY51C,EAAQ41C,EAAU,uBACtC,CAQA,SAASk2C,EAAgB9rF,EAAQrN,EAAOsxC,EAAMkoD,EAAK9iB,EAAMmW,GAOvD,IANA,IAAIv/E,EAAOD,EAAOC,KACd21C,EAAWjjD,EAAQ,EACnB65F,EAAa52C,EACbiD,EAAO,EACP4hC,EAAW,GAER7kC,EAAW31C,EAAKtK,SAAW+xC,MAAMmR,EAAO54C,EAAKq4C,WAAW1C,KAAY,CAEzE,GAAa,KAATiD,GAAiD,KAAlC54C,EAAKq4C,WAAW1C,EAAW,IAA+C,KAAlC31C,EAAKq4C,WAAW1C,EAAW,GAEpF,OADA6kC,GAAYx6E,EAAKvK,MAAM82F,EAAY52C,GAC5B,IAAI,KAAM,IAAUsqC,aAAcvtF,EAAOijD,EAAW,EAAG3R,EAAMkoD,EAAK9iB,GAAM,QAAuBoR,IAIxG,GAAI5hC,EAAO,IAAmB,IAATA,GAA4B,KAATA,GAA4B,KAATA,EACzD,MAAM,OAAY74C,EAAQ41C,EAAU,oCAAoCnwC,OAAO+lF,EAAc3yC,GAAO,MAGzF,KAATA,KAEAjD,IACA4pC,EAAMv7C,KACRu7C,EAAM8K,UAAY10C,GACA,KAATiD,GAE6B,KAAlC54C,EAAKq4C,WAAW1C,EAAW,GAC7BA,GAAY,IAEVA,IAGF4pC,EAAMv7C,KACRu7C,EAAM8K,UAAY10C,GAEX,KAATiD,GAAiD,KAAlC54C,EAAKq4C,WAAW1C,EAAW,IAA+C,KAAlC31C,EAAKq4C,WAAW1C,EAAW,IAA+C,KAAlC31C,EAAKq4C,WAAW1C,EAAW,IACxH6kC,GAAYx6E,EAAKvK,MAAM82F,EAAY52C,GAAY,MAE/C42C,EADA52C,GAAY,KAGVA,CAEN,CAEA,MAAM,OAAY51C,EAAQ41C,EAAU,uBACtC,CA0BA,SAAS82C,EAAStxF,GAChB,OAAOA,GAAK,IAAMA,GAAK,GAAKA,EAAI,GAC9BA,GAAK,IAAMA,GAAK,GAAKA,EAAI,GACzBA,GAAK,IAAMA,GAAK,IAAMA,EAAI,IACzB,CACL,CAQA,SAAS6wF,EAASjsF,EAAQrN,EAAOsxC,EAAMkoD,EAAK9iB,GAM1C,IALA,IAAIppE,EAAOD,EAAOC,KACdyrF,EAAazrF,EAAKtK,OAClBigD,EAAWjjD,EAAQ,EACnBkmD,EAAO,EAEJjD,IAAa81C,IAAehkD,MAAMmR,EAAO54C,EAAKq4C,WAAW1C,MAAwB,KAATiD,GAC/EA,GAAQ,IAAMA,GAAQ,IACtBA,GAAQ,IAAMA,GAAQ,IACtBA,GAAQ,IAAMA,GAAQ,QAElBjD,EAGJ,OAAO,IAAI,KAAM,IAAUzI,KAAMx6C,EAAOijD,EAAU3R,EAAMkoD,EAAK9iB,EAAMppE,EAAKvK,MAAM/C,EAAOijD,GACvF,C,wBCtpBO,SAASg3C,EAAY5sF,EAAQ41C,GAMlC,IALA,IAGInvC,EAHAomF,EAAa,eACb5oD,EAAO,EACPykD,EAAS9yC,EAAW,GAGhBnvC,EAAQomF,EAAWC,KAAK9sF,EAAOC,QAAUwG,EAAMs2B,MAAQ6Y,GAC7D3R,GAAQ,EACRykD,EAAS9yC,EAAW,GAAKnvC,EAAMs2B,MAAQt2B,EAAM,GAAG9Q,QAGlD,MAAO,CACLsuC,KAAMA,EACNykD,OAAQA,EAEZ,C,yNCRO,SAAStwF,EAAM4H,EAAQ3D,GAE5B,OADa,IAAI0wF,EAAO/sF,EAAQ3D,GAClBoE,eAChB,CAYO,SAAS4+C,EAAWr/C,EAAQ3D,GACjC,IAAI2wF,EAAS,IAAID,EAAO/sF,EAAQ3D,GAChC2wF,EAAOC,YAAY,IAAU7C,KAC7B,IAAInxF,EAAQ+zF,EAAOE,mBAAkB,GAErC,OADAF,EAAOC,YAAY,IAAUrN,KACtB3mF,CACT,CAYO,SAASk0F,EAAUntF,EAAQ3D,GAChC,IAAI2wF,EAAS,IAAID,EAAO/sF,EAAQ3D,GAChC2wF,EAAOC,YAAY,IAAU7C,KAC7B,IAAIjyF,EAAO60F,EAAOI,qBAElB,OADAJ,EAAOC,YAAY,IAAUrN,KACtBznF,CACT,CAaO,IAAI40F,EAAsB,WAC/B,SAASA,EAAO/sF,EAAQ3D,GACtB,IAAIkjF,GAAY,OAASv/E,GAAUA,EAAS,IAAI,IAAOA,GACvDnO,KAAKw7F,OAAS,IAAI,IAAM9N,GACxB1tF,KAAKy7F,SAAWjxF,CAClB,CAMA,IAAIsjD,EAASotC,EAAOl1F,UA26CpB,OAz6CA8nD,EAAO4tC,UAAY,WACjB,IAAI5S,EAAQ9oF,KAAKo7F,YAAY,IAAU9/C,MACvC,MAAO,CACLvtC,KAAM,IAAKutC,KACXl0C,MAAO0hF,EAAM1hF,MACb8G,IAAKlO,KAAKkO,IAAI46E,GAElB,EAOAh7B,EAAOl/C,cAAgB,WACrB,IAAI9N,EAAQd,KAAKw7F,OAAO1S,MACxB,MAAO,CACL/6E,KAAM,IAAKg2E,SACXn2E,YAAa5N,KAAK27F,KAAK,IAAUpD,IAAKv4F,KAAK47F,gBAAiB,IAAU7N,KACtE7/E,IAAKlO,KAAKkO,IAAIpN,GAElB,EAaAgtD,EAAO8tC,gBAAkB,WACvB,GAAI57F,KAAKqe,KAAK,IAAUi9B,MACtB,OAAQt7C,KAAKw7F,OAAO1S,MAAM1hF,OACxB,IAAK,QACL,IAAK,WACL,IAAK,eACH,OAAOpH,KAAK67F,2BAEd,IAAK,WACH,OAAO77F,KAAK87F,0BAEd,IAAK,SACL,IAAK,SACL,IAAK,OACL,IAAK,YACL,IAAK,QACL,IAAK,OACL,IAAK,QACL,IAAK,YACH,OAAO97F,KAAK+7F,4BAEd,IAAK,SACH,OAAO/7F,KAAKg8F,+BAEX,IAAIh8F,KAAKqe,KAAK,IAAUm7E,SAC7B,OAAOx5F,KAAK67F,2BACP,GAAI77F,KAAKi8F,kBACd,OAAOj8F,KAAK+7F,2BACd,CAEA,MAAM/7F,KAAKk8F,YACb,EASApuC,EAAO+tC,yBAA2B,WAChC,IAAI/6F,EAAQd,KAAKw7F,OAAO1S,MAExB,GAAI9oF,KAAKqe,KAAK,IAAUm7E,SACtB,MAAO,CACLzrF,KAAM,IAAKsuC,qBACXvxC,UAAW,QACXhB,UAAMX,EACNq9B,oBAAqB,GACrB1kB,WAAY,GACZhN,aAAc9U,KAAKm8F,oBACnBjuF,IAAKlO,KAAKkO,IAAIpN,IAIlB,IACIgJ,EADAgB,EAAY9K,KAAKo8F,qBAOrB,OAJIp8F,KAAKqe,KAAK,IAAUi9B,QACtBxxC,EAAO9J,KAAK07F,aAGP,CACL3tF,KAAM,IAAKsuC,qBACXvxC,UAAWA,EACXhB,KAAMA,EACN08B,oBAAqBxmC,KAAKq8F,2BAC1Bv6E,WAAY9hB,KAAKs8F,iBAAgB,GACjCxnF,aAAc9U,KAAKm8F,oBACnBjuF,IAAKlO,KAAKkO,IAAIpN,GAElB,EAMAgtD,EAAOsuC,mBAAqB,WAC1B,IAAIG,EAAiBv8F,KAAKo7F,YAAY,IAAU9/C,MAEhD,OAAQihD,EAAen1F,OACrB,IAAK,QACH,MAAO,QAET,IAAK,WACH,MAAO,WAET,IAAK,eACH,MAAO,eAGX,MAAMpH,KAAKk8F,WAAWK,EACxB,EAMAzuC,EAAOuuC,yBAA2B,WAChC,OAAOr8F,KAAKw8F,aAAa,IAAUvD,QAASj5F,KAAKy8F,wBAAyB,IAAUvD,QACtF,EAMAprC,EAAO2uC,wBAA0B,WAC/B,IAAI37F,EAAQd,KAAKw7F,OAAO1S,MACxB,MAAO,CACL/6E,KAAM,IAAKmnD,oBACXxuB,SAAU1mC,KAAK08F,gBACfp2F,MAAOtG,KAAKo7F,YAAY,IAAUjC,OAAQn5F,KAAKu7F,sBAC/CziD,aAAc94C,KAAK28F,oBAAoB,IAAUvD,QAAUp5F,KAAKq7F,mBAAkB,QAAQlyF,EAC1F2Y,WAAY9hB,KAAKs8F,iBAAgB,GACjCpuF,IAAKlO,KAAKkO,IAAIpN,GAElB,EAMAgtD,EAAO4uC,cAAgB,WACrB,IAAI57F,EAAQd,KAAKw7F,OAAO1S,MAExB,OADA9oF,KAAKo7F,YAAY,IAAUrC,QACpB,CACLhrF,KAAM,IAAK87C,SACX//C,KAAM9J,KAAK07F,YACXxtF,IAAKlO,KAAKkO,IAAIpN,GAElB,EAMAgtD,EAAOquC,kBAAoB,WACzB,IAAIr7F,EAAQd,KAAKw7F,OAAO1S,MACxB,MAAO,CACL/6E,KAAM,IAAK8zD,cACX5sD,WAAYjV,KAAK27F,KAAK,IAAUnC,QAASx5F,KAAK48F,eAAgB,IAAUlD,SACxExrF,IAAKlO,KAAKkO,IAAIpN,GAElB,EASAgtD,EAAO8uC,eAAiB,WACtB,OAAO58F,KAAKqe,KAAK,IAAU8vE,QAAUnuF,KAAK68F,gBAAkB78F,KAAK88F,YACnE,EAQAhvC,EAAOgvC,WAAa,WAClB,IAEI/hD,EACAjxC,EAHAhJ,EAAQd,KAAKw7F,OAAO1S,MACpBiU,EAAc/8F,KAAK07F,YAWvB,OAPI17F,KAAK28F,oBAAoB,IAAUxD,QACrCp+C,EAAQgiD,EACRjzF,EAAO9J,KAAK07F,aAEZ5xF,EAAOizF,EAGF,CACLhvF,KAAM,IAAKstC,MACXN,MAAOA,EACPjxC,KAAMA,EACN8C,UAAW5M,KAAKg9F,gBAAe,GAC/Bl7E,WAAY9hB,KAAKs8F,iBAAgB,GACjCxnF,aAAc9U,KAAKqe,KAAK,IAAUm7E,SAAWx5F,KAAKm8F,yBAAsBhzF,EACxE+E,IAAKlO,KAAKkO,IAAIpN,GAElB,EAMAgtD,EAAOkvC,eAAiB,SAAwBC,GAC9C,IAAIjoF,EAAOioF,EAAUj9F,KAAKk9F,mBAAqBl9F,KAAKm9F,cACpD,OAAOn9F,KAAKw8F,aAAa,IAAUvD,QAASjkF,EAAM,IAAUkkF,QAC9D,EAMAprC,EAAOqvC,cAAgB,WACrB,IAAIr8F,EAAQd,KAAKw7F,OAAO1S,MACpBh/E,EAAO9J,KAAK07F,YAEhB,OADA17F,KAAKo7F,YAAY,IAAUjC,OACpB,CACLprF,KAAM,IAAKo0D,SACXr4D,KAAMA,EACN1C,MAAOpH,KAAKq7F,mBAAkB,GAC9BntF,IAAKlO,KAAKkO,IAAIpN,GAElB,EAEAgtD,EAAOovC,mBAAqB,WAC1B,IAAIp8F,EAAQd,KAAKw7F,OAAO1S,MACxB,MAAO,CACL/6E,KAAM,IAAKo0D,SACXr4D,KAAM9J,KAAK07F,YACXt0F,OAAQpH,KAAKo7F,YAAY,IAAUjC,OAAQn5F,KAAKq7F,mBAAkB,IAClEntF,IAAKlO,KAAKkO,IAAIpN,GAElB,EAWAgtD,EAAO+uC,cAAgB,WACrB,IAAI/7F,EAAQd,KAAKw7F,OAAO1S,MACxB9oF,KAAKo7F,YAAY,IAAUjN,QAC3B,IAAIiP,EAAmBp9F,KAAKq9F,sBAAsB,MAElD,OAAKD,GAAoBp9F,KAAKqe,KAAK,IAAUi9B,MACpC,CACLvtC,KAAM,IAAK+R,gBACXhW,KAAM9J,KAAKs9F,oBACXx7E,WAAY9hB,KAAKs8F,iBAAgB,GACjCpuF,IAAKlO,KAAKkO,IAAIpN,IAIX,CACLiN,KAAM,IAAKknD,gBACXlvC,cAAeq3E,EAAmBp9F,KAAKu9F,sBAAmBp0F,EAC1D2Y,WAAY9hB,KAAKs8F,iBAAgB,GACjCxnF,aAAc9U,KAAKm8F,oBACnBjuF,IAAKlO,KAAKkO,IAAIpN,GAElB,EASAgtD,EAAOguC,wBAA0B,WAC/B,IAAI0B,EAEA18F,EAAQd,KAAKw7F,OAAO1S,MAKxB,OAJA9oF,KAAKy9F,cAAc,aAIsH,KAA/F,QAApCD,EAAiBx9F,KAAKy7F,gBAAyC,IAAnB+B,OAA4B,EAASA,EAAepwF,+BAC7F,CACLW,KAAM,IAAKuuC,oBACXxyC,KAAM9J,KAAKs9F,oBACX92D,oBAAqBxmC,KAAKq8F,2BAC1Bt2E,eAAgB/lB,KAAKy9F,cAAc,MAAOz9F,KAAKu9F,kBAC/Cz7E,WAAY9hB,KAAKs8F,iBAAgB,GACjCxnF,aAAc9U,KAAKm8F,oBACnBjuF,IAAKlO,KAAKkO,IAAIpN,IAIX,CACLiN,KAAM,IAAKuuC,oBACXxyC,KAAM9J,KAAKs9F,oBACXv3E,eAAgB/lB,KAAKy9F,cAAc,MAAOz9F,KAAKu9F,kBAC/Cz7E,WAAY9hB,KAAKs8F,iBAAgB,GACjCxnF,aAAc9U,KAAKm8F,oBACnBjuF,IAAKlO,KAAKkO,IAAIpN,GAElB,EAMAgtD,EAAOwvC,kBAAoB,WACzB,GAAgC,OAA5Bt9F,KAAKw7F,OAAO1S,MAAM1hF,MACpB,MAAMpH,KAAKk8F,aAGb,OAAOl8F,KAAK07F,WACd,EAsBA5tC,EAAOutC,kBAAoB,SAA2B4B,GACpD,IAAInU,EAAQ9oF,KAAKw7F,OAAO1S,MAExB,OAAQA,EAAM/6E,MACZ,KAAK,IAAUurF,UACb,OAAOt5F,KAAK09F,UAAUT,GAExB,KAAK,IAAUzD,QACb,OAAOx5F,KAAK29F,YAAYV,GAE1B,KAAK,IAAU7zC,IAGb,OAFAppD,KAAKw7F,OAAO1N,UAEL,CACL//E,KAAM,IAAKq7C,IACXhiD,MAAO0hF,EAAM1hF,MACb8G,IAAKlO,KAAKkO,IAAI46E,IAGlB,KAAK,IAAUx/B,MAGb,OAFAtpD,KAAKw7F,OAAO1N,UAEL,CACL//E,KAAM,IAAKu7C,MACXliD,MAAO0hF,EAAM1hF,MACb8G,IAAKlO,KAAKkO,IAAI46E,IAGlB,KAAK,IAAUt/B,OACf,KAAK,IAAU6kC,aACb,OAAOruF,KAAK49F,qBAEd,KAAK,IAAUtiD,KAGb,OAFAt7C,KAAKw7F,OAAO1N,UAEJhF,EAAM1hF,OACZ,IAAK,OACH,MAAO,CACL2G,KAAM,IAAK27C,QACXtiD,OAAO,EACP8G,IAAKlO,KAAKkO,IAAI46E,IAGlB,IAAK,QACH,MAAO,CACL/6E,KAAM,IAAK27C,QACXtiD,OAAO,EACP8G,IAAKlO,KAAKkO,IAAI46E,IAGlB,IAAK,OACH,MAAO,CACL/6E,KAAM,IAAKo7C,KACXj7C,IAAKlO,KAAKkO,IAAI46E,IAGlB,QACE,MAAO,CACL/6E,KAAM,IAAK07C,KACXriD,MAAO0hF,EAAM1hF,MACb8G,IAAKlO,KAAKkO,IAAI46E,IAItB,KAAK,IAAUiQ,OACb,IAAKkE,EACH,OAAOj9F,KAAK08F,gBAMlB,MAAM18F,KAAKk8F,YACb,EAEApuC,EAAO8vC,mBAAqB,WAC1B,IAAI9U,EAAQ9oF,KAAKw7F,OAAO1S,MAIxB,OAFA9oF,KAAKw7F,OAAO1N,UAEL,CACL//E,KAAM,IAAKy7C,OACXpiD,MAAO0hF,EAAM1hF,MACby2F,MAAO/U,EAAM/6E,OAAS,IAAUsgF,aAChCngF,IAAKlO,KAAKkO,IAAI46E,GAElB,EAQAh7B,EAAO4vC,UAAY,SAAmBT,GACpC,IAAIvsF,EAAQ1Q,KAERc,EAAQd,KAAKw7F,OAAO1S,MAMxB,MAAO,CACL/6E,KAAM,IAAK47C,KACXvpC,OAAQpgB,KAAK89F,IAAI,IAAUxE,WANlB,WACT,OAAO5oF,EAAM2qF,kBAAkB4B,EACjC,GAI8C,IAAU1D,WACtDrrF,IAAKlO,KAAKkO,IAAIpN,GAElB,EAQAgtD,EAAO6vC,YAAc,SAAqBV,GACxC,IAAI1mB,EAASv2E,KAETc,EAAQd,KAAKw7F,OAAO1S,MAMxB,MAAO,CACL/6E,KAAM,IAAK67C,OACX7xC,OAAQ/X,KAAK89F,IAAI,IAAUtE,SANlB,WACT,OAAOjjB,EAAOwnB,iBAAiBd,EACjC,GAI4C,IAAUvD,SACpDxrF,IAAKlO,KAAKkO,IAAIpN,GAElB,EAMAgtD,EAAOiwC,iBAAmB,SAA0Bd,GAClD,IAAIn8F,EAAQd,KAAKw7F,OAAO1S,MACpBh/E,EAAO9J,KAAK07F,YAEhB,OADA17F,KAAKo7F,YAAY,IAAUjC,OACpB,CACLprF,KAAM,IAAKgmD,aACXjqD,KAAMA,EACN1C,MAAOpH,KAAKq7F,kBAAkB4B,GAC9B/uF,IAAKlO,KAAKkO,IAAIpN,GAElB,EAOAgtD,EAAOwuC,gBAAkB,SAAyBW,GAGhD,IAFA,IAAIn7E,EAAa,GAEV9hB,KAAKqe,KAAK,IAAUg7E,KACzBv3E,EAAW5hB,KAAKF,KAAKg+F,eAAef,IAGtC,OAAOn7E,CACT,EAMAgsC,EAAOkwC,eAAiB,SAAwBf,GAC9C,IAAIn8F,EAAQd,KAAKw7F,OAAO1S,MAExB,OADA9oF,KAAKo7F,YAAY,IAAU/B,IACpB,CACLtrF,KAAM,IAAKg0D,UACXj4D,KAAM9J,KAAK07F,YACX9uF,UAAW5M,KAAKg9F,eAAeC,GAC/B/uF,IAAKlO,KAAKkO,IAAIpN,GAElB,EAUAgtD,EAAOytC,mBAAqB,WAC1B,IACIj1F,EADAxF,EAAQd,KAAKw7F,OAAO1S,MAexB,OAZI9oF,KAAK28F,oBAAoB,IAAUrD,YACrChzF,EAAOtG,KAAKu7F,qBACZv7F,KAAKo7F,YAAY,IAAU7B,WAC3BjzF,EAAO,CACLyH,KAAM,IAAKuyD,UACXh6D,KAAMA,EACN4H,IAAKlO,KAAKkO,IAAIpN,KAGhBwF,EAAOtG,KAAKu9F,iBAGVv9F,KAAK28F,oBAAoB,IAAU7D,MAC9B,CACL/qF,KAAM,IAAKwyD,cACXj6D,KAAMA,EACN4H,IAAKlO,KAAKkO,IAAIpN,IAIXwF,CACT,EAMAwnD,EAAOyvC,eAAiB,WACtB,IAAIz8F,EAAQd,KAAKw7F,OAAO1S,MACxB,MAAO,CACL/6E,KAAM,IAAKyyD,WACX12D,KAAM9J,KAAK07F,YACXxtF,IAAKlO,KAAKkO,IAAIpN,GAElB,EAkBAgtD,EAAOiuC,0BAA4B,WAEjC,IAAIkC,EAAej+F,KAAKi8F,kBAAoBj8F,KAAKw7F,OAAO9C,YAAc14F,KAAKw7F,OAAO1S,MAElF,GAAImV,EAAalwF,OAAS,IAAUutC,KAClC,OAAQ2iD,EAAa72F,OACnB,IAAK,SACH,OAAOpH,KAAKk+F,wBAEd,IAAK,SACH,OAAOl+F,KAAKm+F,4BAEd,IAAK,OACH,OAAOn+F,KAAKo+F,4BAEd,IAAK,YACH,OAAOp+F,KAAKq+F,+BAEd,IAAK,QACH,OAAOr+F,KAAKs+F,2BAEd,IAAK,OACH,OAAOt+F,KAAKu+F,0BAEd,IAAK,QACH,OAAOv+F,KAAKw+F,iCAEd,IAAK,YACH,OAAOx+F,KAAKy+F,2BAIlB,MAAMz+F,KAAKk8F,WAAW+B,EACxB,EAEAnwC,EAAOmuC,gBAAkB,WACvB,OAAOj8F,KAAKqe,KAAK,IAAUmrC,SAAWxpD,KAAKqe,KAAK,IAAUgwE,aAC5D,EAMAvgC,EAAO4wC,iBAAmB,WACxB,GAAI1+F,KAAKi8F,kBACP,OAAOj8F,KAAK49F,oBAEhB,EAMA9vC,EAAOowC,sBAAwB,WAC7B,IAAIp9F,EAAQd,KAAKw7F,OAAO1S,MACpB9kC,EAAchkD,KAAK0+F,mBACvB1+F,KAAKy9F,cAAc,UACnB,IAAI37E,EAAa9hB,KAAKs8F,iBAAgB,GAClC5+B,EAAiB19D,KAAK27F,KAAK,IAAUnC,QAASx5F,KAAK2+F,6BAA8B,IAAUjF,SAC/F,MAAO,CACL3rF,KAAM,IAAKq1D,kBACXpf,YAAaA,EACbliC,WAAYA,EACZ47C,eAAgBA,EAChBxvD,IAAKlO,KAAKkO,IAAIpN,GAElB,EAMAgtD,EAAO6wC,6BAA+B,WACpC,IAAI79F,EAAQd,KAAKw7F,OAAO1S,MACpBh+E,EAAY9K,KAAKo8F,qBACrBp8F,KAAKo7F,YAAY,IAAUjC,OAC3B,IAAI7yF,EAAOtG,KAAKu9F,iBAChB,MAAO,CACLxvF,KAAM,IAAKqqF,0BACXttF,UAAWA,EACXxE,KAAMA,EACN4H,IAAKlO,KAAKkO,IAAIpN,GAElB,EAMAgtD,EAAOqwC,0BAA4B,WACjC,IAAIr9F,EAAQd,KAAKw7F,OAAO1S,MACpB9kC,EAAchkD,KAAK0+F,mBACvB1+F,KAAKy9F,cAAc,UACnB,IAAI3zF,EAAO9J,KAAK07F,YACZ55E,EAAa9hB,KAAKs8F,iBAAgB,GACtC,MAAO,CACLvuF,KAAM,IAAKw6D,uBACXvkB,YAAaA,EACbl6C,KAAMA,EACNgY,WAAYA,EACZ5T,IAAKlO,KAAKkO,IAAIpN,GAElB,EAQAgtD,EAAOswC,0BAA4B,WACjC,IAAIt9F,EAAQd,KAAKw7F,OAAO1S,MACpB9kC,EAAchkD,KAAK0+F,mBACvB1+F,KAAKy9F,cAAc,QACnB,IAAI3zF,EAAO9J,KAAK07F,YACZjtC,EAAazuD,KAAK4+F,4BAClB98E,EAAa9hB,KAAKs8F,iBAAgB,GAClCvkF,EAAS/X,KAAK6+F,wBAClB,MAAO,CACL9wF,KAAM,IAAK06D,uBACXzkB,YAAaA,EACbl6C,KAAMA,EACN2kD,WAAYA,EACZ3sC,WAAYA,EACZ/J,OAAQA,EACR7J,IAAKlO,KAAKkO,IAAIpN,GAElB,EAQAgtD,EAAO8wC,0BAA4B,WACjC,IAAIE,EAEJ,IAAK9+F,KAAKq9F,sBAAsB,cAC9B,MAAO,GAGT,IAAiJ,KAAtG,QAArCyB,EAAkB9+F,KAAKy7F,gBAA0C,IAApBqD,OAA6B,EAASA,EAAgBvV,oCAA8C,CACrJ,IAAIx5B,EAAQ,GAEZ/vD,KAAK28F,oBAAoB,IAAU3D,KAEnC,GACEjpC,EAAM7vD,KAAKF,KAAKu9F,wBACTv9F,KAAK28F,oBAAoB,IAAU3D,MAAQh5F,KAAKqe,KAAK,IAAUi9B,OAExE,OAAOyU,CACT,CAEA,OAAO/vD,KAAK++F,cAAc,IAAU/F,IAAKh5F,KAAKu9F,eAChD,EAMAzvC,EAAO+wC,sBAAwB,WAC7B,IAAIG,EAGJ,OAAwI,KAA7F,QAArCA,EAAkBh/F,KAAKy7F,gBAA0C,IAApBuD,OAA6B,EAASA,EAAgB1V,4BAAuCtpF,KAAKqe,KAAK,IAAUm7E,UAAYx5F,KAAKw7F,OAAO9C,YAAY3qF,OAAS,IAAU2rF,SACzN15F,KAAKw7F,OAAO1N,UAEZ9tF,KAAKw7F,OAAO1N,UAEL,IAGF9tF,KAAKw8F,aAAa,IAAUhD,QAASx5F,KAAKi/F,qBAAsB,IAAUvF,QACnF,EAOA5rC,EAAOmxC,qBAAuB,WAC5B,IAAIn+F,EAAQd,KAAKw7F,OAAO1S,MACpB9kC,EAAchkD,KAAK0+F,mBACnB50F,EAAO9J,KAAK07F,YACZxyF,EAAOlJ,KAAKk/F,oBAChBl/F,KAAKo7F,YAAY,IAAUjC,OAC3B,IAAI7yF,EAAOtG,KAAKu7F,qBACZz5E,EAAa9hB,KAAKs8F,iBAAgB,GACtC,MAAO,CACLvuF,KAAM,IAAKsnD,iBACXrR,YAAaA,EACbl6C,KAAMA,EACN8C,UAAW1D,EACX5C,KAAMA,EACNwb,WAAYA,EACZ5T,IAAKlO,KAAKkO,IAAIpN,GAElB,EAMAgtD,EAAOoxC,kBAAoB,WACzB,OAAOl/F,KAAKw8F,aAAa,IAAUvD,QAASj5F,KAAKm/F,mBAAoB,IAAUjG,QACjF,EAOAprC,EAAOqxC,mBAAqB,WAC1B,IAAIr+F,EAAQd,KAAKw7F,OAAO1S,MACpB9kC,EAAchkD,KAAK0+F,mBACnB50F,EAAO9J,KAAK07F,YAChB17F,KAAKo7F,YAAY,IAAUjC,OAC3B,IACIrgD,EADAxyC,EAAOtG,KAAKu7F,qBAGZv7F,KAAK28F,oBAAoB,IAAUvD,UACrCtgD,EAAe94C,KAAKq7F,mBAAkB,IAGxC,IAAIv5E,EAAa9hB,KAAKs8F,iBAAgB,GACtC,MAAO,CACLvuF,KAAM,IAAKq7D,uBACXplB,YAAaA,EACbl6C,KAAMA,EACNxD,KAAMA,EACNwyC,aAAcA,EACdh3B,WAAYA,EACZ5T,IAAKlO,KAAKkO,IAAIpN,GAElB,EAOAgtD,EAAOuwC,6BAA+B,WACpC,IAAIv9F,EAAQd,KAAKw7F,OAAO1S,MACpB9kC,EAAchkD,KAAK0+F,mBACvB1+F,KAAKy9F,cAAc,aACnB,IAAI3zF,EAAO9J,KAAK07F,YACZjtC,EAAazuD,KAAK4+F,4BAClB98E,EAAa9hB,KAAKs8F,iBAAgB,GAClCvkF,EAAS/X,KAAK6+F,wBAClB,MAAO,CACL9wF,KAAM,IAAK46D,0BACX3kB,YAAaA,EACbl6C,KAAMA,EACN2kD,WAAYA,EACZ3sC,WAAYA,EACZ/J,OAAQA,EACR7J,IAAKlO,KAAKkO,IAAIpN,GAElB,EAOAgtD,EAAOwwC,yBAA2B,WAChC,IAAIx9F,EAAQd,KAAKw7F,OAAO1S,MACpB9kC,EAAchkD,KAAK0+F,mBACvB1+F,KAAKy9F,cAAc,SACnB,IAAI3zF,EAAO9J,KAAK07F,YACZ55E,EAAa9hB,KAAKs8F,iBAAgB,GAClCvsC,EAAQ/vD,KAAKo/F,wBACjB,MAAO,CACLrxF,KAAM,IAAK86D,sBACX7kB,YAAaA,EACbl6C,KAAMA,EACNgY,WAAYA,EACZiuC,MAAOA,EACP7hD,IAAKlO,KAAKkO,IAAIpN,GAElB,EAQAgtD,EAAOsxC,sBAAwB,WAC7B,OAAOp/F,KAAK28F,oBAAoB,IAAUvD,QAAUp5F,KAAK++F,cAAc,IAAUtF,KAAMz5F,KAAKu9F,gBAAkB,EAChH,EAOAzvC,EAAOywC,wBAA0B,WAC/B,IAAIz9F,EAAQd,KAAKw7F,OAAO1S,MACpB9kC,EAAchkD,KAAK0+F,mBACvB1+F,KAAKy9F,cAAc,QACnB,IAAI3zF,EAAO9J,KAAK07F,YACZ55E,EAAa9hB,KAAKs8F,iBAAgB,GAClCl8E,EAASpgB,KAAKq/F,4BAClB,MAAO,CACLtxF,KAAM,IAAKg7D,qBACX/kB,YAAaA,EACbl6C,KAAMA,EACNgY,WAAYA,EACZ1B,OAAQA,EACRlS,IAAKlO,KAAKkO,IAAIpN,GAElB,EAMAgtD,EAAOuxC,0BAA4B,WACjC,OAAOr/F,KAAKw8F,aAAa,IAAUhD,QAASx5F,KAAKs/F,yBAA0B,IAAU5F,QACvF,EAQA5rC,EAAOwxC,yBAA2B,WAChC,IAAIx+F,EAAQd,KAAKw7F,OAAO1S,MACpB9kC,EAAchkD,KAAK0+F,mBACnB50F,EAAO9J,KAAK07F,YACZ55E,EAAa9hB,KAAKs8F,iBAAgB,GACtC,MAAO,CACLvuF,KAAM,IAAKk7D,sBACXjlB,YAAaA,EACbl6C,KAAMA,EACNgY,WAAYA,EACZ5T,IAAKlO,KAAKkO,IAAIpN,GAElB,EAOAgtD,EAAO0wC,+BAAiC,WACtC,IAAI19F,EAAQd,KAAKw7F,OAAO1S,MACpB9kC,EAAchkD,KAAK0+F,mBACvB1+F,KAAKy9F,cAAc,SACnB,IAAI3zF,EAAO9J,KAAK07F,YACZ55E,EAAa9hB,KAAKs8F,iBAAgB,GAClCvkF,EAAS/X,KAAKu/F,6BAClB,MAAO,CACLxxF,KAAM,IAAKm7D,6BACXllB,YAAaA,EACbl6C,KAAMA,EACNgY,WAAYA,EACZ/J,OAAQA,EACR7J,IAAKlO,KAAKkO,IAAIpN,GAElB,EAMAgtD,EAAOyxC,2BAA6B,WAClC,OAAOv/F,KAAKw8F,aAAa,IAAUhD,QAASx5F,KAAKm/F,mBAAoB,IAAUzF,QACjF,EAgBA5rC,EAAOkuC,yBAA2B,WAChC,IAAIiC,EAAej+F,KAAKw7F,OAAO9C,YAE/B,GAAIuF,EAAalwF,OAAS,IAAUutC,KAClC,OAAQ2iD,EAAa72F,OACnB,IAAK,SACH,OAAOpH,KAAKw/F,uBAEd,IAAK,SACH,OAAOx/F,KAAKy/F,2BAEd,IAAK,OACH,OAAOz/F,KAAK0/F,2BAEd,IAAK,YACH,OAAO1/F,KAAK2/F,8BAEd,IAAK,QACH,OAAO3/F,KAAK4/F,0BAEd,IAAK,OACH,OAAO5/F,KAAK6/F,yBAEd,IAAK,QACH,OAAO7/F,KAAK8/F,gCAIlB,MAAM9/F,KAAKk8F,WAAW+B,EACxB,EAQAnwC,EAAO0xC,qBAAuB,WAC5B,IAAI1+F,EAAQd,KAAKw7F,OAAO1S,MACxB9oF,KAAKy9F,cAAc,UACnBz9F,KAAKy9F,cAAc,UACnB,IAAI37E,EAAa9hB,KAAKs8F,iBAAgB,GAClC5+B,EAAiB19D,KAAKw8F,aAAa,IAAUhD,QAASx5F,KAAK2+F,6BAA8B,IAAUjF,SAEvG,GAA0B,IAAtB53E,EAAWhe,QAA0C,IAA1B45D,EAAe55D,OAC5C,MAAM9D,KAAKk8F,aAGb,MAAO,CACLnuF,KAAM,IAAKs1D,iBACXvhD,WAAYA,EACZ47C,eAAgBA,EAChBxvD,IAAKlO,KAAKkO,IAAIpN,GAElB,EAOAgtD,EAAO2xC,yBAA2B,WAChC,IAAI3+F,EAAQd,KAAKw7F,OAAO1S,MACxB9oF,KAAKy9F,cAAc,UACnBz9F,KAAKy9F,cAAc,UACnB,IAAI3zF,EAAO9J,KAAK07F,YACZ55E,EAAa9hB,KAAKs8F,iBAAgB,GAEtC,GAA0B,IAAtBx6E,EAAWhe,OACb,MAAM9D,KAAKk8F,aAGb,MAAO,CACLnuF,KAAM,IAAKy6D,sBACX1+D,KAAMA,EACNgY,WAAYA,EACZ5T,IAAKlO,KAAKkO,IAAIpN,GAElB,EASAgtD,EAAO4xC,yBAA2B,WAChC,IAAI5+F,EAAQd,KAAKw7F,OAAO1S,MACxB9oF,KAAKy9F,cAAc,UACnBz9F,KAAKy9F,cAAc,QACnB,IAAI3zF,EAAO9J,KAAK07F,YACZjtC,EAAazuD,KAAK4+F,4BAClB98E,EAAa9hB,KAAKs8F,iBAAgB,GAClCvkF,EAAS/X,KAAK6+F,wBAElB,GAA0B,IAAtBpwC,EAAW3qD,QAAsC,IAAtBge,EAAWhe,QAAkC,IAAlBiU,EAAOjU,OAC/D,MAAM9D,KAAKk8F,aAGb,MAAO,CACLnuF,KAAM,IAAK26D,sBACX5+D,KAAMA,EACN2kD,WAAYA,EACZ3sC,WAAYA,EACZ/J,OAAQA,EACR7J,IAAKlO,KAAKkO,IAAIpN,GAElB,EASAgtD,EAAO6xC,4BAA8B,WACnC,IAAI7+F,EAAQd,KAAKw7F,OAAO1S,MACxB9oF,KAAKy9F,cAAc,UACnBz9F,KAAKy9F,cAAc,aACnB,IAAI3zF,EAAO9J,KAAK07F,YACZjtC,EAAazuD,KAAK4+F,4BAClB98E,EAAa9hB,KAAKs8F,iBAAgB,GAClCvkF,EAAS/X,KAAK6+F,wBAElB,GAA0B,IAAtBpwC,EAAW3qD,QAAsC,IAAtBge,EAAWhe,QAAkC,IAAlBiU,EAAOjU,OAC/D,MAAM9D,KAAKk8F,aAGb,MAAO,CACLnuF,KAAM,IAAK66D,yBACX9+D,KAAMA,EACN2kD,WAAYA,EACZ3sC,WAAYA,EACZ/J,OAAQA,EACR7J,IAAKlO,KAAKkO,IAAIpN,GAElB,EAQAgtD,EAAO8xC,wBAA0B,WAC/B,IAAI9+F,EAAQd,KAAKw7F,OAAO1S,MACxB9oF,KAAKy9F,cAAc,UACnBz9F,KAAKy9F,cAAc,SACnB,IAAI3zF,EAAO9J,KAAK07F,YACZ55E,EAAa9hB,KAAKs8F,iBAAgB,GAClCvsC,EAAQ/vD,KAAKo/F,wBAEjB,GAA0B,IAAtBt9E,EAAWhe,QAAiC,IAAjBisD,EAAMjsD,OACnC,MAAM9D,KAAKk8F,aAGb,MAAO,CACLnuF,KAAM,IAAK+6D,qBACXh/D,KAAMA,EACNgY,WAAYA,EACZiuC,MAAOA,EACP7hD,IAAKlO,KAAKkO,IAAIpN,GAElB,EAQAgtD,EAAO+xC,uBAAyB,WAC9B,IAAI/+F,EAAQd,KAAKw7F,OAAO1S,MACxB9oF,KAAKy9F,cAAc,UACnBz9F,KAAKy9F,cAAc,QACnB,IAAI3zF,EAAO9J,KAAK07F,YACZ55E,EAAa9hB,KAAKs8F,iBAAgB,GAClCl8E,EAASpgB,KAAKq/F,4BAElB,GAA0B,IAAtBv9E,EAAWhe,QAAkC,IAAlBsc,EAAOtc,OACpC,MAAM9D,KAAKk8F,aAGb,MAAO,CACLnuF,KAAM,IAAKi7D,oBACXl/D,KAAMA,EACNgY,WAAYA,EACZ1B,OAAQA,EACRlS,IAAKlO,KAAKkO,IAAIpN,GAElB,EAQAgtD,EAAOgyC,8BAAgC,WACrC,IAAIh/F,EAAQd,KAAKw7F,OAAO1S,MACxB9oF,KAAKy9F,cAAc,UACnBz9F,KAAKy9F,cAAc,SACnB,IAAI3zF,EAAO9J,KAAK07F,YACZ55E,EAAa9hB,KAAKs8F,iBAAgB,GAClCvkF,EAAS/X,KAAKu/F,6BAElB,GAA0B,IAAtBz9E,EAAWhe,QAAkC,IAAlBiU,EAAOjU,OACpC,MAAM9D,KAAKk8F,aAGb,MAAO,CACLnuF,KAAM,IAAKo7D,4BACXr/D,KAAMA,EACNgY,WAAYA,EACZ/J,OAAQA,EACR7J,IAAKlO,KAAKkO,IAAIpN,GAElB,EAOAgtD,EAAO2wC,yBAA2B,WAChC,IAAI39F,EAAQd,KAAKw7F,OAAO1S,MACpB9kC,EAAchkD,KAAK0+F,mBACvB1+F,KAAKy9F,cAAc,aACnBz9F,KAAKo7F,YAAY,IAAU/B,IAC3B,IAAIvvF,EAAO9J,KAAK07F,YACZxyF,EAAOlJ,KAAKk/F,oBACZ11B,EAAaxpE,KAAKq9F,sBAAsB,cAC5Cr9F,KAAKy9F,cAAc,MACnB,IAAI16C,EAAY/iD,KAAK+/F,0BACrB,MAAO,CACLhyF,KAAM,IAAKo6D,qBACXnkB,YAAaA,EACbl6C,KAAMA,EACN8C,UAAW1D,EACXsgE,WAAYA,EACZzmB,UAAWA,EACX70C,IAAKlO,KAAKkO,IAAIpN,GAElB,EAQAgtD,EAAOiyC,wBAA0B,WAC/B,OAAO//F,KAAK++F,cAAc,IAAUtF,KAAMz5F,KAAKggG,uBACjD,EA8BAlyC,EAAOkyC,uBAAyB,WAC9B,IAAIl/F,EAAQd,KAAKw7F,OAAO1S,MACpBh/E,EAAO9J,KAAK07F,YAEhB,QAAsCvyF,IAAlC,IAAkBW,EAAK1C,OACzB,OAAO0C,EAGT,MAAM9J,KAAKk8F,WAAWp7F,EACxB,EAOAgtD,EAAO5/C,IAAM,SAAamB,GACxB,IAAI4wF,EAEJ,IAAyH,KAA9E,QAArCA,EAAkBjgG,KAAKy7F,gBAA0C,IAApBwE,OAA6B,EAASA,EAAgB5W,YACvG,OAAO,IAAI,KAASh6E,EAAYrP,KAAKw7F,OAAOhD,UAAWx4F,KAAKw7F,OAAOrtF,OAEvE,EAMA2/C,EAAOzvC,KAAO,SAActQ,GAC1B,OAAO/N,KAAKw7F,OAAO1S,MAAM/6E,OAASA,CACpC,EAOA+/C,EAAOstC,YAAc,SAAqBrtF,GACxC,IAAI+6E,EAAQ9oF,KAAKw7F,OAAO1S,MAExB,GAAIA,EAAM/6E,OAASA,EAGjB,OAFA/N,KAAKw7F,OAAO1N,UAELhF,EAGT,MAAM,OAAY9oF,KAAKw7F,OAAOrtF,OAAQ26E,EAAMhoF,MAAO,YAAY8S,OAAOssF,EAAiBnyF,GAAO,YAAY6F,OAAOusF,EAAarX,GAAQ,KACxI,EAOAh7B,EAAO6uC,oBAAsB,SAA6B5uF,GACxD,IAAI+6E,EAAQ9oF,KAAKw7F,OAAO1S,MAExB,GAAIA,EAAM/6E,OAASA,EAGjB,OAFA/N,KAAKw7F,OAAO1N,UAELhF,CAIX,EAOAh7B,EAAO2vC,cAAgB,SAAuBr2F,GAC5C,IAAI0hF,EAAQ9oF,KAAKw7F,OAAO1S,MAExB,GAAIA,EAAM/6E,OAAS,IAAUutC,MAAQwtC,EAAM1hF,QAAUA,EAGnD,MAAM,OAAYpH,KAAKw7F,OAAOrtF,OAAQ26E,EAAMhoF,MAAO,aAAc8S,OAAOxM,EAAO,aAAcwM,OAAOusF,EAAarX,GAAQ,MAFzH9oF,KAAKw7F,OAAO1N,SAIhB,EAOAhgC,EAAOuvC,sBAAwB,SAA+Bj2F,GAC5D,IAAI0hF,EAAQ9oF,KAAKw7F,OAAO1S,MAExB,OAAIA,EAAM/6E,OAAS,IAAUutC,MAAQwtC,EAAM1hF,QAAUA,IACnDpH,KAAKw7F,OAAO1N,WAEL,EAIX,EAMAhgC,EAAOouC,WAAa,SAAoBkE,GACtC,IAAItX,EAAoB,OAAZsX,QAAgC,IAAZA,EAAqBA,EAAUpgG,KAAKw7F,OAAO1S,MAC3E,OAAO,OAAY9oF,KAAKw7F,OAAOrtF,OAAQ26E,EAAMhoF,MAAO,cAAc8S,OAAOusF,EAAarX,GAAQ,KAChG,EAQAh7B,EAAOgwC,IAAM,SAAauC,EAAUC,EAASC,GAC3CvgG,KAAKo7F,YAAYiF,GAGjB,IAFA,IAAIl+C,EAAQ,IAEJniD,KAAK28F,oBAAoB4D,IAC/Bp+C,EAAMjiD,KAAKogG,EAAQ96F,KAAKxF,OAG1B,OAAOmiD,CACT,EASA2L,EAAO0uC,aAAe,SAAsB6D,EAAUC,EAASC,GAC7D,GAAIvgG,KAAK28F,oBAAoB0D,GAAW,CACtC,IAAIl+C,EAAQ,GAEZ,GACEA,EAAMjiD,KAAKogG,EAAQ96F,KAAKxF,cAChBA,KAAK28F,oBAAoB4D,IAEnC,OAAOp+C,CACT,CAEA,MAAO,EACT,EAQA2L,EAAO6tC,KAAO,SAAc0E,EAAUC,EAASC,GAC7CvgG,KAAKo7F,YAAYiF,GACjB,IAAIl+C,EAAQ,GAEZ,GACEA,EAAMjiD,KAAKogG,EAAQ96F,KAAKxF,cAChBA,KAAK28F,oBAAoB4D,IAEnC,OAAOp+C,CACT,EAQA2L,EAAOixC,cAAgB,SAAuByB,EAAeF,GAC3DtgG,KAAK28F,oBAAoB6D,GACzB,IAAIr+C,EAAQ,GAEZ,GACEA,EAAMjiD,KAAKogG,EAAQ96F,KAAKxF,aACjBA,KAAK28F,oBAAoB6D,IAElC,OAAOr+C,CACT,EAEO+4C,CACT,CAv7CiC,GA47CjC,SAASiF,EAAarX,GACpB,IAAI1hF,EAAQ0hF,EAAM1hF,MAClB,OAAO84F,EAAiBpX,EAAM/6E,OAAkB,MAAT3G,EAAgB,KAAMwM,OAAOxM,EAAO,KAAQ,GACrF,CAMA,SAAS84F,EAAiBnyF,GACxB,OAAO,OAAsBA,GAAQ,IAAK6F,OAAO7F,EAAM,KAAQA,CACjE,C,wQCzgDO,SAAS0yF,EAAiBtxF,GAC/B,OAAOuxF,EAA2BvxF,IAASwxF,EAA2BxxF,IAASyxF,EAA0BzxF,EAC3G,CACO,SAASuxF,EAA2BvxF,GACzC,OAAOA,EAAKpB,OAAS,IAAKsuC,sBAAwBltC,EAAKpB,OAAS,IAAKuuC,mBACvE,CACO,SAASukD,EAAgB1xF,GAC9B,OAAOA,EAAKpB,OAAS,IAAKstC,OAASlsC,EAAKpB,OAAS,IAAK+R,iBAAmB3Q,EAAKpB,OAAS,IAAKknD,eAC9F,CACO,SAAS6rC,EAAY3xF,GAC1B,OAAOA,EAAKpB,OAAS,IAAK87C,UAAY16C,EAAKpB,OAAS,IAAKq7C,KAAOj6C,EAAKpB,OAAS,IAAKu7C,OAASn6C,EAAKpB,OAAS,IAAKy7C,QAAUr6C,EAAKpB,OAAS,IAAK27C,SAAWv6C,EAAKpB,OAAS,IAAKo7C,MAAQh6C,EAAKpB,OAAS,IAAK07C,MAAQt6C,EAAKpB,OAAS,IAAK47C,MAAQx6C,EAAKpB,OAAS,IAAK67C,MAC7P,CACO,SAASm3C,EAAW5xF,GACzB,OAAOA,EAAKpB,OAAS,IAAKyyD,YAAcrxD,EAAKpB,OAAS,IAAKuyD,WAAanxD,EAAKpB,OAAS,IAAKwyD,aAC7F,CACO,SAASogC,EAA2BxxF,GACzC,OAAOA,EAAKpB,OAAS,IAAKq1D,mBAAqB49B,EAAqB7xF,IAASA,EAAKpB,OAAS,IAAKo6D,oBAClG,CACO,SAAS64B,EAAqB7xF,GACnC,OAAOA,EAAKpB,OAAS,IAAKw6D,wBAA0Bp5D,EAAKpB,OAAS,IAAK06D,wBAA0Bt5D,EAAKpB,OAAS,IAAK46D,2BAA6Bx5D,EAAKpB,OAAS,IAAK86D,uBAAyB15D,EAAKpB,OAAS,IAAKg7D,sBAAwB55D,EAAKpB,OAAS,IAAKm7D,4BAC7P,CACO,SAAS03B,EAA0BzxF,GACxC,OAAOA,EAAKpB,OAAS,IAAKs1D,kBAAoB49B,EAAoB9xF,EACpE,CACO,SAAS8xF,EAAoB9xF,GAClC,OAAOA,EAAKpB,OAAS,IAAKy6D,uBAAyBr5D,EAAKpB,OAAS,IAAK26D,uBAAyBv5D,EAAKpB,OAAS,IAAK66D,0BAA4Bz5D,EAAKpB,OAAS,IAAK+6D,sBAAwB35D,EAAKpB,OAAS,IAAKi7D,qBAAuB75D,EAAKpB,OAAS,IAAKo7D,2BACxP,C,6FCtBO,SAAS+3B,EAAcr9C,GAC5B,OAAOs9C,EAAoBt9C,EAAS11C,QAAQ,IAAA80C,GAAYY,EAAS11C,OAAQ01C,EAAS/iD,OACpF,CAKO,SAASqgG,EAAoBhzF,EAAQizF,GAC1C,IAAIC,EAAwBlzF,EAAOmzF,eAAezK,OAAS,EACvDzoF,EAAOmzF,EAAWF,GAAyBlzF,EAAOC,KAClDozF,EAAYJ,EAAehvD,KAAO,EAClCqvD,EAAatzF,EAAOmzF,eAAelvD,KAAO,EAC1CsvD,EAAUN,EAAehvD,KAAOqvD,EAChCE,EAAuC,IAAxBP,EAAehvD,KAAaivD,EAAwB,EACnEO,EAAYR,EAAevK,OAAS8K,EACpCE,EAAc,GAAGjuF,OAAOzF,EAAOrE,KAAM,KAAK8J,OAAO8tF,EAAS,KAAK9tF,OAAOguF,EAAW,MACjF1K,EAAQ9oF,EAAKo/B,MAAM,gBACnBs0D,EAAe5K,EAAMsK,GAEzB,GAAIM,EAAah+F,OAAS,IAAK,CAK7B,IAJA,IAAIi+F,EAAe3/F,KAAKmlD,MAAMq6C,EAAY,IACtCI,EAAmBJ,EAAY,GAC/BK,EAAW,GAENv1F,EAAI,EAAGA,EAAIo1F,EAAah+F,OAAQ4I,GAAK,GAC5Cu1F,EAAS/hG,KAAK4hG,EAAaj+F,MAAM6I,EAAGA,EAAI,KAG1C,OAAOm1F,EAAcK,EAAmB,CAAC,CAAC,GAAGtuF,OAAO8tF,GAAUO,EAAS,KAAKruF,OAAOquF,EAASp+F,MAAM,EAAGk+F,EAAe,GAAGx5F,KAAI,SAAU45F,GACnI,MAAO,CAAC,GAAIA,EACd,IAAI,CAAC,CAAC,IAAKZ,EAAWS,EAAmB,GAAK,KAAM,CAAC,GAAIC,EAASF,EAAe,MACnF,CAEA,OAAOF,EAAcK,EAAmB,CACxC,CAAC,GAAGtuF,OAAO8tF,EAAU,GAAIxK,EAAMsK,EAAY,IAAK,CAAC,GAAG5tF,OAAO8tF,GAAUI,GAAe,CAAC,GAAIP,EAAWK,EAAY,GAAK,KAAM,CAAC,GAAGhuF,OAAO8tF,EAAU,GAAIxK,EAAMsK,EAAY,KACxK,CAEA,SAASU,EAAmBhL,GAC1B,IAAIkL,EAAgBlL,EAAMjvF,QAAO,SAAU49C,GACjCA,EAAK,GAEb,YAAgB18C,IADL08C,EAAK,EAElB,IACIw8C,EAASjgG,KAAKkO,IAAIvD,MAAM3K,KAAMggG,EAAc75F,KAAI,SAAU68C,GAE5D,OADaA,EAAM,GACLthD,MAChB,KACA,OAAOs+F,EAAc75F,KAAI,SAAUs6C,GACjC,IAUkBkG,EAVduwB,EAASz2B,EAAM,GACfzQ,EAAOyQ,EAAM,GACjB,OASK0+C,EATUc,GAQGt5C,EARKuwB,GASGx1E,QAAUilD,GATF3W,EAAO,MAAQA,EAAO,KAC1D,IAAGhxB,KAAK,KACV,CAEA,SAASmgF,EAAWviD,GAClB,OAAO9rC,MAAM8rC,EAAM,GAAG59B,KAAK,IAC7B,C,kFCtDO,SAAS3V,EAAMgC,GACpB,OAAO,QAAMA,EAAK,CAChB4vC,MAAOilD,GAEX,CACA,IAEIA,EAAqB,CACvBC,KAAM,SAAcpzF,GAClB,OAAOA,EAAK/H,KACd,EACAmtC,SAAU,SAAkBplC,GAC1B,MAAO,IAAMA,EAAKrF,IACpB,EAEAm5D,SAAU,SAAkB9zD,GAC1B,OAAOiS,EAAKjS,EAAKvB,YAAa,QAAU,IAC1C,EACAiwC,oBAAqB,SAA6B1uC,GAChD,IAAI+9B,EAAK/9B,EAAKrE,UACVhB,EAAOqF,EAAKrF,KACZ04F,EAAUC,EAAK,IAAKrhF,EAAKjS,EAAKq3B,oBAAqB,MAAO,KAC1D1kB,EAAaV,EAAKjS,EAAK2S,WAAY,KACnChN,EAAe3F,EAAK2F,aAGxB,OAAQhL,GAASgY,GAAe0gF,GAAkB,UAAPt1D,EAAgC9rB,EAAK,CAAC8rB,EAAI9rB,EAAK,CAACtX,EAAM04F,IAAW1gF,EAAYhN,GAAe,KAA3EA,CAC9D,EACAmoC,mBAAoB,SAA4B4I,GAC9C,IAAInf,EAAWmf,EAAKnf,SAChBpgC,EAAOu/C,EAAKv/C,KACZwyC,EAAe+M,EAAK/M,aACpBh3B,EAAa+jC,EAAK/jC,WACtB,OAAO4kB,EAAW,KAAOpgC,EAAOm8F,EAAK,MAAO3pD,GAAgB2pD,EAAK,IAAKrhF,EAAKU,EAAY,KACzF,EACAk8B,aAAc,SAAsBoH,GAElC,OAAOy4C,EADUz4C,EAAMnwC,WAEzB,EACA8nC,MAAO,SAAe8F,GACpB,IAAI9H,EAAQ8H,EAAM9H,MACdjxC,EAAO+4C,EAAM/4C,KACbZ,EAAO25C,EAAMj2C,UACbkV,EAAa+gC,EAAM/gC,WACnBhN,EAAe+tC,EAAM/tC,aACrBwkE,EAASmpB,EAAK,GAAI1nD,EAAO,MAAQjxC,EACjC44F,EAAWppB,EAASmpB,EAAK,IAAKrhF,EAAKlY,EAAM,MAAO,KAMpD,OAJIw5F,EAAS5+F,OA3CK,KA4ChB4+F,EAAWppB,EAASmpB,EAAK,MAAO9K,EAAOv2E,EAAKlY,EAAM,OAAQ,QAGrDkY,EAAK,CAACshF,EAAUthF,EAAKU,EAAY,KAAMhN,GAAe,IAC/D,EACAi1D,SAAU,SAAkB5T,GAG1B,OAFWA,EAAMrsD,KAEH,KADFqsD,EAAM/uD,KAEpB,EAEAwtB,eAAgB,SAAwByhC,GAGtC,MAAO,MAFIA,EAAMvsD,KAEK24F,EAAK,IAAKrhF,EADfi1C,EAAMv0C,WAC0B,KACnD,EACAk7B,eAAgB,SAAwBsZ,GACtC,IAAIvwC,EAAgBuwC,EAAMvwC,cACtBjE,EAAaw0C,EAAMx0C,WACnBhN,EAAewhD,EAAMxhD,aACzB,OAAOsM,EAAK,CAAC,MAAOqhF,EAAK,MAAO18E,GAAgB3E,EAAKU,EAAY,KAAMhN,GAAe,IACxF,EACAsoC,mBAAoB,SAA4BsZ,GAC9C,IAAI5sD,EAAO4sD,EAAM5sD,KACbic,EAAgB2wC,EAAM3wC,cACtBygB,EAAsBkwB,EAAMlwB,oBAC5B1kB,EAAa40C,EAAM50C,WACnBhN,EAAe4hD,EAAM5hD,aACzB,MAEE,YAAYlB,OAAO9J,GAAM8J,OAAO6uF,EAAK,IAAKrhF,EAAKolB,EAAqB,MAAO,KAAM,KAAO,MAAM5yB,OAAOmS,EAAe,KAAKnS,OAAO6uF,EAAK,GAAIrhF,EAAKU,EAAY,KAAM,MAAQhN,CAE5K,EAEAk2D,SAAU,SAAkBpU,GAE1B,OADYA,EAAMxvD,KAEpB,EACA6jE,WAAY,SAAoBpU,GAE9B,OADYA,EAAMzvD,KAEpB,EACA8jE,YAAa,SAAqBlU,EAAQ7vD,GACxC,IAAIC,EAAQ4vD,EAAO5vD,MAEnB,OADoB4vD,EAAO6mC,OACJ,QAAiBz2F,EAAe,gBAARD,EAAwB,GAAK,MAAQ1C,KAAKC,UAAU0C,EACrG,EACA+jE,aAAc,SAAsBhU,GAElC,OADYA,EAAO/vD,MACJ,OAAS,OAC1B,EACA0jE,UAAW,WACT,MAAO,MACT,EACAC,UAAW,SAAmBoqB,GAE5B,OADYA,EAAO/tF,KAErB,EACAqjE,UAAW,SAAmBk4B,GAE5B,MAAO,IAAMvhF,EADAuhF,EAAOviF,OACM,MAAQ,GACpC,EACAuqD,YAAa,SAAqBi4B,GAEhC,MAAO,IAAMxhF,EADAwhF,EAAO7qF,OACM,MAAQ,GACpC,EACA8yD,YAAa,SAAqBg4B,GAGhC,OAFWA,EAAO/4F,KAEJ,KADF+4F,EAAOz7F,KAErB,EAEAqrB,UAAW,SAAmBqwE,GAG5B,MAAO,IAFIA,EAAOh5F,KAEE24F,EAAK,IAAKrhF,EADnB0hF,EAAOl2F,UACuB,MAAO,IAClD,EAEAq3D,UAAW,SAAmB8+B,GAE5B,OADWA,EAAOj5F,IAEpB,EACAk5F,SAAU,SAAkBC,GAE1B,MAAO,IADIA,EAAO38F,KACE,GACtB,EACA48F,YAAa,SAAqBC,GAEhC,OADWA,EAAO78F,KACJ,GAChB,EAEAwrE,iBAAkBsxB,GAAe,SAAUC,GACzC,IAAIvhF,EAAauhF,EAAOvhF,WACpB47C,EAAiB2lC,EAAO3lC,eAC5B,OAAOt8C,EAAK,CAAC,SAAUA,EAAKU,EAAY,KAAM+7E,EAAMngC,IAAkB,IACxE,IACA4lC,wBAAyB,SAAiCC,GAGxD,OAFgBA,EAAOz4F,UAEJ,KADRy4F,EAAOj9F,IAEpB,EACAosE,qBAAsB0wB,GAAe,SAAUI,GAG7C,OAAOpiF,EAAK,CAAC,SAFFoiF,EAAO15F,KAEWsX,EADZoiF,EAAO1hF,WACsB,MAAO,IACvD,IACA8wD,qBAAsBwwB,GAAe,SAAUK,GAC7C,IAAI35F,EAAO25F,EAAO35F,KACd2kD,EAAag1C,EAAOh1C,WACpB3sC,EAAa2hF,EAAO3hF,WACpB/J,EAAS0rF,EAAO1rF,OACpB,OAAOqJ,EAAK,CAAC,OAAQtX,EAAM24F,EAAK,cAAerhF,EAAKqtC,EAAY,QAASrtC,EAAKU,EAAY,KAAM+7E,EAAM9lF,IAAU,IAClH,IACA2rF,gBAAiBN,GAAe,SAAUO,GACxC,IAAI75F,EAAO65F,EAAO75F,KACdZ,EAAOy6F,EAAO/2F,UACdtG,EAAOq9F,EAAOr9F,KACdwb,EAAa6hF,EAAO7hF,WACxB,OAAOhY,GAAQ85F,EAAkB16F,GAAQu5F,EAAK,MAAO9K,EAAOv2E,EAAKlY,EAAM,OAAQ,OAASu5F,EAAK,IAAKrhF,EAAKlY,EAAM,MAAO,MAAQ,KAAO5C,EAAOm8F,EAAK,IAAKrhF,EAAKU,EAAY,KACvK,IACA+hF,qBAAsBT,GAAe,SAAUU,GAC7C,IAAIh6F,EAAOg6F,EAAOh6F,KACdxD,EAAOw9F,EAAOx9F,KACdwyC,EAAegrD,EAAOhrD,aACtBh3B,EAAagiF,EAAOhiF,WACxB,OAAOV,EAAK,CAACtX,EAAO,KAAOxD,EAAMm8F,EAAK,KAAM3pD,GAAe13B,EAAKU,EAAY,MAAO,IACrF,IACA+wD,wBAAyBuwB,GAAe,SAAUW,GAChD,IAAIj6F,EAAOi6F,EAAOj6F,KACd2kD,EAAas1C,EAAOt1C,WACpB3sC,EAAaiiF,EAAOjiF,WACpB/J,EAASgsF,EAAOhsF,OACpB,OAAOqJ,EAAK,CAAC,YAAatX,EAAM24F,EAAK,cAAerhF,EAAKqtC,EAAY,QAASrtC,EAAKU,EAAY,KAAM+7E,EAAM9lF,IAAU,IACvH,IACA+6D,oBAAqBswB,GAAe,SAAUY,GAC5C,IAAIl6F,EAAOk6F,EAAOl6F,KACdgY,EAAakiF,EAAOliF,WACpBiuC,EAAQi0C,EAAOj0C,MACnB,OAAO3uC,EAAK,CAAC,QAAStX,EAAMsX,EAAKU,EAAY,KAAMiuC,GAA0B,IAAjBA,EAAMjsD,OAAe,KAAOsd,EAAK2uC,EAAO,OAAS,IAAK,IACpH,IACAgjB,mBAAoBqwB,GAAe,SAAUa,GAC3C,IAAIn6F,EAAOm6F,EAAOn6F,KACdgY,EAAamiF,EAAOniF,WACpB1B,EAAS6jF,EAAO7jF,OACpB,OAAOgB,EAAK,CAAC,OAAQtX,EAAMsX,EAAKU,EAAY,KAAM+7E,EAAMz9E,IAAU,IACpE,IACA8jF,oBAAqBd,GAAe,SAAUe,GAG5C,OAAO/iF,EAAK,CAFD+iF,EAAOr6F,KAECsX,EADF+iF,EAAOriF,WACY,MAAO,IAC7C,IACAkxD,0BAA2BowB,GAAe,SAAUgB,GAClD,IAAIt6F,EAAOs6F,EAAOt6F,KACdgY,EAAasiF,EAAOtiF,WACpB/J,EAASqsF,EAAOrsF,OACpB,OAAOqJ,EAAK,CAAC,QAAStX,EAAMsX,EAAKU,EAAY,KAAM+7E,EAAM9lF,IAAU,IACrE,IACAu8D,oBAAqB8uB,GAAe,SAAUiB,GAC5C,IAAIv6F,EAAOu6F,EAAOv6F,KACdZ,EAAOm7F,EAAOz3F,UACd48D,EAAa66B,EAAO76B,WACpBzmB,EAAYshD,EAAOthD,UACvB,MAAO,cAAgBj5C,GAAQ85F,EAAkB16F,GAAQu5F,EAAK,MAAO9K,EAAOv2E,EAAKlY,EAAM,OAAQ,OAASu5F,EAAK,IAAKrhF,EAAKlY,EAAM,MAAO,OAASsgE,EAAa,cAAgB,IAAM,OAASpoD,EAAK2hC,EAAW,MAC3M,IACAovB,gBAAiB,SAAyBmyB,GACxC,IAAIxiF,EAAawiF,EAAOxiF,WACpB47C,EAAiB4mC,EAAO5mC,eAC5B,OAAOt8C,EAAK,CAAC,gBAAiBA,EAAKU,EAAY,KAAM+7E,EAAMngC,IAAkB,IAC/E,EACA8W,oBAAqB,SAA6B+vB,GAGhD,OAAOnjF,EAAK,CAAC,gBAFFmjF,EAAOz6F,KAEkBsX,EADnBmjF,EAAOziF,WAC6B,MAAO,IAC9D,EACAkyD,oBAAqB,SAA6BwwB,GAChD,IAAI16F,EAAO06F,EAAO16F,KACd2kD,EAAa+1C,EAAO/1C,WACpB3sC,EAAa0iF,EAAO1iF,WACpB/J,EAASysF,EAAOzsF,OACpB,OAAOqJ,EAAK,CAAC,cAAetX,EAAM24F,EAAK,cAAerhF,EAAKqtC,EAAY,QAASrtC,EAAKU,EAAY,KAAM+7E,EAAM9lF,IAAU,IACzH,EACAg8D,uBAAwB,SAAgC0wB,GACtD,IAAI36F,EAAO26F,EAAO36F,KACd2kD,EAAag2C,EAAOh2C,WACpB3sC,EAAa2iF,EAAO3iF,WACpB/J,EAAS0sF,EAAO1sF,OACpB,OAAOqJ,EAAK,CAAC,mBAAoBtX,EAAM24F,EAAK,cAAerhF,EAAKqtC,EAAY,QAASrtC,EAAKU,EAAY,KAAM+7E,EAAM9lF,IAAU,IAC9H,EACA28D,mBAAoB,SAA4BgwB,GAC9C,IAAI56F,EAAO46F,EAAO56F,KACdgY,EAAa4iF,EAAO5iF,WACpBiuC,EAAQ20C,EAAO30C,MACnB,OAAO3uC,EAAK,CAAC,eAAgBtX,EAAMsX,EAAKU,EAAY,KAAMiuC,GAA0B,IAAjBA,EAAMjsD,OAAe,KAAOsd,EAAK2uC,EAAO,OAAS,IAAK,IAC3H,EACAsjB,kBAAmB,SAA2BsxB,GAC5C,IAAI76F,EAAO66F,EAAO76F,KACdgY,EAAa6iF,EAAO7iF,WACpB1B,EAASukF,EAAOvkF,OACpB,OAAOgB,EAAK,CAAC,cAAetX,EAAMsX,EAAKU,EAAY,KAAM+7E,EAAMz9E,IAAU,IAC3E,EACA0zD,yBAA0B,SAAkC8wB,GAC1D,IAAI96F,EAAO86F,EAAO96F,KACdgY,EAAa8iF,EAAO9iF,WACpB/J,EAAS6sF,EAAO7sF,OACpB,OAAOqJ,EAAK,CAAC,eAAgBtX,EAAMsX,EAAKU,EAAY,KAAM+7E,EAAM9lF,IAAU,IAC5E,GAGF,SAASqrF,EAAevgE,GACtB,OAAO,SAAU1zB,GACf,OAAOiS,EAAK,CAACjS,EAAK60C,YAAanhB,EAAG1zB,IAAQ,KAC5C,CACF,CAOA,SAASiS,EAAKyjF,GACZ,IAAIC,EAEAC,EAAYn4F,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,GAAmBA,UAAU,GAAK,GACpF,OAEwB,QAFhBk4F,EAAuC,OAAfD,QAAsC,IAAfA,OAAwB,EAASA,EAAW58F,QAAO,SAAUqlC,GAClH,OAAOA,CACT,IAAGlsB,KAAK2jF,UAAkD,IAA1BD,EAAmCA,EAAwB,EAC7F,CAOA,SAASjH,EAAMzgF,GACb,OAAOqlF,EAAK,MAAO9K,EAAOv2E,EAAKhE,EAAO,OAAQ,MAChD,CAMA,SAASqlF,EAAK3hG,EAAOkkG,GAEnB,OAAsB,MAAfA,GAAuC,KAAhBA,EAAqBlkG,EAAQkkG,GADjDp4F,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,GAAmBA,UAAU,GAAK,IACC,EACjF,CAEA,SAAS+qF,EAAO5uC,GACd,OAAO05C,EAAK,KAAM15C,EAAIr/C,QAAQ,MAAO,QACvC,CAEA,SAASu7F,EAAYl8C,GACnB,OAA8B,IAAvBA,EAAIhlD,QAAQ,KACrB,CAEA,SAAS6/F,EAAkBiB,GACzB,OAAqB,MAAdA,GAAsBA,EAAWlyE,KAAKsyE,EAC/C,C,+HCxTA,SAASllD,EAAkBhK,EAAQiK,GAAS,IAAK,IAAItzC,EAAI,EAAGA,EAAIszC,EAAMl8C,OAAQ4I,IAAK,CAAE,IAAIuzC,EAAaD,EAAMtzC,GAAIuzC,EAAWxd,WAAawd,EAAWxd,aAAc,EAAOwd,EAAWvd,cAAe,EAAU,UAAWud,IAAYA,EAAWH,UAAW,GAAMz0C,OAAOm3B,eAAeuT,EAAQkK,EAAW94C,IAAK84C,EAAa,CAAE,CAgBrT,IAAIilD,EAAsB,WAC/B,SAASA,EAAO92F,GACd,IAAItE,EAAO8C,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,GAAmBA,UAAU,GAAK,kBAC3E00F,EAAiB10F,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,GAAmBA,UAAU,GAAK,CACvFwlC,KAAM,EACNykD,OAAQ,GAEM,kBAATzoF,IAAqB,OAAU,EAAG,oCAAoCwF,QAAO,OAAQxF,GAAO,MACnGpO,KAAKoO,KAAOA,EACZpO,KAAK8J,KAAOA,EACZ9J,KAAKshG,eAAiBA,EACtBthG,KAAKshG,eAAelvD,KAAO,IAAK,OAAU,EAAG,6DAC7CpyC,KAAKshG,eAAezK,OAAS,IAAK,OAAU,EAAG,8DACjD,CA3BF,IAAsB/0C,EAAaC,EAAYC,EAqC7C,OArCoBF,EA8BPojD,GA9BoBnjD,EA8BZ,CAAC,CACpB56C,IAAK,KACLqH,IAAK,WACH,MAAO,QACT,MAlC0EuxC,EAAkB+B,EAAY97C,UAAW+7C,GAAiBC,GAAajC,EAAkB+B,EAAaE,GAqC3KkjD,CACT,CAxBiC,GAgC1B,SAASC,EAASh3F,GACvB,OAAO,OAAWA,EAAQ+2F,EAC5B,C,wDC9CO,IAAIE,EAAY/5F,OAAOgS,OAAO,CACnCk7E,IAAK,QACLxK,IAAK,QACL+K,KAAM,IACNC,OAAQ,IACRC,IAAK,IACLC,QAAS,IACTC,QAAS,IACT/K,OAAQ,MACRgL,MAAO,IACPC,OAAQ,IACRC,GAAI,IACJC,UAAW,IACXC,UAAW,IACXC,QAAS,IACTC,KAAM,IACNC,QAAS,IACTp+C,KAAM,OACN8N,IAAK,MACLE,MAAO,QACPE,OAAQ,SACR6kC,aAAc,cACdtF,QAAS,W,2JCnBAsc,EAAoB,CAC7B9C,KAAM,GACNt/B,SAAU,CAAC,eACXplB,oBAAqB,CAAC,OAAQ,sBAAuB,aAAc,gBACnEZ,mBAAoB,CAAC,WAAY,OAAQ,eAAgB,cACzD1I,SAAU,CAAC,QACXyJ,aAAc,CAAC,cACfjB,MAAO,CAAC,QAAS,OAAQ,YAAa,aAAc,gBACpDgtB,SAAU,CAAC,OAAQ,SACnBn1C,eAAgB,CAAC,OAAQ,cACzBooB,eAAgB,CAAC,gBAAiB,aAAc,gBAChDI,mBAAoB,CAAC,OAErB,sBAAuB,gBAAiB,aAAc,gBACtD4tB,SAAU,GACVC,WAAY,GACZC,YAAa,GACbC,aAAc,GACdL,UAAW,GACXC,UAAW,GACXN,UAAW,CAAC,UACZE,YAAa,CAAC,UACdE,YAAa,CAAC,OAAQ,SACtBp4C,UAAW,CAAC,OAAQ,aACpBwxC,UAAW,CAAC,QACZ++B,SAAU,CAAC,QACXE,YAAa,CAAC,QACdpxB,iBAAkB,CAAC,cAAe,aAAc,kBAChDwxB,wBAAyB,CAAC,QAC1B5wB,qBAAsB,CAAC,cAAe,OAAQ,cAC9CE,qBAAsB,CAAC,cAAe,OAAQ,aAAc,aAAc,UAC1E8wB,gBAAiB,CAAC,cAAe,OAAQ,YAAa,OAAQ,cAC9DG,qBAAsB,CAAC,cAAe,OAAQ,OAAQ,eAAgB,cACtEhxB,wBAAyB,CAAC,cAAe,OAAQ,aAAc,aAAc,UAC7EC,oBAAqB,CAAC,cAAe,OAAQ,aAAc,SAC3DC,mBAAoB,CAAC,cAAe,OAAQ,aAAc,UAC1DmxB,oBAAqB,CAAC,cAAe,OAAQ,cAC7ClxB,0BAA2B,CAAC,cAAe,OAAQ,aAAc,UACjEsB,oBAAqB,CAAC,cAAe,OAAQ,YAAa,aAC1DnC,gBAAiB,CAAC,aAAc,kBAChCqC,oBAAqB,CAAC,OAAQ,cAC9BR,oBAAqB,CAAC,OAAQ,aAAc,aAAc,UAC1DD,uBAAwB,CAAC,OAAQ,aAAc,aAAc,UAC7DW,mBAAoB,CAAC,OAAQ,aAAc,SAC3CrB,kBAAmB,CAAC,OAAQ,aAAc,UAC1CS,yBAA0B,CAAC,OAAQ,aAAc,WAExCwxB,EAAQj6F,OAAOgS,OAAO,CAAC,GAwF3B,SAASkoF,EAAMjrF,EAAMyoD,GAC1B,IAAIyiC,EAAc54F,UAAU9I,OAAS,QAAsBqF,IAAjByD,UAAU,GAAmBA,UAAU,GAAKy4F,EAGlFn8D,OAAQ//B,EACRs8F,EAAUvyF,MAAMC,QAAQmH,GACxBlL,EAAO,CAACkL,GACR4wB,GAAS,EACTw6D,EAAQ,GACRv2F,OAAOhG,EACPhC,OAAMgC,EACN+N,OAAS/N,EACT8J,EAAO,GACP0hB,EAAY,GACZgxE,EAAUrrF,EAGd,EAAG,CAED,IAAIsrF,IADJ16D,IAC0B97B,EAAKtL,OAC3B+hG,EAAWD,GAA8B,IAAjBF,EAAM5hG,OAElC,GAAI8hG,EAAW,CAKb,GAJAz+F,EAA2B,IAArBwtB,EAAU7wB,YAAeqF,EAAY8J,EAAKA,EAAKnP,OAAS,GAC9DqL,EAAO+H,EACPA,EAASyd,EAAUzJ,MAEf26E,EAAU,CACZ,GAAIJ,EACFt2F,EAAOA,EAAKtL,YACP,CAGL,IAFA,IAAIiiG,EAAQ,CAAC,EAEJljD,EAAM,EAAGqpB,EAAgB5gE,OAAO+D,KAAKD,GAAOyzC,EAAMqpB,EAAcnoE,OAAQ8+C,IAAO,CACtF,IAAImjD,EAAI95B,EAAcrpB,GACtBkjD,EAAMC,GAAK52F,EAAK42F,EAClB,CAEA52F,EAAO22F,CACT,CAIA,IAFA,IAAIE,EAAa,EAERC,EAAK,EAAGA,EAAKP,EAAM5hG,OAAQmiG,IAAM,CACxC,IAAIC,EAAUR,EAAMO,GAAI,GACpBE,EAAYT,EAAMO,GAAI,GAEtBR,IACFS,GAAWF,GAGTP,GAAyB,OAAdU,GACbh3F,EAAKwW,OAAOugF,EAAS,GACrBF,KAEA72F,EAAK+2F,GAAWC,CAEpB,CACF,CAEAj7D,EAAQhC,EAAMgC,MACd97B,EAAO85B,EAAM95B,KACbs2F,EAAQx8D,EAAMw8D,MACdD,EAAUv8D,EAAMu8D,QAChBv8D,EAAQA,EAAMsuC,IAChB,KAAO,CAIL,GAHArwE,EAAM+P,EAASuuF,EAAUv6D,EAAQ97B,EAAK87B,QAAS/hC,EAGlC,QAFbgG,EAAO+H,EAASA,EAAO/P,GAAOw+F,SAEAx8F,IAATgG,EACnB,SAGE+H,GACFjE,EAAK/S,KAAKiH,EAEd,CAEA,IA2CMi/F,EA3CFn6F,OAAS,EAEb,IAAKiH,MAAMC,QAAQhE,GAAO,CACxB,KAAK,QAAOA,GACV,MAAM,IAAIH,MAAM,qBAAqB4E,QAAO,OAAQzE,GAAO,MAG7D,IAAIk3F,EAAUC,EAAWvjC,EAAS5zD,EAAKpB,KAAM63F,GAE7C,GAAIS,EAAS,CAGX,IAFAp6F,EAASo6F,EAAQ7gG,KAAKu9D,EAAS5zD,EAAMhI,EAAK+P,EAAQjE,EAAM0hB,MAEzC2wE,EACb,MAGF,IAAe,IAAXr5F,GACF,IAAK25F,EAAW,CACd3yF,EAAKiY,MACL,QACF,OACK,QAAe/hB,IAAX8C,IACTy5F,EAAMxlG,KAAK,CAACiH,EAAK8E,KAEZ25F,GAAW,CACd,KAAI,QAAO35F,GAEJ,CACLgH,EAAKiY,MACL,QACF,CAJE/b,EAAOlD,CAKX,CAEJ,CACF,CAMA,QAJe9C,IAAX8C,GAAwB45F,GAC1BH,EAAMxlG,KAAK,CAACiH,EAAKgI,IAGfy2F,EACF3yF,EAAKiY,WAILge,EAAQ,CACNu8D,QAASA,EACTv6D,MAAOA,EACP97B,KAAMA,EACNs2F,MAAOA,EACPluB,KAAMtuC,GAGR95B,GADAq2F,EAAUvyF,MAAMC,QAAQhE,IACPA,EAA4D,QAApDi3F,EAAwBZ,EAAYr2F,EAAKpB,aAA6C,IAA1Bq4F,EAAmCA,EAAwB,GAChJl7D,GAAS,EACTw6D,EAAQ,GAEJxuF,GACFyd,EAAUz0B,KAAKgX,GAGjBA,EAAS/H,CAEb,YAAmBhG,IAAV+/B,GAMT,OAJqB,IAAjBw8D,EAAM5hG,SACR6hG,EAAUD,EAAMA,EAAM5hG,OAAS,GAAG,IAG7B6hG,CACT,CAQO,SAASY,EAAgBjvB,GAC9B,IAAIkvB,EAAW,IAAItzF,MAAMokE,EAASxzE,QAClC,MAAO,CACL4uB,MAAO,SAAevjB,GACpB,IAAK,IAAIzC,EAAI,EAAGA,EAAI4qE,EAASxzE,OAAQ4I,IACnC,GAAmB,MAAf85F,EAAS95F,GAAY,CACvB,IAAIq2B,EAAKujE,EAAWhvB,EAAS5qE,GAAIyC,EAAKpB,MAEtC,GAEA,GAAIg1B,EAAI,CACN,IAAI92B,EAAS82B,EAAGh2B,MAAMuqE,EAAS5qE,GAAIE,WAEnC,IAAe,IAAXX,EACFu6F,EAAS95F,GAAKyC,OACT,GAAIlD,IAAWq5F,EACpBkB,EAAS95F,GAAK44F,OACT,QAAen8F,IAAX8C,EACT,OAAOA,CAEX,CACF,CAEJ,EACAoxC,MAAO,SAAeluC,GACpB,IAAK,IAAIzC,EAAI,EAAGA,EAAI4qE,EAASxzE,OAAQ4I,IACnC,GAAmB,MAAf85F,EAAS95F,GAAY,CACvB,IAAIq2B,EAAKujE,EAAWhvB,EAAS5qE,GAAIyC,EAAKpB,MAEtC,GAEA,GAAIg1B,EAAI,CACN,IAAI92B,EAAS82B,EAAGh2B,MAAMuqE,EAAS5qE,GAAIE,WAEnC,GAAIX,IAAWq5F,EACbkB,EAAS95F,GAAK44F,OACT,QAAen8F,IAAX8C,IAAmC,IAAXA,EACjC,OAAOA,CAEX,CACF,MAAWu6F,EAAS95F,KAAOyC,IACzBq3F,EAAS95F,GAAK,KAGpB,EAEJ,CAMO,SAAS45F,EAAWvjC,EAASh1D,EAAM63F,GACxC,IAAIa,EAAc1jC,EAAQh1D,GAE1B,GAAI04F,EAAa,CACf,IAAKb,GAAoC,oBAAhBa,EAEvB,OAAOA,EAGT,IAAIC,EAAsBd,EAAYa,EAAYppD,MAAQopD,EAAY/zE,MAEtE,GAAmC,oBAAxBg0E,EAET,OAAOA,CAEX,KAAO,CACL,IAAIC,EAAkBf,EAAY7iC,EAAQ1lB,MAAQ0lB,EAAQrwC,MAE1D,GAAIi0E,EAAiB,CACnB,GAA+B,oBAApBA,EAET,OAAOA,EAGT,IAAIC,EAAsBD,EAAgB54F,GAE1C,GAAmC,oBAAxB64F,EAET,OAAOA,CAEX,CACF,CACF,C,yGC5XO,IAAIC,EAAoC,oBAAX7kE,QAA4C,MAAnBA,OAAOqO,SAAmBrO,OAAOqO,SAAW,aAG9Fy2D,EAA0C,oBAAX9kE,QAAiD,MAAxBA,OAAOsO,cAAwBtO,OAAOsO,cAAgB,kBAE9Gy2D,EAAyC,oBAAX/kE,QAA+C,MAAtBA,OAAOglE,YAAsBhlE,OAAOglE,YAAc,e,yGCFpH,MAAMtoD,EAAkB,IAAMrzC,OAAO3C,OAAO,OAEtC,QAAEmF,EAAO,MAAEhK,GAAUqP,MAAMlN,WACzB8G,eAAc,GAAKzB,OAAOrF,UAC3B,MAAM24C,EACT,WAAAl+C,CAAYm+C,GAAW,EAAMC,EAAWH,GACpC1+C,KAAK4+C,SAAWA,EAChB5+C,KAAK6+C,SAAWA,CACpB,CACA,MAAAnpC,IAAU0H,GACN,OAAOpd,KAAK2a,YAAYyC,EAC5B,CACA,WAAAzC,CAAYyC,GACR,IAAIjO,EAAOnP,KAEX,OADA6N,EAAQrI,KAAK4X,GAAOjW,GAAOgI,EAAOA,EAAK2vC,aAAa33C,KAC7C,EAAe3B,KAAK2J,EAAM,QAC3BA,EAAK5K,KACL4K,EAAK5K,KAAOvE,KAAK6+C,SAASh7C,EAAM2B,KAAK4X,GAC/C,CACA,IAAAiB,IAAQjB,GACJ,OAAOpd,KAAK++C,UAAU3hC,EAC1B,CACA,SAAA2hC,CAAU3hC,GACN,IAAIjO,EAAOnP,KACX,IAAK,IAAI0M,EAAI,EAAGsyC,EAAM5hC,EAAMtZ,OAAQqL,GAAQzC,EAAIsyC,IAAOtyC,EAAG,CACtD,MAAMnE,EAAMvI,KAAK4+C,UAAYS,EAASjiC,EAAM1Q,IAAMyC,EAAKgwC,KAAOhwC,EAAKiwC,OACnEjwC,EAAO5G,GAAOA,EAAIiG,IAAI4O,EAAM1Q,GAChC,CACA,OAAOyC,GAAQA,EAAK5K,IACxB,CACA,YAAAu6C,CAAa33C,GACT,MAAMoB,EAAMvI,KAAK4+C,UAAYS,EAASl4C,GAChCnH,KAAKm/C,OAASn/C,KAAKm/C,KAAO,IAAIziC,SAC9B1c,KAAKo/C,SAAWp/C,KAAKo/C,OAAS,IAAInyC,KACxC,IAAIuN,EAAQjS,EAAIiG,IAAIrH,GAGpB,OAFKqT,GACDjS,EAAIoG,IAAIxH,EAAKqT,EAAQ,IAAImkC,EAAK3+C,KAAK4+C,SAAU5+C,KAAK6+C,WAC/CrkC,CACX,EAEJ,SAAS6kC,EAASj4C,GACd,cAAeA,GACX,IAAK,SACD,GAAc,OAAVA,EACA,MAER,IAAK,WACD,OAAO,EAEf,OAAO,CACX,C,eCpDI6/F,EAAiB,KAGjBC,EAAgB,CAAC,EACjBC,EAAY,EAyGhB,SAASC,EAAMrkE,GACX,IACI,OAAOA,GACX,CACA,MAAOskE,GAAW,CACtB,CASA,IAAIC,EAAY,oBAeZC,EAXJH,GAAM,WAAc,OAAOx0F,UAAY,KAInCw0F,GAAM,WAAc,OAAO,EAAAnkD,CAAQ,KAInC53C,OAAO3C,OAAO,MAId8+F,EAAOD,EAAWD,IAGlBp0F,MAAMo0F,IACN,SAAWE,GACP,IACIn8F,OAAOm3B,eAAe+kE,EAAYD,EAAW,CACzClgG,MAAOogG,EACP/kE,YAAY,EACZqd,UAAU,EAOVpd,cAAc,GAEtB,CACA,QACI,OAAO8kE,CACX,CACH,CAlBD,CAvIoD,WACpD,SAASA,IAILxnG,KAAKyR,GAAK,CACN,OACA01F,IACAhnG,KAAKC,MACLgC,KAAKG,SAAS6I,SAAS,IAAIvH,MAAM,IACnCud,KAAK,IACX,CAwFA,OAvFAomF,EAAKxhG,UAAUyhG,SAAW,WACtB,IAAK,IAAIC,EAAYT,EAAgBS,EAAWA,EAAYA,EAAUxwF,OAGlE,GAAIlX,KAAKyR,MAAMi2F,EAAUC,MAAO,CAC5B,IAAIvgG,EAAQsgG,EAAUC,MAAM3nG,KAAKyR,IACjC,GAAIrK,IAAU8/F,EACV,MAOJ,OANIQ,IAAcT,IAIdA,EAAeU,MAAM3nG,KAAKyR,IAAMrK,IAE7B,CACX,CAQJ,OANI6/F,IAIAA,EAAeU,MAAM3nG,KAAKyR,IAAMy1F,IAE7B,CACX,EACAM,EAAKxhG,UAAU0oB,SAAW,WACtB,GAAI1uB,KAAKynG,WACL,OAAOR,EAAeU,MAAM3nG,KAAKyR,GAEzC,EACA+1F,EAAKxhG,UAAU0gB,UAAY,SAAUtf,EAAO8K,EAG5ChJ,EAAM+oD,GACF,IAAIlmD,EACA47F,IAAS57F,EAAK,CACVqH,UAAW,OAEZpT,KAAKyR,IAAMrK,EACd2E,GACAmL,EAAS+vF,EACbA,EAAiB,CAAE/vF,OAAQA,EAAQywF,MAAOA,GAC1C,IAGI,OAAOz1F,EAASnF,MAAMklD,EAAS/oD,EACnC,CACA,QACI+9F,EAAiB/vF,CACrB,CACJ,EAGAswF,EAAK5mG,KAAO,SAAUsR,GAClB,IAAIsB,EAAUyzF,EACd,OAAO,WACH,IAAIW,EAAQX,EACZ,IAEI,OADAA,EAAiBzzF,EACVtB,EAASnF,MAAM/M,KAAM4M,UAChC,CACA,QACIq6F,EAAiBW,CACrB,CACJ,CACJ,EAEAJ,EAAKK,UAAY,SAAU31F,EAG3BhJ,EAAM+oD,GACF,IAAIg1C,EAaA,OAAO/0F,EAASnF,MAAMklD,EAAS/oD,GAZ/B,IAAI0+F,EAAQX,EACZ,IAII,OAHAA,EAAiB,KAGV/0F,EAASnF,MAAMklD,EAAS/oD,EACnC,CACA,QACI+9F,EAAiBW,CACrB,CAKR,EACOJ,CACX,CApGuD,IA2J5CA,EAAK5mG,KAAkB4mG,EAAKK,UCrKhC,MAAMC,EAAkB,IAAIN,ECD5B,MAAQ16F,eAAc,GAAMzB,OAAOrF,UAC7B+hG,EAAe70F,MAAMrB,MAC9B,SAAUlD,GACN,MAAMyO,EAAQ,GAEd,OADAzO,EAAId,SAAQmH,GAAQoI,EAAMld,KAAK8U,KACxBoI,CACX,EACG,SAAS4qF,EAAiBC,GAC7B,MAAM,YAAExgG,GAAgBwgG,EACG,oBAAhBxgG,IACPwgG,EAAWxgG,iBAAc,EACzBA,IAER,CCXA,MAAMygG,EAAe,GACfC,EAAmB,IAGzB,SAASC,EAAOzS,EAAW0S,GACvB,IAAK1S,EACD,MAAM,IAAI3mF,MAAMq5F,GAAmB,oBAE3C,CACA,SAASC,EAAQ/+F,EAAGo+C,GAChB,MAAM3I,EAAMz1C,EAAEzF,OACd,OAEAk7C,EAAM,GAEFA,IAAQ2I,EAAE7jD,QAEVyF,EAAEy1C,EAAM,KAAO2I,EAAE3I,EAAM,EAC/B,CACA,SAASupD,EAASnhG,GACd,OAAQA,EAAMtD,QACV,KAAK,EAAG,MAAM,IAAIkL,MAAM,iBACxB,KAAK,EAAG,OAAO5H,EAAM,GACrB,KAAK,EAAG,MAAMA,EAAM,GAE5B,CACA,SAASohG,EAAUphG,GACf,OAAOA,EAAMvD,MAAM,EACvB,CACO,MAAM4kG,EACT,WAAAhoG,CAAYsiC,GACR/iC,KAAK+iC,GAAKA,EACV/iC,KAAK0oG,QAAU,IAAI/6F,IACnB3N,KAAK2oG,YAAc,IAAI17F,IAIvBjN,KAAK4oG,cAAgB,KACrB5oG,KAAK8X,OAAQ,EACb9X,KAAK6oG,aAAc,EACnB7oG,KAAKoH,MAAQ,GACbpH,KAAK8oG,KAAO,OACVL,EAAM1uF,KACZ,CACA,IAAAsE,GACI,GAA0B,IAAtBre,KAAKoH,MAAMtD,SAAiBilG,EAAa/oG,MAEzC,OADAgpG,EAAehpG,MACRA,KAAKoH,MAAM,EAE1B,CAOA,SAAA6hG,CAAU//F,GAGN,OAFAk/F,GAAQpoG,KAAK6oG,YAAa,uBAC1BG,EAAehpG,MACR+oG,EAAa/oG,MA2E5B,SAAyBg/B,EAAO91B,GAC5BggG,EAAelqE,GAEf8oE,EAAgBphF,UAAUsY,EAAOmqE,EAAmB,CAACnqE,EAAO91B,IA8IhE,SAAwB81B,EAAO91B,GAC3B,GAA+B,oBAApB81B,EAAM12B,UACb,IACI0/F,EAAiBhpE,GACjBA,EAAMv3B,YAAcu3B,EAAM12B,UAAUyE,MAAM,KAAM7D,EACpD,CACA,MAAO0gB,GAMH,OADAoV,EAAMoqE,YACC,CACX,CAIJ,OAAO,CACX,CA/JQC,CAAerqE,EAAO91B,IA2C9B,SAAkB81B,GAEd,GADAA,EAAMlnB,OAAQ,EACVixF,EAAa/pE,GAGb,OAEJsqE,EAAYtqE,EAChB,CAhDQuqE,CAASvqE,GAEb,OAAOupE,EAASvpE,EAAM53B,MAC1B,CApFcoiG,CAAgBxpG,KAAMkJ,GACtBq/F,EAASvoG,KAAKoH,MACxB,CACA,QAAAgiG,GACQppG,KAAK8X,QAET9X,KAAK8X,OAAQ,EACb2xF,EAAYzpG,MAIZgoG,EAAiBhoG,MACrB,CACA,OAAA0pG,GACI1pG,KAAKopG,WAILF,EAAelpG,MAYf2pG,EAAW3pG,MAAM,CAACkX,EAAQsD,KACtBtD,EAAOkyF,WACPQ,EAAY1yF,EAAQlX,KAAK,GAEjC,CACA,MAAAgI,GAIIhI,KAAK0pG,SACT,CACA,QAAAG,CAAS57E,GACLA,EAAIplB,IAAI7I,MACHA,KAAK8oG,OACN9oG,KAAK8oG,KAAOZ,EAAah9E,OAAS,IAAIvd,KAE1C3N,KAAK8oG,KAAKjgG,IAAIolB,EAClB,CACA,UAAA67E,GACQ9pG,KAAK8oG,OACLf,EAAa/nG,KAAK8oG,MAAMj7F,SAAQogB,GAAOA,EAAIlV,OAAO/Y,QAClDA,KAAK8oG,KAAKj5F,QACVq4F,EAAahoG,KAAKF,KAAK8oG,MACvB9oG,KAAK8oG,KAAO,KAEpB,EAGJ,SAASE,EAAexuF,GACpB,MAAMtD,EAAS4wF,EAAgBp5E,WAC/B,GAAIxX,EAWA,OAVAsD,EAAMkuF,QAAQ7/F,IAAIqO,GACbA,EAAOyxF,YAAYl6F,IAAI+L,IACxBtD,EAAOyxF,YAAYh6F,IAAI6L,EAAO,IAE9BuuF,EAAavuF,GACbuvF,EAAiB7yF,EAAQsD,GAGzBwvF,EAAiB9yF,EAAQsD,GAEtBtD,CAEf,CAYA,SAASiyF,EAAkBnqE,EAAO91B,GAC9B81B,EAAM6pE,aAAc,EACpB,MAAM,gBAAEoB,GAAoBjrE,EAC5B,IAAIkrE,EACAD,GAA0C,IAAvBjrE,EAAM53B,MAAMtD,SAC/BomG,EAAe1B,EAAUxpE,EAAM53B,QAGnC43B,EAAM53B,MAAMtD,OAAS,EACrB,IAOI,GALAk7B,EAAM53B,MAAM,GAAK43B,EAAM+D,GAAGh2B,MAAM,KAAM7D,GAKlC+gG,GAAmBC,IAAiB5B,EAAQ4B,EAAclrE,EAAM53B,OAChE,IACI43B,EAAM53B,MAAM,GAAK6iG,EAAgBjrE,EAAM53B,MAAM,GAAI8iG,EAAa,GAClE,CACA,MAAOn+F,GAGP,CAER,CACA,MAAO6d,GAEHoV,EAAM53B,MAAM,GAAKwiB,CACrB,CAEAoV,EAAM6pE,aAAc,CACxB,CACA,SAASE,EAAa/pE,GAClB,OAAOA,EAAMlnB,UAAYknB,EAAM4pE,gBAAiB5pE,EAAM4pE,cAAcvjF,KACxE,CAUA,SAASokF,EAAYjvF,GACjBmvF,EAAWnvF,EAAOuvF,EACtB,CACA,SAAST,EAAY9uF,GACjBmvF,EAAWnvF,EAAOwvF,EACtB,CACA,SAASL,EAAWnvF,EAAOtI,GACvB,MAAMi4F,EAAc3vF,EAAMkuF,QAAQrjF,KAClC,GAAI8kF,EAAa,CACb,MAAMzB,EAAUX,EAAavtF,EAAMkuF,SACnC,IAAK,IAAIh8F,EAAI,EAAGA,EAAIy9F,IAAez9F,EAC/BwF,EAASw2F,EAAQh8F,GAAI8N,EAE7B,CACJ,CAEA,SAASuvF,EAAiB7yF,EAAQsD,GAG9B4tF,EAAOlxF,EAAOyxF,YAAYl6F,IAAI+L,IAC9B4tF,EAAOW,EAAavuF,IACpB,MAAM4vF,GAAkBrB,EAAa7xF,GACrC,GAAKA,EAAO0xF,eAGP,GAAI1xF,EAAO0xF,cAAcn6F,IAAI+L,GAI9B,YANAtD,EAAO0xF,cAAgBV,EAAah9E,OAAS,IAAIvd,IAQrDuJ,EAAO0xF,cAAc//F,IAAI2R,GAGrB4vF,GACAX,EAAYvyF,EAEpB,CAEA,SAAS8yF,EAAiB9yF,EAAQsD,GAG9B4tF,EAAOlxF,EAAOyxF,YAAYl6F,IAAI+L,IAC9B4tF,GAAQW,EAAavuF,IACrB,MAAM6vF,EAAanzF,EAAOyxF,YAAYn6F,IAAIgM,GAChB,IAAtB6vF,EAAWvmG,OACXoT,EAAOyxF,YAAYh6F,IAAI6L,EAAOguF,EAAUhuF,EAAMpT,QAExCkhG,EAAQ+B,EAAY7vF,EAAMpT,QAChC8P,EAAOkyF,WAEXkB,EAAiBpzF,EAAQsD,GACrBuuF,EAAa7xF,IAGjBoyF,EAAYpyF,EAChB,CACA,SAASozF,EAAiBpzF,EAAQsD,GAC9B,MAAM+vF,EAAKrzF,EAAO0xF,cACd2B,IACAA,EAAGxxF,OAAOyB,GACM,IAAZ+vF,EAAGllF,OACC6iF,EAAapkG,OAASqkG,GACtBD,EAAahoG,KAAKqqG,GAEtBrzF,EAAO0xF,cAAgB,MAGnC,CAGA,SAASM,EAAehyF,GAChBA,EAAOyxF,YAAYtjF,KAAO,GAC1BnO,EAAOyxF,YAAY96F,SAAQ,CAACw3C,EAAQ7qC,KAChCovF,EAAY1yF,EAAQsD,EAAM,IAKlCtD,EAAO4yF,aAGP1B,EAAgC,OAAzBlxF,EAAO0xF,cAClB,CACA,SAASgB,EAAY1yF,EAAQsD,GACzBA,EAAMkuF,QAAQ3vF,OAAO7B,GACrBA,EAAOyxF,YAAY5vF,OAAOyB,GAC1B8vF,EAAiBpzF,EAAQsD,EAC7B,CAjKAiuF,EAAM1uF,MAAQ,ECrHd,MAAMywF,EAAe,CACjBpB,UAAU,EACVM,SAAS,EACT1hG,QAAQ,GAEL,SAASimB,EAAIzjB,GAChB,MAAMigG,EAAY,IAAIx9F,IAChB3E,EAAYkC,GAAWA,EAAQlC,UACrC,SAASwO,EAAO3P,GACZ,MAAM+P,EAAS4wF,EAAgBp5E,WAC/B,GAAIxX,EAAQ,CACR,IAAI+W,EAAMw8E,EAAUj8F,IAAIrH,GACnB8mB,GACDw8E,EAAU97F,IAAIxH,EAAK8mB,EAAM,IAAItgB,KAEjCuJ,EAAO2yF,SAAS57E,GACS,oBAAd3lB,IACP0/F,EAAiB/5E,GACjBA,EAAIxmB,YAAca,EAAUnB,GAEpC,CACJ,CAcA,OAbA2P,EAAOgB,MAAQ,SAAe3Q,EAAKujG,GAC/B,MAAMz8E,EAAMw8E,EAAUj8F,IAAIrH,GAC1B,GAAI8mB,EAAK,CACL,MAAM08E,EAAKD,GACP,EAAellG,KAAKglG,EAAcE,GAAoBA,EAAkB,WAI5E3C,EAAa95E,GAAKpgB,SAAQmxB,GAASA,EAAM2rE,OACzCF,EAAU1xF,OAAO5R,GACjB6gG,EAAiB/5E,EACrB,CACJ,EACOnX,CACX,CCfA,IAAI8zF,EACG,SAASC,KAAuB3hG,GAEnC,OADa0hG,IAAmBA,EAAiB,IAAIjsD,EAAwB,oBAAZjiC,WACrD/B,YAAYzR,EAC5B,CAMA,MAAMolB,EAAS,IAAI3gB,IACZ,SAAS80F,EAAKqI,GAAkB,IAAEx6F,EAAMlO,KAAKC,IAAI,EAAG,IAAG,QAAEoc,EAAO,aAAEhE,EAAeowF,EAAmB,gBAAEZ,EAAe,UAAE3hG,EAAWiI,MAAOw6F,EAAc,KAAiB1/F,OAAO3C,OAAO,OACzL,MAAM6H,EAA+B,oBAAhBw6F,EACf,IAAIA,EAAYz6F,GAAK0uB,GAASA,EAAM0qE,YACpCqB,EACAn6F,EAAa,WACf,MAAMzJ,EAAMsT,EAAa1N,MAAM,KAAM0R,EAAUA,EAAQ1R,MAAM,KAAMH,WAAaA,WAChF,QAAY,IAARzF,EACA,OAAO2jG,EAAiB/9F,MAAM,KAAMH,WAExC,IAAIoyB,EAAQzuB,EAAM/B,IAAIrH,GACjB63B,IACDzuB,EAAM5B,IAAIxH,EAAK63B,EAAQ,IAAIypE,EAAMqC,IACjC9rE,EAAMirE,gBAAkBA,EACxBjrE,EAAM12B,UAAYA,EAGlB02B,EAAMh3B,OAAS,IAAMuI,EAAMwI,OAAO5R,IAEtC,MAAMC,EAAQ43B,EAAMiqE,UAAU/1F,MAAMlN,UAAUnC,MAAM2B,KAAKoH,YAYzD,OATA2D,EAAM5B,IAAIxH,EAAK63B,GACf1Q,EAAOzlB,IAAI0H,GAINu3F,EAAgBL,aACjBn5E,EAAOzgB,SAAQ0C,GAASA,EAAMy6F,UAC9B18E,EAAOze,SAEJzI,CACX,EAcA,SAAS6jG,EAAS9jG,GACd,MAAM63B,EAAQ73B,GAAOoJ,EAAM/B,IAAIrH,GAC3B63B,GACAA,EAAMoqE,UAEd,CAKA,SAAS8B,EAAQ/jG,GACb,MAAM63B,EAAQ73B,GAAOoJ,EAAM/B,IAAIrH,GAC/B,GAAI63B,EACA,OAAOA,EAAM3gB,MAErB,CAKA,SAAS8sF,EAAUhkG,GACf,QAAOA,GAAMoJ,EAAMwI,OAAO5R,EAC9B,CASA,OA5CAkE,OAAOm3B,eAAe5xB,EAAY,OAAQ,CACtCpC,IAAK,IAAM+B,EAAM8U,KACjBqd,cAAc,EACdD,YAAY,IAEhBp3B,OAAOgS,OAAOzM,EAAWpG,QAAU,CAC/B8F,MACAmO,UACAhE,eACAwvF,kBACA3hG,YACAiI,UAQJK,EAAWq6F,SAAWA,EACtBr6F,EAAWkH,MAAQ,WACfmzF,EAASxwF,EAAa1N,MAAM,KAAMH,WACtC,EAOAgE,EAAWs6F,QAAUA,EACrBt6F,EAAWyN,KAAO,WACd,OAAO6sF,EAAQzwF,EAAa1N,MAAM,KAAMH,WAC5C,EAIAgE,EAAWu6F,UAAYA,EACvBv6F,EAAW5I,OAAS,WAChB,OAAOmjG,EAAU1wF,EAAa1N,MAAM,KAAMH,WAC9C,EACAgE,EAAW6J,aAAeA,EAC1B7J,EAAWw6F,OAAS3sF,EAAU,WAC1B,OAAOhE,EAAa1N,MAAM,KAAM0R,EAAQ1R,MAAM,KAAMH,WACxD,EAAI6N,EACGpP,OAAOgS,OAAOzM,EACzB,C,wBC/GA,SAASy6F,EAAgChqD,EAAGiqD,GAAkB,IAAIC,EAAuB,qBAAXvpE,QAA0Bqf,EAAErf,OAAOqO,WAAagR,EAAE,cAAe,GAAIkqD,EAAI,OAAQA,EAAKA,EAAG/lG,KAAK67C,IAAIl1C,KAAKvL,KAAK2qG,GAAK,GAAIr4F,MAAMC,QAAQkuC,KAAOkqD,EAExN,SAAqClqD,EAAGmqD,GAAU,IAAKnqD,EAAG,OAAQ,GAAiB,kBAANA,EAAgB,OAAOoqD,EAAkBpqD,EAAGmqD,GAAS,IAAI7+F,EAAItB,OAAOrF,UAAUoF,SAAS5F,KAAK67C,GAAGx9C,MAAM,GAAI,GAAc,WAAN8I,GAAkB00C,EAAE5gD,cAAakM,EAAI00C,EAAE5gD,YAAYqJ,MAAM,GAAU,QAAN6C,GAAqB,QAANA,EAAa,OAAOuG,MAAMrB,KAAKwvC,GAAI,GAAU,cAAN10C,GAAqB,2CAA2CrD,KAAKqD,GAAI,OAAO8+F,EAAkBpqD,EAAGmqD,EAAS,CAFlME,CAA4BrqD,KAAOiqD,GAAkBjqD,GAAyB,kBAAbA,EAAEv9C,OAAqB,CAAMynG,IAAIlqD,EAAIkqD,GAAI,IAAI7+F,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK20C,EAAEv9C,OAAe,CAAE8rC,MAAM,GAAe,CAAEA,MAAM,EAAOxoC,MAAOi6C,EAAE30C,KAAQ,CAAG,CAAE,MAAM,IAAI+zC,UAAU,wIAA0I,CAI3lB,SAASgrD,EAAkBv+C,EAAKlO,IAAkB,MAAPA,GAAeA,EAAMkO,EAAIppD,UAAQk7C,EAAMkO,EAAIppD,QAAQ,IAAK,IAAI4I,EAAI,EAAGi/F,EAAO,IAAIz4F,MAAM8rC,GAAMtyC,EAAIsyC,EAAKtyC,IAAOi/F,EAAKj/F,GAAKwgD,EAAIxgD,GAAM,OAAOi/F,CAAM,CAEtL,SAAS5rD,EAAkBhK,EAAQiK,GAAS,IAAK,IAAItzC,EAAI,EAAGA,EAAIszC,EAAMl8C,OAAQ4I,IAAK,CAAE,IAAIuzC,EAAaD,EAAMtzC,GAAIuzC,EAAWxd,WAAawd,EAAWxd,aAAc,EAAOwd,EAAWvd,cAAe,EAAU,UAAWud,IAAYA,EAAWH,UAAW,GAAMz0C,OAAOm3B,eAAeuT,EAAQkK,EAAW94C,IAAK84C,EAAa,CAAE,CAE5T,SAAS8J,EAAajI,EAAaC,EAAYC,GAAyN,OAAtMD,GAAYhC,EAAkB+B,EAAY97C,UAAW+7C,GAAiBC,GAAajC,EAAkB+B,EAAaE,GAAc32C,OAAOm3B,eAAesf,EAAa,YAAa,CAAEhC,UAAU,IAAiBgC,CAAa,C,gCAG5R,IAAI8pD,EAAa,WACf,MAAyB,oBAAX5pE,MAChB,EAEI6pE,EAAY,SAAU/hG,GACxB,OAAO8hG,KAAgBjjF,QAAQqZ,OAAOl4B,GACxC,EAEIgiG,EAAY,SAAUhiG,GACxB,OAAO+hG,EAAU/hG,GAAQk4B,OAAOl4B,GAAQ,KAAOA,CACjD,EAEI8hG,MAAiBC,EAAU,gBAC7B7pE,OAAOlT,WAAakT,OAAO,eAG7B,IAAI+pE,EAAiBD,EAAU,YAC3BE,EAAmBF,EAAU,cAC7BG,EAAgBH,EAAU,WAE9B,SAASI,EAAU5yF,EAAKnS,GACtB,IAAIC,EAAQkS,EAAInS,GAChB,GAAa,MAATC,EAAJ,CACA,GAAqB,oBAAVA,EAAsB,MAAM,IAAIq5C,UAAUr5C,EAAQ,sBAC7D,OAAOA,CAF4B,CAGrC,CAEA,SAAS+kG,EAAW7yF,GAClB,IAAI8yF,EAAO9yF,EAAI7Y,YAUf,YARa0I,IAATijG,GAGW,QAFbA,EAAOA,EAAKH,MAGVG,OAAOjjG,QAIKA,IAATijG,EAAqBA,EAAOphG,CACrC,CAEA,SAASqhG,EAAa/+D,GACpB,OAAOA,aAAatiC,CACtB,CAEA,SAASshG,EAAgB1iF,GACnB0iF,EAAgBxsG,IAClBwsG,EAAgBxsG,IAAI8pB,GAEpB5nB,YAAW,WACT,MAAM4nB,CACR,GAEJ,CAEA,SAAS2iF,EAAQxpE,GACf/V,QAAQC,UAAUiC,MAAK,WACrB,IACE6T,GACF,CAAE,MAAOnZ,GACP0iF,EAAgB1iF,EAClB,CACF,GACF,CAEA,SAAS4iF,EAAoB1kG,GAC3B,IAAI6nC,EAAU7nC,EAAa2kG,SAC3B,QAAgBtjG,IAAZwmC,IACJ7nC,EAAa2kG,cAAWtjG,EAEnBwmC,GAIL,IACE,GAAuB,oBAAZA,EACTA,QACK,CACL,IAAIloC,EAAcykG,EAAUv8D,EAAS,eAEjCloC,GACFA,EAAYjC,KAAKmqC,EAErB,CACF,CAAE,MAAO/lB,GACP0iF,EAAgB1iF,EAClB,CACF,CAEA,SAAS8iF,EAAkB5kG,GACzBA,EAAa88B,eAAYz7B,EACzBrB,EAAa6kG,YAASxjG,EACtBrB,EAAa8kG,OAAS,QACxB,CAkBA,SAASC,EAAmB/kG,EAAcxB,EAAMc,GAC9CU,EAAa8kG,OAAS,UACtB,IAAI3hG,EAAWnD,EAAa88B,UAE5B,IACE,IAAI+lE,EAAIuB,EAAUjhG,EAAU3E,GAE5B,OAAQA,GACN,IAAK,OACCqkG,GAAGA,EAAEnlG,KAAKyF,EAAU7D,GACxB,MAEF,IAAK,QAEH,GADAslG,EAAkB5kG,IACd6iG,EAAgC,MAAMvjG,EAAnCujG,EAAEnlG,KAAKyF,EAAU7D,GACxB,MAEF,IAAK,WACHslG,EAAkB5kG,GACd6iG,GAAGA,EAAEnlG,KAAKyF,GAGpB,CAAE,MAAO2e,GACP0iF,EAAgB1iF,EAClB,CAE4B,WAAxB9hB,EAAa8kG,OAAqBJ,EAAoB1kG,GAA+C,YAAxBA,EAAa8kG,SAAsB9kG,EAAa8kG,OAAS,QAC5I,CAEA,SAASE,EAAShlG,EAAcxB,EAAMc,GACpC,GAA4B,WAAxBU,EAAa8kG,OAAjB,CAEA,GAA4B,cAAxB9kG,EAAa8kG,OASjB,MAA4B,UAAxB9kG,EAAa8kG,QACf9kG,EAAa8kG,OAAS,YACtB9kG,EAAa6kG,OAAS,CAAC,CACrBrmG,KAAMA,EACNc,MAAOA,SAETmlG,GAAQ,WACN,OAhEN,SAA2BzkG,GACzB,IAAIilG,EAAQjlG,EAAa6kG,OAEzB,GAAKI,EAAL,CAIAjlG,EAAa6kG,YAASxjG,EACtBrB,EAAa8kG,OAAS,QAEtB,IAAK,IAAIlgG,EAAI,EAAGA,EAAIqgG,EAAMjpG,SACxB+oG,EAAmB/kG,EAAcilG,EAAMrgG,GAAGpG,KAAMymG,EAAMrgG,GAAGtF,OAC7B,WAAxBU,EAAa8kG,UAFiBlgG,GALpC,CASF,CAkDasgG,CAAkBllG,EAC3B,UAIF+kG,EAAmB/kG,EAAcxB,EAAMc,GApBrCU,EAAa6kG,OAAOzsG,KAAK,CACvBoG,KAAMA,EACNc,MAAOA,GALiC,CAwB9C,CAEA,IAAIN,EAA4B,WAC9B,SAASA,EAAamE,EAAUgiG,GAG9BjtG,KAAKysG,cAAWtjG,EAChBnJ,KAAK4kC,UAAY35B,EACjBjL,KAAK2sG,YAASxjG,EACdnJ,KAAK4sG,OAAS,eACd,IAAIM,EAAuB,IAAIC,EAAqBntG,MAEpD,IACEA,KAAKysG,SAAWQ,EAAWznG,UAAK2D,EAAW+jG,EAC7C,CAAE,MAAOtjF,GACPsjF,EAAqBhoG,MAAM0kB,EAC7B,CAEoB,iBAAhB5pB,KAAK4sG,SAA2B5sG,KAAK4sG,OAAS,QACpD,CAkBA,OAhBa9lG,EAAad,UAEnByB,YAAc,WACC,WAAhBzH,KAAK4sG,SACPF,EAAkB1sG,MAClBwsG,EAAoBxsG,MAExB,EAEA+pD,EAAajjD,EAAc,CAAC,CAC1BK,IAAK,SACLqH,IAAK,WACH,MAAuB,WAAhBxO,KAAK4sG,MACd,KAGK9lG,CACT,CApCgC,GAsC5BqmG,EAAoC,WACtC,SAASA,EAAqBrlG,GAC5B9H,KAAK2kC,cAAgB78B,CACvB,CAEA,IAAIwmD,EAAU6+C,EAAqBnnG,UAqBnC,OAnBAsoD,EAAQniD,KAAO,SAAc/E,GAC3B0lG,EAAS9sG,KAAK2kC,cAAe,OAAQv9B,EACvC,EAEAknD,EAAQppD,MAAQ,SAAekC,GAC7B0lG,EAAS9sG,KAAK2kC,cAAe,QAASv9B,EACxC,EAEAknD,EAAQjiD,SAAW,WACjBygG,EAAS9sG,KAAK2kC,cAAe,WAC/B,EAEAolB,EAAaojD,EAAsB,CAAC,CAClChmG,IAAK,SACLqH,IAAK,WACH,MAAqC,WAA9BxO,KAAK2kC,cAAcioE,MAC5B,KAGKO,CACT,CA3BwC,GA6BpCniG,EAA0B,WAC5B,SAASA,EAAWiiG,GAClB,KAAMjtG,gBAAgBgL,GAAa,MAAM,IAAIy1C,UAAU,6CACvD,GAA0B,oBAAfwsD,EAA2B,MAAM,IAAIxsD,UAAU,6CAC1DzgD,KAAKotG,YAAcH,CACrB,CAEA,IAAIz9C,EAAUxkD,EAAWhF,UAsTzB,OApTAwpD,EAAQlnD,UAAY,SAAmB2C,GASrC,MARwB,kBAAbA,GAAsC,OAAbA,IAClCA,EAAW,CACTkB,KAAMlB,EACN/F,MAAO0H,UAAU,GACjBP,SAAUO,UAAU,KAIjB,IAAI9F,EAAamE,EAAUjL,KAAKotG,YACzC,EAEA59C,EAAQ3hD,QAAU,SAAiBk1B,GACjC,IAAIryB,EAAQ1Q,KAEZ,OAAO,IAAIgtB,SAAQ,SAAUC,EAAStmB,GACpC,GAAkB,oBAAPo8B,EAUX,IAAIj7B,EAAe4I,EAAMpI,UAAU,CACjC6D,KAAM,SAAU/E,GACd,IACE27B,EAAG37B,EAAOwoC,EACZ,CAAE,MAAOhmB,GACPjjB,EAAOijB,GACP9hB,EAAaL,aACf,CACF,EACAvC,MAAOyB,EACP0F,SAAU4gB,SAnBVtmB,EAAO,IAAI85C,UAAU1d,EAAK,uBAI5B,SAAS6M,IACP9nC,EAAaL,cACbwlB,GACF,CAcF,GACF,EAEAuiC,EAAQjnD,IAAM,SAAaw6B,GACzB,IAAIwzC,EAASv2E,KAEb,GAAkB,oBAAP+iC,EAAmB,MAAM,IAAI0d,UAAU1d,EAAK,sBAEvD,OAAO,IADCopE,EAAWnsG,MACZ,EAAM,SAAUiL,GACrB,OAAOsrE,EAAOjuE,UAAU,CACtB6D,KAAM,SAAU/E,GACd,IACEA,EAAQ27B,EAAG37B,EACb,CAAE,MAAOwiB,GACP,OAAO3e,EAAS/F,MAAM0kB,EACxB,CAEA3e,EAASkB,KAAK/E,EAChB,EACAlC,MAAO,SAAU0kB,GACf3e,EAAS/F,MAAM0kB,EACjB,EACAvd,SAAU,WACRpB,EAASoB,UACX,GAEJ,GACF,EAEAmjD,EAAQvnD,OAAS,SAAgB86B,GAC/B,IAAIsqE,EAASrtG,KAEb,GAAkB,oBAAP+iC,EAAmB,MAAM,IAAI0d,UAAU1d,EAAK,sBAEvD,OAAO,IADCopE,EAAWnsG,MACZ,EAAM,SAAUiL,GACrB,OAAOoiG,EAAO/kG,UAAU,CACtB6D,KAAM,SAAU/E,GACd,IACE,IAAK27B,EAAG37B,GAAQ,MAClB,CAAE,MAAOwiB,GACP,OAAO3e,EAAS/F,MAAM0kB,EACxB,CAEA3e,EAASkB,KAAK/E,EAChB,EACAlC,MAAO,SAAU0kB,GACf3e,EAAS/F,MAAM0kB,EACjB,EACAvd,SAAU,WACRpB,EAASoB,UACX,GAEJ,GACF,EAEAmjD,EAAQltC,OAAS,SAAgBygB,GAC/B,IAAIuqE,EAASttG,KAEb,GAAkB,oBAAP+iC,EAAmB,MAAM,IAAI0d,UAAU1d,EAAK,sBACvD,IAAIwqE,EAAIpB,EAAWnsG,MACfwtG,EAAU5gG,UAAU9I,OAAS,EAC7B2jG,GAAW,EAEXgG,EADO7gG,UAAU,GAErB,OAAO,IAAI2gG,GAAE,SAAUtiG,GACrB,OAAOqiG,EAAOhlG,UAAU,CACtB6D,KAAM,SAAU/E,GACd,IAAI09B,GAAS2iE,EAGb,GAFAA,GAAW,GAEN3iE,GAAS0oE,EACZ,IACEC,EAAM1qE,EAAG0qE,EAAKrmG,EAChB,CAAE,MAAOwiB,GACP,OAAO3e,EAAS/F,MAAM0kB,EACxB,MAEA6jF,EAAMrmG,CAEV,EACAlC,MAAO,SAAU0kB,GACf3e,EAAS/F,MAAM0kB,EACjB,EACAvd,SAAU,WACR,IAAKo7F,IAAa+F,EAAS,OAAOviG,EAAS/F,MAAM,IAAIu7C,UAAU,oCAC/Dx1C,EAASkB,KAAKshG,GACdxiG,EAASoB,UACX,GAEJ,GACF,EAEAmjD,EAAQ57C,OAAS,WAGf,IAFA,IAAI85F,EAAS1tG,KAEJ2tG,EAAO/gG,UAAU9I,OAAQgsB,EAAU,IAAI5c,MAAMy6F,GAAOn5D,EAAO,EAAGA,EAAOm5D,EAAMn5D,IAClF1kB,EAAQ0kB,GAAQ5nC,UAAU4nC,GAG5B,IAAI+4D,EAAIpB,EAAWnsG,MACnB,OAAO,IAAIutG,GAAE,SAAUtiG,GACrB,IAAInD,EACAojC,EAAQ,EAsBZ,OApBA,SAAS0iE,EAAUzhG,GACjBrE,EAAeqE,EAAK7D,UAAU,CAC5B6D,KAAM,SAAUs6B,GACdx7B,EAASkB,KAAKs6B,EAChB,EACAvhC,MAAO,SAAU0kB,GACf3e,EAAS/F,MAAM0kB,EACjB,EACAvd,SAAU,WACJ6+B,IAAUpb,EAAQhsB,QACpBgE,OAAeqB,EACf8B,EAASoB,YAETuhG,EAAUL,EAAE17F,KAAKie,EAAQob,MAE7B,GAEJ,CAEA0iE,CAAUF,GACH,WACD5lG,IACFA,EAAaL,cACbK,OAAeqB,EAEnB,CACF,GACF,EAEAqmD,EAAQq+C,QAAU,SAAiB9qE,GACjC,IAAI+qE,EAAS9tG,KAEb,GAAkB,oBAAP+iC,EAAmB,MAAM,IAAI0d,UAAU1d,EAAK,sBACvD,IAAIwqE,EAAIpB,EAAWnsG,MACnB,OAAO,IAAIutG,GAAE,SAAUtiG,GACrB,IAAI9G,EAAgB,GAEhB4pG,EAAQD,EAAOxlG,UAAU,CAC3B6D,KAAM,SAAU/E,GACd,GAAI27B,EACF,IACE37B,EAAQ27B,EAAG37B,EACb,CAAE,MAAOwiB,GACP,OAAO3e,EAAS/F,MAAM0kB,EACxB,CAGF,IAAIokF,EAAQT,EAAE17F,KAAKzK,GAAOkB,UAAU,CAClC6D,KAAM,SAAU/E,GACd6D,EAASkB,KAAK/E,EAChB,EACAlC,MAAO,SAAU0kB,GACf3e,EAAS/F,MAAM0kB,EACjB,EACAvd,SAAU,WACR,IAAIK,EAAIvI,EAAcJ,QAAQiqG,GAC1BthG,GAAK,GAAGvI,EAAcwhB,OAAOjZ,EAAG,GACpCuhG,GACF,IAEF9pG,EAAcjE,KAAK8tG,EACrB,EACA9oG,MAAO,SAAU0kB,GACf3e,EAAS/F,MAAM0kB,EACjB,EACAvd,SAAU,WACR4hG,GACF,IAGF,SAASA,IACHF,EAAMzhG,QAAmC,IAAzBnI,EAAcL,QAAcmH,EAASoB,UAC3D,CAEA,OAAO,WACLlI,EAAc0J,SAAQ,SAAU3F,GAC9B,OAAOA,EAAET,aACX,IACAsmG,EAAMtmG,aACR,CACF,GACF,EAEA+nD,EAAQw8C,GAAoB,WAC1B,OAAOhsG,IACT,EAEAgL,EAAW6G,KAAO,SAAcy7B,GAC9B,IAAIigE,EAAoB,oBAATvtG,KAAsBA,KAAOgL,EAC5C,GAAS,MAALsiC,EAAW,MAAM,IAAImT,UAAUnT,EAAI,qBACvC,IAAI1c,EAASs7E,EAAU5+D,EAAG0+D,GAE1B,GAAIp7E,EAAQ,CACV,IAAI9B,EAAa8B,EAAOprB,KAAK8nC,GAC7B,GAAIjiC,OAAOyjB,KAAgBA,EAAY,MAAM,IAAI2xB,UAAU3xB,EAAa,qBACxE,OAAIu9E,EAAav9E,IAAeA,EAAWruB,cAAgB8sG,EAAUz+E,EAC9D,IAAIy+E,GAAE,SAAUtiG,GACrB,OAAO6jB,EAAWxmB,UAAU2C,EAC9B,GACF,CAEA,GAAI4gG,EAAU,cACZj7E,EAASs7E,EAAU5+D,EAAGy+D,IAGpB,OAAO,IAAIwB,GAAE,SAAUtiG,GACrBshG,GAAQ,WACN,IAAIthG,EAASqB,OAAb,CAEA,IAAK,IAAiE4hG,EAA7DC,EAAY9C,EAAgCz6E,EAAOprB,KAAK8nC,MAAc4gE,EAAQC,KAAav+D,MAAO,CACzG,IAAI56B,EAAOk5F,EAAM9mG,MAEjB,GADA6D,EAASkB,KAAK6I,GACV/J,EAASqB,OAAQ,MACvB,CAEArB,EAASoB,UARkB,CAS7B,GACF,IAIJ,GAAI6G,MAAMC,QAAQm6B,GAChB,OAAO,IAAIigE,GAAE,SAAUtiG,GACrBshG,GAAQ,WACN,IAAIthG,EAASqB,OAAb,CAEA,IAAK,IAAII,EAAI,EAAGA,EAAI4gC,EAAExpC,SAAU4I,EAE9B,GADAzB,EAASkB,KAAKmhC,EAAE5gC,IACZzB,EAASqB,OAAQ,OAGvBrB,EAASoB,UAPkB,CAQ7B,GACF,IAGF,MAAM,IAAIo0C,UAAUnT,EAAI,qBAC1B,EAEAtiC,EAAWi0B,GAAK,WACd,IAAK,IAAImvE,EAAQxhG,UAAU9I,OAAQ4vD,EAAQ,IAAIxgD,MAAMk7F,GAAQC,EAAQ,EAAGA,EAAQD,EAAOC,IACrF36C,EAAM26C,GAASzhG,UAAUyhG,GAI3B,OAAO,IADiB,oBAATruG,KAAsBA,KAAOgL,IAC/B,SAAUC,GACrBshG,GAAQ,WACN,IAAIthG,EAASqB,OAAb,CAEA,IAAK,IAAII,EAAI,EAAGA,EAAIgnD,EAAM5vD,SAAU4I,EAElC,GADAzB,EAASkB,KAAKunD,EAAMhnD,IAChBzB,EAASqB,OAAQ,OAGvBrB,EAASoB,UAPkB,CAQ7B,GACF,GACF,EAEA09C,EAAa/+C,EAAY,KAAM,CAAC,CAC9B7D,IAAK8kG,EACLz9F,IAAK,WACH,OAAOxO,IACT,KAGKgL,CACT,CA9T8B,GAgU1B4gG,KACFvgG,OAAOm3B,eAAex3B,EAAYg3B,OAAO,cAAe,CACtD56B,MAAO,CACLknG,OAAQtC,EACRM,gBAAiBA,GAEnB5pE,cAAc,G","sources":["webpack://nodalview/./node_modules/@rails/actioncable/app/assets/javascripts/actioncable.esm.js","webpack://nodalview/./node_modules/graphql-ruby-client/subscriptions/ActionCableLink.js","webpack://nodalview/./node_modules/graphql-tag/node_modules/tslib/tslib.es6.js","webpack://nodalview/./node_modules/graphql-tag/lib/index.js","webpack://nodalview/./node_modules/@apollo/client/cache/core/cache.js","webpack://nodalview/./node_modules/@apollo/client/cache/core/types/common.js","webpack://nodalview/./node_modules/@apollo/client/cache/inmemory/helpers.js","webpack://nodalview/./node_modules/@apollo/client/cache/inmemory/entityStore.js","webpack://nodalview/./node_modules/@apollo/client/cache/inmemory/object-canon.js","webpack://nodalview/./node_modules/@apollo/client/cache/inmemory/readFromStore.js","webpack://nodalview/./node_modules/@apollo/client/cache/inmemory/key-extractor.js","webpack://nodalview/./node_modules/@apollo/client/cache/inmemory/policies.js","webpack://nodalview/./node_modules/@apollo/client/cache/inmemory/writeToStore.js","webpack://nodalview/./node_modules/@apollo/client/cache/inmemory/inMemoryCache.js","webpack://nodalview/./node_modules/@apollo/client/cache/inmemory/reactiveVars.js","webpack://nodalview/./node_modules/@apollo/client/utilities/observables/asyncMap.js","webpack://nodalview/./node_modules/@apollo/client/utilities/common/errorHandling.js","webpack://nodalview/./node_modules/@apollo/client/utilities/observables/Concast.js","webpack://nodalview/./node_modules/@apollo/client/core/LocalState.js","webpack://nodalview/./node_modules/@apollo/client/core/QueryInfo.js","webpack://nodalview/./node_modules/@apollo/client/core/QueryManager.js","webpack://nodalview/./node_modules/@apollo/client/core/ApolloClient.js","webpack://nodalview/./node_modules/@apollo/client/core/equalByQuery.js","webpack://nodalview/./node_modules/@apollo/client/core/ObservableQuery.js","webpack://nodalview/./node_modules/@apollo/client/cache/core/types/Cache.js","webpack://nodalview/./node_modules/@apollo/client/link/core/empty.js","webpack://nodalview/./node_modules/@apollo/client/link/core/from.js","webpack://nodalview/./node_modules/@apollo/client/link/core/concat.js","webpack://nodalview/./node_modules/@apollo/client/link/http/createSignalIfSupported.js","webpack://nodalview/./node_modules/@apollo/client/link/utils/toPromise.js","webpack://nodalview/./node_modules/@apollo/client/link/utils/fromPromise.js","webpack://nodalview/./node_modules/@apollo/client/core/index.js","webpack://nodalview/./node_modules/@apollo/client/link/batch/batching.js","webpack://nodalview/./node_modules/@apollo/client/link/batch/batchLink.js","webpack://nodalview/./node_modules/@apollo/client/link/batch-http/batchHttpLink.js","webpack://nodalview/./node_modules/@apollo/client/link/core/ApolloLink.js","webpack://nodalview/./node_modules/@apollo/client/link/utils/createOperation.js","webpack://nodalview/./node_modules/@apollo/client/link/utils/transformOperation.js","webpack://nodalview/./node_modules/@apollo/client/link/utils/validateOperation.js","webpack://nodalview/./node_modules/@apollo/client/link/core/execute.js","webpack://nodalview/./node_modules/@apollo/client/link/core/split.js","webpack://nodalview/./node_modules/@apollo/client/link/error/index.js","webpack://nodalview/./node_modules/@apollo/client/link/http/HttpLink.js","webpack://nodalview/./node_modules/@apollo/client/link/http/checkFetcher.js","webpack://nodalview/./node_modules/@apollo/client/link/http/createHttpLink.js","webpack://nodalview/./node_modules/@apollo/client/link/http/iterators/nodeStream.js","webpack://nodalview/./node_modules/@apollo/client/link/http/iterators/reader.js","webpack://nodalview/./node_modules/@apollo/client/link/http/responseIterator.js","webpack://nodalview/./node_modules/@apollo/client/link/http/iterators/async.js","webpack://nodalview/./node_modules/@apollo/client/link/http/iterators/promise.js","webpack://nodalview/./node_modules/@apollo/client/link/http/parseAndCheckHttpResponse.js","webpack://nodalview/./node_modules/@apollo/client/link/http/rewriteURIForGET.js","webpack://nodalview/./node_modules/@apollo/client/link/http/selectHttpOptionsAndBody.js","webpack://nodalview/./node_modules/@apollo/client/link/http/selectURI.js","webpack://nodalview/./node_modules/@apollo/client/link/http/serializeFetchParameter.js","webpack://nodalview/./node_modules/@apollo/client/link/utils/filterOperationVariables.js","webpack://nodalview/./node_modules/@apollo/client/link/utils/fromError.js","webpack://nodalview/./node_modules/@apollo/client/link/utils/throwServerError.js","webpack://nodalview/./node_modules/@apollo/client/utilities/common/canonicalStringify.js","webpack://nodalview/./node_modules/@apollo/client/utilities/common/cloneDeep.js","webpack://nodalview/./node_modules/@apollo/client/utilities/common/incrementalResult.js","webpack://nodalview/./node_modules/@apollo/client/utilities/common/mergeDeep.js","webpack://nodalview/./node_modules/@apollo/client/utilities/graphql/DocumentTransform.js","webpack://nodalview/./node_modules/@apollo/client/utilities/graphql/directives.js","webpack://nodalview/./node_modules/@apollo/client/utilities/graphql/fragments.js","webpack://nodalview/./node_modules/@apollo/client/utilities/graphql/getFromAST.js","webpack://nodalview/./node_modules/@apollo/client/utilities/graphql/print.js","webpack://nodalview/./node_modules/@apollo/client/utilities/graphql/storeUtils.js","webpack://nodalview/./node_modules/@apollo/client/utilities/graphql/transform.js","webpack://nodalview/./node_modules/@apollo/client/utilities/observables/iteration.js","webpack://nodalview/./node_modules/@apollo/client/utilities/observables/subclassing.js","webpack://nodalview/./node_modules/@wry/trie/lib/index.js","webpack://nodalview/./node_modules/graphql/error/GraphQLError.mjs","webpack://nodalview/./node_modules/graphql/error/syntaxError.mjs","webpack://nodalview/./node_modules/graphql/version.mjs","webpack://nodalview/./node_modules/graphql/jsutils/isPromise.mjs","webpack://nodalview/./node_modules/graphql/polyfills/find.mjs","webpack://nodalview/./node_modules/graphql/polyfills/objectValues.mjs","webpack://nodalview/./node_modules/graphql/error/locatedError.mjs","webpack://nodalview/./node_modules/graphql/utilities/assertValidName.mjs","webpack://nodalview/./node_modules/graphql/polyfills/objectEntries.mjs","webpack://nodalview/./node_modules/graphql/jsutils/keyMap.mjs","webpack://nodalview/./node_modules/graphql/jsutils/mapValue.mjs","webpack://nodalview/./node_modules/graphql/jsutils/toObjMap.mjs","webpack://nodalview/./node_modules/graphql/jsutils/keyValMap.mjs","webpack://nodalview/./node_modules/graphql/jsutils/didYouMean.mjs","webpack://nodalview/./node_modules/graphql/jsutils/identityFunc.mjs","webpack://nodalview/./node_modules/graphql/jsutils/naturalCompare.mjs","webpack://nodalview/./node_modules/graphql/jsutils/suggestionList.mjs","webpack://nodalview/./node_modules/graphql/utilities/valueFromASTUntyped.mjs","webpack://nodalview/./node_modules/graphql/type/definition.mjs","webpack://nodalview/./node_modules/graphql/utilities/typeComparators.mjs","webpack://nodalview/./node_modules/graphql/polyfills/arrayFrom.mjs","webpack://nodalview/./node_modules/graphql/polyfills/isFinite.mjs","webpack://nodalview/./node_modules/graphql/jsutils/safeArrayFrom.mjs","webpack://nodalview/./node_modules/graphql/polyfills/isInteger.mjs","webpack://nodalview/./node_modules/graphql/type/scalars.mjs","webpack://nodalview/./node_modules/graphql/utilities/astFromValue.mjs","webpack://nodalview/./node_modules/graphql/type/introspection.mjs","webpack://nodalview/./node_modules/graphql/type/directives.mjs","webpack://nodalview/./node_modules/graphql/type/schema.mjs","webpack://nodalview/./node_modules/graphql/type/validate.mjs","webpack://nodalview/./node_modules/graphql/utilities/typeFromAST.mjs","webpack://nodalview/./node_modules/graphql/utilities/TypeInfo.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/ExecutableDefinitionsRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/UniqueOperationNamesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/LoneAnonymousOperationRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/SingleFieldSubscriptionsRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/KnownTypeNamesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/FragmentsOnCompositeTypesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/VariablesAreInputTypesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/ScalarLeafsRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/FieldsOnCorrectTypeRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/UniqueFragmentNamesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/KnownFragmentNamesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/NoUnusedFragmentsRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/PossibleFragmentSpreadsRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/NoFragmentCyclesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/UniqueVariableNamesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/NoUndefinedVariablesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/NoUnusedVariablesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/KnownDirectivesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/UniqueDirectivesPerLocationRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/KnownArgumentNamesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/UniqueArgumentNamesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/ValuesOfCorrectTypeRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/ProvidedRequiredArgumentsRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/VariablesInAllowedPositionRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/OverlappingFieldsCanBeMergedRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/PossibleTypeExtensionsRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/UniqueInputFieldNamesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/LoneSchemaDefinitionRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/UniqueOperationTypesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/UniqueTypeNamesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/UniqueEnumValueNamesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/UniqueFieldDefinitionNamesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/UniqueDirectiveNamesRule.mjs","webpack://nodalview/./node_modules/graphql/validation/specifiedRules.mjs","webpack://nodalview/./node_modules/graphql/validation/ValidationContext.mjs","webpack://nodalview/./node_modules/graphql/validation/validate.mjs","webpack://nodalview/./node_modules/graphql/jsutils/Path.mjs","webpack://nodalview/./node_modules/graphql/utilities/getOperationRootType.mjs","webpack://nodalview/./node_modules/graphql/jsutils/printPathArray.mjs","webpack://nodalview/./node_modules/graphql/utilities/valueFromAST.mjs","webpack://nodalview/./node_modules/graphql/utilities/coerceInputValue.mjs","webpack://nodalview/./node_modules/graphql/execution/values.mjs","webpack://nodalview/./node_modules/graphql/execution/execute.mjs","webpack://nodalview/./node_modules/graphql/jsutils/promiseReduce.mjs","webpack://nodalview/./node_modules/graphql/jsutils/promiseForObject.mjs","webpack://nodalview/./node_modules/graphql/jsutils/memoize3.mjs","webpack://nodalview/./node_modules/graphql/graphql.mjs","webpack://nodalview/./node_modules/graphql/jsutils/isAsyncIterable.mjs","webpack://nodalview/./node_modules/graphql/subscription/mapAsyncIterator.mjs","webpack://nodalview/./node_modules/graphql/subscription/subscribe.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/custom/NoDeprecatedCustomRule.mjs","webpack://nodalview/./node_modules/graphql/validation/rules/custom/NoSchemaIntrospectionCustomRule.mjs","webpack://nodalview/./node_modules/graphql/error/formatError.mjs","webpack://nodalview/./node_modules/graphql/utilities/getIntrospectionQuery.mjs","webpack://nodalview/./node_modules/graphql/utilities/getOperationAST.mjs","webpack://nodalview/./node_modules/graphql/utilities/introspectionFromSchema.mjs","webpack://nodalview/./node_modules/graphql/utilities/buildClientSchema.mjs","webpack://nodalview/./node_modules/graphql/utilities/extendSchema.mjs","webpack://nodalview/./node_modules/graphql/utilities/buildASTSchema.mjs","webpack://nodalview/./node_modules/graphql/utilities/lexicographicSortSchema.mjs","webpack://nodalview/./node_modules/graphql/utilities/printSchema.mjs","webpack://nodalview/./node_modules/graphql/utilities/concatAST.mjs","webpack://nodalview/./node_modules/graphql/utilities/separateOperations.mjs","webpack://nodalview/./node_modules/graphql/utilities/stripIgnoredCharacters.mjs","webpack://nodalview/./node_modules/graphql/utilities/findBreakingChanges.mjs","webpack://nodalview/./node_modules/graphql/utilities/findDeprecatedUsages.mjs","webpack://nodalview/./node_modules/graphql/jsutils/defineInspect.mjs","webpack://nodalview/./node_modules/graphql/jsutils/devAssert.mjs","webpack://nodalview/./node_modules/graphql/jsutils/inspect.mjs","webpack://nodalview/./node_modules/graphql/jsutils/instanceOf.mjs","webpack://nodalview/./node_modules/graphql/jsutils/invariant.mjs","webpack://nodalview/./node_modules/graphql/jsutils/isObjectLike.mjs","webpack://nodalview/./node_modules/graphql/jsutils/nodejsCustomInspectSymbol.mjs","webpack://nodalview/./node_modules/graphql/language/ast.mjs","webpack://nodalview/./node_modules/graphql/language/blockString.mjs","webpack://nodalview/./node_modules/graphql/language/directiveLocation.mjs","webpack://nodalview/./node_modules/graphql/language/kinds.mjs","webpack://nodalview/./node_modules/graphql/language/lexer.mjs","webpack://nodalview/./node_modules/graphql/language/location.mjs","webpack://nodalview/./node_modules/graphql/language/parser.mjs","webpack://nodalview/./node_modules/graphql/language/predicates.mjs","webpack://nodalview/./node_modules/graphql/language/printLocation.mjs","webpack://nodalview/./node_modules/graphql/language/printer.mjs","webpack://nodalview/./node_modules/graphql/language/source.mjs","webpack://nodalview/./node_modules/graphql/language/tokenKind.mjs","webpack://nodalview/./node_modules/graphql/language/visitor.mjs","webpack://nodalview/./node_modules/graphql/polyfills/symbols.mjs","webpack://nodalview/./node_modules/optimism/node_modules/@wry/trie/lib/index.js","webpack://nodalview/./node_modules/@wry/context/lib/context.esm.js","webpack://nodalview/./node_modules/optimism/lib/context.js","webpack://nodalview/./node_modules/optimism/lib/helpers.js","webpack://nodalview/./node_modules/optimism/lib/entry.js","webpack://nodalview/./node_modules/optimism/lib/dep.js","webpack://nodalview/./node_modules/optimism/lib/index.js","webpack://nodalview/./node_modules/zen-observable-ts/module.js"],"sourcesContent":["var adapters = {\n  logger: self.console,\n  WebSocket: self.WebSocket\n};\n\nvar logger = {\n  log(...messages) {\n    if (this.enabled) {\n      messages.push(Date.now());\n      adapters.logger.log(\"[ActionCable]\", ...messages);\n    }\n  }\n};\n\nconst now = () => (new Date).getTime();\n\nconst secondsSince = time => (now() - time) / 1e3;\n\nclass ConnectionMonitor {\n  constructor(connection) {\n    this.visibilityDidChange = this.visibilityDidChange.bind(this);\n    this.connection = connection;\n    this.reconnectAttempts = 0;\n  }\n  start() {\n    if (!this.isRunning()) {\n      this.startedAt = now();\n      delete this.stoppedAt;\n      this.startPolling();\n      addEventListener(\"visibilitychange\", this.visibilityDidChange);\n      logger.log(`ConnectionMonitor started. stale threshold = ${this.constructor.staleThreshold} s`);\n    }\n  }\n  stop() {\n    if (this.isRunning()) {\n      this.stoppedAt = now();\n      this.stopPolling();\n      removeEventListener(\"visibilitychange\", this.visibilityDidChange);\n      logger.log(\"ConnectionMonitor stopped\");\n    }\n  }\n  isRunning() {\n    return this.startedAt && !this.stoppedAt;\n  }\n  recordPing() {\n    this.pingedAt = now();\n  }\n  recordConnect() {\n    this.reconnectAttempts = 0;\n    this.recordPing();\n    delete this.disconnectedAt;\n    logger.log(\"ConnectionMonitor recorded connect\");\n  }\n  recordDisconnect() {\n    this.disconnectedAt = now();\n    logger.log(\"ConnectionMonitor recorded disconnect\");\n  }\n  startPolling() {\n    this.stopPolling();\n    this.poll();\n  }\n  stopPolling() {\n    clearTimeout(this.pollTimeout);\n  }\n  poll() {\n    this.pollTimeout = setTimeout((() => {\n      this.reconnectIfStale();\n      this.poll();\n    }), this.getPollInterval());\n  }\n  getPollInterval() {\n    const {staleThreshold: staleThreshold, reconnectionBackoffRate: reconnectionBackoffRate} = this.constructor;\n    const backoff = Math.pow(1 + reconnectionBackoffRate, Math.min(this.reconnectAttempts, 10));\n    const jitterMax = this.reconnectAttempts === 0 ? 1 : reconnectionBackoffRate;\n    const jitter = jitterMax * Math.random();\n    return staleThreshold * 1e3 * backoff * (1 + jitter);\n  }\n  reconnectIfStale() {\n    if (this.connectionIsStale()) {\n      logger.log(`ConnectionMonitor detected stale connection. reconnectAttempts = ${this.reconnectAttempts}, time stale = ${secondsSince(this.refreshedAt)} s, stale threshold = ${this.constructor.staleThreshold} s`);\n      this.reconnectAttempts++;\n      if (this.disconnectedRecently()) {\n        logger.log(`ConnectionMonitor skipping reopening recent disconnect. time disconnected = ${secondsSince(this.disconnectedAt)} s`);\n      } else {\n        logger.log(\"ConnectionMonitor reopening\");\n        this.connection.reopen();\n      }\n    }\n  }\n  get refreshedAt() {\n    return this.pingedAt ? this.pingedAt : this.startedAt;\n  }\n  connectionIsStale() {\n    return secondsSince(this.refreshedAt) > this.constructor.staleThreshold;\n  }\n  disconnectedRecently() {\n    return this.disconnectedAt && secondsSince(this.disconnectedAt) < this.constructor.staleThreshold;\n  }\n  visibilityDidChange() {\n    if (document.visibilityState === \"visible\") {\n      setTimeout((() => {\n        if (this.connectionIsStale() || !this.connection.isOpen()) {\n          logger.log(`ConnectionMonitor reopening stale connection on visibilitychange. visibilityState = ${document.visibilityState}`);\n          this.connection.reopen();\n        }\n      }), 200);\n    }\n  }\n}\n\nConnectionMonitor.staleThreshold = 6;\n\nConnectionMonitor.reconnectionBackoffRate = .15;\n\nvar INTERNAL = {\n  message_types: {\n    welcome: \"welcome\",\n    disconnect: \"disconnect\",\n    ping: \"ping\",\n    confirmation: \"confirm_subscription\",\n    rejection: \"reject_subscription\"\n  },\n  disconnect_reasons: {\n    unauthorized: \"unauthorized\",\n    invalid_request: \"invalid_request\",\n    server_restart: \"server_restart\"\n  },\n  default_mount_path: \"/cable\",\n  protocols: [ \"actioncable-v1-json\", \"actioncable-unsupported\" ]\n};\n\nconst {message_types: message_types, protocols: protocols} = INTERNAL;\n\nconst supportedProtocols = protocols.slice(0, protocols.length - 1);\n\nconst indexOf = [].indexOf;\n\nclass Connection {\n  constructor(consumer) {\n    this.open = this.open.bind(this);\n    this.consumer = consumer;\n    this.subscriptions = this.consumer.subscriptions;\n    this.monitor = new ConnectionMonitor(this);\n    this.disconnected = true;\n  }\n  send(data) {\n    if (this.isOpen()) {\n      this.webSocket.send(JSON.stringify(data));\n      return true;\n    } else {\n      return false;\n    }\n  }\n  open() {\n    if (this.isActive()) {\n      logger.log(`Attempted to open WebSocket, but existing socket is ${this.getState()}`);\n      return false;\n    } else {\n      logger.log(`Opening WebSocket, current state is ${this.getState()}, subprotocols: ${protocols}`);\n      if (this.webSocket) {\n        this.uninstallEventHandlers();\n      }\n      this.webSocket = new adapters.WebSocket(this.consumer.url, protocols);\n      this.installEventHandlers();\n      this.monitor.start();\n      return true;\n    }\n  }\n  close({allowReconnect: allowReconnect} = {\n    allowReconnect: true\n  }) {\n    if (!allowReconnect) {\n      this.monitor.stop();\n    }\n    if (this.isOpen()) {\n      return this.webSocket.close();\n    }\n  }\n  reopen() {\n    logger.log(`Reopening WebSocket, current state is ${this.getState()}`);\n    if (this.isActive()) {\n      try {\n        return this.close();\n      } catch (error) {\n        logger.log(\"Failed to reopen WebSocket\", error);\n      } finally {\n        logger.log(`Reopening WebSocket in ${this.constructor.reopenDelay}ms`);\n        setTimeout(this.open, this.constructor.reopenDelay);\n      }\n    } else {\n      return this.open();\n    }\n  }\n  getProtocol() {\n    if (this.webSocket) {\n      return this.webSocket.protocol;\n    }\n  }\n  isOpen() {\n    return this.isState(\"open\");\n  }\n  isActive() {\n    return this.isState(\"open\", \"connecting\");\n  }\n  isProtocolSupported() {\n    return indexOf.call(supportedProtocols, this.getProtocol()) >= 0;\n  }\n  isState(...states) {\n    return indexOf.call(states, this.getState()) >= 0;\n  }\n  getState() {\n    if (this.webSocket) {\n      for (let state in adapters.WebSocket) {\n        if (adapters.WebSocket[state] === this.webSocket.readyState) {\n          return state.toLowerCase();\n        }\n      }\n    }\n    return null;\n  }\n  installEventHandlers() {\n    for (let eventName in this.events) {\n      const handler = this.events[eventName].bind(this);\n      this.webSocket[`on${eventName}`] = handler;\n    }\n  }\n  uninstallEventHandlers() {\n    for (let eventName in this.events) {\n      this.webSocket[`on${eventName}`] = function() {};\n    }\n  }\n}\n\nConnection.reopenDelay = 500;\n\nConnection.prototype.events = {\n  message(event) {\n    if (!this.isProtocolSupported()) {\n      return;\n    }\n    const {identifier: identifier, message: message, reason: reason, reconnect: reconnect, type: type} = JSON.parse(event.data);\n    switch (type) {\n     case message_types.welcome:\n      this.monitor.recordConnect();\n      return this.subscriptions.reload();\n\n     case message_types.disconnect:\n      logger.log(`Disconnecting. Reason: ${reason}`);\n      return this.close({\n        allowReconnect: reconnect\n      });\n\n     case message_types.ping:\n      return this.monitor.recordPing();\n\n     case message_types.confirmation:\n      this.subscriptions.confirmSubscription(identifier);\n      return this.subscriptions.notify(identifier, \"connected\");\n\n     case message_types.rejection:\n      return this.subscriptions.reject(identifier);\n\n     default:\n      return this.subscriptions.notify(identifier, \"received\", message);\n    }\n  },\n  open() {\n    logger.log(`WebSocket onopen event, using '${this.getProtocol()}' subprotocol`);\n    this.disconnected = false;\n    if (!this.isProtocolSupported()) {\n      logger.log(\"Protocol is unsupported. Stopping monitor and disconnecting.\");\n      return this.close({\n        allowReconnect: false\n      });\n    }\n  },\n  close(event) {\n    logger.log(\"WebSocket onclose event\");\n    if (this.disconnected) {\n      return;\n    }\n    this.disconnected = true;\n    this.monitor.recordDisconnect();\n    return this.subscriptions.notifyAll(\"disconnected\", {\n      willAttemptReconnect: this.monitor.isRunning()\n    });\n  },\n  error() {\n    logger.log(\"WebSocket onerror event\");\n  }\n};\n\nconst extend = function(object, properties) {\n  if (properties != null) {\n    for (let key in properties) {\n      const value = properties[key];\n      object[key] = value;\n    }\n  }\n  return object;\n};\n\nclass Subscription {\n  constructor(consumer, params = {}, mixin) {\n    this.consumer = consumer;\n    this.identifier = JSON.stringify(params);\n    extend(this, mixin);\n  }\n  perform(action, data = {}) {\n    data.action = action;\n    return this.send(data);\n  }\n  send(data) {\n    return this.consumer.send({\n      command: \"message\",\n      identifier: this.identifier,\n      data: JSON.stringify(data)\n    });\n  }\n  unsubscribe() {\n    return this.consumer.subscriptions.remove(this);\n  }\n}\n\nclass SubscriptionGuarantor {\n  constructor(subscriptions) {\n    this.subscriptions = subscriptions;\n    this.pendingSubscriptions = [];\n  }\n  guarantee(subscription) {\n    if (this.pendingSubscriptions.indexOf(subscription) == -1) {\n      logger.log(`SubscriptionGuarantor guaranteeing ${subscription.identifier}`);\n      this.pendingSubscriptions.push(subscription);\n    } else {\n      logger.log(`SubscriptionGuarantor already guaranteeing ${subscription.identifier}`);\n    }\n    this.startGuaranteeing();\n  }\n  forget(subscription) {\n    logger.log(`SubscriptionGuarantor forgetting ${subscription.identifier}`);\n    this.pendingSubscriptions = this.pendingSubscriptions.filter((s => s !== subscription));\n  }\n  startGuaranteeing() {\n    this.stopGuaranteeing();\n    this.retrySubscribing();\n  }\n  stopGuaranteeing() {\n    clearTimeout(this.retryTimeout);\n  }\n  retrySubscribing() {\n    this.retryTimeout = setTimeout((() => {\n      if (this.subscriptions && typeof this.subscriptions.subscribe === \"function\") {\n        this.pendingSubscriptions.map((subscription => {\n          logger.log(`SubscriptionGuarantor resubscribing ${subscription.identifier}`);\n          this.subscriptions.subscribe(subscription);\n        }));\n      }\n    }), 500);\n  }\n}\n\nclass Subscriptions {\n  constructor(consumer) {\n    this.consumer = consumer;\n    this.guarantor = new SubscriptionGuarantor(this);\n    this.subscriptions = [];\n  }\n  create(channelName, mixin) {\n    const channel = channelName;\n    const params = typeof channel === \"object\" ? channel : {\n      channel: channel\n    };\n    const subscription = new Subscription(this.consumer, params, mixin);\n    return this.add(subscription);\n  }\n  add(subscription) {\n    this.subscriptions.push(subscription);\n    this.consumer.ensureActiveConnection();\n    this.notify(subscription, \"initialized\");\n    this.subscribe(subscription);\n    return subscription;\n  }\n  remove(subscription) {\n    this.forget(subscription);\n    if (!this.findAll(subscription.identifier).length) {\n      this.sendCommand(subscription, \"unsubscribe\");\n    }\n    return subscription;\n  }\n  reject(identifier) {\n    return this.findAll(identifier).map((subscription => {\n      this.forget(subscription);\n      this.notify(subscription, \"rejected\");\n      return subscription;\n    }));\n  }\n  forget(subscription) {\n    this.guarantor.forget(subscription);\n    this.subscriptions = this.subscriptions.filter((s => s !== subscription));\n    return subscription;\n  }\n  findAll(identifier) {\n    return this.subscriptions.filter((s => s.identifier === identifier));\n  }\n  reload() {\n    return this.subscriptions.map((subscription => this.subscribe(subscription)));\n  }\n  notifyAll(callbackName, ...args) {\n    return this.subscriptions.map((subscription => this.notify(subscription, callbackName, ...args)));\n  }\n  notify(subscription, callbackName, ...args) {\n    let subscriptions;\n    if (typeof subscription === \"string\") {\n      subscriptions = this.findAll(subscription);\n    } else {\n      subscriptions = [ subscription ];\n    }\n    return subscriptions.map((subscription => typeof subscription[callbackName] === \"function\" ? subscription[callbackName](...args) : undefined));\n  }\n  subscribe(subscription) {\n    if (this.sendCommand(subscription, \"subscribe\")) {\n      this.guarantor.guarantee(subscription);\n    }\n  }\n  confirmSubscription(identifier) {\n    logger.log(`Subscription confirmed ${identifier}`);\n    this.findAll(identifier).map((subscription => this.guarantor.forget(subscription)));\n  }\n  sendCommand(subscription, command) {\n    const {identifier: identifier} = subscription;\n    return this.consumer.send({\n      command: command,\n      identifier: identifier\n    });\n  }\n}\n\nclass Consumer {\n  constructor(url) {\n    this._url = url;\n    this.subscriptions = new Subscriptions(this);\n    this.connection = new Connection(this);\n  }\n  get url() {\n    return createWebSocketURL(this._url);\n  }\n  send(data) {\n    return this.connection.send(data);\n  }\n  connect() {\n    return this.connection.open();\n  }\n  disconnect() {\n    return this.connection.close({\n      allowReconnect: false\n    });\n  }\n  ensureActiveConnection() {\n    if (!this.connection.isActive()) {\n      return this.connection.open();\n    }\n  }\n}\n\nfunction createWebSocketURL(url) {\n  if (typeof url === \"function\") {\n    url = url();\n  }\n  if (url && !/^wss?:/i.test(url)) {\n    const a = document.createElement(\"a\");\n    a.href = url;\n    a.href = a.href;\n    a.protocol = a.protocol.replace(\"http\", \"ws\");\n    return a.href;\n  } else {\n    return url;\n  }\n}\n\nfunction createConsumer(url = getConfig(\"url\") || INTERNAL.default_mount_path) {\n  return new Consumer(url);\n}\n\nfunction getConfig(name) {\n  const element = document.head.querySelector(`meta[name='action-cable-${name}']`);\n  if (element) {\n    return element.getAttribute(\"content\");\n  }\n}\n\nexport { Connection, ConnectionMonitor, Consumer, INTERNAL, Subscription, SubscriptionGuarantor, Subscriptions, adapters, createConsumer, createWebSocketURL, getConfig, logger };\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst core_1 = require(\"@apollo/client/core\");\nconst graphql_1 = require(\"graphql\");\nclass ActionCableLink extends core_1.ApolloLink {\n    constructor(options) {\n        super();\n        this.cable = options.cable;\n        this.channelName = options.channelName || \"GraphqlChannel\";\n        this.actionName = options.actionName || \"execute\";\n        this.connectionParams = options.connectionParams || {};\n    }\n    // Interestingly, this link does _not_ call through to `next` because\n    // instead, it sends the request to ActionCable.\n    request(operation, _next) {\n        return new core_1.Observable((observer) => {\n            var channelId = Math.round(Date.now() + Math.random() * 100000).toString(16);\n            var actionName = this.actionName;\n            var connectionParams = (typeof this.connectionParams === \"function\") ?\n                this.connectionParams(operation) : this.connectionParams;\n            var channel = this.cable.subscriptions.create(Object.assign({}, {\n                channel: this.channelName,\n                channelId: channelId\n            }, connectionParams), {\n                connected: function () {\n                    this.perform(actionName, {\n                        query: operation.query ? (0, graphql_1.print)(operation.query) : null,\n                        variables: operation.variables,\n                        // This is added for persisted operation support:\n                        operationId: operation.operationId,\n                        operationName: operation.operationName\n                    });\n                },\n                received: function (payload) {\n                    var _a, _b;\n                    if (((_a = payload === null || payload === void 0 ? void 0 : payload.result) === null || _a === void 0 ? void 0 : _a.data) || ((_b = payload === null || payload === void 0 ? void 0 : payload.result) === null || _b === void 0 ? void 0 : _b.errors)) {\n                        observer.next(payload.result);\n                    }\n                    if (!payload.more) {\n                        observer.complete();\n                    }\n                }\n            });\n            // Make the ActionCable subscription behave like an Apollo subscription\n            return Object.assign(channel, { closed: false });\n        });\n    }\n}\nexports.default = ActionCableLink;\n","/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n    extendStatics = Object.setPrototypeOf ||\r\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n        function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n    return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n    if (typeof b !== \"function\" && b !== null)\r\n        throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n    extendStatics(d, b);\r\n    function __() { this.constructor = d; }\r\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    }\r\n    return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                t[p[i]] = s[p[i]];\r\n        }\r\n    return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n    return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n    if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n    function verb(n) { return function (v) { return step([n, v]); }; }\r\n    function step(op) {\r\n        if (f) throw new TypeError(\"Generator is already executing.\");\r\n        while (_) try {\r\n            if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n            if (y = 0, t) op = [op[0] & 2, t.value];\r\n            switch (op[0]) {\r\n                case 0: case 1: t = op; break;\r\n                case 4: _.label++; return { value: op[1], done: false };\r\n                case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                default:\r\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                    if (t[2]) _.ops.pop();\r\n                    _.trys.pop(); continue;\r\n            }\r\n            op = body.call(thisArg, _);\r\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n    }\r\n}\r\n\r\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    var desc = Object.getOwnPropertyDescriptor(m, k);\r\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\r\n        desc = { enumerable: true, get: function() { return m[k]; } };\r\n    }\r\n    Object.defineProperty(o, k2, desc);\r\n}) : (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    o[k2] = m[k];\r\n});\r\n\r\nexport function __exportStar(m, o) {\r\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n}\r\n\r\nexport function __values(o) {\r\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n    if (m) return m.call(o);\r\n    if (o && typeof o.length === \"number\") return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n    if (!m) return o;\r\n    var i = m.call(o), r, ar = [], e;\r\n    try {\r\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n    }\r\n    catch (error) { e = { error: error }; }\r\n    finally {\r\n        try {\r\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n        }\r\n        finally { if (e) throw e.error; }\r\n    }\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spread() {\r\n    for (var ar = [], i = 0; i < arguments.length; i++)\r\n        ar = ar.concat(__read(arguments[i]));\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spreadArrays() {\r\n    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n    for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n            r[k] = a[j];\r\n    return r;\r\n}\r\n\r\nexport function __spreadArray(to, from, pack) {\r\n    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\r\n        if (ar || !(i in from)) {\r\n            if (!ar) ar = Array.prototype.slice.call(from, 0, i);\r\n            ar[i] = from[i];\r\n        }\r\n    }\r\n    return to.concat(ar || Array.prototype.slice.call(from));\r\n}\r\n\r\nexport function __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\n    return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n    function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n    if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n    return cooked;\r\n};\r\n\r\nvar __setModuleDefault = Object.create ? (function(o, v) {\r\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n}) : function(o, v) {\r\n    o[\"default\"] = v;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n    if (mod && mod.__esModule) return mod;\r\n    var result = {};\r\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n    __setModuleDefault(result, mod);\r\n    return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n    return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\r\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n}\r\n\r\nexport function __classPrivateFieldIn(state, receiver) {\r\n    if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\r\n    return typeof state === \"function\" ? receiver === state : state.has(receiver);\r\n}\r\n","import { __assign } from \"tslib\";\nimport { parse } from 'graphql';\nvar docCache = new Map();\nvar fragmentSourceMap = new Map();\nvar printFragmentWarnings = true;\nvar experimentalFragmentVariables = false;\nfunction normalize(string) {\n    return string.replace(/[\\s,]+/g, ' ').trim();\n}\nfunction cacheKeyFromLoc(loc) {\n    return normalize(loc.source.body.substring(loc.start, loc.end));\n}\nfunction processFragments(ast) {\n    var seenKeys = new Set();\n    var definitions = [];\n    ast.definitions.forEach(function (fragmentDefinition) {\n        if (fragmentDefinition.kind === 'FragmentDefinition') {\n            var fragmentName = fragmentDefinition.name.value;\n            var sourceKey = cacheKeyFromLoc(fragmentDefinition.loc);\n            var sourceKeySet = fragmentSourceMap.get(fragmentName);\n            if (sourceKeySet && !sourceKeySet.has(sourceKey)) {\n                if (printFragmentWarnings) {\n                    console.warn(\"Warning: fragment with name \" + fragmentName + \" already exists.\\n\"\n                        + \"graphql-tag enforces all fragment names across your application to be unique; read more about\\n\"\n                        + \"this in the docs: http://dev.apollodata.com/core/fragments.html#unique-names\");\n                }\n            }\n            else if (!sourceKeySet) {\n                fragmentSourceMap.set(fragmentName, sourceKeySet = new Set);\n            }\n            sourceKeySet.add(sourceKey);\n            if (!seenKeys.has(sourceKey)) {\n                seenKeys.add(sourceKey);\n                definitions.push(fragmentDefinition);\n            }\n        }\n        else {\n            definitions.push(fragmentDefinition);\n        }\n    });\n    return __assign(__assign({}, ast), { definitions: definitions });\n}\nfunction stripLoc(doc) {\n    var workSet = new Set(doc.definitions);\n    workSet.forEach(function (node) {\n        if (node.loc)\n            delete node.loc;\n        Object.keys(node).forEach(function (key) {\n            var value = node[key];\n            if (value && typeof value === 'object') {\n                workSet.add(value);\n            }\n        });\n    });\n    var loc = doc.loc;\n    if (loc) {\n        delete loc.startToken;\n        delete loc.endToken;\n    }\n    return doc;\n}\nfunction parseDocument(source) {\n    var cacheKey = normalize(source);\n    if (!docCache.has(cacheKey)) {\n        var parsed = parse(source, {\n            experimentalFragmentVariables: experimentalFragmentVariables,\n            allowLegacyFragmentVariables: experimentalFragmentVariables\n        });\n        if (!parsed || parsed.kind !== 'Document') {\n            throw new Error('Not a valid GraphQL document.');\n        }\n        docCache.set(cacheKey, stripLoc(processFragments(parsed)));\n    }\n    return docCache.get(cacheKey);\n}\nexport function gql(literals) {\n    var args = [];\n    for (var _i = 1; _i < arguments.length; _i++) {\n        args[_i - 1] = arguments[_i];\n    }\n    if (typeof literals === 'string') {\n        literals = [literals];\n    }\n    var result = literals[0];\n    args.forEach(function (arg, i) {\n        if (arg && arg.kind === 'Document') {\n            result += arg.loc.source.body;\n        }\n        else {\n            result += arg;\n        }\n        result += literals[i + 1];\n    });\n    return parseDocument(result);\n}\nexport function resetCaches() {\n    docCache.clear();\n    fragmentSourceMap.clear();\n}\nexport function disableFragmentWarnings() {\n    printFragmentWarnings = false;\n}\nexport function enableExperimentalFragmentVariables() {\n    experimentalFragmentVariables = true;\n}\nexport function disableExperimentalFragmentVariables() {\n    experimentalFragmentVariables = false;\n}\nvar extras = {\n    gql: gql,\n    resetCaches: resetCaches,\n    disableFragmentWarnings: disableFragmentWarnings,\n    enableExperimentalFragmentVariables: enableExperimentalFragmentVariables,\n    disableExperimentalFragmentVariables: disableExperimentalFragmentVariables\n};\n(function (gql_1) {\n    gql_1.gql = extras.gql, gql_1.resetCaches = extras.resetCaches, gql_1.disableFragmentWarnings = extras.disableFragmentWarnings, gql_1.enableExperimentalFragmentVariables = extras.enableExperimentalFragmentVariables, gql_1.disableExperimentalFragmentVariables = extras.disableExperimentalFragmentVariables;\n})(gql || (gql = {}));\ngql[\"default\"] = gql;\nexport default gql;\n//# sourceMappingURL=index.js.map","import { __assign, __rest } from \"tslib\";\nimport { wrap } from \"optimism\";\nimport { Observable, cacheSizes, getFragmentQueryDocument, mergeDeepArray, } from \"../../utilities/index.js\";\nimport { WeakCache } from \"@wry/caches\";\nimport { getApolloCacheMemoryInternals } from \"../../utilities/caching/getMemoryInternals.js\";\nimport { equal } from \"@wry/equality\";\nvar ApolloCache = /** @class */ (function () {\n    function ApolloCache() {\n        this.assumeImmutableResults = false;\n        // Make sure we compute the same (===) fragment query document every\n        // time we receive the same fragment in readFragment.\n        this.getFragmentDoc = wrap(getFragmentQueryDocument, {\n            max: cacheSizes[\"cache.fragmentQueryDocuments\"] ||\n                1000 /* defaultCacheSizes[\"cache.fragmentQueryDocuments\"] */,\n            cache: WeakCache,\n        });\n    }\n    // Transactional API\n    // The batch method is intended to replace/subsume both performTransaction\n    // and recordOptimisticTransaction, but performTransaction came first, so we\n    // provide a default batch implementation that's just another way of calling\n    // performTransaction. Subclasses of ApolloCache (such as InMemoryCache) can\n    // override the batch method to do more interesting things with its options.\n    ApolloCache.prototype.batch = function (options) {\n        var _this = this;\n        var optimisticId = typeof options.optimistic === \"string\" ? options.optimistic\n            : options.optimistic === false ? null\n                : void 0;\n        var updateResult;\n        this.performTransaction(function () { return (updateResult = options.update(_this)); }, optimisticId);\n        return updateResult;\n    };\n    ApolloCache.prototype.recordOptimisticTransaction = function (transaction, optimisticId) {\n        this.performTransaction(transaction, optimisticId);\n    };\n    // Optional API\n    // Called once per input document, allowing the cache to make static changes\n    // to the query, such as adding __typename fields.\n    ApolloCache.prototype.transformDocument = function (document) {\n        return document;\n    };\n    // Called before each ApolloLink request, allowing the cache to make dynamic\n    // changes to the query, such as filling in missing fragment definitions.\n    ApolloCache.prototype.transformForLink = function (document) {\n        return document;\n    };\n    ApolloCache.prototype.identify = function (object) {\n        return;\n    };\n    ApolloCache.prototype.gc = function () {\n        return [];\n    };\n    ApolloCache.prototype.modify = function (options) {\n        return false;\n    };\n    // DataProxy API\n    ApolloCache.prototype.readQuery = function (options, optimistic) {\n        if (optimistic === void 0) { optimistic = !!options.optimistic; }\n        return this.read(__assign(__assign({}, options), { rootId: options.id || \"ROOT_QUERY\", optimistic: optimistic }));\n    };\n    /** {@inheritDoc @apollo/client!ApolloClient#watchFragment:member(1)} */\n    ApolloCache.prototype.watchFragment = function (options) {\n        var _this = this;\n        var fragment = options.fragment, fragmentName = options.fragmentName, from = options.from, _a = options.optimistic, optimistic = _a === void 0 ? true : _a;\n        var diffOptions = {\n            returnPartialData: true,\n            id: typeof from === \"string\" ? from : this.identify(from),\n            query: this.getFragmentDoc(fragment, fragmentName),\n            optimistic: optimistic,\n        };\n        var latestDiff;\n        return new Observable(function (observer) {\n            return _this.watch(__assign(__assign({}, diffOptions), { immediate: true, query: _this.getFragmentDoc(fragment, fragmentName), callback: function (diff) {\n                    if (equal(diff, latestDiff)) {\n                        return;\n                    }\n                    var result = {\n                        data: diff.result,\n                        complete: !!diff.complete,\n                    };\n                    if (diff.missing) {\n                        result.missing = mergeDeepArray(diff.missing.map(function (error) { return error.missing; }));\n                    }\n                    latestDiff = diff;\n                    observer.next(result);\n                } }));\n        });\n    };\n    ApolloCache.prototype.readFragment = function (options, optimistic) {\n        if (optimistic === void 0) { optimistic = !!options.optimistic; }\n        return this.read(__assign(__assign({}, options), { query: this.getFragmentDoc(options.fragment, options.fragmentName), rootId: options.id, optimistic: optimistic }));\n    };\n    ApolloCache.prototype.writeQuery = function (_a) {\n        var id = _a.id, data = _a.data, options = __rest(_a, [\"id\", \"data\"]);\n        return this.write(Object.assign(options, {\n            dataId: id || \"ROOT_QUERY\",\n            result: data,\n        }));\n    };\n    ApolloCache.prototype.writeFragment = function (_a) {\n        var id = _a.id, data = _a.data, fragment = _a.fragment, fragmentName = _a.fragmentName, options = __rest(_a, [\"id\", \"data\", \"fragment\", \"fragmentName\"]);\n        return this.write(Object.assign(options, {\n            query: this.getFragmentDoc(fragment, fragmentName),\n            dataId: id,\n            result: data,\n        }));\n    };\n    ApolloCache.prototype.updateQuery = function (options, update) {\n        return this.batch({\n            update: function (cache) {\n                var value = cache.readQuery(options);\n                var data = update(value);\n                if (data === void 0 || data === null)\n                    return value;\n                cache.writeQuery(__assign(__assign({}, options), { data: data }));\n                return data;\n            },\n        });\n    };\n    ApolloCache.prototype.updateFragment = function (options, update) {\n        return this.batch({\n            update: function (cache) {\n                var value = cache.readFragment(options);\n                var data = update(value);\n                if (data === void 0 || data === null)\n                    return value;\n                cache.writeFragment(__assign(__assign({}, options), { data: data }));\n                return data;\n            },\n        });\n    };\n    return ApolloCache;\n}());\nexport { ApolloCache };\nif (globalThis.__DEV__ !== false) {\n    ApolloCache.prototype.getMemoryInternals = getApolloCacheMemoryInternals;\n}\n//# sourceMappingURL=cache.js.map","import { __extends } from \"tslib\";\nvar MissingFieldError = /** @class */ (function (_super) {\n    __extends(MissingFieldError, _super);\n    function MissingFieldError(message, path, query, variables) {\n        var _a;\n        // 'Error' breaks prototype chain here\n        var _this = _super.call(this, message) || this;\n        _this.message = message;\n        _this.path = path;\n        _this.query = query;\n        _this.variables = variables;\n        if (Array.isArray(_this.path)) {\n            _this.missing = _this.message;\n            for (var i = _this.path.length - 1; i >= 0; --i) {\n                _this.missing = (_a = {}, _a[_this.path[i]] = _this.missing, _a);\n            }\n        }\n        else {\n            _this.missing = _this.path;\n        }\n        // We're not using `Object.setPrototypeOf` here as it isn't fully supported\n        // on Android (see issue #3236).\n        _this.__proto__ = MissingFieldError.prototype;\n        return _this;\n    }\n    return MissingFieldError;\n}(Error));\nexport { MissingFieldError };\n//# sourceMappingURL=common.js.map","import { isReference, isField, DeepMerger, resultKeyNameFromField, shouldInclude, isNonNullObject, compact, createFragmentMap, getFragmentDefinitions, isArray, } from \"../../utilities/index.js\";\nexport var hasOwn = Object.prototype.hasOwnProperty;\nexport function isNullish(value) {\n    return value === null || value === void 0;\n}\nexport { isArray };\nexport function defaultDataIdFromObject(_a, context) {\n    var __typename = _a.__typename, id = _a.id, _id = _a._id;\n    if (typeof __typename === \"string\") {\n        if (context) {\n            context.keyObject =\n                !isNullish(id) ? { id: id }\n                    : !isNullish(_id) ? { _id: _id }\n                        : void 0;\n        }\n        // If there is no object.id, fall back to object._id.\n        if (isNullish(id) && !isNullish(_id)) {\n            id = _id;\n        }\n        if (!isNullish(id)) {\n            return \"\".concat(__typename, \":\").concat(typeof id === \"number\" || typeof id === \"string\" ?\n                id\n                : JSON.stringify(id));\n        }\n    }\n}\nvar defaultConfig = {\n    dataIdFromObject: defaultDataIdFromObject,\n    addTypename: true,\n    resultCaching: true,\n    // Thanks to the shouldCanonizeResults helper, this should be the only line\n    // you have to change to reenable canonization by default in the future.\n    canonizeResults: false,\n};\nexport function normalizeConfig(config) {\n    return compact(defaultConfig, config);\n}\nexport function shouldCanonizeResults(config) {\n    var value = config.canonizeResults;\n    return value === void 0 ? defaultConfig.canonizeResults : value;\n}\nexport function getTypenameFromStoreObject(store, objectOrReference) {\n    return isReference(objectOrReference) ?\n        store.get(objectOrReference.__ref, \"__typename\")\n        : objectOrReference && objectOrReference.__typename;\n}\nexport var TypeOrFieldNameRegExp = /^[_a-z][_0-9a-z]*/i;\nexport function fieldNameFromStoreName(storeFieldName) {\n    var match = storeFieldName.match(TypeOrFieldNameRegExp);\n    return match ? match[0] : storeFieldName;\n}\nexport function selectionSetMatchesResult(selectionSet, result, variables) {\n    if (isNonNullObject(result)) {\n        return isArray(result) ?\n            result.every(function (item) {\n                return selectionSetMatchesResult(selectionSet, item, variables);\n            })\n            : selectionSet.selections.every(function (field) {\n                if (isField(field) && shouldInclude(field, variables)) {\n                    var key = resultKeyNameFromField(field);\n                    return (hasOwn.call(result, key) &&\n                        (!field.selectionSet ||\n                            selectionSetMatchesResult(field.selectionSet, result[key], variables)));\n                }\n                // If the selection has been skipped with @skip(true) or\n                // @include(false), it should not count against the matching. If\n                // the selection is not a field, it must be a fragment (inline or\n                // named). We will determine if selectionSetMatchesResult for that\n                // fragment when we get to it, so for now we return true.\n                return true;\n            });\n    }\n    return false;\n}\nexport function storeValueIsStoreObject(value) {\n    return isNonNullObject(value) && !isReference(value) && !isArray(value);\n}\nexport function makeProcessedFieldsMerger() {\n    return new DeepMerger();\n}\nexport function extractFragmentContext(document, fragments) {\n    // FragmentMap consisting only of fragments defined directly in document, not\n    // including other fragments registered in the FragmentRegistry.\n    var fragmentMap = createFragmentMap(getFragmentDefinitions(document));\n    return {\n        fragmentMap: fragmentMap,\n        lookupFragment: function (name) {\n            var def = fragmentMap[name];\n            if (!def && fragments) {\n                def = fragments.lookup(name);\n            }\n            return def || null;\n        },\n    };\n}\n//# sourceMappingURL=helpers.js.map","import { __assign, __extends, __rest } from \"tslib\";\nimport { invariant } from \"../../utilities/globals/index.js\";\nimport { dep } from \"optimism\";\nimport { equal } from \"@wry/equality\";\nimport { Trie } from \"@wry/trie\";\nimport { isReference, makeReference, DeepMerger, maybeDeepFreeze, canUseWeakMap, isNonNullObject, } from \"../../utilities/index.js\";\nimport { hasOwn, fieldNameFromStoreName } from \"./helpers.js\";\nvar DELETE = Object.create(null);\nvar delModifier = function () { return DELETE; };\nvar INVALIDATE = Object.create(null);\nvar EntityStore = /** @class */ (function () {\n    function EntityStore(policies, group) {\n        var _this = this;\n        this.policies = policies;\n        this.group = group;\n        this.data = Object.create(null);\n        // Maps root entity IDs to the number of times they have been retained, minus\n        // the number of times they have been released. Retained entities keep other\n        // entities they reference (even indirectly) from being garbage collected.\n        this.rootIds = Object.create(null);\n        // Lazily tracks { __ref: <dataId> } strings contained by this.data[dataId].\n        this.refs = Object.create(null);\n        // Bound function that can be passed around to provide easy access to fields\n        // of Reference objects as well as ordinary objects.\n        this.getFieldValue = function (objectOrReference, storeFieldName) {\n            return maybeDeepFreeze(isReference(objectOrReference) ?\n                _this.get(objectOrReference.__ref, storeFieldName)\n                : objectOrReference && objectOrReference[storeFieldName]);\n        };\n        // Returns true for non-normalized StoreObjects and non-dangling\n        // References, indicating that readField(name, objOrRef) has a chance of\n        // working. Useful for filtering out dangling references from lists.\n        this.canRead = function (objOrRef) {\n            return isReference(objOrRef) ?\n                _this.has(objOrRef.__ref)\n                : typeof objOrRef === \"object\";\n        };\n        // Bound function that converts an id or an object with a __typename and\n        // primary key fields to a Reference object. If called with a Reference object,\n        // that same Reference object is returned. Pass true for mergeIntoStore to persist\n        // an object into the store.\n        this.toReference = function (objOrIdOrRef, mergeIntoStore) {\n            if (typeof objOrIdOrRef === \"string\") {\n                return makeReference(objOrIdOrRef);\n            }\n            if (isReference(objOrIdOrRef)) {\n                return objOrIdOrRef;\n            }\n            var id = _this.policies.identify(objOrIdOrRef)[0];\n            if (id) {\n                var ref = makeReference(id);\n                if (mergeIntoStore) {\n                    _this.merge(id, objOrIdOrRef);\n                }\n                return ref;\n            }\n        };\n    }\n    // Although the EntityStore class is abstract, it contains concrete\n    // implementations of the various NormalizedCache interface methods that\n    // are inherited by the Root and Layer subclasses.\n    EntityStore.prototype.toObject = function () {\n        return __assign({}, this.data);\n    };\n    EntityStore.prototype.has = function (dataId) {\n        return this.lookup(dataId, true) !== void 0;\n    };\n    EntityStore.prototype.get = function (dataId, fieldName) {\n        this.group.depend(dataId, fieldName);\n        if (hasOwn.call(this.data, dataId)) {\n            var storeObject = this.data[dataId];\n            if (storeObject && hasOwn.call(storeObject, fieldName)) {\n                return storeObject[fieldName];\n            }\n        }\n        if (fieldName === \"__typename\" &&\n            hasOwn.call(this.policies.rootTypenamesById, dataId)) {\n            return this.policies.rootTypenamesById[dataId];\n        }\n        if (this instanceof Layer) {\n            return this.parent.get(dataId, fieldName);\n        }\n    };\n    EntityStore.prototype.lookup = function (dataId, dependOnExistence) {\n        // The has method (above) calls lookup with dependOnExistence = true, so\n        // that it can later be invalidated when we add or remove a StoreObject for\n        // this dataId. Any consumer who cares about the contents of the StoreObject\n        // should not rely on this dependency, since the contents could change\n        // without the object being added or removed.\n        if (dependOnExistence)\n            this.group.depend(dataId, \"__exists\");\n        if (hasOwn.call(this.data, dataId)) {\n            return this.data[dataId];\n        }\n        if (this instanceof Layer) {\n            return this.parent.lookup(dataId, dependOnExistence);\n        }\n        if (this.policies.rootTypenamesById[dataId]) {\n            return Object.create(null);\n        }\n    };\n    EntityStore.prototype.merge = function (older, newer) {\n        var _this = this;\n        var dataId;\n        // Convert unexpected references to ID strings.\n        if (isReference(older))\n            older = older.__ref;\n        if (isReference(newer))\n            newer = newer.__ref;\n        var existing = typeof older === \"string\" ? this.lookup((dataId = older)) : older;\n        var incoming = typeof newer === \"string\" ? this.lookup((dataId = newer)) : newer;\n        // If newer was a string ID, but that ID was not defined in this store,\n        // then there are no fields to be merged, so we're done.\n        if (!incoming)\n            return;\n        invariant(typeof dataId === \"string\", 1);\n        var merged = new DeepMerger(storeObjectReconciler).merge(existing, incoming);\n        // Even if merged === existing, existing may have come from a lower\n        // layer, so we always need to set this.data[dataId] on this level.\n        this.data[dataId] = merged;\n        if (merged !== existing) {\n            delete this.refs[dataId];\n            if (this.group.caching) {\n                var fieldsToDirty_1 = Object.create(null);\n                // If we added a new StoreObject where there was previously none, dirty\n                // anything that depended on the existence of this dataId, such as the\n                // EntityStore#has method.\n                if (!existing)\n                    fieldsToDirty_1.__exists = 1;\n                // Now invalidate dependents who called getFieldValue for any fields\n                // that are changing as a result of this merge.\n                Object.keys(incoming).forEach(function (storeFieldName) {\n                    if (!existing ||\n                        existing[storeFieldName] !== merged[storeFieldName]) {\n                        // Always dirty the full storeFieldName, which may include\n                        // serialized arguments following the fieldName prefix.\n                        fieldsToDirty_1[storeFieldName] = 1;\n                        // Also dirty fieldNameFromStoreName(storeFieldName) if it's\n                        // different from storeFieldName and this field does not have\n                        // keyArgs configured, because that means the cache can't make\n                        // any assumptions about how field values with the same field\n                        // name but different arguments might be interrelated, so it\n                        // must err on the side of invalidating all field values that\n                        // share the same short fieldName, regardless of arguments.\n                        var fieldName = fieldNameFromStoreName(storeFieldName);\n                        if (fieldName !== storeFieldName &&\n                            !_this.policies.hasKeyArgs(merged.__typename, fieldName)) {\n                            fieldsToDirty_1[fieldName] = 1;\n                        }\n                        // If merged[storeFieldName] has become undefined, and this is the\n                        // Root layer, actually delete the property from the merged object,\n                        // which is guaranteed to have been created fresh in this method.\n                        if (merged[storeFieldName] === void 0 && !(_this instanceof Layer)) {\n                            delete merged[storeFieldName];\n                        }\n                    }\n                });\n                if (fieldsToDirty_1.__typename &&\n                    !(existing && existing.__typename) &&\n                    // Since we return default root __typename strings\n                    // automatically from store.get, we don't need to dirty the\n                    // ROOT_QUERY.__typename field if merged.__typename is equal\n                    // to the default string (usually \"Query\").\n                    this.policies.rootTypenamesById[dataId] === merged.__typename) {\n                    delete fieldsToDirty_1.__typename;\n                }\n                Object.keys(fieldsToDirty_1).forEach(function (fieldName) {\n                    return _this.group.dirty(dataId, fieldName);\n                });\n            }\n        }\n    };\n    EntityStore.prototype.modify = function (dataId, fields) {\n        var _this = this;\n        var storeObject = this.lookup(dataId);\n        if (storeObject) {\n            var changedFields_1 = Object.create(null);\n            var needToMerge_1 = false;\n            var allDeleted_1 = true;\n            var sharedDetails_1 = {\n                DELETE: DELETE,\n                INVALIDATE: INVALIDATE,\n                isReference: isReference,\n                toReference: this.toReference,\n                canRead: this.canRead,\n                readField: function (fieldNameOrOptions, from) {\n                    return _this.policies.readField(typeof fieldNameOrOptions === \"string\" ?\n                        {\n                            fieldName: fieldNameOrOptions,\n                            from: from || makeReference(dataId),\n                        }\n                        : fieldNameOrOptions, { store: _this });\n                },\n            };\n            Object.keys(storeObject).forEach(function (storeFieldName) {\n                var fieldName = fieldNameFromStoreName(storeFieldName);\n                var fieldValue = storeObject[storeFieldName];\n                if (fieldValue === void 0)\n                    return;\n                var modify = typeof fields === \"function\" ? fields : (fields[storeFieldName] || fields[fieldName]);\n                if (modify) {\n                    var newValue = modify === delModifier ? DELETE : (modify(maybeDeepFreeze(fieldValue), __assign(__assign({}, sharedDetails_1), { fieldName: fieldName, storeFieldName: storeFieldName, storage: _this.getStorage(dataId, storeFieldName) })));\n                    if (newValue === INVALIDATE) {\n                        _this.group.dirty(dataId, storeFieldName);\n                    }\n                    else {\n                        if (newValue === DELETE)\n                            newValue = void 0;\n                        if (newValue !== fieldValue) {\n                            changedFields_1[storeFieldName] = newValue;\n                            needToMerge_1 = true;\n                            fieldValue = newValue;\n                            if (globalThis.__DEV__ !== false) {\n                                var checkReference = function (ref) {\n                                    if (_this.lookup(ref.__ref) === undefined) {\n                                        globalThis.__DEV__ !== false && invariant.warn(2, ref);\n                                        return true;\n                                    }\n                                };\n                                if (isReference(newValue)) {\n                                    checkReference(newValue);\n                                }\n                                else if (Array.isArray(newValue)) {\n                                    // Warn about writing \"mixed\" arrays of Reference and non-Reference objects\n                                    var seenReference = false;\n                                    var someNonReference = void 0;\n                                    for (var _i = 0, newValue_1 = newValue; _i < newValue_1.length; _i++) {\n                                        var value = newValue_1[_i];\n                                        if (isReference(value)) {\n                                            seenReference = true;\n                                            if (checkReference(value))\n                                                break;\n                                        }\n                                        else {\n                                            // Do not warn on primitive values, since those could never be represented\n                                            // by a reference. This is a valid (albeit uncommon) use case.\n                                            if (typeof value === \"object\" && !!value) {\n                                                var id = _this.policies.identify(value)[0];\n                                                // check if object could even be referenced, otherwise we are not interested in it for this warning\n                                                if (id) {\n                                                    someNonReference = value;\n                                                }\n                                            }\n                                        }\n                                        if (seenReference && someNonReference !== undefined) {\n                                            globalThis.__DEV__ !== false && invariant.warn(3, someNonReference);\n                                            break;\n                                        }\n                                    }\n                                }\n                            }\n                        }\n                    }\n                }\n                if (fieldValue !== void 0) {\n                    allDeleted_1 = false;\n                }\n            });\n            if (needToMerge_1) {\n                this.merge(dataId, changedFields_1);\n                if (allDeleted_1) {\n                    if (this instanceof Layer) {\n                        this.data[dataId] = void 0;\n                    }\n                    else {\n                        delete this.data[dataId];\n                    }\n                    this.group.dirty(dataId, \"__exists\");\n                }\n                return true;\n            }\n        }\n        return false;\n    };\n    // If called with only one argument, removes the entire entity\n    // identified by dataId. If called with a fieldName as well, removes all\n    // fields of that entity whose names match fieldName according to the\n    // fieldNameFromStoreName helper function. If called with a fieldName\n    // and variables, removes all fields of that entity whose names match fieldName\n    // and whose arguments when cached exactly match the variables passed.\n    EntityStore.prototype.delete = function (dataId, fieldName, args) {\n        var _a;\n        var storeObject = this.lookup(dataId);\n        if (storeObject) {\n            var typename = this.getFieldValue(storeObject, \"__typename\");\n            var storeFieldName = fieldName && args ?\n                this.policies.getStoreFieldName({ typename: typename, fieldName: fieldName, args: args })\n                : fieldName;\n            return this.modify(dataId, storeFieldName ? (_a = {},\n                _a[storeFieldName] = delModifier,\n                _a) : delModifier);\n        }\n        return false;\n    };\n    EntityStore.prototype.evict = function (options, limit) {\n        var evicted = false;\n        if (options.id) {\n            if (hasOwn.call(this.data, options.id)) {\n                evicted = this.delete(options.id, options.fieldName, options.args);\n            }\n            if (this instanceof Layer && this !== limit) {\n                evicted = this.parent.evict(options, limit) || evicted;\n            }\n            // Always invalidate the field to trigger rereading of watched\n            // queries, even if no cache data was modified by the eviction,\n            // because queries may depend on computed fields with custom read\n            // functions, whose values are not stored in the EntityStore.\n            if (options.fieldName || evicted) {\n                this.group.dirty(options.id, options.fieldName || \"__exists\");\n            }\n        }\n        return evicted;\n    };\n    EntityStore.prototype.clear = function () {\n        this.replace(null);\n    };\n    EntityStore.prototype.extract = function () {\n        var _this = this;\n        var obj = this.toObject();\n        var extraRootIds = [];\n        this.getRootIdSet().forEach(function (id) {\n            if (!hasOwn.call(_this.policies.rootTypenamesById, id)) {\n                extraRootIds.push(id);\n            }\n        });\n        if (extraRootIds.length) {\n            obj.__META = { extraRootIds: extraRootIds.sort() };\n        }\n        return obj;\n    };\n    EntityStore.prototype.replace = function (newData) {\n        var _this = this;\n        Object.keys(this.data).forEach(function (dataId) {\n            if (!(newData && hasOwn.call(newData, dataId))) {\n                _this.delete(dataId);\n            }\n        });\n        if (newData) {\n            var __META = newData.__META, rest_1 = __rest(newData, [\"__META\"]);\n            Object.keys(rest_1).forEach(function (dataId) {\n                _this.merge(dataId, rest_1[dataId]);\n            });\n            if (__META) {\n                __META.extraRootIds.forEach(this.retain, this);\n            }\n        }\n    };\n    EntityStore.prototype.retain = function (rootId) {\n        return (this.rootIds[rootId] = (this.rootIds[rootId] || 0) + 1);\n    };\n    EntityStore.prototype.release = function (rootId) {\n        if (this.rootIds[rootId] > 0) {\n            var count = --this.rootIds[rootId];\n            if (!count)\n                delete this.rootIds[rootId];\n            return count;\n        }\n        return 0;\n    };\n    // Return a Set<string> of all the ID strings that have been retained by\n    // this layer/root *and* any layers/roots beneath it.\n    EntityStore.prototype.getRootIdSet = function (ids) {\n        if (ids === void 0) { ids = new Set(); }\n        Object.keys(this.rootIds).forEach(ids.add, ids);\n        if (this instanceof Layer) {\n            this.parent.getRootIdSet(ids);\n        }\n        else {\n            // Official singleton IDs like ROOT_QUERY and ROOT_MUTATION are\n            // always considered roots for garbage collection, regardless of\n            // their retainment counts in this.rootIds.\n            Object.keys(this.policies.rootTypenamesById).forEach(ids.add, ids);\n        }\n        return ids;\n    };\n    // The goal of garbage collection is to remove IDs from the Root layer of the\n    // store that are no longer reachable starting from any IDs that have been\n    // explicitly retained (see retain and release, above). Returns an array of\n    // dataId strings that were removed from the store.\n    EntityStore.prototype.gc = function () {\n        var _this = this;\n        var ids = this.getRootIdSet();\n        var snapshot = this.toObject();\n        ids.forEach(function (id) {\n            if (hasOwn.call(snapshot, id)) {\n                // Because we are iterating over an ECMAScript Set, the IDs we add here\n                // will be visited in later iterations of the forEach loop only if they\n                // were not previously contained by the Set.\n                Object.keys(_this.findChildRefIds(id)).forEach(ids.add, ids);\n                // By removing IDs from the snapshot object here, we protect them from\n                // getting removed from the root store layer below.\n                delete snapshot[id];\n            }\n        });\n        var idsToRemove = Object.keys(snapshot);\n        if (idsToRemove.length) {\n            var root_1 = this;\n            while (root_1 instanceof Layer)\n                root_1 = root_1.parent;\n            idsToRemove.forEach(function (id) { return root_1.delete(id); });\n        }\n        return idsToRemove;\n    };\n    EntityStore.prototype.findChildRefIds = function (dataId) {\n        if (!hasOwn.call(this.refs, dataId)) {\n            var found_1 = (this.refs[dataId] = Object.create(null));\n            var root = this.data[dataId];\n            if (!root)\n                return found_1;\n            var workSet_1 = new Set([root]);\n            // Within the store, only arrays and objects can contain child entity\n            // references, so we can prune the traversal using this predicate:\n            workSet_1.forEach(function (obj) {\n                if (isReference(obj)) {\n                    found_1[obj.__ref] = true;\n                    // In rare cases, a { __ref } Reference object may have other fields.\n                    // This often indicates a mismerging of References with StoreObjects,\n                    // but garbage collection should not be fooled by a stray __ref\n                    // property in a StoreObject (ignoring all the other fields just\n                    // because the StoreObject looks like a Reference). To avoid this\n                    // premature termination of findChildRefIds recursion, we fall through\n                    // to the code below, which will handle any other properties of obj.\n                }\n                if (isNonNullObject(obj)) {\n                    Object.keys(obj).forEach(function (key) {\n                        var child = obj[key];\n                        // No need to add primitive values to the workSet, since they cannot\n                        // contain reference objects.\n                        if (isNonNullObject(child)) {\n                            workSet_1.add(child);\n                        }\n                    });\n                }\n            });\n        }\n        return this.refs[dataId];\n    };\n    EntityStore.prototype.makeCacheKey = function () {\n        return this.group.keyMaker.lookupArray(arguments);\n    };\n    return EntityStore;\n}());\nexport { EntityStore };\n// A single CacheGroup represents a set of one or more EntityStore objects,\n// typically the Root store in a CacheGroup by itself, and all active Layer\n// stores in a group together. A single EntityStore object belongs to only\n// one CacheGroup, store.group. The CacheGroup is responsible for tracking\n// dependencies, so store.group is helpful for generating unique keys for\n// cached results that need to be invalidated when/if those dependencies\n// change. If we used the EntityStore objects themselves as cache keys (that\n// is, store rather than store.group), the cache would become unnecessarily\n// fragmented by all the different Layer objects. Instead, the CacheGroup\n// approach allows all optimistic Layer objects in the same linked list to\n// belong to one CacheGroup, with the non-optimistic Root object belonging\n// to another CacheGroup, allowing resultCaching dependencies to be tracked\n// separately for optimistic and non-optimistic entity data.\nvar CacheGroup = /** @class */ (function () {\n    function CacheGroup(caching, parent) {\n        if (parent === void 0) { parent = null; }\n        this.caching = caching;\n        this.parent = parent;\n        this.d = null;\n        this.resetCaching();\n    }\n    CacheGroup.prototype.resetCaching = function () {\n        this.d = this.caching ? dep() : null;\n        this.keyMaker = new Trie(canUseWeakMap);\n    };\n    CacheGroup.prototype.depend = function (dataId, storeFieldName) {\n        if (this.d) {\n            this.d(makeDepKey(dataId, storeFieldName));\n            var fieldName = fieldNameFromStoreName(storeFieldName);\n            if (fieldName !== storeFieldName) {\n                // Fields with arguments that contribute extra identifying\n                // information to the fieldName (thus forming the storeFieldName)\n                // depend not only on the full storeFieldName but also on the\n                // short fieldName, so the field can be invalidated using either\n                // level of specificity.\n                this.d(makeDepKey(dataId, fieldName));\n            }\n            if (this.parent) {\n                this.parent.depend(dataId, storeFieldName);\n            }\n        }\n    };\n    CacheGroup.prototype.dirty = function (dataId, storeFieldName) {\n        if (this.d) {\n            this.d.dirty(makeDepKey(dataId, storeFieldName), \n            // When storeFieldName === \"__exists\", that means the entity identified\n            // by dataId has either disappeared from the cache or was newly added,\n            // so the result caching system would do well to \"forget everything it\n            // knows\" about that object. To achieve that kind of invalidation, we\n            // not only dirty the associated result cache entry, but also remove it\n            // completely from the dependency graph. For the optimism implementation\n            // details, see https://github.com/benjamn/optimism/pull/195.\n            storeFieldName === \"__exists\" ? \"forget\" : \"setDirty\");\n        }\n    };\n    return CacheGroup;\n}());\nfunction makeDepKey(dataId, storeFieldName) {\n    // Since field names cannot have '#' characters in them, this method\n    // of joining the field name and the ID should be unambiguous, and much\n    // cheaper than JSON.stringify([dataId, fieldName]).\n    return storeFieldName + \"#\" + dataId;\n}\nexport function maybeDependOnExistenceOfEntity(store, entityId) {\n    if (supportsResultCaching(store)) {\n        // We use this pseudo-field __exists elsewhere in the EntityStore code to\n        // represent changes in the existence of the entity object identified by\n        // entityId. This dependency gets reliably dirtied whenever an object with\n        // this ID is deleted (or newly created) within this group, so any result\n        // cache entries (for example, StoreReader#executeSelectionSet results) that\n        // depend on __exists for this entityId will get dirtied as well, leading to\n        // the eventual recomputation (instead of reuse) of those result objects the\n        // next time someone reads them from the cache.\n        store.group.depend(entityId, \"__exists\");\n    }\n}\n(function (EntityStore) {\n    // Refer to this class as EntityStore.Root outside this namespace.\n    var Root = /** @class */ (function (_super) {\n        __extends(Root, _super);\n        function Root(_a) {\n            var policies = _a.policies, _b = _a.resultCaching, resultCaching = _b === void 0 ? true : _b, seed = _a.seed;\n            var _this = _super.call(this, policies, new CacheGroup(resultCaching)) || this;\n            _this.stump = new Stump(_this);\n            _this.storageTrie = new Trie(canUseWeakMap);\n            if (seed)\n                _this.replace(seed);\n            return _this;\n        }\n        Root.prototype.addLayer = function (layerId, replay) {\n            // Adding an optimistic Layer on top of the Root actually adds the Layer\n            // on top of the Stump, so the Stump always comes between the Root and\n            // any Layer objects that we've added.\n            return this.stump.addLayer(layerId, replay);\n        };\n        Root.prototype.removeLayer = function () {\n            // Never remove the root layer.\n            return this;\n        };\n        Root.prototype.getStorage = function () {\n            return this.storageTrie.lookupArray(arguments);\n        };\n        return Root;\n    }(EntityStore));\n    EntityStore.Root = Root;\n})(EntityStore || (EntityStore = {}));\n// Not exported, since all Layer instances are created by the addLayer method\n// of the EntityStore.Root class.\nvar Layer = /** @class */ (function (_super) {\n    __extends(Layer, _super);\n    function Layer(id, parent, replay, group) {\n        var _this = _super.call(this, parent.policies, group) || this;\n        _this.id = id;\n        _this.parent = parent;\n        _this.replay = replay;\n        _this.group = group;\n        replay(_this);\n        return _this;\n    }\n    Layer.prototype.addLayer = function (layerId, replay) {\n        return new Layer(layerId, this, replay, this.group);\n    };\n    Layer.prototype.removeLayer = function (layerId) {\n        var _this = this;\n        // Remove all instances of the given id, not just the first one.\n        var parent = this.parent.removeLayer(layerId);\n        if (layerId === this.id) {\n            if (this.group.caching) {\n                // Dirty every ID we're removing. Technically we might be able to avoid\n                // dirtying fields that have values in higher layers, but we don't have\n                // easy access to higher layers here, and we're about to recreate those\n                // layers anyway (see parent.addLayer below).\n                Object.keys(this.data).forEach(function (dataId) {\n                    var ownStoreObject = _this.data[dataId];\n                    var parentStoreObject = parent[\"lookup\"](dataId);\n                    if (!parentStoreObject) {\n                        // The StoreObject identified by dataId was defined in this layer\n                        // but will be undefined in the parent layer, so we can delete the\n                        // whole entity using this.delete(dataId). Since we're about to\n                        // throw this layer away, the only goal of this deletion is to dirty\n                        // the removed fields.\n                        _this.delete(dataId);\n                    }\n                    else if (!ownStoreObject) {\n                        // This layer had an entry for dataId but it was undefined, which\n                        // means the entity was deleted in this layer, and it's about to\n                        // become undeleted when we remove this layer, so we need to dirty\n                        // all fields that are about to be reexposed.\n                        _this.group.dirty(dataId, \"__exists\");\n                        Object.keys(parentStoreObject).forEach(function (storeFieldName) {\n                            _this.group.dirty(dataId, storeFieldName);\n                        });\n                    }\n                    else if (ownStoreObject !== parentStoreObject) {\n                        // If ownStoreObject is not exactly the same as parentStoreObject,\n                        // dirty any fields whose values will change as a result of this\n                        // removal.\n                        Object.keys(ownStoreObject).forEach(function (storeFieldName) {\n                            if (!equal(ownStoreObject[storeFieldName], parentStoreObject[storeFieldName])) {\n                                _this.group.dirty(dataId, storeFieldName);\n                            }\n                        });\n                    }\n                });\n            }\n            return parent;\n        }\n        // No changes are necessary if the parent chain remains identical.\n        if (parent === this.parent)\n            return this;\n        // Recreate this layer on top of the new parent.\n        return parent.addLayer(this.id, this.replay);\n    };\n    Layer.prototype.toObject = function () {\n        return __assign(__assign({}, this.parent.toObject()), this.data);\n    };\n    Layer.prototype.findChildRefIds = function (dataId) {\n        var fromParent = this.parent.findChildRefIds(dataId);\n        return hasOwn.call(this.data, dataId) ? __assign(__assign({}, fromParent), _super.prototype.findChildRefIds.call(this, dataId)) : fromParent;\n    };\n    Layer.prototype.getStorage = function () {\n        var p = this.parent;\n        while (p.parent)\n            p = p.parent;\n        return p.getStorage.apply(p, \n        // @ts-expect-error\n        arguments);\n    };\n    return Layer;\n}(EntityStore));\n// Represents a Layer permanently installed just above the Root, which allows\n// reading optimistically (and registering optimistic dependencies) even when\n// no optimistic layers are currently active. The stump.group CacheGroup object\n// is shared by any/all Layer objects added on top of the Stump.\nvar Stump = /** @class */ (function (_super) {\n    __extends(Stump, _super);\n    function Stump(root) {\n        return _super.call(this, \"EntityStore.Stump\", root, function () { }, new CacheGroup(root.group.caching, root.group)) || this;\n    }\n    Stump.prototype.removeLayer = function () {\n        // Never remove the Stump layer.\n        return this;\n    };\n    Stump.prototype.merge = function (older, newer) {\n        // We never want to write any data into the Stump, so we forward any merge\n        // calls to the Root instead. Another option here would be to throw an\n        // exception, but the toReference(object, true) function can sometimes\n        // trigger Stump writes (which used to be Root writes, before the Stump\n        // concept was introduced).\n        return this.parent.merge(older, newer);\n    };\n    return Stump;\n}(Layer));\nfunction storeObjectReconciler(existingObject, incomingObject, property) {\n    var existingValue = existingObject[property];\n    var incomingValue = incomingObject[property];\n    // Wherever there is a key collision, prefer the incoming value, unless\n    // it is deeply equal to the existing value. It's worth checking deep\n    // equality here (even though blindly returning incoming would be\n    // logically correct) because preserving the referential identity of\n    // existing data can prevent needless rereading and rerendering.\n    return equal(existingValue, incomingValue) ? existingValue : incomingValue;\n}\nexport function supportsResultCaching(store) {\n    // When result caching is disabled, store.depend will be null.\n    return !!(store instanceof EntityStore && store.group.caching);\n}\n//# sourceMappingURL=entityStore.js.map","import { __assign } from \"tslib\";\nimport { Trie } from \"@wry/trie\";\nimport { canUseWeakMap, canUseWeakSet, isNonNullObject as isObjectOrArray, } from \"../../utilities/index.js\";\nimport { isArray } from \"./helpers.js\";\nfunction shallowCopy(value) {\n    if (isObjectOrArray(value)) {\n        return isArray(value) ?\n            value.slice(0)\n            : __assign({ __proto__: Object.getPrototypeOf(value) }, value);\n    }\n    return value;\n}\n// When programmers talk about the \"canonical form\" of an object, they\n// usually have the following meaning in mind, which I've copied from\n// https://en.wiktionary.org/wiki/canonical_form:\n//\n// 1. A standard or normal presentation of a mathematical entity [or\n//    object]. A canonical form is an element of a set of representatives\n//    of equivalence classes of forms such that there is a function or\n//    procedure which projects every element of each equivalence class\n//    onto that one element, the canonical form of that equivalence\n//    class. The canonical form is expected to be simpler than the rest of\n//    the forms in some way.\n//\n// That's a long-winded way of saying any two objects that have the same\n// canonical form may be considered equivalent, even if they are !==,\n// which usually means the objects are structurally equivalent (deeply\n// equal), but don't necessarily use the same memory.\n//\n// Like a literary or musical canon, this ObjectCanon class represents a\n// collection of unique canonical items (JavaScript objects), with the\n// important property that canon.admit(a) === canon.admit(b) if a and b\n// are deeply equal to each other. In terms of the definition above, the\n// canon.admit method is the \"function or procedure which projects every\"\n// object \"onto that one element, the canonical form.\"\n//\n// In the worst case, the canonicalization process may involve looking at\n// every property in the provided object tree, so it takes the same order\n// of time as deep equality checking. Fortunately, already-canonicalized\n// objects are returned immediately from canon.admit, so the presence of\n// canonical subtrees tends to speed up canonicalization.\n//\n// Since consumers of canonical objects can check for deep equality in\n// constant time, canonicalizing cache results can massively improve the\n// performance of application code that skips re-rendering unchanged\n// results, such as \"pure\" UI components in a framework like React.\n//\n// Of course, since canonical objects may be shared widely between\n// unrelated consumers, it's important to think of them as immutable, even\n// though they are not actually frozen with Object.freeze in production,\n// due to the extra performance overhead that comes with frozen objects.\n//\n// Custom scalar objects whose internal class name is neither Array nor\n// Object can be included safely in the admitted tree, but they will not\n// be replaced with a canonical version (to put it another way, they are\n// assumed to be canonical already).\n//\n// If we ignore custom objects, no detection of cycles or repeated object\n// references is currently required by the StoreReader class, since\n// GraphQL result objects are JSON-serializable trees (and thus contain\n// neither cycles nor repeated subtrees), so we can avoid the complexity\n// of keeping track of objects we've already seen during the recursion of\n// the admit method.\n//\n// In the future, we may consider adding additional cases to the switch\n// statement to handle other common object types, such as \"[object Date]\"\n// objects, as needed.\nvar ObjectCanon = /** @class */ (function () {\n    function ObjectCanon() {\n        // Set of all canonical objects this ObjectCanon has admitted, allowing\n        // canon.admit to return previously-canonicalized objects immediately.\n        this.known = new (canUseWeakSet ? WeakSet : Set)();\n        // Efficient storage/lookup structure for canonical objects.\n        this.pool = new Trie(canUseWeakMap);\n        // Make the ObjectCanon assume this value has already been\n        // canonicalized.\n        this.passes = new WeakMap();\n        // Arrays that contain the same elements in a different order can share\n        // the same SortedKeysInfo object, to save memory.\n        this.keysByJSON = new Map();\n        // This has to come last because it depends on keysByJSON.\n        this.empty = this.admit({});\n    }\n    ObjectCanon.prototype.isKnown = function (value) {\n        return isObjectOrArray(value) && this.known.has(value);\n    };\n    ObjectCanon.prototype.pass = function (value) {\n        if (isObjectOrArray(value)) {\n            var copy = shallowCopy(value);\n            this.passes.set(copy, value);\n            return copy;\n        }\n        return value;\n    };\n    ObjectCanon.prototype.admit = function (value) {\n        var _this = this;\n        if (isObjectOrArray(value)) {\n            var original = this.passes.get(value);\n            if (original)\n                return original;\n            var proto = Object.getPrototypeOf(value);\n            switch (proto) {\n                case Array.prototype: {\n                    if (this.known.has(value))\n                        return value;\n                    var array = value.map(this.admit, this);\n                    // Arrays are looked up in the Trie using their recursively\n                    // canonicalized elements, and the known version of the array is\n                    // preserved as node.array.\n                    var node = this.pool.lookupArray(array);\n                    if (!node.array) {\n                        this.known.add((node.array = array));\n                        // Since canonical arrays may be shared widely between\n                        // unrelated consumers, it's important to regard them as\n                        // immutable, even if they are not frozen in production.\n                        if (globalThis.__DEV__ !== false) {\n                            Object.freeze(array);\n                        }\n                    }\n                    return node.array;\n                }\n                case null:\n                case Object.prototype: {\n                    if (this.known.has(value))\n                        return value;\n                    var proto_1 = Object.getPrototypeOf(value);\n                    var array_1 = [proto_1];\n                    var keys = this.sortedKeys(value);\n                    array_1.push(keys.json);\n                    var firstValueIndex_1 = array_1.length;\n                    keys.sorted.forEach(function (key) {\n                        array_1.push(_this.admit(value[key]));\n                    });\n                    // Objects are looked up in the Trie by their prototype (which\n                    // is *not* recursively canonicalized), followed by a JSON\n                    // representation of their (sorted) keys, followed by the\n                    // sequence of recursively canonicalized values corresponding to\n                    // those keys. To keep the final results unambiguous with other\n                    // sequences (such as arrays that just happen to contain [proto,\n                    // keys.json, value1, value2, ...]), the known version of the\n                    // object is stored as node.object.\n                    var node = this.pool.lookupArray(array_1);\n                    if (!node.object) {\n                        var obj_1 = (node.object = Object.create(proto_1));\n                        this.known.add(obj_1);\n                        keys.sorted.forEach(function (key, i) {\n                            obj_1[key] = array_1[firstValueIndex_1 + i];\n                        });\n                        // Since canonical objects may be shared widely between\n                        // unrelated consumers, it's important to regard them as\n                        // immutable, even if they are not frozen in production.\n                        if (globalThis.__DEV__ !== false) {\n                            Object.freeze(obj_1);\n                        }\n                    }\n                    return node.object;\n                }\n            }\n        }\n        return value;\n    };\n    // It's worthwhile to cache the sorting of arrays of strings, since the\n    // same initial unsorted arrays tend to be encountered many times.\n    // Fortunately, we can reuse the Trie machinery to look up the sorted\n    // arrays in linear time (which is faster than sorting large arrays).\n    ObjectCanon.prototype.sortedKeys = function (obj) {\n        var keys = Object.keys(obj);\n        var node = this.pool.lookupArray(keys);\n        if (!node.keys) {\n            keys.sort();\n            var json = JSON.stringify(keys);\n            if (!(node.keys = this.keysByJSON.get(json))) {\n                this.keysByJSON.set(json, (node.keys = { sorted: keys, json: json }));\n            }\n        }\n        return node.keys;\n    };\n    return ObjectCanon;\n}());\nexport { ObjectCanon };\n//# sourceMappingURL=object-canon.js.map","import { __assign } from \"tslib\";\nimport { invariant, newInvariantError } from \"../../utilities/globals/index.js\";\nimport { Kind } from \"graphql\";\nimport { wrap } from \"optimism\";\nimport { isField, resultKeyNameFromField, isReference, makeReference, shouldInclude, addTypenameToDocument, getDefaultValues, getMainDefinition, getQueryDefinition, getFragmentFromSelection, maybeDeepFreeze, mergeDeepArray, DeepMerger, isNonNullObject, canUseWeakMap, compact, canonicalStringify, cacheSizes, } from \"../../utilities/index.js\";\nimport { maybeDependOnExistenceOfEntity, supportsResultCaching, } from \"./entityStore.js\";\nimport { isArray, extractFragmentContext, getTypenameFromStoreObject, shouldCanonizeResults, } from \"./helpers.js\";\nimport { MissingFieldError } from \"../core/types/common.js\";\nimport { ObjectCanon } from \"./object-canon.js\";\nfunction execSelectionSetKeyArgs(options) {\n    return [\n        options.selectionSet,\n        options.objectOrReference,\n        options.context,\n        // We split out this property so we can pass different values\n        // independently without modifying options.context itself.\n        options.context.canonizeResults,\n    ];\n}\nvar StoreReader = /** @class */ (function () {\n    function StoreReader(config) {\n        var _this = this;\n        this.knownResults = new (canUseWeakMap ? WeakMap : Map)();\n        this.config = compact(config, {\n            addTypename: config.addTypename !== false,\n            canonizeResults: shouldCanonizeResults(config),\n        });\n        this.canon = config.canon || new ObjectCanon();\n        // memoized functions in this class will be \"garbage-collected\"\n        // by recreating the whole `StoreReader` in\n        // `InMemoryCache.resetResultsCache`\n        // (triggered from `InMemoryCache.gc` with `resetResultCache: true`)\n        this.executeSelectionSet = wrap(function (options) {\n            var _a;\n            var canonizeResults = options.context.canonizeResults;\n            var peekArgs = execSelectionSetKeyArgs(options);\n            // Negate this boolean option so we can find out if we've already read\n            // this result using the other boolean value.\n            peekArgs[3] = !canonizeResults;\n            var other = (_a = _this.executeSelectionSet).peek.apply(_a, peekArgs);\n            if (other) {\n                if (canonizeResults) {\n                    return __assign(__assign({}, other), { \n                        // If we previously read this result without canonizing it, we can\n                        // reuse that result simply by canonizing it now.\n                        result: _this.canon.admit(other.result) });\n                }\n                // If we previously read this result with canonization enabled, we can\n                // return that canonized result as-is.\n                return other;\n            }\n            maybeDependOnExistenceOfEntity(options.context.store, options.enclosingRef.__ref);\n            // Finally, if we didn't find any useful previous results, run the real\n            // execSelectionSetImpl method with the given options.\n            return _this.execSelectionSetImpl(options);\n        }, {\n            max: this.config.resultCacheMaxSize ||\n                cacheSizes[\"inMemoryCache.executeSelectionSet\"] ||\n                50000 /* defaultCacheSizes[\"inMemoryCache.executeSelectionSet\"] */,\n            keyArgs: execSelectionSetKeyArgs,\n            // Note that the parameters of makeCacheKey are determined by the\n            // array returned by keyArgs.\n            makeCacheKey: function (selectionSet, parent, context, canonizeResults) {\n                if (supportsResultCaching(context.store)) {\n                    return context.store.makeCacheKey(selectionSet, isReference(parent) ? parent.__ref : parent, context.varString, canonizeResults);\n                }\n            },\n        });\n        this.executeSubSelectedArray = wrap(function (options) {\n            maybeDependOnExistenceOfEntity(options.context.store, options.enclosingRef.__ref);\n            return _this.execSubSelectedArrayImpl(options);\n        }, {\n            max: this.config.resultCacheMaxSize ||\n                cacheSizes[\"inMemoryCache.executeSubSelectedArray\"] ||\n                10000 /* defaultCacheSizes[\"inMemoryCache.executeSubSelectedArray\"] */,\n            makeCacheKey: function (_a) {\n                var field = _a.field, array = _a.array, context = _a.context;\n                if (supportsResultCaching(context.store)) {\n                    return context.store.makeCacheKey(field, array, context.varString);\n                }\n            },\n        });\n    }\n    StoreReader.prototype.resetCanon = function () {\n        this.canon = new ObjectCanon();\n    };\n    /**\n     * Given a store and a query, return as much of the result as possible and\n     * identify if any data was missing from the store.\n     */\n    StoreReader.prototype.diffQueryAgainstStore = function (_a) {\n        var store = _a.store, query = _a.query, _b = _a.rootId, rootId = _b === void 0 ? \"ROOT_QUERY\" : _b, variables = _a.variables, _c = _a.returnPartialData, returnPartialData = _c === void 0 ? true : _c, _d = _a.canonizeResults, canonizeResults = _d === void 0 ? this.config.canonizeResults : _d;\n        var policies = this.config.cache.policies;\n        variables = __assign(__assign({}, getDefaultValues(getQueryDefinition(query))), variables);\n        var rootRef = makeReference(rootId);\n        var execResult = this.executeSelectionSet({\n            selectionSet: getMainDefinition(query).selectionSet,\n            objectOrReference: rootRef,\n            enclosingRef: rootRef,\n            context: __assign({ store: store, query: query, policies: policies, variables: variables, varString: canonicalStringify(variables), canonizeResults: canonizeResults }, extractFragmentContext(query, this.config.fragments)),\n        });\n        var missing;\n        if (execResult.missing) {\n            // For backwards compatibility we still report an array of\n            // MissingFieldError objects, even though there will only ever be at most\n            // one of them, now that all missing field error messages are grouped\n            // together in the execResult.missing tree.\n            missing = [\n                new MissingFieldError(firstMissing(execResult.missing), execResult.missing, query, variables),\n            ];\n            if (!returnPartialData) {\n                throw missing[0];\n            }\n        }\n        return {\n            result: execResult.result,\n            complete: !missing,\n            missing: missing,\n        };\n    };\n    StoreReader.prototype.isFresh = function (result, parent, selectionSet, context) {\n        if (supportsResultCaching(context.store) &&\n            this.knownResults.get(result) === selectionSet) {\n            var latest = this.executeSelectionSet.peek(selectionSet, parent, context, \n            // If result is canonical, then it could only have been previously\n            // cached by the canonizing version of executeSelectionSet, so we can\n            // avoid checking both possibilities here.\n            this.canon.isKnown(result));\n            if (latest && result === latest.result) {\n                return true;\n            }\n        }\n        return false;\n    };\n    // Uncached version of executeSelectionSet.\n    StoreReader.prototype.execSelectionSetImpl = function (_a) {\n        var _this = this;\n        var selectionSet = _a.selectionSet, objectOrReference = _a.objectOrReference, enclosingRef = _a.enclosingRef, context = _a.context;\n        if (isReference(objectOrReference) &&\n            !context.policies.rootTypenamesById[objectOrReference.__ref] &&\n            !context.store.has(objectOrReference.__ref)) {\n            return {\n                result: this.canon.empty,\n                missing: \"Dangling reference to missing \".concat(objectOrReference.__ref, \" object\"),\n            };\n        }\n        var variables = context.variables, policies = context.policies, store = context.store;\n        var typename = store.getFieldValue(objectOrReference, \"__typename\");\n        var objectsToMerge = [];\n        var missing;\n        var missingMerger = new DeepMerger();\n        if (this.config.addTypename &&\n            typeof typename === \"string\" &&\n            !policies.rootIdsByTypename[typename]) {\n            // Ensure we always include a default value for the __typename\n            // field, if we have one, and this.config.addTypename is true. Note\n            // that this field can be overridden by other merged objects.\n            objectsToMerge.push({ __typename: typename });\n        }\n        function handleMissing(result, resultName) {\n            var _a;\n            if (result.missing) {\n                missing = missingMerger.merge(missing, (_a = {},\n                    _a[resultName] = result.missing,\n                    _a));\n            }\n            return result.result;\n        }\n        var workSet = new Set(selectionSet.selections);\n        workSet.forEach(function (selection) {\n            var _a, _b;\n            // Omit fields with directives @skip(if: <truthy value>) or\n            // @include(if: <falsy value>).\n            if (!shouldInclude(selection, variables))\n                return;\n            if (isField(selection)) {\n                var fieldValue = policies.readField({\n                    fieldName: selection.name.value,\n                    field: selection,\n                    variables: context.variables,\n                    from: objectOrReference,\n                }, context);\n                var resultName = resultKeyNameFromField(selection);\n                if (fieldValue === void 0) {\n                    if (!addTypenameToDocument.added(selection)) {\n                        missing = missingMerger.merge(missing, (_a = {},\n                            _a[resultName] = \"Can't find field '\".concat(selection.name.value, \"' on \").concat(isReference(objectOrReference) ?\n                                objectOrReference.__ref + \" object\"\n                                : \"object \" + JSON.stringify(objectOrReference, null, 2)),\n                            _a));\n                    }\n                }\n                else if (isArray(fieldValue)) {\n                    if (fieldValue.length > 0) {\n                        fieldValue = handleMissing(_this.executeSubSelectedArray({\n                            field: selection,\n                            array: fieldValue,\n                            enclosingRef: enclosingRef,\n                            context: context,\n                        }), resultName);\n                    }\n                }\n                else if (!selection.selectionSet) {\n                    // If the field does not have a selection set, then we handle it\n                    // as a scalar value. To keep this.canon from canonicalizing\n                    // this value, we use this.canon.pass to wrap fieldValue in a\n                    // Pass object that this.canon.admit will later unwrap as-is.\n                    if (context.canonizeResults) {\n                        fieldValue = _this.canon.pass(fieldValue);\n                    }\n                }\n                else if (fieldValue != null) {\n                    // In this case, because we know the field has a selection set,\n                    // it must be trying to query a GraphQLObjectType, which is why\n                    // fieldValue must be != null.\n                    fieldValue = handleMissing(_this.executeSelectionSet({\n                        selectionSet: selection.selectionSet,\n                        objectOrReference: fieldValue,\n                        enclosingRef: isReference(fieldValue) ? fieldValue : enclosingRef,\n                        context: context,\n                    }), resultName);\n                }\n                if (fieldValue !== void 0) {\n                    objectsToMerge.push((_b = {}, _b[resultName] = fieldValue, _b));\n                }\n            }\n            else {\n                var fragment = getFragmentFromSelection(selection, context.lookupFragment);\n                if (!fragment && selection.kind === Kind.FRAGMENT_SPREAD) {\n                    throw newInvariantError(9, selection.name.value);\n                }\n                if (fragment && policies.fragmentMatches(fragment, typename)) {\n                    fragment.selectionSet.selections.forEach(workSet.add, workSet);\n                }\n            }\n        });\n        var result = mergeDeepArray(objectsToMerge);\n        var finalResult = { result: result, missing: missing };\n        var frozen = context.canonizeResults ?\n            this.canon.admit(finalResult)\n            // Since this.canon is normally responsible for freezing results (only in\n            // development), freeze them manually if canonization is disabled.\n            : maybeDeepFreeze(finalResult);\n        // Store this result with its selection set so that we can quickly\n        // recognize it again in the StoreReader#isFresh method.\n        if (frozen.result) {\n            this.knownResults.set(frozen.result, selectionSet);\n        }\n        return frozen;\n    };\n    // Uncached version of executeSubSelectedArray.\n    StoreReader.prototype.execSubSelectedArrayImpl = function (_a) {\n        var _this = this;\n        var field = _a.field, array = _a.array, enclosingRef = _a.enclosingRef, context = _a.context;\n        var missing;\n        var missingMerger = new DeepMerger();\n        function handleMissing(childResult, i) {\n            var _a;\n            if (childResult.missing) {\n                missing = missingMerger.merge(missing, (_a = {}, _a[i] = childResult.missing, _a));\n            }\n            return childResult.result;\n        }\n        if (field.selectionSet) {\n            array = array.filter(context.store.canRead);\n        }\n        array = array.map(function (item, i) {\n            // null value in array\n            if (item === null) {\n                return null;\n            }\n            // This is a nested array, recurse\n            if (isArray(item)) {\n                return handleMissing(_this.executeSubSelectedArray({\n                    field: field,\n                    array: item,\n                    enclosingRef: enclosingRef,\n                    context: context,\n                }), i);\n            }\n            // This is an object, run the selection set on it\n            if (field.selectionSet) {\n                return handleMissing(_this.executeSelectionSet({\n                    selectionSet: field.selectionSet,\n                    objectOrReference: item,\n                    enclosingRef: isReference(item) ? item : enclosingRef,\n                    context: context,\n                }), i);\n            }\n            if (globalThis.__DEV__ !== false) {\n                assertSelectionSetForIdValue(context.store, field, item);\n            }\n            return item;\n        });\n        return {\n            result: context.canonizeResults ? this.canon.admit(array) : array,\n            missing: missing,\n        };\n    };\n    return StoreReader;\n}());\nexport { StoreReader };\nfunction firstMissing(tree) {\n    try {\n        JSON.stringify(tree, function (_, value) {\n            if (typeof value === \"string\")\n                throw value;\n            return value;\n        });\n    }\n    catch (result) {\n        return result;\n    }\n}\nfunction assertSelectionSetForIdValue(store, field, fieldValue) {\n    if (!field.selectionSet) {\n        var workSet_1 = new Set([fieldValue]);\n        workSet_1.forEach(function (value) {\n            if (isNonNullObject(value)) {\n                invariant(\n                    !isReference(value),\n                    10,\n                    getTypenameFromStoreObject(store, value),\n                    field.name.value\n                );\n                Object.values(value).forEach(workSet_1.add, workSet_1);\n            }\n        });\n    }\n}\n//# sourceMappingURL=readFromStore.js.map","import { invariant } from \"../../utilities/globals/index.js\";\nimport { argumentsObjectFromField, DeepMerger, isNonEmptyArray, isNonNullObject, } from \"../../utilities/index.js\";\nimport { hasOwn, isArray } from \"./helpers.js\";\n// Mapping from JSON-encoded KeySpecifier strings to associated information.\nvar specifierInfoCache = Object.create(null);\nfunction lookupSpecifierInfo(spec) {\n    // It's safe to encode KeySpecifier arrays with JSON.stringify, since they're\n    // just arrays of strings or nested KeySpecifier arrays, and the order of the\n    // array elements is important (and suitably preserved by JSON.stringify).\n    var cacheKey = JSON.stringify(spec);\n    return (specifierInfoCache[cacheKey] ||\n        (specifierInfoCache[cacheKey] = Object.create(null)));\n}\nexport function keyFieldsFnFromSpecifier(specifier) {\n    var info = lookupSpecifierInfo(specifier);\n    return (info.keyFieldsFn || (info.keyFieldsFn = function (object, context) {\n            var extract = function (from, key) {\n                return context.readField(key, from);\n            };\n            var keyObject = (context.keyObject = collectSpecifierPaths(specifier, function (schemaKeyPath) {\n                var extracted = extractKeyPath(context.storeObject, schemaKeyPath, \n                // Using context.readField to extract paths from context.storeObject\n                // allows the extraction to see through Reference objects and respect\n                // custom read functions.\n                extract);\n                if (extracted === void 0 &&\n                    object !== context.storeObject &&\n                    hasOwn.call(object, schemaKeyPath[0])) {\n                    // If context.storeObject fails to provide a value for the requested\n                    // path, fall back to the raw result object, if it has a top-level key\n                    // matching the first key in the path (schemaKeyPath[0]). This allows\n                    // key fields included in the written data to be saved in the cache\n                    // even if they are not selected explicitly in context.selectionSet.\n                    // Not being mentioned by context.selectionSet is convenient here,\n                    // since it means these extra fields cannot be affected by field\n                    // aliasing, which is why we can use extractKey instead of\n                    // context.readField for this extraction.\n                    extracted = extractKeyPath(object, schemaKeyPath, extractKey);\n                }\n                invariant(extracted !== void 0, 4, schemaKeyPath.join(\".\"), object);\n                return extracted;\n            }));\n            return \"\".concat(context.typename, \":\").concat(JSON.stringify(keyObject));\n        }));\n}\n// The keyArgs extraction process is roughly analogous to keyFields extraction,\n// but there are no aliases involved, missing fields are tolerated (by merely\n// omitting them from the key), and drawing from field.directives or variables\n// is allowed (in addition to drawing from the field's arguments object).\n// Concretely, these differences mean passing a different key path extractor\n// function to collectSpecifierPaths, reusing the shared extractKeyPath helper\n// wherever possible.\nexport function keyArgsFnFromSpecifier(specifier) {\n    var info = lookupSpecifierInfo(specifier);\n    return (info.keyArgsFn ||\n        (info.keyArgsFn = function (args, _a) {\n            var field = _a.field, variables = _a.variables, fieldName = _a.fieldName;\n            var collected = collectSpecifierPaths(specifier, function (keyPath) {\n                var firstKey = keyPath[0];\n                var firstChar = firstKey.charAt(0);\n                if (firstChar === \"@\") {\n                    if (field && isNonEmptyArray(field.directives)) {\n                        var directiveName_1 = firstKey.slice(1);\n                        // If the directive appears multiple times, only the first\n                        // occurrence's arguments will be used. TODO Allow repetition?\n                        // TODO Cache this work somehow, a la aliasMap?\n                        var d = field.directives.find(function (d) { return d.name.value === directiveName_1; });\n                        // Fortunately argumentsObjectFromField works for DirectiveNode!\n                        var directiveArgs = d && argumentsObjectFromField(d, variables);\n                        // For directives without arguments (d defined, but directiveArgs ===\n                        // null), the presence or absence of the directive still counts as\n                        // part of the field key, so we return null in those cases. If no\n                        // directive with this name was found for this field (d undefined and\n                        // thus directiveArgs undefined), we return undefined, which causes\n                        // this value to be omitted from the key object returned by\n                        // collectSpecifierPaths.\n                        return (directiveArgs &&\n                            extractKeyPath(directiveArgs, \n                            // If keyPath.length === 1, this code calls extractKeyPath with an\n                            // empty path, which works because it uses directiveArgs as the\n                            // extracted value.\n                            keyPath.slice(1)));\n                    }\n                    // If the key started with @ but there was no corresponding directive,\n                    // we want to omit this value from the key object, not fall through to\n                    // treating @whatever as a normal argument name.\n                    return;\n                }\n                if (firstChar === \"$\") {\n                    var variableName = firstKey.slice(1);\n                    if (variables && hasOwn.call(variables, variableName)) {\n                        var varKeyPath = keyPath.slice(0);\n                        varKeyPath[0] = variableName;\n                        return extractKeyPath(variables, varKeyPath);\n                    }\n                    // If the key started with $ but there was no corresponding variable, we\n                    // want to omit this value from the key object, not fall through to\n                    // treating $whatever as a normal argument name.\n                    return;\n                }\n                if (args) {\n                    return extractKeyPath(args, keyPath);\n                }\n            });\n            var suffix = JSON.stringify(collected);\n            // If no arguments were passed to this field, and it didn't have any other\n            // field key contributions from directives or variables, hide the empty\n            // :{} suffix from the field key. However, a field passed no arguments can\n            // still end up with a non-empty :{...} suffix if its key configuration\n            // refers to directives or variables.\n            if (args || suffix !== \"{}\") {\n                fieldName += \":\" + suffix;\n            }\n            return fieldName;\n        }));\n}\nexport function collectSpecifierPaths(specifier, extractor) {\n    // For each path specified by specifier, invoke the extractor, and repeatedly\n    // merge the results together, with appropriate ancestor context.\n    var merger = new DeepMerger();\n    return getSpecifierPaths(specifier).reduce(function (collected, path) {\n        var _a;\n        var toMerge = extractor(path);\n        if (toMerge !== void 0) {\n            // This path is not expected to contain array indexes, so the toMerge\n            // reconstruction will not contain arrays. TODO Fix this?\n            for (var i = path.length - 1; i >= 0; --i) {\n                toMerge = (_a = {}, _a[path[i]] = toMerge, _a);\n            }\n            collected = merger.merge(collected, toMerge);\n        }\n        return collected;\n    }, Object.create(null));\n}\nexport function getSpecifierPaths(spec) {\n    var info = lookupSpecifierInfo(spec);\n    if (!info.paths) {\n        var paths_1 = (info.paths = []);\n        var currentPath_1 = [];\n        spec.forEach(function (s, i) {\n            if (isArray(s)) {\n                getSpecifierPaths(s).forEach(function (p) { return paths_1.push(currentPath_1.concat(p)); });\n                currentPath_1.length = 0;\n            }\n            else {\n                currentPath_1.push(s);\n                if (!isArray(spec[i + 1])) {\n                    paths_1.push(currentPath_1.slice(0));\n                    currentPath_1.length = 0;\n                }\n            }\n        });\n    }\n    return info.paths;\n}\nfunction extractKey(object, key) {\n    return object[key];\n}\nexport function extractKeyPath(object, path, extract) {\n    // For each key in path, extract the corresponding child property from obj,\n    // flattening arrays if encountered (uncommon for keyFields and keyArgs, but\n    // possible). The final result of path.reduce is normalized so unexpected leaf\n    // objects have their keys safely sorted. That final result is difficult to\n    // type as anything other than any. You're welcome to try to improve the\n    // return type, but keep in mind extractKeyPath is not a public function\n    // (exported only for testing), so the effort may not be worthwhile unless the\n    // limited set of actual callers (see above) pass arguments that TypeScript\n    // can statically type. If we know only that path is some array of strings\n    // (and not, say, a specific tuple of statically known strings), any (or\n    // possibly unknown) is the honest answer.\n    extract = extract || extractKey;\n    return normalize(path.reduce(function reducer(obj, key) {\n        return isArray(obj) ?\n            obj.map(function (child) { return reducer(child, key); })\n            : obj && extract(obj, key);\n    }, object));\n}\nfunction normalize(value) {\n    // Usually the extracted value will be a scalar value, since most primary\n    // key fields are scalar, but just in case we get an object or an array, we\n    // need to do some normalization of the order of (nested) keys.\n    if (isNonNullObject(value)) {\n        if (isArray(value)) {\n            return value.map(normalize);\n        }\n        return collectSpecifierPaths(Object.keys(value).sort(), function (path) {\n            return extractKeyPath(value, path);\n        });\n    }\n    return value;\n}\n//# sourceMappingURL=key-extractor.js.map","import { __assign, __rest } from \"tslib\";\nimport { invariant, newInvariantError } from \"../../utilities/globals/index.js\";\nimport { storeKeyNameFromField, argumentsObjectFromField, isReference, getStoreKeyName, isNonNullObject, stringifyForDisplay, } from \"../../utilities/index.js\";\nimport { hasOwn, fieldNameFromStoreName, storeValueIsStoreObject, selectionSetMatchesResult, TypeOrFieldNameRegExp, defaultDataIdFromObject, isArray, } from \"./helpers.js\";\nimport { cacheSlot } from \"./reactiveVars.js\";\nimport { keyArgsFnFromSpecifier, keyFieldsFnFromSpecifier, } from \"./key-extractor.js\";\nfunction argsFromFieldSpecifier(spec) {\n    return (spec.args !== void 0 ? spec.args\n        : spec.field ? argumentsObjectFromField(spec.field, spec.variables)\n            : null);\n}\nvar nullKeyFieldsFn = function () { return void 0; };\nvar simpleKeyArgsFn = function (_args, context) { return context.fieldName; };\n// These merge functions can be selected by specifying merge:true or\n// merge:false in a field policy.\nvar mergeTrueFn = function (existing, incoming, _a) {\n    var mergeObjects = _a.mergeObjects;\n    return mergeObjects(existing, incoming);\n};\nvar mergeFalseFn = function (_, incoming) { return incoming; };\nvar Policies = /** @class */ (function () {\n    function Policies(config) {\n        this.config = config;\n        this.typePolicies = Object.create(null);\n        this.toBeAdded = Object.create(null);\n        // Map from subtype names to sets of supertype names. Note that this\n        // representation inverts the structure of possibleTypes (whose keys are\n        // supertypes and whose values are arrays of subtypes) because it tends\n        // to be much more efficient to search upwards than downwards.\n        this.supertypeMap = new Map();\n        // Any fuzzy subtypes specified by possibleTypes will be converted to\n        // RegExp objects and recorded here. Every key of this map can also be\n        // found in supertypeMap. In many cases this Map will be empty, which\n        // means no fuzzy subtype checking will happen in fragmentMatches.\n        this.fuzzySubtypes = new Map();\n        this.rootIdsByTypename = Object.create(null);\n        this.rootTypenamesById = Object.create(null);\n        this.usingPossibleTypes = false;\n        this.config = __assign({ dataIdFromObject: defaultDataIdFromObject }, config);\n        this.cache = this.config.cache;\n        this.setRootTypename(\"Query\");\n        this.setRootTypename(\"Mutation\");\n        this.setRootTypename(\"Subscription\");\n        if (config.possibleTypes) {\n            this.addPossibleTypes(config.possibleTypes);\n        }\n        if (config.typePolicies) {\n            this.addTypePolicies(config.typePolicies);\n        }\n    }\n    Policies.prototype.identify = function (object, partialContext) {\n        var _a;\n        var policies = this;\n        var typename = (partialContext &&\n            (partialContext.typename || ((_a = partialContext.storeObject) === null || _a === void 0 ? void 0 : _a.__typename))) ||\n            object.__typename;\n        // It should be possible to write root Query fields with writeFragment,\n        // using { __typename: \"Query\", ... } as the data, but it does not make\n        // sense to allow the same identification behavior for the Mutation and\n        // Subscription types, since application code should never be writing\n        // directly to (or reading directly from) those root objects.\n        if (typename === this.rootTypenamesById.ROOT_QUERY) {\n            return [\"ROOT_QUERY\"];\n        }\n        // Default context.storeObject to object if not otherwise provided.\n        var storeObject = (partialContext && partialContext.storeObject) || object;\n        var context = __assign(__assign({}, partialContext), { typename: typename, storeObject: storeObject, readField: (partialContext && partialContext.readField) ||\n                function () {\n                    var options = normalizeReadFieldOptions(arguments, storeObject);\n                    return policies.readField(options, {\n                        store: policies.cache[\"data\"],\n                        variables: options.variables,\n                    });\n                } });\n        var id;\n        var policy = typename && this.getTypePolicy(typename);\n        var keyFn = (policy && policy.keyFn) || this.config.dataIdFromObject;\n        while (keyFn) {\n            var specifierOrId = keyFn(__assign(__assign({}, object), storeObject), context);\n            if (isArray(specifierOrId)) {\n                keyFn = keyFieldsFnFromSpecifier(specifierOrId);\n            }\n            else {\n                id = specifierOrId;\n                break;\n            }\n        }\n        id = id ? String(id) : void 0;\n        return context.keyObject ? [id, context.keyObject] : [id];\n    };\n    Policies.prototype.addTypePolicies = function (typePolicies) {\n        var _this = this;\n        Object.keys(typePolicies).forEach(function (typename) {\n            var _a = typePolicies[typename], queryType = _a.queryType, mutationType = _a.mutationType, subscriptionType = _a.subscriptionType, incoming = __rest(_a, [\"queryType\", \"mutationType\", \"subscriptionType\"]);\n            // Though {query,mutation,subscription}Type configurations are rare,\n            // it's important to call setRootTypename as early as possible,\n            // since these configurations should apply consistently for the\n            // entire lifetime of the cache. Also, since only one __typename can\n            // qualify as one of these root types, these three properties cannot\n            // be inherited, unlike the rest of the incoming properties. That\n            // restriction is convenient, because the purpose of this.toBeAdded\n            // is to delay the processing of type/field policies until the first\n            // time they're used, allowing policies to be added in any order as\n            // long as all relevant policies (including policies for supertypes)\n            // have been added by the time a given policy is used for the first\n            // time. In other words, since inheritance doesn't matter for these\n            // properties, there's also no need to delay their processing using\n            // the this.toBeAdded queue.\n            if (queryType)\n                _this.setRootTypename(\"Query\", typename);\n            if (mutationType)\n                _this.setRootTypename(\"Mutation\", typename);\n            if (subscriptionType)\n                _this.setRootTypename(\"Subscription\", typename);\n            if (hasOwn.call(_this.toBeAdded, typename)) {\n                _this.toBeAdded[typename].push(incoming);\n            }\n            else {\n                _this.toBeAdded[typename] = [incoming];\n            }\n        });\n    };\n    Policies.prototype.updateTypePolicy = function (typename, incoming) {\n        var _this = this;\n        var existing = this.getTypePolicy(typename);\n        var keyFields = incoming.keyFields, fields = incoming.fields;\n        function setMerge(existing, merge) {\n            existing.merge =\n                typeof merge === \"function\" ? merge\n                    // Pass merge:true as a shorthand for a merge implementation\n                    // that returns options.mergeObjects(existing, incoming).\n                    : merge === true ? mergeTrueFn\n                        // Pass merge:false to make incoming always replace existing\n                        // without any warnings about data clobbering.\n                        : merge === false ? mergeFalseFn\n                            : existing.merge;\n        }\n        // Type policies can define merge functions, as an alternative to\n        // using field policies to merge child objects.\n        setMerge(existing, incoming.merge);\n        existing.keyFn =\n            // Pass false to disable normalization for this typename.\n            keyFields === false ? nullKeyFieldsFn\n                // Pass an array of strings to use those fields to compute a\n                // composite ID for objects of this typename.\n                : isArray(keyFields) ? keyFieldsFnFromSpecifier(keyFields)\n                    // Pass a function to take full control over identification.\n                    : typeof keyFields === \"function\" ? keyFields\n                        // Leave existing.keyFn unchanged if above cases fail.\n                        : existing.keyFn;\n        if (fields) {\n            Object.keys(fields).forEach(function (fieldName) {\n                var existing = _this.getFieldPolicy(typename, fieldName, true);\n                var incoming = fields[fieldName];\n                if (typeof incoming === \"function\") {\n                    existing.read = incoming;\n                }\n                else {\n                    var keyArgs = incoming.keyArgs, read = incoming.read, merge = incoming.merge;\n                    existing.keyFn =\n                        // Pass false to disable argument-based differentiation of\n                        // field identities.\n                        keyArgs === false ? simpleKeyArgsFn\n                            // Pass an array of strings to use named arguments to\n                            // compute a composite identity for the field.\n                            : isArray(keyArgs) ? keyArgsFnFromSpecifier(keyArgs)\n                                // Pass a function to take full control over field identity.\n                                : typeof keyArgs === \"function\" ? keyArgs\n                                    // Leave existing.keyFn unchanged if above cases fail.\n                                    : existing.keyFn;\n                    if (typeof read === \"function\") {\n                        existing.read = read;\n                    }\n                    setMerge(existing, merge);\n                }\n                if (existing.read && existing.merge) {\n                    // If we have both a read and a merge function, assume\n                    // keyArgs:false, because read and merge together can take\n                    // responsibility for interpreting arguments in and out. This\n                    // default assumption can always be overridden by specifying\n                    // keyArgs explicitly in the FieldPolicy.\n                    existing.keyFn = existing.keyFn || simpleKeyArgsFn;\n                }\n            });\n        }\n    };\n    Policies.prototype.setRootTypename = function (which, typename) {\n        if (typename === void 0) { typename = which; }\n        var rootId = \"ROOT_\" + which.toUpperCase();\n        var old = this.rootTypenamesById[rootId];\n        if (typename !== old) {\n            invariant(!old || old === which, 5, which);\n            // First, delete any old __typename associated with this rootId from\n            // rootIdsByTypename.\n            if (old)\n                delete this.rootIdsByTypename[old];\n            // Now make this the only __typename that maps to this rootId.\n            this.rootIdsByTypename[typename] = rootId;\n            // Finally, update the __typename associated with this rootId.\n            this.rootTypenamesById[rootId] = typename;\n        }\n    };\n    Policies.prototype.addPossibleTypes = function (possibleTypes) {\n        var _this = this;\n        this.usingPossibleTypes = true;\n        Object.keys(possibleTypes).forEach(function (supertype) {\n            // Make sure all types have an entry in this.supertypeMap, even if\n            // their supertype set is empty, so we can return false immediately\n            // from policies.fragmentMatches for unknown supertypes.\n            _this.getSupertypeSet(supertype, true);\n            possibleTypes[supertype].forEach(function (subtype) {\n                _this.getSupertypeSet(subtype, true).add(supertype);\n                var match = subtype.match(TypeOrFieldNameRegExp);\n                if (!match || match[0] !== subtype) {\n                    // TODO Don't interpret just any invalid typename as a RegExp.\n                    _this.fuzzySubtypes.set(subtype, new RegExp(subtype));\n                }\n            });\n        });\n    };\n    Policies.prototype.getTypePolicy = function (typename) {\n        var _this = this;\n        if (!hasOwn.call(this.typePolicies, typename)) {\n            var policy_1 = (this.typePolicies[typename] = Object.create(null));\n            policy_1.fields = Object.create(null);\n            // When the TypePolicy for typename is first accessed, instead of\n            // starting with an empty policy object, inherit any properties or\n            // fields from the type policies of the supertypes of typename.\n            //\n            // Any properties or fields defined explicitly within the TypePolicy\n            // for typename will take precedence, and if there are multiple\n            // supertypes, the properties of policies whose types were added\n            // later via addPossibleTypes will take precedence over those of\n            // earlier supertypes. TODO Perhaps we should warn about these\n            // conflicts in development, and recommend defining the property\n            // explicitly in the subtype policy?\n            //\n            // Field policy inheritance is atomic/shallow: you can't inherit a\n            // field policy and then override just its read function, since read\n            // and merge functions often need to cooperate, so changing only one\n            // of them would be a recipe for inconsistency.\n            //\n            // Once the TypePolicy for typename has been accessed, its properties can\n            // still be updated directly using addTypePolicies, but future changes to\n            // inherited supertype policies will not be reflected in this subtype\n            // policy, because this code runs at most once per typename.\n            var supertypes_1 = this.supertypeMap.get(typename);\n            if (!supertypes_1 && this.fuzzySubtypes.size) {\n                // To make the inheritance logic work for unknown typename strings that\n                // may have fuzzy supertypes, we give this typename an empty supertype\n                // set and then populate it with any fuzzy supertypes that match.\n                supertypes_1 = this.getSupertypeSet(typename, true);\n                // This only works for typenames that are directly matched by a fuzzy\n                // supertype. What if there is an intermediate chain of supertypes?\n                // While possible, that situation can only be solved effectively by\n                // specifying the intermediate relationships via possibleTypes, manually\n                // and in a non-fuzzy way.\n                this.fuzzySubtypes.forEach(function (regExp, fuzzy) {\n                    if (regExp.test(typename)) {\n                        // The fuzzy parameter is just the original string version of regExp\n                        // (not a valid __typename string), but we can look up the\n                        // associated supertype(s) in this.supertypeMap.\n                        var fuzzySupertypes = _this.supertypeMap.get(fuzzy);\n                        if (fuzzySupertypes) {\n                            fuzzySupertypes.forEach(function (supertype) {\n                                return supertypes_1.add(supertype);\n                            });\n                        }\n                    }\n                });\n            }\n            if (supertypes_1 && supertypes_1.size) {\n                supertypes_1.forEach(function (supertype) {\n                    var _a = _this.getTypePolicy(supertype), fields = _a.fields, rest = __rest(_a, [\"fields\"]);\n                    Object.assign(policy_1, rest);\n                    Object.assign(policy_1.fields, fields);\n                });\n            }\n        }\n        var inbox = this.toBeAdded[typename];\n        if (inbox && inbox.length) {\n            // Merge the pending policies into this.typePolicies, in the order they\n            // were originally passed to addTypePolicy.\n            inbox.splice(0).forEach(function (policy) {\n                _this.updateTypePolicy(typename, policy);\n            });\n        }\n        return this.typePolicies[typename];\n    };\n    Policies.prototype.getFieldPolicy = function (typename, fieldName, createIfMissing) {\n        if (typename) {\n            var fieldPolicies = this.getTypePolicy(typename).fields;\n            return (fieldPolicies[fieldName] ||\n                (createIfMissing && (fieldPolicies[fieldName] = Object.create(null))));\n        }\n    };\n    Policies.prototype.getSupertypeSet = function (subtype, createIfMissing) {\n        var supertypeSet = this.supertypeMap.get(subtype);\n        if (!supertypeSet && createIfMissing) {\n            this.supertypeMap.set(subtype, (supertypeSet = new Set()));\n        }\n        return supertypeSet;\n    };\n    Policies.prototype.fragmentMatches = function (fragment, typename, result, variables) {\n        var _this = this;\n        if (!fragment.typeCondition)\n            return true;\n        // If the fragment has a type condition but the object we're matching\n        // against does not have a __typename, the fragment cannot match.\n        if (!typename)\n            return false;\n        var supertype = fragment.typeCondition.name.value;\n        // Common case: fragment type condition and __typename are the same.\n        if (typename === supertype)\n            return true;\n        if (this.usingPossibleTypes && this.supertypeMap.has(supertype)) {\n            var typenameSupertypeSet = this.getSupertypeSet(typename, true);\n            var workQueue_1 = [typenameSupertypeSet];\n            var maybeEnqueue_1 = function (subtype) {\n                var supertypeSet = _this.getSupertypeSet(subtype, false);\n                if (supertypeSet &&\n                    supertypeSet.size &&\n                    workQueue_1.indexOf(supertypeSet) < 0) {\n                    workQueue_1.push(supertypeSet);\n                }\n            };\n            // We need to check fuzzy subtypes only if we encountered fuzzy\n            // subtype strings in addPossibleTypes, and only while writing to\n            // the cache, since that's when selectionSetMatchesResult gives a\n            // strong signal of fragment matching. The StoreReader class calls\n            // policies.fragmentMatches without passing a result object, so\n            // needToCheckFuzzySubtypes is always false while reading.\n            var needToCheckFuzzySubtypes = !!(result && this.fuzzySubtypes.size);\n            var checkingFuzzySubtypes = false;\n            // It's important to keep evaluating workQueue.length each time through\n            // the loop, because the queue can grow while we're iterating over it.\n            for (var i = 0; i < workQueue_1.length; ++i) {\n                var supertypeSet = workQueue_1[i];\n                if (supertypeSet.has(supertype)) {\n                    if (!typenameSupertypeSet.has(supertype)) {\n                        if (checkingFuzzySubtypes) {\n                            globalThis.__DEV__ !== false && invariant.warn(6, typename, supertype);\n                        }\n                        // Record positive results for faster future lookup.\n                        // Unfortunately, we cannot safely cache negative results,\n                        // because new possibleTypes data could always be added to the\n                        // Policies class.\n                        typenameSupertypeSet.add(supertype);\n                    }\n                    return true;\n                }\n                supertypeSet.forEach(maybeEnqueue_1);\n                if (needToCheckFuzzySubtypes &&\n                    // Start checking fuzzy subtypes only after exhausting all\n                    // non-fuzzy subtypes (after the final iteration of the loop).\n                    i === workQueue_1.length - 1 &&\n                    // We could wait to compare fragment.selectionSet to result\n                    // after we verify the supertype, but this check is often less\n                    // expensive than that search, and we will have to do the\n                    // comparison anyway whenever we find a potential match.\n                    selectionSetMatchesResult(fragment.selectionSet, result, variables)) {\n                    // We don't always need to check fuzzy subtypes (if no result\n                    // was provided, or !this.fuzzySubtypes.size), but, when we do,\n                    // we only want to check them once.\n                    needToCheckFuzzySubtypes = false;\n                    checkingFuzzySubtypes = true;\n                    // If we find any fuzzy subtypes that match typename, extend the\n                    // workQueue to search through the supertypes of those fuzzy\n                    // subtypes. Otherwise the for-loop will terminate and we'll\n                    // return false below.\n                    this.fuzzySubtypes.forEach(function (regExp, fuzzyString) {\n                        var match = typename.match(regExp);\n                        if (match && match[0] === typename) {\n                            maybeEnqueue_1(fuzzyString);\n                        }\n                    });\n                }\n            }\n        }\n        return false;\n    };\n    Policies.prototype.hasKeyArgs = function (typename, fieldName) {\n        var policy = this.getFieldPolicy(typename, fieldName, false);\n        return !!(policy && policy.keyFn);\n    };\n    Policies.prototype.getStoreFieldName = function (fieldSpec) {\n        var typename = fieldSpec.typename, fieldName = fieldSpec.fieldName;\n        var policy = this.getFieldPolicy(typename, fieldName, false);\n        var storeFieldName;\n        var keyFn = policy && policy.keyFn;\n        if (keyFn && typename) {\n            var context = {\n                typename: typename,\n                fieldName: fieldName,\n                field: fieldSpec.field || null,\n                variables: fieldSpec.variables,\n            };\n            var args = argsFromFieldSpecifier(fieldSpec);\n            while (keyFn) {\n                var specifierOrString = keyFn(args, context);\n                if (isArray(specifierOrString)) {\n                    keyFn = keyArgsFnFromSpecifier(specifierOrString);\n                }\n                else {\n                    // If the custom keyFn returns a falsy value, fall back to\n                    // fieldName instead.\n                    storeFieldName = specifierOrString || fieldName;\n                    break;\n                }\n            }\n        }\n        if (storeFieldName === void 0) {\n            storeFieldName =\n                fieldSpec.field ?\n                    storeKeyNameFromField(fieldSpec.field, fieldSpec.variables)\n                    : getStoreKeyName(fieldName, argsFromFieldSpecifier(fieldSpec));\n        }\n        // Returning false from a keyArgs function is like configuring\n        // keyArgs: false, but more dynamic.\n        if (storeFieldName === false) {\n            return fieldName;\n        }\n        // Make sure custom field names start with the actual field.name.value\n        // of the field, so we can always figure out which properties of a\n        // StoreObject correspond to which original field names.\n        return fieldName === fieldNameFromStoreName(storeFieldName) ? storeFieldName\n            : fieldName + \":\" + storeFieldName;\n    };\n    Policies.prototype.readField = function (options, context) {\n        var objectOrReference = options.from;\n        if (!objectOrReference)\n            return;\n        var nameOrField = options.field || options.fieldName;\n        if (!nameOrField)\n            return;\n        if (options.typename === void 0) {\n            var typename = context.store.getFieldValue(objectOrReference, \"__typename\");\n            if (typename)\n                options.typename = typename;\n        }\n        var storeFieldName = this.getStoreFieldName(options);\n        var fieldName = fieldNameFromStoreName(storeFieldName);\n        var existing = context.store.getFieldValue(objectOrReference, storeFieldName);\n        var policy = this.getFieldPolicy(options.typename, fieldName, false);\n        var read = policy && policy.read;\n        if (read) {\n            var readOptions = makeFieldFunctionOptions(this, objectOrReference, options, context, context.store.getStorage(isReference(objectOrReference) ?\n                objectOrReference.__ref\n                : objectOrReference, storeFieldName));\n            // Call read(existing, readOptions) with cacheSlot holding this.cache.\n            return cacheSlot.withValue(this.cache, read, [\n                existing,\n                readOptions,\n            ]);\n        }\n        return existing;\n    };\n    Policies.prototype.getReadFunction = function (typename, fieldName) {\n        var policy = this.getFieldPolicy(typename, fieldName, false);\n        return policy && policy.read;\n    };\n    Policies.prototype.getMergeFunction = function (parentTypename, fieldName, childTypename) {\n        var policy = this.getFieldPolicy(parentTypename, fieldName, false);\n        var merge = policy && policy.merge;\n        if (!merge && childTypename) {\n            policy = this.getTypePolicy(childTypename);\n            merge = policy && policy.merge;\n        }\n        return merge;\n    };\n    Policies.prototype.runMergeFunction = function (existing, incoming, _a, context, storage) {\n        var field = _a.field, typename = _a.typename, merge = _a.merge;\n        if (merge === mergeTrueFn) {\n            // Instead of going to the trouble of creating a full\n            // FieldFunctionOptions object and calling mergeTrueFn, we can\n            // simply call mergeObjects, as mergeTrueFn would.\n            return makeMergeObjectsFunction(context.store)(existing, incoming);\n        }\n        if (merge === mergeFalseFn) {\n            // Likewise for mergeFalseFn, whose implementation is even simpler.\n            return incoming;\n        }\n        // If cache.writeQuery or cache.writeFragment was called with\n        // options.overwrite set to true, we still call merge functions, but\n        // the existing data is always undefined, so the merge function will\n        // not attempt to combine the incoming data with the existing data.\n        if (context.overwrite) {\n            existing = void 0;\n        }\n        return merge(existing, incoming, makeFieldFunctionOptions(this, \n        // Unlike options.readField for read functions, we do not fall\n        // back to the current object if no foreignObjOrRef is provided,\n        // because it's not clear what the current object should be for\n        // merge functions: the (possibly undefined) existing object, or\n        // the incoming object? If you think your merge function needs\n        // to read sibling fields in order to produce a new value for\n        // the current field, you might want to rethink your strategy,\n        // because that's a recipe for making merge behavior sensitive\n        // to the order in which fields are written into the cache.\n        // However, readField(name, ref) is useful for merge functions\n        // that need to deduplicate child objects and references.\n        void 0, {\n            typename: typename,\n            fieldName: field.name.value,\n            field: field,\n            variables: context.variables,\n        }, context, storage || Object.create(null)));\n    };\n    return Policies;\n}());\nexport { Policies };\nfunction makeFieldFunctionOptions(policies, objectOrReference, fieldSpec, context, storage) {\n    var storeFieldName = policies.getStoreFieldName(fieldSpec);\n    var fieldName = fieldNameFromStoreName(storeFieldName);\n    var variables = fieldSpec.variables || context.variables;\n    var _a = context.store, toReference = _a.toReference, canRead = _a.canRead;\n    return {\n        args: argsFromFieldSpecifier(fieldSpec),\n        field: fieldSpec.field || null,\n        fieldName: fieldName,\n        storeFieldName: storeFieldName,\n        variables: variables,\n        isReference: isReference,\n        toReference: toReference,\n        storage: storage,\n        cache: policies.cache,\n        canRead: canRead,\n        readField: function () {\n            return policies.readField(normalizeReadFieldOptions(arguments, objectOrReference, variables), context);\n        },\n        mergeObjects: makeMergeObjectsFunction(context.store),\n    };\n}\nexport function normalizeReadFieldOptions(readFieldArgs, objectOrReference, variables) {\n    var fieldNameOrOptions = readFieldArgs[0], from = readFieldArgs[1], argc = readFieldArgs.length;\n    var options;\n    if (typeof fieldNameOrOptions === \"string\") {\n        options = {\n            fieldName: fieldNameOrOptions,\n            // Default to objectOrReference only when no second argument was\n            // passed for the from parameter, not when undefined is explicitly\n            // passed as the second argument.\n            from: argc > 1 ? from : objectOrReference,\n        };\n    }\n    else {\n        options = __assign({}, fieldNameOrOptions);\n        // Default to objectOrReference only when fieldNameOrOptions.from is\n        // actually omitted, rather than just undefined.\n        if (!hasOwn.call(options, \"from\")) {\n            options.from = objectOrReference;\n        }\n    }\n    if (globalThis.__DEV__ !== false && options.from === void 0) {\n        globalThis.__DEV__ !== false && invariant.warn(7, stringifyForDisplay(Array.from(readFieldArgs)));\n    }\n    if (void 0 === options.variables) {\n        options.variables = variables;\n    }\n    return options;\n}\nfunction makeMergeObjectsFunction(store) {\n    return function mergeObjects(existing, incoming) {\n        if (isArray(existing) || isArray(incoming)) {\n            throw newInvariantError(8);\n        }\n        // These dynamic checks are necessary because the parameters of a\n        // custom merge function can easily have the any type, so the type\n        // system cannot always enforce the StoreObject | Reference parameter\n        // types of options.mergeObjects.\n        if (isNonNullObject(existing) && isNonNullObject(incoming)) {\n            var eType = store.getFieldValue(existing, \"__typename\");\n            var iType = store.getFieldValue(incoming, \"__typename\");\n            var typesDiffer = eType && iType && eType !== iType;\n            if (typesDiffer) {\n                return incoming;\n            }\n            if (isReference(existing) && storeValueIsStoreObject(incoming)) {\n                // Update the normalized EntityStore for the entity identified by\n                // existing.__ref, preferring/overwriting any fields contributed by the\n                // newer incoming StoreObject.\n                store.merge(existing.__ref, incoming);\n                return existing;\n            }\n            if (storeValueIsStoreObject(existing) && isReference(incoming)) {\n                // Update the normalized EntityStore for the entity identified by\n                // incoming.__ref, taking fields from the older existing object only if\n                // those fields are not already present in the newer StoreObject\n                // identified by incoming.__ref.\n                store.merge(existing, incoming.__ref);\n                return incoming;\n            }\n            if (storeValueIsStoreObject(existing) &&\n                storeValueIsStoreObject(incoming)) {\n                return __assign(__assign({}, existing), incoming);\n            }\n        }\n        return incoming;\n    };\n}\n//# sourceMappingURL=policies.js.map","import { __assign } from \"tslib\";\nimport { invariant, newInvariantError } from \"../../utilities/globals/index.js\";\nimport { equal } from \"@wry/equality\";\nimport { Trie } from \"@wry/trie\";\nimport { Kind } from \"graphql\";\nimport { getFragmentFromSelection, getDefaultValues, getOperationDefinition, getTypenameFromResult, makeReference, isField, resultKeyNameFromField, isReference, shouldInclude, cloneDeep, addTypenameToDocument, isNonEmptyArray, argumentsObjectFromField, canonicalStringify, } from \"../../utilities/index.js\";\nimport { isArray, makeProcessedFieldsMerger, fieldNameFromStoreName, storeValueIsStoreObject, extractFragmentContext, } from \"./helpers.js\";\nimport { normalizeReadFieldOptions } from \"./policies.js\";\n// Since there are only four possible combinations of context.clientOnly and\n// context.deferred values, we should need at most four \"flavors\" of any given\n// WriteContext. To avoid creating multiple copies of the same context, we cache\n// the contexts in the context.flavors Map (shared by all flavors) according to\n// their clientOnly and deferred values (always in that order).\nfunction getContextFlavor(context, clientOnly, deferred) {\n    var key = \"\".concat(clientOnly).concat(deferred);\n    var flavored = context.flavors.get(key);\n    if (!flavored) {\n        context.flavors.set(key, (flavored =\n            context.clientOnly === clientOnly && context.deferred === deferred ?\n                context\n                : __assign(__assign({}, context), { clientOnly: clientOnly, deferred: deferred })));\n    }\n    return flavored;\n}\nvar StoreWriter = /** @class */ (function () {\n    function StoreWriter(cache, reader, fragments) {\n        this.cache = cache;\n        this.reader = reader;\n        this.fragments = fragments;\n    }\n    StoreWriter.prototype.writeToStore = function (store, _a) {\n        var _this = this;\n        var query = _a.query, result = _a.result, dataId = _a.dataId, variables = _a.variables, overwrite = _a.overwrite;\n        var operationDefinition = getOperationDefinition(query);\n        var merger = makeProcessedFieldsMerger();\n        variables = __assign(__assign({}, getDefaultValues(operationDefinition)), variables);\n        var context = __assign(__assign({ store: store, written: Object.create(null), merge: function (existing, incoming) {\n                return merger.merge(existing, incoming);\n            }, variables: variables, varString: canonicalStringify(variables) }, extractFragmentContext(query, this.fragments)), { overwrite: !!overwrite, incomingById: new Map(), clientOnly: false, deferred: false, flavors: new Map() });\n        var ref = this.processSelectionSet({\n            result: result || Object.create(null),\n            dataId: dataId,\n            selectionSet: operationDefinition.selectionSet,\n            mergeTree: { map: new Map() },\n            context: context,\n        });\n        if (!isReference(ref)) {\n            throw newInvariantError(11, result);\n        }\n        // So far, the store has not been modified, so now it's time to process\n        // context.incomingById and merge those incoming fields into context.store.\n        context.incomingById.forEach(function (_a, dataId) {\n            var storeObject = _a.storeObject, mergeTree = _a.mergeTree, fieldNodeSet = _a.fieldNodeSet;\n            var entityRef = makeReference(dataId);\n            if (mergeTree && mergeTree.map.size) {\n                var applied = _this.applyMerges(mergeTree, entityRef, storeObject, context);\n                if (isReference(applied)) {\n                    // Assume References returned by applyMerges have already been merged\n                    // into the store. See makeMergeObjectsFunction in policies.ts for an\n                    // example of how this can happen.\n                    return;\n                }\n                // Otherwise, applyMerges returned a StoreObject, whose fields we should\n                // merge into the store (see store.merge statement below).\n                storeObject = applied;\n            }\n            if (globalThis.__DEV__ !== false && !context.overwrite) {\n                var fieldsWithSelectionSets_1 = Object.create(null);\n                fieldNodeSet.forEach(function (field) {\n                    if (field.selectionSet) {\n                        fieldsWithSelectionSets_1[field.name.value] = true;\n                    }\n                });\n                var hasSelectionSet_1 = function (storeFieldName) {\n                    return fieldsWithSelectionSets_1[fieldNameFromStoreName(storeFieldName)] ===\n                        true;\n                };\n                var hasMergeFunction_1 = function (storeFieldName) {\n                    var childTree = mergeTree && mergeTree.map.get(storeFieldName);\n                    return Boolean(childTree && childTree.info && childTree.info.merge);\n                };\n                Object.keys(storeObject).forEach(function (storeFieldName) {\n                    // If a merge function was defined for this field, trust that it\n                    // did the right thing about (not) clobbering data. If the field\n                    // has no selection set, it's a scalar field, so it doesn't need\n                    // a merge function (even if it's an object, like JSON data).\n                    if (hasSelectionSet_1(storeFieldName) &&\n                        !hasMergeFunction_1(storeFieldName)) {\n                        warnAboutDataLoss(entityRef, storeObject, storeFieldName, context.store);\n                    }\n                });\n            }\n            store.merge(dataId, storeObject);\n        });\n        // Any IDs written explicitly to the cache will be retained as\n        // reachable root IDs for garbage collection purposes. Although this\n        // logic includes root IDs like ROOT_QUERY and ROOT_MUTATION, their\n        // retainment counts are effectively ignored because cache.gc() always\n        // includes them in its root ID set.\n        store.retain(ref.__ref);\n        return ref;\n    };\n    StoreWriter.prototype.processSelectionSet = function (_a) {\n        var _this = this;\n        var dataId = _a.dataId, result = _a.result, selectionSet = _a.selectionSet, context = _a.context, \n        // This object allows processSelectionSet to report useful information\n        // to its callers without explicitly returning that information.\n        mergeTree = _a.mergeTree;\n        var policies = this.cache.policies;\n        // This variable will be repeatedly updated using context.merge to\n        // accumulate all fields that need to be written into the store.\n        var incoming = Object.create(null);\n        // If typename was not passed in, infer it. Note that typename is\n        // always passed in for tricky-to-infer cases such as \"Query\" for\n        // ROOT_QUERY.\n        var typename = (dataId && policies.rootTypenamesById[dataId]) ||\n            getTypenameFromResult(result, selectionSet, context.fragmentMap) ||\n            (dataId && context.store.get(dataId, \"__typename\"));\n        if (\"string\" === typeof typename) {\n            incoming.__typename = typename;\n        }\n        // This readField function will be passed as context.readField in the\n        // KeyFieldsContext object created within policies.identify (called below).\n        // In addition to reading from the existing context.store (thanks to the\n        // policies.readField(options, context) line at the very bottom), this\n        // version of readField can read from Reference objects that are currently\n        // pending in context.incomingById, which is important whenever keyFields\n        // need to be extracted from a child object that processSelectionSet has\n        // turned into a Reference.\n        var readField = function () {\n            var options = normalizeReadFieldOptions(arguments, incoming, context.variables);\n            if (isReference(options.from)) {\n                var info = context.incomingById.get(options.from.__ref);\n                if (info) {\n                    var result_1 = policies.readField(__assign(__assign({}, options), { from: info.storeObject }), context);\n                    if (result_1 !== void 0) {\n                        return result_1;\n                    }\n                }\n            }\n            return policies.readField(options, context);\n        };\n        var fieldNodeSet = new Set();\n        this.flattenFields(selectionSet, result, \n        // This WriteContext will be the default context value for fields returned\n        // by the flattenFields method, but some fields may be assigned a modified\n        // context, depending on the presence of @client and other directives.\n        context, typename).forEach(function (context, field) {\n            var _a;\n            var resultFieldKey = resultKeyNameFromField(field);\n            var value = result[resultFieldKey];\n            fieldNodeSet.add(field);\n            if (value !== void 0) {\n                var storeFieldName = policies.getStoreFieldName({\n                    typename: typename,\n                    fieldName: field.name.value,\n                    field: field,\n                    variables: context.variables,\n                });\n                var childTree = getChildMergeTree(mergeTree, storeFieldName);\n                var incomingValue = _this.processFieldValue(value, field, \n                // Reset context.clientOnly and context.deferred to their default\n                // values before processing nested selection sets.\n                field.selectionSet ?\n                    getContextFlavor(context, false, false)\n                    : context, childTree);\n                // To determine if this field holds a child object with a merge function\n                // defined in its type policy (see PR #7070), we need to figure out the\n                // child object's __typename.\n                var childTypename = void 0;\n                // The field's value can be an object that has a __typename only if the\n                // field has a selection set. Otherwise incomingValue is scalar.\n                if (field.selectionSet &&\n                    (isReference(incomingValue) || storeValueIsStoreObject(incomingValue))) {\n                    childTypename = readField(\"__typename\", incomingValue);\n                }\n                var merge = policies.getMergeFunction(typename, field.name.value, childTypename);\n                if (merge) {\n                    childTree.info = {\n                        // TODO Check compatibility against any existing childTree.field?\n                        field: field,\n                        typename: typename,\n                        merge: merge,\n                    };\n                }\n                else {\n                    maybeRecycleChildMergeTree(mergeTree, storeFieldName);\n                }\n                incoming = context.merge(incoming, (_a = {},\n                    _a[storeFieldName] = incomingValue,\n                    _a));\n            }\n            else if (globalThis.__DEV__ !== false &&\n                !context.clientOnly &&\n                !context.deferred &&\n                !addTypenameToDocument.added(field) &&\n                // If the field has a read function, it may be a synthetic field or\n                // provide a default value, so its absence from the written data should\n                // not be cause for alarm.\n                !policies.getReadFunction(typename, field.name.value)) {\n                globalThis.__DEV__ !== false && invariant.error(12, resultKeyNameFromField(field), result);\n            }\n        });\n        // Identify the result object, even if dataId was already provided,\n        // since we always need keyObject below.\n        try {\n            var _b = policies.identify(result, {\n                typename: typename,\n                selectionSet: selectionSet,\n                fragmentMap: context.fragmentMap,\n                storeObject: incoming,\n                readField: readField,\n            }), id = _b[0], keyObject = _b[1];\n            // If dataId was not provided, fall back to the id just generated by\n            // policies.identify.\n            dataId = dataId || id;\n            // Write any key fields that were used during identification, even if\n            // they were not mentioned in the original query.\n            if (keyObject) {\n                // TODO Reverse the order of the arguments?\n                incoming = context.merge(incoming, keyObject);\n            }\n        }\n        catch (e) {\n            // If dataId was provided, tolerate failure of policies.identify.\n            if (!dataId)\n                throw e;\n        }\n        if (\"string\" === typeof dataId) {\n            var dataRef = makeReference(dataId);\n            // Avoid processing the same entity object using the same selection\n            // set more than once. We use an array instead of a Set since most\n            // entity IDs will be written using only one selection set, so the\n            // size of this array is likely to be very small, meaning indexOf is\n            // likely to be faster than Set.prototype.has.\n            var sets = context.written[dataId] || (context.written[dataId] = []);\n            if (sets.indexOf(selectionSet) >= 0)\n                return dataRef;\n            sets.push(selectionSet);\n            // If we're about to write a result object into the store, but we\n            // happen to know that the exact same (===) result object would be\n            // returned if we were to reread the result with the same inputs,\n            // then we can skip the rest of the processSelectionSet work for\n            // this object, and immediately return a Reference to it.\n            if (this.reader &&\n                this.reader.isFresh(result, dataRef, selectionSet, context)) {\n                return dataRef;\n            }\n            var previous_1 = context.incomingById.get(dataId);\n            if (previous_1) {\n                previous_1.storeObject = context.merge(previous_1.storeObject, incoming);\n                previous_1.mergeTree = mergeMergeTrees(previous_1.mergeTree, mergeTree);\n                fieldNodeSet.forEach(function (field) { return previous_1.fieldNodeSet.add(field); });\n            }\n            else {\n                context.incomingById.set(dataId, {\n                    storeObject: incoming,\n                    // Save a reference to mergeTree only if it is not empty, because\n                    // empty MergeTrees may be recycled by maybeRecycleChildMergeTree and\n                    // reused for entirely different parts of the result tree.\n                    mergeTree: mergeTreeIsEmpty(mergeTree) ? void 0 : mergeTree,\n                    fieldNodeSet: fieldNodeSet,\n                });\n            }\n            return dataRef;\n        }\n        return incoming;\n    };\n    StoreWriter.prototype.processFieldValue = function (value, field, context, mergeTree) {\n        var _this = this;\n        if (!field.selectionSet || value === null) {\n            // In development, we need to clone scalar values so that they can be\n            // safely frozen with maybeDeepFreeze in readFromStore.ts. In production,\n            // it's cheaper to store the scalar values directly in the cache.\n            return globalThis.__DEV__ !== false ? cloneDeep(value) : value;\n        }\n        if (isArray(value)) {\n            return value.map(function (item, i) {\n                var value = _this.processFieldValue(item, field, context, getChildMergeTree(mergeTree, i));\n                maybeRecycleChildMergeTree(mergeTree, i);\n                return value;\n            });\n        }\n        return this.processSelectionSet({\n            result: value,\n            selectionSet: field.selectionSet,\n            context: context,\n            mergeTree: mergeTree,\n        });\n    };\n    // Implements https://spec.graphql.org/draft/#sec-Field-Collection, but with\n    // some additions for tracking @client and @defer directives.\n    StoreWriter.prototype.flattenFields = function (selectionSet, result, context, typename) {\n        if (typename === void 0) { typename = getTypenameFromResult(result, selectionSet, context.fragmentMap); }\n        var fieldMap = new Map();\n        var policies = this.cache.policies;\n        var limitingTrie = new Trie(false); // No need for WeakMap, since limitingTrie does not escape.\n        (function flatten(selectionSet, inheritedContext) {\n            var visitedNode = limitingTrie.lookup(selectionSet, \n            // Because we take inheritedClientOnly and inheritedDeferred into\n            // consideration here (in addition to selectionSet), it's possible for\n            // the same selection set to be flattened more than once, if it appears\n            // in the query with different @client and/or @directive configurations.\n            inheritedContext.clientOnly, inheritedContext.deferred);\n            if (visitedNode.visited)\n                return;\n            visitedNode.visited = true;\n            selectionSet.selections.forEach(function (selection) {\n                if (!shouldInclude(selection, context.variables))\n                    return;\n                var clientOnly = inheritedContext.clientOnly, deferred = inheritedContext.deferred;\n                if (\n                // Since the presence of @client or @defer on this field can only\n                // cause clientOnly or deferred to become true, we can skip the\n                // forEach loop if both clientOnly and deferred are already true.\n                !(clientOnly && deferred) &&\n                    isNonEmptyArray(selection.directives)) {\n                    selection.directives.forEach(function (dir) {\n                        var name = dir.name.value;\n                        if (name === \"client\")\n                            clientOnly = true;\n                        if (name === \"defer\") {\n                            var args = argumentsObjectFromField(dir, context.variables);\n                            // The @defer directive takes an optional args.if boolean\n                            // argument, similar to @include(if: boolean). Note that\n                            // @defer(if: false) does not make context.deferred false, but\n                            // instead behaves as if there was no @defer directive.\n                            if (!args || args.if !== false) {\n                                deferred = true;\n                            }\n                            // TODO In the future, we may want to record args.label using\n                            // context.deferred, if a label is specified.\n                        }\n                    });\n                }\n                if (isField(selection)) {\n                    var existing = fieldMap.get(selection);\n                    if (existing) {\n                        // If this field has been visited along another recursive path\n                        // before, the final context should have clientOnly or deferred set\n                        // to true only if *all* paths have the directive (hence the &&).\n                        clientOnly = clientOnly && existing.clientOnly;\n                        deferred = deferred && existing.deferred;\n                    }\n                    fieldMap.set(selection, getContextFlavor(context, clientOnly, deferred));\n                }\n                else {\n                    var fragment = getFragmentFromSelection(selection, context.lookupFragment);\n                    if (!fragment && selection.kind === Kind.FRAGMENT_SPREAD) {\n                        throw newInvariantError(13, selection.name.value);\n                    }\n                    if (fragment &&\n                        policies.fragmentMatches(fragment, typename, result, context.variables)) {\n                        flatten(fragment.selectionSet, getContextFlavor(context, clientOnly, deferred));\n                    }\n                }\n            });\n        })(selectionSet, context);\n        return fieldMap;\n    };\n    StoreWriter.prototype.applyMerges = function (mergeTree, existing, incoming, context, getStorageArgs) {\n        var _a;\n        var _this = this;\n        if (mergeTree.map.size && !isReference(incoming)) {\n            var e_1 = \n            // Items in the same position in different arrays are not\n            // necessarily related to each other, so when incoming is an array\n            // we process its elements as if there was no existing data.\n            (!isArray(incoming) &&\n                // Likewise, existing must be either a Reference or a StoreObject\n                // in order for its fields to be safe to merge with the fields of\n                // the incoming object.\n                (isReference(existing) || storeValueIsStoreObject(existing))) ?\n                existing\n                : void 0;\n            // This narrowing is implied by mergeTree.map.size > 0 and\n            // !isReference(incoming), though TypeScript understandably cannot\n            // hope to infer this type.\n            var i_1 = incoming;\n            // The options.storage objects provided to read and merge functions\n            // are derived from the identity of the parent object plus a\n            // sequence of storeFieldName strings/numbers identifying the nested\n            // field name path of each field value to be merged.\n            if (e_1 && !getStorageArgs) {\n                getStorageArgs = [isReference(e_1) ? e_1.__ref : e_1];\n            }\n            // It's possible that applying merge functions to this subtree will\n            // not change the incoming data, so this variable tracks the fields\n            // that did change, so we can create a new incoming object when (and\n            // only when) at least one incoming field has changed. We use a Map\n            // to preserve the type of numeric keys.\n            var changedFields_1;\n            var getValue_1 = function (from, name) {\n                return (isArray(from) ?\n                    typeof name === \"number\" ?\n                        from[name]\n                        : void 0\n                    : context.store.getFieldValue(from, String(name)));\n            };\n            mergeTree.map.forEach(function (childTree, storeFieldName) {\n                var eVal = getValue_1(e_1, storeFieldName);\n                var iVal = getValue_1(i_1, storeFieldName);\n                // If we have no incoming data, leave any existing data untouched.\n                if (void 0 === iVal)\n                    return;\n                if (getStorageArgs) {\n                    getStorageArgs.push(storeFieldName);\n                }\n                var aVal = _this.applyMerges(childTree, eVal, iVal, context, getStorageArgs);\n                if (aVal !== iVal) {\n                    changedFields_1 = changedFields_1 || new Map();\n                    changedFields_1.set(storeFieldName, aVal);\n                }\n                if (getStorageArgs) {\n                    invariant(getStorageArgs.pop() === storeFieldName);\n                }\n            });\n            if (changedFields_1) {\n                // Shallow clone i so we can add changed fields to it.\n                incoming = (isArray(i_1) ? i_1.slice(0) : __assign({}, i_1));\n                changedFields_1.forEach(function (value, name) {\n                    incoming[name] = value;\n                });\n            }\n        }\n        if (mergeTree.info) {\n            return this.cache.policies.runMergeFunction(existing, incoming, mergeTree.info, context, getStorageArgs && (_a = context.store).getStorage.apply(_a, getStorageArgs));\n        }\n        return incoming;\n    };\n    return StoreWriter;\n}());\nexport { StoreWriter };\nvar emptyMergeTreePool = [];\nfunction getChildMergeTree(_a, name) {\n    var map = _a.map;\n    if (!map.has(name)) {\n        map.set(name, emptyMergeTreePool.pop() || { map: new Map() });\n    }\n    return map.get(name);\n}\nfunction mergeMergeTrees(left, right) {\n    if (left === right || !right || mergeTreeIsEmpty(right))\n        return left;\n    if (!left || mergeTreeIsEmpty(left))\n        return right;\n    var info = left.info && right.info ? __assign(__assign({}, left.info), right.info) : left.info || right.info;\n    var needToMergeMaps = left.map.size && right.map.size;\n    var map = needToMergeMaps ? new Map()\n        : left.map.size ? left.map\n            : right.map;\n    var merged = { info: info, map: map };\n    if (needToMergeMaps) {\n        var remainingRightKeys_1 = new Set(right.map.keys());\n        left.map.forEach(function (leftTree, key) {\n            merged.map.set(key, mergeMergeTrees(leftTree, right.map.get(key)));\n            remainingRightKeys_1.delete(key);\n        });\n        remainingRightKeys_1.forEach(function (key) {\n            merged.map.set(key, mergeMergeTrees(right.map.get(key), left.map.get(key)));\n        });\n    }\n    return merged;\n}\nfunction mergeTreeIsEmpty(tree) {\n    return !tree || !(tree.info || tree.map.size);\n}\nfunction maybeRecycleChildMergeTree(_a, name) {\n    var map = _a.map;\n    var childTree = map.get(name);\n    if (childTree && mergeTreeIsEmpty(childTree)) {\n        emptyMergeTreePool.push(childTree);\n        map.delete(name);\n    }\n}\nvar warnings = new Set();\n// Note that this function is unused in production, and thus should be\n// pruned by any well-configured minifier.\nfunction warnAboutDataLoss(existingRef, incomingObj, storeFieldName, store) {\n    var getChild = function (objOrRef) {\n        var child = store.getFieldValue(objOrRef, storeFieldName);\n        return typeof child === \"object\" && child;\n    };\n    var existing = getChild(existingRef);\n    if (!existing)\n        return;\n    var incoming = getChild(incomingObj);\n    if (!incoming)\n        return;\n    // It's always safe to replace a reference, since it refers to data\n    // safely stored elsewhere.\n    if (isReference(existing))\n        return;\n    // If the values are structurally equivalent, we do not need to worry\n    // about incoming replacing existing.\n    if (equal(existing, incoming))\n        return;\n    // If we're replacing every key of the existing object, then the\n    // existing data would be overwritten even if the objects were\n    // normalized, so warning would not be helpful here.\n    if (Object.keys(existing).every(function (key) { return store.getFieldValue(incoming, key) !== void 0; })) {\n        return;\n    }\n    var parentType = store.getFieldValue(existingRef, \"__typename\") ||\n        store.getFieldValue(incomingObj, \"__typename\");\n    var fieldName = fieldNameFromStoreName(storeFieldName);\n    var typeDotName = \"\".concat(parentType, \".\").concat(fieldName);\n    // Avoid warning more than once for the same type and field name.\n    if (warnings.has(typeDotName))\n        return;\n    warnings.add(typeDotName);\n    var childTypenames = [];\n    // Arrays do not have __typename fields, and always need a custom merge\n    // function, even if their elements are normalized entities.\n    if (!isArray(existing) && !isArray(incoming)) {\n        [existing, incoming].forEach(function (child) {\n            var typename = store.getFieldValue(child, \"__typename\");\n            if (typeof typename === \"string\" && !childTypenames.includes(typename)) {\n                childTypenames.push(typename);\n            }\n        });\n    }\n    globalThis.__DEV__ !== false && invariant.warn(14, fieldName, parentType, childTypenames.length ?\n        \"either ensure all objects of type \" +\n            childTypenames.join(\" and \") +\n            \" have an ID or a custom merge function, or \"\n        : \"\", typeDotName, existing, incoming);\n}\n//# sourceMappingURL=writeToStore.js.map","import { __assign, __extends } from \"tslib\";\nimport { invariant } from \"../../utilities/globals/index.js\";\n// Make builtins like Map and Set safe to use with non-extensible objects.\nimport \"./fixPolyfills.js\";\nimport { wrap } from \"optimism\";\nimport { equal } from \"@wry/equality\";\nimport { ApolloCache } from \"../core/cache.js\";\nimport { MissingFieldError } from \"../core/types/common.js\";\nimport { addTypenameToDocument, isReference, DocumentTransform, canonicalStringify, print, cacheSizes, } from \"../../utilities/index.js\";\nimport { StoreReader } from \"./readFromStore.js\";\nimport { StoreWriter } from \"./writeToStore.js\";\nimport { EntityStore, supportsResultCaching } from \"./entityStore.js\";\nimport { makeVar, forgetCache, recallCache } from \"./reactiveVars.js\";\nimport { Policies } from \"./policies.js\";\nimport { hasOwn, normalizeConfig, shouldCanonizeResults } from \"./helpers.js\";\nimport { getInMemoryCacheMemoryInternals } from \"../../utilities/caching/getMemoryInternals.js\";\nvar InMemoryCache = /** @class */ (function (_super) {\n    __extends(InMemoryCache, _super);\n    function InMemoryCache(config) {\n        if (config === void 0) { config = {}; }\n        var _this = _super.call(this) || this;\n        _this.watches = new Set();\n        _this.addTypenameTransform = new DocumentTransform(addTypenameToDocument);\n        // Override the default value, since InMemoryCache result objects are frozen\n        // in development and expected to remain logically immutable in production.\n        _this.assumeImmutableResults = true;\n        _this.makeVar = makeVar;\n        _this.txCount = 0;\n        _this.config = normalizeConfig(config);\n        _this.addTypename = !!_this.config.addTypename;\n        _this.policies = new Policies({\n            cache: _this,\n            dataIdFromObject: _this.config.dataIdFromObject,\n            possibleTypes: _this.config.possibleTypes,\n            typePolicies: _this.config.typePolicies,\n        });\n        _this.init();\n        return _this;\n    }\n    InMemoryCache.prototype.init = function () {\n        // Passing { resultCaching: false } in the InMemoryCache constructor options\n        // will completely disable dependency tracking, which will improve memory\n        // usage but worsen the performance of repeated reads.\n        var rootStore = (this.data = new EntityStore.Root({\n            policies: this.policies,\n            resultCaching: this.config.resultCaching,\n        }));\n        // When no optimistic writes are currently active, cache.optimisticData ===\n        // cache.data, so there are no additional layers on top of the actual data.\n        // When an optimistic update happens, this.optimisticData will become a\n        // linked list of EntityStore Layer objects that terminates with the\n        // original this.data cache object.\n        this.optimisticData = rootStore.stump;\n        this.resetResultCache();\n    };\n    InMemoryCache.prototype.resetResultCache = function (resetResultIdentities) {\n        var _this = this;\n        var previousReader = this.storeReader;\n        var fragments = this.config.fragments;\n        // The StoreWriter is mostly stateless and so doesn't really need to be\n        // reset, but it does need to have its writer.storeReader reference updated,\n        // so it's simpler to update this.storeWriter as well.\n        this.storeWriter = new StoreWriter(this, (this.storeReader = new StoreReader({\n            cache: this,\n            addTypename: this.addTypename,\n            resultCacheMaxSize: this.config.resultCacheMaxSize,\n            canonizeResults: shouldCanonizeResults(this.config),\n            canon: resetResultIdentities ? void 0 : (previousReader && previousReader.canon),\n            fragments: fragments,\n        })), fragments);\n        this.maybeBroadcastWatch = wrap(function (c, options) {\n            return _this.broadcastWatch(c, options);\n        }, {\n            max: this.config.resultCacheMaxSize ||\n                cacheSizes[\"inMemoryCache.maybeBroadcastWatch\"] ||\n                5000 /* defaultCacheSizes[\"inMemoryCache.maybeBroadcastWatch\"] */,\n            makeCacheKey: function (c) {\n                // Return a cache key (thus enabling result caching) only if we're\n                // currently using a data store that can track cache dependencies.\n                var store = c.optimistic ? _this.optimisticData : _this.data;\n                if (supportsResultCaching(store)) {\n                    var optimistic = c.optimistic, id = c.id, variables = c.variables;\n                    return store.makeCacheKey(c.query, \n                    // Different watches can have the same query, optimistic\n                    // status, rootId, and variables, but if their callbacks are\n                    // different, the (identical) result needs to be delivered to\n                    // each distinct callback. The easiest way to achieve that\n                    // separation is to include c.callback in the cache key for\n                    // maybeBroadcastWatch calls. See issue #5733.\n                    c.callback, canonicalStringify({ optimistic: optimistic, id: id, variables: variables }));\n                }\n            },\n        });\n        // Since we have thrown away all the cached functions that depend on the\n        // CacheGroup dependencies maintained by EntityStore, we should also reset\n        // all CacheGroup dependency information.\n        new Set([this.data.group, this.optimisticData.group]).forEach(function (group) {\n            return group.resetCaching();\n        });\n    };\n    InMemoryCache.prototype.restore = function (data) {\n        this.init();\n        // Since calling this.init() discards/replaces the entire StoreReader, along\n        // with the result caches it maintains, this.data.replace(data) won't have\n        // to bother deleting the old data.\n        if (data)\n            this.data.replace(data);\n        return this;\n    };\n    InMemoryCache.prototype.extract = function (optimistic) {\n        if (optimistic === void 0) { optimistic = false; }\n        return (optimistic ? this.optimisticData : this.data).extract();\n    };\n    InMemoryCache.prototype.read = function (options) {\n        var \n        // Since read returns data or null, without any additional metadata\n        // about whether/where there might have been missing fields, the\n        // default behavior cannot be returnPartialData = true (like it is\n        // for the diff method), since defaulting to true would violate the\n        // integrity of the T in the return type. However, partial data may\n        // be useful in some cases, so returnPartialData:true may be\n        // specified explicitly.\n        _a = options.returnPartialData, \n        // Since read returns data or null, without any additional metadata\n        // about whether/where there might have been missing fields, the\n        // default behavior cannot be returnPartialData = true (like it is\n        // for the diff method), since defaulting to true would violate the\n        // integrity of the T in the return type. However, partial data may\n        // be useful in some cases, so returnPartialData:true may be\n        // specified explicitly.\n        returnPartialData = _a === void 0 ? false : _a;\n        try {\n            return (this.storeReader.diffQueryAgainstStore(__assign(__assign({}, options), { store: options.optimistic ? this.optimisticData : this.data, config: this.config, returnPartialData: returnPartialData })).result || null);\n        }\n        catch (e) {\n            if (e instanceof MissingFieldError) {\n                // Swallow MissingFieldError and return null, so callers do not need to\n                // worry about catching \"normal\" exceptions resulting from incomplete\n                // cache data. Unexpected errors will be re-thrown. If you need more\n                // information about which fields were missing, use cache.diff instead,\n                // and examine diffResult.missing.\n                return null;\n            }\n            throw e;\n        }\n    };\n    InMemoryCache.prototype.write = function (options) {\n        try {\n            ++this.txCount;\n            return this.storeWriter.writeToStore(this.data, options);\n        }\n        finally {\n            if (!--this.txCount && options.broadcast !== false) {\n                this.broadcastWatches();\n            }\n        }\n    };\n    InMemoryCache.prototype.modify = function (options) {\n        if (hasOwn.call(options, \"id\") && !options.id) {\n            // To my knowledge, TypeScript does not currently provide a way to\n            // enforce that an optional property?:type must *not* be undefined\n            // when present. That ability would be useful here, because we want\n            // options.id to default to ROOT_QUERY only when no options.id was\n            // provided. If the caller attempts to pass options.id with a\n            // falsy/undefined value (perhaps because cache.identify failed), we\n            // should not assume the goal was to modify the ROOT_QUERY object.\n            // We could throw, but it seems natural to return false to indicate\n            // that nothing was modified.\n            return false;\n        }\n        var store = ((options.optimistic) // Defaults to false.\n        ) ?\n            this.optimisticData\n            : this.data;\n        try {\n            ++this.txCount;\n            return store.modify(options.id || \"ROOT_QUERY\", options.fields);\n        }\n        finally {\n            if (!--this.txCount && options.broadcast !== false) {\n                this.broadcastWatches();\n            }\n        }\n    };\n    InMemoryCache.prototype.diff = function (options) {\n        return this.storeReader.diffQueryAgainstStore(__assign(__assign({}, options), { store: options.optimistic ? this.optimisticData : this.data, rootId: options.id || \"ROOT_QUERY\", config: this.config }));\n    };\n    InMemoryCache.prototype.watch = function (watch) {\n        var _this = this;\n        if (!this.watches.size) {\n            // In case we previously called forgetCache(this) because\n            // this.watches became empty (see below), reattach this cache to any\n            // reactive variables on which it previously depended. It might seem\n            // paradoxical that we're able to recall something we supposedly\n            // forgot, but the point of calling forgetCache(this) is to silence\n            // useless broadcasts while this.watches is empty, and to allow the\n            // cache to be garbage collected. If, however, we manage to call\n            // recallCache(this) here, this cache object must not have been\n            // garbage collected yet, and should resume receiving updates from\n            // reactive variables, now that it has a watcher to notify.\n            recallCache(this);\n        }\n        this.watches.add(watch);\n        if (watch.immediate) {\n            this.maybeBroadcastWatch(watch);\n        }\n        return function () {\n            // Once we remove the last watch from this.watches, cache.broadcastWatches\n            // no longer does anything, so we preemptively tell the reactive variable\n            // system to exclude this cache from future broadcasts.\n            if (_this.watches.delete(watch) && !_this.watches.size) {\n                forgetCache(_this);\n            }\n            // Remove this watch from the LRU cache managed by the\n            // maybeBroadcastWatch OptimisticWrapperFunction, to prevent memory\n            // leaks involving the closure of watch.callback.\n            _this.maybeBroadcastWatch.forget(watch);\n        };\n    };\n    InMemoryCache.prototype.gc = function (options) {\n        var _a;\n        canonicalStringify.reset();\n        print.reset();\n        this.addTypenameTransform.resetCache();\n        (_a = this.config.fragments) === null || _a === void 0 ? void 0 : _a.resetCaches();\n        var ids = this.optimisticData.gc();\n        if (options && !this.txCount) {\n            if (options.resetResultCache) {\n                this.resetResultCache(options.resetResultIdentities);\n            }\n            else if (options.resetResultIdentities) {\n                this.storeReader.resetCanon();\n            }\n        }\n        return ids;\n    };\n    // Call this method to ensure the given root ID remains in the cache after\n    // garbage collection, along with its transitive child entities. Note that\n    // the cache automatically retains all directly written entities. By default,\n    // the retainment persists after optimistic updates are removed. Pass true\n    // for the optimistic argument if you would prefer for the retainment to be\n    // discarded when the top-most optimistic layer is removed. Returns the\n    // resulting (non-negative) retainment count.\n    InMemoryCache.prototype.retain = function (rootId, optimistic) {\n        return (optimistic ? this.optimisticData : this.data).retain(rootId);\n    };\n    // Call this method to undo the effect of the retain method, above. Once the\n    // retainment count falls to zero, the given ID will no longer be preserved\n    // during garbage collection, though it may still be preserved by other safe\n    // entities that refer to it. Returns the resulting (non-negative) retainment\n    // count, in case that's useful.\n    InMemoryCache.prototype.release = function (rootId, optimistic) {\n        return (optimistic ? this.optimisticData : this.data).release(rootId);\n    };\n    // Returns the canonical ID for a given StoreObject, obeying typePolicies\n    // and keyFields (and dataIdFromObject, if you still use that). At minimum,\n    // the object must contain a __typename and any primary key fields required\n    // to identify entities of that type. If you pass a query result object, be\n    // sure that none of the primary key fields have been renamed by aliasing.\n    // If you pass a Reference object, its __ref ID string will be returned.\n    InMemoryCache.prototype.identify = function (object) {\n        if (isReference(object))\n            return object.__ref;\n        try {\n            return this.policies.identify(object)[0];\n        }\n        catch (e) {\n            globalThis.__DEV__ !== false && invariant.warn(e);\n        }\n    };\n    InMemoryCache.prototype.evict = function (options) {\n        if (!options.id) {\n            if (hasOwn.call(options, \"id\")) {\n                // See comment in modify method about why we return false when\n                // options.id exists but is falsy/undefined.\n                return false;\n            }\n            options = __assign(__assign({}, options), { id: \"ROOT_QUERY\" });\n        }\n        try {\n            // It's unlikely that the eviction will end up invoking any other\n            // cache update operations while it's running, but {in,de}crementing\n            // this.txCount still seems like a good idea, for uniformity with\n            // the other update methods.\n            ++this.txCount;\n            // Pass this.data as a limit on the depth of the eviction, so evictions\n            // during optimistic updates (when this.data is temporarily set equal to\n            // this.optimisticData) do not escape their optimistic Layer.\n            return this.optimisticData.evict(options, this.data);\n        }\n        finally {\n            if (!--this.txCount && options.broadcast !== false) {\n                this.broadcastWatches();\n            }\n        }\n    };\n    InMemoryCache.prototype.reset = function (options) {\n        var _this = this;\n        this.init();\n        canonicalStringify.reset();\n        if (options && options.discardWatches) {\n            // Similar to what happens in the unsubscribe function returned by\n            // cache.watch, applied to all current watches.\n            this.watches.forEach(function (watch) { return _this.maybeBroadcastWatch.forget(watch); });\n            this.watches.clear();\n            forgetCache(this);\n        }\n        else {\n            // Calling this.init() above unblocks all maybeBroadcastWatch caching, so\n            // this.broadcastWatches() triggers a broadcast to every current watcher\n            // (letting them know their data is now missing). This default behavior is\n            // convenient because it means the watches do not have to be manually\n            // reestablished after resetting the cache. To prevent this broadcast and\n            // cancel all watches, pass true for options.discardWatches.\n            this.broadcastWatches();\n        }\n        return Promise.resolve();\n    };\n    InMemoryCache.prototype.removeOptimistic = function (idToRemove) {\n        var newOptimisticData = this.optimisticData.removeLayer(idToRemove);\n        if (newOptimisticData !== this.optimisticData) {\n            this.optimisticData = newOptimisticData;\n            this.broadcastWatches();\n        }\n    };\n    InMemoryCache.prototype.batch = function (options) {\n        var _this = this;\n        var update = options.update, _a = options.optimistic, optimistic = _a === void 0 ? true : _a, removeOptimistic = options.removeOptimistic, onWatchUpdated = options.onWatchUpdated;\n        var updateResult;\n        var perform = function (layer) {\n            var _a = _this, data = _a.data, optimisticData = _a.optimisticData;\n            ++_this.txCount;\n            if (layer) {\n                _this.data = _this.optimisticData = layer;\n            }\n            try {\n                return (updateResult = update(_this));\n            }\n            finally {\n                --_this.txCount;\n                _this.data = data;\n                _this.optimisticData = optimisticData;\n            }\n        };\n        var alreadyDirty = new Set();\n        if (onWatchUpdated && !this.txCount) {\n            // If an options.onWatchUpdated callback is provided, we want to call it\n            // with only the Cache.WatchOptions objects affected by options.update,\n            // but there might be dirty watchers already waiting to be broadcast that\n            // have nothing to do with the update. To prevent including those watchers\n            // in the post-update broadcast, we perform this initial broadcast to\n            // collect the dirty watchers, so we can re-dirty them later, after the\n            // post-update broadcast, allowing them to receive their pending\n            // broadcasts the next time broadcastWatches is called, just as they would\n            // if we never called cache.batch.\n            this.broadcastWatches(__assign(__assign({}, options), { onWatchUpdated: function (watch) {\n                    alreadyDirty.add(watch);\n                    return false;\n                } }));\n        }\n        if (typeof optimistic === \"string\") {\n            // Note that there can be multiple layers with the same optimistic ID.\n            // When removeOptimistic(id) is called for that id, all matching layers\n            // will be removed, and the remaining layers will be reapplied.\n            this.optimisticData = this.optimisticData.addLayer(optimistic, perform);\n        }\n        else if (optimistic === false) {\n            // Ensure both this.data and this.optimisticData refer to the root\n            // (non-optimistic) layer of the cache during the update. Note that\n            // this.data could be a Layer if we are currently executing an optimistic\n            // update function, but otherwise will always be an EntityStore.Root\n            // instance.\n            perform(this.data);\n        }\n        else {\n            // Otherwise, leave this.data and this.optimisticData unchanged and run\n            // the update with broadcast batching.\n            perform();\n        }\n        if (typeof removeOptimistic === \"string\") {\n            this.optimisticData = this.optimisticData.removeLayer(removeOptimistic);\n        }\n        // Note: if this.txCount > 0, then alreadyDirty.size === 0, so this code\n        // takes the else branch and calls this.broadcastWatches(options), which\n        // does nothing when this.txCount > 0.\n        if (onWatchUpdated && alreadyDirty.size) {\n            this.broadcastWatches(__assign(__assign({}, options), { onWatchUpdated: function (watch, diff) {\n                    var result = onWatchUpdated.call(this, watch, diff);\n                    if (result !== false) {\n                        // Since onWatchUpdated did not return false, this diff is\n                        // about to be broadcast to watch.callback, so we don't need\n                        // to re-dirty it with the other alreadyDirty watches below.\n                        alreadyDirty.delete(watch);\n                    }\n                    return result;\n                } }));\n            // Silently re-dirty any watches that were already dirty before the update\n            // was performed, and were not broadcast just now.\n            if (alreadyDirty.size) {\n                alreadyDirty.forEach(function (watch) { return _this.maybeBroadcastWatch.dirty(watch); });\n            }\n        }\n        else {\n            // If alreadyDirty is empty or we don't have an onWatchUpdated\n            // function, we don't need to go to the trouble of wrapping\n            // options.onWatchUpdated.\n            this.broadcastWatches(options);\n        }\n        return updateResult;\n    };\n    InMemoryCache.prototype.performTransaction = function (update, optimisticId) {\n        return this.batch({\n            update: update,\n            optimistic: optimisticId || optimisticId !== null,\n        });\n    };\n    InMemoryCache.prototype.transformDocument = function (document) {\n        return this.addTypenameToDocument(this.addFragmentsToDocument(document));\n    };\n    InMemoryCache.prototype.broadcastWatches = function (options) {\n        var _this = this;\n        if (!this.txCount) {\n            this.watches.forEach(function (c) { return _this.maybeBroadcastWatch(c, options); });\n        }\n    };\n    InMemoryCache.prototype.addFragmentsToDocument = function (document) {\n        var fragments = this.config.fragments;\n        return fragments ? fragments.transform(document) : document;\n    };\n    InMemoryCache.prototype.addTypenameToDocument = function (document) {\n        if (this.addTypename) {\n            return this.addTypenameTransform.transformDocument(document);\n        }\n        return document;\n    };\n    // This method is wrapped by maybeBroadcastWatch, which is called by\n    // broadcastWatches, so that we compute and broadcast results only when\n    // the data that would be broadcast might have changed. It would be\n    // simpler to check for changes after recomputing a result but before\n    // broadcasting it, but this wrapping approach allows us to skip both\n    // the recomputation and the broadcast, in most cases.\n    InMemoryCache.prototype.broadcastWatch = function (c, options) {\n        var lastDiff = c.lastDiff;\n        // Both WatchOptions and DiffOptions extend ReadOptions, and DiffOptions\n        // currently requires no additional properties, so we can use c (a\n        // WatchOptions object) as DiffOptions, without having to allocate a new\n        // object, and without having to enumerate the relevant properties (query,\n        // variables, etc.) explicitly. There will be some additional properties\n        // (lastDiff, callback, etc.), but cache.diff ignores them.\n        var diff = this.diff(c);\n        if (options) {\n            if (c.optimistic && typeof options.optimistic === \"string\") {\n                diff.fromOptimisticTransaction = true;\n            }\n            if (options.onWatchUpdated &&\n                options.onWatchUpdated.call(this, c, diff, lastDiff) === false) {\n                // Returning false from the onWatchUpdated callback will prevent\n                // calling c.callback(diff) for this watcher.\n                return;\n            }\n        }\n        if (!lastDiff || !equal(lastDiff.result, diff.result)) {\n            c.callback((c.lastDiff = diff), lastDiff);\n        }\n    };\n    return InMemoryCache;\n}(ApolloCache));\nexport { InMemoryCache };\nif (globalThis.__DEV__ !== false) {\n    InMemoryCache.prototype.getMemoryInternals = getInMemoryCacheMemoryInternals;\n}\n//# sourceMappingURL=inMemoryCache.js.map","import { dep, Slot } from \"optimism\";\n// Contextual Slot that acquires its value when custom read functions are\n// called in Policies#readField.\nexport var cacheSlot = new Slot();\nvar cacheInfoMap = new WeakMap();\nfunction getCacheInfo(cache) {\n    var info = cacheInfoMap.get(cache);\n    if (!info) {\n        cacheInfoMap.set(cache, (info = {\n            vars: new Set(),\n            dep: dep(),\n        }));\n    }\n    return info;\n}\nexport function forgetCache(cache) {\n    getCacheInfo(cache).vars.forEach(function (rv) { return rv.forgetCache(cache); });\n}\n// Calling forgetCache(cache) serves to silence broadcasts and allows the\n// cache to be garbage collected. However, the varsByCache WeakMap\n// preserves the set of reactive variables that were previously associated\n// with this cache, which makes it possible to \"recall\" the cache at a\n// later time, by reattaching it to those variables. If the cache has been\n// garbage collected in the meantime, because it is no longer reachable,\n// you won't be able to call recallCache(cache), and the cache will\n// automatically disappear from the varsByCache WeakMap.\nexport function recallCache(cache) {\n    getCacheInfo(cache).vars.forEach(function (rv) { return rv.attachCache(cache); });\n}\nexport function makeVar(value) {\n    var caches = new Set();\n    var listeners = new Set();\n    var rv = function (newValue) {\n        if (arguments.length > 0) {\n            if (value !== newValue) {\n                value = newValue;\n                caches.forEach(function (cache) {\n                    // Invalidate any fields with custom read functions that\n                    // consumed this variable, so query results involving those\n                    // fields will be recomputed the next time we read them.\n                    getCacheInfo(cache).dep.dirty(rv);\n                    // Broadcast changes to any caches that have previously read\n                    // from this variable.\n                    broadcast(cache);\n                });\n                // Finally, notify any listeners added via rv.onNextChange.\n                var oldListeners = Array.from(listeners);\n                listeners.clear();\n                oldListeners.forEach(function (listener) { return listener(value); });\n            }\n        }\n        else {\n            // When reading from the variable, obtain the current cache from\n            // context via cacheSlot. This isn't entirely foolproof, but it's\n            // the same system that powers varDep.\n            var cache = cacheSlot.getValue();\n            if (cache) {\n                attach(cache);\n                getCacheInfo(cache).dep(rv);\n            }\n        }\n        return value;\n    };\n    rv.onNextChange = function (listener) {\n        listeners.add(listener);\n        return function () {\n            listeners.delete(listener);\n        };\n    };\n    var attach = (rv.attachCache = function (cache) {\n        caches.add(cache);\n        getCacheInfo(cache).vars.add(rv);\n        return rv;\n    });\n    rv.forgetCache = function (cache) { return caches.delete(cache); };\n    return rv;\n}\nfunction broadcast(cache) {\n    if (cache.broadcastWatches) {\n        cache.broadcastWatches();\n    }\n}\n//# sourceMappingURL=reactiveVars.js.map","import { Observable } from \"./Observable.js\";\n// Like Observable.prototype.map, except that the mapping function can\n// optionally return a Promise (or be async).\nexport function asyncMap(observable, mapFn, catchFn) {\n    return new Observable(function (observer) {\n        var promiseQueue = {\n            // Normally we would initialize promiseQueue to Promise.resolve(), but\n            // in this case, for backwards compatibility, we need to be careful to\n            // invoke the first callback synchronously.\n            then: function (callback) {\n                return new Promise(function (resolve) { return resolve(callback()); });\n            },\n        };\n        function makeCallback(examiner, key) {\n            return function (arg) {\n                if (examiner) {\n                    var both = function () {\n                        // If the observer is closed, we don't want to continue calling the\n                        // mapping function - it's result will be swallowed anyways.\n                        return observer.closed ?\n                            /* will be swallowed */ 0\n                            : examiner(arg);\n                    };\n                    promiseQueue = promiseQueue.then(both, both).then(function (result) { return observer.next(result); }, function (error) { return observer.error(error); });\n                }\n                else {\n                    observer[key](arg);\n                }\n            };\n        }\n        var handler = {\n            next: makeCallback(mapFn, \"next\"),\n            error: makeCallback(catchFn, \"error\"),\n            complete: function () {\n                // no need to reassign `promiseQueue`, after `observer.complete`,\n                // the observer will be closed and short-circuit everything anyways\n                /*promiseQueue = */ promiseQueue.then(function () { return observer.complete(); });\n            },\n        };\n        var sub = observable.subscribe(handler);\n        return function () { return sub.unsubscribe(); };\n    });\n}\n//# sourceMappingURL=asyncMap.js.map","import { isNonEmptyArray } from \"./arrays.js\";\nimport { isExecutionPatchIncrementalResult } from \"./incrementalResult.js\";\nexport function graphQLResultHasError(result) {\n    var errors = getGraphQLErrorsFromResult(result);\n    return isNonEmptyArray(errors);\n}\nexport function getGraphQLErrorsFromResult(result) {\n    var graphQLErrors = isNonEmptyArray(result.errors) ? result.errors.slice(0) : [];\n    if (isExecutionPatchIncrementalResult(result) &&\n        isNonEmptyArray(result.incremental)) {\n        result.incremental.forEach(function (incrementalResult) {\n            if (incrementalResult.errors) {\n                graphQLErrors.push.apply(graphQLErrors, incrementalResult.errors);\n            }\n        });\n    }\n    return graphQLErrors;\n}\n//# sourceMappingURL=errorHandling.js.map","import { __extends } from \"tslib\";\nimport { Observable } from \"./Observable.js\";\nimport { iterateObserversSafely } from \"./iteration.js\";\nimport { fixObservableSubclass } from \"./subclassing.js\";\nfunction isPromiseLike(value) {\n    return value && typeof value.then === \"function\";\n}\n// A Concast<T> observable concatenates the given sources into a single\n// non-overlapping sequence of Ts, automatically unwrapping any promises,\n// and broadcasts the T elements of that sequence to any number of\n// subscribers, all without creating a bunch of intermediary Observable\n// wrapper objects.\n//\n// Even though any number of observers can subscribe to the Concast, each\n// source observable is guaranteed to receive at most one subscribe call,\n// and the results are multicast to all observers.\n//\n// In addition to broadcasting every next/error message to this.observers,\n// the Concast stores the most recent message using this.latest, so any\n// new observers can immediately receive the latest message, even if it\n// was originally delivered in the past. This behavior means we can assume\n// every active observer in this.observers has received the same most\n// recent message.\n//\n// With the exception of this.latest replay, a Concast is a \"hot\"\n// observable in the sense that it does not replay past results from the\n// beginning of time for each new observer.\n//\n// Could we have used some existing RxJS class instead? Concast<T> is\n// similar to a BehaviorSubject<T>, because it is multicast and redelivers\n// the latest next/error message to new subscribers. Unlike Subject<T>,\n// Concast<T> does not expose an Observer<T> interface (this.handlers is\n// intentionally private), since Concast<T> gets its inputs from the\n// concatenated sources. If we ever switch to RxJS, there may be some\n// value in reusing their code, but for now we use zen-observable, which\n// does not contain any Subject implementations.\nvar Concast = /** @class */ (function (_super) {\n    __extends(Concast, _super);\n    // Not only can the individual elements of the iterable be promises, but\n    // also the iterable itself can be wrapped in a promise.\n    function Concast(sources) {\n        var _this = _super.call(this, function (observer) {\n            _this.addObserver(observer);\n            return function () { return _this.removeObserver(observer); };\n        }) || this;\n        // Active observers receiving broadcast messages. Thanks to this.latest,\n        // we can assume all observers in this Set have received the same most\n        // recent message, though possibly at different times in the past.\n        _this.observers = new Set();\n        _this.promise = new Promise(function (resolve, reject) {\n            _this.resolve = resolve;\n            _this.reject = reject;\n        });\n        // Bound handler functions that can be reused for every internal\n        // subscription.\n        _this.handlers = {\n            next: function (result) {\n                if (_this.sub !== null) {\n                    _this.latest = [\"next\", result];\n                    _this.notify(\"next\", result);\n                    iterateObserversSafely(_this.observers, \"next\", result);\n                }\n            },\n            error: function (error) {\n                var sub = _this.sub;\n                if (sub !== null) {\n                    // Delay unsubscribing from the underlying subscription slightly,\n                    // so that immediately subscribing another observer can keep the\n                    // subscription active.\n                    if (sub)\n                        setTimeout(function () { return sub.unsubscribe(); });\n                    _this.sub = null;\n                    _this.latest = [\"error\", error];\n                    _this.reject(error);\n                    _this.notify(\"error\", error);\n                    iterateObserversSafely(_this.observers, \"error\", error);\n                }\n            },\n            complete: function () {\n                var _a = _this, sub = _a.sub, _b = _a.sources, sources = _b === void 0 ? [] : _b;\n                if (sub !== null) {\n                    // If complete is called before concast.start, this.sources may be\n                    // undefined, so we use a default value of [] for sources. That works\n                    // here because it falls into the if (!value) {...} block, which\n                    // appropriately terminates the Concast, even if this.sources might\n                    // eventually have been initialized to a non-empty array.\n                    var value = sources.shift();\n                    if (!value) {\n                        if (sub)\n                            setTimeout(function () { return sub.unsubscribe(); });\n                        _this.sub = null;\n                        if (_this.latest && _this.latest[0] === \"next\") {\n                            _this.resolve(_this.latest[1]);\n                        }\n                        else {\n                            _this.resolve();\n                        }\n                        _this.notify(\"complete\");\n                        // We do not store this.latest = [\"complete\"], because doing so\n                        // discards useful information about the previous next (or\n                        // error) message. Instead, if new observers subscribe after\n                        // this Concast has completed, they will receive the final\n                        // 'next' message (unless there was an error) immediately\n                        // followed by a 'complete' message (see addObserver).\n                        iterateObserversSafely(_this.observers, \"complete\");\n                    }\n                    else if (isPromiseLike(value)) {\n                        value.then(function (obs) { return (_this.sub = obs.subscribe(_this.handlers)); }, _this.handlers.error);\n                    }\n                    else {\n                        _this.sub = value.subscribe(_this.handlers);\n                    }\n                }\n            },\n        };\n        _this.nextResultListeners = new Set();\n        // A public way to abort observation and broadcast.\n        _this.cancel = function (reason) {\n            _this.reject(reason);\n            _this.sources = [];\n            _this.handlers.complete();\n        };\n        // Suppress rejection warnings for this.promise, since it's perfectly\n        // acceptable to pay no attention to this.promise if you're consuming\n        // the results through the normal observable API.\n        _this.promise.catch(function (_) { });\n        // If someone accidentally tries to create a Concast using a subscriber\n        // function, recover by creating an Observable from that subscriber and\n        // using it as the source.\n        if (typeof sources === \"function\") {\n            sources = [new Observable(sources)];\n        }\n        if (isPromiseLike(sources)) {\n            sources.then(function (iterable) { return _this.start(iterable); }, _this.handlers.error);\n        }\n        else {\n            _this.start(sources);\n        }\n        return _this;\n    }\n    Concast.prototype.start = function (sources) {\n        if (this.sub !== void 0)\n            return;\n        // In practice, sources is most often simply an Array of observables.\n        // TODO Consider using sources[Symbol.iterator]() to take advantage\n        // of the laziness of non-Array iterables.\n        this.sources = Array.from(sources);\n        // Calling this.handlers.complete() kicks off consumption of the first\n        // source observable. It's tempting to do this step lazily in\n        // addObserver, but this.promise can be accessed without calling\n        // addObserver, so consumption needs to begin eagerly.\n        this.handlers.complete();\n    };\n    Concast.prototype.deliverLastMessage = function (observer) {\n        if (this.latest) {\n            var nextOrError = this.latest[0];\n            var method = observer[nextOrError];\n            if (method) {\n                method.call(observer, this.latest[1]);\n            }\n            // If the subscription is already closed, and the last message was\n            // a 'next' message, simulate delivery of the final 'complete'\n            // message again.\n            if (this.sub === null && nextOrError === \"next\" && observer.complete) {\n                observer.complete();\n            }\n        }\n    };\n    Concast.prototype.addObserver = function (observer) {\n        if (!this.observers.has(observer)) {\n            // Immediately deliver the most recent message, so we can always\n            // be sure all observers have the latest information.\n            this.deliverLastMessage(observer);\n            this.observers.add(observer);\n        }\n    };\n    Concast.prototype.removeObserver = function (observer) {\n        if (this.observers.delete(observer) && this.observers.size < 1) {\n            // In case there are still any listeners in this.nextResultListeners, and\n            // no error or completion has been broadcast yet, make sure those\n            // observers have a chance to run and then remove themselves from\n            // this.observers.\n            this.handlers.complete();\n        }\n    };\n    Concast.prototype.notify = function (method, arg) {\n        var nextResultListeners = this.nextResultListeners;\n        if (nextResultListeners.size) {\n            // Replacing this.nextResultListeners first ensures it does not grow while\n            // we are iterating over it, potentially leading to infinite loops.\n            this.nextResultListeners = new Set();\n            nextResultListeners.forEach(function (listener) { return listener(method, arg); });\n        }\n    };\n    // We need a way to run callbacks just *before* the next result (or error or\n    // completion) is delivered by this Concast, so we can be sure any code that\n    // runs as a result of delivering that result/error observes the effects of\n    // running the callback(s). It was tempting to reuse the Observer type instead\n    // of introducing NextResultListener, but that messes with the sizing and\n    // maintenance of this.observers, and ends up being more code overall.\n    Concast.prototype.beforeNext = function (callback) {\n        var called = false;\n        this.nextResultListeners.add(function (method, arg) {\n            if (!called) {\n                called = true;\n                callback(method, arg);\n            }\n        });\n    };\n    return Concast;\n}(Observable));\nexport { Concast };\n// Necessary because the Concast constructor has a different signature\n// than the Observable constructor.\nfixObservableSubclass(Concast);\n//# sourceMappingURL=Concast.js.map","import { __assign, __awaiter, __generator } from \"tslib\";\nimport { invariant } from \"../utilities/globals/index.js\";\nimport { visit, BREAK, isSelectionNode } from \"graphql\";\nimport { argumentsObjectFromField, buildQueryFromSelectionSet, createFragmentMap, getFragmentDefinitions, getMainDefinition, hasDirectives, isField, isInlineFragment, mergeDeep, mergeDeepArray, removeClientSetsFromDocument, resultKeyNameFromField, shouldInclude, } from \"../utilities/index.js\";\nimport { cacheSlot } from \"../cache/index.js\";\nvar LocalState = /** @class */ (function () {\n    function LocalState(_a) {\n        var cache = _a.cache, client = _a.client, resolvers = _a.resolvers, fragmentMatcher = _a.fragmentMatcher;\n        this.selectionsToResolveCache = new WeakMap();\n        this.cache = cache;\n        if (client) {\n            this.client = client;\n        }\n        if (resolvers) {\n            this.addResolvers(resolvers);\n        }\n        if (fragmentMatcher) {\n            this.setFragmentMatcher(fragmentMatcher);\n        }\n    }\n    LocalState.prototype.addResolvers = function (resolvers) {\n        var _this = this;\n        this.resolvers = this.resolvers || {};\n        if (Array.isArray(resolvers)) {\n            resolvers.forEach(function (resolverGroup) {\n                _this.resolvers = mergeDeep(_this.resolvers, resolverGroup);\n            });\n        }\n        else {\n            this.resolvers = mergeDeep(this.resolvers, resolvers);\n        }\n    };\n    LocalState.prototype.setResolvers = function (resolvers) {\n        this.resolvers = {};\n        this.addResolvers(resolvers);\n    };\n    LocalState.prototype.getResolvers = function () {\n        return this.resolvers || {};\n    };\n    // Run local client resolvers against the incoming query and remote data.\n    // Locally resolved field values are merged with the incoming remote data,\n    // and returned. Note that locally resolved fields will overwrite\n    // remote data using the same field name.\n    LocalState.prototype.runResolvers = function (_a) {\n        return __awaiter(this, arguments, void 0, function (_b) {\n            var document = _b.document, remoteResult = _b.remoteResult, context = _b.context, variables = _b.variables, _c = _b.onlyRunForcedResolvers, onlyRunForcedResolvers = _c === void 0 ? false : _c;\n            return __generator(this, function (_d) {\n                if (document) {\n                    return [2 /*return*/, this.resolveDocument(document, remoteResult.data, context, variables, this.fragmentMatcher, onlyRunForcedResolvers).then(function (localResult) { return (__assign(__assign({}, remoteResult), { data: localResult.result })); })];\n                }\n                return [2 /*return*/, remoteResult];\n            });\n        });\n    };\n    LocalState.prototype.setFragmentMatcher = function (fragmentMatcher) {\n        this.fragmentMatcher = fragmentMatcher;\n    };\n    LocalState.prototype.getFragmentMatcher = function () {\n        return this.fragmentMatcher;\n    };\n    // Client queries contain everything in the incoming document (if a @client\n    // directive is found).\n    LocalState.prototype.clientQuery = function (document) {\n        if (hasDirectives([\"client\"], document)) {\n            if (this.resolvers) {\n                return document;\n            }\n        }\n        return null;\n    };\n    // Server queries are stripped of all @client based selection sets.\n    LocalState.prototype.serverQuery = function (document) {\n        return removeClientSetsFromDocument(document);\n    };\n    LocalState.prototype.prepareContext = function (context) {\n        var cache = this.cache;\n        return __assign(__assign({}, context), { cache: cache, \n            // Getting an entry's cache key is useful for local state resolvers.\n            getCacheKey: function (obj) {\n                return cache.identify(obj);\n            } });\n    };\n    // To support `@client @export(as: \"someVar\")` syntax, we'll first resolve\n    // @client @export fields locally, then pass the resolved values back to be\n    // used alongside the original operation variables.\n    LocalState.prototype.addExportedVariables = function (document_1) {\n        return __awaiter(this, arguments, void 0, function (document, variables, context) {\n            if (variables === void 0) { variables = {}; }\n            if (context === void 0) { context = {}; }\n            return __generator(this, function (_a) {\n                if (document) {\n                    return [2 /*return*/, this.resolveDocument(document, this.buildRootValueFromCache(document, variables) || {}, this.prepareContext(context), variables).then(function (data) { return (__assign(__assign({}, variables), data.exportedVariables)); })];\n                }\n                return [2 /*return*/, __assign({}, variables)];\n            });\n        });\n    };\n    LocalState.prototype.shouldForceResolvers = function (document) {\n        var forceResolvers = false;\n        visit(document, {\n            Directive: {\n                enter: function (node) {\n                    if (node.name.value === \"client\" && node.arguments) {\n                        forceResolvers = node.arguments.some(function (arg) {\n                            return arg.name.value === \"always\" &&\n                                arg.value.kind === \"BooleanValue\" &&\n                                arg.value.value === true;\n                        });\n                        if (forceResolvers) {\n                            return BREAK;\n                        }\n                    }\n                },\n            },\n        });\n        return forceResolvers;\n    };\n    // Query the cache and return matching data.\n    LocalState.prototype.buildRootValueFromCache = function (document, variables) {\n        return this.cache.diff({\n            query: buildQueryFromSelectionSet(document),\n            variables: variables,\n            returnPartialData: true,\n            optimistic: false,\n        }).result;\n    };\n    LocalState.prototype.resolveDocument = function (document_1, rootValue_1) {\n        return __awaiter(this, arguments, void 0, function (document, rootValue, context, variables, fragmentMatcher, onlyRunForcedResolvers) {\n            var mainDefinition, fragments, fragmentMap, selectionsToResolve, definitionOperation, defaultOperationType, _a, cache, client, execContext, isClientFieldDescendant;\n            if (context === void 0) { context = {}; }\n            if (variables === void 0) { variables = {}; }\n            if (fragmentMatcher === void 0) { fragmentMatcher = function () { return true; }; }\n            if (onlyRunForcedResolvers === void 0) { onlyRunForcedResolvers = false; }\n            return __generator(this, function (_b) {\n                mainDefinition = getMainDefinition(document);\n                fragments = getFragmentDefinitions(document);\n                fragmentMap = createFragmentMap(fragments);\n                selectionsToResolve = this.collectSelectionsToResolve(mainDefinition, fragmentMap);\n                definitionOperation = mainDefinition.operation;\n                defaultOperationType = definitionOperation ?\n                    definitionOperation.charAt(0).toUpperCase() +\n                        definitionOperation.slice(1)\n                    : \"Query\";\n                _a = this, cache = _a.cache, client = _a.client;\n                execContext = {\n                    fragmentMap: fragmentMap,\n                    context: __assign(__assign({}, context), { cache: cache, client: client }),\n                    variables: variables,\n                    fragmentMatcher: fragmentMatcher,\n                    defaultOperationType: defaultOperationType,\n                    exportedVariables: {},\n                    selectionsToResolve: selectionsToResolve,\n                    onlyRunForcedResolvers: onlyRunForcedResolvers,\n                };\n                isClientFieldDescendant = false;\n                return [2 /*return*/, this.resolveSelectionSet(mainDefinition.selectionSet, isClientFieldDescendant, rootValue, execContext).then(function (result) { return ({\n                        result: result,\n                        exportedVariables: execContext.exportedVariables,\n                    }); })];\n            });\n        });\n    };\n    LocalState.prototype.resolveSelectionSet = function (selectionSet, isClientFieldDescendant, rootValue, execContext) {\n        return __awaiter(this, void 0, void 0, function () {\n            var fragmentMap, context, variables, resultsToMerge, execute;\n            var _this = this;\n            return __generator(this, function (_a) {\n                fragmentMap = execContext.fragmentMap, context = execContext.context, variables = execContext.variables;\n                resultsToMerge = [rootValue];\n                execute = function (selection) { return __awaiter(_this, void 0, void 0, function () {\n                    var fragment, typeCondition;\n                    return __generator(this, function (_a) {\n                        if (!isClientFieldDescendant &&\n                            !execContext.selectionsToResolve.has(selection)) {\n                            // Skip selections without @client directives\n                            // (still processing if one of the ancestors or one of the child fields has @client directive)\n                            return [2 /*return*/];\n                        }\n                        if (!shouldInclude(selection, variables)) {\n                            // Skip this entirely.\n                            return [2 /*return*/];\n                        }\n                        if (isField(selection)) {\n                            return [2 /*return*/, this.resolveField(selection, isClientFieldDescendant, rootValue, execContext).then(function (fieldResult) {\n                                    var _a;\n                                    if (typeof fieldResult !== \"undefined\") {\n                                        resultsToMerge.push((_a = {},\n                                            _a[resultKeyNameFromField(selection)] = fieldResult,\n                                            _a));\n                                    }\n                                })];\n                        }\n                        if (isInlineFragment(selection)) {\n                            fragment = selection;\n                        }\n                        else {\n                            // This is a named fragment.\n                            fragment = fragmentMap[selection.name.value];\n                            invariant(fragment, 18, selection.name.value);\n                        }\n                        if (fragment && fragment.typeCondition) {\n                            typeCondition = fragment.typeCondition.name.value;\n                            if (execContext.fragmentMatcher(rootValue, typeCondition, context)) {\n                                return [2 /*return*/, this.resolveSelectionSet(fragment.selectionSet, isClientFieldDescendant, rootValue, execContext).then(function (fragmentResult) {\n                                        resultsToMerge.push(fragmentResult);\n                                    })];\n                            }\n                        }\n                        return [2 /*return*/];\n                    });\n                }); };\n                return [2 /*return*/, Promise.all(selectionSet.selections.map(execute)).then(function () {\n                        return mergeDeepArray(resultsToMerge);\n                    })];\n            });\n        });\n    };\n    LocalState.prototype.resolveField = function (field, isClientFieldDescendant, rootValue, execContext) {\n        return __awaiter(this, void 0, void 0, function () {\n            var variables, fieldName, aliasedFieldName, aliasUsed, defaultResult, resultPromise, resolverType, resolverMap, resolve;\n            var _this = this;\n            return __generator(this, function (_a) {\n                if (!rootValue) {\n                    return [2 /*return*/, null];\n                }\n                variables = execContext.variables;\n                fieldName = field.name.value;\n                aliasedFieldName = resultKeyNameFromField(field);\n                aliasUsed = fieldName !== aliasedFieldName;\n                defaultResult = rootValue[aliasedFieldName] || rootValue[fieldName];\n                resultPromise = Promise.resolve(defaultResult);\n                // Usually all local resolvers are run when passing through here, but\n                // if we've specifically identified that we only want to run forced\n                // resolvers (that is, resolvers for fields marked with\n                // `@client(always: true)`), then we'll skip running non-forced resolvers.\n                if (!execContext.onlyRunForcedResolvers ||\n                    this.shouldForceResolvers(field)) {\n                    resolverType = rootValue.__typename || execContext.defaultOperationType;\n                    resolverMap = this.resolvers && this.resolvers[resolverType];\n                    if (resolverMap) {\n                        resolve = resolverMap[aliasUsed ? fieldName : aliasedFieldName];\n                        if (resolve) {\n                            resultPromise = Promise.resolve(\n                            // In case the resolve function accesses reactive variables,\n                            // set cacheSlot to the current cache instance.\n                            cacheSlot.withValue(this.cache, resolve, [\n                                rootValue,\n                                argumentsObjectFromField(field, variables),\n                                execContext.context,\n                                { field: field, fragmentMap: execContext.fragmentMap },\n                            ]));\n                        }\n                    }\n                }\n                return [2 /*return*/, resultPromise.then(function (result) {\n                        var _a, _b;\n                        if (result === void 0) { result = defaultResult; }\n                        // If an @export directive is associated with the current field, store\n                        // the `as` export variable name and current result for later use.\n                        if (field.directives) {\n                            field.directives.forEach(function (directive) {\n                                if (directive.name.value === \"export\" && directive.arguments) {\n                                    directive.arguments.forEach(function (arg) {\n                                        if (arg.name.value === \"as\" && arg.value.kind === \"StringValue\") {\n                                            execContext.exportedVariables[arg.value.value] = result;\n                                        }\n                                    });\n                                }\n                            });\n                        }\n                        // Handle all scalar types here.\n                        if (!field.selectionSet) {\n                            return result;\n                        }\n                        // From here down, the field has a selection set, which means it's trying\n                        // to query a GraphQLObjectType.\n                        if (result == null) {\n                            // Basically any field in a GraphQL response can be null, or missing\n                            return result;\n                        }\n                        var isClientField = (_b = (_a = field.directives) === null || _a === void 0 ? void 0 : _a.some(function (d) { return d.name.value === \"client\"; })) !== null && _b !== void 0 ? _b : false;\n                        if (Array.isArray(result)) {\n                            return _this.resolveSubSelectedArray(field, isClientFieldDescendant || isClientField, result, execContext);\n                        }\n                        // Returned value is an object, and the query has a sub-selection. Recurse.\n                        if (field.selectionSet) {\n                            return _this.resolveSelectionSet(field.selectionSet, isClientFieldDescendant || isClientField, result, execContext);\n                        }\n                    })];\n            });\n        });\n    };\n    LocalState.prototype.resolveSubSelectedArray = function (field, isClientFieldDescendant, result, execContext) {\n        var _this = this;\n        return Promise.all(result.map(function (item) {\n            if (item === null) {\n                return null;\n            }\n            // This is a nested array, recurse.\n            if (Array.isArray(item)) {\n                return _this.resolveSubSelectedArray(field, isClientFieldDescendant, item, execContext);\n            }\n            // This is an object, run the selection set on it.\n            if (field.selectionSet) {\n                return _this.resolveSelectionSet(field.selectionSet, isClientFieldDescendant, item, execContext);\n            }\n        }));\n    };\n    // Collect selection nodes on paths from document root down to all @client directives.\n    // This function takes into account transitive fragment spreads.\n    // Complexity equals to a single `visit` over the full document.\n    LocalState.prototype.collectSelectionsToResolve = function (mainDefinition, fragmentMap) {\n        var isSingleASTNode = function (node) { return !Array.isArray(node); };\n        var selectionsToResolveCache = this.selectionsToResolveCache;\n        function collectByDefinition(definitionNode) {\n            if (!selectionsToResolveCache.has(definitionNode)) {\n                var matches_1 = new Set();\n                selectionsToResolveCache.set(definitionNode, matches_1);\n                visit(definitionNode, {\n                    Directive: function (node, _, __, ___, ancestors) {\n                        if (node.name.value === \"client\") {\n                            ancestors.forEach(function (node) {\n                                if (isSingleASTNode(node) && isSelectionNode(node)) {\n                                    matches_1.add(node);\n                                }\n                            });\n                        }\n                    },\n                    FragmentSpread: function (spread, _, __, ___, ancestors) {\n                        var fragment = fragmentMap[spread.name.value];\n                        invariant(fragment, 19, spread.name.value);\n                        var fragmentSelections = collectByDefinition(fragment);\n                        if (fragmentSelections.size > 0) {\n                            // Fragment for this spread contains @client directive (either directly or transitively)\n                            // Collect selection nodes on paths from the root down to fields with the @client directive\n                            ancestors.forEach(function (node) {\n                                if (isSingleASTNode(node) && isSelectionNode(node)) {\n                                    matches_1.add(node);\n                                }\n                            });\n                            matches_1.add(spread);\n                            fragmentSelections.forEach(function (selection) {\n                                matches_1.add(selection);\n                            });\n                        }\n                    },\n                });\n            }\n            return selectionsToResolveCache.get(definitionNode);\n        }\n        return collectByDefinition(mainDefinition);\n    };\n    return LocalState;\n}());\nexport { LocalState };\n//# sourceMappingURL=LocalState.js.map","import { __assign } from \"tslib\";\nimport { equal } from \"@wry/equality\";\nimport { DeepMerger } from \"../utilities/index.js\";\nimport { mergeIncrementalData } from \"../utilities/index.js\";\nimport { reobserveCacheFirst } from \"./ObservableQuery.js\";\nimport { isNonEmptyArray, graphQLResultHasError, canUseWeakMap, } from \"../utilities/index.js\";\nimport { NetworkStatus, isNetworkRequestInFlight } from \"./networkStatus.js\";\nvar destructiveMethodCounts = new (canUseWeakMap ? WeakMap : Map)();\nfunction wrapDestructiveCacheMethod(cache, methodName) {\n    var original = cache[methodName];\n    if (typeof original === \"function\") {\n        // @ts-expect-error this is just too generic to be typed correctly\n        cache[methodName] = function () {\n            destructiveMethodCounts.set(cache, \n            // The %1e15 allows the count to wrap around to 0 safely every\n            // quadrillion evictions, so there's no risk of overflow. To be\n            // clear, this is more of a pedantic principle than something\n            // that matters in any conceivable practical scenario.\n            (destructiveMethodCounts.get(cache) + 1) % 1e15);\n            // @ts-expect-error this is just too generic to be typed correctly\n            return original.apply(this, arguments);\n        };\n    }\n}\nfunction cancelNotifyTimeout(info) {\n    if (info[\"notifyTimeout\"]) {\n        clearTimeout(info[\"notifyTimeout\"]);\n        info[\"notifyTimeout\"] = void 0;\n    }\n}\n// A QueryInfo object represents a single query managed by the\n// QueryManager, which tracks all QueryInfo objects by queryId in its\n// this.queries Map. QueryInfo objects store the latest results and errors\n// for the given query, and are responsible for reporting those results to\n// the corresponding ObservableQuery, via the QueryInfo.notify method.\n// Results are reported asynchronously whenever setDiff marks the\n// QueryInfo object as dirty, though a call to the QueryManager's\n// broadcastQueries method may trigger the notification before it happens\n// automatically. This class used to be a simple interface type without\n// any field privacy or meaningful methods, which is why it still has so\n// many public fields. The effort to lock down and simplify the QueryInfo\n// interface is ongoing, and further improvements are welcome.\nvar QueryInfo = /** @class */ (function () {\n    function QueryInfo(queryManager, queryId) {\n        if (queryId === void 0) { queryId = queryManager.generateQueryId(); }\n        this.queryId = queryId;\n        this.listeners = new Set();\n        this.document = null;\n        this.lastRequestId = 1;\n        this.stopped = false;\n        this.dirty = false;\n        this.observableQuery = null;\n        var cache = (this.cache = queryManager.cache);\n        // Track how often cache.evict is called, since we want eviction to\n        // override the feud-stopping logic in the markResult method, by\n        // causing shouldWrite to return true. Wrapping the cache.evict method\n        // is a bit of a hack, but it saves us from having to make eviction\n        // counting an official part of the ApolloCache API.\n        if (!destructiveMethodCounts.has(cache)) {\n            destructiveMethodCounts.set(cache, 0);\n            wrapDestructiveCacheMethod(cache, \"evict\");\n            wrapDestructiveCacheMethod(cache, \"modify\");\n            wrapDestructiveCacheMethod(cache, \"reset\");\n        }\n    }\n    QueryInfo.prototype.init = function (query) {\n        var networkStatus = query.networkStatus || NetworkStatus.loading;\n        if (this.variables &&\n            this.networkStatus !== NetworkStatus.loading &&\n            !equal(this.variables, query.variables)) {\n            networkStatus = NetworkStatus.setVariables;\n        }\n        if (!equal(query.variables, this.variables)) {\n            this.lastDiff = void 0;\n        }\n        Object.assign(this, {\n            document: query.document,\n            variables: query.variables,\n            networkError: null,\n            graphQLErrors: this.graphQLErrors || [],\n            networkStatus: networkStatus,\n        });\n        if (query.observableQuery) {\n            this.setObservableQuery(query.observableQuery);\n        }\n        if (query.lastRequestId) {\n            this.lastRequestId = query.lastRequestId;\n        }\n        return this;\n    };\n    QueryInfo.prototype.reset = function () {\n        cancelNotifyTimeout(this);\n        this.dirty = false;\n    };\n    QueryInfo.prototype.resetDiff = function () {\n        this.lastDiff = void 0;\n    };\n    QueryInfo.prototype.getDiff = function () {\n        var options = this.getDiffOptions();\n        if (this.lastDiff && equal(options, this.lastDiff.options)) {\n            return this.lastDiff.diff;\n        }\n        this.updateWatch(this.variables);\n        var oq = this.observableQuery;\n        if (oq && oq.options.fetchPolicy === \"no-cache\") {\n            return { complete: false };\n        }\n        var diff = this.cache.diff(options);\n        this.updateLastDiff(diff, options);\n        return diff;\n    };\n    QueryInfo.prototype.updateLastDiff = function (diff, options) {\n        this.lastDiff =\n            diff ?\n                {\n                    diff: diff,\n                    options: options || this.getDiffOptions(),\n                }\n                : void 0;\n    };\n    QueryInfo.prototype.getDiffOptions = function (variables) {\n        var _a;\n        if (variables === void 0) { variables = this.variables; }\n        return {\n            query: this.document,\n            variables: variables,\n            returnPartialData: true,\n            optimistic: true,\n            canonizeResults: (_a = this.observableQuery) === null || _a === void 0 ? void 0 : _a.options.canonizeResults,\n        };\n    };\n    QueryInfo.prototype.setDiff = function (diff) {\n        var _this = this;\n        var _a;\n        var oldDiff = this.lastDiff && this.lastDiff.diff;\n        // If we do not tolerate partial results, skip this update to prevent it\n        // from being reported. This prevents a situtuation where a query that\n        // errors and another succeeds with overlapping data does not report the\n        // partial data result to the errored query.\n        //\n        // See https://github.com/apollographql/apollo-client/issues/11400 for more\n        // information on this issue.\n        if (diff &&\n            !diff.complete &&\n            !((_a = this.observableQuery) === null || _a === void 0 ? void 0 : _a.options.returnPartialData) &&\n            // In the case of a cache eviction, the diff will become partial so we\n            // schedule a notification to send a network request (this.oqListener) to\n            // go and fetch the missing data.\n            !(oldDiff && oldDiff.complete)) {\n            return;\n        }\n        this.updateLastDiff(diff);\n        if (!this.dirty && !equal(oldDiff && oldDiff.result, diff && diff.result)) {\n            this.dirty = true;\n            if (!this.notifyTimeout) {\n                this.notifyTimeout = setTimeout(function () { return _this.notify(); }, 0);\n            }\n        }\n    };\n    QueryInfo.prototype.setObservableQuery = function (oq) {\n        var _this = this;\n        if (oq === this.observableQuery)\n            return;\n        if (this.oqListener) {\n            this.listeners.delete(this.oqListener);\n        }\n        this.observableQuery = oq;\n        if (oq) {\n            oq[\"queryInfo\"] = this;\n            this.listeners.add((this.oqListener = function () {\n                var diff = _this.getDiff();\n                if (diff.fromOptimisticTransaction) {\n                    // If this diff came from an optimistic transaction, deliver the\n                    // current cache data to the ObservableQuery, but don't perform a\n                    // reobservation, since oq.reobserveCacheFirst might make a network\n                    // request, and we never want to trigger network requests in the\n                    // middle of optimistic updates.\n                    oq[\"observe\"]();\n                }\n                else {\n                    // Otherwise, make the ObservableQuery \"reobserve\" the latest data\n                    // using a temporary fetch policy of \"cache-first\", so complete cache\n                    // results have a chance to be delivered without triggering additional\n                    // network requests, even when options.fetchPolicy is \"network-only\"\n                    // or \"cache-and-network\". All other fetch policies are preserved by\n                    // this method, and are handled by calling oq.reobserve(). If this\n                    // reobservation is spurious, isDifferentFromLastResult still has a\n                    // chance to catch it before delivery to ObservableQuery subscribers.\n                    reobserveCacheFirst(oq);\n                }\n            }));\n        }\n        else {\n            delete this.oqListener;\n        }\n    };\n    QueryInfo.prototype.notify = function () {\n        var _this = this;\n        cancelNotifyTimeout(this);\n        if (this.shouldNotify()) {\n            this.listeners.forEach(function (listener) { return listener(_this); });\n        }\n        this.dirty = false;\n    };\n    QueryInfo.prototype.shouldNotify = function () {\n        if (!this.dirty || !this.listeners.size) {\n            return false;\n        }\n        if (isNetworkRequestInFlight(this.networkStatus) && this.observableQuery) {\n            var fetchPolicy = this.observableQuery.options.fetchPolicy;\n            if (fetchPolicy !== \"cache-only\" && fetchPolicy !== \"cache-and-network\") {\n                return false;\n            }\n        }\n        return true;\n    };\n    QueryInfo.prototype.stop = function () {\n        if (!this.stopped) {\n            this.stopped = true;\n            // Cancel the pending notify timeout\n            this.reset();\n            this.cancel();\n            // Revert back to the no-op version of cancel inherited from\n            // QueryInfo.prototype.\n            this.cancel = QueryInfo.prototype.cancel;\n            var oq = this.observableQuery;\n            if (oq)\n                oq.stopPolling();\n        }\n    };\n    // This method is a no-op by default, until/unless overridden by the\n    // updateWatch method.\n    QueryInfo.prototype.cancel = function () { };\n    QueryInfo.prototype.updateWatch = function (variables) {\n        var _this = this;\n        if (variables === void 0) { variables = this.variables; }\n        var oq = this.observableQuery;\n        if (oq && oq.options.fetchPolicy === \"no-cache\") {\n            return;\n        }\n        var watchOptions = __assign(__assign({}, this.getDiffOptions(variables)), { watcher: this, callback: function (diff) { return _this.setDiff(diff); } });\n        if (!this.lastWatch || !equal(watchOptions, this.lastWatch)) {\n            this.cancel();\n            this.cancel = this.cache.watch((this.lastWatch = watchOptions));\n        }\n    };\n    QueryInfo.prototype.resetLastWrite = function () {\n        this.lastWrite = void 0;\n    };\n    QueryInfo.prototype.shouldWrite = function (result, variables) {\n        var lastWrite = this.lastWrite;\n        return !(lastWrite &&\n            // If cache.evict has been called since the last time we wrote this\n            // data into the cache, there's a chance writing this result into\n            // the cache will repair what was evicted.\n            lastWrite.dmCount === destructiveMethodCounts.get(this.cache) &&\n            equal(variables, lastWrite.variables) &&\n            equal(result.data, lastWrite.result.data));\n    };\n    QueryInfo.prototype.markResult = function (result, document, options, cacheWriteBehavior) {\n        var _this = this;\n        var merger = new DeepMerger();\n        var graphQLErrors = isNonEmptyArray(result.errors) ? result.errors.slice(0) : [];\n        // Cancel the pending notify timeout (if it exists) to prevent extraneous network\n        // requests. To allow future notify timeouts, diff and dirty are reset as well.\n        this.reset();\n        if (\"incremental\" in result && isNonEmptyArray(result.incremental)) {\n            var mergedData = mergeIncrementalData(this.getDiff().result, result);\n            result.data = mergedData;\n            // Detect the first chunk of a deferred query and merge it with existing\n            // cache data. This ensures a `cache-first` fetch policy that returns\n            // partial cache data or a `cache-and-network` fetch policy that already\n            // has full data in the cache does not complain when trying to merge the\n            // initial deferred server data with existing cache data.\n        }\n        else if (\"hasNext\" in result && result.hasNext) {\n            var diff = this.getDiff();\n            result.data = merger.merge(diff.result, result.data);\n        }\n        this.graphQLErrors = graphQLErrors;\n        if (options.fetchPolicy === \"no-cache\") {\n            this.updateLastDiff({ result: result.data, complete: true }, this.getDiffOptions(options.variables));\n        }\n        else if (cacheWriteBehavior !== 0 /* CacheWriteBehavior.FORBID */) {\n            if (shouldWriteResult(result, options.errorPolicy)) {\n                // Using a transaction here so we have a chance to read the result\n                // back from the cache before the watch callback fires as a result\n                // of writeQuery, so we can store the new diff quietly and ignore\n                // it when we receive it redundantly from the watch callback.\n                this.cache.performTransaction(function (cache) {\n                    if (_this.shouldWrite(result, options.variables)) {\n                        cache.writeQuery({\n                            query: document,\n                            data: result.data,\n                            variables: options.variables,\n                            overwrite: cacheWriteBehavior === 1 /* CacheWriteBehavior.OVERWRITE */,\n                        });\n                        _this.lastWrite = {\n                            result: result,\n                            variables: options.variables,\n                            dmCount: destructiveMethodCounts.get(_this.cache),\n                        };\n                    }\n                    else {\n                        // If result is the same as the last result we received from\n                        // the network (and the variables match too), avoid writing\n                        // result into the cache again. The wisdom of skipping this\n                        // cache write is far from obvious, since any cache write\n                        // could be the one that puts the cache back into a desired\n                        // state, fixing corruption or missing data. However, if we\n                        // always write every network result into the cache, we enable\n                        // feuds between queries competing to update the same data in\n                        // incompatible ways, which can lead to an endless cycle of\n                        // cache broadcasts and useless network requests. As with any\n                        // feud, eventually one side must step back from the brink,\n                        // letting the other side(s) have the last word(s). There may\n                        // be other points where we could break this cycle, such as\n                        // silencing the broadcast for cache.writeQuery (not a good\n                        // idea, since it just delays the feud a bit) or somehow\n                        // avoiding the network request that just happened (also bad,\n                        // because the server could return useful new data). All\n                        // options considered, skipping this cache write seems to be\n                        // the least damaging place to break the cycle, because it\n                        // reflects the intuition that we recently wrote this exact\n                        // result into the cache, so the cache *should* already/still\n                        // contain this data. If some other query has clobbered that\n                        // data in the meantime, that's too bad, but there will be no\n                        // winners if every query blindly reverts to its own version\n                        // of the data. This approach also gives the network a chance\n                        // to return new data, which will be written into the cache as\n                        // usual, notifying only those queries that are directly\n                        // affected by the cache updates, as usual. In the future, an\n                        // even more sophisticated cache could perhaps prevent or\n                        // mitigate the clobbering somehow, but that would make this\n                        // particular cache write even less important, and thus\n                        // skipping it would be even safer than it is today.\n                        if (_this.lastDiff && _this.lastDiff.diff.complete) {\n                            // Reuse data from the last good (complete) diff that we\n                            // received, when possible.\n                            result.data = _this.lastDiff.diff.result;\n                            return;\n                        }\n                        // If the previous this.diff was incomplete, fall through to\n                        // re-reading the latest data with cache.diff, below.\n                    }\n                    var diffOptions = _this.getDiffOptions(options.variables);\n                    var diff = cache.diff(diffOptions);\n                    // In case the QueryManager stops this QueryInfo before its\n                    // results are delivered, it's important to avoid restarting the\n                    // cache watch when markResult is called. We also avoid updating\n                    // the watch if we are writing a result that doesn't match the current\n                    // variables to avoid race conditions from broadcasting the wrong\n                    // result.\n                    if (!_this.stopped && equal(_this.variables, options.variables)) {\n                        // Any time we're about to update this.diff, we need to make\n                        // sure we've started watching the cache.\n                        _this.updateWatch(options.variables);\n                    }\n                    // If we're allowed to write to the cache, and we can read a\n                    // complete result from the cache, update result.data to be the\n                    // result from the cache, rather than the raw network result.\n                    // Set without setDiff to avoid triggering a notify call, since\n                    // we have other ways of notifying for this result.\n                    _this.updateLastDiff(diff, diffOptions);\n                    if (diff.complete) {\n                        result.data = diff.result;\n                    }\n                });\n            }\n            else {\n                this.lastWrite = void 0;\n            }\n        }\n    };\n    QueryInfo.prototype.markReady = function () {\n        this.networkError = null;\n        return (this.networkStatus = NetworkStatus.ready);\n    };\n    QueryInfo.prototype.markError = function (error) {\n        this.networkStatus = NetworkStatus.error;\n        this.lastWrite = void 0;\n        this.reset();\n        if (error.graphQLErrors) {\n            this.graphQLErrors = error.graphQLErrors;\n        }\n        if (error.networkError) {\n            this.networkError = error.networkError;\n        }\n        return error;\n    };\n    return QueryInfo;\n}());\nexport { QueryInfo };\nexport function shouldWriteResult(result, errorPolicy) {\n    if (errorPolicy === void 0) { errorPolicy = \"none\"; }\n    var ignoreErrors = errorPolicy === \"ignore\" || errorPolicy === \"all\";\n    var writeWithErrors = !graphQLResultHasError(result);\n    if (!writeWithErrors && ignoreErrors && result.data) {\n        writeWithErrors = true;\n    }\n    return writeWithErrors;\n}\n//# sourceMappingURL=QueryInfo.js.map","import { __assign, __awaiter, __generator } from \"tslib\";\nimport { invariant, newInvariantError } from \"../utilities/globals/index.js\";\nimport { equal } from \"@wry/equality\";\nimport { execute } from \"../link/core/index.js\";\nimport { hasDirectives, isExecutionPatchIncrementalResult, isExecutionPatchResult, removeDirectivesFromDocument, } from \"../utilities/index.js\";\nimport { canonicalStringify } from \"../cache/index.js\";\nimport { getDefaultValues, getOperationDefinition, getOperationName, hasClientExports, graphQLResultHasError, getGraphQLErrorsFromResult, Observable, asyncMap, isNonEmptyArray, Concast, makeUniqueId, isDocumentNode, isNonNullObject, DocumentTransform, } from \"../utilities/index.js\";\nimport { mergeIncrementalData } from \"../utilities/common/incrementalResult.js\";\nimport { ApolloError, isApolloError, graphQLResultHasProtocolErrors, } from \"../errors/index.js\";\nimport { ObservableQuery, logMissingFieldErrors } from \"./ObservableQuery.js\";\nimport { NetworkStatus, isNetworkRequestInFlight } from \"./networkStatus.js\";\nimport { LocalState } from \"./LocalState.js\";\nimport { QueryInfo, shouldWriteResult, } from \"./QueryInfo.js\";\nimport { PROTOCOL_ERRORS_SYMBOL } from \"../errors/index.js\";\nimport { print } from \"../utilities/index.js\";\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nvar IGNORE = Object.create(null);\nimport { Trie } from \"@wry/trie\";\nimport { AutoCleanedWeakCache, cacheSizes } from \"../utilities/index.js\";\nvar QueryManager = /** @class */ (function () {\n    function QueryManager(_a) {\n        var cache = _a.cache, link = _a.link, defaultOptions = _a.defaultOptions, documentTransform = _a.documentTransform, _b = _a.queryDeduplication, queryDeduplication = _b === void 0 ? false : _b, onBroadcast = _a.onBroadcast, _c = _a.ssrMode, ssrMode = _c === void 0 ? false : _c, _d = _a.clientAwareness, clientAwareness = _d === void 0 ? {} : _d, localState = _a.localState, _e = _a.assumeImmutableResults, assumeImmutableResults = _e === void 0 ? !!cache.assumeImmutableResults : _e, defaultContext = _a.defaultContext;\n        var _this = this;\n        this.clientAwareness = {};\n        // All the queries that the QueryManager is currently managing (not\n        // including mutations and subscriptions).\n        this.queries = new Map();\n        // Maps from queryId strings to Promise rejection functions for\n        // currently active queries and fetches.\n        // Use protected instead of private field so\n        // @apollo/experimental-nextjs-app-support can access type info.\n        this.fetchCancelFns = new Map();\n        this.transformCache = new AutoCleanedWeakCache(cacheSizes[\"queryManager.getDocumentInfo\"] ||\n            2000 /* defaultCacheSizes[\"queryManager.getDocumentInfo\"] */);\n        this.queryIdCounter = 1;\n        this.requestIdCounter = 1;\n        this.mutationIdCounter = 1;\n        // Use protected instead of private field so\n        // @apollo/experimental-nextjs-app-support can access type info.\n        this.inFlightLinkObservables = new Trie(false);\n        var defaultDocumentTransform = new DocumentTransform(function (document) { return _this.cache.transformDocument(document); }, \n        // Allow the apollo cache to manage its own transform caches\n        { cache: false });\n        this.cache = cache;\n        this.link = link;\n        this.defaultOptions = defaultOptions || Object.create(null);\n        this.queryDeduplication = queryDeduplication;\n        this.clientAwareness = clientAwareness;\n        this.localState = localState || new LocalState({ cache: cache });\n        this.ssrMode = ssrMode;\n        this.assumeImmutableResults = assumeImmutableResults;\n        this.documentTransform =\n            documentTransform ?\n                defaultDocumentTransform\n                    .concat(documentTransform)\n                    // The custom document transform may add new fragment spreads or new\n                    // field selections, so we want to give the cache a chance to run\n                    // again. For example, the InMemoryCache adds __typename to field\n                    // selections and fragments from the fragment registry.\n                    .concat(defaultDocumentTransform)\n                : defaultDocumentTransform;\n        this.defaultContext = defaultContext || Object.create(null);\n        if ((this.onBroadcast = onBroadcast)) {\n            this.mutationStore = Object.create(null);\n        }\n    }\n    /**\n     * Call this method to terminate any active query processes, making it safe\n     * to dispose of this QueryManager instance.\n     */\n    QueryManager.prototype.stop = function () {\n        var _this = this;\n        this.queries.forEach(function (_info, queryId) {\n            _this.stopQueryNoBroadcast(queryId);\n        });\n        this.cancelPendingFetches(newInvariantError(25));\n    };\n    QueryManager.prototype.cancelPendingFetches = function (error) {\n        this.fetchCancelFns.forEach(function (cancel) { return cancel(error); });\n        this.fetchCancelFns.clear();\n    };\n    QueryManager.prototype.mutate = function (_a) {\n        return __awaiter(this, arguments, void 0, function (_b) {\n            var mutationId, hasClientExports, mutationStoreValue, isOptimistic, self;\n            var _c, _d;\n            var mutation = _b.mutation, variables = _b.variables, optimisticResponse = _b.optimisticResponse, updateQueries = _b.updateQueries, _e = _b.refetchQueries, refetchQueries = _e === void 0 ? [] : _e, _f = _b.awaitRefetchQueries, awaitRefetchQueries = _f === void 0 ? false : _f, updateWithProxyFn = _b.update, onQueryUpdated = _b.onQueryUpdated, _g = _b.fetchPolicy, fetchPolicy = _g === void 0 ? ((_c = this.defaultOptions.mutate) === null || _c === void 0 ? void 0 : _c.fetchPolicy) || \"network-only\" : _g, _h = _b.errorPolicy, errorPolicy = _h === void 0 ? ((_d = this.defaultOptions.mutate) === null || _d === void 0 ? void 0 : _d.errorPolicy) || \"none\" : _h, keepRootFields = _b.keepRootFields, context = _b.context;\n            return __generator(this, function (_j) {\n                switch (_j.label) {\n                    case 0:\n                        invariant(mutation, 26);\n                        invariant(fetchPolicy === \"network-only\" || fetchPolicy === \"no-cache\", 27);\n                        mutationId = this.generateMutationId();\n                        mutation = this.cache.transformForLink(this.transform(mutation));\n                        hasClientExports = this.getDocumentInfo(mutation).hasClientExports;\n                        variables = this.getVariables(mutation, variables);\n                        if (!hasClientExports) return [3 /*break*/, 2];\n                        return [4 /*yield*/, this.localState.addExportedVariables(mutation, variables, context)];\n                    case 1:\n                        variables = (_j.sent());\n                        _j.label = 2;\n                    case 2:\n                        mutationStoreValue = this.mutationStore &&\n                            (this.mutationStore[mutationId] = {\n                                mutation: mutation,\n                                variables: variables,\n                                loading: true,\n                                error: null,\n                            });\n                        isOptimistic = optimisticResponse &&\n                            this.markMutationOptimistic(optimisticResponse, {\n                                mutationId: mutationId,\n                                document: mutation,\n                                variables: variables,\n                                fetchPolicy: fetchPolicy,\n                                errorPolicy: errorPolicy,\n                                context: context,\n                                updateQueries: updateQueries,\n                                update: updateWithProxyFn,\n                                keepRootFields: keepRootFields,\n                            });\n                        this.broadcastQueries();\n                        self = this;\n                        return [2 /*return*/, new Promise(function (resolve, reject) {\n                                return asyncMap(self.getObservableFromLink(mutation, __assign(__assign({}, context), { optimisticResponse: isOptimistic ? optimisticResponse : void 0 }), variables, false), function (result) {\n                                    if (graphQLResultHasError(result) && errorPolicy === \"none\") {\n                                        throw new ApolloError({\n                                            graphQLErrors: getGraphQLErrorsFromResult(result),\n                                        });\n                                    }\n                                    if (mutationStoreValue) {\n                                        mutationStoreValue.loading = false;\n                                        mutationStoreValue.error = null;\n                                    }\n                                    var storeResult = __assign({}, result);\n                                    if (typeof refetchQueries === \"function\") {\n                                        refetchQueries = refetchQueries(storeResult);\n                                    }\n                                    if (errorPolicy === \"ignore\" && graphQLResultHasError(storeResult)) {\n                                        delete storeResult.errors;\n                                    }\n                                    return self.markMutationResult({\n                                        mutationId: mutationId,\n                                        result: storeResult,\n                                        document: mutation,\n                                        variables: variables,\n                                        fetchPolicy: fetchPolicy,\n                                        errorPolicy: errorPolicy,\n                                        context: context,\n                                        update: updateWithProxyFn,\n                                        updateQueries: updateQueries,\n                                        awaitRefetchQueries: awaitRefetchQueries,\n                                        refetchQueries: refetchQueries,\n                                        removeOptimistic: isOptimistic ? mutationId : void 0,\n                                        onQueryUpdated: onQueryUpdated,\n                                        keepRootFields: keepRootFields,\n                                    });\n                                }).subscribe({\n                                    next: function (storeResult) {\n                                        self.broadcastQueries();\n                                        // Since mutations might receive multiple payloads from the\n                                        // ApolloLink chain (e.g. when used with @defer),\n                                        // we resolve with a SingleExecutionResult or after the final\n                                        // ExecutionPatchResult has arrived and we have assembled the\n                                        // multipart response into a single result.\n                                        if (!(\"hasNext\" in storeResult) || storeResult.hasNext === false) {\n                                            resolve(storeResult);\n                                        }\n                                    },\n                                    error: function (err) {\n                                        if (mutationStoreValue) {\n                                            mutationStoreValue.loading = false;\n                                            mutationStoreValue.error = err;\n                                        }\n                                        if (isOptimistic) {\n                                            self.cache.removeOptimistic(mutationId);\n                                        }\n                                        self.broadcastQueries();\n                                        reject(err instanceof ApolloError ? err : (new ApolloError({\n                                            networkError: err,\n                                        })));\n                                    },\n                                });\n                            })];\n                }\n            });\n        });\n    };\n    QueryManager.prototype.markMutationResult = function (mutation, cache) {\n        var _this = this;\n        if (cache === void 0) { cache = this.cache; }\n        var result = mutation.result;\n        var cacheWrites = [];\n        var skipCache = mutation.fetchPolicy === \"no-cache\";\n        if (!skipCache && shouldWriteResult(result, mutation.errorPolicy)) {\n            if (!isExecutionPatchIncrementalResult(result)) {\n                cacheWrites.push({\n                    result: result.data,\n                    dataId: \"ROOT_MUTATION\",\n                    query: mutation.document,\n                    variables: mutation.variables,\n                });\n            }\n            if (isExecutionPatchIncrementalResult(result) &&\n                isNonEmptyArray(result.incremental)) {\n                var diff = cache.diff({\n                    id: \"ROOT_MUTATION\",\n                    // The cache complains if passed a mutation where it expects a\n                    // query, so we transform mutations and subscriptions to queries\n                    // (only once, thanks to this.transformCache).\n                    query: this.getDocumentInfo(mutation.document).asQuery,\n                    variables: mutation.variables,\n                    optimistic: false,\n                    returnPartialData: true,\n                });\n                var mergedData = void 0;\n                if (diff.result) {\n                    mergedData = mergeIncrementalData(diff.result, result);\n                }\n                if (typeof mergedData !== \"undefined\") {\n                    // cast the ExecutionPatchResult to FetchResult here since\n                    // ExecutionPatchResult never has `data` when returned from the server\n                    result.data = mergedData;\n                    cacheWrites.push({\n                        result: mergedData,\n                        dataId: \"ROOT_MUTATION\",\n                        query: mutation.document,\n                        variables: mutation.variables,\n                    });\n                }\n            }\n            var updateQueries_1 = mutation.updateQueries;\n            if (updateQueries_1) {\n                this.queries.forEach(function (_a, queryId) {\n                    var observableQuery = _a.observableQuery;\n                    var queryName = observableQuery && observableQuery.queryName;\n                    if (!queryName || !hasOwnProperty.call(updateQueries_1, queryName)) {\n                        return;\n                    }\n                    var updater = updateQueries_1[queryName];\n                    var _b = _this.queries.get(queryId), document = _b.document, variables = _b.variables;\n                    // Read the current query result from the store.\n                    var _c = cache.diff({\n                        query: document,\n                        variables: variables,\n                        returnPartialData: true,\n                        optimistic: false,\n                    }), currentQueryResult = _c.result, complete = _c.complete;\n                    if (complete && currentQueryResult) {\n                        // Run our reducer using the current query result and the mutation result.\n                        var nextQueryResult = updater(currentQueryResult, {\n                            mutationResult: result,\n                            queryName: (document && getOperationName(document)) || void 0,\n                            queryVariables: variables,\n                        });\n                        // Write the modified result back into the store if we got a new result.\n                        if (nextQueryResult) {\n                            cacheWrites.push({\n                                result: nextQueryResult,\n                                dataId: \"ROOT_QUERY\",\n                                query: document,\n                                variables: variables,\n                            });\n                        }\n                    }\n                });\n            }\n        }\n        if (cacheWrites.length > 0 ||\n            (mutation.refetchQueries || \"\").length > 0 ||\n            mutation.update ||\n            mutation.onQueryUpdated ||\n            mutation.removeOptimistic) {\n            var results_1 = [];\n            this.refetchQueries({\n                updateCache: function (cache) {\n                    if (!skipCache) {\n                        cacheWrites.forEach(function (write) { return cache.write(write); });\n                    }\n                    // If the mutation has some writes associated with it then we need to\n                    // apply those writes to the store by running this reducer again with\n                    // a write action.\n                    var update = mutation.update;\n                    // Determine whether result is a SingleExecutionResult,\n                    // or the final ExecutionPatchResult.\n                    var isFinalResult = !isExecutionPatchResult(result) ||\n                        (isExecutionPatchIncrementalResult(result) && !result.hasNext);\n                    if (update) {\n                        if (!skipCache) {\n                            // Re-read the ROOT_MUTATION data we just wrote into the cache\n                            // (the first cache.write call in the cacheWrites.forEach loop\n                            // above), so field read functions have a chance to run for\n                            // fields within mutation result objects.\n                            var diff = cache.diff({\n                                id: \"ROOT_MUTATION\",\n                                // The cache complains if passed a mutation where it expects a\n                                // query, so we transform mutations and subscriptions to queries\n                                // (only once, thanks to this.transformCache).\n                                query: _this.getDocumentInfo(mutation.document).asQuery,\n                                variables: mutation.variables,\n                                optimistic: false,\n                                returnPartialData: true,\n                            });\n                            if (diff.complete) {\n                                result = __assign(__assign({}, result), { data: diff.result });\n                                if (\"incremental\" in result) {\n                                    delete result.incremental;\n                                }\n                                if (\"hasNext\" in result) {\n                                    delete result.hasNext;\n                                }\n                            }\n                        }\n                        // If we've received the whole response,\n                        // either a SingleExecutionResult or the final ExecutionPatchResult,\n                        // call the update function.\n                        if (isFinalResult) {\n                            update(cache, result, {\n                                context: mutation.context,\n                                variables: mutation.variables,\n                            });\n                        }\n                    }\n                    // TODO Do this with cache.evict({ id: 'ROOT_MUTATION' }) but make it\n                    // shallow to allow rolling back optimistic evictions.\n                    if (!skipCache && !mutation.keepRootFields && isFinalResult) {\n                        cache.modify({\n                            id: \"ROOT_MUTATION\",\n                            fields: function (value, _a) {\n                                var fieldName = _a.fieldName, DELETE = _a.DELETE;\n                                return fieldName === \"__typename\" ? value : DELETE;\n                            },\n                        });\n                    }\n                },\n                include: mutation.refetchQueries,\n                // Write the final mutation.result to the root layer of the cache.\n                optimistic: false,\n                // Remove the corresponding optimistic layer at the same time as we\n                // write the final non-optimistic result.\n                removeOptimistic: mutation.removeOptimistic,\n                // Let the caller of client.mutate optionally determine the refetching\n                // behavior for watched queries after the mutation.update function runs.\n                // If no onQueryUpdated function was provided for this mutation, pass\n                // null instead of undefined to disable the default refetching behavior.\n                onQueryUpdated: mutation.onQueryUpdated || null,\n            }).forEach(function (result) { return results_1.push(result); });\n            if (mutation.awaitRefetchQueries || mutation.onQueryUpdated) {\n                // Returning a promise here makes the mutation await that promise, so we\n                // include results in that promise's work if awaitRefetchQueries or an\n                // onQueryUpdated function was specified.\n                return Promise.all(results_1).then(function () { return result; });\n            }\n        }\n        return Promise.resolve(result);\n    };\n    QueryManager.prototype.markMutationOptimistic = function (optimisticResponse, mutation) {\n        var _this = this;\n        var data = typeof optimisticResponse === \"function\" ?\n            optimisticResponse(mutation.variables, { IGNORE: IGNORE })\n            : optimisticResponse;\n        if (data === IGNORE) {\n            return false;\n        }\n        this.cache.recordOptimisticTransaction(function (cache) {\n            try {\n                _this.markMutationResult(__assign(__assign({}, mutation), { result: { data: data } }), cache);\n            }\n            catch (error) {\n                globalThis.__DEV__ !== false && invariant.error(error);\n            }\n        }, mutation.mutationId);\n        return true;\n    };\n    QueryManager.prototype.fetchQuery = function (queryId, options, networkStatus) {\n        return this.fetchConcastWithInfo(queryId, options, networkStatus).concast\n            .promise;\n    };\n    QueryManager.prototype.getQueryStore = function () {\n        var store = Object.create(null);\n        this.queries.forEach(function (info, queryId) {\n            store[queryId] = {\n                variables: info.variables,\n                networkStatus: info.networkStatus,\n                networkError: info.networkError,\n                graphQLErrors: info.graphQLErrors,\n            };\n        });\n        return store;\n    };\n    QueryManager.prototype.resetErrors = function (queryId) {\n        var queryInfo = this.queries.get(queryId);\n        if (queryInfo) {\n            queryInfo.networkError = undefined;\n            queryInfo.graphQLErrors = [];\n        }\n    };\n    QueryManager.prototype.transform = function (document) {\n        return this.documentTransform.transformDocument(document);\n    };\n    QueryManager.prototype.getDocumentInfo = function (document) {\n        var transformCache = this.transformCache;\n        if (!transformCache.has(document)) {\n            var cacheEntry = {\n                // TODO These three calls (hasClientExports, shouldForceResolvers, and\n                // usesNonreactiveDirective) are performing independent full traversals\n                // of the transformed document. We should consider merging these\n                // traversals into a single pass in the future, though the work is\n                // cached after the first time.\n                hasClientExports: hasClientExports(document),\n                hasForcedResolvers: this.localState.shouldForceResolvers(document),\n                hasNonreactiveDirective: hasDirectives([\"nonreactive\"], document),\n                clientQuery: this.localState.clientQuery(document),\n                serverQuery: removeDirectivesFromDocument([\n                    { name: \"client\", remove: true },\n                    { name: \"connection\" },\n                    { name: \"nonreactive\" },\n                ], document),\n                defaultVars: getDefaultValues(getOperationDefinition(document)),\n                // Transform any mutation or subscription operations to query operations\n                // so we can read/write them from/to the cache.\n                asQuery: __assign(__assign({}, document), { definitions: document.definitions.map(function (def) {\n                        if (def.kind === \"OperationDefinition\" &&\n                            def.operation !== \"query\") {\n                            return __assign(__assign({}, def), { operation: \"query\" });\n                        }\n                        return def;\n                    }) }),\n            };\n            transformCache.set(document, cacheEntry);\n        }\n        return transformCache.get(document);\n    };\n    QueryManager.prototype.getVariables = function (document, variables) {\n        return __assign(__assign({}, this.getDocumentInfo(document).defaultVars), variables);\n    };\n    QueryManager.prototype.watchQuery = function (options) {\n        var query = this.transform(options.query);\n        // assign variable default values if supplied\n        // NOTE: We don't modify options.query here with the transformed query to\n        // ensure observable.options.query is set to the raw untransformed query.\n        options = __assign(__assign({}, options), { variables: this.getVariables(query, options.variables) });\n        if (typeof options.notifyOnNetworkStatusChange === \"undefined\") {\n            options.notifyOnNetworkStatusChange = false;\n        }\n        var queryInfo = new QueryInfo(this);\n        var observable = new ObservableQuery({\n            queryManager: this,\n            queryInfo: queryInfo,\n            options: options,\n        });\n        observable[\"lastQuery\"] = query;\n        this.queries.set(observable.queryId, queryInfo);\n        // We give queryInfo the transformed query to ensure the first cache diff\n        // uses the transformed query instead of the raw query\n        queryInfo.init({\n            document: query,\n            observableQuery: observable,\n            variables: observable.variables,\n        });\n        return observable;\n    };\n    QueryManager.prototype.query = function (options, queryId) {\n        var _this = this;\n        if (queryId === void 0) { queryId = this.generateQueryId(); }\n        invariant(options.query, 28);\n        invariant(options.query.kind === \"Document\", 29);\n        invariant(!options.returnPartialData, 30);\n        invariant(!options.pollInterval, 31);\n        return this.fetchQuery(queryId, __assign(__assign({}, options), { query: this.transform(options.query) })).finally(function () { return _this.stopQuery(queryId); });\n    };\n    QueryManager.prototype.generateQueryId = function () {\n        return String(this.queryIdCounter++);\n    };\n    QueryManager.prototype.generateRequestId = function () {\n        return this.requestIdCounter++;\n    };\n    QueryManager.prototype.generateMutationId = function () {\n        return String(this.mutationIdCounter++);\n    };\n    QueryManager.prototype.stopQueryInStore = function (queryId) {\n        this.stopQueryInStoreNoBroadcast(queryId);\n        this.broadcastQueries();\n    };\n    QueryManager.prototype.stopQueryInStoreNoBroadcast = function (queryId) {\n        var queryInfo = this.queries.get(queryId);\n        if (queryInfo)\n            queryInfo.stop();\n    };\n    QueryManager.prototype.clearStore = function (options) {\n        if (options === void 0) { options = {\n            discardWatches: true,\n        }; }\n        // Before we have sent the reset action to the store, we can no longer\n        // rely on the results returned by in-flight requests since these may\n        // depend on values that previously existed in the data portion of the\n        // store. So, we cancel the promises and observers that we have issued\n        // so far and not yet resolved (in the case of queries).\n        this.cancelPendingFetches(newInvariantError(32));\n        this.queries.forEach(function (queryInfo) {\n            if (queryInfo.observableQuery) {\n                // Set loading to true so listeners don't trigger unless they want\n                // results with partial data.\n                queryInfo.networkStatus = NetworkStatus.loading;\n            }\n            else {\n                queryInfo.stop();\n            }\n        });\n        if (this.mutationStore) {\n            this.mutationStore = Object.create(null);\n        }\n        // begin removing data from the store\n        return this.cache.reset(options);\n    };\n    QueryManager.prototype.getObservableQueries = function (include) {\n        var _this = this;\n        if (include === void 0) { include = \"active\"; }\n        var queries = new Map();\n        var queryNamesAndDocs = new Map();\n        var legacyQueryOptions = new Set();\n        if (Array.isArray(include)) {\n            include.forEach(function (desc) {\n                if (typeof desc === \"string\") {\n                    queryNamesAndDocs.set(desc, false);\n                }\n                else if (isDocumentNode(desc)) {\n                    queryNamesAndDocs.set(_this.transform(desc), false);\n                }\n                else if (isNonNullObject(desc) && desc.query) {\n                    legacyQueryOptions.add(desc);\n                }\n            });\n        }\n        this.queries.forEach(function (_a, queryId) {\n            var oq = _a.observableQuery, document = _a.document;\n            if (oq) {\n                if (include === \"all\") {\n                    queries.set(queryId, oq);\n                    return;\n                }\n                var queryName = oq.queryName, fetchPolicy = oq.options.fetchPolicy;\n                if (fetchPolicy === \"standby\" ||\n                    (include === \"active\" && !oq.hasObservers())) {\n                    return;\n                }\n                if (include === \"active\" ||\n                    (queryName && queryNamesAndDocs.has(queryName)) ||\n                    (document && queryNamesAndDocs.has(document))) {\n                    queries.set(queryId, oq);\n                    if (queryName)\n                        queryNamesAndDocs.set(queryName, true);\n                    if (document)\n                        queryNamesAndDocs.set(document, true);\n                }\n            }\n        });\n        if (legacyQueryOptions.size) {\n            legacyQueryOptions.forEach(function (options) {\n                // We will be issuing a fresh network request for this query, so we\n                // pre-allocate a new query ID here, using a special prefix to enable\n                // cleaning up these temporary queries later, after fetching.\n                var queryId = makeUniqueId(\"legacyOneTimeQuery\");\n                var queryInfo = _this.getQuery(queryId).init({\n                    document: options.query,\n                    variables: options.variables,\n                });\n                var oq = new ObservableQuery({\n                    queryManager: _this,\n                    queryInfo: queryInfo,\n                    options: __assign(__assign({}, options), { fetchPolicy: \"network-only\" }),\n                });\n                invariant(oq.queryId === queryId);\n                queryInfo.setObservableQuery(oq);\n                queries.set(queryId, oq);\n            });\n        }\n        if (globalThis.__DEV__ !== false && queryNamesAndDocs.size) {\n            queryNamesAndDocs.forEach(function (included, nameOrDoc) {\n                if (!included) {\n                    globalThis.__DEV__ !== false && invariant.warn(typeof nameOrDoc === \"string\" ? 33 : 34, nameOrDoc);\n                }\n            });\n        }\n        return queries;\n    };\n    QueryManager.prototype.reFetchObservableQueries = function (includeStandby) {\n        var _this = this;\n        if (includeStandby === void 0) { includeStandby = false; }\n        var observableQueryPromises = [];\n        this.getObservableQueries(includeStandby ? \"all\" : \"active\").forEach(function (observableQuery, queryId) {\n            var fetchPolicy = observableQuery.options.fetchPolicy;\n            observableQuery.resetLastResults();\n            if (includeStandby ||\n                (fetchPolicy !== \"standby\" && fetchPolicy !== \"cache-only\")) {\n                observableQueryPromises.push(observableQuery.refetch());\n            }\n            _this.getQuery(queryId).setDiff(null);\n        });\n        this.broadcastQueries();\n        return Promise.all(observableQueryPromises);\n    };\n    QueryManager.prototype.setObservableQuery = function (observableQuery) {\n        this.getQuery(observableQuery.queryId).setObservableQuery(observableQuery);\n    };\n    QueryManager.prototype.startGraphQLSubscription = function (_a) {\n        var _this = this;\n        var query = _a.query, fetchPolicy = _a.fetchPolicy, _b = _a.errorPolicy, errorPolicy = _b === void 0 ? \"none\" : _b, variables = _a.variables, _c = _a.context, context = _c === void 0 ? {} : _c;\n        query = this.transform(query);\n        variables = this.getVariables(query, variables);\n        var makeObservable = function (variables) {\n            return _this.getObservableFromLink(query, context, variables).map(function (result) {\n                if (fetchPolicy !== \"no-cache\") {\n                    // the subscription interface should handle not sending us results we no longer subscribe to.\n                    // XXX I don't think we ever send in an object with errors, but we might in the future...\n                    if (shouldWriteResult(result, errorPolicy)) {\n                        _this.cache.write({\n                            query: query,\n                            result: result.data,\n                            dataId: \"ROOT_SUBSCRIPTION\",\n                            variables: variables,\n                        });\n                    }\n                    _this.broadcastQueries();\n                }\n                var hasErrors = graphQLResultHasError(result);\n                var hasProtocolErrors = graphQLResultHasProtocolErrors(result);\n                if (hasErrors || hasProtocolErrors) {\n                    var errors = {};\n                    if (hasErrors) {\n                        errors.graphQLErrors = result.errors;\n                    }\n                    if (hasProtocolErrors) {\n                        errors.protocolErrors = result.extensions[PROTOCOL_ERRORS_SYMBOL];\n                    }\n                    // `errorPolicy` is a mechanism for handling GraphQL errors, according\n                    // to our documentation, so we throw protocol errors regardless of the\n                    // set error policy.\n                    if (errorPolicy === \"none\" || hasProtocolErrors) {\n                        throw new ApolloError(errors);\n                    }\n                }\n                if (errorPolicy === \"ignore\") {\n                    delete result.errors;\n                }\n                return result;\n            });\n        };\n        if (this.getDocumentInfo(query).hasClientExports) {\n            var observablePromise_1 = this.localState\n                .addExportedVariables(query, variables, context)\n                .then(makeObservable);\n            return new Observable(function (observer) {\n                var sub = null;\n                observablePromise_1.then(function (observable) { return (sub = observable.subscribe(observer)); }, observer.error);\n                return function () { return sub && sub.unsubscribe(); };\n            });\n        }\n        return makeObservable(variables);\n    };\n    QueryManager.prototype.stopQuery = function (queryId) {\n        this.stopQueryNoBroadcast(queryId);\n        this.broadcastQueries();\n    };\n    QueryManager.prototype.stopQueryNoBroadcast = function (queryId) {\n        this.stopQueryInStoreNoBroadcast(queryId);\n        this.removeQuery(queryId);\n    };\n    QueryManager.prototype.removeQuery = function (queryId) {\n        // teardown all links\n        // Both `QueryManager.fetchRequest` and `QueryManager.query` create separate promises\n        // that each add their reject functions to fetchCancelFns.\n        // A query created with `QueryManager.query()` could trigger a `QueryManager.fetchRequest`.\n        // The same queryId could have two rejection fns for two promises\n        this.fetchCancelFns.delete(queryId);\n        if (this.queries.has(queryId)) {\n            this.getQuery(queryId).stop();\n            this.queries.delete(queryId);\n        }\n    };\n    QueryManager.prototype.broadcastQueries = function () {\n        if (this.onBroadcast)\n            this.onBroadcast();\n        this.queries.forEach(function (info) { return info.notify(); });\n    };\n    QueryManager.prototype.getLocalState = function () {\n        return this.localState;\n    };\n    QueryManager.prototype.getObservableFromLink = function (query, context, variables, \n    // Prefer context.queryDeduplication if specified.\n    deduplication) {\n        var _this = this;\n        var _a;\n        if (deduplication === void 0) { deduplication = (_a = context === null || context === void 0 ? void 0 : context.queryDeduplication) !== null && _a !== void 0 ? _a : this.queryDeduplication; }\n        var observable;\n        var _b = this.getDocumentInfo(query), serverQuery = _b.serverQuery, clientQuery = _b.clientQuery;\n        if (serverQuery) {\n            var _c = this, inFlightLinkObservables_1 = _c.inFlightLinkObservables, link = _c.link;\n            var operation = {\n                query: serverQuery,\n                variables: variables,\n                operationName: getOperationName(serverQuery) || void 0,\n                context: this.prepareContext(__assign(__assign({}, context), { forceFetch: !deduplication })),\n            };\n            context = operation.context;\n            if (deduplication) {\n                var printedServerQuery_1 = print(serverQuery);\n                var varJson_1 = canonicalStringify(variables);\n                var entry = inFlightLinkObservables_1.lookup(printedServerQuery_1, varJson_1);\n                observable = entry.observable;\n                if (!observable) {\n                    var concast = new Concast([\n                        execute(link, operation),\n                    ]);\n                    observable = entry.observable = concast;\n                    concast.beforeNext(function () {\n                        inFlightLinkObservables_1.remove(printedServerQuery_1, varJson_1);\n                    });\n                }\n            }\n            else {\n                observable = new Concast([\n                    execute(link, operation),\n                ]);\n            }\n        }\n        else {\n            observable = new Concast([Observable.of({ data: {} })]);\n            context = this.prepareContext(context);\n        }\n        if (clientQuery) {\n            observable = asyncMap(observable, function (result) {\n                return _this.localState.runResolvers({\n                    document: clientQuery,\n                    remoteResult: result,\n                    context: context,\n                    variables: variables,\n                });\n            });\n        }\n        return observable;\n    };\n    QueryManager.prototype.getResultsFromLink = function (queryInfo, cacheWriteBehavior, options) {\n        var requestId = (queryInfo.lastRequestId = this.generateRequestId());\n        // Performing transformForLink here gives this.cache a chance to fill in\n        // missing fragment definitions (for example) before sending this document\n        // through the link chain.\n        var linkDocument = this.cache.transformForLink(options.query);\n        return asyncMap(this.getObservableFromLink(linkDocument, options.context, options.variables), function (result) {\n            var graphQLErrors = getGraphQLErrorsFromResult(result);\n            var hasErrors = graphQLErrors.length > 0;\n            // If we interrupted this request by calling getResultsFromLink again\n            // with the same QueryInfo object, we ignore the old results.\n            if (requestId >= queryInfo.lastRequestId) {\n                if (hasErrors && options.errorPolicy === \"none\") {\n                    // Throwing here effectively calls observer.error.\n                    throw queryInfo.markError(new ApolloError({\n                        graphQLErrors: graphQLErrors,\n                    }));\n                }\n                // Use linkDocument rather than queryInfo.document so the\n                // operation/fragments used to write the result are the same as the\n                // ones used to obtain it from the link.\n                queryInfo.markResult(result, linkDocument, options, cacheWriteBehavior);\n                queryInfo.markReady();\n            }\n            var aqr = {\n                data: result.data,\n                loading: false,\n                networkStatus: NetworkStatus.ready,\n            };\n            if (hasErrors && options.errorPolicy !== \"ignore\") {\n                aqr.errors = graphQLErrors;\n                aqr.networkStatus = NetworkStatus.error;\n            }\n            return aqr;\n        }, function (networkError) {\n            var error = isApolloError(networkError) ? networkError : (new ApolloError({ networkError: networkError }));\n            // Avoid storing errors from older interrupted queries.\n            if (requestId >= queryInfo.lastRequestId) {\n                queryInfo.markError(error);\n            }\n            throw error;\n        });\n    };\n    QueryManager.prototype.fetchConcastWithInfo = function (queryId, options, \n    // The initial networkStatus for this fetch, most often\n    // NetworkStatus.loading, but also possibly fetchMore, poll, refetch,\n    // or setVariables.\n    networkStatus, query) {\n        var _this = this;\n        if (networkStatus === void 0) { networkStatus = NetworkStatus.loading; }\n        if (query === void 0) { query = options.query; }\n        var variables = this.getVariables(query, options.variables);\n        var queryInfo = this.getQuery(queryId);\n        var defaults = this.defaultOptions.watchQuery;\n        var _a = options.fetchPolicy, fetchPolicy = _a === void 0 ? (defaults && defaults.fetchPolicy) || \"cache-first\" : _a, _b = options.errorPolicy, errorPolicy = _b === void 0 ? (defaults && defaults.errorPolicy) || \"none\" : _b, _c = options.returnPartialData, returnPartialData = _c === void 0 ? false : _c, _d = options.notifyOnNetworkStatusChange, notifyOnNetworkStatusChange = _d === void 0 ? false : _d, _e = options.context, context = _e === void 0 ? {} : _e;\n        var normalized = Object.assign({}, options, {\n            query: query,\n            variables: variables,\n            fetchPolicy: fetchPolicy,\n            errorPolicy: errorPolicy,\n            returnPartialData: returnPartialData,\n            notifyOnNetworkStatusChange: notifyOnNetworkStatusChange,\n            context: context,\n        });\n        var fromVariables = function (variables) {\n            // Since normalized is always a fresh copy of options, it's safe to\n            // modify its properties here, rather than creating yet another new\n            // WatchQueryOptions object.\n            normalized.variables = variables;\n            var sourcesWithInfo = _this.fetchQueryByPolicy(queryInfo, normalized, networkStatus);\n            if (\n            // If we're in standby, postpone advancing options.fetchPolicy using\n            // applyNextFetchPolicy.\n            normalized.fetchPolicy !== \"standby\" &&\n                // The \"standby\" policy currently returns [] from fetchQueryByPolicy, so\n                // this is another way to detect when nothing was done/fetched.\n                sourcesWithInfo.sources.length > 0 &&\n                queryInfo.observableQuery) {\n                queryInfo.observableQuery[\"applyNextFetchPolicy\"](\"after-fetch\", options);\n            }\n            return sourcesWithInfo;\n        };\n        // This cancel function needs to be set before the concast is created,\n        // in case concast creation synchronously cancels the request.\n        var cleanupCancelFn = function () { return _this.fetchCancelFns.delete(queryId); };\n        this.fetchCancelFns.set(queryId, function (reason) {\n            cleanupCancelFn();\n            // This delay ensures the concast variable has been initialized.\n            setTimeout(function () { return concast.cancel(reason); });\n        });\n        var concast, containsDataFromLink;\n        // If the query has @export(as: ...) directives, then we need to\n        // process those directives asynchronously. When there are no\n        // @export directives (the common case), we deliberately avoid\n        // wrapping the result of this.fetchQueryByPolicy in a Promise,\n        // since the timing of result delivery is (unfortunately) important\n        // for backwards compatibility. TODO This code could be simpler if\n        // we deprecated and removed LocalState.\n        if (this.getDocumentInfo(normalized.query).hasClientExports) {\n            concast = new Concast(this.localState\n                .addExportedVariables(normalized.query, normalized.variables, normalized.context)\n                .then(fromVariables)\n                .then(function (sourcesWithInfo) { return sourcesWithInfo.sources; }));\n            // there is just no way we can synchronously get the *right* value here,\n            // so we will assume `true`, which is the behaviour before the bug fix in\n            // #10597. This means that bug is not fixed in that case, and is probably\n            // un-fixable with reasonable effort for the edge case of @export as\n            // directives.\n            containsDataFromLink = true;\n        }\n        else {\n            var sourcesWithInfo = fromVariables(normalized.variables);\n            containsDataFromLink = sourcesWithInfo.fromLink;\n            concast = new Concast(sourcesWithInfo.sources);\n        }\n        concast.promise.then(cleanupCancelFn, cleanupCancelFn);\n        return {\n            concast: concast,\n            fromLink: containsDataFromLink,\n        };\n    };\n    QueryManager.prototype.refetchQueries = function (_a) {\n        var _this = this;\n        var updateCache = _a.updateCache, include = _a.include, _b = _a.optimistic, optimistic = _b === void 0 ? false : _b, _c = _a.removeOptimistic, removeOptimistic = _c === void 0 ? optimistic ? makeUniqueId(\"refetchQueries\") : void 0 : _c, onQueryUpdated = _a.onQueryUpdated;\n        var includedQueriesById = new Map();\n        if (include) {\n            this.getObservableQueries(include).forEach(function (oq, queryId) {\n                includedQueriesById.set(queryId, {\n                    oq: oq,\n                    lastDiff: _this.getQuery(queryId).getDiff(),\n                });\n            });\n        }\n        var results = new Map();\n        if (updateCache) {\n            this.cache.batch({\n                update: updateCache,\n                // Since you can perform any combination of cache reads and/or writes in\n                // the cache.batch update function, its optimistic option can be either\n                // a boolean or a string, representing three distinct modes of\n                // operation:\n                //\n                // * false: read/write only the root layer\n                // * true: read/write the topmost layer\n                // * string: read/write a fresh optimistic layer with that ID string\n                //\n                // When typeof optimistic === \"string\", a new optimistic layer will be\n                // temporarily created within cache.batch with that string as its ID. If\n                // we then pass that same string as the removeOptimistic option, we can\n                // make cache.batch immediately remove the optimistic layer after\n                // running the updateCache function, triggering only one broadcast.\n                //\n                // However, the refetchQueries method accepts only true or false for its\n                // optimistic option (not string). We interpret true to mean a temporary\n                // optimistic layer should be created, to allow efficiently rolling back\n                // the effect of the updateCache function, which involves passing a\n                // string instead of true as the optimistic option to cache.batch, when\n                // refetchQueries receives optimistic: true.\n                //\n                // In other words, we are deliberately not supporting the use case of\n                // writing to an *existing* optimistic layer (using the refetchQueries\n                // updateCache function), since that would potentially interfere with\n                // other optimistic updates in progress. Instead, you can read/write\n                // only the root layer by passing optimistic: false to refetchQueries,\n                // or you can read/write a brand new optimistic layer that will be\n                // automatically removed by passing optimistic: true.\n                optimistic: (optimistic && removeOptimistic) || false,\n                // The removeOptimistic option can also be provided by itself, even if\n                // optimistic === false, to remove some previously-added optimistic\n                // layer safely and efficiently, like we do in markMutationResult.\n                //\n                // If an explicit removeOptimistic string is provided with optimistic:\n                // true, the removeOptimistic string will determine the ID of the\n                // temporary optimistic layer, in case that ever matters.\n                removeOptimistic: removeOptimistic,\n                onWatchUpdated: function (watch, diff, lastDiff) {\n                    var oq = watch.watcher instanceof QueryInfo && watch.watcher.observableQuery;\n                    if (oq) {\n                        if (onQueryUpdated) {\n                            // Since we're about to handle this query now, remove it from\n                            // includedQueriesById, in case it was added earlier because of\n                            // options.include.\n                            includedQueriesById.delete(oq.queryId);\n                            var result = onQueryUpdated(oq, diff, lastDiff);\n                            if (result === true) {\n                                // The onQueryUpdated function requested the default refetching\n                                // behavior by returning true.\n                                result = oq.refetch();\n                            }\n                            // Record the result in the results Map, as long as onQueryUpdated\n                            // did not return false to skip/ignore this result.\n                            if (result !== false) {\n                                results.set(oq, result);\n                            }\n                            // Allow the default cache broadcast to happen, except when\n                            // onQueryUpdated returns false.\n                            return result;\n                        }\n                        if (onQueryUpdated !== null) {\n                            // If we don't have an onQueryUpdated function, and onQueryUpdated\n                            // was not disabled by passing null, make sure this query is\n                            // \"included\" like any other options.include-specified query.\n                            includedQueriesById.set(oq.queryId, { oq: oq, lastDiff: lastDiff, diff: diff });\n                        }\n                    }\n                },\n            });\n        }\n        if (includedQueriesById.size) {\n            includedQueriesById.forEach(function (_a, queryId) {\n                var oq = _a.oq, lastDiff = _a.lastDiff, diff = _a.diff;\n                var result;\n                // If onQueryUpdated is provided, we want to use it for all included\n                // queries, even the QueryOptions ones.\n                if (onQueryUpdated) {\n                    if (!diff) {\n                        var info = oq[\"queryInfo\"];\n                        info.reset(); // Force info.getDiff() to read from cache.\n                        diff = info.getDiff();\n                    }\n                    result = onQueryUpdated(oq, diff, lastDiff);\n                }\n                // Otherwise, we fall back to refetching.\n                if (!onQueryUpdated || result === true) {\n                    result = oq.refetch();\n                }\n                if (result !== false) {\n                    results.set(oq, result);\n                }\n                if (queryId.indexOf(\"legacyOneTimeQuery\") >= 0) {\n                    _this.stopQueryNoBroadcast(queryId);\n                }\n            });\n        }\n        if (removeOptimistic) {\n            // In case no updateCache callback was provided (so cache.batch was not\n            // called above, and thus did not already remove the optimistic layer),\n            // remove it here. Since this is a no-op when the layer has already been\n            // removed, we do it even if we called cache.batch above, since it's\n            // possible this.cache is an instance of some ApolloCache subclass other\n            // than InMemoryCache, and does not fully support the removeOptimistic\n            // option for cache.batch.\n            this.cache.removeOptimistic(removeOptimistic);\n        }\n        return results;\n    };\n    QueryManager.prototype.fetchQueryByPolicy = function (queryInfo, _a, \n    // The initial networkStatus for this fetch, most often\n    // NetworkStatus.loading, but also possibly fetchMore, poll, refetch,\n    // or setVariables.\n    networkStatus) {\n        var _this = this;\n        var query = _a.query, variables = _a.variables, fetchPolicy = _a.fetchPolicy, refetchWritePolicy = _a.refetchWritePolicy, errorPolicy = _a.errorPolicy, returnPartialData = _a.returnPartialData, context = _a.context, notifyOnNetworkStatusChange = _a.notifyOnNetworkStatusChange;\n        var oldNetworkStatus = queryInfo.networkStatus;\n        queryInfo.init({\n            document: query,\n            variables: variables,\n            networkStatus: networkStatus,\n        });\n        var readCache = function () { return queryInfo.getDiff(); };\n        var resultsFromCache = function (diff, networkStatus) {\n            if (networkStatus === void 0) { networkStatus = queryInfo.networkStatus || NetworkStatus.loading; }\n            var data = diff.result;\n            if (globalThis.__DEV__ !== false && !returnPartialData && !equal(data, {})) {\n                logMissingFieldErrors(diff.missing);\n            }\n            var fromData = function (data) {\n                return Observable.of(__assign({ data: data, loading: isNetworkRequestInFlight(networkStatus), networkStatus: networkStatus }, (diff.complete ? null : { partial: true })));\n            };\n            if (data && _this.getDocumentInfo(query).hasForcedResolvers) {\n                return _this.localState\n                    .runResolvers({\n                    document: query,\n                    remoteResult: { data: data },\n                    context: context,\n                    variables: variables,\n                    onlyRunForcedResolvers: true,\n                })\n                    .then(function (resolved) { return fromData(resolved.data || void 0); });\n            }\n            // Resolves https://github.com/apollographql/apollo-client/issues/10317.\n            // If errorPolicy is 'none' and notifyOnNetworkStatusChange is true,\n            // data was incorrectly returned from the cache on refetch:\n            // if diff.missing exists, we should not return cache data.\n            if (errorPolicy === \"none\" &&\n                networkStatus === NetworkStatus.refetch &&\n                Array.isArray(diff.missing)) {\n                return fromData(void 0);\n            }\n            return fromData(data);\n        };\n        var cacheWriteBehavior = fetchPolicy === \"no-cache\" ? 0 /* CacheWriteBehavior.FORBID */\n            // Watched queries must opt into overwriting existing data on refetch,\n            // by passing refetchWritePolicy: \"overwrite\" in their WatchQueryOptions.\n            : (networkStatus === NetworkStatus.refetch &&\n                refetchWritePolicy !== \"merge\") ?\n                1 /* CacheWriteBehavior.OVERWRITE */\n                : 2 /* CacheWriteBehavior.MERGE */;\n        var resultsFromLink = function () {\n            return _this.getResultsFromLink(queryInfo, cacheWriteBehavior, {\n                query: query,\n                variables: variables,\n                context: context,\n                fetchPolicy: fetchPolicy,\n                errorPolicy: errorPolicy,\n            });\n        };\n        var shouldNotify = notifyOnNetworkStatusChange &&\n            typeof oldNetworkStatus === \"number\" &&\n            oldNetworkStatus !== networkStatus &&\n            isNetworkRequestInFlight(networkStatus);\n        switch (fetchPolicy) {\n            default:\n            case \"cache-first\": {\n                var diff = readCache();\n                if (diff.complete) {\n                    return {\n                        fromLink: false,\n                        sources: [resultsFromCache(diff, queryInfo.markReady())],\n                    };\n                }\n                if (returnPartialData || shouldNotify) {\n                    return {\n                        fromLink: true,\n                        sources: [resultsFromCache(diff), resultsFromLink()],\n                    };\n                }\n                return { fromLink: true, sources: [resultsFromLink()] };\n            }\n            case \"cache-and-network\": {\n                var diff = readCache();\n                if (diff.complete || returnPartialData || shouldNotify) {\n                    return {\n                        fromLink: true,\n                        sources: [resultsFromCache(diff), resultsFromLink()],\n                    };\n                }\n                return { fromLink: true, sources: [resultsFromLink()] };\n            }\n            case \"cache-only\":\n                return {\n                    fromLink: false,\n                    sources: [resultsFromCache(readCache(), queryInfo.markReady())],\n                };\n            case \"network-only\":\n                if (shouldNotify) {\n                    return {\n                        fromLink: true,\n                        sources: [resultsFromCache(readCache()), resultsFromLink()],\n                    };\n                }\n                return { fromLink: true, sources: [resultsFromLink()] };\n            case \"no-cache\":\n                if (shouldNotify) {\n                    return {\n                        fromLink: true,\n                        // Note that queryInfo.getDiff() for no-cache queries does not call\n                        // cache.diff, but instead returns a { complete: false } stub result\n                        // when there is no queryInfo.diff already defined.\n                        sources: [resultsFromCache(queryInfo.getDiff()), resultsFromLink()],\n                    };\n                }\n                return { fromLink: true, sources: [resultsFromLink()] };\n            case \"standby\":\n                return { fromLink: false, sources: [] };\n        }\n    };\n    QueryManager.prototype.getQuery = function (queryId) {\n        if (queryId && !this.queries.has(queryId)) {\n            this.queries.set(queryId, new QueryInfo(this, queryId));\n        }\n        return this.queries.get(queryId);\n    };\n    QueryManager.prototype.prepareContext = function (context) {\n        if (context === void 0) { context = {}; }\n        var newContext = this.localState.prepareContext(context);\n        return __assign(__assign(__assign({}, this.defaultContext), newContext), { clientAwareness: this.clientAwareness });\n    };\n    return QueryManager;\n}());\nexport { QueryManager };\n//# sourceMappingURL=QueryManager.js.map","import { __assign } from \"tslib\";\nimport { invariant, newInvariantError } from \"../utilities/globals/index.js\";\nimport { ApolloLink, execute } from \"../link/core/index.js\";\nimport { version } from \"../version.js\";\nimport { HttpLink } from \"../link/http/index.js\";\nimport { QueryManager } from \"./QueryManager.js\";\nimport { LocalState } from \"./LocalState.js\";\nvar hasSuggestedDevtools = false;\n// Though mergeOptions now resides in @apollo/client/utilities, it was\n// previously declared and exported from this module, and then reexported from\n// @apollo/client/core. Since we need to preserve that API anyway, the easiest\n// solution is to reexport mergeOptions where it was previously declared (here).\nimport { mergeOptions } from \"../utilities/index.js\";\nimport { getApolloClientMemoryInternals } from \"../utilities/caching/getMemoryInternals.js\";\nexport { mergeOptions };\n/**\n * This is the primary Apollo Client class. It is used to send GraphQL documents (i.e. queries\n * and mutations) to a GraphQL spec-compliant server over an `ApolloLink` instance,\n * receive results from the server and cache the results in a store. It also delivers updates\n * to GraphQL queries through `Observable` instances.\n */\nvar ApolloClient = /** @class */ (function () {\n    /**\n     * Constructs an instance of `ApolloClient`.\n     *\n     * @example\n     * ```js\n     * import { ApolloClient, InMemoryCache } from '@apollo/client';\n     *\n     * const cache = new InMemoryCache();\n     *\n     * const client = new ApolloClient({\n     *   // Provide required constructor fields\n     *   cache: cache,\n     *   uri: 'http://localhost:4000/',\n     *\n     *   // Provide some optional constructor fields\n     *   name: 'react-web-client',\n     *   version: '1.3',\n     *   queryDeduplication: false,\n     *   defaultOptions: {\n     *     watchQuery: {\n     *       fetchPolicy: 'cache-and-network',\n     *     },\n     *   },\n     * });\n     * ```\n     */\n    function ApolloClient(options) {\n        var _this = this;\n        this.resetStoreCallbacks = [];\n        this.clearStoreCallbacks = [];\n        if (!options.cache) {\n            throw newInvariantError(15);\n        }\n        var uri = options.uri, credentials = options.credentials, headers = options.headers, cache = options.cache, documentTransform = options.documentTransform, _a = options.ssrMode, ssrMode = _a === void 0 ? false : _a, _b = options.ssrForceFetchDelay, ssrForceFetchDelay = _b === void 0 ? 0 : _b, \n        // Expose the client instance as window.__APOLLO_CLIENT__ and call\n        // onBroadcast in queryManager.broadcastQueries to enable browser\n        // devtools, but disable them by default in production.\n        _c = options.connectToDevTools, \n        // Expose the client instance as window.__APOLLO_CLIENT__ and call\n        // onBroadcast in queryManager.broadcastQueries to enable browser\n        // devtools, but disable them by default in production.\n        connectToDevTools = _c === void 0 ? typeof window === \"object\" &&\n            !window.__APOLLO_CLIENT__ &&\n            globalThis.__DEV__ !== false : _c, _d = options.queryDeduplication, queryDeduplication = _d === void 0 ? true : _d, defaultOptions = options.defaultOptions, defaultContext = options.defaultContext, _e = options.assumeImmutableResults, assumeImmutableResults = _e === void 0 ? cache.assumeImmutableResults : _e, resolvers = options.resolvers, typeDefs = options.typeDefs, fragmentMatcher = options.fragmentMatcher, clientAwarenessName = options.name, clientAwarenessVersion = options.version;\n        var link = options.link;\n        if (!link) {\n            link =\n                uri ? new HttpLink({ uri: uri, credentials: credentials, headers: headers }) : ApolloLink.empty();\n        }\n        this.link = link;\n        this.cache = cache;\n        this.disableNetworkFetches = ssrMode || ssrForceFetchDelay > 0;\n        this.queryDeduplication = queryDeduplication;\n        this.defaultOptions = defaultOptions || Object.create(null);\n        this.typeDefs = typeDefs;\n        if (ssrForceFetchDelay) {\n            setTimeout(function () { return (_this.disableNetworkFetches = false); }, ssrForceFetchDelay);\n        }\n        this.watchQuery = this.watchQuery.bind(this);\n        this.query = this.query.bind(this);\n        this.mutate = this.mutate.bind(this);\n        this.watchFragment = this.watchFragment.bind(this);\n        this.resetStore = this.resetStore.bind(this);\n        this.reFetchObservableQueries = this.reFetchObservableQueries.bind(this);\n        this.version = version;\n        this.localState = new LocalState({\n            cache: cache,\n            client: this,\n            resolvers: resolvers,\n            fragmentMatcher: fragmentMatcher,\n        });\n        this.queryManager = new QueryManager({\n            cache: this.cache,\n            link: this.link,\n            defaultOptions: this.defaultOptions,\n            defaultContext: defaultContext,\n            documentTransform: documentTransform,\n            queryDeduplication: queryDeduplication,\n            ssrMode: ssrMode,\n            clientAwareness: {\n                name: clientAwarenessName,\n                version: clientAwarenessVersion,\n            },\n            localState: this.localState,\n            assumeImmutableResults: assumeImmutableResults,\n            onBroadcast: connectToDevTools ?\n                function () {\n                    if (_this.devToolsHookCb) {\n                        _this.devToolsHookCb({\n                            action: {},\n                            state: {\n                                queries: _this.queryManager.getQueryStore(),\n                                mutations: _this.queryManager.mutationStore || {},\n                            },\n                            dataWithOptimisticResults: _this.cache.extract(true),\n                        });\n                    }\n                }\n                : void 0,\n        });\n        if (connectToDevTools)\n            this.connectToDevTools();\n    }\n    ApolloClient.prototype.connectToDevTools = function () {\n        if (typeof window === \"object\") {\n            var windowWithDevTools = window;\n            var devtoolsSymbol = Symbol.for(\"apollo.devtools\");\n            (windowWithDevTools[devtoolsSymbol] =\n                windowWithDevTools[devtoolsSymbol] || []).push(this);\n            windowWithDevTools.__APOLLO_CLIENT__ = this;\n        }\n        /**\n         * Suggest installing the devtools for developers who don't have them\n         */\n        if (!hasSuggestedDevtools && globalThis.__DEV__ !== false) {\n            hasSuggestedDevtools = true;\n            setTimeout(function () {\n                if (typeof window !== \"undefined\" &&\n                    window.document &&\n                    window.top === window.self &&\n                    !window.__APOLLO_DEVTOOLS_GLOBAL_HOOK__) {\n                    var nav = window.navigator;\n                    var ua = nav && nav.userAgent;\n                    var url = void 0;\n                    if (typeof ua === \"string\") {\n                        if (ua.indexOf(\"Chrome/\") > -1) {\n                            url =\n                                \"https://chrome.google.com/webstore/detail/\" +\n                                    \"apollo-client-developer-t/jdkknkkbebbapilgoeccciglkfbmbnfm\";\n                        }\n                        else if (ua.indexOf(\"Firefox/\") > -1) {\n                            url =\n                                \"https://addons.mozilla.org/en-US/firefox/addon/apollo-developer-tools/\";\n                        }\n                    }\n                    if (url) {\n                        globalThis.__DEV__ !== false && invariant.log(\"Download the Apollo DevTools for a better development \" +\n                            \"experience: %s\", url);\n                    }\n                }\n            }, 10000);\n        }\n    };\n    Object.defineProperty(ApolloClient.prototype, \"documentTransform\", {\n        /**\n         * The `DocumentTransform` used to modify GraphQL documents before a request\n         * is made. If a custom `DocumentTransform` is not provided, this will be the\n         * default document transform.\n         */\n        get: function () {\n            return this.queryManager.documentTransform;\n        },\n        enumerable: false,\n        configurable: true\n    });\n    /**\n     * Call this method to terminate any active client processes, making it safe\n     * to dispose of this `ApolloClient` instance.\n     */\n    ApolloClient.prototype.stop = function () {\n        this.queryManager.stop();\n    };\n    /**\n     * This watches the cache store of the query according to the options specified and\n     * returns an `ObservableQuery`. We can subscribe to this `ObservableQuery` and\n     * receive updated results through an observer when the cache store changes.\n     *\n     * Note that this method is not an implementation of GraphQL subscriptions. Rather,\n     * it uses Apollo's store in order to reactively deliver updates to your query results.\n     *\n     * For example, suppose you call watchQuery on a GraphQL query that fetches a person's\n     * first and last name and this person has a particular object identifier, provided by\n     * dataIdFromObject. Later, a different query fetches that same person's\n     * first and last name and the first name has now changed. Then, any observers associated\n     * with the results of the first query will be updated with a new result object.\n     *\n     * Note that if the cache does not change, the subscriber will *not* be notified.\n     *\n     * See [here](https://medium.com/apollo-stack/the-concepts-of-graphql-bc68bd819be3#.3mb0cbcmc) for\n     * a description of store reactivity.\n     */\n    ApolloClient.prototype.watchQuery = function (options) {\n        if (this.defaultOptions.watchQuery) {\n            options = mergeOptions(this.defaultOptions.watchQuery, options);\n        }\n        // XXX Overwriting options is probably not the best way to do this long term...\n        if (this.disableNetworkFetches &&\n            (options.fetchPolicy === \"network-only\" ||\n                options.fetchPolicy === \"cache-and-network\")) {\n            options = __assign(__assign({}, options), { fetchPolicy: \"cache-first\" });\n        }\n        return this.queryManager.watchQuery(options);\n    };\n    /**\n     * This resolves a single query according to the options specified and\n     * returns a `Promise` which is either resolved with the resulting data\n     * or rejected with an error.\n     *\n     * @param options - An object of type `QueryOptions` that allows us to\n     * describe how this query should be treated e.g. whether it should hit the\n     * server at all or just resolve from the cache, etc.\n     */\n    ApolloClient.prototype.query = function (options) {\n        if (this.defaultOptions.query) {\n            options = mergeOptions(this.defaultOptions.query, options);\n        }\n        invariant(options.fetchPolicy !== \"cache-and-network\", 16);\n        if (this.disableNetworkFetches && options.fetchPolicy === \"network-only\") {\n            options = __assign(__assign({}, options), { fetchPolicy: \"cache-first\" });\n        }\n        return this.queryManager.query(options);\n    };\n    /**\n     * This resolves a single mutation according to the options specified and returns a\n     * Promise which is either resolved with the resulting data or rejected with an\n     * error. In some cases both `data` and `errors` might be undefined, for example\n     * when `errorPolicy` is set to `'ignore'`.\n     *\n     * It takes options as an object with the following keys and values:\n     */\n    ApolloClient.prototype.mutate = function (options) {\n        if (this.defaultOptions.mutate) {\n            options = mergeOptions(this.defaultOptions.mutate, options);\n        }\n        return this.queryManager.mutate(options);\n    };\n    /**\n     * This subscribes to a graphql subscription according to the options specified and returns an\n     * `Observable` which either emits received data or an error.\n     */\n    ApolloClient.prototype.subscribe = function (options) {\n        return this.queryManager.startGraphQLSubscription(options);\n    };\n    /**\n     * Tries to read some data from the store in the shape of the provided\n     * GraphQL query without making a network request. This method will start at\n     * the root query. To start at a specific id returned by `dataIdFromObject`\n     * use `readFragment`.\n     *\n     * @param optimistic - Set to `true` to allow `readQuery` to return\n     * optimistic results. Is `false` by default.\n     */\n    ApolloClient.prototype.readQuery = function (options, optimistic) {\n        if (optimistic === void 0) { optimistic = false; }\n        return this.cache.readQuery(options, optimistic);\n    };\n    /**\n     * Watches the cache store of the fragment according to the options specified\n     * and returns an `Observable`. We can subscribe to this\n     * `Observable` and receive updated results through an\n     * observer when the cache store changes.\n     *\n     * You must pass in a GraphQL document with a single fragment or a document\n     * with multiple fragments that represent what you are reading. If you pass\n     * in a document with multiple fragments then you must also specify a\n     * `fragmentName`.\n     *\n     * @since 3.10.0\n     * @param options - An object of type `WatchFragmentOptions` that allows\n     * the cache to identify the fragment and optionally specify whether to react\n     * to optimistic updates.\n     */\n    ApolloClient.prototype.watchFragment = function (options) {\n        return this.cache.watchFragment(options);\n    };\n    /**\n     * Tries to read some data from the store in the shape of the provided\n     * GraphQL fragment without making a network request. This method will read a\n     * GraphQL fragment from any arbitrary id that is currently cached, unlike\n     * `readQuery` which will only read from the root query.\n     *\n     * You must pass in a GraphQL document with a single fragment or a document\n     * with multiple fragments that represent what you are reading. If you pass\n     * in a document with multiple fragments then you must also specify a\n     * `fragmentName`.\n     *\n     * @param optimistic - Set to `true` to allow `readFragment` to return\n     * optimistic results. Is `false` by default.\n     */\n    ApolloClient.prototype.readFragment = function (options, optimistic) {\n        if (optimistic === void 0) { optimistic = false; }\n        return this.cache.readFragment(options, optimistic);\n    };\n    /**\n     * Writes some data in the shape of the provided GraphQL query directly to\n     * the store. This method will start at the root query. To start at a\n     * specific id returned by `dataIdFromObject` then use `writeFragment`.\n     */\n    ApolloClient.prototype.writeQuery = function (options) {\n        var ref = this.cache.writeQuery(options);\n        if (options.broadcast !== false) {\n            this.queryManager.broadcastQueries();\n        }\n        return ref;\n    };\n    /**\n     * Writes some data in the shape of the provided GraphQL fragment directly to\n     * the store. This method will write to a GraphQL fragment from any arbitrary\n     * id that is currently cached, unlike `writeQuery` which will only write\n     * from the root query.\n     *\n     * You must pass in a GraphQL document with a single fragment or a document\n     * with multiple fragments that represent what you are writing. If you pass\n     * in a document with multiple fragments then you must also specify a\n     * `fragmentName`.\n     */\n    ApolloClient.prototype.writeFragment = function (options) {\n        var ref = this.cache.writeFragment(options);\n        if (options.broadcast !== false) {\n            this.queryManager.broadcastQueries();\n        }\n        return ref;\n    };\n    ApolloClient.prototype.__actionHookForDevTools = function (cb) {\n        this.devToolsHookCb = cb;\n    };\n    ApolloClient.prototype.__requestRaw = function (payload) {\n        return execute(this.link, payload);\n    };\n    /**\n     * Resets your entire store by clearing out your cache and then re-executing\n     * all of your active queries. This makes it so that you may guarantee that\n     * there is no data left in your store from a time before you called this\n     * method.\n     *\n     * `resetStore()` is useful when your user just logged out. You’ve removed the\n     * user session, and you now want to make sure that any references to data you\n     * might have fetched while the user session was active is gone.\n     *\n     * It is important to remember that `resetStore()` *will* refetch any active\n     * queries. This means that any components that might be mounted will execute\n     * their queries again using your network interface. If you do not want to\n     * re-execute any queries then you should make sure to stop watching any\n     * active queries.\n     */\n    ApolloClient.prototype.resetStore = function () {\n        var _this = this;\n        return Promise.resolve()\n            .then(function () {\n            return _this.queryManager.clearStore({\n                discardWatches: false,\n            });\n        })\n            .then(function () { return Promise.all(_this.resetStoreCallbacks.map(function (fn) { return fn(); })); })\n            .then(function () { return _this.reFetchObservableQueries(); });\n    };\n    /**\n     * Remove all data from the store. Unlike `resetStore`, `clearStore` will\n     * not refetch any active queries.\n     */\n    ApolloClient.prototype.clearStore = function () {\n        var _this = this;\n        return Promise.resolve()\n            .then(function () {\n            return _this.queryManager.clearStore({\n                discardWatches: true,\n            });\n        })\n            .then(function () { return Promise.all(_this.clearStoreCallbacks.map(function (fn) { return fn(); })); });\n    };\n    /**\n     * Allows callbacks to be registered that are executed when the store is\n     * reset. `onResetStore` returns an unsubscribe function that can be used\n     * to remove registered callbacks.\n     */\n    ApolloClient.prototype.onResetStore = function (cb) {\n        var _this = this;\n        this.resetStoreCallbacks.push(cb);\n        return function () {\n            _this.resetStoreCallbacks = _this.resetStoreCallbacks.filter(function (c) { return c !== cb; });\n        };\n    };\n    /**\n     * Allows callbacks to be registered that are executed when the store is\n     * cleared. `onClearStore` returns an unsubscribe function that can be used\n     * to remove registered callbacks.\n     */\n    ApolloClient.prototype.onClearStore = function (cb) {\n        var _this = this;\n        this.clearStoreCallbacks.push(cb);\n        return function () {\n            _this.clearStoreCallbacks = _this.clearStoreCallbacks.filter(function (c) { return c !== cb; });\n        };\n    };\n    /**\n     * Refetches all of your active queries.\n     *\n     * `reFetchObservableQueries()` is useful if you want to bring the client back to proper state in case of a network outage\n     *\n     * It is important to remember that `reFetchObservableQueries()` *will* refetch any active\n     * queries. This means that any components that might be mounted will execute\n     * their queries again using your network interface. If you do not want to\n     * re-execute any queries then you should make sure to stop watching any\n     * active queries.\n     * Takes optional parameter `includeStandby` which will include queries in standby-mode when refetching.\n     */\n    ApolloClient.prototype.reFetchObservableQueries = function (includeStandby) {\n        return this.queryManager.reFetchObservableQueries(includeStandby);\n    };\n    /**\n     * Refetches specified active queries. Similar to \"reFetchObservableQueries()\" but with a specific list of queries.\n     *\n     * `refetchQueries()` is useful for use cases to imperatively refresh a selection of queries.\n     *\n     * It is important to remember that `refetchQueries()` *will* refetch specified active\n     * queries. This means that any components that might be mounted will execute\n     * their queries again using your network interface. If you do not want to\n     * re-execute any queries then you should make sure to stop watching any\n     * active queries.\n     */\n    ApolloClient.prototype.refetchQueries = function (options) {\n        var map = this.queryManager.refetchQueries(options);\n        var queries = [];\n        var results = [];\n        map.forEach(function (result, obsQuery) {\n            queries.push(obsQuery);\n            results.push(result);\n        });\n        var result = Promise.all(results);\n        // In case you need the raw results immediately, without awaiting\n        // Promise.all(results):\n        result.queries = queries;\n        result.results = results;\n        // If you decide to ignore the result Promise because you're using\n        // result.queries and result.results instead, you shouldn't have to worry\n        // about preventing uncaught rejections for the Promise.all result.\n        result.catch(function (error) {\n            globalThis.__DEV__ !== false && invariant.debug(17, error);\n        });\n        return result;\n    };\n    /**\n     * Get all currently active `ObservableQuery` objects, in a `Map` keyed by\n     * query ID strings.\n     *\n     * An \"active\" query is one that has observers and a `fetchPolicy` other than\n     * \"standby\" or \"cache-only\".\n     *\n     * You can include all `ObservableQuery` objects (including the inactive ones)\n     * by passing \"all\" instead of \"active\", or you can include just a subset of\n     * active queries by passing an array of query names or DocumentNode objects.\n     */\n    ApolloClient.prototype.getObservableQueries = function (include) {\n        if (include === void 0) { include = \"active\"; }\n        return this.queryManager.getObservableQueries(include);\n    };\n    /**\n     * Exposes the cache's complete state, in a serializable format for later restoration.\n     */\n    ApolloClient.prototype.extract = function (optimistic) {\n        return this.cache.extract(optimistic);\n    };\n    /**\n     * Replaces existing state in the cache (if any) with the values expressed by\n     * `serializedState`.\n     *\n     * Called when hydrating a cache (server side rendering, or offline storage),\n     * and also (potentially) during hot reloads.\n     */\n    ApolloClient.prototype.restore = function (serializedState) {\n        return this.cache.restore(serializedState);\n    };\n    /**\n     * Add additional local resolvers.\n     */\n    ApolloClient.prototype.addResolvers = function (resolvers) {\n        this.localState.addResolvers(resolvers);\n    };\n    /**\n     * Set (override existing) local resolvers.\n     */\n    ApolloClient.prototype.setResolvers = function (resolvers) {\n        this.localState.setResolvers(resolvers);\n    };\n    /**\n     * Get all registered local resolvers.\n     */\n    ApolloClient.prototype.getResolvers = function () {\n        return this.localState.getResolvers();\n    };\n    /**\n     * Set a custom local state fragment matcher.\n     */\n    ApolloClient.prototype.setLocalStateFragmentMatcher = function (fragmentMatcher) {\n        this.localState.setFragmentMatcher(fragmentMatcher);\n    };\n    /**\n     * Define a new ApolloLink (or link chain) that Apollo Client will use.\n     */\n    ApolloClient.prototype.setLink = function (newLink) {\n        this.link = this.queryManager.link = newLink;\n    };\n    Object.defineProperty(ApolloClient.prototype, \"defaultContext\", {\n        get: function () {\n            return this.queryManager.defaultContext;\n        },\n        enumerable: false,\n        configurable: true\n    });\n    return ApolloClient;\n}());\nexport { ApolloClient };\nif (globalThis.__DEV__ !== false) {\n    ApolloClient.prototype.getMemoryInternals = getApolloClientMemoryInternals;\n}\n//# sourceMappingURL=ApolloClient.js.map","import { __rest } from \"tslib\";\nimport equal from \"@wry/equality\";\nimport { createFragmentMap, getFragmentDefinitions, getFragmentFromSelection, getMainDefinition, isField, resultKeyNameFromField, shouldInclude, } from \"../utilities/index.js\";\n// Returns true if aResult and bResult are deeply equal according to the fields\n// selected by the given query, ignoring any fields marked as @nonreactive.\nexport function equalByQuery(query, _a, _b, variables) {\n    var aData = _a.data, aRest = __rest(_a, [\"data\"]);\n    var bData = _b.data, bRest = __rest(_b, [\"data\"]);\n    return (equal(aRest, bRest) &&\n        equalBySelectionSet(getMainDefinition(query).selectionSet, aData, bData, {\n            fragmentMap: createFragmentMap(getFragmentDefinitions(query)),\n            variables: variables,\n        }));\n}\nfunction equalBySelectionSet(selectionSet, aResult, bResult, context) {\n    if (aResult === bResult) {\n        return true;\n    }\n    var seenSelections = new Set();\n    // Returning true from this Array.prototype.every callback function skips the\n    // current field/subtree. Returning false aborts the entire traversal\n    // immediately, causing equalBySelectionSet to return false.\n    return selectionSet.selections.every(function (selection) {\n        // Avoid re-processing the same selection at the same level of recursion, in\n        // case the same field gets included via multiple indirect fragment spreads.\n        if (seenSelections.has(selection))\n            return true;\n        seenSelections.add(selection);\n        // Ignore @skip(if: true) and @include(if: false) fields.\n        if (!shouldInclude(selection, context.variables))\n            return true;\n        // If the field or (named) fragment spread has a @nonreactive directive on\n        // it, we don't care if it's different, so we pretend it's the same.\n        if (selectionHasNonreactiveDirective(selection))\n            return true;\n        if (isField(selection)) {\n            var resultKey = resultKeyNameFromField(selection);\n            var aResultChild = aResult && aResult[resultKey];\n            var bResultChild = bResult && bResult[resultKey];\n            var childSelectionSet = selection.selectionSet;\n            if (!childSelectionSet) {\n                // These are scalar values, so we can compare them with deep equal\n                // without redoing the main recursive work.\n                return equal(aResultChild, bResultChild);\n            }\n            var aChildIsArray = Array.isArray(aResultChild);\n            var bChildIsArray = Array.isArray(bResultChild);\n            if (aChildIsArray !== bChildIsArray)\n                return false;\n            if (aChildIsArray && bChildIsArray) {\n                var length_1 = aResultChild.length;\n                if (bResultChild.length !== length_1) {\n                    return false;\n                }\n                for (var i = 0; i < length_1; ++i) {\n                    if (!equalBySelectionSet(childSelectionSet, aResultChild[i], bResultChild[i], context)) {\n                        return false;\n                    }\n                }\n                return true;\n            }\n            return equalBySelectionSet(childSelectionSet, aResultChild, bResultChild, context);\n        }\n        else {\n            var fragment = getFragmentFromSelection(selection, context.fragmentMap);\n            if (fragment) {\n                // The fragment might === selection if it's an inline fragment, but\n                // could be !== if it's a named fragment ...spread.\n                if (selectionHasNonreactiveDirective(fragment))\n                    return true;\n                return equalBySelectionSet(fragment.selectionSet, \n                // Notice that we reuse the same aResult and bResult values here,\n                // since the fragment ...spread does not specify a field name, but\n                // consists of multiple fields (within the fragment's selection set)\n                // that should be applied to the current result value(s).\n                aResult, bResult, context);\n            }\n        }\n    });\n}\nfunction selectionHasNonreactiveDirective(selection) {\n    return (!!selection.directives && selection.directives.some(directiveIsNonreactive));\n}\nfunction directiveIsNonreactive(dir) {\n    return dir.name.value === \"nonreactive\";\n}\n//# sourceMappingURL=equalByQuery.js.map","import { __assign, __extends } from \"tslib\";\nimport { invariant } from \"../utilities/globals/index.js\";\nimport { equal } from \"@wry/equality\";\nimport { NetworkStatus, isNetworkRequestInFlight } from \"./networkStatus.js\";\nimport { cloneDeep, compact, getOperationDefinition, Observable, iterateObserversSafely, fixObservableSubclass, getQueryDefinition, } from \"../utilities/index.js\";\nimport { equalByQuery } from \"./equalByQuery.js\";\nvar assign = Object.assign, hasOwnProperty = Object.hasOwnProperty;\nvar ObservableQuery = /** @class */ (function (_super) {\n    __extends(ObservableQuery, _super);\n    function ObservableQuery(_a) {\n        var queryManager = _a.queryManager, queryInfo = _a.queryInfo, options = _a.options;\n        var _this = _super.call(this, function (observer) {\n            // Zen Observable has its own error function, so in order to log correctly\n            // we need to provide a custom error callback.\n            try {\n                var subObserver = observer._subscription._observer;\n                if (subObserver && !subObserver.error) {\n                    subObserver.error = defaultSubscriptionObserverErrorCallback;\n                }\n            }\n            catch (_a) { }\n            var first = !_this.observers.size;\n            _this.observers.add(observer);\n            // Deliver most recent error or result.\n            var last = _this.last;\n            if (last && last.error) {\n                observer.error && observer.error(last.error);\n            }\n            else if (last && last.result) {\n                observer.next && observer.next(last.result);\n            }\n            // Initiate observation of this query if it hasn't been reported to\n            // the QueryManager yet.\n            if (first) {\n                // Blindly catching here prevents unhandled promise rejections,\n                // and is safe because the ObservableQuery handles this error with\n                // this.observer.error, so we're not just swallowing the error by\n                // ignoring it here.\n                _this.reobserve().catch(function () { });\n            }\n            return function () {\n                if (_this.observers.delete(observer) && !_this.observers.size) {\n                    _this.tearDownQuery();\n                }\n            };\n        }) || this;\n        _this.observers = new Set();\n        _this.subscriptions = new Set();\n        // related classes\n        _this.queryInfo = queryInfo;\n        _this.queryManager = queryManager;\n        // active state\n        _this.waitForOwnResult = skipCacheDataFor(options.fetchPolicy);\n        _this.isTornDown = false;\n        var _b = queryManager.defaultOptions.watchQuery, _c = _b === void 0 ? {} : _b, _d = _c.fetchPolicy, defaultFetchPolicy = _d === void 0 ? \"cache-first\" : _d;\n        var _e = options.fetchPolicy, fetchPolicy = _e === void 0 ? defaultFetchPolicy : _e, \n        // Make sure we don't store \"standby\" as the initialFetchPolicy.\n        _f = options.initialFetchPolicy, \n        // Make sure we don't store \"standby\" as the initialFetchPolicy.\n        initialFetchPolicy = _f === void 0 ? fetchPolicy === \"standby\" ? defaultFetchPolicy : (fetchPolicy) : _f;\n        _this.options = __assign(__assign({}, options), { \n            // Remember the initial options.fetchPolicy so we can revert back to this\n            // policy when variables change. This information can also be specified\n            // (or overridden) by providing options.initialFetchPolicy explicitly.\n            initialFetchPolicy: initialFetchPolicy, \n            // This ensures this.options.fetchPolicy always has a string value, in\n            // case options.fetchPolicy was not provided.\n            fetchPolicy: fetchPolicy });\n        _this.queryId = queryInfo.queryId || queryManager.generateQueryId();\n        var opDef = getOperationDefinition(_this.query);\n        _this.queryName = opDef && opDef.name && opDef.name.value;\n        return _this;\n    }\n    Object.defineProperty(ObservableQuery.prototype, \"query\", {\n        // The `query` computed property will always reflect the document transformed\n        // by the last run query. `this.options.query` will always reflect the raw\n        // untransformed query to ensure document transforms with runtime conditionals\n        // are run on the original document.\n        get: function () {\n            return this.lastQuery || this.options.query;\n        },\n        enumerable: false,\n        configurable: true\n    });\n    Object.defineProperty(ObservableQuery.prototype, \"variables\", {\n        // Computed shorthand for this.options.variables, preserved for\n        // backwards compatibility.\n        /**\n         * An object containing the variables that were provided for the query.\n         */\n        get: function () {\n            return this.options.variables;\n        },\n        enumerable: false,\n        configurable: true\n    });\n    ObservableQuery.prototype.result = function () {\n        var _this = this;\n        return new Promise(function (resolve, reject) {\n            // TODO: this code doesn’t actually make sense insofar as the observer\n            // will never exist in this.observers due how zen-observable wraps observables.\n            // https://github.com/zenparsing/zen-observable/blob/master/src/Observable.js#L169\n            var observer = {\n                next: function (result) {\n                    resolve(result);\n                    // Stop the query within the QueryManager if we can before\n                    // this function returns.\n                    //\n                    // We do this in order to prevent observers piling up within\n                    // the QueryManager. Notice that we only fully unsubscribe\n                    // from the subscription in a setTimeout(..., 0)  call. This call can\n                    // actually be handled by the browser at a much later time. If queries\n                    // are fired in the meantime, observers that should have been removed\n                    // from the QueryManager will continue to fire, causing an unnecessary\n                    // performance hit.\n                    _this.observers.delete(observer);\n                    if (!_this.observers.size) {\n                        _this.queryManager.removeQuery(_this.queryId);\n                    }\n                    setTimeout(function () {\n                        subscription.unsubscribe();\n                    }, 0);\n                },\n                error: reject,\n            };\n            var subscription = _this.subscribe(observer);\n        });\n    };\n    /** @internal */\n    ObservableQuery.prototype.resetDiff = function () {\n        this.queryInfo.resetDiff();\n    };\n    ObservableQuery.prototype.getCurrentResult = function (saveAsLastResult) {\n        if (saveAsLastResult === void 0) { saveAsLastResult = true; }\n        // Use the last result as long as the variables match this.variables.\n        var lastResult = this.getLastResult(true);\n        var networkStatus = this.queryInfo.networkStatus ||\n            (lastResult && lastResult.networkStatus) ||\n            NetworkStatus.ready;\n        var result = __assign(__assign({}, lastResult), { loading: isNetworkRequestInFlight(networkStatus), networkStatus: networkStatus });\n        var _a = this.options.fetchPolicy, fetchPolicy = _a === void 0 ? \"cache-first\" : _a;\n        if (\n        // These fetch policies should never deliver data from the cache, unless\n        // redelivering a previously delivered result.\n        skipCacheDataFor(fetchPolicy) ||\n            // If this.options.query has @client(always: true) fields, we cannot\n            // trust diff.result, since it was read from the cache without running\n            // local resolvers (and it's too late to run resolvers now, since we must\n            // return a result synchronously).\n            this.queryManager.getDocumentInfo(this.query).hasForcedResolvers) {\n            // Fall through.\n        }\n        else if (this.waitForOwnResult) {\n            // This would usually be a part of `QueryInfo.getDiff()`.\n            // which we skip in the waitForOwnResult case since we are not\n            // interested in the diff.\n            this.queryInfo[\"updateWatch\"]();\n        }\n        else {\n            var diff = this.queryInfo.getDiff();\n            if (diff.complete || this.options.returnPartialData) {\n                result.data = diff.result;\n            }\n            if (equal(result.data, {})) {\n                result.data = void 0;\n            }\n            if (diff.complete) {\n                // Similar to setting result.partial to false, but taking advantage of the\n                // falsiness of missing fields.\n                delete result.partial;\n                // If the diff is complete, and we're using a FetchPolicy that\n                // terminates after a complete cache read, we can assume the next result\n                // we receive will have NetworkStatus.ready and !loading.\n                if (diff.complete &&\n                    result.networkStatus === NetworkStatus.loading &&\n                    (fetchPolicy === \"cache-first\" || fetchPolicy === \"cache-only\")) {\n                    result.networkStatus = NetworkStatus.ready;\n                    result.loading = false;\n                }\n            }\n            else {\n                result.partial = true;\n            }\n            if (globalThis.__DEV__ !== false &&\n                !diff.complete &&\n                !this.options.partialRefetch &&\n                !result.loading &&\n                !result.data &&\n                !result.error) {\n                logMissingFieldErrors(diff.missing);\n            }\n        }\n        if (saveAsLastResult) {\n            this.updateLastResult(result);\n        }\n        return result;\n    };\n    // Compares newResult to the snapshot we took of this.lastResult when it was\n    // first received.\n    ObservableQuery.prototype.isDifferentFromLastResult = function (newResult, variables) {\n        if (!this.last) {\n            return true;\n        }\n        var resultIsDifferent = this.queryManager.getDocumentInfo(this.query).hasNonreactiveDirective ?\n            !equalByQuery(this.query, this.last.result, newResult, this.variables)\n            : !equal(this.last.result, newResult);\n        return (resultIsDifferent || (variables && !equal(this.last.variables, variables)));\n    };\n    ObservableQuery.prototype.getLast = function (key, variablesMustMatch) {\n        var last = this.last;\n        if (last &&\n            last[key] &&\n            (!variablesMustMatch || equal(last.variables, this.variables))) {\n            return last[key];\n        }\n    };\n    ObservableQuery.prototype.getLastResult = function (variablesMustMatch) {\n        return this.getLast(\"result\", variablesMustMatch);\n    };\n    ObservableQuery.prototype.getLastError = function (variablesMustMatch) {\n        return this.getLast(\"error\", variablesMustMatch);\n    };\n    ObservableQuery.prototype.resetLastResults = function () {\n        delete this.last;\n        this.isTornDown = false;\n    };\n    ObservableQuery.prototype.resetQueryStoreErrors = function () {\n        this.queryManager.resetErrors(this.queryId);\n    };\n    /**\n     * Update the variables of this observable query, and fetch the new results.\n     * This method should be preferred over `setVariables` in most use cases.\n     *\n     * @param variables - The new set of variables. If there are missing variables,\n     * the previous values of those variables will be used.\n     */\n    ObservableQuery.prototype.refetch = function (variables) {\n        var _a;\n        var reobserveOptions = {\n            // Always disable polling for refetches.\n            pollInterval: 0,\n        };\n        // Unless the provided fetchPolicy always consults the network\n        // (no-cache, network-only, or cache-and-network), override it with\n        // network-only to force the refetch for this fetchQuery call.\n        var fetchPolicy = this.options.fetchPolicy;\n        if (fetchPolicy === \"cache-and-network\") {\n            reobserveOptions.fetchPolicy = fetchPolicy;\n        }\n        else if (fetchPolicy === \"no-cache\") {\n            reobserveOptions.fetchPolicy = \"no-cache\";\n        }\n        else {\n            reobserveOptions.fetchPolicy = \"network-only\";\n        }\n        if (globalThis.__DEV__ !== false && variables && hasOwnProperty.call(variables, \"variables\")) {\n            var queryDef = getQueryDefinition(this.query);\n            var vars = queryDef.variableDefinitions;\n            if (!vars || !vars.some(function (v) { return v.variable.name.value === \"variables\"; })) {\n                globalThis.__DEV__ !== false && invariant.warn(\n                    20,\n                    variables,\n                    ((_a = queryDef.name) === null || _a === void 0 ? void 0 : _a.value) || queryDef\n                );\n            }\n        }\n        if (variables && !equal(this.options.variables, variables)) {\n            // Update the existing options with new variables\n            reobserveOptions.variables = this.options.variables = __assign(__assign({}, this.options.variables), variables);\n        }\n        this.queryInfo.resetLastWrite();\n        return this.reobserve(reobserveOptions, NetworkStatus.refetch);\n    };\n    /**\n     * A function that helps you fetch the next set of results for a [paginated list field](https://www.apollographql.com/docs/react/pagination/core-api/).\n     */\n    ObservableQuery.prototype.fetchMore = function (fetchMoreOptions) {\n        var _this = this;\n        var combinedOptions = __assign(__assign({}, (fetchMoreOptions.query ? fetchMoreOptions : (__assign(__assign(__assign(__assign({}, this.options), { query: this.options.query }), fetchMoreOptions), { variables: __assign(__assign({}, this.options.variables), fetchMoreOptions.variables) })))), { \n            // The fetchMore request goes immediately to the network and does\n            // not automatically write its result to the cache (hence no-cache\n            // instead of network-only), because we allow the caller of\n            // fetchMore to provide an updateQuery callback that determines how\n            // the data gets written to the cache.\n            fetchPolicy: \"no-cache\" });\n        combinedOptions.query = this.transformDocument(combinedOptions.query);\n        var qid = this.queryManager.generateQueryId();\n        // If a temporary query is passed to `fetchMore`, we don't want to store\n        // it as the last query result since it may be an optimized query for\n        // pagination. We will however run the transforms on the original document\n        // as well as the document passed in `fetchMoreOptions` to ensure the cache\n        // uses the most up-to-date document which may rely on runtime conditionals.\n        this.lastQuery =\n            fetchMoreOptions.query ?\n                this.transformDocument(this.options.query)\n                : combinedOptions.query;\n        // Simulate a loading result for the original query with\n        // result.networkStatus === NetworkStatus.fetchMore.\n        var queryInfo = this.queryInfo;\n        var originalNetworkStatus = queryInfo.networkStatus;\n        queryInfo.networkStatus = NetworkStatus.fetchMore;\n        if (combinedOptions.notifyOnNetworkStatusChange) {\n            this.observe();\n        }\n        var updatedQuerySet = new Set();\n        return this.queryManager\n            .fetchQuery(qid, combinedOptions, NetworkStatus.fetchMore)\n            .then(function (fetchMoreResult) {\n            _this.queryManager.removeQuery(qid);\n            if (queryInfo.networkStatus === NetworkStatus.fetchMore) {\n                queryInfo.networkStatus = originalNetworkStatus;\n            }\n            // Performing this cache update inside a cache.batch transaction ensures\n            // any affected cache.watch watchers are notified at most once about any\n            // updates. Most watchers will be using the QueryInfo class, which\n            // responds to notifications by calling reobserveCacheFirst to deliver\n            // fetchMore cache results back to this ObservableQuery.\n            _this.queryManager.cache.batch({\n                update: function (cache) {\n                    var updateQuery = fetchMoreOptions.updateQuery;\n                    if (updateQuery) {\n                        cache.updateQuery({\n                            query: _this.query,\n                            variables: _this.variables,\n                            returnPartialData: true,\n                            optimistic: false,\n                        }, function (previous) {\n                            return updateQuery(previous, {\n                                fetchMoreResult: fetchMoreResult.data,\n                                variables: combinedOptions.variables,\n                            });\n                        });\n                    }\n                    else {\n                        // If we're using a field policy instead of updateQuery, the only\n                        // thing we need to do is write the new data to the cache using\n                        // combinedOptions.variables (instead of this.variables, which is\n                        // what this.updateQuery uses, because it works by abusing the\n                        // original field value, keyed by the original variables).\n                        cache.writeQuery({\n                            query: combinedOptions.query,\n                            variables: combinedOptions.variables,\n                            data: fetchMoreResult.data,\n                        });\n                    }\n                },\n                onWatchUpdated: function (watch) {\n                    // Record the DocumentNode associated with any watched query whose\n                    // data were updated by the cache writes above.\n                    updatedQuerySet.add(watch.query);\n                },\n            });\n            return fetchMoreResult;\n        })\n            .finally(function () {\n            // In case the cache writes above did not generate a broadcast\n            // notification (which would have been intercepted by onWatchUpdated),\n            // likely because the written data were the same as what was already in\n            // the cache, we still want fetchMore to deliver its final loading:false\n            // result with the unchanged data.\n            if (!updatedQuerySet.has(_this.query)) {\n                reobserveCacheFirst(_this);\n            }\n        });\n    };\n    // XXX the subscription variables are separate from the query variables.\n    // if you want to update subscription variables, right now you have to do that separately,\n    // and you can only do it by stopping the subscription and then subscribing again with new variables.\n    /**\n     * A function that enables you to execute a [subscription](https://www.apollographql.com/docs/react/data/subscriptions/), usually to subscribe to specific fields that were included in the query.\n     *\n     * This function returns _another_ function that you can call to terminate the subscription.\n     */\n    ObservableQuery.prototype.subscribeToMore = function (options) {\n        var _this = this;\n        var subscription = this.queryManager\n            .startGraphQLSubscription({\n            query: options.document,\n            variables: options.variables,\n            context: options.context,\n        })\n            .subscribe({\n            next: function (subscriptionData) {\n                var updateQuery = options.updateQuery;\n                if (updateQuery) {\n                    _this.updateQuery(function (previous, _a) {\n                        var variables = _a.variables;\n                        return updateQuery(previous, {\n                            subscriptionData: subscriptionData,\n                            variables: variables,\n                        });\n                    });\n                }\n            },\n            error: function (err) {\n                if (options.onError) {\n                    options.onError(err);\n                    return;\n                }\n                globalThis.__DEV__ !== false && invariant.error(21, err);\n            },\n        });\n        this.subscriptions.add(subscription);\n        return function () {\n            if (_this.subscriptions.delete(subscription)) {\n                subscription.unsubscribe();\n            }\n        };\n    };\n    ObservableQuery.prototype.setOptions = function (newOptions) {\n        return this.reobserve(newOptions);\n    };\n    ObservableQuery.prototype.silentSetOptions = function (newOptions) {\n        var mergedOptions = compact(this.options, newOptions || {});\n        assign(this.options, mergedOptions);\n    };\n    /**\n     * Update the variables of this observable query, and fetch the new results\n     * if they've changed. Most users should prefer `refetch` instead of\n     * `setVariables` in order to to be properly notified of results even when\n     * they come from the cache.\n     *\n     * Note: the `next` callback will *not* fire if the variables have not changed\n     * or if the result is coming from cache.\n     *\n     * Note: the promise will return the old results immediately if the variables\n     * have not changed.\n     *\n     * Note: the promise will return null immediately if the query is not active\n     * (there are no subscribers).\n     *\n     * @param variables - The new set of variables. If there are missing variables,\n     * the previous values of those variables will be used.\n     */\n    ObservableQuery.prototype.setVariables = function (variables) {\n        if (equal(this.variables, variables)) {\n            // If we have no observers, then we don't actually want to make a network\n            // request. As soon as someone observes the query, the request will kick\n            // off. For now, we just store any changes. (See #1077)\n            return this.observers.size ? this.result() : Promise.resolve();\n        }\n        this.options.variables = variables;\n        // See comment above\n        if (!this.observers.size) {\n            return Promise.resolve();\n        }\n        return this.reobserve({\n            // Reset options.fetchPolicy to its original value.\n            fetchPolicy: this.options.initialFetchPolicy,\n            variables: variables,\n        }, NetworkStatus.setVariables);\n    };\n    /**\n     * A function that enables you to update the query's cached result without executing a followup GraphQL operation.\n     *\n     * See [using updateQuery and updateFragment](https://www.apollographql.com/docs/react/caching/cache-interaction/#using-updatequery-and-updatefragment) for additional information.\n     */\n    ObservableQuery.prototype.updateQuery = function (mapFn) {\n        var queryManager = this.queryManager;\n        var result = queryManager.cache.diff({\n            query: this.options.query,\n            variables: this.variables,\n            returnPartialData: true,\n            optimistic: false,\n        }).result;\n        var newResult = mapFn(result, {\n            variables: this.variables,\n        });\n        if (newResult) {\n            queryManager.cache.writeQuery({\n                query: this.options.query,\n                data: newResult,\n                variables: this.variables,\n            });\n            queryManager.broadcastQueries();\n        }\n    };\n    /**\n     * A function that instructs the query to begin re-executing at a specified interval (in milliseconds).\n     */\n    ObservableQuery.prototype.startPolling = function (pollInterval) {\n        this.options.pollInterval = pollInterval;\n        this.updatePolling();\n    };\n    /**\n     * A function that instructs the query to stop polling after a previous call to `startPolling`.\n     */\n    ObservableQuery.prototype.stopPolling = function () {\n        this.options.pollInterval = 0;\n        this.updatePolling();\n    };\n    // Update options.fetchPolicy according to options.nextFetchPolicy.\n    ObservableQuery.prototype.applyNextFetchPolicy = function (reason, \n    // It's possible to use this method to apply options.nextFetchPolicy to\n    // options.fetchPolicy even if options !== this.options, though that happens\n    // most often when the options are temporary, used for only one request and\n    // then thrown away, so nextFetchPolicy may not end up mattering.\n    options) {\n        if (options.nextFetchPolicy) {\n            var _a = options.fetchPolicy, fetchPolicy = _a === void 0 ? \"cache-first\" : _a, _b = options.initialFetchPolicy, initialFetchPolicy = _b === void 0 ? fetchPolicy : _b;\n            if (fetchPolicy === \"standby\") {\n                // Do nothing, leaving options.fetchPolicy unchanged.\n            }\n            else if (typeof options.nextFetchPolicy === \"function\") {\n                // When someone chooses \"cache-and-network\" or \"network-only\" as their\n                // initial FetchPolicy, they often do not want future cache updates to\n                // trigger unconditional network requests, which is what repeatedly\n                // applying the \"cache-and-network\" or \"network-only\" policies would\n                // seem to imply. Instead, when the cache reports an update after the\n                // initial network request, it may be desirable for subsequent network\n                // requests to be triggered only if the cache result is incomplete. To\n                // that end, the options.nextFetchPolicy option provides an easy way to\n                // update options.fetchPolicy after the initial network request, without\n                // having to call observableQuery.setOptions.\n                options.fetchPolicy = options.nextFetchPolicy(fetchPolicy, {\n                    reason: reason,\n                    options: options,\n                    observable: this,\n                    initialFetchPolicy: initialFetchPolicy,\n                });\n            }\n            else if (reason === \"variables-changed\") {\n                options.fetchPolicy = initialFetchPolicy;\n            }\n            else {\n                options.fetchPolicy = options.nextFetchPolicy;\n            }\n        }\n        return options.fetchPolicy;\n    };\n    ObservableQuery.prototype.fetch = function (options, newNetworkStatus, query) {\n        // TODO Make sure we update the networkStatus (and infer fetchVariables)\n        // before actually committing to the fetch.\n        this.queryManager.setObservableQuery(this);\n        return this.queryManager[\"fetchConcastWithInfo\"](this.queryId, options, newNetworkStatus, query);\n    };\n    // Turns polling on or off based on this.options.pollInterval.\n    ObservableQuery.prototype.updatePolling = function () {\n        var _this = this;\n        // Avoid polling in SSR mode\n        if (this.queryManager.ssrMode) {\n            return;\n        }\n        var _a = this, pollingInfo = _a.pollingInfo, pollInterval = _a.options.pollInterval;\n        if (!pollInterval) {\n            if (pollingInfo) {\n                clearTimeout(pollingInfo.timeout);\n                delete this.pollingInfo;\n            }\n            return;\n        }\n        if (pollingInfo && pollingInfo.interval === pollInterval) {\n            return;\n        }\n        invariant(pollInterval, 22);\n        var info = pollingInfo || (this.pollingInfo = {});\n        info.interval = pollInterval;\n        var maybeFetch = function () {\n            var _a, _b;\n            if (_this.pollingInfo) {\n                if (!isNetworkRequestInFlight(_this.queryInfo.networkStatus) &&\n                    !((_b = (_a = _this.options).skipPollAttempt) === null || _b === void 0 ? void 0 : _b.call(_a))) {\n                    _this.reobserve({\n                        // Most fetchPolicy options don't make sense to use in a polling context, as\n                        // users wouldn't want to be polling the cache directly. However, network-only and\n                        // no-cache are both useful for when the user wants to control whether or not the\n                        // polled results are written to the cache.\n                        fetchPolicy: _this.options.initialFetchPolicy === \"no-cache\" ?\n                            \"no-cache\"\n                            : \"network-only\",\n                    }, NetworkStatus.poll).then(poll, poll);\n                }\n                else {\n                    poll();\n                }\n            }\n        };\n        var poll = function () {\n            var info = _this.pollingInfo;\n            if (info) {\n                clearTimeout(info.timeout);\n                info.timeout = setTimeout(maybeFetch, info.interval);\n            }\n        };\n        poll();\n    };\n    ObservableQuery.prototype.updateLastResult = function (newResult, variables) {\n        if (variables === void 0) { variables = this.variables; }\n        var error = this.getLastError();\n        // Preserve this.last.error unless the variables have changed.\n        if (error && this.last && !equal(variables, this.last.variables)) {\n            error = void 0;\n        }\n        return (this.last = __assign({ result: this.queryManager.assumeImmutableResults ?\n                newResult\n                : cloneDeep(newResult), variables: variables }, (error ? { error: error } : null)));\n    };\n    ObservableQuery.prototype.reobserveAsConcast = function (newOptions, newNetworkStatus) {\n        var _this = this;\n        this.isTornDown = false;\n        var useDisposableConcast = \n        // Refetching uses a disposable Concast to allow refetches using different\n        // options/variables, without permanently altering the options of the\n        // original ObservableQuery.\n        newNetworkStatus === NetworkStatus.refetch ||\n            // The fetchMore method does not actually call the reobserve method, but,\n            // if it did, it would definitely use a disposable Concast.\n            newNetworkStatus === NetworkStatus.fetchMore ||\n            // Polling uses a disposable Concast so the polling options (which force\n            // fetchPolicy to be \"network-only\" or \"no-cache\") won't override the original options.\n            newNetworkStatus === NetworkStatus.poll;\n        // Save the old variables, since Object.assign may modify them below.\n        var oldVariables = this.options.variables;\n        var oldFetchPolicy = this.options.fetchPolicy;\n        var mergedOptions = compact(this.options, newOptions || {});\n        var options = useDisposableConcast ?\n            // Disposable Concast fetches receive a shallow copy of this.options\n            // (merged with newOptions), leaving this.options unmodified.\n            mergedOptions\n            : assign(this.options, mergedOptions);\n        // Don't update options.query with the transformed query to avoid\n        // overwriting this.options.query when we aren't using a disposable concast.\n        // We want to ensure we can re-run the custom document transforms the next\n        // time a request is made against the original query.\n        var query = this.transformDocument(options.query);\n        this.lastQuery = query;\n        if (!useDisposableConcast) {\n            // We can skip calling updatePolling if we're not changing this.options.\n            this.updatePolling();\n            // Reset options.fetchPolicy to its original value when variables change,\n            // unless a new fetchPolicy was provided by newOptions.\n            if (newOptions &&\n                newOptions.variables &&\n                !equal(newOptions.variables, oldVariables) &&\n                // Don't mess with the fetchPolicy if it's currently \"standby\".\n                options.fetchPolicy !== \"standby\" &&\n                // If we're changing the fetchPolicy anyway, don't try to change it here\n                // using applyNextFetchPolicy. The explicit options.fetchPolicy wins.\n                options.fetchPolicy === oldFetchPolicy) {\n                this.applyNextFetchPolicy(\"variables-changed\", options);\n                if (newNetworkStatus === void 0) {\n                    newNetworkStatus = NetworkStatus.setVariables;\n                }\n            }\n        }\n        this.waitForOwnResult && (this.waitForOwnResult = skipCacheDataFor(options.fetchPolicy));\n        var finishWaitingForOwnResult = function () {\n            if (_this.concast === concast) {\n                _this.waitForOwnResult = false;\n            }\n        };\n        var variables = options.variables && __assign({}, options.variables);\n        var _a = this.fetch(options, newNetworkStatus, query), concast = _a.concast, fromLink = _a.fromLink;\n        var observer = {\n            next: function (result) {\n                if (equal(_this.variables, variables)) {\n                    finishWaitingForOwnResult();\n                    _this.reportResult(result, variables);\n                }\n            },\n            error: function (error) {\n                if (equal(_this.variables, variables)) {\n                    finishWaitingForOwnResult();\n                    _this.reportError(error, variables);\n                }\n            },\n        };\n        if (!useDisposableConcast && (fromLink || !this.concast)) {\n            // We use the {add,remove}Observer methods directly to avoid wrapping\n            // observer with an unnecessary SubscriptionObserver object.\n            if (this.concast && this.observer) {\n                this.concast.removeObserver(this.observer);\n            }\n            this.concast = concast;\n            this.observer = observer;\n        }\n        concast.addObserver(observer);\n        return concast;\n    };\n    ObservableQuery.prototype.reobserve = function (newOptions, newNetworkStatus) {\n        return this.reobserveAsConcast(newOptions, newNetworkStatus)\n            .promise;\n    };\n    ObservableQuery.prototype.resubscribeAfterError = function () {\n        var args = [];\n        for (var _i = 0; _i < arguments.length; _i++) {\n            args[_i] = arguments[_i];\n        }\n        // If `lastError` is set in the current when the subscription is re-created,\n        // the subscription will immediately receive the error, which will\n        // cause it to terminate again. To avoid this, we first clear\n        // the last error/result from the `observableQuery` before re-starting\n        // the subscription, and restore the last value afterwards so that the\n        // subscription has a chance to stay open.\n        var last = this.last;\n        this.resetLastResults();\n        var subscription = this.subscribe.apply(this, args);\n        this.last = last;\n        return subscription;\n    };\n    // (Re)deliver the current result to this.observers without applying fetch\n    // policies or making network requests.\n    ObservableQuery.prototype.observe = function () {\n        this.reportResult(\n        // Passing false is important so that this.getCurrentResult doesn't\n        // save the fetchMore result as this.lastResult, causing it to be\n        // ignored due to the this.isDifferentFromLastResult check in\n        // this.reportResult.\n        this.getCurrentResult(false), this.variables);\n    };\n    ObservableQuery.prototype.reportResult = function (result, variables) {\n        var lastError = this.getLastError();\n        var isDifferent = this.isDifferentFromLastResult(result, variables);\n        // Update the last result even when isDifferentFromLastResult returns false,\n        // because the query may be using the @nonreactive directive, and we want to\n        // save the the latest version of any nonreactive subtrees (in case\n        // getCurrentResult is called), even though we skip broadcasting changes.\n        if (lastError || !result.partial || this.options.returnPartialData) {\n            this.updateLastResult(result, variables);\n        }\n        if (lastError || isDifferent) {\n            iterateObserversSafely(this.observers, \"next\", result);\n        }\n    };\n    ObservableQuery.prototype.reportError = function (error, variables) {\n        // Since we don't get the current result on errors, only the error, we\n        // must mirror the updates that occur in QueryStore.markQueryError here\n        var errorResult = __assign(__assign({}, this.getLastResult()), { error: error, errors: error.graphQLErrors, networkStatus: NetworkStatus.error, loading: false });\n        this.updateLastResult(errorResult, variables);\n        iterateObserversSafely(this.observers, \"error\", (this.last.error = error));\n    };\n    ObservableQuery.prototype.hasObservers = function () {\n        return this.observers.size > 0;\n    };\n    ObservableQuery.prototype.tearDownQuery = function () {\n        if (this.isTornDown)\n            return;\n        if (this.concast && this.observer) {\n            this.concast.removeObserver(this.observer);\n            delete this.concast;\n            delete this.observer;\n        }\n        this.stopPolling();\n        // stop all active GraphQL subscriptions\n        this.subscriptions.forEach(function (sub) { return sub.unsubscribe(); });\n        this.subscriptions.clear();\n        this.queryManager.stopQuery(this.queryId);\n        this.observers.clear();\n        this.isTornDown = true;\n    };\n    ObservableQuery.prototype.transformDocument = function (document) {\n        return this.queryManager.transform(document);\n    };\n    return ObservableQuery;\n}(Observable));\nexport { ObservableQuery };\n// Necessary because the ObservableQuery constructor has a different\n// signature than the Observable constructor.\nfixObservableSubclass(ObservableQuery);\n// Reobserve with fetchPolicy effectively set to \"cache-first\", triggering\n// delivery of any new data from the cache, possibly falling back to the network\n// if any cache data are missing. This allows _complete_ cache results to be\n// delivered without also kicking off unnecessary network requests when\n// this.options.fetchPolicy is \"cache-and-network\" or \"network-only\". When\n// this.options.fetchPolicy is any other policy (\"cache-first\", \"cache-only\",\n// \"standby\", or \"no-cache\"), we call this.reobserve() as usual.\nexport function reobserveCacheFirst(obsQuery) {\n    var _a = obsQuery.options, fetchPolicy = _a.fetchPolicy, nextFetchPolicy = _a.nextFetchPolicy;\n    if (fetchPolicy === \"cache-and-network\" || fetchPolicy === \"network-only\") {\n        return obsQuery.reobserve({\n            fetchPolicy: \"cache-first\",\n            // Use a temporary nextFetchPolicy function that replaces itself with the\n            // previous nextFetchPolicy value and returns the original fetchPolicy.\n            nextFetchPolicy: function (currentFetchPolicy, context) {\n                // Replace this nextFetchPolicy function in the options object with the\n                // original this.options.nextFetchPolicy value.\n                this.nextFetchPolicy = nextFetchPolicy;\n                // If the original nextFetchPolicy value was a function, give it a\n                // chance to decide what happens here.\n                if (typeof this.nextFetchPolicy === \"function\") {\n                    return this.nextFetchPolicy(currentFetchPolicy, context);\n                }\n                // Otherwise go back to the original this.options.fetchPolicy.\n                return fetchPolicy;\n            },\n        });\n    }\n    return obsQuery.reobserve();\n}\nfunction defaultSubscriptionObserverErrorCallback(error) {\n    globalThis.__DEV__ !== false && invariant.error(23, error.message, error.stack);\n}\nexport function logMissingFieldErrors(missing) {\n    if (globalThis.__DEV__ !== false && missing) {\n        globalThis.__DEV__ !== false && invariant.debug(24, missing);\n    }\n}\nfunction skipCacheDataFor(fetchPolicy /* `undefined` would mean `\"cache-first\"` */) {\n    return (fetchPolicy === \"network-only\" ||\n        fetchPolicy === \"no-cache\" ||\n        fetchPolicy === \"standby\");\n}\n//# sourceMappingURL=ObservableQuery.js.map","export var Cache;\n(function (Cache) {\n})(Cache || (Cache = {}));\n//# sourceMappingURL=Cache.js.map","import { ApolloLink } from \"./ApolloLink.js\";\nexport var empty = ApolloLink.empty;\n//# sourceMappingURL=empty.js.map","import { ApolloLink } from \"./ApolloLink.js\";\nexport var from = ApolloLink.from;\n//# sourceMappingURL=from.js.map","import { ApolloLink } from \"./ApolloLink.js\";\nexport var concat = ApolloLink.concat;\n//# sourceMappingURL=concat.js.map","/**\n * @deprecated\n * This is not used internally any more and will be removed in\n * the next major version of Apollo Client.\n */\nexport var createSignalIfSupported = function () {\n    if (typeof AbortController === \"undefined\")\n        return { controller: false, signal: false };\n    var controller = new AbortController();\n    var signal = controller.signal;\n    return { controller: controller, signal: signal };\n};\n//# sourceMappingURL=createSignalIfSupported.js.map","import { invariant } from \"../../utilities/globals/index.js\";\nexport function toPromise(observable) {\n    var completed = false;\n    return new Promise(function (resolve, reject) {\n        observable.subscribe({\n            next: function (data) {\n                if (completed) {\n                    globalThis.__DEV__ !== false && invariant.warn(42);\n                }\n                else {\n                    completed = true;\n                    resolve(data);\n                }\n            },\n            error: reject,\n        });\n    });\n}\n//# sourceMappingURL=toPromise.js.map","import { Observable } from \"../../utilities/index.js\";\nexport function fromPromise(promise) {\n    return new Observable(function (observer) {\n        promise\n            .then(function (value) {\n            observer.next(value);\n            observer.complete();\n        })\n            .catch(observer.error.bind(observer));\n    });\n}\n//# sourceMappingURL=fromPromise.js.map","/* Core */\nexport { ApolloClient, mergeOptions } from \"./ApolloClient.js\";\nexport { ObservableQuery } from \"./ObservableQuery.js\";\nexport { NetworkStatus, isNetworkRequestSettled } from \"./networkStatus.js\";\nexport * from \"./types.js\";\nexport { isApolloError, ApolloError } from \"../errors/index.js\";\nexport { Cache, ApolloCache, InMemoryCache, MissingFieldError, defaultDataIdFromObject, makeVar, } from \"../cache/index.js\";\nexport * from \"../cache/inmemory/types.js\";\n/* Link */\nexport * from \"../link/core/index.js\";\nexport * from \"../link/http/index.js\";\nexport { fromError, toPromise, fromPromise, throwServerError, } from \"../link/utils/index.js\";\nexport { DocumentTransform, Observable, isReference, makeReference, } from \"../utilities/index.js\";\n/* Supporting */\n// The verbosity of invariant.{log,warn,error} can be controlled globally\n// (for anyone using the same ts-invariant package) by passing \"log\",\n// \"warn\", \"error\", or \"silent\" to setVerbosity (\"log\" is the default).\n// Note that all invariant.* logging is hidden in production.\nimport { setVerbosity } from \"ts-invariant\";\nexport { setVerbosity as setLogVerbosity };\nsetVerbosity(globalThis.__DEV__ !== false ? \"log\" : \"silent\");\n// Note that importing `gql` by itself, then destructuring\n// additional properties separately before exporting, is intentional.\n// Due to the way the `graphql-tag` library is setup, certain bundlers\n// can't find the properties added to the exported `gql` function without\n// additional guidance (e.g. Rollup - see\n// https://rollupjs.org/guide/en/#error-name-is-not-exported-by-module).\n// Instead of having people that are using bundlers with `@apollo/client` add\n// extra bundler config to help `graphql-tag` exports be found (which would be\n// awkward since they aren't importing `graphql-tag` themselves), this\n// workaround of pulling the extra properties off the `gql` function,\n// then re-exporting them separately, helps keeps bundlers happy without any\n// additional config changes.\nexport { gql, resetCaches, disableFragmentWarnings, enableExperimentalFragmentVariables, disableExperimentalFragmentVariables, } from \"graphql-tag\";\n//# sourceMappingURL=index.js.map","import { __assign } from \"tslib\";\nimport { Observable } from \"../../utilities/index.js\";\n// QueryBatcher doesn't fire requests immediately. Requests that were enqueued within\n// a certain amount of time (configurable through `batchInterval`) will be batched together\n// into one query.\nvar OperationBatcher = /** @class */ (function () {\n    function OperationBatcher(_a) {\n        var batchDebounce = _a.batchDebounce, batchInterval = _a.batchInterval, batchMax = _a.batchMax, batchHandler = _a.batchHandler, batchKey = _a.batchKey;\n        // Queue on which the QueryBatcher will operate on a per-tick basis.\n        this.batchesByKey = new Map();\n        this.scheduledBatchTimerByKey = new Map();\n        this.batchDebounce = batchDebounce;\n        this.batchInterval = batchInterval;\n        this.batchMax = batchMax || 0;\n        this.batchHandler = batchHandler;\n        this.batchKey = batchKey || (function () { return \"\"; });\n    }\n    OperationBatcher.prototype.enqueueRequest = function (request) {\n        var _this = this;\n        var requestCopy = __assign(__assign({}, request), { next: [], error: [], complete: [], subscribers: new Set() });\n        var key = this.batchKey(request.operation);\n        if (!requestCopy.observable) {\n            requestCopy.observable = new Observable(function (observer) {\n                var batch = _this.batchesByKey.get(key);\n                if (!batch)\n                    _this.batchesByKey.set(key, (batch = new Set()));\n                // These booleans seem to me (@benjamn) like they might always be the\n                // same (and thus we could do with only one of them), but I'm not 100%\n                // sure about that.\n                var isFirstEnqueuedRequest = batch.size === 0;\n                var isFirstSubscriber = requestCopy.subscribers.size === 0;\n                requestCopy.subscribers.add(observer);\n                if (isFirstSubscriber) {\n                    batch.add(requestCopy);\n                }\n                // called for each subscriber, so need to save all listeners (next, error, complete)\n                if (observer.next) {\n                    requestCopy.next.push(observer.next.bind(observer));\n                }\n                if (observer.error) {\n                    requestCopy.error.push(observer.error.bind(observer));\n                }\n                if (observer.complete) {\n                    requestCopy.complete.push(observer.complete.bind(observer));\n                }\n                // The first enqueued request triggers the queue consumption after `batchInterval` milliseconds.\n                if (isFirstEnqueuedRequest || _this.batchDebounce) {\n                    _this.scheduleQueueConsumption(key);\n                }\n                // When amount of requests reaches `batchMax`, trigger the queue consumption without waiting on the `batchInterval`.\n                if (batch.size === _this.batchMax) {\n                    _this.consumeQueue(key);\n                }\n                return function () {\n                    var _a;\n                    // If this is last subscriber for this request, remove request from queue\n                    if (requestCopy.subscribers.delete(observer) &&\n                        requestCopy.subscribers.size < 1) {\n                        // If this is last request from queue, remove queue entirely\n                        if (batch.delete(requestCopy) && batch.size < 1) {\n                            _this.consumeQueue(key);\n                            // If queue was in flight, cancel it\n                            (_a = batch.subscription) === null || _a === void 0 ? void 0 : _a.unsubscribe();\n                        }\n                    }\n                };\n            });\n        }\n        return requestCopy.observable;\n    };\n    // Consumes the queue.\n    // Returns a list of promises (one for each query).\n    OperationBatcher.prototype.consumeQueue = function (key) {\n        if (key === void 0) { key = \"\"; }\n        var batch = this.batchesByKey.get(key);\n        // Delete this batch and process it below.\n        this.batchesByKey.delete(key);\n        if (!batch || !batch.size) {\n            // No requests to be processed.\n            return;\n        }\n        var operations = [];\n        var forwards = [];\n        var observables = [];\n        var nexts = [];\n        var errors = [];\n        var completes = [];\n        // Even though batch is a Set, it preserves the order of first insertion\n        // when iterating (per ECMAScript specification), so these requests will be\n        // handled in the order they were enqueued (minus any deleted ones).\n        batch.forEach(function (request) {\n            operations.push(request.operation);\n            forwards.push(request.forward);\n            observables.push(request.observable);\n            nexts.push(request.next);\n            errors.push(request.error);\n            completes.push(request.complete);\n        });\n        var batchedObservable = this.batchHandler(operations, forwards) || Observable.of();\n        var onError = function (error) {\n            //each callback list in batch\n            errors.forEach(function (rejecters) {\n                if (rejecters) {\n                    //each subscriber to request\n                    rejecters.forEach(function (e) { return e(error); });\n                }\n            });\n        };\n        batch.subscription = batchedObservable.subscribe({\n            next: function (results) {\n                if (!Array.isArray(results)) {\n                    results = [results];\n                }\n                if (nexts.length !== results.length) {\n                    var error = new Error(\"server returned results with length \".concat(results.length, \", expected length of \").concat(nexts.length));\n                    error.result = results;\n                    return onError(error);\n                }\n                results.forEach(function (result, index) {\n                    if (nexts[index]) {\n                        nexts[index].forEach(function (next) { return next(result); });\n                    }\n                });\n            },\n            error: onError,\n            complete: function () {\n                completes.forEach(function (complete) {\n                    if (complete) {\n                        //each subscriber to request\n                        complete.forEach(function (c) { return c(); });\n                    }\n                });\n            },\n        });\n        return observables;\n    };\n    OperationBatcher.prototype.scheduleQueueConsumption = function (key) {\n        var _this = this;\n        clearTimeout(this.scheduledBatchTimerByKey.get(key));\n        this.scheduledBatchTimerByKey.set(key, setTimeout(function () {\n            _this.consumeQueue(key);\n            _this.scheduledBatchTimerByKey.delete(key);\n        }, this.batchInterval));\n    };\n    return OperationBatcher;\n}());\nexport { OperationBatcher };\n//# sourceMappingURL=batching.js.map","import { __extends } from \"tslib\";\nimport { ApolloLink } from \"../core/index.js\";\nimport { OperationBatcher } from \"./batching.js\";\nexport { OperationBatcher } from \"./batching.js\";\nvar BatchLink = /** @class */ (function (_super) {\n    __extends(BatchLink, _super);\n    function BatchLink(fetchParams) {\n        var _this = _super.call(this) || this;\n        var _a = fetchParams || {}, batchDebounce = _a.batchDebounce, _b = _a.batchInterval, batchInterval = _b === void 0 ? 10 : _b, _c = _a.batchMax, batchMax = _c === void 0 ? 0 : _c, _d = _a.batchHandler, batchHandler = _d === void 0 ? function () { return null; } : _d, _e = _a.batchKey, batchKey = _e === void 0 ? function () { return \"\"; } : _e;\n        _this.batcher = new OperationBatcher({\n            batchDebounce: batchDebounce,\n            batchInterval: batchInterval,\n            batchMax: batchMax,\n            batchHandler: batchHandler,\n            batchKey: batchKey,\n        });\n        //make this link terminating\n        if (fetchParams.batchHandler.length <= 1) {\n            _this.request = function (operation) { return _this.batcher.enqueueRequest({ operation: operation }); };\n        }\n        return _this;\n    }\n    BatchLink.prototype.request = function (operation, forward) {\n        return this.batcher.enqueueRequest({\n            operation: operation,\n            forward: forward,\n        });\n    };\n    return BatchLink;\n}(ApolloLink));\nexport { BatchLink };\n//# sourceMappingURL=batchLink.js.map","import { __assign, __extends, __rest } from \"tslib\";\nimport { ApolloLink } from \"../core/index.js\";\nimport { Observable, hasDirectives, removeClientSetsFromDocument, } from \"../../utilities/index.js\";\nimport { fromError } from \"../utils/index.js\";\nimport { serializeFetchParameter, selectURI, parseAndCheckHttpResponse, checkFetcher, selectHttpOptionsAndBodyInternal, defaultPrinter, fallbackHttpConfig, } from \"../http/index.js\";\nimport { BatchLink } from \"../batch/index.js\";\nimport { filterOperationVariables } from \"../utils/filterOperationVariables.js\";\n/**\n * Transforms Operation for into HTTP results.\n * context can include the headers property, which will be passed to the fetch function\n */\nvar BatchHttpLink = /** @class */ (function (_super) {\n    __extends(BatchHttpLink, _super);\n    function BatchHttpLink(fetchParams) {\n        var _this = _super.call(this) || this;\n        var _a = fetchParams || {}, _b = _a.uri, uri = _b === void 0 ? \"/graphql\" : _b, \n        // use default global fetch if nothing is passed in\n        fetcher = _a.fetch, _c = _a.print, print = _c === void 0 ? defaultPrinter : _c, includeExtensions = _a.includeExtensions, preserveHeaderCase = _a.preserveHeaderCase, batchInterval = _a.batchInterval, batchDebounce = _a.batchDebounce, batchMax = _a.batchMax, batchKey = _a.batchKey, _d = _a.includeUnusedVariables, includeUnusedVariables = _d === void 0 ? false : _d, requestOptions = __rest(_a, [\"uri\", \"fetch\", \"print\", \"includeExtensions\", \"preserveHeaderCase\", \"batchInterval\", \"batchDebounce\", \"batchMax\", \"batchKey\", \"includeUnusedVariables\"]);\n        // dev warnings to ensure fetch is present\n        checkFetcher(fetcher);\n        //fetcher is set here rather than the destructuring to ensure fetch is\n        //declared before referencing it. Reference in the destructuring would cause\n        //a ReferenceError\n        if (!fetcher) {\n            fetcher = fetch;\n        }\n        var linkConfig = {\n            http: { includeExtensions: includeExtensions, preserveHeaderCase: preserveHeaderCase },\n            options: requestOptions.fetchOptions,\n            credentials: requestOptions.credentials,\n            headers: requestOptions.headers,\n        };\n        _this.batchDebounce = batchDebounce;\n        _this.batchInterval = batchInterval || 10;\n        _this.batchMax = batchMax || 10;\n        var batchHandler = function (operations) {\n            var chosenURI = selectURI(operations[0], uri);\n            var context = operations[0].getContext();\n            var clientAwarenessHeaders = {};\n            if (context.clientAwareness) {\n                var _a = context.clientAwareness, name_1 = _a.name, version = _a.version;\n                if (name_1) {\n                    clientAwarenessHeaders[\"apollographql-client-name\"] = name_1;\n                }\n                if (version) {\n                    clientAwarenessHeaders[\"apollographql-client-version\"] = version;\n                }\n            }\n            var contextConfig = {\n                http: context.http,\n                options: context.fetchOptions,\n                credentials: context.credentials,\n                headers: __assign(__assign({}, clientAwarenessHeaders), context.headers),\n            };\n            var queries = operations.map(function (_a) {\n                var query = _a.query;\n                if (hasDirectives([\"client\"], query)) {\n                    return removeClientSetsFromDocument(query);\n                }\n                return query;\n            });\n            // If we have a query that returned `null` after removing client-only\n            // fields, it indicates a query that is using all client-only fields.\n            if (queries.some(function (query) { return !query; })) {\n                return fromError(new Error(\"BatchHttpLink: Trying to send a client-only query to the server. To send to the server, ensure a non-client field is added to the query or enable the `transformOptions.removeClientFields` option.\"));\n            }\n            //uses fallback, link, and then context to build options\n            var optsAndBody = operations.map(function (operation, index) {\n                var result = selectHttpOptionsAndBodyInternal(__assign(__assign({}, operation), { query: queries[index] }), print, fallbackHttpConfig, linkConfig, contextConfig);\n                if (result.body.variables && !includeUnusedVariables) {\n                    result.body.variables = filterOperationVariables(result.body.variables, operation.query);\n                }\n                return result;\n            });\n            var loadedBody = optsAndBody.map(function (_a) {\n                var body = _a.body;\n                return body;\n            });\n            var options = optsAndBody[0].options;\n            // There's no spec for using GET with batches.\n            if (options.method === \"GET\") {\n                return fromError(new Error(\"apollo-link-batch-http does not support GET requests\"));\n            }\n            try {\n                options.body = serializeFetchParameter(loadedBody, \"Payload\");\n            }\n            catch (parseError) {\n                return fromError(parseError);\n            }\n            var controller;\n            if (!options.signal && typeof AbortController !== \"undefined\") {\n                controller = new AbortController();\n                options.signal = controller.signal;\n            }\n            return new Observable(function (observer) {\n                fetcher(chosenURI, options)\n                    .then(function (response) {\n                    // Make the raw response available in the context.\n                    operations.forEach(function (operation) {\n                        return operation.setContext({ response: response });\n                    });\n                    return response;\n                })\n                    .then(parseAndCheckHttpResponse(operations))\n                    .then(function (result) {\n                    controller = undefined;\n                    // we have data and can send it to back up the link chain\n                    observer.next(result);\n                    observer.complete();\n                    return result;\n                })\n                    .catch(function (err) {\n                    controller = undefined;\n                    // if it is a network error, BUT there is graphql result info\n                    // fire the next observer before calling error\n                    // this gives apollo-client (and react-apollo) the `graphqlErrors` and `networkErrors`\n                    // to pass to UI\n                    // this should only happen if we *also* have data as part of the response key per\n                    // the spec\n                    if (err.result && err.result.errors && err.result.data) {\n                        // if we dont' call next, the UI can only show networkError because AC didn't\n                        // get andy graphqlErrors\n                        // this is graphql execution result info (i.e errors and possibly data)\n                        // this is because there is no formal spec how errors should translate to\n                        // http status codes. So an auth error (401) could have both data\n                        // from a public field, errors from a private field, and a status of 401\n                        // {\n                        //  user { // this will have errors\n                        //    firstName\n                        //  }\n                        //  products { // this is public so will have data\n                        //    cost\n                        //  }\n                        // }\n                        //\n                        // the result of above *could* look like this:\n                        // {\n                        //   data: { products: [{ cost: \"$10\" }] },\n                        //   errors: [{\n                        //      message: 'your session has timed out',\n                        //      path: []\n                        //   }]\n                        // }\n                        // status code of above would be a 401\n                        // in the UI you want to show data where you can, errors as data where you can\n                        // and use correct http status codes\n                        observer.next(err.result);\n                    }\n                    observer.error(err);\n                });\n                return function () {\n                    // XXX support canceling this request\n                    // https://developers.google.com/web/updates/2017/09/abortable-fetch\n                    if (controller)\n                        controller.abort();\n                };\n            });\n        };\n        batchKey =\n            batchKey ||\n                (function (operation) {\n                    var context = operation.getContext();\n                    var contextConfig = {\n                        http: context.http,\n                        options: context.fetchOptions,\n                        credentials: context.credentials,\n                        headers: context.headers,\n                    };\n                    //may throw error if config not serializable\n                    return selectURI(operation, uri) + JSON.stringify(contextConfig);\n                });\n        _this.batcher = new BatchLink({\n            batchDebounce: _this.batchDebounce,\n            batchInterval: _this.batchInterval,\n            batchMax: _this.batchMax,\n            batchKey: batchKey,\n            batchHandler: batchHandler,\n        });\n        return _this;\n    }\n    BatchHttpLink.prototype.request = function (operation) {\n        return this.batcher.request(operation);\n    };\n    return BatchHttpLink;\n}(ApolloLink));\nexport { BatchHttpLink };\n//# sourceMappingURL=batchHttpLink.js.map","import { newInvariantError, invariant } from \"../../utilities/globals/index.js\";\nimport { Observable } from \"../../utilities/index.js\";\nimport { validateOperation, createOperation, transformOperation, } from \"../utils/index.js\";\nfunction passthrough(op, forward) {\n    return (forward ? forward(op) : Observable.of());\n}\nfunction toLink(handler) {\n    return typeof handler === \"function\" ? new ApolloLink(handler) : handler;\n}\nfunction isTerminating(link) {\n    return link.request.length <= 1;\n}\nvar ApolloLink = /** @class */ (function () {\n    function ApolloLink(request) {\n        if (request)\n            this.request = request;\n    }\n    ApolloLink.empty = function () {\n        return new ApolloLink(function () { return Observable.of(); });\n    };\n    ApolloLink.from = function (links) {\n        if (links.length === 0)\n            return ApolloLink.empty();\n        return links.map(toLink).reduce(function (x, y) { return x.concat(y); });\n    };\n    ApolloLink.split = function (test, left, right) {\n        var leftLink = toLink(left);\n        var rightLink = toLink(right || new ApolloLink(passthrough));\n        var ret;\n        if (isTerminating(leftLink) && isTerminating(rightLink)) {\n            ret = new ApolloLink(function (operation) {\n                return test(operation) ?\n                    leftLink.request(operation) || Observable.of()\n                    : rightLink.request(operation) || Observable.of();\n            });\n        }\n        else {\n            ret = new ApolloLink(function (operation, forward) {\n                return test(operation) ?\n                    leftLink.request(operation, forward) || Observable.of()\n                    : rightLink.request(operation, forward) || Observable.of();\n            });\n        }\n        return Object.assign(ret, { left: leftLink, right: rightLink });\n    };\n    ApolloLink.execute = function (link, operation) {\n        return (link.request(createOperation(operation.context, transformOperation(validateOperation(operation)))) || Observable.of());\n    };\n    ApolloLink.concat = function (first, second) {\n        var firstLink = toLink(first);\n        if (isTerminating(firstLink)) {\n            globalThis.__DEV__ !== false && invariant.warn(35, firstLink);\n            return firstLink;\n        }\n        var nextLink = toLink(second);\n        var ret;\n        if (isTerminating(nextLink)) {\n            ret = new ApolloLink(function (operation) {\n                return firstLink.request(operation, function (op) { return nextLink.request(op) || Observable.of(); }) || Observable.of();\n            });\n        }\n        else {\n            ret = new ApolloLink(function (operation, forward) {\n                return (firstLink.request(operation, function (op) {\n                    return nextLink.request(op, forward) || Observable.of();\n                }) || Observable.of());\n            });\n        }\n        return Object.assign(ret, { left: firstLink, right: nextLink });\n    };\n    ApolloLink.prototype.split = function (test, left, right) {\n        return this.concat(ApolloLink.split(test, left, right || new ApolloLink(passthrough)));\n    };\n    ApolloLink.prototype.concat = function (next) {\n        return ApolloLink.concat(this, next);\n    };\n    ApolloLink.prototype.request = function (operation, forward) {\n        throw newInvariantError(36);\n    };\n    ApolloLink.prototype.onError = function (error, observer) {\n        if (observer && observer.error) {\n            observer.error(error);\n            // Returning false indicates that observer.error does not need to be\n            // called again, since it was already called (on the previous line).\n            // Calling observer.error again would not cause any real problems,\n            // since only the first call matters, but custom onError functions\n            // might have other reasons for wanting to prevent the default\n            // behavior by returning false.\n            return false;\n        }\n        // Throw errors will be passed to observer.error.\n        throw error;\n    };\n    ApolloLink.prototype.setOnError = function (fn) {\n        this.onError = fn;\n        return this;\n    };\n    return ApolloLink;\n}());\nexport { ApolloLink };\n//# sourceMappingURL=ApolloLink.js.map","import { __assign } from \"tslib\";\nexport function createOperation(starting, operation) {\n    var context = __assign({}, starting);\n    var setContext = function (next) {\n        if (typeof next === \"function\") {\n            context = __assign(__assign({}, context), next(context));\n        }\n        else {\n            context = __assign(__assign({}, context), next);\n        }\n    };\n    var getContext = function () { return (__assign({}, context)); };\n    Object.defineProperty(operation, \"setContext\", {\n        enumerable: false,\n        value: setContext,\n    });\n    Object.defineProperty(operation, \"getContext\", {\n        enumerable: false,\n        value: getContext,\n    });\n    return operation;\n}\n//# sourceMappingURL=createOperation.js.map","import { getOperationName } from \"../../utilities/index.js\";\nexport function transformOperation(operation) {\n    var transformedOperation = {\n        variables: operation.variables || {},\n        extensions: operation.extensions || {},\n        operationName: operation.operationName,\n        query: operation.query,\n    };\n    // Best guess at an operation name\n    if (!transformedOperation.operationName) {\n        transformedOperation.operationName =\n            typeof transformedOperation.query !== \"string\" ?\n                getOperationName(transformedOperation.query) || undefined\n                : \"\";\n    }\n    return transformedOperation;\n}\n//# sourceMappingURL=transformOperation.js.map","import { newInvariantError } from \"../../utilities/globals/index.js\";\nexport function validateOperation(operation) {\n    var OPERATION_FIELDS = [\n        \"query\",\n        \"operationName\",\n        \"variables\",\n        \"extensions\",\n        \"context\",\n    ];\n    for (var _i = 0, _a = Object.keys(operation); _i < _a.length; _i++) {\n        var key = _a[_i];\n        if (OPERATION_FIELDS.indexOf(key) < 0) {\n            throw newInvariantError(43, key);\n        }\n    }\n    return operation;\n}\n//# sourceMappingURL=validateOperation.js.map","import { ApolloLink } from \"./ApolloLink.js\";\nexport var execute = ApolloLink.execute;\n//# sourceMappingURL=execute.js.map","import { ApolloLink } from \"./ApolloLink.js\";\nexport var split = ApolloLink.split;\n//# sourceMappingURL=split.js.map","import { __extends } from \"tslib\";\nimport { Observable } from \"../../utilities/index.js\";\nimport { ApolloLink } from \"../core/index.js\";\nexport function onError(errorHandler) {\n    return new ApolloLink(function (operation, forward) {\n        return new Observable(function (observer) {\n            var sub;\n            var retriedSub;\n            var retriedResult;\n            try {\n                sub = forward(operation).subscribe({\n                    next: function (result) {\n                        if (result.errors) {\n                            retriedResult = errorHandler({\n                                graphQLErrors: result.errors,\n                                response: result,\n                                operation: operation,\n                                forward: forward,\n                            });\n                            if (retriedResult) {\n                                retriedSub = retriedResult.subscribe({\n                                    next: observer.next.bind(observer),\n                                    error: observer.error.bind(observer),\n                                    complete: observer.complete.bind(observer),\n                                });\n                                return;\n                            }\n                        }\n                        observer.next(result);\n                    },\n                    error: function (networkError) {\n                        retriedResult = errorHandler({\n                            operation: operation,\n                            networkError: networkError,\n                            //Network errors can return GraphQL errors on for example a 403\n                            graphQLErrors: networkError &&\n                                networkError.result &&\n                                networkError.result.errors,\n                            forward: forward,\n                        });\n                        if (retriedResult) {\n                            retriedSub = retriedResult.subscribe({\n                                next: observer.next.bind(observer),\n                                error: observer.error.bind(observer),\n                                complete: observer.complete.bind(observer),\n                            });\n                            return;\n                        }\n                        observer.error(networkError);\n                    },\n                    complete: function () {\n                        // disable the previous sub from calling complete on observable\n                        // if retry is in flight.\n                        if (!retriedResult) {\n                            observer.complete.bind(observer)();\n                        }\n                    },\n                });\n            }\n            catch (e) {\n                errorHandler({ networkError: e, operation: operation, forward: forward });\n                observer.error(e);\n            }\n            return function () {\n                if (sub)\n                    sub.unsubscribe();\n                if (retriedSub)\n                    sub.unsubscribe();\n            };\n        });\n    });\n}\nvar ErrorLink = /** @class */ (function (_super) {\n    __extends(ErrorLink, _super);\n    function ErrorLink(errorHandler) {\n        var _this = _super.call(this) || this;\n        _this.link = onError(errorHandler);\n        return _this;\n    }\n    ErrorLink.prototype.request = function (operation, forward) {\n        return this.link.request(operation, forward);\n    };\n    return ErrorLink;\n}(ApolloLink));\nexport { ErrorLink };\n//# sourceMappingURL=index.js.map","import { __extends } from \"tslib\";\nimport { ApolloLink } from \"../core/index.js\";\nimport { createHttpLink } from \"./createHttpLink.js\";\nvar HttpLink = /** @class */ (function (_super) {\n    __extends(HttpLink, _super);\n    function HttpLink(options) {\n        if (options === void 0) { options = {}; }\n        var _this = _super.call(this, createHttpLink(options).request) || this;\n        _this.options = options;\n        return _this;\n    }\n    return HttpLink;\n}(ApolloLink));\nexport { HttpLink };\n//# sourceMappingURL=HttpLink.js.map","import { newInvariantError } from \"../../utilities/globals/index.js\";\nexport var checkFetcher = function (fetcher) {\n    if (!fetcher && typeof fetch === \"undefined\") {\n        throw newInvariantError(37);\n    }\n};\n//# sourceMappingURL=checkFetcher.js.map","import { __assign, __rest } from \"tslib\";\nimport { invariant } from \"../../utilities/globals/index.js\";\nimport { ApolloLink } from \"../core/index.js\";\nimport { Observable, hasDirectives } from \"../../utilities/index.js\";\nimport { serializeFetchParameter } from \"./serializeFetchParameter.js\";\nimport { selectURI } from \"./selectURI.js\";\nimport { handleError, readMultipartBody, parseAndCheckHttpResponse, } from \"./parseAndCheckHttpResponse.js\";\nimport { checkFetcher } from \"./checkFetcher.js\";\nimport { selectHttpOptionsAndBodyInternal, defaultPrinter, fallbackHttpConfig, } from \"./selectHttpOptionsAndBody.js\";\nimport { rewriteURIForGET } from \"./rewriteURIForGET.js\";\nimport { fromError, filterOperationVariables } from \"../utils/index.js\";\nimport { maybe, getMainDefinition, removeClientSetsFromDocument, } from \"../../utilities/index.js\";\nvar backupFetch = maybe(function () { return fetch; });\nexport var createHttpLink = function (linkOptions) {\n    if (linkOptions === void 0) { linkOptions = {}; }\n    var _a = linkOptions.uri, uri = _a === void 0 ? \"/graphql\" : _a, \n    // use default global fetch if nothing passed in\n    preferredFetch = linkOptions.fetch, _b = linkOptions.print, print = _b === void 0 ? defaultPrinter : _b, includeExtensions = linkOptions.includeExtensions, preserveHeaderCase = linkOptions.preserveHeaderCase, useGETForQueries = linkOptions.useGETForQueries, _c = linkOptions.includeUnusedVariables, includeUnusedVariables = _c === void 0 ? false : _c, requestOptions = __rest(linkOptions, [\"uri\", \"fetch\", \"print\", \"includeExtensions\", \"preserveHeaderCase\", \"useGETForQueries\", \"includeUnusedVariables\"]);\n    if (globalThis.__DEV__ !== false) {\n        // Make sure at least one of preferredFetch, window.fetch, or backupFetch is\n        // defined, so requests won't fail at runtime.\n        checkFetcher(preferredFetch || backupFetch);\n    }\n    var linkConfig = {\n        http: { includeExtensions: includeExtensions, preserveHeaderCase: preserveHeaderCase },\n        options: requestOptions.fetchOptions,\n        credentials: requestOptions.credentials,\n        headers: requestOptions.headers,\n    };\n    return new ApolloLink(function (operation) {\n        var chosenURI = selectURI(operation, uri);\n        var context = operation.getContext();\n        // `apollographql-client-*` headers are automatically set if a\n        // `clientAwareness` object is found in the context. These headers are\n        // set first, followed by the rest of the headers pulled from\n        // `context.headers`. If desired, `apollographql-client-*` headers set by\n        // the `clientAwareness` object can be overridden by\n        // `apollographql-client-*` headers set in `context.headers`.\n        var clientAwarenessHeaders = {};\n        if (context.clientAwareness) {\n            var _a = context.clientAwareness, name_1 = _a.name, version = _a.version;\n            if (name_1) {\n                clientAwarenessHeaders[\"apollographql-client-name\"] = name_1;\n            }\n            if (version) {\n                clientAwarenessHeaders[\"apollographql-client-version\"] = version;\n            }\n        }\n        var contextHeaders = __assign(__assign({}, clientAwarenessHeaders), context.headers);\n        var contextConfig = {\n            http: context.http,\n            options: context.fetchOptions,\n            credentials: context.credentials,\n            headers: contextHeaders,\n        };\n        if (hasDirectives([\"client\"], operation.query)) {\n            var transformedQuery = removeClientSetsFromDocument(operation.query);\n            if (!transformedQuery) {\n                return fromError(new Error(\"HttpLink: Trying to send a client-only query to the server. To send to the server, ensure a non-client field is added to the query or set the `transformOptions.removeClientFields` option to `true`.\"));\n            }\n            operation.query = transformedQuery;\n        }\n        //uses fallback, link, and then context to build options\n        var _b = selectHttpOptionsAndBodyInternal(operation, print, fallbackHttpConfig, linkConfig, contextConfig), options = _b.options, body = _b.body;\n        if (body.variables && !includeUnusedVariables) {\n            body.variables = filterOperationVariables(body.variables, operation.query);\n        }\n        var controller;\n        if (!options.signal && typeof AbortController !== \"undefined\") {\n            controller = new AbortController();\n            options.signal = controller.signal;\n        }\n        // If requested, set method to GET if there are no mutations.\n        var definitionIsMutation = function (d) {\n            return d.kind === \"OperationDefinition\" && d.operation === \"mutation\";\n        };\n        var definitionIsSubscription = function (d) {\n            return d.kind === \"OperationDefinition\" && d.operation === \"subscription\";\n        };\n        var isSubscription = definitionIsSubscription(getMainDefinition(operation.query));\n        // does not match custom directives beginning with @defer\n        var hasDefer = hasDirectives([\"defer\"], operation.query);\n        if (useGETForQueries &&\n            !operation.query.definitions.some(definitionIsMutation)) {\n            options.method = \"GET\";\n        }\n        if (hasDefer || isSubscription) {\n            options.headers = options.headers || {};\n            var acceptHeader = \"multipart/mixed;\";\n            // Omit defer-specific headers if the user attempts to defer a selection\n            // set on a subscription and log a warning.\n            if (isSubscription && hasDefer) {\n                globalThis.__DEV__ !== false && invariant.warn(38);\n            }\n            if (isSubscription) {\n                acceptHeader +=\n                    \"boundary=graphql;subscriptionSpec=1.0,application/json\";\n            }\n            else if (hasDefer) {\n                acceptHeader += \"deferSpec=20220824,application/json\";\n            }\n            options.headers.accept = acceptHeader;\n        }\n        if (options.method === \"GET\") {\n            var _c = rewriteURIForGET(chosenURI, body), newURI = _c.newURI, parseError = _c.parseError;\n            if (parseError) {\n                return fromError(parseError);\n            }\n            chosenURI = newURI;\n        }\n        else {\n            try {\n                options.body = serializeFetchParameter(body, \"Payload\");\n            }\n            catch (parseError) {\n                return fromError(parseError);\n            }\n        }\n        return new Observable(function (observer) {\n            // Prefer linkOptions.fetch (preferredFetch) if provided, and otherwise\n            // fall back to the *current* global window.fetch function (see issue\n            // #7832), or (if all else fails) the backupFetch function we saved when\n            // this module was first evaluated. This last option protects against the\n            // removal of window.fetch, which is unlikely but not impossible.\n            var currentFetch = preferredFetch || maybe(function () { return fetch; }) || backupFetch;\n            var observerNext = observer.next.bind(observer);\n            currentFetch(chosenURI, options)\n                .then(function (response) {\n                var _a;\n                operation.setContext({ response: response });\n                var ctype = (_a = response.headers) === null || _a === void 0 ? void 0 : _a.get(\"content-type\");\n                if (ctype !== null && /^multipart\\/mixed/i.test(ctype)) {\n                    return readMultipartBody(response, observerNext);\n                }\n                else {\n                    return parseAndCheckHttpResponse(operation)(response).then(observerNext);\n                }\n            })\n                .then(function () {\n                controller = undefined;\n                observer.complete();\n            })\n                .catch(function (err) {\n                controller = undefined;\n                handleError(err, observer);\n            });\n            return function () {\n                // XXX support canceling this request\n                // https://developers.google.com/web/updates/2017/09/abortable-fetch\n                if (controller)\n                    controller.abort();\n            };\n        });\n    });\n};\n//# sourceMappingURL=createHttpLink.js.map","/**\n * Original source:\n * https://github.com/kmalakoff/response-iterator/blob/master/src/iterators/nodeStream.ts\n */\nimport { canUseAsyncIteratorSymbol } from \"../../../utilities/index.js\";\nexport default function nodeStreamIterator(stream) {\n    var cleanup = null;\n    var error = null;\n    var done = false;\n    var data = [];\n    var waiting = [];\n    function onData(chunk) {\n        if (error)\n            return;\n        if (waiting.length) {\n            var shiftedArr = waiting.shift();\n            if (Array.isArray(shiftedArr) && shiftedArr[0]) {\n                return shiftedArr[0]({ value: chunk, done: false });\n            }\n        }\n        data.push(chunk);\n    }\n    function onError(err) {\n        error = err;\n        var all = waiting.slice();\n        all.forEach(function (pair) {\n            pair[1](err);\n        });\n        !cleanup || cleanup();\n    }\n    function onEnd() {\n        done = true;\n        var all = waiting.slice();\n        all.forEach(function (pair) {\n            pair[0]({ value: undefined, done: true });\n        });\n        !cleanup || cleanup();\n    }\n    cleanup = function () {\n        cleanup = null;\n        stream.removeListener(\"data\", onData);\n        stream.removeListener(\"error\", onError);\n        stream.removeListener(\"end\", onEnd);\n        stream.removeListener(\"finish\", onEnd);\n        stream.removeListener(\"close\", onEnd);\n    };\n    stream.on(\"data\", onData);\n    stream.on(\"error\", onError);\n    stream.on(\"end\", onEnd);\n    stream.on(\"finish\", onEnd);\n    stream.on(\"close\", onEnd);\n    function getNext() {\n        return new Promise(function (resolve, reject) {\n            if (error)\n                return reject(error);\n            if (data.length)\n                return resolve({ value: data.shift(), done: false });\n            if (done)\n                return resolve({ value: undefined, done: true });\n            waiting.push([resolve, reject]);\n        });\n    }\n    var iterator = {\n        next: function () {\n            return getNext();\n        },\n    };\n    if (canUseAsyncIteratorSymbol) {\n        iterator[Symbol.asyncIterator] = function () {\n            return this;\n        };\n    }\n    return iterator;\n}\n//# sourceMappingURL=nodeStream.js.map","/**\n * Original source:\n * https://github.com/kmalakoff/response-iterator/blob/master/src/iterators/reader.ts\n */\nimport { canUseAsyncIteratorSymbol } from \"../../../utilities/index.js\";\nexport default function readerIterator(reader) {\n    var iterator = {\n        next: function () {\n            return reader.read();\n        },\n    };\n    if (canUseAsyncIteratorSymbol) {\n        iterator[Symbol.asyncIterator] = function () {\n            return this;\n        };\n    }\n    return iterator;\n}\n//# sourceMappingURL=reader.js.map","/**\n * Original source:\n * https://github.com/kmalakoff/response-iterator/blob/master/src/index.ts\n */\nimport { canUseAsyncIteratorSymbol } from \"../../utilities/index.js\";\nimport asyncIterator from \"./iterators/async.js\";\nimport nodeStreamIterator from \"./iterators/nodeStream.js\";\nimport promiseIterator from \"./iterators/promise.js\";\nimport readerIterator from \"./iterators/reader.js\";\nfunction isNodeResponse(value) {\n    return !!value.body;\n}\nfunction isReadableStream(value) {\n    return !!value.getReader;\n}\nfunction isAsyncIterableIterator(value) {\n    return !!(canUseAsyncIteratorSymbol &&\n        value[Symbol.asyncIterator]);\n}\nfunction isStreamableBlob(value) {\n    return !!value.stream;\n}\nfunction isBlob(value) {\n    return !!value.arrayBuffer;\n}\nfunction isNodeReadableStream(value) {\n    return !!value.pipe;\n}\nexport function responseIterator(response) {\n    var body = response;\n    if (isNodeResponse(response))\n        body = response.body;\n    if (isAsyncIterableIterator(body))\n        return asyncIterator(body);\n    if (isReadableStream(body))\n        return readerIterator(body.getReader());\n    // this errors without casting to ReadableStream<T>\n    // because Blob.stream() returns a NodeJS ReadableStream\n    if (isStreamableBlob(body)) {\n        return readerIterator(body.stream().getReader());\n    }\n    if (isBlob(body))\n        return promiseIterator(body.arrayBuffer());\n    if (isNodeReadableStream(body))\n        return nodeStreamIterator(body);\n    throw new Error(\"Unknown body type for responseIterator. Please pass a streamable response.\");\n}\n//# sourceMappingURL=responseIterator.js.map","/**\n * Original source:\n * https://github.com/kmalakoff/response-iterator/blob/master/src/iterators/async.ts\n */\nexport default function asyncIterator(source) {\n    var _a;\n    var iterator = source[Symbol.asyncIterator]();\n    return _a = {\n            next: function () {\n                return iterator.next();\n            }\n        },\n        _a[Symbol.asyncIterator] = function () {\n            return this;\n        },\n        _a;\n}\n//# sourceMappingURL=async.js.map","/**\n * Original source:\n * https://github.com/kmalakoff/response-iterator/blob/master/src/iterators/promise.ts\n */\nimport { canUseAsyncIteratorSymbol } from \"../../../utilities/index.js\";\nexport default function promiseIterator(promise) {\n    var resolved = false;\n    var iterator = {\n        next: function () {\n            if (resolved)\n                return Promise.resolve({\n                    value: undefined,\n                    done: true,\n                });\n            resolved = true;\n            return new Promise(function (resolve, reject) {\n                promise\n                    .then(function (value) {\n                    resolve({ value: value, done: false });\n                })\n                    .catch(reject);\n            });\n        },\n    };\n    if (canUseAsyncIteratorSymbol) {\n        iterator[Symbol.asyncIterator] = function () {\n            return this;\n        };\n    }\n    return iterator;\n}\n//# sourceMappingURL=promise.js.map","import { __assign, __awaiter, __generator } from \"tslib\";\nimport { responseIterator } from \"./responseIterator.js\";\nimport { throwServerError } from \"../utils/index.js\";\nimport { PROTOCOL_ERRORS_SYMBOL } from \"../../errors/index.js\";\nimport { isApolloPayloadResult } from \"../../utilities/common/incrementalResult.js\";\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nexport function readMultipartBody(response, nextValue) {\n    return __awaiter(this, void 0, void 0, function () {\n        var decoder, contentType, delimiter, boundaryVal, boundary, buffer, iterator, running, _a, value, done, chunk, searchFrom, bi, message, i, headers, contentType_1, body, result, next;\n        var _b, _c;\n        var _d;\n        return __generator(this, function (_e) {\n            switch (_e.label) {\n                case 0:\n                    if (TextDecoder === undefined) {\n                        throw new Error(\"TextDecoder must be defined in the environment: please import a polyfill.\");\n                    }\n                    decoder = new TextDecoder(\"utf-8\");\n                    contentType = (_d = response.headers) === null || _d === void 0 ? void 0 : _d.get(\"content-type\");\n                    delimiter = \"boundary=\";\n                    boundaryVal = (contentType === null || contentType === void 0 ? void 0 : contentType.includes(delimiter)) ?\n                        contentType === null || contentType === void 0 ? void 0 : contentType.substring((contentType === null || contentType === void 0 ? void 0 : contentType.indexOf(delimiter)) + delimiter.length).replace(/['\"]/g, \"\").replace(/\\;(.*)/gm, \"\").trim()\n                        : \"-\";\n                    boundary = \"\\r\\n--\".concat(boundaryVal);\n                    buffer = \"\";\n                    iterator = responseIterator(response);\n                    running = true;\n                    _e.label = 1;\n                case 1:\n                    if (!running) return [3 /*break*/, 3];\n                    return [4 /*yield*/, iterator.next()];\n                case 2:\n                    _a = _e.sent(), value = _a.value, done = _a.done;\n                    chunk = typeof value === \"string\" ? value : decoder.decode(value);\n                    searchFrom = buffer.length - boundary.length + 1;\n                    running = !done;\n                    buffer += chunk;\n                    bi = buffer.indexOf(boundary, searchFrom);\n                    while (bi > -1) {\n                        message = void 0;\n                        _b = [\n                            buffer.slice(0, bi),\n                            buffer.slice(bi + boundary.length),\n                        ], message = _b[0], buffer = _b[1];\n                        i = message.indexOf(\"\\r\\n\\r\\n\");\n                        headers = parseHeaders(message.slice(0, i));\n                        contentType_1 = headers[\"content-type\"];\n                        if (contentType_1 &&\n                            contentType_1.toLowerCase().indexOf(\"application/json\") === -1) {\n                            throw new Error(\"Unsupported patch content type: application/json is required.\");\n                        }\n                        body = message.slice(i);\n                        if (body) {\n                            result = parseJsonBody(response, body);\n                            if (Object.keys(result).length > 1 ||\n                                \"data\" in result ||\n                                \"incremental\" in result ||\n                                \"errors\" in result ||\n                                \"payload\" in result) {\n                                if (isApolloPayloadResult(result)) {\n                                    next = {};\n                                    if (\"payload\" in result) {\n                                        if (Object.keys(result).length === 1 && result.payload === null) {\n                                            return [2 /*return*/];\n                                        }\n                                        next = __assign({}, result.payload);\n                                    }\n                                    if (\"errors\" in result) {\n                                        next = __assign(__assign({}, next), { extensions: __assign(__assign({}, (\"extensions\" in next ? next.extensions : null)), (_c = {}, _c[PROTOCOL_ERRORS_SYMBOL] = result.errors, _c)) });\n                                    }\n                                    nextValue(next);\n                                }\n                                else {\n                                    // for the last chunk with only `hasNext: false`\n                                    // we don't need to call observer.next as there is no data/errors\n                                    nextValue(result);\n                                }\n                            }\n                            else if (\n                            // If the chunk contains only a \"hasNext: false\", we can call\n                            // observer.complete() immediately.\n                            Object.keys(result).length === 1 &&\n                                \"hasNext\" in result &&\n                                !result.hasNext) {\n                                return [2 /*return*/];\n                            }\n                        }\n                        bi = buffer.indexOf(boundary);\n                    }\n                    return [3 /*break*/, 1];\n                case 3: return [2 /*return*/];\n            }\n        });\n    });\n}\nexport function parseHeaders(headerText) {\n    var headersInit = {};\n    headerText.split(\"\\n\").forEach(function (line) {\n        var i = line.indexOf(\":\");\n        if (i > -1) {\n            // normalize headers to lowercase\n            var name_1 = line.slice(0, i).trim().toLowerCase();\n            var value = line.slice(i + 1).trim();\n            headersInit[name_1] = value;\n        }\n    });\n    return headersInit;\n}\nexport function parseJsonBody(response, bodyText) {\n    if (response.status >= 300) {\n        // Network error\n        var getResult = function () {\n            try {\n                return JSON.parse(bodyText);\n            }\n            catch (err) {\n                return bodyText;\n            }\n        };\n        throwServerError(response, getResult(), \"Response not successful: Received status code \".concat(response.status));\n    }\n    try {\n        return JSON.parse(bodyText);\n    }\n    catch (err) {\n        var parseError = err;\n        parseError.name = \"ServerParseError\";\n        parseError.response = response;\n        parseError.statusCode = response.status;\n        parseError.bodyText = bodyText;\n        throw parseError;\n    }\n}\nexport function handleError(err, observer) {\n    // if it is a network error, BUT there is graphql result info fire\n    // the next observer before calling error this gives apollo-client\n    // (and react-apollo) the `graphqlErrors` and `networkErrors` to\n    // pass to UI this should only happen if we *also* have data as\n    // part of the response key per the spec\n    if (err.result && err.result.errors && err.result.data) {\n        // if we don't call next, the UI can only show networkError\n        // because AC didn't get any graphqlErrors this is graphql\n        // execution result info (i.e errors and possibly data) this is\n        // because there is no formal spec how errors should translate to\n        // http status codes. So an auth error (401) could have both data\n        // from a public field, errors from a private field, and a status\n        // of 401\n        // {\n        //  user { // this will have errors\n        //    firstName\n        //  }\n        //  products { // this is public so will have data\n        //    cost\n        //  }\n        // }\n        //\n        // the result of above *could* look like this:\n        // {\n        //   data: { products: [{ cost: \"$10\" }] },\n        //   errors: [{\n        //      message: 'your session has timed out',\n        //      path: []\n        //   }]\n        // }\n        // status code of above would be a 401\n        // in the UI you want to show data where you can, errors as data where you can\n        // and use correct http status codes\n        observer.next(err.result);\n    }\n    observer.error(err);\n}\nexport function parseAndCheckHttpResponse(operations) {\n    return function (response) {\n        return response\n            .text()\n            .then(function (bodyText) { return parseJsonBody(response, bodyText); })\n            .then(function (result) {\n            if (!Array.isArray(result) &&\n                !hasOwnProperty.call(result, \"data\") &&\n                !hasOwnProperty.call(result, \"errors\")) {\n                // Data error\n                throwServerError(response, result, \"Server response was missing for query '\".concat(Array.isArray(operations) ?\n                    operations.map(function (op) { return op.operationName; })\n                    : operations.operationName, \"'.\"));\n            }\n            return result;\n        });\n    };\n}\n//# sourceMappingURL=parseAndCheckHttpResponse.js.map","import { serializeFetchParameter } from \"./serializeFetchParameter.js\";\n// For GET operations, returns the given URI rewritten with parameters, or a\n// parse error.\nexport function rewriteURIForGET(chosenURI, body) {\n    // Implement the standard HTTP GET serialization, plus 'extensions'. Note\n    // the extra level of JSON serialization!\n    var queryParams = [];\n    var addQueryParam = function (key, value) {\n        queryParams.push(\"\".concat(key, \"=\").concat(encodeURIComponent(value)));\n    };\n    if (\"query\" in body) {\n        addQueryParam(\"query\", body.query);\n    }\n    if (body.operationName) {\n        addQueryParam(\"operationName\", body.operationName);\n    }\n    if (body.variables) {\n        var serializedVariables = void 0;\n        try {\n            serializedVariables = serializeFetchParameter(body.variables, \"Variables map\");\n        }\n        catch (parseError) {\n            return { parseError: parseError };\n        }\n        addQueryParam(\"variables\", serializedVariables);\n    }\n    if (body.extensions) {\n        var serializedExtensions = void 0;\n        try {\n            serializedExtensions = serializeFetchParameter(body.extensions, \"Extensions map\");\n        }\n        catch (parseError) {\n            return { parseError: parseError };\n        }\n        addQueryParam(\"extensions\", serializedExtensions);\n    }\n    // Reconstruct the URI with added query params.\n    // XXX This assumes that the URI is well-formed and that it doesn't\n    //     already contain any of these query params. We could instead use the\n    //     URL API and take a polyfill (whatwg-url@6) for older browsers that\n    //     don't support URLSearchParams. Note that some browsers (and\n    //     versions of whatwg-url) support URL but not URLSearchParams!\n    var fragment = \"\", preFragment = chosenURI;\n    var fragmentStart = chosenURI.indexOf(\"#\");\n    if (fragmentStart !== -1) {\n        fragment = chosenURI.substr(fragmentStart);\n        preFragment = chosenURI.substr(0, fragmentStart);\n    }\n    var queryParamsPrefix = preFragment.indexOf(\"?\") === -1 ? \"?\" : \"&\";\n    var newURI = preFragment + queryParamsPrefix + queryParams.join(\"&\") + fragment;\n    return { newURI: newURI };\n}\n//# sourceMappingURL=rewriteURIForGET.js.map","import { __assign, __spreadArray } from \"tslib\";\nimport { print } from \"../../utilities/index.js\";\nvar defaultHttpOptions = {\n    includeQuery: true,\n    includeExtensions: false,\n    preserveHeaderCase: false,\n};\nvar defaultHeaders = {\n    // headers are case insensitive (https://stackoverflow.com/a/5259004)\n    accept: \"*/*\",\n    // The content-type header describes the type of the body of the request, and\n    // so it typically only is sent with requests that actually have bodies. One\n    // could imagine that Apollo Client would remove this header when constructing\n    // a GET request (which has no body), but we historically have not done that.\n    // This means that browsers will preflight all Apollo Client requests (even\n    // GET requests). Apollo Server's CSRF prevention feature (introduced in\n    // AS3.7) takes advantage of this fact and does not block requests with this\n    // header. If you want to drop this header from GET requests, then you should\n    // probably replace it with a `apollo-require-preflight` header, or servers\n    // with CSRF prevention enabled might block your GET request. See\n    // https://www.apollographql.com/docs/apollo-server/security/cors/#preventing-cross-site-request-forgery-csrf\n    // for more details.\n    \"content-type\": \"application/json\",\n};\nvar defaultOptions = {\n    method: \"POST\",\n};\nexport var fallbackHttpConfig = {\n    http: defaultHttpOptions,\n    headers: defaultHeaders,\n    options: defaultOptions,\n};\nexport var defaultPrinter = function (ast, printer) { return printer(ast); };\nexport function selectHttpOptionsAndBody(operation, fallbackConfig) {\n    var configs = [];\n    for (var _i = 2; _i < arguments.length; _i++) {\n        configs[_i - 2] = arguments[_i];\n    }\n    configs.unshift(fallbackConfig);\n    return selectHttpOptionsAndBodyInternal.apply(void 0, __spreadArray([operation,\n        defaultPrinter], configs, false));\n}\nexport function selectHttpOptionsAndBodyInternal(operation, printer) {\n    var configs = [];\n    for (var _i = 2; _i < arguments.length; _i++) {\n        configs[_i - 2] = arguments[_i];\n    }\n    var options = {};\n    var http = {};\n    configs.forEach(function (config) {\n        options = __assign(__assign(__assign({}, options), config.options), { headers: __assign(__assign({}, options.headers), config.headers) });\n        if (config.credentials) {\n            options.credentials = config.credentials;\n        }\n        http = __assign(__assign({}, http), config.http);\n    });\n    if (options.headers) {\n        options.headers = removeDuplicateHeaders(options.headers, http.preserveHeaderCase);\n    }\n    //The body depends on the http options\n    var operationName = operation.operationName, extensions = operation.extensions, variables = operation.variables, query = operation.query;\n    var body = { operationName: operationName, variables: variables };\n    if (http.includeExtensions)\n        body.extensions = extensions;\n    // not sending the query (i.e persisted queries)\n    if (http.includeQuery)\n        body.query = printer(query, print);\n    return {\n        options: options,\n        body: body,\n    };\n}\n// Remove potential duplicate header names, preserving last (by insertion order).\n// This is done to prevent unintentionally duplicating a header instead of\n// overwriting it (See #8447 and #8449).\nfunction removeDuplicateHeaders(headers, preserveHeaderCase) {\n    // If we're not preserving the case, just remove duplicates w/ normalization.\n    if (!preserveHeaderCase) {\n        var normalizedHeaders_1 = Object.create(null);\n        Object.keys(Object(headers)).forEach(function (name) {\n            normalizedHeaders_1[name.toLowerCase()] = headers[name];\n        });\n        return normalizedHeaders_1;\n    }\n    // If we are preserving the case, remove duplicates w/ normalization,\n    // preserving the original name.\n    // This allows for non-http-spec-compliant servers that expect intentionally\n    // capitalized header names (See #6741).\n    var headerData = Object.create(null);\n    Object.keys(Object(headers)).forEach(function (name) {\n        headerData[name.toLowerCase()] = {\n            originalName: name,\n            value: headers[name],\n        };\n    });\n    var normalizedHeaders = Object.create(null);\n    Object.keys(headerData).forEach(function (name) {\n        normalizedHeaders[headerData[name].originalName] = headerData[name].value;\n    });\n    return normalizedHeaders;\n}\n//# sourceMappingURL=selectHttpOptionsAndBody.js.map","export var selectURI = function (operation, fallbackURI) {\n    var context = operation.getContext();\n    var contextURI = context.uri;\n    if (contextURI) {\n        return contextURI;\n    }\n    else if (typeof fallbackURI === \"function\") {\n        return fallbackURI(operation);\n    }\n    else {\n        return fallbackURI || \"/graphql\";\n    }\n};\n//# sourceMappingURL=selectURI.js.map","import { newInvariantError } from \"../../utilities/globals/index.js\";\nexport var serializeFetchParameter = function (p, label) {\n    var serialized;\n    try {\n        serialized = JSON.stringify(p);\n    }\n    catch (e) {\n        var parseError = newInvariantError(39, label, e.message);\n        parseError.parseError = e;\n        throw parseError;\n    }\n    return serialized;\n};\n//# sourceMappingURL=serializeFetchParameter.js.map","import { __assign } from \"tslib\";\nimport { visit } from \"graphql\";\nexport function filterOperationVariables(variables, query) {\n    var result = __assign({}, variables);\n    var unusedNames = new Set(Object.keys(variables));\n    visit(query, {\n        Variable: function (node, _key, parent) {\n            // A variable type definition at the top level of a query is not\n            // enough to silence server-side errors about the variable being\n            // unused, so variable definitions do not count as usage.\n            // https://spec.graphql.org/draft/#sec-All-Variables-Used\n            if (parent &&\n                parent.kind !== \"VariableDefinition\") {\n                unusedNames.delete(node.name.value);\n            }\n        },\n    });\n    unusedNames.forEach(function (name) {\n        delete result[name];\n    });\n    return result;\n}\n//# sourceMappingURL=filterOperationVariables.js.map","import { Observable } from \"../../utilities/index.js\";\nexport function fromError(errorValue) {\n    return new Observable(function (observer) {\n        observer.error(errorValue);\n    });\n}\n//# sourceMappingURL=fromError.js.map","export var throwServerError = function (response, result, message) {\n    var error = new Error(message);\n    error.name = \"ServerError\";\n    error.response = response;\n    error.statusCode = response.status;\n    error.result = result;\n    throw error;\n};\n//# sourceMappingURL=throwServerError.js.map","import { AutoCleanedStrongCache, cacheSizes, } from \"../../utilities/caching/index.js\";\nimport { registerGlobalCache } from \"../caching/getMemoryInternals.js\";\n/**\n * Like JSON.stringify, but with object keys always sorted in the same order.\n *\n * To achieve performant sorting, this function uses a Map from JSON-serialized\n * arrays of keys (in any order) to sorted arrays of the same keys, with a\n * single sorted array reference shared by all permutations of the keys.\n *\n * As a drawback, this function will add a little bit more memory for every\n * object encountered that has different (more, less, a different order of) keys\n * than in the past.\n *\n * In a typical application, this extra memory usage should not play a\n * significant role, as `canonicalStringify` will be called for only a limited\n * number of object shapes, and the cache will not grow beyond a certain point.\n * But in some edge cases, this could be a problem, so we provide\n * canonicalStringify.reset() as a way of clearing the cache.\n * */\nexport var canonicalStringify = Object.assign(function canonicalStringify(value) {\n    return JSON.stringify(value, stableObjectReplacer);\n}, {\n    reset: function () {\n        // Clearing the sortingMap will reclaim all cached memory, without\n        // affecting the logical results of canonicalStringify, but potentially\n        // sacrificing performance until the cache is refilled.\n        sortingMap = new AutoCleanedStrongCache(cacheSizes.canonicalStringify || 1000 /* defaultCacheSizes.canonicalStringify */);\n    },\n});\nif (globalThis.__DEV__ !== false) {\n    registerGlobalCache(\"canonicalStringify\", function () { return sortingMap.size; });\n}\n// Values are JSON-serialized arrays of object keys (in any order), and values\n// are sorted arrays of the same keys.\nvar sortingMap;\ncanonicalStringify.reset();\n// The JSON.stringify function takes an optional second argument called a\n// replacer function. This function is called for each key-value pair in the\n// object being stringified, and its return value is used instead of the\n// original value. If the replacer function returns a new value, that value is\n// stringified as JSON instead of the original value of the property.\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify#the_replacer_parameter\nfunction stableObjectReplacer(key, value) {\n    if (value && typeof value === \"object\") {\n        var proto = Object.getPrototypeOf(value);\n        // We don't want to mess with objects that are not \"plain\" objects, which\n        // means their prototype is either Object.prototype or null. This check also\n        // prevents needlessly rearranging the indices of arrays.\n        if (proto === Object.prototype || proto === null) {\n            var keys = Object.keys(value);\n            // If keys is already sorted, let JSON.stringify serialize the original\n            // value instead of creating a new object with keys in the same order.\n            if (keys.every(everyKeyInOrder))\n                return value;\n            var unsortedKey = JSON.stringify(keys);\n            var sortedKeys = sortingMap.get(unsortedKey);\n            if (!sortedKeys) {\n                keys.sort();\n                var sortedKey = JSON.stringify(keys);\n                // Checking for sortedKey in the sortingMap allows us to share the same\n                // sorted array reference for all permutations of the same set of keys.\n                sortedKeys = sortingMap.get(sortedKey) || keys;\n                sortingMap.set(unsortedKey, sortedKeys);\n                sortingMap.set(sortedKey, sortedKeys);\n            }\n            var sortedObject_1 = Object.create(proto);\n            // Reassigning the keys in sorted order will cause JSON.stringify to\n            // serialize them in sorted order.\n            sortedKeys.forEach(function (key) {\n                sortedObject_1[key] = value[key];\n            });\n            return sortedObject_1;\n        }\n    }\n    return value;\n}\n// Since everything that happens in stableObjectReplacer benefits from being as\n// efficient as possible, we use a static function as the callback for\n// keys.every in order to test if the provided keys are already sorted without\n// allocating extra memory for a callback.\nfunction everyKeyInOrder(key, i, keys) {\n    return i === 0 || keys[i - 1] <= key;\n}\n//# sourceMappingURL=canonicalStringify.js.map","var toString = Object.prototype.toString;\n/**\n * Deeply clones a value to create a new instance.\n */\nexport function cloneDeep(value) {\n    return cloneDeepHelper(value);\n}\nfunction cloneDeepHelper(val, seen) {\n    switch (toString.call(val)) {\n        case \"[object Array]\": {\n            seen = seen || new Map();\n            if (seen.has(val))\n                return seen.get(val);\n            var copy_1 = val.slice(0);\n            seen.set(val, copy_1);\n            copy_1.forEach(function (child, i) {\n                copy_1[i] = cloneDeepHelper(child, seen);\n            });\n            return copy_1;\n        }\n        case \"[object Object]\": {\n            seen = seen || new Map();\n            if (seen.has(val))\n                return seen.get(val);\n            // High fidelity polyfills of Object.create and Object.getPrototypeOf are\n            // possible in all JS environments, so we will assume they exist/work.\n            var copy_2 = Object.create(Object.getPrototypeOf(val));\n            seen.set(val, copy_2);\n            Object.keys(val).forEach(function (key) {\n                copy_2[key] = cloneDeepHelper(val[key], seen);\n            });\n            return copy_2;\n        }\n        default:\n            return val;\n    }\n}\n//# sourceMappingURL=cloneDeep.js.map","import { isNonNullObject } from \"./objects.js\";\nimport { isNonEmptyArray } from \"./arrays.js\";\nimport { DeepMerger } from \"./mergeDeep.js\";\nexport function isExecutionPatchIncrementalResult(value) {\n    return \"incremental\" in value;\n}\nexport function isExecutionPatchInitialResult(value) {\n    return \"hasNext\" in value && \"data\" in value;\n}\nexport function isExecutionPatchResult(value) {\n    return (isExecutionPatchIncrementalResult(value) ||\n        isExecutionPatchInitialResult(value));\n}\n// This function detects an Apollo payload result before it is transformed\n// into a FetchResult via HttpLink; it cannot detect an ApolloPayloadResult\n// once it leaves the link chain.\nexport function isApolloPayloadResult(value) {\n    return isNonNullObject(value) && \"payload\" in value;\n}\nexport function mergeIncrementalData(prevResult, result) {\n    var mergedData = prevResult;\n    var merger = new DeepMerger();\n    if (isExecutionPatchIncrementalResult(result) &&\n        isNonEmptyArray(result.incremental)) {\n        result.incremental.forEach(function (_a) {\n            var data = _a.data, path = _a.path;\n            for (var i = path.length - 1; i >= 0; --i) {\n                var key = path[i];\n                var isNumericKey = !isNaN(+key);\n                var parent_1 = isNumericKey ? [] : {};\n                parent_1[key] = data;\n                data = parent_1;\n            }\n            mergedData = merger.merge(mergedData, data);\n        });\n    }\n    return mergedData;\n}\n//# sourceMappingURL=incrementalResult.js.map","import { __assign, __spreadArray } from \"tslib\";\nimport { isNonNullObject } from \"./objects.js\";\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nexport function mergeDeep() {\n    var sources = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        sources[_i] = arguments[_i];\n    }\n    return mergeDeepArray(sources);\n}\n// In almost any situation where you could succeed in getting the\n// TypeScript compiler to infer a tuple type for the sources array, you\n// could just use mergeDeep instead of mergeDeepArray, so instead of\n// trying to convert T[] to an intersection type we just infer the array\n// element type, which works perfectly when the sources array has a\n// consistent element type.\nexport function mergeDeepArray(sources) {\n    var target = sources[0] || {};\n    var count = sources.length;\n    if (count > 1) {\n        var merger = new DeepMerger();\n        for (var i = 1; i < count; ++i) {\n            target = merger.merge(target, sources[i]);\n        }\n    }\n    return target;\n}\nvar defaultReconciler = function (target, source, property) {\n    return this.merge(target[property], source[property]);\n};\nvar DeepMerger = /** @class */ (function () {\n    function DeepMerger(reconciler) {\n        if (reconciler === void 0) { reconciler = defaultReconciler; }\n        this.reconciler = reconciler;\n        this.isObject = isNonNullObject;\n        this.pastCopies = new Set();\n    }\n    DeepMerger.prototype.merge = function (target, source) {\n        var _this = this;\n        var context = [];\n        for (var _i = 2; _i < arguments.length; _i++) {\n            context[_i - 2] = arguments[_i];\n        }\n        if (isNonNullObject(source) && isNonNullObject(target)) {\n            Object.keys(source).forEach(function (sourceKey) {\n                if (hasOwnProperty.call(target, sourceKey)) {\n                    var targetValue = target[sourceKey];\n                    if (source[sourceKey] !== targetValue) {\n                        var result = _this.reconciler.apply(_this, __spreadArray([target,\n                            source,\n                            sourceKey], context, false));\n                        // A well-implemented reconciler may return targetValue to indicate\n                        // the merge changed nothing about the structure of the target.\n                        if (result !== targetValue) {\n                            target = _this.shallowCopyForMerge(target);\n                            target[sourceKey] = result;\n                        }\n                    }\n                }\n                else {\n                    // If there is no collision, the target can safely share memory with\n                    // the source, and the recursion can terminate here.\n                    target = _this.shallowCopyForMerge(target);\n                    target[sourceKey] = source[sourceKey];\n                }\n            });\n            return target;\n        }\n        // If source (or target) is not an object, let source replace target.\n        return source;\n    };\n    DeepMerger.prototype.shallowCopyForMerge = function (value) {\n        if (isNonNullObject(value)) {\n            if (!this.pastCopies.has(value)) {\n                if (Array.isArray(value)) {\n                    value = value.slice(0);\n                }\n                else {\n                    value = __assign({ __proto__: Object.getPrototypeOf(value) }, value);\n                }\n                this.pastCopies.add(value);\n            }\n        }\n        return value;\n    };\n    return DeepMerger;\n}());\nexport { DeepMerger };\n//# sourceMappingURL=mergeDeep.js.map","import { Trie } from \"@wry/trie\";\nimport { canUseWeakMap, canUseWeakSet } from \"../common/canUse.js\";\nimport { checkDocument } from \"./getFromAST.js\";\nimport { invariant } from \"../globals/index.js\";\nimport { WeakCache } from \"@wry/caches\";\nimport { wrap } from \"optimism\";\nimport { cacheSizes } from \"../caching/index.js\";\nfunction identity(document) {\n    return document;\n}\nvar DocumentTransform = /** @class */ (function () {\n    function DocumentTransform(transform, options) {\n        if (options === void 0) { options = Object.create(null); }\n        this.resultCache = canUseWeakSet ? new WeakSet() : new Set();\n        this.transform = transform;\n        if (options.getCacheKey) {\n            // Override default `getCacheKey` function, which returns [document].\n            this.getCacheKey = options.getCacheKey;\n        }\n        this.cached = options.cache !== false;\n        this.resetCache();\n    }\n    // This default implementation of getCacheKey can be overridden by providing\n    // options.getCacheKey to the DocumentTransform constructor. In general, a\n    // getCacheKey function may either return an array of keys (often including\n    // the document) to be used as a cache key, or undefined to indicate the\n    // transform for this document should not be cached.\n    DocumentTransform.prototype.getCacheKey = function (document) {\n        return [document];\n    };\n    DocumentTransform.identity = function () {\n        // No need to cache this transform since it just returns the document\n        // unchanged. This should save a bit of memory that would otherwise be\n        // needed to populate the `documentCache` of this transform.\n        return new DocumentTransform(identity, { cache: false });\n    };\n    DocumentTransform.split = function (predicate, left, right) {\n        if (right === void 0) { right = DocumentTransform.identity(); }\n        return Object.assign(new DocumentTransform(function (document) {\n            var documentTransform = predicate(document) ? left : right;\n            return documentTransform.transformDocument(document);\n        }, \n        // Reasonably assume both `left` and `right` transforms handle their own caching\n        { cache: false }), { left: left, right: right });\n    };\n    /**\n     * Resets the internal cache of this transform, if it has one.\n     */\n    DocumentTransform.prototype.resetCache = function () {\n        var _this = this;\n        if (this.cached) {\n            var stableCacheKeys_1 = new Trie(canUseWeakMap);\n            this.performWork = wrap(DocumentTransform.prototype.performWork.bind(this), {\n                makeCacheKey: function (document) {\n                    var cacheKeys = _this.getCacheKey(document);\n                    if (cacheKeys) {\n                        invariant(Array.isArray(cacheKeys), 66);\n                        return stableCacheKeys_1.lookupArray(cacheKeys);\n                    }\n                },\n                max: cacheSizes[\"documentTransform.cache\"],\n                cache: (WeakCache),\n            });\n        }\n    };\n    DocumentTransform.prototype.performWork = function (document) {\n        checkDocument(document);\n        return this.transform(document);\n    };\n    DocumentTransform.prototype.transformDocument = function (document) {\n        // If a user passes an already transformed result back to this function,\n        // immediately return it.\n        if (this.resultCache.has(document)) {\n            return document;\n        }\n        var transformedDocument = this.performWork(document);\n        this.resultCache.add(transformedDocument);\n        return transformedDocument;\n    };\n    DocumentTransform.prototype.concat = function (otherTransform) {\n        var _this = this;\n        return Object.assign(new DocumentTransform(function (document) {\n            return otherTransform.transformDocument(_this.transformDocument(document));\n        }, \n        // Reasonably assume both transforms handle their own caching\n        { cache: false }), {\n            left: this,\n            right: otherTransform,\n        });\n    };\n    return DocumentTransform;\n}());\nexport { DocumentTransform };\n//# sourceMappingURL=DocumentTransform.js.map","import { invariant } from \"../globals/index.js\";\nimport { visit, BREAK } from \"graphql\";\nexport function shouldInclude(_a, variables) {\n    var directives = _a.directives;\n    if (!directives || !directives.length) {\n        return true;\n    }\n    return getInclusionDirectives(directives).every(function (_a) {\n        var directive = _a.directive, ifArgument = _a.ifArgument;\n        var evaledValue = false;\n        if (ifArgument.value.kind === \"Variable\") {\n            evaledValue =\n                variables && variables[ifArgument.value.name.value];\n            invariant(evaledValue !== void 0, 67, directive.name.value);\n        }\n        else {\n            evaledValue = ifArgument.value.value;\n        }\n        return directive.name.value === \"skip\" ? !evaledValue : evaledValue;\n    });\n}\nexport function getDirectiveNames(root) {\n    var names = [];\n    visit(root, {\n        Directive: function (node) {\n            names.push(node.name.value);\n        },\n    });\n    return names;\n}\nexport var hasAnyDirectives = function (names, root) {\n    return hasDirectives(names, root, false);\n};\nexport var hasAllDirectives = function (names, root) {\n    return hasDirectives(names, root, true);\n};\nexport function hasDirectives(names, root, all) {\n    var nameSet = new Set(names);\n    var uniqueCount = nameSet.size;\n    visit(root, {\n        Directive: function (node) {\n            if (nameSet.delete(node.name.value) && (!all || !nameSet.size)) {\n                return BREAK;\n            }\n        },\n    });\n    // If we found all the names, nameSet will be empty. If we only care about\n    // finding some of them, the < condition is sufficient.\n    return all ? !nameSet.size : nameSet.size < uniqueCount;\n}\nexport function hasClientExports(document) {\n    return document && hasDirectives([\"client\", \"export\"], document, true);\n}\nfunction isInclusionDirective(_a) {\n    var value = _a.name.value;\n    return value === \"skip\" || value === \"include\";\n}\nexport function getInclusionDirectives(directives) {\n    var result = [];\n    if (directives && directives.length) {\n        directives.forEach(function (directive) {\n            if (!isInclusionDirective(directive))\n                return;\n            var directiveArguments = directive.arguments;\n            var directiveName = directive.name.value;\n            invariant(directiveArguments && directiveArguments.length === 1, 68, directiveName);\n            var ifArgument = directiveArguments[0];\n            invariant(ifArgument.name && ifArgument.name.value === \"if\", 69, directiveName);\n            var ifValue = ifArgument.value;\n            // means it has to be a variable value if this is a valid @skip or @include directive\n            invariant(ifValue &&\n                (ifValue.kind === \"Variable\" || ifValue.kind === \"BooleanValue\"), 70, directiveName);\n            result.push({ directive: directive, ifArgument: ifArgument });\n        });\n    }\n    return result;\n}\n//# sourceMappingURL=directives.js.map","import { __assign, __spreadArray } from \"tslib\";\nimport { invariant, newInvariantError } from \"../globals/index.js\";\n/**\n * Returns a query document which adds a single query operation that only\n * spreads the target fragment inside of it.\n *\n * So for example a document of:\n *\n * ```graphql\n * fragment foo on Foo { a b c }\n * ```\n *\n * Turns into:\n *\n * ```graphql\n * { ...foo }\n *\n * fragment foo on Foo { a b c }\n * ```\n *\n * The target fragment will either be the only fragment in the document, or a\n * fragment specified by the provided `fragmentName`. If there is more than one\n * fragment, but a `fragmentName` was not defined then an error will be thrown.\n */\nexport function getFragmentQueryDocument(document, fragmentName) {\n    var actualFragmentName = fragmentName;\n    // Build an array of all our fragment definitions that will be used for\n    // validations. We also do some validations on the other definitions in the\n    // document while building this list.\n    var fragments = [];\n    document.definitions.forEach(function (definition) {\n        // Throw an error if we encounter an operation definition because we will\n        // define our own operation definition later on.\n        if (definition.kind === \"OperationDefinition\") {\n            throw newInvariantError(\n                71,\n                definition.operation,\n                definition.name ? \" named '\".concat(definition.name.value, \"'\") : \"\"\n            );\n        }\n        // Add our definition to the fragments array if it is a fragment\n        // definition.\n        if (definition.kind === \"FragmentDefinition\") {\n            fragments.push(definition);\n        }\n    });\n    // If the user did not give us a fragment name then let us try to get a\n    // name from a single fragment in the definition.\n    if (typeof actualFragmentName === \"undefined\") {\n        invariant(fragments.length === 1, 72, fragments.length);\n        actualFragmentName = fragments[0].name.value;\n    }\n    // Generate a query document with an operation that simply spreads the\n    // fragment inside of it.\n    var query = __assign(__assign({}, document), { definitions: __spreadArray([\n            {\n                kind: \"OperationDefinition\",\n                // OperationTypeNode is an enum\n                operation: \"query\",\n                selectionSet: {\n                    kind: \"SelectionSet\",\n                    selections: [\n                        {\n                            kind: \"FragmentSpread\",\n                            name: {\n                                kind: \"Name\",\n                                value: actualFragmentName,\n                            },\n                        },\n                    ],\n                },\n            }\n        ], document.definitions, true) });\n    return query;\n}\n// Utility function that takes a list of fragment definitions and makes a hash out of them\n// that maps the name of the fragment to the fragment definition.\nexport function createFragmentMap(fragments) {\n    if (fragments === void 0) { fragments = []; }\n    var symTable = {};\n    fragments.forEach(function (fragment) {\n        symTable[fragment.name.value] = fragment;\n    });\n    return symTable;\n}\nexport function getFragmentFromSelection(selection, fragmentMap) {\n    switch (selection.kind) {\n        case \"InlineFragment\":\n            return selection;\n        case \"FragmentSpread\": {\n            var fragmentName = selection.name.value;\n            if (typeof fragmentMap === \"function\") {\n                return fragmentMap(fragmentName);\n            }\n            var fragment = fragmentMap && fragmentMap[fragmentName];\n            invariant(fragment, 73, fragmentName);\n            return fragment || null;\n        }\n        default:\n            return null;\n    }\n}\n//# sourceMappingURL=fragments.js.map","import { invariant, newInvariantError } from \"../globals/index.js\";\nimport { valueToObjectRepresentation } from \"./storeUtils.js\";\n// Checks the document for errors and throws an exception if there is an error.\nexport function checkDocument(doc) {\n    invariant(doc && doc.kind === \"Document\", 74);\n    var operations = doc.definitions\n        .filter(function (d) { return d.kind !== \"FragmentDefinition\"; })\n        .map(function (definition) {\n        if (definition.kind !== \"OperationDefinition\") {\n            throw newInvariantError(75, definition.kind);\n        }\n        return definition;\n    });\n    invariant(operations.length <= 1, 76, operations.length);\n    return doc;\n}\nexport function getOperationDefinition(doc) {\n    checkDocument(doc);\n    return doc.definitions.filter(function (definition) {\n        return definition.kind === \"OperationDefinition\";\n    })[0];\n}\nexport function getOperationName(doc) {\n    return (doc.definitions\n        .filter(function (definition) {\n        return definition.kind === \"OperationDefinition\" && !!definition.name;\n    })\n        .map(function (x) { return x.name.value; })[0] || null);\n}\n// Returns the FragmentDefinitions from a particular document as an array\nexport function getFragmentDefinitions(doc) {\n    return doc.definitions.filter(function (definition) {\n        return definition.kind === \"FragmentDefinition\";\n    });\n}\nexport function getQueryDefinition(doc) {\n    var queryDef = getOperationDefinition(doc);\n    invariant(queryDef && queryDef.operation === \"query\", 77);\n    return queryDef;\n}\nexport function getFragmentDefinition(doc) {\n    invariant(doc.kind === \"Document\", 78);\n    invariant(doc.definitions.length <= 1, 79);\n    var fragmentDef = doc.definitions[0];\n    invariant(fragmentDef.kind === \"FragmentDefinition\", 80);\n    return fragmentDef;\n}\n/**\n * Returns the first operation definition found in this document.\n * If no operation definition is found, the first fragment definition will be returned.\n * If no definitions are found, an error will be thrown.\n */\nexport function getMainDefinition(queryDoc) {\n    checkDocument(queryDoc);\n    var fragmentDefinition;\n    for (var _i = 0, _a = queryDoc.definitions; _i < _a.length; _i++) {\n        var definition = _a[_i];\n        if (definition.kind === \"OperationDefinition\") {\n            var operation = definition.operation;\n            if (operation === \"query\" ||\n                operation === \"mutation\" ||\n                operation === \"subscription\") {\n                return definition;\n            }\n        }\n        if (definition.kind === \"FragmentDefinition\" && !fragmentDefinition) {\n            // we do this because we want to allow multiple fragment definitions\n            // to precede an operation definition.\n            fragmentDefinition = definition;\n        }\n    }\n    if (fragmentDefinition) {\n        return fragmentDefinition;\n    }\n    throw newInvariantError(81);\n}\nexport function getDefaultValues(definition) {\n    var defaultValues = Object.create(null);\n    var defs = definition && definition.variableDefinitions;\n    if (defs && defs.length) {\n        defs.forEach(function (def) {\n            if (def.defaultValue) {\n                valueToObjectRepresentation(defaultValues, def.variable.name, def.defaultValue);\n            }\n        });\n    }\n    return defaultValues;\n}\n//# sourceMappingURL=getFromAST.js.map","import { print as origPrint } from \"graphql\";\nimport { AutoCleanedWeakCache, cacheSizes, } from \"../caching/index.js\";\nimport { registerGlobalCache } from \"../caching/getMemoryInternals.js\";\nvar printCache;\nexport var print = Object.assign(function (ast) {\n    var result = printCache.get(ast);\n    if (!result) {\n        result = origPrint(ast);\n        printCache.set(ast, result);\n    }\n    return result;\n}, {\n    reset: function () {\n        printCache = new AutoCleanedWeakCache(cacheSizes.print || 2000 /* defaultCacheSizes.print */);\n    },\n});\nprint.reset();\nif (globalThis.__DEV__ !== false) {\n    registerGlobalCache(\"print\", function () { return (printCache ? printCache.size : 0); });\n}\n//# sourceMappingURL=print.js.map","import { newInvariantError } from \"../globals/index.js\";\nimport { isNonNullObject } from \"../common/objects.js\";\nimport { getFragmentFromSelection } from \"./fragments.js\";\nimport { canonicalStringify } from \"../common/canonicalStringify.js\";\nexport function makeReference(id) {\n    return { __ref: String(id) };\n}\nexport function isReference(obj) {\n    return Boolean(obj && typeof obj === \"object\" && typeof obj.__ref === \"string\");\n}\nexport function isDocumentNode(value) {\n    return (isNonNullObject(value) &&\n        value.kind === \"Document\" &&\n        Array.isArray(value.definitions));\n}\nfunction isStringValue(value) {\n    return value.kind === \"StringValue\";\n}\nfunction isBooleanValue(value) {\n    return value.kind === \"BooleanValue\";\n}\nfunction isIntValue(value) {\n    return value.kind === \"IntValue\";\n}\nfunction isFloatValue(value) {\n    return value.kind === \"FloatValue\";\n}\nfunction isVariable(value) {\n    return value.kind === \"Variable\";\n}\nfunction isObjectValue(value) {\n    return value.kind === \"ObjectValue\";\n}\nfunction isListValue(value) {\n    return value.kind === \"ListValue\";\n}\nfunction isEnumValue(value) {\n    return value.kind === \"EnumValue\";\n}\nfunction isNullValue(value) {\n    return value.kind === \"NullValue\";\n}\nexport function valueToObjectRepresentation(argObj, name, value, variables) {\n    if (isIntValue(value) || isFloatValue(value)) {\n        argObj[name.value] = Number(value.value);\n    }\n    else if (isBooleanValue(value) || isStringValue(value)) {\n        argObj[name.value] = value.value;\n    }\n    else if (isObjectValue(value)) {\n        var nestedArgObj_1 = {};\n        value.fields.map(function (obj) {\n            return valueToObjectRepresentation(nestedArgObj_1, obj.name, obj.value, variables);\n        });\n        argObj[name.value] = nestedArgObj_1;\n    }\n    else if (isVariable(value)) {\n        var variableValue = (variables || {})[value.name.value];\n        argObj[name.value] = variableValue;\n    }\n    else if (isListValue(value)) {\n        argObj[name.value] = value.values.map(function (listValue) {\n            var nestedArgArrayObj = {};\n            valueToObjectRepresentation(nestedArgArrayObj, name, listValue, variables);\n            return nestedArgArrayObj[name.value];\n        });\n    }\n    else if (isEnumValue(value)) {\n        argObj[name.value] = value.value;\n    }\n    else if (isNullValue(value)) {\n        argObj[name.value] = null;\n    }\n    else {\n        throw newInvariantError(82, name.value, value.kind);\n    }\n}\nexport function storeKeyNameFromField(field, variables) {\n    var directivesObj = null;\n    if (field.directives) {\n        directivesObj = {};\n        field.directives.forEach(function (directive) {\n            directivesObj[directive.name.value] = {};\n            if (directive.arguments) {\n                directive.arguments.forEach(function (_a) {\n                    var name = _a.name, value = _a.value;\n                    return valueToObjectRepresentation(directivesObj[directive.name.value], name, value, variables);\n                });\n            }\n        });\n    }\n    var argObj = null;\n    if (field.arguments && field.arguments.length) {\n        argObj = {};\n        field.arguments.forEach(function (_a) {\n            var name = _a.name, value = _a.value;\n            return valueToObjectRepresentation(argObj, name, value, variables);\n        });\n    }\n    return getStoreKeyName(field.name.value, argObj, directivesObj);\n}\nvar KNOWN_DIRECTIVES = [\n    \"connection\",\n    \"include\",\n    \"skip\",\n    \"client\",\n    \"rest\",\n    \"export\",\n    \"nonreactive\",\n];\n// Default stable JSON.stringify implementation used by getStoreKeyName. Can be\n// updated/replaced with something better by calling\n// getStoreKeyName.setStringify(newStringifyFunction).\nvar storeKeyNameStringify = canonicalStringify;\nexport var getStoreKeyName = Object.assign(function (fieldName, args, directives) {\n    if (args &&\n        directives &&\n        directives[\"connection\"] &&\n        directives[\"connection\"][\"key\"]) {\n        if (directives[\"connection\"][\"filter\"] &&\n            directives[\"connection\"][\"filter\"].length > 0) {\n            var filterKeys = directives[\"connection\"][\"filter\"] ?\n                directives[\"connection\"][\"filter\"]\n                : [];\n            filterKeys.sort();\n            var filteredArgs_1 = {};\n            filterKeys.forEach(function (key) {\n                filteredArgs_1[key] = args[key];\n            });\n            return \"\".concat(directives[\"connection\"][\"key\"], \"(\").concat(storeKeyNameStringify(filteredArgs_1), \")\");\n        }\n        else {\n            return directives[\"connection\"][\"key\"];\n        }\n    }\n    var completeFieldName = fieldName;\n    if (args) {\n        // We can't use `JSON.stringify` here since it's non-deterministic,\n        // and can lead to different store key names being created even though\n        // the `args` object used during creation has the same properties/values.\n        var stringifiedArgs = storeKeyNameStringify(args);\n        completeFieldName += \"(\".concat(stringifiedArgs, \")\");\n    }\n    if (directives) {\n        Object.keys(directives).forEach(function (key) {\n            if (KNOWN_DIRECTIVES.indexOf(key) !== -1)\n                return;\n            if (directives[key] && Object.keys(directives[key]).length) {\n                completeFieldName += \"@\".concat(key, \"(\").concat(storeKeyNameStringify(directives[key]), \")\");\n            }\n            else {\n                completeFieldName += \"@\".concat(key);\n            }\n        });\n    }\n    return completeFieldName;\n}, {\n    setStringify: function (s) {\n        var previous = storeKeyNameStringify;\n        storeKeyNameStringify = s;\n        return previous;\n    },\n});\nexport function argumentsObjectFromField(field, variables) {\n    if (field.arguments && field.arguments.length) {\n        var argObj_1 = {};\n        field.arguments.forEach(function (_a) {\n            var name = _a.name, value = _a.value;\n            return valueToObjectRepresentation(argObj_1, name, value, variables);\n        });\n        return argObj_1;\n    }\n    return null;\n}\nexport function resultKeyNameFromField(field) {\n    return field.alias ? field.alias.value : field.name.value;\n}\nexport function getTypenameFromResult(result, selectionSet, fragmentMap) {\n    var fragments;\n    for (var _i = 0, _a = selectionSet.selections; _i < _a.length; _i++) {\n        var selection = _a[_i];\n        if (isField(selection)) {\n            if (selection.name.value === \"__typename\") {\n                return result[resultKeyNameFromField(selection)];\n            }\n        }\n        else if (fragments) {\n            fragments.push(selection);\n        }\n        else {\n            fragments = [selection];\n        }\n    }\n    if (typeof result.__typename === \"string\") {\n        return result.__typename;\n    }\n    if (fragments) {\n        for (var _b = 0, fragments_1 = fragments; _b < fragments_1.length; _b++) {\n            var selection = fragments_1[_b];\n            var typename = getTypenameFromResult(result, getFragmentFromSelection(selection, fragmentMap).selectionSet, fragmentMap);\n            if (typeof typename === \"string\") {\n                return typename;\n            }\n        }\n    }\n}\nexport function isField(selection) {\n    return selection.kind === \"Field\";\n}\nexport function isInlineFragment(selection) {\n    return selection.kind === \"InlineFragment\";\n}\n//# sourceMappingURL=storeUtils.js.map","import { __assign, __spreadArray } from \"tslib\";\nimport { invariant } from \"../globals/index.js\";\nimport { visit, Kind } from \"graphql\";\nimport { checkDocument, getOperationDefinition, getFragmentDefinition, getFragmentDefinitions, getMainDefinition, } from \"./getFromAST.js\";\nimport { isField } from \"./storeUtils.js\";\nimport { createFragmentMap } from \"./fragments.js\";\nimport { isArray, isNonEmptyArray } from \"../common/arrays.js\";\nvar TYPENAME_FIELD = {\n    kind: Kind.FIELD,\n    name: {\n        kind: Kind.NAME,\n        value: \"__typename\",\n    },\n};\nfunction isEmpty(op, fragmentMap) {\n    return (!op ||\n        op.selectionSet.selections.every(function (selection) {\n            return selection.kind === Kind.FRAGMENT_SPREAD &&\n                isEmpty(fragmentMap[selection.name.value], fragmentMap);\n        }));\n}\nfunction nullIfDocIsEmpty(doc) {\n    return (isEmpty(getOperationDefinition(doc) || getFragmentDefinition(doc), createFragmentMap(getFragmentDefinitions(doc)))) ?\n        null\n        : doc;\n}\nfunction getDirectiveMatcher(configs) {\n    var names = new Map();\n    var tests = new Map();\n    configs.forEach(function (directive) {\n        if (directive) {\n            if (directive.name) {\n                names.set(directive.name, directive);\n            }\n            else if (directive.test) {\n                tests.set(directive.test, directive);\n            }\n        }\n    });\n    return function (directive) {\n        var config = names.get(directive.name.value);\n        if (!config && tests.size) {\n            tests.forEach(function (testConfig, test) {\n                if (test(directive)) {\n                    config = testConfig;\n                }\n            });\n        }\n        return config;\n    };\n}\nfunction makeInUseGetterFunction(defaultKey) {\n    var map = new Map();\n    return function inUseGetterFunction(key) {\n        if (key === void 0) { key = defaultKey; }\n        var inUse = map.get(key);\n        if (!inUse) {\n            map.set(key, (inUse = {\n                // Variable and fragment spread names used directly within this\n                // operation or fragment definition, as identified by key. These sets\n                // will be populated during the first traversal of the document in\n                // removeDirectivesFromDocument below.\n                variables: new Set(),\n                fragmentSpreads: new Set(),\n            }));\n        }\n        return inUse;\n    };\n}\nexport function removeDirectivesFromDocument(directives, doc) {\n    checkDocument(doc);\n    // Passing empty strings to makeInUseGetterFunction means we handle anonymous\n    // operations as if their names were \"\". Anonymous fragment definitions are\n    // not supposed to be possible, but the same default naming strategy seems\n    // appropriate for that case as well.\n    var getInUseByOperationName = makeInUseGetterFunction(\"\");\n    var getInUseByFragmentName = makeInUseGetterFunction(\"\");\n    var getInUse = function (ancestors) {\n        for (var p = 0, ancestor = void 0; p < ancestors.length && (ancestor = ancestors[p]); ++p) {\n            if (isArray(ancestor))\n                continue;\n            if (ancestor.kind === Kind.OPERATION_DEFINITION) {\n                // If an operation is anonymous, we use the empty string as its key.\n                return getInUseByOperationName(ancestor.name && ancestor.name.value);\n            }\n            if (ancestor.kind === Kind.FRAGMENT_DEFINITION) {\n                return getInUseByFragmentName(ancestor.name.value);\n            }\n        }\n        globalThis.__DEV__ !== false && invariant.error(83);\n        return null;\n    };\n    var operationCount = 0;\n    for (var i = doc.definitions.length - 1; i >= 0; --i) {\n        if (doc.definitions[i].kind === Kind.OPERATION_DEFINITION) {\n            ++operationCount;\n        }\n    }\n    var directiveMatcher = getDirectiveMatcher(directives);\n    var shouldRemoveField = function (nodeDirectives) {\n        return isNonEmptyArray(nodeDirectives) &&\n            nodeDirectives\n                .map(directiveMatcher)\n                .some(function (config) { return config && config.remove; });\n    };\n    var originalFragmentDefsByPath = new Map();\n    // Any time the first traversal of the document below makes a change like\n    // removing a fragment (by returning null), this variable should be set to\n    // true. Once it becomes true, it should never be set to false again. If this\n    // variable remains false throughout the traversal, then we can return the\n    // original doc immediately without any modifications.\n    var firstVisitMadeChanges = false;\n    var fieldOrInlineFragmentVisitor = {\n        enter: function (node) {\n            if (shouldRemoveField(node.directives)) {\n                firstVisitMadeChanges = true;\n                return null;\n            }\n        },\n    };\n    var docWithoutDirectiveSubtrees = visit(doc, {\n        // These two AST node types share the same implementation, defined above.\n        Field: fieldOrInlineFragmentVisitor,\n        InlineFragment: fieldOrInlineFragmentVisitor,\n        VariableDefinition: {\n            enter: function () {\n                // VariableDefinition nodes do not count as variables in use, though\n                // they do contain Variable nodes that might be visited below. To avoid\n                // counting variable declarations as usages, we skip visiting the\n                // contents of this VariableDefinition node by returning false.\n                return false;\n            },\n        },\n        Variable: {\n            enter: function (node, _key, _parent, _path, ancestors) {\n                var inUse = getInUse(ancestors);\n                if (inUse) {\n                    inUse.variables.add(node.name.value);\n                }\n            },\n        },\n        FragmentSpread: {\n            enter: function (node, _key, _parent, _path, ancestors) {\n                if (shouldRemoveField(node.directives)) {\n                    firstVisitMadeChanges = true;\n                    return null;\n                }\n                var inUse = getInUse(ancestors);\n                if (inUse) {\n                    inUse.fragmentSpreads.add(node.name.value);\n                }\n                // We might like to remove this FragmentSpread by returning null here if\n                // the corresponding FragmentDefinition node is also going to be removed\n                // by the logic below, but we can't control the relative order of those\n                // events, so we have to postpone the removal of dangling FragmentSpread\n                // nodes until after the current visit of the document has finished.\n            },\n        },\n        FragmentDefinition: {\n            enter: function (node, _key, _parent, path) {\n                originalFragmentDefsByPath.set(JSON.stringify(path), node);\n            },\n            leave: function (node, _key, _parent, path) {\n                var originalNode = originalFragmentDefsByPath.get(JSON.stringify(path));\n                if (node === originalNode) {\n                    // If the FragmentNode received by this leave function is identical to\n                    // the one received by the corresponding enter function (above), then\n                    // the visitor must not have made any changes within this\n                    // FragmentDefinition node. This fragment definition may still be\n                    // removed if there are no ...spread references to it, but it won't be\n                    // removed just because it has only a __typename field.\n                    return node;\n                }\n                if (\n                // This logic applies only if the document contains one or more\n                // operations, since removing all fragments from a document containing\n                // only fragments makes the document useless.\n                operationCount > 0 &&\n                    node.selectionSet.selections.every(function (selection) {\n                        return selection.kind === Kind.FIELD &&\n                            selection.name.value === \"__typename\";\n                    })) {\n                    // This is a somewhat opinionated choice: if a FragmentDefinition ends\n                    // up having no fields other than __typename, we remove the whole\n                    // fragment definition, and later prune ...spread references to it.\n                    getInUseByFragmentName(node.name.value).removed = true;\n                    firstVisitMadeChanges = true;\n                    return null;\n                }\n            },\n        },\n        Directive: {\n            leave: function (node) {\n                // If a matching directive is found, remove the directive itself. Note\n                // that this does not remove the target (field, argument, etc) of the\n                // directive, but only the directive itself.\n                if (directiveMatcher(node)) {\n                    firstVisitMadeChanges = true;\n                    return null;\n                }\n            },\n        },\n    });\n    if (!firstVisitMadeChanges) {\n        // If our first pass did not change anything about the document, then there\n        // is no cleanup we need to do, and we can return the original doc.\n        return doc;\n    }\n    // Utility for making sure inUse.transitiveVars is recursively populated.\n    // Because this logic assumes inUse.fragmentSpreads has been completely\n    // populated and inUse.removed has been set if appropriate,\n    // populateTransitiveVars must be called after that information has been\n    // collected by the first traversal of the document.\n    var populateTransitiveVars = function (inUse) {\n        if (!inUse.transitiveVars) {\n            inUse.transitiveVars = new Set(inUse.variables);\n            if (!inUse.removed) {\n                inUse.fragmentSpreads.forEach(function (childFragmentName) {\n                    populateTransitiveVars(getInUseByFragmentName(childFragmentName)).transitiveVars.forEach(function (varName) {\n                        inUse.transitiveVars.add(varName);\n                    });\n                });\n            }\n        }\n        return inUse;\n    };\n    // Since we've been keeping track of fragment spreads used by particular\n    // operations and fragment definitions, we now need to compute the set of all\n    // spreads used (transitively) by any operations in the document.\n    var allFragmentNamesUsed = new Set();\n    docWithoutDirectiveSubtrees.definitions.forEach(function (def) {\n        if (def.kind === Kind.OPERATION_DEFINITION) {\n            populateTransitiveVars(getInUseByOperationName(def.name && def.name.value)).fragmentSpreads.forEach(function (childFragmentName) {\n                allFragmentNamesUsed.add(childFragmentName);\n            });\n        }\n        else if (def.kind === Kind.FRAGMENT_DEFINITION &&\n            // If there are no operations in the document, then all fragment\n            // definitions count as usages of their own fragment names. This heuristic\n            // prevents accidentally removing all fragment definitions from the\n            // document just because it contains no operations that use the fragments.\n            operationCount === 0 &&\n            !getInUseByFragmentName(def.name.value).removed) {\n            allFragmentNamesUsed.add(def.name.value);\n        }\n    });\n    // Now that we have added all fragment spreads used by operations to the\n    // allFragmentNamesUsed set, we can complete the set by transitively adding\n    // all fragment spreads used by those fragments, and so on.\n    allFragmentNamesUsed.forEach(function (fragmentName) {\n        // Once all the childFragmentName strings added here have been seen already,\n        // the top-level allFragmentNamesUsed.forEach loop will terminate.\n        populateTransitiveVars(getInUseByFragmentName(fragmentName)).fragmentSpreads.forEach(function (childFragmentName) {\n            allFragmentNamesUsed.add(childFragmentName);\n        });\n    });\n    var fragmentWillBeRemoved = function (fragmentName) {\n        return !!(\n        // A fragment definition will be removed if there are no spreads that refer\n        // to it, or the fragment was explicitly removed because it had no fields\n        // other than __typename.\n        (!allFragmentNamesUsed.has(fragmentName) ||\n            getInUseByFragmentName(fragmentName).removed));\n    };\n    var enterVisitor = {\n        enter: function (node) {\n            if (fragmentWillBeRemoved(node.name.value)) {\n                return null;\n            }\n        },\n    };\n    return nullIfDocIsEmpty(visit(docWithoutDirectiveSubtrees, {\n        // If the fragment is going to be removed, then leaving any dangling\n        // FragmentSpread nodes with the same name would be a mistake.\n        FragmentSpread: enterVisitor,\n        // This is where the fragment definition is actually removed.\n        FragmentDefinition: enterVisitor,\n        OperationDefinition: {\n            leave: function (node) {\n                // Upon leaving each operation in the depth-first AST traversal, prune\n                // any variables that are declared by the operation but unused within.\n                if (node.variableDefinitions) {\n                    var usedVariableNames_1 = populateTransitiveVars(\n                    // If an operation is anonymous, we use the empty string as its key.\n                    getInUseByOperationName(node.name && node.name.value)).transitiveVars;\n                    // According to the GraphQL spec, all variables declared by an\n                    // operation must either be used by that operation or used by some\n                    // fragment included transitively into that operation:\n                    // https://spec.graphql.org/draft/#sec-All-Variables-Used\n                    //\n                    // To stay on the right side of this validation rule, if/when we\n                    // remove the last $var references from an operation or its fragments,\n                    // we must also remove the corresponding $var declaration from the\n                    // enclosing operation. This pruning applies only to operations and\n                    // not fragment definitions, at the moment. Fragments may be able to\n                    // declare variables eventually, but today they can only consume them.\n                    if (usedVariableNames_1.size < node.variableDefinitions.length) {\n                        return __assign(__assign({}, node), { variableDefinitions: node.variableDefinitions.filter(function (varDef) {\n                                return usedVariableNames_1.has(varDef.variable.name.value);\n                            }) });\n                    }\n                }\n            },\n        },\n    }));\n}\nexport var addTypenameToDocument = Object.assign(function (doc) {\n    return visit(doc, {\n        SelectionSet: {\n            enter: function (node, _key, parent) {\n                // Don't add __typename to OperationDefinitions.\n                if (parent &&\n                    parent.kind ===\n                        Kind.OPERATION_DEFINITION) {\n                    return;\n                }\n                // No changes if no selections.\n                var selections = node.selections;\n                if (!selections) {\n                    return;\n                }\n                // If selections already have a __typename, or are part of an\n                // introspection query, do nothing.\n                var skip = selections.some(function (selection) {\n                    return (isField(selection) &&\n                        (selection.name.value === \"__typename\" ||\n                            selection.name.value.lastIndexOf(\"__\", 0) === 0));\n                });\n                if (skip) {\n                    return;\n                }\n                // If this SelectionSet is @export-ed as an input variable, it should\n                // not have a __typename field (see issue #4691).\n                var field = parent;\n                if (isField(field) &&\n                    field.directives &&\n                    field.directives.some(function (d) { return d.name.value === \"export\"; })) {\n                    return;\n                }\n                // Create and return a new SelectionSet with a __typename Field.\n                return __assign(__assign({}, node), { selections: __spreadArray(__spreadArray([], selections, true), [TYPENAME_FIELD], false) });\n            },\n        },\n    });\n}, {\n    added: function (field) {\n        return field === TYPENAME_FIELD;\n    },\n});\nvar connectionRemoveConfig = {\n    test: function (directive) {\n        var willRemove = directive.name.value === \"connection\";\n        if (willRemove) {\n            if (!directive.arguments ||\n                !directive.arguments.some(function (arg) { return arg.name.value === \"key\"; })) {\n                globalThis.__DEV__ !== false && invariant.warn(84);\n            }\n        }\n        return willRemove;\n    },\n};\nexport function removeConnectionDirectiveFromDocument(doc) {\n    return removeDirectivesFromDocument([connectionRemoveConfig], checkDocument(doc));\n}\nfunction hasDirectivesInSelectionSet(directives, selectionSet, nestedCheck) {\n    if (nestedCheck === void 0) { nestedCheck = true; }\n    return (!!selectionSet &&\n        selectionSet.selections &&\n        selectionSet.selections.some(function (selection) {\n            return hasDirectivesInSelection(directives, selection, nestedCheck);\n        }));\n}\nfunction hasDirectivesInSelection(directives, selection, nestedCheck) {\n    if (nestedCheck === void 0) { nestedCheck = true; }\n    if (!isField(selection)) {\n        return true;\n    }\n    if (!selection.directives) {\n        return false;\n    }\n    return (selection.directives.some(getDirectiveMatcher(directives)) ||\n        (nestedCheck &&\n            hasDirectivesInSelectionSet(directives, selection.selectionSet, nestedCheck)));\n}\nfunction getArgumentMatcher(config) {\n    return function argumentMatcher(argument) {\n        return config.some(function (aConfig) {\n            return argument.value &&\n                argument.value.kind === Kind.VARIABLE &&\n                argument.value.name &&\n                (aConfig.name === argument.value.name.value ||\n                    (aConfig.test && aConfig.test(argument)));\n        });\n    };\n}\nexport function removeArgumentsFromDocument(config, doc) {\n    var argMatcher = getArgumentMatcher(config);\n    return nullIfDocIsEmpty(visit(doc, {\n        OperationDefinition: {\n            enter: function (node) {\n                return __assign(__assign({}, node), { \n                    // Remove matching top level variables definitions.\n                    variableDefinitions: node.variableDefinitions ?\n                        node.variableDefinitions.filter(function (varDef) {\n                            return !config.some(function (arg) { return arg.name === varDef.variable.name.value; });\n                        })\n                        : [] });\n            },\n        },\n        Field: {\n            enter: function (node) {\n                // If `remove` is set to true for an argument, and an argument match\n                // is found for a field, remove the field as well.\n                var shouldRemoveField = config.some(function (argConfig) { return argConfig.remove; });\n                if (shouldRemoveField) {\n                    var argMatchCount_1 = 0;\n                    if (node.arguments) {\n                        node.arguments.forEach(function (arg) {\n                            if (argMatcher(arg)) {\n                                argMatchCount_1 += 1;\n                            }\n                        });\n                    }\n                    if (argMatchCount_1 === 1) {\n                        return null;\n                    }\n                }\n            },\n        },\n        Argument: {\n            enter: function (node) {\n                // Remove all matching arguments.\n                if (argMatcher(node)) {\n                    return null;\n                }\n            },\n        },\n    }));\n}\nexport function removeFragmentSpreadFromDocument(config, doc) {\n    function enter(node) {\n        if (config.some(function (def) { return def.name === node.name.value; })) {\n            return null;\n        }\n    }\n    return nullIfDocIsEmpty(visit(doc, {\n        FragmentSpread: { enter: enter },\n        FragmentDefinition: { enter: enter },\n    }));\n}\n// If the incoming document is a query, return it as is. Otherwise, build a\n// new document containing a query operation based on the selection set\n// of the previous main operation.\nexport function buildQueryFromSelectionSet(document) {\n    var definition = getMainDefinition(document);\n    var definitionOperation = definition.operation;\n    if (definitionOperation === \"query\") {\n        // Already a query, so return the existing document.\n        return document;\n    }\n    // Build a new query using the selection set of the main operation.\n    var modifiedDoc = visit(document, {\n        OperationDefinition: {\n            enter: function (node) {\n                return __assign(__assign({}, node), { operation: \"query\" });\n            },\n        },\n    });\n    return modifiedDoc;\n}\n// Remove fields / selection sets that include an @client directive.\nexport function removeClientSetsFromDocument(document) {\n    checkDocument(document);\n    var modifiedDoc = removeDirectivesFromDocument([\n        {\n            test: function (directive) { return directive.name.value === \"client\"; },\n            remove: true,\n        },\n    ], document);\n    return modifiedDoc;\n}\n//# sourceMappingURL=transform.js.map","export function iterateObserversSafely(observers, method, argument) {\n    // In case observers is modified during iteration, we need to commit to the\n    // original elements, which also provides an opportunity to filter them down\n    // to just the observers with the given method.\n    var observersWithMethod = [];\n    observers.forEach(function (obs) { return obs[method] && observersWithMethod.push(obs); });\n    observersWithMethod.forEach(function (obs) { return obs[method](argument); });\n}\n//# sourceMappingURL=iteration.js.map","import { Observable } from \"./Observable.js\";\nimport { canUseSymbol } from \"../common/canUse.js\";\n// Generic implementations of Observable.prototype methods like map and\n// filter need to know how to create a new Observable from an Observable\n// subclass (like Concast or ObservableQuery). Those methods assume\n// (perhaps unwisely?) that they can call the subtype's constructor with a\n// Subscriber function, even though the subclass constructor might expect\n// different parameters. Defining this static Symbol.species property on\n// the subclass is a hint to generic Observable code to use the default\n// constructor instead of trying to do `new Subclass(observer => ...)`.\nexport function fixObservableSubclass(subclass) {\n    function set(key) {\n        // Object.defineProperty is necessary because the Symbol.species\n        // property is a getter by default in modern JS environments, so we\n        // can't assign to it with a normal assignment expression.\n        Object.defineProperty(subclass, key, { value: Observable });\n    }\n    if (canUseSymbol && Symbol.species) {\n        set(Symbol.species);\n    }\n    // The \"@@species\" string is used as a fake Symbol.species value in some\n    // polyfill systems (including the SymbolSpecies variable used by\n    // zen-observable), so we should set it as well, to be safe.\n    set(\"@@species\");\n    return subclass;\n}\n//# sourceMappingURL=subclassing.js.map","// A [trie](https://en.wikipedia.org/wiki/Trie) data structure that holds\n// object keys weakly, yet can also hold non-object keys, unlike the\n// native `WeakMap`.\n// If no makeData function is supplied, the looked-up data will be an empty,\n// null-prototype Object.\nconst defaultMakeData = () => Object.create(null);\n// Useful for processing arguments objects as well as arrays.\nconst { forEach, slice } = Array.prototype;\nconst { hasOwnProperty } = Object.prototype;\nexport class Trie {\n    constructor(weakness = true, makeData = defaultMakeData) {\n        this.weakness = weakness;\n        this.makeData = makeData;\n    }\n    lookup() {\n        return this.lookupArray(arguments);\n    }\n    lookupArray(array) {\n        let node = this;\n        forEach.call(array, key => node = node.getChildTrie(key));\n        return hasOwnProperty.call(node, \"data\")\n            ? node.data\n            : node.data = this.makeData(slice.call(array));\n    }\n    peek() {\n        return this.peekArray(arguments);\n    }\n    peekArray(array) {\n        let node = this;\n        for (let i = 0, len = array.length; node && i < len; ++i) {\n            const map = node.mapFor(array[i], false);\n            node = map && map.get(array[i]);\n        }\n        return node && node.data;\n    }\n    remove() {\n        return this.removeArray(arguments);\n    }\n    removeArray(array) {\n        let data;\n        if (array.length) {\n            const head = array[0];\n            const map = this.mapFor(head, false);\n            const child = map && map.get(head);\n            if (child) {\n                data = child.removeArray(slice.call(array, 1));\n                if (!child.data && !child.weak && !(child.strong && child.strong.size)) {\n                    map.delete(head);\n                }\n            }\n        }\n        else {\n            data = this.data;\n            delete this.data;\n        }\n        return data;\n    }\n    getChildTrie(key) {\n        const map = this.mapFor(key, true);\n        let child = map.get(key);\n        if (!child)\n            map.set(key, child = new Trie(this.weakness, this.makeData));\n        return child;\n    }\n    mapFor(key, create) {\n        return this.weakness && isObjRef(key)\n            ? this.weak || (create ? this.weak = new WeakMap : void 0)\n            : this.strong || (create ? this.strong = new Map : void 0);\n    }\n}\nfunction isObjRef(value) {\n    switch (typeof value) {\n        case \"object\":\n            if (value === null)\n                break;\n        // Fall through to return true...\n        case \"function\":\n            return true;\n    }\n    return false;\n}\n//# sourceMappingURL=index.js.map","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\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) { _defineProperty(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 _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\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 _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _wrapNativeSuper(Class) { var _cache = typeof Map === \"function\" ? new Map() : undefined; _wrapNativeSuper = function _wrapNativeSuper(Class) { if (Class === null || !_isNativeFunction(Class)) return Class; if (typeof Class !== \"function\") { throw new TypeError(\"Super expression must either be null or a function\"); } if (typeof _cache !== \"undefined\") { if (_cache.has(Class)) return _cache.get(Class); _cache.set(Class, Wrapper); } function Wrapper() { return _construct(Class, arguments, _getPrototypeOf(this).constructor); } Wrapper.prototype = Object.create(Class.prototype, { constructor: { value: Wrapper, enumerable: false, writable: true, configurable: true } }); return _setPrototypeOf(Wrapper, Class); }; return _wrapNativeSuper(Class); }\n\nfunction _construct(Parent, args, Class) { if (_isNativeReflectConstruct()) { _construct = Reflect.construct; } else { _construct = function _construct(Parent, args, Class) { var a = [null]; a.push.apply(a, args); var Constructor = Function.bind.apply(Parent, a); var instance = new Constructor(); if (Class) _setPrototypeOf(instance, Class.prototype); return instance; }; } return _construct.apply(null, arguments); }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\nfunction _isNativeFunction(fn) { return Function.toString.call(fn).indexOf(\"[native code]\") !== -1; }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\nimport isObjectLike from \"../jsutils/isObjectLike.mjs\";\nimport { SYMBOL_TO_STRING_TAG } from \"../polyfills/symbols.mjs\";\nimport { getLocation } from \"../language/location.mjs\";\nimport { printLocation, printSourceLocation } from \"../language/printLocation.mjs\";\n/**\n * A GraphQLError describes an Error found during the parse, validate, or\n * execute phases of performing a GraphQL operation. In addition to a message\n * and stack trace, it also includes information about the locations in a\n * GraphQL document and/or execution result that correspond to the Error.\n */\n\nexport var GraphQLError = /*#__PURE__*/function (_Error) {\n  _inherits(GraphQLError, _Error);\n\n  var _super = _createSuper(GraphQLError);\n\n  /**\n   * An array of { line, column } locations within the source GraphQL document\n   * which correspond to this error.\n   *\n   * Errors during validation often contain multiple locations, for example to\n   * point out two things with the same name. Errors during execution include a\n   * single location, the field which produced the error.\n   *\n   * Enumerable, and appears in the result of JSON.stringify().\n   */\n\n  /**\n   * An array describing the JSON-path into the execution response which\n   * corresponds to this error. Only included for errors during execution.\n   *\n   * Enumerable, and appears in the result of JSON.stringify().\n   */\n\n  /**\n   * An array of GraphQL AST Nodes corresponding to this error.\n   */\n\n  /**\n   * The source GraphQL document for the first location of this error.\n   *\n   * Note that if this Error represents more than one node, the source may not\n   * represent nodes after the first node.\n   */\n\n  /**\n   * An array of character offsets within the source GraphQL document\n   * which correspond to this error.\n   */\n\n  /**\n   * The original error thrown from a field resolver during execution.\n   */\n\n  /**\n   * Extension fields to add to the formatted error.\n   */\n  function GraphQLError(message, nodes, source, positions, path, originalError, extensions) {\n    var _nodeLocations, _nodeLocations2, _nodeLocations3;\n\n    var _this;\n\n    _classCallCheck(this, GraphQLError);\n\n    _this = _super.call(this, message);\n    _this.name = 'GraphQLError';\n    _this.originalError = originalError !== null && originalError !== void 0 ? originalError : undefined; // Compute list of blame nodes.\n\n    _this.nodes = undefinedIfEmpty(Array.isArray(nodes) ? nodes : nodes ? [nodes] : undefined);\n    var nodeLocations = [];\n\n    for (var _i2 = 0, _ref3 = (_this$nodes = _this.nodes) !== null && _this$nodes !== void 0 ? _this$nodes : []; _i2 < _ref3.length; _i2++) {\n      var _this$nodes;\n\n      var _ref4 = _ref3[_i2];\n      var loc = _ref4.loc;\n\n      if (loc != null) {\n        nodeLocations.push(loc);\n      }\n    }\n\n    nodeLocations = undefinedIfEmpty(nodeLocations); // Compute locations in the source for the given nodes/positions.\n\n    _this.source = source !== null && source !== void 0 ? source : (_nodeLocations = nodeLocations) === null || _nodeLocations === void 0 ? void 0 : _nodeLocations[0].source;\n    _this.positions = positions !== null && positions !== void 0 ? positions : (_nodeLocations2 = nodeLocations) === null || _nodeLocations2 === void 0 ? void 0 : _nodeLocations2.map(function (loc) {\n      return loc.start;\n    });\n    _this.locations = positions && source ? positions.map(function (pos) {\n      return getLocation(source, pos);\n    }) : (_nodeLocations3 = nodeLocations) === null || _nodeLocations3 === void 0 ? void 0 : _nodeLocations3.map(function (loc) {\n      return getLocation(loc.source, loc.start);\n    });\n    _this.path = path !== null && path !== void 0 ? path : undefined;\n    var originalExtensions = originalError === null || originalError === void 0 ? void 0 : originalError.extensions;\n\n    if (extensions == null && isObjectLike(originalExtensions)) {\n      _this.extensions = _objectSpread({}, originalExtensions);\n    } else {\n      _this.extensions = extensions !== null && extensions !== void 0 ? extensions : {};\n    } // By being enumerable, JSON.stringify will include bellow properties in the resulting output.\n    // This ensures that the simplest possible GraphQL service adheres to the spec.\n\n\n    Object.defineProperties(_assertThisInitialized(_this), {\n      message: {\n        enumerable: true\n      },\n      locations: {\n        enumerable: _this.locations != null\n      },\n      path: {\n        enumerable: _this.path != null\n      },\n      extensions: {\n        enumerable: _this.extensions != null && Object.keys(_this.extensions).length > 0\n      },\n      name: {\n        enumerable: false\n      },\n      nodes: {\n        enumerable: false\n      },\n      source: {\n        enumerable: false\n      },\n      positions: {\n        enumerable: false\n      },\n      originalError: {\n        enumerable: false\n      }\n    }); // Include (non-enumerable) stack trace.\n\n    if (originalError !== null && originalError !== void 0 && originalError.stack) {\n      Object.defineProperty(_assertThisInitialized(_this), 'stack', {\n        value: originalError.stack,\n        writable: true,\n        configurable: true\n      });\n      return _possibleConstructorReturn(_this);\n    } // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2317')\n\n\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(_assertThisInitialized(_this), GraphQLError);\n    } else {\n      Object.defineProperty(_assertThisInitialized(_this), 'stack', {\n        value: Error().stack,\n        writable: true,\n        configurable: true\n      });\n    }\n\n    return _this;\n  }\n\n  _createClass(GraphQLError, [{\n    key: \"toString\",\n    value: function toString() {\n      return printError(this);\n    } // FIXME: workaround to not break chai comparisons, should be remove in v16\n    // $FlowFixMe[unsupported-syntax] Flow doesn't support computed properties yet\n\n  }, {\n    key: SYMBOL_TO_STRING_TAG,\n    get: function get() {\n      return 'Object';\n    }\n  }]);\n\n  return GraphQLError;\n}( /*#__PURE__*/_wrapNativeSuper(Error));\n\nfunction undefinedIfEmpty(array) {\n  return array === undefined || array.length === 0 ? undefined : array;\n}\n/**\n * Prints a GraphQLError to a string, representing useful location information\n * about the error's position in the source.\n */\n\n\nexport function printError(error) {\n  var output = error.message;\n\n  if (error.nodes) {\n    for (var _i4 = 0, _error$nodes2 = error.nodes; _i4 < _error$nodes2.length; _i4++) {\n      var node = _error$nodes2[_i4];\n\n      if (node.loc) {\n        output += '\\n\\n' + printLocation(node.loc);\n      }\n    }\n  } else if (error.source && error.locations) {\n    for (var _i6 = 0, _error$locations2 = error.locations; _i6 < _error$locations2.length; _i6++) {\n      var location = _error$locations2[_i6];\n      output += '\\n\\n' + printSourceLocation(error.source, location);\n    }\n  }\n\n  return output;\n}\n","import { GraphQLError } from \"./GraphQLError.mjs\";\n/**\n * Produces a GraphQLError representing a syntax error, containing useful\n * descriptive information about the syntax error's position in the source.\n */\n\nexport function syntaxError(source, position, description) {\n  return new GraphQLError(\"Syntax Error: \".concat(description), undefined, source, [position]);\n}\n","/**\n * Note: This file is autogenerated using \"resources/gen-version.js\" script and\n * automatically updated by \"npm version\" command.\n */\n\n/**\n * A string containing the version of the GraphQL.js library\n */\nexport var version = '15.8.0';\n/**\n * An object containing the components of the GraphQL.js version string\n */\n\nexport var versionInfo = Object.freeze({\n  major: 15,\n  minor: 8,\n  patch: 0,\n  preReleaseTag: null\n});\n","/**\n * Returns true if the value acts like a Promise, i.e. has a \"then\" function,\n * otherwise returns false.\n */\n// eslint-disable-next-line no-redeclare\nexport default function isPromise(value) {\n  return typeof (value === null || value === void 0 ? void 0 : value.then) === 'function';\n}\n","/* eslint-disable no-redeclare */\n// $FlowFixMe[name-already-bound]\nvar find = Array.prototype.find ? function (list, predicate) {\n  return Array.prototype.find.call(list, predicate);\n} : function (list, predicate) {\n  for (var _i2 = 0; _i2 < list.length; _i2++) {\n    var value = list[_i2];\n\n    if (predicate(value)) {\n      return value;\n    }\n  }\n};\nexport default find;\n","/* eslint-disable no-redeclare */\n// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441\nvar objectValues = Object.values || function (obj) {\n  return Object.keys(obj).map(function (key) {\n    return obj[key];\n  });\n};\n\nexport default objectValues;\n","import inspect from \"../jsutils/inspect.mjs\";\nimport { GraphQLError } from \"./GraphQLError.mjs\";\n/**\n * Given an arbitrary value, presumably thrown while attempting to execute a\n * GraphQL operation, produce a new GraphQLError aware of the location in the\n * document responsible for the original Error.\n */\n\nexport function locatedError(rawOriginalError, nodes, path) {\n  var _nodes;\n\n  // Sometimes a non-error is thrown, wrap it as an Error instance to ensure a consistent Error interface.\n  var originalError = rawOriginalError instanceof Error ? rawOriginalError : new Error('Unexpected error value: ' + inspect(rawOriginalError)); // Note: this uses a brand-check to support GraphQL errors originating from other contexts.\n\n  if (Array.isArray(originalError.path)) {\n    return originalError;\n  }\n\n  return new GraphQLError(originalError.message, (_nodes = originalError.nodes) !== null && _nodes !== void 0 ? _nodes : nodes, originalError.source, originalError.positions, path, originalError);\n}\n","import devAssert from \"../jsutils/devAssert.mjs\";\nimport { GraphQLError } from \"../error/GraphQLError.mjs\";\nvar NAME_RX = /^[_a-zA-Z][_a-zA-Z0-9]*$/;\n/**\n * Upholds the spec rules about naming.\n */\n\nexport function assertValidName(name) {\n  var error = isValidNameError(name);\n\n  if (error) {\n    throw error;\n  }\n\n  return name;\n}\n/**\n * Returns an Error if a name is invalid.\n */\n\nexport function isValidNameError(name) {\n  typeof name === 'string' || devAssert(0, 'Expected name to be a string.');\n\n  if (name.length > 1 && name[0] === '_' && name[1] === '_') {\n    return new GraphQLError(\"Name \\\"\".concat(name, \"\\\" must not begin with \\\"__\\\", which is reserved by GraphQL introspection.\"));\n  }\n\n  if (!NAME_RX.test(name)) {\n    return new GraphQLError(\"Names must match /^[_a-zA-Z][_a-zA-Z0-9]*$/ but \\\"\".concat(name, \"\\\" does not.\"));\n  }\n}\n","/* eslint-disable no-redeclare */\n// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441\nvar objectEntries = Object.entries || function (obj) {\n  return Object.keys(obj).map(function (key) {\n    return [key, obj[key]];\n  });\n};\n\nexport default objectEntries;\n","/**\n * Creates a keyed JS object from an array, given a function to produce the keys\n * for each value in the array.\n *\n * This provides a convenient lookup for the array items if the key function\n * produces unique results.\n *\n *     const phoneBook = [\n *       { name: 'Jon', num: '555-1234' },\n *       { name: 'Jenny', num: '867-5309' }\n *     ]\n *\n *     // { Jon: { name: 'Jon', num: '555-1234' },\n *     //   Jenny: { name: 'Jenny', num: '867-5309' } }\n *     const entriesByName = keyMap(\n *       phoneBook,\n *       entry => entry.name\n *     )\n *\n *     // { name: 'Jenny', num: '857-6309' }\n *     const jennyEntry = entriesByName['Jenny']\n *\n */\nexport default function keyMap(list, keyFn) {\n  return list.reduce(function (map, item) {\n    map[keyFn(item)] = item;\n    return map;\n  }, Object.create(null));\n}\n","import objectEntries from \"../polyfills/objectEntries.mjs\";\n\n/**\n * Creates an object map with the same keys as `map` and values generated by\n * running each value of `map` thru `fn`.\n */\nexport default function mapValue(map, fn) {\n  var result = Object.create(null);\n\n  for (var _i2 = 0, _objectEntries2 = objectEntries(map); _i2 < _objectEntries2.length; _i2++) {\n    var _ref2 = _objectEntries2[_i2];\n    var _key = _ref2[0];\n    var _value = _ref2[1];\n    result[_key] = fn(_value, _key);\n  }\n\n  return result;\n}\n","import objectEntries from \"../polyfills/objectEntries.mjs\";\nexport default function toObjMap(obj) {\n  /* eslint-enable no-redeclare */\n  if (Object.getPrototypeOf(obj) === null) {\n    return obj;\n  }\n\n  var map = Object.create(null);\n\n  for (var _i2 = 0, _objectEntries2 = objectEntries(obj); _i2 < _objectEntries2.length; _i2++) {\n    var _ref2 = _objectEntries2[_i2];\n    var key = _ref2[0];\n    var value = _ref2[1];\n    map[key] = value;\n  }\n\n  return map;\n}\n","/**\n * Creates a keyed JS object from an array, given a function to produce the keys\n * and a function to produce the values from each item in the array.\n *\n *     const phoneBook = [\n *       { name: 'Jon', num: '555-1234' },\n *       { name: 'Jenny', num: '867-5309' }\n *     ]\n *\n *     // { Jon: '555-1234', Jenny: '867-5309' }\n *     const phonesByName = keyValMap(\n *       phoneBook,\n *       entry => entry.name,\n *       entry => entry.num\n *     )\n *\n */\nexport default function keyValMap(list, keyFn, valFn) {\n  return list.reduce(function (map, item) {\n    map[keyFn(item)] = valFn(item);\n    return map;\n  }, Object.create(null));\n}\n","var MAX_SUGGESTIONS = 5;\n/**\n * Given [ A, B, C ] return ' Did you mean A, B, or C?'.\n */\n\n// eslint-disable-next-line no-redeclare\nexport default function didYouMean(firstArg, secondArg) {\n  var _ref = typeof firstArg === 'string' ? [firstArg, secondArg] : [undefined, firstArg],\n      subMessage = _ref[0],\n      suggestionsArg = _ref[1];\n\n  var message = ' Did you mean ';\n\n  if (subMessage) {\n    message += subMessage + ' ';\n  }\n\n  var suggestions = suggestionsArg.map(function (x) {\n    return \"\\\"\".concat(x, \"\\\"\");\n  });\n\n  switch (suggestions.length) {\n    case 0:\n      return '';\n\n    case 1:\n      return message + suggestions[0] + '?';\n\n    case 2:\n      return message + suggestions[0] + ' or ' + suggestions[1] + '?';\n  }\n\n  var selected = suggestions.slice(0, MAX_SUGGESTIONS);\n  var lastItem = selected.pop();\n  return message + selected.join(', ') + ', or ' + lastItem + '?';\n}\n","/**\n * Returns the first argument it receives.\n */\nexport default function identityFunc(x) {\n  return x;\n}\n","/**\n * Returns a number indicating whether a reference string comes before, or after,\n * or is the same as the given string in natural sort order.\n *\n * See: https://en.wikipedia.org/wiki/Natural_sort_order\n *\n */\nexport default function naturalCompare(aStr, bStr) {\n  var aIdx = 0;\n  var bIdx = 0;\n\n  while (aIdx < aStr.length && bIdx < bStr.length) {\n    var aChar = aStr.charCodeAt(aIdx);\n    var bChar = bStr.charCodeAt(bIdx);\n\n    if (isDigit(aChar) && isDigit(bChar)) {\n      var aNum = 0;\n\n      do {\n        ++aIdx;\n        aNum = aNum * 10 + aChar - DIGIT_0;\n        aChar = aStr.charCodeAt(aIdx);\n      } while (isDigit(aChar) && aNum > 0);\n\n      var bNum = 0;\n\n      do {\n        ++bIdx;\n        bNum = bNum * 10 + bChar - DIGIT_0;\n        bChar = bStr.charCodeAt(bIdx);\n      } while (isDigit(bChar) && bNum > 0);\n\n      if (aNum < bNum) {\n        return -1;\n      }\n\n      if (aNum > bNum) {\n        return 1;\n      }\n    } else {\n      if (aChar < bChar) {\n        return -1;\n      }\n\n      if (aChar > bChar) {\n        return 1;\n      }\n\n      ++aIdx;\n      ++bIdx;\n    }\n  }\n\n  return aStr.length - bStr.length;\n}\nvar DIGIT_0 = 48;\nvar DIGIT_9 = 57;\n\nfunction isDigit(code) {\n  return !isNaN(code) && DIGIT_0 <= code && code <= DIGIT_9;\n}\n","import naturalCompare from \"./naturalCompare.mjs\";\n/**\n * Given an invalid input string and a list of valid options, returns a filtered\n * list of valid options sorted based on their similarity with the input.\n */\n\nexport default function suggestionList(input, options) {\n  var optionsByDistance = Object.create(null);\n  var lexicalDistance = new LexicalDistance(input);\n  var threshold = Math.floor(input.length * 0.4) + 1;\n\n  for (var _i2 = 0; _i2 < options.length; _i2++) {\n    var option = options[_i2];\n    var distance = lexicalDistance.measure(option, threshold);\n\n    if (distance !== undefined) {\n      optionsByDistance[option] = distance;\n    }\n  }\n\n  return Object.keys(optionsByDistance).sort(function (a, b) {\n    var distanceDiff = optionsByDistance[a] - optionsByDistance[b];\n    return distanceDiff !== 0 ? distanceDiff : naturalCompare(a, b);\n  });\n}\n/**\n * Computes the lexical distance between strings A and B.\n *\n * The \"distance\" between two strings is given by counting the minimum number\n * of edits needed to transform string A into string B. An edit can be an\n * insertion, deletion, or substitution of a single character, or a swap of two\n * adjacent characters.\n *\n * Includes a custom alteration from Damerau-Levenshtein to treat case changes\n * as a single edit which helps identify mis-cased values with an edit distance\n * of 1.\n *\n * This distance can be useful for detecting typos in input or sorting\n */\n\nvar LexicalDistance = /*#__PURE__*/function () {\n  function LexicalDistance(input) {\n    this._input = input;\n    this._inputLowerCase = input.toLowerCase();\n    this._inputArray = stringToArray(this._inputLowerCase);\n    this._rows = [new Array(input.length + 1).fill(0), new Array(input.length + 1).fill(0), new Array(input.length + 1).fill(0)];\n  }\n\n  var _proto = LexicalDistance.prototype;\n\n  _proto.measure = function measure(option, threshold) {\n    if (this._input === option) {\n      return 0;\n    }\n\n    var optionLowerCase = option.toLowerCase(); // Any case change counts as a single edit\n\n    if (this._inputLowerCase === optionLowerCase) {\n      return 1;\n    }\n\n    var a = stringToArray(optionLowerCase);\n    var b = this._inputArray;\n\n    if (a.length < b.length) {\n      var tmp = a;\n      a = b;\n      b = tmp;\n    }\n\n    var aLength = a.length;\n    var bLength = b.length;\n\n    if (aLength - bLength > threshold) {\n      return undefined;\n    }\n\n    var rows = this._rows;\n\n    for (var j = 0; j <= bLength; j++) {\n      rows[0][j] = j;\n    }\n\n    for (var i = 1; i <= aLength; i++) {\n      var upRow = rows[(i - 1) % 3];\n      var currentRow = rows[i % 3];\n      var smallestCell = currentRow[0] = i;\n\n      for (var _j = 1; _j <= bLength; _j++) {\n        var cost = a[i - 1] === b[_j - 1] ? 0 : 1;\n        var currentCell = Math.min(upRow[_j] + 1, // delete\n        currentRow[_j - 1] + 1, // insert\n        upRow[_j - 1] + cost // substitute\n        );\n\n        if (i > 1 && _j > 1 && a[i - 1] === b[_j - 2] && a[i - 2] === b[_j - 1]) {\n          // transposition\n          var doubleDiagonalCell = rows[(i - 2) % 3][_j - 2];\n          currentCell = Math.min(currentCell, doubleDiagonalCell + 1);\n        }\n\n        if (currentCell < smallestCell) {\n          smallestCell = currentCell;\n        }\n\n        currentRow[_j] = currentCell;\n      } // Early exit, since distance can't go smaller than smallest element of the previous row.\n\n\n      if (smallestCell > threshold) {\n        return undefined;\n      }\n    }\n\n    var distance = rows[aLength % 3][bLength];\n    return distance <= threshold ? distance : undefined;\n  };\n\n  return LexicalDistance;\n}();\n\nfunction stringToArray(str) {\n  var strLength = str.length;\n  var array = new Array(strLength);\n\n  for (var i = 0; i < strLength; ++i) {\n    array[i] = str.charCodeAt(i);\n  }\n\n  return array;\n}\n","import inspect from \"../jsutils/inspect.mjs\";\nimport invariant from \"../jsutils/invariant.mjs\";\nimport keyValMap from \"../jsutils/keyValMap.mjs\";\nimport { Kind } from \"../language/kinds.mjs\";\n\n/**\n * Produces a JavaScript value given a GraphQL Value AST.\n *\n * Unlike `valueFromAST()`, no type is provided. The resulting JavaScript value\n * will reflect the provided GraphQL value AST.\n *\n * | GraphQL Value        | JavaScript Value |\n * | -------------------- | ---------------- |\n * | Input Object         | Object           |\n * | List                 | Array            |\n * | Boolean              | Boolean          |\n * | String / Enum        | String           |\n * | Int / Float          | Number           |\n * | Null                 | null             |\n *\n */\nexport function valueFromASTUntyped(valueNode, variables) {\n  switch (valueNode.kind) {\n    case Kind.NULL:\n      return null;\n\n    case Kind.INT:\n      return parseInt(valueNode.value, 10);\n\n    case Kind.FLOAT:\n      return parseFloat(valueNode.value);\n\n    case Kind.STRING:\n    case Kind.ENUM:\n    case Kind.BOOLEAN:\n      return valueNode.value;\n\n    case Kind.LIST:\n      return valueNode.values.map(function (node) {\n        return valueFromASTUntyped(node, variables);\n      });\n\n    case Kind.OBJECT:\n      return keyValMap(valueNode.fields, function (field) {\n        return field.name.value;\n      }, function (field) {\n        return valueFromASTUntyped(field.value, variables);\n      });\n\n    case Kind.VARIABLE:\n      return variables === null || variables === void 0 ? void 0 : variables[valueNode.name.value];\n  } // istanbul ignore next (Not reachable. All possible value nodes have been considered)\n\n\n  false || invariant(0, 'Unexpected value node: ' + inspect(valueNode));\n}\n","function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nimport objectEntries from \"../polyfills/objectEntries.mjs\";\nimport { SYMBOL_TO_STRING_TAG } from \"../polyfills/symbols.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport keyMap from \"../jsutils/keyMap.mjs\";\nimport mapValue from \"../jsutils/mapValue.mjs\";\nimport toObjMap from \"../jsutils/toObjMap.mjs\";\nimport devAssert from \"../jsutils/devAssert.mjs\";\nimport keyValMap from \"../jsutils/keyValMap.mjs\";\nimport instanceOf from \"../jsutils/instanceOf.mjs\";\nimport didYouMean from \"../jsutils/didYouMean.mjs\";\nimport isObjectLike from \"../jsutils/isObjectLike.mjs\";\nimport identityFunc from \"../jsutils/identityFunc.mjs\";\nimport defineInspect from \"../jsutils/defineInspect.mjs\";\nimport suggestionList from \"../jsutils/suggestionList.mjs\";\nimport { GraphQLError } from \"../error/GraphQLError.mjs\";\nimport { Kind } from \"../language/kinds.mjs\";\nimport { print } from \"../language/printer.mjs\";\nimport { valueFromASTUntyped } from \"../utilities/valueFromASTUntyped.mjs\";\nexport function isType(type) {\n  return isScalarType(type) || isObjectType(type) || isInterfaceType(type) || isUnionType(type) || isEnumType(type) || isInputObjectType(type) || isListType(type) || isNonNullType(type);\n}\nexport function assertType(type) {\n  if (!isType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL type.\"));\n  }\n\n  return type;\n}\n/**\n * There are predicates for each kind of GraphQL type.\n */\n\n// eslint-disable-next-line no-redeclare\nexport function isScalarType(type) {\n  return instanceOf(type, GraphQLScalarType);\n}\nexport function assertScalarType(type) {\n  if (!isScalarType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL Scalar type.\"));\n  }\n\n  return type;\n}\n// eslint-disable-next-line no-redeclare\nexport function isObjectType(type) {\n  return instanceOf(type, GraphQLObjectType);\n}\nexport function assertObjectType(type) {\n  if (!isObjectType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL Object type.\"));\n  }\n\n  return type;\n}\n// eslint-disable-next-line no-redeclare\nexport function isInterfaceType(type) {\n  return instanceOf(type, GraphQLInterfaceType);\n}\nexport function assertInterfaceType(type) {\n  if (!isInterfaceType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL Interface type.\"));\n  }\n\n  return type;\n}\n// eslint-disable-next-line no-redeclare\nexport function isUnionType(type) {\n  return instanceOf(type, GraphQLUnionType);\n}\nexport function assertUnionType(type) {\n  if (!isUnionType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL Union type.\"));\n  }\n\n  return type;\n}\n// eslint-disable-next-line no-redeclare\nexport function isEnumType(type) {\n  return instanceOf(type, GraphQLEnumType);\n}\nexport function assertEnumType(type) {\n  if (!isEnumType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL Enum type.\"));\n  }\n\n  return type;\n}\n// eslint-disable-next-line no-redeclare\nexport function isInputObjectType(type) {\n  return instanceOf(type, GraphQLInputObjectType);\n}\nexport function assertInputObjectType(type) {\n  if (!isInputObjectType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL Input Object type.\"));\n  }\n\n  return type;\n}\n// eslint-disable-next-line no-redeclare\nexport function isListType(type) {\n  return instanceOf(type, GraphQLList);\n}\nexport function assertListType(type) {\n  if (!isListType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL List type.\"));\n  }\n\n  return type;\n}\n// eslint-disable-next-line no-redeclare\nexport function isNonNullType(type) {\n  return instanceOf(type, GraphQLNonNull);\n}\nexport function assertNonNullType(type) {\n  if (!isNonNullType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL Non-Null type.\"));\n  }\n\n  return type;\n}\n/**\n * These types may be used as input types for arguments and directives.\n */\n\nexport function isInputType(type) {\n  return isScalarType(type) || isEnumType(type) || isInputObjectType(type) || isWrappingType(type) && isInputType(type.ofType);\n}\nexport function assertInputType(type) {\n  if (!isInputType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL input type.\"));\n  }\n\n  return type;\n}\n/**\n * These types may be used as output types as the result of fields.\n */\n\nexport function isOutputType(type) {\n  return isScalarType(type) || isObjectType(type) || isInterfaceType(type) || isUnionType(type) || isEnumType(type) || isWrappingType(type) && isOutputType(type.ofType);\n}\nexport function assertOutputType(type) {\n  if (!isOutputType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL output type.\"));\n  }\n\n  return type;\n}\n/**\n * These types may describe types which may be leaf values.\n */\n\nexport function isLeafType(type) {\n  return isScalarType(type) || isEnumType(type);\n}\nexport function assertLeafType(type) {\n  if (!isLeafType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL leaf type.\"));\n  }\n\n  return type;\n}\n/**\n * These types may describe the parent context of a selection set.\n */\n\nexport function isCompositeType(type) {\n  return isObjectType(type) || isInterfaceType(type) || isUnionType(type);\n}\nexport function assertCompositeType(type) {\n  if (!isCompositeType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL composite type.\"));\n  }\n\n  return type;\n}\n/**\n * These types may describe the parent context of a selection set.\n */\n\nexport function isAbstractType(type) {\n  return isInterfaceType(type) || isUnionType(type);\n}\nexport function assertAbstractType(type) {\n  if (!isAbstractType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL abstract type.\"));\n  }\n\n  return type;\n}\n/**\n * List Type Wrapper\n *\n * A list is a wrapping type which points to another type.\n * Lists are often created within the context of defining the fields of\n * an object type.\n *\n * Example:\n *\n *     const PersonType = new GraphQLObjectType({\n *       name: 'Person',\n *       fields: () => ({\n *         parents: { type: new GraphQLList(PersonType) },\n *         children: { type: new GraphQLList(PersonType) },\n *       })\n *     })\n *\n */\n// FIXME: workaround to fix issue with Babel parser\n\n/* ::\ndeclare class GraphQLList<+T: GraphQLType> {\n  +ofType: T;\n  static <T>(ofType: T): GraphQLList<T>;\n  // Note: constructors cannot be used for covariant types. Drop the \"new\".\n  constructor(ofType: GraphQLType): void;\n}\n*/\n\nexport function GraphQLList(ofType) {\n  // istanbul ignore else (to be removed in v16.0.0)\n  if (this instanceof GraphQLList) {\n    this.ofType = assertType(ofType);\n  } else {\n    return new GraphQLList(ofType);\n  }\n} // Need to cast through any to alter the prototype.\n\nGraphQLList.prototype.toString = function toString() {\n  return '[' + String(this.ofType) + ']';\n};\n\nGraphQLList.prototype.toJSON = function toJSON() {\n  return this.toString();\n};\n\nObject.defineProperty(GraphQLList.prototype, SYMBOL_TO_STRING_TAG, {\n  get: function get() {\n    return 'GraphQLList';\n  }\n}); // Print a simplified form when appearing in `inspect` and `util.inspect`.\n\ndefineInspect(GraphQLList);\n/**\n * Non-Null Type Wrapper\n *\n * A non-null is a wrapping type which points to another type.\n * Non-null types enforce that their values are never null and can ensure\n * an error is raised if this ever occurs during a request. It is useful for\n * fields which you can make a strong guarantee on non-nullability, for example\n * usually the id field of a database row will never be null.\n *\n * Example:\n *\n *     const RowType = new GraphQLObjectType({\n *       name: 'Row',\n *       fields: () => ({\n *         id: { type: new GraphQLNonNull(GraphQLString) },\n *       })\n *     })\n *\n * Note: the enforcement of non-nullability occurs within the executor.\n */\n// FIXME: workaround to fix issue with Babel parser\n\n/* ::\ndeclare class GraphQLNonNull<+T: GraphQLNullableType> {\n  +ofType: T;\n  static <T>(ofType: T): GraphQLNonNull<T>;\n  // Note: constructors cannot be used for covariant types. Drop the \"new\".\n  constructor(ofType: GraphQLType): void;\n}\n*/\n\nexport function GraphQLNonNull(ofType) {\n  // istanbul ignore else (to be removed in v16.0.0)\n  if (this instanceof GraphQLNonNull) {\n    this.ofType = assertNullableType(ofType);\n  } else {\n    return new GraphQLNonNull(ofType);\n  }\n} // Need to cast through any to alter the prototype.\n\nGraphQLNonNull.prototype.toString = function toString() {\n  return String(this.ofType) + '!';\n};\n\nGraphQLNonNull.prototype.toJSON = function toJSON() {\n  return this.toString();\n};\n\nObject.defineProperty(GraphQLNonNull.prototype, SYMBOL_TO_STRING_TAG, {\n  get: function get() {\n    return 'GraphQLNonNull';\n  }\n}); // Print a simplified form when appearing in `inspect` and `util.inspect`.\n\ndefineInspect(GraphQLNonNull);\n/**\n * These types wrap and modify other types\n */\n\nexport function isWrappingType(type) {\n  return isListType(type) || isNonNullType(type);\n}\nexport function assertWrappingType(type) {\n  if (!isWrappingType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL wrapping type.\"));\n  }\n\n  return type;\n}\n/**\n * These types can all accept null as a value.\n */\n\nexport function isNullableType(type) {\n  return isType(type) && !isNonNullType(type);\n}\nexport function assertNullableType(type) {\n  if (!isNullableType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL nullable type.\"));\n  }\n\n  return type;\n}\n/* eslint-disable no-redeclare */\n\nexport function getNullableType(type) {\n  /* eslint-enable no-redeclare */\n  if (type) {\n    return isNonNullType(type) ? type.ofType : type;\n  }\n}\n/**\n * These named types do not include modifiers like List or NonNull.\n */\n\nexport function isNamedType(type) {\n  return isScalarType(type) || isObjectType(type) || isInterfaceType(type) || isUnionType(type) || isEnumType(type) || isInputObjectType(type);\n}\nexport function assertNamedType(type) {\n  if (!isNamedType(type)) {\n    throw new Error(\"Expected \".concat(inspect(type), \" to be a GraphQL named type.\"));\n  }\n\n  return type;\n}\n/* eslint-disable no-redeclare */\n\nexport function getNamedType(type) {\n  /* eslint-enable no-redeclare */\n  if (type) {\n    var unwrappedType = type;\n\n    while (isWrappingType(unwrappedType)) {\n      unwrappedType = unwrappedType.ofType;\n    }\n\n    return unwrappedType;\n  }\n}\n/**\n * Used while defining GraphQL types to allow for circular references in\n * otherwise immutable type definitions.\n */\n\nfunction resolveThunk(thunk) {\n  // $FlowFixMe[incompatible-use]\n  return typeof thunk === 'function' ? thunk() : thunk;\n}\n\nfunction undefineIfEmpty(arr) {\n  return arr && arr.length > 0 ? arr : undefined;\n}\n/**\n * Scalar Type Definition\n *\n * The leaf values of any request and input values to arguments are\n * Scalars (or Enums) and are defined with a name and a series of functions\n * used to parse input from ast or variables and to ensure validity.\n *\n * If a type's serialize function does not return a value (i.e. it returns\n * `undefined`) then an error will be raised and a `null` value will be returned\n * in the response. If the serialize function returns `null`, then no error will\n * be included in the response.\n *\n * Example:\n *\n *     const OddType = new GraphQLScalarType({\n *       name: 'Odd',\n *       serialize(value) {\n *         if (value % 2 === 1) {\n *           return value;\n *         }\n *       }\n *     });\n *\n */\n\n\nexport var GraphQLScalarType = /*#__PURE__*/function () {\n  function GraphQLScalarType(config) {\n    var _config$parseValue, _config$serialize, _config$parseLiteral;\n\n    var parseValue = (_config$parseValue = config.parseValue) !== null && _config$parseValue !== void 0 ? _config$parseValue : identityFunc;\n    this.name = config.name;\n    this.description = config.description;\n    this.specifiedByUrl = config.specifiedByUrl;\n    this.serialize = (_config$serialize = config.serialize) !== null && _config$serialize !== void 0 ? _config$serialize : identityFunc;\n    this.parseValue = parseValue;\n    this.parseLiteral = (_config$parseLiteral = config.parseLiteral) !== null && _config$parseLiteral !== void 0 ? _config$parseLiteral : function (node, variables) {\n      return parseValue(valueFromASTUntyped(node, variables));\n    };\n    this.extensions = config.extensions && toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes = undefineIfEmpty(config.extensionASTNodes);\n    typeof config.name === 'string' || devAssert(0, 'Must provide name.');\n    config.specifiedByUrl == null || typeof config.specifiedByUrl === 'string' || devAssert(0, \"\".concat(this.name, \" must provide \\\"specifiedByUrl\\\" as a string, \") + \"but got: \".concat(inspect(config.specifiedByUrl), \".\"));\n    config.serialize == null || typeof config.serialize === 'function' || devAssert(0, \"\".concat(this.name, \" must provide \\\"serialize\\\" function. If this custom Scalar is also used as an input type, ensure \\\"parseValue\\\" and \\\"parseLiteral\\\" functions are also provided.\"));\n\n    if (config.parseLiteral) {\n      typeof config.parseValue === 'function' && typeof config.parseLiteral === 'function' || devAssert(0, \"\".concat(this.name, \" must provide both \\\"parseValue\\\" and \\\"parseLiteral\\\" functions.\"));\n    }\n  }\n\n  var _proto = GraphQLScalarType.prototype;\n\n  _proto.toConfig = function toConfig() {\n    var _this$extensionASTNod;\n\n    return {\n      name: this.name,\n      description: this.description,\n      specifiedByUrl: this.specifiedByUrl,\n      serialize: this.serialize,\n      parseValue: this.parseValue,\n      parseLiteral: this.parseLiteral,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: (_this$extensionASTNod = this.extensionASTNodes) !== null && _this$extensionASTNod !== void 0 ? _this$extensionASTNod : []\n    };\n  };\n\n  _proto.toString = function toString() {\n    return this.name;\n  };\n\n  _proto.toJSON = function toJSON() {\n    return this.toString();\n  } // $FlowFixMe[unsupported-syntax] Flow doesn't support computed properties yet\n  ;\n\n  _createClass(GraphQLScalarType, [{\n    key: SYMBOL_TO_STRING_TAG,\n    get: function get() {\n      return 'GraphQLScalarType';\n    }\n  }]);\n\n  return GraphQLScalarType;\n}(); // Print a simplified form when appearing in `inspect` and `util.inspect`.\n\ndefineInspect(GraphQLScalarType);\n\n/**\n * Object Type Definition\n *\n * Almost all of the GraphQL types you define will be object types. Object types\n * have a name, but most importantly describe their fields.\n *\n * Example:\n *\n *     const AddressType = new GraphQLObjectType({\n *       name: 'Address',\n *       fields: {\n *         street: { type: GraphQLString },\n *         number: { type: GraphQLInt },\n *         formatted: {\n *           type: GraphQLString,\n *           resolve(obj) {\n *             return obj.number + ' ' + obj.street\n *           }\n *         }\n *       }\n *     });\n *\n * When two types need to refer to each other, or a type needs to refer to\n * itself in a field, you can use a function expression (aka a closure or a\n * thunk) to supply the fields lazily.\n *\n * Example:\n *\n *     const PersonType = new GraphQLObjectType({\n *       name: 'Person',\n *       fields: () => ({\n *         name: { type: GraphQLString },\n *         bestFriend: { type: PersonType },\n *       })\n *     });\n *\n */\nexport var GraphQLObjectType = /*#__PURE__*/function () {\n  function GraphQLObjectType(config) {\n    this.name = config.name;\n    this.description = config.description;\n    this.isTypeOf = config.isTypeOf;\n    this.extensions = config.extensions && toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes = undefineIfEmpty(config.extensionASTNodes);\n    this._fields = defineFieldMap.bind(undefined, config);\n    this._interfaces = defineInterfaces.bind(undefined, config);\n    typeof config.name === 'string' || devAssert(0, 'Must provide name.');\n    config.isTypeOf == null || typeof config.isTypeOf === 'function' || devAssert(0, \"\".concat(this.name, \" must provide \\\"isTypeOf\\\" as a function, \") + \"but got: \".concat(inspect(config.isTypeOf), \".\"));\n  }\n\n  var _proto2 = GraphQLObjectType.prototype;\n\n  _proto2.getFields = function getFields() {\n    if (typeof this._fields === 'function') {\n      this._fields = this._fields();\n    }\n\n    return this._fields;\n  };\n\n  _proto2.getInterfaces = function getInterfaces() {\n    if (typeof this._interfaces === 'function') {\n      this._interfaces = this._interfaces();\n    }\n\n    return this._interfaces;\n  };\n\n  _proto2.toConfig = function toConfig() {\n    return {\n      name: this.name,\n      description: this.description,\n      interfaces: this.getInterfaces(),\n      fields: fieldsToFieldsConfig(this.getFields()),\n      isTypeOf: this.isTypeOf,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes || []\n    };\n  };\n\n  _proto2.toString = function toString() {\n    return this.name;\n  };\n\n  _proto2.toJSON = function toJSON() {\n    return this.toString();\n  } // $FlowFixMe[unsupported-syntax] Flow doesn't support computed properties yet\n  ;\n\n  _createClass(GraphQLObjectType, [{\n    key: SYMBOL_TO_STRING_TAG,\n    get: function get() {\n      return 'GraphQLObjectType';\n    }\n  }]);\n\n  return GraphQLObjectType;\n}(); // Print a simplified form when appearing in `inspect` and `util.inspect`.\n\ndefineInspect(GraphQLObjectType);\n\nfunction defineInterfaces(config) {\n  var _resolveThunk;\n\n  var interfaces = (_resolveThunk = resolveThunk(config.interfaces)) !== null && _resolveThunk !== void 0 ? _resolveThunk : [];\n  Array.isArray(interfaces) || devAssert(0, \"\".concat(config.name, \" interfaces must be an Array or a function which returns an Array.\"));\n  return interfaces;\n}\n\nfunction defineFieldMap(config) {\n  var fieldMap = resolveThunk(config.fields);\n  isPlainObj(fieldMap) || devAssert(0, \"\".concat(config.name, \" fields must be an object with field names as keys or a function which returns such an object.\"));\n  return mapValue(fieldMap, function (fieldConfig, fieldName) {\n    var _fieldConfig$args;\n\n    isPlainObj(fieldConfig) || devAssert(0, \"\".concat(config.name, \".\").concat(fieldName, \" field config must be an object.\"));\n    !('isDeprecated' in fieldConfig) || devAssert(0, \"\".concat(config.name, \".\").concat(fieldName, \" should provide \\\"deprecationReason\\\" instead of \\\"isDeprecated\\\".\"));\n    fieldConfig.resolve == null || typeof fieldConfig.resolve === 'function' || devAssert(0, \"\".concat(config.name, \".\").concat(fieldName, \" field resolver must be a function if \") + \"provided, but got: \".concat(inspect(fieldConfig.resolve), \".\"));\n    var argsConfig = (_fieldConfig$args = fieldConfig.args) !== null && _fieldConfig$args !== void 0 ? _fieldConfig$args : {};\n    isPlainObj(argsConfig) || devAssert(0, \"\".concat(config.name, \".\").concat(fieldName, \" args must be an object with argument names as keys.\"));\n    var args = objectEntries(argsConfig).map(function (_ref) {\n      var argName = _ref[0],\n          argConfig = _ref[1];\n      return {\n        name: argName,\n        description: argConfig.description,\n        type: argConfig.type,\n        defaultValue: argConfig.defaultValue,\n        deprecationReason: argConfig.deprecationReason,\n        extensions: argConfig.extensions && toObjMap(argConfig.extensions),\n        astNode: argConfig.astNode\n      };\n    });\n    return {\n      name: fieldName,\n      description: fieldConfig.description,\n      type: fieldConfig.type,\n      args: args,\n      resolve: fieldConfig.resolve,\n      subscribe: fieldConfig.subscribe,\n      isDeprecated: fieldConfig.deprecationReason != null,\n      deprecationReason: fieldConfig.deprecationReason,\n      extensions: fieldConfig.extensions && toObjMap(fieldConfig.extensions),\n      astNode: fieldConfig.astNode\n    };\n  });\n}\n\nfunction isPlainObj(obj) {\n  return isObjectLike(obj) && !Array.isArray(obj);\n}\n\nfunction fieldsToFieldsConfig(fields) {\n  return mapValue(fields, function (field) {\n    return {\n      description: field.description,\n      type: field.type,\n      args: argsToArgsConfig(field.args),\n      resolve: field.resolve,\n      subscribe: field.subscribe,\n      deprecationReason: field.deprecationReason,\n      extensions: field.extensions,\n      astNode: field.astNode\n    };\n  });\n}\n/**\n * @internal\n */\n\n\nexport function argsToArgsConfig(args) {\n  return keyValMap(args, function (arg) {\n    return arg.name;\n  }, function (arg) {\n    return {\n      description: arg.description,\n      type: arg.type,\n      defaultValue: arg.defaultValue,\n      deprecationReason: arg.deprecationReason,\n      extensions: arg.extensions,\n      astNode: arg.astNode\n    };\n  });\n}\nexport function isRequiredArgument(arg) {\n  return isNonNullType(arg.type) && arg.defaultValue === undefined;\n}\n\n/**\n * Interface Type Definition\n *\n * When a field can return one of a heterogeneous set of types, a Interface type\n * is used to describe what types are possible, what fields are in common across\n * all types, as well as a function to determine which type is actually used\n * when the field is resolved.\n *\n * Example:\n *\n *     const EntityType = new GraphQLInterfaceType({\n *       name: 'Entity',\n *       fields: {\n *         name: { type: GraphQLString }\n *       }\n *     });\n *\n */\nexport var GraphQLInterfaceType = /*#__PURE__*/function () {\n  function GraphQLInterfaceType(config) {\n    this.name = config.name;\n    this.description = config.description;\n    this.resolveType = config.resolveType;\n    this.extensions = config.extensions && toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes = undefineIfEmpty(config.extensionASTNodes);\n    this._fields = defineFieldMap.bind(undefined, config);\n    this._interfaces = defineInterfaces.bind(undefined, config);\n    typeof config.name === 'string' || devAssert(0, 'Must provide name.');\n    config.resolveType == null || typeof config.resolveType === 'function' || devAssert(0, \"\".concat(this.name, \" must provide \\\"resolveType\\\" as a function, \") + \"but got: \".concat(inspect(config.resolveType), \".\"));\n  }\n\n  var _proto3 = GraphQLInterfaceType.prototype;\n\n  _proto3.getFields = function getFields() {\n    if (typeof this._fields === 'function') {\n      this._fields = this._fields();\n    }\n\n    return this._fields;\n  };\n\n  _proto3.getInterfaces = function getInterfaces() {\n    if (typeof this._interfaces === 'function') {\n      this._interfaces = this._interfaces();\n    }\n\n    return this._interfaces;\n  };\n\n  _proto3.toConfig = function toConfig() {\n    var _this$extensionASTNod2;\n\n    return {\n      name: this.name,\n      description: this.description,\n      interfaces: this.getInterfaces(),\n      fields: fieldsToFieldsConfig(this.getFields()),\n      resolveType: this.resolveType,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: (_this$extensionASTNod2 = this.extensionASTNodes) !== null && _this$extensionASTNod2 !== void 0 ? _this$extensionASTNod2 : []\n    };\n  };\n\n  _proto3.toString = function toString() {\n    return this.name;\n  };\n\n  _proto3.toJSON = function toJSON() {\n    return this.toString();\n  } // $FlowFixMe[unsupported-syntax] Flow doesn't support computed properties yet\n  ;\n\n  _createClass(GraphQLInterfaceType, [{\n    key: SYMBOL_TO_STRING_TAG,\n    get: function get() {\n      return 'GraphQLInterfaceType';\n    }\n  }]);\n\n  return GraphQLInterfaceType;\n}(); // Print a simplified form when appearing in `inspect` and `util.inspect`.\n\ndefineInspect(GraphQLInterfaceType);\n\n/**\n * Union Type Definition\n *\n * When a field can return one of a heterogeneous set of types, a Union type\n * is used to describe what types are possible as well as providing a function\n * to determine which type is actually used when the field is resolved.\n *\n * Example:\n *\n *     const PetType = new GraphQLUnionType({\n *       name: 'Pet',\n *       types: [ DogType, CatType ],\n *       resolveType(value) {\n *         if (value instanceof Dog) {\n *           return DogType;\n *         }\n *         if (value instanceof Cat) {\n *           return CatType;\n *         }\n *       }\n *     });\n *\n */\nexport var GraphQLUnionType = /*#__PURE__*/function () {\n  function GraphQLUnionType(config) {\n    this.name = config.name;\n    this.description = config.description;\n    this.resolveType = config.resolveType;\n    this.extensions = config.extensions && toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes = undefineIfEmpty(config.extensionASTNodes);\n    this._types = defineTypes.bind(undefined, config);\n    typeof config.name === 'string' || devAssert(0, 'Must provide name.');\n    config.resolveType == null || typeof config.resolveType === 'function' || devAssert(0, \"\".concat(this.name, \" must provide \\\"resolveType\\\" as a function, \") + \"but got: \".concat(inspect(config.resolveType), \".\"));\n  }\n\n  var _proto4 = GraphQLUnionType.prototype;\n\n  _proto4.getTypes = function getTypes() {\n    if (typeof this._types === 'function') {\n      this._types = this._types();\n    }\n\n    return this._types;\n  };\n\n  _proto4.toConfig = function toConfig() {\n    var _this$extensionASTNod3;\n\n    return {\n      name: this.name,\n      description: this.description,\n      types: this.getTypes(),\n      resolveType: this.resolveType,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: (_this$extensionASTNod3 = this.extensionASTNodes) !== null && _this$extensionASTNod3 !== void 0 ? _this$extensionASTNod3 : []\n    };\n  };\n\n  _proto4.toString = function toString() {\n    return this.name;\n  };\n\n  _proto4.toJSON = function toJSON() {\n    return this.toString();\n  } // $FlowFixMe[unsupported-syntax] Flow doesn't support computed properties yet\n  ;\n\n  _createClass(GraphQLUnionType, [{\n    key: SYMBOL_TO_STRING_TAG,\n    get: function get() {\n      return 'GraphQLUnionType';\n    }\n  }]);\n\n  return GraphQLUnionType;\n}(); // Print a simplified form when appearing in `inspect` and `util.inspect`.\n\ndefineInspect(GraphQLUnionType);\n\nfunction defineTypes(config) {\n  var types = resolveThunk(config.types);\n  Array.isArray(types) || devAssert(0, \"Must provide Array of types or a function which returns such an array for Union \".concat(config.name, \".\"));\n  return types;\n}\n\n/**\n * Enum Type Definition\n *\n * Some leaf values of requests and input values are Enums. GraphQL serializes\n * Enum values as strings, however internally Enums can be represented by any\n * kind of type, often integers.\n *\n * Example:\n *\n *     const RGBType = new GraphQLEnumType({\n *       name: 'RGB',\n *       values: {\n *         RED: { value: 0 },\n *         GREEN: { value: 1 },\n *         BLUE: { value: 2 }\n *       }\n *     });\n *\n * Note: If a value is not provided in a definition, the name of the enum value\n * will be used as its internal value.\n */\nexport var GraphQLEnumType\n/* <T> */\n= /*#__PURE__*/function () {\n  function GraphQLEnumType(config) {\n    this.name = config.name;\n    this.description = config.description;\n    this.extensions = config.extensions && toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes = undefineIfEmpty(config.extensionASTNodes);\n    this._values = defineEnumValues(this.name, config.values);\n    this._valueLookup = new Map(this._values.map(function (enumValue) {\n      return [enumValue.value, enumValue];\n    }));\n    this._nameLookup = keyMap(this._values, function (value) {\n      return value.name;\n    });\n    typeof config.name === 'string' || devAssert(0, 'Must provide name.');\n  }\n\n  var _proto5 = GraphQLEnumType.prototype;\n\n  _proto5.getValues = function getValues() {\n    return this._values;\n  };\n\n  _proto5.getValue = function getValue(name) {\n    return this._nameLookup[name];\n  };\n\n  _proto5.serialize = function serialize(outputValue) {\n    var enumValue = this._valueLookup.get(outputValue);\n\n    if (enumValue === undefined) {\n      throw new GraphQLError(\"Enum \\\"\".concat(this.name, \"\\\" cannot represent value: \").concat(inspect(outputValue)));\n    }\n\n    return enumValue.name;\n  };\n\n  _proto5.parseValue = function parseValue(inputValue)\n  /* T */\n  {\n    if (typeof inputValue !== 'string') {\n      var valueStr = inspect(inputValue);\n      throw new GraphQLError(\"Enum \\\"\".concat(this.name, \"\\\" cannot represent non-string value: \").concat(valueStr, \".\") + didYouMeanEnumValue(this, valueStr));\n    }\n\n    var enumValue = this.getValue(inputValue);\n\n    if (enumValue == null) {\n      throw new GraphQLError(\"Value \\\"\".concat(inputValue, \"\\\" does not exist in \\\"\").concat(this.name, \"\\\" enum.\") + didYouMeanEnumValue(this, inputValue));\n    }\n\n    return enumValue.value;\n  };\n\n  _proto5.parseLiteral = function parseLiteral(valueNode, _variables)\n  /* T */\n  {\n    // Note: variables will be resolved to a value before calling this function.\n    if (valueNode.kind !== Kind.ENUM) {\n      var valueStr = print(valueNode);\n      throw new GraphQLError(\"Enum \\\"\".concat(this.name, \"\\\" cannot represent non-enum value: \").concat(valueStr, \".\") + didYouMeanEnumValue(this, valueStr), valueNode);\n    }\n\n    var enumValue = this.getValue(valueNode.value);\n\n    if (enumValue == null) {\n      var _valueStr = print(valueNode);\n\n      throw new GraphQLError(\"Value \\\"\".concat(_valueStr, \"\\\" does not exist in \\\"\").concat(this.name, \"\\\" enum.\") + didYouMeanEnumValue(this, _valueStr), valueNode);\n    }\n\n    return enumValue.value;\n  };\n\n  _proto5.toConfig = function toConfig() {\n    var _this$extensionASTNod4;\n\n    var values = keyValMap(this.getValues(), function (value) {\n      return value.name;\n    }, function (value) {\n      return {\n        description: value.description,\n        value: value.value,\n        deprecationReason: value.deprecationReason,\n        extensions: value.extensions,\n        astNode: value.astNode\n      };\n    });\n    return {\n      name: this.name,\n      description: this.description,\n      values: values,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: (_this$extensionASTNod4 = this.extensionASTNodes) !== null && _this$extensionASTNod4 !== void 0 ? _this$extensionASTNod4 : []\n    };\n  };\n\n  _proto5.toString = function toString() {\n    return this.name;\n  };\n\n  _proto5.toJSON = function toJSON() {\n    return this.toString();\n  } // $FlowFixMe[unsupported-syntax] Flow doesn't support computed properties yet\n  ;\n\n  _createClass(GraphQLEnumType, [{\n    key: SYMBOL_TO_STRING_TAG,\n    get: function get() {\n      return 'GraphQLEnumType';\n    }\n  }]);\n\n  return GraphQLEnumType;\n}(); // Print a simplified form when appearing in `inspect` and `util.inspect`.\n\ndefineInspect(GraphQLEnumType);\n\nfunction didYouMeanEnumValue(enumType, unknownValueStr) {\n  var allNames = enumType.getValues().map(function (value) {\n    return value.name;\n  });\n  var suggestedValues = suggestionList(unknownValueStr, allNames);\n  return didYouMean('the enum value', suggestedValues);\n}\n\nfunction defineEnumValues(typeName, valueMap) {\n  isPlainObj(valueMap) || devAssert(0, \"\".concat(typeName, \" values must be an object with value names as keys.\"));\n  return objectEntries(valueMap).map(function (_ref2) {\n    var valueName = _ref2[0],\n        valueConfig = _ref2[1];\n    isPlainObj(valueConfig) || devAssert(0, \"\".concat(typeName, \".\").concat(valueName, \" must refer to an object with a \\\"value\\\" key \") + \"representing an internal value but got: \".concat(inspect(valueConfig), \".\"));\n    !('isDeprecated' in valueConfig) || devAssert(0, \"\".concat(typeName, \".\").concat(valueName, \" should provide \\\"deprecationReason\\\" instead of \\\"isDeprecated\\\".\"));\n    return {\n      name: valueName,\n      description: valueConfig.description,\n      value: valueConfig.value !== undefined ? valueConfig.value : valueName,\n      isDeprecated: valueConfig.deprecationReason != null,\n      deprecationReason: valueConfig.deprecationReason,\n      extensions: valueConfig.extensions && toObjMap(valueConfig.extensions),\n      astNode: valueConfig.astNode\n    };\n  });\n}\n\n/**\n * Input Object Type Definition\n *\n * An input object defines a structured collection of fields which may be\n * supplied to a field argument.\n *\n * Using `NonNull` will ensure that a value must be provided by the query\n *\n * Example:\n *\n *     const GeoPoint = new GraphQLInputObjectType({\n *       name: 'GeoPoint',\n *       fields: {\n *         lat: { type: new GraphQLNonNull(GraphQLFloat) },\n *         lon: { type: new GraphQLNonNull(GraphQLFloat) },\n *         alt: { type: GraphQLFloat, defaultValue: 0 },\n *       }\n *     });\n *\n */\nexport var GraphQLInputObjectType = /*#__PURE__*/function () {\n  function GraphQLInputObjectType(config) {\n    this.name = config.name;\n    this.description = config.description;\n    this.extensions = config.extensions && toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes = undefineIfEmpty(config.extensionASTNodes);\n    this._fields = defineInputFieldMap.bind(undefined, config);\n    typeof config.name === 'string' || devAssert(0, 'Must provide name.');\n  }\n\n  var _proto6 = GraphQLInputObjectType.prototype;\n\n  _proto6.getFields = function getFields() {\n    if (typeof this._fields === 'function') {\n      this._fields = this._fields();\n    }\n\n    return this._fields;\n  };\n\n  _proto6.toConfig = function toConfig() {\n    var _this$extensionASTNod5;\n\n    var fields = mapValue(this.getFields(), function (field) {\n      return {\n        description: field.description,\n        type: field.type,\n        defaultValue: field.defaultValue,\n        deprecationReason: field.deprecationReason,\n        extensions: field.extensions,\n        astNode: field.astNode\n      };\n    });\n    return {\n      name: this.name,\n      description: this.description,\n      fields: fields,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: (_this$extensionASTNod5 = this.extensionASTNodes) !== null && _this$extensionASTNod5 !== void 0 ? _this$extensionASTNod5 : []\n    };\n  };\n\n  _proto6.toString = function toString() {\n    return this.name;\n  };\n\n  _proto6.toJSON = function toJSON() {\n    return this.toString();\n  } // $FlowFixMe[unsupported-syntax] Flow doesn't support computed properties yet\n  ;\n\n  _createClass(GraphQLInputObjectType, [{\n    key: SYMBOL_TO_STRING_TAG,\n    get: function get() {\n      return 'GraphQLInputObjectType';\n    }\n  }]);\n\n  return GraphQLInputObjectType;\n}(); // Print a simplified form when appearing in `inspect` and `util.inspect`.\n\ndefineInspect(GraphQLInputObjectType);\n\nfunction defineInputFieldMap(config) {\n  var fieldMap = resolveThunk(config.fields);\n  isPlainObj(fieldMap) || devAssert(0, \"\".concat(config.name, \" fields must be an object with field names as keys or a function which returns such an object.\"));\n  return mapValue(fieldMap, function (fieldConfig, fieldName) {\n    !('resolve' in fieldConfig) || devAssert(0, \"\".concat(config.name, \".\").concat(fieldName, \" field has a resolve property, but Input Types cannot define resolvers.\"));\n    return {\n      name: fieldName,\n      description: fieldConfig.description,\n      type: fieldConfig.type,\n      defaultValue: fieldConfig.defaultValue,\n      deprecationReason: fieldConfig.deprecationReason,\n      extensions: fieldConfig.extensions && toObjMap(fieldConfig.extensions),\n      astNode: fieldConfig.astNode\n    };\n  });\n}\n\nexport function isRequiredInputField(field) {\n  return isNonNullType(field.type) && field.defaultValue === undefined;\n}\n","import { isInterfaceType, isObjectType, isListType, isNonNullType, isAbstractType } from \"../type/definition.mjs\";\n/**\n * Provided two types, return true if the types are equal (invariant).\n */\n\nexport function isEqualType(typeA, typeB) {\n  // Equivalent types are equal.\n  if (typeA === typeB) {\n    return true;\n  } // If either type is non-null, the other must also be non-null.\n\n\n  if (isNonNullType(typeA) && isNonNullType(typeB)) {\n    return isEqualType(typeA.ofType, typeB.ofType);\n  } // If either type is a list, the other must also be a list.\n\n\n  if (isListType(typeA) && isListType(typeB)) {\n    return isEqualType(typeA.ofType, typeB.ofType);\n  } // Otherwise the types are not equal.\n\n\n  return false;\n}\n/**\n * Provided a type and a super type, return true if the first type is either\n * equal or a subset of the second super type (covariant).\n */\n\nexport function isTypeSubTypeOf(schema, maybeSubType, superType) {\n  // Equivalent type is a valid subtype\n  if (maybeSubType === superType) {\n    return true;\n  } // If superType is non-null, maybeSubType must also be non-null.\n\n\n  if (isNonNullType(superType)) {\n    if (isNonNullType(maybeSubType)) {\n      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);\n    }\n\n    return false;\n  }\n\n  if (isNonNullType(maybeSubType)) {\n    // If superType is nullable, maybeSubType may be non-null or nullable.\n    return isTypeSubTypeOf(schema, maybeSubType.ofType, superType);\n  } // If superType type is a list, maybeSubType type must also be a list.\n\n\n  if (isListType(superType)) {\n    if (isListType(maybeSubType)) {\n      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);\n    }\n\n    return false;\n  }\n\n  if (isListType(maybeSubType)) {\n    // If superType is not a list, maybeSubType must also be not a list.\n    return false;\n  } // If superType type is an abstract type, check if it is super type of maybeSubType.\n  // Otherwise, the child type is not a valid subtype of the parent type.\n\n\n  return isAbstractType(superType) && (isInterfaceType(maybeSubType) || isObjectType(maybeSubType)) && schema.isSubType(superType, maybeSubType);\n}\n/**\n * Provided two composite types, determine if they \"overlap\". Two composite\n * types overlap when the Sets of possible concrete types for each intersect.\n *\n * This is often used to determine if a fragment of a given type could possibly\n * be visited in a context of another type.\n *\n * This function is commutative.\n */\n\nexport function doTypesOverlap(schema, typeA, typeB) {\n  // Equivalent types overlap\n  if (typeA === typeB) {\n    return true;\n  }\n\n  if (isAbstractType(typeA)) {\n    if (isAbstractType(typeB)) {\n      // If both types are abstract, then determine if there is any intersection\n      // between possible concrete types of each.\n      return schema.getPossibleTypes(typeA).some(function (type) {\n        return schema.isSubType(typeB, type);\n      });\n    } // Determine if the latter type is a possible concrete type of the former.\n\n\n    return schema.isSubType(typeA, typeB);\n  }\n\n  if (isAbstractType(typeB)) {\n    // Determine if the former type is a possible concrete type of the latter.\n    return schema.isSubType(typeB, typeA);\n  } // Otherwise the types do not overlap.\n\n\n  return false;\n}\n","import { SYMBOL_ITERATOR } from \"./symbols.mjs\";\n\n/* eslint-disable no-redeclare */\n// $FlowFixMe[name-already-bound]\nvar arrayFrom = Array.from || function (obj, mapFn, thisArg) {\n  if (obj == null) {\n    throw new TypeError('Array.from requires an array-like object - not null or undefined');\n  } // Is Iterable?\n\n\n  var iteratorMethod = obj[SYMBOL_ITERATOR];\n\n  if (typeof iteratorMethod === 'function') {\n    var iterator = iteratorMethod.call(obj);\n    var result = [];\n    var step;\n\n    for (var i = 0; !(step = iterator.next()).done; ++i) {\n      result.push(mapFn.call(thisArg, step.value, i)); // Infinite Iterators could cause forEach to run forever.\n      // After a very large number of iterations, produce an error.\n      // istanbul ignore if (Too big to actually test)\n\n      if (i > 9999999) {\n        throw new TypeError('Near-infinite iteration.');\n      }\n    }\n\n    return result;\n  } // Is Array like?\n\n\n  var length = obj.length;\n\n  if (typeof length === 'number' && length >= 0 && length % 1 === 0) {\n    var _result = [];\n\n    for (var _i = 0; _i < length; ++_i) {\n      if (Object.prototype.hasOwnProperty.call(obj, _i)) {\n        _result.push(mapFn.call(thisArg, obj[_i], _i));\n      }\n    }\n\n    return _result;\n  }\n\n  return [];\n};\n\nexport default arrayFrom;\n","/* eslint-disable no-redeclare */\n// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441\nvar isFinitePolyfill = Number.isFinite || function (value) {\n  return typeof value === 'number' && isFinite(value);\n};\n\nexport default isFinitePolyfill;\n","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nimport { SYMBOL_ITERATOR } from \"../polyfills/symbols.mjs\";\n/**\n * Safer version of `Array.from` that return `null` if value isn't convertible to array.\n * Also protects against Array-like objects without items.\n *\n * @example\n *\n * safeArrayFrom([ 1, 2, 3 ]) // [1, 2, 3]\n * safeArrayFrom('ABC') // null\n * safeArrayFrom({ length: 1 }) // null\n * safeArrayFrom({ length: 1, 0: 'Alpha' }) // ['Alpha']\n * safeArrayFrom({ key: 'value' }) // null\n * safeArrayFrom(new Map()) // []\n *\n */\n\nexport default function safeArrayFrom(collection) {\n  var mapFn = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : function (item) {\n    return item;\n  };\n\n  if (collection == null || _typeof(collection) !== 'object') {\n    return null;\n  }\n\n  if (Array.isArray(collection)) {\n    return collection.map(mapFn);\n  } // Is Iterable?\n\n\n  var iteratorMethod = collection[SYMBOL_ITERATOR];\n\n  if (typeof iteratorMethod === 'function') {\n    // $FlowFixMe[incompatible-use]\n    var iterator = iteratorMethod.call(collection);\n    var result = [];\n    var step;\n\n    for (var i = 0; !(step = iterator.next()).done; ++i) {\n      result.push(mapFn(step.value, i));\n    }\n\n    return result;\n  } // Is Array like?\n\n\n  var length = collection.length;\n\n  if (typeof length === 'number' && length >= 0 && length % 1 === 0) {\n    var _result = [];\n\n    for (var _i = 0; _i < length; ++_i) {\n      if (!Object.prototype.hasOwnProperty.call(collection, _i)) {\n        return null;\n      }\n\n      _result.push(mapFn(collection[String(_i)], _i));\n    }\n\n    return _result;\n  }\n\n  return null;\n}\n","/* eslint-disable no-redeclare */\n// $FlowFixMe[name-already-bound] workaround for: https://github.com/facebook/flow/issues/4441\nvar isInteger = Number.isInteger || function (value) {\n  return typeof value === 'number' && isFinite(value) && Math.floor(value) === value;\n};\n\nexport default isInteger;\n","import isFinite from \"../polyfills/isFinite.mjs\";\nimport isInteger from \"../polyfills/isInteger.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport isObjectLike from \"../jsutils/isObjectLike.mjs\";\nimport { Kind } from \"../language/kinds.mjs\";\nimport { print } from \"../language/printer.mjs\";\nimport { GraphQLError } from \"../error/GraphQLError.mjs\";\nimport { GraphQLScalarType } from \"./definition.mjs\"; // As per the GraphQL Spec, Integers are only treated as valid when a valid\n// 32-bit signed integer, providing the broadest support across platforms.\n//\n// n.b. JavaScript's integers are safe between -(2^53 - 1) and 2^53 - 1 because\n// they are internally represented as IEEE 754 doubles.\n\nvar MAX_INT = 2147483647;\nvar MIN_INT = -2147483648;\n\nfunction serializeInt(outputValue) {\n  var coercedValue = serializeObject(outputValue);\n\n  if (typeof coercedValue === 'boolean') {\n    return coercedValue ? 1 : 0;\n  }\n\n  var num = coercedValue;\n\n  if (typeof coercedValue === 'string' && coercedValue !== '') {\n    num = Number(coercedValue);\n  }\n\n  if (!isInteger(num)) {\n    throw new GraphQLError(\"Int cannot represent non-integer value: \".concat(inspect(coercedValue)));\n  }\n\n  if (num > MAX_INT || num < MIN_INT) {\n    throw new GraphQLError('Int cannot represent non 32-bit signed integer value: ' + inspect(coercedValue));\n  }\n\n  return num;\n}\n\nfunction coerceInt(inputValue) {\n  if (!isInteger(inputValue)) {\n    throw new GraphQLError(\"Int cannot represent non-integer value: \".concat(inspect(inputValue)));\n  }\n\n  if (inputValue > MAX_INT || inputValue < MIN_INT) {\n    throw new GraphQLError(\"Int cannot represent non 32-bit signed integer value: \".concat(inputValue));\n  }\n\n  return inputValue;\n}\n\nexport var GraphQLInt = new GraphQLScalarType({\n  name: 'Int',\n  description: 'The `Int` scalar type represents non-fractional signed whole numeric values. Int can represent values between -(2^31) and 2^31 - 1.',\n  serialize: serializeInt,\n  parseValue: coerceInt,\n  parseLiteral: function parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.INT) {\n      throw new GraphQLError(\"Int cannot represent non-integer value: \".concat(print(valueNode)), valueNode);\n    }\n\n    var num = parseInt(valueNode.value, 10);\n\n    if (num > MAX_INT || num < MIN_INT) {\n      throw new GraphQLError(\"Int cannot represent non 32-bit signed integer value: \".concat(valueNode.value), valueNode);\n    }\n\n    return num;\n  }\n});\n\nfunction serializeFloat(outputValue) {\n  var coercedValue = serializeObject(outputValue);\n\n  if (typeof coercedValue === 'boolean') {\n    return coercedValue ? 1 : 0;\n  }\n\n  var num = coercedValue;\n\n  if (typeof coercedValue === 'string' && coercedValue !== '') {\n    num = Number(coercedValue);\n  }\n\n  if (!isFinite(num)) {\n    throw new GraphQLError(\"Float cannot represent non numeric value: \".concat(inspect(coercedValue)));\n  }\n\n  return num;\n}\n\nfunction coerceFloat(inputValue) {\n  if (!isFinite(inputValue)) {\n    throw new GraphQLError(\"Float cannot represent non numeric value: \".concat(inspect(inputValue)));\n  }\n\n  return inputValue;\n}\n\nexport var GraphQLFloat = new GraphQLScalarType({\n  name: 'Float',\n  description: 'The `Float` scalar type represents signed double-precision fractional values as specified by [IEEE 754](https://en.wikipedia.org/wiki/IEEE_floating_point).',\n  serialize: serializeFloat,\n  parseValue: coerceFloat,\n  parseLiteral: function parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.FLOAT && valueNode.kind !== Kind.INT) {\n      throw new GraphQLError(\"Float cannot represent non numeric value: \".concat(print(valueNode)), valueNode);\n    }\n\n    return parseFloat(valueNode.value);\n  }\n}); // Support serializing objects with custom valueOf() or toJSON() functions -\n// a common way to represent a complex value which can be represented as\n// a string (ex: MongoDB id objects).\n\nfunction serializeObject(outputValue) {\n  if (isObjectLike(outputValue)) {\n    if (typeof outputValue.valueOf === 'function') {\n      var valueOfResult = outputValue.valueOf();\n\n      if (!isObjectLike(valueOfResult)) {\n        return valueOfResult;\n      }\n    }\n\n    if (typeof outputValue.toJSON === 'function') {\n      // $FlowFixMe[incompatible-use]\n      return outputValue.toJSON();\n    }\n  }\n\n  return outputValue;\n}\n\nfunction serializeString(outputValue) {\n  var coercedValue = serializeObject(outputValue); // Serialize string, boolean and number values to a string, but do not\n  // attempt to coerce object, function, symbol, or other types as strings.\n\n  if (typeof coercedValue === 'string') {\n    return coercedValue;\n  }\n\n  if (typeof coercedValue === 'boolean') {\n    return coercedValue ? 'true' : 'false';\n  }\n\n  if (isFinite(coercedValue)) {\n    return coercedValue.toString();\n  }\n\n  throw new GraphQLError(\"String cannot represent value: \".concat(inspect(outputValue)));\n}\n\nfunction coerceString(inputValue) {\n  if (typeof inputValue !== 'string') {\n    throw new GraphQLError(\"String cannot represent a non string value: \".concat(inspect(inputValue)));\n  }\n\n  return inputValue;\n}\n\nexport var GraphQLString = new GraphQLScalarType({\n  name: 'String',\n  description: 'The `String` scalar type represents textual data, represented as UTF-8 character sequences. The String type is most often used by GraphQL to represent free-form human-readable text.',\n  serialize: serializeString,\n  parseValue: coerceString,\n  parseLiteral: function parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.STRING) {\n      throw new GraphQLError(\"String cannot represent a non string value: \".concat(print(valueNode)), valueNode);\n    }\n\n    return valueNode.value;\n  }\n});\n\nfunction serializeBoolean(outputValue) {\n  var coercedValue = serializeObject(outputValue);\n\n  if (typeof coercedValue === 'boolean') {\n    return coercedValue;\n  }\n\n  if (isFinite(coercedValue)) {\n    return coercedValue !== 0;\n  }\n\n  throw new GraphQLError(\"Boolean cannot represent a non boolean value: \".concat(inspect(coercedValue)));\n}\n\nfunction coerceBoolean(inputValue) {\n  if (typeof inputValue !== 'boolean') {\n    throw new GraphQLError(\"Boolean cannot represent a non boolean value: \".concat(inspect(inputValue)));\n  }\n\n  return inputValue;\n}\n\nexport var GraphQLBoolean = new GraphQLScalarType({\n  name: 'Boolean',\n  description: 'The `Boolean` scalar type represents `true` or `false`.',\n  serialize: serializeBoolean,\n  parseValue: coerceBoolean,\n  parseLiteral: function parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.BOOLEAN) {\n      throw new GraphQLError(\"Boolean cannot represent a non boolean value: \".concat(print(valueNode)), valueNode);\n    }\n\n    return valueNode.value;\n  }\n});\n\nfunction serializeID(outputValue) {\n  var coercedValue = serializeObject(outputValue);\n\n  if (typeof coercedValue === 'string') {\n    return coercedValue;\n  }\n\n  if (isInteger(coercedValue)) {\n    return String(coercedValue);\n  }\n\n  throw new GraphQLError(\"ID cannot represent value: \".concat(inspect(outputValue)));\n}\n\nfunction coerceID(inputValue) {\n  if (typeof inputValue === 'string') {\n    return inputValue;\n  }\n\n  if (isInteger(inputValue)) {\n    return inputValue.toString();\n  }\n\n  throw new GraphQLError(\"ID cannot represent value: \".concat(inspect(inputValue)));\n}\n\nexport var GraphQLID = new GraphQLScalarType({\n  name: 'ID',\n  description: 'The `ID` scalar type represents a unique identifier, often used to refetch an object or as key for a cache. The ID type appears in a JSON response as a String; however, it is not intended to be human-readable. When expected as an input type, any string (such as `\"4\"`) or integer (such as `4`) input value will be accepted as an ID.',\n  serialize: serializeID,\n  parseValue: coerceID,\n  parseLiteral: function parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.STRING && valueNode.kind !== Kind.INT) {\n      throw new GraphQLError('ID cannot represent a non-string and non-integer value: ' + print(valueNode), valueNode);\n    }\n\n    return valueNode.value;\n  }\n});\nexport var specifiedScalarTypes = Object.freeze([GraphQLString, GraphQLInt, GraphQLFloat, GraphQLBoolean, GraphQLID]);\nexport function isSpecifiedScalarType(type) {\n  return specifiedScalarTypes.some(function (_ref) {\n    var name = _ref.name;\n    return type.name === name;\n  });\n}\n","import isFinite from \"../polyfills/isFinite.mjs\";\nimport objectValues from \"../polyfills/objectValues.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport invariant from \"../jsutils/invariant.mjs\";\nimport isObjectLike from \"../jsutils/isObjectLike.mjs\";\nimport safeArrayFrom from \"../jsutils/safeArrayFrom.mjs\";\nimport { Kind } from \"../language/kinds.mjs\";\nimport { GraphQLID } from \"../type/scalars.mjs\";\nimport { isLeafType, isEnumType, isInputObjectType, isListType, isNonNullType } from \"../type/definition.mjs\";\n/**\n * Produces a GraphQL Value AST given a JavaScript object.\n * Function will match JavaScript/JSON values to GraphQL AST schema format\n * by using suggested GraphQLInputType. For example:\n *\n *     astFromValue(\"value\", GraphQLString)\n *\n * A GraphQL type must be provided, which will be used to interpret different\n * JavaScript values.\n *\n * | JSON Value    | GraphQL Value        |\n * | ------------- | -------------------- |\n * | Object        | Input Object         |\n * | Array         | List                 |\n * | Boolean       | Boolean              |\n * | String        | String / Enum Value  |\n * | Number        | Int / Float          |\n * | Mixed         | Enum Value           |\n * | null          | NullValue            |\n *\n */\n\nexport function astFromValue(value, type) {\n  if (isNonNullType(type)) {\n    var astValue = astFromValue(value, type.ofType);\n\n    if ((astValue === null || astValue === void 0 ? void 0 : astValue.kind) === Kind.NULL) {\n      return null;\n    }\n\n    return astValue;\n  } // only explicit null, not undefined, NaN\n\n\n  if (value === null) {\n    return {\n      kind: Kind.NULL\n    };\n  } // undefined\n\n\n  if (value === undefined) {\n    return null;\n  } // Convert JavaScript array to GraphQL list. If the GraphQLType is a list, but\n  // the value is not an array, convert the value using the list's item type.\n\n\n  if (isListType(type)) {\n    var itemType = type.ofType;\n    var items = safeArrayFrom(value);\n\n    if (items != null) {\n      var valuesNodes = [];\n\n      for (var _i2 = 0; _i2 < items.length; _i2++) {\n        var item = items[_i2];\n        var itemNode = astFromValue(item, itemType);\n\n        if (itemNode != null) {\n          valuesNodes.push(itemNode);\n        }\n      }\n\n      return {\n        kind: Kind.LIST,\n        values: valuesNodes\n      };\n    }\n\n    return astFromValue(value, itemType);\n  } // Populate the fields of the input object by creating ASTs from each value\n  // in the JavaScript object according to the fields in the input type.\n\n\n  if (isInputObjectType(type)) {\n    if (!isObjectLike(value)) {\n      return null;\n    }\n\n    var fieldNodes = [];\n\n    for (var _i4 = 0, _objectValues2 = objectValues(type.getFields()); _i4 < _objectValues2.length; _i4++) {\n      var field = _objectValues2[_i4];\n      var fieldValue = astFromValue(value[field.name], field.type);\n\n      if (fieldValue) {\n        fieldNodes.push({\n          kind: Kind.OBJECT_FIELD,\n          name: {\n            kind: Kind.NAME,\n            value: field.name\n          },\n          value: fieldValue\n        });\n      }\n    }\n\n    return {\n      kind: Kind.OBJECT,\n      fields: fieldNodes\n    };\n  } // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2618')\n\n\n  if (isLeafType(type)) {\n    // Since value is an internally represented value, it must be serialized\n    // to an externally represented value before converting into an AST.\n    var serialized = type.serialize(value);\n\n    if (serialized == null) {\n      return null;\n    } // Others serialize based on their corresponding JavaScript scalar types.\n\n\n    if (typeof serialized === 'boolean') {\n      return {\n        kind: Kind.BOOLEAN,\n        value: serialized\n      };\n    } // JavaScript numbers can be Int or Float values.\n\n\n    if (typeof serialized === 'number' && isFinite(serialized)) {\n      var stringNum = String(serialized);\n      return integerStringRegExp.test(stringNum) ? {\n        kind: Kind.INT,\n        value: stringNum\n      } : {\n        kind: Kind.FLOAT,\n        value: stringNum\n      };\n    }\n\n    if (typeof serialized === 'string') {\n      // Enum types use Enum literals.\n      if (isEnumType(type)) {\n        return {\n          kind: Kind.ENUM,\n          value: serialized\n        };\n      } // ID types can use Int literals.\n\n\n      if (type === GraphQLID && integerStringRegExp.test(serialized)) {\n        return {\n          kind: Kind.INT,\n          value: serialized\n        };\n      }\n\n      return {\n        kind: Kind.STRING,\n        value: serialized\n      };\n    }\n\n    throw new TypeError(\"Cannot convert value to AST: \".concat(inspect(serialized), \".\"));\n  } // istanbul ignore next (Not reachable. All possible input types have been considered)\n\n\n  false || invariant(0, 'Unexpected input type: ' + inspect(type));\n}\n/**\n * IntValue:\n *   - NegativeSign? 0\n *   - NegativeSign? NonZeroDigit ( Digit+ )?\n */\n\nvar integerStringRegExp = /^-?(?:0|[1-9][0-9]*)$/;\n","import objectValues from \"../polyfills/objectValues.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport invariant from \"../jsutils/invariant.mjs\";\nimport { print } from \"../language/printer.mjs\";\nimport { DirectiveLocation } from \"../language/directiveLocation.mjs\";\nimport { astFromValue } from \"../utilities/astFromValue.mjs\";\nimport { GraphQLString, GraphQLBoolean } from \"./scalars.mjs\";\nimport { GraphQLList, GraphQLNonNull, GraphQLObjectType, GraphQLEnumType, isScalarType, isObjectType, isInterfaceType, isUnionType, isEnumType, isInputObjectType, isListType, isNonNullType, isAbstractType } from \"./definition.mjs\";\nexport var __Schema = new GraphQLObjectType({\n  name: '__Schema',\n  description: 'A GraphQL Schema defines the capabilities of a GraphQL server. It exposes all available types and directives on the server, as well as the entry points for query, mutation, and subscription operations.',\n  fields: function fields() {\n    return {\n      description: {\n        type: GraphQLString,\n        resolve: function resolve(schema) {\n          return schema.description;\n        }\n      },\n      types: {\n        description: 'A list of all types supported by this server.',\n        type: new GraphQLNonNull(new GraphQLList(new GraphQLNonNull(__Type))),\n        resolve: function resolve(schema) {\n          return objectValues(schema.getTypeMap());\n        }\n      },\n      queryType: {\n        description: 'The type that query operations will be rooted at.',\n        type: new GraphQLNonNull(__Type),\n        resolve: function resolve(schema) {\n          return schema.getQueryType();\n        }\n      },\n      mutationType: {\n        description: 'If this server supports mutation, the type that mutation operations will be rooted at.',\n        type: __Type,\n        resolve: function resolve(schema) {\n          return schema.getMutationType();\n        }\n      },\n      subscriptionType: {\n        description: 'If this server support subscription, the type that subscription operations will be rooted at.',\n        type: __Type,\n        resolve: function resolve(schema) {\n          return schema.getSubscriptionType();\n        }\n      },\n      directives: {\n        description: 'A list of all directives supported by this server.',\n        type: new GraphQLNonNull(new GraphQLList(new GraphQLNonNull(__Directive))),\n        resolve: function resolve(schema) {\n          return schema.getDirectives();\n        }\n      }\n    };\n  }\n});\nexport var __Directive = new GraphQLObjectType({\n  name: '__Directive',\n  description: \"A Directive provides a way to describe alternate runtime execution and type validation behavior in a GraphQL document.\\n\\nIn some cases, you need to provide options to alter GraphQL's execution behavior in ways field arguments will not suffice, such as conditionally including or skipping a field. Directives provide this by describing additional information to the executor.\",\n  fields: function fields() {\n    return {\n      name: {\n        type: new GraphQLNonNull(GraphQLString),\n        resolve: function resolve(directive) {\n          return directive.name;\n        }\n      },\n      description: {\n        type: GraphQLString,\n        resolve: function resolve(directive) {\n          return directive.description;\n        }\n      },\n      isRepeatable: {\n        type: new GraphQLNonNull(GraphQLBoolean),\n        resolve: function resolve(directive) {\n          return directive.isRepeatable;\n        }\n      },\n      locations: {\n        type: new GraphQLNonNull(new GraphQLList(new GraphQLNonNull(__DirectiveLocation))),\n        resolve: function resolve(directive) {\n          return directive.locations;\n        }\n      },\n      args: {\n        type: new GraphQLNonNull(new GraphQLList(new GraphQLNonNull(__InputValue))),\n        args: {\n          includeDeprecated: {\n            type: GraphQLBoolean,\n            defaultValue: false\n          }\n        },\n        resolve: function resolve(field, _ref) {\n          var includeDeprecated = _ref.includeDeprecated;\n          return includeDeprecated ? field.args : field.args.filter(function (arg) {\n            return arg.deprecationReason == null;\n          });\n        }\n      }\n    };\n  }\n});\nexport var __DirectiveLocation = new GraphQLEnumType({\n  name: '__DirectiveLocation',\n  description: 'A Directive can be adjacent to many parts of the GraphQL language, a __DirectiveLocation describes one such possible adjacencies.',\n  values: {\n    QUERY: {\n      value: DirectiveLocation.QUERY,\n      description: 'Location adjacent to a query operation.'\n    },\n    MUTATION: {\n      value: DirectiveLocation.MUTATION,\n      description: 'Location adjacent to a mutation operation.'\n    },\n    SUBSCRIPTION: {\n      value: DirectiveLocation.SUBSCRIPTION,\n      description: 'Location adjacent to a subscription operation.'\n    },\n    FIELD: {\n      value: DirectiveLocation.FIELD,\n      description: 'Location adjacent to a field.'\n    },\n    FRAGMENT_DEFINITION: {\n      value: DirectiveLocation.FRAGMENT_DEFINITION,\n      description: 'Location adjacent to a fragment definition.'\n    },\n    FRAGMENT_SPREAD: {\n      value: DirectiveLocation.FRAGMENT_SPREAD,\n      description: 'Location adjacent to a fragment spread.'\n    },\n    INLINE_FRAGMENT: {\n      value: DirectiveLocation.INLINE_FRAGMENT,\n      description: 'Location adjacent to an inline fragment.'\n    },\n    VARIABLE_DEFINITION: {\n      value: DirectiveLocation.VARIABLE_DEFINITION,\n      description: 'Location adjacent to a variable definition.'\n    },\n    SCHEMA: {\n      value: DirectiveLocation.SCHEMA,\n      description: 'Location adjacent to a schema definition.'\n    },\n    SCALAR: {\n      value: DirectiveLocation.SCALAR,\n      description: 'Location adjacent to a scalar definition.'\n    },\n    OBJECT: {\n      value: DirectiveLocation.OBJECT,\n      description: 'Location adjacent to an object type definition.'\n    },\n    FIELD_DEFINITION: {\n      value: DirectiveLocation.FIELD_DEFINITION,\n      description: 'Location adjacent to a field definition.'\n    },\n    ARGUMENT_DEFINITION: {\n      value: DirectiveLocation.ARGUMENT_DEFINITION,\n      description: 'Location adjacent to an argument definition.'\n    },\n    INTERFACE: {\n      value: DirectiveLocation.INTERFACE,\n      description: 'Location adjacent to an interface definition.'\n    },\n    UNION: {\n      value: DirectiveLocation.UNION,\n      description: 'Location adjacent to a union definition.'\n    },\n    ENUM: {\n      value: DirectiveLocation.ENUM,\n      description: 'Location adjacent to an enum definition.'\n    },\n    ENUM_VALUE: {\n      value: DirectiveLocation.ENUM_VALUE,\n      description: 'Location adjacent to an enum value definition.'\n    },\n    INPUT_OBJECT: {\n      value: DirectiveLocation.INPUT_OBJECT,\n      description: 'Location adjacent to an input object type definition.'\n    },\n    INPUT_FIELD_DEFINITION: {\n      value: DirectiveLocation.INPUT_FIELD_DEFINITION,\n      description: 'Location adjacent to an input object field definition.'\n    }\n  }\n});\nexport var __Type = new GraphQLObjectType({\n  name: '__Type',\n  description: 'The fundamental unit of any GraphQL Schema is the type. There are many kinds of types in GraphQL as represented by the `__TypeKind` enum.\\n\\nDepending on the kind of a type, certain fields describe information about that type. Scalar types provide no information beyond a name, description and optional `specifiedByUrl`, while Enum types provide their values. Object and Interface types provide the fields they describe. Abstract types, Union and Interface, provide the Object types possible at runtime. List and NonNull types compose other types.',\n  fields: function fields() {\n    return {\n      kind: {\n        type: new GraphQLNonNull(__TypeKind),\n        resolve: function resolve(type) {\n          if (isScalarType(type)) {\n            return TypeKind.SCALAR;\n          }\n\n          if (isObjectType(type)) {\n            return TypeKind.OBJECT;\n          }\n\n          if (isInterfaceType(type)) {\n            return TypeKind.INTERFACE;\n          }\n\n          if (isUnionType(type)) {\n            return TypeKind.UNION;\n          }\n\n          if (isEnumType(type)) {\n            return TypeKind.ENUM;\n          }\n\n          if (isInputObjectType(type)) {\n            return TypeKind.INPUT_OBJECT;\n          }\n\n          if (isListType(type)) {\n            return TypeKind.LIST;\n          } // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2618')\n\n\n          if (isNonNullType(type)) {\n            return TypeKind.NON_NULL;\n          } // istanbul ignore next (Not reachable. All possible types have been considered)\n\n\n          false || invariant(0, \"Unexpected type: \\\"\".concat(inspect(type), \"\\\".\"));\n        }\n      },\n      name: {\n        type: GraphQLString,\n        resolve: function resolve(type) {\n          return type.name !== undefined ? type.name : undefined;\n        }\n      },\n      description: {\n        type: GraphQLString,\n        resolve: function resolve(type) {\n          return type.description !== undefined ? type.description : undefined;\n        }\n      },\n      specifiedByUrl: {\n        type: GraphQLString,\n        resolve: function resolve(obj) {\n          return obj.specifiedByUrl !== undefined ? obj.specifiedByUrl : undefined;\n        }\n      },\n      fields: {\n        type: new GraphQLList(new GraphQLNonNull(__Field)),\n        args: {\n          includeDeprecated: {\n            type: GraphQLBoolean,\n            defaultValue: false\n          }\n        },\n        resolve: function resolve(type, _ref2) {\n          var includeDeprecated = _ref2.includeDeprecated;\n\n          if (isObjectType(type) || isInterfaceType(type)) {\n            var fields = objectValues(type.getFields());\n            return includeDeprecated ? fields : fields.filter(function (field) {\n              return field.deprecationReason == null;\n            });\n          }\n        }\n      },\n      interfaces: {\n        type: new GraphQLList(new GraphQLNonNull(__Type)),\n        resolve: function resolve(type) {\n          if (isObjectType(type) || isInterfaceType(type)) {\n            return type.getInterfaces();\n          }\n        }\n      },\n      possibleTypes: {\n        type: new GraphQLList(new GraphQLNonNull(__Type)),\n        resolve: function resolve(type, _args, _context, _ref3) {\n          var schema = _ref3.schema;\n\n          if (isAbstractType(type)) {\n            return schema.getPossibleTypes(type);\n          }\n        }\n      },\n      enumValues: {\n        type: new GraphQLList(new GraphQLNonNull(__EnumValue)),\n        args: {\n          includeDeprecated: {\n            type: GraphQLBoolean,\n            defaultValue: false\n          }\n        },\n        resolve: function resolve(type, _ref4) {\n          var includeDeprecated = _ref4.includeDeprecated;\n\n          if (isEnumType(type)) {\n            var values = type.getValues();\n            return includeDeprecated ? values : values.filter(function (field) {\n              return field.deprecationReason == null;\n            });\n          }\n        }\n      },\n      inputFields: {\n        type: new GraphQLList(new GraphQLNonNull(__InputValue)),\n        args: {\n          includeDeprecated: {\n            type: GraphQLBoolean,\n            defaultValue: false\n          }\n        },\n        resolve: function resolve(type, _ref5) {\n          var includeDeprecated = _ref5.includeDeprecated;\n\n          if (isInputObjectType(type)) {\n            var values = objectValues(type.getFields());\n            return includeDeprecated ? values : values.filter(function (field) {\n              return field.deprecationReason == null;\n            });\n          }\n        }\n      },\n      ofType: {\n        type: __Type,\n        resolve: function resolve(type) {\n          return type.ofType !== undefined ? type.ofType : undefined;\n        }\n      }\n    };\n  }\n});\nexport var __Field = new GraphQLObjectType({\n  name: '__Field',\n  description: 'Object and Interface types are described by a list of Fields, each of which has a name, potentially a list of arguments, and a return type.',\n  fields: function fields() {\n    return {\n      name: {\n        type: new GraphQLNonNull(GraphQLString),\n        resolve: function resolve(field) {\n          return field.name;\n        }\n      },\n      description: {\n        type: GraphQLString,\n        resolve: function resolve(field) {\n          return field.description;\n        }\n      },\n      args: {\n        type: new GraphQLNonNull(new GraphQLList(new GraphQLNonNull(__InputValue))),\n        args: {\n          includeDeprecated: {\n            type: GraphQLBoolean,\n            defaultValue: false\n          }\n        },\n        resolve: function resolve(field, _ref6) {\n          var includeDeprecated = _ref6.includeDeprecated;\n          return includeDeprecated ? field.args : field.args.filter(function (arg) {\n            return arg.deprecationReason == null;\n          });\n        }\n      },\n      type: {\n        type: new GraphQLNonNull(__Type),\n        resolve: function resolve(field) {\n          return field.type;\n        }\n      },\n      isDeprecated: {\n        type: new GraphQLNonNull(GraphQLBoolean),\n        resolve: function resolve(field) {\n          return field.deprecationReason != null;\n        }\n      },\n      deprecationReason: {\n        type: GraphQLString,\n        resolve: function resolve(field) {\n          return field.deprecationReason;\n        }\n      }\n    };\n  }\n});\nexport var __InputValue = new GraphQLObjectType({\n  name: '__InputValue',\n  description: 'Arguments provided to Fields or Directives and the input fields of an InputObject are represented as Input Values which describe their type and optionally a default value.',\n  fields: function fields() {\n    return {\n      name: {\n        type: new GraphQLNonNull(GraphQLString),\n        resolve: function resolve(inputValue) {\n          return inputValue.name;\n        }\n      },\n      description: {\n        type: GraphQLString,\n        resolve: function resolve(inputValue) {\n          return inputValue.description;\n        }\n      },\n      type: {\n        type: new GraphQLNonNull(__Type),\n        resolve: function resolve(inputValue) {\n          return inputValue.type;\n        }\n      },\n      defaultValue: {\n        type: GraphQLString,\n        description: 'A GraphQL-formatted string representing the default value for this input value.',\n        resolve: function resolve(inputValue) {\n          var type = inputValue.type,\n              defaultValue = inputValue.defaultValue;\n          var valueAST = astFromValue(defaultValue, type);\n          return valueAST ? print(valueAST) : null;\n        }\n      },\n      isDeprecated: {\n        type: new GraphQLNonNull(GraphQLBoolean),\n        resolve: function resolve(field) {\n          return field.deprecationReason != null;\n        }\n      },\n      deprecationReason: {\n        type: GraphQLString,\n        resolve: function resolve(obj) {\n          return obj.deprecationReason;\n        }\n      }\n    };\n  }\n});\nexport var __EnumValue = new GraphQLObjectType({\n  name: '__EnumValue',\n  description: 'One possible value for a given Enum. Enum values are unique values, not a placeholder for a string or numeric value. However an Enum value is returned in a JSON response as a string.',\n  fields: function fields() {\n    return {\n      name: {\n        type: new GraphQLNonNull(GraphQLString),\n        resolve: function resolve(enumValue) {\n          return enumValue.name;\n        }\n      },\n      description: {\n        type: GraphQLString,\n        resolve: function resolve(enumValue) {\n          return enumValue.description;\n        }\n      },\n      isDeprecated: {\n        type: new GraphQLNonNull(GraphQLBoolean),\n        resolve: function resolve(enumValue) {\n          return enumValue.deprecationReason != null;\n        }\n      },\n      deprecationReason: {\n        type: GraphQLString,\n        resolve: function resolve(enumValue) {\n          return enumValue.deprecationReason;\n        }\n      }\n    };\n  }\n});\nexport var TypeKind = Object.freeze({\n  SCALAR: 'SCALAR',\n  OBJECT: 'OBJECT',\n  INTERFACE: 'INTERFACE',\n  UNION: 'UNION',\n  ENUM: 'ENUM',\n  INPUT_OBJECT: 'INPUT_OBJECT',\n  LIST: 'LIST',\n  NON_NULL: 'NON_NULL'\n});\nexport var __TypeKind = new GraphQLEnumType({\n  name: '__TypeKind',\n  description: 'An enum describing what kind of type a given `__Type` is.',\n  values: {\n    SCALAR: {\n      value: TypeKind.SCALAR,\n      description: 'Indicates this type is a scalar.'\n    },\n    OBJECT: {\n      value: TypeKind.OBJECT,\n      description: 'Indicates this type is an object. `fields` and `interfaces` are valid fields.'\n    },\n    INTERFACE: {\n      value: TypeKind.INTERFACE,\n      description: 'Indicates this type is an interface. `fields`, `interfaces`, and `possibleTypes` are valid fields.'\n    },\n    UNION: {\n      value: TypeKind.UNION,\n      description: 'Indicates this type is a union. `possibleTypes` is a valid field.'\n    },\n    ENUM: {\n      value: TypeKind.ENUM,\n      description: 'Indicates this type is an enum. `enumValues` is a valid field.'\n    },\n    INPUT_OBJECT: {\n      value: TypeKind.INPUT_OBJECT,\n      description: 'Indicates this type is an input object. `inputFields` is a valid field.'\n    },\n    LIST: {\n      value: TypeKind.LIST,\n      description: 'Indicates this type is a list. `ofType` is a valid field.'\n    },\n    NON_NULL: {\n      value: TypeKind.NON_NULL,\n      description: 'Indicates this type is a non-null. `ofType` is a valid field.'\n    }\n  }\n});\n/**\n * Note that these are GraphQLField and not GraphQLFieldConfig,\n * so the format for args is different.\n */\n\nexport var SchemaMetaFieldDef = {\n  name: '__schema',\n  type: new GraphQLNonNull(__Schema),\n  description: 'Access the current type schema of this server.',\n  args: [],\n  resolve: function resolve(_source, _args, _context, _ref7) {\n    var schema = _ref7.schema;\n    return schema;\n  },\n  isDeprecated: false,\n  deprecationReason: undefined,\n  extensions: undefined,\n  astNode: undefined\n};\nexport var TypeMetaFieldDef = {\n  name: '__type',\n  type: __Type,\n  description: 'Request the type information of a single type.',\n  args: [{\n    name: 'name',\n    description: undefined,\n    type: new GraphQLNonNull(GraphQLString),\n    defaultValue: undefined,\n    deprecationReason: undefined,\n    extensions: undefined,\n    astNode: undefined\n  }],\n  resolve: function resolve(_source, _ref8, _context, _ref9) {\n    var name = _ref8.name;\n    var schema = _ref9.schema;\n    return schema.getType(name);\n  },\n  isDeprecated: false,\n  deprecationReason: undefined,\n  extensions: undefined,\n  astNode: undefined\n};\nexport var TypeNameMetaFieldDef = {\n  name: '__typename',\n  type: new GraphQLNonNull(GraphQLString),\n  description: 'The name of the current Object type at runtime.',\n  args: [],\n  resolve: function resolve(_source, _args, _context, _ref10) {\n    var parentType = _ref10.parentType;\n    return parentType.name;\n  },\n  isDeprecated: false,\n  deprecationReason: undefined,\n  extensions: undefined,\n  astNode: undefined\n};\nexport var introspectionTypes = Object.freeze([__Schema, __Directive, __DirectiveLocation, __Type, __Field, __InputValue, __EnumValue, __TypeKind]);\nexport function isIntrospectionType(type) {\n  return introspectionTypes.some(function (_ref11) {\n    var name = _ref11.name;\n    return type.name === name;\n  });\n}\n","function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nimport objectEntries from \"../polyfills/objectEntries.mjs\";\nimport { SYMBOL_TO_STRING_TAG } from \"../polyfills/symbols.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport toObjMap from \"../jsutils/toObjMap.mjs\";\nimport devAssert from \"../jsutils/devAssert.mjs\";\nimport instanceOf from \"../jsutils/instanceOf.mjs\";\nimport isObjectLike from \"../jsutils/isObjectLike.mjs\";\nimport defineInspect from \"../jsutils/defineInspect.mjs\";\nimport { DirectiveLocation } from \"../language/directiveLocation.mjs\";\nimport { GraphQLString, GraphQLBoolean } from \"./scalars.mjs\";\nimport { argsToArgsConfig, GraphQLNonNull } from \"./definition.mjs\";\n/**\n * Test if the given value is a GraphQL directive.\n */\n\n// eslint-disable-next-line no-redeclare\nexport function isDirective(directive) {\n  return instanceOf(directive, GraphQLDirective);\n}\nexport function assertDirective(directive) {\n  if (!isDirective(directive)) {\n    throw new Error(\"Expected \".concat(inspect(directive), \" to be a GraphQL directive.\"));\n  }\n\n  return directive;\n}\n/**\n * Directives are used by the GraphQL runtime as a way of modifying execution\n * behavior. Type system creators will usually not create these directly.\n */\n\nexport var GraphQLDirective = /*#__PURE__*/function () {\n  function GraphQLDirective(config) {\n    var _config$isRepeatable, _config$args;\n\n    this.name = config.name;\n    this.description = config.description;\n    this.locations = config.locations;\n    this.isRepeatable = (_config$isRepeatable = config.isRepeatable) !== null && _config$isRepeatable !== void 0 ? _config$isRepeatable : false;\n    this.extensions = config.extensions && toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    config.name || devAssert(0, 'Directive must be named.');\n    Array.isArray(config.locations) || devAssert(0, \"@\".concat(config.name, \" locations must be an Array.\"));\n    var args = (_config$args = config.args) !== null && _config$args !== void 0 ? _config$args : {};\n    isObjectLike(args) && !Array.isArray(args) || devAssert(0, \"@\".concat(config.name, \" args must be an object with argument names as keys.\"));\n    this.args = objectEntries(args).map(function (_ref) {\n      var argName = _ref[0],\n          argConfig = _ref[1];\n      return {\n        name: argName,\n        description: argConfig.description,\n        type: argConfig.type,\n        defaultValue: argConfig.defaultValue,\n        deprecationReason: argConfig.deprecationReason,\n        extensions: argConfig.extensions && toObjMap(argConfig.extensions),\n        astNode: argConfig.astNode\n      };\n    });\n  }\n\n  var _proto = GraphQLDirective.prototype;\n\n  _proto.toConfig = function toConfig() {\n    return {\n      name: this.name,\n      description: this.description,\n      locations: this.locations,\n      args: argsToArgsConfig(this.args),\n      isRepeatable: this.isRepeatable,\n      extensions: this.extensions,\n      astNode: this.astNode\n    };\n  };\n\n  _proto.toString = function toString() {\n    return '@' + this.name;\n  };\n\n  _proto.toJSON = function toJSON() {\n    return this.toString();\n  } // $FlowFixMe[unsupported-syntax] Flow doesn't support computed properties yet\n  ;\n\n  _createClass(GraphQLDirective, [{\n    key: SYMBOL_TO_STRING_TAG,\n    get: function get() {\n      return 'GraphQLDirective';\n    }\n  }]);\n\n  return GraphQLDirective;\n}(); // Print a simplified form when appearing in `inspect` and `util.inspect`.\n\ndefineInspect(GraphQLDirective);\n\n/**\n * Used to conditionally include fields or fragments.\n */\nexport var GraphQLIncludeDirective = new GraphQLDirective({\n  name: 'include',\n  description: 'Directs the executor to include this field or fragment only when the `if` argument is true.',\n  locations: [DirectiveLocation.FIELD, DirectiveLocation.FRAGMENT_SPREAD, DirectiveLocation.INLINE_FRAGMENT],\n  args: {\n    if: {\n      type: new GraphQLNonNull(GraphQLBoolean),\n      description: 'Included when true.'\n    }\n  }\n});\n/**\n * Used to conditionally skip (exclude) fields or fragments.\n */\n\nexport var GraphQLSkipDirective = new GraphQLDirective({\n  name: 'skip',\n  description: 'Directs the executor to skip this field or fragment when the `if` argument is true.',\n  locations: [DirectiveLocation.FIELD, DirectiveLocation.FRAGMENT_SPREAD, DirectiveLocation.INLINE_FRAGMENT],\n  args: {\n    if: {\n      type: new GraphQLNonNull(GraphQLBoolean),\n      description: 'Skipped when true.'\n    }\n  }\n});\n/**\n * Constant string used for default reason for a deprecation.\n */\n\nexport var DEFAULT_DEPRECATION_REASON = 'No longer supported';\n/**\n * Used to declare element of a GraphQL schema as deprecated.\n */\n\nexport var GraphQLDeprecatedDirective = new GraphQLDirective({\n  name: 'deprecated',\n  description: 'Marks an element of a GraphQL schema as no longer supported.',\n  locations: [DirectiveLocation.FIELD_DEFINITION, DirectiveLocation.ARGUMENT_DEFINITION, DirectiveLocation.INPUT_FIELD_DEFINITION, DirectiveLocation.ENUM_VALUE],\n  args: {\n    reason: {\n      type: GraphQLString,\n      description: 'Explains why this element was deprecated, usually also including a suggestion for how to access supported similar data. Formatted using the Markdown syntax, as specified by [CommonMark](https://commonmark.org/).',\n      defaultValue: DEFAULT_DEPRECATION_REASON\n    }\n  }\n});\n/**\n * Used to provide a URL for specifying the behaviour of custom scalar definitions.\n */\n\nexport var GraphQLSpecifiedByDirective = new GraphQLDirective({\n  name: 'specifiedBy',\n  description: 'Exposes a URL that specifies the behaviour of this scalar.',\n  locations: [DirectiveLocation.SCALAR],\n  args: {\n    url: {\n      type: new GraphQLNonNull(GraphQLString),\n      description: 'The URL that specifies the behaviour of this scalar.'\n    }\n  }\n});\n/**\n * The full list of specified directives.\n */\n\nexport var specifiedDirectives = Object.freeze([GraphQLIncludeDirective, GraphQLSkipDirective, GraphQLDeprecatedDirective, GraphQLSpecifiedByDirective]);\nexport function isSpecifiedDirective(directive) {\n  return specifiedDirectives.some(function (_ref2) {\n    var name = _ref2.name;\n    return name === directive.name;\n  });\n}\n","function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nimport find from \"../polyfills/find.mjs\";\nimport arrayFrom from \"../polyfills/arrayFrom.mjs\";\nimport objectValues from \"../polyfills/objectValues.mjs\";\nimport { SYMBOL_TO_STRING_TAG } from \"../polyfills/symbols.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport toObjMap from \"../jsutils/toObjMap.mjs\";\nimport devAssert from \"../jsutils/devAssert.mjs\";\nimport instanceOf from \"../jsutils/instanceOf.mjs\";\nimport isObjectLike from \"../jsutils/isObjectLike.mjs\";\nimport { __Schema } from \"./introspection.mjs\";\nimport { GraphQLDirective, isDirective, specifiedDirectives } from \"./directives.mjs\";\nimport { isObjectType, isInterfaceType, isUnionType, isInputObjectType, getNamedType } from \"./definition.mjs\";\n/**\n * Test if the given value is a GraphQL schema.\n */\n\n// eslint-disable-next-line no-redeclare\nexport function isSchema(schema) {\n  return instanceOf(schema, GraphQLSchema);\n}\nexport function assertSchema(schema) {\n  if (!isSchema(schema)) {\n    throw new Error(\"Expected \".concat(inspect(schema), \" to be a GraphQL schema.\"));\n  }\n\n  return schema;\n}\n/**\n * Schema Definition\n *\n * A Schema is created by supplying the root types of each type of operation,\n * query and mutation (optional). A schema definition is then supplied to the\n * validator and executor.\n *\n * Example:\n *\n *     const MyAppSchema = new GraphQLSchema({\n *       query: MyAppQueryRootType,\n *       mutation: MyAppMutationRootType,\n *     })\n *\n * Note: When the schema is constructed, by default only the types that are\n * reachable by traversing the root types are included, other types must be\n * explicitly referenced.\n *\n * Example:\n *\n *     const characterInterface = new GraphQLInterfaceType({\n *       name: 'Character',\n *       ...\n *     });\n *\n *     const humanType = new GraphQLObjectType({\n *       name: 'Human',\n *       interfaces: [characterInterface],\n *       ...\n *     });\n *\n *     const droidType = new GraphQLObjectType({\n *       name: 'Droid',\n *       interfaces: [characterInterface],\n *       ...\n *     });\n *\n *     const schema = new GraphQLSchema({\n *       query: new GraphQLObjectType({\n *         name: 'Query',\n *         fields: {\n *           hero: { type: characterInterface, ... },\n *         }\n *       }),\n *       ...\n *       // Since this schema references only the `Character` interface it's\n *       // necessary to explicitly list the types that implement it if\n *       // you want them to be included in the final schema.\n *       types: [humanType, droidType],\n *     })\n *\n * Note: If an array of `directives` are provided to GraphQLSchema, that will be\n * the exact list of directives represented and allowed. If `directives` is not\n * provided then a default set of the specified directives (e.g. @include and\n * @skip) will be used. If you wish to provide *additional* directives to these\n * specified directives, you must explicitly declare them. Example:\n *\n *     const MyAppSchema = new GraphQLSchema({\n *       ...\n *       directives: specifiedDirectives.concat([ myCustomDirective ]),\n *     })\n *\n */\n\nexport var GraphQLSchema = /*#__PURE__*/function () {\n  // Used as a cache for validateSchema().\n  function GraphQLSchema(config) {\n    var _config$directives;\n\n    // If this schema was built from a source known to be valid, then it may be\n    // marked with assumeValid to avoid an additional type system validation.\n    this.__validationErrors = config.assumeValid === true ? [] : undefined; // Check for common mistakes during construction to produce early errors.\n\n    isObjectLike(config) || devAssert(0, 'Must provide configuration object.');\n    !config.types || Array.isArray(config.types) || devAssert(0, \"\\\"types\\\" must be Array if provided but got: \".concat(inspect(config.types), \".\"));\n    !config.directives || Array.isArray(config.directives) || devAssert(0, '\"directives\" must be Array if provided but got: ' + \"\".concat(inspect(config.directives), \".\"));\n    this.description = config.description;\n    this.extensions = config.extensions && toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes = config.extensionASTNodes;\n    this._queryType = config.query;\n    this._mutationType = config.mutation;\n    this._subscriptionType = config.subscription; // Provide specified directives (e.g. @include and @skip) by default.\n\n    this._directives = (_config$directives = config.directives) !== null && _config$directives !== void 0 ? _config$directives : specifiedDirectives; // To preserve order of user-provided types, we add first to add them to\n    // the set of \"collected\" types, so `collectReferencedTypes` ignore them.\n\n    var allReferencedTypes = new Set(config.types);\n\n    if (config.types != null) {\n      for (var _i2 = 0, _config$types2 = config.types; _i2 < _config$types2.length; _i2++) {\n        var type = _config$types2[_i2];\n        // When we ready to process this type, we remove it from \"collected\" types\n        // and then add it together with all dependent types in the correct position.\n        allReferencedTypes.delete(type);\n        collectReferencedTypes(type, allReferencedTypes);\n      }\n    }\n\n    if (this._queryType != null) {\n      collectReferencedTypes(this._queryType, allReferencedTypes);\n    }\n\n    if (this._mutationType != null) {\n      collectReferencedTypes(this._mutationType, allReferencedTypes);\n    }\n\n    if (this._subscriptionType != null) {\n      collectReferencedTypes(this._subscriptionType, allReferencedTypes);\n    }\n\n    for (var _i4 = 0, _this$_directives2 = this._directives; _i4 < _this$_directives2.length; _i4++) {\n      var directive = _this$_directives2[_i4];\n\n      // Directives are not validated until validateSchema() is called.\n      if (isDirective(directive)) {\n        for (var _i6 = 0, _directive$args2 = directive.args; _i6 < _directive$args2.length; _i6++) {\n          var arg = _directive$args2[_i6];\n          collectReferencedTypes(arg.type, allReferencedTypes);\n        }\n      }\n    }\n\n    collectReferencedTypes(__Schema, allReferencedTypes); // Storing the resulting map for reference by the schema.\n\n    this._typeMap = Object.create(null);\n    this._subTypeMap = Object.create(null); // Keep track of all implementations by interface name.\n\n    this._implementationsMap = Object.create(null);\n\n    for (var _i8 = 0, _arrayFrom2 = arrayFrom(allReferencedTypes); _i8 < _arrayFrom2.length; _i8++) {\n      var namedType = _arrayFrom2[_i8];\n\n      if (namedType == null) {\n        continue;\n      }\n\n      var typeName = namedType.name;\n      typeName || devAssert(0, 'One of the provided types for building the Schema is missing a name.');\n\n      if (this._typeMap[typeName] !== undefined) {\n        throw new Error(\"Schema must contain uniquely named types but contains multiple types named \\\"\".concat(typeName, \"\\\".\"));\n      }\n\n      this._typeMap[typeName] = namedType;\n\n      if (isInterfaceType(namedType)) {\n        // Store implementations by interface.\n        for (var _i10 = 0, _namedType$getInterfa2 = namedType.getInterfaces(); _i10 < _namedType$getInterfa2.length; _i10++) {\n          var iface = _namedType$getInterfa2[_i10];\n\n          if (isInterfaceType(iface)) {\n            var implementations = this._implementationsMap[iface.name];\n\n            if (implementations === undefined) {\n              implementations = this._implementationsMap[iface.name] = {\n                objects: [],\n                interfaces: []\n              };\n            }\n\n            implementations.interfaces.push(namedType);\n          }\n        }\n      } else if (isObjectType(namedType)) {\n        // Store implementations by objects.\n        for (var _i12 = 0, _namedType$getInterfa4 = namedType.getInterfaces(); _i12 < _namedType$getInterfa4.length; _i12++) {\n          var _iface = _namedType$getInterfa4[_i12];\n\n          if (isInterfaceType(_iface)) {\n            var _implementations = this._implementationsMap[_iface.name];\n\n            if (_implementations === undefined) {\n              _implementations = this._implementationsMap[_iface.name] = {\n                objects: [],\n                interfaces: []\n              };\n            }\n\n            _implementations.objects.push(namedType);\n          }\n        }\n      }\n    }\n  }\n\n  var _proto = GraphQLSchema.prototype;\n\n  _proto.getQueryType = function getQueryType() {\n    return this._queryType;\n  };\n\n  _proto.getMutationType = function getMutationType() {\n    return this._mutationType;\n  };\n\n  _proto.getSubscriptionType = function getSubscriptionType() {\n    return this._subscriptionType;\n  };\n\n  _proto.getTypeMap = function getTypeMap() {\n    return this._typeMap;\n  };\n\n  _proto.getType = function getType(name) {\n    return this.getTypeMap()[name];\n  };\n\n  _proto.getPossibleTypes = function getPossibleTypes(abstractType) {\n    return isUnionType(abstractType) ? abstractType.getTypes() : this.getImplementations(abstractType).objects;\n  };\n\n  _proto.getImplementations = function getImplementations(interfaceType) {\n    var implementations = this._implementationsMap[interfaceType.name];\n    return implementations !== null && implementations !== void 0 ? implementations : {\n      objects: [],\n      interfaces: []\n    };\n  } // @deprecated: use isSubType instead - will be removed in v16.\n  ;\n\n  _proto.isPossibleType = function isPossibleType(abstractType, possibleType) {\n    return this.isSubType(abstractType, possibleType);\n  };\n\n  _proto.isSubType = function isSubType(abstractType, maybeSubType) {\n    var map = this._subTypeMap[abstractType.name];\n\n    if (map === undefined) {\n      map = Object.create(null);\n\n      if (isUnionType(abstractType)) {\n        for (var _i14 = 0, _abstractType$getType2 = abstractType.getTypes(); _i14 < _abstractType$getType2.length; _i14++) {\n          var type = _abstractType$getType2[_i14];\n          map[type.name] = true;\n        }\n      } else {\n        var implementations = this.getImplementations(abstractType);\n\n        for (var _i16 = 0, _implementations$obje2 = implementations.objects; _i16 < _implementations$obje2.length; _i16++) {\n          var _type = _implementations$obje2[_i16];\n          map[_type.name] = true;\n        }\n\n        for (var _i18 = 0, _implementations$inte2 = implementations.interfaces; _i18 < _implementations$inte2.length; _i18++) {\n          var _type2 = _implementations$inte2[_i18];\n          map[_type2.name] = true;\n        }\n      }\n\n      this._subTypeMap[abstractType.name] = map;\n    }\n\n    return map[maybeSubType.name] !== undefined;\n  };\n\n  _proto.getDirectives = function getDirectives() {\n    return this._directives;\n  };\n\n  _proto.getDirective = function getDirective(name) {\n    return find(this.getDirectives(), function (directive) {\n      return directive.name === name;\n    });\n  };\n\n  _proto.toConfig = function toConfig() {\n    var _this$extensionASTNod;\n\n    return {\n      description: this.description,\n      query: this.getQueryType(),\n      mutation: this.getMutationType(),\n      subscription: this.getSubscriptionType(),\n      types: objectValues(this.getTypeMap()),\n      directives: this.getDirectives().slice(),\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: (_this$extensionASTNod = this.extensionASTNodes) !== null && _this$extensionASTNod !== void 0 ? _this$extensionASTNod : [],\n      assumeValid: this.__validationErrors !== undefined\n    };\n  } // $FlowFixMe[unsupported-syntax] Flow doesn't support computed properties yet\n  ;\n\n  _createClass(GraphQLSchema, [{\n    key: SYMBOL_TO_STRING_TAG,\n    get: function get() {\n      return 'GraphQLSchema';\n    }\n  }]);\n\n  return GraphQLSchema;\n}();\n\nfunction collectReferencedTypes(type, typeSet) {\n  var namedType = getNamedType(type);\n\n  if (!typeSet.has(namedType)) {\n    typeSet.add(namedType);\n\n    if (isUnionType(namedType)) {\n      for (var _i20 = 0, _namedType$getTypes2 = namedType.getTypes(); _i20 < _namedType$getTypes2.length; _i20++) {\n        var memberType = _namedType$getTypes2[_i20];\n        collectReferencedTypes(memberType, typeSet);\n      }\n    } else if (isObjectType(namedType) || isInterfaceType(namedType)) {\n      for (var _i22 = 0, _namedType$getInterfa6 = namedType.getInterfaces(); _i22 < _namedType$getInterfa6.length; _i22++) {\n        var interfaceType = _namedType$getInterfa6[_i22];\n        collectReferencedTypes(interfaceType, typeSet);\n      }\n\n      for (var _i24 = 0, _objectValues2 = objectValues(namedType.getFields()); _i24 < _objectValues2.length; _i24++) {\n        var field = _objectValues2[_i24];\n        collectReferencedTypes(field.type, typeSet);\n\n        for (var _i26 = 0, _field$args2 = field.args; _i26 < _field$args2.length; _i26++) {\n          var arg = _field$args2[_i26];\n          collectReferencedTypes(arg.type, typeSet);\n        }\n      }\n    } else if (isInputObjectType(namedType)) {\n      for (var _i28 = 0, _objectValues4 = objectValues(namedType.getFields()); _i28 < _objectValues4.length; _i28++) {\n        var _field = _objectValues4[_i28];\n        collectReferencedTypes(_field.type, typeSet);\n      }\n    }\n  }\n\n  return typeSet;\n}\n","import find from \"../polyfills/find.mjs\";\nimport objectValues from \"../polyfills/objectValues.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport { GraphQLError } from \"../error/GraphQLError.mjs\";\nimport { locatedError } from \"../error/locatedError.mjs\";\nimport { isValidNameError } from \"../utilities/assertValidName.mjs\";\nimport { isEqualType, isTypeSubTypeOf } from \"../utilities/typeComparators.mjs\";\nimport { assertSchema } from \"./schema.mjs\";\nimport { isIntrospectionType } from \"./introspection.mjs\";\nimport { isDirective, GraphQLDeprecatedDirective } from \"./directives.mjs\";\nimport { isObjectType, isInterfaceType, isUnionType, isEnumType, isInputObjectType, isNamedType, isNonNullType, isInputType, isOutputType, isRequiredArgument, isRequiredInputField } from \"./definition.mjs\";\n/**\n * Implements the \"Type Validation\" sub-sections of the specification's\n * \"Type System\" section.\n *\n * Validation runs synchronously, returning an array of encountered errors, or\n * an empty array if no errors were encountered and the Schema is valid.\n */\n\nexport function validateSchema(schema) {\n  // First check to ensure the provided value is in fact a GraphQLSchema.\n  assertSchema(schema); // If this Schema has already been validated, return the previous results.\n\n  if (schema.__validationErrors) {\n    return schema.__validationErrors;\n  } // Validate the schema, producing a list of errors.\n\n\n  var context = new SchemaValidationContext(schema);\n  validateRootTypes(context);\n  validateDirectives(context);\n  validateTypes(context); // Persist the results of validation before returning to ensure validation\n  // does not run multiple times for this schema.\n\n  var errors = context.getErrors();\n  schema.__validationErrors = errors;\n  return errors;\n}\n/**\n * Utility function which asserts a schema is valid by throwing an error if\n * it is invalid.\n */\n\nexport function assertValidSchema(schema) {\n  var errors = validateSchema(schema);\n\n  if (errors.length !== 0) {\n    throw new Error(errors.map(function (error) {\n      return error.message;\n    }).join('\\n\\n'));\n  }\n}\n\nvar SchemaValidationContext = /*#__PURE__*/function () {\n  function SchemaValidationContext(schema) {\n    this._errors = [];\n    this.schema = schema;\n  }\n\n  var _proto = SchemaValidationContext.prototype;\n\n  _proto.reportError = function reportError(message, nodes) {\n    var _nodes = Array.isArray(nodes) ? nodes.filter(Boolean) : nodes;\n\n    this.addError(new GraphQLError(message, _nodes));\n  };\n\n  _proto.addError = function addError(error) {\n    this._errors.push(error);\n  };\n\n  _proto.getErrors = function getErrors() {\n    return this._errors;\n  };\n\n  return SchemaValidationContext;\n}();\n\nfunction validateRootTypes(context) {\n  var schema = context.schema;\n  var queryType = schema.getQueryType();\n\n  if (!queryType) {\n    context.reportError('Query root type must be provided.', schema.astNode);\n  } else if (!isObjectType(queryType)) {\n    var _getOperationTypeNode;\n\n    context.reportError(\"Query root type must be Object type, it cannot be \".concat(inspect(queryType), \".\"), (_getOperationTypeNode = getOperationTypeNode(schema, 'query')) !== null && _getOperationTypeNode !== void 0 ? _getOperationTypeNode : queryType.astNode);\n  }\n\n  var mutationType = schema.getMutationType();\n\n  if (mutationType && !isObjectType(mutationType)) {\n    var _getOperationTypeNode2;\n\n    context.reportError('Mutation root type must be Object type if provided, it cannot be ' + \"\".concat(inspect(mutationType), \".\"), (_getOperationTypeNode2 = getOperationTypeNode(schema, 'mutation')) !== null && _getOperationTypeNode2 !== void 0 ? _getOperationTypeNode2 : mutationType.astNode);\n  }\n\n  var subscriptionType = schema.getSubscriptionType();\n\n  if (subscriptionType && !isObjectType(subscriptionType)) {\n    var _getOperationTypeNode3;\n\n    context.reportError('Subscription root type must be Object type if provided, it cannot be ' + \"\".concat(inspect(subscriptionType), \".\"), (_getOperationTypeNode3 = getOperationTypeNode(schema, 'subscription')) !== null && _getOperationTypeNode3 !== void 0 ? _getOperationTypeNode3 : subscriptionType.astNode);\n  }\n}\n\nfunction getOperationTypeNode(schema, operation) {\n  var operationNodes = getAllSubNodes(schema, function (node) {\n    return node.operationTypes;\n  });\n\n  for (var _i2 = 0; _i2 < operationNodes.length; _i2++) {\n    var node = operationNodes[_i2];\n\n    if (node.operation === operation) {\n      return node.type;\n    }\n  }\n\n  return undefined;\n}\n\nfunction validateDirectives(context) {\n  for (var _i4 = 0, _context$schema$getDi2 = context.schema.getDirectives(); _i4 < _context$schema$getDi2.length; _i4++) {\n    var directive = _context$schema$getDi2[_i4];\n\n    // Ensure all directives are in fact GraphQL directives.\n    if (!isDirective(directive)) {\n      context.reportError(\"Expected directive but got: \".concat(inspect(directive), \".\"), directive === null || directive === void 0 ? void 0 : directive.astNode);\n      continue;\n    } // Ensure they are named correctly.\n\n\n    validateName(context, directive); // TODO: Ensure proper locations.\n    // Ensure the arguments are valid.\n\n    for (var _i6 = 0, _directive$args2 = directive.args; _i6 < _directive$args2.length; _i6++) {\n      var arg = _directive$args2[_i6];\n      // Ensure they are named correctly.\n      validateName(context, arg); // Ensure the type is an input type.\n\n      if (!isInputType(arg.type)) {\n        context.reportError(\"The type of @\".concat(directive.name, \"(\").concat(arg.name, \":) must be Input Type \") + \"but got: \".concat(inspect(arg.type), \".\"), arg.astNode);\n      }\n\n      if (isRequiredArgument(arg) && arg.deprecationReason != null) {\n        var _arg$astNode;\n\n        context.reportError(\"Required argument @\".concat(directive.name, \"(\").concat(arg.name, \":) cannot be deprecated.\"), [getDeprecatedDirectiveNode(arg.astNode), // istanbul ignore next (TODO need to write coverage tests)\n        (_arg$astNode = arg.astNode) === null || _arg$astNode === void 0 ? void 0 : _arg$astNode.type]);\n      }\n    }\n  }\n}\n\nfunction validateName(context, node) {\n  // Ensure names are valid, however introspection types opt out.\n  var error = isValidNameError(node.name);\n\n  if (error) {\n    context.addError(locatedError(error, node.astNode));\n  }\n}\n\nfunction validateTypes(context) {\n  var validateInputObjectCircularRefs = createInputObjectCircularRefsValidator(context);\n  var typeMap = context.schema.getTypeMap();\n\n  for (var _i8 = 0, _objectValues2 = objectValues(typeMap); _i8 < _objectValues2.length; _i8++) {\n    var type = _objectValues2[_i8];\n\n    // Ensure all provided types are in fact GraphQL type.\n    if (!isNamedType(type)) {\n      context.reportError(\"Expected GraphQL named type but got: \".concat(inspect(type), \".\"), type.astNode);\n      continue;\n    } // Ensure it is named correctly (excluding introspection types).\n\n\n    if (!isIntrospectionType(type)) {\n      validateName(context, type);\n    }\n\n    if (isObjectType(type)) {\n      // Ensure fields are valid\n      validateFields(context, type); // Ensure objects implement the interfaces they claim to.\n\n      validateInterfaces(context, type);\n    } else if (isInterfaceType(type)) {\n      // Ensure fields are valid.\n      validateFields(context, type); // Ensure interfaces implement the interfaces they claim to.\n\n      validateInterfaces(context, type);\n    } else if (isUnionType(type)) {\n      // Ensure Unions include valid member types.\n      validateUnionMembers(context, type);\n    } else if (isEnumType(type)) {\n      // Ensure Enums have valid values.\n      validateEnumValues(context, type);\n    } else if (isInputObjectType(type)) {\n      // Ensure Input Object fields are valid.\n      validateInputFields(context, type); // Ensure Input Objects do not contain non-nullable circular references\n\n      validateInputObjectCircularRefs(type);\n    }\n  }\n}\n\nfunction validateFields(context, type) {\n  var fields = objectValues(type.getFields()); // Objects and Interfaces both must define one or more fields.\n\n  if (fields.length === 0) {\n    context.reportError(\"Type \".concat(type.name, \" must define one or more fields.\"), getAllNodes(type));\n  }\n\n  for (var _i10 = 0; _i10 < fields.length; _i10++) {\n    var field = fields[_i10];\n    // Ensure they are named correctly.\n    validateName(context, field); // Ensure the type is an output type\n\n    if (!isOutputType(field.type)) {\n      var _field$astNode;\n\n      context.reportError(\"The type of \".concat(type.name, \".\").concat(field.name, \" must be Output Type \") + \"but got: \".concat(inspect(field.type), \".\"), (_field$astNode = field.astNode) === null || _field$astNode === void 0 ? void 0 : _field$astNode.type);\n    } // Ensure the arguments are valid\n\n\n    for (var _i12 = 0, _field$args2 = field.args; _i12 < _field$args2.length; _i12++) {\n      var arg = _field$args2[_i12];\n      var argName = arg.name; // Ensure they are named correctly.\n\n      validateName(context, arg); // Ensure the type is an input type\n\n      if (!isInputType(arg.type)) {\n        var _arg$astNode2;\n\n        context.reportError(\"The type of \".concat(type.name, \".\").concat(field.name, \"(\").concat(argName, \":) must be Input \") + \"Type but got: \".concat(inspect(arg.type), \".\"), (_arg$astNode2 = arg.astNode) === null || _arg$astNode2 === void 0 ? void 0 : _arg$astNode2.type);\n      }\n\n      if (isRequiredArgument(arg) && arg.deprecationReason != null) {\n        var _arg$astNode3;\n\n        context.reportError(\"Required argument \".concat(type.name, \".\").concat(field.name, \"(\").concat(argName, \":) cannot be deprecated.\"), [getDeprecatedDirectiveNode(arg.astNode), // istanbul ignore next (TODO need to write coverage tests)\n        (_arg$astNode3 = arg.astNode) === null || _arg$astNode3 === void 0 ? void 0 : _arg$astNode3.type]);\n      }\n    }\n  }\n}\n\nfunction validateInterfaces(context, type) {\n  var ifaceTypeNames = Object.create(null);\n\n  for (var _i14 = 0, _type$getInterfaces2 = type.getInterfaces(); _i14 < _type$getInterfaces2.length; _i14++) {\n    var iface = _type$getInterfaces2[_i14];\n\n    if (!isInterfaceType(iface)) {\n      context.reportError(\"Type \".concat(inspect(type), \" must only implement Interface types, \") + \"it cannot implement \".concat(inspect(iface), \".\"), getAllImplementsInterfaceNodes(type, iface));\n      continue;\n    }\n\n    if (type === iface) {\n      context.reportError(\"Type \".concat(type.name, \" cannot implement itself because it would create a circular reference.\"), getAllImplementsInterfaceNodes(type, iface));\n      continue;\n    }\n\n    if (ifaceTypeNames[iface.name]) {\n      context.reportError(\"Type \".concat(type.name, \" can only implement \").concat(iface.name, \" once.\"), getAllImplementsInterfaceNodes(type, iface));\n      continue;\n    }\n\n    ifaceTypeNames[iface.name] = true;\n    validateTypeImplementsAncestors(context, type, iface);\n    validateTypeImplementsInterface(context, type, iface);\n  }\n}\n\nfunction validateTypeImplementsInterface(context, type, iface) {\n  var typeFieldMap = type.getFields(); // Assert each interface field is implemented.\n\n  for (var _i16 = 0, _objectValues4 = objectValues(iface.getFields()); _i16 < _objectValues4.length; _i16++) {\n    var ifaceField = _objectValues4[_i16];\n    var fieldName = ifaceField.name;\n    var typeField = typeFieldMap[fieldName]; // Assert interface field exists on type.\n\n    if (!typeField) {\n      context.reportError(\"Interface field \".concat(iface.name, \".\").concat(fieldName, \" expected but \").concat(type.name, \" does not provide it.\"), [ifaceField.astNode].concat(getAllNodes(type)));\n      continue;\n    } // Assert interface field type is satisfied by type field type, by being\n    // a valid subtype. (covariant)\n\n\n    if (!isTypeSubTypeOf(context.schema, typeField.type, ifaceField.type)) {\n      var _ifaceField$astNode, _typeField$astNode;\n\n      context.reportError(\"Interface field \".concat(iface.name, \".\").concat(fieldName, \" expects type \") + \"\".concat(inspect(ifaceField.type), \" but \").concat(type.name, \".\").concat(fieldName, \" \") + \"is type \".concat(inspect(typeField.type), \".\"), [// istanbul ignore next (TODO need to write coverage tests)\n      (_ifaceField$astNode = ifaceField.astNode) === null || _ifaceField$astNode === void 0 ? void 0 : _ifaceField$astNode.type, // istanbul ignore next (TODO need to write coverage tests)\n      (_typeField$astNode = typeField.astNode) === null || _typeField$astNode === void 0 ? void 0 : _typeField$astNode.type]);\n    } // Assert each interface field arg is implemented.\n\n\n    var _loop = function _loop(_i18, _ifaceField$args2) {\n      var ifaceArg = _ifaceField$args2[_i18];\n      var argName = ifaceArg.name;\n      var typeArg = find(typeField.args, function (arg) {\n        return arg.name === argName;\n      }); // Assert interface field arg exists on object field.\n\n      if (!typeArg) {\n        context.reportError(\"Interface field argument \".concat(iface.name, \".\").concat(fieldName, \"(\").concat(argName, \":) expected but \").concat(type.name, \".\").concat(fieldName, \" does not provide it.\"), [ifaceArg.astNode, typeField.astNode]);\n        return \"continue\";\n      } // Assert interface field arg type matches object field arg type.\n      // (invariant)\n      // TODO: change to contravariant?\n\n\n      if (!isEqualType(ifaceArg.type, typeArg.type)) {\n        var _ifaceArg$astNode, _typeArg$astNode;\n\n        context.reportError(\"Interface field argument \".concat(iface.name, \".\").concat(fieldName, \"(\").concat(argName, \":) \") + \"expects type \".concat(inspect(ifaceArg.type), \" but \") + \"\".concat(type.name, \".\").concat(fieldName, \"(\").concat(argName, \":) is type \") + \"\".concat(inspect(typeArg.type), \".\"), [// istanbul ignore next (TODO need to write coverage tests)\n        (_ifaceArg$astNode = ifaceArg.astNode) === null || _ifaceArg$astNode === void 0 ? void 0 : _ifaceArg$astNode.type, // istanbul ignore next (TODO need to write coverage tests)\n        (_typeArg$astNode = typeArg.astNode) === null || _typeArg$astNode === void 0 ? void 0 : _typeArg$astNode.type]);\n      } // TODO: validate default values?\n\n    };\n\n    for (var _i18 = 0, _ifaceField$args2 = ifaceField.args; _i18 < _ifaceField$args2.length; _i18++) {\n      var _ret = _loop(_i18, _ifaceField$args2);\n\n      if (_ret === \"continue\") continue;\n    } // Assert additional arguments must not be required.\n\n\n    var _loop2 = function _loop2(_i20, _typeField$args2) {\n      var typeArg = _typeField$args2[_i20];\n      var argName = typeArg.name;\n      var ifaceArg = find(ifaceField.args, function (arg) {\n        return arg.name === argName;\n      });\n\n      if (!ifaceArg && isRequiredArgument(typeArg)) {\n        context.reportError(\"Object field \".concat(type.name, \".\").concat(fieldName, \" includes required argument \").concat(argName, \" that is missing from the Interface field \").concat(iface.name, \".\").concat(fieldName, \".\"), [typeArg.astNode, ifaceField.astNode]);\n      }\n    };\n\n    for (var _i20 = 0, _typeField$args2 = typeField.args; _i20 < _typeField$args2.length; _i20++) {\n      _loop2(_i20, _typeField$args2);\n    }\n  }\n}\n\nfunction validateTypeImplementsAncestors(context, type, iface) {\n  var ifaceInterfaces = type.getInterfaces();\n\n  for (var _i22 = 0, _iface$getInterfaces2 = iface.getInterfaces(); _i22 < _iface$getInterfaces2.length; _i22++) {\n    var transitive = _iface$getInterfaces2[_i22];\n\n    if (ifaceInterfaces.indexOf(transitive) === -1) {\n      context.reportError(transitive === type ? \"Type \".concat(type.name, \" cannot implement \").concat(iface.name, \" because it would create a circular reference.\") : \"Type \".concat(type.name, \" must implement \").concat(transitive.name, \" because it is implemented by \").concat(iface.name, \".\"), [].concat(getAllImplementsInterfaceNodes(iface, transitive), getAllImplementsInterfaceNodes(type, iface)));\n    }\n  }\n}\n\nfunction validateUnionMembers(context, union) {\n  var memberTypes = union.getTypes();\n\n  if (memberTypes.length === 0) {\n    context.reportError(\"Union type \".concat(union.name, \" must define one or more member types.\"), getAllNodes(union));\n  }\n\n  var includedTypeNames = Object.create(null);\n\n  for (var _i24 = 0; _i24 < memberTypes.length; _i24++) {\n    var memberType = memberTypes[_i24];\n\n    if (includedTypeNames[memberType.name]) {\n      context.reportError(\"Union type \".concat(union.name, \" can only include type \").concat(memberType.name, \" once.\"), getUnionMemberTypeNodes(union, memberType.name));\n      continue;\n    }\n\n    includedTypeNames[memberType.name] = true;\n\n    if (!isObjectType(memberType)) {\n      context.reportError(\"Union type \".concat(union.name, \" can only include Object types, \") + \"it cannot include \".concat(inspect(memberType), \".\"), getUnionMemberTypeNodes(union, String(memberType)));\n    }\n  }\n}\n\nfunction validateEnumValues(context, enumType) {\n  var enumValues = enumType.getValues();\n\n  if (enumValues.length === 0) {\n    context.reportError(\"Enum type \".concat(enumType.name, \" must define one or more values.\"), getAllNodes(enumType));\n  }\n\n  for (var _i26 = 0; _i26 < enumValues.length; _i26++) {\n    var enumValue = enumValues[_i26];\n    var valueName = enumValue.name; // Ensure valid name.\n\n    validateName(context, enumValue);\n\n    if (valueName === 'true' || valueName === 'false' || valueName === 'null') {\n      context.reportError(\"Enum type \".concat(enumType.name, \" cannot include value: \").concat(valueName, \".\"), enumValue.astNode);\n    }\n  }\n}\n\nfunction validateInputFields(context, inputObj) {\n  var fields = objectValues(inputObj.getFields());\n\n  if (fields.length === 0) {\n    context.reportError(\"Input Object type \".concat(inputObj.name, \" must define one or more fields.\"), getAllNodes(inputObj));\n  } // Ensure the arguments are valid\n\n\n  for (var _i28 = 0; _i28 < fields.length; _i28++) {\n    var field = fields[_i28];\n    // Ensure they are named correctly.\n    validateName(context, field); // Ensure the type is an input type\n\n    if (!isInputType(field.type)) {\n      var _field$astNode2;\n\n      context.reportError(\"The type of \".concat(inputObj.name, \".\").concat(field.name, \" must be Input Type \") + \"but got: \".concat(inspect(field.type), \".\"), (_field$astNode2 = field.astNode) === null || _field$astNode2 === void 0 ? void 0 : _field$astNode2.type);\n    }\n\n    if (isRequiredInputField(field) && field.deprecationReason != null) {\n      var _field$astNode3;\n\n      context.reportError(\"Required input field \".concat(inputObj.name, \".\").concat(field.name, \" cannot be deprecated.\"), [getDeprecatedDirectiveNode(field.astNode), // istanbul ignore next (TODO need to write coverage tests)\n      (_field$astNode3 = field.astNode) === null || _field$astNode3 === void 0 ? void 0 : _field$astNode3.type]);\n    }\n  }\n}\n\nfunction createInputObjectCircularRefsValidator(context) {\n  // Modified copy of algorithm from 'src/validation/rules/NoFragmentCycles.js'.\n  // Tracks already visited types to maintain O(N) and to ensure that cycles\n  // are not redundantly reported.\n  var visitedTypes = Object.create(null); // Array of types nodes used to produce meaningful errors\n\n  var fieldPath = []; // Position in the type path\n\n  var fieldPathIndexByTypeName = Object.create(null);\n  return detectCycleRecursive; // This does a straight-forward DFS to find cycles.\n  // It does not terminate when a cycle was found but continues to explore\n  // the graph to find all possible cycles.\n\n  function detectCycleRecursive(inputObj) {\n    if (visitedTypes[inputObj.name]) {\n      return;\n    }\n\n    visitedTypes[inputObj.name] = true;\n    fieldPathIndexByTypeName[inputObj.name] = fieldPath.length;\n    var fields = objectValues(inputObj.getFields());\n\n    for (var _i30 = 0; _i30 < fields.length; _i30++) {\n      var field = fields[_i30];\n\n      if (isNonNullType(field.type) && isInputObjectType(field.type.ofType)) {\n        var fieldType = field.type.ofType;\n        var cycleIndex = fieldPathIndexByTypeName[fieldType.name];\n        fieldPath.push(field);\n\n        if (cycleIndex === undefined) {\n          detectCycleRecursive(fieldType);\n        } else {\n          var cyclePath = fieldPath.slice(cycleIndex);\n          var pathStr = cyclePath.map(function (fieldObj) {\n            return fieldObj.name;\n          }).join('.');\n          context.reportError(\"Cannot reference Input Object \\\"\".concat(fieldType.name, \"\\\" within itself through a series of non-null fields: \\\"\").concat(pathStr, \"\\\".\"), cyclePath.map(function (fieldObj) {\n            return fieldObj.astNode;\n          }));\n        }\n\n        fieldPath.pop();\n      }\n    }\n\n    fieldPathIndexByTypeName[inputObj.name] = undefined;\n  }\n}\n\nfunction getAllNodes(object) {\n  var astNode = object.astNode,\n      extensionASTNodes = object.extensionASTNodes;\n  return astNode ? extensionASTNodes ? [astNode].concat(extensionASTNodes) : [astNode] : extensionASTNodes !== null && extensionASTNodes !== void 0 ? extensionASTNodes : [];\n}\n\nfunction getAllSubNodes(object, getter) {\n  var subNodes = [];\n\n  for (var _i32 = 0, _getAllNodes2 = getAllNodes(object); _i32 < _getAllNodes2.length; _i32++) {\n    var _getter;\n\n    var node = _getAllNodes2[_i32];\n    // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n    subNodes = subNodes.concat((_getter = getter(node)) !== null && _getter !== void 0 ? _getter : []);\n  }\n\n  return subNodes;\n}\n\nfunction getAllImplementsInterfaceNodes(type, iface) {\n  return getAllSubNodes(type, function (typeNode) {\n    return typeNode.interfaces;\n  }).filter(function (ifaceNode) {\n    return ifaceNode.name.value === iface.name;\n  });\n}\n\nfunction getUnionMemberTypeNodes(union, typeName) {\n  return getAllSubNodes(union, function (unionNode) {\n    return unionNode.types;\n  }).filter(function (typeNode) {\n    return typeNode.name.value === typeName;\n  });\n}\n\nfunction getDeprecatedDirectiveNode(definitionNode) {\n  var _definitionNode$direc;\n\n  // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n  return definitionNode === null || definitionNode === void 0 ? void 0 : (_definitionNode$direc = definitionNode.directives) === null || _definitionNode$direc === void 0 ? void 0 : _definitionNode$direc.find(function (node) {\n    return node.name.value === GraphQLDeprecatedDirective.name;\n  });\n}\n","import inspect from \"../jsutils/inspect.mjs\";\nimport invariant from \"../jsutils/invariant.mjs\";\nimport { Kind } from \"../language/kinds.mjs\";\nimport { GraphQLList, GraphQLNonNull } from \"../type/definition.mjs\";\n/**\n * Given a Schema and an AST node describing a type, return a GraphQLType\n * definition which applies to that type. For example, if provided the parsed\n * AST node for `[User]`, a GraphQLList instance will be returned, containing\n * the type called \"User\" found in the schema. If a type called \"User\" is not\n * found in the schema, then undefined will be returned.\n */\n\n/* eslint-disable no-redeclare */\n\nexport function typeFromAST(schema, typeNode) {\n  /* eslint-enable no-redeclare */\n  var innerType;\n\n  if (typeNode.kind === Kind.LIST_TYPE) {\n    innerType = typeFromAST(schema, typeNode.type);\n    return innerType && new GraphQLList(innerType);\n  }\n\n  if (typeNode.kind === Kind.NON_NULL_TYPE) {\n    innerType = typeFromAST(schema, typeNode.type);\n    return innerType && new GraphQLNonNull(innerType);\n  } // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2618')\n\n\n  if (typeNode.kind === Kind.NAMED_TYPE) {\n    return schema.getType(typeNode.name.value);\n  } // istanbul ignore next (Not reachable. All possible type nodes have been considered)\n\n\n  false || invariant(0, 'Unexpected type node: ' + inspect(typeNode));\n}\n","import find from \"../polyfills/find.mjs\";\nimport { Kind } from \"../language/kinds.mjs\";\nimport { isNode } from \"../language/ast.mjs\";\nimport { getVisitFn } from \"../language/visitor.mjs\";\nimport { isObjectType, isInterfaceType, isEnumType, isInputObjectType, isListType, isCompositeType, isInputType, isOutputType, getNullableType, getNamedType } from \"../type/definition.mjs\";\nimport { SchemaMetaFieldDef, TypeMetaFieldDef, TypeNameMetaFieldDef } from \"../type/introspection.mjs\";\nimport { typeFromAST } from \"./typeFromAST.mjs\";\n/**\n * TypeInfo is a utility class which, given a GraphQL schema, can keep track\n * of the current field and type definitions at any point in a GraphQL document\n * AST during a recursive descent by calling `enter(node)` and `leave(node)`.\n */\n\nexport var TypeInfo = /*#__PURE__*/function () {\n  function TypeInfo(schema, // NOTE: this experimental optional second parameter is only needed in order\n  // to support non-spec-compliant code bases. You should never need to use it.\n  // It may disappear in the future.\n  getFieldDefFn, // Initial type may be provided in rare cases to facilitate traversals\n  // beginning somewhere other than documents.\n  initialType) {\n    this._schema = schema;\n    this._typeStack = [];\n    this._parentTypeStack = [];\n    this._inputTypeStack = [];\n    this._fieldDefStack = [];\n    this._defaultValueStack = [];\n    this._directive = null;\n    this._argument = null;\n    this._enumValue = null;\n    this._getFieldDef = getFieldDefFn !== null && getFieldDefFn !== void 0 ? getFieldDefFn : getFieldDef;\n\n    if (initialType) {\n      if (isInputType(initialType)) {\n        this._inputTypeStack.push(initialType);\n      }\n\n      if (isCompositeType(initialType)) {\n        this._parentTypeStack.push(initialType);\n      }\n\n      if (isOutputType(initialType)) {\n        this._typeStack.push(initialType);\n      }\n    }\n  }\n\n  var _proto = TypeInfo.prototype;\n\n  _proto.getType = function getType() {\n    if (this._typeStack.length > 0) {\n      return this._typeStack[this._typeStack.length - 1];\n    }\n  };\n\n  _proto.getParentType = function getParentType() {\n    if (this._parentTypeStack.length > 0) {\n      return this._parentTypeStack[this._parentTypeStack.length - 1];\n    }\n  };\n\n  _proto.getInputType = function getInputType() {\n    if (this._inputTypeStack.length > 0) {\n      return this._inputTypeStack[this._inputTypeStack.length - 1];\n    }\n  };\n\n  _proto.getParentInputType = function getParentInputType() {\n    if (this._inputTypeStack.length > 1) {\n      return this._inputTypeStack[this._inputTypeStack.length - 2];\n    }\n  };\n\n  _proto.getFieldDef = function getFieldDef() {\n    if (this._fieldDefStack.length > 0) {\n      return this._fieldDefStack[this._fieldDefStack.length - 1];\n    }\n  };\n\n  _proto.getDefaultValue = function getDefaultValue() {\n    if (this._defaultValueStack.length > 0) {\n      return this._defaultValueStack[this._defaultValueStack.length - 1];\n    }\n  };\n\n  _proto.getDirective = function getDirective() {\n    return this._directive;\n  };\n\n  _proto.getArgument = function getArgument() {\n    return this._argument;\n  };\n\n  _proto.getEnumValue = function getEnumValue() {\n    return this._enumValue;\n  };\n\n  _proto.enter = function enter(node) {\n    var schema = this._schema; // Note: many of the types below are explicitly typed as \"mixed\" to drop\n    // any assumptions of a valid schema to ensure runtime types are properly\n    // checked before continuing since TypeInfo is used as part of validation\n    // which occurs before guarantees of schema and document validity.\n\n    switch (node.kind) {\n      case Kind.SELECTION_SET:\n        {\n          var namedType = getNamedType(this.getType());\n\n          this._parentTypeStack.push(isCompositeType(namedType) ? namedType : undefined);\n\n          break;\n        }\n\n      case Kind.FIELD:\n        {\n          var parentType = this.getParentType();\n          var fieldDef;\n          var fieldType;\n\n          if (parentType) {\n            fieldDef = this._getFieldDef(schema, parentType, node);\n\n            if (fieldDef) {\n              fieldType = fieldDef.type;\n            }\n          }\n\n          this._fieldDefStack.push(fieldDef);\n\n          this._typeStack.push(isOutputType(fieldType) ? fieldType : undefined);\n\n          break;\n        }\n\n      case Kind.DIRECTIVE:\n        this._directive = schema.getDirective(node.name.value);\n        break;\n\n      case Kind.OPERATION_DEFINITION:\n        {\n          var type;\n\n          switch (node.operation) {\n            case 'query':\n              type = schema.getQueryType();\n              break;\n\n            case 'mutation':\n              type = schema.getMutationType();\n              break;\n\n            case 'subscription':\n              type = schema.getSubscriptionType();\n              break;\n          }\n\n          this._typeStack.push(isObjectType(type) ? type : undefined);\n\n          break;\n        }\n\n      case Kind.INLINE_FRAGMENT:\n      case Kind.FRAGMENT_DEFINITION:\n        {\n          var typeConditionAST = node.typeCondition;\n          var outputType = typeConditionAST ? typeFromAST(schema, typeConditionAST) : getNamedType(this.getType());\n\n          this._typeStack.push(isOutputType(outputType) ? outputType : undefined);\n\n          break;\n        }\n\n      case Kind.VARIABLE_DEFINITION:\n        {\n          var inputType = typeFromAST(schema, node.type);\n\n          this._inputTypeStack.push(isInputType(inputType) ? inputType : undefined);\n\n          break;\n        }\n\n      case Kind.ARGUMENT:\n        {\n          var _this$getDirective;\n\n          var argDef;\n          var argType;\n          var fieldOrDirective = (_this$getDirective = this.getDirective()) !== null && _this$getDirective !== void 0 ? _this$getDirective : this.getFieldDef();\n\n          if (fieldOrDirective) {\n            argDef = find(fieldOrDirective.args, function (arg) {\n              return arg.name === node.name.value;\n            });\n\n            if (argDef) {\n              argType = argDef.type;\n            }\n          }\n\n          this._argument = argDef;\n\n          this._defaultValueStack.push(argDef ? argDef.defaultValue : undefined);\n\n          this._inputTypeStack.push(isInputType(argType) ? argType : undefined);\n\n          break;\n        }\n\n      case Kind.LIST:\n        {\n          var listType = getNullableType(this.getInputType());\n          var itemType = isListType(listType) ? listType.ofType : listType; // List positions never have a default value.\n\n          this._defaultValueStack.push(undefined);\n\n          this._inputTypeStack.push(isInputType(itemType) ? itemType : undefined);\n\n          break;\n        }\n\n      case Kind.OBJECT_FIELD:\n        {\n          var objectType = getNamedType(this.getInputType());\n          var inputFieldType;\n          var inputField;\n\n          if (isInputObjectType(objectType)) {\n            inputField = objectType.getFields()[node.name.value];\n\n            if (inputField) {\n              inputFieldType = inputField.type;\n            }\n          }\n\n          this._defaultValueStack.push(inputField ? inputField.defaultValue : undefined);\n\n          this._inputTypeStack.push(isInputType(inputFieldType) ? inputFieldType : undefined);\n\n          break;\n        }\n\n      case Kind.ENUM:\n        {\n          var enumType = getNamedType(this.getInputType());\n          var enumValue;\n\n          if (isEnumType(enumType)) {\n            enumValue = enumType.getValue(node.value);\n          }\n\n          this._enumValue = enumValue;\n          break;\n        }\n    }\n  };\n\n  _proto.leave = function leave(node) {\n    switch (node.kind) {\n      case Kind.SELECTION_SET:\n        this._parentTypeStack.pop();\n\n        break;\n\n      case Kind.FIELD:\n        this._fieldDefStack.pop();\n\n        this._typeStack.pop();\n\n        break;\n\n      case Kind.DIRECTIVE:\n        this._directive = null;\n        break;\n\n      case Kind.OPERATION_DEFINITION:\n      case Kind.INLINE_FRAGMENT:\n      case Kind.FRAGMENT_DEFINITION:\n        this._typeStack.pop();\n\n        break;\n\n      case Kind.VARIABLE_DEFINITION:\n        this._inputTypeStack.pop();\n\n        break;\n\n      case Kind.ARGUMENT:\n        this._argument = null;\n\n        this._defaultValueStack.pop();\n\n        this._inputTypeStack.pop();\n\n        break;\n\n      case Kind.LIST:\n      case Kind.OBJECT_FIELD:\n        this._defaultValueStack.pop();\n\n        this._inputTypeStack.pop();\n\n        break;\n\n      case Kind.ENUM:\n        this._enumValue = null;\n        break;\n    }\n  };\n\n  return TypeInfo;\n}();\n/**\n * Not exactly the same as the executor's definition of getFieldDef, in this\n * statically evaluated environment we do not always have an Object type,\n * and need to handle Interface and Union types.\n */\n\nfunction getFieldDef(schema, parentType, fieldNode) {\n  var name = fieldNode.name.value;\n\n  if (name === SchemaMetaFieldDef.name && schema.getQueryType() === parentType) {\n    return SchemaMetaFieldDef;\n  }\n\n  if (name === TypeMetaFieldDef.name && schema.getQueryType() === parentType) {\n    return TypeMetaFieldDef;\n  }\n\n  if (name === TypeNameMetaFieldDef.name && isCompositeType(parentType)) {\n    return TypeNameMetaFieldDef;\n  }\n\n  if (isObjectType(parentType) || isInterfaceType(parentType)) {\n    return parentType.getFields()[name];\n  }\n}\n/**\n * Creates a new visitor instance which maintains a provided TypeInfo instance\n * along with visiting visitor.\n */\n\n\nexport function visitWithTypeInfo(typeInfo, visitor) {\n  return {\n    enter: function enter(node) {\n      typeInfo.enter(node);\n      var fn = getVisitFn(visitor, node.kind,\n      /* isLeaving */\n      false);\n\n      if (fn) {\n        var result = fn.apply(visitor, arguments);\n\n        if (result !== undefined) {\n          typeInfo.leave(node);\n\n          if (isNode(result)) {\n            typeInfo.enter(result);\n          }\n        }\n\n        return result;\n      }\n    },\n    leave: function leave(node) {\n      var fn = getVisitFn(visitor, node.kind,\n      /* isLeaving */\n      true);\n      var result;\n\n      if (fn) {\n        result = fn.apply(visitor, arguments);\n      }\n\n      typeInfo.leave(node);\n      return result;\n    }\n  };\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { Kind } from \"../../language/kinds.mjs\";\nimport { isExecutableDefinitionNode } from \"../../language/predicates.mjs\";\n\n/**\n * Executable definitions\n *\n * A GraphQL document is only valid for execution if all definitions are either\n * operation or fragment definitions.\n */\nexport function ExecutableDefinitionsRule(context) {\n  return {\n    Document: function Document(node) {\n      for (var _i2 = 0, _node$definitions2 = node.definitions; _i2 < _node$definitions2.length; _i2++) {\n        var definition = _node$definitions2[_i2];\n\n        if (!isExecutableDefinitionNode(definition)) {\n          var defName = definition.kind === Kind.SCHEMA_DEFINITION || definition.kind === Kind.SCHEMA_EXTENSION ? 'schema' : '\"' + definition.name.value + '\"';\n          context.reportError(new GraphQLError(\"The \".concat(defName, \" definition is not executable.\"), definition));\n        }\n      }\n\n      return false;\n    }\n  };\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\n\n/**\n * Unique operation names\n *\n * A GraphQL document is only valid if all defined operations have unique names.\n */\nexport function UniqueOperationNamesRule(context) {\n  var knownOperationNames = Object.create(null);\n  return {\n    OperationDefinition: function OperationDefinition(node) {\n      var operationName = node.name;\n\n      if (operationName) {\n        if (knownOperationNames[operationName.value]) {\n          context.reportError(new GraphQLError(\"There can be only one operation named \\\"\".concat(operationName.value, \"\\\".\"), [knownOperationNames[operationName.value], operationName]));\n        } else {\n          knownOperationNames[operationName.value] = operationName;\n        }\n      }\n\n      return false;\n    },\n    FragmentDefinition: function FragmentDefinition() {\n      return false;\n    }\n  };\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { Kind } from \"../../language/kinds.mjs\";\n\n/**\n * Lone anonymous operation\n *\n * A GraphQL document is only valid if when it contains an anonymous operation\n * (the query short-hand) that it contains only that one operation definition.\n */\nexport function LoneAnonymousOperationRule(context) {\n  var operationCount = 0;\n  return {\n    Document: function Document(node) {\n      operationCount = node.definitions.filter(function (definition) {\n        return definition.kind === Kind.OPERATION_DEFINITION;\n      }).length;\n    },\n    OperationDefinition: function OperationDefinition(node) {\n      if (!node.name && operationCount > 1) {\n        context.reportError(new GraphQLError('This anonymous operation must be the only defined operation.', node));\n      }\n    }\n  };\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\n\n/**\n * Subscriptions must only include one field.\n *\n * A GraphQL subscription is valid only if it contains a single root field.\n */\nexport function SingleFieldSubscriptionsRule(context) {\n  return {\n    OperationDefinition: function OperationDefinition(node) {\n      if (node.operation === 'subscription') {\n        if (node.selectionSet.selections.length !== 1) {\n          context.reportError(new GraphQLError(node.name ? \"Subscription \\\"\".concat(node.name.value, \"\\\" must select only one top level field.\") : 'Anonymous Subscription must select only one top level field.', node.selectionSet.selections.slice(1)));\n        }\n      }\n    }\n  };\n}\n","import didYouMean from \"../../jsutils/didYouMean.mjs\";\nimport suggestionList from \"../../jsutils/suggestionList.mjs\";\nimport { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { isTypeDefinitionNode, isTypeSystemDefinitionNode, isTypeSystemExtensionNode } from \"../../language/predicates.mjs\";\nimport { specifiedScalarTypes } from \"../../type/scalars.mjs\";\nimport { introspectionTypes } from \"../../type/introspection.mjs\";\n\n/**\n * Known type names\n *\n * A GraphQL document is only valid if referenced types (specifically\n * variable definitions and fragment conditions) are defined by the type schema.\n */\nexport function KnownTypeNamesRule(context) {\n  var schema = context.getSchema();\n  var existingTypesMap = schema ? schema.getTypeMap() : Object.create(null);\n  var definedTypes = Object.create(null);\n\n  for (var _i2 = 0, _context$getDocument$2 = context.getDocument().definitions; _i2 < _context$getDocument$2.length; _i2++) {\n    var def = _context$getDocument$2[_i2];\n\n    if (isTypeDefinitionNode(def)) {\n      definedTypes[def.name.value] = true;\n    }\n  }\n\n  var typeNames = Object.keys(existingTypesMap).concat(Object.keys(definedTypes));\n  return {\n    NamedType: function NamedType(node, _1, parent, _2, ancestors) {\n      var typeName = node.name.value;\n\n      if (!existingTypesMap[typeName] && !definedTypes[typeName]) {\n        var _ancestors$;\n\n        var definitionNode = (_ancestors$ = ancestors[2]) !== null && _ancestors$ !== void 0 ? _ancestors$ : parent;\n        var isSDL = definitionNode != null && isSDLNode(definitionNode);\n\n        if (isSDL && isStandardTypeName(typeName)) {\n          return;\n        }\n\n        var suggestedTypes = suggestionList(typeName, isSDL ? standardTypeNames.concat(typeNames) : typeNames);\n        context.reportError(new GraphQLError(\"Unknown type \\\"\".concat(typeName, \"\\\".\") + didYouMean(suggestedTypes), node));\n      }\n    }\n  };\n}\nvar standardTypeNames = [].concat(specifiedScalarTypes, introspectionTypes).map(function (type) {\n  return type.name;\n});\n\nfunction isStandardTypeName(typeName) {\n  return standardTypeNames.indexOf(typeName) !== -1;\n}\n\nfunction isSDLNode(value) {\n  return !Array.isArray(value) && (isTypeSystemDefinitionNode(value) || isTypeSystemExtensionNode(value));\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { print } from \"../../language/printer.mjs\";\nimport { isCompositeType } from \"../../type/definition.mjs\";\nimport { typeFromAST } from \"../../utilities/typeFromAST.mjs\";\n\n/**\n * Fragments on composite type\n *\n * Fragments use a type condition to determine if they apply, since fragments\n * can only be spread into a composite type (object, interface, or union), the\n * type condition must also be a composite type.\n */\nexport function FragmentsOnCompositeTypesRule(context) {\n  return {\n    InlineFragment: function InlineFragment(node) {\n      var typeCondition = node.typeCondition;\n\n      if (typeCondition) {\n        var type = typeFromAST(context.getSchema(), typeCondition);\n\n        if (type && !isCompositeType(type)) {\n          var typeStr = print(typeCondition);\n          context.reportError(new GraphQLError(\"Fragment cannot condition on non composite type \\\"\".concat(typeStr, \"\\\".\"), typeCondition));\n        }\n      }\n    },\n    FragmentDefinition: function FragmentDefinition(node) {\n      var type = typeFromAST(context.getSchema(), node.typeCondition);\n\n      if (type && !isCompositeType(type)) {\n        var typeStr = print(node.typeCondition);\n        context.reportError(new GraphQLError(\"Fragment \\\"\".concat(node.name.value, \"\\\" cannot condition on non composite type \\\"\").concat(typeStr, \"\\\".\"), node.typeCondition));\n      }\n    }\n  };\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { print } from \"../../language/printer.mjs\";\nimport { isInputType } from \"../../type/definition.mjs\";\nimport { typeFromAST } from \"../../utilities/typeFromAST.mjs\";\n\n/**\n * Variables are input types\n *\n * A GraphQL operation is only valid if all the variables it defines are of\n * input types (scalar, enum, or input object).\n */\nexport function VariablesAreInputTypesRule(context) {\n  return {\n    VariableDefinition: function VariableDefinition(node) {\n      var type = typeFromAST(context.getSchema(), node.type);\n\n      if (type && !isInputType(type)) {\n        var variableName = node.variable.name.value;\n        var typeName = print(node.type);\n        context.reportError(new GraphQLError(\"Variable \\\"$\".concat(variableName, \"\\\" cannot be non-input type \\\"\").concat(typeName, \"\\\".\"), node.type));\n      }\n    }\n  };\n}\n","import inspect from \"../../jsutils/inspect.mjs\";\nimport { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { getNamedType, isLeafType } from \"../../type/definition.mjs\";\n\n/**\n * Scalar leafs\n *\n * A GraphQL document is valid only if all leaf fields (fields without\n * sub selections) are of scalar or enum types.\n */\nexport function ScalarLeafsRule(context) {\n  return {\n    Field: function Field(node) {\n      var type = context.getType();\n      var selectionSet = node.selectionSet;\n\n      if (type) {\n        if (isLeafType(getNamedType(type))) {\n          if (selectionSet) {\n            var fieldName = node.name.value;\n            var typeStr = inspect(type);\n            context.reportError(new GraphQLError(\"Field \\\"\".concat(fieldName, \"\\\" must not have a selection since type \\\"\").concat(typeStr, \"\\\" has no subfields.\"), selectionSet));\n          }\n        } else if (!selectionSet) {\n          var _fieldName = node.name.value;\n\n          var _typeStr = inspect(type);\n\n          context.reportError(new GraphQLError(\"Field \\\"\".concat(_fieldName, \"\\\" of type \\\"\").concat(_typeStr, \"\\\" must have a selection of subfields. Did you mean \\\"\").concat(_fieldName, \" { ... }\\\"?\"), node));\n        }\n      }\n    }\n  };\n}\n","import arrayFrom from \"../../polyfills/arrayFrom.mjs\";\nimport didYouMean from \"../../jsutils/didYouMean.mjs\";\nimport suggestionList from \"../../jsutils/suggestionList.mjs\";\nimport naturalCompare from \"../../jsutils/naturalCompare.mjs\";\nimport { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { isObjectType, isInterfaceType, isAbstractType } from \"../../type/definition.mjs\";\n\n/**\n * Fields on correct type\n *\n * A GraphQL document is only valid if all fields selected are defined by the\n * parent type, or are an allowed meta field such as __typename.\n */\nexport function FieldsOnCorrectTypeRule(context) {\n  return {\n    Field: function Field(node) {\n      var type = context.getParentType();\n\n      if (type) {\n        var fieldDef = context.getFieldDef();\n\n        if (!fieldDef) {\n          // This field doesn't exist, lets look for suggestions.\n          var schema = context.getSchema();\n          var fieldName = node.name.value; // First determine if there are any suggested types to condition on.\n\n          var suggestion = didYouMean('to use an inline fragment on', getSuggestedTypeNames(schema, type, fieldName)); // If there are no suggested types, then perhaps this was a typo?\n\n          if (suggestion === '') {\n            suggestion = didYouMean(getSuggestedFieldNames(type, fieldName));\n          } // Report an error, including helpful suggestions.\n\n\n          context.reportError(new GraphQLError(\"Cannot query field \\\"\".concat(fieldName, \"\\\" on type \\\"\").concat(type.name, \"\\\".\") + suggestion, node));\n        }\n      }\n    }\n  };\n}\n/**\n * Go through all of the implementations of type, as well as the interfaces that\n * they implement. If any of those types include the provided field, suggest them,\n * sorted by how often the type is referenced.\n */\n\nfunction getSuggestedTypeNames(schema, type, fieldName) {\n  if (!isAbstractType(type)) {\n    // Must be an Object type, which does not have possible fields.\n    return [];\n  }\n\n  var suggestedTypes = new Set();\n  var usageCount = Object.create(null);\n\n  for (var _i2 = 0, _schema$getPossibleTy2 = schema.getPossibleTypes(type); _i2 < _schema$getPossibleTy2.length; _i2++) {\n    var possibleType = _schema$getPossibleTy2[_i2];\n\n    if (!possibleType.getFields()[fieldName]) {\n      continue;\n    } // This object type defines this field.\n\n\n    suggestedTypes.add(possibleType);\n    usageCount[possibleType.name] = 1;\n\n    for (var _i4 = 0, _possibleType$getInte2 = possibleType.getInterfaces(); _i4 < _possibleType$getInte2.length; _i4++) {\n      var _usageCount$possibleI;\n\n      var possibleInterface = _possibleType$getInte2[_i4];\n\n      if (!possibleInterface.getFields()[fieldName]) {\n        continue;\n      } // This interface type defines this field.\n\n\n      suggestedTypes.add(possibleInterface);\n      usageCount[possibleInterface.name] = ((_usageCount$possibleI = usageCount[possibleInterface.name]) !== null && _usageCount$possibleI !== void 0 ? _usageCount$possibleI : 0) + 1;\n    }\n  }\n\n  return arrayFrom(suggestedTypes).sort(function (typeA, typeB) {\n    // Suggest both interface and object types based on how common they are.\n    var usageCountDiff = usageCount[typeB.name] - usageCount[typeA.name];\n\n    if (usageCountDiff !== 0) {\n      return usageCountDiff;\n    } // Suggest super types first followed by subtypes\n\n\n    if (isInterfaceType(typeA) && schema.isSubType(typeA, typeB)) {\n      return -1;\n    }\n\n    if (isInterfaceType(typeB) && schema.isSubType(typeB, typeA)) {\n      return 1;\n    }\n\n    return naturalCompare(typeA.name, typeB.name);\n  }).map(function (x) {\n    return x.name;\n  });\n}\n/**\n * For the field name provided, determine if there are any similar field names\n * that may be the result of a typo.\n */\n\n\nfunction getSuggestedFieldNames(type, fieldName) {\n  if (isObjectType(type) || isInterfaceType(type)) {\n    var possibleFieldNames = Object.keys(type.getFields());\n    return suggestionList(fieldName, possibleFieldNames);\n  } // Otherwise, must be a Union type, which does not define fields.\n\n\n  return [];\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\n\n/**\n * Unique fragment names\n *\n * A GraphQL document is only valid if all defined fragments have unique names.\n */\nexport function UniqueFragmentNamesRule(context) {\n  var knownFragmentNames = Object.create(null);\n  return {\n    OperationDefinition: function OperationDefinition() {\n      return false;\n    },\n    FragmentDefinition: function FragmentDefinition(node) {\n      var fragmentName = node.name.value;\n\n      if (knownFragmentNames[fragmentName]) {\n        context.reportError(new GraphQLError(\"There can be only one fragment named \\\"\".concat(fragmentName, \"\\\".\"), [knownFragmentNames[fragmentName], node.name]));\n      } else {\n        knownFragmentNames[fragmentName] = node.name;\n      }\n\n      return false;\n    }\n  };\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\n\n/**\n * Known fragment names\n *\n * A GraphQL document is only valid if all `...Fragment` fragment spreads refer\n * to fragments defined in the same document.\n */\nexport function KnownFragmentNamesRule(context) {\n  return {\n    FragmentSpread: function FragmentSpread(node) {\n      var fragmentName = node.name.value;\n      var fragment = context.getFragment(fragmentName);\n\n      if (!fragment) {\n        context.reportError(new GraphQLError(\"Unknown fragment \\\"\".concat(fragmentName, \"\\\".\"), node.name));\n      }\n    }\n  };\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\n\n/**\n * No unused fragments\n *\n * A GraphQL document is only valid if all fragment definitions are spread\n * within operations, or spread within other fragments spread within operations.\n */\nexport function NoUnusedFragmentsRule(context) {\n  var operationDefs = [];\n  var fragmentDefs = [];\n  return {\n    OperationDefinition: function OperationDefinition(node) {\n      operationDefs.push(node);\n      return false;\n    },\n    FragmentDefinition: function FragmentDefinition(node) {\n      fragmentDefs.push(node);\n      return false;\n    },\n    Document: {\n      leave: function leave() {\n        var fragmentNameUsed = Object.create(null);\n\n        for (var _i2 = 0; _i2 < operationDefs.length; _i2++) {\n          var operation = operationDefs[_i2];\n\n          for (var _i4 = 0, _context$getRecursive2 = context.getRecursivelyReferencedFragments(operation); _i4 < _context$getRecursive2.length; _i4++) {\n            var fragment = _context$getRecursive2[_i4];\n            fragmentNameUsed[fragment.name.value] = true;\n          }\n        }\n\n        for (var _i6 = 0; _i6 < fragmentDefs.length; _i6++) {\n          var fragmentDef = fragmentDefs[_i6];\n          var fragName = fragmentDef.name.value;\n\n          if (fragmentNameUsed[fragName] !== true) {\n            context.reportError(new GraphQLError(\"Fragment \\\"\".concat(fragName, \"\\\" is never used.\"), fragmentDef));\n          }\n        }\n      }\n    }\n  };\n}\n","import inspect from \"../../jsutils/inspect.mjs\";\nimport { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { isCompositeType } from \"../../type/definition.mjs\";\nimport { typeFromAST } from \"../../utilities/typeFromAST.mjs\";\nimport { doTypesOverlap } from \"../../utilities/typeComparators.mjs\";\n\n/**\n * Possible fragment spread\n *\n * A fragment spread is only valid if the type condition could ever possibly\n * be true: if there is a non-empty intersection of the possible parent types,\n * and possible types which pass the type condition.\n */\nexport function PossibleFragmentSpreadsRule(context) {\n  return {\n    InlineFragment: function InlineFragment(node) {\n      var fragType = context.getType();\n      var parentType = context.getParentType();\n\n      if (isCompositeType(fragType) && isCompositeType(parentType) && !doTypesOverlap(context.getSchema(), fragType, parentType)) {\n        var parentTypeStr = inspect(parentType);\n        var fragTypeStr = inspect(fragType);\n        context.reportError(new GraphQLError(\"Fragment cannot be spread here as objects of type \\\"\".concat(parentTypeStr, \"\\\" can never be of type \\\"\").concat(fragTypeStr, \"\\\".\"), node));\n      }\n    },\n    FragmentSpread: function FragmentSpread(node) {\n      var fragName = node.name.value;\n      var fragType = getFragmentType(context, fragName);\n      var parentType = context.getParentType();\n\n      if (fragType && parentType && !doTypesOverlap(context.getSchema(), fragType, parentType)) {\n        var parentTypeStr = inspect(parentType);\n        var fragTypeStr = inspect(fragType);\n        context.reportError(new GraphQLError(\"Fragment \\\"\".concat(fragName, \"\\\" cannot be spread here as objects of type \\\"\").concat(parentTypeStr, \"\\\" can never be of type \\\"\").concat(fragTypeStr, \"\\\".\"), node));\n      }\n    }\n  };\n}\n\nfunction getFragmentType(context, name) {\n  var frag = context.getFragment(name);\n\n  if (frag) {\n    var type = typeFromAST(context.getSchema(), frag.typeCondition);\n\n    if (isCompositeType(type)) {\n      return type;\n    }\n  }\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\nexport function NoFragmentCyclesRule(context) {\n  // Tracks already visited fragments to maintain O(N) and to ensure that cycles\n  // are not redundantly reported.\n  var visitedFrags = Object.create(null); // Array of AST nodes used to produce meaningful errors\n\n  var spreadPath = []; // Position in the spread path\n\n  var spreadPathIndexByName = Object.create(null);\n  return {\n    OperationDefinition: function OperationDefinition() {\n      return false;\n    },\n    FragmentDefinition: function FragmentDefinition(node) {\n      detectCycleRecursive(node);\n      return false;\n    }\n  }; // This does a straight-forward DFS to find cycles.\n  // It does not terminate when a cycle was found but continues to explore\n  // the graph to find all possible cycles.\n\n  function detectCycleRecursive(fragment) {\n    if (visitedFrags[fragment.name.value]) {\n      return;\n    }\n\n    var fragmentName = fragment.name.value;\n    visitedFrags[fragmentName] = true;\n    var spreadNodes = context.getFragmentSpreads(fragment.selectionSet);\n\n    if (spreadNodes.length === 0) {\n      return;\n    }\n\n    spreadPathIndexByName[fragmentName] = spreadPath.length;\n\n    for (var _i2 = 0; _i2 < spreadNodes.length; _i2++) {\n      var spreadNode = spreadNodes[_i2];\n      var spreadName = spreadNode.name.value;\n      var cycleIndex = spreadPathIndexByName[spreadName];\n      spreadPath.push(spreadNode);\n\n      if (cycleIndex === undefined) {\n        var spreadFragment = context.getFragment(spreadName);\n\n        if (spreadFragment) {\n          detectCycleRecursive(spreadFragment);\n        }\n      } else {\n        var cyclePath = spreadPath.slice(cycleIndex);\n        var viaPath = cyclePath.slice(0, -1).map(function (s) {\n          return '\"' + s.name.value + '\"';\n        }).join(', ');\n        context.reportError(new GraphQLError(\"Cannot spread fragment \\\"\".concat(spreadName, \"\\\" within itself\") + (viaPath !== '' ? \" via \".concat(viaPath, \".\") : '.'), cyclePath));\n      }\n\n      spreadPath.pop();\n    }\n\n    spreadPathIndexByName[fragmentName] = undefined;\n  }\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\n\n/**\n * Unique variable names\n *\n * A GraphQL operation is only valid if all its variables are uniquely named.\n */\nexport function UniqueVariableNamesRule(context) {\n  var knownVariableNames = Object.create(null);\n  return {\n    OperationDefinition: function OperationDefinition() {\n      knownVariableNames = Object.create(null);\n    },\n    VariableDefinition: function VariableDefinition(node) {\n      var variableName = node.variable.name.value;\n\n      if (knownVariableNames[variableName]) {\n        context.reportError(new GraphQLError(\"There can be only one variable named \\\"$\".concat(variableName, \"\\\".\"), [knownVariableNames[variableName], node.variable.name]));\n      } else {\n        knownVariableNames[variableName] = node.variable.name;\n      }\n    }\n  };\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\n\n/**\n * No undefined variables\n *\n * A GraphQL operation is only valid if all variables encountered, both directly\n * and via fragment spreads, are defined by that operation.\n */\nexport function NoUndefinedVariablesRule(context) {\n  var variableNameDefined = Object.create(null);\n  return {\n    OperationDefinition: {\n      enter: function enter() {\n        variableNameDefined = Object.create(null);\n      },\n      leave: function leave(operation) {\n        var usages = context.getRecursiveVariableUsages(operation);\n\n        for (var _i2 = 0; _i2 < usages.length; _i2++) {\n          var _ref2 = usages[_i2];\n          var node = _ref2.node;\n          var varName = node.name.value;\n\n          if (variableNameDefined[varName] !== true) {\n            context.reportError(new GraphQLError(operation.name ? \"Variable \\\"$\".concat(varName, \"\\\" is not defined by operation \\\"\").concat(operation.name.value, \"\\\".\") : \"Variable \\\"$\".concat(varName, \"\\\" is not defined.\"), [node, operation]));\n          }\n        }\n      }\n    },\n    VariableDefinition: function VariableDefinition(node) {\n      variableNameDefined[node.variable.name.value] = true;\n    }\n  };\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\n\n/**\n * No unused variables\n *\n * A GraphQL operation is only valid if all variables defined by an operation\n * are used, either directly or within a spread fragment.\n */\nexport function NoUnusedVariablesRule(context) {\n  var variableDefs = [];\n  return {\n    OperationDefinition: {\n      enter: function enter() {\n        variableDefs = [];\n      },\n      leave: function leave(operation) {\n        var variableNameUsed = Object.create(null);\n        var usages = context.getRecursiveVariableUsages(operation);\n\n        for (var _i2 = 0; _i2 < usages.length; _i2++) {\n          var _ref2 = usages[_i2];\n          var node = _ref2.node;\n          variableNameUsed[node.name.value] = true;\n        }\n\n        for (var _i4 = 0, _variableDefs2 = variableDefs; _i4 < _variableDefs2.length; _i4++) {\n          var variableDef = _variableDefs2[_i4];\n          var variableName = variableDef.variable.name.value;\n\n          if (variableNameUsed[variableName] !== true) {\n            context.reportError(new GraphQLError(operation.name ? \"Variable \\\"$\".concat(variableName, \"\\\" is never used in operation \\\"\").concat(operation.name.value, \"\\\".\") : \"Variable \\\"$\".concat(variableName, \"\\\" is never used.\"), variableDef));\n          }\n        }\n      }\n    },\n    VariableDefinition: function VariableDefinition(def) {\n      variableDefs.push(def);\n    }\n  };\n}\n","import inspect from \"../../jsutils/inspect.mjs\";\nimport invariant from \"../../jsutils/invariant.mjs\";\nimport { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { Kind } from \"../../language/kinds.mjs\";\nimport { DirectiveLocation } from \"../../language/directiveLocation.mjs\";\nimport { specifiedDirectives } from \"../../type/directives.mjs\";\n\n/**\n * Known directives\n *\n * A GraphQL document is only valid if all `@directives` are known by the\n * schema and legally positioned.\n */\nexport function KnownDirectivesRule(context) {\n  var locationsMap = Object.create(null);\n  var schema = context.getSchema();\n  var definedDirectives = schema ? schema.getDirectives() : specifiedDirectives;\n\n  for (var _i2 = 0; _i2 < definedDirectives.length; _i2++) {\n    var directive = definedDirectives[_i2];\n    locationsMap[directive.name] = directive.locations;\n  }\n\n  var astDefinitions = context.getDocument().definitions;\n\n  for (var _i4 = 0; _i4 < astDefinitions.length; _i4++) {\n    var def = astDefinitions[_i4];\n\n    if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      locationsMap[def.name.value] = def.locations.map(function (name) {\n        return name.value;\n      });\n    }\n  }\n\n  return {\n    Directive: function Directive(node, _key, _parent, _path, ancestors) {\n      var name = node.name.value;\n      var locations = locationsMap[name];\n\n      if (!locations) {\n        context.reportError(new GraphQLError(\"Unknown directive \\\"@\".concat(name, \"\\\".\"), node));\n        return;\n      }\n\n      var candidateLocation = getDirectiveLocationForASTPath(ancestors);\n\n      if (candidateLocation && locations.indexOf(candidateLocation) === -1) {\n        context.reportError(new GraphQLError(\"Directive \\\"@\".concat(name, \"\\\" may not be used on \").concat(candidateLocation, \".\"), node));\n      }\n    }\n  };\n}\n\nfunction getDirectiveLocationForASTPath(ancestors) {\n  var appliedTo = ancestors[ancestors.length - 1];\n  !Array.isArray(appliedTo) || invariant(0);\n\n  switch (appliedTo.kind) {\n    case Kind.OPERATION_DEFINITION:\n      return getDirectiveLocationForOperation(appliedTo.operation);\n\n    case Kind.FIELD:\n      return DirectiveLocation.FIELD;\n\n    case Kind.FRAGMENT_SPREAD:\n      return DirectiveLocation.FRAGMENT_SPREAD;\n\n    case Kind.INLINE_FRAGMENT:\n      return DirectiveLocation.INLINE_FRAGMENT;\n\n    case Kind.FRAGMENT_DEFINITION:\n      return DirectiveLocation.FRAGMENT_DEFINITION;\n\n    case Kind.VARIABLE_DEFINITION:\n      return DirectiveLocation.VARIABLE_DEFINITION;\n\n    case Kind.SCHEMA_DEFINITION:\n    case Kind.SCHEMA_EXTENSION:\n      return DirectiveLocation.SCHEMA;\n\n    case Kind.SCALAR_TYPE_DEFINITION:\n    case Kind.SCALAR_TYPE_EXTENSION:\n      return DirectiveLocation.SCALAR;\n\n    case Kind.OBJECT_TYPE_DEFINITION:\n    case Kind.OBJECT_TYPE_EXTENSION:\n      return DirectiveLocation.OBJECT;\n\n    case Kind.FIELD_DEFINITION:\n      return DirectiveLocation.FIELD_DEFINITION;\n\n    case Kind.INTERFACE_TYPE_DEFINITION:\n    case Kind.INTERFACE_TYPE_EXTENSION:\n      return DirectiveLocation.INTERFACE;\n\n    case Kind.UNION_TYPE_DEFINITION:\n    case Kind.UNION_TYPE_EXTENSION:\n      return DirectiveLocation.UNION;\n\n    case Kind.ENUM_TYPE_DEFINITION:\n    case Kind.ENUM_TYPE_EXTENSION:\n      return DirectiveLocation.ENUM;\n\n    case Kind.ENUM_VALUE_DEFINITION:\n      return DirectiveLocation.ENUM_VALUE;\n\n    case Kind.INPUT_OBJECT_TYPE_DEFINITION:\n    case Kind.INPUT_OBJECT_TYPE_EXTENSION:\n      return DirectiveLocation.INPUT_OBJECT;\n\n    case Kind.INPUT_VALUE_DEFINITION:\n      {\n        var parentNode = ancestors[ancestors.length - 3];\n        return parentNode.kind === Kind.INPUT_OBJECT_TYPE_DEFINITION ? DirectiveLocation.INPUT_FIELD_DEFINITION : DirectiveLocation.ARGUMENT_DEFINITION;\n      }\n  }\n}\n\nfunction getDirectiveLocationForOperation(operation) {\n  switch (operation) {\n    case 'query':\n      return DirectiveLocation.QUERY;\n\n    case 'mutation':\n      return DirectiveLocation.MUTATION;\n\n    case 'subscription':\n      return DirectiveLocation.SUBSCRIPTION;\n  } // istanbul ignore next (Not reachable. All possible types have been considered)\n\n\n  false || invariant(0, 'Unexpected operation: ' + inspect(operation));\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { Kind } from \"../../language/kinds.mjs\";\nimport { isTypeDefinitionNode, isTypeExtensionNode } from \"../../language/predicates.mjs\";\nimport { specifiedDirectives } from \"../../type/directives.mjs\";\n\n/**\n * Unique directive names per location\n *\n * A GraphQL document is only valid if all non-repeatable directives at\n * a given location are uniquely named.\n */\nexport function UniqueDirectivesPerLocationRule(context) {\n  var uniqueDirectiveMap = Object.create(null);\n  var schema = context.getSchema();\n  var definedDirectives = schema ? schema.getDirectives() : specifiedDirectives;\n\n  for (var _i2 = 0; _i2 < definedDirectives.length; _i2++) {\n    var directive = definedDirectives[_i2];\n    uniqueDirectiveMap[directive.name] = !directive.isRepeatable;\n  }\n\n  var astDefinitions = context.getDocument().definitions;\n\n  for (var _i4 = 0; _i4 < astDefinitions.length; _i4++) {\n    var def = astDefinitions[_i4];\n\n    if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      uniqueDirectiveMap[def.name.value] = !def.repeatable;\n    }\n  }\n\n  var schemaDirectives = Object.create(null);\n  var typeDirectivesMap = Object.create(null);\n  return {\n    // Many different AST nodes may contain directives. Rather than listing\n    // them all, just listen for entering any node, and check to see if it\n    // defines any directives.\n    enter: function enter(node) {\n      if (node.directives == null) {\n        return;\n      }\n\n      var seenDirectives;\n\n      if (node.kind === Kind.SCHEMA_DEFINITION || node.kind === Kind.SCHEMA_EXTENSION) {\n        seenDirectives = schemaDirectives;\n      } else if (isTypeDefinitionNode(node) || isTypeExtensionNode(node)) {\n        var typeName = node.name.value;\n        seenDirectives = typeDirectivesMap[typeName];\n\n        if (seenDirectives === undefined) {\n          typeDirectivesMap[typeName] = seenDirectives = Object.create(null);\n        }\n      } else {\n        seenDirectives = Object.create(null);\n      }\n\n      for (var _i6 = 0, _node$directives2 = node.directives; _i6 < _node$directives2.length; _i6++) {\n        var _directive = _node$directives2[_i6];\n        var directiveName = _directive.name.value;\n\n        if (uniqueDirectiveMap[directiveName]) {\n          if (seenDirectives[directiveName]) {\n            context.reportError(new GraphQLError(\"The directive \\\"@\".concat(directiveName, \"\\\" can only be used once at this location.\"), [seenDirectives[directiveName], _directive]));\n          } else {\n            seenDirectives[directiveName] = _directive;\n          }\n        }\n      }\n    }\n  };\n}\n","function 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) { _defineProperty(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 _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nimport didYouMean from \"../../jsutils/didYouMean.mjs\";\nimport suggestionList from \"../../jsutils/suggestionList.mjs\";\nimport { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { Kind } from \"../../language/kinds.mjs\";\nimport { specifiedDirectives } from \"../../type/directives.mjs\";\n\n/**\n * Known argument names\n *\n * A GraphQL field is only valid if all supplied arguments are defined by\n * that field.\n */\nexport function KnownArgumentNamesRule(context) {\n  return _objectSpread(_objectSpread({}, KnownArgumentNamesOnDirectivesRule(context)), {}, {\n    Argument: function Argument(argNode) {\n      var argDef = context.getArgument();\n      var fieldDef = context.getFieldDef();\n      var parentType = context.getParentType();\n\n      if (!argDef && fieldDef && parentType) {\n        var argName = argNode.name.value;\n        var knownArgsNames = fieldDef.args.map(function (arg) {\n          return arg.name;\n        });\n        var suggestions = suggestionList(argName, knownArgsNames);\n        context.reportError(new GraphQLError(\"Unknown argument \\\"\".concat(argName, \"\\\" on field \\\"\").concat(parentType.name, \".\").concat(fieldDef.name, \"\\\".\") + didYouMean(suggestions), argNode));\n      }\n    }\n  });\n}\n/**\n * @internal\n */\n\nexport function KnownArgumentNamesOnDirectivesRule(context) {\n  var directiveArgs = Object.create(null);\n  var schema = context.getSchema();\n  var definedDirectives = schema ? schema.getDirectives() : specifiedDirectives;\n\n  for (var _i2 = 0; _i2 < definedDirectives.length; _i2++) {\n    var directive = definedDirectives[_i2];\n    directiveArgs[directive.name] = directive.args.map(function (arg) {\n      return arg.name;\n    });\n  }\n\n  var astDefinitions = context.getDocument().definitions;\n\n  for (var _i4 = 0; _i4 < astDefinitions.length; _i4++) {\n    var def = astDefinitions[_i4];\n\n    if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      var _def$arguments;\n\n      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n      var argsNodes = (_def$arguments = def.arguments) !== null && _def$arguments !== void 0 ? _def$arguments : [];\n      directiveArgs[def.name.value] = argsNodes.map(function (arg) {\n        return arg.name.value;\n      });\n    }\n  }\n\n  return {\n    Directive: function Directive(directiveNode) {\n      var directiveName = directiveNode.name.value;\n      var knownArgs = directiveArgs[directiveName];\n\n      if (directiveNode.arguments && knownArgs) {\n        for (var _i6 = 0, _directiveNode$argume2 = directiveNode.arguments; _i6 < _directiveNode$argume2.length; _i6++) {\n          var argNode = _directiveNode$argume2[_i6];\n          var argName = argNode.name.value;\n\n          if (knownArgs.indexOf(argName) === -1) {\n            var suggestions = suggestionList(argName, knownArgs);\n            context.reportError(new GraphQLError(\"Unknown argument \\\"\".concat(argName, \"\\\" on directive \\\"@\").concat(directiveName, \"\\\".\") + didYouMean(suggestions), argNode));\n          }\n        }\n      }\n\n      return false;\n    }\n  };\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\n\n/**\n * Unique argument names\n *\n * A GraphQL field or directive is only valid if all supplied arguments are\n * uniquely named.\n */\nexport function UniqueArgumentNamesRule(context) {\n  var knownArgNames = Object.create(null);\n  return {\n    Field: function Field() {\n      knownArgNames = Object.create(null);\n    },\n    Directive: function Directive() {\n      knownArgNames = Object.create(null);\n    },\n    Argument: function Argument(node) {\n      var argName = node.name.value;\n\n      if (knownArgNames[argName]) {\n        context.reportError(new GraphQLError(\"There can be only one argument named \\\"\".concat(argName, \"\\\".\"), [knownArgNames[argName], node.name]));\n      } else {\n        knownArgNames[argName] = node.name;\n      }\n\n      return false;\n    }\n  };\n}\n","import objectValues from \"../../polyfills/objectValues.mjs\";\nimport keyMap from \"../../jsutils/keyMap.mjs\";\nimport inspect from \"../../jsutils/inspect.mjs\";\nimport didYouMean from \"../../jsutils/didYouMean.mjs\";\nimport suggestionList from \"../../jsutils/suggestionList.mjs\";\nimport { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { print } from \"../../language/printer.mjs\";\nimport { isLeafType, isInputObjectType, isListType, isNonNullType, isRequiredInputField, getNullableType, getNamedType } from \"../../type/definition.mjs\";\n\n/**\n * Value literals of correct type\n *\n * A GraphQL document is only valid if all value literals are of the type\n * expected at their position.\n */\nexport function ValuesOfCorrectTypeRule(context) {\n  return {\n    ListValue: function ListValue(node) {\n      // Note: TypeInfo will traverse into a list's item type, so look to the\n      // parent input type to check if it is a list.\n      var type = getNullableType(context.getParentInputType());\n\n      if (!isListType(type)) {\n        isValidValueNode(context, node);\n        return false; // Don't traverse further.\n      }\n    },\n    ObjectValue: function ObjectValue(node) {\n      var type = getNamedType(context.getInputType());\n\n      if (!isInputObjectType(type)) {\n        isValidValueNode(context, node);\n        return false; // Don't traverse further.\n      } // Ensure every required field exists.\n\n\n      var fieldNodeMap = keyMap(node.fields, function (field) {\n        return field.name.value;\n      });\n\n      for (var _i2 = 0, _objectValues2 = objectValues(type.getFields()); _i2 < _objectValues2.length; _i2++) {\n        var fieldDef = _objectValues2[_i2];\n        var fieldNode = fieldNodeMap[fieldDef.name];\n\n        if (!fieldNode && isRequiredInputField(fieldDef)) {\n          var typeStr = inspect(fieldDef.type);\n          context.reportError(new GraphQLError(\"Field \\\"\".concat(type.name, \".\").concat(fieldDef.name, \"\\\" of required type \\\"\").concat(typeStr, \"\\\" was not provided.\"), node));\n        }\n      }\n    },\n    ObjectField: function ObjectField(node) {\n      var parentType = getNamedType(context.getParentInputType());\n      var fieldType = context.getInputType();\n\n      if (!fieldType && isInputObjectType(parentType)) {\n        var suggestions = suggestionList(node.name.value, Object.keys(parentType.getFields()));\n        context.reportError(new GraphQLError(\"Field \\\"\".concat(node.name.value, \"\\\" is not defined by type \\\"\").concat(parentType.name, \"\\\".\") + didYouMean(suggestions), node));\n      }\n    },\n    NullValue: function NullValue(node) {\n      var type = context.getInputType();\n\n      if (isNonNullType(type)) {\n        context.reportError(new GraphQLError(\"Expected value of type \\\"\".concat(inspect(type), \"\\\", found \").concat(print(node), \".\"), node));\n      }\n    },\n    EnumValue: function EnumValue(node) {\n      return isValidValueNode(context, node);\n    },\n    IntValue: function IntValue(node) {\n      return isValidValueNode(context, node);\n    },\n    FloatValue: function FloatValue(node) {\n      return isValidValueNode(context, node);\n    },\n    StringValue: function StringValue(node) {\n      return isValidValueNode(context, node);\n    },\n    BooleanValue: function BooleanValue(node) {\n      return isValidValueNode(context, node);\n    }\n  };\n}\n/**\n * Any value literal may be a valid representation of a Scalar, depending on\n * that scalar type.\n */\n\nfunction isValidValueNode(context, node) {\n  // Report any error at the full type expected by the location.\n  var locationType = context.getInputType();\n\n  if (!locationType) {\n    return;\n  }\n\n  var type = getNamedType(locationType);\n\n  if (!isLeafType(type)) {\n    var typeStr = inspect(locationType);\n    context.reportError(new GraphQLError(\"Expected value of type \\\"\".concat(typeStr, \"\\\", found \").concat(print(node), \".\"), node));\n    return;\n  } // Scalars and Enums determine if a literal value is valid via parseLiteral(),\n  // which may throw or return an invalid value to indicate failure.\n\n\n  try {\n    var parseResult = type.parseLiteral(node, undefined\n    /* variables */\n    );\n\n    if (parseResult === undefined) {\n      var _typeStr = inspect(locationType);\n\n      context.reportError(new GraphQLError(\"Expected value of type \\\"\".concat(_typeStr, \"\\\", found \").concat(print(node), \".\"), node));\n    }\n  } catch (error) {\n    var _typeStr2 = inspect(locationType);\n\n    if (error instanceof GraphQLError) {\n      context.reportError(error);\n    } else {\n      context.reportError(new GraphQLError(\"Expected value of type \\\"\".concat(_typeStr2, \"\\\", found \").concat(print(node), \"; \") + error.message, node, undefined, undefined, undefined, error));\n    }\n  }\n}\n","function 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) { _defineProperty(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 _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nimport inspect from \"../../jsutils/inspect.mjs\";\nimport keyMap from \"../../jsutils/keyMap.mjs\";\nimport { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { Kind } from \"../../language/kinds.mjs\";\nimport { print } from \"../../language/printer.mjs\";\nimport { specifiedDirectives } from \"../../type/directives.mjs\";\nimport { isType, isRequiredArgument } from \"../../type/definition.mjs\";\n\n/**\n * Provided required arguments\n *\n * A field or directive is only valid if all required (non-null without a\n * default value) field arguments have been provided.\n */\nexport function ProvidedRequiredArgumentsRule(context) {\n  return _objectSpread(_objectSpread({}, ProvidedRequiredArgumentsOnDirectivesRule(context)), {}, {\n    Field: {\n      // Validate on leave to allow for deeper errors to appear first.\n      leave: function leave(fieldNode) {\n        var _fieldNode$arguments;\n\n        var fieldDef = context.getFieldDef();\n\n        if (!fieldDef) {\n          return false;\n        } // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n\n\n        var argNodes = (_fieldNode$arguments = fieldNode.arguments) !== null && _fieldNode$arguments !== void 0 ? _fieldNode$arguments : [];\n        var argNodeMap = keyMap(argNodes, function (arg) {\n          return arg.name.value;\n        });\n\n        for (var _i2 = 0, _fieldDef$args2 = fieldDef.args; _i2 < _fieldDef$args2.length; _i2++) {\n          var argDef = _fieldDef$args2[_i2];\n          var argNode = argNodeMap[argDef.name];\n\n          if (!argNode && isRequiredArgument(argDef)) {\n            var argTypeStr = inspect(argDef.type);\n            context.reportError(new GraphQLError(\"Field \\\"\".concat(fieldDef.name, \"\\\" argument \\\"\").concat(argDef.name, \"\\\" of type \\\"\").concat(argTypeStr, \"\\\" is required, but it was not provided.\"), fieldNode));\n          }\n        }\n      }\n    }\n  });\n}\n/**\n * @internal\n */\n\nexport function ProvidedRequiredArgumentsOnDirectivesRule(context) {\n  var requiredArgsMap = Object.create(null);\n  var schema = context.getSchema();\n  var definedDirectives = schema ? schema.getDirectives() : specifiedDirectives;\n\n  for (var _i4 = 0; _i4 < definedDirectives.length; _i4++) {\n    var directive = definedDirectives[_i4];\n    requiredArgsMap[directive.name] = keyMap(directive.args.filter(isRequiredArgument), function (arg) {\n      return arg.name;\n    });\n  }\n\n  var astDefinitions = context.getDocument().definitions;\n\n  for (var _i6 = 0; _i6 < astDefinitions.length; _i6++) {\n    var def = astDefinitions[_i6];\n\n    if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      var _def$arguments;\n\n      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n      var argNodes = (_def$arguments = def.arguments) !== null && _def$arguments !== void 0 ? _def$arguments : [];\n      requiredArgsMap[def.name.value] = keyMap(argNodes.filter(isRequiredArgumentNode), function (arg) {\n        return arg.name.value;\n      });\n    }\n  }\n\n  return {\n    Directive: {\n      // Validate on leave to allow for deeper errors to appear first.\n      leave: function leave(directiveNode) {\n        var directiveName = directiveNode.name.value;\n        var requiredArgs = requiredArgsMap[directiveName];\n\n        if (requiredArgs) {\n          var _directiveNode$argume;\n\n          // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n          var _argNodes = (_directiveNode$argume = directiveNode.arguments) !== null && _directiveNode$argume !== void 0 ? _directiveNode$argume : [];\n\n          var argNodeMap = keyMap(_argNodes, function (arg) {\n            return arg.name.value;\n          });\n\n          for (var _i8 = 0, _Object$keys2 = Object.keys(requiredArgs); _i8 < _Object$keys2.length; _i8++) {\n            var argName = _Object$keys2[_i8];\n\n            if (!argNodeMap[argName]) {\n              var argType = requiredArgs[argName].type;\n              var argTypeStr = isType(argType) ? inspect(argType) : print(argType);\n              context.reportError(new GraphQLError(\"Directive \\\"@\".concat(directiveName, \"\\\" argument \\\"\").concat(argName, \"\\\" of type \\\"\").concat(argTypeStr, \"\\\" is required, but it was not provided.\"), directiveNode));\n            }\n          }\n        }\n      }\n    }\n  };\n}\n\nfunction isRequiredArgumentNode(arg) {\n  return arg.type.kind === Kind.NON_NULL_TYPE && arg.defaultValue == null;\n}\n","import inspect from \"../../jsutils/inspect.mjs\";\nimport { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { Kind } from \"../../language/kinds.mjs\";\nimport { isNonNullType } from \"../../type/definition.mjs\";\nimport { typeFromAST } from \"../../utilities/typeFromAST.mjs\";\nimport { isTypeSubTypeOf } from \"../../utilities/typeComparators.mjs\";\n\n/**\n * Variables passed to field arguments conform to type\n */\nexport function VariablesInAllowedPositionRule(context) {\n  var varDefMap = Object.create(null);\n  return {\n    OperationDefinition: {\n      enter: function enter() {\n        varDefMap = Object.create(null);\n      },\n      leave: function leave(operation) {\n        var usages = context.getRecursiveVariableUsages(operation);\n\n        for (var _i2 = 0; _i2 < usages.length; _i2++) {\n          var _ref2 = usages[_i2];\n          var node = _ref2.node;\n          var type = _ref2.type;\n          var defaultValue = _ref2.defaultValue;\n          var varName = node.name.value;\n          var varDef = varDefMap[varName];\n\n          if (varDef && type) {\n            // A var type is allowed if it is the same or more strict (e.g. is\n            // a subtype of) than the expected type. It can be more strict if\n            // the variable type is non-null when the expected type is nullable.\n            // If both are list types, the variable item type can be more strict\n            // than the expected item type (contravariant).\n            var schema = context.getSchema();\n            var varType = typeFromAST(schema, varDef.type);\n\n            if (varType && !allowedVariableUsage(schema, varType, varDef.defaultValue, type, defaultValue)) {\n              var varTypeStr = inspect(varType);\n              var typeStr = inspect(type);\n              context.reportError(new GraphQLError(\"Variable \\\"$\".concat(varName, \"\\\" of type \\\"\").concat(varTypeStr, \"\\\" used in position expecting type \\\"\").concat(typeStr, \"\\\".\"), [varDef, node]));\n            }\n          }\n        }\n      }\n    },\n    VariableDefinition: function VariableDefinition(node) {\n      varDefMap[node.variable.name.value] = node;\n    }\n  };\n}\n/**\n * Returns true if the variable is allowed in the location it was found,\n * which includes considering if default values exist for either the variable\n * or the location at which it is located.\n */\n\nfunction allowedVariableUsage(schema, varType, varDefaultValue, locationType, locationDefaultValue) {\n  if (isNonNullType(locationType) && !isNonNullType(varType)) {\n    var hasNonNullVariableDefaultValue = varDefaultValue != null && varDefaultValue.kind !== Kind.NULL;\n    var hasLocationDefaultValue = locationDefaultValue !== undefined;\n\n    if (!hasNonNullVariableDefaultValue && !hasLocationDefaultValue) {\n      return false;\n    }\n\n    var nullableLocationType = locationType.ofType;\n    return isTypeSubTypeOf(schema, varType, nullableLocationType);\n  }\n\n  return isTypeSubTypeOf(schema, varType, locationType);\n}\n","import find from \"../../polyfills/find.mjs\";\nimport objectEntries from \"../../polyfills/objectEntries.mjs\";\nimport inspect from \"../../jsutils/inspect.mjs\";\nimport { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { Kind } from \"../../language/kinds.mjs\";\nimport { print } from \"../../language/printer.mjs\";\nimport { getNamedType, isNonNullType, isLeafType, isObjectType, isListType, isInterfaceType } from \"../../type/definition.mjs\";\nimport { typeFromAST } from \"../../utilities/typeFromAST.mjs\";\n\nfunction reasonMessage(reason) {\n  if (Array.isArray(reason)) {\n    return reason.map(function (_ref) {\n      var responseName = _ref[0],\n          subReason = _ref[1];\n      return \"subfields \\\"\".concat(responseName, \"\\\" conflict because \") + reasonMessage(subReason);\n    }).join(' and ');\n  }\n\n  return reason;\n}\n/**\n * Overlapping fields can be merged\n *\n * A selection set is only valid if all fields (including spreading any\n * fragments) either correspond to distinct response names or can be merged\n * without ambiguity.\n */\n\n\nexport function OverlappingFieldsCanBeMergedRule(context) {\n  // A memoization for when two fragments are compared \"between\" each other for\n  // conflicts. Two fragments may be compared many times, so memoizing this can\n  // dramatically improve the performance of this validator.\n  var comparedFragmentPairs = new PairSet(); // A cache for the \"field map\" and list of fragment names found in any given\n  // selection set. Selection sets may be asked for this information multiple\n  // times, so this improves the performance of this validator.\n\n  var cachedFieldsAndFragmentNames = new Map();\n  return {\n    SelectionSet: function SelectionSet(selectionSet) {\n      var conflicts = findConflictsWithinSelectionSet(context, cachedFieldsAndFragmentNames, comparedFragmentPairs, context.getParentType(), selectionSet);\n\n      for (var _i2 = 0; _i2 < conflicts.length; _i2++) {\n        var _ref3 = conflicts[_i2];\n        var _ref2$ = _ref3[0];\n        var responseName = _ref2$[0];\n        var reason = _ref2$[1];\n        var fields1 = _ref3[1];\n        var fields2 = _ref3[2];\n        var reasonMsg = reasonMessage(reason);\n        context.reportError(new GraphQLError(\"Fields \\\"\".concat(responseName, \"\\\" conflict because \").concat(reasonMsg, \". Use different aliases on the fields to fetch both if this was intentional.\"), fields1.concat(fields2)));\n      }\n    }\n  };\n}\n\n/**\n * Algorithm:\n *\n * Conflicts occur when two fields exist in a query which will produce the same\n * response name, but represent differing values, thus creating a conflict.\n * The algorithm below finds all conflicts via making a series of comparisons\n * between fields. In order to compare as few fields as possible, this makes\n * a series of comparisons \"within\" sets of fields and \"between\" sets of fields.\n *\n * Given any selection set, a collection produces both a set of fields by\n * also including all inline fragments, as well as a list of fragments\n * referenced by fragment spreads.\n *\n * A) Each selection set represented in the document first compares \"within\" its\n * collected set of fields, finding any conflicts between every pair of\n * overlapping fields.\n * Note: This is the *only time* that a the fields \"within\" a set are compared\n * to each other. After this only fields \"between\" sets are compared.\n *\n * B) Also, if any fragment is referenced in a selection set, then a\n * comparison is made \"between\" the original set of fields and the\n * referenced fragment.\n *\n * C) Also, if multiple fragments are referenced, then comparisons\n * are made \"between\" each referenced fragment.\n *\n * D) When comparing \"between\" a set of fields and a referenced fragment, first\n * a comparison is made between each field in the original set of fields and\n * each field in the the referenced set of fields.\n *\n * E) Also, if any fragment is referenced in the referenced selection set,\n * then a comparison is made \"between\" the original set of fields and the\n * referenced fragment (recursively referring to step D).\n *\n * F) When comparing \"between\" two fragments, first a comparison is made between\n * each field in the first referenced set of fields and each field in the the\n * second referenced set of fields.\n *\n * G) Also, any fragments referenced by the first must be compared to the\n * second, and any fragments referenced by the second must be compared to the\n * first (recursively referring to step F).\n *\n * H) When comparing two fields, if both have selection sets, then a comparison\n * is made \"between\" both selection sets, first comparing the set of fields in\n * the first selection set with the set of fields in the second.\n *\n * I) Also, if any fragment is referenced in either selection set, then a\n * comparison is made \"between\" the other set of fields and the\n * referenced fragment.\n *\n * J) Also, if two fragments are referenced in both selection sets, then a\n * comparison is made \"between\" the two fragments.\n *\n */\n// Find all conflicts found \"within\" a selection set, including those found\n// via spreading in fragments. Called when visiting each SelectionSet in the\n// GraphQL Document.\nfunction findConflictsWithinSelectionSet(context, cachedFieldsAndFragmentNames, comparedFragmentPairs, parentType, selectionSet) {\n  var conflicts = [];\n\n  var _getFieldsAndFragment = getFieldsAndFragmentNames(context, cachedFieldsAndFragmentNames, parentType, selectionSet),\n      fieldMap = _getFieldsAndFragment[0],\n      fragmentNames = _getFieldsAndFragment[1]; // (A) Find find all conflicts \"within\" the fields of this selection set.\n  // Note: this is the *only place* `collectConflictsWithin` is called.\n\n\n  collectConflictsWithin(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, fieldMap);\n\n  if (fragmentNames.length !== 0) {\n    // (B) Then collect conflicts between these fields and those represented by\n    // each spread fragment name found.\n    for (var i = 0; i < fragmentNames.length; i++) {\n      collectConflictsBetweenFieldsAndFragment(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, false, fieldMap, fragmentNames[i]); // (C) Then compare this fragment with all other fragments found in this\n      // selection set to collect conflicts between fragments spread together.\n      // This compares each item in the list of fragment names to every other\n      // item in that same list (except for itself).\n\n      for (var j = i + 1; j < fragmentNames.length; j++) {\n        collectConflictsBetweenFragments(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, false, fragmentNames[i], fragmentNames[j]);\n      }\n    }\n  }\n\n  return conflicts;\n} // Collect all conflicts found between a set of fields and a fragment reference\n// including via spreading in any nested fragments.\n\n\nfunction collectConflictsBetweenFieldsAndFragment(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, areMutuallyExclusive, fieldMap, fragmentName) {\n  var fragment = context.getFragment(fragmentName);\n\n  if (!fragment) {\n    return;\n  }\n\n  var _getReferencedFieldsA = getReferencedFieldsAndFragmentNames(context, cachedFieldsAndFragmentNames, fragment),\n      fieldMap2 = _getReferencedFieldsA[0],\n      fragmentNames2 = _getReferencedFieldsA[1]; // Do not compare a fragment's fieldMap to itself.\n\n\n  if (fieldMap === fieldMap2) {\n    return;\n  } // (D) First collect any conflicts between the provided collection of fields\n  // and the collection of fields represented by the given fragment.\n\n\n  collectConflictsBetween(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, areMutuallyExclusive, fieldMap, fieldMap2); // (E) Then collect any conflicts between the provided collection of fields\n  // and any fragment names found in the given fragment.\n\n  for (var i = 0; i < fragmentNames2.length; i++) {\n    collectConflictsBetweenFieldsAndFragment(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, areMutuallyExclusive, fieldMap, fragmentNames2[i]);\n  }\n} // Collect all conflicts found between two fragments, including via spreading in\n// any nested fragments.\n\n\nfunction collectConflictsBetweenFragments(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, areMutuallyExclusive, fragmentName1, fragmentName2) {\n  // No need to compare a fragment to itself.\n  if (fragmentName1 === fragmentName2) {\n    return;\n  } // Memoize so two fragments are not compared for conflicts more than once.\n\n\n  if (comparedFragmentPairs.has(fragmentName1, fragmentName2, areMutuallyExclusive)) {\n    return;\n  }\n\n  comparedFragmentPairs.add(fragmentName1, fragmentName2, areMutuallyExclusive);\n  var fragment1 = context.getFragment(fragmentName1);\n  var fragment2 = context.getFragment(fragmentName2);\n\n  if (!fragment1 || !fragment2) {\n    return;\n  }\n\n  var _getReferencedFieldsA2 = getReferencedFieldsAndFragmentNames(context, cachedFieldsAndFragmentNames, fragment1),\n      fieldMap1 = _getReferencedFieldsA2[0],\n      fragmentNames1 = _getReferencedFieldsA2[1];\n\n  var _getReferencedFieldsA3 = getReferencedFieldsAndFragmentNames(context, cachedFieldsAndFragmentNames, fragment2),\n      fieldMap2 = _getReferencedFieldsA3[0],\n      fragmentNames2 = _getReferencedFieldsA3[1]; // (F) First, collect all conflicts between these two collections of fields\n  // (not including any nested fragments).\n\n\n  collectConflictsBetween(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, areMutuallyExclusive, fieldMap1, fieldMap2); // (G) Then collect conflicts between the first fragment and any nested\n  // fragments spread in the second fragment.\n\n  for (var j = 0; j < fragmentNames2.length; j++) {\n    collectConflictsBetweenFragments(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, areMutuallyExclusive, fragmentName1, fragmentNames2[j]);\n  } // (G) Then collect conflicts between the second fragment and any nested\n  // fragments spread in the first fragment.\n\n\n  for (var i = 0; i < fragmentNames1.length; i++) {\n    collectConflictsBetweenFragments(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, areMutuallyExclusive, fragmentNames1[i], fragmentName2);\n  }\n} // Find all conflicts found between two selection sets, including those found\n// via spreading in fragments. Called when determining if conflicts exist\n// between the sub-fields of two overlapping fields.\n\n\nfunction findConflictsBetweenSubSelectionSets(context, cachedFieldsAndFragmentNames, comparedFragmentPairs, areMutuallyExclusive, parentType1, selectionSet1, parentType2, selectionSet2) {\n  var conflicts = [];\n\n  var _getFieldsAndFragment2 = getFieldsAndFragmentNames(context, cachedFieldsAndFragmentNames, parentType1, selectionSet1),\n      fieldMap1 = _getFieldsAndFragment2[0],\n      fragmentNames1 = _getFieldsAndFragment2[1];\n\n  var _getFieldsAndFragment3 = getFieldsAndFragmentNames(context, cachedFieldsAndFragmentNames, parentType2, selectionSet2),\n      fieldMap2 = _getFieldsAndFragment3[0],\n      fragmentNames2 = _getFieldsAndFragment3[1]; // (H) First, collect all conflicts between these two collections of field.\n\n\n  collectConflictsBetween(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, areMutuallyExclusive, fieldMap1, fieldMap2); // (I) Then collect conflicts between the first collection of fields and\n  // those referenced by each fragment name associated with the second.\n\n  if (fragmentNames2.length !== 0) {\n    for (var j = 0; j < fragmentNames2.length; j++) {\n      collectConflictsBetweenFieldsAndFragment(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, areMutuallyExclusive, fieldMap1, fragmentNames2[j]);\n    }\n  } // (I) Then collect conflicts between the second collection of fields and\n  // those referenced by each fragment name associated with the first.\n\n\n  if (fragmentNames1.length !== 0) {\n    for (var i = 0; i < fragmentNames1.length; i++) {\n      collectConflictsBetweenFieldsAndFragment(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, areMutuallyExclusive, fieldMap2, fragmentNames1[i]);\n    }\n  } // (J) Also collect conflicts between any fragment names by the first and\n  // fragment names by the second. This compares each item in the first set of\n  // names to each item in the second set of names.\n\n\n  for (var _i3 = 0; _i3 < fragmentNames1.length; _i3++) {\n    for (var _j = 0; _j < fragmentNames2.length; _j++) {\n      collectConflictsBetweenFragments(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, areMutuallyExclusive, fragmentNames1[_i3], fragmentNames2[_j]);\n    }\n  }\n\n  return conflicts;\n} // Collect all Conflicts \"within\" one collection of fields.\n\n\nfunction collectConflictsWithin(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, fieldMap) {\n  // A field map is a keyed collection, where each key represents a response\n  // name and the value at that key is a list of all fields which provide that\n  // response name. For every response name, if there are multiple fields, they\n  // must be compared to find a potential conflict.\n  for (var _i5 = 0, _objectEntries2 = objectEntries(fieldMap); _i5 < _objectEntries2.length; _i5++) {\n    var _ref5 = _objectEntries2[_i5];\n    var responseName = _ref5[0];\n    var fields = _ref5[1];\n\n    // This compares every field in the list to every other field in this list\n    // (except to itself). If the list only has one item, nothing needs to\n    // be compared.\n    if (fields.length > 1) {\n      for (var i = 0; i < fields.length; i++) {\n        for (var j = i + 1; j < fields.length; j++) {\n          var conflict = findConflict(context, cachedFieldsAndFragmentNames, comparedFragmentPairs, false, // within one collection is never mutually exclusive\n          responseName, fields[i], fields[j]);\n\n          if (conflict) {\n            conflicts.push(conflict);\n          }\n        }\n      }\n    }\n  }\n} // Collect all Conflicts between two collections of fields. This is similar to,\n// but different from the `collectConflictsWithin` function above. This check\n// assumes that `collectConflictsWithin` has already been called on each\n// provided collection of fields. This is true because this validator traverses\n// each individual selection set.\n\n\nfunction collectConflictsBetween(context, conflicts, cachedFieldsAndFragmentNames, comparedFragmentPairs, parentFieldsAreMutuallyExclusive, fieldMap1, fieldMap2) {\n  // A field map is a keyed collection, where each key represents a response\n  // name and the value at that key is a list of all fields which provide that\n  // response name. For any response name which appears in both provided field\n  // maps, each field from the first field map must be compared to every field\n  // in the second field map to find potential conflicts.\n  for (var _i7 = 0, _Object$keys2 = Object.keys(fieldMap1); _i7 < _Object$keys2.length; _i7++) {\n    var responseName = _Object$keys2[_i7];\n    var fields2 = fieldMap2[responseName];\n\n    if (fields2) {\n      var fields1 = fieldMap1[responseName];\n\n      for (var i = 0; i < fields1.length; i++) {\n        for (var j = 0; j < fields2.length; j++) {\n          var conflict = findConflict(context, cachedFieldsAndFragmentNames, comparedFragmentPairs, parentFieldsAreMutuallyExclusive, responseName, fields1[i], fields2[j]);\n\n          if (conflict) {\n            conflicts.push(conflict);\n          }\n        }\n      }\n    }\n  }\n} // Determines if there is a conflict between two particular fields, including\n// comparing their sub-fields.\n\n\nfunction findConflict(context, cachedFieldsAndFragmentNames, comparedFragmentPairs, parentFieldsAreMutuallyExclusive, responseName, field1, field2) {\n  var parentType1 = field1[0],\n      node1 = field1[1],\n      def1 = field1[2];\n  var parentType2 = field2[0],\n      node2 = field2[1],\n      def2 = field2[2]; // If it is known that two fields could not possibly apply at the same\n  // time, due to the parent types, then it is safe to permit them to diverge\n  // in aliased field or arguments used as they will not present any ambiguity\n  // by differing.\n  // It is known that two parent types could never overlap if they are\n  // different Object types. Interface or Union types might overlap - if not\n  // in the current state of the schema, then perhaps in some future version,\n  // thus may not safely diverge.\n\n  var areMutuallyExclusive = parentFieldsAreMutuallyExclusive || parentType1 !== parentType2 && isObjectType(parentType1) && isObjectType(parentType2);\n\n  if (!areMutuallyExclusive) {\n    var _node1$arguments, _node2$arguments;\n\n    // Two aliases must refer to the same field.\n    var name1 = node1.name.value;\n    var name2 = node2.name.value;\n\n    if (name1 !== name2) {\n      return [[responseName, \"\\\"\".concat(name1, \"\\\" and \\\"\").concat(name2, \"\\\" are different fields\")], [node1], [node2]];\n    } // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n\n\n    var args1 = (_node1$arguments = node1.arguments) !== null && _node1$arguments !== void 0 ? _node1$arguments : []; // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n\n    var args2 = (_node2$arguments = node2.arguments) !== null && _node2$arguments !== void 0 ? _node2$arguments : []; // Two field calls must have the same arguments.\n\n    if (!sameArguments(args1, args2)) {\n      return [[responseName, 'they have differing arguments'], [node1], [node2]];\n    }\n  } // The return type for each field.\n\n\n  var type1 = def1 === null || def1 === void 0 ? void 0 : def1.type;\n  var type2 = def2 === null || def2 === void 0 ? void 0 : def2.type;\n\n  if (type1 && type2 && doTypesConflict(type1, type2)) {\n    return [[responseName, \"they return conflicting types \\\"\".concat(inspect(type1), \"\\\" and \\\"\").concat(inspect(type2), \"\\\"\")], [node1], [node2]];\n  } // Collect and compare sub-fields. Use the same \"visited fragment names\" list\n  // for both collections so fields in a fragment reference are never\n  // compared to themselves.\n\n\n  var selectionSet1 = node1.selectionSet;\n  var selectionSet2 = node2.selectionSet;\n\n  if (selectionSet1 && selectionSet2) {\n    var conflicts = findConflictsBetweenSubSelectionSets(context, cachedFieldsAndFragmentNames, comparedFragmentPairs, areMutuallyExclusive, getNamedType(type1), selectionSet1, getNamedType(type2), selectionSet2);\n    return subfieldConflicts(conflicts, responseName, node1, node2);\n  }\n}\n\nfunction sameArguments(arguments1, arguments2) {\n  if (arguments1.length !== arguments2.length) {\n    return false;\n  }\n\n  return arguments1.every(function (argument1) {\n    var argument2 = find(arguments2, function (argument) {\n      return argument.name.value === argument1.name.value;\n    });\n\n    if (!argument2) {\n      return false;\n    }\n\n    return sameValue(argument1.value, argument2.value);\n  });\n}\n\nfunction sameValue(value1, value2) {\n  return print(value1) === print(value2);\n} // Two types conflict if both types could not apply to a value simultaneously.\n// Composite types are ignored as their individual field types will be compared\n// later recursively. However List and Non-Null types must match.\n\n\nfunction doTypesConflict(type1, type2) {\n  if (isListType(type1)) {\n    return isListType(type2) ? doTypesConflict(type1.ofType, type2.ofType) : true;\n  }\n\n  if (isListType(type2)) {\n    return true;\n  }\n\n  if (isNonNullType(type1)) {\n    return isNonNullType(type2) ? doTypesConflict(type1.ofType, type2.ofType) : true;\n  }\n\n  if (isNonNullType(type2)) {\n    return true;\n  }\n\n  if (isLeafType(type1) || isLeafType(type2)) {\n    return type1 !== type2;\n  }\n\n  return false;\n} // Given a selection set, return the collection of fields (a mapping of response\n// name to field nodes and definitions) as well as a list of fragment names\n// referenced via fragment spreads.\n\n\nfunction getFieldsAndFragmentNames(context, cachedFieldsAndFragmentNames, parentType, selectionSet) {\n  var cached = cachedFieldsAndFragmentNames.get(selectionSet);\n\n  if (!cached) {\n    var nodeAndDefs = Object.create(null);\n    var fragmentNames = Object.create(null);\n\n    _collectFieldsAndFragmentNames(context, parentType, selectionSet, nodeAndDefs, fragmentNames);\n\n    cached = [nodeAndDefs, Object.keys(fragmentNames)];\n    cachedFieldsAndFragmentNames.set(selectionSet, cached);\n  }\n\n  return cached;\n} // Given a reference to a fragment, return the represented collection of fields\n// as well as a list of nested fragment names referenced via fragment spreads.\n\n\nfunction getReferencedFieldsAndFragmentNames(context, cachedFieldsAndFragmentNames, fragment) {\n  // Short-circuit building a type from the node if possible.\n  var cached = cachedFieldsAndFragmentNames.get(fragment.selectionSet);\n\n  if (cached) {\n    return cached;\n  }\n\n  var fragmentType = typeFromAST(context.getSchema(), fragment.typeCondition);\n  return getFieldsAndFragmentNames(context, cachedFieldsAndFragmentNames, fragmentType, fragment.selectionSet);\n}\n\nfunction _collectFieldsAndFragmentNames(context, parentType, selectionSet, nodeAndDefs, fragmentNames) {\n  for (var _i9 = 0, _selectionSet$selecti2 = selectionSet.selections; _i9 < _selectionSet$selecti2.length; _i9++) {\n    var selection = _selectionSet$selecti2[_i9];\n\n    switch (selection.kind) {\n      case Kind.FIELD:\n        {\n          var fieldName = selection.name.value;\n          var fieldDef = void 0;\n\n          if (isObjectType(parentType) || isInterfaceType(parentType)) {\n            fieldDef = parentType.getFields()[fieldName];\n          }\n\n          var responseName = selection.alias ? selection.alias.value : fieldName;\n\n          if (!nodeAndDefs[responseName]) {\n            nodeAndDefs[responseName] = [];\n          }\n\n          nodeAndDefs[responseName].push([parentType, selection, fieldDef]);\n          break;\n        }\n\n      case Kind.FRAGMENT_SPREAD:\n        fragmentNames[selection.name.value] = true;\n        break;\n\n      case Kind.INLINE_FRAGMENT:\n        {\n          var typeCondition = selection.typeCondition;\n          var inlineFragmentType = typeCondition ? typeFromAST(context.getSchema(), typeCondition) : parentType;\n\n          _collectFieldsAndFragmentNames(context, inlineFragmentType, selection.selectionSet, nodeAndDefs, fragmentNames);\n\n          break;\n        }\n    }\n  }\n} // Given a series of Conflicts which occurred between two sub-fields, generate\n// a single Conflict.\n\n\nfunction subfieldConflicts(conflicts, responseName, node1, node2) {\n  if (conflicts.length > 0) {\n    return [[responseName, conflicts.map(function (_ref6) {\n      var reason = _ref6[0];\n      return reason;\n    })], conflicts.reduce(function (allFields, _ref7) {\n      var fields1 = _ref7[1];\n      return allFields.concat(fields1);\n    }, [node1]), conflicts.reduce(function (allFields, _ref8) {\n      var fields2 = _ref8[2];\n      return allFields.concat(fields2);\n    }, [node2])];\n  }\n}\n/**\n * A way to keep track of pairs of things when the ordering of the pair does\n * not matter. We do this by maintaining a sort of double adjacency sets.\n */\n\n\nvar PairSet = /*#__PURE__*/function () {\n  function PairSet() {\n    this._data = Object.create(null);\n  }\n\n  var _proto = PairSet.prototype;\n\n  _proto.has = function has(a, b, areMutuallyExclusive) {\n    var first = this._data[a];\n    var result = first && first[b];\n\n    if (result === undefined) {\n      return false;\n    } // areMutuallyExclusive being false is a superset of being true,\n    // hence if we want to know if this PairSet \"has\" these two with no\n    // exclusivity, we have to ensure it was added as such.\n\n\n    if (areMutuallyExclusive === false) {\n      return result === false;\n    }\n\n    return true;\n  };\n\n  _proto.add = function add(a, b, areMutuallyExclusive) {\n    this._pairSetAdd(a, b, areMutuallyExclusive);\n\n    this._pairSetAdd(b, a, areMutuallyExclusive);\n  };\n\n  _proto._pairSetAdd = function _pairSetAdd(a, b, areMutuallyExclusive) {\n    var map = this._data[a];\n\n    if (!map) {\n      map = Object.create(null);\n      this._data[a] = map;\n    }\n\n    map[b] = areMutuallyExclusive;\n  };\n\n  return PairSet;\n}();\n","var _defKindToExtKind;\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nimport inspect from \"../../jsutils/inspect.mjs\";\nimport invariant from \"../../jsutils/invariant.mjs\";\nimport didYouMean from \"../../jsutils/didYouMean.mjs\";\nimport suggestionList from \"../../jsutils/suggestionList.mjs\";\nimport { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { Kind } from \"../../language/kinds.mjs\";\nimport { isTypeDefinitionNode } from \"../../language/predicates.mjs\";\nimport { isScalarType, isObjectType, isInterfaceType, isUnionType, isEnumType, isInputObjectType } from \"../../type/definition.mjs\";\n\n/**\n * Possible type extension\n *\n * A type extension is only valid if the type is defined and has the same kind.\n */\nexport function PossibleTypeExtensionsRule(context) {\n  var schema = context.getSchema();\n  var definedTypes = Object.create(null);\n\n  for (var _i2 = 0, _context$getDocument$2 = context.getDocument().definitions; _i2 < _context$getDocument$2.length; _i2++) {\n    var def = _context$getDocument$2[_i2];\n\n    if (isTypeDefinitionNode(def)) {\n      definedTypes[def.name.value] = def;\n    }\n  }\n\n  return {\n    ScalarTypeExtension: checkExtension,\n    ObjectTypeExtension: checkExtension,\n    InterfaceTypeExtension: checkExtension,\n    UnionTypeExtension: checkExtension,\n    EnumTypeExtension: checkExtension,\n    InputObjectTypeExtension: checkExtension\n  };\n\n  function checkExtension(node) {\n    var typeName = node.name.value;\n    var defNode = definedTypes[typeName];\n    var existingType = schema === null || schema === void 0 ? void 0 : schema.getType(typeName);\n    var expectedKind;\n\n    if (defNode) {\n      expectedKind = defKindToExtKind[defNode.kind];\n    } else if (existingType) {\n      expectedKind = typeToExtKind(existingType);\n    }\n\n    if (expectedKind) {\n      if (expectedKind !== node.kind) {\n        var kindStr = extensionKindToTypeName(node.kind);\n        context.reportError(new GraphQLError(\"Cannot extend non-\".concat(kindStr, \" type \\\"\").concat(typeName, \"\\\".\"), defNode ? [defNode, node] : node));\n      }\n    } else {\n      var allTypeNames = Object.keys(definedTypes);\n\n      if (schema) {\n        allTypeNames = allTypeNames.concat(Object.keys(schema.getTypeMap()));\n      }\n\n      var suggestedTypes = suggestionList(typeName, allTypeNames);\n      context.reportError(new GraphQLError(\"Cannot extend type \\\"\".concat(typeName, \"\\\" because it is not defined.\") + didYouMean(suggestedTypes), node.name));\n    }\n  }\n}\nvar defKindToExtKind = (_defKindToExtKind = {}, _defineProperty(_defKindToExtKind, Kind.SCALAR_TYPE_DEFINITION, Kind.SCALAR_TYPE_EXTENSION), _defineProperty(_defKindToExtKind, Kind.OBJECT_TYPE_DEFINITION, Kind.OBJECT_TYPE_EXTENSION), _defineProperty(_defKindToExtKind, Kind.INTERFACE_TYPE_DEFINITION, Kind.INTERFACE_TYPE_EXTENSION), _defineProperty(_defKindToExtKind, Kind.UNION_TYPE_DEFINITION, Kind.UNION_TYPE_EXTENSION), _defineProperty(_defKindToExtKind, Kind.ENUM_TYPE_DEFINITION, Kind.ENUM_TYPE_EXTENSION), _defineProperty(_defKindToExtKind, Kind.INPUT_OBJECT_TYPE_DEFINITION, Kind.INPUT_OBJECT_TYPE_EXTENSION), _defKindToExtKind);\n\nfunction typeToExtKind(type) {\n  if (isScalarType(type)) {\n    return Kind.SCALAR_TYPE_EXTENSION;\n  }\n\n  if (isObjectType(type)) {\n    return Kind.OBJECT_TYPE_EXTENSION;\n  }\n\n  if (isInterfaceType(type)) {\n    return Kind.INTERFACE_TYPE_EXTENSION;\n  }\n\n  if (isUnionType(type)) {\n    return Kind.UNION_TYPE_EXTENSION;\n  }\n\n  if (isEnumType(type)) {\n    return Kind.ENUM_TYPE_EXTENSION;\n  } // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2618')\n\n\n  if (isInputObjectType(type)) {\n    return Kind.INPUT_OBJECT_TYPE_EXTENSION;\n  } // istanbul ignore next (Not reachable. All possible types have been considered)\n\n\n  false || invariant(0, 'Unexpected type: ' + inspect(type));\n}\n\nfunction extensionKindToTypeName(kind) {\n  switch (kind) {\n    case Kind.SCALAR_TYPE_EXTENSION:\n      return 'scalar';\n\n    case Kind.OBJECT_TYPE_EXTENSION:\n      return 'object';\n\n    case Kind.INTERFACE_TYPE_EXTENSION:\n      return 'interface';\n\n    case Kind.UNION_TYPE_EXTENSION:\n      return 'union';\n\n    case Kind.ENUM_TYPE_EXTENSION:\n      return 'enum';\n\n    case Kind.INPUT_OBJECT_TYPE_EXTENSION:\n      return 'input object';\n  } // istanbul ignore next (Not reachable. All possible types have been considered)\n\n\n  false || invariant(0, 'Unexpected kind: ' + inspect(kind));\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\n\n/**\n * Unique input field names\n *\n * A GraphQL input object value is only valid if all supplied fields are\n * uniquely named.\n */\nexport function UniqueInputFieldNamesRule(context) {\n  var knownNameStack = [];\n  var knownNames = Object.create(null);\n  return {\n    ObjectValue: {\n      enter: function enter() {\n        knownNameStack.push(knownNames);\n        knownNames = Object.create(null);\n      },\n      leave: function leave() {\n        knownNames = knownNameStack.pop();\n      }\n    },\n    ObjectField: function ObjectField(node) {\n      var fieldName = node.name.value;\n\n      if (knownNames[fieldName]) {\n        context.reportError(new GraphQLError(\"There can be only one input field named \\\"\".concat(fieldName, \"\\\".\"), [knownNames[fieldName], node.name]));\n      } else {\n        knownNames[fieldName] = node.name;\n      }\n    }\n  };\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\n\n/**\n * Lone Schema definition\n *\n * A GraphQL document is only valid if it contains only one schema definition.\n */\nexport function LoneSchemaDefinitionRule(context) {\n  var _ref, _ref2, _oldSchema$astNode;\n\n  var oldSchema = context.getSchema();\n  var alreadyDefined = (_ref = (_ref2 = (_oldSchema$astNode = oldSchema === null || oldSchema === void 0 ? void 0 : oldSchema.astNode) !== null && _oldSchema$astNode !== void 0 ? _oldSchema$astNode : oldSchema === null || oldSchema === void 0 ? void 0 : oldSchema.getQueryType()) !== null && _ref2 !== void 0 ? _ref2 : oldSchema === null || oldSchema === void 0 ? void 0 : oldSchema.getMutationType()) !== null && _ref !== void 0 ? _ref : oldSchema === null || oldSchema === void 0 ? void 0 : oldSchema.getSubscriptionType();\n  var schemaDefinitionsCount = 0;\n  return {\n    SchemaDefinition: function SchemaDefinition(node) {\n      if (alreadyDefined) {\n        context.reportError(new GraphQLError('Cannot define a new schema within a schema extension.', node));\n        return;\n      }\n\n      if (schemaDefinitionsCount > 0) {\n        context.reportError(new GraphQLError('Must provide only one schema definition.', node));\n      }\n\n      ++schemaDefinitionsCount;\n    }\n  };\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\n\n/**\n * Unique operation types\n *\n * A GraphQL document is only valid if it has only one type per operation.\n */\nexport function UniqueOperationTypesRule(context) {\n  var schema = context.getSchema();\n  var definedOperationTypes = Object.create(null);\n  var existingOperationTypes = schema ? {\n    query: schema.getQueryType(),\n    mutation: schema.getMutationType(),\n    subscription: schema.getSubscriptionType()\n  } : {};\n  return {\n    SchemaDefinition: checkOperationTypes,\n    SchemaExtension: checkOperationTypes\n  };\n\n  function checkOperationTypes(node) {\n    var _node$operationTypes;\n\n    // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n    var operationTypesNodes = (_node$operationTypes = node.operationTypes) !== null && _node$operationTypes !== void 0 ? _node$operationTypes : [];\n\n    for (var _i2 = 0; _i2 < operationTypesNodes.length; _i2++) {\n      var operationType = operationTypesNodes[_i2];\n      var operation = operationType.operation;\n      var alreadyDefinedOperationType = definedOperationTypes[operation];\n\n      if (existingOperationTypes[operation]) {\n        context.reportError(new GraphQLError(\"Type for \".concat(operation, \" already defined in the schema. It cannot be redefined.\"), operationType));\n      } else if (alreadyDefinedOperationType) {\n        context.reportError(new GraphQLError(\"There can be only one \".concat(operation, \" type in schema.\"), [alreadyDefinedOperationType, operationType]));\n      } else {\n        definedOperationTypes[operation] = operationType;\n      }\n    }\n\n    return false;\n  }\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\n\n/**\n * Unique type names\n *\n * A GraphQL document is only valid if all defined types have unique names.\n */\nexport function UniqueTypeNamesRule(context) {\n  var knownTypeNames = Object.create(null);\n  var schema = context.getSchema();\n  return {\n    ScalarTypeDefinition: checkTypeName,\n    ObjectTypeDefinition: checkTypeName,\n    InterfaceTypeDefinition: checkTypeName,\n    UnionTypeDefinition: checkTypeName,\n    EnumTypeDefinition: checkTypeName,\n    InputObjectTypeDefinition: checkTypeName\n  };\n\n  function checkTypeName(node) {\n    var typeName = node.name.value;\n\n    if (schema !== null && schema !== void 0 && schema.getType(typeName)) {\n      context.reportError(new GraphQLError(\"Type \\\"\".concat(typeName, \"\\\" already exists in the schema. It cannot also be defined in this type definition.\"), node.name));\n      return;\n    }\n\n    if (knownTypeNames[typeName]) {\n      context.reportError(new GraphQLError(\"There can be only one type named \\\"\".concat(typeName, \"\\\".\"), [knownTypeNames[typeName], node.name]));\n    } else {\n      knownTypeNames[typeName] = node.name;\n    }\n\n    return false;\n  }\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { isEnumType } from \"../../type/definition.mjs\";\n\n/**\n * Unique enum value names\n *\n * A GraphQL enum type is only valid if all its values are uniquely named.\n */\nexport function UniqueEnumValueNamesRule(context) {\n  var schema = context.getSchema();\n  var existingTypeMap = schema ? schema.getTypeMap() : Object.create(null);\n  var knownValueNames = Object.create(null);\n  return {\n    EnumTypeDefinition: checkValueUniqueness,\n    EnumTypeExtension: checkValueUniqueness\n  };\n\n  function checkValueUniqueness(node) {\n    var _node$values;\n\n    var typeName = node.name.value;\n\n    if (!knownValueNames[typeName]) {\n      knownValueNames[typeName] = Object.create(null);\n    } // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n\n\n    var valueNodes = (_node$values = node.values) !== null && _node$values !== void 0 ? _node$values : [];\n    var valueNames = knownValueNames[typeName];\n\n    for (var _i2 = 0; _i2 < valueNodes.length; _i2++) {\n      var valueDef = valueNodes[_i2];\n      var valueName = valueDef.name.value;\n      var existingType = existingTypeMap[typeName];\n\n      if (isEnumType(existingType) && existingType.getValue(valueName)) {\n        context.reportError(new GraphQLError(\"Enum value \\\"\".concat(typeName, \".\").concat(valueName, \"\\\" already exists in the schema. It cannot also be defined in this type extension.\"), valueDef.name));\n      } else if (valueNames[valueName]) {\n        context.reportError(new GraphQLError(\"Enum value \\\"\".concat(typeName, \".\").concat(valueName, \"\\\" can only be defined once.\"), [valueNames[valueName], valueDef.name]));\n      } else {\n        valueNames[valueName] = valueDef.name;\n      }\n    }\n\n    return false;\n  }\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\nimport { isObjectType, isInterfaceType, isInputObjectType } from \"../../type/definition.mjs\";\n\n/**\n * Unique field definition names\n *\n * A GraphQL complex type is only valid if all its fields are uniquely named.\n */\nexport function UniqueFieldDefinitionNamesRule(context) {\n  var schema = context.getSchema();\n  var existingTypeMap = schema ? schema.getTypeMap() : Object.create(null);\n  var knownFieldNames = Object.create(null);\n  return {\n    InputObjectTypeDefinition: checkFieldUniqueness,\n    InputObjectTypeExtension: checkFieldUniqueness,\n    InterfaceTypeDefinition: checkFieldUniqueness,\n    InterfaceTypeExtension: checkFieldUniqueness,\n    ObjectTypeDefinition: checkFieldUniqueness,\n    ObjectTypeExtension: checkFieldUniqueness\n  };\n\n  function checkFieldUniqueness(node) {\n    var _node$fields;\n\n    var typeName = node.name.value;\n\n    if (!knownFieldNames[typeName]) {\n      knownFieldNames[typeName] = Object.create(null);\n    } // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n\n\n    var fieldNodes = (_node$fields = node.fields) !== null && _node$fields !== void 0 ? _node$fields : [];\n    var fieldNames = knownFieldNames[typeName];\n\n    for (var _i2 = 0; _i2 < fieldNodes.length; _i2++) {\n      var fieldDef = fieldNodes[_i2];\n      var fieldName = fieldDef.name.value;\n\n      if (hasField(existingTypeMap[typeName], fieldName)) {\n        context.reportError(new GraphQLError(\"Field \\\"\".concat(typeName, \".\").concat(fieldName, \"\\\" already exists in the schema. It cannot also be defined in this type extension.\"), fieldDef.name));\n      } else if (fieldNames[fieldName]) {\n        context.reportError(new GraphQLError(\"Field \\\"\".concat(typeName, \".\").concat(fieldName, \"\\\" can only be defined once.\"), [fieldNames[fieldName], fieldDef.name]));\n      } else {\n        fieldNames[fieldName] = fieldDef.name;\n      }\n    }\n\n    return false;\n  }\n}\n\nfunction hasField(type, fieldName) {\n  if (isObjectType(type) || isInterfaceType(type) || isInputObjectType(type)) {\n    return type.getFields()[fieldName] != null;\n  }\n\n  return false;\n}\n","import { GraphQLError } from \"../../error/GraphQLError.mjs\";\n\n/**\n * Unique directive names\n *\n * A GraphQL document is only valid if all defined directives have unique names.\n */\nexport function UniqueDirectiveNamesRule(context) {\n  var knownDirectiveNames = Object.create(null);\n  var schema = context.getSchema();\n  return {\n    DirectiveDefinition: function DirectiveDefinition(node) {\n      var directiveName = node.name.value;\n\n      if (schema !== null && schema !== void 0 && schema.getDirective(directiveName)) {\n        context.reportError(new GraphQLError(\"Directive \\\"@\".concat(directiveName, \"\\\" already exists in the schema. It cannot be redefined.\"), node.name));\n        return;\n      }\n\n      if (knownDirectiveNames[directiveName]) {\n        context.reportError(new GraphQLError(\"There can be only one directive named \\\"@\".concat(directiveName, \"\\\".\"), [knownDirectiveNames[directiveName], node.name]));\n      } else {\n        knownDirectiveNames[directiveName] = node.name;\n      }\n\n      return false;\n    }\n  };\n}\n","// Spec Section: \"Executable Definitions\"\nimport { ExecutableDefinitionsRule } from \"./rules/ExecutableDefinitionsRule.mjs\"; // Spec Section: \"Operation Name Uniqueness\"\n\nimport { UniqueOperationNamesRule } from \"./rules/UniqueOperationNamesRule.mjs\"; // Spec Section: \"Lone Anonymous Operation\"\n\nimport { LoneAnonymousOperationRule } from \"./rules/LoneAnonymousOperationRule.mjs\"; // Spec Section: \"Subscriptions with Single Root Field\"\n\nimport { SingleFieldSubscriptionsRule } from \"./rules/SingleFieldSubscriptionsRule.mjs\"; // Spec Section: \"Fragment Spread Type Existence\"\n\nimport { KnownTypeNamesRule } from \"./rules/KnownTypeNamesRule.mjs\"; // Spec Section: \"Fragments on Composite Types\"\n\nimport { FragmentsOnCompositeTypesRule } from \"./rules/FragmentsOnCompositeTypesRule.mjs\"; // Spec Section: \"Variables are Input Types\"\n\nimport { VariablesAreInputTypesRule } from \"./rules/VariablesAreInputTypesRule.mjs\"; // Spec Section: \"Leaf Field Selections\"\n\nimport { ScalarLeafsRule } from \"./rules/ScalarLeafsRule.mjs\"; // Spec Section: \"Field Selections on Objects, Interfaces, and Unions Types\"\n\nimport { FieldsOnCorrectTypeRule } from \"./rules/FieldsOnCorrectTypeRule.mjs\"; // Spec Section: \"Fragment Name Uniqueness\"\n\nimport { UniqueFragmentNamesRule } from \"./rules/UniqueFragmentNamesRule.mjs\"; // Spec Section: \"Fragment spread target defined\"\n\nimport { KnownFragmentNamesRule } from \"./rules/KnownFragmentNamesRule.mjs\"; // Spec Section: \"Fragments must be used\"\n\nimport { NoUnusedFragmentsRule } from \"./rules/NoUnusedFragmentsRule.mjs\"; // Spec Section: \"Fragment spread is possible\"\n\nimport { PossibleFragmentSpreadsRule } from \"./rules/PossibleFragmentSpreadsRule.mjs\"; // Spec Section: \"Fragments must not form cycles\"\n\nimport { NoFragmentCyclesRule } from \"./rules/NoFragmentCyclesRule.mjs\"; // Spec Section: \"Variable Uniqueness\"\n\nimport { UniqueVariableNamesRule } from \"./rules/UniqueVariableNamesRule.mjs\"; // Spec Section: \"All Variable Used Defined\"\n\nimport { NoUndefinedVariablesRule } from \"./rules/NoUndefinedVariablesRule.mjs\"; // Spec Section: \"All Variables Used\"\n\nimport { NoUnusedVariablesRule } from \"./rules/NoUnusedVariablesRule.mjs\"; // Spec Section: \"Directives Are Defined\"\n\nimport { KnownDirectivesRule } from \"./rules/KnownDirectivesRule.mjs\"; // Spec Section: \"Directives Are Unique Per Location\"\n\nimport { UniqueDirectivesPerLocationRule } from \"./rules/UniqueDirectivesPerLocationRule.mjs\"; // Spec Section: \"Argument Names\"\n\nimport { KnownArgumentNamesRule, KnownArgumentNamesOnDirectivesRule } from \"./rules/KnownArgumentNamesRule.mjs\"; // Spec Section: \"Argument Uniqueness\"\n\nimport { UniqueArgumentNamesRule } from \"./rules/UniqueArgumentNamesRule.mjs\"; // Spec Section: \"Value Type Correctness\"\n\nimport { ValuesOfCorrectTypeRule } from \"./rules/ValuesOfCorrectTypeRule.mjs\"; // Spec Section: \"Argument Optionality\"\n\nimport { ProvidedRequiredArgumentsRule, ProvidedRequiredArgumentsOnDirectivesRule } from \"./rules/ProvidedRequiredArgumentsRule.mjs\"; // Spec Section: \"All Variable Usages Are Allowed\"\n\nimport { VariablesInAllowedPositionRule } from \"./rules/VariablesInAllowedPositionRule.mjs\"; // Spec Section: \"Field Selection Merging\"\n\nimport { OverlappingFieldsCanBeMergedRule } from \"./rules/OverlappingFieldsCanBeMergedRule.mjs\"; // Spec Section: \"Input Object Field Uniqueness\"\n\nimport { UniqueInputFieldNamesRule } from \"./rules/UniqueInputFieldNamesRule.mjs\"; // SDL-specific validation rules\n\nimport { LoneSchemaDefinitionRule } from \"./rules/LoneSchemaDefinitionRule.mjs\";\nimport { UniqueOperationTypesRule } from \"./rules/UniqueOperationTypesRule.mjs\";\nimport { UniqueTypeNamesRule } from \"./rules/UniqueTypeNamesRule.mjs\";\nimport { UniqueEnumValueNamesRule } from \"./rules/UniqueEnumValueNamesRule.mjs\";\nimport { UniqueFieldDefinitionNamesRule } from \"./rules/UniqueFieldDefinitionNamesRule.mjs\";\nimport { UniqueDirectiveNamesRule } from \"./rules/UniqueDirectiveNamesRule.mjs\";\nimport { PossibleTypeExtensionsRule } from \"./rules/PossibleTypeExtensionsRule.mjs\";\n/**\n * This set includes all validation rules defined by the GraphQL spec.\n *\n * The order of the rules in this list has been adjusted to lead to the\n * most clear output when encountering multiple validation errors.\n */\n\nexport var specifiedRules = Object.freeze([ExecutableDefinitionsRule, UniqueOperationNamesRule, LoneAnonymousOperationRule, SingleFieldSubscriptionsRule, KnownTypeNamesRule, FragmentsOnCompositeTypesRule, VariablesAreInputTypesRule, ScalarLeafsRule, FieldsOnCorrectTypeRule, UniqueFragmentNamesRule, KnownFragmentNamesRule, NoUnusedFragmentsRule, PossibleFragmentSpreadsRule, NoFragmentCyclesRule, UniqueVariableNamesRule, NoUndefinedVariablesRule, NoUnusedVariablesRule, KnownDirectivesRule, UniqueDirectivesPerLocationRule, KnownArgumentNamesRule, UniqueArgumentNamesRule, ValuesOfCorrectTypeRule, ProvidedRequiredArgumentsRule, VariablesInAllowedPositionRule, OverlappingFieldsCanBeMergedRule, UniqueInputFieldNamesRule]);\n/**\n * @internal\n */\n\nexport var specifiedSDLRules = Object.freeze([LoneSchemaDefinitionRule, UniqueOperationTypesRule, UniqueTypeNamesRule, UniqueEnumValueNamesRule, UniqueFieldDefinitionNamesRule, UniqueDirectiveNamesRule, KnownTypeNamesRule, KnownDirectivesRule, UniqueDirectivesPerLocationRule, PossibleTypeExtensionsRule, KnownArgumentNamesOnDirectivesRule, UniqueArgumentNamesRule, UniqueInputFieldNamesRule, ProvidedRequiredArgumentsOnDirectivesRule]);\n","function _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nimport { Kind } from \"../language/kinds.mjs\";\nimport { visit } from \"../language/visitor.mjs\";\nimport { TypeInfo, visitWithTypeInfo } from \"../utilities/TypeInfo.mjs\";\n\n/**\n * An instance of this class is passed as the \"this\" context to all validators,\n * allowing access to commonly useful contextual information from within a\n * validation rule.\n */\nexport var ASTValidationContext = /*#__PURE__*/function () {\n  function ASTValidationContext(ast, onError) {\n    this._ast = ast;\n    this._fragments = undefined;\n    this._fragmentSpreads = new Map();\n    this._recursivelyReferencedFragments = new Map();\n    this._onError = onError;\n  }\n\n  var _proto = ASTValidationContext.prototype;\n\n  _proto.reportError = function reportError(error) {\n    this._onError(error);\n  };\n\n  _proto.getDocument = function getDocument() {\n    return this._ast;\n  };\n\n  _proto.getFragment = function getFragment(name) {\n    var fragments = this._fragments;\n\n    if (!fragments) {\n      this._fragments = fragments = this.getDocument().definitions.reduce(function (frags, statement) {\n        if (statement.kind === Kind.FRAGMENT_DEFINITION) {\n          frags[statement.name.value] = statement;\n        }\n\n        return frags;\n      }, Object.create(null));\n    }\n\n    return fragments[name];\n  };\n\n  _proto.getFragmentSpreads = function getFragmentSpreads(node) {\n    var spreads = this._fragmentSpreads.get(node);\n\n    if (!spreads) {\n      spreads = [];\n      var setsToVisit = [node];\n\n      while (setsToVisit.length !== 0) {\n        var set = setsToVisit.pop();\n\n        for (var _i2 = 0, _set$selections2 = set.selections; _i2 < _set$selections2.length; _i2++) {\n          var selection = _set$selections2[_i2];\n\n          if (selection.kind === Kind.FRAGMENT_SPREAD) {\n            spreads.push(selection);\n          } else if (selection.selectionSet) {\n            setsToVisit.push(selection.selectionSet);\n          }\n        }\n      }\n\n      this._fragmentSpreads.set(node, spreads);\n    }\n\n    return spreads;\n  };\n\n  _proto.getRecursivelyReferencedFragments = function getRecursivelyReferencedFragments(operation) {\n    var fragments = this._recursivelyReferencedFragments.get(operation);\n\n    if (!fragments) {\n      fragments = [];\n      var collectedNames = Object.create(null);\n      var nodesToVisit = [operation.selectionSet];\n\n      while (nodesToVisit.length !== 0) {\n        var node = nodesToVisit.pop();\n\n        for (var _i4 = 0, _this$getFragmentSpre2 = this.getFragmentSpreads(node); _i4 < _this$getFragmentSpre2.length; _i4++) {\n          var spread = _this$getFragmentSpre2[_i4];\n          var fragName = spread.name.value;\n\n          if (collectedNames[fragName] !== true) {\n            collectedNames[fragName] = true;\n            var fragment = this.getFragment(fragName);\n\n            if (fragment) {\n              fragments.push(fragment);\n              nodesToVisit.push(fragment.selectionSet);\n            }\n          }\n        }\n      }\n\n      this._recursivelyReferencedFragments.set(operation, fragments);\n    }\n\n    return fragments;\n  };\n\n  return ASTValidationContext;\n}();\nexport var SDLValidationContext = /*#__PURE__*/function (_ASTValidationContext) {\n  _inheritsLoose(SDLValidationContext, _ASTValidationContext);\n\n  function SDLValidationContext(ast, schema, onError) {\n    var _this;\n\n    _this = _ASTValidationContext.call(this, ast, onError) || this;\n    _this._schema = schema;\n    return _this;\n  }\n\n  var _proto2 = SDLValidationContext.prototype;\n\n  _proto2.getSchema = function getSchema() {\n    return this._schema;\n  };\n\n  return SDLValidationContext;\n}(ASTValidationContext);\nexport var ValidationContext = /*#__PURE__*/function (_ASTValidationContext2) {\n  _inheritsLoose(ValidationContext, _ASTValidationContext2);\n\n  function ValidationContext(schema, ast, typeInfo, onError) {\n    var _this2;\n\n    _this2 = _ASTValidationContext2.call(this, ast, onError) || this;\n    _this2._schema = schema;\n    _this2._typeInfo = typeInfo;\n    _this2._variableUsages = new Map();\n    _this2._recursiveVariableUsages = new Map();\n    return _this2;\n  }\n\n  var _proto3 = ValidationContext.prototype;\n\n  _proto3.getSchema = function getSchema() {\n    return this._schema;\n  };\n\n  _proto3.getVariableUsages = function getVariableUsages(node) {\n    var usages = this._variableUsages.get(node);\n\n    if (!usages) {\n      var newUsages = [];\n      var typeInfo = new TypeInfo(this._schema);\n      visit(node, visitWithTypeInfo(typeInfo, {\n        VariableDefinition: function VariableDefinition() {\n          return false;\n        },\n        Variable: function Variable(variable) {\n          newUsages.push({\n            node: variable,\n            type: typeInfo.getInputType(),\n            defaultValue: typeInfo.getDefaultValue()\n          });\n        }\n      }));\n      usages = newUsages;\n\n      this._variableUsages.set(node, usages);\n    }\n\n    return usages;\n  };\n\n  _proto3.getRecursiveVariableUsages = function getRecursiveVariableUsages(operation) {\n    var usages = this._recursiveVariableUsages.get(operation);\n\n    if (!usages) {\n      usages = this.getVariableUsages(operation);\n\n      for (var _i6 = 0, _this$getRecursivelyR2 = this.getRecursivelyReferencedFragments(operation); _i6 < _this$getRecursivelyR2.length; _i6++) {\n        var frag = _this$getRecursivelyR2[_i6];\n        usages = usages.concat(this.getVariableUsages(frag));\n      }\n\n      this._recursiveVariableUsages.set(operation, usages);\n    }\n\n    return usages;\n  };\n\n  _proto3.getType = function getType() {\n    return this._typeInfo.getType();\n  };\n\n  _proto3.getParentType = function getParentType() {\n    return this._typeInfo.getParentType();\n  };\n\n  _proto3.getInputType = function getInputType() {\n    return this._typeInfo.getInputType();\n  };\n\n  _proto3.getParentInputType = function getParentInputType() {\n    return this._typeInfo.getParentInputType();\n  };\n\n  _proto3.getFieldDef = function getFieldDef() {\n    return this._typeInfo.getFieldDef();\n  };\n\n  _proto3.getDirective = function getDirective() {\n    return this._typeInfo.getDirective();\n  };\n\n  _proto3.getArgument = function getArgument() {\n    return this._typeInfo.getArgument();\n  };\n\n  _proto3.getEnumValue = function getEnumValue() {\n    return this._typeInfo.getEnumValue();\n  };\n\n  return ValidationContext;\n}(ASTValidationContext);\n","import devAssert from \"../jsutils/devAssert.mjs\";\nimport { GraphQLError } from \"../error/GraphQLError.mjs\";\nimport { visit, visitInParallel } from \"../language/visitor.mjs\";\nimport { assertValidSchema } from \"../type/validate.mjs\";\nimport { TypeInfo, visitWithTypeInfo } from \"../utilities/TypeInfo.mjs\";\nimport { specifiedRules, specifiedSDLRules } from \"./specifiedRules.mjs\";\nimport { SDLValidationContext, ValidationContext } from \"./ValidationContext.mjs\";\n/**\n * Implements the \"Validation\" section of the spec.\n *\n * Validation runs synchronously, returning an array of encountered errors, or\n * an empty array if no errors were encountered and the document is valid.\n *\n * A list of specific validation rules may be provided. If not provided, the\n * default list of rules defined by the GraphQL specification will be used.\n *\n * Each validation rules is a function which returns a visitor\n * (see the language/visitor API). Visitor methods are expected to return\n * GraphQLErrors, or Arrays of GraphQLErrors when invalid.\n *\n * Optionally a custom TypeInfo instance may be provided. If not provided, one\n * will be created from the provided schema.\n */\n\nexport function validate(schema, documentAST) {\n  var rules = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : specifiedRules;\n  var typeInfo = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : new TypeInfo(schema);\n  var options = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : {\n    maxErrors: undefined\n  };\n  documentAST || devAssert(0, 'Must provide document.'); // If the schema used for validation is invalid, throw an error.\n\n  assertValidSchema(schema);\n  var abortObj = Object.freeze({});\n  var errors = [];\n  var context = new ValidationContext(schema, documentAST, typeInfo, function (error) {\n    if (options.maxErrors != null && errors.length >= options.maxErrors) {\n      errors.push(new GraphQLError('Too many validation errors, error limit reached. Validation aborted.'));\n      throw abortObj;\n    }\n\n    errors.push(error);\n  }); // This uses a specialized visitor which runs multiple visitors in parallel,\n  // while maintaining the visitor skip and break API.\n\n  var visitor = visitInParallel(rules.map(function (rule) {\n    return rule(context);\n  })); // Visit the whole document with each instance of all provided rules.\n\n  try {\n    visit(documentAST, visitWithTypeInfo(typeInfo, visitor));\n  } catch (e) {\n    if (e !== abortObj) {\n      throw e;\n    }\n  }\n\n  return errors;\n}\n/**\n * @internal\n */\n\nexport function validateSDL(documentAST, schemaToExtend) {\n  var rules = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : specifiedSDLRules;\n  var errors = [];\n  var context = new SDLValidationContext(documentAST, schemaToExtend, function (error) {\n    errors.push(error);\n  });\n  var visitors = rules.map(function (rule) {\n    return rule(context);\n  });\n  visit(documentAST, visitInParallel(visitors));\n  return errors;\n}\n/**\n * Utility function which asserts a SDL document is valid by throwing an error\n * if it is invalid.\n *\n * @internal\n */\n\nexport function assertValidSDL(documentAST) {\n  var errors = validateSDL(documentAST);\n\n  if (errors.length !== 0) {\n    throw new Error(errors.map(function (error) {\n      return error.message;\n    }).join('\\n\\n'));\n  }\n}\n/**\n * Utility function which asserts a SDL document is valid by throwing an error\n * if it is invalid.\n *\n * @internal\n */\n\nexport function assertValidSDLExtension(documentAST, schema) {\n  var errors = validateSDL(documentAST, schema);\n\n  if (errors.length !== 0) {\n    throw new Error(errors.map(function (error) {\n      return error.message;\n    }).join('\\n\\n'));\n  }\n}\n","/**\n * Given a Path and a key, return a new Path containing the new key.\n */\nexport function addPath(prev, key, typename) {\n  return {\n    prev: prev,\n    key: key,\n    typename: typename\n  };\n}\n/**\n * Given a Path, return an Array of the path keys.\n */\n\nexport function pathToArray(path) {\n  var flattened = [];\n  var curr = path;\n\n  while (curr) {\n    flattened.push(curr.key);\n    curr = curr.prev;\n  }\n\n  return flattened.reverse();\n}\n","import { GraphQLError } from \"../error/GraphQLError.mjs\";\n\n/**\n * Extracts the root type of the operation from the schema.\n */\nexport function getOperationRootType(schema, operation) {\n  if (operation.operation === 'query') {\n    var queryType = schema.getQueryType();\n\n    if (!queryType) {\n      throw new GraphQLError('Schema does not define the required query root type.', operation);\n    }\n\n    return queryType;\n  }\n\n  if (operation.operation === 'mutation') {\n    var mutationType = schema.getMutationType();\n\n    if (!mutationType) {\n      throw new GraphQLError('Schema is not configured for mutations.', operation);\n    }\n\n    return mutationType;\n  }\n\n  if (operation.operation === 'subscription') {\n    var subscriptionType = schema.getSubscriptionType();\n\n    if (!subscriptionType) {\n      throw new GraphQLError('Schema is not configured for subscriptions.', operation);\n    }\n\n    return subscriptionType;\n  }\n\n  throw new GraphQLError('Can only have query, mutation and subscription operations.', operation);\n}\n","/**\n * Build a string describing the path.\n */\nexport default function printPathArray(path) {\n  return path.map(function (key) {\n    return typeof key === 'number' ? '[' + key.toString() + ']' : '.' + key;\n  }).join('');\n}\n","import objectValues from \"../polyfills/objectValues.mjs\";\nimport keyMap from \"../jsutils/keyMap.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport invariant from \"../jsutils/invariant.mjs\";\nimport { Kind } from \"../language/kinds.mjs\";\nimport { isLeafType, isInputObjectType, isListType, isNonNullType } from \"../type/definition.mjs\";\n/**\n * Produces a JavaScript value given a GraphQL Value AST.\n *\n * A GraphQL type must be provided, which will be used to interpret different\n * GraphQL Value literals.\n *\n * Returns `undefined` when the value could not be validly coerced according to\n * the provided type.\n *\n * | GraphQL Value        | JSON Value    |\n * | -------------------- | ------------- |\n * | Input Object         | Object        |\n * | List                 | Array         |\n * | Boolean              | Boolean       |\n * | String               | String        |\n * | Int / Float          | Number        |\n * | Enum Value           | Mixed         |\n * | NullValue            | null          |\n *\n */\n\nexport function valueFromAST(valueNode, type, variables) {\n  if (!valueNode) {\n    // When there is no node, then there is also no value.\n    // Importantly, this is different from returning the value null.\n    return;\n  }\n\n  if (valueNode.kind === Kind.VARIABLE) {\n    var variableName = valueNode.name.value;\n\n    if (variables == null || variables[variableName] === undefined) {\n      // No valid return value.\n      return;\n    }\n\n    var variableValue = variables[variableName];\n\n    if (variableValue === null && isNonNullType(type)) {\n      return; // Invalid: intentionally return no value.\n    } // Note: This does no further checking that this variable is correct.\n    // This assumes that this query has been validated and the variable\n    // usage here is of the correct type.\n\n\n    return variableValue;\n  }\n\n  if (isNonNullType(type)) {\n    if (valueNode.kind === Kind.NULL) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    return valueFromAST(valueNode, type.ofType, variables);\n  }\n\n  if (valueNode.kind === Kind.NULL) {\n    // This is explicitly returning the value null.\n    return null;\n  }\n\n  if (isListType(type)) {\n    var itemType = type.ofType;\n\n    if (valueNode.kind === Kind.LIST) {\n      var coercedValues = [];\n\n      for (var _i2 = 0, _valueNode$values2 = valueNode.values; _i2 < _valueNode$values2.length; _i2++) {\n        var itemNode = _valueNode$values2[_i2];\n\n        if (isMissingVariable(itemNode, variables)) {\n          // If an array contains a missing variable, it is either coerced to\n          // null or if the item type is non-null, it considered invalid.\n          if (isNonNullType(itemType)) {\n            return; // Invalid: intentionally return no value.\n          }\n\n          coercedValues.push(null);\n        } else {\n          var itemValue = valueFromAST(itemNode, itemType, variables);\n\n          if (itemValue === undefined) {\n            return; // Invalid: intentionally return no value.\n          }\n\n          coercedValues.push(itemValue);\n        }\n      }\n\n      return coercedValues;\n    }\n\n    var coercedValue = valueFromAST(valueNode, itemType, variables);\n\n    if (coercedValue === undefined) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    return [coercedValue];\n  }\n\n  if (isInputObjectType(type)) {\n    if (valueNode.kind !== Kind.OBJECT) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    var coercedObj = Object.create(null);\n    var fieldNodes = keyMap(valueNode.fields, function (field) {\n      return field.name.value;\n    });\n\n    for (var _i4 = 0, _objectValues2 = objectValues(type.getFields()); _i4 < _objectValues2.length; _i4++) {\n      var field = _objectValues2[_i4];\n      var fieldNode = fieldNodes[field.name];\n\n      if (!fieldNode || isMissingVariable(fieldNode.value, variables)) {\n        if (field.defaultValue !== undefined) {\n          coercedObj[field.name] = field.defaultValue;\n        } else if (isNonNullType(field.type)) {\n          return; // Invalid: intentionally return no value.\n        }\n\n        continue;\n      }\n\n      var fieldValue = valueFromAST(fieldNode.value, field.type, variables);\n\n      if (fieldValue === undefined) {\n        return; // Invalid: intentionally return no value.\n      }\n\n      coercedObj[field.name] = fieldValue;\n    }\n\n    return coercedObj;\n  } // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2618')\n\n\n  if (isLeafType(type)) {\n    // Scalars and Enums fulfill parsing a literal value via parseLiteral().\n    // Invalid values represent a failure to parse correctly, in which case\n    // no value is returned.\n    var result;\n\n    try {\n      result = type.parseLiteral(valueNode, variables);\n    } catch (_error) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    if (result === undefined) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    return result;\n  } // istanbul ignore next (Not reachable. All possible input types have been considered)\n\n\n  false || invariant(0, 'Unexpected input type: ' + inspect(type));\n} // Returns true if the provided valueNode is a variable which is not defined\n// in the set of variables.\n\nfunction isMissingVariable(valueNode, variables) {\n  return valueNode.kind === Kind.VARIABLE && (variables == null || variables[valueNode.name.value] === undefined);\n}\n","import objectValues from \"../polyfills/objectValues.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport invariant from \"../jsutils/invariant.mjs\";\nimport didYouMean from \"../jsutils/didYouMean.mjs\";\nimport isObjectLike from \"../jsutils/isObjectLike.mjs\";\nimport safeArrayFrom from \"../jsutils/safeArrayFrom.mjs\";\nimport suggestionList from \"../jsutils/suggestionList.mjs\";\nimport printPathArray from \"../jsutils/printPathArray.mjs\";\nimport { addPath, pathToArray } from \"../jsutils/Path.mjs\";\nimport { GraphQLError } from \"../error/GraphQLError.mjs\";\nimport { isLeafType, isInputObjectType, isListType, isNonNullType } from \"../type/definition.mjs\";\n\n/**\n * Coerces a JavaScript value given a GraphQL Input Type.\n */\nexport function coerceInputValue(inputValue, type) {\n  var onError = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : defaultOnError;\n  return coerceInputValueImpl(inputValue, type, onError);\n}\n\nfunction defaultOnError(path, invalidValue, error) {\n  var errorPrefix = 'Invalid value ' + inspect(invalidValue);\n\n  if (path.length > 0) {\n    errorPrefix += \" at \\\"value\".concat(printPathArray(path), \"\\\"\");\n  }\n\n  error.message = errorPrefix + ': ' + error.message;\n  throw error;\n}\n\nfunction coerceInputValueImpl(inputValue, type, onError, path) {\n  if (isNonNullType(type)) {\n    if (inputValue != null) {\n      return coerceInputValueImpl(inputValue, type.ofType, onError, path);\n    }\n\n    onError(pathToArray(path), inputValue, new GraphQLError(\"Expected non-nullable type \\\"\".concat(inspect(type), \"\\\" not to be null.\")));\n    return;\n  }\n\n  if (inputValue == null) {\n    // Explicitly return the value null.\n    return null;\n  }\n\n  if (isListType(type)) {\n    var itemType = type.ofType;\n    var coercedList = safeArrayFrom(inputValue, function (itemValue, index) {\n      var itemPath = addPath(path, index, undefined);\n      return coerceInputValueImpl(itemValue, itemType, onError, itemPath);\n    });\n\n    if (coercedList != null) {\n      return coercedList;\n    } // Lists accept a non-list value as a list of one.\n\n\n    return [coerceInputValueImpl(inputValue, itemType, onError, path)];\n  }\n\n  if (isInputObjectType(type)) {\n    if (!isObjectLike(inputValue)) {\n      onError(pathToArray(path), inputValue, new GraphQLError(\"Expected type \\\"\".concat(type.name, \"\\\" to be an object.\")));\n      return;\n    }\n\n    var coercedValue = {};\n    var fieldDefs = type.getFields();\n\n    for (var _i2 = 0, _objectValues2 = objectValues(fieldDefs); _i2 < _objectValues2.length; _i2++) {\n      var field = _objectValues2[_i2];\n      var fieldValue = inputValue[field.name];\n\n      if (fieldValue === undefined) {\n        if (field.defaultValue !== undefined) {\n          coercedValue[field.name] = field.defaultValue;\n        } else if (isNonNullType(field.type)) {\n          var typeStr = inspect(field.type);\n          onError(pathToArray(path), inputValue, new GraphQLError(\"Field \\\"\".concat(field.name, \"\\\" of required type \\\"\").concat(typeStr, \"\\\" was not provided.\")));\n        }\n\n        continue;\n      }\n\n      coercedValue[field.name] = coerceInputValueImpl(fieldValue, field.type, onError, addPath(path, field.name, type.name));\n    } // Ensure every provided field is defined.\n\n\n    for (var _i4 = 0, _Object$keys2 = Object.keys(inputValue); _i4 < _Object$keys2.length; _i4++) {\n      var fieldName = _Object$keys2[_i4];\n\n      if (!fieldDefs[fieldName]) {\n        var suggestions = suggestionList(fieldName, Object.keys(type.getFields()));\n        onError(pathToArray(path), inputValue, new GraphQLError(\"Field \\\"\".concat(fieldName, \"\\\" is not defined by type \\\"\").concat(type.name, \"\\\".\") + didYouMean(suggestions)));\n      }\n    }\n\n    return coercedValue;\n  } // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2618')\n\n\n  if (isLeafType(type)) {\n    var parseResult; // Scalars and Enums determine if a input value is valid via parseValue(),\n    // which can throw to indicate failure. If it throws, maintain a reference\n    // to the original error.\n\n    try {\n      parseResult = type.parseValue(inputValue);\n    } catch (error) {\n      if (error instanceof GraphQLError) {\n        onError(pathToArray(path), inputValue, error);\n      } else {\n        onError(pathToArray(path), inputValue, new GraphQLError(\"Expected type \\\"\".concat(type.name, \"\\\". \") + error.message, undefined, undefined, undefined, undefined, error));\n      }\n\n      return;\n    }\n\n    if (parseResult === undefined) {\n      onError(pathToArray(path), inputValue, new GraphQLError(\"Expected type \\\"\".concat(type.name, \"\\\".\")));\n    }\n\n    return parseResult;\n  } // istanbul ignore next (Not reachable. All possible input types have been considered)\n\n\n  false || invariant(0, 'Unexpected input type: ' + inspect(type));\n}\n","import find from \"../polyfills/find.mjs\";\nimport keyMap from \"../jsutils/keyMap.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport printPathArray from \"../jsutils/printPathArray.mjs\";\nimport { GraphQLError } from \"../error/GraphQLError.mjs\";\nimport { Kind } from \"../language/kinds.mjs\";\nimport { print } from \"../language/printer.mjs\";\nimport { isInputType, isNonNullType } from \"../type/definition.mjs\";\nimport { typeFromAST } from \"../utilities/typeFromAST.mjs\";\nimport { valueFromAST } from \"../utilities/valueFromAST.mjs\";\nimport { coerceInputValue } from \"../utilities/coerceInputValue.mjs\";\n\n/**\n * Prepares an object map of variableValues of the correct type based on the\n * provided variable definitions and arbitrary input. If the input cannot be\n * parsed to match the variable definitions, a GraphQLError will be thrown.\n *\n * Note: The returned value is a plain Object with a prototype, since it is\n * exposed to user code. Care should be taken to not pull values from the\n * Object prototype.\n *\n * @internal\n */\nexport function getVariableValues(schema, varDefNodes, inputs, options) {\n  var errors = [];\n  var maxErrors = options === null || options === void 0 ? void 0 : options.maxErrors;\n\n  try {\n    var coerced = coerceVariableValues(schema, varDefNodes, inputs, function (error) {\n      if (maxErrors != null && errors.length >= maxErrors) {\n        throw new GraphQLError('Too many errors processing variables, error limit reached. Execution aborted.');\n      }\n\n      errors.push(error);\n    });\n\n    if (errors.length === 0) {\n      return {\n        coerced: coerced\n      };\n    }\n  } catch (error) {\n    errors.push(error);\n  }\n\n  return {\n    errors: errors\n  };\n}\n\nfunction coerceVariableValues(schema, varDefNodes, inputs, onError) {\n  var coercedValues = {};\n\n  var _loop = function _loop(_i2) {\n    var varDefNode = varDefNodes[_i2];\n    var varName = varDefNode.variable.name.value;\n    var varType = typeFromAST(schema, varDefNode.type);\n\n    if (!isInputType(varType)) {\n      // Must use input types for variables. This should be caught during\n      // validation, however is checked again here for safety.\n      var varTypeStr = print(varDefNode.type);\n      onError(new GraphQLError(\"Variable \\\"$\".concat(varName, \"\\\" expected value of type \\\"\").concat(varTypeStr, \"\\\" which cannot be used as an input type.\"), varDefNode.type));\n      return \"continue\";\n    }\n\n    if (!hasOwnProperty(inputs, varName)) {\n      if (varDefNode.defaultValue) {\n        coercedValues[varName] = valueFromAST(varDefNode.defaultValue, varType);\n      } else if (isNonNullType(varType)) {\n        var _varTypeStr = inspect(varType);\n\n        onError(new GraphQLError(\"Variable \\\"$\".concat(varName, \"\\\" of required type \\\"\").concat(_varTypeStr, \"\\\" was not provided.\"), varDefNode));\n      }\n\n      return \"continue\";\n    }\n\n    var value = inputs[varName];\n\n    if (value === null && isNonNullType(varType)) {\n      var _varTypeStr2 = inspect(varType);\n\n      onError(new GraphQLError(\"Variable \\\"$\".concat(varName, \"\\\" of non-null type \\\"\").concat(_varTypeStr2, \"\\\" must not be null.\"), varDefNode));\n      return \"continue\";\n    }\n\n    coercedValues[varName] = coerceInputValue(value, varType, function (path, invalidValue, error) {\n      var prefix = \"Variable \\\"$\".concat(varName, \"\\\" got invalid value \") + inspect(invalidValue);\n\n      if (path.length > 0) {\n        prefix += \" at \\\"\".concat(varName).concat(printPathArray(path), \"\\\"\");\n      }\n\n      onError(new GraphQLError(prefix + '; ' + error.message, varDefNode, undefined, undefined, undefined, error.originalError));\n    });\n  };\n\n  for (var _i2 = 0; _i2 < varDefNodes.length; _i2++) {\n    var _ret = _loop(_i2);\n\n    if (_ret === \"continue\") continue;\n  }\n\n  return coercedValues;\n}\n/**\n * Prepares an object map of argument values given a list of argument\n * definitions and list of argument AST nodes.\n *\n * Note: The returned value is a plain Object with a prototype, since it is\n * exposed to user code. Care should be taken to not pull values from the\n * Object prototype.\n *\n * @internal\n */\n\n\nexport function getArgumentValues(def, node, variableValues) {\n  var _node$arguments;\n\n  var coercedValues = {}; // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n\n  var argumentNodes = (_node$arguments = node.arguments) !== null && _node$arguments !== void 0 ? _node$arguments : [];\n  var argNodeMap = keyMap(argumentNodes, function (arg) {\n    return arg.name.value;\n  });\n\n  for (var _i4 = 0, _def$args2 = def.args; _i4 < _def$args2.length; _i4++) {\n    var argDef = _def$args2[_i4];\n    var name = argDef.name;\n    var argType = argDef.type;\n    var argumentNode = argNodeMap[name];\n\n    if (!argumentNode) {\n      if (argDef.defaultValue !== undefined) {\n        coercedValues[name] = argDef.defaultValue;\n      } else if (isNonNullType(argType)) {\n        throw new GraphQLError(\"Argument \\\"\".concat(name, \"\\\" of required type \\\"\").concat(inspect(argType), \"\\\" \") + 'was not provided.', node);\n      }\n\n      continue;\n    }\n\n    var valueNode = argumentNode.value;\n    var isNull = valueNode.kind === Kind.NULL;\n\n    if (valueNode.kind === Kind.VARIABLE) {\n      var variableName = valueNode.name.value;\n\n      if (variableValues == null || !hasOwnProperty(variableValues, variableName)) {\n        if (argDef.defaultValue !== undefined) {\n          coercedValues[name] = argDef.defaultValue;\n        } else if (isNonNullType(argType)) {\n          throw new GraphQLError(\"Argument \\\"\".concat(name, \"\\\" of required type \\\"\").concat(inspect(argType), \"\\\" \") + \"was provided the variable \\\"$\".concat(variableName, \"\\\" which was not provided a runtime value.\"), valueNode);\n        }\n\n        continue;\n      }\n\n      isNull = variableValues[variableName] == null;\n    }\n\n    if (isNull && isNonNullType(argType)) {\n      throw new GraphQLError(\"Argument \\\"\".concat(name, \"\\\" of non-null type \\\"\").concat(inspect(argType), \"\\\" \") + 'must not be null.', valueNode);\n    }\n\n    var coercedValue = valueFromAST(valueNode, argType, variableValues);\n\n    if (coercedValue === undefined) {\n      // Note: ValuesOfCorrectTypeRule validation should catch this before\n      // execution. This is a runtime check to ensure execution does not\n      // continue with an invalid argument value.\n      throw new GraphQLError(\"Argument \\\"\".concat(name, \"\\\" has invalid value \").concat(print(valueNode), \".\"), valueNode);\n    }\n\n    coercedValues[name] = coercedValue;\n  }\n\n  return coercedValues;\n}\n/**\n * Prepares an object map of argument values given a directive definition\n * and a AST node which may contain directives. Optionally also accepts a map\n * of variable values.\n *\n * If the directive does not exist on the node, returns undefined.\n *\n * Note: The returned value is a plain Object with a prototype, since it is\n * exposed to user code. Care should be taken to not pull values from the\n * Object prototype.\n */\n\nexport function getDirectiveValues(directiveDef, node, variableValues) {\n  var directiveNode = node.directives && find(node.directives, function (directive) {\n    return directive.name.value === directiveDef.name;\n  });\n\n  if (directiveNode) {\n    return getArgumentValues(directiveDef, directiveNode, variableValues);\n  }\n}\n\nfunction hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n","import inspect from \"../jsutils/inspect.mjs\";\nimport memoize3 from \"../jsutils/memoize3.mjs\";\nimport invariant from \"../jsutils/invariant.mjs\";\nimport devAssert from \"../jsutils/devAssert.mjs\";\nimport isPromise from \"../jsutils/isPromise.mjs\";\nimport isObjectLike from \"../jsutils/isObjectLike.mjs\";\nimport safeArrayFrom from \"../jsutils/safeArrayFrom.mjs\";\nimport promiseReduce from \"../jsutils/promiseReduce.mjs\";\nimport promiseForObject from \"../jsutils/promiseForObject.mjs\";\nimport { addPath, pathToArray } from \"../jsutils/Path.mjs\";\nimport { GraphQLError } from \"../error/GraphQLError.mjs\";\nimport { locatedError } from \"../error/locatedError.mjs\";\nimport { Kind } from \"../language/kinds.mjs\";\nimport { assertValidSchema } from \"../type/validate.mjs\";\nimport { SchemaMetaFieldDef, TypeMetaFieldDef, TypeNameMetaFieldDef } from \"../type/introspection.mjs\";\nimport { GraphQLIncludeDirective, GraphQLSkipDirective } from \"../type/directives.mjs\";\nimport { isNamedType, isObjectType, isAbstractType, isLeafType, isListType, isNonNullType } from \"../type/definition.mjs\";\nimport { typeFromAST } from \"../utilities/typeFromAST.mjs\";\nimport { getOperationRootType } from \"../utilities/getOperationRootType.mjs\";\nimport { getVariableValues, getArgumentValues, getDirectiveValues } from \"./values.mjs\";\n/**\n * Terminology\n *\n * \"Definitions\" are the generic name for top-level statements in the document.\n * Examples of this include:\n * 1) Operations (such as a query)\n * 2) Fragments\n *\n * \"Operations\" are a generic name for requests in the document.\n * Examples of this include:\n * 1) query,\n * 2) mutation\n *\n * \"Selections\" are the definitions that can appear legally and at\n * single level of the query. These include:\n * 1) field references e.g \"a\"\n * 2) fragment \"spreads\" e.g. \"...c\"\n * 3) inline fragment \"spreads\" e.g. \"...on Type { a }\"\n */\n\n/**\n * Data that must be available at all points during query execution.\n *\n * Namely, schema of the type system that is currently executing,\n * and the fragments defined in the query document\n */\n\nexport function execute(argsOrSchema, document, rootValue, contextValue, variableValues, operationName, fieldResolver, typeResolver) {\n  /* eslint-enable no-redeclare */\n  // Extract arguments from object args if provided.\n  return arguments.length === 1 ? executeImpl(argsOrSchema) : executeImpl({\n    schema: argsOrSchema,\n    document: document,\n    rootValue: rootValue,\n    contextValue: contextValue,\n    variableValues: variableValues,\n    operationName: operationName,\n    fieldResolver: fieldResolver,\n    typeResolver: typeResolver\n  });\n}\n/**\n * Also implements the \"Evaluating requests\" section of the GraphQL specification.\n * However, it guarantees to complete synchronously (or throw an error) assuming\n * that all field resolvers are also synchronous.\n */\n\nexport function executeSync(args) {\n  var result = executeImpl(args); // Assert that the execution was synchronous.\n\n  if (isPromise(result)) {\n    throw new Error('GraphQL execution failed to complete synchronously.');\n  }\n\n  return result;\n}\n\nfunction executeImpl(args) {\n  var schema = args.schema,\n      document = args.document,\n      rootValue = args.rootValue,\n      contextValue = args.contextValue,\n      variableValues = args.variableValues,\n      operationName = args.operationName,\n      fieldResolver = args.fieldResolver,\n      typeResolver = args.typeResolver; // If arguments are missing or incorrect, throw an error.\n\n  assertValidExecutionArguments(schema, document, variableValues); // If a valid execution context cannot be created due to incorrect arguments,\n  // a \"Response\" with only errors is returned.\n\n  var exeContext = buildExecutionContext(schema, document, rootValue, contextValue, variableValues, operationName, fieldResolver, typeResolver); // Return early errors if execution context failed.\n\n  if (Array.isArray(exeContext)) {\n    return {\n      errors: exeContext\n    };\n  } // Return a Promise that will eventually resolve to the data described by\n  // The \"Response\" section of the GraphQL specification.\n  //\n  // If errors are encountered while executing a GraphQL field, only that\n  // field and its descendants will be omitted, and sibling fields will still\n  // be executed. An execution which encounters errors will still result in a\n  // resolved Promise.\n\n\n  var data = executeOperation(exeContext, exeContext.operation, rootValue);\n  return buildResponse(exeContext, data);\n}\n/**\n * Given a completed execution context and data, build the { errors, data }\n * response defined by the \"Response\" section of the GraphQL specification.\n */\n\n\nfunction buildResponse(exeContext, data) {\n  if (isPromise(data)) {\n    return data.then(function (resolved) {\n      return buildResponse(exeContext, resolved);\n    });\n  }\n\n  return exeContext.errors.length === 0 ? {\n    data: data\n  } : {\n    errors: exeContext.errors,\n    data: data\n  };\n}\n/**\n * Essential assertions before executing to provide developer feedback for\n * improper use of the GraphQL library.\n *\n * @internal\n */\n\n\nexport function assertValidExecutionArguments(schema, document, rawVariableValues) {\n  document || devAssert(0, 'Must provide document.'); // If the schema used for execution is invalid, throw an error.\n\n  assertValidSchema(schema); // Variables, if provided, must be an object.\n\n  rawVariableValues == null || isObjectLike(rawVariableValues) || devAssert(0, 'Variables must be provided as an Object where each property is a variable value. Perhaps look to see if an unparsed JSON string was provided.');\n}\n/**\n * Constructs a ExecutionContext object from the arguments passed to\n * execute, which we will pass throughout the other execution methods.\n *\n * Throws a GraphQLError if a valid execution context cannot be created.\n *\n * @internal\n */\n\nexport function buildExecutionContext(schema, document, rootValue, contextValue, rawVariableValues, operationName, fieldResolver, typeResolver) {\n  var _definition$name, _operation$variableDe;\n\n  var operation;\n  var fragments = Object.create(null);\n\n  for (var _i2 = 0, _document$definitions2 = document.definitions; _i2 < _document$definitions2.length; _i2++) {\n    var definition = _document$definitions2[_i2];\n\n    switch (definition.kind) {\n      case Kind.OPERATION_DEFINITION:\n        if (operationName == null) {\n          if (operation !== undefined) {\n            return [new GraphQLError('Must provide operation name if query contains multiple operations.')];\n          }\n\n          operation = definition;\n        } else if (((_definition$name = definition.name) === null || _definition$name === void 0 ? void 0 : _definition$name.value) === operationName) {\n          operation = definition;\n        }\n\n        break;\n\n      case Kind.FRAGMENT_DEFINITION:\n        fragments[definition.name.value] = definition;\n        break;\n    }\n  }\n\n  if (!operation) {\n    if (operationName != null) {\n      return [new GraphQLError(\"Unknown operation named \\\"\".concat(operationName, \"\\\".\"))];\n    }\n\n    return [new GraphQLError('Must provide an operation.')];\n  } // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n\n\n  var variableDefinitions = (_operation$variableDe = operation.variableDefinitions) !== null && _operation$variableDe !== void 0 ? _operation$variableDe : [];\n  var coercedVariableValues = getVariableValues(schema, variableDefinitions, rawVariableValues !== null && rawVariableValues !== void 0 ? rawVariableValues : {}, {\n    maxErrors: 50\n  });\n\n  if (coercedVariableValues.errors) {\n    return coercedVariableValues.errors;\n  }\n\n  return {\n    schema: schema,\n    fragments: fragments,\n    rootValue: rootValue,\n    contextValue: contextValue,\n    operation: operation,\n    variableValues: coercedVariableValues.coerced,\n    fieldResolver: fieldResolver !== null && fieldResolver !== void 0 ? fieldResolver : defaultFieldResolver,\n    typeResolver: typeResolver !== null && typeResolver !== void 0 ? typeResolver : defaultTypeResolver,\n    errors: []\n  };\n}\n/**\n * Implements the \"Evaluating operations\" section of the spec.\n */\n\nfunction executeOperation(exeContext, operation, rootValue) {\n  var type = getOperationRootType(exeContext.schema, operation);\n  var fields = collectFields(exeContext, type, operation.selectionSet, Object.create(null), Object.create(null));\n  var path = undefined; // Errors from sub-fields of a NonNull type may propagate to the top level,\n  // at which point we still log the error and null the parent field, which\n  // in this case is the entire response.\n\n  try {\n    var result = operation.operation === 'mutation' ? executeFieldsSerially(exeContext, type, rootValue, path, fields) : executeFields(exeContext, type, rootValue, path, fields);\n\n    if (isPromise(result)) {\n      return result.then(undefined, function (error) {\n        exeContext.errors.push(error);\n        return Promise.resolve(null);\n      });\n    }\n\n    return result;\n  } catch (error) {\n    exeContext.errors.push(error);\n    return null;\n  }\n}\n/**\n * Implements the \"Evaluating selection sets\" section of the spec\n * for \"write\" mode.\n */\n\n\nfunction executeFieldsSerially(exeContext, parentType, sourceValue, path, fields) {\n  return promiseReduce(Object.keys(fields), function (results, responseName) {\n    var fieldNodes = fields[responseName];\n    var fieldPath = addPath(path, responseName, parentType.name);\n    var result = resolveField(exeContext, parentType, sourceValue, fieldNodes, fieldPath);\n\n    if (result === undefined) {\n      return results;\n    }\n\n    if (isPromise(result)) {\n      return result.then(function (resolvedResult) {\n        results[responseName] = resolvedResult;\n        return results;\n      });\n    }\n\n    results[responseName] = result;\n    return results;\n  }, Object.create(null));\n}\n/**\n * Implements the \"Evaluating selection sets\" section of the spec\n * for \"read\" mode.\n */\n\n\nfunction executeFields(exeContext, parentType, sourceValue, path, fields) {\n  var results = Object.create(null);\n  var containsPromise = false;\n\n  for (var _i4 = 0, _Object$keys2 = Object.keys(fields); _i4 < _Object$keys2.length; _i4++) {\n    var responseName = _Object$keys2[_i4];\n    var fieldNodes = fields[responseName];\n    var fieldPath = addPath(path, responseName, parentType.name);\n    var result = resolveField(exeContext, parentType, sourceValue, fieldNodes, fieldPath);\n\n    if (result !== undefined) {\n      results[responseName] = result;\n\n      if (isPromise(result)) {\n        containsPromise = true;\n      }\n    }\n  } // If there are no promises, we can just return the object\n\n\n  if (!containsPromise) {\n    return results;\n  } // Otherwise, results is a map from field name to the result of resolving that\n  // field, which is possibly a promise. Return a promise that will return this\n  // same map, but with any promises replaced with the values they resolved to.\n\n\n  return promiseForObject(results);\n}\n/**\n * Given a selectionSet, adds all of the fields in that selection to\n * the passed in map of fields, and returns it at the end.\n *\n * CollectFields requires the \"runtime type\" of an object. For a field which\n * returns an Interface or Union type, the \"runtime type\" will be the actual\n * Object type returned by that field.\n *\n * @internal\n */\n\n\nexport function collectFields(exeContext, runtimeType, selectionSet, fields, visitedFragmentNames) {\n  for (var _i6 = 0, _selectionSet$selecti2 = selectionSet.selections; _i6 < _selectionSet$selecti2.length; _i6++) {\n    var selection = _selectionSet$selecti2[_i6];\n\n    switch (selection.kind) {\n      case Kind.FIELD:\n        {\n          if (!shouldIncludeNode(exeContext, selection)) {\n            continue;\n          }\n\n          var name = getFieldEntryKey(selection);\n\n          if (!fields[name]) {\n            fields[name] = [];\n          }\n\n          fields[name].push(selection);\n          break;\n        }\n\n      case Kind.INLINE_FRAGMENT:\n        {\n          if (!shouldIncludeNode(exeContext, selection) || !doesFragmentConditionMatch(exeContext, selection, runtimeType)) {\n            continue;\n          }\n\n          collectFields(exeContext, runtimeType, selection.selectionSet, fields, visitedFragmentNames);\n          break;\n        }\n\n      case Kind.FRAGMENT_SPREAD:\n        {\n          var fragName = selection.name.value;\n\n          if (visitedFragmentNames[fragName] || !shouldIncludeNode(exeContext, selection)) {\n            continue;\n          }\n\n          visitedFragmentNames[fragName] = true;\n          var fragment = exeContext.fragments[fragName];\n\n          if (!fragment || !doesFragmentConditionMatch(exeContext, fragment, runtimeType)) {\n            continue;\n          }\n\n          collectFields(exeContext, runtimeType, fragment.selectionSet, fields, visitedFragmentNames);\n          break;\n        }\n    }\n  }\n\n  return fields;\n}\n/**\n * Determines if a field should be included based on the @include and @skip\n * directives, where @skip has higher precedence than @include.\n */\n\nfunction shouldIncludeNode(exeContext, node) {\n  var skip = getDirectiveValues(GraphQLSkipDirective, node, exeContext.variableValues);\n\n  if ((skip === null || skip === void 0 ? void 0 : skip.if) === true) {\n    return false;\n  }\n\n  var include = getDirectiveValues(GraphQLIncludeDirective, node, exeContext.variableValues);\n\n  if ((include === null || include === void 0 ? void 0 : include.if) === false) {\n    return false;\n  }\n\n  return true;\n}\n/**\n * Determines if a fragment is applicable to the given type.\n */\n\n\nfunction doesFragmentConditionMatch(exeContext, fragment, type) {\n  var typeConditionNode = fragment.typeCondition;\n\n  if (!typeConditionNode) {\n    return true;\n  }\n\n  var conditionalType = typeFromAST(exeContext.schema, typeConditionNode);\n\n  if (conditionalType === type) {\n    return true;\n  }\n\n  if (isAbstractType(conditionalType)) {\n    return exeContext.schema.isSubType(conditionalType, type);\n  }\n\n  return false;\n}\n/**\n * Implements the logic to compute the key of a given field's entry\n */\n\n\nfunction getFieldEntryKey(node) {\n  return node.alias ? node.alias.value : node.name.value;\n}\n/**\n * Resolves the field on the given source object. In particular, this\n * figures out the value that the field returns by calling its resolve function,\n * then calls completeValue to complete promises, serialize scalars, or execute\n * the sub-selection-set for objects.\n */\n\n\nfunction resolveField(exeContext, parentType, source, fieldNodes, path) {\n  var _fieldDef$resolve;\n\n  var fieldNode = fieldNodes[0];\n  var fieldName = fieldNode.name.value;\n  var fieldDef = getFieldDef(exeContext.schema, parentType, fieldName);\n\n  if (!fieldDef) {\n    return;\n  }\n\n  var returnType = fieldDef.type;\n  var resolveFn = (_fieldDef$resolve = fieldDef.resolve) !== null && _fieldDef$resolve !== void 0 ? _fieldDef$resolve : exeContext.fieldResolver;\n  var info = buildResolveInfo(exeContext, fieldDef, fieldNodes, parentType, path); // Get the resolve function, regardless of if its result is normal or abrupt (error).\n\n  try {\n    // Build a JS object of arguments from the field.arguments AST, using the\n    // variables scope to fulfill any variable references.\n    // TODO: find a way to memoize, in case this field is within a List type.\n    var args = getArgumentValues(fieldDef, fieldNodes[0], exeContext.variableValues); // The resolve function's optional third argument is a context value that\n    // is provided to every resolve function within an execution. It is commonly\n    // used to represent an authenticated user, or request-specific caches.\n\n    var _contextValue = exeContext.contextValue;\n    var result = resolveFn(source, args, _contextValue, info);\n    var completed;\n\n    if (isPromise(result)) {\n      completed = result.then(function (resolved) {\n        return completeValue(exeContext, returnType, fieldNodes, info, path, resolved);\n      });\n    } else {\n      completed = completeValue(exeContext, returnType, fieldNodes, info, path, result);\n    }\n\n    if (isPromise(completed)) {\n      // Note: we don't rely on a `catch` method, but we do expect \"thenable\"\n      // to take a second callback for the error case.\n      return completed.then(undefined, function (rawError) {\n        var error = locatedError(rawError, fieldNodes, pathToArray(path));\n        return handleFieldError(error, returnType, exeContext);\n      });\n    }\n\n    return completed;\n  } catch (rawError) {\n    var error = locatedError(rawError, fieldNodes, pathToArray(path));\n    return handleFieldError(error, returnType, exeContext);\n  }\n}\n/**\n * @internal\n */\n\n\nexport function buildResolveInfo(exeContext, fieldDef, fieldNodes, parentType, path) {\n  // The resolve function's optional fourth argument is a collection of\n  // information about the current execution state.\n  return {\n    fieldName: fieldDef.name,\n    fieldNodes: fieldNodes,\n    returnType: fieldDef.type,\n    parentType: parentType,\n    path: path,\n    schema: exeContext.schema,\n    fragments: exeContext.fragments,\n    rootValue: exeContext.rootValue,\n    operation: exeContext.operation,\n    variableValues: exeContext.variableValues\n  };\n}\n\nfunction handleFieldError(error, returnType, exeContext) {\n  // If the field type is non-nullable, then it is resolved without any\n  // protection from errors, however it still properly locates the error.\n  if (isNonNullType(returnType)) {\n    throw error;\n  } // Otherwise, error protection is applied, logging the error and resolving\n  // a null value for this field if one is encountered.\n\n\n  exeContext.errors.push(error);\n  return null;\n}\n/**\n * Implements the instructions for completeValue as defined in the\n * \"Field entries\" section of the spec.\n *\n * If the field type is Non-Null, then this recursively completes the value\n * for the inner type. It throws a field error if that completion returns null,\n * as per the \"Nullability\" section of the spec.\n *\n * If the field type is a List, then this recursively completes the value\n * for the inner type on each item in the list.\n *\n * If the field type is a Scalar or Enum, ensures the completed value is a legal\n * value of the type by calling the `serialize` method of GraphQL type\n * definition.\n *\n * If the field is an abstract type, determine the runtime type of the value\n * and then complete based on that type\n *\n * Otherwise, the field type expects a sub-selection set, and will complete the\n * value by evaluating all sub-selections.\n */\n\n\nfunction completeValue(exeContext, returnType, fieldNodes, info, path, result) {\n  // If result is an Error, throw a located error.\n  if (result instanceof Error) {\n    throw result;\n  } // If field type is NonNull, complete for inner type, and throw field error\n  // if result is null.\n\n\n  if (isNonNullType(returnType)) {\n    var completed = completeValue(exeContext, returnType.ofType, fieldNodes, info, path, result);\n\n    if (completed === null) {\n      throw new Error(\"Cannot return null for non-nullable field \".concat(info.parentType.name, \".\").concat(info.fieldName, \".\"));\n    }\n\n    return completed;\n  } // If result value is null or undefined then return null.\n\n\n  if (result == null) {\n    return null;\n  } // If field type is List, complete each item in the list with the inner type\n\n\n  if (isListType(returnType)) {\n    return completeListValue(exeContext, returnType, fieldNodes, info, path, result);\n  } // If field type is a leaf type, Scalar or Enum, serialize to a valid value,\n  // returning null if serialization is not possible.\n\n\n  if (isLeafType(returnType)) {\n    return completeLeafValue(returnType, result);\n  } // If field type is an abstract type, Interface or Union, determine the\n  // runtime Object type and complete for that type.\n\n\n  if (isAbstractType(returnType)) {\n    return completeAbstractValue(exeContext, returnType, fieldNodes, info, path, result);\n  } // If field type is Object, execute and complete all sub-selections.\n  // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2618')\n\n\n  if (isObjectType(returnType)) {\n    return completeObjectValue(exeContext, returnType, fieldNodes, info, path, result);\n  } // istanbul ignore next (Not reachable. All possible output types have been considered)\n\n\n  false || invariant(0, 'Cannot complete value of unexpected output type: ' + inspect(returnType));\n}\n/**\n * Complete a list value by completing each item in the list with the\n * inner type\n */\n\n\nfunction completeListValue(exeContext, returnType, fieldNodes, info, path, result) {\n  // This is specified as a simple map, however we're optimizing the path\n  // where the list contains no Promises by avoiding creating another Promise.\n  var itemType = returnType.ofType;\n  var containsPromise = false;\n  var completedResults = safeArrayFrom(result, function (item, index) {\n    // No need to modify the info object containing the path,\n    // since from here on it is not ever accessed by resolver functions.\n    var itemPath = addPath(path, index, undefined);\n\n    try {\n      var completedItem;\n\n      if (isPromise(item)) {\n        completedItem = item.then(function (resolved) {\n          return completeValue(exeContext, itemType, fieldNodes, info, itemPath, resolved);\n        });\n      } else {\n        completedItem = completeValue(exeContext, itemType, fieldNodes, info, itemPath, item);\n      }\n\n      if (isPromise(completedItem)) {\n        containsPromise = true; // Note: we don't rely on a `catch` method, but we do expect \"thenable\"\n        // to take a second callback for the error case.\n\n        return completedItem.then(undefined, function (rawError) {\n          var error = locatedError(rawError, fieldNodes, pathToArray(itemPath));\n          return handleFieldError(error, itemType, exeContext);\n        });\n      }\n\n      return completedItem;\n    } catch (rawError) {\n      var error = locatedError(rawError, fieldNodes, pathToArray(itemPath));\n      return handleFieldError(error, itemType, exeContext);\n    }\n  });\n\n  if (completedResults == null) {\n    throw new GraphQLError(\"Expected Iterable, but did not find one for field \\\"\".concat(info.parentType.name, \".\").concat(info.fieldName, \"\\\".\"));\n  }\n\n  return containsPromise ? Promise.all(completedResults) : completedResults;\n}\n/**\n * Complete a Scalar or Enum by serializing to a valid value, returning\n * null if serialization is not possible.\n */\n\n\nfunction completeLeafValue(returnType, result) {\n  var serializedResult = returnType.serialize(result);\n\n  if (serializedResult === undefined) {\n    throw new Error(\"Expected a value of type \\\"\".concat(inspect(returnType), \"\\\" but \") + \"received: \".concat(inspect(result)));\n  }\n\n  return serializedResult;\n}\n/**\n * Complete a value of an abstract type by determining the runtime object type\n * of that value, then complete the value for that type.\n */\n\n\nfunction completeAbstractValue(exeContext, returnType, fieldNodes, info, path, result) {\n  var _returnType$resolveTy;\n\n  var resolveTypeFn = (_returnType$resolveTy = returnType.resolveType) !== null && _returnType$resolveTy !== void 0 ? _returnType$resolveTy : exeContext.typeResolver;\n  var contextValue = exeContext.contextValue;\n  var runtimeType = resolveTypeFn(result, contextValue, info, returnType);\n\n  if (isPromise(runtimeType)) {\n    return runtimeType.then(function (resolvedRuntimeType) {\n      return completeObjectValue(exeContext, ensureValidRuntimeType(resolvedRuntimeType, exeContext, returnType, fieldNodes, info, result), fieldNodes, info, path, result);\n    });\n  }\n\n  return completeObjectValue(exeContext, ensureValidRuntimeType(runtimeType, exeContext, returnType, fieldNodes, info, result), fieldNodes, info, path, result);\n}\n\nfunction ensureValidRuntimeType(runtimeTypeOrName, exeContext, returnType, fieldNodes, info, result) {\n  if (runtimeTypeOrName == null) {\n    throw new GraphQLError(\"Abstract type \\\"\".concat(returnType.name, \"\\\" must resolve to an Object type at runtime for field \\\"\").concat(info.parentType.name, \".\").concat(info.fieldName, \"\\\". Either the \\\"\").concat(returnType.name, \"\\\" type should provide a \\\"resolveType\\\" function or each possible type should provide an \\\"isTypeOf\\\" function.\"), fieldNodes);\n  } // FIXME: temporary workaround until support for passing object types would be removed in v16.0.0\n\n\n  var runtimeTypeName = isNamedType(runtimeTypeOrName) ? runtimeTypeOrName.name : runtimeTypeOrName;\n\n  if (typeof runtimeTypeName !== 'string') {\n    throw new GraphQLError(\"Abstract type \\\"\".concat(returnType.name, \"\\\" must resolve to an Object type at runtime for field \\\"\").concat(info.parentType.name, \".\").concat(info.fieldName, \"\\\" with \") + \"value \".concat(inspect(result), \", received \\\"\").concat(inspect(runtimeTypeOrName), \"\\\".\"));\n  }\n\n  var runtimeType = exeContext.schema.getType(runtimeTypeName);\n\n  if (runtimeType == null) {\n    throw new GraphQLError(\"Abstract type \\\"\".concat(returnType.name, \"\\\" was resolve to a type \\\"\").concat(runtimeTypeName, \"\\\" that does not exist inside schema.\"), fieldNodes);\n  }\n\n  if (!isObjectType(runtimeType)) {\n    throw new GraphQLError(\"Abstract type \\\"\".concat(returnType.name, \"\\\" was resolve to a non-object type \\\"\").concat(runtimeTypeName, \"\\\".\"), fieldNodes);\n  }\n\n  if (!exeContext.schema.isSubType(returnType, runtimeType)) {\n    throw new GraphQLError(\"Runtime Object type \\\"\".concat(runtimeType.name, \"\\\" is not a possible type for \\\"\").concat(returnType.name, \"\\\".\"), fieldNodes);\n  }\n\n  return runtimeType;\n}\n/**\n * Complete an Object value by executing all sub-selections.\n */\n\n\nfunction completeObjectValue(exeContext, returnType, fieldNodes, info, path, result) {\n  // If there is an isTypeOf predicate function, call it with the\n  // current result. If isTypeOf returns false, then raise an error rather\n  // than continuing execution.\n  if (returnType.isTypeOf) {\n    var isTypeOf = returnType.isTypeOf(result, exeContext.contextValue, info);\n\n    if (isPromise(isTypeOf)) {\n      return isTypeOf.then(function (resolvedIsTypeOf) {\n        if (!resolvedIsTypeOf) {\n          throw invalidReturnTypeError(returnType, result, fieldNodes);\n        }\n\n        return collectAndExecuteSubfields(exeContext, returnType, fieldNodes, path, result);\n      });\n    }\n\n    if (!isTypeOf) {\n      throw invalidReturnTypeError(returnType, result, fieldNodes);\n    }\n  }\n\n  return collectAndExecuteSubfields(exeContext, returnType, fieldNodes, path, result);\n}\n\nfunction invalidReturnTypeError(returnType, result, fieldNodes) {\n  return new GraphQLError(\"Expected value of type \\\"\".concat(returnType.name, \"\\\" but got: \").concat(inspect(result), \".\"), fieldNodes);\n}\n\nfunction collectAndExecuteSubfields(exeContext, returnType, fieldNodes, path, result) {\n  // Collect sub-fields to execute to complete this value.\n  var subFieldNodes = collectSubfields(exeContext, returnType, fieldNodes);\n  return executeFields(exeContext, returnType, result, path, subFieldNodes);\n}\n/**\n * A memoized collection of relevant subfields with regard to the return\n * type. Memoizing ensures the subfields are not repeatedly calculated, which\n * saves overhead when resolving lists of values.\n */\n\n\nvar collectSubfields = memoize3(_collectSubfields);\n\nfunction _collectSubfields(exeContext, returnType, fieldNodes) {\n  var subFieldNodes = Object.create(null);\n  var visitedFragmentNames = Object.create(null);\n\n  for (var _i8 = 0; _i8 < fieldNodes.length; _i8++) {\n    var node = fieldNodes[_i8];\n\n    if (node.selectionSet) {\n      subFieldNodes = collectFields(exeContext, returnType, node.selectionSet, subFieldNodes, visitedFragmentNames);\n    }\n  }\n\n  return subFieldNodes;\n}\n/**\n * If a resolveType function is not given, then a default resolve behavior is\n * used which attempts two strategies:\n *\n * First, See if the provided value has a `__typename` field defined, if so, use\n * that value as name of the resolved type.\n *\n * Otherwise, test each possible type for the abstract type by calling\n * isTypeOf for the object being coerced, returning the first type that matches.\n */\n\n\nexport var defaultTypeResolver = function defaultTypeResolver(value, contextValue, info, abstractType) {\n  // First, look for `__typename`.\n  if (isObjectLike(value) && typeof value.__typename === 'string') {\n    return value.__typename;\n  } // Otherwise, test each possible type.\n\n\n  var possibleTypes = info.schema.getPossibleTypes(abstractType);\n  var promisedIsTypeOfResults = [];\n\n  for (var i = 0; i < possibleTypes.length; i++) {\n    var type = possibleTypes[i];\n\n    if (type.isTypeOf) {\n      var isTypeOfResult = type.isTypeOf(value, contextValue, info);\n\n      if (isPromise(isTypeOfResult)) {\n        promisedIsTypeOfResults[i] = isTypeOfResult;\n      } else if (isTypeOfResult) {\n        return type.name;\n      }\n    }\n  }\n\n  if (promisedIsTypeOfResults.length) {\n    return Promise.all(promisedIsTypeOfResults).then(function (isTypeOfResults) {\n      for (var _i9 = 0; _i9 < isTypeOfResults.length; _i9++) {\n        if (isTypeOfResults[_i9]) {\n          return possibleTypes[_i9].name;\n        }\n      }\n    });\n  }\n};\n/**\n * If a resolve function is not given, then a default resolve behavior is used\n * which takes the property of the source object of the same name as the field\n * and returns it as the result, or if it's a function, returns the result\n * of calling that function while passing along args and context value.\n */\n\nexport var defaultFieldResolver = function defaultFieldResolver(source, args, contextValue, info) {\n  // ensure source is a value for which property access is acceptable.\n  if (isObjectLike(source) || typeof source === 'function') {\n    var property = source[info.fieldName];\n\n    if (typeof property === 'function') {\n      return source[info.fieldName](args, contextValue, info);\n    }\n\n    return property;\n  }\n};\n/**\n * This method looks up the field on the given type definition.\n * It has special casing for the three introspection fields,\n * __schema, __type and __typename. __typename is special because\n * it can always be queried as a field, even in situations where no\n * other fields are allowed, like on a Union. __schema and __type\n * could get automatically added to the query type, but that would\n * require mutating type definitions, which would cause issues.\n *\n * @internal\n */\n\nexport function getFieldDef(schema, parentType, fieldName) {\n  if (fieldName === SchemaMetaFieldDef.name && schema.getQueryType() === parentType) {\n    return SchemaMetaFieldDef;\n  } else if (fieldName === TypeMetaFieldDef.name && schema.getQueryType() === parentType) {\n    return TypeMetaFieldDef;\n  } else if (fieldName === TypeNameMetaFieldDef.name) {\n    return TypeNameMetaFieldDef;\n  }\n\n  return parentType.getFields()[fieldName];\n}\n","import isPromise from \"./isPromise.mjs\";\n/**\n * Similar to Array.prototype.reduce(), however the reducing callback may return\n * a Promise, in which case reduction will continue after each promise resolves.\n *\n * If the callback does not return a Promise, then this function will also not\n * return a Promise.\n */\n\nexport default function promiseReduce(values, callback, initialValue) {\n  return values.reduce(function (previous, value) {\n    return isPromise(previous) ? previous.then(function (resolved) {\n      return callback(resolved, value);\n    }) : callback(previous, value);\n  }, initialValue);\n}\n","/**\n * This function transforms a JS object `ObjMap<Promise<T>>` into\n * a `Promise<ObjMap<T>>`\n *\n * This is akin to bluebird's `Promise.props`, but implemented only using\n * `Promise.all` so it will work with any implementation of ES6 promises.\n */\nexport default function promiseForObject(object) {\n  var keys = Object.keys(object);\n  var valuesAndPromises = keys.map(function (name) {\n    return object[name];\n  });\n  return Promise.all(valuesAndPromises).then(function (values) {\n    return values.reduce(function (resolvedObject, value, i) {\n      resolvedObject[keys[i]] = value;\n      return resolvedObject;\n    }, Object.create(null));\n  });\n}\n","/**\n * Memoizes the provided three-argument function.\n */\nexport default function memoize3(fn) {\n  var cache0;\n  return function memoized(a1, a2, a3) {\n    if (!cache0) {\n      cache0 = new WeakMap();\n    }\n\n    var cache1 = cache0.get(a1);\n    var cache2;\n\n    if (cache1) {\n      cache2 = cache1.get(a2);\n\n      if (cache2) {\n        var cachedValue = cache2.get(a3);\n\n        if (cachedValue !== undefined) {\n          return cachedValue;\n        }\n      }\n    } else {\n      cache1 = new WeakMap();\n      cache0.set(a1, cache1);\n    }\n\n    if (!cache2) {\n      cache2 = new WeakMap();\n      cache1.set(a2, cache2);\n    }\n\n    var newValue = fn(a1, a2, a3);\n    cache2.set(a3, newValue);\n    return newValue;\n  };\n}\n","import isPromise from \"./jsutils/isPromise.mjs\";\nimport { parse } from \"./language/parser.mjs\";\nimport { validate } from \"./validation/validate.mjs\";\nimport { validateSchema } from \"./type/validate.mjs\";\nimport { execute } from \"./execution/execute.mjs\";\n/**\n * This is the primary entry point function for fulfilling GraphQL operations\n * by parsing, validating, and executing a GraphQL document along side a\n * GraphQL schema.\n *\n * More sophisticated GraphQL servers, such as those which persist queries,\n * may wish to separate the validation and execution phases to a static time\n * tooling step, and a server runtime step.\n *\n * Accepts either an object with named arguments, or individual arguments:\n *\n * schema:\n *    The GraphQL type system to use when validating and executing a query.\n * source:\n *    A GraphQL language formatted string representing the requested operation.\n * rootValue:\n *    The value provided as the first argument to resolver functions on the top\n *    level type (e.g. the query object type).\n * contextValue:\n *    The context value is provided as an argument to resolver functions after\n *    field arguments. It is used to pass shared information useful at any point\n *    during executing this query, for example the currently logged in user and\n *    connections to databases or other services.\n * variableValues:\n *    A mapping of variable name to runtime value to use for all variables\n *    defined in the requestString.\n * operationName:\n *    The name of the operation to use if requestString contains multiple\n *    possible operations. Can be omitted if requestString contains only\n *    one operation.\n * fieldResolver:\n *    A resolver function to use when one is not provided by the schema.\n *    If not provided, the default field resolver is used (which looks for a\n *    value or method on the source value with the field's name).\n * typeResolver:\n *    A type resolver function to use when none is provided by the schema.\n *    If not provided, the default type resolver is used (which looks for a\n *    `__typename` field or alternatively calls the `isTypeOf` method).\n */\n\nexport function graphql(argsOrSchema, source, rootValue, contextValue, variableValues, operationName, fieldResolver, typeResolver) {\n  var _arguments = arguments;\n\n  /* eslint-enable no-redeclare */\n  // Always return a Promise for a consistent API.\n  return new Promise(function (resolve) {\n    return resolve( // Extract arguments from object args if provided.\n    _arguments.length === 1 ? graphqlImpl(argsOrSchema) : graphqlImpl({\n      schema: argsOrSchema,\n      source: source,\n      rootValue: rootValue,\n      contextValue: contextValue,\n      variableValues: variableValues,\n      operationName: operationName,\n      fieldResolver: fieldResolver,\n      typeResolver: typeResolver\n    }));\n  });\n}\n/**\n * The graphqlSync function also fulfills GraphQL operations by parsing,\n * validating, and executing a GraphQL document along side a GraphQL schema.\n * However, it guarantees to complete synchronously (or throw an error) assuming\n * that all field resolvers are also synchronous.\n */\n\nexport function graphqlSync(argsOrSchema, source, rootValue, contextValue, variableValues, operationName, fieldResolver, typeResolver) {\n  /* eslint-enable no-redeclare */\n  // Extract arguments from object args if provided.\n  var result = arguments.length === 1 ? graphqlImpl(argsOrSchema) : graphqlImpl({\n    schema: argsOrSchema,\n    source: source,\n    rootValue: rootValue,\n    contextValue: contextValue,\n    variableValues: variableValues,\n    operationName: operationName,\n    fieldResolver: fieldResolver,\n    typeResolver: typeResolver\n  }); // Assert that the execution was synchronous.\n\n  if (isPromise(result)) {\n    throw new Error('GraphQL execution failed to complete synchronously.');\n  }\n\n  return result;\n}\n\nfunction graphqlImpl(args) {\n  var schema = args.schema,\n      source = args.source,\n      rootValue = args.rootValue,\n      contextValue = args.contextValue,\n      variableValues = args.variableValues,\n      operationName = args.operationName,\n      fieldResolver = args.fieldResolver,\n      typeResolver = args.typeResolver; // Validate Schema\n\n  var schemaValidationErrors = validateSchema(schema);\n\n  if (schemaValidationErrors.length > 0) {\n    return {\n      errors: schemaValidationErrors\n    };\n  } // Parse\n\n\n  var document;\n\n  try {\n    document = parse(source);\n  } catch (syntaxError) {\n    return {\n      errors: [syntaxError]\n    };\n  } // Validate\n\n\n  var validationErrors = validate(schema, document);\n\n  if (validationErrors.length > 0) {\n    return {\n      errors: validationErrors\n    };\n  } // Execute\n\n\n  return execute({\n    schema: schema,\n    document: document,\n    rootValue: rootValue,\n    contextValue: contextValue,\n    variableValues: variableValues,\n    operationName: operationName,\n    fieldResolver: fieldResolver,\n    typeResolver: typeResolver\n  });\n}\n","import { SYMBOL_ASYNC_ITERATOR } from \"../polyfills/symbols.mjs\";\n/**\n * Returns true if the provided object implements the AsyncIterator protocol via\n * either implementing a `Symbol.asyncIterator` or `\"@@asyncIterator\"` method.\n */\n\n// eslint-disable-next-line no-redeclare\nexport default function isAsyncIterable(maybeAsyncIterable) {\n  return typeof (maybeAsyncIterable === null || maybeAsyncIterable === void 0 ? void 0 : maybeAsyncIterable[SYMBOL_ASYNC_ITERATOR]) === 'function';\n}\n","function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nimport { SYMBOL_ASYNC_ITERATOR } from \"../polyfills/symbols.mjs\";\n\n/**\n * Given an AsyncIterable and a callback function, return an AsyncIterator\n * which produces values mapped via calling the callback function.\n */\nexport default function mapAsyncIterator(iterable, callback, rejectCallback) {\n  // $FlowFixMe[prop-missing]\n  var iteratorMethod = iterable[SYMBOL_ASYNC_ITERATOR];\n  var iterator = iteratorMethod.call(iterable);\n  var $return;\n  var abruptClose;\n\n  if (typeof iterator.return === 'function') {\n    $return = iterator.return;\n\n    abruptClose = function abruptClose(error) {\n      var rethrow = function rethrow() {\n        return Promise.reject(error);\n      };\n\n      return $return.call(iterator).then(rethrow, rethrow);\n    };\n  }\n\n  function mapResult(result) {\n    return result.done ? result : asyncMapValue(result.value, callback).then(iteratorResult, abruptClose);\n  }\n\n  var mapReject;\n\n  if (rejectCallback) {\n    // Capture rejectCallback to ensure it cannot be null.\n    var reject = rejectCallback;\n\n    mapReject = function mapReject(error) {\n      return asyncMapValue(error, reject).then(iteratorResult, abruptClose);\n    };\n  }\n  /* TODO: Flow doesn't support symbols as keys:\n     https://github.com/facebook/flow/issues/3258 */\n\n\n  return _defineProperty({\n    next: function next() {\n      return iterator.next().then(mapResult, mapReject);\n    },\n    return: function _return() {\n      return $return ? $return.call(iterator).then(mapResult, mapReject) : Promise.resolve({\n        value: undefined,\n        done: true\n      });\n    },\n    throw: function _throw(error) {\n      if (typeof iterator.throw === 'function') {\n        return iterator.throw(error).then(mapResult, mapReject);\n      }\n\n      return Promise.reject(error).catch(abruptClose);\n    }\n  }, SYMBOL_ASYNC_ITERATOR, function () {\n    return this;\n  });\n}\n\nfunction asyncMapValue(value, callback) {\n  return new Promise(function (resolve) {\n    return resolve(callback(value));\n  });\n}\n\nfunction iteratorResult(value) {\n  return {\n    value: value,\n    done: false\n  };\n}\n","import inspect from \"../jsutils/inspect.mjs\";\nimport isAsyncIterable from \"../jsutils/isAsyncIterable.mjs\";\nimport { addPath, pathToArray } from \"../jsutils/Path.mjs\";\nimport { GraphQLError } from \"../error/GraphQLError.mjs\";\nimport { locatedError } from \"../error/locatedError.mjs\";\nimport { getArgumentValues } from \"../execution/values.mjs\";\nimport { assertValidExecutionArguments, buildExecutionContext, buildResolveInfo, collectFields, execute, getFieldDef } from \"../execution/execute.mjs\";\nimport { getOperationRootType } from \"../utilities/getOperationRootType.mjs\";\nimport mapAsyncIterator from \"./mapAsyncIterator.mjs\";\nexport function subscribe(argsOrSchema, document, rootValue, contextValue, variableValues, operationName, fieldResolver, subscribeFieldResolver) {\n  /* eslint-enable no-redeclare */\n  // Extract arguments from object args if provided.\n  return arguments.length === 1 ? subscribeImpl(argsOrSchema) : subscribeImpl({\n    schema: argsOrSchema,\n    document: document,\n    rootValue: rootValue,\n    contextValue: contextValue,\n    variableValues: variableValues,\n    operationName: operationName,\n    fieldResolver: fieldResolver,\n    subscribeFieldResolver: subscribeFieldResolver\n  });\n}\n/**\n * This function checks if the error is a GraphQLError. If it is, report it as\n * an ExecutionResult, containing only errors and no data. Otherwise treat the\n * error as a system-class error and re-throw it.\n */\n\nfunction reportGraphQLError(error) {\n  if (error instanceof GraphQLError) {\n    return {\n      errors: [error]\n    };\n  }\n\n  throw error;\n}\n\nfunction subscribeImpl(args) {\n  var schema = args.schema,\n      document = args.document,\n      rootValue = args.rootValue,\n      contextValue = args.contextValue,\n      variableValues = args.variableValues,\n      operationName = args.operationName,\n      fieldResolver = args.fieldResolver,\n      subscribeFieldResolver = args.subscribeFieldResolver;\n  var sourcePromise = createSourceEventStream(schema, document, rootValue, contextValue, variableValues, operationName, subscribeFieldResolver); // For each payload yielded from a subscription, map it over the normal\n  // GraphQL `execute` function, with `payload` as the rootValue.\n  // This implements the \"MapSourceToResponseEvent\" algorithm described in\n  // the GraphQL specification. The `execute` function provides the\n  // \"ExecuteSubscriptionEvent\" algorithm, as it is nearly identical to the\n  // \"ExecuteQuery\" algorithm, for which `execute` is also used.\n\n  var mapSourceToResponse = function mapSourceToResponse(payload) {\n    return execute({\n      schema: schema,\n      document: document,\n      rootValue: payload,\n      contextValue: contextValue,\n      variableValues: variableValues,\n      operationName: operationName,\n      fieldResolver: fieldResolver\n    });\n  }; // Resolve the Source Stream, then map every source value to a\n  // ExecutionResult value as described above.\n\n\n  return sourcePromise.then(function (resultOrStream) {\n    return (// Note: Flow can't refine isAsyncIterable, so explicit casts are used.\n      isAsyncIterable(resultOrStream) ? mapAsyncIterator(resultOrStream, mapSourceToResponse, reportGraphQLError) : resultOrStream\n    );\n  });\n}\n/**\n * Implements the \"CreateSourceEventStream\" algorithm described in the\n * GraphQL specification, resolving the subscription source event stream.\n *\n * Returns a Promise which resolves to either an AsyncIterable (if successful)\n * or an ExecutionResult (error). The promise will be rejected if the schema or\n * other arguments to this function are invalid, or if the resolved event stream\n * is not an async iterable.\n *\n * If the client-provided arguments to this function do not result in a\n * compliant subscription, a GraphQL Response (ExecutionResult) with\n * descriptive errors and no data will be returned.\n *\n * If the the source stream could not be created due to faulty subscription\n * resolver logic or underlying systems, the promise will resolve to a single\n * ExecutionResult containing `errors` and no `data`.\n *\n * If the operation succeeded, the promise resolves to the AsyncIterable for the\n * event stream returned by the resolver.\n *\n * A Source Event Stream represents a sequence of events, each of which triggers\n * a GraphQL execution for that event.\n *\n * This may be useful when hosting the stateful subscription service in a\n * different process or machine than the stateless GraphQL execution engine,\n * or otherwise separating these two steps. For more on this, see the\n * \"Supporting Subscriptions at Scale\" information in the GraphQL specification.\n */\n\n\nexport function createSourceEventStream(schema, document, rootValue, contextValue, variableValues, operationName, fieldResolver) {\n  // If arguments are missing or incorrectly typed, this is an internal\n  // developer mistake which should throw an early error.\n  assertValidExecutionArguments(schema, document, variableValues);\n  return new Promise(function (resolve) {\n    // If a valid context cannot be created due to incorrect arguments,\n    // this will throw an error.\n    var exeContext = buildExecutionContext(schema, document, rootValue, contextValue, variableValues, operationName, fieldResolver);\n    resolve( // Return early errors if execution context failed.\n    Array.isArray(exeContext) ? {\n      errors: exeContext\n    } : executeSubscription(exeContext));\n  }).catch(reportGraphQLError);\n}\n\nfunction executeSubscription(exeContext) {\n  var schema = exeContext.schema,\n      operation = exeContext.operation,\n      variableValues = exeContext.variableValues,\n      rootValue = exeContext.rootValue;\n  var type = getOperationRootType(schema, operation);\n  var fields = collectFields(exeContext, type, operation.selectionSet, Object.create(null), Object.create(null));\n  var responseNames = Object.keys(fields);\n  var responseName = responseNames[0];\n  var fieldNodes = fields[responseName];\n  var fieldNode = fieldNodes[0];\n  var fieldName = fieldNode.name.value;\n  var fieldDef = getFieldDef(schema, type, fieldName);\n\n  if (!fieldDef) {\n    throw new GraphQLError(\"The subscription field \\\"\".concat(fieldName, \"\\\" is not defined.\"), fieldNodes);\n  }\n\n  var path = addPath(undefined, responseName, type.name);\n  var info = buildResolveInfo(exeContext, fieldDef, fieldNodes, type, path); // Coerce to Promise for easier error handling and consistent return type.\n\n  return new Promise(function (resolveResult) {\n    var _fieldDef$subscribe;\n\n    // Implements the \"ResolveFieldEventStream\" algorithm from GraphQL specification.\n    // It differs from \"ResolveFieldValue\" due to providing a different `resolveFn`.\n    // Build a JS object of arguments from the field.arguments AST, using the\n    // variables scope to fulfill any variable references.\n    var args = getArgumentValues(fieldDef, fieldNodes[0], variableValues); // The resolve function's optional third argument is a context value that\n    // is provided to every resolve function within an execution. It is commonly\n    // used to represent an authenticated user, or request-specific caches.\n\n    var contextValue = exeContext.contextValue; // Call the `subscribe()` resolver or the default resolver to produce an\n    // AsyncIterable yielding raw payloads.\n\n    var resolveFn = (_fieldDef$subscribe = fieldDef.subscribe) !== null && _fieldDef$subscribe !== void 0 ? _fieldDef$subscribe : exeContext.fieldResolver;\n    resolveResult(resolveFn(rootValue, args, contextValue, info));\n  }).then(function (eventStream) {\n    if (eventStream instanceof Error) {\n      throw locatedError(eventStream, fieldNodes, pathToArray(path));\n    } // Assert field returned an event stream, otherwise yield an error.\n\n\n    if (!isAsyncIterable(eventStream)) {\n      throw new Error('Subscription field must return Async Iterable. ' + \"Received: \".concat(inspect(eventStream), \".\"));\n    }\n\n    return eventStream;\n  }, function (error) {\n    throw locatedError(error, fieldNodes, pathToArray(path));\n  });\n}\n","import invariant from \"../../../jsutils/invariant.mjs\";\nimport { GraphQLError } from \"../../../error/GraphQLError.mjs\";\nimport { getNamedType, isInputObjectType } from \"../../../type/definition.mjs\";\n\n/**\n * No deprecated\n *\n * A GraphQL document is only valid if all selected fields and all used enum values have not been\n * deprecated.\n *\n * Note: This rule is optional and is not part of the Validation section of the GraphQL\n * Specification. The main purpose of this rule is detection of deprecated usages and not\n * necessarily to forbid their use when querying a service.\n */\nexport function NoDeprecatedCustomRule(context) {\n  return {\n    Field: function Field(node) {\n      var fieldDef = context.getFieldDef();\n      var deprecationReason = fieldDef === null || fieldDef === void 0 ? void 0 : fieldDef.deprecationReason;\n\n      if (fieldDef && deprecationReason != null) {\n        var parentType = context.getParentType();\n        parentType != null || invariant(0);\n        context.reportError(new GraphQLError(\"The field \".concat(parentType.name, \".\").concat(fieldDef.name, \" is deprecated. \").concat(deprecationReason), node));\n      }\n    },\n    Argument: function Argument(node) {\n      var argDef = context.getArgument();\n      var deprecationReason = argDef === null || argDef === void 0 ? void 0 : argDef.deprecationReason;\n\n      if (argDef && deprecationReason != null) {\n        var directiveDef = context.getDirective();\n\n        if (directiveDef != null) {\n          context.reportError(new GraphQLError(\"Directive \\\"@\".concat(directiveDef.name, \"\\\" argument \\\"\").concat(argDef.name, \"\\\" is deprecated. \").concat(deprecationReason), node));\n        } else {\n          var parentType = context.getParentType();\n          var fieldDef = context.getFieldDef();\n          parentType != null && fieldDef != null || invariant(0);\n          context.reportError(new GraphQLError(\"Field \\\"\".concat(parentType.name, \".\").concat(fieldDef.name, \"\\\" argument \\\"\").concat(argDef.name, \"\\\" is deprecated. \").concat(deprecationReason), node));\n        }\n      }\n    },\n    ObjectField: function ObjectField(node) {\n      var inputObjectDef = getNamedType(context.getParentInputType());\n\n      if (isInputObjectType(inputObjectDef)) {\n        var inputFieldDef = inputObjectDef.getFields()[node.name.value]; // flowlint-next-line unnecessary-optional-chain:off\n\n        var deprecationReason = inputFieldDef === null || inputFieldDef === void 0 ? void 0 : inputFieldDef.deprecationReason;\n\n        if (deprecationReason != null) {\n          context.reportError(new GraphQLError(\"The input field \".concat(inputObjectDef.name, \".\").concat(inputFieldDef.name, \" is deprecated. \").concat(deprecationReason), node));\n        }\n      }\n    },\n    EnumValue: function EnumValue(node) {\n      var enumValueDef = context.getEnumValue();\n      var deprecationReason = enumValueDef === null || enumValueDef === void 0 ? void 0 : enumValueDef.deprecationReason;\n\n      if (enumValueDef && deprecationReason != null) {\n        var enumTypeDef = getNamedType(context.getInputType());\n        enumTypeDef != null || invariant(0);\n        context.reportError(new GraphQLError(\"The enum value \\\"\".concat(enumTypeDef.name, \".\").concat(enumValueDef.name, \"\\\" is deprecated. \").concat(deprecationReason), node));\n      }\n    }\n  };\n}\n","import { GraphQLError } from \"../../../error/GraphQLError.mjs\";\nimport { getNamedType } from \"../../../type/definition.mjs\";\nimport { isIntrospectionType } from \"../../../type/introspection.mjs\";\n\n/**\n * Prohibit introspection queries\n *\n * A GraphQL document is only valid if all fields selected are not fields that\n * return an introspection type.\n *\n * Note: This rule is optional and is not part of the Validation section of the\n * GraphQL Specification. This rule effectively disables introspection, which\n * does not reflect best practices and should only be done if absolutely necessary.\n */\nexport function NoSchemaIntrospectionCustomRule(context) {\n  return {\n    Field: function Field(node) {\n      var type = getNamedType(context.getType());\n\n      if (type && isIntrospectionType(type)) {\n        context.reportError(new GraphQLError(\"GraphQL introspection has been disabled, but the requested query contained the field \\\"\".concat(node.name.value, \"\\\".\"), node));\n      }\n    }\n  };\n}\n","import devAssert from \"../jsutils/devAssert.mjs\";\n\n/**\n * Given a GraphQLError, format it according to the rules described by the\n * Response Format, Errors section of the GraphQL Specification.\n */\nexport function formatError(error) {\n  var _error$message;\n\n  error || devAssert(0, 'Received null or undefined error.');\n  var message = (_error$message = error.message) !== null && _error$message !== void 0 ? _error$message : 'An unknown error occurred.';\n  var locations = error.locations;\n  var path = error.path;\n  var extensions = error.extensions;\n  return extensions && Object.keys(extensions).length > 0 ? {\n    message: message,\n    locations: locations,\n    path: path,\n    extensions: extensions\n  } : {\n    message: message,\n    locations: locations,\n    path: path\n  };\n}\n/**\n * @see https://github.com/graphql/graphql-spec/blob/master/spec/Section%207%20--%20Response.md#errors\n */\n","function 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) { _defineProperty(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 _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nexport function getIntrospectionQuery(options) {\n  var optionsWithDefault = _objectSpread({\n    descriptions: true,\n    specifiedByUrl: false,\n    directiveIsRepeatable: false,\n    schemaDescription: false,\n    inputValueDeprecation: false\n  }, options);\n\n  var descriptions = optionsWithDefault.descriptions ? 'description' : '';\n  var specifiedByUrl = optionsWithDefault.specifiedByUrl ? 'specifiedByUrl' : '';\n  var directiveIsRepeatable = optionsWithDefault.directiveIsRepeatable ? 'isRepeatable' : '';\n  var schemaDescription = optionsWithDefault.schemaDescription ? descriptions : '';\n\n  function inputDeprecation(str) {\n    return optionsWithDefault.inputValueDeprecation ? str : '';\n  }\n\n  return \"\\n    query IntrospectionQuery {\\n      __schema {\\n        \".concat(schemaDescription, \"\\n        queryType { name }\\n        mutationType { name }\\n        subscriptionType { name }\\n        types {\\n          ...FullType\\n        }\\n        directives {\\n          name\\n          \").concat(descriptions, \"\\n          \").concat(directiveIsRepeatable, \"\\n          locations\\n          args\").concat(inputDeprecation('(includeDeprecated: true)'), \" {\\n            ...InputValue\\n          }\\n        }\\n      }\\n    }\\n\\n    fragment FullType on __Type {\\n      kind\\n      name\\n      \").concat(descriptions, \"\\n      \").concat(specifiedByUrl, \"\\n      fields(includeDeprecated: true) {\\n        name\\n        \").concat(descriptions, \"\\n        args\").concat(inputDeprecation('(includeDeprecated: true)'), \" {\\n          ...InputValue\\n        }\\n        type {\\n          ...TypeRef\\n        }\\n        isDeprecated\\n        deprecationReason\\n      }\\n      inputFields\").concat(inputDeprecation('(includeDeprecated: true)'), \" {\\n        ...InputValue\\n      }\\n      interfaces {\\n        ...TypeRef\\n      }\\n      enumValues(includeDeprecated: true) {\\n        name\\n        \").concat(descriptions, \"\\n        isDeprecated\\n        deprecationReason\\n      }\\n      possibleTypes {\\n        ...TypeRef\\n      }\\n    }\\n\\n    fragment InputValue on __InputValue {\\n      name\\n      \").concat(descriptions, \"\\n      type { ...TypeRef }\\n      defaultValue\\n      \").concat(inputDeprecation('isDeprecated'), \"\\n      \").concat(inputDeprecation('deprecationReason'), \"\\n    }\\n\\n    fragment TypeRef on __Type {\\n      kind\\n      name\\n      ofType {\\n        kind\\n        name\\n        ofType {\\n          kind\\n          name\\n          ofType {\\n            kind\\n            name\\n            ofType {\\n              kind\\n              name\\n              ofType {\\n                kind\\n                name\\n                ofType {\\n                  kind\\n                  name\\n                  ofType {\\n                    kind\\n                    name\\n                  }\\n                }\\n              }\\n            }\\n          }\\n        }\\n      }\\n    }\\n  \");\n}\n","import { Kind } from \"../language/kinds.mjs\";\n/**\n * Returns an operation AST given a document AST and optionally an operation\n * name. If a name is not provided, an operation is only returned if only one is\n * provided in the document.\n */\n\nexport function getOperationAST(documentAST, operationName) {\n  var operation = null;\n\n  for (var _i2 = 0, _documentAST$definiti2 = documentAST.definitions; _i2 < _documentAST$definiti2.length; _i2++) {\n    var definition = _documentAST$definiti2[_i2];\n\n    if (definition.kind === Kind.OPERATION_DEFINITION) {\n      var _definition$name;\n\n      if (operationName == null) {\n        // If no operation name was provided, only return an Operation if there\n        // is one defined in the document. Upon encountering the second, return\n        // null.\n        if (operation) {\n          return null;\n        }\n\n        operation = definition;\n      } else if (((_definition$name = definition.name) === null || _definition$name === void 0 ? void 0 : _definition$name.value) === operationName) {\n        return definition;\n      }\n    }\n  }\n\n  return operation;\n}\n","function 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) { _defineProperty(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 _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nimport invariant from \"../jsutils/invariant.mjs\";\nimport { parse } from \"../language/parser.mjs\";\nimport { executeSync } from \"../execution/execute.mjs\";\nimport { getIntrospectionQuery } from \"./getIntrospectionQuery.mjs\";\n/**\n * Build an IntrospectionQuery from a GraphQLSchema\n *\n * IntrospectionQuery is useful for utilities that care about type and field\n * relationships, but do not need to traverse through those relationships.\n *\n * This is the inverse of buildClientSchema. The primary use case is outside\n * of the server context, for instance when doing schema comparisons.\n */\n\nexport function introspectionFromSchema(schema, options) {\n  var optionsWithDefaults = _objectSpread({\n    specifiedByUrl: true,\n    directiveIsRepeatable: true,\n    schemaDescription: true,\n    inputValueDeprecation: true\n  }, options);\n\n  var document = parse(getIntrospectionQuery(optionsWithDefaults));\n  var result = executeSync({\n    schema: schema,\n    document: document\n  });\n  !result.errors && result.data || invariant(0);\n  return result.data;\n}\n","import objectValues from \"../polyfills/objectValues.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport devAssert from \"../jsutils/devAssert.mjs\";\nimport keyValMap from \"../jsutils/keyValMap.mjs\";\nimport isObjectLike from \"../jsutils/isObjectLike.mjs\";\nimport { parseValue } from \"../language/parser.mjs\";\nimport { GraphQLSchema } from \"../type/schema.mjs\";\nimport { GraphQLDirective } from \"../type/directives.mjs\";\nimport { specifiedScalarTypes } from \"../type/scalars.mjs\";\nimport { introspectionTypes, TypeKind } from \"../type/introspection.mjs\";\nimport { isInputType, isOutputType, GraphQLList, GraphQLNonNull, GraphQLScalarType, GraphQLObjectType, GraphQLInterfaceType, GraphQLUnionType, GraphQLEnumType, GraphQLInputObjectType, assertNullableType, assertObjectType, assertInterfaceType } from \"../type/definition.mjs\";\nimport { valueFromAST } from \"./valueFromAST.mjs\";\n/**\n * Build a GraphQLSchema for use by client tools.\n *\n * Given the result of a client running the introspection query, creates and\n * returns a GraphQLSchema instance which can be then used with all graphql-js\n * tools, but cannot be used to execute a query, as introspection does not\n * represent the \"resolver\", \"parse\" or \"serialize\" functions or any other\n * server-internal mechanisms.\n *\n * This function expects a complete introspection result. Don't forget to check\n * the \"errors\" field of a server response before calling this function.\n */\n\nexport function buildClientSchema(introspection, options) {\n  isObjectLike(introspection) && isObjectLike(introspection.__schema) || devAssert(0, \"Invalid or incomplete introspection result. Ensure that you are passing \\\"data\\\" property of introspection response and no \\\"errors\\\" was returned alongside: \".concat(inspect(introspection), \".\")); // Get the schema from the introspection result.\n\n  var schemaIntrospection = introspection.__schema; // Iterate through all types, getting the type definition for each.\n\n  var typeMap = keyValMap(schemaIntrospection.types, function (typeIntrospection) {\n    return typeIntrospection.name;\n  }, function (typeIntrospection) {\n    return buildType(typeIntrospection);\n  }); // Include standard types only if they are used.\n\n  for (var _i2 = 0, _ref2 = [].concat(specifiedScalarTypes, introspectionTypes); _i2 < _ref2.length; _i2++) {\n    var stdType = _ref2[_i2];\n\n    if (typeMap[stdType.name]) {\n      typeMap[stdType.name] = stdType;\n    }\n  } // Get the root Query, Mutation, and Subscription types.\n\n\n  var queryType = schemaIntrospection.queryType ? getObjectType(schemaIntrospection.queryType) : null;\n  var mutationType = schemaIntrospection.mutationType ? getObjectType(schemaIntrospection.mutationType) : null;\n  var subscriptionType = schemaIntrospection.subscriptionType ? getObjectType(schemaIntrospection.subscriptionType) : null; // Get the directives supported by Introspection, assuming empty-set if\n  // directives were not queried for.\n\n  var directives = schemaIntrospection.directives ? schemaIntrospection.directives.map(buildDirective) : []; // Then produce and return a Schema with these types.\n\n  return new GraphQLSchema({\n    description: schemaIntrospection.description,\n    query: queryType,\n    mutation: mutationType,\n    subscription: subscriptionType,\n    types: objectValues(typeMap),\n    directives: directives,\n    assumeValid: options === null || options === void 0 ? void 0 : options.assumeValid\n  }); // Given a type reference in introspection, return the GraphQLType instance.\n  // preferring cached instances before building new instances.\n\n  function getType(typeRef) {\n    if (typeRef.kind === TypeKind.LIST) {\n      var itemRef = typeRef.ofType;\n\n      if (!itemRef) {\n        throw new Error('Decorated type deeper than introspection query.');\n      }\n\n      return new GraphQLList(getType(itemRef));\n    }\n\n    if (typeRef.kind === TypeKind.NON_NULL) {\n      var nullableRef = typeRef.ofType;\n\n      if (!nullableRef) {\n        throw new Error('Decorated type deeper than introspection query.');\n      }\n\n      var nullableType = getType(nullableRef);\n      return new GraphQLNonNull(assertNullableType(nullableType));\n    }\n\n    return getNamedType(typeRef);\n  }\n\n  function getNamedType(typeRef) {\n    var typeName = typeRef.name;\n\n    if (!typeName) {\n      throw new Error(\"Unknown type reference: \".concat(inspect(typeRef), \".\"));\n    }\n\n    var type = typeMap[typeName];\n\n    if (!type) {\n      throw new Error(\"Invalid or incomplete schema, unknown type: \".concat(typeName, \". Ensure that a full introspection query is used in order to build a client schema.\"));\n    }\n\n    return type;\n  }\n\n  function getObjectType(typeRef) {\n    return assertObjectType(getNamedType(typeRef));\n  }\n\n  function getInterfaceType(typeRef) {\n    return assertInterfaceType(getNamedType(typeRef));\n  } // Given a type's introspection result, construct the correct\n  // GraphQLType instance.\n\n\n  function buildType(type) {\n    if (type != null && type.name != null && type.kind != null) {\n      switch (type.kind) {\n        case TypeKind.SCALAR:\n          return buildScalarDef(type);\n\n        case TypeKind.OBJECT:\n          return buildObjectDef(type);\n\n        case TypeKind.INTERFACE:\n          return buildInterfaceDef(type);\n\n        case TypeKind.UNION:\n          return buildUnionDef(type);\n\n        case TypeKind.ENUM:\n          return buildEnumDef(type);\n\n        case TypeKind.INPUT_OBJECT:\n          return buildInputObjectDef(type);\n      }\n    }\n\n    var typeStr = inspect(type);\n    throw new Error(\"Invalid or incomplete introspection result. Ensure that a full introspection query is used in order to build a client schema: \".concat(typeStr, \".\"));\n  }\n\n  function buildScalarDef(scalarIntrospection) {\n    return new GraphQLScalarType({\n      name: scalarIntrospection.name,\n      description: scalarIntrospection.description,\n      specifiedByUrl: scalarIntrospection.specifiedByUrl\n    });\n  }\n\n  function buildImplementationsList(implementingIntrospection) {\n    // TODO: Temporary workaround until GraphQL ecosystem will fully support\n    // 'interfaces' on interface types.\n    if (implementingIntrospection.interfaces === null && implementingIntrospection.kind === TypeKind.INTERFACE) {\n      return [];\n    }\n\n    if (!implementingIntrospection.interfaces) {\n      var implementingIntrospectionStr = inspect(implementingIntrospection);\n      throw new Error(\"Introspection result missing interfaces: \".concat(implementingIntrospectionStr, \".\"));\n    }\n\n    return implementingIntrospection.interfaces.map(getInterfaceType);\n  }\n\n  function buildObjectDef(objectIntrospection) {\n    return new GraphQLObjectType({\n      name: objectIntrospection.name,\n      description: objectIntrospection.description,\n      interfaces: function interfaces() {\n        return buildImplementationsList(objectIntrospection);\n      },\n      fields: function fields() {\n        return buildFieldDefMap(objectIntrospection);\n      }\n    });\n  }\n\n  function buildInterfaceDef(interfaceIntrospection) {\n    return new GraphQLInterfaceType({\n      name: interfaceIntrospection.name,\n      description: interfaceIntrospection.description,\n      interfaces: function interfaces() {\n        return buildImplementationsList(interfaceIntrospection);\n      },\n      fields: function fields() {\n        return buildFieldDefMap(interfaceIntrospection);\n      }\n    });\n  }\n\n  function buildUnionDef(unionIntrospection) {\n    if (!unionIntrospection.possibleTypes) {\n      var unionIntrospectionStr = inspect(unionIntrospection);\n      throw new Error(\"Introspection result missing possibleTypes: \".concat(unionIntrospectionStr, \".\"));\n    }\n\n    return new GraphQLUnionType({\n      name: unionIntrospection.name,\n      description: unionIntrospection.description,\n      types: function types() {\n        return unionIntrospection.possibleTypes.map(getObjectType);\n      }\n    });\n  }\n\n  function buildEnumDef(enumIntrospection) {\n    if (!enumIntrospection.enumValues) {\n      var enumIntrospectionStr = inspect(enumIntrospection);\n      throw new Error(\"Introspection result missing enumValues: \".concat(enumIntrospectionStr, \".\"));\n    }\n\n    return new GraphQLEnumType({\n      name: enumIntrospection.name,\n      description: enumIntrospection.description,\n      values: keyValMap(enumIntrospection.enumValues, function (valueIntrospection) {\n        return valueIntrospection.name;\n      }, function (valueIntrospection) {\n        return {\n          description: valueIntrospection.description,\n          deprecationReason: valueIntrospection.deprecationReason\n        };\n      })\n    });\n  }\n\n  function buildInputObjectDef(inputObjectIntrospection) {\n    if (!inputObjectIntrospection.inputFields) {\n      var inputObjectIntrospectionStr = inspect(inputObjectIntrospection);\n      throw new Error(\"Introspection result missing inputFields: \".concat(inputObjectIntrospectionStr, \".\"));\n    }\n\n    return new GraphQLInputObjectType({\n      name: inputObjectIntrospection.name,\n      description: inputObjectIntrospection.description,\n      fields: function fields() {\n        return buildInputValueDefMap(inputObjectIntrospection.inputFields);\n      }\n    });\n  }\n\n  function buildFieldDefMap(typeIntrospection) {\n    if (!typeIntrospection.fields) {\n      throw new Error(\"Introspection result missing fields: \".concat(inspect(typeIntrospection), \".\"));\n    }\n\n    return keyValMap(typeIntrospection.fields, function (fieldIntrospection) {\n      return fieldIntrospection.name;\n    }, buildField);\n  }\n\n  function buildField(fieldIntrospection) {\n    var type = getType(fieldIntrospection.type);\n\n    if (!isOutputType(type)) {\n      var typeStr = inspect(type);\n      throw new Error(\"Introspection must provide output type for fields, but received: \".concat(typeStr, \".\"));\n    }\n\n    if (!fieldIntrospection.args) {\n      var fieldIntrospectionStr = inspect(fieldIntrospection);\n      throw new Error(\"Introspection result missing field args: \".concat(fieldIntrospectionStr, \".\"));\n    }\n\n    return {\n      description: fieldIntrospection.description,\n      deprecationReason: fieldIntrospection.deprecationReason,\n      type: type,\n      args: buildInputValueDefMap(fieldIntrospection.args)\n    };\n  }\n\n  function buildInputValueDefMap(inputValueIntrospections) {\n    return keyValMap(inputValueIntrospections, function (inputValue) {\n      return inputValue.name;\n    }, buildInputValue);\n  }\n\n  function buildInputValue(inputValueIntrospection) {\n    var type = getType(inputValueIntrospection.type);\n\n    if (!isInputType(type)) {\n      var typeStr = inspect(type);\n      throw new Error(\"Introspection must provide input type for arguments, but received: \".concat(typeStr, \".\"));\n    }\n\n    var defaultValue = inputValueIntrospection.defaultValue != null ? valueFromAST(parseValue(inputValueIntrospection.defaultValue), type) : undefined;\n    return {\n      description: inputValueIntrospection.description,\n      type: type,\n      defaultValue: defaultValue,\n      deprecationReason: inputValueIntrospection.deprecationReason\n    };\n  }\n\n  function buildDirective(directiveIntrospection) {\n    if (!directiveIntrospection.args) {\n      var directiveIntrospectionStr = inspect(directiveIntrospection);\n      throw new Error(\"Introspection result missing directive args: \".concat(directiveIntrospectionStr, \".\"));\n    }\n\n    if (!directiveIntrospection.locations) {\n      var _directiveIntrospectionStr = inspect(directiveIntrospection);\n\n      throw new Error(\"Introspection result missing directive locations: \".concat(_directiveIntrospectionStr, \".\"));\n    }\n\n    return new GraphQLDirective({\n      name: directiveIntrospection.name,\n      description: directiveIntrospection.description,\n      isRepeatable: directiveIntrospection.isRepeatable,\n      locations: directiveIntrospection.locations.slice(),\n      args: buildInputValueDefMap(directiveIntrospection.args)\n    });\n  }\n}\n","function 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) { _defineProperty(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 _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nimport objectValues from \"../polyfills/objectValues.mjs\";\nimport keyMap from \"../jsutils/keyMap.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport mapValue from \"../jsutils/mapValue.mjs\";\nimport invariant from \"../jsutils/invariant.mjs\";\nimport devAssert from \"../jsutils/devAssert.mjs\";\nimport { Kind } from \"../language/kinds.mjs\";\nimport { TokenKind } from \"../language/tokenKind.mjs\";\nimport { dedentBlockStringValue } from \"../language/blockString.mjs\";\nimport { isTypeDefinitionNode, isTypeExtensionNode } from \"../language/predicates.mjs\";\nimport { assertValidSDLExtension } from \"../validation/validate.mjs\";\nimport { getDirectiveValues } from \"../execution/values.mjs\";\nimport { assertSchema, GraphQLSchema } from \"../type/schema.mjs\";\nimport { specifiedScalarTypes, isSpecifiedScalarType } from \"../type/scalars.mjs\";\nimport { introspectionTypes, isIntrospectionType } from \"../type/introspection.mjs\";\nimport { GraphQLDirective, GraphQLDeprecatedDirective, GraphQLSpecifiedByDirective } from \"../type/directives.mjs\";\nimport { isScalarType, isObjectType, isInterfaceType, isUnionType, isListType, isNonNullType, isEnumType, isInputObjectType, GraphQLList, GraphQLNonNull, GraphQLScalarType, GraphQLObjectType, GraphQLInterfaceType, GraphQLUnionType, GraphQLEnumType, GraphQLInputObjectType } from \"../type/definition.mjs\";\nimport { valueFromAST } from \"./valueFromAST.mjs\";\n\n/**\n * Produces a new schema given an existing schema and a document which may\n * contain GraphQL type extensions and definitions. The original schema will\n * remain unaltered.\n *\n * Because a schema represents a graph of references, a schema cannot be\n * extended without effectively making an entire copy. We do not know until it's\n * too late if subgraphs remain unchanged.\n *\n * This algorithm copies the provided schema, applying extensions while\n * producing the copy. The original schema remains unaltered.\n *\n * Accepts options as a third argument:\n *\n *    - commentDescriptions:\n *        Provide true to use preceding comments as the description.\n *\n */\nexport function extendSchema(schema, documentAST, options) {\n  assertSchema(schema);\n  documentAST != null && documentAST.kind === Kind.DOCUMENT || devAssert(0, 'Must provide valid Document AST.');\n\n  if ((options === null || options === void 0 ? void 0 : options.assumeValid) !== true && (options === null || options === void 0 ? void 0 : options.assumeValidSDL) !== true) {\n    assertValidSDLExtension(documentAST, schema);\n  }\n\n  var schemaConfig = schema.toConfig();\n  var extendedConfig = extendSchemaImpl(schemaConfig, documentAST, options);\n  return schemaConfig === extendedConfig ? schema : new GraphQLSchema(extendedConfig);\n}\n/**\n * @internal\n */\n\nexport function extendSchemaImpl(schemaConfig, documentAST, options) {\n  var _schemaDef, _schemaDef$descriptio, _schemaDef2, _options$assumeValid;\n\n  // Collect the type definitions and extensions found in the document.\n  var typeDefs = [];\n  var typeExtensionsMap = Object.create(null); // New directives and types are separate because a directives and types can\n  // have the same name. For example, a type named \"skip\".\n\n  var directiveDefs = [];\n  var schemaDef; // Schema extensions are collected which may add additional operation types.\n\n  var schemaExtensions = [];\n\n  for (var _i2 = 0, _documentAST$definiti2 = documentAST.definitions; _i2 < _documentAST$definiti2.length; _i2++) {\n    var def = _documentAST$definiti2[_i2];\n\n    if (def.kind === Kind.SCHEMA_DEFINITION) {\n      schemaDef = def;\n    } else if (def.kind === Kind.SCHEMA_EXTENSION) {\n      schemaExtensions.push(def);\n    } else if (isTypeDefinitionNode(def)) {\n      typeDefs.push(def);\n    } else if (isTypeExtensionNode(def)) {\n      var extendedTypeName = def.name.value;\n      var existingTypeExtensions = typeExtensionsMap[extendedTypeName];\n      typeExtensionsMap[extendedTypeName] = existingTypeExtensions ? existingTypeExtensions.concat([def]) : [def];\n    } else if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      directiveDefs.push(def);\n    }\n  } // If this document contains no new types, extensions, or directives then\n  // return the same unmodified GraphQLSchema instance.\n\n\n  if (Object.keys(typeExtensionsMap).length === 0 && typeDefs.length === 0 && directiveDefs.length === 0 && schemaExtensions.length === 0 && schemaDef == null) {\n    return schemaConfig;\n  }\n\n  var typeMap = Object.create(null);\n\n  for (var _i4 = 0, _schemaConfig$types2 = schemaConfig.types; _i4 < _schemaConfig$types2.length; _i4++) {\n    var existingType = _schemaConfig$types2[_i4];\n    typeMap[existingType.name] = extendNamedType(existingType);\n  }\n\n  for (var _i6 = 0; _i6 < typeDefs.length; _i6++) {\n    var _stdTypeMap$name;\n\n    var typeNode = typeDefs[_i6];\n    var name = typeNode.name.value;\n    typeMap[name] = (_stdTypeMap$name = stdTypeMap[name]) !== null && _stdTypeMap$name !== void 0 ? _stdTypeMap$name : buildType(typeNode);\n  }\n\n  var operationTypes = _objectSpread(_objectSpread({\n    // Get the extended root operation types.\n    query: schemaConfig.query && replaceNamedType(schemaConfig.query),\n    mutation: schemaConfig.mutation && replaceNamedType(schemaConfig.mutation),\n    subscription: schemaConfig.subscription && replaceNamedType(schemaConfig.subscription)\n  }, schemaDef && getOperationTypes([schemaDef])), getOperationTypes(schemaExtensions)); // Then produce and return a Schema config with these types.\n\n\n  return _objectSpread(_objectSpread({\n    description: (_schemaDef = schemaDef) === null || _schemaDef === void 0 ? void 0 : (_schemaDef$descriptio = _schemaDef.description) === null || _schemaDef$descriptio === void 0 ? void 0 : _schemaDef$descriptio.value\n  }, operationTypes), {}, {\n    types: objectValues(typeMap),\n    directives: [].concat(schemaConfig.directives.map(replaceDirective), directiveDefs.map(buildDirective)),\n    extensions: undefined,\n    astNode: (_schemaDef2 = schemaDef) !== null && _schemaDef2 !== void 0 ? _schemaDef2 : schemaConfig.astNode,\n    extensionASTNodes: schemaConfig.extensionASTNodes.concat(schemaExtensions),\n    assumeValid: (_options$assumeValid = options === null || options === void 0 ? void 0 : options.assumeValid) !== null && _options$assumeValid !== void 0 ? _options$assumeValid : false\n  }); // Below are functions used for producing this schema that have closed over\n  // this scope and have access to the schema, cache, and newly defined types.\n\n  function replaceType(type) {\n    if (isListType(type)) {\n      // $FlowFixMe[incompatible-return]\n      return new GraphQLList(replaceType(type.ofType));\n    }\n\n    if (isNonNullType(type)) {\n      // $FlowFixMe[incompatible-return]\n      return new GraphQLNonNull(replaceType(type.ofType));\n    }\n\n    return replaceNamedType(type);\n  }\n\n  function replaceNamedType(type) {\n    // Note: While this could make early assertions to get the correctly\n    // typed values, that would throw immediately while type system\n    // validation with validateSchema() will produce more actionable results.\n    return typeMap[type.name];\n  }\n\n  function replaceDirective(directive) {\n    var config = directive.toConfig();\n    return new GraphQLDirective(_objectSpread(_objectSpread({}, config), {}, {\n      args: mapValue(config.args, extendArg)\n    }));\n  }\n\n  function extendNamedType(type) {\n    if (isIntrospectionType(type) || isSpecifiedScalarType(type)) {\n      // Builtin types are not extended.\n      return type;\n    }\n\n    if (isScalarType(type)) {\n      return extendScalarType(type);\n    }\n\n    if (isObjectType(type)) {\n      return extendObjectType(type);\n    }\n\n    if (isInterfaceType(type)) {\n      return extendInterfaceType(type);\n    }\n\n    if (isUnionType(type)) {\n      return extendUnionType(type);\n    }\n\n    if (isEnumType(type)) {\n      return extendEnumType(type);\n    } // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2618')\n\n\n    if (isInputObjectType(type)) {\n      return extendInputObjectType(type);\n    } // istanbul ignore next (Not reachable. All possible types have been considered)\n\n\n    false || invariant(0, 'Unexpected type: ' + inspect(type));\n  }\n\n  function extendInputObjectType(type) {\n    var _typeExtensionsMap$co;\n\n    var config = type.toConfig();\n    var extensions = (_typeExtensionsMap$co = typeExtensionsMap[config.name]) !== null && _typeExtensionsMap$co !== void 0 ? _typeExtensionsMap$co : [];\n    return new GraphQLInputObjectType(_objectSpread(_objectSpread({}, config), {}, {\n      fields: function fields() {\n        return _objectSpread(_objectSpread({}, mapValue(config.fields, function (field) {\n          return _objectSpread(_objectSpread({}, field), {}, {\n            type: replaceType(field.type)\n          });\n        })), buildInputFieldMap(extensions));\n      },\n      extensionASTNodes: config.extensionASTNodes.concat(extensions)\n    }));\n  }\n\n  function extendEnumType(type) {\n    var _typeExtensionsMap$ty;\n\n    var config = type.toConfig();\n    var extensions = (_typeExtensionsMap$ty = typeExtensionsMap[type.name]) !== null && _typeExtensionsMap$ty !== void 0 ? _typeExtensionsMap$ty : [];\n    return new GraphQLEnumType(_objectSpread(_objectSpread({}, config), {}, {\n      values: _objectSpread(_objectSpread({}, config.values), buildEnumValueMap(extensions)),\n      extensionASTNodes: config.extensionASTNodes.concat(extensions)\n    }));\n  }\n\n  function extendScalarType(type) {\n    var _typeExtensionsMap$co2;\n\n    var config = type.toConfig();\n    var extensions = (_typeExtensionsMap$co2 = typeExtensionsMap[config.name]) !== null && _typeExtensionsMap$co2 !== void 0 ? _typeExtensionsMap$co2 : [];\n    var specifiedByUrl = config.specifiedByUrl;\n\n    for (var _i8 = 0; _i8 < extensions.length; _i8++) {\n      var _getSpecifiedByUrl;\n\n      var extensionNode = extensions[_i8];\n      specifiedByUrl = (_getSpecifiedByUrl = getSpecifiedByUrl(extensionNode)) !== null && _getSpecifiedByUrl !== void 0 ? _getSpecifiedByUrl : specifiedByUrl;\n    }\n\n    return new GraphQLScalarType(_objectSpread(_objectSpread({}, config), {}, {\n      specifiedByUrl: specifiedByUrl,\n      extensionASTNodes: config.extensionASTNodes.concat(extensions)\n    }));\n  }\n\n  function extendObjectType(type) {\n    var _typeExtensionsMap$co3;\n\n    var config = type.toConfig();\n    var extensions = (_typeExtensionsMap$co3 = typeExtensionsMap[config.name]) !== null && _typeExtensionsMap$co3 !== void 0 ? _typeExtensionsMap$co3 : [];\n    return new GraphQLObjectType(_objectSpread(_objectSpread({}, config), {}, {\n      interfaces: function interfaces() {\n        return [].concat(type.getInterfaces().map(replaceNamedType), buildInterfaces(extensions));\n      },\n      fields: function fields() {\n        return _objectSpread(_objectSpread({}, mapValue(config.fields, extendField)), buildFieldMap(extensions));\n      },\n      extensionASTNodes: config.extensionASTNodes.concat(extensions)\n    }));\n  }\n\n  function extendInterfaceType(type) {\n    var _typeExtensionsMap$co4;\n\n    var config = type.toConfig();\n    var extensions = (_typeExtensionsMap$co4 = typeExtensionsMap[config.name]) !== null && _typeExtensionsMap$co4 !== void 0 ? _typeExtensionsMap$co4 : [];\n    return new GraphQLInterfaceType(_objectSpread(_objectSpread({}, config), {}, {\n      interfaces: function interfaces() {\n        return [].concat(type.getInterfaces().map(replaceNamedType), buildInterfaces(extensions));\n      },\n      fields: function fields() {\n        return _objectSpread(_objectSpread({}, mapValue(config.fields, extendField)), buildFieldMap(extensions));\n      },\n      extensionASTNodes: config.extensionASTNodes.concat(extensions)\n    }));\n  }\n\n  function extendUnionType(type) {\n    var _typeExtensionsMap$co5;\n\n    var config = type.toConfig();\n    var extensions = (_typeExtensionsMap$co5 = typeExtensionsMap[config.name]) !== null && _typeExtensionsMap$co5 !== void 0 ? _typeExtensionsMap$co5 : [];\n    return new GraphQLUnionType(_objectSpread(_objectSpread({}, config), {}, {\n      types: function types() {\n        return [].concat(type.getTypes().map(replaceNamedType), buildUnionTypes(extensions));\n      },\n      extensionASTNodes: config.extensionASTNodes.concat(extensions)\n    }));\n  }\n\n  function extendField(field) {\n    return _objectSpread(_objectSpread({}, field), {}, {\n      type: replaceType(field.type),\n      // $FlowFixMe[incompatible-call]\n      args: mapValue(field.args, extendArg)\n    });\n  }\n\n  function extendArg(arg) {\n    return _objectSpread(_objectSpread({}, arg), {}, {\n      type: replaceType(arg.type)\n    });\n  }\n\n  function getOperationTypes(nodes) {\n    var opTypes = {};\n\n    for (var _i10 = 0; _i10 < nodes.length; _i10++) {\n      var _node$operationTypes;\n\n      var node = nodes[_i10];\n      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n      var operationTypesNodes = (_node$operationTypes = node.operationTypes) !== null && _node$operationTypes !== void 0 ? _node$operationTypes : [];\n\n      for (var _i12 = 0; _i12 < operationTypesNodes.length; _i12++) {\n        var operationType = operationTypesNodes[_i12];\n        opTypes[operationType.operation] = getNamedType(operationType.type);\n      }\n    } // Note: While this could make early assertions to get the correctly\n    // typed values below, that would throw immediately while type system\n    // validation with validateSchema() will produce more actionable results.\n\n\n    return opTypes;\n  }\n\n  function getNamedType(node) {\n    var _stdTypeMap$name2;\n\n    var name = node.name.value;\n    var type = (_stdTypeMap$name2 = stdTypeMap[name]) !== null && _stdTypeMap$name2 !== void 0 ? _stdTypeMap$name2 : typeMap[name];\n\n    if (type === undefined) {\n      throw new Error(\"Unknown type: \\\"\".concat(name, \"\\\".\"));\n    }\n\n    return type;\n  }\n\n  function getWrappedType(node) {\n    if (node.kind === Kind.LIST_TYPE) {\n      return new GraphQLList(getWrappedType(node.type));\n    }\n\n    if (node.kind === Kind.NON_NULL_TYPE) {\n      return new GraphQLNonNull(getWrappedType(node.type));\n    }\n\n    return getNamedType(node);\n  }\n\n  function buildDirective(node) {\n    var locations = node.locations.map(function (_ref) {\n      var value = _ref.value;\n      return value;\n    });\n    return new GraphQLDirective({\n      name: node.name.value,\n      description: getDescription(node, options),\n      locations: locations,\n      isRepeatable: node.repeatable,\n      args: buildArgumentMap(node.arguments),\n      astNode: node\n    });\n  }\n\n  function buildFieldMap(nodes) {\n    var fieldConfigMap = Object.create(null);\n\n    for (var _i14 = 0; _i14 < nodes.length; _i14++) {\n      var _node$fields;\n\n      var node = nodes[_i14];\n      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n      var nodeFields = (_node$fields = node.fields) !== null && _node$fields !== void 0 ? _node$fields : [];\n\n      for (var _i16 = 0; _i16 < nodeFields.length; _i16++) {\n        var field = nodeFields[_i16];\n        fieldConfigMap[field.name.value] = {\n          // Note: While this could make assertions to get the correctly typed\n          // value, that would throw immediately while type system validation\n          // with validateSchema() will produce more actionable results.\n          type: getWrappedType(field.type),\n          description: getDescription(field, options),\n          args: buildArgumentMap(field.arguments),\n          deprecationReason: getDeprecationReason(field),\n          astNode: field\n        };\n      }\n    }\n\n    return fieldConfigMap;\n  }\n\n  function buildArgumentMap(args) {\n    // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n    var argsNodes = args !== null && args !== void 0 ? args : [];\n    var argConfigMap = Object.create(null);\n\n    for (var _i18 = 0; _i18 < argsNodes.length; _i18++) {\n      var arg = argsNodes[_i18];\n      // Note: While this could make assertions to get the correctly typed\n      // value, that would throw immediately while type system validation\n      // with validateSchema() will produce more actionable results.\n      var type = getWrappedType(arg.type);\n      argConfigMap[arg.name.value] = {\n        type: type,\n        description: getDescription(arg, options),\n        defaultValue: valueFromAST(arg.defaultValue, type),\n        deprecationReason: getDeprecationReason(arg),\n        astNode: arg\n      };\n    }\n\n    return argConfigMap;\n  }\n\n  function buildInputFieldMap(nodes) {\n    var inputFieldMap = Object.create(null);\n\n    for (var _i20 = 0; _i20 < nodes.length; _i20++) {\n      var _node$fields2;\n\n      var node = nodes[_i20];\n      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n      var fieldsNodes = (_node$fields2 = node.fields) !== null && _node$fields2 !== void 0 ? _node$fields2 : [];\n\n      for (var _i22 = 0; _i22 < fieldsNodes.length; _i22++) {\n        var field = fieldsNodes[_i22];\n        // Note: While this could make assertions to get the correctly typed\n        // value, that would throw immediately while type system validation\n        // with validateSchema() will produce more actionable results.\n        var type = getWrappedType(field.type);\n        inputFieldMap[field.name.value] = {\n          type: type,\n          description: getDescription(field, options),\n          defaultValue: valueFromAST(field.defaultValue, type),\n          deprecationReason: getDeprecationReason(field),\n          astNode: field\n        };\n      }\n    }\n\n    return inputFieldMap;\n  }\n\n  function buildEnumValueMap(nodes) {\n    var enumValueMap = Object.create(null);\n\n    for (var _i24 = 0; _i24 < nodes.length; _i24++) {\n      var _node$values;\n\n      var node = nodes[_i24];\n      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n      var valuesNodes = (_node$values = node.values) !== null && _node$values !== void 0 ? _node$values : [];\n\n      for (var _i26 = 0; _i26 < valuesNodes.length; _i26++) {\n        var value = valuesNodes[_i26];\n        enumValueMap[value.name.value] = {\n          description: getDescription(value, options),\n          deprecationReason: getDeprecationReason(value),\n          astNode: value\n        };\n      }\n    }\n\n    return enumValueMap;\n  }\n\n  function buildInterfaces(nodes) {\n    var interfaces = [];\n\n    for (var _i28 = 0; _i28 < nodes.length; _i28++) {\n      var _node$interfaces;\n\n      var node = nodes[_i28];\n      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n      var interfacesNodes = (_node$interfaces = node.interfaces) !== null && _node$interfaces !== void 0 ? _node$interfaces : [];\n\n      for (var _i30 = 0; _i30 < interfacesNodes.length; _i30++) {\n        var type = interfacesNodes[_i30];\n        // Note: While this could make assertions to get the correctly typed\n        // values below, that would throw immediately while type system\n        // validation with validateSchema() will produce more actionable\n        // results.\n        interfaces.push(getNamedType(type));\n      }\n    }\n\n    return interfaces;\n  }\n\n  function buildUnionTypes(nodes) {\n    var types = [];\n\n    for (var _i32 = 0; _i32 < nodes.length; _i32++) {\n      var _node$types;\n\n      var node = nodes[_i32];\n      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n      var typeNodes = (_node$types = node.types) !== null && _node$types !== void 0 ? _node$types : [];\n\n      for (var _i34 = 0; _i34 < typeNodes.length; _i34++) {\n        var type = typeNodes[_i34];\n        // Note: While this could make assertions to get the correctly typed\n        // values below, that would throw immediately while type system\n        // validation with validateSchema() will produce more actionable\n        // results.\n        types.push(getNamedType(type));\n      }\n    }\n\n    return types;\n  }\n\n  function buildType(astNode) {\n    var _typeExtensionsMap$na;\n\n    var name = astNode.name.value;\n    var description = getDescription(astNode, options);\n    var extensionNodes = (_typeExtensionsMap$na = typeExtensionsMap[name]) !== null && _typeExtensionsMap$na !== void 0 ? _typeExtensionsMap$na : [];\n\n    switch (astNode.kind) {\n      case Kind.OBJECT_TYPE_DEFINITION:\n        {\n          var extensionASTNodes = extensionNodes;\n          var allNodes = [astNode].concat(extensionASTNodes);\n          return new GraphQLObjectType({\n            name: name,\n            description: description,\n            interfaces: function interfaces() {\n              return buildInterfaces(allNodes);\n            },\n            fields: function fields() {\n              return buildFieldMap(allNodes);\n            },\n            astNode: astNode,\n            extensionASTNodes: extensionASTNodes\n          });\n        }\n\n      case Kind.INTERFACE_TYPE_DEFINITION:\n        {\n          var _extensionASTNodes = extensionNodes;\n\n          var _allNodes = [astNode].concat(_extensionASTNodes);\n\n          return new GraphQLInterfaceType({\n            name: name,\n            description: description,\n            interfaces: function interfaces() {\n              return buildInterfaces(_allNodes);\n            },\n            fields: function fields() {\n              return buildFieldMap(_allNodes);\n            },\n            astNode: astNode,\n            extensionASTNodes: _extensionASTNodes\n          });\n        }\n\n      case Kind.ENUM_TYPE_DEFINITION:\n        {\n          var _extensionASTNodes2 = extensionNodes;\n\n          var _allNodes2 = [astNode].concat(_extensionASTNodes2);\n\n          return new GraphQLEnumType({\n            name: name,\n            description: description,\n            values: buildEnumValueMap(_allNodes2),\n            astNode: astNode,\n            extensionASTNodes: _extensionASTNodes2\n          });\n        }\n\n      case Kind.UNION_TYPE_DEFINITION:\n        {\n          var _extensionASTNodes3 = extensionNodes;\n\n          var _allNodes3 = [astNode].concat(_extensionASTNodes3);\n\n          return new GraphQLUnionType({\n            name: name,\n            description: description,\n            types: function types() {\n              return buildUnionTypes(_allNodes3);\n            },\n            astNode: astNode,\n            extensionASTNodes: _extensionASTNodes3\n          });\n        }\n\n      case Kind.SCALAR_TYPE_DEFINITION:\n        {\n          var _extensionASTNodes4 = extensionNodes;\n          return new GraphQLScalarType({\n            name: name,\n            description: description,\n            specifiedByUrl: getSpecifiedByUrl(astNode),\n            astNode: astNode,\n            extensionASTNodes: _extensionASTNodes4\n          });\n        }\n\n      case Kind.INPUT_OBJECT_TYPE_DEFINITION:\n        {\n          var _extensionASTNodes5 = extensionNodes;\n\n          var _allNodes4 = [astNode].concat(_extensionASTNodes5);\n\n          return new GraphQLInputObjectType({\n            name: name,\n            description: description,\n            fields: function fields() {\n              return buildInputFieldMap(_allNodes4);\n            },\n            astNode: astNode,\n            extensionASTNodes: _extensionASTNodes5\n          });\n        }\n    } // istanbul ignore next (Not reachable. All possible type definition nodes have been considered)\n\n\n    false || invariant(0, 'Unexpected type definition node: ' + inspect(astNode));\n  }\n}\nvar stdTypeMap = keyMap(specifiedScalarTypes.concat(introspectionTypes), function (type) {\n  return type.name;\n});\n/**\n * Given a field or enum value node, returns the string value for the\n * deprecation reason.\n */\n\nfunction getDeprecationReason(node) {\n  var deprecated = getDirectiveValues(GraphQLDeprecatedDirective, node);\n  return deprecated === null || deprecated === void 0 ? void 0 : deprecated.reason;\n}\n/**\n * Given a scalar node, returns the string value for the specifiedByUrl.\n */\n\n\nfunction getSpecifiedByUrl(node) {\n  var specifiedBy = getDirectiveValues(GraphQLSpecifiedByDirective, node);\n  return specifiedBy === null || specifiedBy === void 0 ? void 0 : specifiedBy.url;\n}\n/**\n * Given an ast node, returns its string description.\n * @deprecated: provided to ease adoption and will be removed in v16.\n *\n * Accepts options as a second argument:\n *\n *    - commentDescriptions:\n *        Provide true to use preceding comments as the description.\n *\n */\n\n\nexport function getDescription(node, options) {\n  if (node.description) {\n    return node.description.value;\n  }\n\n  if ((options === null || options === void 0 ? void 0 : options.commentDescriptions) === true) {\n    var rawValue = getLeadingCommentBlock(node);\n\n    if (rawValue !== undefined) {\n      return dedentBlockStringValue('\\n' + rawValue);\n    }\n  }\n}\n\nfunction getLeadingCommentBlock(node) {\n  var loc = node.loc;\n\n  if (!loc) {\n    return;\n  }\n\n  var comments = [];\n  var token = loc.startToken.prev;\n\n  while (token != null && token.kind === TokenKind.COMMENT && token.next && token.prev && token.line + 1 === token.next.line && token.line !== token.prev.line) {\n    var value = String(token.value);\n    comments.push(value);\n    token = token.prev;\n  }\n\n  return comments.length > 0 ? comments.reverse().join('\\n') : undefined;\n}\n","import devAssert from \"../jsutils/devAssert.mjs\";\nimport { Kind } from \"../language/kinds.mjs\";\nimport { parse } from \"../language/parser.mjs\";\nimport { assertValidSDL } from \"../validation/validate.mjs\";\nimport { GraphQLSchema } from \"../type/schema.mjs\";\nimport { specifiedDirectives } from \"../type/directives.mjs\";\nimport { extendSchemaImpl } from \"./extendSchema.mjs\";\n\n/**\n * This takes the ast of a schema document produced by the parse function in\n * src/language/parser.js.\n *\n * If no schema definition is provided, then it will look for types named Query\n * and Mutation.\n *\n * Given that AST it constructs a GraphQLSchema. The resulting schema\n * has no resolve methods, so execution will use default resolvers.\n *\n * Accepts options as a second argument:\n *\n *    - commentDescriptions:\n *        Provide true to use preceding comments as the description.\n *\n */\nexport function buildASTSchema(documentAST, options) {\n  documentAST != null && documentAST.kind === Kind.DOCUMENT || devAssert(0, 'Must provide valid Document AST.');\n\n  if ((options === null || options === void 0 ? void 0 : options.assumeValid) !== true && (options === null || options === void 0 ? void 0 : options.assumeValidSDL) !== true) {\n    assertValidSDL(documentAST);\n  }\n\n  var emptySchemaConfig = {\n    description: undefined,\n    types: [],\n    directives: [],\n    extensions: undefined,\n    extensionASTNodes: [],\n    assumeValid: false\n  };\n  var config = extendSchemaImpl(emptySchemaConfig, documentAST, options);\n\n  if (config.astNode == null) {\n    for (var _i2 = 0, _config$types2 = config.types; _i2 < _config$types2.length; _i2++) {\n      var type = _config$types2[_i2];\n\n      switch (type.name) {\n        // Note: While this could make early assertions to get the correctly\n        // typed values below, that would throw immediately while type system\n        // validation with validateSchema() will produce more actionable results.\n        case 'Query':\n          config.query = type;\n          break;\n\n        case 'Mutation':\n          config.mutation = type;\n          break;\n\n        case 'Subscription':\n          config.subscription = type;\n          break;\n      }\n    }\n  }\n\n  var directives = config.directives; // If specified directives were not explicitly declared, add them.\n\n  var _loop = function _loop(_i4) {\n    var stdDirective = specifiedDirectives[_i4];\n\n    if (directives.every(function (directive) {\n      return directive.name !== stdDirective.name;\n    })) {\n      directives.push(stdDirective);\n    }\n  };\n\n  for (var _i4 = 0; _i4 < specifiedDirectives.length; _i4++) {\n    _loop(_i4);\n  }\n\n  return new GraphQLSchema(config);\n}\n/**\n * A helper function to build a GraphQLSchema directly from a source\n * document.\n */\n\nexport function buildSchema(source, options) {\n  var document = parse(source, {\n    noLocation: options === null || options === void 0 ? void 0 : options.noLocation,\n    allowLegacySDLEmptyFields: options === null || options === void 0 ? void 0 : options.allowLegacySDLEmptyFields,\n    allowLegacySDLImplementsInterfaces: options === null || options === void 0 ? void 0 : options.allowLegacySDLImplementsInterfaces,\n    experimentalFragmentVariables: options === null || options === void 0 ? void 0 : options.experimentalFragmentVariables\n  });\n  return buildASTSchema(document, {\n    commentDescriptions: options === null || options === void 0 ? void 0 : options.commentDescriptions,\n    assumeValidSDL: options === null || options === void 0 ? void 0 : options.assumeValidSDL,\n    assumeValid: options === null || options === void 0 ? void 0 : options.assumeValid\n  });\n}\n","function 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) { _defineProperty(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 _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nimport objectValues from \"../polyfills/objectValues.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport invariant from \"../jsutils/invariant.mjs\";\nimport keyValMap from \"../jsutils/keyValMap.mjs\";\nimport naturalCompare from \"../jsutils/naturalCompare.mjs\";\nimport { GraphQLSchema } from \"../type/schema.mjs\";\nimport { GraphQLDirective } from \"../type/directives.mjs\";\nimport { isIntrospectionType } from \"../type/introspection.mjs\";\nimport { GraphQLList, GraphQLNonNull, GraphQLObjectType, GraphQLInterfaceType, GraphQLUnionType, GraphQLEnumType, GraphQLInputObjectType, isListType, isNonNullType, isScalarType, isObjectType, isInterfaceType, isUnionType, isEnumType, isInputObjectType } from \"../type/definition.mjs\";\n/**\n * Sort GraphQLSchema.\n *\n * This function returns a sorted copy of the given GraphQLSchema.\n */\n\nexport function lexicographicSortSchema(schema) {\n  var schemaConfig = schema.toConfig();\n  var typeMap = keyValMap(sortByName(schemaConfig.types), function (type) {\n    return type.name;\n  }, sortNamedType);\n  return new GraphQLSchema(_objectSpread(_objectSpread({}, schemaConfig), {}, {\n    types: objectValues(typeMap),\n    directives: sortByName(schemaConfig.directives).map(sortDirective),\n    query: replaceMaybeType(schemaConfig.query),\n    mutation: replaceMaybeType(schemaConfig.mutation),\n    subscription: replaceMaybeType(schemaConfig.subscription)\n  }));\n\n  function replaceType(type) {\n    if (isListType(type)) {\n      // $FlowFixMe[incompatible-return]\n      return new GraphQLList(replaceType(type.ofType));\n    } else if (isNonNullType(type)) {\n      // $FlowFixMe[incompatible-return]\n      return new GraphQLNonNull(replaceType(type.ofType));\n    }\n\n    return replaceNamedType(type);\n  }\n\n  function replaceNamedType(type) {\n    return typeMap[type.name];\n  }\n\n  function replaceMaybeType(maybeType) {\n    return maybeType && replaceNamedType(maybeType);\n  }\n\n  function sortDirective(directive) {\n    var config = directive.toConfig();\n    return new GraphQLDirective(_objectSpread(_objectSpread({}, config), {}, {\n      locations: sortBy(config.locations, function (x) {\n        return x;\n      }),\n      args: sortArgs(config.args)\n    }));\n  }\n\n  function sortArgs(args) {\n    return sortObjMap(args, function (arg) {\n      return _objectSpread(_objectSpread({}, arg), {}, {\n        type: replaceType(arg.type)\n      });\n    });\n  }\n\n  function sortFields(fieldsMap) {\n    return sortObjMap(fieldsMap, function (field) {\n      return _objectSpread(_objectSpread({}, field), {}, {\n        type: replaceType(field.type),\n        args: sortArgs(field.args)\n      });\n    });\n  }\n\n  function sortInputFields(fieldsMap) {\n    return sortObjMap(fieldsMap, function (field) {\n      return _objectSpread(_objectSpread({}, field), {}, {\n        type: replaceType(field.type)\n      });\n    });\n  }\n\n  function sortTypes(arr) {\n    return sortByName(arr).map(replaceNamedType);\n  }\n\n  function sortNamedType(type) {\n    if (isScalarType(type) || isIntrospectionType(type)) {\n      return type;\n    }\n\n    if (isObjectType(type)) {\n      var config = type.toConfig();\n      return new GraphQLObjectType(_objectSpread(_objectSpread({}, config), {}, {\n        interfaces: function interfaces() {\n          return sortTypes(config.interfaces);\n        },\n        fields: function fields() {\n          return sortFields(config.fields);\n        }\n      }));\n    }\n\n    if (isInterfaceType(type)) {\n      var _config = type.toConfig();\n\n      return new GraphQLInterfaceType(_objectSpread(_objectSpread({}, _config), {}, {\n        interfaces: function interfaces() {\n          return sortTypes(_config.interfaces);\n        },\n        fields: function fields() {\n          return sortFields(_config.fields);\n        }\n      }));\n    }\n\n    if (isUnionType(type)) {\n      var _config2 = type.toConfig();\n\n      return new GraphQLUnionType(_objectSpread(_objectSpread({}, _config2), {}, {\n        types: function types() {\n          return sortTypes(_config2.types);\n        }\n      }));\n    }\n\n    if (isEnumType(type)) {\n      var _config3 = type.toConfig();\n\n      return new GraphQLEnumType(_objectSpread(_objectSpread({}, _config3), {}, {\n        values: sortObjMap(_config3.values)\n      }));\n    } // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2618')\n\n\n    if (isInputObjectType(type)) {\n      var _config4 = type.toConfig();\n\n      return new GraphQLInputObjectType(_objectSpread(_objectSpread({}, _config4), {}, {\n        fields: function fields() {\n          return sortInputFields(_config4.fields);\n        }\n      }));\n    } // istanbul ignore next (Not reachable. All possible types have been considered)\n\n\n    false || invariant(0, 'Unexpected type: ' + inspect(type));\n  }\n}\n\nfunction sortObjMap(map, sortValueFn) {\n  var sortedMap = Object.create(null);\n  var sortedKeys = sortBy(Object.keys(map), function (x) {\n    return x;\n  });\n\n  for (var _i2 = 0; _i2 < sortedKeys.length; _i2++) {\n    var key = sortedKeys[_i2];\n    var value = map[key];\n    sortedMap[key] = sortValueFn ? sortValueFn(value) : value;\n  }\n\n  return sortedMap;\n}\n\nfunction sortByName(array) {\n  return sortBy(array, function (obj) {\n    return obj.name;\n  });\n}\n\nfunction sortBy(array, mapToKey) {\n  return array.slice().sort(function (obj1, obj2) {\n    var key1 = mapToKey(obj1);\n    var key2 = mapToKey(obj2);\n    return naturalCompare(key1, key2);\n  });\n}\n","import objectValues from \"../polyfills/objectValues.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport invariant from \"../jsutils/invariant.mjs\";\nimport { print } from \"../language/printer.mjs\";\nimport { printBlockString } from \"../language/blockString.mjs\";\nimport { isIntrospectionType } from \"../type/introspection.mjs\";\nimport { GraphQLString, isSpecifiedScalarType } from \"../type/scalars.mjs\";\nimport { DEFAULT_DEPRECATION_REASON, isSpecifiedDirective } from \"../type/directives.mjs\";\nimport { isScalarType, isObjectType, isInterfaceType, isUnionType, isEnumType, isInputObjectType } from \"../type/definition.mjs\";\nimport { astFromValue } from \"./astFromValue.mjs\";\n\n/**\n * Accepts options as a second argument:\n *\n *    - commentDescriptions:\n *        Provide true to use preceding comments as the description.\n *\n */\nexport function printSchema(schema, options) {\n  return printFilteredSchema(schema, function (n) {\n    return !isSpecifiedDirective(n);\n  }, isDefinedType, options);\n}\nexport function printIntrospectionSchema(schema, options) {\n  return printFilteredSchema(schema, isSpecifiedDirective, isIntrospectionType, options);\n}\n\nfunction isDefinedType(type) {\n  return !isSpecifiedScalarType(type) && !isIntrospectionType(type);\n}\n\nfunction printFilteredSchema(schema, directiveFilter, typeFilter, options) {\n  var directives = schema.getDirectives().filter(directiveFilter);\n  var types = objectValues(schema.getTypeMap()).filter(typeFilter);\n  return [printSchemaDefinition(schema)].concat(directives.map(function (directive) {\n    return printDirective(directive, options);\n  }), types.map(function (type) {\n    return printType(type, options);\n  })).filter(Boolean).join('\\n\\n') + '\\n';\n}\n\nfunction printSchemaDefinition(schema) {\n  if (schema.description == null && isSchemaOfCommonNames(schema)) {\n    return;\n  }\n\n  var operationTypes = [];\n  var queryType = schema.getQueryType();\n\n  if (queryType) {\n    operationTypes.push(\"  query: \".concat(queryType.name));\n  }\n\n  var mutationType = schema.getMutationType();\n\n  if (mutationType) {\n    operationTypes.push(\"  mutation: \".concat(mutationType.name));\n  }\n\n  var subscriptionType = schema.getSubscriptionType();\n\n  if (subscriptionType) {\n    operationTypes.push(\"  subscription: \".concat(subscriptionType.name));\n  }\n\n  return printDescription({}, schema) + \"schema {\\n\".concat(operationTypes.join('\\n'), \"\\n}\");\n}\n/**\n * GraphQL schema define root types for each type of operation. These types are\n * the same as any other type and can be named in any manner, however there is\n * a common naming convention:\n *\n *   schema {\n *     query: Query\n *     mutation: Mutation\n *   }\n *\n * When using this naming convention, the schema description can be omitted.\n */\n\n\nfunction isSchemaOfCommonNames(schema) {\n  var queryType = schema.getQueryType();\n\n  if (queryType && queryType.name !== 'Query') {\n    return false;\n  }\n\n  var mutationType = schema.getMutationType();\n\n  if (mutationType && mutationType.name !== 'Mutation') {\n    return false;\n  }\n\n  var subscriptionType = schema.getSubscriptionType();\n\n  if (subscriptionType && subscriptionType.name !== 'Subscription') {\n    return false;\n  }\n\n  return true;\n}\n\nexport function printType(type, options) {\n  if (isScalarType(type)) {\n    return printScalar(type, options);\n  }\n\n  if (isObjectType(type)) {\n    return printObject(type, options);\n  }\n\n  if (isInterfaceType(type)) {\n    return printInterface(type, options);\n  }\n\n  if (isUnionType(type)) {\n    return printUnion(type, options);\n  }\n\n  if (isEnumType(type)) {\n    return printEnum(type, options);\n  } // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2618')\n\n\n  if (isInputObjectType(type)) {\n    return printInputObject(type, options);\n  } // istanbul ignore next (Not reachable. All possible types have been considered)\n\n\n  false || invariant(0, 'Unexpected type: ' + inspect(type));\n}\n\nfunction printScalar(type, options) {\n  return printDescription(options, type) + \"scalar \".concat(type.name) + printSpecifiedByUrl(type);\n}\n\nfunction printImplementedInterfaces(type) {\n  var interfaces = type.getInterfaces();\n  return interfaces.length ? ' implements ' + interfaces.map(function (i) {\n    return i.name;\n  }).join(' & ') : '';\n}\n\nfunction printObject(type, options) {\n  return printDescription(options, type) + \"type \".concat(type.name) + printImplementedInterfaces(type) + printFields(options, type);\n}\n\nfunction printInterface(type, options) {\n  return printDescription(options, type) + \"interface \".concat(type.name) + printImplementedInterfaces(type) + printFields(options, type);\n}\n\nfunction printUnion(type, options) {\n  var types = type.getTypes();\n  var possibleTypes = types.length ? ' = ' + types.join(' | ') : '';\n  return printDescription(options, type) + 'union ' + type.name + possibleTypes;\n}\n\nfunction printEnum(type, options) {\n  var values = type.getValues().map(function (value, i) {\n    return printDescription(options, value, '  ', !i) + '  ' + value.name + printDeprecated(value.deprecationReason);\n  });\n  return printDescription(options, type) + \"enum \".concat(type.name) + printBlock(values);\n}\n\nfunction printInputObject(type, options) {\n  var fields = objectValues(type.getFields()).map(function (f, i) {\n    return printDescription(options, f, '  ', !i) + '  ' + printInputValue(f);\n  });\n  return printDescription(options, type) + \"input \".concat(type.name) + printBlock(fields);\n}\n\nfunction printFields(options, type) {\n  var fields = objectValues(type.getFields()).map(function (f, i) {\n    return printDescription(options, f, '  ', !i) + '  ' + f.name + printArgs(options, f.args, '  ') + ': ' + String(f.type) + printDeprecated(f.deprecationReason);\n  });\n  return printBlock(fields);\n}\n\nfunction printBlock(items) {\n  return items.length !== 0 ? ' {\\n' + items.join('\\n') + '\\n}' : '';\n}\n\nfunction printArgs(options, args) {\n  var indentation = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : '';\n\n  if (args.length === 0) {\n    return '';\n  } // If every arg does not have a description, print them on one line.\n\n\n  if (args.every(function (arg) {\n    return !arg.description;\n  })) {\n    return '(' + args.map(printInputValue).join(', ') + ')';\n  }\n\n  return '(\\n' + args.map(function (arg, i) {\n    return printDescription(options, arg, '  ' + indentation, !i) + '  ' + indentation + printInputValue(arg);\n  }).join('\\n') + '\\n' + indentation + ')';\n}\n\nfunction printInputValue(arg) {\n  var defaultAST = astFromValue(arg.defaultValue, arg.type);\n  var argDecl = arg.name + ': ' + String(arg.type);\n\n  if (defaultAST) {\n    argDecl += \" = \".concat(print(defaultAST));\n  }\n\n  return argDecl + printDeprecated(arg.deprecationReason);\n}\n\nfunction printDirective(directive, options) {\n  return printDescription(options, directive) + 'directive @' + directive.name + printArgs(options, directive.args) + (directive.isRepeatable ? ' repeatable' : '') + ' on ' + directive.locations.join(' | ');\n}\n\nfunction printDeprecated(reason) {\n  if (reason == null) {\n    return '';\n  }\n\n  var reasonAST = astFromValue(reason, GraphQLString);\n\n  if (reasonAST && reason !== DEFAULT_DEPRECATION_REASON) {\n    return ' @deprecated(reason: ' + print(reasonAST) + ')';\n  }\n\n  return ' @deprecated';\n}\n\nfunction printSpecifiedByUrl(scalar) {\n  if (scalar.specifiedByUrl == null) {\n    return '';\n  }\n\n  var url = scalar.specifiedByUrl;\n  var urlAST = astFromValue(url, GraphQLString);\n  urlAST || invariant(0, 'Unexpected null value returned from `astFromValue` for specifiedByUrl');\n  return ' @specifiedBy(url: ' + print(urlAST) + ')';\n}\n\nfunction printDescription(options, def) {\n  var indentation = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : '';\n  var firstInBlock = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;\n  var description = def.description;\n\n  if (description == null) {\n    return '';\n  }\n\n  if ((options === null || options === void 0 ? void 0 : options.commentDescriptions) === true) {\n    return printDescriptionWithComments(description, indentation, firstInBlock);\n  }\n\n  var preferMultipleLines = description.length > 70;\n  var blockString = printBlockString(description, '', preferMultipleLines);\n  var prefix = indentation && !firstInBlock ? '\\n' + indentation : indentation;\n  return prefix + blockString.replace(/\\n/g, '\\n' + indentation) + '\\n';\n}\n\nfunction printDescriptionWithComments(description, indentation, firstInBlock) {\n  var prefix = indentation && !firstInBlock ? '\\n' : '';\n  var comment = description.split('\\n').map(function (line) {\n    return indentation + (line !== '' ? '# ' + line : '#');\n  }).join('\\n');\n  return prefix + comment + '\\n';\n}\n","/**\n * Provided a collection of ASTs, presumably each from different files,\n * concatenate the ASTs together into batched AST, useful for validating many\n * GraphQL source files which together represent one conceptual application.\n */\nexport function concatAST(documents) {\n  var definitions = [];\n\n  for (var _i2 = 0; _i2 < documents.length; _i2++) {\n    var doc = documents[_i2];\n    definitions = definitions.concat(doc.definitions);\n  }\n\n  return {\n    kind: 'Document',\n    definitions: definitions\n  };\n}\n","import { Kind } from \"../language/kinds.mjs\";\nimport { visit } from \"../language/visitor.mjs\";\n/**\n * separateOperations accepts a single AST document which may contain many\n * operations and fragments and returns a collection of AST documents each of\n * which contains a single operation as well the fragment definitions it\n * refers to.\n */\n\nexport function separateOperations(documentAST) {\n  var operations = [];\n  var depGraph = Object.create(null); // Populate metadata and build a dependency graph.\n\n  for (var _i2 = 0, _documentAST$definiti2 = documentAST.definitions; _i2 < _documentAST$definiti2.length; _i2++) {\n    var definitionNode = _documentAST$definiti2[_i2];\n\n    switch (definitionNode.kind) {\n      case Kind.OPERATION_DEFINITION:\n        operations.push(definitionNode);\n        break;\n\n      case Kind.FRAGMENT_DEFINITION:\n        depGraph[definitionNode.name.value] = collectDependencies(definitionNode.selectionSet);\n        break;\n    }\n  } // For each operation, produce a new synthesized AST which includes only what\n  // is necessary for completing that operation.\n\n\n  var separatedDocumentASTs = Object.create(null);\n\n  var _loop = function _loop(_i4) {\n    var operation = operations[_i4];\n    var dependencies = new Set();\n\n    for (var _i6 = 0, _collectDependencies2 = collectDependencies(operation.selectionSet); _i6 < _collectDependencies2.length; _i6++) {\n      var fragmentName = _collectDependencies2[_i6];\n      collectTransitiveDependencies(dependencies, depGraph, fragmentName);\n    } // Provides the empty string for anonymous operations.\n\n\n    var operationName = operation.name ? operation.name.value : ''; // The list of definition nodes to be included for this operation, sorted\n    // to retain the same order as the original document.\n\n    separatedDocumentASTs[operationName] = {\n      kind: Kind.DOCUMENT,\n      definitions: documentAST.definitions.filter(function (node) {\n        return node === operation || node.kind === Kind.FRAGMENT_DEFINITION && dependencies.has(node.name.value);\n      })\n    };\n  };\n\n  for (var _i4 = 0; _i4 < operations.length; _i4++) {\n    _loop(_i4);\n  }\n\n  return separatedDocumentASTs;\n}\n\n// From a dependency graph, collects a list of transitive dependencies by\n// recursing through a dependency graph.\nfunction collectTransitiveDependencies(collected, depGraph, fromName) {\n  if (!collected.has(fromName)) {\n    collected.add(fromName);\n    var immediateDeps = depGraph[fromName];\n\n    if (immediateDeps !== undefined) {\n      for (var _i8 = 0; _i8 < immediateDeps.length; _i8++) {\n        var toName = immediateDeps[_i8];\n        collectTransitiveDependencies(collected, depGraph, toName);\n      }\n    }\n  }\n}\n\nfunction collectDependencies(selectionSet) {\n  var dependencies = [];\n  visit(selectionSet, {\n    FragmentSpread: function FragmentSpread(node) {\n      dependencies.push(node.name.value);\n    }\n  });\n  return dependencies;\n}\n","import { Source, isSource } from \"../language/source.mjs\";\nimport { TokenKind } from \"../language/tokenKind.mjs\";\nimport { Lexer, isPunctuatorTokenKind } from \"../language/lexer.mjs\";\nimport { dedentBlockStringValue, getBlockStringIndentation } from \"../language/blockString.mjs\";\n/**\n * Strips characters that are not significant to the validity or execution\n * of a GraphQL document:\n *   - UnicodeBOM\n *   - WhiteSpace\n *   - LineTerminator\n *   - Comment\n *   - Comma\n *   - BlockString indentation\n *\n * Note: It is required to have a delimiter character between neighboring\n * non-punctuator tokens and this function always uses single space as delimiter.\n *\n * It is guaranteed that both input and output documents if parsed would result\n * in the exact same AST except for nodes location.\n *\n * Warning: It is guaranteed that this function will always produce stable results.\n * However, it's not guaranteed that it will stay the same between different\n * releases due to bugfixes or changes in the GraphQL specification.\n *\n * Query example:\n *\n * query SomeQuery($foo: String!, $bar: String) {\n *   someField(foo: $foo, bar: $bar) {\n *     a\n *     b {\n *       c\n *       d\n *     }\n *   }\n * }\n *\n * Becomes:\n *\n * query SomeQuery($foo:String!$bar:String){someField(foo:$foo bar:$bar){a b{c d}}}\n *\n * SDL example:\n *\n * \"\"\"\n * Type description\n * \"\"\"\n * type Foo {\n *   \"\"\"\n *   Field description\n *   \"\"\"\n *   bar: String\n * }\n *\n * Becomes:\n *\n * \"\"\"Type description\"\"\" type Foo{\"\"\"Field description\"\"\" bar:String}\n */\n\nexport function stripIgnoredCharacters(source) {\n  var sourceObj = isSource(source) ? source : new Source(source);\n  var body = sourceObj.body;\n  var lexer = new Lexer(sourceObj);\n  var strippedBody = '';\n  var wasLastAddedTokenNonPunctuator = false;\n\n  while (lexer.advance().kind !== TokenKind.EOF) {\n    var currentToken = lexer.token;\n    var tokenKind = currentToken.kind;\n    /**\n     * Every two non-punctuator tokens should have space between them.\n     * Also prevent case of non-punctuator token following by spread resulting\n     * in invalid token (e.g. `1...` is invalid Float token).\n     */\n\n    var isNonPunctuator = !isPunctuatorTokenKind(currentToken.kind);\n\n    if (wasLastAddedTokenNonPunctuator) {\n      if (isNonPunctuator || currentToken.kind === TokenKind.SPREAD) {\n        strippedBody += ' ';\n      }\n    }\n\n    var tokenBody = body.slice(currentToken.start, currentToken.end);\n\n    if (tokenKind === TokenKind.BLOCK_STRING) {\n      strippedBody += dedentBlockString(tokenBody);\n    } else {\n      strippedBody += tokenBody;\n    }\n\n    wasLastAddedTokenNonPunctuator = isNonPunctuator;\n  }\n\n  return strippedBody;\n}\n\nfunction dedentBlockString(blockStr) {\n  // skip leading and trailing triple quotations\n  var rawStr = blockStr.slice(3, -3);\n  var body = dedentBlockStringValue(rawStr);\n\n  if (getBlockStringIndentation(body) > 0) {\n    body = '\\n' + body;\n  }\n\n  var lastChar = body[body.length - 1];\n  var hasTrailingQuote = lastChar === '\"' && body.slice(-4) !== '\\\\\"\"\"';\n\n  if (hasTrailingQuote || lastChar === '\\\\') {\n    body += '\\n';\n  }\n\n  return '\"\"\"' + body + '\"\"\"';\n}\n","function 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) { _defineProperty(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 _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nimport objectValues from \"../polyfills/objectValues.mjs\";\nimport keyMap from \"../jsutils/keyMap.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport invariant from \"../jsutils/invariant.mjs\";\nimport naturalCompare from \"../jsutils/naturalCompare.mjs\";\nimport { print } from \"../language/printer.mjs\";\nimport { visit } from \"../language/visitor.mjs\";\nimport { isSpecifiedScalarType } from \"../type/scalars.mjs\";\nimport { isScalarType, isObjectType, isInterfaceType, isUnionType, isEnumType, isInputObjectType, isNonNullType, isListType, isNamedType, isRequiredArgument, isRequiredInputField } from \"../type/definition.mjs\";\nimport { astFromValue } from \"./astFromValue.mjs\";\nexport var BreakingChangeType = Object.freeze({\n  TYPE_REMOVED: 'TYPE_REMOVED',\n  TYPE_CHANGED_KIND: 'TYPE_CHANGED_KIND',\n  TYPE_REMOVED_FROM_UNION: 'TYPE_REMOVED_FROM_UNION',\n  VALUE_REMOVED_FROM_ENUM: 'VALUE_REMOVED_FROM_ENUM',\n  REQUIRED_INPUT_FIELD_ADDED: 'REQUIRED_INPUT_FIELD_ADDED',\n  IMPLEMENTED_INTERFACE_REMOVED: 'IMPLEMENTED_INTERFACE_REMOVED',\n  FIELD_REMOVED: 'FIELD_REMOVED',\n  FIELD_CHANGED_KIND: 'FIELD_CHANGED_KIND',\n  REQUIRED_ARG_ADDED: 'REQUIRED_ARG_ADDED',\n  ARG_REMOVED: 'ARG_REMOVED',\n  ARG_CHANGED_KIND: 'ARG_CHANGED_KIND',\n  DIRECTIVE_REMOVED: 'DIRECTIVE_REMOVED',\n  DIRECTIVE_ARG_REMOVED: 'DIRECTIVE_ARG_REMOVED',\n  REQUIRED_DIRECTIVE_ARG_ADDED: 'REQUIRED_DIRECTIVE_ARG_ADDED',\n  DIRECTIVE_REPEATABLE_REMOVED: 'DIRECTIVE_REPEATABLE_REMOVED',\n  DIRECTIVE_LOCATION_REMOVED: 'DIRECTIVE_LOCATION_REMOVED'\n});\nexport var DangerousChangeType = Object.freeze({\n  VALUE_ADDED_TO_ENUM: 'VALUE_ADDED_TO_ENUM',\n  TYPE_ADDED_TO_UNION: 'TYPE_ADDED_TO_UNION',\n  OPTIONAL_INPUT_FIELD_ADDED: 'OPTIONAL_INPUT_FIELD_ADDED',\n  OPTIONAL_ARG_ADDED: 'OPTIONAL_ARG_ADDED',\n  IMPLEMENTED_INTERFACE_ADDED: 'IMPLEMENTED_INTERFACE_ADDED',\n  ARG_DEFAULT_VALUE_CHANGE: 'ARG_DEFAULT_VALUE_CHANGE'\n});\n\n/**\n * Given two schemas, returns an Array containing descriptions of all the types\n * of breaking changes covered by the other functions down below.\n */\nexport function findBreakingChanges(oldSchema, newSchema) {\n  var breakingChanges = findSchemaChanges(oldSchema, newSchema).filter(function (change) {\n    return change.type in BreakingChangeType;\n  });\n  return breakingChanges;\n}\n/**\n * Given two schemas, returns an Array containing descriptions of all the types\n * of potentially dangerous changes covered by the other functions down below.\n */\n\nexport function findDangerousChanges(oldSchema, newSchema) {\n  var dangerousChanges = findSchemaChanges(oldSchema, newSchema).filter(function (change) {\n    return change.type in DangerousChangeType;\n  });\n  return dangerousChanges;\n}\n\nfunction findSchemaChanges(oldSchema, newSchema) {\n  return [].concat(findTypeChanges(oldSchema, newSchema), findDirectiveChanges(oldSchema, newSchema));\n}\n\nfunction findDirectiveChanges(oldSchema, newSchema) {\n  var schemaChanges = [];\n  var directivesDiff = diff(oldSchema.getDirectives(), newSchema.getDirectives());\n\n  for (var _i2 = 0, _directivesDiff$remov2 = directivesDiff.removed; _i2 < _directivesDiff$remov2.length; _i2++) {\n    var oldDirective = _directivesDiff$remov2[_i2];\n    schemaChanges.push({\n      type: BreakingChangeType.DIRECTIVE_REMOVED,\n      description: \"\".concat(oldDirective.name, \" was removed.\")\n    });\n  }\n\n  for (var _i4 = 0, _directivesDiff$persi2 = directivesDiff.persisted; _i4 < _directivesDiff$persi2.length; _i4++) {\n    var _ref2 = _directivesDiff$persi2[_i4];\n    var _oldDirective = _ref2[0];\n    var newDirective = _ref2[1];\n    var argsDiff = diff(_oldDirective.args, newDirective.args);\n\n    for (var _i6 = 0, _argsDiff$added2 = argsDiff.added; _i6 < _argsDiff$added2.length; _i6++) {\n      var newArg = _argsDiff$added2[_i6];\n\n      if (isRequiredArgument(newArg)) {\n        schemaChanges.push({\n          type: BreakingChangeType.REQUIRED_DIRECTIVE_ARG_ADDED,\n          description: \"A required arg \".concat(newArg.name, \" on directive \").concat(_oldDirective.name, \" was added.\")\n        });\n      }\n    }\n\n    for (var _i8 = 0, _argsDiff$removed2 = argsDiff.removed; _i8 < _argsDiff$removed2.length; _i8++) {\n      var oldArg = _argsDiff$removed2[_i8];\n      schemaChanges.push({\n        type: BreakingChangeType.DIRECTIVE_ARG_REMOVED,\n        description: \"\".concat(oldArg.name, \" was removed from \").concat(_oldDirective.name, \".\")\n      });\n    }\n\n    if (_oldDirective.isRepeatable && !newDirective.isRepeatable) {\n      schemaChanges.push({\n        type: BreakingChangeType.DIRECTIVE_REPEATABLE_REMOVED,\n        description: \"Repeatable flag was removed from \".concat(_oldDirective.name, \".\")\n      });\n    }\n\n    for (var _i10 = 0, _oldDirective$locatio2 = _oldDirective.locations; _i10 < _oldDirective$locatio2.length; _i10++) {\n      var location = _oldDirective$locatio2[_i10];\n\n      if (newDirective.locations.indexOf(location) === -1) {\n        schemaChanges.push({\n          type: BreakingChangeType.DIRECTIVE_LOCATION_REMOVED,\n          description: \"\".concat(location, \" was removed from \").concat(_oldDirective.name, \".\")\n        });\n      }\n    }\n  }\n\n  return schemaChanges;\n}\n\nfunction findTypeChanges(oldSchema, newSchema) {\n  var schemaChanges = [];\n  var typesDiff = diff(objectValues(oldSchema.getTypeMap()), objectValues(newSchema.getTypeMap()));\n\n  for (var _i12 = 0, _typesDiff$removed2 = typesDiff.removed; _i12 < _typesDiff$removed2.length; _i12++) {\n    var oldType = _typesDiff$removed2[_i12];\n    schemaChanges.push({\n      type: BreakingChangeType.TYPE_REMOVED,\n      description: isSpecifiedScalarType(oldType) ? \"Standard scalar \".concat(oldType.name, \" was removed because it is not referenced anymore.\") : \"\".concat(oldType.name, \" was removed.\")\n    });\n  }\n\n  for (var _i14 = 0, _typesDiff$persisted2 = typesDiff.persisted; _i14 < _typesDiff$persisted2.length; _i14++) {\n    var _ref4 = _typesDiff$persisted2[_i14];\n    var _oldType = _ref4[0];\n    var newType = _ref4[1];\n\n    if (isEnumType(_oldType) && isEnumType(newType)) {\n      schemaChanges.push.apply(schemaChanges, findEnumTypeChanges(_oldType, newType));\n    } else if (isUnionType(_oldType) && isUnionType(newType)) {\n      schemaChanges.push.apply(schemaChanges, findUnionTypeChanges(_oldType, newType));\n    } else if (isInputObjectType(_oldType) && isInputObjectType(newType)) {\n      schemaChanges.push.apply(schemaChanges, findInputObjectTypeChanges(_oldType, newType));\n    } else if (isObjectType(_oldType) && isObjectType(newType)) {\n      schemaChanges.push.apply(schemaChanges, findFieldChanges(_oldType, newType).concat(findImplementedInterfacesChanges(_oldType, newType)));\n    } else if (isInterfaceType(_oldType) && isInterfaceType(newType)) {\n      schemaChanges.push.apply(schemaChanges, findFieldChanges(_oldType, newType).concat(findImplementedInterfacesChanges(_oldType, newType)));\n    } else if (_oldType.constructor !== newType.constructor) {\n      schemaChanges.push({\n        type: BreakingChangeType.TYPE_CHANGED_KIND,\n        description: \"\".concat(_oldType.name, \" changed from \") + \"\".concat(typeKindName(_oldType), \" to \").concat(typeKindName(newType), \".\")\n      });\n    }\n  }\n\n  return schemaChanges;\n}\n\nfunction findInputObjectTypeChanges(oldType, newType) {\n  var schemaChanges = [];\n  var fieldsDiff = diff(objectValues(oldType.getFields()), objectValues(newType.getFields()));\n\n  for (var _i16 = 0, _fieldsDiff$added2 = fieldsDiff.added; _i16 < _fieldsDiff$added2.length; _i16++) {\n    var newField = _fieldsDiff$added2[_i16];\n\n    if (isRequiredInputField(newField)) {\n      schemaChanges.push({\n        type: BreakingChangeType.REQUIRED_INPUT_FIELD_ADDED,\n        description: \"A required field \".concat(newField.name, \" on input type \").concat(oldType.name, \" was added.\")\n      });\n    } else {\n      schemaChanges.push({\n        type: DangerousChangeType.OPTIONAL_INPUT_FIELD_ADDED,\n        description: \"An optional field \".concat(newField.name, \" on input type \").concat(oldType.name, \" was added.\")\n      });\n    }\n  }\n\n  for (var _i18 = 0, _fieldsDiff$removed2 = fieldsDiff.removed; _i18 < _fieldsDiff$removed2.length; _i18++) {\n    var oldField = _fieldsDiff$removed2[_i18];\n    schemaChanges.push({\n      type: BreakingChangeType.FIELD_REMOVED,\n      description: \"\".concat(oldType.name, \".\").concat(oldField.name, \" was removed.\")\n    });\n  }\n\n  for (var _i20 = 0, _fieldsDiff$persisted2 = fieldsDiff.persisted; _i20 < _fieldsDiff$persisted2.length; _i20++) {\n    var _ref6 = _fieldsDiff$persisted2[_i20];\n    var _oldField = _ref6[0];\n    var _newField = _ref6[1];\n    var isSafe = isChangeSafeForInputObjectFieldOrFieldArg(_oldField.type, _newField.type);\n\n    if (!isSafe) {\n      schemaChanges.push({\n        type: BreakingChangeType.FIELD_CHANGED_KIND,\n        description: \"\".concat(oldType.name, \".\").concat(_oldField.name, \" changed type from \") + \"\".concat(String(_oldField.type), \" to \").concat(String(_newField.type), \".\")\n      });\n    }\n  }\n\n  return schemaChanges;\n}\n\nfunction findUnionTypeChanges(oldType, newType) {\n  var schemaChanges = [];\n  var possibleTypesDiff = diff(oldType.getTypes(), newType.getTypes());\n\n  for (var _i22 = 0, _possibleTypesDiff$ad2 = possibleTypesDiff.added; _i22 < _possibleTypesDiff$ad2.length; _i22++) {\n    var newPossibleType = _possibleTypesDiff$ad2[_i22];\n    schemaChanges.push({\n      type: DangerousChangeType.TYPE_ADDED_TO_UNION,\n      description: \"\".concat(newPossibleType.name, \" was added to union type \").concat(oldType.name, \".\")\n    });\n  }\n\n  for (var _i24 = 0, _possibleTypesDiff$re2 = possibleTypesDiff.removed; _i24 < _possibleTypesDiff$re2.length; _i24++) {\n    var oldPossibleType = _possibleTypesDiff$re2[_i24];\n    schemaChanges.push({\n      type: BreakingChangeType.TYPE_REMOVED_FROM_UNION,\n      description: \"\".concat(oldPossibleType.name, \" was removed from union type \").concat(oldType.name, \".\")\n    });\n  }\n\n  return schemaChanges;\n}\n\nfunction findEnumTypeChanges(oldType, newType) {\n  var schemaChanges = [];\n  var valuesDiff = diff(oldType.getValues(), newType.getValues());\n\n  for (var _i26 = 0, _valuesDiff$added2 = valuesDiff.added; _i26 < _valuesDiff$added2.length; _i26++) {\n    var newValue = _valuesDiff$added2[_i26];\n    schemaChanges.push({\n      type: DangerousChangeType.VALUE_ADDED_TO_ENUM,\n      description: \"\".concat(newValue.name, \" was added to enum type \").concat(oldType.name, \".\")\n    });\n  }\n\n  for (var _i28 = 0, _valuesDiff$removed2 = valuesDiff.removed; _i28 < _valuesDiff$removed2.length; _i28++) {\n    var oldValue = _valuesDiff$removed2[_i28];\n    schemaChanges.push({\n      type: BreakingChangeType.VALUE_REMOVED_FROM_ENUM,\n      description: \"\".concat(oldValue.name, \" was removed from enum type \").concat(oldType.name, \".\")\n    });\n  }\n\n  return schemaChanges;\n}\n\nfunction findImplementedInterfacesChanges(oldType, newType) {\n  var schemaChanges = [];\n  var interfacesDiff = diff(oldType.getInterfaces(), newType.getInterfaces());\n\n  for (var _i30 = 0, _interfacesDiff$added2 = interfacesDiff.added; _i30 < _interfacesDiff$added2.length; _i30++) {\n    var newInterface = _interfacesDiff$added2[_i30];\n    schemaChanges.push({\n      type: DangerousChangeType.IMPLEMENTED_INTERFACE_ADDED,\n      description: \"\".concat(newInterface.name, \" added to interfaces implemented by \").concat(oldType.name, \".\")\n    });\n  }\n\n  for (var _i32 = 0, _interfacesDiff$remov2 = interfacesDiff.removed; _i32 < _interfacesDiff$remov2.length; _i32++) {\n    var oldInterface = _interfacesDiff$remov2[_i32];\n    schemaChanges.push({\n      type: BreakingChangeType.IMPLEMENTED_INTERFACE_REMOVED,\n      description: \"\".concat(oldType.name, \" no longer implements interface \").concat(oldInterface.name, \".\")\n    });\n  }\n\n  return schemaChanges;\n}\n\nfunction findFieldChanges(oldType, newType) {\n  var schemaChanges = [];\n  var fieldsDiff = diff(objectValues(oldType.getFields()), objectValues(newType.getFields()));\n\n  for (var _i34 = 0, _fieldsDiff$removed4 = fieldsDiff.removed; _i34 < _fieldsDiff$removed4.length; _i34++) {\n    var oldField = _fieldsDiff$removed4[_i34];\n    schemaChanges.push({\n      type: BreakingChangeType.FIELD_REMOVED,\n      description: \"\".concat(oldType.name, \".\").concat(oldField.name, \" was removed.\")\n    });\n  }\n\n  for (var _i36 = 0, _fieldsDiff$persisted4 = fieldsDiff.persisted; _i36 < _fieldsDiff$persisted4.length; _i36++) {\n    var _ref8 = _fieldsDiff$persisted4[_i36];\n    var _oldField2 = _ref8[0];\n    var newField = _ref8[1];\n    schemaChanges.push.apply(schemaChanges, findArgChanges(oldType, _oldField2, newField));\n    var isSafe = isChangeSafeForObjectOrInterfaceField(_oldField2.type, newField.type);\n\n    if (!isSafe) {\n      schemaChanges.push({\n        type: BreakingChangeType.FIELD_CHANGED_KIND,\n        description: \"\".concat(oldType.name, \".\").concat(_oldField2.name, \" changed type from \") + \"\".concat(String(_oldField2.type), \" to \").concat(String(newField.type), \".\")\n      });\n    }\n  }\n\n  return schemaChanges;\n}\n\nfunction findArgChanges(oldType, oldField, newField) {\n  var schemaChanges = [];\n  var argsDiff = diff(oldField.args, newField.args);\n\n  for (var _i38 = 0, _argsDiff$removed4 = argsDiff.removed; _i38 < _argsDiff$removed4.length; _i38++) {\n    var oldArg = _argsDiff$removed4[_i38];\n    schemaChanges.push({\n      type: BreakingChangeType.ARG_REMOVED,\n      description: \"\".concat(oldType.name, \".\").concat(oldField.name, \" arg \").concat(oldArg.name, \" was removed.\")\n    });\n  }\n\n  for (var _i40 = 0, _argsDiff$persisted2 = argsDiff.persisted; _i40 < _argsDiff$persisted2.length; _i40++) {\n    var _ref10 = _argsDiff$persisted2[_i40];\n    var _oldArg = _ref10[0];\n    var newArg = _ref10[1];\n    var isSafe = isChangeSafeForInputObjectFieldOrFieldArg(_oldArg.type, newArg.type);\n\n    if (!isSafe) {\n      schemaChanges.push({\n        type: BreakingChangeType.ARG_CHANGED_KIND,\n        description: \"\".concat(oldType.name, \".\").concat(oldField.name, \" arg \").concat(_oldArg.name, \" has changed type from \") + \"\".concat(String(_oldArg.type), \" to \").concat(String(newArg.type), \".\")\n      });\n    } else if (_oldArg.defaultValue !== undefined) {\n      if (newArg.defaultValue === undefined) {\n        schemaChanges.push({\n          type: DangerousChangeType.ARG_DEFAULT_VALUE_CHANGE,\n          description: \"\".concat(oldType.name, \".\").concat(oldField.name, \" arg \").concat(_oldArg.name, \" defaultValue was removed.\")\n        });\n      } else {\n        // Since we looking only for client's observable changes we should\n        // compare default values in the same representation as they are\n        // represented inside introspection.\n        var oldValueStr = stringifyValue(_oldArg.defaultValue, _oldArg.type);\n        var newValueStr = stringifyValue(newArg.defaultValue, newArg.type);\n\n        if (oldValueStr !== newValueStr) {\n          schemaChanges.push({\n            type: DangerousChangeType.ARG_DEFAULT_VALUE_CHANGE,\n            description: \"\".concat(oldType.name, \".\").concat(oldField.name, \" arg \").concat(_oldArg.name, \" has changed defaultValue from \").concat(oldValueStr, \" to \").concat(newValueStr, \".\")\n          });\n        }\n      }\n    }\n  }\n\n  for (var _i42 = 0, _argsDiff$added4 = argsDiff.added; _i42 < _argsDiff$added4.length; _i42++) {\n    var _newArg = _argsDiff$added4[_i42];\n\n    if (isRequiredArgument(_newArg)) {\n      schemaChanges.push({\n        type: BreakingChangeType.REQUIRED_ARG_ADDED,\n        description: \"A required arg \".concat(_newArg.name, \" on \").concat(oldType.name, \".\").concat(oldField.name, \" was added.\")\n      });\n    } else {\n      schemaChanges.push({\n        type: DangerousChangeType.OPTIONAL_ARG_ADDED,\n        description: \"An optional arg \".concat(_newArg.name, \" on \").concat(oldType.name, \".\").concat(oldField.name, \" was added.\")\n      });\n    }\n  }\n\n  return schemaChanges;\n}\n\nfunction isChangeSafeForObjectOrInterfaceField(oldType, newType) {\n  if (isListType(oldType)) {\n    return (// if they're both lists, make sure the underlying types are compatible\n      isListType(newType) && isChangeSafeForObjectOrInterfaceField(oldType.ofType, newType.ofType) || // moving from nullable to non-null of the same underlying type is safe\n      isNonNullType(newType) && isChangeSafeForObjectOrInterfaceField(oldType, newType.ofType)\n    );\n  }\n\n  if (isNonNullType(oldType)) {\n    // if they're both non-null, make sure the underlying types are compatible\n    return isNonNullType(newType) && isChangeSafeForObjectOrInterfaceField(oldType.ofType, newType.ofType);\n  }\n\n  return (// if they're both named types, see if their names are equivalent\n    isNamedType(newType) && oldType.name === newType.name || // moving from nullable to non-null of the same underlying type is safe\n    isNonNullType(newType) && isChangeSafeForObjectOrInterfaceField(oldType, newType.ofType)\n  );\n}\n\nfunction isChangeSafeForInputObjectFieldOrFieldArg(oldType, newType) {\n  if (isListType(oldType)) {\n    // if they're both lists, make sure the underlying types are compatible\n    return isListType(newType) && isChangeSafeForInputObjectFieldOrFieldArg(oldType.ofType, newType.ofType);\n  }\n\n  if (isNonNullType(oldType)) {\n    return (// if they're both non-null, make sure the underlying types are\n      // compatible\n      isNonNullType(newType) && isChangeSafeForInputObjectFieldOrFieldArg(oldType.ofType, newType.ofType) || // moving from non-null to nullable of the same underlying type is safe\n      !isNonNullType(newType) && isChangeSafeForInputObjectFieldOrFieldArg(oldType.ofType, newType)\n    );\n  } // if they're both named types, see if their names are equivalent\n\n\n  return isNamedType(newType) && oldType.name === newType.name;\n}\n\nfunction typeKindName(type) {\n  if (isScalarType(type)) {\n    return 'a Scalar type';\n  }\n\n  if (isObjectType(type)) {\n    return 'an Object type';\n  }\n\n  if (isInterfaceType(type)) {\n    return 'an Interface type';\n  }\n\n  if (isUnionType(type)) {\n    return 'a Union type';\n  }\n\n  if (isEnumType(type)) {\n    return 'an Enum type';\n  } // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2618')\n\n\n  if (isInputObjectType(type)) {\n    return 'an Input type';\n  } // istanbul ignore next (Not reachable. All possible named types have been considered)\n\n\n  false || invariant(0, 'Unexpected type: ' + inspect(type));\n}\n\nfunction stringifyValue(value, type) {\n  var ast = astFromValue(value, type);\n  ast != null || invariant(0);\n  var sortedAST = visit(ast, {\n    ObjectValue: function ObjectValue(objectNode) {\n      // Make a copy since sort mutates array\n      var fields = [].concat(objectNode.fields);\n      fields.sort(function (fieldA, fieldB) {\n        return naturalCompare(fieldA.name.value, fieldB.name.value);\n      });\n      return _objectSpread(_objectSpread({}, objectNode), {}, {\n        fields: fields\n      });\n    }\n  });\n  return print(sortedAST);\n}\n\nfunction diff(oldArray, newArray) {\n  var added = [];\n  var removed = [];\n  var persisted = [];\n  var oldMap = keyMap(oldArray, function (_ref11) {\n    var name = _ref11.name;\n    return name;\n  });\n  var newMap = keyMap(newArray, function (_ref12) {\n    var name = _ref12.name;\n    return name;\n  });\n\n  for (var _i44 = 0; _i44 < oldArray.length; _i44++) {\n    var oldItem = oldArray[_i44];\n    var newItem = newMap[oldItem.name];\n\n    if (newItem === undefined) {\n      removed.push(oldItem);\n    } else {\n      persisted.push([oldItem, newItem]);\n    }\n  }\n\n  for (var _i46 = 0; _i46 < newArray.length; _i46++) {\n    var _newItem = newArray[_i46];\n\n    if (oldMap[_newItem.name] === undefined) {\n      added.push(_newItem);\n    }\n  }\n\n  return {\n    added: added,\n    persisted: persisted,\n    removed: removed\n  };\n}\n","import { validate } from \"../validation/validate.mjs\";\nimport { NoDeprecatedCustomRule } from \"../validation/rules/custom/NoDeprecatedCustomRule.mjs\";\n/**\n * A validation rule which reports deprecated usages.\n *\n * Returns a list of GraphQLError instances describing each deprecated use.\n *\n * @deprecated Please use `validate` with `NoDeprecatedCustomRule` instead:\n *\n * ```\n * import { validate, NoDeprecatedCustomRule } from 'graphql'\n *\n * const errors = validate(schema, document, [NoDeprecatedCustomRule])\n * ```\n */\n\nexport function findDeprecatedUsages(schema, ast) {\n  return validate(schema, ast, [NoDeprecatedCustomRule]);\n}\n","import invariant from \"./invariant.mjs\";\nimport nodejsCustomInspectSymbol from \"./nodejsCustomInspectSymbol.mjs\";\n/**\n * The `defineInspect()` function defines `inspect()` prototype method as alias of `toJSON`\n */\n\nexport default function defineInspect(classObject) {\n  var fn = classObject.prototype.toJSON;\n  typeof fn === 'function' || invariant(0);\n  classObject.prototype.inspect = fn; // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2317')\n\n  if (nodejsCustomInspectSymbol) {\n    classObject.prototype[nodejsCustomInspectSymbol] = fn;\n  }\n}\n","export default function devAssert(condition, message) {\n  var booleanCondition = Boolean(condition); // istanbul ignore else (See transformation done in './resources/inlineInvariant.js')\n\n  if (!booleanCondition) {\n    throw new Error(message);\n  }\n}\n","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\n/* eslint-disable flowtype/no-weak-types */\nimport nodejsCustomInspectSymbol from \"./nodejsCustomInspectSymbol.mjs\";\nvar MAX_ARRAY_LENGTH = 10;\nvar MAX_RECURSIVE_DEPTH = 2;\n/**\n * Used to print values in error messages.\n */\n\nexport default function inspect(value) {\n  return formatValue(value, []);\n}\n\nfunction formatValue(value, seenValues) {\n  switch (_typeof(value)) {\n    case 'string':\n      return JSON.stringify(value);\n\n    case 'function':\n      return value.name ? \"[function \".concat(value.name, \"]\") : '[function]';\n\n    case 'object':\n      if (value === null) {\n        return 'null';\n      }\n\n      return formatObjectValue(value, seenValues);\n\n    default:\n      return String(value);\n  }\n}\n\nfunction formatObjectValue(value, previouslySeenValues) {\n  if (previouslySeenValues.indexOf(value) !== -1) {\n    return '[Circular]';\n  }\n\n  var seenValues = [].concat(previouslySeenValues, [value]);\n  var customInspectFn = getCustomFn(value);\n\n  if (customInspectFn !== undefined) {\n    var customValue = customInspectFn.call(value); // check for infinite recursion\n\n    if (customValue !== value) {\n      return typeof customValue === 'string' ? customValue : formatValue(customValue, seenValues);\n    }\n  } else if (Array.isArray(value)) {\n    return formatArray(value, seenValues);\n  }\n\n  return formatObject(value, seenValues);\n}\n\nfunction formatObject(object, seenValues) {\n  var keys = Object.keys(object);\n\n  if (keys.length === 0) {\n    return '{}';\n  }\n\n  if (seenValues.length > MAX_RECURSIVE_DEPTH) {\n    return '[' + getObjectTag(object) + ']';\n  }\n\n  var properties = keys.map(function (key) {\n    var value = formatValue(object[key], seenValues);\n    return key + ': ' + value;\n  });\n  return '{ ' + properties.join(', ') + ' }';\n}\n\nfunction formatArray(array, seenValues) {\n  if (array.length === 0) {\n    return '[]';\n  }\n\n  if (seenValues.length > MAX_RECURSIVE_DEPTH) {\n    return '[Array]';\n  }\n\n  var len = Math.min(MAX_ARRAY_LENGTH, array.length);\n  var remaining = array.length - len;\n  var items = [];\n\n  for (var i = 0; i < len; ++i) {\n    items.push(formatValue(array[i], seenValues));\n  }\n\n  if (remaining === 1) {\n    items.push('... 1 more item');\n  } else if (remaining > 1) {\n    items.push(\"... \".concat(remaining, \" more items\"));\n  }\n\n  return '[' + items.join(', ') + ']';\n}\n\nfunction getCustomFn(object) {\n  var customInspectFn = object[String(nodejsCustomInspectSymbol)];\n\n  if (typeof customInspectFn === 'function') {\n    return customInspectFn;\n  }\n\n  if (typeof object.inspect === 'function') {\n    return object.inspect;\n  }\n}\n\nfunction getObjectTag(object) {\n  var tag = Object.prototype.toString.call(object).replace(/^\\[object /, '').replace(/]$/, '');\n\n  if (tag === 'Object' && typeof object.constructor === 'function') {\n    var name = object.constructor.name;\n\n    if (typeof name === 'string' && name !== '') {\n      return name;\n    }\n  }\n\n  return tag;\n}\n","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nimport inspect from \"./inspect.mjs\";\n/**\n * A replacement for instanceof which includes an error warning when multi-realm\n * constructors are detected.\n */\n\n// See: https://expressjs.com/en/advanced/best-practice-performance.html#set-node_env-to-production\n// See: https://webpack.js.org/guides/production/\nexport default process.env.NODE_ENV === 'production' ? // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2317')\n// eslint-disable-next-line no-shadow\nfunction instanceOf(value, constructor) {\n  return value instanceof constructor;\n} : // eslint-disable-next-line no-shadow\nfunction instanceOf(value, constructor) {\n  if (value instanceof constructor) {\n    return true;\n  }\n\n  if (_typeof(value) === 'object' && value !== null) {\n    var _value$constructor;\n\n    var className = constructor.prototype[Symbol.toStringTag];\n    var valueClassName = // We still need to support constructor's name to detect conflicts with older versions of this library.\n    Symbol.toStringTag in value ? value[Symbol.toStringTag] : (_value$constructor = value.constructor) === null || _value$constructor === void 0 ? void 0 : _value$constructor.name;\n\n    if (className === valueClassName) {\n      var stringifiedValue = inspect(value);\n      throw new Error(\"Cannot use \".concat(className, \" \\\"\").concat(stringifiedValue, \"\\\" from another module or realm.\\n\\nEnsure that there is only one instance of \\\"graphql\\\" in the node_modules\\ndirectory. If different versions of \\\"graphql\\\" are the dependencies of other\\nrelied on modules, use \\\"resolutions\\\" to ensure only one version is installed.\\n\\nhttps://yarnpkg.com/en/docs/selective-version-resolutions\\n\\nDuplicate \\\"graphql\\\" modules cannot be used at the same time since different\\nversions may have different capabilities and behavior. The data from one\\nversion used in the function from another could produce confusing and\\nspurious results.\"));\n    }\n  }\n\n  return false;\n};\n","export default function invariant(condition, message) {\n  var booleanCondition = Boolean(condition); // istanbul ignore else (See transformation done in './resources/inlineInvariant.js')\n\n  if (!booleanCondition) {\n    throw new Error(message != null ? message : 'Unexpected invariant triggered.');\n  }\n}\n","function _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\n/**\n * Return true if `value` is object-like. A value is object-like if it's not\n * `null` and has a `typeof` result of \"object\".\n */\nexport default function isObjectLike(value) {\n  return _typeof(value) == 'object' && value !== null;\n}\n","// istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2317')\nvar nodejsCustomInspectSymbol = typeof Symbol === 'function' && typeof Symbol.for === 'function' ? Symbol.for('nodejs.util.inspect.custom') : undefined;\nexport default nodejsCustomInspectSymbol;\n","import defineInspect from \"../jsutils/defineInspect.mjs\";\n\n/**\n * Contains a range of UTF-8 character offsets and token references that\n * identify the region of the source from which the AST derived.\n */\nexport var Location = /*#__PURE__*/function () {\n  /**\n   * The character offset at which this Node begins.\n   */\n\n  /**\n   * The character offset at which this Node ends.\n   */\n\n  /**\n   * The Token at which this Node begins.\n   */\n\n  /**\n   * The Token at which this Node ends.\n   */\n\n  /**\n   * The Source document the AST represents.\n   */\n  function Location(startToken, endToken, source) {\n    this.start = startToken.start;\n    this.end = endToken.end;\n    this.startToken = startToken;\n    this.endToken = endToken;\n    this.source = source;\n  }\n\n  var _proto = Location.prototype;\n\n  _proto.toJSON = function toJSON() {\n    return {\n      start: this.start,\n      end: this.end\n    };\n  };\n\n  return Location;\n}(); // Print a simplified form when appearing in `inspect` and `util.inspect`.\n\ndefineInspect(Location);\n/**\n * Represents a range of characters represented by a lexical token\n * within a Source.\n */\n\nexport var Token = /*#__PURE__*/function () {\n  /**\n   * The kind of Token.\n   */\n\n  /**\n   * The character offset at which this Node begins.\n   */\n\n  /**\n   * The character offset at which this Node ends.\n   */\n\n  /**\n   * The 1-indexed line number on which this Token appears.\n   */\n\n  /**\n   * The 1-indexed column number at which this Token begins.\n   */\n\n  /**\n   * For non-punctuation tokens, represents the interpreted value of the token.\n   */\n\n  /**\n   * Tokens exist as nodes in a double-linked-list amongst all tokens\n   * including ignored tokens. <SOF> is always the first node and <EOF>\n   * the last.\n   */\n  function Token(kind, start, end, line, column, prev, value) {\n    this.kind = kind;\n    this.start = start;\n    this.end = end;\n    this.line = line;\n    this.column = column;\n    this.value = value;\n    this.prev = prev;\n    this.next = null;\n  }\n\n  var _proto2 = Token.prototype;\n\n  _proto2.toJSON = function toJSON() {\n    return {\n      kind: this.kind,\n      value: this.value,\n      line: this.line,\n      column: this.column\n    };\n  };\n\n  return Token;\n}(); // Print a simplified form when appearing in `inspect` and `util.inspect`.\n\ndefineInspect(Token);\n/**\n * @internal\n */\n\nexport function isNode(maybeNode) {\n  return maybeNode != null && typeof maybeNode.kind === 'string';\n}\n/**\n * The list of all possible AST node types.\n */\n","/**\n * Produces the value of a block string from its parsed raw value, similar to\n * CoffeeScript's block string, Python's docstring trim or Ruby's strip_heredoc.\n *\n * This implements the GraphQL spec's BlockStringValue() static algorithm.\n *\n * @internal\n */\nexport function dedentBlockStringValue(rawString) {\n  // Expand a block string's raw value into independent lines.\n  var lines = rawString.split(/\\r\\n|[\\n\\r]/g); // Remove common indentation from all lines but first.\n\n  var commonIndent = getBlockStringIndentation(rawString);\n\n  if (commonIndent !== 0) {\n    for (var i = 1; i < lines.length; i++) {\n      lines[i] = lines[i].slice(commonIndent);\n    }\n  } // Remove leading and trailing blank lines.\n\n\n  var startLine = 0;\n\n  while (startLine < lines.length && isBlank(lines[startLine])) {\n    ++startLine;\n  }\n\n  var endLine = lines.length;\n\n  while (endLine > startLine && isBlank(lines[endLine - 1])) {\n    --endLine;\n  } // Return a string of the lines joined with U+000A.\n\n\n  return lines.slice(startLine, endLine).join('\\n');\n}\n\nfunction isBlank(str) {\n  for (var i = 0; i < str.length; ++i) {\n    if (str[i] !== ' ' && str[i] !== '\\t') {\n      return false;\n    }\n  }\n\n  return true;\n}\n/**\n * @internal\n */\n\n\nexport function getBlockStringIndentation(value) {\n  var _commonIndent;\n\n  var isFirstLine = true;\n  var isEmptyLine = true;\n  var indent = 0;\n  var commonIndent = null;\n\n  for (var i = 0; i < value.length; ++i) {\n    switch (value.charCodeAt(i)) {\n      case 13:\n        //  \\r\n        if (value.charCodeAt(i + 1) === 10) {\n          ++i; // skip \\r\\n as one symbol\n        }\n\n      // falls through\n\n      case 10:\n        //  \\n\n        isFirstLine = false;\n        isEmptyLine = true;\n        indent = 0;\n        break;\n\n      case 9: //   \\t\n\n      case 32:\n        //  <space>\n        ++indent;\n        break;\n\n      default:\n        if (isEmptyLine && !isFirstLine && (commonIndent === null || indent < commonIndent)) {\n          commonIndent = indent;\n        }\n\n        isEmptyLine = false;\n    }\n  }\n\n  return (_commonIndent = commonIndent) !== null && _commonIndent !== void 0 ? _commonIndent : 0;\n}\n/**\n * Print a block string in the indented block form by adding a leading and\n * trailing blank line. However, if a block string starts with whitespace and is\n * a single-line, adding a leading blank line would strip that whitespace.\n *\n * @internal\n */\n\nexport function printBlockString(value) {\n  var indentation = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';\n  var preferMultipleLines = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n  var isSingleLine = value.indexOf('\\n') === -1;\n  var hasLeadingSpace = value[0] === ' ' || value[0] === '\\t';\n  var hasTrailingQuote = value[value.length - 1] === '\"';\n  var hasTrailingSlash = value[value.length - 1] === '\\\\';\n  var printAsMultipleLines = !isSingleLine || hasTrailingQuote || hasTrailingSlash || preferMultipleLines;\n  var result = ''; // Format a multi-line block quote to account for leading space.\n\n  if (printAsMultipleLines && !(isSingleLine && hasLeadingSpace)) {\n    result += '\\n' + indentation;\n  }\n\n  result += indentation ? value.replace(/\\n/g, '\\n' + indentation) : value;\n\n  if (printAsMultipleLines) {\n    result += '\\n';\n  }\n\n  return '\"\"\"' + result.replace(/\"\"\"/g, '\\\\\"\"\"') + '\"\"\"';\n}\n","/**\n * The set of allowed directive location values.\n */\nexport var DirectiveLocation = Object.freeze({\n  // Request Definitions\n  QUERY: 'QUERY',\n  MUTATION: 'MUTATION',\n  SUBSCRIPTION: 'SUBSCRIPTION',\n  FIELD: 'FIELD',\n  FRAGMENT_DEFINITION: 'FRAGMENT_DEFINITION',\n  FRAGMENT_SPREAD: 'FRAGMENT_SPREAD',\n  INLINE_FRAGMENT: 'INLINE_FRAGMENT',\n  VARIABLE_DEFINITION: 'VARIABLE_DEFINITION',\n  // Type System Definitions\n  SCHEMA: 'SCHEMA',\n  SCALAR: 'SCALAR',\n  OBJECT: 'OBJECT',\n  FIELD_DEFINITION: 'FIELD_DEFINITION',\n  ARGUMENT_DEFINITION: 'ARGUMENT_DEFINITION',\n  INTERFACE: 'INTERFACE',\n  UNION: 'UNION',\n  ENUM: 'ENUM',\n  ENUM_VALUE: 'ENUM_VALUE',\n  INPUT_OBJECT: 'INPUT_OBJECT',\n  INPUT_FIELD_DEFINITION: 'INPUT_FIELD_DEFINITION'\n});\n/**\n * The enum type representing the directive location values.\n */\n","/**\n * The set of allowed kind values for AST nodes.\n */\nexport var Kind = Object.freeze({\n  // Name\n  NAME: 'Name',\n  // Document\n  DOCUMENT: 'Document',\n  OPERATION_DEFINITION: 'OperationDefinition',\n  VARIABLE_DEFINITION: 'VariableDefinition',\n  SELECTION_SET: 'SelectionSet',\n  FIELD: 'Field',\n  ARGUMENT: 'Argument',\n  // Fragments\n  FRAGMENT_SPREAD: 'FragmentSpread',\n  INLINE_FRAGMENT: 'InlineFragment',\n  FRAGMENT_DEFINITION: 'FragmentDefinition',\n  // Values\n  VARIABLE: 'Variable',\n  INT: 'IntValue',\n  FLOAT: 'FloatValue',\n  STRING: 'StringValue',\n  BOOLEAN: 'BooleanValue',\n  NULL: 'NullValue',\n  ENUM: 'EnumValue',\n  LIST: 'ListValue',\n  OBJECT: 'ObjectValue',\n  OBJECT_FIELD: 'ObjectField',\n  // Directives\n  DIRECTIVE: 'Directive',\n  // Types\n  NAMED_TYPE: 'NamedType',\n  LIST_TYPE: 'ListType',\n  NON_NULL_TYPE: 'NonNullType',\n  // Type System Definitions\n  SCHEMA_DEFINITION: 'SchemaDefinition',\n  OPERATION_TYPE_DEFINITION: 'OperationTypeDefinition',\n  // Type Definitions\n  SCALAR_TYPE_DEFINITION: 'ScalarTypeDefinition',\n  OBJECT_TYPE_DEFINITION: 'ObjectTypeDefinition',\n  FIELD_DEFINITION: 'FieldDefinition',\n  INPUT_VALUE_DEFINITION: 'InputValueDefinition',\n  INTERFACE_TYPE_DEFINITION: 'InterfaceTypeDefinition',\n  UNION_TYPE_DEFINITION: 'UnionTypeDefinition',\n  ENUM_TYPE_DEFINITION: 'EnumTypeDefinition',\n  ENUM_VALUE_DEFINITION: 'EnumValueDefinition',\n  INPUT_OBJECT_TYPE_DEFINITION: 'InputObjectTypeDefinition',\n  // Directive Definitions\n  DIRECTIVE_DEFINITION: 'DirectiveDefinition',\n  // Type System Extensions\n  SCHEMA_EXTENSION: 'SchemaExtension',\n  // Type Extensions\n  SCALAR_TYPE_EXTENSION: 'ScalarTypeExtension',\n  OBJECT_TYPE_EXTENSION: 'ObjectTypeExtension',\n  INTERFACE_TYPE_EXTENSION: 'InterfaceTypeExtension',\n  UNION_TYPE_EXTENSION: 'UnionTypeExtension',\n  ENUM_TYPE_EXTENSION: 'EnumTypeExtension',\n  INPUT_OBJECT_TYPE_EXTENSION: 'InputObjectTypeExtension'\n});\n/**\n * The enum type representing the possible kind values of AST nodes.\n */\n","import { syntaxError } from \"../error/syntaxError.mjs\";\nimport { Token } from \"./ast.mjs\";\nimport { TokenKind } from \"./tokenKind.mjs\";\nimport { dedentBlockStringValue } from \"./blockString.mjs\";\n/**\n * Given a Source object, creates a Lexer for that source.\n * A Lexer is a stateful stream generator in that every time\n * it is advanced, it returns the next token in the Source. Assuming the\n * source lexes, the final Token emitted by the lexer will be of kind\n * EOF, after which the lexer will repeatedly return the same EOF token\n * whenever called.\n */\n\nexport var Lexer = /*#__PURE__*/function () {\n  /**\n   * The previously focused non-ignored token.\n   */\n\n  /**\n   * The currently focused non-ignored token.\n   */\n\n  /**\n   * The (1-indexed) line containing the current token.\n   */\n\n  /**\n   * The character offset at which the current line begins.\n   */\n  function Lexer(source) {\n    var startOfFileToken = new Token(TokenKind.SOF, 0, 0, 0, 0, null);\n    this.source = source;\n    this.lastToken = startOfFileToken;\n    this.token = startOfFileToken;\n    this.line = 1;\n    this.lineStart = 0;\n  }\n  /**\n   * Advances the token stream to the next non-ignored token.\n   */\n\n\n  var _proto = Lexer.prototype;\n\n  _proto.advance = function advance() {\n    this.lastToken = this.token;\n    var token = this.token = this.lookahead();\n    return token;\n  }\n  /**\n   * Looks ahead and returns the next non-ignored token, but does not change\n   * the state of Lexer.\n   */\n  ;\n\n  _proto.lookahead = function lookahead() {\n    var token = this.token;\n\n    if (token.kind !== TokenKind.EOF) {\n      do {\n        var _token$next;\n\n        // Note: next is only mutable during parsing, so we cast to allow this.\n        token = (_token$next = token.next) !== null && _token$next !== void 0 ? _token$next : token.next = readToken(this, token);\n      } while (token.kind === TokenKind.COMMENT);\n    }\n\n    return token;\n  };\n\n  return Lexer;\n}();\n/**\n * @internal\n */\n\nexport function isPunctuatorTokenKind(kind) {\n  return kind === TokenKind.BANG || kind === TokenKind.DOLLAR || kind === TokenKind.AMP || kind === TokenKind.PAREN_L || kind === TokenKind.PAREN_R || kind === TokenKind.SPREAD || kind === TokenKind.COLON || kind === TokenKind.EQUALS || kind === TokenKind.AT || kind === TokenKind.BRACKET_L || kind === TokenKind.BRACKET_R || kind === TokenKind.BRACE_L || kind === TokenKind.PIPE || kind === TokenKind.BRACE_R;\n}\n\nfunction printCharCode(code) {\n  return (// NaN/undefined represents access beyond the end of the file.\n    isNaN(code) ? TokenKind.EOF : // Trust JSON for ASCII.\n    code < 0x007f ? JSON.stringify(String.fromCharCode(code)) : // Otherwise print the escaped form.\n    \"\\\"\\\\u\".concat(('00' + code.toString(16).toUpperCase()).slice(-4), \"\\\"\")\n  );\n}\n/**\n * Gets the next token from the source starting at the given position.\n *\n * This skips over whitespace until it finds the next lexable token, then lexes\n * punctuators immediately or calls the appropriate helper function for more\n * complicated tokens.\n */\n\n\nfunction readToken(lexer, prev) {\n  var source = lexer.source;\n  var body = source.body;\n  var bodyLength = body.length;\n  var pos = prev.end;\n\n  while (pos < bodyLength) {\n    var code = body.charCodeAt(pos);\n    var _line = lexer.line;\n\n    var _col = 1 + pos - lexer.lineStart; // SourceCharacter\n\n\n    switch (code) {\n      case 0xfeff: // <BOM>\n\n      case 9: //   \\t\n\n      case 32: //  <space>\n\n      case 44:\n        //  ,\n        ++pos;\n        continue;\n\n      case 10:\n        //  \\n\n        ++pos;\n        ++lexer.line;\n        lexer.lineStart = pos;\n        continue;\n\n      case 13:\n        //  \\r\n        if (body.charCodeAt(pos + 1) === 10) {\n          pos += 2;\n        } else {\n          ++pos;\n        }\n\n        ++lexer.line;\n        lexer.lineStart = pos;\n        continue;\n\n      case 33:\n        //  !\n        return new Token(TokenKind.BANG, pos, pos + 1, _line, _col, prev);\n\n      case 35:\n        //  #\n        return readComment(source, pos, _line, _col, prev);\n\n      case 36:\n        //  $\n        return new Token(TokenKind.DOLLAR, pos, pos + 1, _line, _col, prev);\n\n      case 38:\n        //  &\n        return new Token(TokenKind.AMP, pos, pos + 1, _line, _col, prev);\n\n      case 40:\n        //  (\n        return new Token(TokenKind.PAREN_L, pos, pos + 1, _line, _col, prev);\n\n      case 41:\n        //  )\n        return new Token(TokenKind.PAREN_R, pos, pos + 1, _line, _col, prev);\n\n      case 46:\n        //  .\n        if (body.charCodeAt(pos + 1) === 46 && body.charCodeAt(pos + 2) === 46) {\n          return new Token(TokenKind.SPREAD, pos, pos + 3, _line, _col, prev);\n        }\n\n        break;\n\n      case 58:\n        //  :\n        return new Token(TokenKind.COLON, pos, pos + 1, _line, _col, prev);\n\n      case 61:\n        //  =\n        return new Token(TokenKind.EQUALS, pos, pos + 1, _line, _col, prev);\n\n      case 64:\n        //  @\n        return new Token(TokenKind.AT, pos, pos + 1, _line, _col, prev);\n\n      case 91:\n        //  [\n        return new Token(TokenKind.BRACKET_L, pos, pos + 1, _line, _col, prev);\n\n      case 93:\n        //  ]\n        return new Token(TokenKind.BRACKET_R, pos, pos + 1, _line, _col, prev);\n\n      case 123:\n        // {\n        return new Token(TokenKind.BRACE_L, pos, pos + 1, _line, _col, prev);\n\n      case 124:\n        // |\n        return new Token(TokenKind.PIPE, pos, pos + 1, _line, _col, prev);\n\n      case 125:\n        // }\n        return new Token(TokenKind.BRACE_R, pos, pos + 1, _line, _col, prev);\n\n      case 34:\n        //  \"\n        if (body.charCodeAt(pos + 1) === 34 && body.charCodeAt(pos + 2) === 34) {\n          return readBlockString(source, pos, _line, _col, prev, lexer);\n        }\n\n        return readString(source, pos, _line, _col, prev);\n\n      case 45: //  -\n\n      case 48: //  0\n\n      case 49: //  1\n\n      case 50: //  2\n\n      case 51: //  3\n\n      case 52: //  4\n\n      case 53: //  5\n\n      case 54: //  6\n\n      case 55: //  7\n\n      case 56: //  8\n\n      case 57:\n        //  9\n        return readNumber(source, pos, code, _line, _col, prev);\n\n      case 65: //  A\n\n      case 66: //  B\n\n      case 67: //  C\n\n      case 68: //  D\n\n      case 69: //  E\n\n      case 70: //  F\n\n      case 71: //  G\n\n      case 72: //  H\n\n      case 73: //  I\n\n      case 74: //  J\n\n      case 75: //  K\n\n      case 76: //  L\n\n      case 77: //  M\n\n      case 78: //  N\n\n      case 79: //  O\n\n      case 80: //  P\n\n      case 81: //  Q\n\n      case 82: //  R\n\n      case 83: //  S\n\n      case 84: //  T\n\n      case 85: //  U\n\n      case 86: //  V\n\n      case 87: //  W\n\n      case 88: //  X\n\n      case 89: //  Y\n\n      case 90: //  Z\n\n      case 95: //  _\n\n      case 97: //  a\n\n      case 98: //  b\n\n      case 99: //  c\n\n      case 100: // d\n\n      case 101: // e\n\n      case 102: // f\n\n      case 103: // g\n\n      case 104: // h\n\n      case 105: // i\n\n      case 106: // j\n\n      case 107: // k\n\n      case 108: // l\n\n      case 109: // m\n\n      case 110: // n\n\n      case 111: // o\n\n      case 112: // p\n\n      case 113: // q\n\n      case 114: // r\n\n      case 115: // s\n\n      case 116: // t\n\n      case 117: // u\n\n      case 118: // v\n\n      case 119: // w\n\n      case 120: // x\n\n      case 121: // y\n\n      case 122:\n        // z\n        return readName(source, pos, _line, _col, prev);\n    }\n\n    throw syntaxError(source, pos, unexpectedCharacterMessage(code));\n  }\n\n  var line = lexer.line;\n  var col = 1 + pos - lexer.lineStart;\n  return new Token(TokenKind.EOF, bodyLength, bodyLength, line, col, prev);\n}\n/**\n * Report a message that an unexpected character was encountered.\n */\n\n\nfunction unexpectedCharacterMessage(code) {\n  if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n    return \"Cannot contain the invalid character \".concat(printCharCode(code), \".\");\n  }\n\n  if (code === 39) {\n    // '\n    return 'Unexpected single quote character (\\'), did you mean to use a double quote (\")?';\n  }\n\n  return \"Cannot parse the unexpected character \".concat(printCharCode(code), \".\");\n}\n/**\n * Reads a comment token from the source file.\n *\n * #[\\u0009\\u0020-\\uFFFF]*\n */\n\n\nfunction readComment(source, start, line, col, prev) {\n  var body = source.body;\n  var code;\n  var position = start;\n\n  do {\n    code = body.charCodeAt(++position);\n  } while (!isNaN(code) && ( // SourceCharacter but not LineTerminator\n  code > 0x001f || code === 0x0009));\n\n  return new Token(TokenKind.COMMENT, start, position, line, col, prev, body.slice(start + 1, position));\n}\n/**\n * Reads a number token from the source file, either a float\n * or an int depending on whether a decimal point appears.\n *\n * Int:   -?(0|[1-9][0-9]*)\n * Float: -?(0|[1-9][0-9]*)(\\.[0-9]+)?((E|e)(+|-)?[0-9]+)?\n */\n\n\nfunction readNumber(source, start, firstCode, line, col, prev) {\n  var body = source.body;\n  var code = firstCode;\n  var position = start;\n  var isFloat = false;\n\n  if (code === 45) {\n    // -\n    code = body.charCodeAt(++position);\n  }\n\n  if (code === 48) {\n    // 0\n    code = body.charCodeAt(++position);\n\n    if (code >= 48 && code <= 57) {\n      throw syntaxError(source, position, \"Invalid number, unexpected digit after 0: \".concat(printCharCode(code), \".\"));\n    }\n  } else {\n    position = readDigits(source, position, code);\n    code = body.charCodeAt(position);\n  }\n\n  if (code === 46) {\n    // .\n    isFloat = true;\n    code = body.charCodeAt(++position);\n    position = readDigits(source, position, code);\n    code = body.charCodeAt(position);\n  }\n\n  if (code === 69 || code === 101) {\n    // E e\n    isFloat = true;\n    code = body.charCodeAt(++position);\n\n    if (code === 43 || code === 45) {\n      // + -\n      code = body.charCodeAt(++position);\n    }\n\n    position = readDigits(source, position, code);\n    code = body.charCodeAt(position);\n  } // Numbers cannot be followed by . or NameStart\n\n\n  if (code === 46 || isNameStart(code)) {\n    throw syntaxError(source, position, \"Invalid number, expected digit but got: \".concat(printCharCode(code), \".\"));\n  }\n\n  return new Token(isFloat ? TokenKind.FLOAT : TokenKind.INT, start, position, line, col, prev, body.slice(start, position));\n}\n/**\n * Returns the new position in the source after reading digits.\n */\n\n\nfunction readDigits(source, start, firstCode) {\n  var body = source.body;\n  var position = start;\n  var code = firstCode;\n\n  if (code >= 48 && code <= 57) {\n    // 0 - 9\n    do {\n      code = body.charCodeAt(++position);\n    } while (code >= 48 && code <= 57); // 0 - 9\n\n\n    return position;\n  }\n\n  throw syntaxError(source, position, \"Invalid number, expected digit but got: \".concat(printCharCode(code), \".\"));\n}\n/**\n * Reads a string token from the source file.\n *\n * \"([^\"\\\\\\u000A\\u000D]|(\\\\(u[0-9a-fA-F]{4}|[\"\\\\/bfnrt])))*\"\n */\n\n\nfunction readString(source, start, line, col, prev) {\n  var body = source.body;\n  var position = start + 1;\n  var chunkStart = position;\n  var code = 0;\n  var value = '';\n\n  while (position < body.length && !isNaN(code = body.charCodeAt(position)) && // not LineTerminator\n  code !== 0x000a && code !== 0x000d) {\n    // Closing Quote (\")\n    if (code === 34) {\n      value += body.slice(chunkStart, position);\n      return new Token(TokenKind.STRING, start, position + 1, line, col, prev, value);\n    } // SourceCharacter\n\n\n    if (code < 0x0020 && code !== 0x0009) {\n      throw syntaxError(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n    }\n\n    ++position;\n\n    if (code === 92) {\n      // \\\n      value += body.slice(chunkStart, position - 1);\n      code = body.charCodeAt(position);\n\n      switch (code) {\n        case 34:\n          value += '\"';\n          break;\n\n        case 47:\n          value += '/';\n          break;\n\n        case 92:\n          value += '\\\\';\n          break;\n\n        case 98:\n          value += '\\b';\n          break;\n\n        case 102:\n          value += '\\f';\n          break;\n\n        case 110:\n          value += '\\n';\n          break;\n\n        case 114:\n          value += '\\r';\n          break;\n\n        case 116:\n          value += '\\t';\n          break;\n\n        case 117:\n          {\n            // uXXXX\n            var charCode = uniCharCode(body.charCodeAt(position + 1), body.charCodeAt(position + 2), body.charCodeAt(position + 3), body.charCodeAt(position + 4));\n\n            if (charCode < 0) {\n              var invalidSequence = body.slice(position + 1, position + 5);\n              throw syntaxError(source, position, \"Invalid character escape sequence: \\\\u\".concat(invalidSequence, \".\"));\n            }\n\n            value += String.fromCharCode(charCode);\n            position += 4;\n            break;\n          }\n\n        default:\n          throw syntaxError(source, position, \"Invalid character escape sequence: \\\\\".concat(String.fromCharCode(code), \".\"));\n      }\n\n      ++position;\n      chunkStart = position;\n    }\n  }\n\n  throw syntaxError(source, position, 'Unterminated string.');\n}\n/**\n * Reads a block string token from the source file.\n *\n * \"\"\"(\"?\"?(\\\\\"\"\"|\\\\(?!=\"\"\")|[^\"\\\\]))*\"\"\"\n */\n\n\nfunction readBlockString(source, start, line, col, prev, lexer) {\n  var body = source.body;\n  var position = start + 3;\n  var chunkStart = position;\n  var code = 0;\n  var rawValue = '';\n\n  while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n    // Closing Triple-Quote (\"\"\")\n    if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n      rawValue += body.slice(chunkStart, position);\n      return new Token(TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, dedentBlockStringValue(rawValue));\n    } // SourceCharacter\n\n\n    if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n      throw syntaxError(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n    }\n\n    if (code === 10) {\n      // new line\n      ++position;\n      ++lexer.line;\n      lexer.lineStart = position;\n    } else if (code === 13) {\n      // carriage return\n      if (body.charCodeAt(position + 1) === 10) {\n        position += 2;\n      } else {\n        ++position;\n      }\n\n      ++lexer.line;\n      lexer.lineStart = position;\n    } else if ( // Escape Triple-Quote (\\\"\"\")\n    code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n      rawValue += body.slice(chunkStart, position) + '\"\"\"';\n      position += 4;\n      chunkStart = position;\n    } else {\n      ++position;\n    }\n  }\n\n  throw syntaxError(source, position, 'Unterminated string.');\n}\n/**\n * Converts four hexadecimal chars to the integer that the\n * string represents. For example, uniCharCode('0','0','0','f')\n * will return 15, and uniCharCode('0','0','f','f') returns 255.\n *\n * Returns a negative number on error, if a char was invalid.\n *\n * This is implemented by noting that char2hex() returns -1 on error,\n * which means the result of ORing the char2hex() will also be negative.\n */\n\n\nfunction uniCharCode(a, b, c, d) {\n  return char2hex(a) << 12 | char2hex(b) << 8 | char2hex(c) << 4 | char2hex(d);\n}\n/**\n * Converts a hex character to its integer value.\n * '0' becomes 0, '9' becomes 9\n * 'A' becomes 10, 'F' becomes 15\n * 'a' becomes 10, 'f' becomes 15\n *\n * Returns -1 on error.\n */\n\n\nfunction char2hex(a) {\n  return a >= 48 && a <= 57 ? a - 48 // 0-9\n  : a >= 65 && a <= 70 ? a - 55 // A-F\n  : a >= 97 && a <= 102 ? a - 87 // a-f\n  : -1;\n}\n/**\n * Reads an alphanumeric + underscore name from the source.\n *\n * [_A-Za-z][_0-9A-Za-z]*\n */\n\n\nfunction readName(source, start, line, col, prev) {\n  var body = source.body;\n  var bodyLength = body.length;\n  var position = start + 1;\n  var code = 0;\n\n  while (position !== bodyLength && !isNaN(code = body.charCodeAt(position)) && (code === 95 || // _\n  code >= 48 && code <= 57 || // 0-9\n  code >= 65 && code <= 90 || // A-Z\n  code >= 97 && code <= 122) // a-z\n  ) {\n    ++position;\n  }\n\n  return new Token(TokenKind.NAME, start, position, line, col, prev, body.slice(start, position));\n} // _ A-Z a-z\n\n\nfunction isNameStart(code) {\n  return code === 95 || code >= 65 && code <= 90 || code >= 97 && code <= 122;\n}\n","/**\n * Represents a location in a Source.\n */\n\n/**\n * Takes a Source and a UTF-8 character offset, and returns the corresponding\n * line and column as a SourceLocation.\n */\nexport function getLocation(source, position) {\n  var lineRegexp = /\\r\\n|[\\n\\r]/g;\n  var line = 1;\n  var column = position + 1;\n  var match;\n\n  while ((match = lineRegexp.exec(source.body)) && match.index < position) {\n    line += 1;\n    column = position + 1 - (match.index + match[0].length);\n  }\n\n  return {\n    line: line,\n    column: column\n  };\n}\n","import { syntaxError } from \"../error/syntaxError.mjs\";\nimport { Kind } from \"./kinds.mjs\";\nimport { Location } from \"./ast.mjs\";\nimport { TokenKind } from \"./tokenKind.mjs\";\nimport { Source, isSource } from \"./source.mjs\";\nimport { DirectiveLocation } from \"./directiveLocation.mjs\";\nimport { Lexer, isPunctuatorTokenKind } from \"./lexer.mjs\";\n/**\n * Configuration options to control parser behavior\n */\n\n/**\n * Given a GraphQL source, parses it into a Document.\n * Throws GraphQLError if a syntax error is encountered.\n */\nexport function parse(source, options) {\n  var parser = new Parser(source, options);\n  return parser.parseDocument();\n}\n/**\n * Given a string containing a GraphQL value (ex. `[42]`), parse the AST for\n * that value.\n * Throws GraphQLError if a syntax error is encountered.\n *\n * This is useful within tools that operate upon GraphQL Values directly and\n * in isolation of complete GraphQL documents.\n *\n * Consider providing the results to the utility function: valueFromAST().\n */\n\nexport function parseValue(source, options) {\n  var parser = new Parser(source, options);\n  parser.expectToken(TokenKind.SOF);\n  var value = parser.parseValueLiteral(false);\n  parser.expectToken(TokenKind.EOF);\n  return value;\n}\n/**\n * Given a string containing a GraphQL Type (ex. `[Int!]`), parse the AST for\n * that type.\n * Throws GraphQLError if a syntax error is encountered.\n *\n * This is useful within tools that operate upon GraphQL Types directly and\n * in isolation of complete GraphQL documents.\n *\n * Consider providing the results to the utility function: typeFromAST().\n */\n\nexport function parseType(source, options) {\n  var parser = new Parser(source, options);\n  parser.expectToken(TokenKind.SOF);\n  var type = parser.parseTypeReference();\n  parser.expectToken(TokenKind.EOF);\n  return type;\n}\n/**\n * This class is exported only to assist people in implementing their own parsers\n * without duplicating too much code and should be used only as last resort for cases\n * such as experimental syntax or if certain features could not be contributed upstream.\n *\n * It is still part of the internal API and is versioned, so any changes to it are never\n * considered breaking changes. If you still need to support multiple versions of the\n * library, please use the `versionInfo` variable for version detection.\n *\n * @internal\n */\n\nexport var Parser = /*#__PURE__*/function () {\n  function Parser(source, options) {\n    var sourceObj = isSource(source) ? source : new Source(source);\n    this._lexer = new Lexer(sourceObj);\n    this._options = options;\n  }\n  /**\n   * Converts a name lex token into a name parse node.\n   */\n\n\n  var _proto = Parser.prototype;\n\n  _proto.parseName = function parseName() {\n    var token = this.expectToken(TokenKind.NAME);\n    return {\n      kind: Kind.NAME,\n      value: token.value,\n      loc: this.loc(token)\n    };\n  } // Implements the parsing rules in the Document section.\n\n  /**\n   * Document : Definition+\n   */\n  ;\n\n  _proto.parseDocument = function parseDocument() {\n    var start = this._lexer.token;\n    return {\n      kind: Kind.DOCUMENT,\n      definitions: this.many(TokenKind.SOF, this.parseDefinition, TokenKind.EOF),\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * Definition :\n   *   - ExecutableDefinition\n   *   - TypeSystemDefinition\n   *   - TypeSystemExtension\n   *\n   * ExecutableDefinition :\n   *   - OperationDefinition\n   *   - FragmentDefinition\n   */\n  ;\n\n  _proto.parseDefinition = function parseDefinition() {\n    if (this.peek(TokenKind.NAME)) {\n      switch (this._lexer.token.value) {\n        case 'query':\n        case 'mutation':\n        case 'subscription':\n          return this.parseOperationDefinition();\n\n        case 'fragment':\n          return this.parseFragmentDefinition();\n\n        case 'schema':\n        case 'scalar':\n        case 'type':\n        case 'interface':\n        case 'union':\n        case 'enum':\n        case 'input':\n        case 'directive':\n          return this.parseTypeSystemDefinition();\n\n        case 'extend':\n          return this.parseTypeSystemExtension();\n      }\n    } else if (this.peek(TokenKind.BRACE_L)) {\n      return this.parseOperationDefinition();\n    } else if (this.peekDescription()) {\n      return this.parseTypeSystemDefinition();\n    }\n\n    throw this.unexpected();\n  } // Implements the parsing rules in the Operations section.\n\n  /**\n   * OperationDefinition :\n   *  - SelectionSet\n   *  - OperationType Name? VariableDefinitions? Directives? SelectionSet\n   */\n  ;\n\n  _proto.parseOperationDefinition = function parseOperationDefinition() {\n    var start = this._lexer.token;\n\n    if (this.peek(TokenKind.BRACE_L)) {\n      return {\n        kind: Kind.OPERATION_DEFINITION,\n        operation: 'query',\n        name: undefined,\n        variableDefinitions: [],\n        directives: [],\n        selectionSet: this.parseSelectionSet(),\n        loc: this.loc(start)\n      };\n    }\n\n    var operation = this.parseOperationType();\n    var name;\n\n    if (this.peek(TokenKind.NAME)) {\n      name = this.parseName();\n    }\n\n    return {\n      kind: Kind.OPERATION_DEFINITION,\n      operation: operation,\n      name: name,\n      variableDefinitions: this.parseVariableDefinitions(),\n      directives: this.parseDirectives(false),\n      selectionSet: this.parseSelectionSet(),\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * OperationType : one of query mutation subscription\n   */\n  ;\n\n  _proto.parseOperationType = function parseOperationType() {\n    var operationToken = this.expectToken(TokenKind.NAME);\n\n    switch (operationToken.value) {\n      case 'query':\n        return 'query';\n\n      case 'mutation':\n        return 'mutation';\n\n      case 'subscription':\n        return 'subscription';\n    }\n\n    throw this.unexpected(operationToken);\n  }\n  /**\n   * VariableDefinitions : ( VariableDefinition+ )\n   */\n  ;\n\n  _proto.parseVariableDefinitions = function parseVariableDefinitions() {\n    return this.optionalMany(TokenKind.PAREN_L, this.parseVariableDefinition, TokenKind.PAREN_R);\n  }\n  /**\n   * VariableDefinition : Variable : Type DefaultValue? Directives[Const]?\n   */\n  ;\n\n  _proto.parseVariableDefinition = function parseVariableDefinition() {\n    var start = this._lexer.token;\n    return {\n      kind: Kind.VARIABLE_DEFINITION,\n      variable: this.parseVariable(),\n      type: (this.expectToken(TokenKind.COLON), this.parseTypeReference()),\n      defaultValue: this.expectOptionalToken(TokenKind.EQUALS) ? this.parseValueLiteral(true) : undefined,\n      directives: this.parseDirectives(true),\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * Variable : $ Name\n   */\n  ;\n\n  _proto.parseVariable = function parseVariable() {\n    var start = this._lexer.token;\n    this.expectToken(TokenKind.DOLLAR);\n    return {\n      kind: Kind.VARIABLE,\n      name: this.parseName(),\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * SelectionSet : { Selection+ }\n   */\n  ;\n\n  _proto.parseSelectionSet = function parseSelectionSet() {\n    var start = this._lexer.token;\n    return {\n      kind: Kind.SELECTION_SET,\n      selections: this.many(TokenKind.BRACE_L, this.parseSelection, TokenKind.BRACE_R),\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * Selection :\n   *   - Field\n   *   - FragmentSpread\n   *   - InlineFragment\n   */\n  ;\n\n  _proto.parseSelection = function parseSelection() {\n    return this.peek(TokenKind.SPREAD) ? this.parseFragment() : this.parseField();\n  }\n  /**\n   * Field : Alias? Name Arguments? Directives? SelectionSet?\n   *\n   * Alias : Name :\n   */\n  ;\n\n  _proto.parseField = function parseField() {\n    var start = this._lexer.token;\n    var nameOrAlias = this.parseName();\n    var alias;\n    var name;\n\n    if (this.expectOptionalToken(TokenKind.COLON)) {\n      alias = nameOrAlias;\n      name = this.parseName();\n    } else {\n      name = nameOrAlias;\n    }\n\n    return {\n      kind: Kind.FIELD,\n      alias: alias,\n      name: name,\n      arguments: this.parseArguments(false),\n      directives: this.parseDirectives(false),\n      selectionSet: this.peek(TokenKind.BRACE_L) ? this.parseSelectionSet() : undefined,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * Arguments[Const] : ( Argument[?Const]+ )\n   */\n  ;\n\n  _proto.parseArguments = function parseArguments(isConst) {\n    var item = isConst ? this.parseConstArgument : this.parseArgument;\n    return this.optionalMany(TokenKind.PAREN_L, item, TokenKind.PAREN_R);\n  }\n  /**\n   * Argument[Const] : Name : Value[?Const]\n   */\n  ;\n\n  _proto.parseArgument = function parseArgument() {\n    var start = this._lexer.token;\n    var name = this.parseName();\n    this.expectToken(TokenKind.COLON);\n    return {\n      kind: Kind.ARGUMENT,\n      name: name,\n      value: this.parseValueLiteral(false),\n      loc: this.loc(start)\n    };\n  };\n\n  _proto.parseConstArgument = function parseConstArgument() {\n    var start = this._lexer.token;\n    return {\n      kind: Kind.ARGUMENT,\n      name: this.parseName(),\n      value: (this.expectToken(TokenKind.COLON), this.parseValueLiteral(true)),\n      loc: this.loc(start)\n    };\n  } // Implements the parsing rules in the Fragments section.\n\n  /**\n   * Corresponds to both FragmentSpread and InlineFragment in the spec.\n   *\n   * FragmentSpread : ... FragmentName Directives?\n   *\n   * InlineFragment : ... TypeCondition? Directives? SelectionSet\n   */\n  ;\n\n  _proto.parseFragment = function parseFragment() {\n    var start = this._lexer.token;\n    this.expectToken(TokenKind.SPREAD);\n    var hasTypeCondition = this.expectOptionalKeyword('on');\n\n    if (!hasTypeCondition && this.peek(TokenKind.NAME)) {\n      return {\n        kind: Kind.FRAGMENT_SPREAD,\n        name: this.parseFragmentName(),\n        directives: this.parseDirectives(false),\n        loc: this.loc(start)\n      };\n    }\n\n    return {\n      kind: Kind.INLINE_FRAGMENT,\n      typeCondition: hasTypeCondition ? this.parseNamedType() : undefined,\n      directives: this.parseDirectives(false),\n      selectionSet: this.parseSelectionSet(),\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * FragmentDefinition :\n   *   - fragment FragmentName on TypeCondition Directives? SelectionSet\n   *\n   * TypeCondition : NamedType\n   */\n  ;\n\n  _proto.parseFragmentDefinition = function parseFragmentDefinition() {\n    var _this$_options;\n\n    var start = this._lexer.token;\n    this.expectKeyword('fragment'); // Experimental support for defining variables within fragments changes\n    // the grammar of FragmentDefinition:\n    //   - fragment FragmentName VariableDefinitions? on TypeCondition Directives? SelectionSet\n\n    if (((_this$_options = this._options) === null || _this$_options === void 0 ? void 0 : _this$_options.experimentalFragmentVariables) === true) {\n      return {\n        kind: Kind.FRAGMENT_DEFINITION,\n        name: this.parseFragmentName(),\n        variableDefinitions: this.parseVariableDefinitions(),\n        typeCondition: (this.expectKeyword('on'), this.parseNamedType()),\n        directives: this.parseDirectives(false),\n        selectionSet: this.parseSelectionSet(),\n        loc: this.loc(start)\n      };\n    }\n\n    return {\n      kind: Kind.FRAGMENT_DEFINITION,\n      name: this.parseFragmentName(),\n      typeCondition: (this.expectKeyword('on'), this.parseNamedType()),\n      directives: this.parseDirectives(false),\n      selectionSet: this.parseSelectionSet(),\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * FragmentName : Name but not `on`\n   */\n  ;\n\n  _proto.parseFragmentName = function parseFragmentName() {\n    if (this._lexer.token.value === 'on') {\n      throw this.unexpected();\n    }\n\n    return this.parseName();\n  } // Implements the parsing rules in the Values section.\n\n  /**\n   * Value[Const] :\n   *   - [~Const] Variable\n   *   - IntValue\n   *   - FloatValue\n   *   - StringValue\n   *   - BooleanValue\n   *   - NullValue\n   *   - EnumValue\n   *   - ListValue[?Const]\n   *   - ObjectValue[?Const]\n   *\n   * BooleanValue : one of `true` `false`\n   *\n   * NullValue : `null`\n   *\n   * EnumValue : Name but not `true`, `false` or `null`\n   */\n  ;\n\n  _proto.parseValueLiteral = function parseValueLiteral(isConst) {\n    var token = this._lexer.token;\n\n    switch (token.kind) {\n      case TokenKind.BRACKET_L:\n        return this.parseList(isConst);\n\n      case TokenKind.BRACE_L:\n        return this.parseObject(isConst);\n\n      case TokenKind.INT:\n        this._lexer.advance();\n\n        return {\n          kind: Kind.INT,\n          value: token.value,\n          loc: this.loc(token)\n        };\n\n      case TokenKind.FLOAT:\n        this._lexer.advance();\n\n        return {\n          kind: Kind.FLOAT,\n          value: token.value,\n          loc: this.loc(token)\n        };\n\n      case TokenKind.STRING:\n      case TokenKind.BLOCK_STRING:\n        return this.parseStringLiteral();\n\n      case TokenKind.NAME:\n        this._lexer.advance();\n\n        switch (token.value) {\n          case 'true':\n            return {\n              kind: Kind.BOOLEAN,\n              value: true,\n              loc: this.loc(token)\n            };\n\n          case 'false':\n            return {\n              kind: Kind.BOOLEAN,\n              value: false,\n              loc: this.loc(token)\n            };\n\n          case 'null':\n            return {\n              kind: Kind.NULL,\n              loc: this.loc(token)\n            };\n\n          default:\n            return {\n              kind: Kind.ENUM,\n              value: token.value,\n              loc: this.loc(token)\n            };\n        }\n\n      case TokenKind.DOLLAR:\n        if (!isConst) {\n          return this.parseVariable();\n        }\n\n        break;\n    }\n\n    throw this.unexpected();\n  };\n\n  _proto.parseStringLiteral = function parseStringLiteral() {\n    var token = this._lexer.token;\n\n    this._lexer.advance();\n\n    return {\n      kind: Kind.STRING,\n      value: token.value,\n      block: token.kind === TokenKind.BLOCK_STRING,\n      loc: this.loc(token)\n    };\n  }\n  /**\n   * ListValue[Const] :\n   *   - [ ]\n   *   - [ Value[?Const]+ ]\n   */\n  ;\n\n  _proto.parseList = function parseList(isConst) {\n    var _this = this;\n\n    var start = this._lexer.token;\n\n    var item = function item() {\n      return _this.parseValueLiteral(isConst);\n    };\n\n    return {\n      kind: Kind.LIST,\n      values: this.any(TokenKind.BRACKET_L, item, TokenKind.BRACKET_R),\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * ObjectValue[Const] :\n   *   - { }\n   *   - { ObjectField[?Const]+ }\n   */\n  ;\n\n  _proto.parseObject = function parseObject(isConst) {\n    var _this2 = this;\n\n    var start = this._lexer.token;\n\n    var item = function item() {\n      return _this2.parseObjectField(isConst);\n    };\n\n    return {\n      kind: Kind.OBJECT,\n      fields: this.any(TokenKind.BRACE_L, item, TokenKind.BRACE_R),\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * ObjectField[Const] : Name : Value[?Const]\n   */\n  ;\n\n  _proto.parseObjectField = function parseObjectField(isConst) {\n    var start = this._lexer.token;\n    var name = this.parseName();\n    this.expectToken(TokenKind.COLON);\n    return {\n      kind: Kind.OBJECT_FIELD,\n      name: name,\n      value: this.parseValueLiteral(isConst),\n      loc: this.loc(start)\n    };\n  } // Implements the parsing rules in the Directives section.\n\n  /**\n   * Directives[Const] : Directive[?Const]+\n   */\n  ;\n\n  _proto.parseDirectives = function parseDirectives(isConst) {\n    var directives = [];\n\n    while (this.peek(TokenKind.AT)) {\n      directives.push(this.parseDirective(isConst));\n    }\n\n    return directives;\n  }\n  /**\n   * Directive[Const] : @ Name Arguments[?Const]?\n   */\n  ;\n\n  _proto.parseDirective = function parseDirective(isConst) {\n    var start = this._lexer.token;\n    this.expectToken(TokenKind.AT);\n    return {\n      kind: Kind.DIRECTIVE,\n      name: this.parseName(),\n      arguments: this.parseArguments(isConst),\n      loc: this.loc(start)\n    };\n  } // Implements the parsing rules in the Types section.\n\n  /**\n   * Type :\n   *   - NamedType\n   *   - ListType\n   *   - NonNullType\n   */\n  ;\n\n  _proto.parseTypeReference = function parseTypeReference() {\n    var start = this._lexer.token;\n    var type;\n\n    if (this.expectOptionalToken(TokenKind.BRACKET_L)) {\n      type = this.parseTypeReference();\n      this.expectToken(TokenKind.BRACKET_R);\n      type = {\n        kind: Kind.LIST_TYPE,\n        type: type,\n        loc: this.loc(start)\n      };\n    } else {\n      type = this.parseNamedType();\n    }\n\n    if (this.expectOptionalToken(TokenKind.BANG)) {\n      return {\n        kind: Kind.NON_NULL_TYPE,\n        type: type,\n        loc: this.loc(start)\n      };\n    }\n\n    return type;\n  }\n  /**\n   * NamedType : Name\n   */\n  ;\n\n  _proto.parseNamedType = function parseNamedType() {\n    var start = this._lexer.token;\n    return {\n      kind: Kind.NAMED_TYPE,\n      name: this.parseName(),\n      loc: this.loc(start)\n    };\n  } // Implements the parsing rules in the Type Definition section.\n\n  /**\n   * TypeSystemDefinition :\n   *   - SchemaDefinition\n   *   - TypeDefinition\n   *   - DirectiveDefinition\n   *\n   * TypeDefinition :\n   *   - ScalarTypeDefinition\n   *   - ObjectTypeDefinition\n   *   - InterfaceTypeDefinition\n   *   - UnionTypeDefinition\n   *   - EnumTypeDefinition\n   *   - InputObjectTypeDefinition\n   */\n  ;\n\n  _proto.parseTypeSystemDefinition = function parseTypeSystemDefinition() {\n    // Many definitions begin with a description and require a lookahead.\n    var keywordToken = this.peekDescription() ? this._lexer.lookahead() : this._lexer.token;\n\n    if (keywordToken.kind === TokenKind.NAME) {\n      switch (keywordToken.value) {\n        case 'schema':\n          return this.parseSchemaDefinition();\n\n        case 'scalar':\n          return this.parseScalarTypeDefinition();\n\n        case 'type':\n          return this.parseObjectTypeDefinition();\n\n        case 'interface':\n          return this.parseInterfaceTypeDefinition();\n\n        case 'union':\n          return this.parseUnionTypeDefinition();\n\n        case 'enum':\n          return this.parseEnumTypeDefinition();\n\n        case 'input':\n          return this.parseInputObjectTypeDefinition();\n\n        case 'directive':\n          return this.parseDirectiveDefinition();\n      }\n    }\n\n    throw this.unexpected(keywordToken);\n  };\n\n  _proto.peekDescription = function peekDescription() {\n    return this.peek(TokenKind.STRING) || this.peek(TokenKind.BLOCK_STRING);\n  }\n  /**\n   * Description : StringValue\n   */\n  ;\n\n  _proto.parseDescription = function parseDescription() {\n    if (this.peekDescription()) {\n      return this.parseStringLiteral();\n    }\n  }\n  /**\n   * SchemaDefinition : Description? schema Directives[Const]? { OperationTypeDefinition+ }\n   */\n  ;\n\n  _proto.parseSchemaDefinition = function parseSchemaDefinition() {\n    var start = this._lexer.token;\n    var description = this.parseDescription();\n    this.expectKeyword('schema');\n    var directives = this.parseDirectives(true);\n    var operationTypes = this.many(TokenKind.BRACE_L, this.parseOperationTypeDefinition, TokenKind.BRACE_R);\n    return {\n      kind: Kind.SCHEMA_DEFINITION,\n      description: description,\n      directives: directives,\n      operationTypes: operationTypes,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * OperationTypeDefinition : OperationType : NamedType\n   */\n  ;\n\n  _proto.parseOperationTypeDefinition = function parseOperationTypeDefinition() {\n    var start = this._lexer.token;\n    var operation = this.parseOperationType();\n    this.expectToken(TokenKind.COLON);\n    var type = this.parseNamedType();\n    return {\n      kind: Kind.OPERATION_TYPE_DEFINITION,\n      operation: operation,\n      type: type,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * ScalarTypeDefinition : Description? scalar Name Directives[Const]?\n   */\n  ;\n\n  _proto.parseScalarTypeDefinition = function parseScalarTypeDefinition() {\n    var start = this._lexer.token;\n    var description = this.parseDescription();\n    this.expectKeyword('scalar');\n    var name = this.parseName();\n    var directives = this.parseDirectives(true);\n    return {\n      kind: Kind.SCALAR_TYPE_DEFINITION,\n      description: description,\n      name: name,\n      directives: directives,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * ObjectTypeDefinition :\n   *   Description?\n   *   type Name ImplementsInterfaces? Directives[Const]? FieldsDefinition?\n   */\n  ;\n\n  _proto.parseObjectTypeDefinition = function parseObjectTypeDefinition() {\n    var start = this._lexer.token;\n    var description = this.parseDescription();\n    this.expectKeyword('type');\n    var name = this.parseName();\n    var interfaces = this.parseImplementsInterfaces();\n    var directives = this.parseDirectives(true);\n    var fields = this.parseFieldsDefinition();\n    return {\n      kind: Kind.OBJECT_TYPE_DEFINITION,\n      description: description,\n      name: name,\n      interfaces: interfaces,\n      directives: directives,\n      fields: fields,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * ImplementsInterfaces :\n   *   - implements `&`? NamedType\n   *   - ImplementsInterfaces & NamedType\n   */\n  ;\n\n  _proto.parseImplementsInterfaces = function parseImplementsInterfaces() {\n    var _this$_options2;\n\n    if (!this.expectOptionalKeyword('implements')) {\n      return [];\n    }\n\n    if (((_this$_options2 = this._options) === null || _this$_options2 === void 0 ? void 0 : _this$_options2.allowLegacySDLImplementsInterfaces) === true) {\n      var types = []; // Optional leading ampersand\n\n      this.expectOptionalToken(TokenKind.AMP);\n\n      do {\n        types.push(this.parseNamedType());\n      } while (this.expectOptionalToken(TokenKind.AMP) || this.peek(TokenKind.NAME));\n\n      return types;\n    }\n\n    return this.delimitedMany(TokenKind.AMP, this.parseNamedType);\n  }\n  /**\n   * FieldsDefinition : { FieldDefinition+ }\n   */\n  ;\n\n  _proto.parseFieldsDefinition = function parseFieldsDefinition() {\n    var _this$_options3;\n\n    // Legacy support for the SDL?\n    if (((_this$_options3 = this._options) === null || _this$_options3 === void 0 ? void 0 : _this$_options3.allowLegacySDLEmptyFields) === true && this.peek(TokenKind.BRACE_L) && this._lexer.lookahead().kind === TokenKind.BRACE_R) {\n      this._lexer.advance();\n\n      this._lexer.advance();\n\n      return [];\n    }\n\n    return this.optionalMany(TokenKind.BRACE_L, this.parseFieldDefinition, TokenKind.BRACE_R);\n  }\n  /**\n   * FieldDefinition :\n   *   - Description? Name ArgumentsDefinition? : Type Directives[Const]?\n   */\n  ;\n\n  _proto.parseFieldDefinition = function parseFieldDefinition() {\n    var start = this._lexer.token;\n    var description = this.parseDescription();\n    var name = this.parseName();\n    var args = this.parseArgumentDefs();\n    this.expectToken(TokenKind.COLON);\n    var type = this.parseTypeReference();\n    var directives = this.parseDirectives(true);\n    return {\n      kind: Kind.FIELD_DEFINITION,\n      description: description,\n      name: name,\n      arguments: args,\n      type: type,\n      directives: directives,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * ArgumentsDefinition : ( InputValueDefinition+ )\n   */\n  ;\n\n  _proto.parseArgumentDefs = function parseArgumentDefs() {\n    return this.optionalMany(TokenKind.PAREN_L, this.parseInputValueDef, TokenKind.PAREN_R);\n  }\n  /**\n   * InputValueDefinition :\n   *   - Description? Name : Type DefaultValue? Directives[Const]?\n   */\n  ;\n\n  _proto.parseInputValueDef = function parseInputValueDef() {\n    var start = this._lexer.token;\n    var description = this.parseDescription();\n    var name = this.parseName();\n    this.expectToken(TokenKind.COLON);\n    var type = this.parseTypeReference();\n    var defaultValue;\n\n    if (this.expectOptionalToken(TokenKind.EQUALS)) {\n      defaultValue = this.parseValueLiteral(true);\n    }\n\n    var directives = this.parseDirectives(true);\n    return {\n      kind: Kind.INPUT_VALUE_DEFINITION,\n      description: description,\n      name: name,\n      type: type,\n      defaultValue: defaultValue,\n      directives: directives,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * InterfaceTypeDefinition :\n   *   - Description? interface Name Directives[Const]? FieldsDefinition?\n   */\n  ;\n\n  _proto.parseInterfaceTypeDefinition = function parseInterfaceTypeDefinition() {\n    var start = this._lexer.token;\n    var description = this.parseDescription();\n    this.expectKeyword('interface');\n    var name = this.parseName();\n    var interfaces = this.parseImplementsInterfaces();\n    var directives = this.parseDirectives(true);\n    var fields = this.parseFieldsDefinition();\n    return {\n      kind: Kind.INTERFACE_TYPE_DEFINITION,\n      description: description,\n      name: name,\n      interfaces: interfaces,\n      directives: directives,\n      fields: fields,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * UnionTypeDefinition :\n   *   - Description? union Name Directives[Const]? UnionMemberTypes?\n   */\n  ;\n\n  _proto.parseUnionTypeDefinition = function parseUnionTypeDefinition() {\n    var start = this._lexer.token;\n    var description = this.parseDescription();\n    this.expectKeyword('union');\n    var name = this.parseName();\n    var directives = this.parseDirectives(true);\n    var types = this.parseUnionMemberTypes();\n    return {\n      kind: Kind.UNION_TYPE_DEFINITION,\n      description: description,\n      name: name,\n      directives: directives,\n      types: types,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * UnionMemberTypes :\n   *   - = `|`? NamedType\n   *   - UnionMemberTypes | NamedType\n   */\n  ;\n\n  _proto.parseUnionMemberTypes = function parseUnionMemberTypes() {\n    return this.expectOptionalToken(TokenKind.EQUALS) ? this.delimitedMany(TokenKind.PIPE, this.parseNamedType) : [];\n  }\n  /**\n   * EnumTypeDefinition :\n   *   - Description? enum Name Directives[Const]? EnumValuesDefinition?\n   */\n  ;\n\n  _proto.parseEnumTypeDefinition = function parseEnumTypeDefinition() {\n    var start = this._lexer.token;\n    var description = this.parseDescription();\n    this.expectKeyword('enum');\n    var name = this.parseName();\n    var directives = this.parseDirectives(true);\n    var values = this.parseEnumValuesDefinition();\n    return {\n      kind: Kind.ENUM_TYPE_DEFINITION,\n      description: description,\n      name: name,\n      directives: directives,\n      values: values,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * EnumValuesDefinition : { EnumValueDefinition+ }\n   */\n  ;\n\n  _proto.parseEnumValuesDefinition = function parseEnumValuesDefinition() {\n    return this.optionalMany(TokenKind.BRACE_L, this.parseEnumValueDefinition, TokenKind.BRACE_R);\n  }\n  /**\n   * EnumValueDefinition : Description? EnumValue Directives[Const]?\n   *\n   * EnumValue : Name\n   */\n  ;\n\n  _proto.parseEnumValueDefinition = function parseEnumValueDefinition() {\n    var start = this._lexer.token;\n    var description = this.parseDescription();\n    var name = this.parseName();\n    var directives = this.parseDirectives(true);\n    return {\n      kind: Kind.ENUM_VALUE_DEFINITION,\n      description: description,\n      name: name,\n      directives: directives,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * InputObjectTypeDefinition :\n   *   - Description? input Name Directives[Const]? InputFieldsDefinition?\n   */\n  ;\n\n  _proto.parseInputObjectTypeDefinition = function parseInputObjectTypeDefinition() {\n    var start = this._lexer.token;\n    var description = this.parseDescription();\n    this.expectKeyword('input');\n    var name = this.parseName();\n    var directives = this.parseDirectives(true);\n    var fields = this.parseInputFieldsDefinition();\n    return {\n      kind: Kind.INPUT_OBJECT_TYPE_DEFINITION,\n      description: description,\n      name: name,\n      directives: directives,\n      fields: fields,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * InputFieldsDefinition : { InputValueDefinition+ }\n   */\n  ;\n\n  _proto.parseInputFieldsDefinition = function parseInputFieldsDefinition() {\n    return this.optionalMany(TokenKind.BRACE_L, this.parseInputValueDef, TokenKind.BRACE_R);\n  }\n  /**\n   * TypeSystemExtension :\n   *   - SchemaExtension\n   *   - TypeExtension\n   *\n   * TypeExtension :\n   *   - ScalarTypeExtension\n   *   - ObjectTypeExtension\n   *   - InterfaceTypeExtension\n   *   - UnionTypeExtension\n   *   - EnumTypeExtension\n   *   - InputObjectTypeDefinition\n   */\n  ;\n\n  _proto.parseTypeSystemExtension = function parseTypeSystemExtension() {\n    var keywordToken = this._lexer.lookahead();\n\n    if (keywordToken.kind === TokenKind.NAME) {\n      switch (keywordToken.value) {\n        case 'schema':\n          return this.parseSchemaExtension();\n\n        case 'scalar':\n          return this.parseScalarTypeExtension();\n\n        case 'type':\n          return this.parseObjectTypeExtension();\n\n        case 'interface':\n          return this.parseInterfaceTypeExtension();\n\n        case 'union':\n          return this.parseUnionTypeExtension();\n\n        case 'enum':\n          return this.parseEnumTypeExtension();\n\n        case 'input':\n          return this.parseInputObjectTypeExtension();\n      }\n    }\n\n    throw this.unexpected(keywordToken);\n  }\n  /**\n   * SchemaExtension :\n   *  - extend schema Directives[Const]? { OperationTypeDefinition+ }\n   *  - extend schema Directives[Const]\n   */\n  ;\n\n  _proto.parseSchemaExtension = function parseSchemaExtension() {\n    var start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('schema');\n    var directives = this.parseDirectives(true);\n    var operationTypes = this.optionalMany(TokenKind.BRACE_L, this.parseOperationTypeDefinition, TokenKind.BRACE_R);\n\n    if (directives.length === 0 && operationTypes.length === 0) {\n      throw this.unexpected();\n    }\n\n    return {\n      kind: Kind.SCHEMA_EXTENSION,\n      directives: directives,\n      operationTypes: operationTypes,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * ScalarTypeExtension :\n   *   - extend scalar Name Directives[Const]\n   */\n  ;\n\n  _proto.parseScalarTypeExtension = function parseScalarTypeExtension() {\n    var start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('scalar');\n    var name = this.parseName();\n    var directives = this.parseDirectives(true);\n\n    if (directives.length === 0) {\n      throw this.unexpected();\n    }\n\n    return {\n      kind: Kind.SCALAR_TYPE_EXTENSION,\n      name: name,\n      directives: directives,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * ObjectTypeExtension :\n   *  - extend type Name ImplementsInterfaces? Directives[Const]? FieldsDefinition\n   *  - extend type Name ImplementsInterfaces? Directives[Const]\n   *  - extend type Name ImplementsInterfaces\n   */\n  ;\n\n  _proto.parseObjectTypeExtension = function parseObjectTypeExtension() {\n    var start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('type');\n    var name = this.parseName();\n    var interfaces = this.parseImplementsInterfaces();\n    var directives = this.parseDirectives(true);\n    var fields = this.parseFieldsDefinition();\n\n    if (interfaces.length === 0 && directives.length === 0 && fields.length === 0) {\n      throw this.unexpected();\n    }\n\n    return {\n      kind: Kind.OBJECT_TYPE_EXTENSION,\n      name: name,\n      interfaces: interfaces,\n      directives: directives,\n      fields: fields,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * InterfaceTypeExtension :\n   *  - extend interface Name ImplementsInterfaces? Directives[Const]? FieldsDefinition\n   *  - extend interface Name ImplementsInterfaces? Directives[Const]\n   *  - extend interface Name ImplementsInterfaces\n   */\n  ;\n\n  _proto.parseInterfaceTypeExtension = function parseInterfaceTypeExtension() {\n    var start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('interface');\n    var name = this.parseName();\n    var interfaces = this.parseImplementsInterfaces();\n    var directives = this.parseDirectives(true);\n    var fields = this.parseFieldsDefinition();\n\n    if (interfaces.length === 0 && directives.length === 0 && fields.length === 0) {\n      throw this.unexpected();\n    }\n\n    return {\n      kind: Kind.INTERFACE_TYPE_EXTENSION,\n      name: name,\n      interfaces: interfaces,\n      directives: directives,\n      fields: fields,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * UnionTypeExtension :\n   *   - extend union Name Directives[Const]? UnionMemberTypes\n   *   - extend union Name Directives[Const]\n   */\n  ;\n\n  _proto.parseUnionTypeExtension = function parseUnionTypeExtension() {\n    var start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('union');\n    var name = this.parseName();\n    var directives = this.parseDirectives(true);\n    var types = this.parseUnionMemberTypes();\n\n    if (directives.length === 0 && types.length === 0) {\n      throw this.unexpected();\n    }\n\n    return {\n      kind: Kind.UNION_TYPE_EXTENSION,\n      name: name,\n      directives: directives,\n      types: types,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * EnumTypeExtension :\n   *   - extend enum Name Directives[Const]? EnumValuesDefinition\n   *   - extend enum Name Directives[Const]\n   */\n  ;\n\n  _proto.parseEnumTypeExtension = function parseEnumTypeExtension() {\n    var start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('enum');\n    var name = this.parseName();\n    var directives = this.parseDirectives(true);\n    var values = this.parseEnumValuesDefinition();\n\n    if (directives.length === 0 && values.length === 0) {\n      throw this.unexpected();\n    }\n\n    return {\n      kind: Kind.ENUM_TYPE_EXTENSION,\n      name: name,\n      directives: directives,\n      values: values,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * InputObjectTypeExtension :\n   *   - extend input Name Directives[Const]? InputFieldsDefinition\n   *   - extend input Name Directives[Const]\n   */\n  ;\n\n  _proto.parseInputObjectTypeExtension = function parseInputObjectTypeExtension() {\n    var start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('input');\n    var name = this.parseName();\n    var directives = this.parseDirectives(true);\n    var fields = this.parseInputFieldsDefinition();\n\n    if (directives.length === 0 && fields.length === 0) {\n      throw this.unexpected();\n    }\n\n    return {\n      kind: Kind.INPUT_OBJECT_TYPE_EXTENSION,\n      name: name,\n      directives: directives,\n      fields: fields,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * DirectiveDefinition :\n   *   - Description? directive @ Name ArgumentsDefinition? `repeatable`? on DirectiveLocations\n   */\n  ;\n\n  _proto.parseDirectiveDefinition = function parseDirectiveDefinition() {\n    var start = this._lexer.token;\n    var description = this.parseDescription();\n    this.expectKeyword('directive');\n    this.expectToken(TokenKind.AT);\n    var name = this.parseName();\n    var args = this.parseArgumentDefs();\n    var repeatable = this.expectOptionalKeyword('repeatable');\n    this.expectKeyword('on');\n    var locations = this.parseDirectiveLocations();\n    return {\n      kind: Kind.DIRECTIVE_DEFINITION,\n      description: description,\n      name: name,\n      arguments: args,\n      repeatable: repeatable,\n      locations: locations,\n      loc: this.loc(start)\n    };\n  }\n  /**\n   * DirectiveLocations :\n   *   - `|`? DirectiveLocation\n   *   - DirectiveLocations | DirectiveLocation\n   */\n  ;\n\n  _proto.parseDirectiveLocations = function parseDirectiveLocations() {\n    return this.delimitedMany(TokenKind.PIPE, this.parseDirectiveLocation);\n  }\n  /*\n   * DirectiveLocation :\n   *   - ExecutableDirectiveLocation\n   *   - TypeSystemDirectiveLocation\n   *\n   * ExecutableDirectiveLocation : one of\n   *   `QUERY`\n   *   `MUTATION`\n   *   `SUBSCRIPTION`\n   *   `FIELD`\n   *   `FRAGMENT_DEFINITION`\n   *   `FRAGMENT_SPREAD`\n   *   `INLINE_FRAGMENT`\n   *\n   * TypeSystemDirectiveLocation : one of\n   *   `SCHEMA`\n   *   `SCALAR`\n   *   `OBJECT`\n   *   `FIELD_DEFINITION`\n   *   `ARGUMENT_DEFINITION`\n   *   `INTERFACE`\n   *   `UNION`\n   *   `ENUM`\n   *   `ENUM_VALUE`\n   *   `INPUT_OBJECT`\n   *   `INPUT_FIELD_DEFINITION`\n   */\n  ;\n\n  _proto.parseDirectiveLocation = function parseDirectiveLocation() {\n    var start = this._lexer.token;\n    var name = this.parseName();\n\n    if (DirectiveLocation[name.value] !== undefined) {\n      return name;\n    }\n\n    throw this.unexpected(start);\n  } // Core parsing utility functions\n\n  /**\n   * Returns a location object, used to identify the place in the source that created a given parsed object.\n   */\n  ;\n\n  _proto.loc = function loc(startToken) {\n    var _this$_options4;\n\n    if (((_this$_options4 = this._options) === null || _this$_options4 === void 0 ? void 0 : _this$_options4.noLocation) !== true) {\n      return new Location(startToken, this._lexer.lastToken, this._lexer.source);\n    }\n  }\n  /**\n   * Determines if the next token is of a given kind\n   */\n  ;\n\n  _proto.peek = function peek(kind) {\n    return this._lexer.token.kind === kind;\n  }\n  /**\n   * If the next token is of the given kind, return that token after advancing the lexer.\n   * Otherwise, do not change the parser state and throw an error.\n   */\n  ;\n\n  _proto.expectToken = function expectToken(kind) {\n    var token = this._lexer.token;\n\n    if (token.kind === kind) {\n      this._lexer.advance();\n\n      return token;\n    }\n\n    throw syntaxError(this._lexer.source, token.start, \"Expected \".concat(getTokenKindDesc(kind), \", found \").concat(getTokenDesc(token), \".\"));\n  }\n  /**\n   * If the next token is of the given kind, return that token after advancing the lexer.\n   * Otherwise, do not change the parser state and return undefined.\n   */\n  ;\n\n  _proto.expectOptionalToken = function expectOptionalToken(kind) {\n    var token = this._lexer.token;\n\n    if (token.kind === kind) {\n      this._lexer.advance();\n\n      return token;\n    }\n\n    return undefined;\n  }\n  /**\n   * If the next token is a given keyword, advance the lexer.\n   * Otherwise, do not change the parser state and throw an error.\n   */\n  ;\n\n  _proto.expectKeyword = function expectKeyword(value) {\n    var token = this._lexer.token;\n\n    if (token.kind === TokenKind.NAME && token.value === value) {\n      this._lexer.advance();\n    } else {\n      throw syntaxError(this._lexer.source, token.start, \"Expected \\\"\".concat(value, \"\\\", found \").concat(getTokenDesc(token), \".\"));\n    }\n  }\n  /**\n   * If the next token is a given keyword, return \"true\" after advancing the lexer.\n   * Otherwise, do not change the parser state and return \"false\".\n   */\n  ;\n\n  _proto.expectOptionalKeyword = function expectOptionalKeyword(value) {\n    var token = this._lexer.token;\n\n    if (token.kind === TokenKind.NAME && token.value === value) {\n      this._lexer.advance();\n\n      return true;\n    }\n\n    return false;\n  }\n  /**\n   * Helper function for creating an error when an unexpected lexed token is encountered.\n   */\n  ;\n\n  _proto.unexpected = function unexpected(atToken) {\n    var token = atToken !== null && atToken !== void 0 ? atToken : this._lexer.token;\n    return syntaxError(this._lexer.source, token.start, \"Unexpected \".concat(getTokenDesc(token), \".\"));\n  }\n  /**\n   * Returns a possibly empty list of parse nodes, determined by the parseFn.\n   * This list begins with a lex token of openKind and ends with a lex token of closeKind.\n   * Advances the parser to the next lex token after the closing token.\n   */\n  ;\n\n  _proto.any = function any(openKind, parseFn, closeKind) {\n    this.expectToken(openKind);\n    var nodes = [];\n\n    while (!this.expectOptionalToken(closeKind)) {\n      nodes.push(parseFn.call(this));\n    }\n\n    return nodes;\n  }\n  /**\n   * Returns a list of parse nodes, determined by the parseFn.\n   * It can be empty only if open token is missing otherwise it will always return non-empty list\n   * that begins with a lex token of openKind and ends with a lex token of closeKind.\n   * Advances the parser to the next lex token after the closing token.\n   */\n  ;\n\n  _proto.optionalMany = function optionalMany(openKind, parseFn, closeKind) {\n    if (this.expectOptionalToken(openKind)) {\n      var nodes = [];\n\n      do {\n        nodes.push(parseFn.call(this));\n      } while (!this.expectOptionalToken(closeKind));\n\n      return nodes;\n    }\n\n    return [];\n  }\n  /**\n   * Returns a non-empty list of parse nodes, determined by the parseFn.\n   * This list begins with a lex token of openKind and ends with a lex token of closeKind.\n   * Advances the parser to the next lex token after the closing token.\n   */\n  ;\n\n  _proto.many = function many(openKind, parseFn, closeKind) {\n    this.expectToken(openKind);\n    var nodes = [];\n\n    do {\n      nodes.push(parseFn.call(this));\n    } while (!this.expectOptionalToken(closeKind));\n\n    return nodes;\n  }\n  /**\n   * Returns a non-empty list of parse nodes, determined by the parseFn.\n   * This list may begin with a lex token of delimiterKind followed by items separated by lex tokens of tokenKind.\n   * Advances the parser to the next lex token after last item in the list.\n   */\n  ;\n\n  _proto.delimitedMany = function delimitedMany(delimiterKind, parseFn) {\n    this.expectOptionalToken(delimiterKind);\n    var nodes = [];\n\n    do {\n      nodes.push(parseFn.call(this));\n    } while (this.expectOptionalToken(delimiterKind));\n\n    return nodes;\n  };\n\n  return Parser;\n}();\n/**\n * A helper function to describe a token as a string for debugging.\n */\n\nfunction getTokenDesc(token) {\n  var value = token.value;\n  return getTokenKindDesc(token.kind) + (value != null ? \" \\\"\".concat(value, \"\\\"\") : '');\n}\n/**\n * A helper function to describe a token kind as a string for debugging.\n */\n\n\nfunction getTokenKindDesc(kind) {\n  return isPunctuatorTokenKind(kind) ? \"\\\"\".concat(kind, \"\\\"\") : kind;\n}\n","import { Kind } from \"./kinds.mjs\";\nexport function isDefinitionNode(node) {\n  return isExecutableDefinitionNode(node) || isTypeSystemDefinitionNode(node) || isTypeSystemExtensionNode(node);\n}\nexport function isExecutableDefinitionNode(node) {\n  return node.kind === Kind.OPERATION_DEFINITION || node.kind === Kind.FRAGMENT_DEFINITION;\n}\nexport function isSelectionNode(node) {\n  return node.kind === Kind.FIELD || node.kind === Kind.FRAGMENT_SPREAD || node.kind === Kind.INLINE_FRAGMENT;\n}\nexport function isValueNode(node) {\n  return node.kind === Kind.VARIABLE || node.kind === Kind.INT || node.kind === Kind.FLOAT || node.kind === Kind.STRING || node.kind === Kind.BOOLEAN || node.kind === Kind.NULL || node.kind === Kind.ENUM || node.kind === Kind.LIST || node.kind === Kind.OBJECT;\n}\nexport function isTypeNode(node) {\n  return node.kind === Kind.NAMED_TYPE || node.kind === Kind.LIST_TYPE || node.kind === Kind.NON_NULL_TYPE;\n}\nexport function isTypeSystemDefinitionNode(node) {\n  return node.kind === Kind.SCHEMA_DEFINITION || isTypeDefinitionNode(node) || node.kind === Kind.DIRECTIVE_DEFINITION;\n}\nexport function isTypeDefinitionNode(node) {\n  return node.kind === Kind.SCALAR_TYPE_DEFINITION || node.kind === Kind.OBJECT_TYPE_DEFINITION || node.kind === Kind.INTERFACE_TYPE_DEFINITION || node.kind === Kind.UNION_TYPE_DEFINITION || node.kind === Kind.ENUM_TYPE_DEFINITION || node.kind === Kind.INPUT_OBJECT_TYPE_DEFINITION;\n}\nexport function isTypeSystemExtensionNode(node) {\n  return node.kind === Kind.SCHEMA_EXTENSION || isTypeExtensionNode(node);\n}\nexport function isTypeExtensionNode(node) {\n  return node.kind === Kind.SCALAR_TYPE_EXTENSION || node.kind === Kind.OBJECT_TYPE_EXTENSION || node.kind === Kind.INTERFACE_TYPE_EXTENSION || node.kind === Kind.UNION_TYPE_EXTENSION || node.kind === Kind.ENUM_TYPE_EXTENSION || node.kind === Kind.INPUT_OBJECT_TYPE_EXTENSION;\n}\n","import { getLocation } from \"./location.mjs\";\n/**\n * Render a helpful description of the location in the GraphQL Source document.\n */\n\nexport function printLocation(location) {\n  return printSourceLocation(location.source, getLocation(location.source, location.start));\n}\n/**\n * Render a helpful description of the location in the GraphQL Source document.\n */\n\nexport function printSourceLocation(source, sourceLocation) {\n  var firstLineColumnOffset = source.locationOffset.column - 1;\n  var body = whitespace(firstLineColumnOffset) + source.body;\n  var lineIndex = sourceLocation.line - 1;\n  var lineOffset = source.locationOffset.line - 1;\n  var lineNum = sourceLocation.line + lineOffset;\n  var columnOffset = sourceLocation.line === 1 ? firstLineColumnOffset : 0;\n  var columnNum = sourceLocation.column + columnOffset;\n  var locationStr = \"\".concat(source.name, \":\").concat(lineNum, \":\").concat(columnNum, \"\\n\");\n  var lines = body.split(/\\r\\n|[\\n\\r]/g);\n  var locationLine = lines[lineIndex]; // Special case for minified documents\n\n  if (locationLine.length > 120) {\n    var subLineIndex = Math.floor(columnNum / 80);\n    var subLineColumnNum = columnNum % 80;\n    var subLines = [];\n\n    for (var i = 0; i < locationLine.length; i += 80) {\n      subLines.push(locationLine.slice(i, i + 80));\n    }\n\n    return locationStr + printPrefixedLines([[\"\".concat(lineNum), subLines[0]]].concat(subLines.slice(1, subLineIndex + 1).map(function (subLine) {\n      return ['', subLine];\n    }), [[' ', whitespace(subLineColumnNum - 1) + '^'], ['', subLines[subLineIndex + 1]]]));\n  }\n\n  return locationStr + printPrefixedLines([// Lines specified like this: [\"prefix\", \"string\"],\n  [\"\".concat(lineNum - 1), lines[lineIndex - 1]], [\"\".concat(lineNum), locationLine], ['', whitespace(columnNum - 1) + '^'], [\"\".concat(lineNum + 1), lines[lineIndex + 1]]]);\n}\n\nfunction printPrefixedLines(lines) {\n  var existingLines = lines.filter(function (_ref) {\n    var _ = _ref[0],\n        line = _ref[1];\n    return line !== undefined;\n  });\n  var padLen = Math.max.apply(Math, existingLines.map(function (_ref2) {\n    var prefix = _ref2[0];\n    return prefix.length;\n  }));\n  return existingLines.map(function (_ref3) {\n    var prefix = _ref3[0],\n        line = _ref3[1];\n    return leftPad(padLen, prefix) + (line ? ' | ' + line : ' |');\n  }).join('\\n');\n}\n\nfunction whitespace(len) {\n  return Array(len + 1).join(' ');\n}\n\nfunction leftPad(len, str) {\n  return whitespace(len - str.length) + str;\n}\n","import { visit } from \"./visitor.mjs\";\nimport { printBlockString } from \"./blockString.mjs\";\n/**\n * Converts an AST into a string, using one set of reasonable\n * formatting rules.\n */\n\nexport function print(ast) {\n  return visit(ast, {\n    leave: printDocASTReducer\n  });\n}\nvar MAX_LINE_LENGTH = 80; // TODO: provide better type coverage in future\n\nvar printDocASTReducer = {\n  Name: function Name(node) {\n    return node.value;\n  },\n  Variable: function Variable(node) {\n    return '$' + node.name;\n  },\n  // Document\n  Document: function Document(node) {\n    return join(node.definitions, '\\n\\n') + '\\n';\n  },\n  OperationDefinition: function OperationDefinition(node) {\n    var op = node.operation;\n    var name = node.name;\n    var varDefs = wrap('(', join(node.variableDefinitions, ', '), ')');\n    var directives = join(node.directives, ' ');\n    var selectionSet = node.selectionSet; // Anonymous queries with no directives or variable definitions can use\n    // the query short form.\n\n    return !name && !directives && !varDefs && op === 'query' ? selectionSet : join([op, join([name, varDefs]), directives, selectionSet], ' ');\n  },\n  VariableDefinition: function VariableDefinition(_ref) {\n    var variable = _ref.variable,\n        type = _ref.type,\n        defaultValue = _ref.defaultValue,\n        directives = _ref.directives;\n    return variable + ': ' + type + wrap(' = ', defaultValue) + wrap(' ', join(directives, ' '));\n  },\n  SelectionSet: function SelectionSet(_ref2) {\n    var selections = _ref2.selections;\n    return block(selections);\n  },\n  Field: function Field(_ref3) {\n    var alias = _ref3.alias,\n        name = _ref3.name,\n        args = _ref3.arguments,\n        directives = _ref3.directives,\n        selectionSet = _ref3.selectionSet;\n    var prefix = wrap('', alias, ': ') + name;\n    var argsLine = prefix + wrap('(', join(args, ', '), ')');\n\n    if (argsLine.length > MAX_LINE_LENGTH) {\n      argsLine = prefix + wrap('(\\n', indent(join(args, '\\n')), '\\n)');\n    }\n\n    return join([argsLine, join(directives, ' '), selectionSet], ' ');\n  },\n  Argument: function Argument(_ref4) {\n    var name = _ref4.name,\n        value = _ref4.value;\n    return name + ': ' + value;\n  },\n  // Fragments\n  FragmentSpread: function FragmentSpread(_ref5) {\n    var name = _ref5.name,\n        directives = _ref5.directives;\n    return '...' + name + wrap(' ', join(directives, ' '));\n  },\n  InlineFragment: function InlineFragment(_ref6) {\n    var typeCondition = _ref6.typeCondition,\n        directives = _ref6.directives,\n        selectionSet = _ref6.selectionSet;\n    return join(['...', wrap('on ', typeCondition), join(directives, ' '), selectionSet], ' ');\n  },\n  FragmentDefinition: function FragmentDefinition(_ref7) {\n    var name = _ref7.name,\n        typeCondition = _ref7.typeCondition,\n        variableDefinitions = _ref7.variableDefinitions,\n        directives = _ref7.directives,\n        selectionSet = _ref7.selectionSet;\n    return (// Note: fragment variable definitions are experimental and may be changed\n      // or removed in the future.\n      \"fragment \".concat(name).concat(wrap('(', join(variableDefinitions, ', '), ')'), \" \") + \"on \".concat(typeCondition, \" \").concat(wrap('', join(directives, ' '), ' ')) + selectionSet\n    );\n  },\n  // Value\n  IntValue: function IntValue(_ref8) {\n    var value = _ref8.value;\n    return value;\n  },\n  FloatValue: function FloatValue(_ref9) {\n    var value = _ref9.value;\n    return value;\n  },\n  StringValue: function StringValue(_ref10, key) {\n    var value = _ref10.value,\n        isBlockString = _ref10.block;\n    return isBlockString ? printBlockString(value, key === 'description' ? '' : '  ') : JSON.stringify(value);\n  },\n  BooleanValue: function BooleanValue(_ref11) {\n    var value = _ref11.value;\n    return value ? 'true' : 'false';\n  },\n  NullValue: function NullValue() {\n    return 'null';\n  },\n  EnumValue: function EnumValue(_ref12) {\n    var value = _ref12.value;\n    return value;\n  },\n  ListValue: function ListValue(_ref13) {\n    var values = _ref13.values;\n    return '[' + join(values, ', ') + ']';\n  },\n  ObjectValue: function ObjectValue(_ref14) {\n    var fields = _ref14.fields;\n    return '{' + join(fields, ', ') + '}';\n  },\n  ObjectField: function ObjectField(_ref15) {\n    var name = _ref15.name,\n        value = _ref15.value;\n    return name + ': ' + value;\n  },\n  // Directive\n  Directive: function Directive(_ref16) {\n    var name = _ref16.name,\n        args = _ref16.arguments;\n    return '@' + name + wrap('(', join(args, ', '), ')');\n  },\n  // Type\n  NamedType: function NamedType(_ref17) {\n    var name = _ref17.name;\n    return name;\n  },\n  ListType: function ListType(_ref18) {\n    var type = _ref18.type;\n    return '[' + type + ']';\n  },\n  NonNullType: function NonNullType(_ref19) {\n    var type = _ref19.type;\n    return type + '!';\n  },\n  // Type System Definitions\n  SchemaDefinition: addDescription(function (_ref20) {\n    var directives = _ref20.directives,\n        operationTypes = _ref20.operationTypes;\n    return join(['schema', join(directives, ' '), block(operationTypes)], ' ');\n  }),\n  OperationTypeDefinition: function OperationTypeDefinition(_ref21) {\n    var operation = _ref21.operation,\n        type = _ref21.type;\n    return operation + ': ' + type;\n  },\n  ScalarTypeDefinition: addDescription(function (_ref22) {\n    var name = _ref22.name,\n        directives = _ref22.directives;\n    return join(['scalar', name, join(directives, ' ')], ' ');\n  }),\n  ObjectTypeDefinition: addDescription(function (_ref23) {\n    var name = _ref23.name,\n        interfaces = _ref23.interfaces,\n        directives = _ref23.directives,\n        fields = _ref23.fields;\n    return join(['type', name, wrap('implements ', join(interfaces, ' & ')), join(directives, ' '), block(fields)], ' ');\n  }),\n  FieldDefinition: addDescription(function (_ref24) {\n    var name = _ref24.name,\n        args = _ref24.arguments,\n        type = _ref24.type,\n        directives = _ref24.directives;\n    return name + (hasMultilineItems(args) ? wrap('(\\n', indent(join(args, '\\n')), '\\n)') : wrap('(', join(args, ', '), ')')) + ': ' + type + wrap(' ', join(directives, ' '));\n  }),\n  InputValueDefinition: addDescription(function (_ref25) {\n    var name = _ref25.name,\n        type = _ref25.type,\n        defaultValue = _ref25.defaultValue,\n        directives = _ref25.directives;\n    return join([name + ': ' + type, wrap('= ', defaultValue), join(directives, ' ')], ' ');\n  }),\n  InterfaceTypeDefinition: addDescription(function (_ref26) {\n    var name = _ref26.name,\n        interfaces = _ref26.interfaces,\n        directives = _ref26.directives,\n        fields = _ref26.fields;\n    return join(['interface', name, wrap('implements ', join(interfaces, ' & ')), join(directives, ' '), block(fields)], ' ');\n  }),\n  UnionTypeDefinition: addDescription(function (_ref27) {\n    var name = _ref27.name,\n        directives = _ref27.directives,\n        types = _ref27.types;\n    return join(['union', name, join(directives, ' '), types && types.length !== 0 ? '= ' + join(types, ' | ') : ''], ' ');\n  }),\n  EnumTypeDefinition: addDescription(function (_ref28) {\n    var name = _ref28.name,\n        directives = _ref28.directives,\n        values = _ref28.values;\n    return join(['enum', name, join(directives, ' '), block(values)], ' ');\n  }),\n  EnumValueDefinition: addDescription(function (_ref29) {\n    var name = _ref29.name,\n        directives = _ref29.directives;\n    return join([name, join(directives, ' ')], ' ');\n  }),\n  InputObjectTypeDefinition: addDescription(function (_ref30) {\n    var name = _ref30.name,\n        directives = _ref30.directives,\n        fields = _ref30.fields;\n    return join(['input', name, join(directives, ' '), block(fields)], ' ');\n  }),\n  DirectiveDefinition: addDescription(function (_ref31) {\n    var name = _ref31.name,\n        args = _ref31.arguments,\n        repeatable = _ref31.repeatable,\n        locations = _ref31.locations;\n    return 'directive @' + name + (hasMultilineItems(args) ? wrap('(\\n', indent(join(args, '\\n')), '\\n)') : wrap('(', join(args, ', '), ')')) + (repeatable ? ' repeatable' : '') + ' on ' + join(locations, ' | ');\n  }),\n  SchemaExtension: function SchemaExtension(_ref32) {\n    var directives = _ref32.directives,\n        operationTypes = _ref32.operationTypes;\n    return join(['extend schema', join(directives, ' '), block(operationTypes)], ' ');\n  },\n  ScalarTypeExtension: function ScalarTypeExtension(_ref33) {\n    var name = _ref33.name,\n        directives = _ref33.directives;\n    return join(['extend scalar', name, join(directives, ' ')], ' ');\n  },\n  ObjectTypeExtension: function ObjectTypeExtension(_ref34) {\n    var name = _ref34.name,\n        interfaces = _ref34.interfaces,\n        directives = _ref34.directives,\n        fields = _ref34.fields;\n    return join(['extend type', name, wrap('implements ', join(interfaces, ' & ')), join(directives, ' '), block(fields)], ' ');\n  },\n  InterfaceTypeExtension: function InterfaceTypeExtension(_ref35) {\n    var name = _ref35.name,\n        interfaces = _ref35.interfaces,\n        directives = _ref35.directives,\n        fields = _ref35.fields;\n    return join(['extend interface', name, wrap('implements ', join(interfaces, ' & ')), join(directives, ' '), block(fields)], ' ');\n  },\n  UnionTypeExtension: function UnionTypeExtension(_ref36) {\n    var name = _ref36.name,\n        directives = _ref36.directives,\n        types = _ref36.types;\n    return join(['extend union', name, join(directives, ' '), types && types.length !== 0 ? '= ' + join(types, ' | ') : ''], ' ');\n  },\n  EnumTypeExtension: function EnumTypeExtension(_ref37) {\n    var name = _ref37.name,\n        directives = _ref37.directives,\n        values = _ref37.values;\n    return join(['extend enum', name, join(directives, ' '), block(values)], ' ');\n  },\n  InputObjectTypeExtension: function InputObjectTypeExtension(_ref38) {\n    var name = _ref38.name,\n        directives = _ref38.directives,\n        fields = _ref38.fields;\n    return join(['extend input', name, join(directives, ' '), block(fields)], ' ');\n  }\n};\n\nfunction addDescription(cb) {\n  return function (node) {\n    return join([node.description, cb(node)], '\\n');\n  };\n}\n/**\n * Given maybeArray, print an empty string if it is null or empty, otherwise\n * print all items together separated by separator if provided\n */\n\n\nfunction join(maybeArray) {\n  var _maybeArray$filter$jo;\n\n  var separator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';\n  return (_maybeArray$filter$jo = maybeArray === null || maybeArray === void 0 ? void 0 : maybeArray.filter(function (x) {\n    return x;\n  }).join(separator)) !== null && _maybeArray$filter$jo !== void 0 ? _maybeArray$filter$jo : '';\n}\n/**\n * Given array, print each item on its own line, wrapped in an\n * indented \"{ }\" block.\n */\n\n\nfunction block(array) {\n  return wrap('{\\n', indent(join(array, '\\n')), '\\n}');\n}\n/**\n * If maybeString is not null or empty, then wrap with start and end, otherwise print an empty string.\n */\n\n\nfunction wrap(start, maybeString) {\n  var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : '';\n  return maybeString != null && maybeString !== '' ? start + maybeString + end : '';\n}\n\nfunction indent(str) {\n  return wrap('  ', str.replace(/\\n/g, '\\n  '));\n}\n\nfunction isMultiline(str) {\n  return str.indexOf('\\n') !== -1;\n}\n\nfunction hasMultilineItems(maybeArray) {\n  return maybeArray != null && maybeArray.some(isMultiline);\n}\n","function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nimport { SYMBOL_TO_STRING_TAG } from \"../polyfills/symbols.mjs\";\nimport inspect from \"../jsutils/inspect.mjs\";\nimport devAssert from \"../jsutils/devAssert.mjs\";\nimport instanceOf from \"../jsutils/instanceOf.mjs\";\n\n/**\n * A representation of source input to GraphQL. The `name` and `locationOffset` parameters are\n * optional, but they are useful for clients who store GraphQL documents in source files.\n * For example, if the GraphQL input starts at line 40 in a file named `Foo.graphql`, it might\n * be useful for `name` to be `\"Foo.graphql\"` and location to be `{ line: 40, column: 1 }`.\n * The `line` and `column` properties in `locationOffset` are 1-indexed.\n */\nexport var Source = /*#__PURE__*/function () {\n  function Source(body) {\n    var name = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'GraphQL request';\n    var locationOffset = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {\n      line: 1,\n      column: 1\n    };\n    typeof body === 'string' || devAssert(0, \"Body must be a string. Received: \".concat(inspect(body), \".\"));\n    this.body = body;\n    this.name = name;\n    this.locationOffset = locationOffset;\n    this.locationOffset.line > 0 || devAssert(0, 'line in locationOffset is 1-indexed and must be positive.');\n    this.locationOffset.column > 0 || devAssert(0, 'column in locationOffset is 1-indexed and must be positive.');\n  } // $FlowFixMe[unsupported-syntax] Flow doesn't support computed properties yet\n\n\n  _createClass(Source, [{\n    key: SYMBOL_TO_STRING_TAG,\n    get: function get() {\n      return 'Source';\n    }\n  }]);\n\n  return Source;\n}();\n/**\n * Test if the given value is a Source object.\n *\n * @internal\n */\n\n// eslint-disable-next-line no-redeclare\nexport function isSource(source) {\n  return instanceOf(source, Source);\n}\n","/**\n * An exported enum describing the different kinds of tokens that the\n * lexer emits.\n */\nexport var TokenKind = Object.freeze({\n  SOF: '<SOF>',\n  EOF: '<EOF>',\n  BANG: '!',\n  DOLLAR: '$',\n  AMP: '&',\n  PAREN_L: '(',\n  PAREN_R: ')',\n  SPREAD: '...',\n  COLON: ':',\n  EQUALS: '=',\n  AT: '@',\n  BRACKET_L: '[',\n  BRACKET_R: ']',\n  BRACE_L: '{',\n  PIPE: '|',\n  BRACE_R: '}',\n  NAME: 'Name',\n  INT: 'Int',\n  FLOAT: 'Float',\n  STRING: 'String',\n  BLOCK_STRING: 'BlockString',\n  COMMENT: 'Comment'\n});\n/**\n * The enum type representing the token kinds values.\n */\n","import inspect from \"../jsutils/inspect.mjs\";\nimport { isNode } from \"./ast.mjs\";\n/**\n * A visitor is provided to visit, it contains the collection of\n * relevant functions to be called during the visitor's traversal.\n */\n\nexport var QueryDocumentKeys = {\n  Name: [],\n  Document: ['definitions'],\n  OperationDefinition: ['name', 'variableDefinitions', 'directives', 'selectionSet'],\n  VariableDefinition: ['variable', 'type', 'defaultValue', 'directives'],\n  Variable: ['name'],\n  SelectionSet: ['selections'],\n  Field: ['alias', 'name', 'arguments', 'directives', 'selectionSet'],\n  Argument: ['name', 'value'],\n  FragmentSpread: ['name', 'directives'],\n  InlineFragment: ['typeCondition', 'directives', 'selectionSet'],\n  FragmentDefinition: ['name', // Note: fragment variable definitions are experimental and may be changed\n  // or removed in the future.\n  'variableDefinitions', 'typeCondition', 'directives', 'selectionSet'],\n  IntValue: [],\n  FloatValue: [],\n  StringValue: [],\n  BooleanValue: [],\n  NullValue: [],\n  EnumValue: [],\n  ListValue: ['values'],\n  ObjectValue: ['fields'],\n  ObjectField: ['name', 'value'],\n  Directive: ['name', 'arguments'],\n  NamedType: ['name'],\n  ListType: ['type'],\n  NonNullType: ['type'],\n  SchemaDefinition: ['description', 'directives', 'operationTypes'],\n  OperationTypeDefinition: ['type'],\n  ScalarTypeDefinition: ['description', 'name', 'directives'],\n  ObjectTypeDefinition: ['description', 'name', 'interfaces', 'directives', 'fields'],\n  FieldDefinition: ['description', 'name', 'arguments', 'type', 'directives'],\n  InputValueDefinition: ['description', 'name', 'type', 'defaultValue', 'directives'],\n  InterfaceTypeDefinition: ['description', 'name', 'interfaces', 'directives', 'fields'],\n  UnionTypeDefinition: ['description', 'name', 'directives', 'types'],\n  EnumTypeDefinition: ['description', 'name', 'directives', 'values'],\n  EnumValueDefinition: ['description', 'name', 'directives'],\n  InputObjectTypeDefinition: ['description', 'name', 'directives', 'fields'],\n  DirectiveDefinition: ['description', 'name', 'arguments', 'locations'],\n  SchemaExtension: ['directives', 'operationTypes'],\n  ScalarTypeExtension: ['name', 'directives'],\n  ObjectTypeExtension: ['name', 'interfaces', 'directives', 'fields'],\n  InterfaceTypeExtension: ['name', 'interfaces', 'directives', 'fields'],\n  UnionTypeExtension: ['name', 'directives', 'types'],\n  EnumTypeExtension: ['name', 'directives', 'values'],\n  InputObjectTypeExtension: ['name', 'directives', 'fields']\n};\nexport var BREAK = Object.freeze({});\n/**\n * visit() will walk through an AST using a depth-first traversal, calling\n * the visitor's enter function at each node in the traversal, and calling the\n * leave function after visiting that node and all of its child nodes.\n *\n * By returning different values from the enter and leave functions, the\n * behavior of the visitor can be altered, including skipping over a sub-tree of\n * the AST (by returning false), editing the AST by returning a value or null\n * to remove the value, or to stop the whole traversal by returning BREAK.\n *\n * When using visit() to edit an AST, the original AST will not be modified, and\n * a new version of the AST with the changes applied will be returned from the\n * visit function.\n *\n *     const editedAST = visit(ast, {\n *       enter(node, key, parent, path, ancestors) {\n *         // @return\n *         //   undefined: no action\n *         //   false: skip visiting this node\n *         //   visitor.BREAK: stop visiting altogether\n *         //   null: delete this node\n *         //   any value: replace this node with the returned value\n *       },\n *       leave(node, key, parent, path, ancestors) {\n *         // @return\n *         //   undefined: no action\n *         //   false: no action\n *         //   visitor.BREAK: stop visiting altogether\n *         //   null: delete this node\n *         //   any value: replace this node with the returned value\n *       }\n *     });\n *\n * Alternatively to providing enter() and leave() functions, a visitor can\n * instead provide functions named the same as the kinds of AST nodes, or\n * enter/leave visitors at a named key, leading to four permutations of the\n * visitor API:\n *\n * 1) Named visitors triggered when entering a node of a specific kind.\n *\n *     visit(ast, {\n *       Kind(node) {\n *         // enter the \"Kind\" node\n *       }\n *     })\n *\n * 2) Named visitors that trigger upon entering and leaving a node of\n *    a specific kind.\n *\n *     visit(ast, {\n *       Kind: {\n *         enter(node) {\n *           // enter the \"Kind\" node\n *         }\n *         leave(node) {\n *           // leave the \"Kind\" node\n *         }\n *       }\n *     })\n *\n * 3) Generic visitors that trigger upon entering and leaving any node.\n *\n *     visit(ast, {\n *       enter(node) {\n *         // enter any node\n *       },\n *       leave(node) {\n *         // leave any node\n *       }\n *     })\n *\n * 4) Parallel visitors for entering and leaving nodes of a specific kind.\n *\n *     visit(ast, {\n *       enter: {\n *         Kind(node) {\n *           // enter the \"Kind\" node\n *         }\n *       },\n *       leave: {\n *         Kind(node) {\n *           // leave the \"Kind\" node\n *         }\n *       }\n *     })\n */\n\nexport function visit(root, visitor) {\n  var visitorKeys = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : QueryDocumentKeys;\n\n  /* eslint-disable no-undef-init */\n  var stack = undefined;\n  var inArray = Array.isArray(root);\n  var keys = [root];\n  var index = -1;\n  var edits = [];\n  var node = undefined;\n  var key = undefined;\n  var parent = undefined;\n  var path = [];\n  var ancestors = [];\n  var newRoot = root;\n  /* eslint-enable no-undef-init */\n\n  do {\n    index++;\n    var isLeaving = index === keys.length;\n    var isEdited = isLeaving && edits.length !== 0;\n\n    if (isLeaving) {\n      key = ancestors.length === 0 ? undefined : path[path.length - 1];\n      node = parent;\n      parent = ancestors.pop();\n\n      if (isEdited) {\n        if (inArray) {\n          node = node.slice();\n        } else {\n          var clone = {};\n\n          for (var _i2 = 0, _Object$keys2 = Object.keys(node); _i2 < _Object$keys2.length; _i2++) {\n            var k = _Object$keys2[_i2];\n            clone[k] = node[k];\n          }\n\n          node = clone;\n        }\n\n        var editOffset = 0;\n\n        for (var ii = 0; ii < edits.length; ii++) {\n          var editKey = edits[ii][0];\n          var editValue = edits[ii][1];\n\n          if (inArray) {\n            editKey -= editOffset;\n          }\n\n          if (inArray && editValue === null) {\n            node.splice(editKey, 1);\n            editOffset++;\n          } else {\n            node[editKey] = editValue;\n          }\n        }\n      }\n\n      index = stack.index;\n      keys = stack.keys;\n      edits = stack.edits;\n      inArray = stack.inArray;\n      stack = stack.prev;\n    } else {\n      key = parent ? inArray ? index : keys[index] : undefined;\n      node = parent ? parent[key] : newRoot;\n\n      if (node === null || node === undefined) {\n        continue;\n      }\n\n      if (parent) {\n        path.push(key);\n      }\n    }\n\n    var result = void 0;\n\n    if (!Array.isArray(node)) {\n      if (!isNode(node)) {\n        throw new Error(\"Invalid AST Node: \".concat(inspect(node), \".\"));\n      }\n\n      var visitFn = getVisitFn(visitor, node.kind, isLeaving);\n\n      if (visitFn) {\n        result = visitFn.call(visitor, node, key, parent, path, ancestors);\n\n        if (result === BREAK) {\n          break;\n        }\n\n        if (result === false) {\n          if (!isLeaving) {\n            path.pop();\n            continue;\n          }\n        } else if (result !== undefined) {\n          edits.push([key, result]);\n\n          if (!isLeaving) {\n            if (isNode(result)) {\n              node = result;\n            } else {\n              path.pop();\n              continue;\n            }\n          }\n        }\n      }\n    }\n\n    if (result === undefined && isEdited) {\n      edits.push([key, node]);\n    }\n\n    if (isLeaving) {\n      path.pop();\n    } else {\n      var _visitorKeys$node$kin;\n\n      stack = {\n        inArray: inArray,\n        index: index,\n        keys: keys,\n        edits: edits,\n        prev: stack\n      };\n      inArray = Array.isArray(node);\n      keys = inArray ? node : (_visitorKeys$node$kin = visitorKeys[node.kind]) !== null && _visitorKeys$node$kin !== void 0 ? _visitorKeys$node$kin : [];\n      index = -1;\n      edits = [];\n\n      if (parent) {\n        ancestors.push(parent);\n      }\n\n      parent = node;\n    }\n  } while (stack !== undefined);\n\n  if (edits.length !== 0) {\n    newRoot = edits[edits.length - 1][1];\n  }\n\n  return newRoot;\n}\n/**\n * Creates a new visitor instance which delegates to many visitors to run in\n * parallel. Each visitor will be visited for each node before moving on.\n *\n * If a prior visitor edits a node, no following visitors will see that node.\n */\n\nexport function visitInParallel(visitors) {\n  var skipping = new Array(visitors.length);\n  return {\n    enter: function enter(node) {\n      for (var i = 0; i < visitors.length; i++) {\n        if (skipping[i] == null) {\n          var fn = getVisitFn(visitors[i], node.kind,\n          /* isLeaving */\n          false);\n\n          if (fn) {\n            var result = fn.apply(visitors[i], arguments);\n\n            if (result === false) {\n              skipping[i] = node;\n            } else if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined) {\n              return result;\n            }\n          }\n        }\n      }\n    },\n    leave: function leave(node) {\n      for (var i = 0; i < visitors.length; i++) {\n        if (skipping[i] == null) {\n          var fn = getVisitFn(visitors[i], node.kind,\n          /* isLeaving */\n          true);\n\n          if (fn) {\n            var result = fn.apply(visitors[i], arguments);\n\n            if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined && result !== false) {\n              return result;\n            }\n          }\n        } else if (skipping[i] === node) {\n          skipping[i] = null;\n        }\n      }\n    }\n  };\n}\n/**\n * Given a visitor instance, if it is leaving or not, and a node kind, return\n * the function the visitor runtime should call.\n */\n\nexport function getVisitFn(visitor, kind, isLeaving) {\n  var kindVisitor = visitor[kind];\n\n  if (kindVisitor) {\n    if (!isLeaving && typeof kindVisitor === 'function') {\n      // { Kind() {} }\n      return kindVisitor;\n    }\n\n    var kindSpecificVisitor = isLeaving ? kindVisitor.leave : kindVisitor.enter;\n\n    if (typeof kindSpecificVisitor === 'function') {\n      // { Kind: { enter() {}, leave() {} } }\n      return kindSpecificVisitor;\n    }\n  } else {\n    var specificVisitor = isLeaving ? visitor.leave : visitor.enter;\n\n    if (specificVisitor) {\n      if (typeof specificVisitor === 'function') {\n        // { enter() {}, leave() {} }\n        return specificVisitor;\n      }\n\n      var specificKindVisitor = specificVisitor[kind];\n\n      if (typeof specificKindVisitor === 'function') {\n        // { enter: { Kind() {} }, leave: { Kind() {} } }\n        return specificKindVisitor;\n      }\n    }\n  }\n}\n","// In ES2015 (or a polyfilled) environment, this will be Symbol.iterator\n// istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2317')\nexport var SYMBOL_ITERATOR = typeof Symbol === 'function' && Symbol.iterator != null ? Symbol.iterator : '@@iterator'; // In ES2017 (or a polyfilled) environment, this will be Symbol.asyncIterator\n// istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2317')\n\nexport var SYMBOL_ASYNC_ITERATOR = typeof Symbol === 'function' && Symbol.asyncIterator != null ? Symbol.asyncIterator : '@@asyncIterator'; // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2317')\n\nexport var SYMBOL_TO_STRING_TAG = typeof Symbol === 'function' && Symbol.toStringTag != null ? Symbol.toStringTag : '@@toStringTag';\n","// A [trie](https://en.wikipedia.org/wiki/Trie) data structure that holds\n// object keys weakly, yet can also hold non-object keys, unlike the\n// native `WeakMap`.\n// If no makeData function is supplied, the looked-up data will be an empty,\n// null-prototype Object.\nconst defaultMakeData = () => Object.create(null);\n// Useful for processing arguments objects as well as arrays.\nconst { forEach, slice } = Array.prototype;\nconst { hasOwnProperty } = Object.prototype;\nexport class Trie {\n    constructor(weakness = true, makeData = defaultMakeData) {\n        this.weakness = weakness;\n        this.makeData = makeData;\n    }\n    lookup(...array) {\n        return this.lookupArray(array);\n    }\n    lookupArray(array) {\n        let node = this;\n        forEach.call(array, key => node = node.getChildTrie(key));\n        return hasOwnProperty.call(node, \"data\")\n            ? node.data\n            : node.data = this.makeData(slice.call(array));\n    }\n    peek(...array) {\n        return this.peekArray(array);\n    }\n    peekArray(array) {\n        let node = this;\n        for (let i = 0, len = array.length; node && i < len; ++i) {\n            const map = this.weakness && isObjRef(array[i]) ? node.weak : node.strong;\n            node = map && map.get(array[i]);\n        }\n        return node && node.data;\n    }\n    getChildTrie(key) {\n        const map = this.weakness && isObjRef(key)\n            ? this.weak || (this.weak = new WeakMap())\n            : this.strong || (this.strong = new Map());\n        let child = map.get(key);\n        if (!child)\n            map.set(key, child = new Trie(this.weakness, this.makeData));\n        return child;\n    }\n}\nfunction isObjRef(value) {\n    switch (typeof value) {\n        case \"object\":\n            if (value === null)\n                break;\n        // Fall through to return true...\n        case \"function\":\n            return true;\n    }\n    return false;\n}\n//# sourceMappingURL=index.js.map","// This currentContext variable will only be used if the makeSlotClass\r\n// function is called, which happens only if this is the first copy of the\r\n// @wry/context package to be imported.\r\nvar currentContext = null;\r\n// This unique internal object is used to denote the absence of a value\r\n// for a given Slot, and is never exposed to outside code.\r\nvar MISSING_VALUE = {};\r\nvar idCounter = 1;\r\n// Although we can't do anything about the cost of duplicated code from\r\n// accidentally bundling multiple copies of the @wry/context package, we can\r\n// avoid creating the Slot class more than once using makeSlotClass.\r\nvar makeSlotClass = function () { return /** @class */ (function () {\r\n    function Slot() {\r\n        // If you have a Slot object, you can find out its slot.id, but you cannot\r\n        // guess the slot.id of a Slot you don't have access to, thanks to the\r\n        // randomized suffix.\r\n        this.id = [\r\n            \"slot\",\r\n            idCounter++,\r\n            Date.now(),\r\n            Math.random().toString(36).slice(2),\r\n        ].join(\":\");\r\n    }\r\n    Slot.prototype.hasValue = function () {\r\n        for (var context_1 = currentContext; context_1; context_1 = context_1.parent) {\r\n            // We use the Slot object iself as a key to its value, which means the\r\n            // value cannot be obtained without a reference to the Slot object.\r\n            if (this.id in context_1.slots) {\r\n                var value = context_1.slots[this.id];\r\n                if (value === MISSING_VALUE)\r\n                    break;\r\n                if (context_1 !== currentContext) {\r\n                    // Cache the value in currentContext.slots so the next lookup will\r\n                    // be faster. This caching is safe because the tree of contexts and\r\n                    // the values of the slots are logically immutable.\r\n                    currentContext.slots[this.id] = value;\r\n                }\r\n                return true;\r\n            }\r\n        }\r\n        if (currentContext) {\r\n            // If a value was not found for this Slot, it's never going to be found\r\n            // no matter how many times we look it up, so we might as well cache\r\n            // the absence of the value, too.\r\n            currentContext.slots[this.id] = MISSING_VALUE;\r\n        }\r\n        return false;\r\n    };\r\n    Slot.prototype.getValue = function () {\r\n        if (this.hasValue()) {\r\n            return currentContext.slots[this.id];\r\n        }\r\n    };\r\n    Slot.prototype.withValue = function (value, callback, \r\n    // Given the prevalence of arrow functions, specifying arguments is likely\r\n    // to be much more common than specifying `this`, hence this ordering:\r\n    args, thisArg) {\r\n        var _a;\r\n        var slots = (_a = {\r\n                __proto__: null\r\n            },\r\n            _a[this.id] = value,\r\n            _a);\r\n        var parent = currentContext;\r\n        currentContext = { parent: parent, slots: slots };\r\n        try {\r\n            // Function.prototype.apply allows the arguments array argument to be\r\n            // omitted or undefined, so args! is fine here.\r\n            return callback.apply(thisArg, args);\r\n        }\r\n        finally {\r\n            currentContext = parent;\r\n        }\r\n    };\r\n    // Capture the current context and wrap a callback function so that it\r\n    // reestablishes the captured context when called.\r\n    Slot.bind = function (callback) {\r\n        var context = currentContext;\r\n        return function () {\r\n            var saved = currentContext;\r\n            try {\r\n                currentContext = context;\r\n                return callback.apply(this, arguments);\r\n            }\r\n            finally {\r\n                currentContext = saved;\r\n            }\r\n        };\r\n    };\r\n    // Immediately run a callback function without any captured context.\r\n    Slot.noContext = function (callback, \r\n    // Given the prevalence of arrow functions, specifying arguments is likely\r\n    // to be much more common than specifying `this`, hence this ordering:\r\n    args, thisArg) {\r\n        if (currentContext) {\r\n            var saved = currentContext;\r\n            try {\r\n                currentContext = null;\r\n                // Function.prototype.apply allows the arguments array argument to be\r\n                // omitted or undefined, so args! is fine here.\r\n                return callback.apply(thisArg, args);\r\n            }\r\n            finally {\r\n                currentContext = saved;\r\n            }\r\n        }\r\n        else {\r\n            return callback.apply(thisArg, args);\r\n        }\r\n    };\r\n    return Slot;\r\n}()); };\r\nfunction maybe(fn) {\r\n    try {\r\n        return fn();\r\n    }\r\n    catch (ignored) { }\r\n}\r\n// We store a single global implementation of the Slot class as a permanent\r\n// non-enumerable property of the globalThis object. This obfuscation does\r\n// nothing to prevent access to the Slot class, but at least it ensures the\r\n// implementation (i.e. currentContext) cannot be tampered with, and all copies\r\n// of the @wry/context package (hopefully just one) will share the same Slot\r\n// implementation. Since the first copy of the @wry/context package to be\r\n// imported wins, this technique imposes a steep cost for any future breaking\r\n// changes to the Slot class.\r\nvar globalKey = \"@wry/context:Slot\";\r\nvar host = \r\n// Prefer globalThis when available.\r\n// https://github.com/benjamn/wryware/issues/347\r\nmaybe(function () { return globalThis; }) ||\r\n    // Fall back to global, which works in Node.js and may be converted by some\r\n    // bundlers to the appropriate identifier (window, self, ...) depending on the\r\n    // bundling target. https://github.com/endojs/endo/issues/576#issuecomment-1178515224\r\n    maybe(function () { return global; }) ||\r\n    // Otherwise, use a dummy host that's local to this module. We used to fall\r\n    // back to using the Array constructor as a namespace, but that was flagged in\r\n    // https://github.com/benjamn/wryware/issues/347, and can be avoided.\r\n    Object.create(null);\r\n// Whichever globalHost we're using, make TypeScript happy about the additional\r\n// globalKey property.\r\nvar globalHost = host;\r\nvar Slot = globalHost[globalKey] ||\r\n    // Earlier versions of this package stored the globalKey property on the Array\r\n    // constructor, so we check there as well, to prevent Slot class duplication.\r\n    Array[globalKey] ||\r\n    (function (Slot) {\r\n        try {\r\n            Object.defineProperty(globalHost, globalKey, {\r\n                value: Slot,\r\n                enumerable: false,\r\n                writable: false,\r\n                // When it was possible for globalHost to be the Array constructor (a\r\n                // legacy Slot dedup strategy), it was important for the property to be\r\n                // configurable:true so it could be deleted. That does not seem to be as\r\n                // important when globalHost is the global object, but I don't want to\r\n                // cause similar problems again, and configurable:true seems safest.\r\n                // https://github.com/endojs/endo/issues/576#issuecomment-1178274008\r\n                configurable: true\r\n            });\r\n        }\r\n        finally {\r\n            return Slot;\r\n        }\r\n    })(makeSlotClass());\n\nvar bind = Slot.bind, noContext = Slot.noContext;\r\nfunction setTimeoutWithContext(callback, delay) {\r\n    return setTimeout(bind(callback), delay);\r\n}\r\n// Turn any generator function into an async function (using yield instead\r\n// of await), with context automatically preserved across yields.\r\nfunction asyncFromGen(genFn) {\r\n    return function () {\r\n        var gen = genFn.apply(this, arguments);\r\n        var boundNext = bind(gen.next);\r\n        var boundThrow = bind(gen.throw);\r\n        return new Promise(function (resolve, reject) {\r\n            function invoke(method, argument) {\r\n                try {\r\n                    var result = method.call(gen, argument);\r\n                }\r\n                catch (error) {\r\n                    return reject(error);\r\n                }\r\n                var next = result.done ? resolve : invokeNext;\r\n                if (isPromiseLike(result.value)) {\r\n                    result.value.then(next, result.done ? reject : invokeThrow);\r\n                }\r\n                else {\r\n                    next(result.value);\r\n                }\r\n            }\r\n            var invokeNext = function (value) { return invoke(boundNext, value); };\r\n            var invokeThrow = function (error) { return invoke(boundThrow, error); };\r\n            invokeNext();\r\n        });\r\n    };\r\n}\r\nfunction isPromiseLike(value) {\r\n    return value && typeof value.then === \"function\";\r\n}\r\n// If you use the fibers npm package to implement coroutines in Node.js,\r\n// you should call this function at least once to ensure context management\r\n// remains coherent across any yields.\r\nvar wrappedFibers = [];\r\nfunction wrapYieldingFiberMethods(Fiber) {\r\n    // There can be only one implementation of Fiber per process, so this array\r\n    // should never grow longer than one element.\r\n    if (wrappedFibers.indexOf(Fiber) < 0) {\r\n        var wrap = function (obj, method) {\r\n            var fn = obj[method];\r\n            obj[method] = function () {\r\n                return noContext(fn, arguments, this);\r\n            };\r\n        };\r\n        // These methods can yield, according to\r\n        // https://github.com/laverdet/node-fibers/blob/ddebed9b8ae3883e57f822e2108e6943e5c8d2a8/fibers.js#L97-L100\r\n        wrap(Fiber, \"yield\");\r\n        wrap(Fiber.prototype, \"run\");\r\n        wrap(Fiber.prototype, \"throwInto\");\r\n        wrappedFibers.push(Fiber);\r\n    }\r\n    return Fiber;\r\n}\n\nexport { Slot, asyncFromGen, bind, noContext, setTimeoutWithContext as setTimeout, wrapYieldingFiberMethods };\n//# sourceMappingURL=context.esm.js.map\n","import { Slot } from \"@wry/context\";\nexport const parentEntrySlot = new Slot();\nexport function nonReactive(fn) {\n    return parentEntrySlot.withValue(void 0, fn);\n}\nexport { Slot };\nexport { bind as bindContext, noContext, setTimeout, asyncFromGen, } from \"@wry/context\";\n//# sourceMappingURL=context.js.map","export const { hasOwnProperty, } = Object.prototype;\nexport const arrayFromSet = Array.from ||\n    function (set) {\n        const array = [];\n        set.forEach(item => array.push(item));\n        return array;\n    };\nexport function maybeUnsubscribe(entryOrDep) {\n    const { unsubscribe } = entryOrDep;\n    if (typeof unsubscribe === \"function\") {\n        entryOrDep.unsubscribe = void 0;\n        unsubscribe();\n    }\n}\n//# sourceMappingURL=helpers.js.map","import { parentEntrySlot } from \"./context.js\";\nimport { maybeUnsubscribe, arrayFromSet } from \"./helpers.js\";\nconst emptySetPool = [];\nconst POOL_TARGET_SIZE = 100;\n// Since this package might be used browsers, we should avoid using the\n// Node built-in assert module.\nfunction assert(condition, optionalMessage) {\n    if (!condition) {\n        throw new Error(optionalMessage || \"assertion failure\");\n    }\n}\nfunction valueIs(a, b) {\n    const len = a.length;\n    return (\n    // Unknown values are not equal to each other.\n    len > 0 &&\n        // Both values must be ordinary (or both exceptional) to be equal.\n        len === b.length &&\n        // The underlying value or exception must be the same.\n        a[len - 1] === b[len - 1]);\n}\nfunction valueGet(value) {\n    switch (value.length) {\n        case 0: throw new Error(\"unknown value\");\n        case 1: return value[0];\n        case 2: throw value[1];\n    }\n}\nfunction valueCopy(value) {\n    return value.slice(0);\n}\nexport class Entry {\n    constructor(fn) {\n        this.fn = fn;\n        this.parents = new Set();\n        this.childValues = new Map();\n        // When this Entry has children that are dirty, this property becomes\n        // a Set containing other Entry objects, borrowed from emptySetPool.\n        // When the set becomes empty, it gets recycled back to emptySetPool.\n        this.dirtyChildren = null;\n        this.dirty = true;\n        this.recomputing = false;\n        this.value = [];\n        this.deps = null;\n        ++Entry.count;\n    }\n    peek() {\n        if (this.value.length === 1 && !mightBeDirty(this)) {\n            rememberParent(this);\n            return this.value[0];\n        }\n    }\n    // This is the most important method of the Entry API, because it\n    // determines whether the cached this.value can be returned immediately,\n    // or must be recomputed. The overall performance of the caching system\n    // depends on the truth of the following observations: (1) this.dirty is\n    // usually false, (2) this.dirtyChildren is usually null/empty, and thus\n    // (3) valueGet(this.value) is usually returned without recomputation.\n    recompute(args) {\n        assert(!this.recomputing, \"already recomputing\");\n        rememberParent(this);\n        return mightBeDirty(this)\n            ? reallyRecompute(this, args)\n            : valueGet(this.value);\n    }\n    setDirty() {\n        if (this.dirty)\n            return;\n        this.dirty = true;\n        reportDirty(this);\n        // We can go ahead and unsubscribe here, since any further dirty\n        // notifications we receive will be redundant, and unsubscribing may\n        // free up some resources, e.g. file watchers.\n        maybeUnsubscribe(this);\n    }\n    dispose() {\n        this.setDirty();\n        // Sever any dependency relationships with our own children, so those\n        // children don't retain this parent Entry in their child.parents sets,\n        // thereby preventing it from being fully garbage collected.\n        forgetChildren(this);\n        // Because this entry has been kicked out of the cache (in index.js),\n        // we've lost the ability to find out if/when this entry becomes dirty,\n        // whether that happens through a subscription, because of a direct call\n        // to entry.setDirty(), or because one of its children becomes dirty.\n        // Because of this loss of future information, we have to assume the\n        // worst (that this entry might have become dirty very soon), so we must\n        // immediately mark this entry's parents as dirty. Normally we could\n        // just call entry.setDirty() rather than calling parent.setDirty() for\n        // each parent, but that would leave this entry in parent.childValues\n        // and parent.dirtyChildren, which would prevent the child from being\n        // truly forgotten.\n        eachParent(this, (parent, child) => {\n            parent.setDirty();\n            forgetChild(parent, this);\n        });\n    }\n    forget() {\n        // The code that creates Entry objects in index.ts will replace this method\n        // with one that actually removes the Entry from the cache, which will also\n        // trigger the entry.dispose method.\n        this.dispose();\n    }\n    dependOn(dep) {\n        dep.add(this);\n        if (!this.deps) {\n            this.deps = emptySetPool.pop() || new Set();\n        }\n        this.deps.add(dep);\n    }\n    forgetDeps() {\n        if (this.deps) {\n            arrayFromSet(this.deps).forEach(dep => dep.delete(this));\n            this.deps.clear();\n            emptySetPool.push(this.deps);\n            this.deps = null;\n        }\n    }\n}\nEntry.count = 0;\nfunction rememberParent(child) {\n    const parent = parentEntrySlot.getValue();\n    if (parent) {\n        child.parents.add(parent);\n        if (!parent.childValues.has(child)) {\n            parent.childValues.set(child, []);\n        }\n        if (mightBeDirty(child)) {\n            reportDirtyChild(parent, child);\n        }\n        else {\n            reportCleanChild(parent, child);\n        }\n        return parent;\n    }\n}\nfunction reallyRecompute(entry, args) {\n    forgetChildren(entry);\n    // Set entry as the parent entry while calling recomputeNewValue(entry).\n    parentEntrySlot.withValue(entry, recomputeNewValue, [entry, args]);\n    if (maybeSubscribe(entry, args)) {\n        // If we successfully recomputed entry.value and did not fail to\n        // (re)subscribe, then this Entry is no longer explicitly dirty.\n        setClean(entry);\n    }\n    return valueGet(entry.value);\n}\nfunction recomputeNewValue(entry, args) {\n    entry.recomputing = true;\n    const { normalizeResult } = entry;\n    let oldValueCopy;\n    if (normalizeResult && entry.value.length === 1) {\n        oldValueCopy = valueCopy(entry.value);\n    }\n    // Make entry.value an empty array, representing an unknown value.\n    entry.value.length = 0;\n    try {\n        // If entry.fn succeeds, entry.value will become a normal Value.\n        entry.value[0] = entry.fn.apply(null, args);\n        // If we have a viable oldValueCopy to compare with the (successfully\n        // recomputed) new entry.value, and they are not already === identical, give\n        // normalizeResult a chance to pick/choose/reuse parts of oldValueCopy[0]\n        // and/or entry.value[0] to determine the final cached entry.value.\n        if (normalizeResult && oldValueCopy && !valueIs(oldValueCopy, entry.value)) {\n            try {\n                entry.value[0] = normalizeResult(entry.value[0], oldValueCopy[0]);\n            }\n            catch (_a) {\n                // If normalizeResult throws, just use the newer value, rather than\n                // saving the exception as entry.value[1].\n            }\n        }\n    }\n    catch (e) {\n        // If entry.fn throws, entry.value will hold that exception.\n        entry.value[1] = e;\n    }\n    // Either way, this line is always reached.\n    entry.recomputing = false;\n}\nfunction mightBeDirty(entry) {\n    return entry.dirty || !!(entry.dirtyChildren && entry.dirtyChildren.size);\n}\nfunction setClean(entry) {\n    entry.dirty = false;\n    if (mightBeDirty(entry)) {\n        // This Entry may still have dirty children, in which case we can't\n        // let our parents know we're clean just yet.\n        return;\n    }\n    reportClean(entry);\n}\nfunction reportDirty(child) {\n    eachParent(child, reportDirtyChild);\n}\nfunction reportClean(child) {\n    eachParent(child, reportCleanChild);\n}\nfunction eachParent(child, callback) {\n    const parentCount = child.parents.size;\n    if (parentCount) {\n        const parents = arrayFromSet(child.parents);\n        for (let i = 0; i < parentCount; ++i) {\n            callback(parents[i], child);\n        }\n    }\n}\n// Let a parent Entry know that one of its children may be dirty.\nfunction reportDirtyChild(parent, child) {\n    // Must have called rememberParent(child) before calling\n    // reportDirtyChild(parent, child).\n    assert(parent.childValues.has(child));\n    assert(mightBeDirty(child));\n    const parentWasClean = !mightBeDirty(parent);\n    if (!parent.dirtyChildren) {\n        parent.dirtyChildren = emptySetPool.pop() || new Set;\n    }\n    else if (parent.dirtyChildren.has(child)) {\n        // If we already know this child is dirty, then we must have already\n        // informed our own parents that we are dirty, so we can terminate\n        // the recursion early.\n        return;\n    }\n    parent.dirtyChildren.add(child);\n    // If parent was clean before, it just became (possibly) dirty (according to\n    // mightBeDirty), since we just added child to parent.dirtyChildren.\n    if (parentWasClean) {\n        reportDirty(parent);\n    }\n}\n// Let a parent Entry know that one of its children is no longer dirty.\nfunction reportCleanChild(parent, child) {\n    // Must have called rememberChild(child) before calling\n    // reportCleanChild(parent, child).\n    assert(parent.childValues.has(child));\n    assert(!mightBeDirty(child));\n    const childValue = parent.childValues.get(child);\n    if (childValue.length === 0) {\n        parent.childValues.set(child, valueCopy(child.value));\n    }\n    else if (!valueIs(childValue, child.value)) {\n        parent.setDirty();\n    }\n    removeDirtyChild(parent, child);\n    if (mightBeDirty(parent)) {\n        return;\n    }\n    reportClean(parent);\n}\nfunction removeDirtyChild(parent, child) {\n    const dc = parent.dirtyChildren;\n    if (dc) {\n        dc.delete(child);\n        if (dc.size === 0) {\n            if (emptySetPool.length < POOL_TARGET_SIZE) {\n                emptySetPool.push(dc);\n            }\n            parent.dirtyChildren = null;\n        }\n    }\n}\n// Removes all children from this entry and returns an array of the\n// removed children.\nfunction forgetChildren(parent) {\n    if (parent.childValues.size > 0) {\n        parent.childValues.forEach((_value, child) => {\n            forgetChild(parent, child);\n        });\n    }\n    // Remove this parent Entry from any sets to which it was added by the\n    // addToSet method.\n    parent.forgetDeps();\n    // After we forget all our children, this.dirtyChildren must be empty\n    // and therefore must have been reset to null.\n    assert(parent.dirtyChildren === null);\n}\nfunction forgetChild(parent, child) {\n    child.parents.delete(parent);\n    parent.childValues.delete(child);\n    removeDirtyChild(parent, child);\n}\nfunction maybeSubscribe(entry, args) {\n    if (typeof entry.subscribe === \"function\") {\n        try {\n            maybeUnsubscribe(entry); // Prevent double subscriptions.\n            entry.unsubscribe = entry.subscribe.apply(null, args);\n        }\n        catch (e) {\n            // If this Entry has a subscribe function and it threw an exception\n            // (or an unsubscribe function it previously returned now throws),\n            // return false to indicate that we were not able to subscribe (or\n            // unsubscribe), and this Entry should remain dirty.\n            entry.setDirty();\n            return false;\n        }\n    }\n    // Returning true indicates either that there was no entry.subscribe\n    // function or that it succeeded.\n    return true;\n}\n//# sourceMappingURL=entry.js.map","import { parentEntrySlot } from \"./context.js\";\nimport { hasOwnProperty, maybeUnsubscribe, arrayFromSet, } from \"./helpers.js\";\nconst EntryMethods = {\n    setDirty: true,\n    dispose: true,\n    forget: true, // Fully remove parent Entry from LRU cache and computation graph\n};\nexport function dep(options) {\n    const depsByKey = new Map();\n    const subscribe = options && options.subscribe;\n    function depend(key) {\n        const parent = parentEntrySlot.getValue();\n        if (parent) {\n            let dep = depsByKey.get(key);\n            if (!dep) {\n                depsByKey.set(key, dep = new Set);\n            }\n            parent.dependOn(dep);\n            if (typeof subscribe === \"function\") {\n                maybeUnsubscribe(dep);\n                dep.unsubscribe = subscribe(key);\n            }\n        }\n    }\n    depend.dirty = function dirty(key, entryMethodName) {\n        const dep = depsByKey.get(key);\n        if (dep) {\n            const m = (entryMethodName &&\n                hasOwnProperty.call(EntryMethods, entryMethodName)) ? entryMethodName : \"setDirty\";\n            // We have to use arrayFromSet(dep).forEach instead of dep.forEach,\n            // because modifying a Set while iterating over it can cause elements in\n            // the Set to be removed from the Set before they've been iterated over.\n            arrayFromSet(dep).forEach(entry => entry[m]());\n            depsByKey.delete(key);\n            maybeUnsubscribe(dep);\n        }\n    };\n    return depend;\n}\n//# sourceMappingURL=dep.js.map","import { Trie } from \"@wry/trie\";\nimport { StrongCache } from \"@wry/caches\";\nimport { Entry } from \"./entry.js\";\nimport { parentEntrySlot } from \"./context.js\";\n// These helper functions are important for making optimism work with\n// asynchronous code. In order to register parent-child dependencies,\n// optimism needs to know about any currently active parent computations.\n// In ordinary synchronous code, the parent context is implicit in the\n// execution stack, but asynchronous code requires some extra guidance in\n// order to propagate context from one async task segment to the next.\nexport { bindContext, noContext, nonReactive, setTimeout, asyncFromGen, Slot, } from \"./context.js\";\n// A lighter-weight dependency, similar to OptimisticWrapperFunction, except\n// with only one argument, no makeCacheKey, no wrapped function to recompute,\n// and no result value. Useful for representing dependency leaves in the graph\n// of computation. Subscriptions are supported.\nexport { dep } from \"./dep.js\";\n// The defaultMakeCacheKey function is remarkably powerful, because it gives\n// a unique object for any shallow-identical list of arguments. If you need\n// to implement a custom makeCacheKey function, you may find it helpful to\n// delegate the final work to defaultMakeCacheKey, which is why we export it\n// here. However, you may want to avoid defaultMakeCacheKey if your runtime\n// does not support WeakMap, or you have the ability to return a string key.\n// In those cases, just write your own custom makeCacheKey functions.\nlet defaultKeyTrie;\nexport function defaultMakeCacheKey(...args) {\n    const trie = defaultKeyTrie || (defaultKeyTrie = new Trie(typeof WeakMap === \"function\"));\n    return trie.lookupArray(args);\n}\n// If you're paranoid about memory leaks, or you want to avoid using WeakMap\n// under the hood, but you still need the behavior of defaultMakeCacheKey,\n// import this constructor to create your own tries.\nexport { Trie as KeyTrie };\n;\nconst caches = new Set();\nexport function wrap(originalFunction, { max = Math.pow(2, 16), keyArgs, makeCacheKey = defaultMakeCacheKey, normalizeResult, subscribe, cache: cacheOption = StrongCache, } = Object.create(null)) {\n    const cache = typeof cacheOption === \"function\"\n        ? new cacheOption(max, entry => entry.dispose())\n        : cacheOption;\n    const optimistic = function () {\n        const key = makeCacheKey.apply(null, keyArgs ? keyArgs.apply(null, arguments) : arguments);\n        if (key === void 0) {\n            return originalFunction.apply(null, arguments);\n        }\n        let entry = cache.get(key);\n        if (!entry) {\n            cache.set(key, entry = new Entry(originalFunction));\n            entry.normalizeResult = normalizeResult;\n            entry.subscribe = subscribe;\n            // Give the Entry the ability to trigger cache.delete(key), even though\n            // the Entry itself does not know about key or cache.\n            entry.forget = () => cache.delete(key);\n        }\n        const value = entry.recompute(Array.prototype.slice.call(arguments));\n        // Move this entry to the front of the least-recently used queue,\n        // since we just finished computing its value.\n        cache.set(key, entry);\n        caches.add(cache);\n        // Clean up any excess entries in the cache, but only if there is no\n        // active parent entry, meaning we're not in the middle of a larger\n        // computation that might be flummoxed by the cleaning.\n        if (!parentEntrySlot.hasValue()) {\n            caches.forEach(cache => cache.clean());\n            caches.clear();\n        }\n        return value;\n    };\n    Object.defineProperty(optimistic, \"size\", {\n        get: () => cache.size,\n        configurable: false,\n        enumerable: false,\n    });\n    Object.freeze(optimistic.options = {\n        max,\n        keyArgs,\n        makeCacheKey,\n        normalizeResult,\n        subscribe,\n        cache,\n    });\n    function dirtyKey(key) {\n        const entry = key && cache.get(key);\n        if (entry) {\n            entry.setDirty();\n        }\n    }\n    optimistic.dirtyKey = dirtyKey;\n    optimistic.dirty = function dirty() {\n        dirtyKey(makeCacheKey.apply(null, arguments));\n    };\n    function peekKey(key) {\n        const entry = key && cache.get(key);\n        if (entry) {\n            return entry.peek();\n        }\n    }\n    optimistic.peekKey = peekKey;\n    optimistic.peek = function peek() {\n        return peekKey(makeCacheKey.apply(null, arguments));\n    };\n    function forgetKey(key) {\n        return key ? cache.delete(key) : false;\n    }\n    optimistic.forgetKey = forgetKey;\n    optimistic.forget = function forget() {\n        return forgetKey(makeCacheKey.apply(null, arguments));\n    };\n    optimistic.makeCacheKey = makeCacheKey;\n    optimistic.getKey = keyArgs ? function getKey() {\n        return makeCacheKey.apply(null, keyArgs.apply(null, arguments));\n    } : makeCacheKey;\n    return Object.freeze(optimistic);\n}\n//# sourceMappingURL=index.js.map","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\n\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\n\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\n\n// === Symbol Support ===\nvar hasSymbols = function () {\n  return typeof Symbol === 'function';\n};\n\nvar hasSymbol = function (name) {\n  return hasSymbols() && Boolean(Symbol[name]);\n};\n\nvar getSymbol = function (name) {\n  return hasSymbol(name) ? Symbol[name] : '@@' + name;\n};\n\nif (hasSymbols() && !hasSymbol('observable')) {\n  Symbol.observable = Symbol('observable');\n}\n\nvar SymbolIterator = getSymbol('iterator');\nvar SymbolObservable = getSymbol('observable');\nvar SymbolSpecies = getSymbol('species'); // === Abstract Operations ===\n\nfunction getMethod(obj, key) {\n  var value = obj[key];\n  if (value == null) return undefined;\n  if (typeof value !== 'function') throw new TypeError(value + ' is not a function');\n  return value;\n}\n\nfunction getSpecies(obj) {\n  var ctor = obj.constructor;\n\n  if (ctor !== undefined) {\n    ctor = ctor[SymbolSpecies];\n\n    if (ctor === null) {\n      ctor = undefined;\n    }\n  }\n\n  return ctor !== undefined ? ctor : Observable;\n}\n\nfunction isObservable(x) {\n  return x instanceof Observable; // SPEC: Brand check\n}\n\nfunction hostReportError(e) {\n  if (hostReportError.log) {\n    hostReportError.log(e);\n  } else {\n    setTimeout(function () {\n      throw e;\n    });\n  }\n}\n\nfunction enqueue(fn) {\n  Promise.resolve().then(function () {\n    try {\n      fn();\n    } catch (e) {\n      hostReportError(e);\n    }\n  });\n}\n\nfunction cleanupSubscription(subscription) {\n  var cleanup = subscription._cleanup;\n  if (cleanup === undefined) return;\n  subscription._cleanup = undefined;\n\n  if (!cleanup) {\n    return;\n  }\n\n  try {\n    if (typeof cleanup === 'function') {\n      cleanup();\n    } else {\n      var unsubscribe = getMethod(cleanup, 'unsubscribe');\n\n      if (unsubscribe) {\n        unsubscribe.call(cleanup);\n      }\n    }\n  } catch (e) {\n    hostReportError(e);\n  }\n}\n\nfunction closeSubscription(subscription) {\n  subscription._observer = undefined;\n  subscription._queue = undefined;\n  subscription._state = 'closed';\n}\n\nfunction flushSubscription(subscription) {\n  var queue = subscription._queue;\n\n  if (!queue) {\n    return;\n  }\n\n  subscription._queue = undefined;\n  subscription._state = 'ready';\n\n  for (var i = 0; i < queue.length; ++i) {\n    notifySubscription(subscription, queue[i].type, queue[i].value);\n    if (subscription._state === 'closed') break;\n  }\n}\n\nfunction notifySubscription(subscription, type, value) {\n  subscription._state = 'running';\n  var observer = subscription._observer;\n\n  try {\n    var m = getMethod(observer, type);\n\n    switch (type) {\n      case 'next':\n        if (m) m.call(observer, value);\n        break;\n\n      case 'error':\n        closeSubscription(subscription);\n        if (m) m.call(observer, value);else throw value;\n        break;\n\n      case 'complete':\n        closeSubscription(subscription);\n        if (m) m.call(observer);\n        break;\n    }\n  } catch (e) {\n    hostReportError(e);\n  }\n\n  if (subscription._state === 'closed') cleanupSubscription(subscription);else if (subscription._state === 'running') subscription._state = 'ready';\n}\n\nfunction onNotify(subscription, type, value) {\n  if (subscription._state === 'closed') return;\n\n  if (subscription._state === 'buffering') {\n    subscription._queue.push({\n      type: type,\n      value: value\n    });\n\n    return;\n  }\n\n  if (subscription._state !== 'ready') {\n    subscription._state = 'buffering';\n    subscription._queue = [{\n      type: type,\n      value: value\n    }];\n    enqueue(function () {\n      return flushSubscription(subscription);\n    });\n    return;\n  }\n\n  notifySubscription(subscription, type, value);\n}\n\nvar Subscription = /*#__PURE__*/function () {\n  function Subscription(observer, subscriber) {\n    // ASSERT: observer is an object\n    // ASSERT: subscriber is callable\n    this._cleanup = undefined;\n    this._observer = observer;\n    this._queue = undefined;\n    this._state = 'initializing';\n    var subscriptionObserver = new SubscriptionObserver(this);\n\n    try {\n      this._cleanup = subscriber.call(undefined, subscriptionObserver);\n    } catch (e) {\n      subscriptionObserver.error(e);\n    }\n\n    if (this._state === 'initializing') this._state = 'ready';\n  }\n\n  var _proto = Subscription.prototype;\n\n  _proto.unsubscribe = function unsubscribe() {\n    if (this._state !== 'closed') {\n      closeSubscription(this);\n      cleanupSubscription(this);\n    }\n  };\n\n  _createClass(Subscription, [{\n    key: \"closed\",\n    get: function () {\n      return this._state === 'closed';\n    }\n  }]);\n\n  return Subscription;\n}();\n\nvar SubscriptionObserver = /*#__PURE__*/function () {\n  function SubscriptionObserver(subscription) {\n    this._subscription = subscription;\n  }\n\n  var _proto2 = SubscriptionObserver.prototype;\n\n  _proto2.next = function next(value) {\n    onNotify(this._subscription, 'next', value);\n  };\n\n  _proto2.error = function error(value) {\n    onNotify(this._subscription, 'error', value);\n  };\n\n  _proto2.complete = function complete() {\n    onNotify(this._subscription, 'complete');\n  };\n\n  _createClass(SubscriptionObserver, [{\n    key: \"closed\",\n    get: function () {\n      return this._subscription._state === 'closed';\n    }\n  }]);\n\n  return SubscriptionObserver;\n}();\n\nvar Observable = /*#__PURE__*/function () {\n  function Observable(subscriber) {\n    if (!(this instanceof Observable)) throw new TypeError('Observable cannot be called as a function');\n    if (typeof subscriber !== 'function') throw new TypeError('Observable initializer must be a function');\n    this._subscriber = subscriber;\n  }\n\n  var _proto3 = Observable.prototype;\n\n  _proto3.subscribe = function subscribe(observer) {\n    if (typeof observer !== 'object' || observer === null) {\n      observer = {\n        next: observer,\n        error: arguments[1],\n        complete: arguments[2]\n      };\n    }\n\n    return new Subscription(observer, this._subscriber);\n  };\n\n  _proto3.forEach = function forEach(fn) {\n    var _this = this;\n\n    return new Promise(function (resolve, reject) {\n      if (typeof fn !== 'function') {\n        reject(new TypeError(fn + ' is not a function'));\n        return;\n      }\n\n      function done() {\n        subscription.unsubscribe();\n        resolve();\n      }\n\n      var subscription = _this.subscribe({\n        next: function (value) {\n          try {\n            fn(value, done);\n          } catch (e) {\n            reject(e);\n            subscription.unsubscribe();\n          }\n        },\n        error: reject,\n        complete: resolve\n      });\n    });\n  };\n\n  _proto3.map = function map(fn) {\n    var _this2 = this;\n\n    if (typeof fn !== 'function') throw new TypeError(fn + ' is not a function');\n    var C = getSpecies(this);\n    return new C(function (observer) {\n      return _this2.subscribe({\n        next: function (value) {\n          try {\n            value = fn(value);\n          } catch (e) {\n            return observer.error(e);\n          }\n\n          observer.next(value);\n        },\n        error: function (e) {\n          observer.error(e);\n        },\n        complete: function () {\n          observer.complete();\n        }\n      });\n    });\n  };\n\n  _proto3.filter = function filter(fn) {\n    var _this3 = this;\n\n    if (typeof fn !== 'function') throw new TypeError(fn + ' is not a function');\n    var C = getSpecies(this);\n    return new C(function (observer) {\n      return _this3.subscribe({\n        next: function (value) {\n          try {\n            if (!fn(value)) return;\n          } catch (e) {\n            return observer.error(e);\n          }\n\n          observer.next(value);\n        },\n        error: function (e) {\n          observer.error(e);\n        },\n        complete: function () {\n          observer.complete();\n        }\n      });\n    });\n  };\n\n  _proto3.reduce = function reduce(fn) {\n    var _this4 = this;\n\n    if (typeof fn !== 'function') throw new TypeError(fn + ' is not a function');\n    var C = getSpecies(this);\n    var hasSeed = arguments.length > 1;\n    var hasValue = false;\n    var seed = arguments[1];\n    var acc = seed;\n    return new C(function (observer) {\n      return _this4.subscribe({\n        next: function (value) {\n          var first = !hasValue;\n          hasValue = true;\n\n          if (!first || hasSeed) {\n            try {\n              acc = fn(acc, value);\n            } catch (e) {\n              return observer.error(e);\n            }\n          } else {\n            acc = value;\n          }\n        },\n        error: function (e) {\n          observer.error(e);\n        },\n        complete: function () {\n          if (!hasValue && !hasSeed) return observer.error(new TypeError('Cannot reduce an empty sequence'));\n          observer.next(acc);\n          observer.complete();\n        }\n      });\n    });\n  };\n\n  _proto3.concat = function concat() {\n    var _this5 = this;\n\n    for (var _len = arguments.length, sources = new Array(_len), _key = 0; _key < _len; _key++) {\n      sources[_key] = arguments[_key];\n    }\n\n    var C = getSpecies(this);\n    return new C(function (observer) {\n      var subscription;\n      var index = 0;\n\n      function startNext(next) {\n        subscription = next.subscribe({\n          next: function (v) {\n            observer.next(v);\n          },\n          error: function (e) {\n            observer.error(e);\n          },\n          complete: function () {\n            if (index === sources.length) {\n              subscription = undefined;\n              observer.complete();\n            } else {\n              startNext(C.from(sources[index++]));\n            }\n          }\n        });\n      }\n\n      startNext(_this5);\n      return function () {\n        if (subscription) {\n          subscription.unsubscribe();\n          subscription = undefined;\n        }\n      };\n    });\n  };\n\n  _proto3.flatMap = function flatMap(fn) {\n    var _this6 = this;\n\n    if (typeof fn !== 'function') throw new TypeError(fn + ' is not a function');\n    var C = getSpecies(this);\n    return new C(function (observer) {\n      var subscriptions = [];\n\n      var outer = _this6.subscribe({\n        next: function (value) {\n          if (fn) {\n            try {\n              value = fn(value);\n            } catch (e) {\n              return observer.error(e);\n            }\n          }\n\n          var inner = C.from(value).subscribe({\n            next: function (value) {\n              observer.next(value);\n            },\n            error: function (e) {\n              observer.error(e);\n            },\n            complete: function () {\n              var i = subscriptions.indexOf(inner);\n              if (i >= 0) subscriptions.splice(i, 1);\n              completeIfDone();\n            }\n          });\n          subscriptions.push(inner);\n        },\n        error: function (e) {\n          observer.error(e);\n        },\n        complete: function () {\n          completeIfDone();\n        }\n      });\n\n      function completeIfDone() {\n        if (outer.closed && subscriptions.length === 0) observer.complete();\n      }\n\n      return function () {\n        subscriptions.forEach(function (s) {\n          return s.unsubscribe();\n        });\n        outer.unsubscribe();\n      };\n    });\n  };\n\n  _proto3[SymbolObservable] = function () {\n    return this;\n  };\n\n  Observable.from = function from(x) {\n    var C = typeof this === 'function' ? this : Observable;\n    if (x == null) throw new TypeError(x + ' is not an object');\n    var method = getMethod(x, SymbolObservable);\n\n    if (method) {\n      var observable = method.call(x);\n      if (Object(observable) !== observable) throw new TypeError(observable + ' is not an object');\n      if (isObservable(observable) && observable.constructor === C) return observable;\n      return new C(function (observer) {\n        return observable.subscribe(observer);\n      });\n    }\n\n    if (hasSymbol('iterator')) {\n      method = getMethod(x, SymbolIterator);\n\n      if (method) {\n        return new C(function (observer) {\n          enqueue(function () {\n            if (observer.closed) return;\n\n            for (var _iterator = _createForOfIteratorHelperLoose(method.call(x)), _step; !(_step = _iterator()).done;) {\n              var item = _step.value;\n              observer.next(item);\n              if (observer.closed) return;\n            }\n\n            observer.complete();\n          });\n        });\n      }\n    }\n\n    if (Array.isArray(x)) {\n      return new C(function (observer) {\n        enqueue(function () {\n          if (observer.closed) return;\n\n          for (var i = 0; i < x.length; ++i) {\n            observer.next(x[i]);\n            if (observer.closed) return;\n          }\n\n          observer.complete();\n        });\n      });\n    }\n\n    throw new TypeError(x + ' is not observable');\n  };\n\n  Observable.of = function of() {\n    for (var _len2 = arguments.length, items = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n      items[_key2] = arguments[_key2];\n    }\n\n    var C = typeof this === 'function' ? this : Observable;\n    return new C(function (observer) {\n      enqueue(function () {\n        if (observer.closed) return;\n\n        for (var i = 0; i < items.length; ++i) {\n          observer.next(items[i]);\n          if (observer.closed) return;\n        }\n\n        observer.complete();\n      });\n    });\n  };\n\n  _createClass(Observable, null, [{\n    key: SymbolSpecies,\n    get: function () {\n      return this;\n    }\n  }]);\n\n  return Observable;\n}();\n\nif (hasSymbols()) {\n  Object.defineProperty(Observable, Symbol('extensions'), {\n    value: {\n      symbol: SymbolObservable,\n      hostReportError: hostReportError\n    },\n    configurable: true\n  });\n}\n\nexport { Observable };\n"],"names":["adapters","logger","self","console","WebSocket","log","messages","this","enabled","push","Date","now","getTime","secondsSince","time","ConnectionMonitor","constructor","connection","visibilityDidChange","bind","reconnectAttempts","start","isRunning","startedAt","stoppedAt","startPolling","addEventListener","staleThreshold","stop","stopPolling","removeEventListener","recordPing","pingedAt","recordConnect","disconnectedAt","recordDisconnect","poll","clearTimeout","pollTimeout","setTimeout","reconnectIfStale","getPollInterval","reconnectionBackoffRate","Math","pow","min","random","connectionIsStale","refreshedAt","disconnectedRecently","reopen","document","visibilityState","isOpen","INTERNAL","message_types","welcome","disconnect","ping","confirmation","rejection","disconnect_reasons","unauthorized","invalid_request","server_restart","default_mount_path","protocols","supportedProtocols","slice","length","indexOf","Connection","consumer","open","subscriptions","monitor","disconnected","send","data","webSocket","JSON","stringify","isActive","getState","uninstallEventHandlers","url","installEventHandlers","close","allowReconnect","error","reopenDelay","getProtocol","protocol","isState","isProtocolSupported","call","states","state","readyState","toLowerCase","eventName","events","handler","prototype","message","event","identifier","reason","reconnect","type","parse","reload","confirmSubscription","notify","reject","notifyAll","willAttemptReconnect","Subscription","params","mixin","object","properties","key","value","extend","perform","action","command","unsubscribe","remove","SubscriptionGuarantor","pendingSubscriptions","guarantee","subscription","startGuaranteeing","forget","filter","s","stopGuaranteeing","retrySubscribing","retryTimeout","subscribe","map","Subscriptions","guarantor","create","channelName","channel","add","ensureActiveConnection","findAll","sendCommand","callbackName","args","undefined","Consumer","_url","test","a","createElement","href","replace","createWebSocketURL","connect","createConsumer","name","element","head","querySelector","getAttribute","getConfig","core_1","graphql_1","ActionCableLink","ApolloLink","options","super","cable","actionName","connectionParams","request","operation","_next","Observable","observer","channelId","round","toString","Object","assign","connected","query","print","variables","operationId","operationName","received","payload","_a","_b","result","errors","next","more","complete","closed","exports","__assign","t","i","n","arguments","p","hasOwnProperty","apply","docCache","Map","fragmentSourceMap","printFragmentWarnings","experimentalFragmentVariables","normalize","string","trim","processFragments","ast","seenKeys","Set","definitions","forEach","fragmentDefinition","kind","fragmentName","sourceKey","loc","source","body","substring","end","sourceKeySet","get","has","warn","set","parseDocument","cacheKey","parsed","allowLegacyFragmentVariables","Error","doc","workSet","node","keys","startToken","endToken","stripLoc","gql","literals","_i","arg","resetCaches","clear","disableFragmentWarnings","enableExperimentalFragmentVariables","disableExperimentalFragmentVariables","gql_1","extras","ApolloCache","assumeImmutableResults","getFragmentDoc","max","cache","batch","updateResult","_this","optimisticId","optimistic","performTransaction","update","recordOptimisticTransaction","transaction","transformDocument","transformForLink","identify","gc","modify","readQuery","read","rootId","id","watchFragment","latestDiff","fragment","from","diffOptions","returnPartialData","watch","immediate","callback","diff","missing","readFragment","writeQuery","write","dataId","writeFragment","updateQuery","updateFragment","globalThis","__DEV__","getMemoryInternals","MissingFieldError","_super","path","Array","isArray","__proto__","hasOwn","isNullish","defaultDataIdFromObject","context","__typename","_id","keyObject","concat","defaultConfig","dataIdFromObject","addTypename","resultCaching","canonizeResults","normalizeConfig","config","shouldCanonizeResults","getTypenameFromStoreObject","store","objectOrReference","__ref","TypeOrFieldNameRegExp","fieldNameFromStoreName","storeFieldName","match","selectionSetMatchesResult","selectionSet","every","item","selections","field","storeValueIsStoreObject","makeProcessedFieldsMerger","extractFragmentContext","fragments","fragmentMap","lookupFragment","def","lookup","DELETE","delModifier","INVALIDATE","EntityStore","policies","group","rootIds","refs","getFieldValue","maybeDeepFreeze","canRead","objOrRef","toReference","objOrIdOrRef","mergeIntoStore","ref","merge","toObject","fieldName","depend","storeObject","rootTypenamesById","Layer","parent","dependOnExistence","older","newer","existing","incoming","merged","storeObjectReconciler","caching","fieldsToDirty_1","__exists","hasKeyArgs","dirty","fields","changedFields_1","needToMerge_1","allDeleted_1","sharedDetails_1","isReference","readField","fieldNameOrOptions","fieldValue","newValue","storage","getStorage","checkReference","seenReference","someNonReference","newValue_1","delete","typename","getStoreFieldName","evict","limit","evicted","extract","obj","extraRootIds","getRootIdSet","__META","sort","newData","rest_1","retain","release","count","ids","snapshot","findChildRefIds","idsToRemove","root_1","found_1","root","workSet_1","child","makeCacheKey","keyMaker","lookupArray","CacheGroup","d","resetCaching","canUse","makeDepKey","maybeDependOnExistenceOfEntity","entityId","supportsResultCaching","Root","seed","stump","Stump","storageTrie","addLayer","layerId","replay","removeLayer","ownStoreObject","parentStoreObject","fromParent","existingObject","incomingObject","property","existingValue","incomingValue","ObjectCanon","known","WeakSet","pool","passes","WeakMap","keysByJSON","empty","admit","isKnown","pass","copy","getPrototypeOf","shallowCopy","original","array","freeze","proto_1","array_1","sortedKeys","json","firstValueIndex_1","sorted","obj_1","execSelectionSetKeyArgs","StoreReader","knownResults","compact","canon","executeSelectionSet","peekArgs","other","peek","enclosingRef","execSelectionSetImpl","resultCacheMaxSize","keyArgs","varString","executeSubSelectedArray","execSubSelectedArrayImpl","resetCanon","diffQueryAgainstStore","_c","_d","rootRef","execResult","canonicalStringify","firstMissing","isFresh","latest","objectsToMerge","missingMerger","handleMissing","resultName","rootIdsByTypename","selection","added","FRAGMENT_SPREAD","fragmentMatches","finalResult","mergeDeep","frozen","childResult","values","assertSelectionSetForIdValue","tree","_","specifierInfoCache","lookupSpecifierInfo","spec","keyFieldsFnFromSpecifier","specifier","info","keyFieldsFn","collectSpecifierPaths","schemaKeyPath","extracted","extractKeyPath","extractKey","join","keyArgsFnFromSpecifier","keyArgsFn","collected","keyPath","firstKey","firstChar","charAt","variableName","varKeyPath","directives","directiveName_1","find","directiveArgs","suffix","extractor","merger","getSpecifierPaths","reduce","toMerge","paths","paths_1","currentPath_1","reducer","argsFromFieldSpecifier","nullKeyFieldsFn","simpleKeyArgsFn","_args","mergeTrueFn","mergeObjects","mergeFalseFn","Policies","typePolicies","toBeAdded","supertypeMap","fuzzySubtypes","usingPossibleTypes","setRootTypename","possibleTypes","addPossibleTypes","addTypePolicies","partialContext","ROOT_QUERY","normalizeReadFieldOptions","policy","getTypePolicy","keyFn","specifierOrId","String","queryType","mutationType","subscriptionType","updateTypePolicy","keyFields","setMerge","getFieldPolicy","which","toUpperCase","old","supertype","getSupertypeSet","subtype","RegExp","policy_1","supertypes_1","size","regExp","fuzzy","fuzzySupertypes","rest","inbox","splice","createIfMissing","fieldPolicies","supertypeSet","typeCondition","typenameSupertypeSet","workQueue_1","maybeEnqueue_1","needToCheckFuzzySubtypes","checkingFuzzySubtypes","fuzzyString","fieldSpec","specifierOrString","readOptions","makeFieldFunctionOptions","withValue","getReadFunction","getMergeFunction","parentTypename","childTypename","runMergeFunction","makeMergeObjectsFunction","overwrite","readFieldArgs","argc","stringifyForDisplay","eType","iType","getContextFlavor","clientOnly","deferred","flavored","flavors","StoreWriter","reader","writeToStore","operationDefinition","written","incomingById","processSelectionSet","mergeTree","fieldNodeSet","entityRef","applied","applyMerges","fieldsWithSelectionSets_1","hasSelectionSet_1","childTree","Boolean","hasMergeFunction_1","existingRef","incomingObj","getChild","parentType","typeDotName","warnings","childTypenames","includes","warnAboutDataLoss","result_1","flattenFields","resultFieldKey","getChildMergeTree","processFieldValue","maybeRecycleChildMergeTree","e","dataRef","sets","previous_1","mergeMergeTrees","mergeTreeIsEmpty","cloneDeep","fieldMap","limitingTrie","flatten","inheritedContext","visitedNode","visited","dir","if","getStorageArgs","e_1","i_1","getValue_1","eVal","iVal","aVal","pop","emptyMergeTreePool","left","right","needToMergeMaps","remainingRightKeys_1","leftTree","InMemoryCache","watches","addTypenameTransform","DocumentTransform","makeVar","txCount","init","rootStore","optimisticData","resetResultCache","resetResultIdentities","previousReader","storeReader","storeWriter","maybeBroadcastWatch","c","broadcastWatch","restore","broadcast","broadcastWatches","reset","resetCache","discardWatches","Promise","resolve","removeOptimistic","idToRemove","newOptimisticData","onWatchUpdated","layer","alreadyDirty","addTypenameToDocument","addFragmentsToDocument","transform","lastDiff","fromOptimisticTransaction","cacheSlot","cacheInfoMap","getCacheInfo","vars","dep","forgetCache","rv","recallCache","attachCache","caches","listeners","oldListeners","listener","getValue","attach","onNextChange","asyncMap","observable","mapFn","catchFn","promiseQueue","then","makeCallback","examiner","both","sub","graphQLResultHasError","getGraphQLErrorsFromResult","graphQLErrors","incremental","incrementalResult","isPromiseLike","Concast","sources","addObserver","removeObserver","observers","promise","handlers","shift","obs","nextResultListeners","cancel","catch","iterable","deliverLastMessage","nextOrError","method","beforeNext","called","LocalState","client","resolvers","fragmentMatcher","selectionsToResolveCache","addResolvers","setFragmentMatcher","resolverGroup","setResolvers","getResolvers","runResolvers","remoteResult","onlyRunForcedResolvers","resolveDocument","localResult","getFragmentMatcher","clientQuery","serverQuery","prepareContext","getCacheKey","addExportedVariables","document_1","buildRootValueFromCache","exportedVariables","shouldForceResolvers","forceResolvers","Directive","enter","some","rootValue_1","rootValue","mainDefinition","selectionsToResolve","definitionOperation","defaultOperationType","execContext","collectSelectionsToResolve","resolveSelectionSet","isClientFieldDescendant","resultsToMerge","execute","resolveField","fieldResult","fragmentResult","all","aliasedFieldName","aliasUsed","defaultResult","resultPromise","resolverType","resolverMap","directive","isClientField","resolveSubSelectedArray","isSingleASTNode","collectByDefinition","definitionNode","matches_1","__","___","ancestors","FragmentSpread","spread","fragmentSelections","destructiveMethodCounts","wrapDestructiveCacheMethod","methodName","cancelNotifyTimeout","QueryInfo","queryManager","queryId","generateQueryId","lastRequestId","stopped","observableQuery","networkStatus","loading","setVariables","networkError","setObservableQuery","resetDiff","getDiff","getDiffOptions","updateWatch","oq","fetchPolicy","updateLastDiff","setDiff","oldDiff","notifyTimeout","oqListener","shouldNotify","watchOptions","watcher","lastWatch","resetLastWrite","lastWrite","shouldWrite","dmCount","markResult","cacheWriteBehavior","mergedData","hasNext","shouldWriteResult","errorPolicy","markReady","ready","markError","ignoreErrors","writeWithErrors","IGNORE","QueryManager","link","defaultOptions","documentTransform","queryDeduplication","onBroadcast","ssrMode","clientAwareness","localState","_e","defaultContext","queries","fetchCancelFns","transformCache","A","queryIdCounter","requestIdCounter","mutationIdCounter","inFlightLinkObservables","defaultDocumentTransform","mutationStore","_info","stopQueryNoBroadcast","cancelPendingFetches","mutate","mutationId","hasClientExports","mutationStoreValue","isOptimistic","mutation","optimisticResponse","updateQueries","refetchQueries","_f","awaitRefetchQueries","updateWithProxyFn","onQueryUpdated","_g","_h","keepRootFields","_j","label","generateMutationId","getDocumentInfo","getVariables","sent","markMutationOptimistic","broadcastQueries","getObservableFromLink","storeResult","markMutationResult","err","cacheWrites","skipCache","asQuery","updateQueries_1","queryName","updater","currentQueryResult","nextQueryResult","mutationResult","queryVariables","results_1","updateCache","isFinalResult","include","fetchQuery","fetchConcastWithInfo","concast","getQueryStore","resetErrors","queryInfo","cacheEntry","hasForcedResolvers","hasNonreactiveDirective","defaultVars","watchQuery","notifyOnNetworkStatusChange","ObservableQuery","pollInterval","finally","stopQuery","generateRequestId","stopQueryInStore","stopQueryInStoreNoBroadcast","clearStore","getObservableQueries","queryNamesAndDocs","legacyQueryOptions","desc","hasObservers","makeUniqueId","getQuery","included","nameOrDoc","reFetchObservableQueries","includeStandby","observableQueryPromises","resetLastResults","refetch","startGraphQLSubscription","makeObservable","hasErrors","hasProtocolErrors","protocolErrors","extensions","observablePromise_1","removeQuery","getLocalState","deduplication","inFlightLinkObservables_1","forceFetch","printedServerQuery_1","varJson_1","entry","of","getResultsFromLink","requestId","linkDocument","aqr","containsDataFromLink","defaults","normalized","fromVariables","sourcesWithInfo","fetchQueryByPolicy","cleanupCancelFn","fromLink","includedQueriesById","results","refetchWritePolicy","oldNetworkStatus","readCache","resultsFromCache","fromData","partial","resolved","resultsFromLink","newContext","hasSuggestedDevtools","ApolloClient","resetStoreCallbacks","clearStoreCallbacks","uri","credentials","headers","ssrForceFetchDelay","connectToDevTools","window","__APOLLO_CLIENT__","typeDefs","clientAwarenessName","clientAwarenessVersion","version","HttpLink","disableNetworkFetches","resetStore","devToolsHookCb","mutations","dataWithOptimisticResults","windowWithDevTools","devtoolsSymbol","Symbol","for","top","__APOLLO_DEVTOOLS_GLOBAL_HOOK__","nav","navigator","ua","userAgent","defineProperty","enumerable","configurable","mergeOptions","__actionHookForDevTools","cb","__requestRaw","fn","onResetStore","onClearStore","obsQuery","debug","serializedState","setLocalStateFragmentMatcher","setLink","newLink","equalByQuery","aData","aRest","bData","bRest","equalBySelectionSet","aResult","bResult","seenSelections","selectionHasNonreactiveDirective","resultKey","aResultChild","bResultChild","childSelectionSet","aChildIsArray","bChildIsArray","length_1","directiveIsNonreactive","subObserver","_subscription","_observer","defaultSubscriptionObserverErrorCallback","first","last","reobserve","tearDownQuery","waitForOwnResult","skipCacheDataFor","isTornDown","defaultFetchPolicy","initialFetchPolicy","opDef","lastQuery","getCurrentResult","saveAsLastResult","lastResult","getLastResult","partialRefetch","logMissingFieldErrors","updateLastResult","isDifferentFromLastResult","newResult","getLast","variablesMustMatch","getLastError","resetQueryStoreErrors","reobserveOptions","queryDef","variableDefinitions","v","variable","fetchMore","fetchMoreOptions","combinedOptions","qid","originalNetworkStatus","observe","updatedQuerySet","fetchMoreResult","previous","reobserveCacheFirst","subscribeToMore","subscriptionData","onError","setOptions","newOptions","silentSetOptions","mergedOptions","updatePolling","applyNextFetchPolicy","nextFetchPolicy","fetch","newNetworkStatus","pollingInfo","interval","maybeFetch","skipPollAttempt","timeout","reobserveAsConcast","useDisposableConcast","oldVariables","oldFetchPolicy","finishWaitingForOwnResult","reportResult","reportError","resubscribeAfterError","lastError","isDifferent","errorResult","currentFetchPolicy","stack","Cache","createSignalIfSupported","AbortController","controller","signal","toPromise","completed","fromPromise","OperationBatcher","batchDebounce","batchInterval","batchMax","batchHandler","batchKey","batchesByKey","scheduledBatchTimerByKey","enqueueRequest","requestCopy","subscribers","isFirstEnqueuedRequest","isFirstSubscriber","scheduleQueueConsumption","consumeQueue","operations","forwards","observables","nexts","completes","forward","batchedObservable","rejecters","index","BatchLink","fetchParams","batcher","BatchHttpLink","fetcher","includeExtensions","preserveHeaderCase","includeUnusedVariables","requestOptions","checkFetcher","linkConfig","http","fetchOptions","getContext","contextConfig","selectURI","chosenURI","clientAwarenessHeaders","name_1","fromError","optsAndBody","selectHttpOptionsAndBody","filterOperationVariables","loadedBody","serializeFetchParameter","parseError","response","setContext","parseAndCheckHttpResponse","abort","passthrough","op","toLink","isTerminating","links","x","y","split","ret","leftLink","rightLink","starting","createOperation","transformedOperation","transformOperation","OPERATION_FIELDS","validateOperation","second","firstLink","nextLink","setOnError","errorHandler","retriedSub","retriedResult","ErrorLink","backupFetch","createHttpLink","linkOptions","preferredFetch","useGETForQueries","contextHeaders","transformedQuery","isSubscription","hasDefer","acceptHeader","accept","newURI","currentFetch","observerNext","ctype","nodeStreamIterator","stream","cleanup","done","waiting","onData","chunk","shiftedArr","pair","onEnd","removeListener","on","iterator","asyncIterator","readerIterator","responseIterator","isAsyncIterableIterator","getReader","isReadableStream","isStreamableBlob","arrayBuffer","isBlob","promiseIterator","pipe","isNodeReadableStream","readMultipartBody","nextValue","decoder","contentType","delimiter","boundaryVal","boundary","buffer","running","searchFrom","bi","contentType_1","TextDecoder","decode","parseHeaders","parseJsonBody","headerText","headersInit","line","bodyText","status","throwServerError","getResult","statusCode","handleError","text","rewriteURIForGET","queryParams","addQueryParam","encodeURIComponent","serializedVariables","serializedExtensions","preFragment","fragmentStart","substr","queryParamsPrefix","fallbackHttpConfig","includeQuery","defaultPrinter","printer","fallbackConfig","configs","unshift","selectHttpOptionsAndBodyInternal","normalizedHeaders_1","headerData","originalName","normalizedHeaders","removeDuplicateHeaders","fallbackURI","contextURI","serialized","unusedNames","Variable","_key","errorValue","sortingMap","stableObjectReplacer","proto","everyKeyInOrder","unsortedKey","sortedKey","sortedObject_1","cloneDeepHelper","val","seen","copy_1","copy_2","isExecutionPatchIncrementalResult","isExecutionPatchResult","isExecutionPatchInitialResult","isApolloPayloadResult","mergeIncrementalData","prevResult","parent_1","isNaN","mergeDeepArray","target","DeepMerger","defaultReconciler","reconciler","isObject","pastCopies","targetValue","shallowCopyForMerge","identity","resultCache","cached","predicate","stableCacheKeys_1","performWork","cacheKeys","transformedDocument","otherTransform","shouldInclude","isInclusionDirective","directiveArguments","directiveName","ifArgument","ifValue","getInclusionDirectives","evaledValue","hasDirectives","names","nameSet","uniqueCount","getFragmentQueryDocument","actualFragmentName","definition","createFragmentMap","symTable","getFragmentFromSelection","checkDocument","getOperationDefinition","getOperationName","getFragmentDefinitions","getQueryDefinition","getFragmentDefinition","fragmentDef","getMainDefinition","queryDoc","getDefaultValues","defaultValues","defs","defaultValue","printCache","makeReference","isDocumentNode","valueToObjectRepresentation","argObj","isIntValue","isFloatValue","Number","isBooleanValue","isStringValue","isObjectValue","nestedArgObj_1","isVariable","variableValue","isListValue","listValue","nestedArgArrayObj","isEnumValue","isNullValue","storeKeyNameFromField","directivesObj","getStoreKeyName","KNOWN_DIRECTIVES","storeKeyNameStringify","filterKeys","filteredArgs_1","completeFieldName","stringifiedArgs","setStringify","argumentsObjectFromField","argObj_1","resultKeyNameFromField","alias","getTypenameFromResult","isField","fragments_1","isInlineFragment","TYPENAME_FIELD","FIELD","NAME","isEmpty","nullIfDocIsEmpty","getDirectiveMatcher","tests","testConfig","makeInUseGetterFunction","defaultKey","inUse","fragmentSpreads","removeDirectivesFromDocument","getInUseByOperationName","getInUseByFragmentName","getInUse","ancestor","OPERATION_DEFINITION","FRAGMENT_DEFINITION","operationCount","directiveMatcher","shouldRemoveField","nodeDirectives","originalFragmentDefsByPath","firstVisitMadeChanges","fieldOrInlineFragmentVisitor","docWithoutDirectiveSubtrees","Field","InlineFragment","VariableDefinition","_parent","_path","FragmentDefinition","leave","removed","populateTransitiveVars","transitiveVars","childFragmentName","varName","allFragmentNamesUsed","enterVisitor","OperationDefinition","usedVariableNames_1","varDef","SelectionSet","lastIndexOf","buildQueryFromSelectionSet","removeClientSetsFromDocument","iterateObserversSafely","argument","observersWithMethod","fixObservableSubclass","subclass","species","defaultMakeData","Trie","weakness","makeData","getChildTrie","peekArray","len","mapFor","removeArray","weak","strong","isObjRef","_typeof","ownKeys","enumerableOnly","getOwnPropertySymbols","symbols","sym","getOwnPropertyDescriptor","_defineProperty","writable","_defineProperties","props","descriptor","_possibleConstructorReturn","_assertThisInitialized","ReferenceError","_wrapNativeSuper","Class","_cache","Function","TypeError","Wrapper","_construct","_getPrototypeOf","_setPrototypeOf","Parent","_isNativeReflectConstruct","Reflect","construct","instance","sham","Proxy","o","setPrototypeOf","GraphQLError","_Error","subClass","superClass","_inherits","Derived","hasNativeReflectConstruct","Constructor","protoProps","staticProps","Super","NewTarget","nodes","positions","originalError","_nodeLocations","_nodeLocations2","_nodeLocations3","_classCallCheck","undefinedIfEmpty","nodeLocations","_i2","_ref3","_this$nodes","locations","pos","g","originalExtensions","getOwnPropertyDescriptors","defineProperties","_objectSpread","captureStackTrace","printError","output","_i4","_error$nodes2","_i6","_error$locations2","location","syntaxError","position","description","versionInfo","major","minor","patch","preReleaseTag","isPromise","list","locatedError","rawOriginalError","_nodes","inspect","NAME_RX","assertValidName","isValidNameError","devAssert","entries","keyMap","mapValue","_objectEntries2","_ref2","_value","toObjMap","keyValMap","valFn","MAX_SUGGESTIONS","didYouMean","firstArg","secondArg","_ref","subMessage","suggestions","selected","lastItem","identityFunc","naturalCompare","aStr","bStr","aIdx","bIdx","aChar","charCodeAt","bChar","isDigit","aNum","DIGIT_0","bNum","DIGIT_9","code","suggestionList","input","optionsByDistance","lexicalDistance","LexicalDistance","threshold","floor","option","distance","measure","b","distanceDiff","_input","_inputLowerCase","_inputArray","stringToArray","_rows","fill","optionLowerCase","tmp","aLength","bLength","rows","j","upRow","currentRow","smallestCell","cost","currentCell","doubleDiagonalCell","str","strLength","valueFromASTUntyped","valueNode","NULL","INT","parseInt","FLOAT","parseFloat","STRING","ENUM","BOOLEAN","LIST","OBJECT","VARIABLE","invariant","_createClass","isType","isScalarType","isObjectType","isInterfaceType","isUnionType","isEnumType","isInputObjectType","isListType","isNonNullType","assertType","instanceOf","GraphQLScalarType","assertScalarType","GraphQLObjectType","assertObjectType","GraphQLInterfaceType","assertInterfaceType","GraphQLUnionType","assertUnionType","GraphQLEnumType","assertEnumType","GraphQLInputObjectType","assertInputObjectType","GraphQLList","assertListType","GraphQLNonNull","assertNonNullType","isInputType","isWrappingType","ofType","assertInputType","isOutputType","assertOutputType","isLeafType","assertLeafType","isCompositeType","assertCompositeType","isAbstractType","assertAbstractType","assertNullableType","assertWrappingType","isNullableType","getNullableType","isNamedType","assertNamedType","getNamedType","unwrappedType","resolveThunk","thunk","undefineIfEmpty","arr","toJSON","defineInspect","_config$parseValue","_config$serialize","_config$parseLiteral","parseValue","specifiedByUrl","serialize","parseLiteral","astNode","extensionASTNodes","_proto","toConfig","_this$extensionASTNod","isTypeOf","_fields","defineFieldMap","_interfaces","defineInterfaces","_proto2","getFields","getInterfaces","interfaces","fieldsToFieldsConfig","_resolveThunk","isPlainObj","fieldConfig","_fieldConfig$args","argsConfig","argName","argConfig","deprecationReason","isDeprecated","isObjectLike","argsToArgsConfig","isRequiredArgument","resolveType","_proto3","_this$extensionASTNod2","_types","defineTypes","_proto4","getTypes","_this$extensionASTNod3","types","typeName","valueMap","_values","valueName","valueConfig","_valueLookup","enumValue","_nameLookup","_proto5","getValues","outputValue","inputValue","valueStr","didYouMeanEnumValue","_variables","_valueStr","_this$extensionASTNod4","enumType","unknownValueStr","defineInputFieldMap","_proto6","_this$extensionASTNod5","isRequiredInputField","isEqualType","typeA","typeB","isTypeSubTypeOf","schema","maybeSubType","superType","isSubType","doTypesOverlap","getPossibleTypes","thisArg","iteratorMethod","step","_result","isFinite","safeArrayFrom","collection","isInteger","MAX_INT","MIN_INT","GraphQLInt","coercedValue","serializeObject","num","GraphQLFloat","valueOf","valueOfResult","GraphQLString","GraphQLBoolean","GraphQLID","specifiedScalarTypes","isSpecifiedScalarType","astFromValue","astValue","itemType","items","valuesNodes","itemNode","fieldNodes","_objectValues2","OBJECT_FIELD","stringNum","integerStringRegExp","__Schema","__Type","getTypeMap","getQueryType","getMutationType","getSubscriptionType","__Directive","getDirectives","isRepeatable","__DirectiveLocation","__InputValue","includeDeprecated","QUERY","MUTATION","SUBSCRIPTION","INLINE_FRAGMENT","VARIABLE_DEFINITION","SCHEMA","SCALAR","FIELD_DEFINITION","ARGUMENT_DEFINITION","INTERFACE","UNION","ENUM_VALUE","INPUT_OBJECT","INPUT_FIELD_DEFINITION","__TypeKind","TypeKind","NON_NULL","__Field","_context","enumValues","__EnumValue","_ref4","inputFields","_ref5","_ref6","valueAST","SchemaMetaFieldDef","_source","_ref7","TypeMetaFieldDef","_ref8","_ref9","getType","TypeNameMetaFieldDef","_ref10","introspectionTypes","isIntrospectionType","_ref11","isDirective","GraphQLDirective","assertDirective","_config$isRepeatable","_config$args","GraphQLIncludeDirective","GraphQLSkipDirective","DEFAULT_DEPRECATION_REASON","GraphQLDeprecatedDirective","GraphQLSpecifiedByDirective","specifiedDirectives","isSpecifiedDirective","isSchema","GraphQLSchema","assertSchema","_config$directives","__validationErrors","assumeValid","_queryType","_mutationType","_subscriptionType","_directives","allReferencedTypes","_config$types2","collectReferencedTypes","_this$_directives2","_directive$args2","_typeMap","_subTypeMap","_implementationsMap","_i8","_arrayFrom2","namedType","_i10","_namedType$getInterfa2","iface","implementations","objects","_i12","_namedType$getInterfa4","_iface","_implementations","abstractType","getImplementations","interfaceType","isPossibleType","possibleType","_i14","_abstractType$getType2","_i16","_implementations$obje2","_i18","_implementations$inte2","getDirective","typeSet","_i20","_namedType$getTypes2","_i22","_namedType$getInterfa6","_i24","_i26","_field$args2","_i28","_objectValues4","validateSchema","SchemaValidationContext","_getOperationTypeNode","getOperationTypeNode","_getOperationTypeNode2","_getOperationTypeNode3","validateRootTypes","_context$schema$getDi2","validateName","_arg$astNode","getDeprecatedDirectiveNode","validateDirectives","validateInputObjectCircularRefs","visitedTypes","fieldPath","fieldPathIndexByTypeName","detectCycleRecursive","inputObj","_i30","fieldType","cycleIndex","cyclePath","pathStr","fieldObj","createInputObjectCircularRefsValidator","typeMap","validateFields","validateInterfaces","validateUnionMembers","validateEnumValues","validateInputFields","validateTypes","getErrors","assertValidSchema","_errors","addError","operationNodes","getAllSubNodes","operationTypes","getAllNodes","_field$astNode","_arg$astNode2","_arg$astNode3","ifaceTypeNames","_type$getInterfaces2","getAllImplementsInterfaceNodes","validateTypeImplementsAncestors","validateTypeImplementsInterface","typeFieldMap","ifaceField","typeField","_ifaceField$astNode","_typeField$astNode","_loop","_ifaceField$args2","_ifaceArg$astNode","_typeArg$astNode","ifaceArg","typeArg","_loop2","_typeField$args2","ifaceInterfaces","_iface$getInterfaces2","transitive","union","memberTypes","includedTypeNames","memberType","getUnionMemberTypeNodes","_field$astNode2","_field$astNode3","getter","subNodes","_i32","_getAllNodes2","_getter","typeNode","ifaceNode","unionNode","_definitionNode$direc","typeFromAST","innerType","LIST_TYPE","NON_NULL_TYPE","NAMED_TYPE","TypeInfo","getFieldDefFn","initialType","_schema","_typeStack","_parentTypeStack","_inputTypeStack","_fieldDefStack","_defaultValueStack","_directive","_argument","_enumValue","_getFieldDef","getFieldDef","getParentType","getInputType","getParentInputType","getDefaultValue","getArgument","getEnumValue","SELECTION_SET","fieldDef","DIRECTIVE","typeConditionAST","outputType","inputType","ARGUMENT","_this$getDirective","argDef","argType","fieldOrDirective","listType","inputFieldType","inputField","objectType","fieldNode","visitWithTypeInfo","typeInfo","visitor","ExecutableDefinitionsRule","Document","_node$definitions2","defName","SCHEMA_DEFINITION","SCHEMA_EXTENSION","UniqueOperationNamesRule","knownOperationNames","LoneAnonymousOperationRule","SingleFieldSubscriptionsRule","KnownTypeNamesRule","getSchema","existingTypesMap","definedTypes","_context$getDocument$2","getDocument","typeNames","NamedType","_1","_2","_ancestors$","isSDL","standardTypeNames","isStandardTypeName","suggestedTypes","FragmentsOnCompositeTypesRule","typeStr","VariablesAreInputTypesRule","ScalarLeafsRule","_fieldName","_typeStr","FieldsOnCorrectTypeRule","suggestion","usageCount","_schema$getPossibleTy2","_possibleType$getInte2","_usageCount$possibleI","possibleInterface","usageCountDiff","getSuggestedTypeNames","getSuggestedFieldNames","UniqueFragmentNamesRule","knownFragmentNames","KnownFragmentNamesRule","getFragment","NoUnusedFragmentsRule","operationDefs","fragmentDefs","fragmentNameUsed","_context$getRecursive2","getRecursivelyReferencedFragments","fragName","PossibleFragmentSpreadsRule","fragType","parentTypeStr","fragTypeStr","frag","getFragmentType","NoFragmentCyclesRule","visitedFrags","spreadPath","spreadPathIndexByName","spreadNodes","getFragmentSpreads","spreadNode","spreadName","spreadFragment","viaPath","UniqueVariableNamesRule","knownVariableNames","NoUndefinedVariablesRule","variableNameDefined","usages","getRecursiveVariableUsages","NoUnusedVariablesRule","variableDefs","variableNameUsed","_variableDefs2","variableDef","KnownDirectivesRule","locationsMap","definedDirectives","astDefinitions","DIRECTIVE_DEFINITION","candidateLocation","appliedTo","getDirectiveLocationForOperation","SCALAR_TYPE_DEFINITION","SCALAR_TYPE_EXTENSION","OBJECT_TYPE_DEFINITION","OBJECT_TYPE_EXTENSION","INTERFACE_TYPE_DEFINITION","INTERFACE_TYPE_EXTENSION","UNION_TYPE_DEFINITION","UNION_TYPE_EXTENSION","ENUM_TYPE_DEFINITION","ENUM_TYPE_EXTENSION","ENUM_VALUE_DEFINITION","INPUT_OBJECT_TYPE_DEFINITION","INPUT_OBJECT_TYPE_EXTENSION","INPUT_VALUE_DEFINITION","getDirectiveLocationForASTPath","UniqueDirectivesPerLocationRule","uniqueDirectiveMap","repeatable","schemaDirectives","typeDirectivesMap","seenDirectives","_node$directives2","KnownArgumentNamesRule","KnownArgumentNamesOnDirectivesRule","Argument","argNode","_def$arguments","argsNodes","directiveNode","knownArgs","_directiveNode$argume2","UniqueArgumentNamesRule","knownArgNames","ValuesOfCorrectTypeRule","ListValue","isValidValueNode","ObjectValue","fieldNodeMap","ObjectField","NullValue","EnumValue","IntValue","FloatValue","StringValue","BooleanValue","locationType","_typeStr2","ProvidedRequiredArgumentsRule","ProvidedRequiredArgumentsOnDirectivesRule","_fieldNode$arguments","argNodeMap","_fieldDef$args2","argTypeStr","requiredArgsMap","argNodes","isRequiredArgumentNode","requiredArgs","_directiveNode$argume","_Object$keys2","VariablesInAllowedPositionRule","varDefMap","varType","allowedVariableUsage","varTypeStr","varDefaultValue","locationDefaultValue","reasonMessage","responseName","subReason","OverlappingFieldsCanBeMergedRule","comparedFragmentPairs","PairSet","cachedFieldsAndFragmentNames","conflicts","_getFieldsAndFragment","getFieldsAndFragmentNames","fragmentNames","_i5","conflict","findConflict","collectConflictsWithin","collectConflictsBetweenFieldsAndFragment","collectConflictsBetweenFragments","findConflictsWithinSelectionSet","_ref2$","fields1","fields2","reasonMsg","areMutuallyExclusive","_getReferencedFieldsA","getReferencedFieldsAndFragmentNames","fieldMap2","fragmentNames2","collectConflictsBetween","fragmentName1","fragmentName2","fragment1","fragment2","_getReferencedFieldsA2","fieldMap1","fragmentNames1","_getReferencedFieldsA3","parentFieldsAreMutuallyExclusive","_i7","field1","field2","parentType1","node1","def1","parentType2","node2","def2","_node1$arguments","_node2$arguments","name1","name2","arguments1","arguments2","argument1","value1","value2","argument2","sameArguments","type1","type2","doTypesConflict","selectionSet1","selectionSet2","_getFieldsAndFragment2","_getFieldsAndFragment3","_i3","findConflictsBetweenSubSelectionSets","allFields","subfieldConflicts","nodeAndDefs","_collectFieldsAndFragmentNames","fragmentType","_i9","_selectionSet$selecti2","inlineFragmentType","_defKindToExtKind","_data","_pairSetAdd","UniqueInputFieldNamesRule","knownNameStack","knownNames","LoneSchemaDefinitionRule","_oldSchema$astNode","oldSchema","alreadyDefined","schemaDefinitionsCount","SchemaDefinition","UniqueOperationTypesRule","definedOperationTypes","existingOperationTypes","checkOperationTypes","SchemaExtension","_node$operationTypes","operationTypesNodes","operationType","alreadyDefinedOperationType","UniqueTypeNamesRule","knownTypeNames","ScalarTypeDefinition","checkTypeName","ObjectTypeDefinition","InterfaceTypeDefinition","UnionTypeDefinition","EnumTypeDefinition","InputObjectTypeDefinition","UniqueEnumValueNamesRule","existingTypeMap","knownValueNames","checkValueUniqueness","EnumTypeExtension","_node$values","valueNodes","valueNames","valueDef","existingType","UniqueFieldDefinitionNamesRule","knownFieldNames","checkFieldUniqueness","InputObjectTypeExtension","InterfaceTypeExtension","ObjectTypeExtension","_node$fields","fieldNames","hasField","UniqueDirectiveNamesRule","knownDirectiveNames","DirectiveDefinition","PossibleTypeExtensionsRule","ScalarTypeExtension","checkExtension","UnionTypeExtension","expectedKind","defNode","defKindToExtKind","typeToExtKind","kindStr","extensionKindToTypeName","allTypeNames","specifiedRules","specifiedSDLRules","_inheritsLoose","ASTValidationContext","_ast","_fragments","_fragmentSpreads","_recursivelyReferencedFragments","_onError","frags","statement","spreads","setsToVisit","_set$selections2","collectedNames","nodesToVisit","_this$getFragmentSpre2","SDLValidationContext","_ASTValidationContext","ValidationContext","_ASTValidationContext2","_this2","_typeInfo","_variableUsages","_recursiveVariableUsages","getVariableUsages","newUsages","_this$getRecursivelyR2","validate","documentAST","rules","maxErrors","abortObj","rule","validateSDL","schemaToExtend","visitors","addPath","prev","pathToArray","flattened","curr","reverse","getOperationRootType","printPathArray","valueFromAST","coercedValues","_valueNode$values2","isMissingVariable","itemValue","coercedObj","_error","coerceInputValue","coerceInputValueImpl","defaultOnError","invalidValue","errorPrefix","coercedList","itemPath","fieldDefs","parseResult","getVariableValues","varDefNodes","inputs","coerced","varDefNode","_varTypeStr","_varTypeStr2","prefix","coerceVariableValues","getArgumentValues","variableValues","_node$arguments","_def$args2","argumentNode","isNull","getDirectiveValues","directiveDef","prop","argsOrSchema","contextValue","fieldResolver","typeResolver","executeImpl","executeSync","assertValidExecutionArguments","exeContext","buildExecutionContext","collectFields","sourceValue","resolvedResult","initialValue","executeFieldsSerially","executeFields","executeOperation","buildResponse","rawVariableValues","_definition$name","_operation$variableDe","_document$definitions2","coercedVariableValues","defaultFieldResolver","defaultTypeResolver","valuesAndPromises","containsPromise","resolvedObject","runtimeType","visitedFragmentNames","shouldIncludeNode","doesFragmentConditionMatch","skip","typeConditionNode","conditionalType","_fieldDef$resolve","returnType","resolveFn","buildResolveInfo","completeValue","rawError","handleFieldError","completedResults","completedItem","completeListValue","serializedResult","completeLeafValue","_returnType$resolveTy","resolveTypeFn","resolvedRuntimeType","completeObjectValue","ensureValidRuntimeType","completeAbstractValue","runtimeTypeOrName","runtimeTypeName","resolvedIsTypeOf","invalidReturnTypeError","collectAndExecuteSubfields","collectSubfields","cache0","subFieldNodes","a1","a2","a3","cache2","cache1","cachedValue","promisedIsTypeOfResults","isTypeOfResult","isTypeOfResults","graphql","_arguments","graphqlImpl","graphqlSync","schemaValidationErrors","validationErrors","isAsyncIterable","maybeAsyncIterable","mapAsyncIterator","rejectCallback","$return","abruptClose","mapReject","mapResult","asyncMapValue","iteratorResult","return","rethrow","throw","subscribeFieldResolver","subscribeImpl","reportGraphQLError","sourcePromise","createSourceEventStream","mapSourceToResponse","resultOrStream","resolveResult","_fieldDef$subscribe","eventStream","executeSubscription","NoDeprecatedCustomRule","inputObjectDef","inputFieldDef","enumValueDef","enumTypeDef","NoSchemaIntrospectionCustomRule","formatError","_error$message","getIntrospectionQuery","optionsWithDefault","descriptions","directiveIsRepeatable","schemaDescription","inputValueDeprecation","inputDeprecation","getOperationAST","_documentAST$definiti2","introspectionFromSchema","optionsWithDefaults","buildClientSchema","introspection","__schema","schemaIntrospection","typeIntrospection","scalarIntrospection","objectIntrospection","buildImplementationsList","buildFieldDefMap","interfaceIntrospection","unionIntrospection","unionIntrospectionStr","getObjectType","buildUnionDef","enumIntrospection","enumIntrospectionStr","valueIntrospection","buildEnumDef","inputObjectIntrospection","inputObjectIntrospectionStr","buildInputValueDefMap","buildInputObjectDef","buildType","stdType","directiveIntrospection","directiveIntrospectionStr","_directiveIntrospectionStr","typeRef","itemRef","nullableRef","getInterfaceType","implementingIntrospection","implementingIntrospectionStr","fieldIntrospection","buildField","fieldIntrospectionStr","inputValueIntrospections","buildInputValue","inputValueIntrospection","extendSchema","DOCUMENT","assumeValidSDL","assertValidSDLExtension","schemaConfig","extendedConfig","extendSchemaImpl","_schemaDef","_schemaDef$descriptio","_schemaDef2","_options$assumeValid","schemaDef","typeExtensionsMap","directiveDefs","schemaExtensions","extendedTypeName","existingTypeExtensions","_schemaConfig$types2","extendNamedType","_stdTypeMap$name","stdTypeMap","replaceNamedType","getOperationTypes","extendArg","getDescription","buildArgumentMap","replaceType","_typeExtensionsMap$co2","_getSpecifiedByUrl","getSpecifiedByUrl","extendScalarType","_typeExtensionsMap$co3","buildInterfaces","extendField","buildFieldMap","extendObjectType","_typeExtensionsMap$co4","extendInterfaceType","_typeExtensionsMap$co5","buildUnionTypes","extendUnionType","_typeExtensionsMap$ty","buildEnumValueMap","extendEnumType","_typeExtensionsMap$co","buildInputFieldMap","extendInputObjectType","opTypes","_stdTypeMap$name2","getWrappedType","fieldConfigMap","nodeFields","getDeprecationReason","argConfigMap","inputFieldMap","_node$fields2","fieldsNodes","enumValueMap","_node$interfaces","interfacesNodes","_node$types","typeNodes","_i34","_typeExtensionsMap$na","extensionNodes","allNodes","_extensionASTNodes","_allNodes","_extensionASTNodes2","_allNodes2","_extensionASTNodes3","_allNodes3","_extensionASTNodes4","_extensionASTNodes5","_allNodes4","deprecated","specifiedBy","commentDescriptions","rawValue","comments","token","COMMENT","getLeadingCommentBlock","buildASTSchema","assertValidSDL","stdDirective","buildSchema","noLocation","allowLegacySDLEmptyFields","allowLegacySDLImplementsInterfaces","lexicographicSortSchema","sortByName","sortTypes","sortFields","_config","_config2","_config3","sortObjMap","_config4","sortBy","sortArgs","replaceMaybeType","maybeType","fieldsMap","sortValueFn","sortedMap","mapToKey","obj1","obj2","printSchema","printFilteredSchema","isDefinedType","printIntrospectionSchema","directiveFilter","typeFilter","printSchemaDefinition","printDescription","printArgs","printDirective","printType","isSchemaOfCommonNames","scalar","urlAST","printSpecifiedByUrl","printScalar","printImplementedInterfaces","printFields","printObject","printInterface","printUnion","printDeprecated","printBlock","printEnum","f","printInputValue","printInputObject","indentation","defaultAST","argDecl","reasonAST","firstInBlock","comment","printDescriptionWithComments","preferMultipleLines","concatAST","documents","separateOperations","depGraph","collectDependencies","separatedDocumentASTs","dependencies","_collectDependencies2","collectTransitiveDependencies","fromName","immediateDeps","stripIgnoredCharacters","sourceObj","lexer","strippedBody","wasLastAddedTokenNonPunctuator","advance","EOF","currentToken","tokenKind","isNonPunctuator","SPREAD","tokenBody","BLOCK_STRING","dedentBlockString","blockStr","rawStr","lastChar","BreakingChangeType","TYPE_REMOVED","TYPE_CHANGED_KIND","TYPE_REMOVED_FROM_UNION","VALUE_REMOVED_FROM_ENUM","REQUIRED_INPUT_FIELD_ADDED","IMPLEMENTED_INTERFACE_REMOVED","FIELD_REMOVED","FIELD_CHANGED_KIND","REQUIRED_ARG_ADDED","ARG_REMOVED","ARG_CHANGED_KIND","DIRECTIVE_REMOVED","DIRECTIVE_ARG_REMOVED","REQUIRED_DIRECTIVE_ARG_ADDED","DIRECTIVE_REPEATABLE_REMOVED","DIRECTIVE_LOCATION_REMOVED","DangerousChangeType","VALUE_ADDED_TO_ENUM","TYPE_ADDED_TO_UNION","OPTIONAL_INPUT_FIELD_ADDED","OPTIONAL_ARG_ADDED","IMPLEMENTED_INTERFACE_ADDED","ARG_DEFAULT_VALUE_CHANGE","findBreakingChanges","newSchema","findSchemaChanges","change","findDangerousChanges","schemaChanges","typesDiff","_typesDiff$removed2","oldType","_typesDiff$persisted2","persisted","_oldType","newType","findEnumTypeChanges","findUnionTypeChanges","findInputObjectTypeChanges","findFieldChanges","findImplementedInterfacesChanges","typeKindName","findTypeChanges","directivesDiff","_directivesDiff$remov2","oldDirective","_directivesDiff$persi2","_oldDirective","newDirective","argsDiff","_argsDiff$added2","newArg","_argsDiff$removed2","oldArg","_oldDirective$locatio2","findDirectiveChanges","fieldsDiff","_fieldsDiff$added2","newField","_fieldsDiff$removed2","oldField","_fieldsDiff$persisted2","_oldField","_newField","isChangeSafeForInputObjectFieldOrFieldArg","possibleTypesDiff","_possibleTypesDiff$ad2","newPossibleType","_possibleTypesDiff$re2","oldPossibleType","valuesDiff","_valuesDiff$added2","_valuesDiff$removed2","oldValue","interfacesDiff","_interfacesDiff$added2","newInterface","_interfacesDiff$remov2","oldInterface","_fieldsDiff$removed4","_i36","_fieldsDiff$persisted4","_oldField2","findArgChanges","isChangeSafeForObjectOrInterfaceField","_i38","_argsDiff$removed4","_i40","_argsDiff$persisted2","_oldArg","oldValueStr","stringifyValue","newValueStr","_i42","_argsDiff$added4","_newArg","sortedAST","objectNode","fieldA","fieldB","oldArray","newArray","oldMap","newMap","_ref12","_i44","oldItem","newItem","_i46","_newItem","findDeprecatedUsages","classObject","condition","MAX_ARRAY_LENGTH","MAX_RECURSIVE_DEPTH","formatValue","seenValues","previouslySeenValues","customInspectFn","getCustomFn","customValue","remaining","formatArray","tag","getObjectTag","formatObject","formatObjectValue","nodejsCustomInspectSymbol","Location","Token","column","isNode","maybeNode","dedentBlockStringValue","rawString","lines","commonIndent","getBlockStringIndentation","startLine","isBlank","endLine","_commonIndent","isFirstLine","isEmptyLine","indent","printBlockString","isSingleLine","hasLeadingSpace","hasTrailingQuote","hasTrailingSlash","printAsMultipleLines","DirectiveLocation","Kind","OPERATION_TYPE_DEFINITION","Lexer","startOfFileToken","SOF","lastToken","lineStart","lookahead","_token$next","readToken","isPunctuatorTokenKind","BANG","DOLLAR","AMP","PAREN_L","PAREN_R","COLON","EQUALS","AT","BRACKET_L","BRACKET_R","BRACE_L","PIPE","BRACE_R","printCharCode","fromCharCode","bodyLength","_line","_col","readComment","readBlockString","readString","readNumber","readName","unexpectedCharacterMessage","col","firstCode","isFloat","readDigits","isNameStart","chunkStart","charCode","char2hex","invalidSequence","getLocation","lineRegexp","exec","Parser","parser","expectToken","parseValueLiteral","parseType","parseTypeReference","_lexer","_options","parseName","many","parseDefinition","parseOperationDefinition","parseFragmentDefinition","parseTypeSystemDefinition","parseTypeSystemExtension","peekDescription","unexpected","parseSelectionSet","parseOperationType","parseVariableDefinitions","parseDirectives","operationToken","optionalMany","parseVariableDefinition","parseVariable","expectOptionalToken","parseSelection","parseFragment","parseField","nameOrAlias","parseArguments","isConst","parseConstArgument","parseArgument","hasTypeCondition","expectOptionalKeyword","parseFragmentName","parseNamedType","_this$_options","expectKeyword","parseList","parseObject","parseStringLiteral","block","any","parseObjectField","parseDirective","keywordToken","parseSchemaDefinition","parseScalarTypeDefinition","parseObjectTypeDefinition","parseInterfaceTypeDefinition","parseUnionTypeDefinition","parseEnumTypeDefinition","parseInputObjectTypeDefinition","parseDirectiveDefinition","parseDescription","parseOperationTypeDefinition","parseImplementsInterfaces","parseFieldsDefinition","_this$_options2","delimitedMany","_this$_options3","parseFieldDefinition","parseArgumentDefs","parseInputValueDef","parseUnionMemberTypes","parseEnumValuesDefinition","parseEnumValueDefinition","parseInputFieldsDefinition","parseSchemaExtension","parseScalarTypeExtension","parseObjectTypeExtension","parseInterfaceTypeExtension","parseUnionTypeExtension","parseEnumTypeExtension","parseInputObjectTypeExtension","parseDirectiveLocations","parseDirectiveLocation","_this$_options4","getTokenKindDesc","getTokenDesc","atToken","openKind","parseFn","closeKind","delimiterKind","isDefinitionNode","isExecutableDefinitionNode","isTypeSystemDefinitionNode","isTypeSystemExtensionNode","isSelectionNode","isValueNode","isTypeNode","isTypeDefinitionNode","isTypeExtensionNode","printLocation","printSourceLocation","sourceLocation","firstLineColumnOffset","locationOffset","whitespace","lineIndex","lineOffset","lineNum","columnOffset","columnNum","locationStr","locationLine","subLineIndex","subLineColumnNum","subLines","printPrefixedLines","subLine","existingLines","padLen","printDocASTReducer","Name","varDefs","wrap","argsLine","_ref13","_ref14","_ref15","_ref16","_ref17","ListType","_ref18","NonNullType","_ref19","addDescription","_ref20","OperationTypeDefinition","_ref21","_ref22","_ref23","FieldDefinition","_ref24","hasMultilineItems","InputValueDefinition","_ref25","_ref26","_ref27","_ref28","EnumValueDefinition","_ref29","_ref30","_ref31","_ref32","_ref33","_ref34","_ref35","_ref36","_ref37","_ref38","maybeArray","_maybeArray$filter$jo","separator","maybeString","isMultiline","Source","isSource","TokenKind","QueryDocumentKeys","BREAK","visit","visitorKeys","inArray","edits","newRoot","isLeaving","isEdited","clone","k","editOffset","ii","editKey","editValue","_visitorKeys$node$kin","visitFn","getVisitFn","visitInParallel","skipping","kindVisitor","kindSpecificVisitor","specificVisitor","specificKindVisitor","SYMBOL_ITERATOR","SYMBOL_ASYNC_ITERATOR","SYMBOL_TO_STRING_TAG","toStringTag","currentContext","MISSING_VALUE","idCounter","maybe","ignored","globalKey","globalHost","Slot","hasValue","context_1","slots","saved","noContext","parentEntrySlot","arrayFromSet","maybeUnsubscribe","entryOrDep","emptySetPool","POOL_TARGET_SIZE","assert","optionalMessage","valueIs","valueGet","valueCopy","Entry","parents","childValues","dirtyChildren","recomputing","deps","mightBeDirty","rememberParent","recompute","forgetChildren","recomputeNewValue","setDirty","maybeSubscribe","reportClean","setClean","reallyRecompute","reportDirty","dispose","eachParent","forgetChild","dependOn","forgetDeps","reportDirtyChild","reportCleanChild","normalizeResult","oldValueCopy","parentCount","parentWasClean","childValue","removeDirtyChild","dc","EntryMethods","depsByKey","entryMethodName","m","defaultKeyTrie","defaultMakeCacheKey","originalFunction","cacheOption","clean","dirtyKey","peekKey","forgetKey","getKey","_createForOfIteratorHelperLoose","allowArrayLike","it","minLen","_arrayLikeToArray","_unsupportedIterableToArray","arr2","hasSymbols","hasSymbol","getSymbol","SymbolIterator","SymbolObservable","SymbolSpecies","getMethod","getSpecies","ctor","isObservable","hostReportError","enqueue","cleanupSubscription","_cleanup","closeSubscription","_queue","_state","notifySubscription","onNotify","queue","flushSubscription","subscriber","subscriptionObserver","SubscriptionObserver","_subscriber","_this3","_this4","C","hasSeed","acc","_this5","_len","startNext","flatMap","_this6","outer","inner","completeIfDone","_step","_iterator","_len2","_key2","symbol"],"sourceRoot":""}