{"version":3,"file":"js/1712-bb23ba741dae7096a7aa.js","mappings":"ylCAAA,SAASA,EAAEC,GAAG,IAAIC,EAAEC,EAAEC,EAAE,GAAG,GAAG,iBAAiBH,GAAG,iBAAiBA,EAAEG,GAAGH,OAAO,GAAG,iBAAiBA,EAAE,GAAGI,MAAMC,QAAQL,GAAG,IAAIC,EAAE,EAAEA,EAAED,EAAEM,OAAOL,IAAID,EAAEC,KAAKC,EAAEH,EAAEC,EAAEC,OAAOE,IAAIA,GAAG,KAAKA,GAAGD,QAAQ,IAAID,KAAKD,EAAEA,EAAEC,KAAKE,IAAIA,GAAG,KAAKA,GAAGF,GAAG,OAAOE,CAAC,CAA2H,MAAnH,WAAgB,IAAI,IAAIH,EAAEC,EAAEC,EAAE,EAAEC,EAAE,GAAGD,EAAEK,UAAUD,SAASN,EAAEO,UAAUL,QAAQD,EAAEF,EAAEC,MAAMG,IAAIA,GAAG,KAAKA,GAAGF,GAAG,OAAOE,CAAC,E,WCIjW,SAASK,IAeP,OAdAA,EAAWC,OAAOC,QAAU,SAAUC,GACpC,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CACzC,IAAIC,EAASN,UAAUK,GAEvB,IAAK,IAAIE,KAAOD,EACVJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAC/CH,EAAOG,GAAOD,EAAOC,GAG3B,CAEA,OAAOH,CACT,EAEOH,EAASU,MAAMC,KAAMZ,UAC9B,CAEA,SAASa,EAA2BC,GAClC,IAAIC,EAAYD,EAAKC,UACjBC,EAAWF,EAAKE,SACpB,OAAO,SAA8BC,GACnC,IAeIC,EAAQD,EAAMC,MACdC,EAAqBF,EAAMG,YAC3BA,OAAqC,IAAvBD,EAAgC,CAAC,EAAIA,EACnDE,EANKJ,EAAMF,YAAcA,EAMA,EAAKG,EAAMI,OAAQJ,EAAMK,QAAUL,EAAMI,OACtE,OAAoB,gBAAoB,MAAO,CAC7CD,UAAWH,EAAMM,cACjBC,YAdsB,SAA2BC,GACjDA,EAAMC,gBACR,GAagB,gBAAoB,SAAU1B,EAAS,CACrDe,SAAUA,GACTI,EAAa,CACdC,UAAWA,EACXO,QA1Ba,SAAkBF,GAC/BA,EAAMC,iBACNV,EAAMY,aAAa,CACjBd,UAAWA,GAEf,EAsBEe,KAAM,YAEV,CACF,CAEA,IAAIC,EAAyBlB,EAA2B,CACtDE,UAAW,SACXC,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,kGACY,gBAAoB,OAAQ,CAC3CA,EAAG,gBACHC,KAAM,YAINC,EAA0BzB,EAA2B,CACvDE,UAAW,UACXC,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,kGACY,gBAAoB,OAAQ,CAC3CA,EAAG,gBACHC,KAAM,YAINE,EAAuB1B,EAA2B,CACpDE,UAAW,OACXC,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,4MACY,gBAAoB,OAAQ,CAC3CA,EAAG,gBACHC,KAAM,YAING,EAAwB3B,EAA2B,CACrDE,UAAW,QACXC,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,gMACY,gBAAoB,OAAQ,CAC3CA,EAAG,gBACHC,KAAM,YAIV,SAASI,EAA0B3B,GACjC,IAAIC,EAAYD,EAAKC,UACjBC,EAAWF,EAAKE,SACpB,OAAO,SAA2BC,GAChC,IA0CIC,EAAQD,EAAMC,MACdC,EAAqBF,EAAMG,YAC3BA,OAAqC,IAAvBD,EAAgC,CAAC,EAAIA,EACnDE,EANKJ,EAAMyB,gBAAkBzB,EAAMyB,iBAAiBC,wBAAwBC,IAAI7B,GAMlD,EAAKG,EAAMI,OAAQJ,EAAMK,QAAUL,EAAMI,OAC3E,OAAoB,gBAAoB,MAAO,CAC7CD,UAAWH,EAAMM,cACjBC,YAdsB,SAA2BC,GACjDA,EAAMC,gBACR,GAagB,gBAAoB,SAAU1B,EAAS,CACrDe,SAAUA,GACTI,EAAa,CACdC,UAAWA,EACXO,QArDgB,SAAqBF,GACrC,GAAKT,EAAMyB,eAAX,CACAhB,EAAMC,iBACN,IACIkB,EADkB,CAAC,OAAQ,SAAU,SACNC,QAAO,SAAUC,GAClD,OAAOA,IAAUhC,CACnB,IACIiC,EAAqB/B,EAAMyB,iBAC3BO,EAAiBhC,EAAMyB,iBAAiBQ,oBACxCC,EAAYlC,EAAMyB,iBAAiBU,eACnCC,EAAaJ,EAAeK,eAAeH,EAAUI,eACrDC,EAAcP,EAAeK,eAAeH,EAAUM,gBACtDC,EAAsBP,EAAUQ,gBAChCC,EAAU,CACZC,aAAc,EACdC,YAAaT,EAAWU,aAGtBL,IACFE,EAAU,CACRE,YAAa,EACbD,aAAcL,EAAYO,cAI9B,IAAIC,EAAoBb,EAAUc,MAAML,GACpCM,EAAkB,EAAAC,SAASC,iBAAiBnB,EAAgBe,EAAmBjD,GAC/EsD,EAAexB,EAAayB,QAAO,SAAUC,EAASxB,GACxD,OAAO,EAAAoB,SAASK,kBAAkBD,EAASP,EAAmBjB,EAChE,GAAGmB,GACCO,EAAkB,EAAAC,YAAYC,KAAK3B,EAAoBqB,EAAc,uBACzEpD,EAAM2D,eAAeH,EA9BY,CA+BnC,EAsBE3C,KAAM,YAEV,CACF,CAEA,IAAI+C,EAAwBpC,EAA0B,CACpD1B,UAAW,SACXC,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,gFACY,gBAAoB,OAAQ,CAC3CA,EAAG,gBACHC,KAAM,YAINyC,EAAsBrC,EAA0B,CAClD1B,UAAW,OACXC,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,iFACY,gBAAoB,OAAQ,CAC3CA,EAAG,gBACHC,KAAM,YAIN0C,EAAuBtC,EAA0B,CACnD1B,UAAW,QACXC,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,gFACY,gBAAoB,OAAQ,CAC3CA,EAAG,gBACHC,KAAM,YAIV,SAAS2C,EAAuBlE,GAC9B,IAAImE,EAAYnE,EAAKmE,UACjBjE,EAAWF,EAAKE,SACpB,OAAO,SAA0BC,GAC/B,IAoBIC,EAAQD,EAAMC,MACdC,EAAqBF,EAAMG,YAC3BA,OAAqC,IAAvBD,EAAgC,CAAC,EAAIA,EACnDE,EAdoB,WAEtB,IAAKJ,EAAMyB,eACT,OAAO,EAGT,IAAIwC,EAAcjE,EAAMyB,iBAExB,OADWwC,EAAYhC,oBAAoBI,eAAe4B,EAAY9B,eAAe+B,eAAeC,YACpFH,CAClB,CAKgBI,GAAsB,EAAKnE,EAAMI,OAAQJ,EAAMK,QAAUL,EAAMI,OAC/E,OAAoB,gBAAoB,MAAO,CAC7CD,UAAWH,EAAMM,cACjBC,YArBsB,SAA2BC,GACjDA,EAAMC,gBACR,GAoBgB,gBAAoB,SAAU1B,EAAS,CACrDe,SAAUA,GACTI,EAAa,CACdC,UAAWA,EACXO,QA/BgB,SAAqBF,GACrCA,EAAMC,iBACNV,EAAM2D,eAAe,EAAAU,UAAUC,gBAAgBtE,EAAMyB,iBAAkBuC,GACzE,EA6BEnD,KAAM,YAEV,CACF,CAEA,IAAI0D,EAAmBR,EAAuB,CAC5CC,UAAW,aACXjE,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,6CACY,gBAAoB,OAAQ,CAC3CA,EAAG,gBACHC,KAAM,YAIV,SAASoD,EAAwB3E,GAC/B,IAAIiC,EAAQjC,EAAKiC,MACb/B,EAAWF,EAAKE,SACpB,OAAO,SAA2BC,GAChC,IAcIC,EAAQD,EAAMC,MACdC,EAAqBF,EAAMG,YAC3BA,OAAqC,IAAvBD,EAAgC,CAAC,EAAIA,EACnDE,EANKJ,EAAMyB,gBAAkBzB,EAAMyB,iBAAiBC,wBAAwBC,IAAIG,GAMlD,EAAK7B,EAAMI,OAAQJ,EAAMK,QAAUL,EAAMI,OAC3E,OAAoB,gBAAoB,MAAO,CAC7CD,UAAWH,EAAMM,cACjBC,YAfsB,SAA2BC,GACjDA,EAAMC,gBACR,GAcgB,gBAAoB,SAAU1B,EAAS,CACrDe,SAAUA,GACTI,EAAa,CACdC,UAAWA,EACXO,QAzBgB,SAAqBF,GACrCA,EAAMC,iBACNV,EAAM2D,eAAe,EAAAU,UAAUI,kBAAkBzE,EAAMyB,iBAAkBK,GAC3E,EAuBEjB,KAAM,YAEV,CACF,CAEA,IAAI6D,EAAaF,EAAwB,CACvC1C,MAAO,OACP/B,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,0OACY,gBAAoB,OAAQ,CAC3CA,EAAG,gBACHC,KAAM,YAINuD,EAAkBZ,EAAuB,CAC3CC,UAAW,aACXjE,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,kBACHC,KAAM,SACS,gBAAoB,OAAQ,CAC3CD,EAAG,kGAIHyD,EAAaJ,EAAwB,CACvC1C,MAAO,OACP/B,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,kBACHC,KAAM,SACS,gBAAoB,OAAQ,CAC3CD,EAAG,kGAIH0D,EAAoBd,EAAuB,CAC7CC,UAAW,aACXjE,SAAU,OAGR+E,EAAsBf,EAAuB,CAC/CC,UAAW,eACXjE,SAAU,OAGRgF,EAAoBhB,EAAuB,CAC7CC,UAAW,aACXjE,SAAU,OAGRiF,EAAeR,EAAwB,CACzC1C,MAAO,SACP/B,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,gBACHC,KAAM,SACS,gBAAoB,OAAQ,CAC3CD,EAAG,wDAIH8D,EAAoBlB,EAAuB,CAC7CC,UAAW,oBACXjE,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,+IACY,gBAAoB,OAAQ,CAC3CA,EAAG,gBACHC,KAAM,YAIN8D,EAAYV,EAAwB,CACtC1C,MAAO,YACP/B,SAAuB,gBAAoB,MAAO,KAAM,IAAkB,gBAAoB,MAAO,KAAM,QAGzGoF,EAAYX,EAAwB,CACtC1C,MAAO,cACP/B,SAAuB,gBAAoB,MAAO,KAAM,IAAkB,gBAAoB,MAAO,KAAM,QAGzGqF,EAAkBZ,EAAwB,CAC5C1C,MAAO,YACP/B,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,gBACHC,KAAM,SACS,gBAAoB,OAAQ,CAC3CD,EAAG,2HAIHkE,EAAsBtB,EAAuB,CAC/CC,UAAW,sBACXjE,SAAuB,gBAAoB,MAAO,CAChDgB,OAAQ,KACRC,QAAS,YACTC,MAAO,KACPC,MAAO,8BACO,gBAAoB,OAAQ,CAC1CC,EAAG,oRACY,gBAAoB,OAAQ,CAC3CA,EAAG,kBACHC,KAAM,W,yOCxYV,SAASpC,IAeP,OAdAA,EAAWC,OAAOC,QAAU,SAAUC,GACpC,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CACzC,IAAIC,EAASN,UAAUK,GAEvB,IAAK,IAAIE,KAAOD,EACVJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAC/CH,EAAOG,GAAOD,EAAOC,GAG3B,CAEA,OAAOH,CACT,EAEOH,EAASU,MAAMC,KAAMZ,UAC9B,CASA,SAASuG,EAAgBC,EAAGC,GAM1B,OALAF,EAAkBrG,OAAOwG,gBAAkB,SAAyBF,EAAGC,GAErE,OADAD,EAAEG,UAAYF,EACPD,CACT,EAEOD,EAAgBC,EAAGC,EAC5B,CAEA,SAASG,EAA8BtG,EAAQuG,GAC7C,GAAc,MAAVvG,EAAgB,MAAO,CAAC,EAC5B,IAEIC,EAAKF,EAFLD,EAAS,CAAC,EACV0G,EAAa5G,OAAO6G,KAAKzG,GAG7B,IAAKD,EAAI,EAAGA,EAAIyG,EAAW/G,OAAQM,IACjCE,EAAMuG,EAAWzG,GACbwG,EAASG,QAAQzG,IAAQ,IAC7BH,EAAOG,GAAOD,EAAOC,IAGvB,OAAOH,CACT,CAEA,SAAS6G,EAAavF,GACpB,OAAO,IAAAwF,sBAAqBxF,EAC9B,CAEA,SAASyF,EAAiBC,EAASlC,EAAamC,EAAgBvG,GAC9D,IACIwG,EADA1C,EAAiB9D,EAAK8D,eAG1B,OAAQwC,GACN,IAAK,YACL,IAAK,iBACL,IAAK,6BACHE,EAAW,EAAAhC,UAAUiC,YAAYrC,GACjC,MAEF,IAAK,SACL,IAAK,cACL,IAAK,yBACHoC,EAAW,EAAAhC,UAAUkC,SAAStC,GAC9B,MAEF,QACE,MAAO,cAGX,OAAgB,MAAZoC,GACF1C,EAAe0C,GACR,WAGF,aACT,CAEA,IAAIG,EAAc,CAAC,SACfC,EAAa,CAAC,SA4HlB,SAASC,EAAkBC,EAASC,GAClC,IAAIC,EAAc,CAAC,EAEfC,EAAoB,IAAIC,IAAI,CAAC,aA2BjC,OA1BAJ,EAAQK,SAAQ,SAAUC,GACxBhI,OAAO6G,KAAKmB,GAAQD,SAAQ,SAAUE,GAEhCJ,EAAkBnF,IAAIuF,KAI1BJ,EAAkBK,IAAID,GAEDA,EAlIdE,WAAW,MAmIhBP,EAAYK,GA7BpB,SAA0BG,EAAYV,EAASW,GAC7C,OAAO,WACL,IAAK,IAAIC,EAAQxI,UAAUD,OAAQ0I,EAAO,IAAI5I,MAAM2I,GAAQE,EAAQ,EAAGA,EAAQF,EAAOE,IACpFD,EAAKC,GAAS1I,UAAU0I,GAG1B,OAAOd,EAAQe,MAAK,SAAUT,GAC5B,IAAIU,EAAKV,EAAOI,GAGhB,MAAqB,oBAAPM,IAAwE,IAAnDA,EAAGjI,WAAM,EAAQ8H,EAAKI,OAAO,CAACN,IACnE,GACF,CACF,CAgBgCO,CAAiBX,EAAUP,EAASC,IAxIpE,SAA2BtH,GACzB,OAAOA,EAAI8H,WAAW,SACxB,CAuIiBU,CAAkBZ,GAjInC,SAAuB5H,GACrB,OAAOA,EAAIyI,SAAS,KACtB,CAiIiBC,CAAcd,KACN,oBAAbA,EACFL,EAAYoB,gBAjItB,SAA6BtB,EAASW,GACpC,OAAO,SAAUY,GACf,IAAIC,EAAc,CAChBnI,MAAO,CAAC,GAwBV,OAtBA2G,EAAQK,SAAQ,SAAUC,GACxB,GAAsC,oBAA3BA,EAAOgB,gBAAlB,CAIA,IAAIG,EAASnB,EAAOgB,gBAAgBC,EAAOZ,GAE3C,QAAee,IAAXD,GAAmC,OAAXA,EAAiB,CAC3C,IAAIE,EAAcF,EAAOpI,MACrBuI,EAAa5C,EAA8ByC,EAAQ5B,GAGnDgC,EAAeL,EACfnI,EAAQwI,EAAaxI,MACrByI,EAAO9C,EAA8B6C,EAAc/B,GAGvD0B,EAAcnJ,EAAS,CAAC,EAAGyJ,EAAMF,EAAY,CAC3CvI,MAAOhB,EAAS,CAAC,EAAGgB,EAAOsI,IAE/B,CAjBA,CAkBF,MACOH,EAAYO,WAAYP,CACjC,CACF,CAoGwCQ,CAAoBhC,EAASC,GACrC,iBAAbM,EACTL,EAAY+B,aApGtB,SAA0BjC,EAASW,GACjC,OAAO,SAAUY,GACf,IAAIW,EAAS,GAYb,OAXAlC,EAAQK,SAAQ,SAAUC,GACxB,GAAmC,oBAAxBA,EAAO2B,aAAlB,CAIA,IAAIR,EAASnB,EAAO2B,aAAaV,EAAOZ,QAEzBe,IAAXD,GAAmC,OAAXA,GAC1BS,EAAOnF,KAAK0E,EALd,CAOF,IACOS,EAAOC,KAAK,IACrB,CACF,CAoFqCC,CAAiBpC,EAASC,GAC/B,kBAAbM,EACTL,EAAYmC,cApFtB,SAA2BrC,EAASW,GAClC,OAAO,SAAUxF,EAAOoG,GACtB,IAAIE,EASJ,OARiBzB,EAAQe,MAAK,SAAUT,GACtC,MAAoC,oBAAzBA,EAAO+B,oBAKAX,KADlBD,EAASnB,EAAO+B,cAAclH,EAAOoG,EAAOZ,GAE9C,KACqBc,EAASA,EAAS,CAAC,CAC1C,CACF,CAuEsCa,CAAkBtC,EAASC,GACjC,iBAAbM,IACTL,EAAYb,aAvEtB,SAA0BW,EAASW,GACjC,OAAO,SAAU7G,GACf,IAAI2H,EAAS,KASb,OARiBzB,EAAQe,MAAK,SAAUT,GACtC,MAAmC,oBAAxBA,EAAOjB,mBAKAqC,KADlBD,EAASnB,EAAOjB,aAAavF,EAAO6G,GAEtC,IACoBc,EAAS,IAC/B,CACF,CA0DqCc,CAAiBvC,EAASC,KATvDC,EAAYK,GA/CpB,SAA2BG,EAAYV,EAASW,GAC9C,OAAO,WACL,IAAK,IAAI6B,EAAOpK,UAAUD,OAAQ0I,EAAO,IAAI5I,MAAMuK,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC/E5B,EAAK4B,GAAQrK,UAAUqK,GAGzB,OAAOzC,EAAQe,MAAK,SAAUT,GAC5B,IAAIU,EAAKV,EAAOI,GAChB,MAEgB,oBAAPM,GAAwE,YAAnDA,EAAGjI,WAAM,EAAQ8H,EAAKI,OAAO,CAACN,IAE9D,IAAK,UAAY,aACnB,CACF,CAiCgC+B,CAAkBnC,EAAUP,EAASC,GAYjE,GACF,IACOC,CACT,CAoBA,IAAIyC,EAAgB,IAEhBC,EAA8B,WAChC,SAASA,EAAeC,GACtB7J,KAAK6J,gBAAa,EAClB7J,KAAK6J,WAAa,SAAeA,EACnC,CAMA,IAAIC,EAASF,EAAehK,UAwD5B,OAtDAkK,EAAOC,eAAiB,SAAwBxB,EAAOyB,GACrD,IAAIC,EAAc,IAAIhL,MAAMsJ,EAAM2B,UAAU/K,QAAQsC,KAAK,MAWzD,OAVAzB,KAAK6J,WAAWxC,SAAQ,SAAU8C,EAAW1K,GACtB0K,EAAUJ,eAAexB,EAAOyB,GACtC3C,SAAQ,SAAU1H,EAAKyK,GAC/BzK,IAILsK,EAAYG,GAAU3K,EAAIkK,EAAgBhK,EAC5C,GACF,IACO,SAAesK,EACxB,EAOAH,EAAOO,mBAAqB,SAA4B1K,GAEtD,OADgBK,KAAKsK,mBAAmB3K,GACvB0K,mBAAmBT,EAAeW,YAAY5K,GACjE,EAOAmK,EAAOU,eAAiB,SAAwB7K,GAE9C,OADgBK,KAAKsK,mBAAmB3K,GACvB6K,eAAeZ,EAAeW,YAAY5K,GAC7D,EAMAmK,EAAOQ,mBAAqB,SAA4B3K,GACtD,IAAI8K,EAAQ9K,EAAI+K,MAAMf,GAClBgB,EAAQC,OAAOH,EAAM,IACzB,OAAOzK,KAAK6J,WAAWgB,IAAIF,EAC7B,EAMAf,EAAeW,YAAc,SAAqB5K,GAEhD,OADYA,EAAI+K,MAAMf,GACTmB,MAAM,GAAG3B,KAAKQ,EAC7B,EAEOC,CACT,CAnEkC,GAwE9BmB,EAAoB,SAA2BZ,GACjD,MAA2C,oBAA7BA,EAAUJ,gBAAyE,oBAAjCI,EAAUE,oBAAyE,oBAA7BF,EAAUK,cAClI,EAeA,SAASQ,EAAkB3K,EAAOyB,EAAgBmJ,GAChD,IAAIpB,EAduB,SAAgC3J,GAC3D,IAAI2J,EAAa3J,EAAK2J,WAClBqB,EAAehL,EAAK8G,QACpBA,OAA2B,IAAjBkE,EAA0B,GAAKA,EAC7C,OAAO,IAAAC,MAAK,CAAC,CACXtB,WAAYA,IACX5B,OAAOjB,IAAU9E,QAAO,SAAUoF,GACnC,YAAyDoB,KAAvC,MAAVpB,OAAiB,EAASA,EAAOuC,WAC3C,IAAGuB,SAAQ,SAAU9D,GACnB,OAAiB,MAAVA,OAAiB,EAASA,EAAOuC,UAC1C,GACF,CAGmBwB,CAAuBhL,GACpCiL,EA/GN,SAAkCzB,EAAY/H,EAAgBkC,GAC5D,IAAIuH,GAAsB,IAAAJ,MAAKtB,GAAY2B,KAAI,SAAUrB,GACvD,IAAIsB,EAAYtB,EAAUpB,UAS1B,OAAO1J,EAAS,CAAC,EAAG8K,EAAW,CAC7BpB,UARuB,SAA4B1I,GACnD,OAAoB,gBAAoBoL,EAAWpM,EAAS,CAAC,EAAGgB,EAAO,CACrEyB,eAAgBA,EAChBkC,eAAgBA,IAEpB,GAKF,IAAG0H,OACH,OAAO,IAAI,EAAAC,mBAAmBJ,EAChC,CA+F2BK,CAAyB/B,EAAW3H,QAAO,SAAUiI,GAC5E,OAAQY,EAAkBZ,EAC5B,IAAIrI,EAAgBmJ,GAChBY,EAAmBhC,EAAW3H,QAAO,SAAUiI,GACjD,OAAOY,EAAkBZ,EAC3B,IACA,OAAO,IAAIP,EAAeiC,EAAiB9H,KAAKuH,GAClD,CAEA,IAAIQ,EAAY,CAAC,gBAEbC,EAAqB,SAA4BC,GAEjD,IAAIC,EAIAC,EALN,OAA+C,OAAnC,MAAPF,OAAc,EAASA,EAAInC,YAGe,OAArCoC,EAAkBD,EAAInC,iBAAsB,EAASoC,EAAgBE,KACxB,OAApC,MAAPH,OAAc,EAASA,EAAII,aAGU,OAAvCF,EAAmBF,EAAII,kBAAuB,EAASF,EAAiB/M,YAH3E,CAOT,EAMIkN,EAA4B,SAAUC,GA1W1C,IAAwBC,EAAUC,EA6WhC,SAASH,EAAaI,GACpB,IAAIC,EAyJJ,OAvJAA,EAAQJ,EAAWxM,KAAKE,KAAMyM,IAAWzM,MACnC2M,OAAS,KACfD,EAAME,MAAQ,CACZC,UAAU,GAIZH,EAAMzB,SAAW,SAAU3G,GACzB,IAAIwI,EAAiBxI,EAErBoI,EAAMK,iBAAiB1F,SAAQ,SAAUC,GACnCA,EAAO2D,WACT6B,EAAiBxF,EAAO2D,SAAS6B,EAAgBJ,EAAMM,oBAE3D,IAEIN,EAAMrM,MAAM4K,UACdyB,EAAMrM,MAAM4K,SAAS6B,EAEzB,EAEAJ,EAAMO,WAAa,WACjB,MAAO,GAAGhF,OAAOyE,EAAMrM,MAAM2G,QAC/B,EAEA0F,EAAMQ,SAAW,WACf,OAAO7N,EAAS,CAAC,EAAGqN,EAAMrM,MAC5B,EAEAqM,EAAMS,YAAc,WAClB,OAAOT,EAAMrM,MAAMwM,UAAYH,EAAME,MAAMC,QAC7C,EAEAH,EAAMU,YAAc,SAAUP,GACxBA,IAAaH,EAAME,MAAMC,UAC3BH,EAAMW,SAAS,CACbR,SAAUA,GAGhB,EAEAH,EAAMY,aAAe,WACnB,OAAOZ,EAAMC,MACf,EAEAD,EAAM5K,eAAiB,WACrB,OAAO4K,EAAMrM,MAAMiE,WACrB,EAEAoI,EAAMM,iBAAmB,WACvB,MAAO,CACLC,WAAYP,EAAMO,WAClBC,SAAUR,EAAMQ,SAChBlJ,eAAgB0I,EAAMzB,SACtBnJ,eAAgB4K,EAAM5K,eACtBqL,YAAaT,EAAMS,YACnBC,YAAaV,EAAMU,YACnBE,aAAcZ,EAAMY,aAExB,EAEAZ,EAAM3F,kBAAoB,WAExB,OAAOA,EADO,CAAC2F,EAAMrM,OAAO4H,OAAOyE,EAAMK,kBACPL,EAAMM,mBAC1C,EAEAN,EAAMK,eAAiB,WACrB,IAAI/F,EAAU0F,EAAMO,aAcpB,OAZuC,IAAnCP,EAAMrM,MAAMkN,oBACdvG,EAAQjD,KAAK,CACXsC,aAAcA,KAIqB,IAAnCqG,EAAMrM,MAAMmN,oBACdxG,EAAQjD,KAAK,CACXwC,iBAAkBA,IAIfS,CACT,EAEA0F,EAAMe,sBAAwB,WAO5B,OANqBf,EAAMrM,MAAM2G,QAAQ9E,QAAO,SAAUwL,GACxD,YAA+BhF,IAAxBgF,EAAKC,cACd,IAAGnC,KAAI,SAAUkC,GACf,OAAOA,EAAKC,cACd,IAEsB1F,OAAO,CAACyE,EAAMrM,MAAMsN,iBAAiBjK,QAAO,SAAUwF,EAAQ/G,GAClF,OAAO9C,EAAS,CAAC,EAAG6J,EAAQ/G,EAC9B,GAAG,CAAC,EACN,EAEAuK,EAAMkB,sBAAwB,WAC5B,IAAIC,EAAiBnB,EAAMrM,MAAM2G,QAAQ9E,QAAO,SAAUwL,GACxD,YAA+BhF,IAAxBgF,EAAKG,cACd,IAAGnK,QAAO,SAAUoK,EAAMJ,GACxB,OAAOI,EAAKzK,MAAMqK,EAAKG,eACzB,IAAG,IAAAE,KAAI,CAAC,IAUR,OARIrB,EAAMrM,MAAM2N,wBACdH,EAAiB,EAAAI,2BAA2B5K,MAAMwK,IAGhDnB,EAAMrM,MAAMwN,iBACdA,EAAiBA,EAAexK,MAAMqJ,EAAMrM,MAAMwN,iBAG7CA,CACT,EAEAnB,EAAMwB,0BAA4B,WAChC,IAAIC,EAAqB,CAAC,EAyB1B,OAvBAzB,EAAMK,iBAAiB1F,SAAQ,SAAUC,GACvC,GAA4C,oBAAjCA,EAAO8G,sBAAlB,CAIA,IAAI/N,EAAQiH,EAAO8G,wBACfC,EAAa,CAAC,OAEsB3F,IAApCyF,EAAmBG,aACrBD,EAAWC,aAAejO,EAAMiO,aACA,SAAvBjO,EAAMiO,eACfD,EAAWC,aAAe,aAGY5F,IAApCyF,EAAmBI,aACrBF,EAAWE,aAAelO,EAAMkO,cACA,IAAvBlO,EAAMkO,eACfF,EAAWE,cAAe,GAG5BJ,EAAqB9O,EAAS,CAAC,EAAG8O,EAAoB9N,EAAOgO,EAjB7D,CAkBF,IAEOF,CACT,EAEe,CAACzB,EAAMrM,OAAO4H,OAAOyE,EAAMK,kBAEjC1F,SAAQ,SAAUC,GACrBA,GAAuC,oBAAtBA,EAAOkH,YAC1BlH,EAAOkH,WAAW9B,EAAMM,mBAE5B,IAEON,CACT,CAxgBgCF,EA2WHF,GA3WPC,EA2WPF,GA1WNzM,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAC9C2M,EAAS3M,UAAU8O,YAAcnC,EAEjC5G,EAAgB4G,EAAUC,GAsgB1B,IAAI1C,EAASuC,EAAazM,UAsF1B,OApFAkK,EAAO6E,MAAQ,WACT3O,KAAK2M,QACP3M,KAAK2M,OAAOgC,OAEhB,EAEA7E,EAAO8E,KAAO,WACR5O,KAAK2M,QACP3M,KAAK2M,OAAOiC,MAEhB,EAEA9E,EAAO+E,kBAAoB,WACzB,IAAI1E,EAAYa,EAAkBhL,KAAKK,MAAOL,KAAK8B,eAAgB9B,KAAKiL,UACpE3G,EAAc,EAAAR,YAAYgL,IAAI9O,KAAKK,MAAMiE,YAAa,CACxD6F,UAAWA,IAEbnK,KAAKiL,SAAS,EAAAnH,YAAYiL,mBAAmBzK,GAC/C,EAEAwF,EAAOkF,mBAAqB,SAA4BC,GACtD,IAAIC,EAAOlP,KAAKK,MACZ8O,EAAUF,EAAU3K,YAAY8K,eAChCC,EAAUH,EAAK5K,YAAY8K,eAE/B,GAAKD,GAKDA,IAAYE,KAKZF,IAAWE,GAAWtD,EAAmBoD,KAAapD,EAAmBsD,IAA7E,CAIA,IAAI/K,EAAc,EAAAR,YAAYgL,IAAII,EAAK5K,YAAa,CAClD6F,UAAWgF,IAEbnP,KAAKiL,SAAS,EAAAnH,YAAYiL,mBAAmBzK,GAL7C,CAMF,EAEAwF,EAAOwF,qBAAuB,WAC5B,IAAIC,EAASvP,KAEbA,KAAK+M,iBAAiB1F,SAAQ,SAAUC,GAClCA,EAAOkI,aACTlI,EAAOkI,YAAY,CACjB1N,eAAgByN,EAAOzN,eACvBkC,eAAgBuL,EAAOtE,UAG7B,GACF,EAIAnB,EAAO2F,OAAS,WACd,IAAIC,EAAS1P,KAETkH,EAAclH,KAAK+G,oBACnB4G,EAAiB3N,KAAKyN,wBACtBU,EAAqBnO,KAAKkO,4BAC1BL,EAAiB7N,KAAK4N,wBAEtB+B,EAAc3P,KAAKK,MACnBsP,EAAYtJ,aACZ,IAAIuJ,EAAc5J,EAA8B2J,EAAa7D,GAEjE,OAAoB,gBAAoB,EAAA+D,OAAQxQ,EAAS,CAAC,EAAGuQ,EAAazB,EAAoBjH,EAAa,CACzG2F,SAAU7M,KAAKK,MAAMwM,UAAY7M,KAAK4M,MAAMC,SAC5Cc,eAAgBA,EAChBE,eAAgBA,EAChB5C,SAAUjL,KAAKiL,SACf3G,YAAatE,KAAKK,MAAMiE,YACxBwL,IAAK,SAAaC,GAChBL,EAAO/C,OAASoD,CAClB,IAEJ,EAEO1D,CACT,CAvPgC,CAuP9B,EAAAZ,WAEFY,EAAa2D,UAAY,CACvB1L,YAAa,WAAiB2L,WAC9BhF,SAAU,SAAegF,WACzBjJ,QAAS,UACTuG,mBAAoB,SACpBC,mBAAoB,SACpBQ,sBAAuB,SACvBL,eAAgB,WAEhB9D,WAAY,WAEdwC,EAAa6D,aAAe,CAC1BlC,uBAAuB,EACvBT,oBAAoB,EACpBC,oBAAoB,EACpBG,eAAgB,CAAC,EACjB3G,QAAS,GACT6C,WAAY,IAEd,IAAIsG,EAAiB9D,EAEjB+D,EArrBJ,SAAqCC,GAGnC,OAAI,EAAAvM,YAAYwM,eAGP,EAAAxM,YAAYwM,eAAeD,GAG7B,EAAAvM,YAAYyM,kBAAkB,EAAAC,aAAaC,eAAeJ,GACnE,EA4qBIK,EAvqBJ,WACE,IAAK,IAAIlH,EAAOpK,UAAUD,OAAQwR,EAAQ,IAAI1R,MAAMuK,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAChFkH,EAAMlH,GAAQrK,UAAUqK,GAG1B,GAAqB,IAAjBkH,EAAMxR,OACR,OAAO,SAAUyR,GACf,OAAOA,CACT,EAGF,GAAqB,IAAjBD,EAAMxR,OACR,OAAOwR,EAAM,GAGf,IAAIE,EAAOF,EAAMA,EAAMxR,OAAS,GAChC,OAAO,WAGL,IAFA,IAAIsJ,EAASoI,EAAK9Q,WAAM,EAAQX,WAEvBK,EAAIkR,EAAMxR,OAAS,EAAGM,GAAK,EAAGA,GAAK,EAAG,CAE7CgJ,GAAS1J,EADD4R,EAAMlR,IACHgJ,EACb,CAEA,OAAOA,CACT,CACF,C,oBCvCiEqI,EAAOC,QAGhE,WAAc,aAAa,IAAIC,EAAU/R,MAAMW,UAAUkL,MAE/D,SAASmG,EAAYC,EAAM1E,GACrBA,IACF0E,EAAKtR,UAAYN,OAAOmP,OAAOjC,EAAW5M,YAE5CsR,EAAKtR,UAAU8O,YAAcwC,CAC/B,CAEA,SAASC,EAASC,GACd,OAAOC,EAAWD,GAASA,EAAQE,EAAIF,EACzC,CAIA,SAASG,EAAcH,GACrB,OAAOI,EAAQJ,GAASA,EAAQK,EAASL,EAC3C,CAIA,SAASM,EAAgBN,GACvB,OAAOO,EAAUP,GAASA,EAAQQ,EAAWR,EAC/C,CAIA,SAASS,EAAYT,GACnB,OAAOC,EAAWD,KAAWU,EAAcV,GAASA,EAAQW,EAAOX,EACrE,CAIF,SAASC,EAAWW,GAClB,SAAUA,IAAiBA,EAAcC,GAC3C,CAEA,SAAST,EAAQU,GACf,SAAUA,IAAcA,EAAWC,GACrC,CAEA,SAASR,EAAUS,GACjB,SAAUA,IAAgBA,EAAaC,GACzC,CAEA,SAASP,EAAcQ,GACrB,OAAOd,EAAQc,IAAqBX,EAAUW,EAChD,CAEA,SAASC,EAAUC,GACjB,SAAUA,IAAgBA,EAAaC,GACzC,CArCAxB,EAAYM,EAAeJ,GAM3BF,EAAYS,EAAiBP,GAM7BF,EAAYY,EAAaV,GA2BzBA,EAASE,WAAaA,EACtBF,EAASK,QAAUA,EACnBL,EAASQ,UAAYA,EACrBR,EAASW,cAAgBA,EACzBX,EAASoB,UAAYA,EAErBpB,EAASuB,MAAQnB,EACjBJ,EAASwB,QAAUjB,EACnBP,EAAS/J,IAAMyK,EAGf,IAAII,EAAuB,6BACvBE,EAAoB,0BACpBE,EAAsB,4BACtBI,EAAsB,4BAGtBG,EAAS,SAGTC,EAAQ,EACRC,EAAO,GAAKD,EACZE,EAAOD,EAAO,EAIdE,EAAU,CAAC,EAGXC,EAAgB,CAAE7B,OAAO,GACzB8B,EAAY,CAAE9B,OAAO,GAEzB,SAAS+B,EAAQrD,GAEf,OADAA,EAAIsB,OAAQ,EACLtB,CACT,CAEA,SAASsD,EAAOtD,GACdA,IAAQA,EAAIsB,OAAQ,EACtB,CAKA,SAASiC,IAAW,CAGpB,SAASC,EAAQC,EAAKnJ,GACpBA,EAASA,GAAU,EAGnB,IAFA,IAAIoJ,EAAMC,KAAKC,IAAI,EAAGH,EAAIpU,OAASiL,GAC/BuJ,EAAS,IAAI1U,MAAMuU,GACdI,EAAK,EAAGA,EAAKJ,EAAKI,IACzBD,EAAOC,GAAML,EAAIK,EAAKxJ,GAExB,OAAOuJ,CACT,CAEA,SAASE,EAAWC,GAIlB,YAHkBpL,IAAdoL,EAAK3H,OACP2H,EAAK3H,KAAO2H,EAAKC,UAAUC,IAEtBF,EAAK3H,IACd,CAEA,SAAS8H,EAAUH,EAAMnJ,GAQvB,GAAqB,kBAAVA,EAAoB,CAC7B,IAAIuJ,EAAcvJ,IAAU,EAC5B,GAAI,GAAKuJ,IAAgBvJ,GAAyB,aAAhBuJ,EAChC,OAAOC,IAETxJ,EAAQuJ,CACV,CACA,OAAOvJ,EAAQ,EAAIkJ,EAAWC,GAAQnJ,EAAQA,CAChD,CAEA,SAASqJ,IACP,OAAO,CACT,CAEA,SAASI,EAAWC,EAAOC,EAAKnI,GAC9B,OAAkB,IAAVkI,QAAyB3L,IAATyD,GAAsBkI,IAAUlI,UAC7CzD,IAAR4L,QAA+B5L,IAATyD,GAAsBmI,GAAOnI,EACxD,CAEA,SAASoI,EAAaF,EAAOlI,GAC3B,OAAOqI,EAAaH,EAAOlI,EAAM,EACnC,CAEA,SAASsI,EAAWH,EAAKnI,GACvB,OAAOqI,EAAaF,EAAKnI,EAAMA,EACjC,CAEA,SAASqI,EAAa7J,EAAOwB,EAAMuI,GACjC,YAAiBhM,IAAViC,EACL+J,EACA/J,EAAQ,EACN8I,KAAKC,IAAI,EAAGvH,EAAOxB,QACVjC,IAATyD,EACExB,EACA8I,KAAKkB,IAAIxI,EAAMxB,EACvB,CAIA,IAAIiK,EAAe,EACfC,EAAiB,EACjBC,EAAkB,EAElBC,EAAyC,oBAAXC,QAAyBA,OAAOC,SAC9DC,EAAuB,aAEvBC,EAAkBJ,GAAwBG,EAG9C,SAASE,EAASlG,GACdlP,KAAKkP,KAAOA,CACd,CAkBF,SAASmG,EAAcnU,EAAMoU,EAAGC,EAAGC,GACjC,IAAIpE,EAAiB,IAATlQ,EAAaoU,EAAa,IAATpU,EAAaqU,EAAI,CAACD,EAAGC,GAIlD,OAHAC,EAAkBA,EAAepE,MAAQA,EAAUoE,EAAiB,CAClEpE,MAAOA,EAAOqE,MAAM,GAEfD,CACT,CAEA,SAASE,IACP,MAAO,CAAEtE,WAAO1I,EAAW+M,MAAM,EACnC,CAEA,SAASE,EAAY3D,GACnB,QAAS4D,EAAc5D,EACzB,CAEA,SAAS6D,EAAWC,GAClB,OAAOA,GAA+C,oBAAvBA,EAAc5G,IAC/C,CAEA,SAAS6G,EAAYC,GACnB,IAAIC,EAAaL,EAAcI,GAC/B,OAAOC,GAAcA,EAAWnW,KAAKkW,EACvC,CAEA,SAASJ,EAAcI,GACrB,IAAIC,EAAaD,IACdjB,GAAwBiB,EAASjB,IAClCiB,EAASd,IAEX,GAA0B,oBAAfe,EACT,OAAOA,CAEX,CAEA,SAASC,EAAY9E,GACnB,OAAOA,GAAiC,kBAAjBA,EAAMjS,MAC/B,CAGE,SAASmS,EAAIF,GACX,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsB+E,KAC7C9E,EAAWD,GAASA,EAAMgF,QAAUC,GAAajF,EACrD,CAqCA,SAASK,EAASL,GAChB,OAAiB,OAAVA,QAA4B1I,IAAV0I,EACvB+E,KAAgBG,aAChBjF,EAAWD,GACRI,EAAQJ,GAASA,EAAMgF,QAAUhF,EAAMmF,eACxCC,GAAkBpF,EACxB,CASA,SAASQ,EAAWR,GAClB,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsB+E,KAC5C9E,EAAWD,GACZI,EAAQJ,GAASA,EAAMqF,WAAarF,EAAMsF,eADrBC,GAAoBvF,EAE7C,CAyBA,SAASW,EAAOX,GACd,OACY,OAAVA,QAA4B1I,IAAV0I,EAAsB+E,KACvC9E,EAAWD,GACZI,EAAQJ,GAASA,EAAMqF,WAAarF,EADfuF,GAAoBvF,IAEzCwF,UACJ,CAlJAxB,EAASxV,UAAUiX,SAAW,WAC5B,MAAO,YACT,EAGFzB,EAAS0B,KAAOlC,EAChBQ,EAAS2B,OAASlC,EAClBO,EAAS4B,QAAUlC,EAEnBM,EAASxV,UAAUqX,QACnB7B,EAASxV,UAAUsX,SAAW,WAAc,OAAOlX,KAAK6W,UAAY,EACpEzB,EAASxV,UAAUuV,GAAmB,WACpC,OAAOnV,IACT,EA0CAiR,EAAYK,EAAKH,GAMfG,EAAI6F,GAAK,WACP,OAAO7F,EAAIlS,UACb,EAEAkS,EAAI1R,UAAUwW,MAAQ,WACpB,OAAOpW,IACT,EAEAsR,EAAI1R,UAAUiX,SAAW,WACvB,OAAO7W,KAAKoX,WAAW,QAAS,IAClC,EAEA9F,EAAI1R,UAAUyX,YAAc,WAK1B,OAJKrX,KAAKsX,QAAUtX,KAAKuX,oBACvBvX,KAAKsX,OAAStX,KAAKyW,WAAWe,UAC9BxX,KAAKmM,KAAOnM,KAAKsX,OAAOnY,QAEnBa,IACT,EAIAsR,EAAI1R,UAAUmU,UAAY,SAAS/L,EAAIyP,GACrC,OAAOC,GAAW1X,KAAMgI,EAAIyP,GAAS,EACvC,EAIAnG,EAAI1R,UAAU+X,WAAa,SAASzW,EAAMuW,GACxC,OAAOG,GAAY5X,KAAMkB,EAAMuW,GAAS,EAC1C,EAIFxG,EAAYQ,EAAUH,GASpBG,EAAS7R,UAAU0W,WAAa,WAC9B,OAAOtW,IACT,EAIFiR,EAAYW,EAAYN,GAOtBM,EAAWuF,GAAK,WACd,OAAOvF,EAAWxS,UACpB,EAEAwS,EAAWhS,UAAU8W,aAAe,WAClC,OAAO1W,IACT,EAEA4R,EAAWhS,UAAUiX,SAAW,WAC9B,OAAO7W,KAAKoX,WAAW,QAAS,IAClC,EAEAxF,EAAWhS,UAAUmU,UAAY,SAAS/L,EAAIyP,GAC5C,OAAOC,GAAW1X,KAAMgI,EAAIyP,GAAS,EACvC,EAEA7F,EAAWhS,UAAU+X,WAAa,SAASzW,EAAMuW,GAC/C,OAAOG,GAAY5X,KAAMkB,EAAMuW,GAAS,EAC1C,EAIFxG,EAAYc,EAAQT,GASlBS,EAAOoF,GAAK,WACV,OAAOpF,EAAO3S,UAChB,EAEA2S,EAAOnS,UAAUgX,SAAW,WAC1B,OAAO5W,IACT,EAIFsR,EAAIuG,MAAQA,GACZvG,EAAIoB,MAAQjB,EACZH,EAAIlK,IAAM2K,EACVT,EAAIqB,QAAUf,EAEd,IA2LIkG,EAuUAC,EAqHAC,EAvnBAC,GAAkB,wBAOpB,SAASC,GAASC,GAChBnY,KAAKoY,OAASD,EACdnY,KAAKmM,KAAOgM,EAAMhZ,MACpB,CA+BA,SAASkZ,GAAUC,GACjB,IAAInS,EAAO7G,OAAO6G,KAAKmS,GACvBtY,KAAKuY,QAAUD,EACftY,KAAKwY,MAAQrS,EACbnG,KAAKmM,KAAOhG,EAAKhH,MACnB,CA2CA,SAASsZ,GAAYzC,GACnBhW,KAAK0Y,UAAY1C,EACjBhW,KAAKmM,KAAO6J,EAAS7W,QAAU6W,EAAS7J,IAC1C,CAuCA,SAASwM,GAAY1D,GACnBjV,KAAK4Y,UAAY3D,EACjBjV,KAAK6Y,eAAiB,EACxB,CAiDF,SAAShB,GAAMiB,GACb,SAAUA,IAAYA,EAASb,IACjC,CAIA,SAAS9B,KACP,OAAO2B,IAAcA,EAAY,IAAII,GAAS,IAChD,CAEA,SAAS1B,GAAkBpF,GACzB,IAAI2H,EACF9Z,MAAMC,QAAQkS,GAAS,IAAI8G,GAAS9G,GAAOmF,eAC3CV,EAAWzE,GAAS,IAAIuH,GAAYvH,GAAOmF,eAC3CZ,EAAYvE,GAAS,IAAIqH,GAAYrH,GAAOmF,eAC3B,kBAAVnF,EAAqB,IAAIiH,GAAUjH,QAC1C1I,EACF,IAAKqQ,EACH,MAAM,IAAIC,UACR,yEACsB5H,GAG1B,OAAO2H,CACT,CAEA,SAASpC,GAAoBvF,GAC3B,IAAI2H,EAAME,GAAyB7H,GACnC,IAAK2H,EACH,MAAM,IAAIC,UACR,gDAAkD5H,GAGtD,OAAO2H,CACT,CAEA,SAAS1C,GAAajF,GACpB,IAAI2H,EAAME,GAAyB7H,IACf,kBAAVA,GAAsB,IAAIiH,GAAUjH,GAC9C,IAAK2H,EACH,MAAM,IAAIC,UACR,iEAAmE5H,GAGvE,OAAO2H,CACT,CAEA,SAASE,GAAyB7H,GAChC,OACE8E,EAAY9E,GAAS,IAAI8G,GAAS9G,GAClCyE,EAAWzE,GAAS,IAAIuH,GAAYvH,GACpCuE,EAAYvE,GAAS,IAAIqH,GAAYrH,QACrC1I,CAEJ,CAEA,SAASgP,GAAWqB,EAAK/Q,EAAIyP,EAASyB,GACpC,IAAIC,EAAQJ,EAAIzB,OAChB,GAAI6B,EAAO,CAET,IADA,IAAIC,EAAWD,EAAMha,OAAS,EACrByU,EAAK,EAAGA,GAAMwF,EAAUxF,IAAM,CACrC,IAAIyF,EAAQF,EAAM1B,EAAU2B,EAAWxF,EAAKA,GAC5C,IAAmD,IAA/C5L,EAAGqR,EAAM,GAAIH,EAAUG,EAAM,GAAKzF,EAAImF,GACxC,OAAOnF,EAAK,CAEhB,CACA,OAAOA,CACT,CACA,OAAOmF,EAAIxB,kBAAkBvP,EAAIyP,EACnC,CAEA,SAASG,GAAYmB,EAAK7X,EAAMuW,EAASyB,GACvC,IAAIC,EAAQJ,EAAIzB,OAChB,GAAI6B,EAAO,CACT,IAAIC,EAAWD,EAAMha,OAAS,EAC1ByU,EAAK,EACT,OAAO,IAAIwB,GAAS,WAClB,IAAIiE,EAAQF,EAAM1B,EAAU2B,EAAWxF,EAAKA,GAC5C,OAAOA,IAAOwF,EACZ1D,IACAL,EAAcnU,EAAMgY,EAAUG,EAAM,GAAKzF,EAAK,EAAGyF,EAAM,GAC3D,GACF,CACA,OAAON,EAAIO,mBAAmBpY,EAAMuW,EACtC,CAEA,SAAS8B,GAAOC,EAAMC,GACpB,OAAOA,EACLC,GAAWD,EAAWD,EAAM,GAAI,CAAC,GAAIA,IACrCG,GAAcH,EAClB,CAEA,SAASE,GAAWD,EAAWD,EAAM7Z,EAAKia,GACxC,OAAI3a,MAAMC,QAAQsa,GACTC,EAAU3Z,KAAK8Z,EAAYja,EAAKiS,EAAW4H,GAAMhO,KAAI,SAAS+J,EAAGD,GAAK,OAAOoE,GAAWD,EAAWlE,EAAGD,EAAGkE,EAAK,KAEnHK,GAAWL,GACNC,EAAU3Z,KAAK8Z,EAAYja,EAAK8R,EAAS+H,GAAMhO,KAAI,SAAS+J,EAAGD,GAAK,OAAOoE,GAAWD,EAAWlE,EAAGD,EAAGkE,EAAK,KAE9GA,CACT,CAEA,SAASG,GAAcH,GACrB,OAAIva,MAAMC,QAAQsa,GACT5H,EAAW4H,GAAMhO,IAAImO,IAAeG,SAEzCD,GAAWL,GACN/H,EAAS+H,GAAMhO,IAAImO,IAAeI,QAEpCP,CACT,CAEA,SAASK,GAAWzI,GAClB,OAAOA,IAAUA,EAAM1C,cAAgBpP,aAAgCoJ,IAAtB0I,EAAM1C,YACzD,CAwDA,SAASsL,GAAGC,EAAQC,GAClB,GAAID,IAAWC,GAAWD,IAAWA,GAAUC,IAAWA,EACxD,OAAO,EAET,IAAKD,IAAWC,EACd,OAAO,EAET,GAA8B,oBAAnBD,EAAOE,SACY,oBAAnBD,EAAOC,QAAwB,CAGxC,IAFAF,EAASA,EAAOE,cAChBD,EAASA,EAAOC,YACUF,IAAWA,GAAUC,IAAWA,EACxD,OAAO,EAET,IAAKD,IAAWC,EACd,OAAO,CAEX,CACA,QAA6B,oBAAlBD,EAAOG,QACW,oBAAlBF,EAAOE,SACdH,EAAOG,OAAOF,GAIpB,CAEA,SAASG,GAAUC,EAAGC,GACpB,GAAID,IAAMC,EACR,OAAO,EAGT,IACGlJ,EAAWkJ,SACD7R,IAAX4R,EAAEnO,WAAiCzD,IAAX6R,EAAEpO,MAAsBmO,EAAEnO,OAASoO,EAAEpO,WAChDzD,IAAb4R,EAAEE,aAAqC9R,IAAb6R,EAAEC,QAAwBF,EAAEE,SAAWD,EAAEC,QACnEhJ,EAAQ8I,KAAO9I,EAAQ+I,IACvB5I,EAAU2I,KAAO3I,EAAU4I,IAC3BhI,EAAU+H,KAAO/H,EAAUgI,GAE3B,OAAO,EAGT,GAAe,IAAXD,EAAEnO,MAAyB,IAAXoO,EAAEpO,KACpB,OAAO,EAGT,IAAIsO,GAAkB3I,EAAcwI,GAEpC,GAAI/H,EAAU+H,GAAI,CAChB,IAAII,EAAUJ,EAAEI,UAChB,OAAOH,EAAEI,OAAM,SAASpF,EAAGD,GACzB,IAAI+D,EAAQqB,EAAQxL,OAAOkC,MAC3B,OAAOiI,GAASW,GAAGX,EAAM,GAAI9D,KAAOkF,GAAkBT,GAAGX,EAAM,GAAI/D,GACrE,KAAMoF,EAAQxL,OAAOuG,IACvB,CAEA,IAAImF,GAAU,EAEd,QAAelS,IAAX4R,EAAEnO,KACJ,QAAezD,IAAX6R,EAAEpO,KACyB,oBAAlBmO,EAAEjD,aACXiD,EAAEjD,kBAEC,CACLuD,GAAU,EACV,IAAIC,EAAIP,EACRA,EAAIC,EACJA,EAAIM,CACN,CAGF,IAAIC,GAAW,EACXC,EAAQR,EAAExG,WAAU,SAASwB,EAAGD,GAClC,GAAImF,GAAkBH,EAAEtY,IAAIuT,GACxBqF,GAAWZ,GAAGzE,EAAG+E,EAAEzP,IAAIyK,EAAGtC,KAAagH,GAAGM,EAAEzP,IAAIyK,EAAGtC,GAAUuC,GAE/D,OADAuF,GAAW,GACJ,CAEX,IAEA,OAAOA,GAAYR,EAAEnO,OAAS4O,CAChC,CAIE,SAASC,GAAO5J,EAAO6J,GACrB,KAAMjb,gBAAgBgb,IACpB,OAAO,IAAIA,GAAO5J,EAAO6J,GAI3B,GAFAjb,KAAKkb,OAAS9J,EACdpR,KAAKmM,UAAiBzD,IAAVuS,EAAsBE,IAAW1H,KAAKC,IAAI,EAAGuH,GACvC,IAAdjb,KAAKmM,KAAY,CACnB,GAAI4L,EACF,OAAOA,EAETA,EAAe/X,IACjB,CACF,CAkEF,SAASob,GAAUC,EAAWC,GAC5B,IAAKD,EAAW,MAAM,IAAIE,MAAMD,EAClC,CAIE,SAASE,GAAMC,EAAOnH,EAAKoH,GACzB,KAAM1b,gBAAgBwb,IACpB,OAAO,IAAIA,GAAMC,EAAOnH,EAAKoH,GAe/B,GAbAN,GAAmB,IAATM,EAAY,4BACtBD,EAAQA,GAAS,OACL/S,IAAR4L,IACFA,EAAM6G,KAERO,OAAgBhT,IAATgT,EAAqB,EAAIjI,KAAKkI,IAAID,GACrCpH,EAAMmH,IACRC,GAAQA,GAEV1b,KAAK4b,OAASH,EACdzb,KAAK6b,KAAOvH,EACZtU,KAAK8b,MAAQJ,EACb1b,KAAKmM,KAAOsH,KAAKC,IAAI,EAAGD,KAAKsI,MAAMzH,EAAMmH,GAASC,EAAO,GAAK,GAC5C,IAAd1b,KAAKmM,KAAY,CACnB,GAAI6L,EACF,OAAOA,EAETA,EAAchY,IAChB,CACF,CAyFA,SAASgc,KACP,MAAMhD,UAAU,WAClB,CAGuC,SAASiD,KAAmB,CAE1B,SAASC,KAAqB,CAElC,SAASC,KAAiB,CAjoBjE7K,EAAI1R,UAAUqY,KAAmB,EAIjChH,EAAYiH,GAAUtG,GAMpBsG,GAAStY,UAAUiL,IAAM,SAASF,EAAOyR,GACvC,OAAOpc,KAAKgC,IAAI2I,GAAS3K,KAAKoY,OAAOnE,EAAUjU,KAAM2K,IAAUyR,CACjE,EAEAlE,GAAStY,UAAUmU,UAAY,SAAS/L,EAAIyP,GAG1C,IAFA,IAAIU,EAAQnY,KAAKoY,OACbgB,EAAWjB,EAAMhZ,OAAS,EACrByU,EAAK,EAAGA,GAAMwF,EAAUxF,IAC/B,IAA0D,IAAtD5L,EAAGmQ,EAAMV,EAAU2B,EAAWxF,EAAKA,GAAKA,EAAI5T,MAC9C,OAAO4T,EAAK,EAGhB,OAAOA,CACT,EAEAsE,GAAStY,UAAU+X,WAAa,SAASzW,EAAMuW,GAC7C,IAAIU,EAAQnY,KAAKoY,OACbgB,EAAWjB,EAAMhZ,OAAS,EAC1ByU,EAAK,EACT,OAAO,IAAIwB,GAAS,WACjB,OAAOxB,EAAKwF,EACX1D,IACAL,EAAcnU,EAAM0S,EAAIuE,EAAMV,EAAU2B,EAAWxF,IAAOA,KAAM,GAEtE,EAIF3C,EAAYoH,GAAW5G,GAQrB4G,GAAUzY,UAAUiL,IAAM,SAASlL,EAAKyc,GACtC,YAAoB1T,IAAhB0T,GAA8Bpc,KAAKgC,IAAIrC,GAGpCK,KAAKuY,QAAQ5Y,GAFXyc,CAGX,EAEA/D,GAAUzY,UAAUoC,IAAM,SAASrC,GACjC,OAAOK,KAAKuY,QAAQ1Y,eAAeF,EACrC,EAEA0Y,GAAUzY,UAAUmU,UAAY,SAAS/L,EAAIyP,GAI3C,IAHA,IAAIa,EAAStY,KAAKuY,QACdpS,EAAOnG,KAAKwY,MACZY,EAAWjT,EAAKhH,OAAS,EACpByU,EAAK,EAAGA,GAAMwF,EAAUxF,IAAM,CACrC,IAAIjU,EAAMwG,EAAKsR,EAAU2B,EAAWxF,EAAKA,GACzC,IAAmC,IAA/B5L,EAAGsQ,EAAO3Y,GAAMA,EAAKK,MACvB,OAAO4T,EAAK,CAEhB,CACA,OAAOA,CACT,EAEAyE,GAAUzY,UAAU+X,WAAa,SAASzW,EAAMuW,GAC9C,IAAIa,EAAStY,KAAKuY,QACdpS,EAAOnG,KAAKwY,MACZY,EAAWjT,EAAKhH,OAAS,EACzByU,EAAK,EACT,OAAO,IAAIwB,GAAS,WAClB,IAAIzV,EAAMwG,EAAKsR,EAAU2B,EAAWxF,EAAKA,GACzC,OAAOA,IAAOwF,EACZ1D,IACAL,EAAcnU,EAAMvB,EAAK2Y,EAAO3Y,GACpC,GACF,EAEF0Y,GAAUzY,UAAU6S,IAAuB,EAG3CxB,EAAYwH,GAAa7G,GAMvB6G,GAAY7Y,UAAU2X,kBAAoB,SAASvP,EAAIyP,GACrD,GAAIA,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAE1C,IACIxC,EAAWc,EADA/V,KAAK0Y,WAEhB2D,EAAa,EACjB,GAAIxG,EAAWZ,GAEb,IADA,IAAIyG,IACKA,EAAOzG,EAAS/F,QAAQuG,OACY,IAAvCzN,EAAG0T,EAAKtK,MAAOiL,IAAcrc,QAKrC,OAAOqc,CACT,EAEA5D,GAAY7Y,UAAU0Z,mBAAqB,SAASpY,EAAMuW,GACxD,GAAIA,EACF,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAE7C,IACIxC,EAAWc,EADA/V,KAAK0Y,WAEpB,IAAK7C,EAAWZ,GACd,OAAO,IAAIG,EAASM,GAEtB,IAAI2G,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,OAAOwM,EAAKjG,KAAOiG,EAAOrG,EAAcnU,EAAMmb,IAAcX,EAAKtK,MACnE,GACF,EAIFH,EAAY0H,GAAa/G,GAMvB+G,GAAY/Y,UAAU2X,kBAAoB,SAASvP,EAAIyP,GACrD,GAAIA,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAK1C,IAHA,IAQIiE,EARAzG,EAAWjV,KAAK4Y,UAChBO,EAAQnZ,KAAK6Y,eACbwD,EAAa,EACVA,EAAalD,EAAMha,QACxB,IAAkD,IAA9C6I,EAAGmR,EAAMkD,GAAaA,IAAcrc,MACtC,OAAOqc,EAIX,OAASX,EAAOzG,EAAS/F,QAAQuG,MAAM,CACrC,IAAI6G,EAAMZ,EAAKtK,MAEf,GADA+H,EAAMkD,GAAcC,GACgB,IAAhCtU,EAAGsU,EAAKD,IAAcrc,MACxB,KAEJ,CACA,OAAOqc,CACT,EAEA1D,GAAY/Y,UAAU0Z,mBAAqB,SAASpY,EAAMuW,GACxD,GAAIA,EACF,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAE7C,IAAIxC,EAAWjV,KAAK4Y,UAChBO,EAAQnZ,KAAK6Y,eACbwD,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,GAAIiH,GAAclD,EAAMha,OAAQ,CAC9B,IAAIuc,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAETvC,EAAMkD,GAAcX,EAAKtK,KAC3B,CACA,OAAOiE,EAAcnU,EAAMmb,EAAYlD,EAAMkD,KAC/C,GACF,EAoQFpL,EAAY+J,GAAQpJ,GAgBlBoJ,GAAOpb,UAAUiX,SAAW,WAC1B,OAAkB,IAAd7W,KAAKmM,KACA,YAEF,YAAcnM,KAAKkb,OAAS,IAAMlb,KAAKmM,KAAO,UACvD,EAEA6O,GAAOpb,UAAUiL,IAAM,SAASF,EAAOyR,GACrC,OAAOpc,KAAKgC,IAAI2I,GAAS3K,KAAKkb,OAASkB,CACzC,EAEApB,GAAOpb,UAAU2c,SAAW,SAASC,GACnC,OAAOxC,GAAGha,KAAKkb,OAAQsB,EACzB,EAEAxB,GAAOpb,UAAUkL,MAAQ,SAASuJ,EAAOC,GACvC,IAAInI,EAAOnM,KAAKmM,KAChB,OAAOiI,EAAWC,EAAOC,EAAKnI,GAAQnM,KACpC,IAAIgb,GAAOhb,KAAKkb,OAAQzG,EAAWH,EAAKnI,GAAQoI,EAAaF,EAAOlI,GACxE,EAEA6O,GAAOpb,UAAU6X,QAAU,WACzB,OAAOzX,IACT,EAEAgb,GAAOpb,UAAUwG,QAAU,SAASoW,GAClC,OAAIxC,GAAGha,KAAKkb,OAAQsB,GACX,GAED,CACV,EAEAxB,GAAOpb,UAAU6c,YAAc,SAASD,GACtC,OAAIxC,GAAGha,KAAKkb,OAAQsB,GACXxc,KAAKmM,MAEN,CACV,EAEA6O,GAAOpb,UAAUmU,UAAY,SAAS/L,EAAIyP,GACxC,IAAK,IAAI7D,EAAK,EAAGA,EAAK5T,KAAKmM,KAAMyH,IAC/B,IAAkC,IAA9B5L,EAAGhI,KAAKkb,OAAQtH,EAAI5T,MACtB,OAAO4T,EAAK,EAGhB,OAAOA,CACT,EAEAoH,GAAOpb,UAAU+X,WAAa,SAASzW,EAAMuW,GAAU,IAAIiF,EAAS1c,KAC9D4T,EAAK,EACT,OAAO,IAAIwB,GAAS,WACjB,OAAOxB,EAAK8I,EAAOvQ,KAAOkJ,EAAcnU,EAAM0S,IAAM8I,EAAOxB,QAAUxF,GAAc,GAExF,EAEAsF,GAAOpb,UAAUwa,OAAS,SAASuC,GACjC,OAAOA,aAAiB3B,GACtBhB,GAAGha,KAAKkb,OAAQyB,EAAMzB,QACtBb,GAAUsC,EACd,EASF1L,EAAYuK,GAAO5J,GA2BjB4J,GAAM5b,UAAUiX,SAAW,WACzB,OAAkB,IAAd7W,KAAKmM,KACA,WAEF,WACLnM,KAAK4b,OAAS,MAAQ5b,KAAK6b,MAC1B7b,KAAK8b,MAAQ,EAAI,OAAS9b,KAAK8b,MAAQ,IAC1C,IACF,EAEAN,GAAM5b,UAAUiL,IAAM,SAASF,EAAOyR,GACpC,OAAOpc,KAAKgC,IAAI2I,GACd3K,KAAK4b,OAAS3H,EAAUjU,KAAM2K,GAAS3K,KAAK8b,MAC5CM,CACJ,EAEAZ,GAAM5b,UAAU2c,SAAW,SAASC,GAClC,IAAII,GAAiBJ,EAAcxc,KAAK4b,QAAU5b,KAAK8b,MACvD,OAAOc,GAAiB,GACtBA,EAAgB5c,KAAKmM,MACrByQ,IAAkBnJ,KAAKoJ,MAAMD,EACjC,EAEApB,GAAM5b,UAAUkL,MAAQ,SAASuJ,EAAOC,GACtC,OAAIF,EAAWC,EAAOC,EAAKtU,KAAKmM,MACvBnM,MAETqU,EAAQE,EAAaF,EAAOrU,KAAKmM,OACjCmI,EAAMG,EAAWH,EAAKtU,KAAKmM,QAChBkI,EACF,IAAImH,GAAM,EAAG,GAEf,IAAIA,GAAMxb,KAAK6K,IAAIwJ,EAAOrU,KAAK6b,MAAO7b,KAAK6K,IAAIyJ,EAAKtU,KAAK6b,MAAO7b,KAAK8b,OAC9E,EAEAN,GAAM5b,UAAUwG,QAAU,SAASoW,GACjC,IAAIM,EAAcN,EAAcxc,KAAK4b,OACrC,GAAIkB,EAAc9c,KAAK8b,QAAU,EAAG,CAClC,IAAInR,EAAQmS,EAAc9c,KAAK8b,MAC/B,GAAInR,GAAS,GAAKA,EAAQ3K,KAAKmM,KAC7B,OAAOxB,CAEX,CACA,OAAQ,CACV,EAEA6Q,GAAM5b,UAAU6c,YAAc,SAASD,GACrC,OAAOxc,KAAKoG,QAAQoW,EACtB,EAEAhB,GAAM5b,UAAUmU,UAAY,SAAS/L,EAAIyP,GAIvC,IAHA,IAAI2B,EAAWpZ,KAAKmM,KAAO,EACvBuP,EAAO1b,KAAK8b,MACZ1K,EAAQqG,EAAUzX,KAAK4b,OAASxC,EAAWsC,EAAO1b,KAAK4b,OAClDhI,EAAK,EAAGA,GAAMwF,EAAUxF,IAAM,CACrC,IAA4B,IAAxB5L,EAAGoJ,EAAOwC,EAAI5T,MAChB,OAAO4T,EAAK,EAEdxC,GAASqG,GAAWiE,EAAOA,CAC7B,CACA,OAAO9H,CACT,EAEA4H,GAAM5b,UAAU+X,WAAa,SAASzW,EAAMuW,GAC1C,IAAI2B,EAAWpZ,KAAKmM,KAAO,EACvBuP,EAAO1b,KAAK8b,MACZ1K,EAAQqG,EAAUzX,KAAK4b,OAASxC,EAAWsC,EAAO1b,KAAK4b,OACvDhI,EAAK,EACT,OAAO,IAAIwB,GAAS,WAClB,IAAIG,EAAInE,EAER,OADAA,GAASqG,GAAWiE,EAAOA,EACpB9H,EAAKwF,EAAW1D,IAAiBL,EAAcnU,EAAM0S,IAAM2B,EACpE,GACF,EAEAiG,GAAM5b,UAAUwa,OAAS,SAASuC,GAChC,OAAOA,aAAiBnB,GACtBxb,KAAK4b,SAAWe,EAAMf,QACtB5b,KAAK6b,OAASc,EAAMd,MACpB7b,KAAK8b,QAAUa,EAAMb,MACrBzB,GAAUra,KAAM2c,EACpB,EAKF1L,EAAY+K,GAAY7K,GAMxBF,EAAYgL,GAAiBD,IAE7B/K,EAAYiL,GAAmBF,IAE/B/K,EAAYkL,GAAeH,IAG3BA,GAAWtJ,MAAQuJ,GACnBD,GAAWrJ,QAAUuJ,GACrBF,GAAW5U,IAAM+U,GAEjB,IAAIY,GACmB,oBAAdtJ,KAAKsJ,OAAqD,IAA9BtJ,KAAKsJ,KAAK,WAAY,GACzDtJ,KAAKsJ,KACL,SAAczC,EAAGC,GAGf,IAAIyC,EAAQ,OAFZ1C,GAAQ,GAGJ9Y,EAAQ,OAFZ+Y,GAAQ,GAIR,OAAQyC,EAAIxb,IAAS8Y,IAAM,IAAM9Y,EAAIwb,GAAKzC,IAAM,KAAQ,KAAQ,GAAK,CACvE,EAMF,SAAS0C,GAAIC,GACX,OAASA,IAAQ,EAAK,WAAqB,WAANA,CACvC,CAEA,SAASC,GAAKvX,GACZ,IAAU,IAANA,GAAqB,OAANA,QAAoB8C,IAAN9C,EAC/B,OAAO,EAET,GAAyB,oBAAdA,EAAEuU,WAED,KADVvU,EAAIA,EAAEuU,YACmB,OAANvU,QAAoB8C,IAAN9C,GAC/B,OAAO,EAGX,IAAU,IAANA,EACF,OAAO,EAET,IAAI1E,SAAc0E,EAClB,GAAa,WAAT1E,EAAmB,CACrB,IAAIkc,EAAQ,EAAJxX,EAIR,IAHIwX,IAAMxX,IACRwX,GAAS,WAAJxX,GAEAA,EAAI,YAETwX,GADAxX,GAAK,WAGP,OAAOqX,GAAIG,EACb,CACA,GAAa,WAATlc,EACF,OAAO0E,EAAEzG,OAASke,GAA+BC,GAAiB1X,GAAK2X,GAAW3X,GAEpF,GAA0B,oBAAfA,EAAE4X,SACX,OAAO5X,EAAE4X,WAEX,GAAa,WAATtc,EACF,OAAOuc,GAAU7X,GAEnB,GAA0B,oBAAfA,EAAEiR,SACX,OAAO0G,GAAW3X,EAAEiR,YAEtB,MAAM,IAAI0E,MAAM,cAAgBra,EAAO,qBACzC,CAEA,SAASoc,GAAiBI,GACxB,IAAIP,EAAOQ,GAAgBD,GAU3B,YATahV,IAATyU,IACFA,EAAOI,GAAWG,GACdE,KAA2BC,KAC7BD,GAAyB,EACzBD,GAAkB,CAAC,GAErBC,KACAD,GAAgBD,GAAUP,GAErBA,CACT,CAGA,SAASI,GAAWG,GAQlB,IADA,IAAIP,EAAO,EACFvJ,EAAK,EAAGA,EAAK8J,EAAOve,OAAQyU,IACnCuJ,EAAO,GAAKA,EAAOO,EAAOI,WAAWlK,GAAM,EAE7C,OAAOqJ,GAAIE,EACb,CAEA,SAASM,GAAUzR,GACjB,IAAImR,EACJ,GAAIY,SAEWrV,KADbyU,EAAOa,GAAQnT,IAAImB,IAEjB,OAAOmR,EAKX,QAAazU,KADbyU,EAAOnR,EAAIiS,KAET,OAAOd,EAGT,IAAKe,GAAmB,CAEtB,QAAaxV,KADbyU,EAAOnR,EAAImS,sBAAwBnS,EAAImS,qBAAqBF,KAE1D,OAAOd,EAIT,QAAazU,KADbyU,EAAOiB,GAAcpS,IAEnB,OAAOmR,CAEX,CAOA,GALAA,IAASkB,GACQ,WAAbA,KACFA,GAAa,GAGXN,GACFC,GAAQlP,IAAI9C,EAAKmR,OACZ,SAAqBzU,IAAjB4V,KAAoD,IAAtBA,GAAatS,GACpD,MAAM,IAAIuP,MAAM,mDACX,GAAI2C,GACT5e,OAAOif,eAAevS,EAAKiS,GAAc,CACvC,YAAc,EACd,cAAgB,EAChB,UAAY,EACZ,MAASd,SAEN,QAAiCzU,IAA7BsD,EAAImS,sBACJnS,EAAImS,uBAAyBnS,EAAI0C,YAAY9O,UAAUue,qBAKhEnS,EAAImS,qBAAuB,WACzB,OAAOne,KAAK0O,YAAY9O,UAAUue,qBAAqBpe,MAAMC,KAAMZ,UACrE,EACA4M,EAAImS,qBAAqBF,IAAgBd,MACpC,SAAqBzU,IAAjBsD,EAAIwS,SAOb,MAAM,IAAIjD,MAAM,sDAFhBvP,EAAIiS,IAAgBd,CAGtB,EAEA,OAAOA,CACT,CAGA,IAAImB,GAAehf,OAAOgf,aAGtBJ,GAAqB,WACvB,IAEE,OADA5e,OAAOif,eAAe,CAAC,EAAG,IAAK,CAAC,IACzB,CACT,CAAE,MAAO1f,GACP,OAAO,CACT,CACF,CAPwB,GAWxB,SAASuf,GAAcK,GACrB,GAAIA,GAAQA,EAAKD,SAAW,EAC1B,OAAQC,EAAKD,UACX,KAAK,EACH,OAAOC,EAAKC,SACd,KAAK,EACH,OAAOD,EAAKE,iBAAmBF,EAAKE,gBAAgBD,SAG5D,CAGA,IACIV,GADAD,GAAkC,oBAAZa,QAEtBb,KACFC,GAAU,IAAIY,SAGhB,IAAIP,GAAa,EAEbJ,GAAe,oBACG,oBAAXjJ,SACTiJ,GAAejJ,OAAOiJ,KAGxB,IAAIZ,GAA+B,GAC/BQ,GAA6B,IAC7BD,GAAyB,EACzBD,GAAkB,CAAC,EAEvB,SAASkB,GAAkB1S,GACzBiP,GACEjP,IAASgP,IACT,oDAEJ,CAME,SAASpN,GAAIqD,GACX,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsB0N,KAC7CC,GAAM3N,KAAWmB,EAAUnB,GAASA,EACpC0N,KAAWE,eAAc,SAASxT,GAChC,IAAIsI,EAAOvC,EAAcH,GACzByN,GAAkB/K,EAAK3H,MACvB2H,EAAKzM,SAAQ,SAASkO,EAAGD,GAAK,OAAO9J,EAAIsD,IAAIwG,EAAGC,EAAE,GACpD,GACJ,CAgKF,SAASwJ,GAAME,GACb,SAAUA,IAAYA,EAASC,IACjC,CA9KAjO,EAAYlD,GAAKkO,IAcflO,GAAInO,UAAUiX,SAAW,WACvB,OAAO7W,KAAKoX,WAAW,QAAS,IAClC,EAIArJ,GAAInO,UAAUiL,IAAM,SAASyK,EAAG8G,GAC9B,OAAOpc,KAAKmf,MACVnf,KAAKmf,MAAMtU,IAAI,OAAGnC,EAAW4M,EAAG8G,GAChCA,CACJ,EAIArO,GAAInO,UAAUkP,IAAM,SAASwG,EAAGC,GAC9B,OAAO6J,GAAUpf,KAAMsV,EAAGC,EAC5B,EAEAxH,GAAInO,UAAUyf,MAAQ,SAASC,EAAS/J,GACtC,OAAOvV,KAAKuf,SAASD,EAAStM,GAAS,WAAa,OAAOuC,CAAC,GAC9D,EAEAxH,GAAInO,UAAU4f,OAAS,SAASlK,GAC9B,OAAO8J,GAAUpf,KAAMsV,EAAGtC,EAC5B,EAEAjF,GAAInO,UAAU6f,SAAW,SAASH,GAChC,OAAOtf,KAAKuf,SAASD,GAAS,WAAa,OAAOtM,CAAO,GAC3D,EAEAjF,GAAInO,UAAU8f,OAAS,SAASpK,EAAG8G,EAAauD,GAC9C,OAA4B,IAArBvgB,UAAUD,OACfmW,EAAEtV,MACFA,KAAKuf,SAAS,CAACjK,GAAI8G,EAAauD,EACpC,EAEA5R,GAAInO,UAAU2f,SAAW,SAASD,EAASlD,EAAauD,GACjDA,IACHA,EAAUvD,EACVA,OAAc1T,GAEhB,IAAIkX,EAAeC,GACjB7f,KACA8f,GAAcR,GACdlD,EACAuD,GAEF,OAAOC,IAAiB5M,OAAUtK,EAAYkX,CAChD,EAEA7R,GAAInO,UAAUmgB,MAAQ,WACpB,OAAkB,IAAd/f,KAAKmM,KACAnM,KAELA,KAAKggB,WACPhgB,KAAKmM,KAAO,EACZnM,KAAKmf,MAAQ,KACbnf,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEF8e,IACT,EAIA/Q,GAAInO,UAAUyD,MAAQ,WACpB,OAAO6c,GAAiBlgB,UAAM0I,EAAWtJ,UAC3C,EAEA2O,GAAInO,UAAUugB,UAAY,SAASC,GACjC,OAAOF,GAAiBlgB,KAAMogB,EADwBpP,EAAQlR,KAAKV,UAAW,GAEhF,EAEA2O,GAAInO,UAAUygB,QAAU,SAASf,GAAU,IAAIgB,EAAQtP,EAAQlR,KAAKV,UAAW,GAC7E,OAAOY,KAAKuf,SACVD,EACAR,MACA,SAASyB,GAAK,MAA0B,oBAAZA,EAAEld,MAC5Bkd,EAAEld,MAAMtD,MAAMwgB,EAAGD,GACjBA,EAAMA,EAAMnhB,OAAS,EAAE,GAE7B,EAEA4O,GAAInO,UAAU4gB,UAAY,WACxB,OAAON,GAAiBlgB,KAAMygB,GAAYrhB,UAC5C,EAEA2O,GAAInO,UAAU8gB,cAAgB,SAASN,GAAS,IAAIE,EAAQtP,EAAQlR,KAAKV,UAAW,GAClF,OAAO8gB,GAAiBlgB,KAAM2gB,GAAeP,GAASE,EACxD,EAEAvS,GAAInO,UAAUghB,YAAc,SAAStB,GAAU,IAAIgB,EAAQtP,EAAQlR,KAAKV,UAAW,GACjF,OAAOY,KAAKuf,SACVD,EACAR,MACA,SAASyB,GAAK,MAA8B,oBAAhBA,EAAEC,UAC5BD,EAAEC,UAAUzgB,MAAMwgB,EAAGD,GACrBA,EAAMA,EAAMnhB,OAAS,EAAE,GAE7B,EAEA4O,GAAInO,UAAUihB,KAAO,SAASC,GAE5B,OAAOC,GAAWC,GAAYhhB,KAAM8gB,GACtC,EAEA/S,GAAInO,UAAUqhB,OAAS,SAASC,EAAQJ,GAEtC,OAAOC,GAAWC,GAAYhhB,KAAM8gB,EAAYI,GAClD,EAIAnT,GAAInO,UAAUof,cAAgB,SAAShX,GACrC,IAAImZ,EAAUnhB,KAAKohB,YAEnB,OADApZ,EAAGmZ,GACIA,EAAQE,aAAeF,EAAQG,cAActhB,KAAKggB,WAAahgB,IACxE,EAEA+N,GAAInO,UAAUwhB,UAAY,WACxB,OAAOphB,KAAKggB,UAAYhgB,KAAOA,KAAKshB,cAAc,IAAIjO,EACxD,EAEAtF,GAAInO,UAAU2hB,YAAc,WAC1B,OAAOvhB,KAAKshB,eACd,EAEAvT,GAAInO,UAAUyhB,WAAa,WACzB,OAAOrhB,KAAKigB,SACd,EAEAlS,GAAInO,UAAU+X,WAAa,SAASzW,EAAMuW,GACxC,OAAO,IAAI+J,GAAYxhB,KAAMkB,EAAMuW,EACrC,EAEA1J,GAAInO,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KACxDqc,EAAa,EAKjB,OAJArc,KAAKmf,OAASnf,KAAKmf,MAAMsC,SAAQ,SAASpI,GAExC,OADAgD,IACOrU,EAAGqR,EAAM,GAAIA,EAAM,GAAIqD,EAChC,GAAGjF,GACI4E,CACT,EAEAtO,GAAInO,UAAU0hB,cAAgB,SAASI,GACrC,OAAIA,IAAY1hB,KAAKggB,UACZhgB,KAEJ0hB,EAKEC,GAAQ3hB,KAAKmM,KAAMnM,KAAKmf,MAAOuC,EAAS1hB,KAAKwa,SAJlDxa,KAAKggB,UAAY0B,EACjB1hB,KAAKigB,WAAY,EACVjgB,KAGX,EAOF+N,GAAIgR,MAAQA,GAEZ,IA2ZI6C,GA3ZA1C,GAAkB,wBAElB2C,GAAe9T,GAAInO,UAUrB,SAASkiB,GAAaJ,EAAShH,GAC7B1a,KAAK0hB,QAAUA,EACf1hB,KAAK0a,QAAUA,CACjB,CA+DA,SAASqH,GAAkBL,EAASM,EAAQC,GAC1CjiB,KAAK0hB,QAAUA,EACf1hB,KAAKgiB,OAASA,EACdhiB,KAAKiiB,MAAQA,CACf,CAiEA,SAASC,GAAiBR,EAASS,EAAOF,GACxCjiB,KAAK0hB,QAAUA,EACf1hB,KAAKmiB,MAAQA,EACbniB,KAAKiiB,MAAQA,CACf,CAsDA,SAASG,GAAkBV,EAASW,EAAS3H,GAC3C1a,KAAK0hB,QAAUA,EACf1hB,KAAKqiB,QAAUA,EACfriB,KAAK0a,QAAUA,CACjB,CAwEA,SAAS4H,GAAUZ,EAASW,EAAShJ,GACnCrZ,KAAK0hB,QAAUA,EACf1hB,KAAKqiB,QAAUA,EACfriB,KAAKqZ,MAAQA,CACf,CA+DA,SAASmI,GAAYhW,EAAKtK,EAAMuW,GAC9BzX,KAAKuiB,MAAQrhB,EACblB,KAAKwiB,SAAW/K,EAChBzX,KAAKyiB,OAASjX,EAAI2T,OAASuD,GAAiBlX,EAAI2T,MAClD,CAqCF,SAASwD,GAAiBzhB,EAAMmY,GAC9B,OAAOhE,EAAcnU,EAAMmY,EAAM,GAAIA,EAAM,GAC7C,CAEA,SAASqJ,GAAiBjE,EAAMmE,GAC9B,MAAO,CACLnE,KAAMA,EACN9T,MAAO,EACPkY,OAAQD,EAEZ,CAEA,SAASjB,GAAQxV,EAAM2W,EAAMpB,EAASvE,GACpC,IAAI3R,EAAMlM,OAAOmP,OAAOoT,IAMxB,OALArW,EAAIW,KAAOA,EACXX,EAAI2T,MAAQ2D,EACZtX,EAAIwU,UAAY0B,EAChBlW,EAAIgP,OAAS2C,EACb3R,EAAIyU,WAAY,EACTzU,CACT,CAGA,SAASsT,KACP,OAAO8C,KAAcA,GAAYD,GAAQ,GAC3C,CAEA,SAASvC,GAAU5T,EAAK8J,EAAGC,GACzB,IAAIwN,EACAC,EACJ,GAAKxX,EAAI2T,MAMF,CACL,IAAI8D,EAAgB9P,EAAQF,GACxBiQ,EAAW/P,EAAQD,GAEvB,GADA6P,EAAUI,GAAW3X,EAAI2T,MAAO3T,EAAIwU,UAAW,OAAGtX,EAAW4M,EAAGC,EAAG0N,EAAeC,IAC7EA,EAAS9R,MACZ,OAAO5F,EAETwX,EAAUxX,EAAIW,MAAQ8W,EAAc7R,MAAQmE,IAAMvC,GAAW,EAAI,EAAI,EACvE,KAdgB,CACd,GAAIuC,IAAMvC,EACR,OAAOxH,EAETwX,EAAU,EACVD,EAAU,IAAIjB,GAAatW,EAAIwU,UAAW,CAAC,CAAC1K,EAAGC,IACjD,CASA,OAAI/J,EAAIwU,WACNxU,EAAIW,KAAO6W,EACXxX,EAAI2T,MAAQ4D,EACZvX,EAAIgP,YAAS9R,EACb8C,EAAIyU,WAAY,EACTzU,GAEFuX,EAAUpB,GAAQqB,EAASD,GAAWjE,IAC/C,CAEA,SAASqE,GAAW1E,EAAMiD,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAC5E,OAAKzE,EAQEA,EAAKiB,OAAOgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAPjE9R,IAAU4B,EACLyL,GAETrL,EAAO8P,GACP9P,EAAO6P,GACA,IAAIX,GAAUZ,EAASW,EAAS,CAAC1iB,EAAKyR,IAGjD,CAEA,SAASiS,GAAW5E,GAClB,OAAOA,EAAK/P,cAAgB4T,IAAa7D,EAAK/P,cAAgB0T,EAChE,CAEA,SAASkB,GAAc7E,EAAMiD,EAAS0B,EAAOf,EAAShJ,GACpD,GAAIoF,EAAK4D,UAAYA,EACnB,OAAO,IAAID,GAAkBV,EAASW,EAAS,CAAC5D,EAAKpF,MAAOA,IAG9D,IAGIkK,EAHAC,GAAkB,IAAVJ,EAAc3E,EAAK4D,QAAU5D,EAAK4D,UAAYe,GAASrQ,EAC/D0Q,GAAkB,IAAVL,EAAcf,EAAUA,IAAYe,GAASrQ,EAOzD,OAAO,IAAIgP,GAAkBL,EAAU,GAAK8B,EAAS,GAAKC,EAJ9CD,IAASC,EACnB,CAACH,GAAc7E,EAAMiD,EAAS0B,EAAQvQ,EAAOwP,EAAShJ,KACpDkK,EAAU,IAAIjB,GAAUZ,EAASW,EAAShJ,GAASmK,EAAOC,EAAO,CAAChF,EAAM8E,GAAW,CAACA,EAAS9E,IAGnG,CAEA,SAASiF,GAAYhC,EAAShH,EAAS/a,EAAKyR,GACrCsQ,IACHA,EAAU,IAAIrO,GAGhB,IADA,IAAIoL,EAAO,IAAI6D,GAAUZ,EAASvE,GAAKxd,GAAM,CAACA,EAAKyR,IAC1CwC,EAAK,EAAGA,EAAK8G,EAAQvb,OAAQyU,IAAM,CAC1C,IAAIyF,EAAQqB,EAAQ9G,GACpB6K,EAAOA,EAAKiB,OAAOgC,EAAS,OAAGhZ,EAAW2Q,EAAM,GAAIA,EAAM,GAC5D,CACA,OAAOoF,CACT,CAEA,SAASkF,GAAUjC,EAASO,EAAOE,EAAOyB,GAIxC,IAHA,IAAI5B,EAAS,EACT6B,EAAW,EACXC,EAAc,IAAI7kB,MAAMkjB,GACnBvO,EAAK,EAAGmQ,EAAM,EAAGvQ,EAAMyO,EAAM9iB,OAAQyU,EAAKJ,EAAKI,IAAMmQ,IAAQ,EAAG,CACvE,IAAItF,EAAOwD,EAAMrO,QACJlL,IAAT+V,GAAsB7K,IAAOgQ,IAC/B5B,GAAU+B,EACVD,EAAYD,KAAcpF,EAE9B,CACA,OAAO,IAAIsD,GAAkBL,EAASM,EAAQ8B,EAChD,CAEA,SAASE,GAAYtC,EAASO,EAAOD,EAAQiC,EAAWxF,GAGtD,IAFA,IAAI0D,EAAQ,EACR+B,EAAgB,IAAIjlB,MAAM6T,GACrBc,EAAK,EAAc,IAAXoO,EAAcpO,IAAMoO,KAAY,EAC/CkC,EAActQ,GAAe,EAAToO,EAAaC,EAAME,UAAWzZ,EAGpD,OADAwb,EAAcD,GAAaxF,EACpB,IAAIyD,GAAiBR,EAASS,EAAQ,EAAG+B,EAClD,CAEA,SAAShE,GAAiB1U,EAAK4U,EAAQ+D,GAErC,IADA,IAAI7D,EAAQ,GACH1M,EAAK,EAAGA,EAAKuQ,EAAUhlB,OAAQyU,IAAM,CAC5C,IAAIxC,EAAQ+S,EAAUvQ,GAClBE,EAAOvC,EAAcH,GACpBC,EAAWD,KACd0C,EAAOA,EAAKtI,KAAI,SAAS+J,GAAK,OAAOgE,GAAOhE,EAAE,KAEhD+K,EAAMvc,KAAK+P,EACb,CACA,OAAOsQ,GAAwB5Y,EAAK4U,EAAQE,EAC9C,CAEA,SAASG,GAAW4D,EAAUjT,EAAOzR,GACnC,OAAO0kB,GAAYA,EAAS7D,WAAanP,EAAWD,GAClDiT,EAAS7D,UAAUpP,GACnB4I,GAAGqK,EAAUjT,GAASiT,EAAWjT,CACrC,CAEA,SAASuP,GAAeP,GACtB,OAAO,SAASiE,EAAUjT,EAAOzR,GAC/B,GAAI0kB,GAAYA,EAAS3D,eAAiBrP,EAAWD,GACnD,OAAOiT,EAAS3D,cAAcN,EAAQhP,GAExC,IAAIkT,EAAYlE,EAAOiE,EAAUjT,EAAOzR,GACxC,OAAOqa,GAAGqK,EAAUC,GAAaD,EAAWC,CAC9C,CACF,CAEA,SAASF,GAAwBG,EAAYnE,EAAQE,GAEnD,OAAqB,KADrBA,EAAQA,EAAMpe,QAAO,SAASsiB,GAAK,OAAkB,IAAXA,EAAErY,IAAU,KAC5ChN,OACDolB,EAEe,IAApBA,EAAWpY,MAAeoY,EAAWvE,WAA8B,IAAjBM,EAAMnhB,OAGrDolB,EAAWvF,eAAc,SAASuF,GAUvC,IATA,IAAIE,EAAerE,EACjB,SAAShP,EAAOzR,GACd4kB,EAAW7E,OAAO/f,EAAKqT,GAAS,SAASqR,GACtC,OAAOA,IAAarR,EAAU5B,EAAQgP,EAAOiE,EAAUjT,EAAOzR,EAAI,GAEvE,EACA,SAASyR,EAAOzR,GACd4kB,EAAWzV,IAAInP,EAAKyR,EACtB,EACOwC,EAAK,EAAGA,EAAK0M,EAAMnhB,OAAQyU,IAClC0M,EAAM1M,GAAIvM,QAAQod,EAEtB,IAfSF,EAAW7V,YAAY4R,EAAM,GAgBxC,CAEA,SAAST,GAAgBwE,EAAUK,EAAatI,EAAauD,GAC3D,IAAIgF,EAAWN,IAAarR,EACxB0I,EAAOgJ,EAAYxV,OACvB,GAAIwM,EAAKjG,KAAM,CACb,IAAImP,EAAgBD,EAAWvI,EAAciI,EACzCQ,EAAWlF,EAAQiF,GACvB,OAAOC,IAAaD,EAAgBP,EAAWQ,CACjD,CACAzJ,GACEuJ,GAAaN,GAAYA,EAASvV,IAClC,mBAEF,IAAInP,EAAM+b,EAAKtK,MACX0T,EAAeH,EAAW3R,EAAUqR,EAASxZ,IAAIlL,EAAKqT,GACtD+R,EAAclF,GAChBiF,EACAJ,EACAtI,EACAuD,GAEF,OAAOoF,IAAgBD,EAAeT,EACpCU,IAAgB/R,EAAUqR,EAAS7E,OAAO7f,IACzCglB,EAAW7F,KAAauF,GAAUvV,IAAInP,EAAKolB,EAChD,CAEA,SAASC,GAASR,GAMhB,OAHAA,GADAA,GAAS,WADTA,GAAUA,GAAK,EAAK,cACKA,GAAK,EAAK,aACzBA,GAAK,GAAM,UACrBA,GAASA,GAAK,EAEH,KADXA,GAASA,GAAK,GAEhB,CAEA,SAASnF,GAAMlH,EAAO8M,EAAK3I,EAAK4I,GAC9B,IAAIC,EAAWD,EAAU/M,EAAQ7E,EAAQ6E,GAEzC,OADAgN,EAASF,GAAO3I,EACT6I,CACT,CAEA,SAASC,GAASjN,EAAO8M,EAAK3I,EAAK4I,GACjC,IAAIG,EAASlN,EAAMhZ,OAAS,EAC5B,GAAI+lB,GAAWD,EAAM,IAAMI,EAEzB,OADAlN,EAAM8M,GAAO3I,EACNnE,EAIT,IAFA,IAAIgN,EAAW,IAAIlmB,MAAMomB,GACrBC,EAAQ,EACH1R,EAAK,EAAGA,EAAKyR,EAAQzR,IACxBA,IAAOqR,GACTE,EAASvR,GAAM0I,EACfgJ,GAAS,GAETH,EAASvR,GAAMuE,EAAMvE,EAAK0R,GAG9B,OAAOH,CACT,CAEA,SAASI,GAAUpN,EAAO8M,EAAKC,GAC7B,IAAIG,EAASlN,EAAMhZ,OAAS,EAC5B,GAAI+lB,GAAWD,IAAQI,EAErB,OADAlN,EAAMqN,MACCrN,EAIT,IAFA,IAAIgN,EAAW,IAAIlmB,MAAMomB,GACrBC,EAAQ,EACH1R,EAAK,EAAGA,EAAKyR,EAAQzR,IACxBA,IAAOqR,IACTK,EAAQ,GAEVH,EAASvR,GAAMuE,EAAMvE,EAAK0R,GAE5B,OAAOH,CACT,CA5nBAtD,GAAa3C,KAAmB,EAChC2C,GAAajP,GAAUiP,GAAarC,OACpCqC,GAAa4D,SAAW5D,GAAapC,SAYnCqC,GAAaliB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,GAEzD,IADA,IAAI1B,EAAU1a,KAAK0a,QACV9G,EAAK,EAAGJ,EAAMkH,EAAQvb,OAAQyU,EAAKJ,EAAKI,IAC/C,GAAIoG,GAAGra,EAAK+a,EAAQ9G,GAAI,IACtB,OAAO8G,EAAQ9G,GAAI,GAGvB,OAAOwI,CACT,EAEA0F,GAAaliB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAK3F,IAJA,IAAIwC,EAAUtU,IAAU4B,EAEpB0H,EAAU1a,KAAK0a,QACfuK,EAAM,EACDzR,EAAMkH,EAAQvb,OAAQ8lB,EAAMzR,IAC/BwG,GAAGra,EAAK+a,EAAQuK,GAAK,IADeA,KAK1C,IAAIU,EAASV,EAAMzR,EAEnB,GAAImS,EAASjL,EAAQuK,GAAK,KAAO7T,EAAQsU,EACvC,OAAO1lB,KAMT,GAHAoT,EAAO8P,IACNwC,IAAYC,IAAWvS,EAAO6P,IAE3ByC,GAA8B,IAAnBhL,EAAQvb,OAAvB,CAIA,IAAKwmB,IAAWD,GAAWhL,EAAQvb,QAAUymB,GAC3C,OAAOlC,GAAYhC,EAAShH,EAAS/a,EAAKyR,GAG5C,IAAIyU,EAAanE,GAAWA,IAAY1hB,KAAK0hB,QACzCoE,EAAaD,EAAanL,EAAUpH,EAAQoH,GAYhD,OAVIiL,EACED,EACFT,IAAQzR,EAAM,EAAIsS,EAAWN,MAASM,EAAWb,GAAOa,EAAWN,MAEnEM,EAAWb,GAAO,CAACtlB,EAAKyR,GAG1B0U,EAAW/hB,KAAK,CAACpE,EAAKyR,IAGpByU,GACF7lB,KAAK0a,QAAUoL,EACR9lB,MAGF,IAAI8hB,GAAaJ,EAASoE,EAxBjC,CAyBF,EAWA/D,GAAkBniB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,QAC9C1T,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAEjB,IAAIokB,EAAO,KAAiB,IAAVX,EAAcf,EAAUA,IAAYe,GAASrQ,GAC3DiP,EAAShiB,KAAKgiB,OAClB,OAA0B,KAAlBA,EAAS+B,GAAa3H,EAC5Bpc,KAAKiiB,MAAM+C,GAAShD,EAAU+B,EAAM,IAAKlZ,IAAIuY,EAAQvQ,EAAOwP,EAAS1iB,EAAKyc,EAC9E,EAEA2F,GAAkBniB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,QAChFxa,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAEjB,IAAIomB,GAAyB,IAAV3C,EAAcf,EAAUA,IAAYe,GAASrQ,EAC5DgR,EAAM,GAAKgC,EACX/D,EAAShiB,KAAKgiB,OACd2D,EAA4B,KAAlB3D,EAAS+B,GAEvB,IAAK4B,GAAUvU,IAAU4B,EACvB,OAAOhT,KAGT,IAAIilB,EAAMD,GAAShD,EAAU+B,EAAM,GAC/B9B,EAAQjiB,KAAKiiB,MACbxD,EAAOkH,EAAS1D,EAAMgD,QAAOvc,EAC7B6a,EAAUJ,GAAW1E,EAAMiD,EAAS0B,EAAQvQ,EAAOwP,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAE3F,GAAIK,IAAY9E,EACd,OAAOze,KAGT,IAAK2lB,GAAUpC,GAAWtB,EAAM9iB,QAAU6mB,GACxC,OAAOhC,GAAYtC,EAASO,EAAOD,EAAQ+D,EAAaxC,GAG1D,GAAIoC,IAAWpC,GAA4B,IAAjBtB,EAAM9iB,QAAgBkkB,GAAWpB,EAAY,EAANgD,IAC/D,OAAOhD,EAAY,EAANgD,GAGf,GAAIU,GAAUpC,GAA4B,IAAjBtB,EAAM9iB,QAAgBkkB,GAAWE,GACxD,OAAOA,EAGT,IAAIsC,EAAanE,GAAWA,IAAY1hB,KAAK0hB,QACzCuE,EAAYN,EAASpC,EAAUvB,EAASA,EAAS+B,EAAM/B,EAAS+B,EAChEmC,EAAWP,EAASpC,EACtBlE,GAAM4C,EAAOgD,EAAK1B,EAASsC,GAC3BN,GAAUtD,EAAOgD,EAAKY,GACtBT,GAASnD,EAAOgD,EAAK1B,EAASsC,GAEhC,OAAIA,GACF7lB,KAAKgiB,OAASiE,EACdjmB,KAAKiiB,MAAQiE,EACNlmB,MAGF,IAAI+hB,GAAkBL,EAASuE,EAAWC,EACnD,EAWAhE,GAAiBtiB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,QAC7C1T,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAEjB,IAAIslB,GAAiB,IAAV7B,EAAcf,EAAUA,IAAYe,GAASrQ,EACpD0L,EAAOze,KAAKiiB,MAAMgD,GACtB,OAAOxG,EAAOA,EAAK5T,IAAIuY,EAAQvQ,EAAOwP,EAAS1iB,EAAKyc,GAAeA,CACrE,EAEA8F,GAAiBtiB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,QAC/Exa,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAEjB,IAAIslB,GAAiB,IAAV7B,EAAcf,EAAUA,IAAYe,GAASrQ,EACpD2S,EAAUtU,IAAU4B,EACpBiP,EAAQjiB,KAAKiiB,MACbxD,EAAOwD,EAAMgD,GAEjB,GAAIS,IAAYjH,EACd,OAAOze,KAGT,IAAIujB,EAAUJ,GAAW1E,EAAMiD,EAAS0B,EAAQvQ,EAAOwP,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAC3F,GAAIK,IAAY9E,EACd,OAAOze,KAGT,IAAImmB,EAAWnmB,KAAKmiB,MACpB,GAAK1D,GAEE,IAAK8E,KACV4C,EACeC,GACb,OAAOzC,GAAUjC,EAASO,EAAOkE,EAAUlB,QAJ7CkB,IAQF,IAAIN,EAAanE,GAAWA,IAAY1hB,KAAK0hB,QACzCwE,EAAW7G,GAAM4C,EAAOgD,EAAK1B,EAASsC,GAE1C,OAAIA,GACF7lB,KAAKmiB,MAAQgE,EACbnmB,KAAKiiB,MAAQiE,EACNlmB,MAGF,IAAIkiB,GAAiBR,EAASyE,EAAUD,EACjD,EAWA9D,GAAkBxiB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,GAE9D,IADA,IAAI1B,EAAU1a,KAAK0a,QACV9G,EAAK,EAAGJ,EAAMkH,EAAQvb,OAAQyU,EAAKJ,EAAKI,IAC/C,GAAIoG,GAAGra,EAAK+a,EAAQ9G,GAAI,IACtB,OAAO8G,EAAQ9G,GAAI,GAGvB,OAAOwI,CACT,EAEAgG,GAAkBxiB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,QAChFxa,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAGjB,IAAI+lB,EAAUtU,IAAU4B,EAExB,GAAIqP,IAAYriB,KAAKqiB,QACnB,OAAIqD,EACK1lB,MAEToT,EAAO8P,GACP9P,EAAO6P,GACAK,GAActjB,KAAM0hB,EAAS0B,EAAOf,EAAS,CAAC1iB,EAAKyR,KAK5D,IAFA,IAAIsJ,EAAU1a,KAAK0a,QACfuK,EAAM,EACDzR,EAAMkH,EAAQvb,OAAQ8lB,EAAMzR,IAC/BwG,GAAGra,EAAK+a,EAAQuK,GAAK,IADeA,KAK1C,IAAIU,EAASV,EAAMzR,EAEnB,GAAImS,EAASjL,EAAQuK,GAAK,KAAO7T,EAAQsU,EACvC,OAAO1lB,KAMT,GAHAoT,EAAO8P,IACNwC,IAAYC,IAAWvS,EAAO6P,GAE3ByC,GAAmB,IAARlS,EACb,OAAO,IAAI8O,GAAUZ,EAAS1hB,KAAKqiB,QAAS3H,EAAc,EAANuK,IAGtD,IAAIY,EAAanE,GAAWA,IAAY1hB,KAAK0hB,QACzCoE,EAAaD,EAAanL,EAAUpH,EAAQoH,GAYhD,OAVIiL,EACED,EACFT,IAAQzR,EAAM,EAAIsS,EAAWN,MAASM,EAAWb,GAAOa,EAAWN,MAEnEM,EAAWb,GAAO,CAACtlB,EAAKyR,GAG1B0U,EAAW/hB,KAAK,CAACpE,EAAKyR,IAGpByU,GACF7lB,KAAK0a,QAAUoL,EACR9lB,MAGF,IAAIoiB,GAAkBV,EAAS1hB,KAAKqiB,QAASyD,EACtD,EAWAxD,GAAU1iB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,GACtD,OAAOpC,GAAGra,EAAKK,KAAKqZ,MAAM,IAAMrZ,KAAKqZ,MAAM,GAAK+C,CAClD,EAEAkG,GAAU1iB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GACxF,IAAIwC,EAAUtU,IAAU4B,EACpBqT,EAAWrM,GAAGra,EAAKK,KAAKqZ,MAAM,IAClC,OAAIgN,EAAWjV,IAAUpR,KAAKqZ,MAAM,GAAKqM,GAChC1lB,MAGToT,EAAO8P,GAEHwC,OACFtS,EAAO6P,GAILoD,EACE3E,GAAWA,IAAY1hB,KAAK0hB,SAC9B1hB,KAAKqZ,MAAM,GAAKjI,EACTpR,MAEF,IAAIsiB,GAAUZ,EAAS1hB,KAAKqiB,QAAS,CAAC1iB,EAAKyR,KAGpDgC,EAAO6P,GACAK,GAActjB,KAAM0hB,EAAS0B,EAAOjG,GAAKxd,GAAM,CAACA,EAAKyR,KAC9D,EAMF0Q,GAAaliB,UAAU6hB,QACvBW,GAAkBxiB,UAAU6hB,QAAU,SAAUzZ,EAAIyP,GAElD,IADA,IAAIiD,EAAU1a,KAAK0a,QACV9G,EAAK,EAAGwF,EAAWsB,EAAQvb,OAAS,EAAGyU,GAAMwF,EAAUxF,IAC9D,IAAkD,IAA9C5L,EAAG0S,EAAQjD,EAAU2B,EAAWxF,EAAKA,IACvC,OAAO,CAGb,EAEAmO,GAAkBniB,UAAU6hB,QAC5BS,GAAiBtiB,UAAU6hB,QAAU,SAAUzZ,EAAIyP,GAEjD,IADA,IAAIwK,EAAQjiB,KAAKiiB,MACRrO,EAAK,EAAGwF,EAAW6I,EAAM9iB,OAAS,EAAGyU,GAAMwF,EAAUxF,IAAM,CAClE,IAAI6K,EAAOwD,EAAMxK,EAAU2B,EAAWxF,EAAKA,GAC3C,GAAI6K,IAAsC,IAA9BA,EAAKgD,QAAQzZ,EAAIyP,GAC3B,OAAO,CAEX,CACF,EAEA6K,GAAU1iB,UAAU6hB,QAAU,SAAUzZ,EAAIyP,GAC1C,OAAOzP,EAAGhI,KAAKqZ,MACjB,EAEApI,EAAYuQ,GAAapM,GAQvBoM,GAAY5hB,UAAUsP,KAAO,WAG3B,IAFA,IAAIhO,EAAOlB,KAAKuiB,MACZ+D,EAAQtmB,KAAKyiB,OACV6D,GAAO,CACZ,IAEIlN,EAFAqF,EAAO6H,EAAM7H,KACb9T,EAAQ2b,EAAM3b,QAElB,GAAI8T,EAAKpF,OACP,GAAc,IAAV1O,EACF,OAAOgY,GAAiBzhB,EAAMud,EAAKpF,YAEhC,GAAIoF,EAAK/D,SAEd,GAAI/P,IADJyO,EAAWqF,EAAK/D,QAAQvb,OAAS,GAE/B,OAAOwjB,GAAiBzhB,EAAMud,EAAK/D,QAAQ1a,KAAKwiB,SAAWpJ,EAAWzO,EAAQA,SAIhF,GAAIA,IADJyO,EAAWqF,EAAKwD,MAAM9iB,OAAS,GACR,CACrB,IAAIonB,EAAU9H,EAAKwD,MAAMjiB,KAAKwiB,SAAWpJ,EAAWzO,EAAQA,GAC5D,GAAI4b,EAAS,CACX,GAAIA,EAAQlN,MACV,OAAOsJ,GAAiBzhB,EAAMqlB,EAAQlN,OAExCiN,EAAQtmB,KAAKyiB,OAASC,GAAiB6D,EAASD,EAClD,CACA,QACF,CAEFA,EAAQtmB,KAAKyiB,OAASziB,KAAKyiB,OAAOI,MACpC,CACA,OAAOnN,GACT,EA+PF,IAAIkQ,GAAqB9S,EAAO,EAC5BkT,GAA0BlT,EAAO,EACjCsT,GAA0BtT,EAAO,EAMnC,SAAS3H,GAAKiG,GACZ,IAAIoV,EAAQC,KACZ,GAAc,OAAVrV,QAA4B1I,IAAV0I,EACpB,OAAOoV,EAET,GAAIE,GAAOtV,GACT,OAAOA,EAET,IAAI0C,EAAOpC,EAAgBN,GACvBjF,EAAO2H,EAAK3H,KAChB,OAAa,IAATA,EACKqa,GAET3H,GAAkB1S,GACdA,EAAO,GAAKA,EAAO2G,EACd6T,GAAS,EAAGxa,EAAM0G,EAAO,KAAM,IAAI+T,GAAM9S,EAAK0D,YAEhDgP,EAAMxH,eAAc,SAAS6H,GAClCA,EAAKC,QAAQ3a,GACb2H,EAAKzM,SAAQ,SAASkO,EAAG9V,GAAK,OAAOonB,EAAK/X,IAAIrP,EAAG8V,EAAE,GACrD,IACF,CA0JF,SAASmR,GAAOK,GACd,SAAUA,IAAaA,EAAUC,IACnC,CArLA/V,EAAY9F,GAAM+Q,IA2BhB/Q,GAAKgM,GAAK,WACR,OAAOnX,KAAKZ,UACd,EAEA+L,GAAKvL,UAAUiX,SAAW,WACxB,OAAO7W,KAAKoX,WAAW,SAAU,IACnC,EAIAjM,GAAKvL,UAAUiL,IAAM,SAASF,EAAOyR,GAEnC,IADAzR,EAAQsJ,EAAUjU,KAAM2K,KACX,GAAKA,EAAQ3K,KAAKmM,KAAM,CAEnC,IAAIsS,EAAOwI,GAAYjnB,KADvB2K,GAAS3K,KAAKknB,SAEd,OAAOzI,GAAQA,EAAKtG,MAAMxN,EAAQoI,EACpC,CACA,OAAOqJ,CACT,EAIAjR,GAAKvL,UAAUkP,IAAM,SAASnE,EAAOyG,GACnC,OAAO+V,GAAWnnB,KAAM2K,EAAOyG,EACjC,EAEAjG,GAAKvL,UAAU4f,OAAS,SAAS7U,GAC/B,OAAQ3K,KAAKgC,IAAI2I,GACL,IAAVA,EAAc3K,KAAKojB,QACnBzY,IAAU3K,KAAKmM,KAAO,EAAInM,KAAKwlB,MAC/BxlB,KAAKonB,OAAOzc,EAAO,GAHK3K,IAI5B,EAEAmL,GAAKvL,UAAUynB,OAAS,SAAS1c,EAAOyG,GACtC,OAAOpR,KAAKonB,OAAOzc,EAAO,EAAGyG,EAC/B,EAEAjG,GAAKvL,UAAUmgB,MAAQ,WACrB,OAAkB,IAAd/f,KAAKmM,KACAnM,KAELA,KAAKggB,WACPhgB,KAAKmM,KAAOnM,KAAKknB,QAAUlnB,KAAKsnB,UAAY,EAC5CtnB,KAAKunB,OAAS1U,EACd7S,KAAKmf,MAAQnf,KAAKwnB,MAAQ,KAC1BxnB,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEFymB,IACT,EAEAtb,GAAKvL,UAAUmE,KAAO,WACpB,IAAI0jB,EAASroB,UACTsoB,EAAU1nB,KAAKmM,KACnB,OAAOnM,KAAKgf,eAAc,SAAS6H,GACjCc,GAAcd,EAAM,EAAGa,EAAUD,EAAOtoB,QACxC,IAAK,IAAIyU,EAAK,EAAGA,EAAK6T,EAAOtoB,OAAQyU,IACnCiT,EAAK/X,IAAI4Y,EAAU9T,EAAI6T,EAAO7T,GAElC,GACF,EAEAzI,GAAKvL,UAAU4lB,IAAM,WACnB,OAAOmC,GAAc3nB,KAAM,GAAI,EACjC,EAEAmL,GAAKvL,UAAUgoB,QAAU,WACvB,IAAIH,EAASroB,UACb,OAAOY,KAAKgf,eAAc,SAAS6H,GACjCc,GAAcd,GAAOY,EAAOtoB,QAC5B,IAAK,IAAIyU,EAAK,EAAGA,EAAK6T,EAAOtoB,OAAQyU,IACnCiT,EAAK/X,IAAI8E,EAAI6T,EAAO7T,GAExB,GACF,EAEAzI,GAAKvL,UAAUwjB,MAAQ,WACrB,OAAOuE,GAAc3nB,KAAM,EAC7B,EAIAmL,GAAKvL,UAAUyD,MAAQ,WACrB,OAAOwkB,GAAkB7nB,UAAM0I,EAAWtJ,UAC5C,EAEA+L,GAAKvL,UAAUugB,UAAY,SAASC,GAClC,OAAOyH,GAAkB7nB,KAAMogB,EADwBpP,EAAQlR,KAAKV,UAAW,GAEjF,EAEA+L,GAAKvL,UAAU4gB,UAAY,WACzB,OAAOqH,GAAkB7nB,KAAMygB,GAAYrhB,UAC7C,EAEA+L,GAAKvL,UAAU8gB,cAAgB,SAASN,GAAS,IAAIE,EAAQtP,EAAQlR,KAAKV,UAAW,GACnF,OAAOyoB,GAAkB7nB,KAAM2gB,GAAeP,GAASE,EACzD,EAEAnV,GAAKvL,UAAUknB,QAAU,SAAS3a,GAChC,OAAOwb,GAAc3nB,KAAM,EAAGmM,EAChC,EAIAhB,GAAKvL,UAAUkL,MAAQ,SAASuJ,EAAOC,GACrC,IAAInI,EAAOnM,KAAKmM,KAChB,OAAIiI,EAAWC,EAAOC,EAAKnI,GAClBnM,KAEF2nB,GACL3nB,KACAuU,EAAaF,EAAOlI,GACpBsI,EAAWH,EAAKnI,GAEpB,EAEAhB,GAAKvL,UAAU+X,WAAa,SAASzW,EAAMuW,GACzC,IAAI9M,EAAQ,EACR8c,EAASK,GAAY9nB,KAAMyX,GAC/B,OAAO,IAAIrC,GAAS,WAClB,IAAIhE,EAAQqW,IACZ,OAAOrW,IAAU2W,GACfrS,IACAL,EAAcnU,EAAMyJ,IAASyG,EACjC,GACF,EAEAjG,GAAKvL,UAAUmU,UAAY,SAAS/L,EAAIyP,GAItC,IAHA,IAEIrG,EAFAzG,EAAQ,EACR8c,EAASK,GAAY9nB,KAAMyX,IAEvBrG,EAAQqW,OAAcM,KACK,IAA7B/f,EAAGoJ,EAAOzG,IAAS3K,QAIzB,OAAO2K,CACT,EAEAQ,GAAKvL,UAAU0hB,cAAgB,SAASI,GACtC,OAAIA,IAAY1hB,KAAKggB,UACZhgB,KAEJ0hB,EAIEiF,GAAS3mB,KAAKknB,QAASlnB,KAAKsnB,UAAWtnB,KAAKunB,OAAQvnB,KAAKmf,MAAOnf,KAAKwnB,MAAO9F,EAAS1hB,KAAKwa,SAH/Fxa,KAAKggB,UAAY0B,EACV1hB,KAGX,EAOFmL,GAAKub,OAASA,GAEd,IAAIM,GAAmB,yBAEnBgB,GAAgB7c,GAAKvL,UAiBvB,SAASgnB,GAAMzO,EAAOuJ,GACpB1hB,KAAKmY,MAAQA,EACbnY,KAAK0hB,QAAUA,CACjB,CAnBFsG,GAAchB,KAAoB,EAClCgB,GAAcpV,GAAUoV,GAAcxI,OACtCwI,GAAc3I,MAAQwC,GAAaxC,MACnC2I,GAAcvI,SACduI,GAAcvC,SAAW5D,GAAa4D,SACtCuC,GAActI,OAASmC,GAAanC,OACpCsI,GAAczI,SAAWsC,GAAatC,SACtCyI,GAAc3H,QAAUwB,GAAaxB,QACrC2H,GAAcpH,YAAciB,GAAajB,YACzCoH,GAAchJ,cAAgB6C,GAAa7C,cAC3CgJ,GAAc5G,UAAYS,GAAaT,UACvC4G,GAAczG,YAAcM,GAAaN,YACzCyG,GAAc3G,WAAaQ,GAAaR,WAWtCuF,GAAMhnB,UAAUqoB,aAAe,SAASvG,EAASwG,EAAOvd,GACtD,GAAIA,IAAUud,EAAQ,GAAKA,EAAmC,IAAtBloB,KAAKmY,MAAMhZ,OACjD,OAAOa,KAET,IAAImoB,EAAexd,IAAUud,EAASnV,EACtC,GAAIoV,GAAenoB,KAAKmY,MAAMhZ,OAC5B,OAAO,IAAIynB,GAAM,GAAIlF,GAEvB,IACI0G,EADAC,EAAgC,IAAhBF,EAEpB,GAAID,EAAQ,EAAG,CACb,IAAII,EAAWtoB,KAAKmY,MAAMgQ,GAE1B,IADAC,EAAWE,GAAYA,EAASL,aAAavG,EAASwG,EAAQrV,EAAOlI,MACpD2d,GAAYD,EAC3B,OAAOroB,IAEX,CACA,GAAIqoB,IAAkBD,EACpB,OAAOpoB,KAET,IAAIuoB,EAAWC,GAAcxoB,KAAM0hB,GACnC,IAAK2G,EACH,IAAK,IAAIzU,EAAK,EAAGA,EAAKuU,EAAavU,IACjC2U,EAASpQ,MAAMvE,QAAMlL,EAMzB,OAHI0f,IACFG,EAASpQ,MAAMgQ,GAAeC,GAEzBG,CACT,EAEA3B,GAAMhnB,UAAU6oB,YAAc,SAAS/G,EAASwG,EAAOvd,GACrD,GAAIA,KAAWud,EAAQ,GAAKA,EAAQ,IAA4B,IAAtBloB,KAAKmY,MAAMhZ,OACnD,OAAOa,KAET,IAKIooB,EALAM,EAAc/d,EAAQ,IAAOud,EAASnV,EAC1C,GAAI2V,GAAa1oB,KAAKmY,MAAMhZ,OAC1B,OAAOa,KAIT,GAAIkoB,EAAQ,EAAG,CACb,IAAII,EAAWtoB,KAAKmY,MAAMuQ,GAE1B,IADAN,EAAWE,GAAYA,EAASG,YAAY/G,EAASwG,EAAQrV,EAAOlI,MACnD2d,GAAYI,IAAc1oB,KAAKmY,MAAMhZ,OAAS,EAC7D,OAAOa,IAEX,CAEA,IAAIuoB,EAAWC,GAAcxoB,KAAM0hB,GAKnC,OAJA6G,EAASpQ,MAAMiP,OAAOsB,EAAY,GAC9BN,IACFG,EAASpQ,MAAMuQ,GAAaN,GAEvBG,CACT,EAIF,IA2EII,GAiWAC,GA5aAb,GAAO,CAAC,EAEZ,SAASD,GAAYjB,EAAMpP,GACzB,IAAIoR,EAAOhC,EAAKK,QACZ4B,EAAQjC,EAAKS,UACbyB,EAAUC,GAAcF,GACxBG,EAAOpC,EAAKW,MAEhB,OAAO0B,EAAkBrC,EAAK1H,MAAO0H,EAAKU,OAAQ,GAElD,SAAS2B,EAAkBzK,EAAMyJ,EAAO9d,GACtC,OAAiB,IAAV8d,EACLiB,EAAY1K,EAAMrU,GAClBgf,EAAY3K,EAAMyJ,EAAO9d,EAC7B,CAEA,SAAS+e,EAAY1K,EAAMrU,GACzB,IAAI+N,EAAQ/N,IAAW2e,EAAUE,GAAQA,EAAK9Q,MAAQsG,GAAQA,EAAKtG,MAC/DkR,EAAOjf,EAASye,EAAO,EAAIA,EAAOze,EAClCkf,EAAKR,EAAQ1e,EAIjB,OAHIkf,EAAKxW,IACPwW,EAAKxW,GAEA,WACL,GAAIuW,IAASC,EACX,OAAOvB,GAET,IAAI9C,EAAMxN,IAAY6R,EAAKD,IAC3B,OAAOlR,GAASA,EAAM8M,EACxB,CACF,CAEA,SAASmE,EAAY3K,EAAMyJ,EAAO9d,GAChC,IAAIqd,EACAtP,EAAQsG,GAAQA,EAAKtG,MACrBkR,EAAOjf,EAASye,EAAO,EAAKA,EAAOze,GAAW8d,EAC9CoB,EAAmC,GAA5BR,EAAQ1e,GAAW8d,GAI9B,OAHIoB,EAAKxW,IACPwW,EAAKxW,GAEA,WACL,OAAG,CACD,GAAI2U,EAAQ,CACV,IAAIrW,EAAQqW,IACZ,GAAIrW,IAAU2W,GACZ,OAAO3W,EAETqW,EAAS,IACX,CACA,GAAI4B,IAASC,EACX,OAAOvB,GAET,IAAI9C,EAAMxN,IAAY6R,EAAKD,IAC3B5B,EAASyB,EACP/Q,GAASA,EAAM8M,GAAMiD,EAAQrV,EAAOzI,GAAU6a,GAAOiD,GAEzD,CACF,CACF,CACF,CAEA,SAASvB,GAAS4C,EAAQC,EAAUtB,EAAOpF,EAAMmG,EAAMvH,EAASvE,GAC9D,IAAI0J,EAAOvnB,OAAOmP,OAAOuZ,IAUzB,OATAnB,EAAK1a,KAAOqd,EAAWD,EACvB1C,EAAKK,QAAUqC,EACf1C,EAAKS,UAAYkC,EACjB3C,EAAKU,OAASW,EACdrB,EAAK1H,MAAQ2D,EACb+D,EAAKW,MAAQyB,EACbpC,EAAK7G,UAAY0B,EACjBmF,EAAKrM,OAAS2C,EACd0J,EAAK5G,WAAY,EACV4G,CACT,CAGA,SAASJ,KACP,OAAOkC,KAAeA,GAAahC,GAAS,EAAG,EAAG9T,GACpD,CAEA,SAASsU,GAAWN,EAAMlc,EAAOyG,GAG/B,IAFAzG,EAAQsJ,EAAU4S,EAAMlc,MAEVA,EACZ,OAAOkc,EAGT,GAAIlc,GAASkc,EAAK1a,MAAQxB,EAAQ,EAChC,OAAOkc,EAAK7H,eAAc,SAAS6H,GACjClc,EAAQ,EACNgd,GAAcd,EAAMlc,GAAOmE,IAAI,EAAGsC,GAClCuW,GAAcd,EAAM,EAAGlc,EAAQ,GAAGmE,IAAInE,EAAOyG,EACjD,IAGFzG,GAASkc,EAAKK,QAEd,IAAIuC,EAAU5C,EAAKW,MACfzE,EAAU8D,EAAK1H,MACf+D,EAAW/P,EAAQD,GAOvB,OANIvI,GAASqe,GAAcnC,EAAKS,WAC9BmC,EAAUC,GAAYD,EAAS5C,EAAK7G,UAAW,EAAGrV,EAAOyG,EAAO8R,GAEhEH,EAAU2G,GAAY3G,EAAS8D,EAAK7G,UAAW6G,EAAKU,OAAQ5c,EAAOyG,EAAO8R,GAGvEA,EAAS9R,MAIVyV,EAAK7G,WACP6G,EAAK1H,MAAQ4D,EACb8D,EAAKW,MAAQiC,EACb5C,EAAKrM,YAAS9R,EACdme,EAAK5G,WAAY,EACV4G,GAEFF,GAASE,EAAKK,QAASL,EAAKS,UAAWT,EAAKU,OAAQxE,EAAS0G,GAV3D5C,CAWX,CAEA,SAAS6C,GAAYjL,EAAMiD,EAASwG,EAAOvd,EAAOyG,EAAO8R,GACvD,IAMIK,EANA0B,EAAOta,IAAUud,EAASnV,EAC1B4W,EAAUlL,GAAQwG,EAAMxG,EAAKtG,MAAMhZ,OACvC,IAAKwqB,QAAqBjhB,IAAV0I,EACd,OAAOqN,EAKT,GAAIyJ,EAAQ,EAAG,CACb,IAAI0B,EAAYnL,GAAQA,EAAKtG,MAAM8M,GAC/B4E,EAAeH,GAAYE,EAAWlI,EAASwG,EAAQrV,EAAOlI,EAAOyG,EAAO8R,GAChF,OAAI2G,IAAiBD,EACZnL,IAET8E,EAAUiF,GAAc/J,EAAMiD,IACtBvJ,MAAM8M,GAAO4E,EACdtG,EACT,CAEA,OAAIoG,GAAWlL,EAAKtG,MAAM8M,KAAS7T,EAC1BqN,GAGTrL,EAAO8P,GAEPK,EAAUiF,GAAc/J,EAAMiD,QAChBhZ,IAAV0I,GAAuB6T,IAAQ1B,EAAQpL,MAAMhZ,OAAS,EACxDokB,EAAQpL,MAAMqN,MAEdjC,EAAQpL,MAAM8M,GAAO7T,EAEhBmS,EACT,CAEA,SAASiF,GAAc/J,EAAMiD,GAC3B,OAAIA,GAAWjD,GAAQiD,IAAYjD,EAAKiD,QAC/BjD,EAEF,IAAImI,GAAMnI,EAAOA,EAAKtG,MAAMrN,QAAU,GAAI4W,EACnD,CAEA,SAASuF,GAAYJ,EAAMiD,GACzB,GAAIA,GAAYd,GAAcnC,EAAKS,WACjC,OAAOT,EAAKW,MAEd,GAAIsC,EAAW,GAAMjD,EAAKU,OAAS1U,EAAQ,CAGzC,IAFA,IAAI4L,EAAOoI,EAAK1H,MACZ+I,EAAQrB,EAAKU,OACV9I,GAAQyJ,EAAQ,GACrBzJ,EAAOA,EAAKtG,MAAO2R,IAAa5B,EAASnV,GACzCmV,GAASrV,EAEX,OAAO4L,CACT,CACF,CAEA,SAASkJ,GAAcd,EAAMxS,EAAOC,QAGpB5L,IAAV2L,IACFA,GAAgB,QAEN3L,IAAR4L,IACFA,GAAY,GAEd,IAAIyV,EAAQlD,EAAK7G,WAAa,IAAI3M,EAC9B2W,EAAYnD,EAAKK,QACjB+C,EAAcpD,EAAKS,UACnB4C,EAAYF,EAAY3V,EACxB8V,OAAsBzhB,IAAR4L,EAAoB2V,EAAc3V,EAAM,EAAI2V,EAAc3V,EAAM0V,EAAY1V,EAC9F,GAAI4V,IAAcF,GAAaG,IAAgBF,EAC7C,OAAOpD,EAIT,GAAIqD,GAAaC,EACf,OAAOtD,EAAK9G,QAQd,IALA,IAAIqK,EAAWvD,EAAKU,OAChBxE,EAAU8D,EAAK1H,MAGfkL,EAAc,EACXH,EAAYG,EAAc,GAC/BtH,EAAU,IAAI6D,GAAM7D,GAAWA,EAAQ5K,MAAMhZ,OAAS,MAACuJ,EAAWqa,GAAW,GAAIgH,GAEjFM,GAAe,IADfD,GAAYvX,GAGVwX,IACFH,GAAaG,EACbL,GAAaK,EACbF,GAAeE,EACfJ,GAAeI,GAOjB,IAJA,IAAIC,EAAgBtB,GAAciB,GAC9BM,EAAgBvB,GAAcmB,GAG3BI,GAAiB,GAAMH,EAAWvX,GACvCkQ,EAAU,IAAI6D,GAAM7D,GAAWA,EAAQ5K,MAAMhZ,OAAS,CAAC4jB,GAAW,GAAIgH,GACtEK,GAAYvX,EAId,IAAI2X,EAAU3D,EAAKW,MACfiC,EAAUc,EAAgBD,EAC5BrD,GAAYJ,EAAMsD,EAAc,GAChCI,EAAgBD,EAAgB,IAAI1D,GAAM,GAAImD,GAASS,EAGzD,GAAIA,GAAWD,EAAgBD,GAAiBJ,EAAYD,GAAeO,EAAQrS,MAAMhZ,OAAQ,CAG/F,IADA,IAAIsf,EADJsE,EAAUyF,GAAczF,EAASgH,GAExB7B,EAAQkC,EAAUlC,EAAQrV,EAAOqV,GAASrV,EAAO,CACxD,IAAIoS,EAAOqF,IAAkBpC,EAASnV,EACtC0L,EAAOA,EAAKtG,MAAM8M,GAAOuD,GAAc/J,EAAKtG,MAAM8M,GAAM8E,EAC1D,CACAtL,EAAKtG,MAAOmS,IAAkBzX,EAASE,GAAQyX,CACjD,CAQA,GALIL,EAAcF,IAChBR,EAAUA,GAAWA,EAAQhB,YAAYsB,EAAO,EAAGI,IAIjDD,GAAaK,EACfL,GAAaK,EACbJ,GAAeI,EACfH,EAAWvX,EACXkQ,EAAU,KACV0G,EAAUA,GAAWA,EAAQxB,aAAa8B,EAAO,EAAGG,QAG/C,GAAIA,EAAYF,GAAaO,EAAgBD,EAAe,CAIjE,IAHAD,EAAc,EAGPtH,GAAS,CACd,IAAI0H,EAAcP,IAAcE,EAAYrX,EAC5C,GAAI0X,IAAgBF,IAAkBH,EAAYrX,EAChD,MAEE0X,IACFJ,IAAgB,GAAKD,GAAYK,GAEnCL,GAAYvX,EACZkQ,EAAUA,EAAQ5K,MAAMsS,EAC1B,CAGI1H,GAAWmH,EAAYF,IACzBjH,EAAUA,EAAQkF,aAAa8B,EAAOK,EAAUF,EAAYG,IAE1DtH,GAAWwH,EAAgBD,IAC7BvH,EAAUA,EAAQ0F,YAAYsB,EAAOK,EAAUG,EAAgBF,IAE7DA,IACFH,GAAaG,EACbF,GAAeE,EAEnB,CAEA,OAAIxD,EAAK7G,WACP6G,EAAK1a,KAAOge,EAAcD,EAC1BrD,EAAKK,QAAUgD,EACfrD,EAAKS,UAAY6C,EACjBtD,EAAKU,OAAS6C,EACdvD,EAAK1H,MAAQ4D,EACb8D,EAAKW,MAAQiC,EACb5C,EAAKrM,YAAS9R,EACdme,EAAK5G,WAAY,EACV4G,GAEFF,GAASuD,EAAWC,EAAaC,EAAUrH,EAAS0G,EAC7D,CAEA,SAAS5B,GAAkBhB,EAAMzG,EAAQ+D,GAGvC,IAFA,IAAI7D,EAAQ,GACRoK,EAAU,EACL9W,EAAK,EAAGA,EAAKuQ,EAAUhlB,OAAQyU,IAAM,CAC5C,IAAIxC,EAAQ+S,EAAUvQ,GAClBE,EAAOpC,EAAgBN,GACvB0C,EAAK3H,KAAOue,IACdA,EAAU5W,EAAK3H,MAEZkF,EAAWD,KACd0C,EAAOA,EAAKtI,KAAI,SAAS+J,GAAK,OAAOgE,GAAOhE,EAAE,KAEhD+K,EAAMvc,KAAK+P,EACb,CAIA,OAHI4W,EAAU7D,EAAK1a,OACjB0a,EAAOA,EAAKC,QAAQ4D,IAEftG,GAAwByC,EAAMzG,EAAQE,EAC/C,CAEA,SAAS0I,GAAc7c,GACrB,OAAOA,EAAO2G,EAAO,EAAO3G,EAAO,IAAO0G,GAAUA,CACtD,CAME,SAASkO,GAAW3P,GAClB,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsBuZ,KAC7CC,GAAaxZ,GAASA,EACtBuZ,KAAkB3L,eAAc,SAASxT,GACvC,IAAIsI,EAAOvC,EAAcH,GACzByN,GAAkB/K,EAAK3H,MACvB2H,EAAKzM,SAAQ,SAASkO,EAAGD,GAAK,OAAO9J,EAAIsD,IAAIwG,EAAGC,EAAE,GACpD,GACJ,CAuEF,SAASqV,GAAaC,GACpB,OAAO9L,GAAM8L,IAAoBtY,EAAUsY,EAC7C,CASA,SAASC,GAAetf,EAAKqb,EAAMnF,EAASvE,GAC1C,IAAI4N,EAAOzrB,OAAOmP,OAAOsS,GAAWnhB,WAMpC,OALAmrB,EAAK5e,KAAOX,EAAMA,EAAIW,KAAO,EAC7B4e,EAAKC,KAAOxf,EACZuf,EAAKE,MAAQpE,EACbkE,EAAK/K,UAAY0B,EACjBqJ,EAAKvQ,OAAS2C,EACP4N,CACT,CAGA,SAASJ,KACP,OAAO/B,KAAsBA,GAAoBkC,GAAehM,KAAY2H,MAC9E,CAEA,SAASyE,GAAiBH,EAAMzV,EAAGC,GACjC,IAII4V,EACAC,EALA5f,EAAMuf,EAAKC,KACXnE,EAAOkE,EAAKE,MACZxrB,EAAI+L,EAAIX,IAAIyK,GACZtT,OAAY0G,IAANjJ,EAGV,GAAI8V,IAAMvC,EAAS,CACjB,IAAKhR,EACH,OAAO+oB,EAELlE,EAAK1a,MAAQ2G,GAAQ+T,EAAK1a,MAAmB,EAAXX,EAAIW,MAExCgf,GADAC,EAAUvE,EAAK3kB,QAAO,SAASmX,EAAO4L,GAAO,YAAiBvc,IAAV2Q,GAAuB5Z,IAAMwlB,CAAG,KACnE3O,aAAa9K,KAAI,SAAS6N,GAAS,OAAOA,EAAM,EAAE,IAAGgS,OAAOtR,QACzEgR,EAAK/K,YACPmL,EAAOnL,UAAYoL,EAAQpL,UAAY+K,EAAK/K,aAG9CmL,EAAS3f,EAAIgU,OAAOlK,GACpB8V,EAAU3rB,IAAMonB,EAAK1a,KAAO,EAAI0a,EAAKrB,MAAQqB,EAAK/X,IAAIrP,OAAGiJ,GAE7D,MACE,GAAI1G,EAAK,CACP,GAAIuT,IAAMsR,EAAKhc,IAAIpL,GAAG,GACpB,OAAOsrB,EAETI,EAAS3f,EACT4f,EAAUvE,EAAK/X,IAAIrP,EAAG,CAAC6V,EAAGC,GAC5B,MACE4V,EAAS3f,EAAIsD,IAAIwG,EAAGuR,EAAK1a,MACzBif,EAAUvE,EAAK/X,IAAI+X,EAAK1a,KAAM,CAACmJ,EAAGC,IAGtC,OAAIwV,EAAK/K,WACP+K,EAAK5e,KAAOgf,EAAOhf,KACnB4e,EAAKC,KAAOG,EACZJ,EAAKE,MAAQG,EACbL,EAAKvQ,YAAS9R,EACPqiB,GAEFD,GAAeK,EAAQC,EAChC,CAGE,SAASE,GAAgBC,EAASrS,GAChClZ,KAAKwrB,MAAQD,EACbvrB,KAAKyrB,SAAWvS,EAChBlZ,KAAKmM,KAAOof,EAAQpf,IACtB,CA0DA,SAASuf,GAAkB5X,GACzB9T,KAAKwrB,MAAQ1X,EACb9T,KAAKmM,KAAO2H,EAAK3H,IACnB,CAwBA,SAASwf,GAAc7X,GACrB9T,KAAKwrB,MAAQ1X,EACb9T,KAAKmM,KAAO2H,EAAK3H,IACnB,CAsBA,SAASyf,GAAoBlR,GAC3B1a,KAAKwrB,MAAQ9Q,EACb1a,KAAKmM,KAAOuO,EAAQvO,IACtB,CAuDF,SAAS0f,GAAY7V,GACnB,IAAI8V,EAAeC,GAAa/V,GAiChC,OAhCA8V,EAAaN,MAAQxV,EACrB8V,EAAa3f,KAAO6J,EAAS7J,KAC7B2f,EAAaT,KAAO,WAAa,OAAOrV,CAAQ,EAChD8V,EAAarU,QAAU,WACrB,IAAIuU,EAAmBhW,EAASyB,QAAQ1X,MAAMC,MAE9C,OADAgsB,EAAiBX,KAAO,WAAa,OAAOrV,EAASyB,SAAS,EACvDuU,CACT,EACAF,EAAa9pB,IAAM,SAASrC,GAAO,OAAOqW,EAASuG,SAAS5c,EAAI,EAChEmsB,EAAavP,SAAW,SAAS5c,GAAO,OAAOqW,EAAShU,IAAIrC,EAAI,EAChEmsB,EAAazU,YAAc4U,GAC3BH,EAAavU,kBAAoB,SAAUvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACpE,OAAOgW,EAASjC,WAAU,SAASwB,EAAGD,GAAK,OAA4B,IAArBtN,EAAGsN,EAAGC,EAAGmH,EAAiB,GAAGjF,EACjF,EACAqU,EAAaxS,mBAAqB,SAASpY,EAAMuW,GAC/C,GAAIvW,IAAS4T,EAAiB,CAC5B,IAAIG,EAAWe,EAAS2B,WAAWzW,EAAMuW,GACzC,OAAO,IAAIrC,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,IAAKwM,EAAKjG,KAAM,CACd,IAAIH,EAAIoG,EAAKtK,MAAM,GACnBsK,EAAKtK,MAAM,GAAKsK,EAAKtK,MAAM,GAC3BsK,EAAKtK,MAAM,GAAKkE,CAClB,CACA,OAAOoG,CACT,GACF,CACA,OAAO1F,EAAS2B,WACdzW,IAAS2T,EAAiBD,EAAeC,EACzC4C,EAEJ,EACOqU,CACT,CAGA,SAASI,GAAWlW,EAAUkL,EAAQiL,GACpC,IAAIC,EAAiBL,GAAa/V,GAgClC,OA/BAoW,EAAejgB,KAAO6J,EAAS7J,KAC/BigB,EAAepqB,IAAM,SAASrC,GAAO,OAAOqW,EAAShU,IAAIrC,EAAI,EAC7DysB,EAAevhB,IAAM,SAASlL,EAAKyc,GACjC,IAAI7G,EAAIS,EAASnL,IAAIlL,EAAKqT,GAC1B,OAAOuC,IAAMvC,EACXoJ,EACA8E,EAAOphB,KAAKqsB,EAAS5W,EAAG5V,EAAKqW,EACjC,EACAoW,EAAe7U,kBAAoB,SAAUvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACtE,OAAOgW,EAASjC,WACd,SAASwB,EAAGD,EAAG0H,GAAK,OAAwD,IAAjDhV,EAAGkZ,EAAOphB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,GAAI1H,EAAGoH,EAAiB,GACjFjF,EAEJ,EACA2U,EAAe9S,mBAAqB,SAAUpY,EAAMuW,GAClD,IAAIxC,EAAWe,EAAS2B,WAAW7C,EAAiB2C,GACpD,OAAO,IAAIrC,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAET,IAAIrC,EAAQqC,EAAKtK,MACbzR,EAAM0Z,EAAM,GAChB,OAAOhE,EACLnU,EACAvB,EACAuhB,EAAOphB,KAAKqsB,EAAS9S,EAAM,GAAI1Z,EAAKqW,GACpC0F,EAEJ,GACF,EACO0Q,CACT,CAGA,SAASC,GAAerW,EAAUkD,GAChC,IAAI8S,EAAmBD,GAAa/V,GAsBpC,OArBAgW,EAAiBR,MAAQxV,EACzBgW,EAAiB7f,KAAO6J,EAAS7J,KACjC6f,EAAiBvU,QAAU,WAAa,OAAOzB,CAAQ,EACnDA,EAASqV,OACXW,EAAiBX,KAAO,WACtB,IAAIS,EAAeD,GAAY7V,GAE/B,OADA8V,EAAarU,QAAU,WAAa,OAAOzB,EAASqV,MAAM,EACnDS,CACT,GAEFE,EAAiBnhB,IAAM,SAASlL,EAAKyc,GAClC,OAAOpG,EAASnL,IAAIqO,EAAUvZ,GAAO,EAAIA,EAAKyc,EAAY,EAC7D4P,EAAiBhqB,IAAM,SAASrC,GAC7B,OAAOqW,EAAShU,IAAIkX,EAAUvZ,GAAO,EAAIA,EAAI,EAChDqsB,EAAiBzP,SAAW,SAASnL,GAAS,OAAO4E,EAASuG,SAASnL,EAAM,EAC7E4a,EAAiB3U,YAAc4U,GAC/BD,EAAiBjY,UAAY,SAAU/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KAChE,OAAOgW,EAASjC,WAAU,SAASwB,EAAGD,GAAK,OAAOtN,EAAGuN,EAAGD,EAAGoH,EAAO,IAAIjF,EACxE,EACAuU,EAAiBrU,WACf,SAASzW,EAAMuW,GAAW,OAAOzB,EAAS2B,WAAWzW,GAAOuW,EAAQ,EAC/DuU,CACT,CAGA,SAASM,GAActW,EAAUuW,EAAWJ,EAASjT,GACnD,IAAIsT,EAAiBT,GAAa/V,GAwClC,OAvCIkD,IACFsT,EAAexqB,IAAM,SAASrC,GAC5B,IAAI4V,EAAIS,EAASnL,IAAIlL,EAAKqT,GAC1B,OAAOuC,IAAMvC,KAAauZ,EAAUzsB,KAAKqsB,EAAS5W,EAAG5V,EAAKqW,EAC5D,EACAwW,EAAe3hB,IAAM,SAASlL,EAAKyc,GACjC,IAAI7G,EAAIS,EAASnL,IAAIlL,EAAKqT,GAC1B,OAAOuC,IAAMvC,GAAWuZ,EAAUzsB,KAAKqsB,EAAS5W,EAAG5V,EAAKqW,GACtDT,EAAI6G,CACR,GAEFoQ,EAAejV,kBAAoB,SAAUvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KAClEqc,EAAa,EAOjB,OANArG,EAASjC,WAAU,SAASwB,EAAGD,EAAG0H,GAChC,GAAIuP,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,GAEhC,OADAX,IACOrU,EAAGuN,EAAG2D,EAAU5D,EAAI+G,EAAa,EAAGK,EAE/C,GAAGjF,GACI4E,CACT,EACAmQ,EAAelT,mBAAqB,SAAUpY,EAAMuW,GAClD,IAAIxC,EAAWe,EAAS2B,WAAW7C,EAAiB2C,GAChD4E,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,OAAa,CACX,IAAIsG,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAET,IAAIrC,EAAQqC,EAAKtK,MACbzR,EAAM0Z,EAAM,GACZjI,EAAQiI,EAAM,GAClB,GAAIkT,EAAUzsB,KAAKqsB,EAAS/a,EAAOzR,EAAKqW,GACtC,OAAOX,EAAcnU,EAAMgY,EAAUvZ,EAAM0c,IAAcjL,EAAOsK,EAEpE,CACF,GACF,EACO8Q,CACT,CAGA,SAASC,GAAezW,EAAU0W,EAASP,GACzC,IAAIQ,EAAS5e,KAAMqT,YAQnB,OAPApL,EAASjC,WAAU,SAASwB,EAAGD,GAC7BqX,EAAOjN,OACLgN,EAAQ5sB,KAAKqsB,EAAS5W,EAAGD,EAAGU,GAC5B,GACA,SAASsE,GAAK,OAAOA,EAAI,CAAC,GAE9B,IACOqS,EAAOpL,aAChB,CAGA,SAASqL,GAAe5W,EAAU0W,EAASP,GACzC,IAAIU,EAAcrb,EAAQwE,GACtB2W,GAAUpa,EAAUyD,GAAY+K,KAAehT,MAAOqT,YAC1DpL,EAASjC,WAAU,SAASwB,EAAGD,GAC7BqX,EAAOjN,OACLgN,EAAQ5sB,KAAKqsB,EAAS5W,EAAGD,EAAGU,IAC5B,SAASsE,GAAK,OAAQA,EAAIA,GAAK,IAAMvW,KAAK8oB,EAAc,CAACvX,EAAGC,GAAKA,GAAI+E,CAAE,GAE3E,IACA,IAAIwS,EAASC,GAAc/W,GAC3B,OAAO2W,EAAOnhB,KAAI,SAAS+H,GAAO,OAAOyZ,GAAMhX,EAAU8W,EAAOvZ,GAAK,GACvE,CAGA,SAAS0Z,GAAajX,EAAU3B,EAAOC,EAAK4E,GAC1C,IAAIgU,EAAelX,EAAS7J,KAW5B,QAPczD,IAAV2L,IACFA,GAAgB,QAEN3L,IAAR4L,IACFA,GAAY,GAGVF,EAAWC,EAAOC,EAAK4Y,GACzB,OAAOlX,EAGT,IAAImX,EAAgB5Y,EAAaF,EAAO6Y,GACpCE,EAAc3Y,EAAWH,EAAK4Y,GAKlC,GAAIC,IAAkBA,GAAiBC,IAAgBA,EACrD,OAAOH,GAAajX,EAASI,QAAQiB,cAAehD,EAAOC,EAAK4E,GAOlE,IACImU,EADAC,EAAeF,EAAcD,EAE7BG,IAAiBA,IACnBD,EAAYC,EAAe,EAAI,EAAIA,GAGrC,IAAIC,EAAWxB,GAAa/V,GA6D5B,OAzDAuX,EAASphB,KAAqB,IAAdkhB,EAAkBA,EAAYrX,EAAS7J,MAAQkhB,QAAa3kB,GAEvEwQ,GAAWrB,GAAM7B,IAAaqX,GAAa,IAC9CE,EAAS1iB,IAAM,SAAUF,EAAOyR,GAE9B,OADAzR,EAAQsJ,EAAUjU,KAAM2K,KACR,GAAKA,EAAQ0iB,EAC3BrX,EAASnL,IAAIF,EAAQwiB,EAAe/Q,GACpCA,CACJ,GAGFmR,EAAShW,kBAAoB,SAASvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KAC/D,GAAkB,IAAdqtB,EACF,OAAO,EAET,GAAI5V,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAE1C,IAAI+V,EAAU,EACVC,GAAa,EACbpR,EAAa,EAQjB,OAPArG,EAASjC,WAAU,SAASwB,EAAGD,GAC7B,IAAMmY,KAAeA,EAAaD,IAAYL,GAE5C,OADA9Q,KACuD,IAAhDrU,EAAGuN,EAAG2D,EAAU5D,EAAI+G,EAAa,EAAGK,IACpCL,IAAegR,CAE1B,IACOhR,CACT,EAEAkR,EAASjU,mBAAqB,SAASpY,EAAMuW,GAC3C,GAAkB,IAAd4V,GAAmB5V,EACrB,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAG7C,IAAIxC,EAAyB,IAAdoY,GAAmBrX,EAAS2B,WAAWzW,EAAMuW,GACxD+V,EAAU,EACVnR,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,KAAOoY,IAAYL,GACjBlY,EAAS/F,OAEX,KAAMmN,EAAagR,EACjB,OAAO3X,IAET,IAAIgG,EAAOzG,EAAS/F,OACpB,OAAIgK,GAAWhY,IAAS2T,EACf6G,EAEArG,EAAcnU,EAAMmb,EAAa,EAD/Bnb,IAAS0T,OACyBlM,EAEAgT,EAAKtK,MAAM,GAFAsK,EAI1D,GACF,EAEO6R,CACT,CAGA,SAASG,GAAiB1X,EAAUuW,EAAWJ,GAC7C,IAAIwB,EAAe5B,GAAa/V,GAoChC,OAnCA2X,EAAapW,kBAAoB,SAASvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACnE,GAAIyX,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAE1C,IAAI4E,EAAa,EAIjB,OAHArG,EAASjC,WAAU,SAASwB,EAAGD,EAAG0H,GAC/B,OAAOuP,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,MAAQX,GAAcrU,EAAGuN,EAAGD,EAAGoH,EAAO,IAEvEL,CACT,EACAsR,EAAarU,mBAAqB,SAASpY,EAAMuW,GAAU,IAAIiF,EAAS1c,KACtE,GAAIyX,EACF,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAE7C,IAAIxC,EAAWe,EAAS2B,WAAW7C,EAAiB2C,GAChDmW,GAAY,EAChB,OAAO,IAAIxY,GAAS,WAClB,IAAKwY,EACH,OAAOlY,IAET,IAAIgG,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAET,IAAIrC,EAAQqC,EAAKtK,MACbkE,EAAI+D,EAAM,GACV9D,EAAI8D,EAAM,GACd,OAAKkT,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAGoH,GAI5Bxb,IAAS4T,EAAkB4G,EAChCrG,EAAcnU,EAAMoU,EAAGC,EAAGmG,IAJ1BkS,GAAY,EACLlY,IAIX,GACF,EACOiY,CACT,CAGA,SAASE,GAAiB7X,EAAUuW,EAAWJ,EAASjT,GACtD,IAAI4U,EAAe/B,GAAa/V,GA4ChC,OA3CA8X,EAAavW,kBAAoB,SAAUvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACpE,GAAIyX,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAE1C,IAAIgW,GAAa,EACbpR,EAAa,EAOjB,OANArG,EAASjC,WAAU,SAASwB,EAAGD,EAAG0H,GAChC,IAAMyQ,KAAeA,EAAalB,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,IAE9D,OADAX,IACOrU,EAAGuN,EAAG2D,EAAU5D,EAAI+G,EAAa,EAAGK,EAE/C,IACOL,CACT,EACAyR,EAAaxU,mBAAqB,SAASpY,EAAMuW,GAAU,IAAIiF,EAAS1c,KACtE,GAAIyX,EACF,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAE7C,IAAIxC,EAAWe,EAAS2B,WAAW7C,EAAiB2C,GAChDsW,GAAW,EACX1R,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,IAAIsG,EAAMpG,EAAGC,EACb,EAAG,CAED,IADAmG,EAAOzG,EAAS/F,QACPuG,KACP,OAAIyD,GAAWhY,IAAS2T,EACf6G,EAEArG,EAAcnU,EAAMmb,IADlBnb,IAAS0T,OACuBlM,EAEAgT,EAAKtK,MAAM,GAFAsK,GAKxD,IAAIrC,EAAQqC,EAAKtK,MACjBkE,EAAI+D,EAAM,GACV9D,EAAI8D,EAAM,GACV0U,IAAaA,EAAWxB,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAGoH,GACxD,OAASqR,GACT,OAAO7sB,IAAS4T,EAAkB4G,EAChCrG,EAAcnU,EAAMoU,EAAGC,EAAGmG,EAC9B,GACF,EACOoS,CACT,CAGA,SAASE,GAAchY,EAAUyR,GAC/B,IAAIwG,EAAkBzc,EAAQwE,GAC1BsK,EAAQ,CAACtK,GAAU/N,OAAOwf,GAAQjc,KAAI,SAAS+J,GAQjD,OAPKlE,EAAWkE,GAIL0Y,IACT1Y,EAAIhE,EAAcgE,IAJlBA,EAAI0Y,EACFzX,GAAkBjB,GAClBoB,GAAoB1X,MAAMC,QAAQqW,GAAKA,EAAI,CAACA,IAIzCA,CACT,IAAGrT,QAAO,SAASqT,GAAK,OAAkB,IAAXA,EAAEpJ,IAAU,IAE3C,GAAqB,IAAjBmU,EAAMnhB,OACR,OAAO6W,EAGT,GAAqB,IAAjBsK,EAAMnhB,OAAc,CACtB,IAAI+uB,EAAY5N,EAAM,GACtB,GAAI4N,IAAclY,GACdiY,GAAmBzc,EAAQ0c,IAC3Bvc,EAAUqE,IAAarE,EAAUuc,GACnC,OAAOA,CAEX,CAEA,IAAIC,EAAY,IAAIjW,GAASoI,GAkB7B,OAjBI2N,EACFE,EAAYA,EAAU7X,aACZ3E,EAAUqE,KACpBmY,EAAYA,EAAUvX,aAExBuX,EAAYA,EAAUC,SAAQ,IACpBjiB,KAAOmU,EAAM5c,QACrB,SAAS2qB,EAAKtV,GACZ,QAAYrQ,IAAR2lB,EAAmB,CACrB,IAAIliB,EAAO4M,EAAI5M,KACf,QAAazD,IAATyD,EACF,OAAOkiB,EAAMliB,CAEjB,CACF,GACA,GAEKgiB,CACT,CAGA,SAASG,GAAetY,EAAUuY,EAAOrV,GACvC,IAAIsV,EAAezC,GAAa/V,GA0ChC,OAzCAwY,EAAajX,kBAAoB,SAASvP,EAAIyP,GAC5C,IAAI4E,EAAa,EACboS,GAAU,EACd,SAASC,EAAS5a,EAAM6a,GAAe,IAAIjS,EAAS1c,KAClD8T,EAAKC,WAAU,SAASwB,EAAGD,GAMzB,QALMiZ,GAASI,EAAeJ,IAAUld,EAAWkE,GACjDmZ,EAASnZ,EAAGoZ,EAAe,IAC4B,IAA9C3mB,EAAGuN,EAAG2D,EAAU5D,EAAI+G,IAAcK,KAC3C+R,GAAU,IAEJA,CACV,GAAGhX,EACL,CAEA,OADAiX,EAAS1Y,EAAU,GACZqG,CACT,EACAmS,EAAalV,mBAAqB,SAASpY,EAAMuW,GAC/C,IAAIxC,EAAWe,EAAS2B,WAAWzW,EAAMuW,GACrC6O,EAAQ,GACRjK,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,KAAOH,GAAU,CACf,IAAIyG,EAAOzG,EAAS/F,OACpB,IAAkB,IAAdwM,EAAKjG,KAAT,CAIA,IAAIF,EAAImG,EAAKtK,MAIb,GAHIlQ,IAAS4T,IACXS,EAAIA,EAAE,IAEFgZ,KAASjI,EAAMnnB,OAASovB,KAAUld,EAAWkE,GAIjD,OAAO2D,EAAUwC,EAAOrG,EAAcnU,EAAMmb,IAAc9G,EAAGmG,GAH7D4K,EAAMviB,KAAKkR,GACXA,EAAWM,EAAEoC,WAAWzW,EAAMuW,EAPhC,MAFExC,EAAWqR,EAAMd,KAarB,CACA,OAAO9P,GACT,GACF,EACO8Y,CACT,CAGA,SAASI,GAAe5Y,EAAUkL,EAAQiL,GACxC,IAAIW,EAASC,GAAc/W,GAC3B,OAAOA,EAASI,QAAQ5K,KACtB,SAAS+J,EAAGD,GAAK,OAAOwX,EAAO5L,EAAOphB,KAAKqsB,EAAS5W,EAAGD,EAAGU,GAAU,IACpEoY,SAAQ,EACZ,CAGA,SAASS,GAAiB7Y,EAAU8Y,GAClC,IAAIC,EAAqBhD,GAAa/V,GA2BtC,OA1BA+Y,EAAmB5iB,KAAO6J,EAAS7J,MAAwB,EAAhB6J,EAAS7J,KAAU,EAC9D4iB,EAAmBxX,kBAAoB,SAASvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACrEqc,EAAa,EAMjB,OALArG,EAASjC,WAAU,SAASwB,EAAGD,GAC5B,QAAS+G,IAAsD,IAAxCrU,EAAG8mB,EAAWzS,IAAcK,MACpB,IAAhC1U,EAAGuN,EAAG8G,IAAcK,EAAiB,GACrCjF,GAEK4E,CACT,EACA0S,EAAmBzV,mBAAqB,SAASpY,EAAMuW,GACrD,IAEIiE,EAFAzG,EAAWe,EAAS2B,WAAW9C,EAAgB4C,GAC/C4E,EAAa,EAEjB,OAAO,IAAIjH,GAAS,WAClB,QAAKsG,GAAQW,EAAa,KACxBX,EAAOzG,EAAS/F,QACPuG,KACAiG,EAGJW,EAAa,EAClBhH,EAAcnU,EAAMmb,IAAcyS,GAClCzZ,EAAcnU,EAAMmb,IAAcX,EAAKtK,MAAOsK,EAClD,GACF,EACOqT,CACT,CAGA,SAAS/N,GAAYhL,EAAU8K,EAAYI,GACpCJ,IACHA,EAAakO,IAEf,IAAIf,EAAkBzc,EAAQwE,GAC1BrL,EAAQ,EACR+P,EAAU1E,EAASI,QAAQ5K,KAC7B,SAAS+J,EAAGD,GAAK,MAAO,CAACA,EAAGC,EAAG5K,IAASuW,EAASA,EAAO3L,EAAGD,EAAGU,GAAYT,EAAE,IAC5EiC,UAMF,OALAkD,EAAQmG,MAAK,SAASvG,EAAGC,GAAK,OAAOuG,EAAWxG,EAAE,GAAIC,EAAE,KAAOD,EAAE,GAAKC,EAAE,EAAE,IAAGlT,QAC3E4mB,EACA,SAAS1Y,EAAG9V,GAAMib,EAAQjb,GAAGN,OAAS,CAAG,EACzC,SAASoW,EAAG9V,GAAMib,EAAQjb,GAAK8V,EAAE,EAAI,GAEhC0Y,EAAkBxc,EAASiJ,GAChC/I,EAAUqE,GAAYpE,EAAW8I,GACjC3I,EAAO2I,EACX,CAGA,SAASuU,GAAWjZ,EAAU8K,EAAYI,GAIxC,GAHKJ,IACHA,EAAakO,IAEX9N,EAAQ,CACV,IAAI7H,EAAQrD,EAASI,QAClB5K,KAAI,SAAS+J,EAAGD,GAAK,MAAO,CAACC,EAAG2L,EAAO3L,EAAGD,EAAGU,GAAU,IACvDtS,QAAO,SAAS4W,EAAGC,GAAK,OAAO2U,GAAWpO,EAAYxG,EAAE,GAAIC,EAAE,IAAMA,EAAID,CAAC,IAC5E,OAAOjB,GAASA,EAAM,EACxB,CACE,OAAOrD,EAAStS,QAAO,SAAS4W,EAAGC,GAAK,OAAO2U,GAAWpO,EAAYxG,EAAGC,GAAKA,EAAID,CAAC,GAEvF,CAEA,SAAS4U,GAAWpO,EAAYxG,EAAGC,GACjC,IAAI4U,EAAOrO,EAAWvG,EAAGD,GAGzB,OAAiB,IAAT6U,GAAc5U,IAAMD,SAAY5R,IAAN6R,GAAyB,OAANA,GAAcA,IAAMA,IAAO4U,EAAO,CACzF,CAGA,SAASC,GAAeC,EAASC,EAAQhP,GACvC,IAAIiP,EAAcxD,GAAasD,GAkD/B,OAjDAE,EAAYpjB,KAAO,IAAI+L,GAASoI,GAAO9U,KAAI,SAAS/L,GAAK,OAAOA,EAAE0M,IAAI,IAAGwI,MAGzE4a,EAAYxb,UAAY,SAAS/L,EAAIyP,GAiBnC,IAHA,IACIiE,EADAzG,EAAWjV,KAAK2X,WAAW9C,EAAgB4C,GAE3C4E,EAAa,IACRX,EAAOzG,EAAS/F,QAAQuG,OACY,IAAvCzN,EAAG0T,EAAKtK,MAAOiL,IAAcrc,QAInC,OAAOqc,CACT,EACAkT,EAAYjW,mBAAqB,SAASpY,EAAMuW,GAC9C,IAAI+X,EAAYlP,EAAM9U,KAAI,SAAS/L,GAChC,OAAQA,EAAI0R,EAAS1R,GAAIsW,EAAY0B,EAAUhY,EAAEgY,UAAYhY,EAAG,IAE/D4c,EAAa,EACboT,GAAS,EACb,OAAO,IAAIra,GAAS,WAClB,IAAIsa,EAKJ,OAJKD,IACHC,EAAQF,EAAUhkB,KAAI,SAAS/L,GAAK,OAAOA,EAAEyP,MAAM,IACnDugB,EAASC,EAAM3nB,MAAK,SAAS4nB,GAAK,OAAOA,EAAEla,IAAI,KAE7Cga,EACK/Z,IAEFL,EACLnU,EACAmb,IACAiT,EAAOvvB,MAAM,KAAM2vB,EAAMlkB,KAAI,SAASmkB,GAAK,OAAOA,EAAEve,KAAK,KAE7D,GACF,EACOme,CACT,CAKA,SAASvC,GAAMlZ,EAAMiF,GACnB,OAAOlB,GAAM/D,GAAQiF,EAAMjF,EAAKpF,YAAYqK,EAC9C,CAEA,SAAS6W,GAAcvW,GACrB,GAAIA,IAAU/Z,OAAO+Z,GACnB,MAAM,IAAIL,UAAU,0BAA4BK,EAEpD,CAEA,SAASwW,GAAY/b,GAEnB,OADA+K,GAAkB/K,EAAK3H,MAChB0H,EAAWC,EACpB,CAEA,SAASiZ,GAAc/W,GACrB,OAAOxE,EAAQwE,GAAYzE,EACzBI,EAAUqE,GAAYtE,EACtBG,CACJ,CAEA,SAASka,GAAa/V,GACpB,OAAO1W,OAAOmP,QAEV+C,EAAQwE,GAAYvE,EACpBE,EAAUqE,GAAYpE,EACtBG,GACAnS,UAEN,CAEA,SAASqsB,KACP,OAAIjsB,KAAKwrB,MAAMnU,aACbrX,KAAKwrB,MAAMnU,cACXrX,KAAKmM,KAAOnM,KAAKwrB,MAAMrf,KAChBnM,MAEAsR,EAAI1R,UAAUyX,YAAYvX,KAAKE,KAE1C,CAEA,SAASgvB,GAAkB1U,EAAGC,GAC5B,OAAOD,EAAIC,EAAI,EAAID,EAAIC,GAAK,EAAI,CAClC,CAEA,SAASuF,GAAcR,GACrB,IAAIxL,EAAOiC,EAAYuJ,GACvB,IAAKxL,EAAM,CAGT,IAAKoC,EAAYoJ,GACf,MAAM,IAAItG,UAAU,oCAAsCsG,GAE5DxL,EAAOiC,EAAY5E,EAASmO,GAC9B,CACA,OAAOxL,CACT,CAIE,SAASgc,GAAOC,EAAeC,GAC7B,IAAIC,EAEAC,EAAa,SAAgBzI,GAC/B,GAAIA,aAAkByI,EACpB,OAAOzI,EAET,KAAMznB,gBAAgBkwB,GACpB,OAAO,IAAIA,EAAWzI,GAExB,IAAKwI,EAAgB,CACnBA,GAAiB,EACjB,IAAI9pB,EAAO7G,OAAO6G,KAAK4pB,GACvBI,GAASC,EAAqBjqB,GAC9BiqB,EAAoBjkB,KAAOhG,EAAKhH,OAChCixB,EAAoBC,MAAQL,EAC5BI,EAAoB5X,MAAQrS,EAC5BiqB,EAAoBE,eAAiBP,CACvC,CACA/vB,KAAKgrB,KAAOjd,GAAI0Z,EAClB,EAEI2I,EAAsBF,EAAWtwB,UAAYN,OAAOmP,OAAO8hB,IAG/D,OAFAH,EAAoB1hB,YAAcwhB,EAE3BA,CACT,CAl/BFjf,EAAY8P,GAAYhT,IActBgT,GAAW5J,GAAK,WACd,OAAOnX,KAAKZ,UACd,EAEA2hB,GAAWnhB,UAAUiX,SAAW,WAC9B,OAAO7W,KAAKoX,WAAW,eAAgB,IACzC,EAIA2J,GAAWnhB,UAAUiL,IAAM,SAASyK,EAAG8G,GACrC,IAAIzR,EAAQ3K,KAAKgrB,KAAKngB,IAAIyK,GAC1B,YAAiB5M,IAAViC,EAAsB3K,KAAKirB,MAAMpgB,IAAIF,GAAO,GAAKyR,CAC1D,EAIA2E,GAAWnhB,UAAUmgB,MAAQ,WAC3B,OAAkB,IAAd/f,KAAKmM,KACAnM,KAELA,KAAKggB,WACPhgB,KAAKmM,KAAO,EACZnM,KAAKgrB,KAAKjL,QACV/f,KAAKirB,MAAMlL,QACJ/f,MAEF2qB,IACT,EAEA5J,GAAWnhB,UAAUkP,IAAM,SAASwG,EAAGC,GACrC,OAAO2V,GAAiBlrB,KAAMsV,EAAGC,EACnC,EAEAwL,GAAWnhB,UAAU4f,OAAS,SAASlK,GACrC,OAAO4V,GAAiBlrB,KAAMsV,EAAGtC,EACnC,EAEA+N,GAAWnhB,UAAUyhB,WAAa,WAChC,OAAOrhB,KAAKgrB,KAAK3J,cAAgBrhB,KAAKirB,MAAM5J,YAC9C,EAEAN,GAAWnhB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KACnE,OAAOA,KAAKirB,MAAMlX,WAChB,SAASsF,GAAS,OAAOA,GAASrR,EAAGqR,EAAM,GAAIA,EAAM,GAAIqD,EAAO,GAChEjF,EAEJ,EAEAsJ,GAAWnhB,UAAU+X,WAAa,SAASzW,EAAMuW,GAC/C,OAAOzX,KAAKirB,MAAM1U,eAAeoB,WAAWzW,EAAMuW,EACpD,EAEAsJ,GAAWnhB,UAAU0hB,cAAgB,SAASI,GAC5C,GAAIA,IAAY1hB,KAAKggB,UACnB,OAAOhgB,KAET,IAAImrB,EAASnrB,KAAKgrB,KAAK1J,cAAcI,GACjC0J,EAAUprB,KAAKirB,MAAM3J,cAAcI,GACvC,OAAKA,EAMEoJ,GAAeK,EAAQC,EAAS1J,EAAS1hB,KAAKwa,SALnDxa,KAAKggB,UAAY0B,EACjB1hB,KAAKgrB,KAAOG,EACZnrB,KAAKirB,MAAQG,EACNprB,KAGX,EAOF+gB,GAAW6J,aAAeA,GAE1B7J,GAAWnhB,UAAU6S,IAAuB,EAC5CsO,GAAWnhB,UAAUgT,GAAUmO,GAAWnhB,UAAU4f,OA8DpDvO,EAAYqa,GAAiB7Z,GAO3B6Z,GAAgB1rB,UAAUiL,IAAM,SAASlL,EAAKyc,GAC5C,OAAOpc,KAAKwrB,MAAM3gB,IAAIlL,EAAKyc,EAC7B,EAEAkP,GAAgB1rB,UAAUoC,IAAM,SAASrC,GACvC,OAAOK,KAAKwrB,MAAMxpB,IAAIrC,EACxB,EAEA2rB,GAAgB1rB,UAAU4wB,SAAW,WACnC,OAAOxwB,KAAKwrB,MAAMgF,UACpB,EAEAlF,GAAgB1rB,UAAU6X,QAAU,WAAY,IAAIiF,EAAS1c,KACvDgsB,EAAmBK,GAAersB,MAAM,GAI5C,OAHKA,KAAKyrB,WACRO,EAAiBwE,SAAW,WAAa,OAAO9T,EAAO8O,MAAMpV,QAAQqB,SAAS,GAEzEuU,CACT,EAEAV,GAAgB1rB,UAAU4L,IAAM,SAAS0V,EAAQiL,GAAU,IAAIzP,EAAS1c,KAClEosB,EAAiBF,GAAWlsB,KAAMkhB,EAAQiL,GAI9C,OAHKnsB,KAAKyrB,WACRW,EAAeoE,SAAW,WAAa,OAAO9T,EAAO8O,MAAMpV,QAAQ5K,IAAI0V,EAAQiL,EAAQ,GAElFC,CACT,EAEAd,GAAgB1rB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IACvD7D,EAD2D8I,EAAS1c,KAExE,OAAOA,KAAKwrB,MAAMzX,UAChB/T,KAAKyrB,SACH,SAASlW,EAAGD,GAAK,OAAOtN,EAAGuN,EAAGD,EAAGoH,EAAO,GACtC9I,EAAK6D,EAAUoY,GAAY7vB,MAAQ,EACnC,SAASuV,GAAK,OAAOvN,EAAGuN,EAAGkC,IAAY7D,EAAKA,IAAM8I,EAAO,GAC7DjF,EAEJ,EAEA6T,GAAgB1rB,UAAU+X,WAAa,SAASzW,EAAMuW,GACpD,GAAIzX,KAAKyrB,SACP,OAAOzrB,KAAKwrB,MAAM7T,WAAWzW,EAAMuW,GAErC,IAAIxC,EAAWjV,KAAKwrB,MAAM7T,WAAW9C,EAAgB4C,GACjD7D,EAAK6D,EAAUoY,GAAY7vB,MAAQ,EACvC,OAAO,IAAIoV,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,OAAOwM,EAAKjG,KAAOiG,EACjBrG,EAAcnU,EAAMuW,IAAY7D,EAAKA,IAAM8H,EAAKtK,MAAOsK,EAC3D,GACF,EAEF4P,GAAgB1rB,UAAU6S,IAAuB,EAGjDxB,EAAYya,GAAmB9Z,GAM7B8Z,GAAkB9rB,UAAU2c,SAAW,SAASnL,GAC9C,OAAOpR,KAAKwrB,MAAMjP,SAASnL,EAC7B,EAEAsa,GAAkB9rB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KACtEqc,EAAa,EACjB,OAAOrc,KAAKwrB,MAAMzX,WAAU,SAASwB,GAAK,OAAOvN,EAAGuN,EAAG8G,IAAcK,EAAO,GAAGjF,EACjF,EAEAiU,GAAkB9rB,UAAU+X,WAAa,SAASzW,EAAMuW,GACtD,IAAIxC,EAAWjV,KAAKwrB,MAAM7T,WAAW9C,EAAgB4C,GACjD4E,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,OAAOwM,EAAKjG,KAAOiG,EACjBrG,EAAcnU,EAAMmb,IAAcX,EAAKtK,MAAOsK,EAClD,GACF,EAIFzK,EAAY0a,GAAe5Z,GAMzB4Z,GAAc/rB,UAAUoC,IAAM,SAASrC,GACrC,OAAOK,KAAKwrB,MAAMjP,SAAS5c,EAC7B,EAEAgsB,GAAc/rB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KACtE,OAAOA,KAAKwrB,MAAMzX,WAAU,SAASwB,GAAK,OAAOvN,EAAGuN,EAAGA,EAAGmH,EAAO,GAAGjF,EACtE,EAEAkU,GAAc/rB,UAAU+X,WAAa,SAASzW,EAAMuW,GAClD,IAAIxC,EAAWjV,KAAKwrB,MAAM7T,WAAW9C,EAAgB4C,GACrD,OAAO,IAAIrC,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,OAAOwM,EAAKjG,KAAOiG,EACjBrG,EAAcnU,EAAMwa,EAAKtK,MAAOsK,EAAKtK,MAAOsK,EAChD,GACF,EAIFzK,EAAY2a,GAAqBna,GAM/Bma,GAAoBhsB,UAAU6W,SAAW,WACvC,OAAOzW,KAAKwrB,MAAMpV,OACpB,EAEAwV,GAAoBhsB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KAC5E,OAAOA,KAAKwrB,MAAMzX,WAAU,SAASsF,GAGnC,GAAIA,EAAO,CACTuW,GAAcvW,GACd,IAAIoX,EAAkBpf,EAAWgI,GACjC,OAAOrR,EACLyoB,EAAkBpX,EAAMxO,IAAI,GAAKwO,EAAM,GACvCoX,EAAkBpX,EAAMxO,IAAI,GAAKwO,EAAM,GACvCqD,EAEJ,CACF,GAAGjF,EACL,EAEAmU,GAAoBhsB,UAAU+X,WAAa,SAASzW,EAAMuW,GACxD,IAAIxC,EAAWjV,KAAKwrB,MAAM7T,WAAW9C,EAAgB4C,GACrD,OAAO,IAAIrC,GAAS,WAClB,OAAa,CACX,IAAIsG,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAET,IAAIrC,EAAQqC,EAAKtK,MAGjB,GAAIiI,EAAO,CACTuW,GAAcvW,GACd,IAAIoX,EAAkBpf,EAAWgI,GACjC,OAAOhE,EACLnU,EACAuvB,EAAkBpX,EAAMxO,IAAI,GAAKwO,EAAM,GACvCoX,EAAkBpX,EAAMxO,IAAI,GAAKwO,EAAM,GACvCqC,EAEJ,CACF,CACF,GACF,EAGFgQ,GAAkB9rB,UAAUyX,YAC5BiU,GAAgB1rB,UAAUyX,YAC1BsU,GAAc/rB,UAAUyX,YACxBuU,GAAoBhsB,UAAUyX,YAC5B4U,GAopBFhb,EAAY6e,GAAQ7T,IA8BlB6T,GAAOlwB,UAAUiX,SAAW,WAC1B,OAAO7W,KAAKoX,WAAWsZ,GAAW1wB,MAAQ,KAAM,IAClD,EAIA8vB,GAAOlwB,UAAUoC,IAAM,SAASsT,GAC9B,OAAOtV,KAAKswB,eAAezwB,eAAeyV,EAC5C,EAEAwa,GAAOlwB,UAAUiL,IAAM,SAASyK,EAAG8G,GACjC,IAAKpc,KAAKgC,IAAIsT,GACZ,OAAO8G,EAET,IAAIuU,EAAa3wB,KAAKswB,eAAehb,GACrC,OAAOtV,KAAKgrB,KAAOhrB,KAAKgrB,KAAKngB,IAAIyK,EAAGqb,GAAcA,CACpD,EAIAb,GAAOlwB,UAAUmgB,MAAQ,WACvB,GAAI/f,KAAKggB,UAEP,OADAhgB,KAAKgrB,MAAQhrB,KAAKgrB,KAAKjL,QAChB/f,KAET,IAAIkwB,EAAalwB,KAAK0O,YACtB,OAAOwhB,EAAWU,SAAWV,EAAWU,OAASC,GAAW7wB,KAAM8e,MACpE,EAEAgR,GAAOlwB,UAAUkP,IAAM,SAASwG,EAAGC,GACjC,IAAKvV,KAAKgC,IAAIsT,GACZ,MAAM,IAAIiG,MAAM,2BAA6BjG,EAAI,QAAUob,GAAW1wB,OAExE,IAAImrB,EAASnrB,KAAKgrB,MAAQhrB,KAAKgrB,KAAKlc,IAAIwG,EAAGC,GAC3C,OAAIvV,KAAKggB,WAAamL,IAAWnrB,KAAKgrB,KAC7BhrB,KAEF6wB,GAAW7wB,KAAMmrB,EAC1B,EAEA2E,GAAOlwB,UAAU4f,OAAS,SAASlK,GACjC,IAAKtV,KAAKgC,IAAIsT,GACZ,OAAOtV,KAET,IAAImrB,EAASnrB,KAAKgrB,MAAQhrB,KAAKgrB,KAAKxL,OAAOlK,GAC3C,OAAItV,KAAKggB,WAAamL,IAAWnrB,KAAKgrB,KAC7BhrB,KAEF6wB,GAAW7wB,KAAMmrB,EAC1B,EAEA2E,GAAOlwB,UAAUyhB,WAAa,WAC5B,OAAOrhB,KAAKgrB,KAAK3J,YACnB,EAEAyO,GAAOlwB,UAAU+X,WAAa,SAASzW,EAAMuW,GAAU,IAAIiF,EAAS1c,KAClE,OAAOuR,EAAcvR,KAAKswB,gBAAgB9kB,KAAI,SAASqP,EAAGvF,GAAK,OAAOoH,EAAO7R,IAAIyK,EAAE,IAAGqC,WAAWzW,EAAMuW,EACzG,EAEAqY,GAAOlwB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KAC/D,OAAOuR,EAAcvR,KAAKswB,gBAAgB9kB,KAAI,SAASqP,EAAGvF,GAAK,OAAOoH,EAAO7R,IAAIyK,EAAE,IAAGvB,UAAU/L,EAAIyP,EACtG,EAEAqY,GAAOlwB,UAAU0hB,cAAgB,SAASI,GACxC,GAAIA,IAAY1hB,KAAKggB,UACnB,OAAOhgB,KAET,IAAImrB,EAASnrB,KAAKgrB,MAAQhrB,KAAKgrB,KAAK1J,cAAcI,GAClD,OAAKA,EAKEmP,GAAW7wB,KAAMmrB,EAAQzJ,IAJ9B1hB,KAAKggB,UAAY0B,EACjB1hB,KAAKgrB,KAAOG,EACLnrB,KAGX,EAGF,IAAIuwB,GAAkBT,GAAOlwB,UAkB7B,SAASixB,GAAWC,EAAYtlB,EAAKkW,GACnC,IAAIqP,EAASzxB,OAAOmP,OAAOnP,OAAO0xB,eAAeF,IAGjD,OAFAC,EAAO/F,KAAOxf,EACdulB,EAAO/Q,UAAY0B,EACZqP,CACT,CAEA,SAASL,GAAWK,GAClB,OAAOA,EAAOV,OAASU,EAAOriB,YAAYshB,MAAQ,QACpD,CAEA,SAASG,GAASvwB,EAAWqxB,GAC3B,IACEA,EAAM5pB,QAAQ6pB,GAAQC,UAAKzoB,EAAW9I,GACxC,CAAE,MAAO0b,GAET,CACF,CAEA,SAAS4V,GAAQtxB,EAAWowB,GAC1B1wB,OAAOif,eAAe3e,EAAWowB,EAAM,CACrCnlB,IAAK,WACH,OAAO7K,KAAK6K,IAAImlB,EAClB,EACAlhB,IAAK,SAASsC,GACZgK,GAAUpb,KAAKggB,UAAW,sCAC1BhgB,KAAK8O,IAAIkhB,EAAM5e,EACjB,GAEJ,CAME,SAAShK,GAAIgK,GACX,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsBggB,KAC7CC,GAAMjgB,KAAWmB,EAAUnB,GAASA,EACpCggB,KAAWpS,eAAc,SAASlQ,GAChC,IAAIgF,EAAOjC,EAAYT,GACvByN,GAAkB/K,EAAK3H,MACvB2H,EAAKzM,SAAQ,SAASkO,GAAK,OAAOzG,EAAItH,IAAI+N,EAAE,GAC9C,GACJ,CA6HF,SAAS8b,GAAMC,GACb,SAAUA,IAAYA,EAASC,IACjC,CA3LAhB,GAAgB3d,GAAU2d,GAAgB/Q,OAC1C+Q,GAAgB9Q,SAChB8Q,GAAgB9K,SAAW5D,GAAa4D,SACxC8K,GAAgBltB,MAAQwe,GAAaxe,MACrCktB,GAAgBpQ,UAAY0B,GAAa1B,UACzCoQ,GAAgBlQ,QAAUwB,GAAaxB,QACvCkQ,GAAgB/P,UAAYqB,GAAarB,UACzC+P,GAAgB7P,cAAgBmB,GAAanB,cAC7C6P,GAAgB3P,YAAciB,GAAajB,YAC3C2P,GAAgBlR,MAAQwC,GAAaxC,MACrCkR,GAAgB7Q,OAASmC,GAAanC,OACtC6Q,GAAgBhR,SAAWsC,GAAatC,SACxCgR,GAAgBvR,cAAgB6C,GAAa7C,cAC7CuR,GAAgBnP,UAAYS,GAAaT,UACzCmP,GAAgBhP,YAAcM,GAAaN,YAkC3CtQ,EAAY7J,GAAK+U,IAcf/U,GAAI+P,GAAK,WACP,OAAOnX,KAAKZ,UACd,EAEAgI,GAAIoqB,SAAW,SAASpgB,GACtB,OAAOpR,KAAKuR,EAAcH,GAAOqgB,SACnC,EAEArqB,GAAIxH,UAAUiX,SAAW,WACvB,OAAO7W,KAAKoX,WAAW,QAAS,IAClC,EAIAhQ,GAAIxH,UAAUoC,IAAM,SAASoP,GAC3B,OAAOpR,KAAKgrB,KAAKhpB,IAAIoP,EACvB,EAIAhK,GAAIxH,UAAU4H,IAAM,SAAS4J,GAC3B,OAAOsgB,GAAU1xB,KAAMA,KAAKgrB,KAAKlc,IAAIsC,GAAO,GAC9C,EAEAhK,GAAIxH,UAAU4f,OAAS,SAASpO,GAC9B,OAAOsgB,GAAU1xB,KAAMA,KAAKgrB,KAAKxL,OAAOpO,GAC1C,EAEAhK,GAAIxH,UAAUmgB,MAAQ,WACpB,OAAO2R,GAAU1xB,KAAMA,KAAKgrB,KAAKjL,QACnC,EAIA3Y,GAAIxH,UAAU+xB,MAAQ,WAAY,IAAIrR,EAAQtP,EAAQlR,KAAKV,UAAW,GAEpE,OAAqB,KADrBkhB,EAAQA,EAAMpe,QAAO,SAASsiB,GAAK,OAAkB,IAAXA,EAAErY,IAAU,KAC5ChN,OACDa,KAES,IAAdA,KAAKmM,MAAenM,KAAKggB,WAA8B,IAAjBM,EAAMnhB,OAGzCa,KAAKgf,eAAc,SAASlQ,GACjC,IAAK,IAAI8E,EAAK,EAAGA,EAAK0M,EAAMnhB,OAAQyU,IAClC/B,EAAYyO,EAAM1M,IAAKvM,SAAQ,SAAS+J,GAAS,OAAOtC,EAAItH,IAAI4J,EAAM,GAE1E,IANSpR,KAAK0O,YAAY4R,EAAM,GAOlC,EAEAlZ,GAAIxH,UAAUgyB,UAAY,WAAY,IAAItR,EAAQtP,EAAQlR,KAAKV,UAAW,GACxE,GAAqB,IAAjBkhB,EAAMnhB,OACR,OAAOa,KAETsgB,EAAQA,EAAM9U,KAAI,SAASsI,GAAQ,OAAOjC,EAAYiC,EAAK,IAC3D,IAAI+d,EAAc7xB,KAClB,OAAOA,KAAKgf,eAAc,SAASlQ,GACjC+iB,EAAYxqB,SAAQ,SAAS+J,GACtBkP,EAAM3F,OAAM,SAAS7G,GAAQ,OAAOA,EAAKyI,SAASnL,EAAM,KAC3DtC,EAAI0Q,OAAOpO,EAEf,GACF,GACF,EAEAhK,GAAIxH,UAAUkyB,SAAW,WAAY,IAAIxR,EAAQtP,EAAQlR,KAAKV,UAAW,GACvE,GAAqB,IAAjBkhB,EAAMnhB,OACR,OAAOa,KAETsgB,EAAQA,EAAM9U,KAAI,SAASsI,GAAQ,OAAOjC,EAAYiC,EAAK,IAC3D,IAAI+d,EAAc7xB,KAClB,OAAOA,KAAKgf,eAAc,SAASlQ,GACjC+iB,EAAYxqB,SAAQ,SAAS+J,GACvBkP,EAAMvY,MAAK,SAAS+L,GAAQ,OAAOA,EAAKyI,SAASnL,EAAM,KACzDtC,EAAI0Q,OAAOpO,EAEf,GACF,GACF,EAEAhK,GAAIxH,UAAUyD,MAAQ,WACpB,OAAOrD,KAAK2xB,MAAM5xB,MAAMC,KAAMZ,UAChC,EAEAgI,GAAIxH,UAAUugB,UAAY,SAASC,GAAS,IAAIE,EAAQtP,EAAQlR,KAAKV,UAAW,GAC9E,OAAOY,KAAK2xB,MAAM5xB,MAAMC,KAAMsgB,EAChC,EAEAlZ,GAAIxH,UAAUihB,KAAO,SAASC,GAE5B,OAAOiR,GAAW/Q,GAAYhhB,KAAM8gB,GACtC,EAEA1Z,GAAIxH,UAAUqhB,OAAS,SAASC,EAAQJ,GAEtC,OAAOiR,GAAW/Q,GAAYhhB,KAAM8gB,EAAYI,GAClD,EAEA9Z,GAAIxH,UAAUyhB,WAAa,WACzB,OAAOrhB,KAAKgrB,KAAK3J,YACnB,EAEAja,GAAIxH,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KAC5D,OAAOA,KAAKgrB,KAAKjX,WAAU,SAAS8G,EAAGvF,GAAK,OAAOtN,EAAGsN,EAAGA,EAAGoH,EAAO,GAAGjF,EACxE,EAEArQ,GAAIxH,UAAU+X,WAAa,SAASzW,EAAMuW,GACxC,OAAOzX,KAAKgrB,KAAKxf,KAAI,SAASqP,EAAGvF,GAAK,OAAOA,CAAC,IAAGqC,WAAWzW,EAAMuW,EACpE,EAEArQ,GAAIxH,UAAU0hB,cAAgB,SAASI,GACrC,GAAIA,IAAY1hB,KAAKggB,UACnB,OAAOhgB,KAET,IAAImrB,EAASnrB,KAAKgrB,KAAK1J,cAAcI,GACrC,OAAKA,EAKE1hB,KAAKgyB,OAAO7G,EAAQzJ,IAJzB1hB,KAAKggB,UAAY0B,EACjB1hB,KAAKgrB,KAAOG,EACLnrB,KAGX,EAOFoH,GAAIiqB,MAAQA,GAEZ,IAiCIY,GAjCAV,GAAkB,wBAElBW,GAAe9qB,GAAIxH,UAYvB,SAAS8xB,GAAU5iB,EAAKqc,GACtB,OAAIrc,EAAIkR,WACNlR,EAAI3C,KAAOgf,EAAOhf,KAClB2C,EAAIkc,KAAOG,EACJrc,GAEFqc,IAAWrc,EAAIkc,KAAOlc,EACX,IAAhBqc,EAAOhf,KAAa2C,EAAIqjB,UACxBrjB,EAAIkjB,OAAO7G,EACf,CAEA,SAASiH,GAAQ5mB,EAAKkW,GACpB,IAAI5S,EAAMxP,OAAOmP,OAAOyjB,IAIxB,OAHApjB,EAAI3C,KAAOX,EAAMA,EAAIW,KAAO,EAC5B2C,EAAIkc,KAAOxf,EACXsD,EAAIkR,UAAY0B,EACT5S,CACT,CAGA,SAASsiB,KACP,OAAOa,KAAcA,GAAYG,GAAQtT,MAC3C,CAME,SAASiT,GAAW3gB,GAClB,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsBihB,KAC7CC,GAAalhB,GAASA,EACtBihB,KAAkBrT,eAAc,SAASlQ,GACvC,IAAIgF,EAAOjC,EAAYT,GACvByN,GAAkB/K,EAAK3H,MACvB2H,EAAKzM,SAAQ,SAASkO,GAAK,OAAOzG,EAAItH,IAAI+N,EAAE,GAC9C,GACJ,CAeF,SAAS+c,GAAaC,GACpB,OAAOlB,GAAMkB,IAAoBhgB,EAAUggB,EAC7C,CAhEAL,GAAaX,KAAmB,EAChCW,GAAatf,GAAUsf,GAAa1S,OACpC0S,GAAa1R,UAAY0R,GAAa7uB,MACtC6uB,GAAaxR,cAAgBwR,GAAa/R,UAC1C+R,GAAalT,cAAgB6C,GAAa7C,cAC1CkT,GAAa9Q,UAAYS,GAAaT,UACtC8Q,GAAa3Q,YAAcM,GAAaN,YAExC2Q,GAAaC,QAAUf,GACvBc,GAAaF,OAASI,GA0BtBnhB,EAAY8gB,GAAY3qB,IActB2qB,GAAW5a,GAAK,WACd,OAAOnX,KAAKZ,UACd,EAEA2yB,GAAWP,SAAW,SAASpgB,GAC7B,OAAOpR,KAAKuR,EAAcH,GAAOqgB,SACnC,EAEAM,GAAWnyB,UAAUiX,SAAW,WAC9B,OAAO7W,KAAKoX,WAAW,eAAgB,IACzC,EAOF2a,GAAWO,aAAeA,GAE1B,IAcIE,GAdAC,GAAsBV,GAAWnyB,UAMrC,SAAS8yB,GAAelnB,EAAKkW,GAC3B,IAAI5S,EAAMxP,OAAOmP,OAAOgkB,IAIxB,OAHA3jB,EAAI3C,KAAOX,EAAMA,EAAIW,KAAO,EAC5B2C,EAAIkc,KAAOxf,EACXsD,EAAIkR,UAAY0B,EACT5S,CACT,CAGA,SAASujB,KACP,OAAOG,KAAsBA,GAAoBE,GAAe/H,MAClE,CAME,SAASgI,GAAMvhB,GACb,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsBwhB,KAC7CC,GAAQzhB,GAASA,EACjBwhB,KAAaE,WAAW1hB,EAC5B,CAiLF,SAASyhB,GAAQE,GACf,SAAUA,IAAcA,EAAWC,IACrC,CA7MAP,GAAoBhgB,IAAuB,EAE3CggB,GAAoBN,QAAUE,GAC9BI,GAAoBT,OAASU,GAe7BzhB,EAAY0hB,GAAOzW,IAUjByW,GAAMxb,GAAK,WACT,OAAOnX,KAAKZ,UACd,EAEAuzB,GAAM/yB,UAAUiX,SAAW,WACzB,OAAO7W,KAAKoX,WAAW,UAAW,IACpC,EAIAub,GAAM/yB,UAAUiL,IAAM,SAASF,EAAOyR,GACpC,IAAI6W,EAAOjzB,KAAKkzB,MAEhB,IADAvoB,EAAQsJ,EAAUjU,KAAM2K,GACjBsoB,GAAQtoB,KACbsoB,EAAOA,EAAK/jB,KAEd,OAAO+jB,EAAOA,EAAK7hB,MAAQgL,CAC7B,EAEAuW,GAAM/yB,UAAUuzB,KAAO,WACrB,OAAOnzB,KAAKkzB,OAASlzB,KAAKkzB,MAAM9hB,KAClC,EAIAuhB,GAAM/yB,UAAUmE,KAAO,WACrB,GAAyB,IAArB3E,UAAUD,OACZ,OAAOa,KAIT,IAFA,IAAIgjB,EAAUhjB,KAAKmM,KAAO/M,UAAUD,OAChC8zB,EAAOjzB,KAAKkzB,MACPtf,EAAKxU,UAAUD,OAAS,EAAGyU,GAAM,EAAGA,IAC3Cqf,EAAO,CACL7hB,MAAOhS,UAAUwU,GACjB1E,KAAM+jB,GAGV,OAAIjzB,KAAKggB,WACPhgB,KAAKmM,KAAO6W,EACZhjB,KAAKkzB,MAAQD,EACbjzB,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEFozB,GAAUpQ,EAASiQ,EAC5B,EAEAN,GAAM/yB,UAAUyzB,QAAU,SAASvf,GAEjC,GAAkB,KADlBA,EAAOpC,EAAgBoC,IACd3H,KACP,OAAOnM,KAET6e,GAAkB/K,EAAK3H,MACvB,IAAI6W,EAAUhjB,KAAKmM,KACf8mB,EAAOjzB,KAAKkzB,MAQhB,OAPApf,EAAK2D,UAAUpQ,SAAQ,SAAS+J,GAC9B4R,IACAiQ,EAAO,CACL7hB,MAAOA,EACPlC,KAAM+jB,EAEV,IACIjzB,KAAKggB,WACPhgB,KAAKmM,KAAO6W,EACZhjB,KAAKkzB,MAAQD,EACbjzB,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEFozB,GAAUpQ,EAASiQ,EAC5B,EAEAN,GAAM/yB,UAAU4lB,IAAM,WACpB,OAAOxlB,KAAK8K,MAAM,EACpB,EAEA6nB,GAAM/yB,UAAUgoB,QAAU,WACxB,OAAO5nB,KAAK+D,KAAKhE,MAAMC,KAAMZ,UAC/B,EAEAuzB,GAAM/yB,UAAUkzB,WAAa,SAAShf,GACpC,OAAO9T,KAAKqzB,QAAQvf,EACtB,EAEA6e,GAAM/yB,UAAUwjB,MAAQ,WACtB,OAAOpjB,KAAKwlB,IAAIzlB,MAAMC,KAAMZ,UAC9B,EAEAuzB,GAAM/yB,UAAUmgB,MAAQ,WACtB,OAAkB,IAAd/f,KAAKmM,KACAnM,KAELA,KAAKggB,WACPhgB,KAAKmM,KAAO,EACZnM,KAAKkzB,WAAQxqB,EACb1I,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEF4yB,IACT,EAEAD,GAAM/yB,UAAUkL,MAAQ,SAASuJ,EAAOC,GACtC,GAAIF,EAAWC,EAAOC,EAAKtU,KAAKmM,MAC9B,OAAOnM,KAET,IAAImtB,EAAgB5Y,EAAaF,EAAOrU,KAAKmM,MAE7C,GADkBsI,EAAWH,EAAKtU,KAAKmM,QACnBnM,KAAKmM,KAEvB,OAAO+P,GAAkBtc,UAAUkL,MAAMhL,KAAKE,KAAMqU,EAAOC,GAI7D,IAFA,IAAI0O,EAAUhjB,KAAKmM,KAAOghB,EACtB8F,EAAOjzB,KAAKkzB,MACT/F,KACL8F,EAAOA,EAAK/jB,KAEd,OAAIlP,KAAKggB,WACPhgB,KAAKmM,KAAO6W,EACZhjB,KAAKkzB,MAAQD,EACbjzB,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEFozB,GAAUpQ,EAASiQ,EAC5B,EAIAN,GAAM/yB,UAAU0hB,cAAgB,SAASI,GACvC,OAAIA,IAAY1hB,KAAKggB,UACZhgB,KAEJ0hB,EAKE0R,GAAUpzB,KAAKmM,KAAMnM,KAAKkzB,MAAOxR,EAAS1hB,KAAKwa,SAJpDxa,KAAKggB,UAAY0B,EACjB1hB,KAAKigB,WAAY,EACVjgB,KAGX,EAIA2yB,GAAM/yB,UAAUmU,UAAY,SAAS/L,EAAIyP,GACvC,GAAIA,EACF,OAAOzX,KAAKyX,UAAU1D,UAAU/L,GAIlC,IAFA,IAAIqU,EAAa,EACboC,EAAOze,KAAKkzB,MACTzU,IACsC,IAAvCzW,EAAGyW,EAAKrN,MAAOiL,IAAcrc,OAGjCye,EAAOA,EAAKvP,KAEd,OAAOmN,CACT,EAEAsW,GAAM/yB,UAAU+X,WAAa,SAASzW,EAAMuW,GAC1C,GAAIA,EACF,OAAOzX,KAAKyX,UAAUE,WAAWzW,GAEnC,IAAImb,EAAa,EACboC,EAAOze,KAAKkzB,MAChB,OAAO,IAAI9d,GAAS,WAClB,GAAIqJ,EAAM,CACR,IAAIrN,EAAQqN,EAAKrN,MAEjB,OADAqN,EAAOA,EAAKvP,KACLmG,EAAcnU,EAAMmb,IAAcjL,EAC3C,CACA,OAAOsE,GACT,GACF,EAOFid,GAAME,QAAUA,GAEhB,IAoBIS,GApBAN,GAAoB,0BAEpBO,GAAiBZ,GAAM/yB,UAQ3B,SAASwzB,GAAUjnB,EAAM8mB,EAAMvR,EAASvE,GACtC,IAAI3R,EAAMlM,OAAOmP,OAAO8kB,IAMxB,OALA/nB,EAAIW,KAAOA,EACXX,EAAI0nB,MAAQD,EACZznB,EAAIwU,UAAY0B,EAChBlW,EAAIgP,OAAS2C,EACb3R,EAAIyU,WAAY,EACTzU,CACT,CAGA,SAASonB,KACP,OAAOU,KAAgBA,GAAcF,GAAU,GACjD,CAKA,SAASI,GAAMtiB,EAAMuiB,GACnB,IAAIC,EAAY,SAAS/zB,GAAQuR,EAAKtR,UAAUD,GAAO8zB,EAAQ9zB,EAAM,EAIrE,OAHAL,OAAO6G,KAAKstB,GAASpsB,QAAQqsB,GAC7Bp0B,OAAOq0B,uBACLr0B,OAAOq0B,sBAAsBF,GAASpsB,QAAQqsB,GACzCxiB,CACT,CA/BAqiB,GAAeP,KAAqB,EACpCO,GAAevU,cAAgB6C,GAAa7C,cAC5CuU,GAAenS,UAAYS,GAAaT,UACxCmS,GAAehS,YAAcM,GAAaN,YAC1CgS,GAAelS,WAAaQ,GAAaR,WA6BzClQ,EAASiE,SAAWA,EAEpBoe,GAAMriB,EAAU,CAIdqG,QAAS,WACPqH,GAAkB7e,KAAKmM,MACvB,IAAIgM,EAAQ,IAAIlZ,MAAMe,KAAKmM,MAAQ,GAEnC,OADAnM,KAAKwwB,WAAWzc,WAAU,SAASwB,EAAG9V,GAAM0Y,EAAM1Y,GAAK8V,CAAG,IACnD4C,CACT,EAEAzB,aAAc,WACZ,OAAO,IAAIgV,GAAkB1rB,KAC/B,EAEA0L,KAAM,WACJ,OAAO1L,KAAKoW,QAAQ5K,KAClB,SAAS4F,GAAS,OAAOA,GAA+B,oBAAfA,EAAM1F,KAAsB0F,EAAM1F,OAAS0F,CAAK,IACzFwiB,QACJ,EAEAC,OAAQ,WACN,OAAO7zB,KAAKoW,QAAQ5K,KAClB,SAAS4F,GAAS,OAAOA,GAAiC,oBAAjBA,EAAMyiB,OAAwBziB,EAAMyiB,SAAWziB,CAAK,IAC7FwiB,QACJ,EAEAtd,WAAY,WACV,OAAO,IAAIgV,GAAgBtrB,MAAM,EACnC,EAEA+Z,MAAO,WAEL,OAAOhM,GAAI/N,KAAKsW,aAClB,EAEAwd,SAAU,WACRjV,GAAkB7e,KAAKmM,MACvB,IAAImM,EAAS,CAAC,EAEd,OADAtY,KAAK+T,WAAU,SAASwB,EAAGD,GAAMgD,EAAOhD,GAAKC,CAAG,IACzC+C,CACT,EAEAyb,aAAc,WAEZ,OAAOhT,GAAW/gB,KAAKsW,aACzB,EAEA0d,aAAc,WAEZ,OAAOjC,GAAWvgB,EAAQxR,MAAQA,KAAKwwB,WAAaxwB,KACtD,EAEAi0B,MAAO,WAEL,OAAO7sB,GAAIoK,EAAQxR,MAAQA,KAAKwwB,WAAaxwB,KAC/C,EAEA4W,SAAU,WACR,OAAO,IAAI+U,GAAc3rB,KAC3B,EAEAoW,MAAO,WACL,OAAOzE,EAAU3R,MAAQA,KAAK0W,eAC5BlF,EAAQxR,MAAQA,KAAKsW,aACrBtW,KAAK4W,UACT,EAEAsd,QAAS,WAEP,OAAOvB,GAAMnhB,EAAQxR,MAAQA,KAAKwwB,WAAaxwB,KACjD,EAEA8Z,OAAQ,WAEN,OAAO3O,GAAKqG,EAAQxR,MAAQA,KAAKwwB,WAAaxwB,KAChD,EAKA6W,SAAU,WACR,MAAO,YACT,EAEAO,WAAY,SAAS6b,EAAMhK,GACzB,OAAkB,IAAdjpB,KAAKmM,KACA8mB,EAAOhK,EAETgK,EAAO,IAAMjzB,KAAKoW,QAAQ5K,IAAIxL,KAAKm0B,kBAAkBhrB,KAAK,MAAQ,IAAM8f,CACjF,EAKAhhB,OAAQ,WACN,OAAO+kB,GAAMhtB,KAAMguB,GAAchuB,KADFgR,EAAQlR,KAAKV,UAAW,IAEzD,EAEAmd,SAAU,SAASC,GACjB,OAAOxc,KAAK+H,MAAK,SAASqJ,GAAS,OAAO4I,GAAG5I,EAAOoL,EAAY,GAClE,EAEA9B,QAAS,WACP,OAAO1a,KAAK2X,WAAW7C,EACzB,EAEA6F,MAAO,SAAS4R,EAAWJ,GACzBtN,GAAkB7e,KAAKmM,MACvB,IAAIioB,GAAc,EAOlB,OANAp0B,KAAK+T,WAAU,SAASwB,EAAGD,EAAG0H,GAC5B,IAAKuP,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,GAEjC,OADAoX,GAAc,GACP,CAEX,IACOA,CACT,EAEAlyB,OAAQ,SAASqqB,EAAWJ,GAC1B,OAAOa,GAAMhtB,KAAMssB,GAActsB,KAAMusB,EAAWJ,GAAS,GAC7D,EAEAkI,KAAM,SAAS9H,EAAWJ,EAAS/P,GACjC,IAAI/C,EAAQrZ,KAAKs0B,UAAU/H,EAAWJ,GACtC,OAAO9S,EAAQA,EAAM,GAAK+C,CAC5B,EAEAkY,UAAW,SAAS/H,EAAWJ,GAC7B,IAAIoI,EAOJ,OANAv0B,KAAK+T,WAAU,SAASwB,EAAGD,EAAG0H,GAC5B,GAAIuP,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,GAEhC,OADAuX,EAAQ,CAACjf,EAAGC,IACL,CAEX,IACOgf,CACT,EAEAC,cAAe,SAASjI,EAAWJ,GACjC,OAAOnsB,KAAKoW,QAAQqB,UAAU6c,UAAU/H,EAAWJ,EACrD,EAEA9kB,QAAS,SAASotB,EAAYtI,GAE5B,OADAtN,GAAkB7e,KAAKmM,MAChBnM,KAAK+T,UAAUoY,EAAUsI,EAAWtD,KAAKhF,GAAWsI,EAC7D,EAEAtrB,KAAM,SAAS2lB,GACbjQ,GAAkB7e,KAAKmM,MACvB2iB,OAA0BpmB,IAAdomB,EAA0B,GAAKA,EAAY,IACvD,IAAI4F,EAAS,GACTC,GAAU,EAKd,OAJA30B,KAAK+T,WAAU,SAASwB,GACtBof,EAAWA,GAAU,EAAUD,GAAU5F,EACzC4F,GAAgB,OAANnf,QAAoB7M,IAAN6M,EAAkBA,EAAEsB,WAAa,EAC3D,IACO6d,CACT,EAEAvuB,KAAM,WACJ,OAAOnG,KAAK2X,WAAW/C,EACzB,EAEApJ,IAAK,SAAS0V,EAAQiL,GACpB,OAAOa,GAAMhtB,KAAMksB,GAAWlsB,KAAMkhB,EAAQiL,GAC9C,EAEAzoB,OAAQ,SAASkxB,EAASC,EAAkB1I,GAE1C,IAAI2I,EACAC,EAcJ,OAhBAlW,GAAkB7e,KAAKmM,MAGnB/M,UAAUD,OAAS,EACrB41B,GAAW,EAEXD,EAAYD,EAEd70B,KAAK+T,WAAU,SAASwB,EAAGD,EAAG0H,GACxB+X,GACFA,GAAW,EACXD,EAAYvf,GAEZuf,EAAYF,EAAQ90B,KAAKqsB,EAAS2I,EAAWvf,EAAGD,EAAG0H,EAEvD,IACO8X,CACT,EAEAE,YAAa,SAASJ,EAASC,EAAkB1I,GAC/C,IAAI8I,EAAWj1B,KAAKsW,aAAamB,UACjC,OAAOwd,EAASvxB,OAAO3D,MAAMk1B,EAAU71B,UACzC,EAEAqY,QAAS,WACP,OAAOuV,GAAMhtB,KAAMqsB,GAAersB,MAAM,GAC1C,EAEA8K,MAAO,SAASuJ,EAAOC,GACrB,OAAO0Y,GAAMhtB,KAAMitB,GAAajtB,KAAMqU,EAAOC,GAAK,GACpD,EAEAvM,KAAM,SAASwkB,EAAWJ,GACxB,OAAQnsB,KAAK2a,MAAMua,GAAI3I,GAAYJ,EACrC,EAEAtL,KAAM,SAASC,GACb,OAAOkM,GAAMhtB,KAAMghB,GAAYhhB,KAAM8gB,GACvC,EAEA2G,OAAQ,WACN,OAAOznB,KAAK2X,WAAW9C,EACzB,EAKAsgB,QAAS,WACP,OAAOn1B,KAAK8K,MAAM,GAAI,EACxB,EAEAsqB,QAAS,WACP,YAAqB1sB,IAAd1I,KAAKmM,KAAmC,IAAdnM,KAAKmM,MAAcnM,KAAK+H,MAAK,WAAa,OAAO,CAAI,GACxF,EAEAoa,MAAO,SAASoK,EAAWJ,GACzB,OAAOtY,EACL0Y,EAAYvsB,KAAKoW,QAAQlU,OAAOqqB,EAAWJ,GAAWnsB,KAE1D,EAEAq1B,QAAS,SAAS3I,EAASP,GACzB,OAAOM,GAAezsB,KAAM0sB,EAASP,EACvC,EAEA/R,OAAQ,SAASuC,GACf,OAAOtC,GAAUra,KAAM2c,EACzB,EAEAlG,SAAU,WACR,IAAIT,EAAWhW,KACf,GAAIgW,EAASsB,OAEX,OAAO,IAAIY,GAASlC,EAASsB,QAE/B,IAAIge,EAAkBtf,EAASI,QAAQ5K,IAAI+pB,IAAa7e,eAExD,OADA4e,EAAgB/e,aAAe,WAAa,OAAOP,EAASI,OAAO,EAC5Dkf,CACT,EAEAE,UAAW,SAASjJ,EAAWJ,GAC7B,OAAOnsB,KAAKkC,OAAOgzB,GAAI3I,GAAYJ,EACrC,EAEAsJ,SAAU,SAASlJ,EAAWJ,EAAS/P,GACrC,OAAOpc,KAAKsW,aAAamB,UAAU4c,KAAK9H,EAAWJ,EAAS/P,EAC9D,EAEAsZ,MAAO,WACL,OAAO11B,KAAKq0B,KAAKrgB,EACnB,EAEA5I,QAAS,SAAS8V,EAAQiL,GACxB,OAAOa,GAAMhtB,KAAM4uB,GAAe5uB,KAAMkhB,EAAQiL,GAClD,EAEAiC,QAAS,SAASG,GAChB,OAAOvB,GAAMhtB,KAAMsuB,GAAetuB,KAAMuuB,GAAO,GACjD,EAEAhY,aAAc,WACZ,OAAO,IAAIqV,GAAoB5rB,KACjC,EAEA6K,IAAK,SAAS8qB,EAAWvZ,GACvB,OAAOpc,KAAKq0B,MAAK,SAASxZ,EAAGlb,GAAO,OAAOqa,GAAGra,EAAKg2B,EAAU,QAAGjtB,EAAW0T,EAC7E,EAEAwZ,MAAO,SAASC,EAAezZ,GAM7B,IALA,IAIIV,EAJAoa,EAAS91B,KAGT8T,EAAOgM,GAAc+V,KAEhBna,EAAO5H,EAAK5E,QAAQuG,MAAM,CACjC,IAAI9V,EAAM+b,EAAKtK,MAEf,IADA0kB,EAASA,GAAUA,EAAOjrB,IAAMirB,EAAOjrB,IAAIlL,EAAKqT,GAAWA,KAC5CA,EACb,OAAOoJ,CAEX,CACA,OAAO0Z,CACT,EAEAC,QAAS,SAASrJ,EAASP,GACzB,OAAOS,GAAe5sB,KAAM0sB,EAASP,EACvC,EAEAnqB,IAAK,SAAS2zB,GACZ,OAAO31B,KAAK6K,IAAI8qB,EAAW3iB,KAAaA,CAC1C,EAEAgjB,MAAO,SAASH,GACd,OAAO71B,KAAK41B,MAAMC,EAAe7iB,KAAaA,CAChD,EAEAijB,SAAU,SAASniB,GAEjB,OADAA,EAAgC,oBAAlBA,EAAKyI,SAA0BzI,EAAO3C,EAAS2C,GACtD9T,KAAK2a,OAAM,SAASvJ,GAAS,OAAO0C,EAAKyI,SAASnL,EAAM,GACjE,EAEA8kB,WAAY,SAASpiB,GAEnB,OADAA,EAAgC,oBAAlBA,EAAKmiB,SAA0BniB,EAAO3C,EAAS2C,IACjDmiB,SAASj2B,KACvB,EAEAyxB,OAAQ,WACN,OAAOzxB,KAAKoW,QAAQ5K,IAAI2qB,IAAWzf,cACrC,EAEA7F,KAAM,WACJ,OAAO7Q,KAAKoW,QAAQqB,UAAUie,OAChC,EAEAhiB,IAAK,SAASoN,GACZ,OAAOmO,GAAWjvB,KAAM8gB,EAC1B,EAEAsV,MAAO,SAASlV,EAAQJ,GACtB,OAAOmO,GAAWjvB,KAAM8gB,EAAYI,EACtC,EAEAvM,IAAK,SAASmM,GACZ,OAAOmO,GAAWjvB,KAAM8gB,EAAauV,GAAIvV,GAAcwV,GACzD,EAEAC,MAAO,SAASrV,EAAQJ,GACtB,OAAOmO,GAAWjvB,KAAM8gB,EAAauV,GAAIvV,GAAcwV,GAAsBpV,EAC/E,EAEApY,KAAM,WACJ,OAAO9I,KAAK8K,MAAM,EACpB,EAEA0rB,KAAM,SAASC,GACb,OAAOz2B,KAAK8K,MAAM2I,KAAKC,IAAI,EAAG+iB,GAChC,EAEAC,SAAU,SAASD,GACjB,OAAOzJ,GAAMhtB,KAAMA,KAAKoW,QAAQqB,UAAU+e,KAAKC,GAAQhf,UACzD,EAEAkf,UAAW,SAASpK,EAAWJ,GAC7B,OAAOa,GAAMhtB,KAAM6tB,GAAiB7tB,KAAMusB,EAAWJ,GAAS,GAChE,EAEAyK,UAAW,SAASrK,EAAWJ,GAC7B,OAAOnsB,KAAK22B,UAAUzB,GAAI3I,GAAYJ,EACxC,EAEAlL,OAAQ,SAASC,EAAQJ,GACvB,OAAOkM,GAAMhtB,KAAMghB,GAAYhhB,KAAM8gB,EAAYI,GACnD,EAEA2V,KAAM,SAASJ,GACb,OAAOz2B,KAAK8K,MAAM,EAAG2I,KAAKC,IAAI,EAAG+iB,GACnC,EAEAK,SAAU,SAASL,GACjB,OAAOzJ,GAAMhtB,KAAMA,KAAKoW,QAAQqB,UAAUof,KAAKJ,GAAQhf,UACzD,EAEAsf,UAAW,SAASxK,EAAWJ,GAC7B,OAAOa,GAAMhtB,KAAM0tB,GAAiB1tB,KAAMusB,EAAWJ,GACvD,EAEA6K,UAAW,SAASzK,EAAWJ,GAC7B,OAAOnsB,KAAK+2B,UAAU7B,GAAI3I,GAAYJ,EACxC,EAEAqE,SAAU,WACR,OAAOxwB,KAAK0W,cACd,EAKA8G,SAAU,WACR,OAAOxd,KAAKwa,SAAWxa,KAAKwa,OAASyc,GAAaj3B,MACpD,IAeF,IAAIk3B,GAAoB/lB,EAASvR,UACjCs3B,GAAkBjlB,IAAwB,EAC1CilB,GAAkB/hB,GAAmB+hB,GAAkBzP,OACvDyP,GAAkBtD,OAASsD,GAAkB1f,QAC7C0f,GAAkB/C,iBAAmBgD,GACrCD,GAAkBjgB,QAClBigB,GAAkBhgB,SAAW,WAAa,OAAOlX,KAAK6W,UAAY,EAClEqgB,GAAkBE,MAAQF,GAAkB9rB,QAC5C8rB,GAAkBG,SAAWH,GAAkB3a,SAG/C,WACE,IACEjd,OAAOif,eAAe2Y,GAAmB,SAAU,CACjDrsB,IAAK,WACH,IAAKsG,EAASmmB,gBAAiB,CAC7B,IAAIhR,EACJ,IACE,MAAM,IAAI/K,KACZ,CAAE,MAAOD,GACPgL,EAAQhL,EAAMgL,KAChB,CACA,IAAsC,IAAlCA,EAAMlgB,QAAQ,eAOhB,OANAmxB,SAAWA,QAAQC,MAAQD,QAAQC,KACjC,4IAGAlR,GAEKtmB,KAAKmM,IAEhB,CACF,GAEJ,CAAE,MAAOtN,GAAI,CACd,CAxBD,GA4BA20B,GAAMjiB,EAAe,CAInB8Z,KAAM,WACJ,OAAO2B,GAAMhtB,KAAM6rB,GAAY7rB,MACjC,EAEAy3B,QAAS,SAASlL,EAAWJ,GAC3B,IAAI9S,EAAQrZ,KAAKs0B,UAAU/H,EAAWJ,GACtC,OAAO9S,GAASA,EAAM,EACxB,EAEAqe,YAAa,SAASnL,EAAWJ,GAC/B,OAAOnsB,KAAKoW,QAAQqB,UAAUggB,QAAQlL,EAAWJ,EACnD,EAEAwL,MAAO,SAASnb,GACd,OAAOxc,KAAKy3B,SAAQ,SAASrmB,GAAS,OAAO4I,GAAG5I,EAAOoL,EAAY,GACrE,EAEAob,UAAW,SAASpb,GAClB,OAAOxc,KAAK03B,aAAY,SAAStmB,GAAS,OAAO4I,GAAG5I,EAAOoL,EAAY,GACzE,EAEAqb,WAAY,SAAS3W,EAAQiL,GAAU,IAAIzP,EAAS1c,KAC9Cqc,EAAa,EACjB,OAAO2Q,GAAMhtB,KACXA,KAAKoW,QAAQ5K,KACX,SAAS+J,EAAGD,GAAK,OAAO4L,EAAOphB,KAAKqsB,EAAS,CAAC7W,EAAGC,GAAI8G,IAAcK,EAAO,IAC1EnG,eAEN,EAEAuhB,QAAS,SAAS5W,EAAQiL,GAAU,IAAIzP,EAAS1c,KAC/C,OAAOgtB,GAAMhtB,KACXA,KAAKoW,QAAQiV,OAAO7f,KAClB,SAAS8J,EAAGC,GAAK,OAAO2L,EAAOphB,KAAKqsB,EAAS7W,EAAGC,EAAGmH,EAAO,IAC1D2O,OAEN,IAIF,IAAI0M,GAAyBxmB,EAAc3R,UAiL3C,SAASu2B,GAAU5gB,EAAGD,GACpB,OAAOA,CACT,CAEA,SAASigB,GAAYhgB,EAAGD,GACtB,MAAO,CAACA,EAAGC,EACb,CAEA,SAAS2f,GAAI3I,GACX,OAAO,WACL,OAAQA,EAAUxsB,MAAMC,KAAMZ,UAChC,CACF,CAEA,SAASi3B,GAAI9J,GACX,OAAO,WACL,OAAQA,EAAUxsB,MAAMC,KAAMZ,UAChC,CACF,CAEA,SAAS+3B,GAAY/lB,GACnB,MAAwB,kBAAVA,EAAqB4mB,KAAKC,UAAU7mB,GAASA,CAC7D,CAEA,SAAS8mB,KACP,OAAO5kB,EAAQlU,UACjB,CAEA,SAASk3B,GAAqBhc,EAAGC,GAC/B,OAAOD,EAAIC,EAAI,EAAID,EAAIC,GAAK,EAAI,CAClC,CAEA,SAAS0c,GAAajhB,GACpB,GAAIA,EAAS7J,OAASgP,IACpB,OAAO,EAET,IAAIgd,EAAU5lB,EAAUyD,GACpBoiB,EAAQ5mB,EAAQwE,GAChBoH,EAAI+a,EAAU,EAAI,EAUtB,OAAOE,GATIriB,EAASjC,UAClBqkB,EACED,EACE,SAAS5iB,EAAGD,GAAM8H,EAAI,GAAKA,EAAIkb,GAAUnb,GAAK5H,GAAI4H,GAAK7H,IAAM,CAAG,EAChE,SAASC,EAAGD,GAAM8H,EAAIA,EAAIkb,GAAUnb,GAAK5H,GAAI4H,GAAK7H,IAAM,CAAG,EAC7D6iB,EACE,SAAS5iB,GAAM6H,EAAI,GAAKA,EAAID,GAAK5H,GAAK,CAAG,EACzC,SAASA,GAAM6H,EAAIA,EAAID,GAAK5H,GAAK,CAAG,GAEZ6H,EAChC,CAEA,SAASib,GAAiBlsB,EAAMiR,GAQ9B,OAPAA,EAAIL,GAAKK,EAAG,YACZA,EAAIL,GAAKK,GAAK,GAAKA,KAAO,GAAI,WAC9BA,EAAIL,GAAKK,GAAK,GAAKA,KAAO,GAAI,GAE9BA,EAAIL,IADJK,EAAKA,EAAI,WAAkBjR,GACdiR,IAAM,GAAI,YAEvBA,EAAIH,IADJG,EAAIL,GAAKK,EAAIA,IAAM,GAAI,aACXA,IAAM,GAEpB,CAEA,SAASkb,GAAUhe,EAAGC,GACpB,OAAOD,EAAIC,EAAI,YAAcD,GAAK,IAAMA,GAAK,EAC/C,CAwBA,OAxQAyd,GAAuB5lB,IAAqB,EAC5C4lB,GAAuB5iB,GAAmB+hB,GAAkBxc,QAC5Dqd,GAAuBnE,OAASsD,GAAkBpD,SAClDiE,GAAuB5D,iBAAmB,SAAS5e,EAAGD,GAAK,OAAO0iB,KAAKC,UAAU3iB,GAAK,KAAO6hB,GAAY5hB,EAAE,EAI3Gie,GAAM9hB,EAAiB,CAIrB4E,WAAY,WACV,OAAO,IAAIgV,GAAgBtrB,MAAM,EACnC,EAKAkC,OAAQ,SAASqqB,EAAWJ,GAC1B,OAAOa,GAAMhtB,KAAMssB,GAActsB,KAAMusB,EAAWJ,GAAS,GAC7D,EAEAoM,UAAW,SAAShM,EAAWJ,GAC7B,IAAI9S,EAAQrZ,KAAKs0B,UAAU/H,EAAWJ,GACtC,OAAO9S,EAAQA,EAAM,IAAM,CAC7B,EAEAjT,QAAS,SAASoW,GAChB,IAAI7c,EAAMK,KAAKsW,aAAaqhB,MAAMnb,GAClC,YAAe9T,IAAR/I,GAAqB,EAAIA,CAClC,EAEA8c,YAAa,SAASD,GACpB,IAAI7c,EAAMK,KAAKsW,aAAamB,UAAUkgB,MAAMnb,GAC5C,YAAe9T,IAAR/I,GAAqB,EAAIA,CAIlC,EAEA8X,QAAS,WACP,OAAOuV,GAAMhtB,KAAMqsB,GAAersB,MAAM,GAC1C,EAEA8K,MAAO,SAASuJ,EAAOC,GACrB,OAAO0Y,GAAMhtB,KAAMitB,GAAajtB,KAAMqU,EAAOC,GAAK,GACpD,EAEA8S,OAAQ,SAASzc,EAAO6tB,GACtB,IAAIC,EAAUr5B,UAAUD,OAExB,GADAq5B,EAAY/kB,KAAKC,IAAgB,EAAZ8kB,EAAe,GACpB,IAAZC,GAA8B,IAAZA,IAAkBD,EACtC,OAAOx4B,KAKT2K,EAAQ4J,EAAa5J,EAAOA,EAAQ,EAAI3K,KAAKmiB,QAAUniB,KAAKmM,MAC5D,IAAIusB,EAAU14B,KAAK8K,MAAM,EAAGH,GAC5B,OAAOqiB,GACLhtB,KACY,IAAZy4B,EACEC,EACAA,EAAQzwB,OAAOqL,EAAQlU,UAAW,GAAIY,KAAK8K,MAAMH,EAAQ6tB,IAE/D,EAKAG,cAAe,SAASpM,EAAWJ,GACjC,IAAIxsB,EAAMK,KAAKsW,aAAaohB,YAAYnL,EAAWJ,GACnD,YAAezjB,IAAR/I,GAAqB,EAAIA,CAClC,EAEA+1B,MAAO,WACL,OAAO11B,KAAK6K,IAAI,EAClB,EAEAujB,QAAS,SAASG,GAChB,OAAOvB,GAAMhtB,KAAMsuB,GAAetuB,KAAMuuB,GAAO,GACjD,EAEA1jB,IAAK,SAASF,EAAOyR,GAEnB,OADAzR,EAAQsJ,EAAUjU,KAAM2K,IACR,GAAM3K,KAAKmM,OAASgP,UACjBzS,IAAd1I,KAAKmM,MAAsBxB,EAAQ3K,KAAKmM,KAC3CiQ,EACApc,KAAKq0B,MAAK,SAASxZ,EAAGlb,GAAO,OAAOA,IAAQgL,CAAK,QAAGjC,EAAW0T,EACnE,EAEApa,IAAK,SAAS2I,GAEZ,OADAA,EAAQsJ,EAAUjU,KAAM2K,KACR,SAAoBjC,IAAd1I,KAAKmM,KACzBnM,KAAKmM,OAASgP,KAAYxQ,EAAQ3K,KAAKmM,MACd,IAAzBnM,KAAKoG,QAAQuE,GAEjB,EAEAiuB,UAAW,SAAS9J,GAClB,OAAO9B,GAAMhtB,KAAM6uB,GAAiB7uB,KAAM8uB,GAC5C,EAEA+J,WAAY,WACV,IAAI1U,EAAY,CAACnkB,MAAMiI,OAAOqL,EAAQlU,YAClC05B,EAAS1J,GAAepvB,KAAKoW,QAASxE,EAAWuF,GAAIgN,GACrD4U,EAAcD,EAAO1K,SAAQ,GAIjC,OAHI0K,EAAO3sB,OACT4sB,EAAY5sB,KAAO2sB,EAAO3sB,KAAOgY,EAAUhlB,QAEtC6tB,GAAMhtB,KAAM+4B,EACrB,EAEAloB,KAAM,WACJ,OAAO7Q,KAAK6K,KAAK,EACnB,EAEA8rB,UAAW,SAASpK,EAAWJ,GAC7B,OAAOa,GAAMhtB,KAAM6tB,GAAiB7tB,KAAMusB,EAAWJ,GAAS,GAChE,EAEA6M,IAAK,WAEH,OAAOhM,GAAMhtB,KAAMovB,GAAepvB,KAAMk4B,GADxB,CAACl4B,MAAMiI,OAAOqL,EAAQlU,aAExC,EAEA65B,QAAS,SAAS3J,GAChB,IAAInL,EAAY7Q,EAAQlU,WAExB,OADA+kB,EAAU,GAAKnkB,KACRgtB,GAAMhtB,KAAMovB,GAAepvB,KAAMsvB,EAAQnL,GAClD,IAIFzS,EAAgB9R,UAAUyS,IAAuB,EACjDX,EAAgB9R,UAAU6S,IAAuB,EAIjD+gB,GAAM3hB,EAAa,CAIjBhH,IAAK,SAASuG,EAAOgL,GACnB,OAAOpc,KAAKgC,IAAIoP,GAASA,EAAQgL,CACnC,EAEAG,SAAU,SAASnL,GACjB,OAAOpR,KAAKgC,IAAIoP,EAClB,EAKAqgB,OAAQ,WACN,OAAOzxB,KAAKwwB,UACd,IAIF3e,EAAYjS,UAAUoC,IAAMk1B,GAAkB3a,SAK9CiX,GAAM/hB,EAAUF,EAAc3R,WAC9B4zB,GAAM5hB,EAAYF,EAAgB9R,WAClC4zB,GAAMzhB,EAAQF,EAAYjS,WAE1B4zB,GAAMvX,GAAiB1K,EAAc3R,WACrC4zB,GAAMtX,GAAmBxK,EAAgB9R,WACzC4zB,GAAMrX,GAAetK,EAAYjS,WAuEjB,CAEduR,SAAUA,EAEVG,IAAKA,EACL0K,WAAYA,GACZjO,IAAKA,GACLgT,WAAYA,GACZ5V,KAAMA,GACNwnB,MAAOA,GACPvrB,IAAKA,GACL2qB,WAAYA,GAEZjC,OAAQA,GACRtU,MAAOA,GACPR,OAAQA,GAERhB,GAAIA,GACJT,OAAQA,GAMZ,CA32JkF2f,E,yICRlF,SAAS75B,IAeP,OAdAA,EAAWC,OAAOC,QAAU,SAAUC,GACpC,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CACzC,IAAIC,EAASN,UAAUK,GAEvB,IAAK,IAAIE,KAAOD,EACVJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAC/CH,EAAOG,GAAOD,EAAOC,GAG3B,CAEA,OAAOH,CACT,EAEOH,EAASU,MAAMC,KAAMZ,UAC9B,CA4DA,I,8BCzEA,SAAS,IAeP,OAdA,EAAWE,OAAOC,QAAU,SAAUC,GACpC,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CACzC,IAAIC,EAASN,UAAUK,GAEvB,IAAK,IAAIE,KAAOD,EACVJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAC/CH,EAAOG,GAAOD,EAAOC,GAG3B,CAEA,OAAOH,CACT,EAEO,EAASO,MAAMC,KAAMZ,UAC9B,CASA,SAASuG,EAAgBC,EAAGC,GAM1B,OALAF,EAAkBrG,OAAOwG,gBAAkB,SAAyBF,EAAGC,GAErE,OADAD,EAAEG,UAAYF,EACPD,CACT,EAEOD,EAAgBC,EAAGC,EAC5B,CAEA,IAAIszB,EAAuB,SAAUC,GAhBrC,IAAwB7sB,EAAUC,EAmBhC,SAAS2sB,IAGP,IAFA,IAAIzsB,EAEKlD,EAAOpK,UAAUD,OAAQ0I,EAAO,IAAI5I,MAAMuK,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC/E5B,EAAK4B,GAAQrK,UAAUqK,GAuBzB,OApBAiD,EAAQ0sB,EAAiBt5B,KAAKC,MAAMq5B,EAAkB,CAACp5B,MAAMiI,OAAOJ,KAAU7H,MACxE4M,MAAQ,CAMZysB,qBAAiB3wB,GAGnBgE,EAAM4sB,kBAAoB,SAAUD,GAClC,OAAO3sB,EAAMW,SAAS,CACpBgsB,gBAAiBA,GAErB,EAEA3sB,EAAM6sB,qBAAuB,SAAUC,GACrC,OAAoB,gBAAoB,MAAO,KAAmB,gBAAoB,EAAAn0B,aAAcm0B,GAA6B,gBAAoB,EAAAz0B,WAAYy0B,GAA6B,gBAAoB,EAAA/zB,gBAAiB+zB,GAA6B,gBAAoB,EAAAv0B,WAAYu0B,GAClS,EAEO9sB,CACT,CAoBA,OAnEgCF,EAiBR4sB,GAjBF7sB,EAiBP4sB,GAhBNv5B,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAC9C2M,EAAS3M,UAAU8O,YAAcnC,EAEjC5G,EAAgB4G,EAAUC,GA6Cb2sB,EAAQv5B,UAEd6P,OAAS,WACd,IAAIE,EAAc3P,KAAKK,MACnBC,EAAQqP,EAAYrP,MACpBm5B,EAAQ9pB,EAAY8pB,MACpBC,EAAkB15B,KAAK4M,MAAMysB,gBAC7BM,EAAgB,CAClBr5B,MAAOA,EAAMs5B,aACb93B,eAAgB23B,EAAMI,QAAQ,kBAC9B71B,eAAgBy1B,EAAMI,QAAQ,kBAC9BP,kBAAmBt5B,KAAKs5B,mBAE1B,OAAoB,gBAAoB,MAAO,CAC7C74B,UAAWH,EAAMw5B,cAAcC,SAC9BL,EAA+B,gBAAoBA,EAAiBC,IAAkB35B,KAAKK,MAAMD,UAAYJ,KAAKu5B,sBAAsBI,GAC7I,EAEOR,CACT,CApD2B,CAoDzB,aAEFA,EAAQnpB,UAAY,CAClB5P,SAAU,UAGZ,IAAI0uB,EAAY,UAChB,SAASkL,EAAU95B,GACjB,IAAI+5B,EAAiB/5B,EAAKO,UACtBA,OAA+B,IAAnBw5B,EAA4BnL,EAAYmL,EACxD,OAAoB,gBAAoB,MAAO,CAC7Cx5B,UAAWA,GAEf,CAEA,IAQIy5B,EAAe,CACjBN,aATiB,CACjBh5B,cAAe,UACfF,OAAQ,UACRC,OAAQ,WAORm5B,cALkB,CAClBC,QAAS,YAOP,EAAQ,SAAWI,QACN,IAAXA,IACFA,EAAS,CAAC,GAGZ,IAAIV,EDtGN,SAAqBW,QACE,IAAjBA,IACFA,EAAe,CAAC,GAGlB,IAAIxtB,EAAQwtB,EACRC,EAAY,CAAC,EACjB,MAAO,CACLC,gBAAiB,SAAyB36B,EAAK46B,GAC7CF,EAAU16B,GAAO06B,EAAU16B,IAAQ,GACnC06B,EAAU16B,GAAKoE,KAAKw2B,EACtB,EACAC,oBAAqB,SAA6B76B,EAAK46B,GACrD,IAAIE,EAAWJ,EAAU16B,GAErB86B,IACFJ,EAAU16B,GAAO86B,EAASv4B,QAAO,SAAUw4B,GACzC,OAAOA,IAAoBH,CAC7B,IAEJ,EACAI,WAAY,SAAoBh7B,EAAKi7B,GACnC,IAAIC,EAEJjuB,EAAQvN,EAAS,CAAC,EAAGuN,IAAQiuB,EAAY,CAAC,GAAal7B,GAAOi7B,EAAMC,IACpE,IAAIJ,EAAWJ,EAAU16B,GAErB86B,GACFA,EAASpzB,SAAQ,SAAUqzB,GACzB,OAAOA,EAAgB9tB,EAAMjN,GAC/B,GAEJ,EACAk6B,QAAS,SAAiBl6B,GACxB,OAAOiN,EAAMjN,EACf,EAEJ,CCiEcm7B,GAERC,EADUZ,EACc75B,MACxBA,OAA0B,IAAlBy6B,EAA2Bb,EAAea,EAStD,MAAO,CACLvsB,WAAY,SAAoBtO,GAC9B,IAAI4B,EAAiB5B,EAAK4B,eACtBkC,EAAiB9D,EAAK8D,eAC1By1B,EAAMkB,WAAW,iBAAkB74B,GACnC23B,EAAMkB,WAAW,iBAAkB32B,EACrC,EAEAiH,SAAU,SAAkB3G,GAE1B,OADAm1B,EAAMkB,WAAW,YAAar2B,EAAY9B,gBACnC8B,CACT,EACA60B,QAnBkB,SAAuB94B,GACzC,OAAoB,gBAAoB84B,EAAS,EAAS,CAAC,EAAG94B,EAAO,CACnEo5B,MAAOA,EACPn5B,MAAOA,IAEX,EAgBD,C,qCCtJD,SAAS1B,EAAEC,GAAG,IAAIC,EAAEC,EAAEC,EAAE,GAAG,GAAG,iBAAiBH,GAAG,iBAAiBA,EAAEG,GAAGH,OAAO,GAAG,iBAAiBA,EAAE,GAAGI,MAAMC,QAAQL,GAAG,CAAC,IAAI+G,EAAE/G,EAAEM,OAAO,IAAIL,EAAE,EAAEA,EAAE8G,EAAE9G,IAAID,EAAEC,KAAKC,EAAEH,EAAEC,EAAEC,OAAOE,IAAIA,GAAG,KAAKA,GAAGD,EAAE,MAAM,IAAIA,KAAKF,EAAEA,EAAEE,KAAKC,IAAIA,GAAG,KAAKA,GAAGD,GAAG,OAAOC,CAAC,CAAQ,SAASg8B,IAAO,IAAI,IAAIn8B,EAAEC,EAAEC,EAAE,EAAEC,EAAE,GAAG4G,EAAExG,UAAUD,OAAOJ,EAAE6G,EAAE7G,KAAKF,EAAEO,UAAUL,MAAMD,EAAEF,EAAEC,MAAMG,IAAIA,GAAG,KAAKA,GAAGF,GAAG,OAAOE,CAAC,C,0CAAC,W,qCCAhX,SAASi8B,EAAmB1nB,GAAO,OAMnC,SAA4BA,GAAO,GAAItU,MAAMC,QAAQqU,GAAM,CAAE,IAAK,IAAI9T,EAAI,EAAGy7B,EAAO,IAAIj8B,MAAMsU,EAAIpU,QAASM,EAAI8T,EAAIpU,OAAQM,IAAOy7B,EAAKz7B,GAAK8T,EAAI9T,GAAM,OAAOy7B,CAAM,CAAE,CAN3HC,CAAmB5nB,IAI7D,SAA0BO,GAAQ,GAAIkB,OAAOC,YAAY3V,OAAOwU,IAAkD,uBAAzCxU,OAAOM,UAAUiX,SAAS/W,KAAKgU,GAAgC,OAAO7U,MAAMoqB,KAAKvV,EAAO,CAJ5FsnB,CAAiB7nB,IAEtF,WAAgC,MAAM,IAAIyF,UAAU,kDAAoD,CAFVqiB,EAAsB,CAQpH,SAASC,EAAQhjB,EAAQijB,GAAkB,IAAIp1B,EAAO7G,OAAO6G,KAAKmS,GAAwO,OAA3NhZ,OAAOq0B,uBAAyBxtB,EAAKpC,KAAKhE,MAAMoG,EAAM7G,OAAOq0B,sBAAsBrb,IAAgBijB,IAAgBp1B,EAAOA,EAAKjE,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyBnjB,EAAQkjB,GAAKE,UAAY,KAAWv1B,CAAM,CAEvT,SAASw1B,EAAcn8B,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAOA,EAAI,EAAK67B,EAAQ57B,GAAQ,GAAM2H,SAAQ,SAAU1H,GAAOi8B,EAAgBp8B,EAAQG,EAAKD,EAAOC,GAAO,IAAeL,OAAOu8B,0BAA6Bv8B,OAAOw8B,iBAAiBt8B,EAAQF,OAAOu8B,0BAA0Bn8B,IAAmB47B,EAAQ57B,GAAQ2H,SAAQ,SAAU1H,GAAOL,OAAOif,eAAe/e,EAAQG,EAAKL,OAAOm8B,yBAAyB/7B,EAAQC,GAAO,GAAM,CAAE,OAAOH,CAAQ,CAErgB,SAASo8B,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAEhN,SAASiwB,EAAe1oB,EAAK9T,GAAK,OAMlC,SAAyB8T,GAAO,GAAItU,MAAMC,QAAQqU,GAAM,OAAOA,CAAK,CAN3B2oB,CAAgB3oB,IAIzD,SAA+BA,EAAK9T,GAAK,IAAI08B,EAAO,GAAQC,GAAK,EAAUC,GAAK,EAAWC,OAAK5zB,EAAW,IAAM,IAAK,IAAiC6zB,EAA7BC,EAAKjpB,EAAIyB,OAAOC,cAAmBmnB,GAAMG,EAAKC,EAAGttB,QAAQuG,QAAoB0mB,EAAKp4B,KAAKw4B,EAAGnrB,QAAY3R,GAAK08B,EAAKh9B,SAAWM,GAA3D28B,GAAK,GAAkE,CAAE,MAAOK,GAAOJ,GAAK,EAAMC,EAAKG,CAAK,CAAE,QAAU,IAAWL,GAAsB,MAAhBI,EAAW,QAAWA,EAAW,QAAK,CAAE,QAAU,GAAIH,EAAI,MAAMC,CAAI,CAAE,CAAE,OAAOH,CAAM,CAJvVO,CAAsBnpB,EAAK9T,IAE5F,WAA8B,MAAM,IAAIuZ,UAAU,uDAAyD,CAFT2jB,EAAoB,C,iDAoCtH,MA5BA,SAA8BC,EAAWC,GACvC,GAAiB,MAAbD,EACF,OAAOC,EAWT,IARA,IAAIC,EAAYb,EAAeY,EAAU,GACrCE,EAAkBD,EAAU,GAC5BE,EAAoBF,EAAU,GAE9BG,EAAWtB,EAAc,CAAC,EAAGoB,GAE7BG,EAAajC,EAAmB+B,GAE3BG,EAAM,EAAGC,EAAe99B,OAAO6G,KAAKy2B,GAAYO,EAAMC,EAAaj+B,OAAQg+B,IAAO,CACzF,IAAIE,EAAaD,EAAaD,GAE9B,GAAIJ,EAAgBl9B,eAAew9B,GAAa,CAC9C,IAAIC,EAAgBP,EAAgBM,GACpCJ,EAASI,GAAc1B,EAAc,CAAC,EAAG2B,EAAe,CAAC,EAAGV,EAAUS,GACxE,MACEJ,EAASI,GAAcT,EAAUS,GACjCH,EAAWn5B,KAAKs5B,EAEpB,CAEA,MAAO,CAACJ,EAAUC,EACpB,EC/CIK,EAAgB,CAClBC,cAAe,iBACf/8B,UAAW,QACXg9B,QAAS,MACTC,UAAW,cA0Bb,MAvBA,SAA6BC,GAC3B,GAAkB,MAAdA,EACF,OAAOA,EAMT,IAHA,IAAIC,EAAa,CAAC,EACdC,GAAe,EAEVrB,EAAK,EAAGY,EAAe99B,OAAO6G,KAAKw3B,GAAanB,EAAKY,EAAaj+B,OAAQq9B,IAAM,CACvF,IAAIxM,EAAOoN,EAAaZ,GACpBsB,EAAU9N,EAEVuN,EAAc19B,eAAemwB,KAC/B8N,EAAUP,EAAcvN,GACxB6N,GAAe,GAGjBD,EAAWE,GAAWH,EAAW3N,EACnC,CAEA,OAAO6N,EAAeD,EAAaD,CACrC,EC7BII,EAAgB,sBAChBC,EAAiB,QACjBC,EAAoB,WAGpBC,EAAmB,CACrBC,yBAAyB,EACzBC,mBAAmB,EACnBC,kBAAkB,EAClBC,kBAAkB,EAClBC,SAAS,EACTC,cAAc,EACdC,iBAAiB,EACjBC,aAAa,EACbC,MAAM,EACNC,UAAU,EACVC,cAAc,EACdC,YAAY,EACZC,cAAc,EACdC,WAAW,EACXC,SAAS,EACTC,YAAY,EACZC,aAAa,EACbC,cAAc,EACdC,YAAY,EACZC,eAAe,EACfC,gBAAgB,EAChBC,iBAAiB,EACjBC,YAAY,EACZC,WAAW,EACXC,YAAY,EACZC,SAAS,EACTC,OAAO,EACPC,SAAS,EACTC,SAAS,EACTC,QAAQ,EACRC,QAAQ,EACRC,MAAM,EAENC,aAAa,EACbC,cAAc,EACdC,aAAa,EACbC,iBAAiB,EACjBC,kBAAkB,EAClBC,kBAAkB,EAClBC,eAAe,EACfC,aAAa,GAiCf,MARA,SAAoBC,GAClB,OAAOrhC,OAAO6G,KAAKw6B,GAAYn1B,KAAI,SAAUwkB,GAC3C,IAAI4Q,EAnBR,SAA2B5Q,EAAM5e,GAC/B,IAAIyvB,EASJ,MAPqB,kBAAVzvB,EACTyvB,EAAY7C,EAAe8C,KAAK1vB,IAEhCyvB,GAAY,EACZzvB,EAAQ2vB,OAAO3vB,IAGZyvB,GAAuB,MAAVzvB,IAA4C,IAA3B8sB,EAAiBlO,GAG3C5e,EAAQ,KAFRA,CAIX,CAIqB4vB,CAAkBhR,EAAM2Q,EAAW3Q,IAChDiR,EAzBR,SAA0BjR,GACxB,OAAOA,EAAKkR,QAAQjD,EAAmB,OAAOkD,cAAcD,QAAQnD,EAAe,OACrF,CAuBoBqD,CAAiBpR,GACjC,MAAO,GAAG/nB,OAAOg5B,EAAW,MAAMh5B,OAAO24B,EAC3C,IAAGz3B,KAAK,KACV,EC7EWk4B,EAAa,CAEtBC,SAAU,WACVC,WAAY,aACZC,WAAY,aACZC,aAAc,eACdC,YAAa,cACbC,YAAa,cACbC,WAAY,aACZC,oBAAqB,sBACrBC,kBAAmB,oBACnBC,WAAY,aACZC,UAAW,YACXC,KAAM,aACNC,OAAQ,UAECC,EAAc,CACvBC,KAAM,OACNC,MAAO,QACPC,MAAO,SAEEC,EAAe,CACxBC,KAAM,OACNP,KAAM,OACNQ,OAAQ,SACRC,cAAe,gBACfC,UAAW,a,UCzBF1Q,EAAY,IAAI,EAAAF,WAsB3B,SAAS6Q,EAAevyB,EAAMwyB,GAM5B,IALA,IAAIC,EAAY7Q,EACZ8Q,EAAgB9Q,EAChB+Q,EAAS,GACTC,EAAa,EAERxjC,EAAI,EAAG+T,EAAMnD,EAAKlR,OAAQM,EAAI+T,EAAK/T,IAAK,CAC/CsjC,EAAgBD,EAChB,IAAII,EAAOL,EAAah4B,IAAIpL,GAC5BqjC,EAAYI,EAAOA,EAAKC,WAAalR,EAEjCxyB,EAAI,KAAM,IAAAua,IAAG8oB,EAAWC,KAC1BC,EAAOj/B,KAAK,CAACsM,EAAKvF,MAAMm4B,EAAYxjC,GAAIsjC,IACxCE,EAAaxjC,EAEjB,CAGA,OADAujC,EAAOj/B,KAAK,CAACsM,EAAKvF,MAAMm4B,GAAaH,IAC9BE,CACT,C,IC1CII,EAAoBC,EAAkBC,E,SAE1C,SAAS,EAAQhrB,EAAQijB,GAAkB,IAAIp1B,EAAO7G,OAAO6G,KAAKmS,GAAwO,OAA3NhZ,OAAOq0B,uBAAyBxtB,EAAKpC,KAAKhE,MAAMoG,EAAM7G,OAAOq0B,sBAAsBrb,IAAgBijB,IAAgBp1B,EAAOA,EAAKjE,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyBnjB,EAAQkjB,GAAKE,UAAY,KAAWv1B,CAAM,CAEvT,SAAS,EAAc3G,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAOA,EAAI,EAAK,EAAQC,GAAQ,GAAM2H,SAAQ,SAAU1H,GAAO,EAAgBH,EAAQG,EAAKD,EAAOC,GAAO,IAAeL,OAAOu8B,0BAA6Bv8B,OAAOw8B,iBAAiBt8B,EAAQF,OAAOu8B,0BAA0Bn8B,IAAmB,EAAQA,GAAQ2H,SAAQ,SAAU1H,GAAOL,OAAOif,eAAe/e,EAAQG,EAAKL,OAAOm8B,yBAAyB/7B,EAAQC,GAAO,GAAM,CAAE,OAAOH,CAAQ,CAErgB,SAAS,EAAe+T,EAAK9T,GAAK,OAMlC,SAAyB8T,GAAO,GAAItU,MAAMC,QAAQqU,GAAM,OAAOA,CAAK,CAN3B,CAAgBA,IAIzD,SAA+BA,EAAK9T,GAAK,IAAI08B,EAAO,GAAQC,GAAK,EAAUC,GAAK,EAAWC,OAAK5zB,EAAW,IAAM,IAAK,IAAiC6zB,EAA7BC,EAAKjpB,EAAIyB,OAAOC,cAAmBmnB,GAAMG,EAAKC,EAAGttB,QAAQuG,QAAoB0mB,EAAKp4B,KAAKw4B,EAAGnrB,QAAY3R,GAAK08B,EAAKh9B,SAAWM,GAA3D28B,GAAK,GAAkE,CAAE,MAAOK,GAAOJ,GAAK,EAAMC,EAAKG,CAAK,CAAE,QAAU,IAAWL,GAAsB,MAAhBI,EAAW,QAAWA,EAAW,QAAK,CAAE,QAAU,GAAIH,EAAI,MAAMC,CAAI,CAAE,CAAE,OAAOH,CAAM,CAJvV,CAAsB5oB,EAAK9T,IAE5F,WAA8B,MAAM,IAAIuZ,UAAU,uDAAyD,CAFT,EAAoB,CAUtH,SAASuqB,EAAkB/jC,EAAQa,GAAS,IAAK,IAAIZ,EAAI,EAAGA,EAAIY,EAAMlB,OAAQM,IAAK,CAAE,IAAI+jC,EAAanjC,EAAMZ,GAAI+jC,EAAW9H,WAAa8H,EAAW9H,aAAc,EAAO8H,EAAWzH,cAAe,EAAU,UAAWyH,IAAYA,EAAWxH,UAAW,GAAM18B,OAAOif,eAAe/e,EAAQgkC,EAAW7jC,IAAK6jC,EAAa,CAAE,CAI5T,SAAS,EAAgBx3B,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAMhN,IAAIw2B,EAAOD,EAAaC,KACpBP,EAAOM,EAAaN,KACpBQ,EAASF,EAAaE,OACtBC,EAAgBH,EAAaG,cAC7BC,EAAYJ,EAAaI,UAEzBc,EAAQ,OACRC,EAAiB,sBACjBC,GAA8C,EAAzBP,EAAqB,CAAC,EAAuCZ,EAAM,CAC1FzyB,QAAS,WACP,EAAgBqzB,EAAoBnB,EAAM,CAC5ClyB,QAAS,SACP,EAAgBqzB,EAAoBX,EAAQ,CAC9C1yB,QAAS,OACP,EAAgBqzB,EAAoBV,EAAe,CACrD3yB,QAAS,QACP,EAAgBqzB,EAAoBT,EAAW,CACjD5yB,QAAS,MACPqzB,GAGAQ,EAAsB,CAACpB,EAAMC,EAAQE,EAAWD,EAAeT,GAE/D4B,GAA0C,EAAvBR,EAAmB,CAAC,EAAqClB,EAAYC,KAAM,CAChG0B,IAAK,OACLC,KAAM,OACNC,IAAK,MACLxkC,OAAQ,SACRykC,MAAO,QACPxjC,UAAW,UACT,EAAgB4iC,EAAkBlB,EAAYE,MAAO,CACvD6B,IAAK,MACL9iC,OAAQ,SACRE,MAAO,QACP6iC,IAAK,MACL1jC,UAAW,UACT4iC,GAEAe,GAAoC,EAApBd,EAAgB,CAAC,EAAkCnB,EAAYC,MAAM,SAAUiC,EAAYC,GAK7G,IAJA,IAAIC,EAAUV,EAAgBhkC,eAAewkC,GAAcR,EAAgBQ,GAAc,CAAC,EACtFG,EAAOF,EAAOG,UACdC,EAAQ,CAAC,EAEJlI,EAAK,EAAGY,EAAe99B,OAAO6G,KAAKq+B,GAAOhI,EAAKY,EAAaj+B,OAAQq9B,IAAM,CACjF,IAAImI,EAAUvH,EAAaZ,GACvBoI,EAAYJ,EAAKG,GAErB,GAAIJ,EAAQ1kC,eAAe8kC,GAEzBD,EADcH,EAAQI,IACLC,OACRlB,EAAe5C,KAAK6D,KAC7BD,EAAMC,GAAWC,EAErB,CAEA,OAAOF,CACT,IAAI,EAAgBpB,EAAenB,EAAYE,OAAO,SAAUgC,EAAYC,GAK1E,IAJA,IAAIC,EAAUV,EAAgBhkC,eAAewkC,GAAcR,EAAgBQ,GAAc,CAAC,EACtFG,EAAOF,EAAOG,UACdC,EAAQ,CAAC,EAEJvH,EAAM,EAAG0H,EAAgBvlC,OAAO6G,KAAKq+B,GAAOrH,EAAM0H,EAAc1lC,OAAQg+B,IAAO,CACtF,IAAIwH,EAAUE,EAAc1H,GACxByH,EAAYJ,EAAKG,GAErB,GAAIJ,EAAQ1kC,eAAe8kC,GAEzBD,EADcH,EAAQI,IACLC,OACRlB,EAAe5C,KAAK6D,KAC7BD,EAAMC,GAAWC,EAErB,CAEA,OAAOF,CACT,IAAIpB,GAGJ,SAASwB,EAAQzgC,EAAW0gC,GAC1B,OAAQ1gC,GACN,KAAKg9B,EAAWE,WACd,MAAO,CAAC,MAEV,KAAKF,EAAWG,WACd,MAAO,CAAC,MAEV,KAAKH,EAAWI,aACd,MAAO,CAAC,MAEV,KAAKJ,EAAWK,YACd,MAAO,CAAC,MAEV,KAAKL,EAAWM,YACd,MAAO,CAAC,MAEV,KAAKN,EAAWO,WACd,MAAO,CAAC,MAEV,KAAKP,EAAWQ,oBAChB,KAAKR,EAAWS,kBACd,MAAO,CAAC,MAEV,KAAKT,EAAWU,WACd,MAAO,CAAC,cAEV,KAAKV,EAAWY,KACd,MAAO,CAAC,MAAO,QAEjB,KAAKZ,EAAWa,OACd,MAAO,CAAC,UAEV,QACE,OAAwB,OAApB6C,EACK,GAGF,CAACA,GAAmB,KAEjC,CAeA,IAAIC,EAEJ,WAGE,SAASA,EAAgBh7B,EAAci7B,IArJzC,SAAyBC,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAInsB,UAAU,oCAAwC,CAsJpJosB,CAAgBplC,KAAMglC,GAEtB,EAAgBhlC,KAAM,cAAU,GAEhC,EAAgBA,KAAM,oBAAgB,GAEtC,EAAgBA,KAAM,oBAAgB,GAEtC,EAAgBA,KAAM,mBAAe,GAErC,EAAgBA,KAAM,cAAU,GAEhC,EAAgBA,KAAM,mBAAe,GAErC,EAAgBA,KAAM,kBAAc,GAEpC,EAAgBA,KAAM,eAAW,GAEjC,EAAgBA,KAAM,oBAAgB,GAEtC,EAAgBA,KAAM,qBAAiB,GAEvC,EAAgBA,KAAM,kBAAc,GAErB,MAAXilC,IACFA,EAAU,CAAC,GAGbjlC,KAAKgK,aAAeA,EACpBhK,KAAKilC,QAAUA,EAEf,IACII,EAAyB,EADD,EAAqBJ,EAAQK,aAAc,CAAC3B,EAAmBC,IACxB,GAC/D0B,EAAeD,EAAuB,GACtCnI,EAAamI,EAAuB,GAExCrlC,KAAKslC,aAAeA,EACpBtlC,KAAKulC,cAAgBN,EAAQM,cAC7BvlC,KAAKk9B,WAAaA,CACpB,CAzLF,IAAsBiI,EAAaK,EAAYC,EA+iB7C,OA/iBoBN,EA2LPH,GA3LoBQ,EA2LH,CAAC,CAC7B7lC,IAAK,WACLyR,MAAO,WAQL,IAPApR,KAAK0lC,OAAS,GACd1lC,KAAK2lC,OAAS3lC,KAAKgK,aAAa47B,mBAChC5lC,KAAK6lC,YAAc7lC,KAAK2lC,OAAOxmC,OAC/Ba,KAAK8lC,aAAe,EACpB9lC,KAAK+lC,YAAc,EACnB/lC,KAAKgmC,WAAa,KAEXhmC,KAAK8lC,aAAe9lC,KAAK6lC,aAC9B7lC,KAAKimC,eAIP,OADAjmC,KAAKkmC,kBACElmC,KAAK0lC,OAAOv8B,KAAK,IAAIg9B,MAC9B,GACC,CACDxmC,IAAK,eACLyR,MAAO,WACL,IAAIg1B,EAAgBpmC,KAAKilC,QACrBoB,EAAiBD,EAAcC,eAC/BtB,EAAkBqB,EAAcrB,gBAChCx8B,EAAQvI,KAAK2lC,OAAO3lC,KAAK8lC,cACzBzhC,EAAYkE,EAAM/D,UAClB8hC,EArFV,SAAuBjiC,GACrB,OAAQA,GACN,KAAKg9B,EAAWQ,oBACd,MAAO,KAET,KAAKR,EAAWS,kBACd,MAAO,KAET,QACE,OAAO,KAEb,CA0E0ByE,CAAcliC,GAE9BrE,KAAKgmC,aAAeM,IAClBtmC,KAAKgmC,YACPhmC,KAAKkmC,kBAGHI,GACFtmC,KAAKwmC,eAAeF,IAIxBtmC,KAAKymC,SAEL,IAAIC,EAAmC,MAAlBL,GAA0BA,EAAexmC,eAAewE,GAAagiC,EAAehiC,GAAa,KAClHsiC,EAAuBD,EAAiBA,EAAen+B,GAAS,KAEpE,GAA4B,MAAxBo+B,EAIF,OAHA3mC,KAAK0lC,OAAO3hC,KAAK4iC,GACjB3mC,KAAK0lC,OAAO3hC,KAAK,WACjB/D,KAAK8lC,cAAgB,GAIvB9lC,KAAK4mC,cAAcr+B,EAAOw8B,GAC1B/kC,KAAK0lC,OAAO3hC,KAAK/D,KAAK6mC,mBAAmBt+B,IAEzC,IAAIu+B,EAAY9mC,KAAK+mC,eAErB,GAoVN,SAAsB1iC,GACpB,OAAQA,GACN,KAAKg9B,EAAWQ,oBAChB,KAAKR,EAAWS,kBACd,OAAO,EAET,QACE,OAAO,EAEb,CA7VUkF,CAAa3iC,IAAcyiC,GAAaA,EAAUG,aAAe1+B,EAAM0+B,WAAa,EAAG,CACzFjnC,KAAK0lC,OAAO3hC,KAAK,MAGjB,IAAImjC,EAAiBlnC,KAAKgmC,WAC1BhmC,KAAKgmC,WAAa,KAClBhmC,KAAK+lC,aAAe,EACpB/lC,KAAK8lC,cAAgB,EACrB9lC,KAAKmnC,qBAAqBL,EAAUG,YACpCjnC,KAAKgmC,WAAakB,EAClBlnC,KAAK+lC,aAAe,EACpB/lC,KAAKymC,QACP,MACEzmC,KAAK8lC,cAAgB,EAGvB9lC,KAAKonC,YAAY7+B,EAAOw8B,EAC1B,GACC,CACDplC,IAAK,uBACLyR,MAAO,SAA8Bmd,GAGnC,IAFA,IAAIhmB,EAAQvI,KAAK2lC,OAAO3lC,KAAK8lC,cAEtBv9B,GAASA,EAAM0+B,aAAe1Y,GACnCvuB,KAAKimC,eACL19B,EAAQvI,KAAK2lC,OAAO3lC,KAAK8lC,cAG3B9lC,KAAKkmC,iBACP,GACC,CACDvmC,IAAK,eACLyR,MAAO,WACL,OAAOpR,KAAK2lC,OAAO3lC,KAAK8lC,aAAe,EACzC,GACC,CACDnmC,IAAK,gBACLyR,MAAO,SAAuB7I,EAAOw8B,GACnC,IACIsC,EADAC,EAAOxC,EAAQv8B,EAAM/D,UAAWugC,GAGpC,GAAI/kC,KAAKilC,QAAQh8B,aAAc,CAC7B,IAAI/I,EAAOF,KAAKilC,QAAQh8B,aAAaV,IAAU,CAAC,EAC5Co1B,EAAaz9B,EAAKy9B,WAClB4J,EAASrnC,EAAKiC,MAKlB,GAFAw7B,EAAa,EAAoBA,GAEnB,MAAV4J,EAAgB,CAClB,IAAIC,EAAY,EAAWD,GAC3B5J,EAA2B,MAAdA,EAAqB,CAChCx7B,MAAOqlC,GACL,EAAc,CAAC,EAAG7J,EAAY,CAChCx7B,MAAOqlC,GAEX,CAEAH,EAAaI,EAAe9J,EAC9B,MACE0J,EAAa,GAGf,IAAIK,GAA4B,EAC5BC,GAAoB,EACpBC,OAAiBl/B,EAErB,IACE,IAAK,IAAyCoT,EAArClD,EAAY0uB,EAAKtyB,OAAOC,cAAsByyB,GAA6B5rB,EAAQlD,EAAU1J,QAAQuG,MAAOiyB,GAA4B,EAAM,CACrJ,IAAIG,EAAM/rB,EAAM1K,MAChBpR,KAAK0lC,OAAO3hC,KAAK,IAAIkE,OAAO4/B,GAAK5/B,OAAOo/B,EAAY,KACtD,CACF,CAAE,MAAO5K,GACPkL,GAAoB,EACpBC,EAAiBnL,CACnB,CAAE,QACA,IACOiL,GAAoD,MAAvB9uB,EAAkB,QAClDA,EAAkB,QAEtB,CAAE,QACA,GAAI+uB,EACF,MAAMC,CAEV,CACF,CACF,GACC,CACDjoC,IAAK,cACLyR,MAAO,SAAqB7I,EAAOw8B,GACjC,IAAIuC,EAAOxC,EAAQv8B,EAAM/D,UAAWugC,GAEpC,GAAoB,IAAhBuC,EAAKnoC,OACPa,KAAK0lC,OAAO3hC,KAAK,KAAKkE,OAAOq/B,EAAK,GAAI,YACjC,CACL,IAAI5B,EAAS,GACToC,GAA6B,EAC7BC,GAAqB,EACrBC,OAAkBt/B,EAEtB,IACE,IAAK,IAA0Cu/B,EAAtCC,EAAaZ,EAAKtyB,OAAOC,cAAuB6yB,GAA8BG,EAASC,EAAWh5B,QAAQuG,MAAOqyB,GAA6B,EAAM,CAC3J,IAAID,EAAMI,EAAO72B,MACjBs0B,EAAO9d,QAAQ,KAAK3f,OAAO4/B,EAAK,KAClC,CACF,CAAE,MAAOpL,GACPsL,GAAqB,EACrBC,EAAkBvL,CACpB,CAAE,QACA,IACOqL,GAAsD,MAAxBI,EAAmB,QACpDA,EAAmB,QAEvB,CAAE,QACA,GAAIH,EACF,MAAMC,CAEV,CACF,CAEAhoC,KAAK0lC,OAAO3hC,KAAK2hC,EAAOv8B,KAAK,IAAM,KACrC,CACF,GACC,CACDxJ,IAAK,iBACLyR,MAAO,SAAwB40B,GAC7BhmC,KAAKgmC,WAAaA,EAClBhmC,KAAKymC,SACLzmC,KAAK0lC,OAAO3hC,KAAK,IAAIkE,OAAO+9B,EAAY,QACxChmC,KAAK+lC,aAAe,CACtB,GACC,CACDpmC,IAAK,kBACLyR,MAAO,WACL,IAAI40B,EAAahmC,KAAKgmC,WAElBA,IACFhmC,KAAK+lC,aAAe,EACpB/lC,KAAKymC,SACLzmC,KAAK0lC,OAAO3hC,KAAK,KAAKkE,OAAO+9B,EAAY,QACzChmC,KAAKgmC,WAAa,KAEtB,GACC,CACDrmC,IAAK,SACLyR,MAAO,WACLpR,KAAK0lC,OAAO3hC,KAtXL,KAsXiBokC,OAAOnoC,KAAK+lC,aACtC,GACC,CACDpmC,IAAK,yBACLyR,MAAO,SAAgCzN,EAASykC,GAC9C,IAAKpoC,KAAKulC,cACR,OAAO5hC,EAGT,IAAI0kC,EAAeroC,KAAKulC,cAAc6C,GAEtC,IAAKC,EACH,OAAO1kC,EAGT,IAAI2kC,EAAwBD,EAAat4B,QACrCA,OAAoC,IAA1Bu4B,EAAmC,OAASA,EACtD3K,EAAa0K,EAAa1K,WAC1Bx7B,EAAQkmC,EAAalmC,MACrBklC,EAAaI,EAAe,EAAc,CAAC,EAAG9J,EAAY,CAC5Dx7B,MAAOA,GAAS,EAAWA,MAE7B,MAAO,IAAI8F,OAAO8H,GAAS9H,OAAOo/B,EAAY,KAAKp/B,OAAOtE,EAAS,MAAMsE,OAAO8H,EAAS,IAC3F,GACC,CACDpQ,IAAK,qBACLyR,MAAO,SAA4B7I,GACjC,IAAImE,EAAQ1M,KAERqE,EAAYkE,EAAM/D,UAClB6L,EAAO9H,EAAM2B,UAEjB,GAAa,KAATmG,EAEF,OAAOozB,EAIT,IACI8E,ED1bK,SAAyBl4B,EAAMwyB,GAM5C,IALA,IAAI2F,EAAa,KACbC,EAAiB,KACjBzF,EAAS,GACTC,EAAa,EAERxjC,EAAI,EAAG+T,EAAMnD,EAAKlR,OAAQM,EAAI+T,EAAK/T,IAAK,CAC/CgpC,EAAiBD,EACjB,IAAItF,EAAOL,EAAah4B,IAAIpL,GAC5B+oC,EAAatF,EAAOA,EAAKwF,YAAc,KAEnCjpC,EAAI,GAAK+oC,IAAeC,IAC1BzF,EAAOj/B,KAAK,CAAC0kC,EAAgB7F,EAAevyB,EAAKvF,MAAMm4B,EAAYxjC,GAAIojC,EAAa/3B,MAAMm4B,EAAYxjC,MACtGwjC,EAAaxjC,EAEjB,CAGA,OADAujC,EAAOj/B,KAAK,CAACykC,EAAY5F,EAAevyB,EAAKvF,MAAMm4B,GAAaJ,EAAa/3B,MAAMm4B,MAC5ED,CACT,CCuayB2F,CAFnBt4B,EAAOrQ,KAAK4oC,mBAAmBv4B,GACZ9H,EAAMsgC,oBAEzB,OAAON,EAAa/8B,KAAI,SAAUs9B,GAChC,IAqEIC,EArEAC,EAAQ,EAAeF,EAAO,GAC9BG,EAAYD,EAAM,GAGlBrlC,EAFcqlC,EAAM,GAEEx9B,KAAI,SAAU09B,GACtC,IAAIC,EAAQ,EAAeD,EAAO,GAC9B74B,EAAO84B,EAAM,GACbf,EAAWe,EAAM,GAEjBxlC,EA2Jd,SAAuB0M,GACrB,OAAOA,EAAK3F,MAAM,KAAKvB,KAAK,SAASuB,MAAM,KAAKvB,KAAK,QAAQuB,MAAM,KAAKvB,KAAK,QAAQuB,MAAM,QAAQvB,KAAK,UAAUuB,MAAM,MAAMvB,KAAKs6B,EAAQ,KAC7I,CA7JwB2F,CAAc/4B,GACxBg5B,GAA6B,EAC7BC,GAAqB,EACrBC,OAAkB7gC,EAEtB,IACE,IAAK,IAAsD8gC,EAAlDC,EAAa/8B,EAAMwwB,WAAWloB,OAAOC,cAAuBo0B,GAA8BG,EAASC,EAAWv6B,QAAQuG,MAAO4zB,GAA6B,EAAM,CACvK,IAAIhM,EAAamM,EAAOp4B,MAGxB,IAAIisB,IAAe4E,GAAQ59B,IAAcg9B,EAAWY,OAIhDmG,EAASpmC,IAAIq7B,GAAa,CAC5B,IAAIqM,EAAwBh9B,EAAM44B,aAAajI,GAC3CttB,EAAU25B,EAAsB35B,QAChC4tB,EAAa+L,EAAsB/L,WACnCgM,EAAUD,EAAsBvnC,MASpC,GAPe,MAAX4N,IACFA,EAAU,QAIZ4tB,EAAa,EAAoBA,GAElB,MAAXgM,EAAiB,CACnB,IAAInC,EAAY,EAAWmC,GAC3BhM,EAA2B,MAAdA,EAAqB,CAChCx7B,MAAOqlC,GACL,EAAc,CAAC,EAAG7J,EAAY,CAChCx7B,MAAOqlC,GAEX,CAEA,IAAIH,EAAaI,EAAe9J,GAChCh6B,EAAU,IAAIsE,OAAO8H,GAAS9H,OAAOo/B,EAAY,KAAKp/B,OAAOtE,EAAS,MAAMsE,OAAO8H,EAAS,IAC9F,CACF,CACF,CAAE,MAAO0sB,GACP6M,GAAqB,EACrBC,EAAkB9M,CACpB,CAAE,QACA,IACO4M,GAAsD,MAAxBI,EAAmB,QACpDA,EAAmB,QAEvB,CAAE,QACA,GAAIH,EACF,MAAMC,CAEV,CACF,CAEA,OAAO78B,EAAMk9B,uBAAuBjmC,EAASykC,EAC/C,IAAGj/B,KAAK,IACJm7B,EAAS2E,EAAYv8B,EAAM1C,aAAa0+B,UAAUO,GAAa,KAE/D5E,EAAuB,MAAVC,EAAiB,KAAOA,EAAO9/B,UAAUqlC,cAG1D,GAAc,MAAVvF,GAAkB53B,EAAMu4B,QAAQ6E,gBAAkBf,EAAcr8B,EAAMu4B,QAAQ6E,cAAcxF,IAAU,CACxG,IAAIyF,EAAehB,EACfh5B,EAAUg6B,EAAah6B,QACvB4tB,EAAaoM,EAAapM,WAC1BqM,EAAUD,EAAa5nC,MAS3B,GAPe,MAAX4N,IACFA,EAAU,QAIZ4tB,EAAa,EAAoBA,GAElB,MAAXqM,EAAiB,CACnB,IAAIxC,EAAY,EAAWwC,GAC3BrM,EAA2B,MAAdA,EAAqB,CAChCx7B,MAAOqlC,GACL,EAAc,CAAC,EAAG7J,EAAY,CAChCx7B,MAAOqlC,GAEX,CAEA,IAAIH,EAAaI,EAAe9J,GAChC,MAAO,IAAI11B,OAAO8H,GAAS9H,OAAOo/B,EAAY,KAAKp/B,OAAOtE,EAAS,MAAMsE,OAAO8H,EAAS,IAC3F,CAAO,GAAkB,MAAds0B,GAAsBA,IAAelC,EAAYC,KAAM,CAChE,IAEI6H,EAAcxC,EAFNrD,EAAavkC,eAAewkC,GAAcD,EAAaC,GAAYA,EAAYC,GAAU,MAIrG,MAAO,KAAKr8B,OAAOgiC,EAAa,KAAKhiC,OAAOtE,EAAS,OACvD,CAAO,GAAkB,MAAd0gC,GAAsBA,IAAelC,EAAYE,MAAO,CACjE,IAEI6H,EAAezC,EAFNrD,EAAavkC,eAAewkC,GAAcD,EAAaC,GAAYA,EAAYC,GAAU,MAItG,MAAO,OAAOr8B,OAAOiiC,EAAc,KACrC,CACE,OAAOvmC,CAEX,IAAGwF,KAAK,GACV,GACC,CACDxJ,IAAK,qBACLyR,MAAO,SAA4Bf,GAKjC,IAJA,IAAIlR,EAASkR,EAAKlR,OAEdgrC,EAAU,IAAIlrC,MAAME,GAEfM,EAAI,EAAGA,EAAIN,EAAQM,IACV,MAAZ4Q,EAAK5Q,IAAqB,IAANA,GAAWA,IAAMN,EAAS,GAAqB,MAAhBkR,EAAK5Q,EAAI,GAG9D0qC,EAAQ1qC,GAAK4Q,EAAK5Q,GAFlB0qC,EAAQ1qC,GAAK,OAMjB,OAAO0qC,EAAQhhC,KAAK,GACtB,MA5iB0Eo6B,EAAkB4B,EAAYvlC,UAAW4lC,GAAiBC,GAAalC,EAAkB4B,EAAaM,GA+iB3KT,CACT,CAlaA,GAoaA,SAASyC,EAAe/C,GACtB,GAAa,MAATA,EACF,MAAO,GAKT,IAFA,IAAIj6B,EAAQ,GAEH2/B,EAAM,EAAGC,EAAgB/qC,OAAO6G,KAAKu+B,GAAQ0F,EAAMC,EAAclrC,OAAQirC,IAAO,CACvF,IAAIpa,EAAOqa,EAAcD,GACrBh5B,EAAQszB,EAAM1U,GAEL,MAAT5e,GACF3G,EAAM1G,KAAK,IAAIkE,OAAO+nB,EAAM,MAAO/nB,QAAkBmJ,EAAQ,IAuBrD1G,MAAM,KAAKvB,KAAK,SAASuB,MAAM,KAAKvB,KAAK,QAAQuB,MAAM,KAAKvB,KAAK,QAAQuB,MAAM,KAAKvB,KAAK,UAvB/B,KAEtE,CAEA,OAAOsB,EAAMtB,KAAK,GACpB,CAqBe,SAASmhC,EAAY3mC,EAASshC,GAC3C,OAAO,IAAID,EAAgBrhC,EAASshC,GAASsF,UAC/C,C,qCChmBA,SAAS5O,EAAcn8B,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAO67B,EAAUh8B,OAAO6G,KAAKzG,GAAqD,oBAAjCJ,OAAOq0B,wBAAwC2H,EAAUA,EAAQrzB,OAAO3I,OAAOq0B,sBAAsBj0B,GAAQwC,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyB/7B,EAAQ87B,GAAKE,UAAY,MAAOJ,EAAQj0B,SAAQ,SAAU1H,GAAOi8B,EAAgBp8B,EAAQG,EAAKD,EAAOC,GAAO,GAAI,CAAE,OAAOH,CAAQ,CAEhe,SAASo8B,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAEhN,IAAIw+B,EAAkB,EAAQ,OAE1BC,EAAoB,EAAQ,OAE5BC,EAAe,EAAQ,OAEvBC,EAAmB,EAAQ,OAE3BC,EAAgB,EAAQ,OAExB9mC,EAAc,EAAQ,OAEtB+mC,EAAoB,EAAQ,MAE5BC,EAAM,EAAQ,OAEdC,EAAY,EAAQ,OAEpBC,EAA0B,EAAQ,OAElCC,EAA8BH,EAAI,2BAClCI,EAAqBD,EAA8BN,EAAmBD,EACtEv/B,EAAO4/B,EAAU5/B,KACjB6P,EAAS+vB,EAAU/vB,OACnBmwB,EAAmB,CACrBC,kBAAmB,SAA2B9mC,EAAa2kC,EAAWoC,GACpE,IAAIrhC,EAAe1F,EAAYhC,oBAC3BgpC,EAAiBhnC,EAAY9B,eAC7B+oC,EAAeX,EAAcY,YAAYxhC,EAAcshC,EAAgB,YACvEG,EAAkBF,EAAaG,oBAC/BC,EAAaf,EAAcgB,WAAWL,EAAcE,GACpDI,EAAkBF,EAAWD,oBAC7BI,EAAgBlB,EAAcmB,aAAaJ,EAAYE,EAAiB,UACxEG,EAAWvB,EAAkBh8B,OAAO,CACtC61B,OAAQ2E,IAENgD,EAAoB,CACtBtsC,IAAKkrC,IACL3pC,KAAM,SACNmP,KAAMg7B,EACNa,cAAe/gC,EAAK6P,EAAOgxB,EAAUX,EAAUlsC,UAE7CgtC,EAA2B,CAC7BxsC,IAAKkrC,IACL3pC,KAAM,YAGJ+pC,IACFgB,EAAoBtQ,EAAc,CAAC,EAAGsQ,EAAmB,CACvDG,YAAaD,EAAyBxsC,MAExCwsC,EAA2BxQ,EAAc,CAAC,EAAGwQ,EAA0B,CACrEE,YAAaJ,EAAkBtsC,OAInC,IAAI2sC,EAAgB,CAAC,IAAIpB,EAAmBe,GAAoB,IAAIf,EAAmBiB,IACnFI,EAAW/B,EAAgBgC,gBAAgBF,GAC3CG,EAAkB7B,EAAc8B,oBAAoBZ,EAAeD,EAAiBU,GACpFI,EAAaF,EAAgBppC,MAAM,CACrCupC,gBAAiBtB,EACjBuB,eAAgBJ,EAAgBf,oBAAoB58B,IAAI,YAAY,KAEtE,OAAOhL,EAAYC,KAAKO,EAAaqoC,EAAY,kBACnD,EACAG,gBAAiB,SAAyBxoC,EAAayoC,EAAaC,EAAaC,GAC/E,IAEIC,EAFAljC,EAAe1F,EAAYhC,oBAC3BgpC,EAAiBhnC,EAAY9B,eAGjC,GAAsB,WAAlByqC,GAAgD,UAAlBA,EAA2B,CAC3D,IAAIE,EAAcnjC,EAAatH,eAAiC,WAAlBuqC,EAA6BD,EAAYzoC,cAAgByoC,EAAYI,aACnHF,EAAuBlC,EAAwBhhC,EAAc+iC,EAAaI,EAAaF,EACzF,KAAO,CACL,IAAI1B,EAAeX,EAAcY,YAAYxhC,EAAcgjC,EAAa,YACpEK,EAAwB9B,EAAaG,oBAErC4B,EAAe/B,EAAa7oC,eAAe2qC,EAAsB1qC,eAErE,GAA+C,IAA3C0qC,EAAsBE,iBACxBL,EAAuBlC,EAAwBO,EAAcwB,EAAaO,EAAc,eACnF,GAAID,EAAsBG,iBAAmBF,EAAanqC,YAC/D+pC,EAAuBlC,EAAwBO,EAAcwB,EAAaO,EAAc,aACnF,CACL,IAAI3B,EAAaf,EAAcgB,WAAWL,EAAc8B,GACpDI,EAAsB9B,EAAWD,oBAEjCgC,EAAgB/B,EAAWjpC,eAAe+qC,EAAoB9qC,eAElEuqC,EAAuBlC,EAAwBW,EAAYoB,EAAaW,EAAe,SACzF,CACF,CAEA,IAAIf,EAAaO,EAAqB7pC,MAAM,CAC1CupC,gBAAiBtB,EACjBuB,eAAgBK,EAAqBxB,oBAAoB58B,IAAI,YAAY,KAE3E,OAAOhL,EAAYC,KAAKO,EAAaqoC,EAAY,aACnD,GAEF77B,EAAOC,QAAUo6B,C,qCCxGjB,IAEIpqB,EAFY,EAAQ,OAEGA,WACvBypB,EAAkB,CACpBgC,gBAAiB,SAAyB7G,GACxC,OAAO5kB,EAAW4kB,EAAOn6B,KAAI,SAAUjD,GACrC,MAAO,CAACA,EAAMolC,SAAUplC,EAC1B,IACF,GAEFuI,EAAOC,QAAUy5B,C,qCCRjB,SAAS5O,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAIhN,IAAI4hC,EAAsB,EAAQ,OAE9BC,EAAqB,EAAQ,KAE7B9C,EAAY,EAAQ,OAEpB5/B,EAAO4/B,EAAU5/B,KACjB6P,EAAS+vB,EAAU/vB,OACnB8U,EAASib,EAAUjb,OAEnB9b,EAAa,WACf,OAAO,CACT,EAMI85B,EAAYhe,EAJO,CACrBrU,MAAO,KACPnH,IAAK,OASHy5B,EAAiBje,EANO,CAC1BrU,MAAO,KACPnH,IAAK,KACL05B,aAAc,KACdC,OAAQ,OAGNC,EAAY,CAId3D,SAAU,SAAkBvgC,EAAczB,EAAO4B,GAC/C,IAAIgkC,EAAa5lC,EAAMpF,YAEvB,IAAKgrC,EACH,OAAOhjC,EAAKgM,GAAG,IAAI42B,EAAe,CAChCtyB,MAAO,EACPnH,IAAK,EACL05B,aAAc,KACdC,OAAQ9iC,EAAKgM,GAAG,IAAI22B,EAAU,CAC5BryB,MAAO,EACPnH,IAAK,QAKX,IAAI85B,EAAW,GACXnkC,EAAcE,EAAYA,EAAUJ,eAAexB,EAAOyB,GAAgBmB,EAAK6P,EAAO,KAAMmzB,IAC5FE,EAAQ9lC,EAAMsgC,mBASlB,OARA+E,EAAoB3jC,EAAaqkC,EAAUt6B,GAAY,SAAUyH,EAAOnH,GACtE85B,EAASrqC,KAAK,IAAIgqC,EAAe,CAC/BtyB,MAAOA,EACPnH,IAAKA,EACL05B,aAAc/jC,EAAYY,IAAI4Q,GAC9BwyB,OAAQM,EAAeF,EAAMvjC,MAAM2Q,EAAOnH,GAAKwF,SAAU2B,KAE7D,IACOtQ,EAAKijC,EACd,EACA70B,OAAQ,SAAgBrZ,GACtB,IAAI+tC,EAAS/tC,EAAK+tC,OACdtxB,EA9DR,SAAuCjd,EAAQuG,GAAY,GAAc,MAAVvG,EAAgB,MAAO,CAAC,EAAG,IAA2DC,EAAKF,EAA5DD,EAAS,CAAC,EAAO0G,EAAa5G,OAAO6G,KAAKzG,GAAqB,IAAKD,EAAI,EAAGA,EAAIyG,EAAW/G,OAAQM,IAAOE,EAAMuG,EAAWzG,GAAQwG,EAASG,QAAQzG,IAAQ,IAAaH,EAAOG,GAAOD,EAAOC,IAAQ,OAAOH,CAAQ,CA8DlSwG,CAA8B9F,EAAM,CAAC,WAEjD,OAAO,IAAI6tC,EApEf,SAAuBvuC,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAO67B,EAAUh8B,OAAO6G,KAAKzG,GAAqD,oBAAjCJ,OAAOq0B,wBAAwC2H,EAAUA,EAAQrzB,OAAO3I,OAAOq0B,sBAAsBj0B,GAAQwC,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyB/7B,EAAQ87B,GAAKE,UAAY,MAAOJ,EAAQj0B,SAAQ,SAAU1H,GAAOi8B,EAAgBp8B,EAAQG,EAAKD,EAAOC,GAAO,GAAI,CAAE,OAAOH,CAAQ,CAoElcm8B,CAAc,CAAC,EAAGhf,EAAO,CACjDsxB,OAAkB,MAAVA,EAAiB9iC,EAAKlM,MAAMC,QAAQ+uC,GAAUA,EAASJ,EAAmBI,IAASziC,KAAI,SAAUgjC,GACvG,OAAOV,EAAUU,EACnB,IAAK,OAET,GAMF,SAASD,EAAeE,EAAYrkC,GAClC,IAAI6jC,EAAS,GACT3I,EAAemJ,EAAWjjC,KAAI,SAAUwR,GAC1C,OAAOA,EAAEmmB,UACX,IAAGrpB,SAOH,OANA8zB,EAAoBtI,EAAcgJ,EAAUt6B,GAAY,SAAUyH,EAAOnH,GACvE25B,EAAOlqC,KAAK,IAAI+pC,EAAU,CACxBryB,MAAOA,EAAQrR,EACfkK,IAAKA,EAAMlK,IAEf,IACOe,EAAK8iC,EACd,CAEA,SAASK,EAASh0B,EAAGC,GACnB,OAAOD,IAAMC,CACf,CAEAzJ,EAAOC,QAAUm9B,C,qCC/FjB,IAAIQ,EAAW,EAAQ,OACnB3gC,EAAM2gC,EAAS3gC,IACfgkB,EAAa2c,EAAS3c,WACtBjC,EAAS4e,EAAS5e,OAIlBmC,EAAYF,IACZ4c,EAAgB,CAClBxsC,MAAO8vB,EACPqS,OAAQ,MAINmG,EAAiC,SAAUmE,GAhB/C,IAAwBriC,EAAUC,EAmBhC,SAASi+B,IACP,OAAOmE,EAAsB7uC,MAAMC,KAAMZ,YAAcY,IACzD,CArBgCwM,EAiBEoiC,GAjBZriC,EAiBPk+B,GAjBwC7qC,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EAuBxK,IAAI1C,EAAS2gC,EAAkB7qC,UAmE/B,OAjEAkK,EAAOq5B,SAAW,WAChB,OAAOnjC,KAAK6K,IAAI,QAClB,EAEAf,EAAO4+B,UAAY,WACjB,OAAO1oC,KAAK6K,IAAI,SAClB,EAEAf,EAAO+kC,SAAW,SAAkB1sC,GAClC,OAAOnC,KAAKmjC,WAAW5mB,SAASpa,EAClC,EAEAsoC,EAAkBqE,WAAa,SAAoB/d,EAAQ5uB,GACzD,IAAI4sC,EAAYhe,EAAOjiB,IAAI,QAASiiB,EAAOoS,WAAW37B,IAAIrF,IAC1D,OAAOsoC,EAAkBh8B,OAAOsgC,EAClC,EAEAtE,EAAkBuE,YAAc,SAAqBje,EAAQ5uB,GAC3D,IAAI8sC,EAAele,EAAOjiB,IAAI,QAASiiB,EAAOoS,WAAW3jB,OAAOrd,IAChE,OAAOsoC,EAAkBh8B,OAAOwgC,EAClC,EAEAxE,EAAkByE,YAAc,SAAqBne,EAAQkY,GAC3D,IAAIkG,EAAape,EAAO2X,cAAgBO,EAAYlY,EAASA,EAAOjiB,IAAI,SAAUm6B,GAClF,OAAOwB,EAAkBh8B,OAAO0gC,EAClC,EASA1E,EAAkBh8B,OAAS,SAAgB0rB,GACzC,IAAKA,EACH,OAAOiV,EAGT,IAKIC,EAAYthC,EALI,CAClB5L,MAAO8vB,EACPqS,OAAQ,OAGyBjhC,MAAM82B,GACrC9V,EAAWirB,EAAKzkC,IAAIwkC,GAExB,GAAIhrB,EACF,OAAOA,EAGT,IAAIkrB,EAAe,IAAI9E,EAAkB4E,GAEzC,OADAC,EAAOA,EAAKxgC,IAAIugC,EAAWE,GACpBA,CACT,EAEA9E,EAAkBlxB,OAAS,SAAgBrZ,GACzC,IAAIiC,EAAQjC,EAAKiC,MACbmiC,EAASpkC,EAAKokC,OAClB,OAAO,IAAImG,EAAkB,CAC3BtoC,MAAOlD,MAAMC,QAAQiD,GAAS4vB,EAAW5vB,GAASA,EAClDmiC,OAAQrlC,MAAMC,QAAQolC,GAAUvS,EAAWuS,GAAUA,GAEzD,EAEOmG,CACT,CA3EqC,CAFP3a,EAAO6e,IA+EjCS,EAAQ,IAAI3E,EACZ6E,EAAOvhC,EAAI,CAAC,CAACA,EAAI4gC,GAAgBS,KACrC3E,EAAkB2E,MAAQA,EAC1Bt+B,EAAOC,QAAU05B,C,qCC9FjB,IAEIt/B,EAFY,EAAQ,OAEHA,KAsBjBqkC,EAAuC,WACzC,SAASA,EAAwB3lC,GA3BnC,IAAyBmC,EAAKrM,EAAKyR,SA4BM,GA5BXzR,EA4BJ,iBA5BDqM,EA4BLhM,MA5B0CV,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAiCvLpR,KAAKoM,YAAcvC,EAAWiB,OAChC,CAEA,IAAIhB,EAAS0lC,EAAwB5vC,UA2CrC,OAzCAkK,EAAOC,eAAiB,SAAwBxB,EAAOyB,GACrD,IAAIC,EAAchL,MAAMsJ,EAAM2B,UAAU/K,QAAQsC,KAAK,MA2BrD,OAzBAzB,KAAKoM,YAAY/E,SAAQ,SAEzB8C,EAEAyJ,GACE,IAAI67B,EAAU,GAiBdC,EAhBevlC,EAAUulC,UAgBhBnnC,GAdM,SAEfkT,EAEAnH,IAkCN,SAAwBrK,EAAawR,EAAOnH,GAC1C,IAAK,IAAIV,EAAK6H,EAAO7H,EAAKU,EAAKV,IAC7B,GAAuB,MAAnB3J,EAAY2J,GACd,OAAO,EAIX,OAAO,CACT,EAtCY+7B,CAAe1lC,EAAawR,EAAOnH,MA6C/C,SAAqBs7B,EAAWn0B,EAAOnH,EAAKu7B,GAC1C,IAAK,IAAIj8B,EAAK6H,EAAO7H,EAAKU,EAAKV,IAC7Bg8B,EAAUh8B,GAAMi8B,CAEpB,CAhDUC,CAAY7lC,EAAawR,EAAOnH,EAAKV,EArD/B,IAqDgD67B,GACtDA,IAEJ,GAE0BzlC,EAC5B,IAEOmB,EAAKlB,EACd,EAEAH,EAAOO,mBAAqB,SAA4B1K,GACtD,IAAIkwC,EAAeE,SAASpwC,EAAI+K,MAjEpB,KAiEqC,GAAI,IACrD,OAAO1K,KAAKoM,YAAYyjC,GAAc9mC,SACxC,EAEAe,EAAOU,eAAiB,SAAwB7K,GAC9C,IAAIkwC,EAAeE,SAASpwC,EAAI+K,MAtEpB,KAsEqC,GAAI,IACrD,OAAO1K,KAAKoM,YAAYyjC,GAAcxvC,KACxC,EAEOmvC,CACT,CAtD2C,GAkF3C1+B,EAAOC,QAAUy+B,C,qCC1GjB,IAAI/E,EAAoB,EAAQ,OAE5BmD,EAAsB,EAAQ,OAE9B7C,EAAY,EAAQ,OAEpB5/B,EAAO4/B,EAAU5/B,KACjB4C,EAAMg9B,EAAUh9B,IAChBgkB,EAAagZ,EAAUhZ,WACvBjC,EAASib,EAAUjb,OACnB9U,EAAS+vB,EAAU/vB,OACnBiX,EAAYF,IASZmZ,EAAqBpb,EARL,CAClBnwB,IAAK,GACLuB,KAAM,WACNmP,KAAM,GACN67B,cAAe/gC,IACfojB,MAAO,EACPiW,KAAMz2B,MAmBJ28B,EAA4B,SAAUsF,GAvC1C,IAAwBzjC,EAAUC,EA0ChC,SAASk+B,EAAavQ,GACpB,OAAO6V,EAAoBlwC,KAAKE,KAnBR,SAA+Bm6B,GACzD,IAAKA,EACH,OAAOA,EAGT,IAAI+R,EAAgB/R,EAAO+R,cACvB77B,EAAO8pB,EAAO9pB,KAMlB,OAJIA,IAAS67B,IACX/R,EAAO+R,cAAgB/gC,EAAK6P,EAAOyvB,EAAkB2E,MAAO/+B,EAAKlR,UAG5Dg7B,CACT,CAM0C8V,CAAsB9V,KAAYn6B,IAC1E,CA5CgCwM,EAwCHwjC,GAxCPzjC,EAwCPm+B,GAxCwC9qC,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EA8CxK,IAAI1C,EAAS4gC,EAAa9qC,UAwD1B,OAtDAkK,EAAO6jC,OAAS,WACd,OAAO3tC,KAAK6K,IAAI,MAClB,EAEAf,EAAOtF,QAAU,WACf,OAAOxE,KAAK6K,IAAI,OAClB,EAEAf,EAAOI,QAAU,WACf,OAAOlK,KAAK6K,IAAI,OAClB,EAEAf,EAAO++B,iBAAmB,WACxB,OAAO7oC,KAAK6K,IAAI,gBAClB,EAEAf,EAAO3G,UAAY,WACjB,OAAOnD,KAAKkK,UAAU/K,MACxB,EAEA2K,EAAOm9B,SAAW,WAChB,OAAOjnC,KAAK6K,IAAI,QAClB,EAEAf,EAAO26B,QAAU,WACf,OAAOzkC,KAAK6K,IAAI,OAClB,EAEAf,EAAOomC,iBAAmB,SAA0B9lC,GAClD,IAAIihC,EAAYrrC,KAAK6oC,mBAAmBh+B,IAAIT,GAC5C,OAAOihC,EAAYA,EAAUlI,WAAalR,CAC5C,EAEAnoB,EAAOqmC,YAAc,SAAqB/lC,GACxC,IAAIihC,EAAYrrC,KAAK6oC,mBAAmBh+B,IAAIT,GAC5C,OAAOihC,EAAYA,EAAU3C,YAAc,IAC7C,EAMA5+B,EAAOsmC,gBAAkB,SAAyBC,EAAU9V,GAC1DqT,EAAoB5tC,KAAK6oC,mBAAoByH,EAAgBD,EAAU9V,EACzE,EAMAzwB,EAAOymC,iBAAmB,SAA0BF,EAAU9V,GAC5DqT,EAAoB5tC,KAAK6oC,mBAAoB2H,EAAiBH,EAAU9V,EAC1E,EAEOmQ,CACT,CAhEgC,CAgE9BQ,GAEF,SAASoF,EAAeG,EAAOC,GAC7B,OAAOD,EAAMtN,aAAeuN,EAAMvN,UACpC,CAEA,SAASqN,EAAgBC,EAAOC,GAC9B,OAAOD,EAAM/H,cAAgBgI,EAAMhI,WACrC,CAEA53B,EAAOC,QAAU25B,C,qCCzGjB,IAAID,EAAoB,EAAQ,OAE5BmD,EAAsB,EAAQ,OAE9B7C,EAAY,EAAQ,OAEpB5/B,EAAO4/B,EAAU5/B,KACjB4C,EAAMg9B,EAAUh9B,IAChBgkB,EAAagZ,EAAUhZ,WACvBjC,EAASib,EAAUjb,OACnB9U,EAAS+vB,EAAU/vB,OACnBiX,EAAYF,IACZ4c,EAAgB,CAClBgC,OAAQ,KACRzE,cAAe/gC,IACfq5B,KAAMz2B,IACNwgB,MAAO,EACP5uB,IAAK,GACL0Q,KAAM,GACNnP,KAAM,WACNd,SAAU+K,IACVkhC,YAAa,KACbD,YAAa,MAGXkE,EAAiB,SAAwBG,EAAOC,GAClD,OAAOD,EAAMtN,aAAeuN,EAAMvN,UACpC,EAEIqN,EAAkB,SAAyBC,EAAOC,GACpD,OAAOD,EAAM/H,cAAgBgI,EAAMhI,WACrC,EAiBIiC,EAAgC,SAAUzqC,GAlD9C,IAAwBqM,EAAUC,EAqDhC,SAASm+B,IACP,IAAItqC,EAAQjB,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAKuvC,EAGhF,OAAOzuC,EAAKJ,KAAKE,KAtBO,SAA+Bm6B,GACzD,IAAKA,EACH,OAAOA,EAGT,IAAI+R,EAAgB/R,EAAO+R,cACvB77B,EAAO8pB,EAAO9pB,KAMlB,OAJIA,IAAS67B,IACX/R,EAAO+R,cAAgB/gC,EAAK6P,EAAOyvB,EAAkB2E,MAAO/+B,EAAKlR,UAG5Dg7B,CACT,CAS2B8V,CAAsB5vC,KAAWL,IAC1D,CA1DgCwM,EAmDCtM,GAnDXqM,EAmDPo+B,GAnDwC/qC,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EA4DxK,IAAI1C,EAAS6gC,EAAiB/qC,UAgE9B,OA9DAkK,EAAO6jC,OAAS,WACd,OAAO3tC,KAAK6K,IAAI,MAClB,EAEAf,EAAOtF,QAAU,WACf,OAAOxE,KAAK6K,IAAI,OAClB,EAEAf,EAAOI,QAAU,WACf,OAAOlK,KAAK6K,IAAI,OAClB,EAEAf,EAAO++B,iBAAmB,WACxB,OAAO7oC,KAAK6K,IAAI,gBAClB,EAEAf,EAAO3G,UAAY,WACjB,OAAOnD,KAAKkK,UAAU/K,MACxB,EAEA2K,EAAOm9B,SAAW,WAChB,OAAOjnC,KAAK6K,IAAI,QAClB,EAEAf,EAAO26B,QAAU,WACf,OAAOzkC,KAAK6K,IAAI,OAClB,EAEAf,EAAOomC,iBAAmB,SAA0B9lC,GAClD,IAAIihC,EAAYrrC,KAAK6oC,mBAAmBh+B,IAAIT,GAC5C,OAAOihC,EAAYA,EAAUlI,WAAalR,CAC5C,EAEAnoB,EAAOqmC,YAAc,SAAqB/lC,GACxC,IAAIihC,EAAYrrC,KAAK6oC,mBAAmBh+B,IAAIT,GAC5C,OAAOihC,EAAYA,EAAU3C,YAAc,IAC7C,EAEA5+B,EAAO8mC,aAAe,WACpB,OAAO5wC,KAAK6K,IAAI,WAClB,EAEAf,EAAO+mC,aAAe,WACpB,OAAO7wC,KAAK6K,IAAI,SAClB,EAEAf,EAAOgnC,kBAAoB,WACzB,OAAO9wC,KAAK6K,IAAI,cAClB,EAEAf,EAAOinC,kBAAoB,WACzB,OAAO/wC,KAAK6K,IAAI,cAClB,EAEAf,EAAOsmC,gBAAkB,SAAyBC,EAAU9V,GAC1DqT,EAAoB5tC,KAAK6oC,mBAAoByH,EAAgBD,EAAU9V,EACzE,EAEAzwB,EAAOymC,iBAAmB,SAA0BF,EAAU9V,GAC5DqT,EAAoB5tC,KAAK6oC,mBAAoB2H,EAAiBH,EAAU9V,EAC1E,EAEOoQ,CACT,CA3EoC,CA2ElC7a,EAAO6e,IAET79B,EAAOC,QAAU45B,C,qCCrIjB,SAAShP,EAAcn8B,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAO67B,EAAUh8B,OAAO6G,KAAKzG,GAAqD,oBAAjCJ,OAAOq0B,wBAAwC2H,EAAUA,EAAQrzB,OAAO3I,OAAOq0B,sBAAsBj0B,GAAQwC,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyB/7B,EAAQ87B,GAAKE,UAAY,MAAOJ,EAAQj0B,SAAQ,SAAU1H,GAAOi8B,EAAgBp8B,EAAQG,EAAKD,EAAOC,GAAO,GAAI,CAAE,OAAOH,CAAQ,CAEhe,SAASo8B,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAIhN,IAAIw+B,EAAkB,EAAQ,OAE1BC,EAAoB,EAAQ,OAE5BC,EAAe,EAAQ,OAEvBC,EAAmB,EAAQ,OAE3BqG,EAAc,EAAQ,OAEtBC,EAAiB,EAAQ,OAEzBpG,EAAoB,EAAQ,MAE5BgD,EAAqB,EAAQ,KAE7B/C,EAAM,EAAQ,OAEdC,EAAY,EAAQ,OAEpBmG,EAAoB,EAAQ,OAE5B/lC,EAAO4/B,EAAU5/B,KACjB2kB,EAASib,EAAUjb,OACnB9U,EAAS+vB,EAAU/vB,OACnBm2B,EAAepG,EAAUh9B,IACzBgT,EAAagqB,EAAUhqB,WAOvBqwB,EAAqBthB,EANL,CAClBuhB,UAAW,KACXC,SAAU,KACV1E,gBAAiB,KACjBC,eAAgB,OAOd0E,EAAyBzG,EAAI,2BAA6BH,EAAmBD,EAE7El6B,EAA4B,SAAUghC,GA1C1C,IAAwBjlC,EAAUC,EA6ChC,SAASgE,IACP,OAAOghC,EAAoBzxC,MAAMC,KAAMZ,YAAcY,IACvD,CA/CgCwM,EA2CHglC,GA3CPjlC,EA2CPiE,GA3CwC5Q,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EAiDxK,IAAI1C,EAAS0G,EAAa5Q,UAqK1B,OAnKAkK,EAAO2nC,aAAe,WAEpB,OAAOT,CACT,EAEAlnC,EAAO4nC,YAAc,WACnB,OAAO1xC,KAAK6K,IAAI,WAClB,EAEAf,EAAO6nC,mBAAqB,WAC1B,OAAO3xC,KAAK6K,IAAI,kBAClB,EAEAf,EAAO4hC,kBAAoB,WACzB,OAAO1rC,KAAK6K,IAAI,iBAClB,EAEAf,EAAOpH,eAAiB,SAAwB/C,GAE9C,OADYK,KAAK0xC,cAAc7mC,IAAIlL,EAErC,EAEAmK,EAAO8nC,aAAe,SAAsBjyC,GAC1C,OAAOK,KAAK0xC,cAAcj6B,UAAUga,SAASmF,WAAU,SAAUrhB,GAC/D,OAAOA,IAAM5V,CACf,IAAG62B,KAAK,GAAGd,OACb,EAEA5rB,EAAO+nC,YAAc,SAAqBlyC,GACxC,OAAOK,KAAK0xC,cAAcjgB,SAASmF,WAAU,SAAUrhB,GACrD,OAAOA,IAAM5V,CACf,IAAG62B,KAAK,GAAGd,OACb,EAEA5rB,EAAOgoC,cAAgB,SAAuBnyC,GAC5C,OAAOK,KAAK0xC,cAAc9a,WAAU,SAAU/b,EAAGvF,GAC/C,OAAOA,IAAM3V,CACf,IAAG62B,KAAK,GAAGd,OACb,EAEA5rB,EAAOioC,eAAiB,SAAwBpyC,GAC9C,OAAOK,KAAK0xC,cAAcj6B,UAAUmf,WAAU,SAAU/b,EAAGvF,GACzD,OAAOA,IAAM3V,CACf,IAAG62B,KAAK,GAAGd,OACb,EAEA5rB,EAAO87B,iBAAmB,WACxB,OAAO5lC,KAAK0xC,cAAcl6B,SAC5B,EAEA1N,EAAOkoC,cAAgB,WACrB,OAAOhyC,KAAK0xC,cAAchc,OAC5B,EAEA5rB,EAAOmoC,aAAe,WACpB,OAAOjyC,KAAK0xC,cAAc7gC,MAC5B,EAEA/G,EAAOooC,aAAe,SAAsBC,GAC1C,OAAOnyC,KAAK0xC,cAAclmC,KAAI,SAAUjD,GACtC,OAAOA,EAAQA,EAAM2B,UAAY,EACnC,IAAGf,KAAKgpC,GAAa,KACvB,EAEAroC,EAAOsoC,wBAA0B,WAE/B,OAAOpB,EAAYqB,2BACrB,EAEAvoC,EAAOwoC,QAAU,WACf,IAAIhB,EAAWtxC,KAAK0xC,cACpB,OAAOJ,EAASnlC,KAAO,GACvBomC,OAAOjB,EAAS5b,QAAQxrB,WAAWg3B,QAAQ,UAAW,IAAI/hC,OAAS,CACrE,EAEA2K,EAAO0oC,aAAe,SAAsBtxC,EAAMuxC,EAAYjO,GAI5D,OAFAwM,EAAY0B,SAASxxC,EAAMuxC,EAAYjO,GAEhCxkC,IACT,EAEA8J,EAAO6oC,gBAAkB,SAAyBhzC,EAAKizC,GAIrD,OAFA5B,EAAY6B,YAAYlzC,EAAKizC,GAEtB5yC,IACT,EAEA8J,EAAOgpC,kBAAoB,SAA2BnzC,EAAKozC,GAIzD,OAFA/B,EAAYgC,cAAcrzC,EAAKozC,GAExB/yC,IACT,EAEA8J,EAAOmpC,UAAY,SAAmB/N,GAIpC,OAFA8L,EAAYkC,MAAMhO,GAEXllC,IACT,EAEA8J,EAAO4+B,UAAY,SAAmB/oC,GAEpC,OAAOqxC,EAAYmC,MAAMxzC,EAC3B,EAEAmK,EAAOspC,eAAiB,WACtB,OAAOpC,EAAYqC,UACrB,EAEAvpC,EAAOwpC,iBAAmB,SAA0BC,GAClD,OAAOvC,EAAYwC,mBAAmBD,EACxC,EAEA/iC,EAAaijC,qBAAuB,SACpC9N,EAAQ0L,GAEN,IAAIqC,EAAYz0C,MAAMC,QAAQymC,GAAUA,EAASA,EAAOgO,cACpDrC,EAAW9G,EAAgBgC,gBAAgBkH,GAC3CpI,EAAiBgG,EAASlc,UAAY,IAAI6b,EAAmBA,EAAe2C,YAAYtC,EAAS5b,QAAQiY,UAC7G,OAAO,IAAIn9B,EAAa,CACtB8gC,SAAUA,EACVD,UAAWA,GAAaL,EACxBpE,gBAAiBtB,EACjBuB,eAAgBvB,GAEpB,EAEA96B,EAAaC,eAAiB,SAAwBJ,GACpD,IAAI8hC,EAAY/yC,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAK,YAEhFumC,EADUt1B,EAAK3F,MAAMynC,GACJ3mC,KAAI,SAAUjD,GAEjC,OADAA,EAAQ2oC,EAAkB3oC,GACnB,IAAIgpC,EAAuB,CAChC5xC,IAAKkrC,IACLx6B,KAAM9H,EACNrH,KAAM,WACNgrC,cAAe/gC,EAAK6P,EAAOyvB,EAAkB2E,MAAO7mC,EAAMpJ,UAE9D,IACA,OAAOqR,EAAaijC,qBAAqB9N,EAC3C,EAEAn1B,EAAa+I,OAAS,SAAgB3M,GACpC,OAAO,IAAI4D,EAAamrB,EAAc,CAAC,EAAG/uB,EAAO,CAC/C0kC,SAAUvwB,EAAWnU,EAAM0kC,UAAU9lC,IAAIgF,EAAaqjC,0BACtDjH,gBAAiB,IAAIqE,EAAerkC,EAAMggC,iBAC1CC,eAAgB,IAAIoE,EAAerkC,EAAMigC,kBAE7C,EAEAr8B,EAAaqjC,yBAA2B,SAAkCtrC,GACxE,IAAI2jC,EAAgB3jC,EAAM2jC,cAC1B,OAAO,IAAIqF,EAAuB5V,EAAc,CAAC,EAAGpzB,EAAO,CACzDi8B,KAAM2M,EAAa5oC,EAAMi8B,MACzB0H,cAAgC,MAAjBA,EAAwB/gC,GAAMlM,MAAMC,QAAQgtC,GAAiBA,EAAgB2B,EAAmB3B,IAAgB1gC,KAAI,SAAUwR,GAC3I,OAAOytB,EAAkBlxB,OAAOyD,EAClC,UAAMtU,IAEV,EAEO8H,CACT,CA7KgC,CA6K9B4gC,GAEFtgC,EAAOC,QAAUP,C,qCC7NjB,IAAIi6B,EAAoB,EAAQ,OAG5B18B,EADW,EAAQ,OACJA,IAEf+lC,EAA0B,CAC5BtsC,IAAK,SAAawC,EAAcshC,EAAgByI,GAC9C,OAAOC,EAAkBhqC,EAAcshC,EAAgByI,GAAa,EACtE,EACAv0B,OAAQ,SAAgBxV,EAAcshC,EAAgByI,GACpD,OAAOC,EAAkBhqC,EAAcshC,EAAgByI,GAAa,EACtE,GAGF,SAASC,EAAkBhqC,EAAcshC,EAAgByI,EAAaE,GACpE,IAAI3C,EAAWtnC,EAAa0nC,cACxBwC,EAAW5I,EAAe/mC,cAC1B4vC,EAAc7I,EAAeiC,iBAC7B6G,EAAS9I,EAAe8B,YACxBiH,EAAY/I,EAAekC,eAC3B8G,EAAYhD,EAAS1a,WAAU,SAAU/b,EAAGvF,GAC9C,OAAOA,IAAM4+B,CACf,IAAGld,WAAU,SAAUnc,EAAGvF,GACxB,OAAOA,IAAM8+B,CACf,IAAGnsC,OAAO8F,EAAI,CAAC,CAACqmC,EAAQ9C,EAASzmC,IAAIupC,OAAY5oC,KAAI,SAAUjD,EAAOgsC,GACpE,IAAIC,EACAC,EAEAP,IAAaE,GACfI,EAAaL,EACbM,EAAWJ,IAEXG,EAAaD,IAAaL,EAAWC,EAAc,EACnDM,EAAWF,IAAaH,EAASC,EAAY9rC,EAAMpF,aAMrD,IAHA,IACIuxC,EADArG,EAAQ9lC,EAAMsgC,mBAGX2L,EAAaC,GAClBC,EAAUrG,EAAMxjC,IAAI2pC,GACpBnG,EAAQA,EAAMv/B,IAAI0lC,EAAYP,EAAcxJ,EAAkBqE,WAAW4F,EAASX,GAAetJ,EAAkBuE,YAAY0F,EAASX,IACxIS,IAGF,OAAOjsC,EAAMuG,IAAI,gBAAiBu/B,EACpC,IACA,OAAOrkC,EAAa3G,MAAM,CACxBiuC,SAAUA,EAASjuC,MAAMixC,GACzB1H,gBAAiBtB,EACjBuB,eAAgBvB,GAEpB,CAEAx6B,EAAOC,QAAU+iC,C,qCCtDjB,SAASlY,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAEhN,IAAI2oC,EAAY,EAAQ,OAEpBC,EAAwB,EAAQ,OAEhCC,EAAmB,EAAQ,OAE3B9J,EAAY,EAAQ,OAEpB3vB,EAAY,EAAQ,OAEpB05B,EAAa,EAAQ,OAErB/mC,EAAMg9B,EAAUh9B,IAEhBgnC,EAAuB,CACzBC,SAAS,EACTC,eAAe,EACfC,WAAW,EACXC,uBAAuB,EACvBxX,YAAY,GAGVyX,EAAgBT,EAAUU,UAAU,YAEpCC,EAA2B,WAC7B,SAASA,EAAYC,GACnB,IAAI7oC,EAAQ1M,KAEZ47B,EAAgB57B,KAAM,gBAAY,GAElC47B,EAAgB57B,KAAM,iBAAa,GAEnC47B,EAAgB57B,KAAM,iBAAa,GAEnC47B,EAAgB57B,KAAM,kBAAc,GAEpCA,KAAKu1C,UAAYA,EACjBv1C,KAAKw1C,UAAYznC,IACjB,IAAI0nC,EAAkBZ,EAAiBU,GAEnCE,EAAgBC,mBAAqBN,EACvCp1C,KAAK21C,SAAW,IAAIF,EAAgBC,kBAAiB,SAAUF,GAC7D,OAAO9oC,EAAMkpC,kBAAkBJ,EACjC,IAEAx1C,KAAK61C,WAAa,SAAUh3C,GACxBA,EAAEW,kBAAkBs2C,MAAgH16B,GAAU,GAEhJ1O,EAAMqpC,iBAAiB,CACrB70C,KAAM,gBACN1B,OAAQX,EAAEW,QAEd,CAEJ,CAEA,IAAIsK,EAASwrC,EAAY11C,UAoFzB,OAlFAkK,EAAO2R,MAAQ,WACTzb,KAAK21C,SACP31C,KAAK21C,SAASK,QAAQh2C,KAAKu1C,UAAWR,GAItC/0C,KAAKu1C,UAAUU,iBAAiB,2BAA4Bj2C,KAAK61C,WAErE,EAEA/rC,EAAOosC,sBAAwB,WAC7B,IAAIP,EAAW31C,KAAK21C,SAEhBA,GACF31C,KAAK41C,kBAAkBD,EAASQ,eAChCR,EAASS,cAITp2C,KAAKu1C,UAAUc,oBAAoB,2BAA4Br2C,KAAK61C,YAGtE,IAAIL,EAAYx1C,KAAKw1C,UAErB,OADAx1C,KAAKw1C,UAAYznC,IACVynC,CACT,EAEA1rC,EAAO8rC,kBAAoB,SAA2BJ,GACpD,IAAK,IAAI/1C,EAAI,EAAGA,EAAI+1C,EAAUr2C,OAAQM,IACpCO,KAAK+1C,iBAAiBP,EAAU/1C,GAEpC,EAEAqK,EAAOwsC,uBAAyB,SAAgCC,GAC9D,IAAIr1C,EAAOq1C,EAASr1C,KAChB1B,EAAS+2C,EAAS/2C,OAClBg3C,EAAeD,EAASC,aAE5B,GAAa,kBAATt1C,GAKF,GAA2B,KAAvB1B,EAAOi3C,YAIT,OAAIrB,EACK51C,EAAOi3C,YAAYvV,QAAQ,KAAM,IAGnC1hC,EAAOi3C,iBAEX,GAAa,cAATv1C,EAAsB,CAC/B,GAAIs1C,GAAgBA,EAAar3C,OAO/B,MAAO,GACF,GAA2B,KAAvBK,EAAOi3C,YAIhB,OAAOj3C,EAAOi3C,WAElB,CAEA,OAAO,IACT,EAEA3sC,EAAOisC,iBAAmB,SAA0BQ,GAClD,IAAIE,EAAcz2C,KAAKs2C,uBAAuBC,GAE9C,GAAmB,MAAfE,EAAqB,CACvB,IAAIC,EAAY5B,EAAWF,EAAsB2B,EAAS/2C,SAC1DQ,KAAKw1C,UAAYx1C,KAAKw1C,UAAU1mC,IAAI4nC,EAAWD,EACjD,CACF,EAEOnB,CACT,CArH+B,GAuH/BxkC,EAAOC,QAAUukC,C,qCCjJjB,IAAIqB,EAAQ,EAAQ,OAEhBC,EAAK,EAAQ,OAcb3oC,GAA6BF,EAZlB,EAAQ,OACJA,KAWkB,CACnC,aAAc,CACZgC,QAAS,MAEX,aAAc,CACZA,QAAS,MAEX,eAAgB,CACdA,QAAS,MAEX,cAAe,CACbA,QAAS,MAEX,cAAe,CACbA,QAAS,MAEX,aAAc,CACZA,QAAS,MAEX8mC,QAAS,CACP9mC,QAAS,WAEX+mC,QAAS,CACP/mC,QAAS,WAEX,sBAAuB,CACrBA,QAAS,KACTgnC,QApCUJ,EAAMK,cAAc,KAAM,CACtCv2C,UAAWm2C,EAAG,kCAqCd,oBAAqB,CACnB7mC,QAAS,KACTgnC,QArCUJ,EAAMK,cAAc,KAAM,CACtCv2C,UAAWm2C,EAAG,kCAsCdK,WAAY,CACVlnC,QAAS,cAEXmnC,OAAQ,CACNnnC,QAAS,UAEX,aAAc,CACZA,QAAS,MACTgnC,QA5CWJ,EAAMK,cAAc,MAAO,CACxCv2C,UAAWm2C,EAAG,mCA6CdO,SAAU,CACRpnC,QAAS,MACTqnC,gBAAiB,CAAC,QAGtBtmC,EAAOC,QAAU9C,C,iCChEjB6C,EAAOC,QAAU,CACfyxB,KAAM,CACJ/C,WAAY,QAEdwC,KAAM,CACJoV,WAAY,YACZC,SAAU,cAEZ7U,OAAQ,CACN8U,UAAW,UAEb7U,cAAe,CACb8U,eAAgB,gBAElB7U,UAAW,CACT6U,eAAgB,a,qCChBpB,IAAIrM,EAAmB,EAAQ,OAE3BX,EAAkB,EAAQ,OAE1BC,EAAoB,EAAQ,OAE5B+E,EAA0B,EAAQ,OAElC9E,EAAe,EAAQ,OAEvBl6B,EAAe,EAAQ,OAEvBvC,EAA6B,EAAQ,OAErCwpC,EAA0B,EAAQ,OAElCC,EAAc,EAAQ,OAEtBC,EAAmB,EAAQ,OAE3B3G,EAAc,EAAQ,OAEtBpG,EAAgB,EAAQ,OAExBgN,EAAsB,EAAQ,MAE9B9zC,EAAc,EAAQ,OAEtB+zC,EAAiB,EAAQ,OAEzBC,EAAuB,EAAQ,OAE/BC,EAAqB,EAAQ,MAE7B9G,EAAiB,EAAQ,OAEzB+G,EAA6B,EAAQ,MAErCC,EAA6B,EAAQ,OAErCpN,EAAoB,EAAQ,MAE5BvkC,EAAuB,EAAQ,OAE/B4xC,EAA0B,EAAQ,OAIlCC,EAAc,CAChBtoC,OAAQ6nC,EACRU,YAAaT,EACb7zC,YAAaA,EACb6H,mBAAoB6jC,EACpB6I,OAAQrH,EACRsH,eAAgBV,EAChBpN,gBAAiBA,EACjBC,kBAAmBA,EACnBC,aAAcA,EACdl6B,aAAcA,EACdsnC,qBAAsBA,EACtB7G,eAAgBA,EAChB9F,iBAAkBA,EAClB0M,eAAgBA,EAChBt0C,SAAUqnC,EACVlmC,UAAWqzC,EACX9pC,2BAA4BA,EAC5BwpC,wBAAyBA,EACzBc,gBArBoB,EAAQ,OAsB5BC,eAAgBP,EAChBQ,aAAcT,EACdU,OAAQ7N,EACRvkC,qBAAsBA,EACtB4xC,wBAAyBA,GAE3BpnC,EAAOC,QAAUonC,C,qCCxEjB,IAAIQ,EAAU,EAAQ,OAEtB,SAASt5C,IAAqQ,OAAxPA,EAAWs5C,GAAW,SAAUn5C,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAAUH,EAASU,MAAMC,KAAMZ,UAAY,CAEtT,SAASu8B,EAAcn8B,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAO67B,EAAUh8B,OAAO6G,KAAKzG,GAAqD,oBAAjCJ,OAAOq0B,wBAAwC2H,EAAUA,EAAQrzB,OAAO3I,OAAOq0B,sBAAsBj0B,GAAQwC,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyB/7B,EAAQ87B,GAAKE,UAAY,MAAOJ,EAAQj0B,SAAQ,SAAU1H,GAAOi8B,EAAgBp8B,EAAQG,EAAKD,EAAOC,GAAO,GAAI,CAAE,OAAOH,CAAQ,CAEhe,SAASo5C,EAAuBC,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIC,eAAe,6DAAgE,OAAOD,CAAM,CAErK,SAASjd,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAEhN,SAAS+sC,EAAexsC,EAAUC,GAAcD,EAAS3M,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,CAAY,CAEtL,IAAIyB,EAA6B,EAAQ,OAErCwpC,EAA0B,EAAQ,OAElCuB,EAAgC,EAAQ,OAExCC,EAAsB,EAAQ,OAE9BC,EAAyB,EAAQ,OAEjCC,EAAyB,EAAQ,OAEjCC,EAAkB,EAAQ,OAE1BC,EAAyB,EAAQ,OAEjCC,EAAe,EAAQ,KAEvBx1C,EAAc,EAAQ,OAEtB6yC,EAAQ,EAAQ,OAEhB4C,EAAS,EAAQ,OAEjBC,EAAQ,EAAQ,MAEhB7E,EAAY,EAAQ,OAEpBiC,EAAK,EAAQ,OAEb/L,EAAoB,EAAQ,MAE5BvkC,EAAuB,EAAQ,OAE/BmzC,EAAoB,EAAQ,OAE5B3O,EAAM,EAAQ,OAEd1vB,EAAY,EAAQ,OAEpBs+B,EAAgB,EAAQ,OAExB5E,EAAa,EAAQ,OAErB6E,EAAOhF,EAAUU,UAAU,MAG3BuE,GAAmBD,EAGnBE,EAAa,CACfC,KAAMX,EACNY,UAAWf,EACXgB,KAAMd,EACNe,IAAK,KACLxqC,OAAQ,MAENyqC,GAAa,EAEbC,EAAsC,SAAU/gB,GAGlD,SAAS+gB,IACP,OAAO/gB,EAAiBr5B,MAAMC,KAAMZ,YAAcY,IACpD,CAJA+4C,EAAeoB,EAAwB/gB,GAMvC,IAAItvB,EAASqwC,EAAuBv6C,UAkEpC,OAhEAkK,EAAO2F,OAAS,WACd,OAAO,IACT,EAEA3F,EAAO+E,kBAAoB,WACzB7O,KAAKo6C,SACP,EAEAtwC,EAAOkF,mBAAqB,WAC1BhP,KAAKo6C,SACP,EAEAtwC,EAAOswC,QAAU,WACf,IAAIztC,EAAS3M,KAAKK,MAAMsM,OAmCxBA,EAAO0tC,mBAAqBr6C,KAAKK,MAAMiE,YAavCqI,EAAO2tC,oBAAqB,CAC9B,EAEOH,CACT,CA1E0C,CA0ExCxD,EAAMlrC,WAQJisC,EAA2B,SAAU6C,GAMvC,SAAS7C,EAAYr3C,GACnB,IAAIqM,EAkQJ,OA9PAkvB,EAAgBgd,EAFhBlsC,EAAQ6tC,EAAkBz6C,KAAKE,KAAMK,IAAUL,MAEA,0BAAsB,GAErE47B,EAAgBgd,EAAuBlsC,GAAQ,kBAAc,GAE7DkvB,EAAgBgd,EAAuBlsC,GAAQ,gBAAY,GAE3DkvB,EAAgBgd,EAAuBlsC,GAAQ,kBAAc,GAE7DkvB,EAAgBgd,EAAuBlsC,GAAQ,qBAAiB,GAEhEkvB,EAAgBgd,EAAuBlsC,GAAQ,kBAAc,GAE7DkvB,EAAgBgd,EAAuBlsC,GAAQ,mCAA+B,GAE9EkvB,EAAgBgd,EAAuBlsC,GAAQ,0BAAsB,GAErEkvB,EAAgBgd,EAAuBlsC,GAAQ,mCAA+B,GAE9EkvB,EAAgBgd,EAAuBlsC,GAAQ,oCAAgC,GAE/EkvB,EAAgBgd,EAAuBlsC,GAAQ,sBAAkB,GAEjEkvB,EAAgBgd,EAAuBlsC,GAAQ,eAAW,GAE1DkvB,EAAgBgd,EAAuBlsC,GAAQ,wBAAoB,GAEnEkvB,EAAgBgd,EAAuBlsC,GAAQ,yBAAqB,GAEpEkvB,EAAgBgd,EAAuBlsC,GAAQ,2BAAuB,GAEtEkvB,EAAgBgd,EAAuBlsC,GAAQ,eAAW,GAE1DkvB,EAAgBgd,EAAuBlsC,GAAQ,cAAU,GAEzDkvB,EAAgBgd,EAAuBlsC,GAAQ,kBAAc,GAE7DkvB,EAAgBgd,EAAuBlsC,GAAQ,mBAAe,GAE9DkvB,EAAgBgd,EAAuBlsC,GAAQ,oBAAgB,GAE/DkvB,EAAgBgd,EAAuBlsC,GAAQ,eAAW,GAE1DkvB,EAAgBgd,EAAuBlsC,GAAQ,gBAAY,GAE3DkvB,EAAgBgd,EAAuBlsC,GAAQ,gBAAY,GAE3DkvB,EAAgBgd,EAAuBlsC,GAAQ,kBAAc,GAE7DkvB,EAAgBgd,EAAuBlsC,GAAQ,mBAAe,GAE9DkvB,EAAgBgd,EAAuBlsC,GAAQ,gBAAY,GAE3DkvB,EAAgBgd,EAAuBlsC,GAAQ,oBAAgB,GAE/DkvB,EAAgBgd,EAAuBlsC,GAAQ,kBAAc,GAE7DkvB,EAAgBgd,EAAuBlsC,GAAQ,gBAAY,GAE3DkvB,EAAgBgd,EAAuBlsC,GAAQ,iBAAa,GAE5DkvB,EAAgBgd,EAAuBlsC,GAAQ,cAAU,GAEzDkvB,EAAgBgd,EAAuBlsC,GAAQ,uBAAmB,GAElEkvB,EAAgBgd,EAAuBlsC,GAAQ,aAAS,GAExDkvB,EAAgBgd,EAAuBlsC,GAAQ,YAAQ,GAEvDkvB,EAAgBgd,EAAuBlsC,GAAQ,eAAW,GAE1DkvB,EAAgBgd,EAAuBlsC,GAAQ,uBAAmB,GAElEkvB,EAAgBgd,EAAuBlsC,GAAQ,wBAAoB,GAEnEkvB,EAAgBgd,EAAuBlsC,GAAQ,oBAAgB,GAE/DkvB,EAAgBgd,EAAuBlsC,GAAQ,oBAAgB,GAE/DkvB,EAAgBgd,EAAuBlsC,GAAQ,oBAAgB,GAE/DkvB,EAAgBgd,EAAuBlsC,GAAQ,cAAU,GAEzDkvB,EAAgBgd,EAAuBlsC,GAAQ,mBAAe,GAE9DkvB,EAAgBgd,EAAuBlsC,GAAQ,mBAAe,GAE9DkvB,EAAgBgd,EAAuBlsC,GAAQ,6BAA6B,SAAU+R,GACpF/R,EAAM8tC,gBAAkB/7B,EAIxB/R,EAAMC,OAAkB,OAAT8R,EAAgBA,EAAKg8B,WAAa,IACnD,IAEA7e,EAAgBgd,EAAuBlsC,GAAQ,SAAS,SAAUguC,GAChE,IAAIp2C,EAAcoI,EAAMrM,MAAMiE,YAC1Bq2C,EAAkBr2C,EAAY9B,eAAeo4C,cAC7CC,EAAanuC,EAAMC,OAEvB,GAAKkuC,EAAL,CAMA,IAAIC,EAAetB,EAAMuB,gBAAgBF,GAErC36C,EAAOw6C,GAAkBjB,EAAkBqB,GAC3Ct2B,EAAItkB,EAAKskB,EACTw2B,EAAI96C,EAAK86C,EAEZtB,EAAcmB,IAA6Gz/B,GAAU,GACtIy/B,EAAWlsC,QAEPmsC,IAAiBG,OACnBA,OAAOC,SAAS12B,EAAGw2B,GAEnBzB,EAAO4B,OAAOL,EAAcE,GAOzBL,GACHjuC,EAAMgT,OAAO5b,EAAYs3C,eAAe92C,EAAaA,EAAY9B,gBAtBnE,CAwBF,IAEAo5B,EAAgBgd,EAAuBlsC,GAAQ,QAAQ,WACrD,IAAImuC,EAAanuC,EAAMC,OAElBkuC,IAIJnB,EAAcmB,IAA6Gz/B,GAAU,GACtIy/B,EAAWjsC,OACb,IAEAgtB,EAAgBgd,EAAuBlsC,GAAQ,WAAW,SAAU2uC,GAClE,IAAI1rC,EAAcjD,EAAMrM,MACpBi7C,EAAU3rC,EAAY2rC,QACtBC,EAAQ5rC,EAAY4rC,MACpBC,EAAS7rC,EAAY6rC,OAErBC,EAAc9f,EAAc,CAAC,EAAGke,EAAWC,MAE3CwB,IAIFG,EAAYH,QAAUA,GAGpBC,IACFE,EAAYF,MAAQA,GAGlBC,IACFC,EAAYD,OAASA,GAGvB,IAAIE,EAAU/f,EAAc,CAAC,EAAGke,EAAY,CAC1CC,KAAM2B,IAGR/uC,EAAMivC,SAAWD,EAAQL,EAC3B,IAEAzf,EAAgBgd,EAAuBlsC,GAAQ,mBAAmB,WAChEA,EAAMkvC,QAAQ,OAChB,IAEAhgB,EAAgBgd,EAAuBlsC,GAAQ,oBAAoB,SAAUguC,GAC3EhuC,EAAMW,SAAS,CACbwuC,YAAanvC,EAAME,MAAMivC,YAAc,IACtC,WACDnvC,EAAMiC,MAAM+rC,EACd,GACF,IAEA9e,EAAgBgd,EAAuBlsC,GAAQ,gBAAgB,SAAUovC,GACvEpvC,EAAMqvC,WAAaD,CACrB,IAEAlgB,EAAgBgd,EAAuBlsC,GAAQ,gBAAgB,WAC7D,OAAOA,EAAMqvC,UACf,IAEAngB,EAAgBgd,EAAuBlsC,GAAQ,UAAU,SAAUpI,GACjEoI,EAAM2tC,mBAAqB/1C,EAE3BoI,EAAMrM,MAAM4K,SAAS3G,EACvB,IAEAs3B,EAAgBgd,EAAuBlsC,GAAQ,eAAe,WAC5DA,EAAMsvC,YACR,IAEApgB,EAAgBgd,EAAuBlsC,GAAQ,eAAe,WAC5DA,EAAMsvC,aAEmB,IAArBtvC,EAAMsvC,YACRtvC,EAAMuvC,iBAEV,IAEAvvC,EAAM4tC,oBAAqB,EAC3B5tC,EAAMqvC,WAAa,KACnBrvC,EAAMivC,SAAW,KACjBjvC,EAAMsvC,WAAa,EACnBtvC,EAAMwvC,WAAa77C,EAAM87C,WAAatR,IACtCn+B,EAAM0vC,4BAA8B,eAAiB1vC,EAAMwvC,WAC3DxvC,EAAM2tC,mBAAqBh6C,EAAMiE,YACjCoI,EAAM2vC,4BAA8Bh8C,EAAMiE,YAC1CoI,EAAM4vC,eAAiB5vC,EAAM6vC,cAAc,iBAC3C7vC,EAAM8vC,QAAU9vC,EAAM6vC,cAAc,UACpC7vC,EAAM+vC,iBAAmB/vC,EAAM6vC,cAAc,mBAC7C7vC,EAAMgwC,kBAAoBhwC,EAAM6vC,cAAc,oBAC9C7vC,EAAMiwC,oBAAsBjwC,EAAM6vC,cAAc,sBAChD7vC,EAAMkwC,QAAUlwC,EAAM6vC,cAAc,UACpC7vC,EAAMmwC,OAASnwC,EAAM6vC,cAAc,SACnC7vC,EAAMowC,WAAapwC,EAAM6vC,cAAc,aACvC7vC,EAAMqwC,YAAcrwC,EAAM6vC,cAAc,cACxC7vC,EAAMswC,aAAetwC,EAAM6vC,cAAc,eACzC7vC,EAAMuwC,QAAUvwC,EAAM6vC,cAAc,UACpC7vC,EAAMwwC,SAAWxwC,EAAM6vC,cAAc,WACrC7vC,EAAMywC,SAAWzwC,EAAM6vC,cAAc,WACrC7vC,EAAM0wC,WAAa1wC,EAAM6vC,cAAc,aACvC7vC,EAAM2wC,YAAc3wC,EAAM6vC,cAAc,cACxC7vC,EAAM4wC,SAAW5wC,EAAM6vC,cAAc,WACrC7vC,EAAM6wC,aAAe7wC,EAAM6vC,cAAc,eACzC7vC,EAAM8wC,WAAa9wC,EAAM6vC,cAAc,aACvC7vC,EAAM+wC,SAAW/wC,EAAM6vC,cAAc,WACrC7vC,EAAMgxC,UAAYhxC,EAAM6vC,cAAc,YAEtC7vC,EAAMixC,aAAe,WACnB,OAAOjxC,EAAMwvC,UACf,EAYAxvC,EAAME,MAAQ,CACZivC,YAAa,GAERnvC,CACT,CAzQAqsC,EAAerB,EAAa6C,GAiR5B,IAAIqD,EAAUlG,EAAY93C,UAkN1B,OAhNAg+C,EAAQrB,cAAgB,SAAuBsB,GAC7C,IAAItuC,EAASvP,KAKb,OAAO,SAAUnB,GACf,IAAK0Q,EAAOlP,MAAMwM,SAAU,CAC1B,IAAIixC,EAASvuC,EAAOosC,UAAYpsC,EAAOosC,SAASkC,GAE5CC,IACE1E,EACFA,GAAgB,WACd,OAAO0E,EAAOvuC,EAAQ1Q,EACxB,IAEAi/C,EAAOvuC,EAAQ1Q,GAGrB,CACF,CACF,EAEA++C,EAAQG,iBAAmB,WACzB,QAAS/9C,KAAKK,MAAM29C,cAAgBh+C,KAAKK,MAAMiE,YAAY25C,wBAA0Bj+C,KAAKK,MAAMiE,YAAYhC,oBAAoBgwC,SAClI,EAEAsL,EAAQM,mBAAqB,WAC3B,GAAIl+C,KAAK+9C,mBAAoB,CAC3B,IAAII,EAAmB,CACrB9tC,KAAMykC,EAAW90C,KAAKK,MAAM29C,aAC5B15C,YAAatE,KAAKK,MAAMiE,YACxB85C,cAAep+C,KAAKK,MAAM+9C,cAC1BC,gBAAiBr+C,KAAKo8C,6BAMxB,OAAOzF,EAAMK,cAAcqC,EAAwB8E,EACrD,CAEA,OAAO,IACT,EAQAP,EAAQU,uBAAyB,WAC/B,IAAIC,EAAcv+C,KAAKK,MAAMm+C,iBAAmB,GAC5CC,EAAgBz+C,KAAK+9C,mBAAqB/9C,KAAKo8C,4BAA8B,GACjF,OAAOmC,EAAYrd,QAAQ,4BAA6Bud,SAAkB/1C,CAC5E,EAEAk1C,EAAQnuC,OAAS,WACf,IAAIivC,EAAe1+C,KAAKK,MACpBwN,EAAiB6wC,EAAa7wC,eAC9BvF,EAAkBo2C,EAAap2C,gBAC/BW,EAAey1C,EAAaz1C,aAC5BI,EAAgBq1C,EAAar1C,cAC7BsE,EAAiB+wC,EAAa/wC,eAC9BrJ,EAAco6C,EAAap6C,YAC3Bq6C,EAAgBD,EAAaC,cAC7B9xC,EAAW6xC,EAAa7xC,SACxBuxC,EAAgBM,EAAaN,cAC7BQ,EAAqBF,EAAaE,mBAClCC,EAAYjI,EAAG,CACjB,oBAAoB,EACpB,wBAA2C,SAAlBwH,EACzB,yBAA4C,UAAlBA,EAC1B,0BAA6C,WAAlBA,IAgBzBU,EAAW9+C,KAAKK,MAAM0+C,MAAQ,UAC9BxwC,EAA4B,aAAbuwC,IAA4B9+C,KAAKK,MAAMkO,aAAe,KACrEywC,EAAsB,CACxBnxC,eAAgBA,EAChBvF,gBAAiBA,EACjBW,aAAcA,EACd0E,eAAgBguB,EAAc,CAAC,EAAG8b,EAAyB9pC,GAC3DtE,cAAeA,EACf8yC,UAAWn8C,KAAKk8C,WAChB53C,YAAaA,EACbq6C,cAAeA,EACfC,mBAAoBA,GAEtB,OAAOjI,EAAMK,cAAc,MAAO,CAChCv2C,UAAWo+C,GACV7+C,KAAKk+C,qBAAsBvH,EAAMK,cAAc,MAAO,CACvDv2C,UAAWm2C,EAAG,+BACd9mC,IAAK9P,KAAKi/C,2BACTtI,EAAMK,cAAc,MAAO,CAC5B,wBAAyBnqC,EAAW,KAAO7M,KAAKK,MAAM6+C,uBACtD,oBAAqBryC,EAAW,KAAO7M,KAAKK,MAAM8+C,iBAClD,gBAAiBtyC,EAAW,KAAO7M,KAAKK,MAAM++C,aAC9C,mBAAoBp/C,KAAKs+C,yBACzB,gBAAiBzxC,EAAW,KAAO0B,EACnC,aAAcvO,KAAKK,MAAMg/C,UACzB,kBAAmBr/C,KAAKK,MAAMi/C,eAC9B,iBAAkBt/C,KAAKK,MAAMk/C,cAC7B,YAAa1yC,EAAW,KAAO7M,KAAKK,MAAMm/C,YAC1CC,eAAgBz/C,KAAKK,MAAMo/C,eAC3BC,aAAc1/C,KAAKK,MAAMq/C,aACzBC,YAAa3/C,KAAKK,MAAMs/C,YACxBl/C,UAAWm2C,EAAG,CAKZgJ,aAAc/yC,EACd,8BAA8B,IAEhCgzC,iBAAkBhzC,EAClB,cAAe7M,KAAKK,MAAMy/C,gBAC1BC,cAAe//C,KAAKs8C,eACpB0D,OAAQhgD,KAAKw8C,QACbyD,iBAAkBjgD,KAAK08C,kBACvBwD,mBAAoBlgD,KAAK28C,oBACzBnB,OAAQx7C,KAAK48C,QACbrB,MAAOv7C,KAAK68C,OACZsD,UAAWngD,KAAK88C,WAChBsD,YAAapgD,KAAKogD,YAClBC,YAAargD,KAAKqgD,YAClBC,WAAYtgD,KAAK+8C,YACjBwD,YAAavgD,KAAKg9C,aAClBwD,OAAQxgD,KAAKi9C,QACbwD,QAASzgD,KAAKm9C,SACduD,QAAS1gD,KAAKk9C,SACdyD,UAAW3gD,KAAKo9C,WAChBwD,WAAY5gD,KAAKq9C,YACjBwD,QAAS7gD,KAAKs9C,SACdwD,UAAW9gD,KAAKw9C,WAChBlC,QAASt7C,KAAKy9C,SACdsD,SAAU/gD,KAAK09C,UACf5tC,IAAK9P,KAAKK,MAAM2gD,UAChBjC,KAAMlyC,EAAW,KAAOiyC,EACxBmC,WAAYrH,GAAmB55C,KAAKK,MAAM4gD,WAC1C9+C,MA9EiB,CACjB++C,QAAS,OAETC,WAAY,OACZC,iBAAkB,OAClBC,WAAY,WACZ/J,SAAU,cAyEVgK,gCAAgC,EAChCC,SAAUvhD,KAAKK,MAAMkhD,UACpB5K,EAAMK,cAAcmD,EAAwB,CAC7CxtC,OAAQ3M,KACRsE,YAAaA,IACXqyC,EAAMK,cAAciC,EAAqB55C,EAAS,CAAC,EAAG2/C,EAAqB,CAC7Er/C,IAAK,WAAaK,KAAK4M,MAAMivC,iBAEjC,EAEA+B,EAAQ/uC,kBAAoB,WAC1B7O,KAAKs6C,oBAAqB,GAErBJ,GAAcpP,EAAI,uBACrBoP,GAAa,EACbZ,EAAakI,WAGfxhD,KAAK47C,QAAQ,QASTjC,IAGG35C,KAAK2M,OAGR3M,KAAK2M,OAAO80C,cAAcC,YAAY,iBAAiB,GAAO,GAF9D,EAAAC,EAAOD,YAAY,iBAAiB,GAAO,GAKjD,EAEA9D,EAAQ5uC,mBAAqB,WAC3BhP,KAAKs6C,oBAAqB,EAC1Bt6C,KAAKq6C,mBAAqBr6C,KAAKK,MAAMiE,YACrCtE,KAAKq8C,4BAA8Br8C,KAAKK,MAAMiE,WAChD,EAYOozC,CACT,CAre+B,CAqe7Bf,EAAMlrC,WAERmwB,EAAgB8b,EAAa,eAAgB,CAC3C8G,gBAAiB,4BACjB3wC,eAAgBI,EAChB3F,gBAAiB,WACf,OAAO,IACT,EACAW,aAAc,WACZ,MAAO,EACT,EACA5C,aAAcC,EACduG,UAAU,EACVo0C,YAAY,EACZW,mBAAmB,IAGrB9wC,EAAOC,QAAU2mC,C,qCChpBjB,IAAIiB,EAAU,EAAQ,OAEtB,SAASt5C,IAAqQ,OAAxPA,EAAWs5C,GAAW,SAAUn5C,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAAUH,EAASU,MAAMC,KAAMZ,UAAY,CAQtT,IAAIyiD,EAAkB,EAAQ,OAE1BC,EAAiB,EAAQ,MAEzBnL,EAAQ,EAAQ,OAEhB4C,EAAS,EAAQ,OAEjBC,EAAQ,EAAQ,MAEhBuI,EAAc,EAAQ,OAEtBC,EAAuB,EAAQ,OAE/BpL,EAAK,EAAQ,OAEbqL,EAAqB,EAAQ,OAE7BxI,EAAoB,EAAQ,OAE5ByI,EAAwB,EAAQ,OAEhC9mC,EAAY,EAAQ,OAEpBs+B,EAAgB,EAAQ,OAExB5E,EAAa,EAAQ,OAOrBqN,EAAyB,SAAgC5/C,EAAW5C,GACtE,OAAO4C,EAAUM,iBAAmBlD,GAAO4C,EAAUI,gBAAkBhD,CACzE,EASIg4C,EAAgC,SAAUve,GAhD9C,IAAwB7sB,EAAUC,EAmDhC,SAASmrC,IAGP,IAFA,IAAIjrC,EAlDiBV,EAAKrM,EAAKyR,EAoDtB5H,EAAOpK,UAAUD,OAAQ0I,EAAO,IAAI5I,MAAMuK,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC/E5B,EAAK4B,GAAQrK,UAAUqK,GAOzB,OAJAiD,EAAQ0sB,EAAiBt5B,KAAKC,MAAMq5B,EAAkB,CAACp5B,MAAMiI,OAAOJ,KAAU7H,KAxDzDgM,EAJzB,SAAgC6sC,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIC,eAAe,6DAAgE,OAAOD,CAAM,CA8DjJD,CAAuBlsC,GA1DR0E,OA0DyB,GA1D9BzR,EA0DqB,WA1DIqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EA4DhL1E,CACT,CA/DgCF,EAiDC4sB,GAjDX7sB,EAiDPorC,GAjDwC/3C,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EAiExK,IAAI1C,EAAS6tC,EAAiB/3C,UA+J9B,OA7JAkK,EAAOs4C,sBAAwB,SAA+BC,GAC5D,OAAOriD,KAAKK,MAAMkI,QAAU85C,EAAU95C,OAASvI,KAAKK,MAAMiiD,OAASD,EAAUC,MAAQtiD,KAAKK,MAAMkiD,YAAcF,EAAUE,WAAaJ,EAAuBE,EAAU9/C,UAAW8/C,EAAU95C,MAAMolC,WAAa0U,EAAUjH,cAC1N,EAeAtxC,EAAO+E,kBAAoB,WACzB,IAAI7O,KAAKK,MAAMs+C,cAAf,CAIA,IAAIp8C,EAAYvC,KAAKK,MAAMkC,UACvB6xC,EAAS7xC,EAAU6qC,YAEvB,GAAK7qC,EAAUq4C,eAAiBxG,IAAWp0C,KAAKK,MAAMkI,MAAMolC,SAA5D,CAIA,IAAI6U,EAAYxiD,KAAKyiD,MAErB,GAAiB,MAAbD,EAAJ,CAIA,IAEIE,EAFA5H,EAAetB,EAAMuB,gBAAgByH,GACrC9H,EAAiBjB,EAAkBqB,GAGvC,GAAIA,IAAiBG,OAAQ,CAC3B,IAAI0H,EAAeV,EAAmBO,IAGtCE,EAFiBC,EAAa3H,EAAI2H,EAAavhD,OAC1B8gD,IAAwB9gD,QAG3B,GAChB65C,OAAOC,SAASR,EAAel2B,EAAGk2B,EAAeM,EAAI0H,EAjFzC,GAmFhB,KAAO,CACJhJ,EAAc8I,IAA2GpnC,GAAU,IAIpIsnC,EAHkBF,EAAUI,aAAeJ,EAAUK,WACvC/H,EAAa+H,UAAY/H,EAAa8H,aACvBlI,EAAeM,IAG1B,GAChBzB,EAAO4B,OAAOL,EAAcvB,EAAOuJ,OAAOhI,GAAgB4H,EA3F9C,GA6FhB,CAzBA,CANA,CAPA,CAuCF,EAEA54C,EAAOi5C,gBAAkB,WACvB,IAAIxzC,EAASvP,KAETuI,EAAQvI,KAAKK,MAAMkI,MACnBgsC,EAAWhsC,EAAMolC,SACjBt9B,EAAO9H,EAAM2B,UACb84C,EAAchjD,KAAKK,MAAMiiD,KAAKn2C,KAAO,EACrC82C,EAAed,EAAuBniD,KAAKK,MAAMkC,UAAWgyC,GAChE,OAAOv0C,KAAKK,MAAMiiD,KAAK92C,KAAI,SAAU03C,EAAStvC,GAC5C,IAAIuvC,EAAmBD,EAAQr4C,IAAI,UAEnC,GAA8B,IAA1Bs4C,EAAiBh3C,KACnB,OAAO,KAGT,IAAIi3C,EAAWD,EAAiBh3C,KAAO,EACnC8hC,EAASkV,EAAiB33C,KAAI,SAAUgjC,EAAM6U,GAChD,IAAI3M,EAAYoL,EAAewB,OAAO/O,EAAU3gC,EAAIyvC,GAChD5nC,EAAQ+yB,EAAK3jC,IAAI,SACjByJ,EAAMk6B,EAAK3jC,IAAI,OACnB,OAAO8rC,EAAMK,cAAc6K,EAAiB,CAC1CliD,IAAK+2C,EACLA,UAAWA,EACXnuC,MAAOA,EACPkT,MAAOA,EACPlZ,UAAW0gD,EAAe1zC,EAAOlP,MAAMkC,UAAY,KACnD64C,eAAgB7rC,EAAOlP,MAAM+6C,eAC7B/qC,KAAMA,EAAKvF,MAAM2Q,EAAOnH,GACxB8zB,SAAU7/B,EAAM2nC,iBAAiBz0B,GACjC9N,eAAgB4B,EAAOlP,MAAMsN,eAC7BtE,cAAekG,EAAOlP,MAAMgJ,cAC5Bk6C,OAAQ3vC,IAAOovC,GAAeK,IAAOD,GAEzC,IAAG5rC,UACCw2B,EAAekV,EAAQr4C,IAAI,gBAE/B,GAAoB,MAAhBmjC,EACF,OAAOC,EAGT,IAAK1+B,EAAOlP,MAAM8J,UAChB,OAAO8jC,EAGT,IAAI9jC,EAAY2qC,EAAWvlC,EAAOlP,MAAM8J,WACpCq5C,EAAqBr5C,EAAUE,mBAAmB2jC,GAEtD,IAAKwV,EACH,OAAOvV,EAGT,IAAIwV,EAAiBt5C,EAAUK,eAAewjC,GAC1C0V,EAAqB5B,EAAewB,OAAO/O,EAAU3gC,EAAI,GACzD6H,EAAQ0nC,EAAiBztB,QAAQ7qB,IAAI,SACrCyJ,EAAM6uC,EAAiBtyC,OAAOhG,IAAI,OAClC84C,EAAgBtzC,EAAKvF,MAAM2Q,EAAOnH,GAClC20B,EAAY1gC,EAAM4nC,YAAY+S,EAAQr4C,IAAI,UAG1C+4C,EAAM5B,EAAqB6B,sBAAsB9B,EAAY+B,aAAaH,GAAgBp0C,EAAOlP,MAAMkiD,WACvGwB,EAAc,CAChB/5C,aAAcuF,EAAOlP,MAAM2J,aAC3B25C,cAAeA,EACfC,IAAKA,EACLnoC,MAAOA,EACPnH,IAAKA,EACLigC,SAAUA,EACVtL,UAAWA,EACXyN,UAAWgN,GAEb,OAAO/M,EAAMK,cAAcwM,EAAoBnkD,EAAS,CAAC,EAAGokD,EAAgBM,EAAa,CACvFpkD,IAAK+jD,IACHzV,EACN,IAAGz2B,SACL,EAEA1N,EAAO2F,OAAS,WACd,IAAIC,EAAS1P,KAET2P,EAAc3P,KAAKK,MACnBkiD,EAAY5yC,EAAY4yC,UACxB7L,EAAY/mC,EAAY+mC,UACxBj2C,EAAYm2C,EAAG,CACjB,kCAAkC,EAClC,+BAA8C,QAAd2L,EAChC,+BAA8C,QAAdA,IAElC,OAAO5L,EAAMK,cAAc,MAAO,CAChC,kBAAmBN,EACnBj2C,UAAWA,EACXqP,IAAK,SAAa5P,GAChB,OAAOwP,EAAO+yC,MAAQviD,CACxB,GACCF,KAAK+iD,kBACV,EAEOpL,CACT,CAjLoC,CAiLlChB,EAAMlrC,WAERqF,EAAOC,QAAU4mC,C,qCCpOjB,IAAIgB,EAAU,EAAQ,OAEtB,SAASt5C,IAAqQ,OAAxPA,EAAWs5C,GAAW,SAAUn5C,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAAUH,EAASU,MAAMC,KAAMZ,UAAY,CAMtT,SAASu8B,EAAcn8B,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAO67B,EAAUh8B,OAAO6G,KAAKzG,GAAqD,oBAAjCJ,OAAOq0B,wBAAwC2H,EAAUA,EAAQrzB,OAAO3I,OAAOq0B,sBAAsBj0B,GAAQwC,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyB/7B,EAAQ87B,GAAKE,UAAY,MAAOJ,EAAQj0B,SAAQ,SAAU1H,GAAOi8B,EAAgBp8B,EAAQG,EAAKD,EAAOC,GAAO,GAAI,CAAE,OAAOH,CAAQ,CAEhe,SAASo8B,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAEhN,IAAIg4C,EAAkB,EAAQ,OAE1BlC,EAAiB,EAAQ,MAEzBnL,EAAQ,EAAQ,OAEhB4C,EAAS,EAAQ,OAEjBC,EAAQ,EAAQ,MAEhByI,EAAqB,EAAQ,OAE7BxI,EAAoB,EAAQ,OAE5ByI,EAAwB,EAAQ,OAEhCnX,EAAY,EAAQ,OAEpB3vB,EAAY,EAAQ,OAEpBs+B,EAAgB,EAAQ,OAQxByI,GALOpX,EAAU5/B,KAKQ,SAAgC5I,EAAW5C,GACtE,OAAO4C,EAAUM,iBAAmBlD,GAAO4C,EAAUI,gBAAkBhD,CACzE,GAwDIskD,EAAuB,SAA8B17C,EAAOsF,GAC9D,IAAIq2C,EAAgBr2C,EAAehD,IAAItC,EAAM/D,YAAcqJ,EAAehD,IAAI,YAC1Es5C,EAAkBD,EAAcnN,QAEpC,MAAO,CACLqN,QAFYF,EAAcn0C,SAAWlC,EAAehD,IAAI,YAAYkF,QAGpEo0C,gBAAiBA,EAErB,EAEIE,EAAwB,SAA+B97C,EAAOD,GAChE,IAAIo+B,EAAiBp+B,EAAgBC,GAErC,OAAKm+B,EAOE,CACL4d,gBAJoB5d,EAAe39B,UAKnCw7C,YAJgB7d,EAAermC,MAK/BmkD,eAJmB9d,EAAene,UAL3B,CAAC,CAWZ,EAEIk8B,EAAwB,SAA+Bl8C,EAAO4zC,EAAWzF,EAAWztC,EAAcy7C,EAAc50C,GAClH,IAAI60C,EAAe,CACjB,cAAc,EACd,cAAexI,EACf,kBAAmBzF,EACnB/2C,IAAK4I,EAAMolC,SACX79B,IAAKA,GAEH80C,EAAc37C,EAAaV,GAa/B,OAXIq8C,IACFD,EAAalkD,UAAYmkD,QAGSl8C,IAAhCg8C,EAAaF,iBACfG,EAAehpB,EAAc,CAAC,EAAGgpB,EAAc,CAC7C9E,gBAAiB6E,EAAaF,eAC9BlD,gCAAgC,KAI7BqD,CACT,EAEIE,EAAoC,SAAUzrB,GA/IlD,IAAwB7sB,EAAUC,EAkJhC,SAASq4C,IAGP,IAFA,IAAIn4C,EAEKlD,EAAOpK,UAAUD,OAAQ0I,EAAO,IAAI5I,MAAMuK,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC/E5B,EAAK4B,GAAQrK,UAAUqK,GAOzB,OAFAmyB,EA7JJ,SAAgCid,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIC,eAAe,6DAAgE,OAAOD,CAAM,CA6JjJD,CAFhBlsC,EAAQ0sB,EAAiBt5B,KAAKC,MAAMq5B,EAAkB,CAACp5B,MAAMiI,OAAOJ,KAAU7H,MAE/B,aAAc22C,EAAMmO,aAE5Dp4C,CACT,CA9JgCF,EAgJK4sB,GAhJf7sB,EAgJPs4C,GAhJwCjlD,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EAgKxK,IAAI1C,EAAS+6C,EAAqBjlD,UA6JlC,OA3JAkK,EAAOs4C,sBAAwB,SAA+BC,GAC5D,IAAI1yC,EAAc3P,KAAKK,MACnBkI,EAAQoH,EAAYpH,MACpBg6C,EAAY5yC,EAAY4yC,UACxBD,EAAO3yC,EAAY2yC,KACnByC,GAAmBx8C,EAAMqoC,eAAexb,UACxC4vB,EAAkBz8C,IAAU85C,EAAU95C,OAAS+5C,IAASD,EAAUC,MAAQC,IAAcF,EAAUE,WAAaJ,EAAuBE,EAAU9/C,UAAW8/C,EAAU95C,MAAMolC,WAAa0U,EAAUjH,eAGtM,OAAO2J,GAAmBC,CAC5B,EAeAl7C,EAAO+E,kBAAoB,WACzB,IAAItM,EAAYvC,KAAKK,MAAMkC,UACvB6xC,EAAS7xC,EAAU6qC,YAEvB,GAAK7qC,EAAUq4C,eAAiBxG,IAAWp0C,KAAKK,MAAMkI,MAAMolC,SAA5D,CAIA,IAAI6U,EAAYxiD,KAAKilD,WAAWvQ,QAEhC,GAAK8N,EAAL,CAKA,IAEIE,EAFA5H,EAAetB,EAAMuB,gBAAgByH,GACrC9H,EAAiBjB,EAAkBqB,GAGvC,GAAIA,IAAiBG,OAAQ,CAC3B,IAAI0H,EAAeV,EAAmBO,IAGtCE,EAFiBC,EAAa3H,EAAI2H,EAAavhD,OAC1B8gD,IAAwB9gD,QAG3B,GAChB65C,OAAOC,SAASR,EAAel2B,EAAGk2B,EAAeM,EAAI0H,EAzLzC,GA2LhB,KAAO,CACJhJ,EAAc8I,IAA2GpnC,GAAU,GACpI,IAAI8pC,EAAgB1C,GAGpBE,EAFkBwC,EAActC,aAAesC,EAAcrC,WAC1C/H,EAAa8H,aAAelI,EAAeM,IAG5C,GAChBzB,EAAO4B,OAAOL,EAAcvB,EAAOuJ,OAAOhI,GAAgB4H,EAnM9C,GAqMhB,CAzBA,CAPA,CAiCF,EAEA54C,EAAO2F,OAAS,WACd,IAAIF,EAASvP,KAET0+C,EAAe1+C,KAAKK,MACpBkI,EAAQm2C,EAAan2C,MACrBsF,EAAiB6wC,EAAa7wC,eAC9BvF,EAAkBo2C,EAAap2C,gBAC/BW,EAAey1C,EAAaz1C,aAC5Be,EAAe00C,EAAa10C,aAC5BG,EAAYu0C,EAAav0C,UACzBgyC,EAAYuC,EAAavC,UACzB73C,EAAco6C,EAAap6C,YAC3B+E,EAAgBq1C,EAAar1C,cAC7BsE,EAAiB+wC,EAAa/wC,eAC9B40C,EAAY7D,EAAa6D,UACzBnH,EAAiBsD,EAAatD,eAC9B74C,EAAYm8C,EAAan8C,UACzB+/C,EAAO5D,EAAa4D,KACpBliD,EAAW,KAEXmI,EAAMnI,SAAS+L,OACjB/L,EAAWmI,EAAMnI,SAASsD,QAAO,SAAUyhD,EAAKxlD,GAC9C,IAAI+2C,EAAYoL,EAAewB,OAAO3jD,EAAK,EAAG,GAC1CylD,EAAQp7C,EAAatH,eAAe/C,GACpC+kD,EAAeL,EAAsBe,EAAO98C,GAC5CmD,EAAYi5C,EAAaJ,iBAAmBO,EAE5CQ,EAAwBpB,EAAqBmB,EAAOv3C,GACpDu2C,EAAUiB,EAAsBjB,QAChCD,EAAkBkB,EAAsBlB,gBAExCQ,EAAeF,EAAsBW,EAAOjJ,EAAWzF,EAAWztC,EAAcy7C,EAAc,MAE9FY,EAAa3pB,EAAc,CAAC,EAAGpsB,EAAOlP,MAAO,CAC/CiiD,KAAMh+C,EAAYihD,aAAa5lD,GAC/B6lD,WAAYd,EAAaH,YACzB7N,UAAWA,EACXnuC,MAAO68C,IAKT,OAFAD,EAAIphD,KAAK4yC,EAAMK,cAAcoN,EAASO,EAAchO,EAAMK,cAAcvrC,EAAW65C,MAE9EnB,GAlOoB,SAAoC57C,EAAOyB,GAC1E,IAAIy7C,EAAiBl9C,EAAMwoC,oBAC3B,QAAO0U,GAAiBz7C,EAAatH,eAAe+iD,GAAgBjhD,YAAc+D,EAAM/D,SAC1F,CA+NgCkhD,CAA2BN,EAAOp7C,IA7N9B,SAAuCm6C,EAAiBC,EAASniC,GACnG,IAAI0jC,EAAkB,GAElBje,GAA4B,EAC5BC,GAAoB,EACpBC,OAAiBl/B,EAErB,IACE,IAAK,IAAoDoT,EAAhDlD,EAAYqJ,EAAMxK,UAAUzC,OAAOC,cAAsByyB,GAA6B5rB,EAAQlD,EAAU1J,QAAQuG,MAAOiyB,GAA4B,EAAM,CAChK,IAAIke,EAAU9pC,EAAM1K,MAEpB,GAAIw0C,EAAQ1kD,OAASkjD,EACnB,MAGFuB,EAAgB5hD,KAAK6hD,EACvB,CAEF,CAAE,MAAOnpB,GACPkL,GAAoB,EACpBC,EAAiBnL,CACnB,CAAE,QACA,IACOiL,GAAoD,MAAvB9uB,EAAkB,QAClDA,EAAkB,QAEtB,CAAE,QACA,GAAI+uB,EACF,MAAMC,CAEV,CACF,CAEA3lB,EAAMmF,OAAOnF,EAAM7b,QAAQu/C,EAAgB,IAAKA,EAAgBxmD,OAAS,GACzE,IAAI0mD,EAAaF,EAAgBluC,UAC7B9X,EAAMkmD,EAAW,GAAGlmD,IACxBsiB,EAAMle,KAAK4yC,EAAMmP,aAAa3B,EAAiB,CAC7CxkD,IAAK,GAAGsI,OAAOtI,EAAK,SACpB,kBAAmBmiD,EAAewB,OAAO3jD,EAAK,EAAG,IAChDkmD,GAEL,CA2LQE,CAA8B5B,EAAiBC,EAASe,GAN/CA,CAQX,GAAG,KAGL,IAAI5Q,EAAWhsC,EAAMolC,SACjB+I,EAAYoL,EAAewB,OAAO/O,EAAU,EAAG,GAC/CmQ,EAAeL,EAAsB97C,EAAOD,GAC5CmD,EAAYi5C,EAAaJ,gBACzB9B,EAAyB,MAAb/2C,EAAoBkrC,EAAMK,cAAcvrC,EAAWpM,EAAS,CAAC,EAAGW,KAAKK,MAAO,CAC1FiiD,KAAMh+C,EAAYihD,aAAahR,GAC/BiR,WAAYd,EAAaH,YACzB7N,UAAWA,EACXnuC,MAAOA,KACHouC,EAAMK,cAAcgN,EAAiB,CACzCz7C,MAAOA,EACPnI,SAAUA,EACV4J,aAAcA,EACdX,cAAeA,EACfsE,eAAgBA,EAChBxD,UAAWA,EACXo4C,UAAWA,EACXnH,eAAgBA,EAChB6H,aAAcd,EAAuB5/C,EAAWgyC,GAChDhyC,UAAWA,EACX+/C,KAAMA,IAGR,GAAI/5C,EAAMsoC,eACR,OAAO2R,EAGT,IACI4B,EADyBH,EAAqB17C,EAAOsF,GACpBu2C,QAEjCO,EAAeF,EAAsBl8C,EAAO4zC,EAAWzF,EAAWztC,EAAcy7C,EAAc1kD,KAAKilD,YAEvG,OAAOtO,EAAMK,cAAcoN,EAASO,EAAcnC,EACpD,EAEOqC,CACT,CA/KwC,CA+KtClO,EAAMlrC,WAERqF,EAAOC,QAAU8zC,C,qCC3UjB,IAAIvP,EAAc,EAAQ,OAEtB1K,EAAgB,EAAQ,OAExBkX,EAAiB,EAAQ,MAEzBh+C,EAAc,EAAQ,OAEtBkiD,EAAO,EAAQ,OAEfrR,EAAY,EAAQ,OAEpBsR,EAAe,EAAQ,OAEvBC,EAA8B,EAAQ,OAEtCC,EAA0B,EAAQ,OAElCC,EAA2B,EAAQ,MAEnCtR,EAAa,EAAQ,OAErB6E,EAAOhF,EAAUU,UAAU,MAoB3BgR,GAAW,EACXC,GAAiB,EACjBC,EAAc,KASlB,IAAIvN,EAAgC,CAKlCkH,mBAAoB,SAA4BvzC,GAC9C25C,GAAiB,EAbrB,SAA0B35C,GACnB45C,IACHA,EAAc,IAAIjR,EAAY4Q,EAA4Bv5C,KAC9C8O,OAEhB,CASI+qC,CAAiB75C,EACnB,EAgBAszC,iBAAkB,SAA0BtzC,GAC1C05C,GAAW,EACXC,GAAiB,EACjBG,YAAW,WACJJ,GACHrN,EAA8B0N,mBAAmB/5C,EAErD,GAlDgB,GAmDlB,EACAo0C,SAAUkF,EAOVtF,UAAW,SAAmBh0C,EAAQ9N,GACpC,IAAKynD,EASH,OAJAtN,EAA8B0N,mBAAmB/5C,QAEjDA,EAAOywC,WAAWv+C,GAKhBA,EAAE8nD,QAAUX,EAAKY,OAAS/nD,EAAE8nD,QAAUX,EAAKa,MAC7ChoD,EAAEkC,gBAEN,EAQA6/C,WAAY,SAAoBkG,EAASjoD,GACnCA,EAAE8nD,QAAUX,EAAKe,QACnBloD,EAAEkC,gBAEN,EAiBA2lD,mBAAoB,SAA4B/5C,GAC9C,IAAI25C,EAAJ,CAIA,IAAI9Q,EAAYV,EAAWyR,GAAarQ,wBACxCqQ,EAAc,KACdF,GAAW,EACX,IAAI/hD,EAAcR,EAAYgL,IAAInC,EAAO0tC,mBAAoB,CAC3D2M,mBAAmB,IAIrB,GAFAr6C,EAAOsvC,kBAEFzG,EAAUrpC,KAAf,CAqBA,IAAInC,EAAe1F,EAAYhC,oBAC/BkzC,EAAUnuC,SAAQ,SAAU4/C,EAAevQ,GACzC,IAAIwQ,EAAwBpF,EAAeqF,OAAOzQ,GAC9CnC,EAAW2S,EAAsB3S,SACjCvG,EAAekZ,EAAsBlZ,aACrCoZ,EAAUF,EAAsBE,QAEhCC,EAAwB/iD,EAAYihD,aAAahR,GAAU3e,MAAM,CAACoY,EAAc,SAAUoZ,IAC1F3rC,EAAQ4rC,EAAsB5rC,MAC9BnH,EAAM+yC,EAAsB/yC,IAE5BgzC,EAAmBhjD,EAAY9B,eAAea,MAAM,CACtDkkD,UAAWhT,EACXiT,SAAUjT,EACVtxC,aAAcwY,EACdvY,YAAaoR,EACbmzC,YAAY,IAEVxe,EAAYmd,EAAyBp8C,EAAcs9C,GACnDI,EAAe19C,EAAatH,eAAe6xC,GAAUrE,iBAAiBz0B,GAC1EzR,EAAe4gC,EAAc+c,YAAY39C,EAAcs9C,EAAkBL,EAAeS,EAAcze,GAGtG3kC,EAAcR,EAAYgL,IAAIxK,EAAa,CACzCjC,eAAgB2H,GAEpB,IAIA,IACI49C,EADoBzB,EAAwB7hD,EAAa4hD,EAA4Bv5C,IACpC2+B,eACrD3+B,EAAOk7C,mBAMP,IAAIC,EAAkCnO,EAAO71C,EAAYs3C,eAAe92C,EAAasjD,GAAgC9jD,EAAYikD,gBAAgBzjD,EAAasjD,GAC9Jj7C,EAAO+S,OAAO5b,EAAYC,KAAK+jD,EAAiC99C,EAAc,qBAzD9E,MAFE2C,EAAO+S,OAAOpb,EAXhB,CAuEF,GAEFwM,EAAOC,QAAUioC,C,qCCtNjB,IAAIL,EAAU,EAAQ,OAEtB,SAASt5C,IAAqQ,OAAxPA,EAAWs5C,GAAW,SAAUn5C,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAAUH,EAASU,MAAMC,KAAMZ,UAAY,CAEtT,SAASu8B,EAAcn8B,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAO67B,EAAUh8B,OAAO6G,KAAKzG,GAAqD,oBAAjCJ,OAAOq0B,wBAAwC2H,EAAUA,EAAQrzB,OAAO3I,OAAOq0B,sBAAsBj0B,GAAQwC,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyB/7B,EAAQ87B,GAAKE,UAAY,MAAOJ,EAAQj0B,SAAQ,SAAU1H,GAAOi8B,EAAgBp8B,EAAQG,EAAKD,EAAOC,GAAO,GAAI,CAAE,OAAOH,CAAQ,CAEhe,SAASo8B,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAIhN,IAAI2rC,EAAmB,EAAQ,OAE3BmK,EAAiB,EAAQ,MAEzBnL,EAAQ,EAAQ,OAEhBC,EAAK,EAAQ,OAEboR,EAAc,EAAQ,OAEtBlT,EAAa,EAAQ,OAQrBmT,EAAqB,SAA4B/mD,EAAMqtB,EAAO25B,EAAkB3F,GAClF,OAAO3L,EAAG,CACR,6CAAuD,wBAAT11C,EAC9C,2CAAqD,sBAATA,EAC5C,iCAAkCgnD,EAClC,kCAA6C,IAAV35B,EACnC,kCAA6C,IAAVA,EACnC,kCAA6C,IAAVA,EACnC,kCAA6C,IAAVA,EACnC,kCAAmCA,GAAS,EAC5C,mCAAkD,QAAdg0B,EACpC,mCAAkD,QAAdA,GAExC,EAYItJ,EAAmC,SAAU7f,GA7CjD,IAAwB7sB,EAAUC,EAgDhC,SAASysC,IACP,OAAO7f,EAAiBr5B,MAAMC,KAAMZ,YAAcY,IACpD,CAlDgCwM,EA8CI4sB,GA9Cd7sB,EA8CP0sC,GA9CwCr5C,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EAoDxK,IAAI1C,EAASmvC,EAAoBr5C,UAmLjC,OAjLAkK,EAAOs4C,sBAAwB,SAA+BC,GAC5D,IAAI8F,EAAkBnoD,KAAKK,MAAMiE,YAC7BT,EAAkBw+C,EAAU/9C,YAIhC,GAHuB6jD,EAAgBC,oBAChBvkD,EAAgBukD,kBAGrC,OAAO,EAMT,GAHmBD,EAAgB3lD,eAAeo4C,gBAChC/2C,EAAgBrB,eAAeo4C,cAG/C,OAAO,EAGT,IAAIyN,EAAoBxkD,EAAgBykD,6BACpCC,EAAeJ,EAAgBlK,sBAC/BuK,EAAe3kD,EAAgBo6C,sBAGnC,GAAIkK,IAAoBtkD,GAAyC,OAAtBwkD,GAA8BxkD,EAAgBvB,sBAAwB+lD,GAAqBE,GAAgBC,EACpJ,OAAO,EAGT,IAAIC,EAAcN,EAAgB7lD,oBAC9BomD,EAAc7kD,EAAgBvB,oBAC9BqmD,EAAgBR,EAAgB/4C,eAChCw5C,EAAgB/kD,EAAgBuL,eACpC,OAAOm5C,IAAiBC,GAAgBC,IAAgBC,GAAeC,IAAkBC,GAAiB/kD,EAAgBglD,oBAC5H,EAEA/+C,EAAO2F,OAAS,WAqBd,IApBA,IAAIE,EAAc3P,KAAKK,MACnBwN,EAAiB8B,EAAY9B,eAC7BvF,EAAkBqH,EAAYrH,gBAC9BW,EAAe0G,EAAY1G,aAC3B0E,EAAiBgC,EAAYhC,eAC7BtE,EAAgBsG,EAAYtG,cAC5B/E,EAAcqL,EAAYrL,YAC1B63C,EAAYxsC,EAAYwsC,UACxBwC,EAAgBhvC,EAAYgvC,cAC5BC,EAAqBjvC,EAAYivC,mBACjCj7C,EAAUW,EAAYhC,oBACtBC,EAAY+B,EAAY9B,eACxB44C,EAAiB92C,EAAYukD,qBAC7B1+C,EAAY7F,EAAY8K,eACxB05C,EAAehU,EAAWxwC,EAAY8jD,mBACtCW,EAAgBplD,EAAQiiC,mBACxBojB,EAAkB,GAClBr6B,EAAe,KACfs6B,EAAsB,KAEjBr1C,EAAK,EAAGA,EAAKm1C,EAAc5pD,OAAQyU,IAAM,CAChD,IAAIs1C,EAASH,EAAcn1C,GAEvBjU,EAAMupD,EAAOvb,SAEbtpC,EAAY6kD,EAAO1kD,UAEnBkiC,EAAiBp+B,EAAgB4gD,GACjC5E,OAAkB,EAClBC,OAAc,EACdC,OAAiB,EAEjB9d,IACF4d,EAAkB5d,EAAe39B,UACjCw7C,EAAc7d,EAAermC,MAC7BmkD,EAAiB9d,EAAene,UAGlC,IAAIg6B,EAAY3D,GAA0CkK,EAAaj+C,IAAIlL,GACvE+2C,EAAYoL,EAAewB,OAAO3jD,EAAK,EAAG,GAC1CwpD,EAAiB,CACnBn/C,aAAcrG,EACd4E,MAAO2gD,EACP1D,WAAYjB,EACZt7C,aAAcA,EACd0E,eAAgBA,EAChBtE,cAAeA,EACfc,UAAWA,EACXo4C,UAAWA,EACXnH,eAAgBA,EAChB1E,UAAWA,EACXiI,cAAeA,EACfp8C,UAAWA,EACX+/C,KAAMh+C,EAAYihD,aAAa5lD,IAE7BukD,EAAgBr2C,EAAehD,IAAIxG,IAAcwJ,EAAehD,IAAI,YACpEs5C,EAAkBD,EAAcnN,QAChCqN,EAAUF,EAAcn0C,SAAWlC,EAAehD,IAAI,YAAYkF,QAElEwe,EAAQ26B,EAAOjiB,WAEfmiB,EAAa,GAQjB,GANIngD,IACFmgD,EAAangD,EAAaigD,IAKZ,OAAZ9E,EAEFgF,EAAapB,EAAYoB,EAAYnB,EAAmB5jD,EAAWkqB,EAD5C06B,IAAwB9E,GAAoC,OAAjBx1B,GAAyBJ,EAAQI,EACP4zB,IAG9F,IAAI92C,EAAY64C,GAAmB3M,EAC/B2N,EAAa,CACf7kD,UAAW2oD,EACX,cAAc,EACd,cAAejN,EACf,kBAAmBzF,EACnB/2C,IAAKA,QAGgB+I,IAAnB87C,IACFc,EAAa3pB,EAAc,CAAC,EAAG2pB,EAAY,CACzCzF,gBAAiB2E,EACjBlD,gCAAgC,KAIpC,IAAI8D,EAAQzO,EAAMK,cAAcoN,EAASkB,EAIzC3O,EAAMK,cAAcvrC,EAAWpM,EAAS,CAAC,EAAG8pD,EAAgB,CAC1DxpD,IAAKA,MAEPqpD,EAAgBjlD,KAAK,CACnBwE,MAAO68C,EACPjB,gBAAiBA,EACjBxkD,IAAKA,EACL+2C,UAAWA,IAIX/nB,EADEw1B,EACa+E,EAAOjiB,WAEP,KAGjBgiB,EAAsB9E,CACxB,CAKA,IAFA,IAAIkF,EAAe,GAEVC,EAAM,EAAGA,EAAMN,EAAgB7pD,QAAS,CAC/C,IAAIoqD,EAAOP,EAAgBM,GAE3B,GAAIC,EAAKpF,gBAAiB,CACxB,IAAIxe,EAAS,GAEb,GACEA,EAAO5hC,KAAKilD,EAAgBM,GAAK/gD,OACjC+gD,UACOA,EAAMN,EAAgB7pD,QAAU6pD,EAAgBM,GAAKnF,kBAAoBoF,EAAKpF,iBAEvF,IAAIqF,EAAiB7S,EAAMmP,aAAayD,EAAKpF,gBAAiB,CAC5DxkD,IAAK4pD,EAAK5pD,IAAM,QAChB,kBAAmB4pD,EAAK7S,WACvB/Q,GACH0jB,EAAatlD,KAAKylD,EACpB,MACEH,EAAatlD,KAAKwlD,EAAKhhD,OACvB+gD,GAEJ,CAEA,OAAO3S,EAAMK,cAAc,MAAO,CAChC,gBAAiB,QAChBqS,EACL,EAEOpQ,CACT,CA3LuC,CA2LrCtC,EAAMlrC,WAERqF,EAAOC,QAAUkoC,C,qCCnPjB,IAEIhO,EAFM,EAAQ,MAEgBH,CAAI,2BACtCh6B,EAAOC,QAAwC,EAA9Bk6B,EAAsC,MAAqD,M,qCCG5G,IAAI0N,EAAU,EAAQ,OAEtB,SAASt5C,IAAqQ,OAAxPA,EAAWs5C,GAAW,SAAUn5C,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAAUH,EAASU,MAAMC,KAAMZ,UAAY,CAItT,IAAIylD,EAAuB,EAAQ,OAE/B/C,EAAiB,EAAQ,MAEzBnL,EAAQ,EAAQ,OAEhB7B,EAAa,EAAQ,OAWrB2U,EAA+C,SAAUrwB,GAnB7D,IAAwB7sB,EAAUC,EAsBhC,SAASi9C,IACP,OAAOrwB,EAAiBr5B,MAAMC,KAAMZ,YAAcY,IACpD,CAxBgCwM,EAoBgB4sB,GApB1B7sB,EAoBPk9C,GApBwC7pD,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EA0BxK,IAAI1C,EAAS2/C,EAAgC7pD,UAwH7C,OAtHAkK,EAAOs4C,sBAAwB,SAA+BC,GAC5D,IAAI8F,EAAkBnoD,KAAKK,MAAMiE,YAC7BT,EAAkBw+C,EAAU/9C,YAIhC,GAHuB6jD,EAAgBC,oBAChBvkD,EAAgBukD,kBAGrC,OAAO,EAMT,GAHmBD,EAAgB3lD,eAAeo4C,gBAChC/2C,EAAgBrB,eAAeo4C,cAG/C,OAAO,EAGT,IAAIyN,EAAoBxkD,EAAgBykD,6BACpCC,EAAeJ,EAAgBlK,sBAC/BuK,EAAe3kD,EAAgBo6C,sBAGnC,GAAIkK,IAAoBtkD,GAAyC,OAAtBwkD,GAA8BxkD,EAAgBvB,sBAAwB+lD,GAAqBE,GAAgBC,EACpJ,OAAO,EAGT,IAAIC,EAAcN,EAAgB7lD,oBAC9BomD,EAAc7kD,EAAgBvB,oBAC9BqmD,EAAgBR,EAAgB/4C,eAChCw5C,EAAgB/kD,EAAgBuL,eACpC,OAAOm5C,IAAiBC,GAAgBC,IAAgBC,GAAeC,IAAkBC,GAAiB/kD,EAAgBglD,oBAC5H,EAEA/+C,EAAO2F,OAAS,WAoBd,IAnBA,IAAIE,EAAc3P,KAAKK,MACnBwN,EAAiB8B,EAAY9B,eAC7BvF,EAAkBqH,EAAYrH,gBAC9BW,EAAe0G,EAAY1G,aAC3B0E,EAAiBgC,EAAYhC,eAC7BtE,EAAgBsG,EAAYtG,cAC5B/E,EAAcqL,EAAYrL,YAC1B63C,EAAYxsC,EAAYwsC,UACxByC,EAAqBjvC,EAAYivC,mBACjCj7C,EAAUW,EAAYhC,oBACtBC,EAAY+B,EAAY9B,eACxB44C,EAAiB92C,EAAYukD,qBAC7B1+C,EAAY7F,EAAY8K,eACxB05C,EAAehU,EAAWxwC,EAAY8jD,mBAGtCY,EAAkB,GAClBU,EAHgB/lD,EAAQiiC,mBACE,GAIvB8jB,GAAW,CAChB,IAAInV,EAAWmV,EAAU/b,SACrB6X,EAAa,CACf33C,eAAgBA,EAChBvF,gBAAiBA,EACjBW,aAAcA,EACde,aAAcrG,EACd0F,cAAeA,EACfsE,eAAgBA,EAChBxD,UAAWA,EACXgyC,UAAWA,EACX73C,YAAaA,EACb82C,eAAgBA,EAChB74C,UAAWA,EACXgG,MAAOmhD,EACPnH,UAAW3D,GAA0CkK,EAAaj+C,IAAI0pC,GACtE+N,KAAMh+C,EAAYihD,aAAahR,IAG7B4P,GADgBt2C,EAAehD,IAAI6+C,EAAUllD,YAAcqJ,EAAehD,IAAI,aAC9CksC,QACpCiS,EAAgBjlD,KAAK,CAInBwE,MAAOouC,EAAMK,cAAc6N,EAAsBxlD,EAAS,CACxDM,IAAK40C,GACJiR,IACHrB,gBAAiBA,EACjBxkD,IAAK40C,EACLmC,UAAWoL,EAAewB,OAAO/O,EAAU,EAAG,KAEhD,IAAIoV,EAAeD,EAAU3Y,oBAC7B2Y,EAAYC,EAAehmD,EAAQjB,eAAeinD,GAAgB,IACpE,CAKA,IAFA,IAAIN,EAAe,GAEVz1C,EAAK,EAAGA,EAAKo1C,EAAgB7pD,QAAS,CAC7C,IAAIoqD,EAAOP,EAAgBp1C,GAE3B,GAAI21C,EAAKpF,gBAAiB,CACxB,IAAIxe,EAAS,GAEb,GACEA,EAAO5hC,KAAKilD,EAAgBp1C,GAAIrL,OAChCqL,UACOA,EAAKo1C,EAAgB7pD,QAAU6pD,EAAgBp1C,GAAIuwC,kBAAoBoF,EAAKpF,iBAErF,IAAIqF,EAAiB7S,EAAMmP,aAAayD,EAAKpF,gBAAiB,CAC5DxkD,IAAK4pD,EAAK5pD,IAAM,QAChB,kBAAmB4pD,EAAK7S,WACvB/Q,GACH0jB,EAAatlD,KAAKylD,EACpB,MACEH,EAAatlD,KAAKwlD,EAAKhhD,OACvBqL,GAEJ,CAEA,OAAO+iC,EAAMK,cAAc,MAAO,CAChC,gBAAiB,QAChBqS,EACL,EAEOI,CACT,CAhImD,CAgIjD9S,EAAMlrC,WAERqF,EAAOC,QAAU04C,C,qCC3JjB,IAAI9Q,EAAU,EAAQ,OAEtB,SAASt5C,IAAqQ,OAAxPA,EAAWs5C,GAAW,SAAUn5C,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAAUH,EAASU,MAAMC,KAAMZ,UAAY,CAItT,IAAI0iD,EAAiB,EAAQ,MAEzBnL,EAAQ,EAAQ,OAEhBoL,EAAc,EAAQ,OAEtBC,EAAuB,EAAQ,OAE/B4H,EAA0C,SAAUxwB,GAVxD,IAAwB7sB,EAAUC,EAahC,SAASo9C,IACP,OAAOxwB,EAAiBr5B,MAAMC,KAAMZ,YAAcY,IACpD,CAiCA,OAhDgCwM,EAWW4sB,GAXrB7sB,EAWPq9C,GAXwChqD,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EAiB3Jo9C,EAA2BhqD,UAEjC6P,OAAS,WACd,IAAIE,EAAc3P,KAAKK,MACnBkI,EAAQoH,EAAYpH,MACpBnI,EAAWuP,EAAYvP,SACvB4J,EAAe2F,EAAY3F,aAC3BG,EAAYwF,EAAYxF,UACxB6jC,EAAer+B,EAAYq+B,aAC3BuU,EAAY5yC,EAAY4yC,UACxBW,EAAUvzC,EAAYuzC,QACtB7yC,EAAOV,EAAYU,KACnBkkC,EAAWhsC,EAAMolC,SACjBwV,EAAmBD,EAAQr4C,IAAI,UAC/B24C,EAAqBr5C,EAAUE,mBAAmB2jC,GAClDyV,EAAiBt5C,EAAUK,eAAewjC,GAC1C0V,EAAqB5B,EAAewB,OAAO/O,EAAUxE,SAAS/B,EAAc,IAAK,GACjF2V,EAAgBtzC,EAAKvF,MAAMq4C,EAAiBztB,QAAQ7qB,IAAI,SAAUs4C,EAAiBtyC,OAAOhG,IAAI,QAG9F+4C,EAAM5B,EAAqB6B,sBAAsB9B,EAAY+B,aAAaH,GAAgBpB,GAC9F,OAAO5L,EAAMK,cAAcwM,EAAoBnkD,EAAS,CAAC,EAAGokD,EAAgB,CAC1Ez5C,aAAcA,EACd25C,cAAeA,EACfC,IAAKA,EACLjkD,IAAK+jD,EACLza,UAAW1gC,EAAM4nC,YAAY+S,EAAQr4C,IAAI,UACzC6rC,UAAWgN,IACTtjD,EACN,EAEOwpD,CACT,CAvC8C,CAuC5CjT,EAAMlrC,WAERqF,EAAOC,QAAU64C,C,qCC1DjB,IAAIC,EAAe,EAAQ,OAEvBjf,EAAgB,EAAQ,OAExB9mC,EAAc,EAAQ,OAEtB8wC,EAAwB,EAAQ,OAEhCkV,EAA6B,EAAQ,OAErCC,EAA0B,EAAQ,KAElCC,EAA2B,EAAQ,OAEnCnV,EAAmB,EAAQ,OAE3BoV,EAAiB,EAAQ,OAEzBnV,EAAa,EAAQ,OAkCzB,IAAIoE,EAAyB,CAI3BiH,UAAW,SAAmBxzC,GAC5BA,EAAOsvC,kBACPiO,EAAQv9C,EACV,EAKA6zC,OAAQ,SAAgB7zC,EAAQ9N,GAC9B,IAAI2lC,EAAO,IAAIqlB,EAAahrD,EAAEsrD,YAAYC,cACtC9lD,EAAcqI,EAAO0tC,mBACrBgQ,EA3CR,SAA8BvpD,EAAOwD,GACnC,IAAIma,EAAO,KACPrU,EAAS,KACTkgD,EAAsBR,EAA2BhpD,EAAMypD,eAK3D,GAAuD,oBAA5CD,EAAoBE,oBAAoC,CAIjE,IAAIC,EAAYH,EAAoBE,oBAAoB1pD,EAAM0jB,EAAG1jB,EAAMk6C,GACvEv8B,EAAOgsC,EAAUC,eACjBtgD,EAASqgD,EAAUtW,WACrB,KAAO,KAAIrzC,EAAM6pD,YAIf,OAAO,KAHPlsC,EAAO3d,EAAM6pD,YACbvgD,EAAStJ,EAAM8pD,WAGjB,CAEAnsC,EAAOq2B,EAAWr2B,GAClBrU,EAAS0qC,EAAW1qC,GACpB,IAAIssC,EAAY5B,EAAWF,EAAsBn2B,IACjD,OAAOurC,EAAyB1lD,EAAaoyC,EAAWtsC,EAAQssC,EAAWtsC,EAC7E,CAiBwBygD,CAAqBhsD,EAAEsrD,YAAa7lD,GAKxD,GAJAzF,EAAEkC,iBACF4L,EAAOqvC,WAAa,EACpBrvC,EAAOsvC,kBAEc,MAAjBoO,EAAJ,CAIA,IAAIS,EAAQtmB,EAAKumB,WAEjB,GAAID,EAAM3rD,OAAS,EAAnB,CACE,GAAIwN,EAAOtM,MAAM2qD,oBAAsBf,EAAet9C,EAAOtM,MAAM2qD,mBAAmBX,EAAeS,IACnG,OAOFf,EAAwBe,GAAO,SAAUG,GACvCA,GAAYt+C,EAAO+S,OAAOwrC,EAAsB5mD,EAAa+lD,EAAeY,GAC9E,GAEF,KAbA,CAeA,IAAIE,EAAWx+C,EAAOy+C,cAAgB,WAAa,WAE/Cz+C,EAAOtM,MAAMgrD,YAAcpB,EAAet9C,EAAOtM,MAAMgrD,WAAWhB,EAAe7lB,EAAM2mB,MAChFx+C,EAAOy+C,cAChBz+C,EAAO+S,OA2Bb,SAAkBpb,EAAamnC,GAC7B,IAAI6f,EAAkB1gB,EAAc2gB,SAASjnD,EAAYhC,oBAAqBgC,EAAY9B,eAAgBipC,GAC1G,OAAO3nC,EAAYC,KAAKO,EAAagnD,EAAiB,kBACxD,CA9BoBC,CAASjnD,EAAa+lD,IAEpC19C,EAAO+S,OAAOwrC,EAAsB5mD,EAAa+lD,EAAe7lB,EAAKt6B,aAGvEggD,EAAQv9C,EAXR,CAjBA,CA6BF,GAGF,SAASu9C,EAAQv9C,GACfA,EAAOy+C,eAAgB,EAKvB,IAAIvQ,EAAaluC,EAAO6tC,gBAExB,GAAIK,EAAY,CACd,IAAI2Q,EAAe,IAAIC,WAAW,UAAW,CAC3CC,KAAM7W,EAAiBgG,GACvB8Q,SAAS,EACTC,YAAY,IAEd/Q,EAAWgR,cAAcL,EAC3B,CACF,CAWA,SAASN,EAAsB5mD,EAAa/B,EAAW8N,GACrD,IAAIi7C,EAAkB1gB,EAAckhB,WAAWxnD,EAAYhC,oBAAqBC,EAAW8N,EAAM/L,EAAYvC,yBAC7G,OAAO+B,EAAYC,KAAKO,EAAagnD,EAAiB,kBACxD,CAEAx6C,EAAOC,QAAUmoC,C,qCC1IjB,IAAIvE,EAAY,EAAQ,OAEpBoL,EAAgB,EAAQ,OAExBC,EAAS,EAAQ,OAEjBE,EAAqB,EAAQ,OAE7B1E,EAAS,EAAQ,MAEjBD,EAAQ,EAAQ,OAEhB+E,EAAa,EAAQ,OAErBC,EAAc,EAAQ,OAEtBE,EAAU,EAAQ,OAElBC,EAAU,EAAQ,MAElBC,EAAY,EAAQ,OAEpBrF,EAAU,EAAQ,OAElByF,EAAW,EAAQ,OAEnBgL,EAAWpX,EAAUU,UAAU,UAC/B2W,EAAYrX,EAAUU,UAAU,WAChC4W,EAAmBF,GAAYC,EAAYjL,EAAW,SAAUliD,GAAI,EACpEs6C,EAAyB,CAC3B4G,cAAeA,EACfC,OAAQA,EACRE,mBAAoBA,EACpB1E,OAAQA,EACRD,MAAOA,EACP+E,WAAYA,EACZC,YAAaA,EACbE,QAASA,EACTC,QAASA,EACTC,UAAWA,EACXrF,QAASA,EACTyF,SAAUA,EAKVD,UAAWmL,EACXpL,QAASoL,GAEXn7C,EAAOC,QAAUooC,C,qCCjDjB,IAEIC,EAFgB,EAAQ,OAEQ8S,yBACpCp7C,EAAOC,QAAUqoC,C,qCCHjB,IAAIT,EAAU,EAAQ,OAQtB,IAAIwT,EAAsB,EAAQ,OAE9BxV,EAAQ,EAAQ,OAEhBv7B,EAAY,EAAQ,OAEpBgxC,EAAkB,EAAQ,OAE1BC,EAA0B,iCAW1BxK,EAA+B,SAAUzoB,GAvB7C,IAAwB7sB,EAAUC,EA0BhC,SAASq1C,IAGP,IAFA,IAAIn1C,EAzBiBV,EAAKrM,EAAKyR,EA2BtB5H,EAAOpK,UAAUD,OAAQ0I,EAAO,IAAI5I,MAAMuK,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC/E5B,EAAK4B,GAAQrK,UAAUqK,GAOzB,OAJAiD,EAAQ0sB,EAAiBt5B,KAAKC,MAAMq5B,EAAkB,CAACp5B,MAAMiI,OAAOJ,KAAU7H,KA/BzDgM,EAJzB,SAAgC6sC,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIC,eAAe,6DAAgE,OAAOD,CAAM,CAqCjJD,CAAuBlsC,GAjCR0E,OAiCwB,GAjC7BzR,EAiCqB,UAjCIqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAmChL1E,CACT,CAtCgCF,EAwBA4sB,GAxBV7sB,EAwBPs1C,GAxBwCjiD,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EAwCxK,IAAI1C,EAAS+3C,EAAgBjiD,UAoG7B,OAlGAkK,EAAOwiD,cAAgB,WACrB,IAAI/pD,EAAYvC,KAAKK,MAAMkC,UAE3B,GAAiB,MAAbA,GAAsBA,EAAUq4C,cAApC,CAIA,IAAIjrC,EAAc3P,KAAKK,MACnBkI,EAAQoH,EAAYpH,MACpBkT,EAAQ9L,EAAY8L,MACpBpL,EAAOV,EAAYU,KACnBkkC,EAAWhsC,EAAMolC,SACjBr5B,EAAMmH,EAAQpL,EAAKlR,OAEvB,GAAKoD,EAAUgqD,cAAchY,EAAU94B,EAAOnH,GAA9C,CAOA,IAAImK,EAAOze,KAAKwuC,KACf/vB,GAAkFrD,GAAU,GAC7F,IAEIoxC,EAFApH,EAAQ3mC,EAAKg8B,WAChB2K,GAAoFhqC,GAAU,GAG3FgqC,EAAM5mC,WAAas3B,KAAK2W,UAC1BD,EAAapH,EACJgH,EAAgBhH,GACzBoH,EAAa/tC,GAEb+tC,EAAapH,EAAM3K,aAC4Er/B,GAAU,GAG3GixC,EAAwB9pD,EAAWiqD,EAAYjY,EAAU94B,EAAOnH,EApBhE,CAXA,CAgCF,EAEAxK,EAAOs4C,sBAAwB,SAA+BC,GAC5D,IAAIqK,EAAW1sD,KAAKwuC,KAGpB,OAFCke,GAA0FtxC,GAAU,GAClFsxC,EAASjW,cAAgB4L,EAAUhyC,MAAQgyC,EAAUja,WAAapoC,KAAKK,MAAM+nC,UAAYia,EAAUjH,cAExH,EAEAtxC,EAAOkF,mBAAqB,WAC1BhP,KAAKssD,eACP,EAEAxiD,EAAO+E,kBAAoB,WACzB7O,KAAKssD,eACP,EAEAxiD,EAAO2F,OAAS,WACd,IAAIF,EAASvP,KAETuI,EAAQvI,KAAKK,MAAMkI,MACnB8H,EAAOrQ,KAAKK,MAAMgQ,KAKlBA,EAAKjI,SAAS,OAASpI,KAAKK,MAAMkjD,SACpClzC,GAAQ,MAGV,IAAIquC,EAAe1+C,KAAKK,MACpBsN,EAAiB+wC,EAAa/wC,eAC9BtE,EAAgBq1C,EAAar1C,cAC7BqtC,EAAYgI,EAAahI,UACzBtO,EAAWsW,EAAatW,SACxBukB,EAAWvkB,EAAS1kC,QAAO,SAAU8H,EAAKy1B,GAC5C,IAAI2rB,EAAe,CAAC,EAChBzqD,EAAQwL,EAAeszB,GAO3B,YALcv4B,IAAVvG,GAAuBqJ,EAAIgsC,iBAAmBr1C,EAAMq1C,iBAEtDoV,EAAapV,eAAiB,CAAChsC,EAAIgsC,eAAgBr1C,EAAMq1C,gBAAgBruC,KAAK,KAAKg9B,QAG9EwS,EAAQntC,EAAKrJ,EAAOyqD,EAC7B,GAAG,CAAC,GAEJ,GAAIvjD,EAAe,CACjB,IAAIwjD,EAAYxjD,EAAc++B,EAAU7/B,GACxCokD,EAAWhU,EAAQgU,EAAUE,EAC/B,CAEA,OAAOlW,EAAMK,cAAc,OAAQ,CACjC,kBAAmBN,EACnB5mC,IAAK,SAAa5P,GAChB,OAAOqP,EAAOi/B,KAAOtuC,CACvB,EACAiC,MAAOwqD,GACNhW,EAAMK,cAAcmV,EAAqB,KAAM97C,GACpD,EAEOwxC,CACT,CAtHmC,CAsHjClL,EAAMlrC,WAERqF,EAAOC,QAAU8wC,C,qCC9IjB,IAAI+H,EAA6B,EAAQ,OAErC/H,EAAkB,EAAQ,OAE1BC,EAAiB,EAAQ,MAEzB/W,EAAY,EAAQ,OAEpB4L,EAAQ,EAAQ,OAEhBC,EAAK,EAAQ,OAIboN,GAFOjZ,EAAU5/B,KAEc,SAAUiuB,GAhB7C,IAAwB7sB,EAAUC,EAmBhC,SAASw3C,IACP,OAAO5qB,EAAiBr5B,MAAMC,KAAMZ,YAAcY,IACpD,CAoEA,OAzFgCwM,EAiBA4sB,GAjBV7sB,EAiBPy3C,GAjBwCpkD,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EAuB3Jw3C,EAAgBpkD,UAEtB6P,OAAS,WACd,IAAIE,EAAc3P,KAAKK,MACnBkI,EAAQoH,EAAYpH,MACpByB,EAAe2F,EAAY3F,aAC3BX,EAAgBsG,EAAYtG,cAC5BsE,EAAiBgC,EAAYhC,eAC7BxD,EAAYwF,EAAYxF,UACxBo4C,EAAY5yC,EAAY4yC,UACxBnH,EAAiBzrC,EAAYyrC,eAC7B6H,EAAetzC,EAAYszC,aAC3B1gD,EAAYoN,EAAYpN,UACxB+/C,EAAO3yC,EAAY2yC,KACnB/N,EAAWhsC,EAAMolC,SACjBt9B,EAAO9H,EAAM2B,UACb84C,EAAcV,EAAKn2C,KAAO,EAC1B/L,EAAWJ,KAAKK,MAAMD,UAAYkiD,EAAK92C,KAAI,SAAU03C,EAAStvC,GAChE,IAAIo6B,EAAekV,EAAQr4C,IAAI,gBAC3Bs4C,EAAmBD,EAAQr4C,IAAI,UAC/Bu4C,EAAWD,EAAiBh3C,KAAO,EACnC2gD,EAAS3J,EAAiB33C,KAAI,SAAUgjC,EAAM6U,GAChD,IAAI3M,EAAYoL,EAAewB,OAAO/O,EAAU3gC,EAAIyvC,GAChD5nC,EAAQ+yB,EAAK3jC,IAAI,SACjByJ,EAAMk6B,EAAK3jC,IAAI,OACnB,OAAO8rC,EAAMK,cAAc6K,EAAiB,CAC1CliD,IAAK+2C,EACLA,UAAWA,EACXnuC,MAAOA,EACPkT,MAAOA,EACPlZ,UAAW0gD,EAAe1gD,EAAY,KACtC64C,eAAgBA,EAChB/qC,KAAMA,EAAKvF,MAAM2Q,EAAOnH,GACxB8zB,SAAU7/B,EAAM2nC,iBAAiBz0B,GACjC9N,eAAgBA,EAChBtE,cAAeA,EACfk6C,OAAQvV,IAAiBgV,GAAeK,IAAOD,GAEnD,IAAG5rC,UAEH,OAAKw2B,GAAiB7jC,EAIfwsC,EAAMK,cAAc4S,EAA4B,CACrDrhD,MAAOA,EACPnI,SAAU0sD,EACV9iD,aAAcA,EACdG,UAAWA,EACX6jC,aAAcA,EACduU,UAAWA,EACXW,QAASA,EACT7yC,KAAMA,EACN1Q,IAAKiU,IAZEk5C,CAcX,IAAGt1C,UACH,OAAOm/B,EAAMK,cAAc,MAAO,CAChC,kBAAmB8K,EAAewB,OAAO/O,EAAU,EAAG,GACtD9zC,UAAWm2C,EAAG,CACZ,kCAAkC,EAClC,+BAA8C,QAAd2L,EAChC,+BAA8C,QAAdA,KAEjCniD,EACL,EAEO4jD,CACT,CA1EmC,CA0EjCrN,EAAMlrC,YAERqF,EAAOC,QAAUizC,C,qCC7FjB,IAAIrN,EAAQ,EAAQ,OAEhBC,EAAK,EAAQ,OAQbyC,EAAsC,SAAUjgB,GAZpD,IAAwB7sB,EAAUC,EAehC,SAAS6sC,IACP,OAAOjgB,EAAiBr5B,MAAMC,KAAMZ,YAAcY,IACpD,CAjBgCwM,EAaO4sB,GAbjB7sB,EAaP8sC,GAbwCz5C,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EAmBxK,IAAI1C,EAASuvC,EAAuBz5C,UAwBpC,OAtBAkK,EAAOs4C,sBAAwB,SAA+BC,GAC5D,OAAOriD,KAAKK,MAAMgQ,OAASgyC,EAAUhyC,MAAQrQ,KAAKK,MAAMiE,YAAY9B,eAAeo4C,gBAAkByH,EAAU/9C,YAAY9B,eAAeo4C,aAC5I,EAEA9wC,EAAO2F,OAAS,WACd,IAAIs9C,EAAW/sD,KAAKK,MAAMiE,YAAY9B,eAAeo4C,cACjDn6C,EAAYm2C,EAAG,CACjB,sCAAsC,EACtC,yCAA0CmW,IAK5C,OAAOpW,EAAMK,cAAc,MAAO,CAChCv2C,UAAWA,GACVk2C,EAAMK,cAAc,MAAO,CAC5Bv2C,UAAWm2C,EAAG,uCACdoW,GAAIhtD,KAAKK,MAAMg+C,gBACfl8C,MARiB,CACjBk/C,WAAY,aAQXrhD,KAAKK,MAAMgQ,MAChB,EAEOgpC,CACT,CAhC0C,CAgCxC1C,EAAMlrC,WAERqF,EAAOC,QAAUsoC,C,qCC9CjB,SAAST,EAAuBC,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIC,eAAe,6DAAgE,OAAOD,CAAM,CAIrK,SAASjd,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAEhN,IAAI2qC,EAAQ,EAAQ,OAEhBhC,EAAY,EAAQ,OAEpBv5B,EAAY,EAAQ,OAEpB6xC,EAAY,EAAQ,OAIpBC,EAAiBvY,EAAUU,UAAU,YAqBzC,IA+BI8W,EAAmC,SAAU/yB,GAlEjD,IAAwB7sB,EAAUC,EAqEhC,SAAS2/C,EAAoB9rD,GAC3B,IAAIqM,EAUJ,OALAkvB,EAAgBgd,EAHhBlsC,EAAQ0sB,EAAiBt5B,KAAKE,KAAMK,IAAUL,MAGC,kBAAc,GAE7D47B,EAAgBgd,EAAuBlsC,GAAQ,aAAS,GAExDA,EAAMygD,YAAa,EACZzgD,CACT,CAjFgCF,EAmEI4sB,GAnEd7sB,EAmEP4/C,GAnEwCvsD,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EAmFxK,IAAI1C,EAASqiD,EAAoBvsD,UA2CjC,OAzCAkK,EAAOs4C,sBAAwB,SAA+BC,GAC5D,IAAI5jC,EAAOze,KAAKyiD,MACZ2K,EAAyC,KAAvB/K,EAAUjiD,SAC/B6sD,EAAUxuC,IAA6FrD,GAAU,GAClH,IAAIiyC,EAAc5uC,EAElB,OAAI2uC,GAxER,SAAmB3uC,GACjB,OAAOyuC,EAAsC,OAArBzuC,EAAKg4B,YAAwC,OAAjBh4B,EAAK6uC,OAC3D,CAuEcC,CAAUF,GAGbA,EAAY5W,cAAgB4L,EAAUjiD,QAC/C,EAEA0J,EAAO+E,kBAAoB,WACzB7O,KAAKmtD,YAAcntD,KAAKmtD,UAC1B,EAEArjD,EAAOkF,mBAAqB,WAC1BhP,KAAKmtD,YAAcntD,KAAKmtD,UAC1B,EAEArjD,EAAO2F,OAAS,WACd,IAxE+BK,EAwE3BP,EAASvP,KAEb,MAA4B,KAAxBA,KAAKK,MAAMD,SACNJ,KAAKmtD,YA3EiBr9C,EA2EM,SAAUA,GAC3C,OAAOP,EAAOkzC,MAAQ3yC,CACxB,EA5EGo9C,EAAiBvW,EAAMK,cAAc,OAAQ,CAClDr3C,IAAK,IACL,YAAa,OACbmQ,IAAKA,GACJ,MAAQ6mC,EAAMK,cAAc,KAAM,CACnCr3C,IAAK,IACL,YAAa,OACbmQ,IAAKA,KAIO,SAAmBA,GACjC,OAAOo9C,EAAiBvW,EAAMK,cAAc,OAAQ,CAClDr3C,IAAK,IACL,YAAa,OACbmQ,IAAKA,GACJ,MAAQ6mC,EAAMK,cAAc,KAAM,CACnCr3C,IAAK,IACL,YAAa,OACbmQ,IAAKA,GAET,CAuDW09C,EAAU,SAAU19C,GACvB,OAAOP,EAAOkzC,MAAQ3yC,CACxB,IAGK6mC,EAAMK,cAAc,OAAQ,CACjCr3C,IAAKK,KAAKmtD,WAAa,IAAM,IAC7B,YAAa,OACbr9C,IAAK,SAAa5P,GAChB,OAAOqP,EAAOkzC,MAAQviD,CACxB,GACCF,KAAKK,MAAMD,SAChB,EAEO+rD,CACT,CA7DuC,CA6DrCxV,EAAMlrC,WAERqF,EAAOC,QAAUo7C,C,+BCtIjBr7C,EAAOC,QAAU,CACfywC,QAAS,WAAoB,EAC7BiM,2BAA4B,WAAuC,E,qCCPrE,SAAS7xB,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAYhN,IAAI4rC,EAAsB,EAAQ,MAE9B7M,EAAY,EAAQ,OAEpB3vB,EAAY,EAAQ,OAEpBsyC,EAAO,EAAQ,OAGfC,GAAY5/C,EADNg9B,EAAUh9B,OAEhB6/C,EAAcF,IAKlB,SAASG,EAAWC,EAAeC,GACjCx2B,QAAQC,KAAK,YAAcs2B,EAAgB,0CAA4CC,EAAgB,aACzG,CAeA,IAAI/c,EAAc,CAShBoB,wBAAyB,WAEvB,OADAyb,EAAW,sCAAuC,wCAC3C7c,EAAYqB,2BACrB,EAYA5jC,OAAQ,SAAgBvN,EAAMuxC,EAAYjO,GAExC,OADAqpB,EAAW,qBAAsB,6BAC1B7c,EAAY0B,SAASxxC,EAAMuxC,EAAYjO,EAChD,EASAh9B,IAAK,SAAa09B,GAEhB,OADA2oB,EAAW,kBAAmB,0BACvB7c,EAAYkC,MAAMhO,EAC3B,EAQAr6B,IAAK,SAAalL,GAEhB,OADAkuD,EAAW,kBAAmB,0BACvB7c,EAAYmC,MAAMxzC,EAC3B,EAKA0zC,SAAU,WACR,OAAOsa,CACT,EAKAna,mBAAoB,SAA4BD,GAC9Coa,EAAYpa,EACZqa,EAAcF,GAChB,EAUAM,UAAW,SAAmBruD,EAAKizC,GAEjC,OADAib,EAAW,wBAAyB,gCAC7B7c,EAAY6B,YAAYlzC,EAAKizC,EACtC,EAQAqb,YAAa,SAAqBtuD,EAAKozC,GAErC,OADA8a,EAAW,0BAA2B,kCAC/B7c,EAAYgC,cAAcrzC,EAAKozC,EACxC,EAUAV,0BAA2B,WACzB,OAAOub,CACT,EASAlb,SAAU,SAAkBxxC,EAAMuxC,EAAYjO,GAC5C,OAAOwM,EAAYkC,MAAM,IAAI0E,EAAoB,CAC/C12C,KAAMA,EACNuxC,WAAYA,EACZjO,KAAMA,GAAQ,CAAC,IAEnB,EAMA0O,MAAO,SAAehO,GAGpB,OAFA0oB,EAAcF,IACdC,EAAYA,EAAU7+C,IAAI8+C,EAAa1oB,GAChC0oB,CACT,EAKAza,MAAO,SAAexzC,GACpB,IAAIulC,EAAWyoB,EAAU9iD,IAAIlL,GAE7B,OADGulC,GAA2G9pB,GAAU,GACjH8pB,CACT,EAOA2N,YAAa,SAAqBlzC,EAAKizC,GACrC,IAAI1N,EAAW8L,EAAYmC,MAAMxzC,GAE7BozC,EA/LR,SAAuBvzC,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAO67B,EAAUh8B,OAAO6G,KAAKzG,GAAqD,oBAAjCJ,OAAOq0B,wBAAwC2H,EAAUA,EAAQrzB,OAAO3I,OAAOq0B,sBAAsBj0B,GAAQwC,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyB/7B,EAAQ87B,GAAKE,UAAY,MAAOJ,EAAQj0B,SAAQ,SAAU1H,GAAOi8B,EAAgBp8B,EAAQG,EAAKD,EAAOC,GAAO,GAAI,CAAE,OAAOH,CAAQ,CA+L9cm8B,CAAc,CAAC,EAAGuJ,EAAST,UAAWmO,GAEhDsb,EAAchpB,EAASp2B,IAAI,OAAQikC,GAEvC,OADA4a,EAAYA,EAAU7+C,IAAInP,EAAKuuD,GACxBA,CACT,EAKAlb,cAAe,SAAuBrzC,EAAKozC,GACzC,IAEImb,EAFWld,EAAYmC,MAAMxzC,GAENmP,IAAI,OAAQikC,GAEvC,OADA4a,EAAYA,EAAU7+C,IAAInP,EAAKuuD,GACxBA,CACT,GAEFp9C,EAAOC,QAAUigC,C,oCCpMjB,IAoBI4G,EAAmC,SAAUuW,GAtBjD,IAAwB5hD,EAAUC,EAyBhC,SAASorC,IACP,OAAOuW,EAAsBpuD,MAAMC,KAAMZ,YAAcY,IACzD,CA3BgCwM,EAuBI2hD,GAvBd5hD,EAuBPqrC,GAvBwCh4C,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EA6BxK,IAAI1C,EAAS8tC,EAAoBh4C,UAcjC,OAZAkK,EAAOtF,QAAU,WACf,OAAOxE,KAAK6K,IAAI,OAClB,EAEAf,EAAOskD,cAAgB,WACrB,OAAOpuD,KAAK6K,IAAI,aAClB,EAEAf,EAAO26B,QAAU,WACf,OAAOzkC,KAAK6K,IAAI,OAClB,EAEO+sC,CACT,CAtBuC,EAjBP9nB,EAHhB,EAAQ,OAEDA,QACgB,CACrC5uB,KAAM,QACNuxC,WAAY,YACZjO,KAAMllC,UAsCRwR,EAAOC,QAAU6mC,C,iCCsCjB9mC,EAAOC,QA9DmB,CACxBs9C,gBAAiB,SAAyBC,EAAgBC,EAAcl+C,EAAMm+C,EAAajM,GACzF,IAAIkM,EAAWp+C,EAAK3F,MAAM,KAC1B+jD,EAAWA,EAASjjD,KAAI,SAExBkjD,EAEA96C,GACE,GAAkB,YAAd2uC,GACF,GAAI3uC,EAAK,EACP,MAAO,IAAM86C,OAEV,GAAI96C,EAAK66C,EAAStvD,OAAS,EAChC,OAAOuvD,EAAU,IAGnB,OAAOA,CACT,IAOA,IANA,IACIC,EADAC,EAAeJ,EAGfK,EAAe,KACfC,EAAa,KAERzL,EAAK,EAAGA,EAAKoL,EAAStvD,OAAQkkD,IAAM,CAI3C,GAAIiL,GAFJK,EAAaC,EADHH,EAASpL,GACiBlkD,SAEDyvD,EAAeL,EAC3B,OAAjBM,IAGFA,EAAeD,GAFfE,EAAaH,OAKV,GAAqB,OAAjBE,EACT,MAGFD,EAAeD,CACjB,CAEA,IAAII,EAAYP,EAAcn+C,EAAKlR,OAC/B6vD,EAAUH,IAAiBL,EAC3BS,EAAQH,IAAeC,EAY3B,QAVKC,GAAWC,GAASD,IAAYC,KACjB,YAAd1M,EACEuM,IAAeC,GACjBD,IAEOD,IAAiBL,GAC1BK,KAIG,CACLpzC,MAAOozC,EACPv6C,IAAKw6C,EAET,E,iCCtFFh+C,EAAOC,QAAU,CACfm+C,yBAA0B,WACxB,OAAO,IACT,EACAC,yBAA0B,WACxB,OAAO,IACT,E,qCCHF,IAAI1kB,EAAoB,EAAQ,OAE5BqJ,EAA0B,EAAQ,OAElCsb,EAA4B,EAAQ,OAEpCC,EAA2B,EAAQ,OAEnCC,EAA0B,EAAQ,OAElCvkB,EAAY,EAAQ,OAEpBwkB,EAAiC,EAAQ,OAEzCC,EAA6B,EAAQ,MAErCp0C,EAAY,EAAQ,OAEpBq0C,EAA6B,EAAQ,MAErCC,EAAwB,EAAQ,OAEhCC,EAA8B,EAAQ,OAEtCC,EAA2B,EAAQ,OAEnC79B,EAAagZ,EAAUhZ,WAYvB6Y,EAAgB,CAClB+c,YAAa,SAAqB39C,EAAc6lD,EAAgBx/C,EAAM0jC,EAAa9K,GACjF,IAAI6mB,EAAkBJ,EAAsB1lD,EAAc6lD,GACtDE,EAAcJ,EAA4BG,EAAiBD,GAC3DxkB,EAAYZ,EAAkBh8B,OAAO,CACvCtM,MAAO4xC,GAAehiB,IACtBuS,OAAQ2E,GAAa,OAEvB,OAAOumB,EAA2BO,EAAaA,EAAYrkB,oBAAqBr7B,EAAMg7B,EACxF,EACAygB,WAAY,SAAoB9hD,EAAcgjC,EAAa38B,EAAM0jC,EAAa9K,GAE5E,OADC+D,EAAYgjB,eAA+H50C,GAAU,GAC/IwvB,EAAc+c,YAAY39C,EAAcgjC,EAAa38B,EAAM0jC,EAAa9K,EACjF,EACAsiB,SAAU,SAAkBvhD,EAAcimD,EAAcjjB,GACtD,IAAIkjB,EAAgBZ,EAAwBtlD,EAAcimD,GACtD1kB,EAAeX,EAAcY,YAAYxhC,EAAcimD,EAAc,YACzE,OAAOrlB,EAAc8B,oBAAoBnB,EAAcyB,EAAakjB,EACtE,EACAxjB,oBAAqB,SAA6B1iC,EAAcgjC,EAAaT,GAC3E,IAAI4jB,EAAiB/wD,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAK,wBACrF0wD,EAAkBJ,EAAsB1lD,EAAcgjC,GACtD+iB,EAAcJ,EAA4BG,EAAiB9iB,GAC/D,OAAOuiB,EAA+BQ,EAAaA,EAAYrkB,oBAAqBa,EAAU4jB,EAChG,EACA3kB,YAAa,SAAqBxhC,EAAcomD,EAAeC,GAC7D,IAAInc,EAAUE,EAAQkc,EAAYC,EAE9BH,EAAcrtD,kBAChBqtD,EAAgBA,EAAc/sD,MAAM,CAClCkkD,UAAW6I,EAAcztD,cACzBM,aAAcmtD,EAAcI,iBAC5BhJ,SAAU4I,EAAcvtD,eACxBK,YAAaktD,EAAcK,kBAC3BhJ,YAAY,KAIhBvT,EAAWkc,EAAcvtD,eACzBuxC,EAASgc,EAAcztD,cACvB2tD,EAAatmD,EAAatH,eAAewxC,GACzCqc,EAAWvmD,EAAatH,eAAe0xC,GACvC,IAAID,EAAcic,EAAc7iB,iBAC5B8G,EAAY+b,EAAc5iB,eAC1BkjB,EAAiBJ,EAAWngB,YAAYgE,GACxCwc,EAAeJ,EAASpgB,YAAYkE,EAAY,GAGpD,GAAIH,IAAaE,GACXsc,GAAkBA,IAAmBC,EAAc,CACrD,IAAIC,EAAuBvB,EAAyBrlD,EAAaynC,eAAgB6e,EAAYC,EAAUH,EAAeC,GACtH,OAAOV,EAA4B3lD,EAAc4mD,EACnD,CAGF,IAAId,EAAkBJ,EAAsB1lD,EAAcomD,GAC1D,OAAOT,EAA4BG,EAAiBM,EACtD,EACAxkB,WAAY,SAAoB5hC,EAAcshC,GAC5C,IAAIwkB,EAAkBJ,EAAsB1lD,EAAcshC,GACtDykB,EAAcJ,EAA4BG,EAAiBxkB,GAC/D,OAAOskB,EAAyBG,EAAaA,EAAYrkB,oBAC3D,EACAloC,iBAAkB,SAA0BwG,EAAcshC,EAAgByI,GACxE,OAAOD,EAAwBtsC,IAAIwC,EAAcshC,EAAgByI,EACnE,EACAnwC,kBAAmB,SAA2BoG,EAAcshC,EAAgByI,GAC1E,OAAOD,EAAwBt0B,OAAOxV,EAAcshC,EAAgByI,EACtE,EACAhI,aAAc,SAAsB/hC,EAAcshC,EAAgBjnC,GAChE,OAAOorD,EAA2BzlD,EAAcshC,GAAgB,SAAU/iC,GACxE,OAAOA,EAAMlF,MAAM,CACjBnC,KAAMmD,EACNkqB,MAAO,GAEX,GACF,EACAsiC,aAAc,SAAsB7mD,EAAcshC,EAAgBwlB,GAChE,OAAOrB,EAA2BzlD,EAAcshC,GAAgB,SAAU/iC,GACxE,OAAOA,EAAMlF,MAAM,CACjBmhC,KAAMssB,GAEV,GACF,EACAX,eAAgB,SAAwBnmD,EAAcshC,EAAgBwlB,GACpE,OAAOrB,EAA2BzlD,EAAcshC,GAAgB,SAAU/iC,GACxE,OAAOA,EAAMlF,MAAM,CACjBmhC,KAAMj8B,EAAMk8B,UAAUphC,MAAMytD,IAEhC,GACF,EACA5hB,YAAa,SAAqBllC,EAAcshC,EAAgBrC,GAC9D,IAAI6mB,EAAkBJ,EAAsB1lD,EAAcshC,GAC1D,OAAO8jB,EAA0BU,EAAiBxkB,EAAgBrC,EACpE,GAEFn4B,EAAOC,QAAU65B,C,gCCtIjB,IAAImmB,EAAgB,IAChBjP,EAAiB,CACnBwB,OAAQ,SAAgB/O,EAAUvG,EAAcoZ,GAC9C,OAAO7S,EAAWwc,EAAgB/iB,EAAe+iB,EAAgB3J,CACnE,EACAD,OAAQ,SAAgBzQ,GAEtB,IAAIsa,EAAwBta,EAAUhsC,MAAMqmD,GAAet5C,UACvD2vC,EAAU4J,EAAsB,GAChChjB,EAAegjB,EAAsB,GAGzC,MAAO,CAELzc,SAJkByc,EAAsBlmD,MAAM,GAItB2M,UAAUtO,KAAK4nD,GACvC/iB,aAAc+B,SAAS/B,EAAc,IACrCoZ,QAASrX,SAASqX,EAAS,IAE/B,GAEFt2C,EAAOC,QAAU+wC,C,qCClBjB,SAASlmB,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAEhN,IAAI0+B,EAAe,EAAQ,OAEvBC,EAAmB,EAAQ,OAE3BsmB,EAAiC,EAAQ,OAEzCpmB,EAAoB,EAAQ,MAE5BqmB,EAAsB,EAAQ,OAE9BpmB,EAAM,EAAQ,OAEdC,EAAY,EAAQ,OAEpBmG,EAAoB,EAAQ,OAE5B/lC,EAAO4/B,EAAU5/B,KACjB6P,EAAS+vB,EAAU/vB,OACnBiwB,EAA8BH,EAAI,2BAClCI,EAAqBD,EAA8BN,EAAmBD,EACtEymB,EAAsB,CACxBC,YAAa,SAAqBC,EAAMxjD,GACtC,OAAOojD,EAA+BI,EAAMH,EAAqBrjD,EACnE,EACAyjD,YAAa,SAAqBC,EAAYlmB,EAAWnqC,GACvD,OAAOqwD,EAAW7tD,QAAO,SAAUyhD,EAAKqM,EAAU7mD,GAChD6mD,EAAWtgB,EAAkBsgB,GAC7B,IAAI7xD,EAAMkrC,IACN4mB,EAAkB,CACpB9xD,IAAKA,EACLuB,KAAMA,EACNmP,KAAMmhD,EACNtlB,cAAe/gC,EAAK6P,EAAOqwB,EAAWmmB,EAASryD,UAGjD,GAAI8rC,GAAyC,IAAVtgC,EAAa,CAC9C,IAAI+mD,EAAmB/mD,EAAQ,EAK/B8mD,EA7CR,SAAuBjyD,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAO67B,EAAUh8B,OAAO6G,KAAKzG,GAAqD,oBAAjCJ,OAAOq0B,wBAAwC2H,EAAUA,EAAQrzB,OAAO3I,OAAOq0B,sBAAsBj0B,GAAQwC,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyB/7B,EAAQ87B,GAAKE,UAAY,MAAOJ,EAAQj0B,SAAQ,SAAU1H,GAAOi8B,EAAgBp8B,EAAQG,EAAKD,EAAOC,GAAO,GAAI,CAAE,OAAOH,CAAQ,CA6Ctcm8B,CAAc,CAAC,EAAG81B,EAAiB,CACnDplB,aAJkB8Y,EAAIuM,GAAoBvM,EAAIuM,GAAkBruD,MAAM,CACtE+oC,YAAazsC,KAGcguC,UAE/B,CAGA,OADAwX,EAAIphD,KAAK,IAAImnC,EAAmBumB,IACzBtM,CACT,GAAG,GACL,GAEFr0C,EAAOC,QAAUogD,C,qCCvDjB,IAOIQ,EAAkB,kBAGlBC,EAA6B,cAVd,EAAQ,OAEIC,iBAU3BC,EAAe,IAAIC,OADH,OAAcH,EAAd,QAA0DD,EAAkB,OAASC,EAArF,aAAsIA,EAA6B,OAGnLI,EAAkB,IAAID,OADH,SAAWH,EAAX,SAAwDD,EAAkB,OAASC,EAAnF,UAAiIA,EAAjI,OAGvB,SAASK,EAAiB5hD,EAAMo3C,GAC9B,IAAIyK,EAAUzK,EAAauK,EAAgBG,KAAK9hD,GAAQyhD,EAAaK,KAAK9hD,GAC1E,OAAO6hD,EAAUA,EAAQ,GAAK7hD,CAChC,CAEA,IAAI+hD,EAAqB,CACvBC,YAAa,SAAqBhiD,GAChC,OAAO4hD,EAAiB5hD,GAAM,EAChC,EACAiiD,WAAY,SAAoBjiD,GAC9B,OAAO4hD,EAAiB5hD,GAAM,EAChC,GAEFS,EAAOC,QAAUqhD,C,iCC7BjB,IAAIG,EAAiB,CACnBt6B,UAAW,SAAmBt4B,GAC5B,MAAO,IAAMohC,OAAOphC,EACtB,EACA6yD,YAAa,SAAqB7yD,GAChC,OAAOA,EAAImL,MAAM,EACnB,GAEFgG,EAAOC,QAAUwhD,C,qCClBjB,SAAS52B,EAAcn8B,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAO67B,EAAUh8B,OAAO6G,KAAKzG,GAAqD,oBAAjCJ,OAAOq0B,wBAAwC2H,EAAUA,EAAQrzB,OAAO3I,OAAOq0B,sBAAsBj0B,GAAQwC,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyB/7B,EAAQ87B,GAAKE,UAAY,MAAOJ,EAAQj0B,SAAQ,SAAU1H,GAAOi8B,EAAgBp8B,EAAQG,EAAKD,EAAOC,GAAO,GAAI,CAAE,OAAOH,CAAQ,CAEhe,SAASo8B,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAehN,IAAI6+B,EAAoB,EAAQ,MAE5BzvB,EAAY,EAAQ,OAepBq3C,EAAc,SAAqBlqD,GACrC,IAAMA,IAASA,EAAMrH,KACnB,OAAO,EAGT,IAAIA,EAAOqH,EAAMrH,KACjB,MAAgB,wBAATA,GAA2C,sBAATA,CAC3C,EAkBIwxD,EAAmB,CAIrBC,2BAA4B,SAAoCC,GAC9D,IAAIjtB,EAASitB,EAAejtB,OACxBktB,EAAoB,GAGxB,OAFC5zD,MAAMC,QAAQymC,IAA0FvqB,GAAU,GAE9Gnc,MAAMC,QAAQymC,IAAYA,EAAOxmC,QA/Cf,SAA8BwmC,EAAQ39B,GAG/D,IAFA,IAAIse,EAAQ,GAAGre,OAAO09B,GAAQluB,UAEvB6O,EAAMnnB,QAAQ,CACnB,IAAI+pD,EAAS5iC,EAAMd,MAEnBxd,EAAGkhD,GACH,IAAI9oD,EAAW8oD,EAAO9oD,SACrBnB,MAAMC,QAAQkB,IAAiGgb,GAAU,GAC1HkL,EAAQA,EAAMre,OAAO,GAAGA,OAAO7H,EAASqX,WAC1C,CACF,CAwCIq7C,CAAqBntB,GAAQ,SAAUp9B,GACrC,IAAIwqD,EAAWp3B,EAAc,CAAC,EAAGpzB,GAE7BkqD,EAAYlqD,KACdwqD,EAASxkC,MAAQwkC,EAASxkC,OAAS,EAjClB,SAA4BhmB,GAC/CtJ,MAAMC,QAAQqJ,EAAMnI,YACtBmI,EAAMnI,SAAWmI,EAAMnI,SAASoL,KAAI,SAAU45C,GAC5C,OAAOA,EAAMlkD,OAASqH,EAAMrH,KAAOy6B,EAAc,CAAC,EAAGypB,EAAO,CAC1D72B,OAAQhmB,EAAMgmB,OAAS,GAAK,IACzB62B,CACP,IAEJ,CA0BQ4N,CAAmBzqD,GAEG,MAAlBA,EAAMnI,UAAoBmI,EAAMnI,SAASjB,OAAS,YAKjD4zD,EAAS3yD,SAChByyD,EAAkB9uD,KAAKgvD,GACzB,IACAH,EAAejtB,OAASktB,EACjBl3B,EAAc,CAAC,EAAGi3B,EAAgB,CACvCjtB,OAAQktB,KApBDD,CAsBX,EAKAK,2BAA4B,SAAoCC,GAC9D,IAAIL,EAAoB,GACpBM,EAAc,GAyDlB,OAxDAD,EAAWvtB,OAAOt+B,SAAQ,SAAUkB,GAClC,IAAIme,EAAS+rC,EAAYlqD,GACrBgmB,EAAQhmB,EAAMgmB,OAAS,EAEvB6kC,EAAYz3B,EAAc,CAAC,EAAGpzB,EAAO,CACvCnI,SAAU,KAGZ,GAAKsmB,EAAL,CAKA,IAAI2sC,EAAaF,EAAY,GAE7B,GAAkB,MAAdE,GAAgC,IAAV9kC,EACxBskC,EAAkB9uD,KAAKqvD,QAClB,GAAkB,MAAdC,GAAsBA,EAAW9kC,MAAQA,EAAQ,EAAG,CAE7D,IAAI+kC,EAAY,CACd3zD,IAAKkrC,IACLx6B,KAAM,GACNke,MAAOA,EAAQ,EACfrtB,KAAMqH,EAAMrH,KACZd,SAAU,GACVmzD,aAAc,GACdC,kBAAmB,IAErBL,EAAYvrC,QAAQ0rC,GAEN,IAAV/kC,EAEFskC,EAAkB9uD,KAAKuvD,GACA,MAAdD,GAETA,EAAWjzD,SAAS2D,KAAKuvD,GAG3BA,EAAUlzD,SAAS2D,KAAKqvD,EAC1B,MAAO,GAAIC,EAAW9kC,QAAUA,EAAQ,EAEtC8kC,EAAWjzD,SAAS2D,KAAKqvD,OACpB,CAEL,KAAqB,MAAdC,GAAsBA,EAAW9kC,OAASA,GAC/C4kC,EAAY/vC,QACZiwC,EAAaF,EAAY,GAGvB5kC,EAAQ,EACV8kC,EAAWjzD,SAAS2D,KAAKqvD,GAEzBP,EAAkB9uD,KAAKqvD,EAE3B,CA3CA,MAFEP,EAAkB9uD,KAAKqvD,EA8C3B,IACOz3B,EAAc,CAAC,EAAGu3B,EAAY,CACnCvtB,OAAQktB,GAEZ,GAEF/hD,EAAOC,QAAU2hD,C,qCCnJH,EAAQ,OA6JtB5hD,EAAOC,QA3JmB,CAIxB0iD,aAAc,SAAsBlrD,EAAO+oC,GACzC,IAAI3xC,EAAM4I,EAAMolC,SAEZ+lB,EAAYnrD,EAAMsoC,eAEtB,GAAiB,MAAb6iB,IACWpiB,EAASzmC,IAAI6oD,GAEd9iB,eAAer0B,SAAS5c,GAElC,OAAO,EASX,IAJe4I,EAAMqoC,eAAeplC,KAAI,SAAU8J,GAChD,OAAOg8B,EAASzmC,IAAIyK,EACtB,IAEcqF,OAAM,SAAUqC,GAC5B,OAAOA,EAAE6zB,iBAAmBlxC,CAC9B,IAEE,OAAO,EAIT,IAAIg0D,EAAiBprD,EAAMuoC,oBAE3B,GAAsB,MAAlB6iB,GACgBriB,EAASzmC,IAAI8oD,GAEf5iB,sBAAwBpxC,EAEtC,OAAO,EAKX,IAAI8lD,EAAiBl9C,EAAMwoC,oBAE3B,GAAsB,MAAlB0U,GACgBnU,EAASzmC,IAAI46C,GAEf3U,sBAAwBnxC,EAEtC,OAAO,EAKX,OAAuB,OAAnB8lD,GAA8C,OAAnBkO,GACzBA,IAAmBlO,MAOP,IAAdl9C,EAAM8H,MACJ9H,EAAMqoC,eAAezkC,KAAO,EAOpC,EAQAynD,gBAAiB,SAAyBtiB,GAExC,IAAIuiB,EAAqBviB,EAAS95B,UAAUtV,QAAO,SAAUqG,GAC3D,OAA+B,MAAxBA,EAAMsoC,gBAAuD,MAA7BtoC,EAAMuoC,mBAC/C,IAEA,GAAkC,IAA9B+iB,EAAmB10D,OAErB,OAAO,EAQT,IALA,IACI20D,EAAY,EACZC,EAFYF,EAAmBzwC,QAERuqB,SACvBqmB,EAAe,GAEE,MAAdD,GAAoB,CACzB,IAAIE,EAAc3iB,EAASzmC,IAAIkpD,GAC3BG,EAAYD,EAAYrjB,eACxB6U,EAAiBwO,EAAYljB,oBAEjC,GAAImjB,EAAU/nD,KAAO,EAAG,CACA,MAAlBs5C,GACFuO,EAAapsC,QAAQ69B,GAGvB,IAII0O,EAJWD,EAAU1oD,KAAI,SAAU8J,GACrC,OAAOg8B,EAASzmC,IAAIyK,EACtB,IAE0B+e,MAAK,SAAU9rB,GACvC,OAAoC,MAA7BA,EAAMuoC,mBACf,IAEA,GAAkB,MAAdqjB,EAEF,OAAO,EAGTJ,EAAaI,EAAWxmB,QAC1B,MAEIomB,EADqC,MAAnCE,EAAYljB,oBACDkjB,EAAYljB,oBAEZijB,EAAa5wC,QAI9B0wC,GACF,CAEA,OAAIA,IAAcxiB,EAASnlC,IAM7B,EAKAioD,YAAa,SAAqB9iB,GAChC,IAAI5kC,EAAQ1M,KAIZ,QAFasxC,EAAS95B,UAEVmD,OAAM,SAAUpS,GAC1B,OAAOmE,EAAM+mD,aAAalrD,EAAO+oC,EACnC,KAIOtxC,KAAK4zD,gBAAgBtiB,EAC9B,E,oCC9JF,IAOI+iB,EAPAC,EAAqB,EAAQ,OAE7BvpB,EAAY,EAAQ,OAEpB+J,EAAa,EAAQ,OAErB/zB,EAAagqB,EAAUhqB,WAEvBwzC,EAAoB,CACtBnM,gBAAiB,SAAyBzkD,EAAS6wD,GAC5CH,EAGHA,EAAYI,QAFZJ,EAAc,IAAIC,EAKpB,IAAIhjB,EAAW3tC,EAAQ+tC,cACnBgjB,EAAWpjB,EAAS9gB,WAAWhlB,KAAI,SAAUjD,GAC/C,OAAOusC,EAAWuf,GAAavQ,aAAav7C,EAAM2B,UACpD,IACIyqD,EAAU5zC,EAAWuwB,EAAS7f,SAASuH,IAAI07B,IAE/C,OAAmB,MAAfF,GAAuBzpB,EAAU/wB,GAAGw6C,EAAaG,GAC5CH,EAGFG,CACT,GAEF7jD,EAAOC,QAAUwjD,C,qCC7BjB,SAAS54B,EAAcn8B,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAO67B,EAAUh8B,OAAO6G,KAAKzG,GAAqD,oBAAjCJ,OAAOq0B,wBAAwC2H,EAAUA,EAAQrzB,OAAO3I,OAAOq0B,sBAAsBj0B,GAAQwC,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyB/7B,EAAQ87B,GAAKE,UAAY,MAAOJ,EAAQj0B,SAAQ,SAAU1H,GAAOi8B,EAAgBp8B,EAAQG,EAAKD,EAAOC,GAAO,GAAI,CAAE,OAAOH,CAAQ,CAEhe,SAASo8B,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAEhN,IAAIkiC,EAAY,EAAQ,OAEpB19B,EAAe,EAAQ,OAEvB+jD,EAAoB,EAAQ,MAE5BtjB,EAAiB,EAAQ,OAEzBlG,EAAY,EAAQ,OAEpBhZ,EAAagZ,EAAUhZ,WACvBjC,EAASib,EAAUjb,OACnB6C,EAAQoY,EAAUpY,MAClB5R,EAAagqB,EAAUhqB,WACvB5V,EAAO4/B,EAAU5/B,KAmBjBypD,EAAoB9kC,EAfJ,CAClB+kC,WAAW,EACXxyD,eAAgB,KAChB8H,UAAW,KACX2+C,aAAc,KACd1N,gBAAgB,EAChB4L,mBAAmB,EACnB8N,oBAAqB,KACrBC,eAAgB,KAChBC,wBAAyB,KACzBC,UAAWtiC,IACXpwB,UAAW,KACX2yD,QAAS,KACTC,UAAWxiC,MAIT7uB,EAA2B,WAC7BA,EAAY8vC,YAAc,SAAqBzpC,GAC7C,OAAOnK,KAAKsQ,eAAe,GAAInG,EACjC,EAEArG,EAAYwM,eAAiB,SAAwBD,EAAMlG,GACzD,OAAOrG,EAAYyM,kBAAkBC,EAAaC,eAAeJ,GAAOlG,EAC1E,EAEArG,EAAYyM,kBAAoB,SAA2BvG,EAAcG,GACvE,GAA2C,IAAvCH,EAAa0nC,cAAcvvB,QAC7B,OAAOre,EAAY8vC,YAAYzpC,GAGjC,IAAIirD,EAAWprD,EAAa0nC,cAAchc,QAAQiY,SAClD,OAAO7pC,EAAY2K,OAAO,CACxBpM,eAAgB2H,EAChBmrD,UAAWxiC,IACXsiC,UAAWtiC,IACXxoB,UAAWA,GAAa,KACxB5H,UAAW0uC,EAAe2C,YAAYwhB,IAE1C,EAEAtxD,EAAY2K,OAAS,SAAgB0rB,GACnC,IAAI93B,EAAiB83B,EAAO93B,eAGxBgzD,EAAe15B,EAAc,CAAC,EAAGxB,EAAQ,CAC3C+6B,QAASI,EAAmBjzD,EAHd83B,EAAOhwB,WAIrB2+C,aAAcyL,EAAkBnM,gBAAgB/lD,KAGlD,OAAO,IAAIyB,EAAY,IAAI8wD,EAAkBS,GAC/C,EAEAvxD,EAAYyV,OAAS,SAAgB4gB,GACnC,OAAO,IAAIr2B,EAAY,IAAI8wD,EAAkBj5B,EAAc,CAAC,EAAGxB,EAAQ,CACrE2uB,aAAqC,MAAvB3uB,EAAO2uB,aAAuB/nC,EAAWoZ,EAAO2uB,cAAgB3uB,EAAO2uB,aACrFgM,oBAAmD,MAA9B36B,EAAO26B,oBAA8B/iC,EAAWoI,EAAO26B,qBAAuB36B,EAAO26B,oBAC1GE,wBAA2D,MAAlC76B,EAAO66B,wBAAkCxkD,EAAa+I,OAAO4gB,EAAO66B,yBAA2B76B,EAAO66B,wBAC/HC,UAA+B,MAApB96B,EAAO86B,UAAoBtiC,EAAMwH,EAAO86B,UAAUzpD,KAAI,SAAU+J,GACzE,OAAO/E,EAAa+I,OAAOhE,EAC7B,KAAM4kB,EAAO86B,UACb1yD,UAA+B,MAApB43B,EAAO53B,UAAoB,IAAI0uC,EAAe9W,EAAO53B,WAAa43B,EAAO53B,UACpF2yD,QAA2B,MAAlB/6B,EAAO+6B,QAAkBn0C,EAAWoZ,EAAO+6B,SAAS1pD,KAAI,SAAU+J,GACzE,OAAOpK,EAAKoK,GAAG/J,KAAI,SAAU+J,GAC3B,OAAO24B,EAAU30B,OAAOhE,EAC1B,GACF,IAAK4kB,EAAO+6B,QACZC,UAA+B,MAApBh7B,EAAOg7B,UAAoBxiC,EAAMwH,EAAOg7B,UAAU3pD,KAAI,SAAU+J,GACzE,OAAO/E,EAAa+I,OAAOhE,EAC7B,KAAM4kB,EAAOg7B,UACb9yD,eAAgBmO,EAAa+I,OAAO4gB,EAAO93B,mBAE/C,EAEAyB,EAAYgL,IAAM,SAAaxK,EAAaixD,GAuC1C,OAAO,IAAIzxD,EAtCDQ,EAAYkxD,eAAex2C,eAAc,SAAUpS,GAC3D,IAAI6oD,EAAoB7oD,EAAM/B,IAAI,aAC9BV,EAAYsrD,EAEM,OAAlBF,EAAIprD,UACNA,EAAY,KACHorD,EAAIprD,YACbA,EAAYorD,EAAIprD,WAGlB,IAAIwiC,EAAa4oB,EAAIlzD,gBAAkBiC,EAAYhC,oBAEnD,GAAI6H,IAAcsrD,EAAmB,CACnC,IACIC,EADAR,EAAUtoD,EAAM/B,IAAI,WAcxB,OAVE6qD,EADEvrD,GAAasrD,EAyYzB,SAAuC9xD,EAAS2tC,EAAUqkB,EAAiBxrD,EAAWsrD,GACpF,OAAOE,EAAgBtyD,MAAMiuC,EAASl7B,QAAQlU,QAAO,SAAUqG,GAC7D,OAAO4B,EAAUJ,eAAexB,EAAO5E,KAAa8xD,EAAkB1rD,eAAexB,EAAO5E,EAC9F,IAAG6H,KAAI,SAAUjD,GACf,OAAO2lC,EAAU3D,SAAS5mC,EAAS4E,EAAO4B,EAC5C,IACF,CA9YuByrD,CAA8BjpB,EAAYA,EAAW+E,cAAewjB,EAAS/qD,EAAWsrD,GAExFH,EAAmB3oB,EAAYxiC,QAG9CyC,EAAMvJ,MAAM,CACV8G,UAAWA,EACX+qD,QAASQ,EACTV,wBAAyB,MAG7B,CAIIroB,IAFkBroC,EAAYhC,qBAGhCsK,EAAMkC,IAAI,UAoWlB,SAAoCxK,EAAauxD,EAAaC,EAAc3rD,GAC1E,IAAIH,EAAe1F,EAAYhC,oBAAoBwM,IAAI,YAAagnD,GAChEC,EAAe/rD,EAAa0nC,cAC5BskB,EAAc1xD,EAAYkxD,eAAe3qD,IAAI,WACjD,OAAOmrD,EAAY3yD,MAAMwyD,EAAYz/C,QAAQlU,QAAO,SAAUqG,EAAO5I,GACnE,OAAO4I,IAAUwtD,EAAalrD,IAAIlL,EACpC,IAAG6L,KAAI,SAAUjD,GACf,OAAO2lC,EAAU3D,SAASvgC,EAAczB,EAAO4B,EACjD,IACF,CA7W6B8rD,CAA2B3xD,EAAaqoC,EAAW+E,cAAe/E,EAAW8E,eAAgBtnC,IAGpHyC,EAAMvJ,MAAMkyD,EACd,IAEF,EAEA,IAAIzrD,EAAShG,EAAYlE,UA4SzB,SAASkE,EAAYoyD,GACnBt6B,EAAgB57B,KAAM,kBAAc,GAEpCA,KAAKm2D,WAAaD,CACpB,CAUA,OAxTApsD,EAAO4B,KAAO,WACZ,OAAO1L,KAAKw1D,eAAe9pD,MAC7B,EAEA5B,EAAOssD,aAAe,WACpB,OAAOp2D,KAAKw1D,eAAe3qD,IAAI,YACjC,EAEAf,EAAOxH,kBAAoB,WACzB,OAAOtC,KAAKw1D,eAAe3qD,IAAI,iBACjC,EAEAf,EAAOusD,aAAe,WACpB,OAAOr2D,KAAKw1D,eAAe3qD,IAAI,YACjC,EAEAf,EAAOwsD,aAAe,WACpB,OAAOt2D,KAAKw1D,eAAe3qD,IAAI,YACjC,EAEAf,EAAOtH,aAAe,WACpB,OAAOxC,KAAKw1D,eAAe3qD,IAAI,YACjC,EAEAf,EAAOsF,aAAe,WACpB,OAAOpP,KAAKw1D,eAAe3qD,IAAI,YACjC,EAEAf,EAAOm0C,oBAAsB,WAC3B,OAAOj+C,KAAKw1D,eAAe3qD,IAAI,oBACjC,EAEAf,EAAO++C,mBAAqB,WAC1B,OAAO7oD,KAAKw1D,eAAe3qD,IAAI,iBACjC,EAEAf,EAAOw+C,2BAA6B,WAClC,OAAOtoD,KAAKw1D,eAAe3qD,IAAI,0BACjC,EAEAf,EAAOysD,kBAAoB,WACzB,OAAOv2D,KAAKw1D,eAAe3qD,IAAI,iBACjC,EAWAf,EAAO0sD,uBAAyB,WAC9B,OAAOx2D,KAAKw1D,eAAe3qD,IAAI,sBACjC,EAEA/G,EAAY2yD,uBAAyB,SAAgCnyD,EAAawwD,GAChF,OAAOhxD,EAAYgL,IAAIxK,EAAa,CAClCwwD,oBAAqBA,GAEzB,EAQAhrD,EAAO/H,sBAAwB,WAC7B,IAAI20D,EAAW12D,KAAKw2D,yBAEpB,GAAgB,MAAZE,EACF,OAAOA,EAGT,IAAI/yD,EAAU3D,KAAKsC,oBACfC,EAAYvC,KAAKwC,eAErB,OAAID,EAAUytD,cAkTlB,SAA6CrsD,EAASpB,GACpD,IAAI2xC,EAAW3xC,EAAUgC,cACrB4vC,EAAc5xC,EAAUgrC,iBACxB+iB,EAAa3sD,EAAQjB,eAAewxC,GAGxC,GAAIC,EAAc,EAChB,OAAOmc,EAAWpgB,iBAAiBiE,EAAc,GAKnD,GAAImc,EAAWntD,YACb,OAAOmtD,EAAWpgB,iBAAiB,GAIrC,OAAOymB,EAAyBhzD,EAASuwC,EAC3C,CAnUa0iB,CAAoCjzD,EAASpB,GAqU1D,SAAgDoB,EAASpB,GACvD,IAAI2xC,EAAW3xC,EAAUgC,cACrB4vC,EAAc5xC,EAAUgrC,iBACxB+iB,EAAa3sD,EAAQjB,eAAewxC,GAExC,GAAIC,EAAcmc,EAAWntD,YAC3B,OAAOmtD,EAAWpgB,iBAAiBiE,GAKrC,GAAIA,EAAc,EAChB,OAAOmc,EAAWpgB,iBAAiBiE,EAAc,GAInD,OAAOwiB,EAAyBhzD,EAASuwC,EAC3C,CAnVW2iB,CAAuClzD,EAASpB,EACzD,EAEAuH,EAAOy7C,aAAe,SAAsBhR,GAC1C,OAAOv0C,KAAKw1D,eAAe5/B,MAAM,CAAC,UAAW2e,GAC/C,EAEAzqC,EAAOgtD,4BAA8B,WACnC,IAAI1B,EAAWp1D,KAAKsC,oBAAoBovC,cAAchc,QAAQiY,SAC9D,OAAO3tC,KAAKwC,eAAe+pD,cAAc6I,EAAU,EAAG,EACxD,EAEAtrD,EAAOitD,0BAA4B,WACjC,IAEIlmD,EAFU7Q,KAAKsC,oBACIovC,cACH7gC,OAChByD,EAAMzD,EAAK1N,YACf,OAAOnD,KAAKwC,eAAe+pD,cAAc17C,EAAK88B,SAAUr5B,EAAKA,EAC/D,EAEAxK,EAAOs+C,gBAAkB,WACvB,OAAOpoD,KAAKw1D,eAAe3qD,IAAI,eACjC,EAWA/G,EAAYikD,gBAAkB,SAAyBzjD,EAAa/B,GAClE,OAAOy0D,EAAgB1yD,EAAa/B,GAAW,EACjD,EAeAuB,EAAYs3C,eAAiB,SAAwB92C,EAAa/B,GAKhE,OAJKA,EAAUq4C,gBACbr4C,EAAYA,EAAUuM,IAAI,YAAY,IAGjCkoD,EAAgB1yD,EAAa/B,GAAW,EACjD,EAMAuB,EAAYiL,mBAAqB,SAA4BzK,GAC3D,IACI2yD,EADU3yD,EAAYhC,oBACF2vC,eACpBilB,EAAUD,EAAUtpB,SACpBxuC,EAAS83D,EAAU9zD,YACvB,OAAOW,EAAYikD,gBAAgBzjD,EAAa,IAAI2sC,EAAe,CACjEsW,UAAW2P,EACXj0D,aAAc9D,EACdqoD,SAAU0P,EACVh0D,YAAa/D,EACbsoD,YAAY,IAEhB,EAQA3jD,EAAYqzD,eAAiB,SAAwB7yD,GACnD,IAAI8yD,EAAqBtzD,EAAYiL,mBAAmBzK,GACxD,OAAOR,EAAYs3C,eAAegc,EAAoBA,EAAmB50D,eAC3E,EAQAsB,EAAYC,KAAO,SAAcO,EAAa0F,EAAcqtD,GAC1D,IAAIjc,IAAiBh8C,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,KAAmBA,UAAU,GAEpF,GAAIkF,EAAYhC,sBAAwB0H,EACtC,OAAO1F,EAGT,IAAIwkD,EAAeyL,EAAkBnM,gBAAgBp+C,EAAc1F,EAAY8jD,mBAE/E,IAAK9jD,EAAY8xD,eACf,OAAOtyD,EAAYgL,IAAIxK,EAAa,CAClCjC,eAAgB2H,EAChB8+C,aAAcA,EACdiM,eAAgBsC,EAChB90D,UAAWyH,EAAa0hC,oBACxB0P,eAAgBA,EAChB0Z,oBAAqB,OAIzB,IAAIvyD,EAAY+B,EAAY9B,eACxBH,EAAiBiC,EAAYhC,oBAC7B6yD,EAAY7wD,EAAY+xD,eACxB1pB,EAAa3iC,EAEbzH,IAAcF,EAAeqpC,qBAmLrC,SAA4BpnC,EAAa+yD,GACvC,IAAItC,EAAiBzwD,EAAYiyD,oBACjC,OAAOc,IAAetC,GAAiC,sBAAfsC,GAAqD,wBAAfA,GAAuD,qBAAfA,CACxH,CAtL4DC,CAAmBhzD,EAAa+yD,IACtFlC,EAAYA,EAAUpxD,KAAK1B,GAC3BsqC,EAAaA,EAAW79B,IAAI,kBAAmBvM,IACvB,sBAAf80D,GAAqD,wBAAfA,GAAuD,qBAAfA,IAEvF1qB,EAAaA,EAAW79B,IAAI,kBAAmBzM,EAAesvC,uBAGhE,IAAImjB,EAAsBxwD,EAAYkyD,0BAIW,IAFvB,CAAC,eAAgB,oBAAqB,eAExCpwD,QAAQixD,KAC9BvC,EAAsB,MAGxB,IAAIyC,EAAqB,CACvBl1D,eAAgBsqC,EAChBmc,aAAcA,EACdqM,UAAWA,EACXF,UAAWtiC,IACXoiC,eAAgBsC,EAChB90D,UAAWyH,EAAa0hC,oBACxB0P,eAAgBA,EAChB0Z,oBAAqBA,GAEvB,OAAOhxD,EAAYgL,IAAIxK,EAAaizD,EACtC,EAOAzzD,EAAY0zD,KAAO,SAAclzD,GAC/B,IAAKA,EAAY8xD,eACf,OAAO9xD,EAGT,IAAI6wD,EAAY7wD,EAAY+xD,eACxBoB,EAAoBtC,EAAUhiC,OAElC,IAAKskC,EACH,OAAOnzD,EAGT,IAAIjC,EAAiBiC,EAAYhC,oBAC7BwmD,EAAeyL,EAAkBnM,gBAAgBqP,EAAmBnzD,EAAY8jD,mBACpF,OAAOtkD,EAAYgL,IAAIxK,EAAa,CAClCjC,eAAgBo1D,EAChB3O,aAAcA,EACdqM,UAAWA,EAAU/xC,QACrB6xC,UAAW3wD,EAAYgyD,eAAevyD,KAAK1B,GAC3C+4C,gBAAgB,EAChB0Z,oBAAqB,KACrBC,eAAgB,OAChBC,wBAAyB,KACzBzyD,UAAWF,EAAesvC,sBAE9B,EAOA7tC,EAAY4zD,KAAO,SAAcpzD,GAC/B,IAAKA,EAAY8xD,eACf,OAAO9xD,EAGT,IAAI2wD,EAAY3wD,EAAYgyD,eACxBmB,EAAoBxC,EAAU9hC,OAElC,IAAKskC,EACH,OAAOnzD,EAGT,IAAIjC,EAAiBiC,EAAYhC,oBAC7BwmD,EAAeyL,EAAkBnM,gBAAgBqP,EAAmBnzD,EAAY8jD,mBACpF,OAAOtkD,EAAYgL,IAAIxK,EAAa,CAClCjC,eAAgBo1D,EAChB3O,aAAcA,EACdqM,UAAW7wD,EAAY+xD,eAAetyD,KAAK1B,GAC3C4yD,UAAWA,EAAU7xC,QACrBg4B,gBAAgB,EAChB0Z,oBAAqB,KACrBC,eAAgB,OAChBC,wBAAyB,KACzBzyD,UAAWk1D,EAAkB/rB,qBAEjC,EAgBA5hC,EAAO0rD,aAAe,WACpB,OAAOx1D,KAAKm2D,UACd,EAEOryD,CACT,CA9Z+B,GAqa/B,SAASkzD,EAAgB1yD,EAAa/B,EAAW64C,GAC/C,OAAOt3C,EAAYgL,IAAIxK,EAAa,CAClC/B,UAAWA,EACX64C,eAAgBA,EAChB4Z,wBAAyB,KACzBF,oBAAqB,MAEzB,CAOA,SAASQ,EAAmBtrD,EAAcG,GACxC,OAAOH,EAAa0nC,cAAclmC,KAAI,SAAUjD,GAC9C,OAAO2lC,EAAU3D,SAASvgC,EAAczB,EAAO4B,EACjD,IAAG4pB,cACL,CAsFA,SAAS4iC,EAAyBhzD,EAASg0D,GACzC,IAAIC,EAAej0D,EAAQ+tC,cAAcj6B,UAAUmf,WAAU,SAAU/b,EAAGvF,GACxE,OAAOA,IAAMqiD,CACf,IAAGnhC,KAAK,GAAGI,WAAU,SAAUruB,EAAOsS,GACpC,OAAOtS,EAAMpF,WACf,IAAGuyB,QAEH,OAAIkiC,EACKA,EAAa1nB,iBAAiB0nB,EAAaz0D,YAAc,GAG3D4uB,GACT,CAEAjhB,EAAOC,QAAUjN,C,qCClkBjB,IAAI6wC,EAAY,EAAQ,OAEpBkjB,EAAqB,EAAQ,OAE7BC,EAAQnjB,EAAUojB,WAAW,YAC7BlgB,EAAiB,CAMnBmgB,iBAAkB,SAA0Bn5D,GAC1C,QAASA,EAAEo5D,UAAYp5D,EAAEq5D,MAC3B,EACAC,mBAAoB,SAA4Bt5D,GAC9C,OAAOi5D,GAASj5D,EAAEq5D,MACpB,EACAE,oBAAqB,WACnB,OAAON,CACT,EACAO,mBAAoB,SAA4Bx5D,GAC9C,OAAOi5D,IAAUj5D,EAAEy5D,UAAYz5D,EAAEq5D,OAASrgB,EAAemgB,iBAAiBn5D,EAC5E,EACAg5D,mBAAoBA,GAEtB/mD,EAAOC,QAAU8mC,C,uDCzBjB,IAAIjN,EAAgB,EAAQ,OAExB9mC,EAAc,EAAQ,OAEtBy0D,EAAkC,EAAQ,OAE1CzjB,EAAa,EAAQ,OAErBiD,EAAqB,CACvBygB,yBAA0B,SAAkCl0D,GAC1D,IAAI/B,EAAY+B,EAAY9B,eACxBwH,EAAe1F,EAAYhC,oBAC3B+uC,EAAYrnC,EAAaynC,eAC7B,OAAOznC,EAAatH,eAAeH,EAAUM,gBAAgBgmC,mBAAmB/9B,MAAMvI,EAAUgrC,iBAAkBhrC,EAAUirC,gBAAgBzlC,MAAK,SAAUwN,GACzJ,IAAI+uB,EAAS/uB,EAAEmzB,YACf,QAASpE,GAAgD,SAAtC+M,EAAU8B,MAAM7O,GAAQ9/B,SAC7C,GACF,EACAi0D,oBAAqB,SAA6Bn0D,GAChD,IAAI/B,EAAY+B,EAAY9B,eAC5B,OAAO8B,EAAYhC,oBAAoBI,eAAeH,EAAUgC,eAAeC,SACjF,EACAk0D,wBAAyB,SAAiCC,GACxD,MAAO,CACL70B,IAAK60B,EAAI9hD,WAEb,EACAtQ,iBAAkB,SAA0BjC,EAAakC,EAASC,GAChE,OAAQD,GACN,IAAK,OACH,OAAOuxC,EAAmBjzC,kBAAkBR,EAAa,QAE3D,IAAK,SACH,OAAOyzC,EAAmBjzC,kBAAkBR,EAAa,UAE3D,IAAK,YACH,OAAOyzC,EAAmBjzC,kBAAkBR,EAAa,aAE3D,IAAK,OACH,OAAOyzC,EAAmB6gB,WAAWt0D,GAEvC,IAAK,YACL,IAAK,iBACL,IAAK,6BACH,OAAOyzC,EAAmBpxC,YAAYrC,GAExC,IAAK,SACL,IAAK,cACL,IAAK,yBACH,OAAOyzC,EAAmBnxC,SAAStC,GAErC,QAEE,OAAO,KAEb,EACAu0D,kBAAmB,SAA2Bv0D,GAC5C,IAAI0F,EAAe4gC,EAAckhB,WAAWxnD,EAAYhC,oBAAqBgC,EAAY9B,eAAgB,KAAM8B,EAAYvC,wBAAyB,MAChJ+K,EAAiBhJ,EAAYC,KAAKO,EAAa0F,EAAc,qBACjE,OAAOlG,EAAYs3C,eAAetuC,EAAgB9C,EAAa0hC,oBACjE,EAMA/kC,YAAa,SAAqBrC,GAChC,IAAI/B,EAAY+B,EAAY9B,eAE5B,IAAKD,EAAUytD,eAAiBztD,EAAUkuD,mBAAqBluD,EAAUiuD,iBACvE,OAAO,KAIT,IAAI7sD,EAAUW,EAAYhC,oBACtB4xC,EAAW3xC,EAAUgC,cACrBu0D,EAAcn1D,EAAQouC,eAAemC,GAEzC,GAAI4kB,GAAyC,WAA1BA,EAAYt0D,UAAwB,CACrD,IAAI8sC,EAAW3tC,EAAQ+tC,cAAsB,OAAEonB,EAAYnrB,UACvDorB,EAAqBp1D,EAAQN,MAAM,CACrCiuC,SAAUA,EACVzE,eAAgBtqC,IAGlB,GAAIw2D,IAAuBp1D,EACzB,OAAOG,EAAYC,KAAKO,EAAay0D,EAAoB,eAE7D,CAGA,IAAIC,EAAoBjhB,EAAmBkhB,sBAAsB30D,GAEjE,OAAI00D,EACKl1D,EAAYC,KAAKO,EAAa00D,EAAmB,qBAGnD,IACT,EACApyD,SAAU,SAAkBtC,GAC1B,IAAI/B,EAAY+B,EAAY9B,eAE5B,IAAKD,EAAUytD,cACb,OAAO,KAGT,IAAIrsD,EAAUW,EAAYhC,oBACtB4xC,EAAW3xC,EAAUgC,cAErBpF,EADQwE,EAAQjB,eAAewxC,GAChB/wC,YAEnB,GAAIZ,EAAUgrC,iBAAmBpuC,EAC/B,OAAO,KAGT,IAAI+5D,EAAav1D,EAAQmuC,cAAcoC,GAEvC,IAAKglB,GAAuC,WAAzBA,EAAW10D,UAC5B,OAAO,KAGT,IAAI20D,EAAoB52D,EAAUc,MAAM,CACtCmkD,SAAU0R,EAAWvrB,SACrBzqC,YAAag2D,EAAW/1D,cAEtB41D,EAAqBnuB,EAAcY,YAAY7nC,EAASw1D,EAAmB,WAE/E,OAAIJ,IAAuBp1D,EAClBG,EAAYC,KAAKO,EAAay0D,EAAoB,gBAGpD,IACT,EACAK,MAAO,SAAet4D,EAAOwD,EAAa+0D,GACxC,IAAI92D,EAAY+B,EAAY9B,eACxB7C,EAAM4C,EAAUM,eAEpB,GAAIlD,IAAQ4C,EAAUI,cACpB,OAAO2B,EAGT,IAAIX,EAAUW,EAAYhC,oBACtBiG,EAAQ5E,EAAQjB,eAAe/C,GAC/BuB,EAAOqH,EAAM/D,UAEjB,GAAa,wBAATtD,GAA2C,sBAATA,EACpC,OAAOoD,EAGTxD,EAAMC,iBACN,IAAIwtB,EAAQhmB,EAAM0+B,WAElB,IAAKnmC,EAAMw4D,UAAY/qC,IAAU8qC,EAC/B,OAAO/0D,EAGT,IAAIi1D,EAAiBhB,EAAgC50D,EAASpB,EAAWzB,EAAMw4D,UAAY,EAAI,EAAGD,GAClG,OAAOv1D,EAAYC,KAAKO,EAAai1D,EAAgB,eACvD,EACA50D,gBAAiB,SAAyBL,EAAaD,GACrD,IAAI9B,EAAY+B,EAAY9B,eACxB0xC,EAAW3xC,EAAUgC,cACrB6vC,EAAS7xC,EAAU6qC,YACnBzpC,EAAUW,EAAYhC,oBACtB9C,EAAS+C,EAKb,GAAI2xC,IAAaE,GAAuC,IAA7B7xC,EAAUirC,eAAsB,CACzD,IAAIsrB,EAAchkB,EAAWnxC,EAAQouC,eAAeqC,IACpDA,EAAS0kB,EAAYnrB,SACrBnuC,EAASA,EAAO6D,MAAM,CACpBkkD,UAAWrT,EACXjxC,aAAcV,EAAUgrC,iBACxBia,SAAUpT,EACVlxC,YAAa41D,EAAY31D,YACzBskD,YAAY,GAEhB,CAUA,GARqB9jD,EAAQ+tC,cAAc/a,WAAU,SAAU9b,EAAGvF,GAChE,OAAOA,IAAM4+B,CACf,IAAGz8B,UAAUkf,WAAU,SAAU9b,EAAGvF,GAClC,OAAOA,IAAM8+B,CACf,IAAGrsC,MAAK,SAAUwN,GAChB,MAAuB,WAAhBA,EAAE/Q,SACX,IAGE,OAAOF,EAGT,IAAIk1D,EAAY71D,EAAQjB,eAAewxC,GAAU1vC,YAAcH,EAAY,WAAaA,EACxF,OAAOP,EAAYC,KAAKO,EAAasmC,EAAcmB,aAAapoC,EAASnE,EAAQg6D,GAAY,oBAC/F,EACAZ,WAAY,SAAoBt0D,GAC9B,IAAI/B,EAAY+B,EAAY9B,eACxB+kD,EAAYhlD,EAAUM,eACtB2kD,EAAWjlD,EAAUI,cAEzB,OAAIJ,EAAUytD,eAAiBzI,IAAcC,EACpCzP,EAAmBpzC,gBAAgBL,EAAa,cAGlDyzC,EAAmBjzC,kBAAkBR,EAAa,OAC3D,EAQAQ,kBAAmB,SAA2BR,EAAayvC,GACzD,IAAIxxC,EAAY+B,EAAY9B,eACxBklD,EAAepjD,EAAYvC,wBAI/B,GAAIQ,EAAUytD,cACZ,OAAOlsD,EAAY2yD,uBAAuBnyD,EAAaojD,EAAa1lD,IAAI+xC,GAAe2T,EAAaloC,OAAOu0B,GAAe2T,EAAalgD,IAAIusC,IAK7I,IACIpH,EADAhpC,EAAUW,EAAYhC,oBAU1B,OALEqqC,EADE+a,EAAa1lD,IAAI+xC,GACNnJ,EAAchnC,kBAAkBD,EAASpB,EAAWwxC,GAEpDnJ,EAAcpnC,iBAAiBG,EAASpB,EAAWwxC,GAG3DjwC,EAAYC,KAAKO,EAAaqoC,EAAY,sBACnD,EACA8sB,WAAY,SAAoBn1D,EAAamnC,EAAiBxC,GAC5D,IAAIywB,EAAc9uB,EAAcsE,YAAY5qC,EAAYhC,oBAAqBmpC,EAAiBxC,GAC9F,OAAOnlC,EAAYC,KAAKO,EAAao1D,EAAa,eACpD,EAMAT,sBAAuB,SAA+B30D,GACpD,IAAI/B,EAAY+B,EAAY9B,eACxB4H,EAAS7H,EAAUkuD,kBAEvB,GAAIluD,EAAUytD,eAA4B,IAAX5lD,EAAc,CAC3C,IAAIzK,EAAM4C,EAAUM,eAChBc,EAAUW,EAAYhC,oBAEtBpB,EADQyC,EAAQjB,eAAe/C,GAClB6E,UACbs0D,EAAcn1D,EAAQouC,eAAepyC,GAEzC,GAAa,eAATuB,GAAyB43D,GAAyC,eAA1BA,EAAYt0D,WAA0D,IAA5Bs0D,EAAY31D,YAChG,OAAO,KAGT,GAAa,aAATjC,EACF,OAAO0pC,EAAcmB,aAAapoC,EAASpB,EAAW,WAE1D,CAEA,OAAO,IACT,GAEFuO,EAAOC,QAAUgnC,C,qCC9QjB,IAAInN,EAAgB,EAAQ,OAExB9mC,EAAc,EAAQ,OAEtBwrD,EAA0B,EAAQ,OAElCxa,EAAa,EAAQ,OAErBgH,EAAY,KAMZ6d,EAAqB,CACvB1f,IAAK,SAAa31C,GAChB,IAAIX,EAAUW,EAAYhC,oBACtBC,EAAY+B,EAAY9B,eACxBwqC,EAAc,KAElB,GAAIzqC,EAAUytD,cAAe,CAC3B,IAAIzI,EAAYhlD,EAAUM,eACtB+2D,EAAWj2D,EAAQjB,eAAe6kD,GAAWpkD,YAEjD,GAAIy2D,IAAar3D,EAAUkuD,kBAAmB,CAC5C,IAAIoJ,EAAWl2D,EAAQkuC,YAAY0V,GAEnC,GAAgB,MAAZsS,EACF,OAAOv1D,EAGT0oC,EAAczqC,EAAUuM,IAAI,WAAY+qD,GAAU/qD,IAAI,cAAe,EACvE,MACEk+B,EAAczqC,EAAUuM,IAAI,cAAe8qD,EAE/C,MACE5sB,EAAczqC,EAGhByqC,EAAc8H,EAAW9H,GAGzB8O,EAAYwT,EAAwB3rD,EAASqpC,GAC7C,IAAIzB,EAAeX,EAAcY,YAAY7nC,EAASqpC,EAAa,WAEnE,OAAIzB,IAAiB5nC,EACZW,EAGFR,EAAYC,KAAKO,EAAainC,EAAc,eACrD,EACAuuB,MAAO,SAAex1D,GACpB,IAAKw3C,EACH,OAAOx3C,EAGT,IAAIqoC,EAAa/B,EAAc8B,oBAAoBpoC,EAAYhC,oBAAqBgC,EAAY9B,eAAgBs5C,GAChH,OAAOh4C,EAAYC,KAAKO,EAAaqoC,EAAY,kBACnD,GAEF77B,EAAOC,QAAU4oD,C,qCC1DjB,IAiBI1oB,EAA8B,SAAU8oB,GAnB5C,IAAwBxtD,EAAUC,EAsBhC,SAASykC,IACP,OAAO8oB,EAAsBh6D,MAAMC,KAAMZ,YAAcY,IACzD,CAxBgCwM,EAoBDutD,GApBTxtD,EAoBP0kC,GApBwCrxC,UAAYN,OAAOmP,OAAOjC,EAAW5M,WAAY2M,EAAS3M,UAAU8O,YAAcnC,EAAUA,EAASxG,UAAYyG,EA0BxK,IAAI1C,EAASmnC,EAAerxC,UAsF5B,OApFAkK,EAAOkwD,UAAY,WACjB,MAAO,WAAah6D,KAAK6C,eAAiB,IAAM7C,KAAKywD,kBAA9C,YAAqFzwD,KAAK2C,cAAgB,IAAM3C,KAAKwwD,iBAArH,kBAAiKzvB,OAAO/gC,KAAK+C,iBAA7K,gBAAuNg+B,OAAO/gC,KAAK46C,cAC5O,EAEA9wC,EAAOjH,aAAe,WACpB,OAAO7C,KAAK6K,IAAI,YAClB,EAEAf,EAAO2mD,gBAAkB,WACvB,OAAOzwD,KAAK6K,IAAI,eAClB,EAEAf,EAAOnH,YAAc,WACnB,OAAO3C,KAAK6K,IAAI,WAClB,EAEAf,EAAO0mD,eAAiB,WACtB,OAAOxwD,KAAK6K,IAAI,cAClB,EAEAf,EAAO/G,cAAgB,WACrB,OAAO/C,KAAK6K,IAAI,aAClB,EAEAf,EAAO8wC,YAAc,WACnB,OAAO56C,KAAK6K,IAAI,WAClB,EAOAf,EAAOyiD,cAAgB,SAAuBhY,EAAU94B,EAAOnH,GAC7D,IAAIizC,EAAYvnD,KAAK6C,eACjB2kD,EAAWxnD,KAAK2C,cAEpB,GAAI4kD,IAAcC,GAAYD,IAAchT,EAAU,CACpD,IAAI+Z,EAAiBtuD,KAAKutC,iBACtBghB,EAAevuD,KAAKwtC,eACxB,OAAO/xB,GAAS6yC,GAAkBA,GAAkBh6C,GACpDmH,GAAS8yC,GAAgBA,GAAgBj6C,CAE3C,CAEA,GAAIigC,IAAagT,GAAahT,IAAaiT,EACzC,OAAO,EAGT,IAAIyS,EAAgB1lB,IAAagT,EAAYvnD,KAAKywD,kBAAoBzwD,KAAKwwD,iBAC3E,OAAO/0C,GAASw+C,GAAiB3lD,GAAO2lD,CAC1C,EAEAnwD,EAAOkmD,YAAc,WACnB,OAAOhwD,KAAK6C,iBAAmB7C,KAAK2C,eAAiB3C,KAAKywD,oBAAsBzwD,KAAKwwD,gBACvF,EAEA1mD,EAAOvF,YAAc,WACnB,OAAOvE,KAAK+C,gBAAkB/C,KAAK2C,cAAgB3C,KAAK6C,cAC1D,EAEAiH,EAAOyjC,eAAiB,WACtB,OAAOvtC,KAAK+C,gBAAkB/C,KAAKwwD,iBAAmBxwD,KAAKywD,iBAC7D,EAEA3mD,EAAOsjC,UAAY,WACjB,OAAOptC,KAAK+C,gBAAkB/C,KAAK6C,eAAiB7C,KAAK2C,aAC3D,EAEAmH,EAAO0jC,aAAe,WACpB,OAAOxtC,KAAK+C,gBAAkB/C,KAAKywD,kBAAoBzwD,KAAKwwD,gBAC9D,EAEAvf,EAAe2C,YAAc,SAAqBj0C,GAChD,OAAO,IAAIsxC,EAAe,CACxBsW,UAAW5nD,EACXsD,aAAc,EACdukD,SAAU7nD,EACVuD,YAAa,EACbukD,YAAY,EACZsF,UAAU,GAEd,EAEO9b,CACT,CA9FkC,EAFPnhB,EAfX,EAAQ,OAEDA,QACH,CAClBy3B,UAAW,GACXtkD,aAAc,EACdukD,SAAU,GACVtkD,YAAa,EACbukD,YAAY,EACZsF,UAAU,KAwGZj8C,EAAOC,QAAUkgC,C,iCC9FjBngC,EAAOC,QArBP,SAAyC/G,EAAcshC,EAAgB4uB,EAAYb,GACjF,IAAInlB,EAAW5I,EAAe/mC,cAC1B6vC,EAAS9I,EAAe8B,YACxBkE,EAAWtnC,EAAa0nC,cACxB/L,EAAS2L,EAASl7B,QAAQwgB,WAAU,SAAU/b,EAAGvF,GACnD,OAAOA,IAAM4+B,CACf,IAAGld,WAAU,SAAUnc,EAAGvF,GACxB,OAAOA,IAAM8+B,CACf,IAAGnsC,OAAO,CAAC,CAACmsC,EAAQ9C,EAASzmC,IAAIupC,MAAW5oC,KAAI,SAAUjD,GACxD,IAAIgmB,EAAQhmB,EAAM0+B,WAAaizB,EAE/B,OADA3rC,EAAQ9a,KAAKC,IAAI,EAAGD,KAAKkB,IAAI4Z,EAAO8qC,IAC7B9wD,EAAMuG,IAAI,QAASyf,EAC5B,IAEA,OADA+iB,EAAWA,EAASjuC,MAAMsiC,GACnB37B,EAAa3G,MAAM,CACxBiuC,SAAUA,EACV1E,gBAAiBtB,EACjBuB,eAAgBvB,GAEpB,C,qCCnBA,IAAIb,EAAoB,EAAQ,OAchC35B,EAAOC,QAZP,SAAmCopD,EAAcC,EAAU9lD,EAAK20B,GAI9D,IAHA,IAAIxtB,EAAQ2+C,EACRluB,EAAgBiuB,EAAatxB,mBAE1BptB,EAAQnH,GACb43B,EAAgBA,EAAcp9B,IAAI2M,EAAOgvB,EAAkByE,YAAYhD,EAAcrhC,IAAI4Q,GAAQwtB,IACjGxtB,IAGF,OAAO0+C,EAAarrD,IAAI,gBAAiBo9B,EAC3C,C,qCCZA,IAAImuB,EAA4B,EAAQ,OAEpCtvB,EAAY,EAAQ,OAwBxBj6B,EAAOC,QAtBP,SAAmC/G,EAAcshC,EAAgBrC,GAC/D,IAAIqI,EAAWtnC,EAAa0nC,cACxBwC,EAAW5I,EAAe/mC,cAC1B4vC,EAAc7I,EAAeiC,iBAC7B6G,EAAS9I,EAAe8B,YACxBiH,EAAY/I,EAAekC,eAC3B8G,EAAYhD,EAAS1a,WAAU,SAAU/b,EAAGvF,GAC9C,OAAOA,IAAM4+B,CACf,IAAGld,WAAU,SAAUnc,EAAGvF,GACxB,OAAOA,IAAM8+B,CACf,IAAGrgB,eAAe1wB,MAAM0nC,EAAUhqB,WAAW,CAAC,CAACqzB,EAAQ9C,EAASzmC,IAAIupC,OAAY5oC,KAAI,SAAUjD,EAAOgsC,GACnG,IAAIC,EAAaD,IAAaL,EAAWC,EAAc,EACnDM,EAAWF,IAAaH,EAASC,EAAY9rC,EAAMpF,YACvD,OAAOk3D,EAA0B9xD,EAAOisC,EAAYC,EAAUxL,EAChE,IACA,OAAOj/B,EAAa3G,MAAM,CACxBiuC,SAAUA,EAASjuC,MAAMixC,GACzB1H,gBAAiBtB,EACjBuB,eAAgBvB,GAEpB,C,oCCtBA,SAAS1P,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAEhN,IAAI0+B,EAAe,EAAQ,OAEvBC,EAAmB,EAAQ,OAE3B4nB,EAAiB,EAAQ,OAEzB+H,EAAqB,EAAQ,OAE7BC,EAA0B,EAAQ,OAElCn/C,EAAY,EAAQ,OAEpBo/C,EAAiB,SAAwBjyD,EAAOkyD,GAClD,MAAO,CACL96D,IAAK4I,EAAMolC,SACXt9B,KAAM9H,EAAM2B,UACZhJ,KAAMqH,EAAM/D,UACZ+pB,MAAOhmB,EAAM0+B,WACbusB,kBAAmB+G,EAAwBhyD,GAC3CgrD,aAAc+G,EAAmB/xD,EAAOkyD,GACxCj2B,KAAMj8B,EAAMk8B,UAAU3Q,WAE1B,EAEI4mC,EAAiB,SAAwBnyD,EAAO8oC,EAAWspB,EAAWC,GACxE,GAAIryD,aAAiBmiC,EACnBiwB,EAAU52D,KAAKy2D,EAAejyD,EAAO8oC,QADvC,CAKE9oC,aAAiBoiC,GAA2GvvB,GAAU,GACxI,IAAIs4C,EAAYnrD,EAAMsoC,eAElBgqB,EAAWD,EAAcryD,EAAMolC,UArCrC,SAAuBnuC,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAO67B,EAAUh8B,OAAO6G,KAAKzG,GAAqD,oBAAjCJ,OAAOq0B,wBAAwC2H,EAAUA,EAAQrzB,OAAO3I,OAAOq0B,sBAAsBj0B,GAAQwC,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyB/7B,EAAQ87B,GAAKE,UAAY,MAAOJ,EAAQj0B,SAAQ,SAAU1H,GAAOi8B,EAAgBp8B,EAAQG,EAAKD,EAAOC,GAAO,GAAI,CAAE,OAAOH,CAAQ,CAqC/am8B,CAAc,CAAC,EAAG6+B,EAAejyD,EAAO8oC,GAAY,CACjGjxC,SAAU,KAGRszD,EACFkH,EAAclH,GAAWtzD,SAAS2D,KAAK82D,GAIzCF,EAAU52D,KAAK82D,EAdf,CAeF,EAqEA/pD,EAAOC,QAZ0B,SAAoC/G,GACnE,IAAI8wD,EAAuB,CACzBzpB,UAAW,CAAC,EACZ1L,OAAQ,IAMV,OAHAm1B,EA7DoB,SAAyB9wD,EAAc+wD,GAC3D,IAAI1pB,EAAY0pB,EAAS1pB,UACrBspB,EAAY,GACZC,EAAgB,CAAC,EACjBI,EAAiB,CAAC,EAClBC,EAAmB,EAwBvB,OAvBAjxD,EAAa0nC,cAAcrqC,SAAQ,SAAUkB,GAC3CA,EAAMgoC,kBAAiB,SAAUlF,GAC/B,OAAiC,OAA1BA,EAAU3C,WACnB,IAAG,SAAUjtB,GACX,IAAIwtB,EAAY1gC,EAAM4nC,YAAY10B,GAE9By/C,EAAuB3I,EAAet6B,UAAUgR,GAGhD+xB,EAAeE,KAInBF,EAAeE,GAAwBjyB,EAKvCoI,EAAU6pB,GAAwB,GAAGjzD,OAAOgzD,GAC5CA,IACF,IACAP,EAAenyD,EAAO8oC,EAAWspB,EAAWC,EAC9C,IACO,CACLj1B,OAAQg1B,EACRtpB,UAAWA,EAEf,CA4ByB8pB,CAAgBnxD,EAAc8wD,GAErDA,EA1BuB,SAA4B9wD,EAAc+wD,GACjE,IAAIp1B,EAASo1B,EAASp1B,OAClB0L,EAAY0pB,EAAS1pB,UACrB+pB,EAAe,CAAC,EASpB,OARA97D,OAAO6G,KAAKkrC,GAAWhqC,SAAQ,SAAU1H,EAAKgL,GAC5C,IAAI25B,EAASt6B,EAAa0+B,UAAU6pB,EAAeC,YAAY7yD,IAC/Dy7D,EAAazwD,GAAS,CACpBzJ,KAAMojC,EAAO9/B,UACbiuC,WAAYnO,EAAO8pB,gBACnB5pB,KAAMF,EAAOG,UAEjB,IACO,CACLkB,OAAQA,EACR0L,UAAW+pB,EAEf,CAUyBC,CAAmBrxD,EAAc8wD,GACjDA,CACT,C,qCClHA,IAAIQ,EAEJ,SAAS3/B,EAAcn8B,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAO67B,EAAUh8B,OAAO6G,KAAKzG,GAAqD,oBAAjCJ,OAAOq0B,wBAAwC2H,EAAUA,EAAQrzB,OAAO3I,OAAOq0B,sBAAsBj0B,GAAQwC,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyB/7B,EAAQ87B,GAAKE,UAAY,MAAOJ,EAAQj0B,SAAQ,SAAU1H,GAAOi8B,EAAgBp8B,EAAQG,EAAKD,EAAOC,GAAO,GAAI,CAAE,OAAOH,CAAQ,CAEhe,SAASo8B,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAEhN,IAAIy+B,EAAoB,EAAQ,OAE5BC,EAAe,EAAQ,OAEvBC,EAAmB,EAAQ,OAE3B18B,EAA6B,EAAQ,OAErC+iC,EAAc,EAAQ,OAEtBuqB,EAAM,EAAQ,OAEd3kB,EAAK,EAAQ,OAEb/L,EAAoB,EAAQ,MAE5BqmB,EAAsB,EAAQ,OAE9BpmB,EAAM,EAAQ,OAEd4D,EAAW,EAAQ,OACnBvjC,EAAOujC,EAASvjC,KAChB4C,EAAM2gC,EAAS3gC,IACfgkB,EAAa2c,EAAS3c,WAEtBypC,EAAsB,EAAQ,OAE9BpP,EAAkB,EAAQ,OAE1B1S,EAAgB,EAAQ,OAExB+hB,EAAqB,EAAQ,MAE7BxwB,EAA8BH,EAAI,2BAIlC4wB,EAAW,IAAI3J,OAAO,KAAM,KAC5B4J,EAAW,IAAI5J,OAAO,KAAM,KAC5B6J,EAAmB,IAAI7J,OAAO,MAAO,KACrC8J,EAAa,IAAI9J,OANV,SAMuB,KAC9B+J,EAAiB,IAAI/J,OAAO,SAAU,KACtCgK,EAAY,IAAIhK,OAAO,WAAY,KAEnCiK,EAAa,CAAC,OAAQ,SAAU,MAAO,MAAO,MAAO,MAAO,OAC5DC,EAAgB,CAAC,QAAS,UAAW,SAAU,MAAO,MAAO,MAAO,OACpEC,EAAa,CAAC,YAAa,OAAQ,MAAO,SAAU,SACpDC,EAAU,CAAC,MAAO,YAAa,SAAU,MAAO,SAChDC,GAAyDxgC,EAA5B0/B,EAAwB,CAAC,EAA0C1kB,EAAG,mCAAoC,GAAIhb,EAAgB0/B,EAAuB1kB,EAAG,mCAAoC,GAAIhb,EAAgB0/B,EAAuB1kB,EAAG,mCAAoC,GAAIhb,EAAgB0/B,EAAuB1kB,EAAG,mCAAoC,GAAIhb,EAAgB0/B,EAAuB1kB,EAAG,mCAAoC,GAAI0kB,GACnde,EAA6BtuD,EAAI,CACnCwM,EAAG,OACH+hD,KAAM,OACNC,IAAK,gBACLC,GAAI,SACJ/8D,EAAG,SACHkwB,EAAG,gBACH8sC,OAAQ,gBACRC,OAAQ,OACRC,EAAG,YACHC,KAAM,cA6CJC,EAAoB,SAA2Bp+C,GACjD,GAAIi7B,EAAcj7B,IACFA,EAEFtc,MAAMk1C,WAAW96B,SAAS,aACpC,MAAO,OAIX,OAAO,IACT,EAOIugD,EAAmB,SAA0Br+C,GAC/C,IAAI8P,EAAQnvB,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAK,EAMhF,OALAE,OAAO6G,KAAKi2D,GAA2Br0D,MAAK,SAAUg1D,GAChDt+C,EAAKu+C,UAAU3lC,SAAS0lC,KAC1BxuC,EAAQ6tC,EAA0BW,GAEtC,IACOxuC,CACT,EAOI0uC,EAAgB,SAAuBx+C,GACzC,IAAK+8C,EAAoB/8C,GACvB,OAAO,EAGT,IAAIy+C,EAAaz+C,EAEjB,IAAKy+C,EAAWn5B,MAAgC,UAAxBm5B,EAAWC,UAAgD,WAAxBD,EAAWC,UAAiD,YAAxBD,EAAWC,UAAkD,SAAxBD,EAAWC,SAC7I,OAAO,EAGT,IAEU,IAAI5B,EAAI2B,EAAWn5B,MAE3B,OAAO,CAGT,CAAE,MAAOlpB,GACP,OAAO,CACT,CACF,EAOIuiD,EAAe,SAAsB3+C,GACvC,IAAKg9C,EAAmBh9C,GACtB,OAAO,EAGT,IAAI4+C,EAAY5+C,EAChB,SAAU4+C,EAAU1/B,WAAW2/B,aAAa,SAAUD,EAAU1/B,WAAW2/B,aAAa,OAAOlsD,MACjG,EAOImsD,EAA0B,SAAiC9+C,EAAMtc,GACnE,IAAKu3C,EAAcj7B,GACjB,OAAOtc,EAGT,IAAIq7D,EAAc/+C,EACdghB,EAAa+9B,EAAYr7D,MAAMs9B,WAC/B8X,EAAYimB,EAAYr7D,MAAMo1C,UAC9BC,EAAiBgmB,EAAYr7D,MAAMq1C,eACvC,OAAOr1C,EAAM6c,eAAc,SAAU7c,GAC/B65D,EAAW51D,QAAQq5B,IAAe,EACpCt9B,EAAMqF,IAAI,QACDy0D,EAAc71D,QAAQq5B,IAAe,GAC9Ct9B,EAAMqd,OAAO,QAGG,WAAd+3B,EACFp1C,EAAMqF,IAAI,UACa,WAAd+vC,GACTp1C,EAAMqd,OAAO,UAGQ,cAAnBg4B,GACFr1C,EAAMqF,IAAI,aAGW,iBAAnBgwC,GACFr1C,EAAMqF,IAAI,iBAGW,SAAnBgwC,IACFr1C,EAAMqd,OAAO,aACbrd,EAAMqd,OAAO,iBAEjB,GACF,EAMIi+C,EAAa,SAAoBC,GACnC,MAAoB,OAAbA,GAAkC,OAAbA,CAC9B,EA0BIC,EAAoC,WAWtC,SAASA,EAAqBC,EAAcC,GAC1CjiC,EAAgB57B,KAAM,gBAAiBmL,KAEvCywB,EAAgB57B,KAAM,mBAAoB,YAE1C47B,EAAgB57B,KAAM,eAAgB,GAEtC47B,EAAgB57B,KAAM,gBAAiB,MAEvC47B,EAAgB57B,KAAM,cAAe,IAErC47B,EAAgB57B,KAAM,UAAW,MAEjC47B,EAAgB57B,KAAM,eAAgB,IAEtC47B,EAAgB57B,KAAM,gBAAiB,IAEvC47B,EAAgB57B,KAAM,YAAagxC,GAEnCpV,EAAgB57B,KAAM,oBAAgB,GAEtC47B,EAAgB57B,KAAM,oBAAgB,GAEtCA,KAAK+f,QACL/f,KAAK49D,aAAeA,EACpB59D,KAAK69D,aAAeA,CACtB,CAMA,IAAI/zD,EAAS6zD,EAAqB/9D,UA+blC,OA7bAkK,EAAOiW,MAAQ,WACb/f,KAAKksC,cAAgB/gC,IACrBnL,KAAK89D,aAAe,GACpB99D,KAAK+9D,iBAAmB,WACxB/9D,KAAK2uB,aAAe,EACpB3uB,KAAKg+D,cAAgB,KACrBh+D,KAAKi+D,YAAc,GACnBj+D,KAAKqxC,UAAYL,EACjBhxC,KAAK+2C,QAAU,KACf/2C,KAAK2zC,cAAgB,EACvB,EAMA7pC,EAAOo0D,WAAa,SAAoBz/C,GACtC,IAAI0/C,EAgBJ,OAdAn+D,KAAK2zC,cAAgB,GACrB3zC,KAAK2uB,aAAe,GAEnBwvC,EAAqBn+D,KAAK89D,cAAc/5D,KAAKhE,MAAMo+D,EAAoBn+D,KAAKo+D,gBAAgB,CAAC3/C,GAAOsT,MAIrG/xB,KAAKq+D,mBAEoB,KAArBr+D,KAAKi+D,aACPj+D,KAAK89D,aAAa/5D,KAAK/D,KAAKs+D,oBAIvBt+D,IACT,EAOA8J,EAAOy0D,iBAAmB,WASxB,OARkC,IAA9Bv+D,KAAK2zC,cAAcx0C,SACjB8rC,EACFjrC,KAAKw+D,iBAAiBx+D,KAAK89D,cAE3B99D,KAAKy+D,qBAAqBz+D,KAAK89D,eAI5B,CACLnqB,cAAe3zC,KAAK2zC,cACpBtC,UAAWrxC,KAAKqxC,UAEpB,EASAvnC,EAAOw0D,iBAAmB,WACxB,IAAInkC,EAAS/6B,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAG9EmJ,EAAQozB,EAAc,CACxBh8B,IAHQw6B,EAAOx6B,KAAOkrC,IAItB3pC,KAAMlB,KAAK+9D,iBACX1tD,KAAMrQ,KAAKi+D,YACX/xB,cAAelsC,KAAKksC,cACpB3d,MAAOvuB,KAAK2uB,aACZgiB,OAAQ,KACRvwC,SAAU+K,IACVkhC,YAAa,KACbD,YAAa,KACbsyB,aAAc,IACbvkC,GAKH,OAHAn6B,KAAKksC,cAAgB/gC,IACrBnL,KAAK+9D,iBAAmB,WACxB/9D,KAAKi+D,YAAc,GACZ11D,CACT,EAQAuB,EAAOs0D,gBAAkB,SAAyBn8C,EAAO9f,GAGvD,IAFA,IAAI27D,EAAe,GAEVr+D,EAAI,EAAGA,EAAIwiB,EAAM9iB,OAAQM,IAAK,CACrC,IAAIgf,EAAOwD,EAAMxiB,GACbi+D,EAAWj/C,EAAKi/C,SAASv8B,cAE7B,GAAiB,SAAbu8B,GAAuBD,EAAWC,GAAtC,CAGE19D,KAAKq+D,mBAEoB,KAArBr+D,KAAKi+D,aACPH,EAAa/5D,KAAK/D,KAAKs+D,oBAKzB,IAAIK,EAAkB3+D,KAAK2uB,aACvBiwC,EAAa5+D,KAAK+2C,QAElB0mB,EAAWC,KACb19D,KAAK+2C,QAAU2mB,EAEXD,EAAWmB,IACb5+D,KAAK2uB,gBAITmvC,EAAa/5D,KAAKhE,MAAM+9D,EAAc99D,KAAKo+D,gBAAgBn/D,MAAMoqB,KAAK5K,EAAKogD,YAAa18D,IACxFnC,KAAK2uB,aAAegwC,EACpB3+D,KAAK+2C,QAAU6nB,CAEjB,KA1BA,CA4BA,IAAIv6D,EAAYrE,KAAK49D,aAAa/yD,IAAI6yD,GAEtC,QAAkBh1D,IAAdrE,EAsCJ,GAAiB,UAAbq5D,EAMJ,GAAiB,OAAbA,EAMJ,GAAIN,EAAa3+C,GACfze,KAAK8+D,YAAYrgD,EAAMtc,QAKzB,GAAI86D,EAAcx+C,GAChBze,KAAK++D,eAAetgD,EAAMq/C,EAAc37D,OAD1C,CAMA,IAAI68D,EAAW78D,EAEXk6D,EAA2Br6D,IAAI07D,KACjCsB,EAAWA,EAASx3D,IAAI60D,EAA2BxxD,IAAI6yD,KAGzDsB,EAAWzB,EAAwB9+C,EAAMugD,GACzC,IAAIjrB,EAAc8oB,EAAkBp+C,GAEjB,MAAfs1B,IACFirB,EAAWA,EAASx3D,IAAIusC,IAG1B+pB,EAAa/5D,KAAKhE,MAAM+9D,EAAc99D,KAAKo+D,gBAAgBn/D,MAAMoqB,KAAK5K,EAAKogD,YAAaG,GAfxF,MAfEh/D,KAAKi/D,cAAcxgD,EAAMtc,QANzBnC,KAAKk/D,aAAazgD,EAAMtc,OAvC1B,CAGEnC,KAAKq+D,mBAEoB,KAArBr+D,KAAKi+D,aACPH,EAAa/5D,KAAK/D,KAAKs+D,oBAGzB,IAAIa,EAAmBn/D,KAAK2uB,aACxBywC,EAAcp/D,KAAK+2C,QAOvB,GANA/2C,KAAK+2C,QAAuB,QAAb2mB,EAAqB,MAAQ19D,KAAK+2C,QAExB,kBAAd1yC,IACTA,EAAYrE,KAAK69D,aAAaH,EAAU19D,KAAK+2C,UAAY1yC,EAAU,IAAM,aAGtE4mC,GAA+ByO,EAAcj7B,KAAwB,wBAAdpa,GAAqD,sBAAdA,GAAoC,CACrI,IAAIm5D,EAAc/+C,EAClBze,KAAK2uB,aAAemuC,EAAiBU,EAAax9D,KAAK2uB,aACzD,CAEA,IAAIhvB,EAAMkrC,IAEN6zB,EAAe1+D,KAAKo+D,gBAAgBn/D,MAAMoqB,KAAK5K,EAAKogD,YAAa18D,GAErEnC,KAAKq+D,mBAELP,EAAa/5D,KAAK/D,KAAKs+D,iBAAiB,CACtC3+D,IAAKA,EACL++D,aAAcA,EACdx9D,KAAMmD,KAERrE,KAAK2uB,aAAewwC,EACpBn/D,KAAK+2C,QAAUqoB,CAEjB,CAxCA,CAgFF,CAEA,OAAOtB,CACT,EAMAh0D,EAAOu1D,YAAc,SAAqBhvD,EAAMlO,GAC9C,IAAIm9D,EAEJt/D,KAAKi+D,aAAe5tD,EACpB,IAAIkvD,EAAoB90B,EAAkBh8B,OAAO,CAC/CtM,MAAOA,EACPmiC,OAAQtkC,KAAKg+D,gBAEfh+D,KAAKksC,eAAiBozB,EAAsBt/D,KAAKksC,eAAenoC,KAAKhE,MAAMu/D,EAAqBrgE,MAAMoR,EAAKlR,QAAQsC,KAAK89D,GAC1H,EAMAz1D,EAAOu0D,iBAAmB,WACxB,IAAImB,EAAIx/D,KAAKi+D,YAAY9+D,OACrBkV,EAAQmrD,EAAIx/D,KAAKi+D,YAAYwB,WAAWtgE,OACxCmV,EAAMtU,KAAKi+D,YAAYyB,YAAYvgE,OAEnCmlC,EAAStkC,KAAKksC,cAAc5X,WAAU,SAAUirC,GAClD,OAAyC,OAAlCA,EAAkB72B,WAC3B,KACAr0B,OAAmB3L,IAAX47B,EAAuB7wB,KAAKkB,IAAIN,EAAOiwB,EAAO,IAAMjwB,IAI5DC,OAAiB5L,KAHjB47B,EAAStkC,KAAKksC,cAAcz0B,UAAU6c,WAAU,SAAUirC,GACxD,OAAyC,OAAlCA,EAAkB72B,WAC3B,KAC6Bj1B,KAAKC,IAAIY,EAAKkrD,EAAIl7B,EAAO,IAAMhwB,IAG1DtU,KAAKi+D,YAAc,GACnBj+D,KAAKksC,cAAgB/gC,MAErBnL,KAAKi+D,YAAcj+D,KAAKi+D,YAAYnzD,MAAMuJ,EAAOC,GACjDtU,KAAKksC,cAAgBlsC,KAAKksC,cAAcphC,MAAMuJ,EAAOC,GAEzD,EAMAxK,EAAOo1D,aAAe,SAAsBzgD,EAAMtc,GAChD,IAAIkO,EAAOoO,EAAKg4B,YAII,KAHFpmC,EAAK81B,QAGoB,QAAjBnmC,KAAK+2C,UAC7B1mC,EAAO,KAGY,QAAjBrQ,KAAK+2C,UAIP1mC,GAFAA,EAAOA,EAAK6wB,QAAQ06B,EAAkB,KAE1B16B,QAAQy6B,EA9gBd,MAihBR37D,KAAKq/D,YAAYhvD,EAAMlO,EACzB,EAEA2H,EAAOm1D,cAAgB,SAAuBxgD,EAAMtc,GAC7CiqD,EAAgB3tC,IAIrBze,KAAKq/D,YAAY,KAAMl9D,EACzB,EAMA2H,EAAOg1D,YAAc,SAAqBrgD,EAAMtc,GAC9C,GAAKs5D,EAAmBh9C,GAAxB,CAIA,IAAIkhD,EAAQlhD,EACRmhD,EAAe,CAAC,EACpBzD,EAAQ90D,SAAQ,SAAUw4D,GACxB,IAAIC,EAAiBH,EAAMI,aAAaF,GAEpCC,IACFF,EAAaC,GAAQC,EAEzB,IAEA9/D,KAAKg+D,cAAgBh+D,KAAKqxC,UAAUqB,SAAS,QAAS,YAAaktB,GAI/D90B,EAAI,6BAC6B,iBAA/B60B,EAAMI,aAAa,SACrB//D,KAAKq/D,YAAY,eAAgBl9D,GAGnCnC,KAAKq/D,YAAY,eAAgBl9D,GAGnCnC,KAAKg+D,cAAgB,IAxBrB,CAyBF,EAQAl0D,EAAOi1D,eAAiB,SAAwBtgD,EAAMq/C,EAAc37D,GAGlE,GAAKq5D,EAAoB/8C,GAAzB,CAIA,IAAIuhD,EAASvhD,EACTmhD,EAAe,CAAC,EACpB1D,EAAW70D,SAAQ,SAAUw4D,GAC3B,IAAII,EAAkBD,EAAOD,aAAaF,GAEtCI,IACFL,EAAaC,GAAQI,EAEzB,IACAL,EAAa97B,IAAM,IAAIy3B,EAAIyE,EAAOj8B,MAAMltB,WAExC7W,KAAKg+D,cAAgBh+D,KAAKqxC,UAAUqB,SAAS,OAAQ,UAAWktB,GAAgB,CAAC,GACjF9B,EAAa/5D,KAAKhE,MAAM+9D,EAAc99D,KAAKo+D,gBAAgBn/D,MAAMoqB,KAAK5K,EAAKogD,YAAa18D,IACxFnC,KAAKg+D,cAAgB,IAfrB,CAgBF,EAOAl0D,EAAO00D,iBAAmB,SAA0BV,GAIlD,IAHA,IAAIntB,EAASvxC,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAK,KAC7EogE,EAAI1B,EAAa3+D,OAAS,EAErBM,EAAI,EAAGA,GAAK+/D,EAAG//D,IAAK,CAC3B,IAAI06B,EAAS2jC,EAAar+D,GAC1B06B,EAAOwW,OAASA,EAChBxW,EAAOkS,YAAc5sC,EAAI,EAAIq+D,EAAar+D,EAAI,GAAGE,IAAM,KACvDw6B,EAAOiS,YAAc3sC,EAAI+/D,EAAI1B,EAAar+D,EAAI,GAAGE,IAAM,KACvDw6B,EAAO/5B,SAAW+K,EAAKgvB,EAAOukC,aAAalzD,KAAI,SAAU45C,GACvD,OAAOA,EAAMzlD,GACf,KACAK,KAAK2zC,cAAc5vC,KAAK,IAAI4mC,EAAiBhP,EAAc,CAAC,EAAGxB,KAE/Dn6B,KAAKw+D,iBAAiBrkC,EAAOukC,aAAcvkC,EAAOx6B,IACpD,CACF,EAOAmK,EAAOo2D,+BAAiC,SAAwCpC,GAC9E,IAAIpxD,EAAQ1M,KAUZ,OARcmL,EAAK2yD,GAAc1yD,SAAQ,SAAU+0D,GAEjD,MAAyB,aAArBA,EAAYj/D,MAA4C,KAArBi/D,EAAY9vD,KAC1C,CAAC8vD,GAGHzzD,EAAMwzD,+BAA+BC,EAAYzB,aAC1D,GAEF,EAUA50D,EAAO20D,qBAAuB,SAA8BX,GAC1D,IAAIvuD,EAASvP,KAEMA,KAAKkgE,+BAA+BpC,GAE1Cz2D,SAAQ,SAAU8yB,GAC7B,IAAIimC,EAAwB7wD,EAAO8wD,6BAA6BlmC,EAAOukC,cACnEruD,EAAO+vD,EAAsB/vD,KAC7B67B,EAAgBk0B,EAAsBl0B,cAE1C38B,EAAOokC,cAAc5vC,KAAK,IAAI2mC,EAAa/O,EAAc,CAAC,EAAGxB,EAAQ,CACnE9pB,KAAM8pB,EAAO9pB,KAAOA,EACpB67B,cAAe/R,EAAO+R,cAAcjkC,OAAOikC,MAE/C,GACF,EAOApiC,EAAOu2D,6BAA+B,SAAsCvC,GAK1E,IAJA,IAAI0B,EAAI1B,EAAa3+D,OAAS,EAC1BkR,EAAO,GACP67B,EAAgB/gC,IAEX1L,EAAI,EAAGA,GAAK+/D,EAAG//D,IAAK,CAC3B,IAAI06B,EAAS2jC,EAAar+D,GAC1B4Q,GAAQ8pB,EAAO9pB,KACf67B,EAAgBA,EAAcjkC,OAAOkyB,EAAO+R,eAE/B,KAAT77B,GAA+B,aAAhB8pB,EAAOj5B,OACxBmP,GAAQ,KACR67B,EAAgBA,EAAcnoC,KAAKmoC,EAAcr7B,SAGnD,IAAIzQ,EAAWJ,KAAKqgE,6BAA6BlmC,EAAOukC,cAExDruD,GAAQjQ,EAASiQ,KACjB67B,EAAgBA,EAAcjkC,OAAO7H,EAAS8rC,cAChD,CAEA,MAAO,CACL77B,KAAMA,EACN67B,cAAeA,EAEnB,EAEOyxB,CACT,CA3ewC,GAghBxC7sD,EAAOC,QA9B8B,SAAwCsgD,GAC3E,IACIxjD,EAAiBzO,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAK6O,EAOrFqyD,GARalhE,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAK8xD,GAMrFG,EAAOA,EAAKlrB,OAAOjF,QAAQw6B,EAAU,IAAIx6B,QAAQ26B,EA7sBvC,KA6sB0D36B,QAAQ46B,EAAgB,IAAI56B,QAAQ66B,EAAW,KAInH,IAAKuE,EACH,OAAO,KAIT,IAAI1C,EAvqBkB,SAA2B/vD,GACjD,IAAI+vD,EAAe,CAAC,EAkBpB,OAjBA/vD,EAAeiqB,SAAQ,SAAUzzB,EAAWk8D,GAC1C,IAAIC,EAAW,CAACD,EAAKxwD,cAEQrH,IAAzB63D,EAAKnpB,iBACPopB,EAASz8D,KAAKhE,MAAMygE,EAAUD,EAAKnpB,iBAGrCopB,EAASn5D,SAAQ,SAAU0I,QACKrH,IAA1Bk1D,EAAa7tD,GACf6tD,EAAa7tD,GAAW1L,EACkB,kBAA1Bu5D,EAAa7tD,GAC7B6tD,EAAa7tD,GAAW,CAAC6tD,EAAa7tD,GAAU1L,GAEhDu5D,EAAa7tD,GAAShM,KAAKM,EAE/B,GACF,IACO0J,EAAI6vD,EACb,CAmpBqB6C,CAAkB5yD,GAWrC,OAAO,IAAI8vD,EAAqBC,GARb,SAAsB/1B,EAAKkP,GAC5C,MAAY,OAARlP,EACiB,OAAZkP,EAAmB,oBAAsB,sBAG3C,IACT,IAE4DmnB,WAAWoC,GAAU/B,kBACnF,C,qCC3wBA,SAAS5iC,EAAcn8B,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAAyB,MAAhBN,UAAUK,GAAaL,UAAUK,GAAK,CAAC,EAAO67B,EAAUh8B,OAAO6G,KAAKzG,GAAqD,oBAAjCJ,OAAOq0B,wBAAwC2H,EAAUA,EAAQrzB,OAAO3I,OAAOq0B,sBAAsBj0B,GAAQwC,QAAO,SAAUs5B,GAAO,OAAOl8B,OAAOm8B,yBAAyB/7B,EAAQ87B,GAAKE,UAAY,MAAOJ,EAAQj0B,SAAQ,SAAU1H,GAAOi8B,EAAgBp8B,EAAQG,EAAKD,EAAOC,GAAO,GAAI,CAAE,OAAOH,CAAQ,CAEhe,SAASo8B,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAEhN,IAAI0+B,EAAe,EAAQ,OAEvBC,EAAmB,EAAQ,OAE3Bn6B,EAAe,EAAQ,OAEvBwgC,EAAc,EAAQ,OAEtB0hB,EAAmB,EAAQ,OAI3BzhB,GAFsB,EAAQ,OAEb,EAAQ,QAEzByvB,EAAsB,EAAQ,OAE9BC,EAAqB,EAAQ,OAE7BC,EAA0B,EAAQ,OAElC/1B,EAAoB,EAAQ,MAE5BC,EAAM,EAAQ,OAEdC,EAAY,EAAQ,OAEpB3vB,EAAY,EAAQ,OAEpB6vB,EAA8BH,EAAI,2BAClC3/B,EAAO4/B,EAAU5/B,KACjB4C,EAAMg9B,EAAUh9B,IAChBgT,EAAagqB,EAAUhqB,WAEvB8/C,EAAwB,SAA+Bt4D,EAAO8oC,GAChE,IAAI1xC,EAAM4I,EAAM5I,IACZuB,EAAOqH,EAAMrH,KACbsjC,EAAOj8B,EAAMi8B,KAWjB,MARsB,CACpBn0B,KAHS9H,EAAM8H,KAIfke,MAHUhmB,EAAMgmB,OAGA,EAChBrtB,KAAMA,GAAQ,WACdvB,IAAKA,GAAOkrC,IACZrG,KAAMz2B,EAAIy2B,GACV0H,cAAe40B,EAAoBv4D,EAAO8oC,GAG9C,EAEIyvB,EAAsB,SAA6Bv4D,EAAO8oC,GAC5D,IAAIhhC,EAAO9H,EAAM8H,KACb0wD,EAAkBx4D,EAAMgrD,aACxByN,EAAuBz4D,EAAMirD,kBAC7BD,EAAewN,GAAmB,GAGtC,OAAOL,EAAoBE,EAAwBvwD,EAF3B2wD,GAAwB,IAE6BL,EAAmBtwD,EAAMkjD,EAAarxD,QAAO,SAAU++D,GAClI,OAAO5vB,EAAUxxC,eAAeohE,EAAMthE,IACxC,IAAG6L,KAAI,SAAUy1D,GACf,OAAOtlC,EAAc,CAAC,EAAGslC,EAAO,CAC9BthE,IAAK0xC,EAAU4vB,EAAMthE,MAEzB,KACF,EAEIuhE,EAAkB,SAAyB34D,GAC7C,OAAOozB,EAAc,CAAC,EAAGpzB,EAAO,CAC9B5I,IAAK4I,EAAM5I,KAAOkrC,KAEtB,EAQIs2B,EAAkB,SAAyB76C,EAAOrE,EAAOm/C,GAC3D,IAAIC,EAAqBp/C,EAAMzW,KAAI,SAAUjD,GAC3C,OAAOozB,EAAc,CAAC,EAAGpzB,EAAO,CAC9B64D,UAAWA,GAEf,IAEA,OAAO96C,EAAMre,OAAOo5D,EAAmB5pD,UACzC,EAyEI6pD,EAAkB,SAAyBvG,EAAU1pB,GACvD,IAAIkwB,EAAiBxG,EAASp1B,OAAOtR,MAAK,SAAU9rB,GAClD,OAAOtJ,MAAMC,QAAQqJ,EAAMnI,WAAamI,EAAMnI,SAASjB,OAAS,CAClE,IACIw7D,EAAY1vB,IAAgCs2B,EAAiB7O,EAAiBO,2BAA2B8H,GAAUp1B,OAASo1B,EAASp1B,OAEzI,IAAKsF,EACH,OAdsB,SAA6BtF,EAAQ0L,GAC7D,OAAOtwB,EAAW4kB,EAAOn6B,KAAI,SAAUjD,GACrC,IAAI4xD,EAAe,IAAIzvB,EAAam2B,EAAsBt4D,EAAO8oC,IACjE,MAAO,CAAC8oB,EAAaxsB,SAAUwsB,EACjC,IACF,CASWqH,CAAoBD,EAAiB7O,EAAiBC,2BAA2BoI,GAAUp1B,OAASg1B,EAAWtpB,GAGxH,IAAIC,EA1EwB,SAAiC3L,EAAQ0L,GACrE,OAAO1L,EACNn6B,IAAI01D,GAAiBx9D,QAAO,SAAU4tC,EAAU/oC,EAAOoC,GACrD1L,MAAMC,QAAQqJ,EAAMnI,WAAgJgb,GAAU,GAE/K,IAAIhb,EAAWmI,EAAMnI,SAASoL,IAAI01D,GAE9BO,EAAmB,IAAI92B,EAAiBhP,EAAc,CAAC,EAAGklC,EAAsBt4D,EAAO8oC,GAAY,CACrGhF,YAAuB,IAAV1hC,EAAc,KAAOg7B,EAAOh7B,EAAQ,GAAGhL,IACpDysC,YAAazhC,IAAUg7B,EAAOxmC,OAAS,EAAI,KAAOwmC,EAAOh7B,EAAQ,GAAGhL,IACpES,SAAU+K,EAAK/K,EAASoL,KAAI,SAAU45C,GACpC,OAAOA,EAAMzlD,GACf,QAGF2xC,EAAWA,EAASxiC,IAAI2yD,EAAiB9zB,SAAU8zB,GAInD,IAFA,IAAIn7C,EAAQ66C,EAAgB,GAAI/gE,EAAUqhE,GAEnCn7C,EAAMnnB,OAAS,GAAG,CAEvB,IAAIsf,EAAO6H,EAAMd,MAEb47C,EAAY3iD,EAAK2iD,UACjBM,EAAWN,EAAUxwB,eAErB+wB,EAASD,EAASt7D,QAAQqY,EAAK9e,KAE/B8zD,EAAex0D,MAAMC,QAAQuf,EAAKre,UAEtC,IAAKqzD,EAAc,CAChBA,GAAmJr4C,GAAU,GAC9J,KACF,CAGA,IAAIwmD,EAAYnjD,EAAKre,SAASoL,IAAI01D,GAE9BW,EAAoB,IAAIl3B,EAAiBhP,EAAc,CAAC,EAAGklC,EAAsBpiD,EAAM4yB,GAAY,CACrGV,OAAQywB,EAAUzzB,SAClBvtC,SAAU+K,EAAKy2D,EAAUp2D,KAAI,SAAU45C,GACrC,OAAOA,EAAMzlD,GACf,KACA0sC,YAAwB,IAAXs1B,EAAe,KAAOD,EAAS72D,IAAI82D,EAAS,GACzDv1B,YAAau1B,IAAWD,EAASv1D,KAAO,EAAI,KAAOu1D,EAAS72D,IAAI82D,EAAS,MAI3ErwB,EAAWA,EAASxiC,IAAI+yD,EAAkBl0B,SAAUk0B,GAEpDv7C,EAAQ66C,EAAgB76C,EAAOs7C,EAAWC,EAC5C,CAEA,OAAOvwB,CACT,GAAGvwB,IACL,CAmBiB+gD,CAAwBnH,EAAWtpB,GAMlD,OAAOC,CACT,EAiCAxgC,EAAOC,QAhB0B,SAAoCgqD,GAClE97D,MAAMC,QAAQ67D,EAASp1B,SAAqGvqB,GAAU,GAEvI,IAAIi2B,EAlBmB,SAA4B0pB,GACnD,IAAIK,EAAeL,EAAS1pB,UACxBA,EAAY,CAAC,EAUjB,OARA/xC,OAAO6G,KAAKi1D,GAAc/zD,SAAQ,SAAU06D,GAC1C,IAAIC,EAAwB5G,EAAa2G,GACrC7gE,EAAO8gE,EAAsB9gE,KAC7BuxC,EAAauvB,EAAsBvvB,WACnCjO,EAAOw9B,EAAsBx9B,KAEjC6M,EAAU0wB,GAAgB/wB,EAAY0B,SAASxxC,EAAMuxC,EAAYjO,GAAQ,CAAC,EAC5E,IACO6M,CACT,CAKkB4wB,CAAmBlH,GAE/BzpB,EAAWgwB,EAAgBvG,EAAU1pB,GAErC/F,EAAiBgG,EAASlc,UAAY,IAAI6b,EAAmBA,EAAe2C,YAAYtC,EAAS5b,QAAQiY,UAC7G,OAAO,IAAIn9B,EAAa,CACtB8gC,SAAUA,EACVD,UAAWA,EACXzE,gBAAiBtB,EACjBuB,eAAgBvB,GAEpB,C,qCCnNA,IAAIb,EAAoB,EAAQ,OAI5Bt/B,EAFY,EAAQ,OAEHA,KAarB2F,EAAOC,QAXP,SAA6Bu0B,EAAciO,GACzC,IAAI2uB,EAAiB58B,EAAa95B,KAAI,SAAUrJ,EAAOyR,GACrD,IAAI0wB,EAASiP,EAAS3/B,GACtB,OAAO62B,EAAkBh8B,OAAO,CAC9BtM,MAAOA,EACPmiC,OAAQA,GAEZ,IACA,OAAOn5B,EAAK+2D,EACd,C,qCCfA,IAEIC,EAFe,EAAQ,OAEDA,OAwB1BrxD,EAAOC,QAnBP,SAA4BV,EAAM2yB,GAChC,IAAIuQ,EAAWt0C,MAAMoR,EAAKlR,QAAQsC,KAAK,MAevC,OAbIuhC,GACFA,EAAO37B,SAAQ,SAAU45D,GAMvB,IAHA,IAAIxlD,EAAQ0mD,EAAO9xD,EAAM,EAAG4wD,EAAM72D,QAAQjL,OACtCmV,EAAMmH,EAAQ0mD,EAAO9xD,EAAM4wD,EAAM72D,OAAQ62D,EAAM9hE,QAAQA,OAElDyU,EAAK6H,EAAO7H,EAAKU,EAAKV,IAC7B2/B,EAAS3/B,GAAMqtD,EAAMthE,GAEzB,IAGK4zC,CACT,C,qCCxBA,IAAI6uB,EAAe,EAAQ,OAGvBrwC,EADW,EAAQ,OACGA,WAEtBowC,EAASC,EAAaD,OACtBlwC,EAAYF,IAuBhBjhB,EAAOC,QAlBP,SAAiCV,EAAM2yB,GACrC,IAAI95B,EAASjK,MAAMoR,EAAKlR,QAAQsC,KAAKwwB,GAcrC,OAZI+Q,GACFA,EAAO37B,SAAQ,SAAU45D,GAIvB,IAHA,IAAIoB,EAASF,EAAO9xD,EAAM,EAAG4wD,EAAM72D,QAAQjL,OACvCmV,EAAM+tD,EAASF,EAAO9xD,EAAM4wD,EAAM72D,OAAQ62D,EAAM9hE,QAAQA,OAErDkjE,EAAS/tD,GACdpL,EAAOm5D,GAAUn5D,EAAOm5D,GAAQ76D,IAAIy5D,EAAM9+D,OAC1CkgE,GAEJ,IAGKn5D,CACT,C,iCCrBA4H,EAAOC,QAAU,CACfuxD,YALF,SAAqB3iE,GACnB,OAAc,MAAPA,GAAsB,IAAPA,CACxB,E,qCCJA,IAAIirC,EAAgB,EAAQ,OAExB9mC,EAAc,EAAQ,OAEtB6wC,EAAY,EAAQ,OAEpByR,EAA2B,EAAQ,MAEnC6D,EAAiB,EAAQ,OAEzBsY,EAAyB,EAAQ,OAEjCztB,EAAa,EAAQ,OAErB0tB,EAAe,EAAQ,OASvBC,EAAoB,IACpBC,EAAyB,IACzB1W,EAAYrX,EAAUU,UAAU,WAWpC,SAASsS,EAAYrjD,EAAa+L,EAAM0jC,EAAa9K,EAAWmS,GAC9D,IAAIpxC,EAAe4gC,EAAc+c,YAAYrjD,EAAYhC,oBAAqBgC,EAAY9B,eAAgB6N,EAAM0jC,EAAa9K,GAC7H,OAAOnlC,EAAYC,KAAKO,EAAa0F,EAAc,oBAAqBoxC,EAC1E,CAsJAtqC,EAAOC,QA1IP,SAA2BpE,EAAQ9N,QACW6J,IAAxCiE,EAAOg2D,+BACTh2D,EAAO+S,OAAO/S,EAAOg2D,8BACrBh2D,EAAOg2D,kCAA+Bj6D,GAGxC,IAAIpE,EAAcqI,EAAO0tC,mBACrBhM,EAAQxvC,EAAE2lC,KAGd,GAAK6J,EASL,GAAI1hC,EAAOtM,MAAMuiE,mBAAqB3Y,EAAet9C,EAAOtM,MAAMuiE,kBAAkBv0B,EAAO/pC,EAAazF,EAAEgkE,YACxGhkE,EAAEkC,qBADJ,CAQA,IAAIwB,EAAY+B,EAAY9B,eACxB8rD,EAAiB/rD,EAAUgrC,iBAC3Bga,EAAYhlD,EAAUM,eAE1B,IAAKN,EAAUytD,cAGb,OAFAnxD,EAAEkC,sBACF4L,EAAO+S,OAAOioC,EAAYrjD,EAAa+pC,EAAO/pC,EAAYvC,wBAAyBqkD,EAAyB9hD,EAAYhC,oBAAqBgC,EAAY9B,iBAAiB,IAI5K,IA7DsC6oC,EA6DlCv+B,EAAiB66C,EAAYrjD,EAAa+pC,EAAO/pC,EAAYvC,wBAAyBqkD,EAAyB9hD,EAAYhC,oBAAqBgC,EAAY9B,iBAAiB,GAE7KsgE,GAAoB,EAQxB,GANKA,IAGHA,EAAoBP,EAAuB51D,EAAO0vC,+BAG/CymB,EAAmB,CAmCtB,IAAIC,EAAez+D,EAAYihD,aAAagC,GACxCyb,EAAel2D,EAAey4C,aAAagC,GAC/Cub,EAAoBC,EAAa52D,OAAS62D,EAAa72D,MAAQ42D,EAAa/pC,IAAIgqC,GAAcj7D,MAAK,SAAU7H,GAC3G,IAAI+iE,EAAa/iE,EAAK,GAClBgjE,EAAahjE,EAAK,GAElBijE,EAAWF,EAAWp4D,IAAI,SAC1Bu4D,EAAgBD,GAAYA,GAAY7U,EAAiBjgB,EAAMlvC,OAAS,GACxEkkE,EAASJ,EAAWp4D,IAAI,OACxBy4D,EAAcD,GAAUA,GAAU/U,EAAiBjgB,EAAMlvC,OAAS,GAClEokE,EAAWL,EAAWr4D,IAAI,SAC1B24D,EAASN,EAAWr4D,IAAI,OACxB44D,EAAkBP,EAAWr4D,IAAI,gBACrC,OACEo4D,EAAWp4D,IAAI,kBAAoB44D,GACnCR,EAAWp4D,IAAI,UAAUsB,OAAS+2D,EAAWr4D,IAAI,UAAUsB,MAC3Di3D,IAAkBG,GAAYD,IAAgBE,GAC3B,MAAnBC,GAA2BD,EAASD,IAAaF,EAASF,CAE9D,GACF,CAUA,GARKL,IAhIiCz3B,EAiIegD,EAAnDy0B,EAhIK9W,IAAc3gB,GAAao3B,GAAqBp3B,GAAaq3B,IAmI/DI,IACHA,EAAoBhuB,EAAWhoC,EAAes7C,mBAAmBv9C,IAAI08C,KAAezS,EAAWxwC,EAAY8jD,mBAAmBv9C,IAAI08C,IAGhIub,EAMF,OALAjkE,EAAEkC,iBACF+L,EAAiBhJ,EAAYgL,IAAIhC,EAAgB,CAC/CsuC,gBAAgB,SAElBzuC,EAAO+S,OAAO5S,GAKhBA,EAAiBhJ,EAAYgL,IAAIhC,EAAgB,CAC/CkoD,wBAAyBloD,EAAexK,sBAM1CqK,EAAOg2D,6BAA+B71D,EACtC01D,GAAa,gBACiC95D,IAAxCiE,EAAOg2D,+BACTh2D,EAAO+S,OAAO/S,EAAOg2D,8BACrBh2D,EAAOg2D,kCAA+Bj6D,EAE1C,GAjHA,CAkHF,C,qCC3LA,IAAI5E,EAAc,EAAQ,OAEtB4/D,EAAe,EAAQ,MAEvBC,EAAmB,EAAQ,OAqC/B7yD,EAAOC,QAnCP,SAAoBpE,EAAQ9N,GAS1B,IAAI4iD,EAAgB5iD,EAAE0rD,cAAc9I,cAEpC,IAECmiB,QAAQj3D,EAAOtM,MAAMwjE,0BAA4BF,EAAiBliB,KAAmBA,EAAcqiB,KAAM,CACxG,IAAIC,EAAatiB,EAAcuiB,YAAYxhE,eAEvCq4C,EAAaluC,EAAOA,OAEM,IAA1Bo3D,EAAWE,YAAoBP,EAAa7oB,EAAYkpB,EAAW7G,aAAewG,EAAa7oB,EAAYkpB,EAAWG,YACxHH,EAAWI,iBAEf,CAEA,IAAI7/D,EAAcqI,EAAO0tC,mBACrB+pB,EAAmB9/D,EAAY9B,eAEnC,GAAK4hE,EAAiBxpB,cAAtB,CAIA,IAAIr4C,EAAY6hE,EAAiBt1D,IAAI,YAAY,GACjDnC,EAAOtM,MAAM2/C,QAAUrzC,EAAOtM,MAAM2/C,OAAOnhD,GAC3C8N,EAAO+S,OAAO5b,EAAYikD,gBAAgBzjD,EAAa/B,GAJvD,CAKF,C,qCCvCA,IAAIuB,EAAc,EAAQ,OAgB1BgN,EAAOC,QATP,SAAgCpE,EAAQ9N,GACtC8N,EAAOivC,QAAQ,aACfjvC,EAAO+S,OAAO5b,EAAYgL,IAAInC,EAAO0tC,mBAAoB,CACvD2M,mBAAmB,KAGrBr6C,EAAOgwC,oBAAoB99C,EAC7B,C,oCCdA,IAAIwlE,EAA2B,EAAQ,OAoBvCvzD,EAAOC,QAZP,SAAoBpE,EAAQ9N,GACR8N,EAAO0tC,mBACG73C,eAEdwtD,cACZnxD,EAAEkC,iBAIJ4L,EAAO23D,aAAaD,EAAyB13D,EAAO0tC,oBACtD,C,qCClBA,IAAIzP,EAAgB,EAAQ,OAExB9mC,EAAc,EAAQ,OAEtB01C,EAAQ,EAAQ,MAEhB6qB,EAA2B,EAAQ,OAEnC5qB,EAAoB,EAAQ,OAE5B8qB,EAAS,EAAQ,OA+CrBzzD,EAAOC,QAnCP,SAAmBpE,EAAQ9N,GACzB,IAGI67C,EAHAp2C,EAAcqI,EAAO0tC,mBACrB93C,EAAY+B,EAAY9B,eACxBuN,EAAUlR,EAAEW,OAGhB,GAAI+C,EAAUytD,cACZnxD,EAAEkC,qBADJ,CAOA,GAAIwjE,EAAOx0D,GAAU,CACnB,IAAI0O,EAAO1O,EACX2qC,EAAiBjB,EAAkBD,EAAMuB,gBAAgBt8B,GAC3D,CAEA,IAAI8tB,EAAW83B,EAAyB//D,GACxCqI,EAAO23D,aAAa/3B,GAEpB5/B,EAAOivC,QAAQ,OAEf6K,YAAW,WACT95C,EAAOk7C,iBAAiBnN,GACxB/tC,EAAOsvC,kBACPtvC,EAAO+S,OAIX,SAAwBpb,GACtB,IAAIqoC,EAAa/B,EAAcY,YAAYlnC,EAAYhC,oBAAqBgC,EAAY9B,eAAgB,WACxG,OAAOsB,EAAYC,KAAKO,EAAaqoC,EAAY,eACnD,CAPkB63B,CAAelgE,GAC/B,GAAG,EAlBH,CAmBF,C,iCC1CAwM,EAAOC,QALP,SAAwBpE,EAAQ9N,GAC9B8N,EAAOivC,QAAQ,QACf/8C,EAAEkC,gBACJ,C,iCCEA+P,EAAOC,QALP,SAAyBpE,GACvBA,EAAOy+C,eAAgB,EACvBz+C,EAAOivC,QAAQ,OACjB,C,qCCNA,IAAI93C,EAAc,EAAQ,OAEtB6wC,EAAY,EAAQ,OA6BxB7jC,EAAOC,QA3BP,SAAqBpE,EAAQ9N,GAC3B,IAAIyF,EAAcqI,EAAO0tC,mBACrB+pB,EAAmB9/D,EAAY9B,eAEnC,IAAI4hE,EAAiBxpB,cAArB,CAIA,IAAIr4C,EAAY6hE,EAAiBt1D,IAAI,YAAY,GACjDnC,EAAOtM,MAAMogD,SAAW9zC,EAAOtM,MAAMogD,QAAQ5hD,GAWzC81C,EAAUU,UAAU,wBACtB1oC,EAAO+S,OAAO5b,EAAYs3C,eAAe92C,EAAa/B,IAEtDoK,EAAO+S,OAAO5b,EAAYikD,gBAAgBzjD,EAAa/B,GAjBzD,CAmBF,C,oCC7BA,IAAIqoC,EAAgB,EAAQ,OAExBkX,EAAiB,EAAQ,MAEzBh+C,EAAc,EAAQ,OAEtB6wC,EAAY,EAAQ,OAGpB2tB,EADW,EAAQ,OACIA,YAEvB1tB,EAAwB,EAAQ,OAEhC6vB,EAA2B,EAAQ,OAEnC3vB,EAAa,EAAQ,OAErB4vB,EAAU/vB,EAAUgwB,SAAS,SAoLjC7zD,EAAOC,QAhJP,SAAqBpE,EAAQ9N,QACiB6J,IAAxCiE,EAAOg2D,+BACTh2D,EAAO+S,OAAO/S,EAAOg2D,8BACrBh2D,EAAOg2D,kCAA+Bj6D,GAIxC,IACIk8D,EADsBj4D,EAAOA,OACM80C,cAAcuiB,YAAYxhE,eAC7D06D,EAAa0H,EAAa1H,WAC1BlN,EAAc4U,EAAa5U,YAC3B6U,GAAyC,OAAf3H,QAAsC,IAAfA,OAAwB,EAASA,EAAW1+C,YAAcs3B,KAAK2W,YAA6B,OAAfyQ,QAAsC,IAAfA,OAAwB,EAASA,EAAW1+C,YAAcs3B,KAAKgvB,aAExN,GAAkB,MAAd5H,IAAsB2H,EAA1B,CAKA,GAAI3H,EAAW1+C,WAAas3B,KAAK2W,YAA6C,OAA/ByQ,EAAW6H,iBAAuD,OAA3B7H,EAAW9wB,aAAuB,CAKtH,IAAI44B,EAAO9H,EAAW+H,WAEtB,GAAY,MAARD,EAEF,OAGF9H,EAAWgI,UAAYF,EAAKvuB,YAE5B,IAAK,IAAI2O,EAAQ4f,EAAKvqB,WAAqB,MAAT2K,EAAeA,EAAQA,EAAMhZ,YACzDgZ,IAAU8X,GACZ8H,EAAKG,YAAY/f,EAGvB,CAEA,IAAIggB,EAAUlI,EAAWzmB,YACrBnyC,EAAcqI,EAAO0tC,mBACrB3D,EAAY5B,EAAWF,EAAsBsoB,IAE7ChW,EAAwBpF,EAAeqF,OAAOzQ,GAC9CnC,EAAW2S,EAAsB3S,SACjCvG,EAAekZ,EAAsBlZ,aACrCoZ,EAAUF,EAAsBE,QAEhCC,EAAwB/iD,EAAYihD,aAAahR,GAAU3e,MAAM,CAACoY,EAAc,SAAUoZ,IAC1F3rC,EAAQ4rC,EAAsB5rC,MAC9BnH,EAAM+yC,EAAsB/yC,IAE5B3Q,EAAUW,EAAYhC,oBACtBiG,EAAQ5E,EAAQjB,eAAe6xC,GAC/B8wB,EAAY98D,EAAM2B,UAAUY,MAAM2Q,EAAOnH,GAU7C,GALI8wD,EAAQh9D,SA9FO,UA+FjBg9D,EAAUA,EAAQt6D,MAAM,GAAI,IAI1Bs6D,IAAYC,EAAhB,CA0BA,IAiBIpiE,EAAcC,EAAaixC,EAAaE,EAjBxC9xC,EAAY+B,EAAY9B,eAExBwqC,EAAczqC,EAAUc,MAAM,CAChCJ,aAAcwY,EACdvY,YAAaoR,EACbmzC,YAAY,IAEVxe,EAAY1gC,EAAM4nC,YAAY10B,GAC9B6oB,EAASg+B,EAAYr5B,GAAatlC,EAAQ+kC,UAAUO,GAAa,KAEjEq8B,EAAgC,aADT,MAAVhhC,EAAiBA,EAAO8pB,gBAAkB,MAMvDiJ,EAAaiO,EAAiB,oBAAsB,eACpD34B,EAAa/B,EAAc+c,YAAYhkD,EAASqpC,EAAao4B,EAAS78D,EAAM2nC,iBAAiBz0B,GAAQ6pD,EAAiB/8D,EAAM4nC,YAAY10B,GAAS,MAGrJ,GAAIipD,EAGFzhE,EAAe2hE,EAAa3hE,aAC5BC,EAAc0hE,EAAa1hE,YAE3BmxC,GADAF,EAAc14B,EAAQhI,KAAKkB,IAAI1R,EAAcC,IACnBuQ,KAAKkI,IAAI1Y,EAAeC,GAClDD,EAAekxC,EACfjxC,EAAcmxC,MACT,CAML,IAAIkxB,EAAYH,EAAQjmE,OAASkmE,EAAUlmE,OAC3Cg1C,EAAc5xC,EAAUgrC,iBACxB8G,EAAY9xC,EAAUirC,eACtBvqC,EAAe+sD,EAAc3b,EAAYkxB,EAAYpxB,EACrDjxC,EAAcmxC,EAAYkxB,CAC5B,CAKA,IAAIC,EAAkC74B,EAAWtpC,MAAM,CACrDupC,gBAAiBjpC,EAAQ+nC,oBACzBmB,eAAgBtqC,EAAUc,MAAM,CAC9BJ,aAAcA,EACdC,YAAaA,MAGjByJ,EAAO+S,OAAO5b,EAAYC,KAAKO,EAAakhE,EAAiCnO,GArD7E,KAxBA,CAWE,IAAIoO,EAAY5mE,EAAEsrD,YAAYsb,UAE9B,GAAIA,EAAW,CACb,IAAI34D,EA/GV,SAAqB24D,EAAWnhE,GAC9B,MACO,0BADCmhE,EAEGhB,EAAyBngE,GAG7BA,CACT,CAwG2BohE,CAAYD,EAAWnhE,GAE5C,GAAIwI,IAAmBxI,EAGrB,OAFAqI,EAAOk7C,wBACPl7C,EAAO+S,OAAO5S,EAGlB,CAGF,CAxEA,CA8HF,C,qCCnMA,IAAI89B,EAAgB,EAAQ,OAExB9mC,EAAc,EAAQ,OAEtB+zC,EAAiB,EAAQ,OAEzBmO,EAAO,EAAQ,OAEf2T,EAAqB,EAAQ,OAE7BhlB,EAAY,EAAQ,OAEpBsV,EAAiB,EAAQ,OAEzB0b,EAAmC,EAAQ,OAE3CC,EAA0B,EAAQ,OAElCC,EAAuB,EAAQ,OAE/BC,EAA0B,EAAQ,OAElCC,EAAsC,EAAQ,OAE9CC,EAAwC,EAAQ,OAEhDvB,EAA2B,EAAQ,OAEnCwB,EAAwB,EAAQ,MAEhCC,EAAgC,EAAQ,OAExCC,EAAiB,EAAQ,MAEzBhO,EAAqBtgB,EAAesgB,mBACpCpM,EAAWpX,EAAUU,UAAU,UA4KnCvkC,EAAOC,QAlHP,SAAuBpE,EAAQ9N,GAC7B,IAAIunE,EAAUvnE,EAAE8nD,MACZriD,EAAcqI,EAAO0tC,mBAEzB,SAASgsB,EAAsBC,GAC7B,IAAIC,EAAoB55D,EAAOtM,MAAMimE,GAErC,QAAIC,IACFA,EAAkB1nE,IACX,EAIX,CAEA,OAAQunE,GACN,KAAKpgB,EAAKe,OAIR,GAHAloD,EAAEkC,iBAGE4L,EAAOtM,MAAMmmE,cAAgBvc,EAAet9C,EAAOtM,MAAMmmE,aAAa3nE,EAAGyF,IAC3E,OAGF,MAEF,KAAK0hD,EAAKygB,IAGR,GAFA5nE,EAAEkC,iBAEEslE,EAAsB,YACxB,OAGF,MAEF,KAAKrgB,EAAK0gB,IACR,GAAIL,EAAsB,SACxB,OAGF,MAEF,KAAKrgB,EAAK2gB,GACR,GAAIN,EAAsB,aACxB,OAGF,MAEF,KAAKrgB,EAAKY,MACR,GAAIyf,EAAsB,gBACxB,OAGF,MAEF,KAAKrgB,EAAK4gB,KACR,GAAIP,EAAsB,eACxB,OAGF,MAEF,KAAKrgB,EAAKa,KACR,GAAIwf,EAAsB,eACxB,OAGF,MAEF,KAAKrgB,EAAK6gB,MAEJ9a,GAAYoM,EAAmBt5D,IACjCA,EAAEkC,iBAKR,IAAIyF,EAAUmG,EAAOtM,MAAMgG,aAAaxH,GAExC,GAAe,MAAX2H,GAA+B,KAAZA,EAYvB,GAAgB,SAAZA,GAWJ,GAFA3H,EAAEkC,kBAEE4L,EAAOtM,MAAMkG,mBAAoB0jD,EAAet9C,EAAOtM,MAAMkG,iBAAiBC,EAASlC,EAAazF,EAAEgkE,YAA1G,CAIA,IAAIn8D,EAhKN,SAAsBF,EAASlC,EAAazF,GAC1C,OAAQ2H,GACN,IAAK,OACH,OAAO1C,EAAY4zD,KAAKpzD,GAE1B,IAAK,SACH,OAAO2hE,EAAsB3hE,GAE/B,IAAK,cACH,OAAOuhE,EAAqBvhE,GAE9B,IAAK,YACH,OAAOmgE,EAAyBngE,GAElC,IAAK,iBACH,OAAOshE,EAAwBthE,GAEjC,IAAK,6BACH,OAAOqhE,EAAiCrhE,EAAazF,GAEvD,IAAK,cACH,OAAOinE,EAAwBxhE,GAEjC,IAAK,uBACH,OAAO4hE,EAA8B5hE,GAEvC,IAAK,mCACH,OAAO0hE,EAAsC1hE,GAE/C,IAAK,iCACH,OAAOyhE,EAAoCzhE,GAE7C,IAAK,gBACH,OAAOq1D,EAAmB1f,IAAI31C,GAEhC,IAAK,kBACH,OAAOq1D,EAAmBG,MAAMx1D,GAElC,QACE,OAAOA,EAEb,CAuHiBwiE,CAAatgE,EAASlC,EAAazF,GAE9C6H,IAAapC,GACfqI,EAAO+S,OAAOhZ,EALhB,OAVEy/D,EAAetnE,EAAGyF,EAAaqI,EAAO+S,aAdtC,GAAI0mD,IAAYpgB,EAAK6gB,OAAS9a,GAAYoM,EAAmBt5D,GAAI,CAI/D,IAAImL,EAAe4gC,EAAc+c,YAAYrjD,EAAYhC,oBAAqBgC,EAAY9B,eAAgB,QAC1GmK,EAAO+S,OAAO5b,EAAYC,KAAKO,EAAa0F,EAAc,qBAC5D,CAyBJ,C,qCC7MA,IAAIwgC,EAAkB,EAAQ,OAE1BC,EAAoB,EAAQ,OAE5Bof,EAAe,EAAQ,OAEvBjf,EAAgB,EAAQ,OAExBumB,EAAsB,EAAQ,OAE9BrtD,EAAc,EAAQ,OAEtBi0C,EAAqB,EAAQ,MAE7BqO,EAA2B,EAAQ,MAEnC2D,EAA0B,EAAQ,KAElCE,EAAiB,EAAQ,OAEzB8c,EAA0B,EAAQ,OAuItC,SAASC,EAAe1iE,EAAaioC,EAAU8E,GAC7C,IAAI1E,EAAa/B,EAAc8B,oBAAoBpoC,EAAYhC,oBAAqBgC,EAAY9B,eAAgB+pC,GAIhH,OAAOzoC,EAAYC,KAAKO,EAAaqoC,EAAW79B,IAAI,YAAauiC,GAAY,kBAC/E,CAQAvgC,EAAOC,QA/IP,SAAqBpE,EAAQ9N,GAC3BA,EAAEkC,iBACF,IAAIyjC,EAAO,IAAIqlB,EAAahrD,EAAEooE,eAE9B,IAAKziC,EAAK0iC,aAAc,CACtB,IAAIpc,EAAQtmB,EAAKumB,WACboc,EAAkB3iC,EAAKt6B,UAE3B,GAAI4gD,EAAM3rD,OAAS,EAAG,CAGpB,GAAIwN,EAAOtM,MAAM+mE,mBAAqBnd,EAAet9C,EAAOtM,MAAM+mE,kBAAkBtc,IAClF,OA4BF,YArBAf,EAAwBe,GAAO,SAE/BG,GAGE,GAFAA,EAAWA,GAAYkc,EAEvB,CAIA,IAAI7iE,EAAcqI,EAAO0tC,mBACrB1U,EAASohC,EAAwB9b,GACjC5f,EAAYZ,EAAkBh8B,OAAO,CACvCtM,MAAOmC,EAAYvC,wBACnBuiC,OAAQ8hB,EAAyB9hD,EAAYhC,oBAAqBgC,EAAY9B,kBAE5Eu7D,EAAmBhmB,EAAmB0gB,oBAAoBn0D,GAC1D+L,EAAO8gD,EAAoBG,YAAY3rB,EAAQ0F,EAAW0yB,GAC1DxxB,EAAW/B,EAAgBgC,gBAAgBn8B,GAC3Cg3D,EAAmBz8B,EAAc8B,oBAAoBpoC,EAAYhC,oBAAqBgC,EAAY9B,eAAgB+pC,GACtH5/B,EAAO+S,OAAO5b,EAAYC,KAAKO,EAAa+iE,EAAkB,mBAZ9D,CAaF,GAEF,CACF,CAEA,IAAI9V,EAAa,GACblhD,EAAOm0B,EAAKt6B,UACZmnD,EAAO7sB,EAAK8iC,UACZhjE,EAAcqI,EAAO0tC,mBAEzB,GAAI1tC,EAAOtM,MAAMknE,iBAAkB,CACjC,IAAIC,EAAwB76D,EAAOtM,MAAMknE,iBAAiBl3D,EAAMghD,GAIhEhhD,EAHoBm3D,EAAsBn3D,KAI1CghD,EAHoBmW,EAAsBnW,IAI5C,CAEA,IAAI1kD,EAAOtM,MAAMonE,mBAAoBxd,EAAet9C,EAAOtM,MAAMonE,iBAAiBp3D,EAAMghD,EAAM/sD,IAA9F,CAQA,GAJI+L,IACFkhD,EAAawV,EAAwB12D,KAGlC1D,EAAOtM,MAAMuhD,kBAAmB,CAQnC,IAGM8lB,EAHFC,EAAoBh7D,EAAOi7D,eAE/B,IAAKj7D,EAAOtM,MAAMknE,kBAAoB/iC,EAAK0iC,cAAgBS,GAGzD,IAEmG,KAA/E,QAAlBD,EAAQrW,SAA4B,IAAVqW,OAAmB,EAASA,EAAMthE,QAAQuG,EAAOgxC,kBAGvD,IAAtB4T,EAAWpyD,QAA2C,IAA3BwoE,EAAkBx7D,MAAcw7D,EAAkBjyC,QAAQxrB,YAAcmG,EAEjG,YADA1D,EAAO+S,OAAOsnD,EAAer6D,EAAO0tC,mBAAoBstB,SAGrD,GAAIA,GAAqBnjC,EAAKqjC,MAAMtrD,SAAS,0BAA4BioB,EAAKqjC,MAAMtrD,SAAS,cAiDxG,SAAwCg1C,EAAYjgB,GAClD,OAAOigB,EAAWpyD,SAAWmyC,EAASnlC,MAAQmlC,EAAS9gB,WAAW7V,OAAM,SAAUpS,EAAOqL,GACvF,OAAOrL,EAAM2B,YAAcqnD,EAAW39C,EACxC,GACF,CArDwHk0D,CAA+BvW,EAAYoW,GAK7J,YADAh7D,EAAO+S,OAAOsnD,EAAer6D,EAAO0tC,mBAAoBstB,IAK1D,GAAItW,EAAM,CACR,IAAI0W,EAAe5W,EAAoBC,YAAYC,EAAM1kD,EAAOtM,MAAMwN,gBAEtE,GAAIk6D,EAAc,CAChB,IAAIp0B,EAAgBo0B,EAAap0B,cAC7BtC,EAAY02B,EAAa12B,UAE7B,GAAIsC,EAAe,CACjB,IAAIq0B,EAAUx9B,EAAgBgC,gBAAgBmH,GAE9C,YADAhnC,EAAO+S,OAAOsnD,EAAer6D,EAAO0tC,mBAAoB2tB,EAAS32B,GAEnE,CACF,CACF,CAIA1kC,EAAO23D,aAAa,KACtB,CAEA,GAAI/S,EAAWpyD,OAAQ,CACrB,IAAIksC,EAAYZ,EAAkBh8B,OAAO,CACvCtM,MAAOmC,EAAYvC,wBACnBuiC,OAAQ8hB,EAAyB9hD,EAAYhC,oBAAqBgC,EAAY9B,kBAE5Eu7D,EAAmBhmB,EAAmB0gB,oBAAoBn0D,GAC1D2jE,EAAe9W,EAAoBG,YAAYC,EAAYlmB,EAAW0yB,GACtEmK,EAAU19B,EAAgBgC,gBAAgBy7B,GAC9Ct7D,EAAO+S,OAAOsnD,EAAer6D,EAAO0tC,mBAAoB6tB,GAC1D,CAlEA,CAmEF,C,qCCzJA,IAAIC,EAAsB,EAAQ,OAE9BrkE,EAAc,EAAQ,OAEtBoiD,EAA8B,EAAQ,OAEtCC,EAA0B,EAAQ,OAqCtCr1C,EAAOC,QAnCP,SAAsBpE,GACpB,GAAIA,EAAO2tC,oBAAsB3tC,EAAO0tC,qBAAuB1tC,EAAOtM,MAAMiE,aAC1E,GAAIqI,EAAO2tC,mBAAoB,CAC7B,IAEIhP,EAFe3+B,EAAOtM,MAAMiE,YAEE9B,eAElC2lE,EAAoBjZ,yBAAyB,CAE3CkZ,cAAe,MACfC,YAAarwC,KAAKC,UAAU,CAC1BqwC,YAAY,IAAI/sD,OAAQ+K,QAE1BglB,eAAgBtT,KAAKC,UAAUqT,EAAe5/B,SAElD,MAdF,CAmBA,IAAIpH,EAAcqI,EAAOtM,MAAMiE,YAC3BikE,EAAoBpiB,EAAwB7hD,EAAa4hD,EAA4Bv5C,IACrF67D,EAAwBD,EAAkBj9B,eAE1Ck9B,IAA0BlkE,EAAY9B,iBAEtC8B,EADEikE,EAAkBE,cACN3kE,EAAYs3C,eAAe92C,EAAakkE,GAExC1kE,EAAYikD,gBAAgBzjD,EAAakkE,GAGzD77D,EAAO+S,OAAOpb,GAbhB,CAeF,C,qCCzCA,IAAIiuD,EAAiB,EAAQ,OAIzBmW,EAFe,EAAQ,OAEDA,OA0B1B53D,EAAOC,QArBP,SAA4BxI,EAAOogE,GACjC,IAAIC,EAAU,GAiBd,OAhBArgE,EAAMgoC,kBAAiB,SAAUlF,GAC/B,QAASA,EAAU3C,WACrB,IAAG,SAEHjtB,EAEAnH,GACE,IAAIjE,EAAO9H,EAAM2B,UACbvK,EAAM4I,EAAM4nC,YAAY10B,GAC5BmtD,EAAQ7kE,KAAK,CACXqG,OAAQs+D,EAAOr4D,EAAKvF,MAAM,EAAG2Q,IAC7Btc,OAAQupE,EAAOr4D,EAAKvF,MAAM2Q,EAAOnH,IAEjC3U,IAAKiL,OAAO+9D,EAAWpW,EAAet6B,UAAUt4B,MAEpD,IACOipE,CACT,C,qCC5BA,IAAIxG,EAAe,EAAQ,OAEvBx0B,EAAsB,EAAQ,OAE9BU,EAAW,SAAkBh0B,EAAGC,GAClC,OAAOD,IAAMC,CACf,EAEIsuD,EAAW,SAAkBvuD,GAC/B,QAASA,CACX,EAEIwuD,EAAc,GAuClBh4D,EAAOC,QAVP,SAAiCxI,GAC/B,IAAIwgE,EAAYxgE,EAAMsgC,mBAAmBr9B,KAAI,SAAUwR,GACrD,OAAOA,EAAEmmB,UACX,IAAGrpB,SACCkpB,EAAS+lC,EAAU36C,UAAU6F,QAAQzoB,KAAI,SAAUrJ,GACrD,OA5BJ,SAAkCoG,EAAOwgE,EAAWC,GAClD,IAAIhmC,EAAS,GAETimC,EAAkBF,EAAUv9D,KAAI,SAAUrJ,GAC5C,OAAOA,EAAMH,IAAIgnE,EACnB,IAAGlvD,SAUH,OATA8zB,EAAoBq7B,EAAiB36B,EACrCu6B,GAAU,SAAUptD,EAAOnH,GACzB,IAAIjE,EAAO9H,EAAM2B,UACjB84B,EAAOj/B,KAAK,CACVqG,OAAQg4D,EAAasG,OAAOr4D,EAAKvF,MAAM,EAAG2Q,IAC1Ctc,OAAQijE,EAAasG,OAAOr4D,EAAKvF,MAAM2Q,EAAOnH,IAC9CnS,MAAO6mE,GAEX,IACOhmC,CACT,CAYWkmC,CAAyB3gE,EAAOwgE,EAAW5mE,EACpD,IACA,OAAOlD,MAAMW,UAAUqI,OAAOlI,MAAM+oE,EAAa9lC,EAAOt3B,OAC1D,C,qCCjDA,IAAI02D,EAAe,EAAQ,OAEvBtY,EAA6B,EAAQ,OAErCqf,EAAsB,EAAQ,OAE9B/tD,EAAY,EAAQ,OAuCxB,SAASguD,EAAkBC,EAAO1pC,GAMhC,IALA,IAAI2pC,EAASnuD,IACTouD,EAAYpuD,IACZquD,GAAUruD,IACVsuD,GAAatuD,IAERvH,EAAK,EAAGA,EAAKy1D,EAAMlqE,OAAQyU,IAAM,CACxC,IAAI81D,EAAOL,EAAMz1D,GAEE,IAAf81D,EAAKpoE,OAA8B,IAAfooE,EAAKpoE,QAW7BgoE,EAAS71D,KAAKkB,IAAI20D,EAAQI,EAAKC,KAC/BJ,EAAY91D,KAAKkB,IAAI40D,EAAWG,EAAKE,QACrCJ,EAAS/1D,KAAKC,IAAI81D,EAAQE,EAAKC,KAC/BF,EAAYh2D,KAAKC,IAAI+1D,EAAWC,EAAKE,QACvC,CAEA,OAAOJ,GAAUD,GAAaC,EAASF,EAAS3pC,GAAc8pC,EAAYF,EAAY5pC,CACxF,CAMA,SAASkqC,EAAcprD,GAErB,OAAQA,EAAKD,UACX,KAAKs3B,KAAKg0B,mBACR,OAAO,EAET,KAAKh0B,KAAK2W,UACV,KAAK3W,KAAKi0B,4BACV,KAAKj0B,KAAKk0B,aACR,OAAOvrD,EAAKtf,OAEd,QACE,OAAOsf,EAAKogD,WAAW1/D,OAE7B,CA8FA2R,EAAOC,QAvFP,SAAkCkwD,GAC/BA,EAAMgJ,WAAqI7uD,GAAU,GAEtJ,IAAI8uD,GADJjJ,EAAQA,EAAMkJ,cACgBzf,eAEK,IAA/Bwf,EAAkB1rD,WACpB0rD,EAAoBA,EAAkBjF,YAGxC,IAAItlC,EAhGN,SAAyB5vB,GACvB,IAAIq6D,EAAWC,iBAAiBt6D,GAC5Bu6D,EAAkBxgB,EAA2B/5C,GAC7Cw6D,EAAMD,EAAgBtzB,cAAc,OACxCuzB,EAAIpoE,MAAMk1C,WAAa+yB,EAAS/yB,WAChCkzB,EAAIpoE,MAAMqoE,SAAWJ,EAASI,SAC9BD,EAAIpoE,MAAMo1C,UAAY6yB,EAAS7yB,UAC/BgzB,EAAIpoE,MAAMs9B,WAAa2qC,EAAS3qC,WAChC8qC,EAAIpoE,MAAMw9B,WAAayqC,EAASzqC,WAChC4qC,EAAIpoE,MAAMsoE,SAAW,WACrBF,EAAI9zB,YAAc,IAClB,IAAIi0B,EAAeJ,EAAgBxG,KAClC4G,GAAmGtvD,GAAU,GAE9GsvD,EAAaC,YAAYJ,GACzB,IAAIb,EAAOa,EAAIK,wBAEf,OADAF,EAAavF,YAAYoF,GAClBb,EAAKtoE,MACd,CA8EmBypE,CAAgBX,GAW7BY,EAAgB7J,EAAM8J,aACtBC,EAAa/J,EAAM5sB,UAGvB,IAFA4sB,EAAMgK,SAAShK,EAAMvW,eAAgB,GAE9B0e,EAAkBD,EAAoBlI,GAAQthC,KACnDmrC,EAAgB7J,EAAMvW,eACtBsgB,EAAa/J,EAAM9sB,YAClB22B,EAAc7F,YAA8H7pD,GAAU,GACvJ6lD,EAAMiK,eAAeJ,GAEU,IAA3BA,EAActsD,UAA8D,WAA5C6rD,iBAAiBS,GAAeK,WAiBtE,IAHA,IAAIC,EAAmBN,EACnBO,EAAqBL,EAAa,IAEnC,CAID,IAHA,IAAI9F,EAAYkG,EAAiBlG,UAC7BtxD,EAAKy3D,EAEFz3D,GAAM,EAAGA,IACd,KAAiB,MAAbsxD,GAAqBtxD,EAAK,GAAKwuD,EAAakJ,gBAAgBpG,EAAWtxD,EAAK,IAAhF,CAQA,GAFAqtD,EAAMgK,SAASG,EAAkBx3D,IAE7Bw1D,EAAkBD,EAAoBlI,GAAQthC,GAIhD,MAHAmrC,EAAgBM,EAChBJ,EAAap3D,CANf,CAYF,IAAY,IAARA,GAAoD,IAAvCw3D,EAAiBvM,WAAW1/D,OAQ3C,MAIFksE,EAAqBxB,EADrBuB,EAAmBA,EAAiBvM,WAAWjrD,GAEjD,CAGA,OADAqtD,EAAMgK,SAASH,EAAeE,GACvB/J,CACT,C,qCCxLA,IAAInX,EAA6B,EAAQ,OAErCyhB,EAA+B,EAAQ,OAsB3Cz6D,EAAOC,QAhBP,SAA+B0N,GAG7B,IAFA,IAAI+sD,EAAa/sD,EAEV+sD,GAAcA,IAAe1hB,EAA2BrrC,GAAME,iBAAiB,CACpF,IAAIhf,EAAM4rE,EAA6BC,GAEvC,GAAW,MAAP7rE,EACF,OAAOA,EAGT6rE,EAAaA,EAAWvG,UAC1B,CAEA,OAAO,IACT,C,iCCKAn0D,EAAOC,QApBP,SAA6B06D,EAAUC,EAAYr7B,EAAUs7B,GAC3D,GAAKF,EAASt/D,KAAd,CAIA,IAAIk2D,EAAS,EACboJ,EAAS/nE,QAAO,SAAU0N,EAAOkT,EAAWsnD,GAS1C,OARKF,EAAWt6D,EAAOkT,KACjB+rB,EAASj/B,IACXu6D,EAAQtJ,EAAQuJ,GAGlBvJ,EAASuJ,GAGJtnD,CACT,IACA+rB,EAASo7B,EAAS56D,SAAW86D,EAAQtJ,EAAQoJ,EAAStpD,QAdtD,CAeF,C,gCCzBA,IAAI0pD,EAAW,CAAC,EACZC,EAAar4D,KAAKs4D,IAAI,EAAG,IAa7Bj7D,EAAOC,QAXP,WAGE,IAFA,IAAIpR,OAEW+I,IAAR/I,GAAqBksE,EAAShsE,eAAeF,KAASqsE,OAAOrsE,IAClEA,EAAM8T,KAAKoJ,MAAMpJ,KAAKw4D,SAAWH,GAAYj1D,SAAS,IAIxD,OADAg1D,EAASlsE,IAAO,EACTA,CACT,C,qCCZA,IAAIusE,EAAsB,EAAQ,OAE9BC,EAA0B,EAAQ,OAElC/wD,EAAY,EAAQ,OAqDxB,SAASgxD,EAAsB/6B,EAAW9oC,EAAO+iC,EAAgBiX,EAAWtZ,EAAWojC,EAA+BC,GACpH,IAAI7wD,EAAQ6vB,EAAeiC,iBACvBj5B,EAAMg3B,EAAekC,eAIrBiF,EAFSpB,EAAU8B,MAAMlK,GAELmlB,gBACpBme,EAAiBD,EAAkB7wD,EAAQnH,EAG/C,GAAmB,YAAfm+B,EACF,OAAOnH,EAIT,IAAIioB,EAAe4Y,EAAwB5jE,EAAO0gC,GAAW/mC,QAAO,SAAU++D,GAC5E,OAAOsL,GAAkBtL,EAAM3sD,KAAOi4D,GAAkBtL,EAAMxlD,KAChE,IACyB,GAAvB83C,EAAap0D,QAA8Iic,GAAU,GACvK,IAAIoxD,EAAcjZ,EAAa,GAE/B,GAAmB,cAAf9gB,EACF,OAAOnH,EAAejoC,MAAM,CAC1BJ,aAAcupE,EAAY/wD,MAC1BvY,YAAaspE,EAAYl4D,IACzBmzC,YAAY,IAMX4kB,IACCC,EACFh4D,EAAMk4D,EAAYl4D,IAElBmH,EAAQ+wD,EAAY/wD,OAIxB,IAAIw0C,EAAeic,EAAoB7d,gBAAgB5yC,EAAOnH,EAAK/L,EAAM2B,UAAUY,MAAM0hE,EAAY/wD,MAAO+wD,EAAYl4D,KAAMk4D,EAAY/wD,MAAO8mC,GACjJ,OAAOjX,EAAejoC,MAAM,CAC1BJ,aAAcgtD,EAAax0C,MAC3BvY,YAAa+sD,EAAa37C,IAC1BmzC,YAAY,GAEhB,CAEA32C,EAAOC,QAxFP,SAAkCsgC,EAAWif,EAAYC,EAAUjlB,EAAgBiX,GACjF,IAAI9mC,EAAQ6vB,EAAeiC,iBACvBj5B,EAAMg3B,EAAekC,eACrBkjB,EAAiBJ,EAAWngB,YAAY10B,GACxCk1C,EAAeJ,EAASpgB,YAAY77B,EAAM,GAE9C,IAAKo8C,IAAmBC,EACtB,OAAOrlB,EAGT,IAAImhC,EAAoBnhC,EAExB,GAAIolB,GAAkBA,IAAmBC,EACvC8b,EAAoBL,EAAsB/6B,EAAWif,EAAYmc,EAAmBlqB,EAAWmO,GAAgB,GAAM,QAChH,GAAIA,GAAkBC,EAAc,CACzC,IAAI+b,EAAsBN,EAAsB/6B,EAAWif,EAAYmc,EAAmBlqB,EAAWmO,GAAgB,GAAO,GACxHic,EAAoBP,EAAsB/6B,EAAWkf,EAAUkc,EAAmBlqB,EAAWoO,GAAc,GAAO,GACtH8b,EAAoBA,EAAkBppE,MAAM,CAC1CJ,aAAcypE,EAAoBjc,kBAClCvtD,YAAaypE,EAAkBnc,iBAC/B/I,YAAY,GAEhB,MAAO,GAAIiJ,EAAgB,CACzB,IAAIkc,EAAuBR,EAAsB/6B,EAAWif,EAAYmc,EAAmBlqB,EAAWmO,GAAgB,GAAO,GAE7H+b,EAAoBA,EAAkBppE,MAAM,CAC1CJ,aAAc2pE,EAAqBr/B,iBACnCka,YAAY,GAEhB,MAAO,GAAIkJ,EAAc,CACvB,IAAIkc,EAAqBT,EAAsB/6B,EAAWkf,EAAUkc,EAAmBlqB,EAAWoO,GAAc,GAAO,GAEvH8b,EAAoBA,EAAkBppE,MAAM,CAC1CH,YAAa2pE,EAAmBr/B,eAChCia,YAAY,GAEhB,CAEA,OAAOglB,CACT,C,qCCvDA,IAAIrxD,EAAY,EAAQ,OAEpBs+B,EAAgB,EAAQ,OAU5B5oC,EAAOC,QARP,SAAqCpE,GACnC,IAAIkuC,EAAaluC,EAAO6tC,gBAIxB,OAHCK,GAA8Fz/B,GAAU,GACxGs+B,EAAcmB,EAAWJ,aAAwHr/B,GAAU,GAC1Iy/B,EAAWJ,UAE/B,C,qCCVA,IAAIqyB,EAAwB,EAAQ,OAEhCpd,EAAwB,EAAQ,OA4CpC5+C,EAAOC,QA1CuB,SAAiC/G,EAAcshC,GAC3E,IAAI4I,EAAW5I,EAAe/mC,cAC1B4vC,EAAc7I,EAAeiC,iBAC7B6G,EAAS9I,EAAe8B,YACxBiH,EAAY/I,EAAekC,eAK3B8D,EAD6Boe,EAAsB1lD,EAAcshC,GAC3BoG,cACtCq7B,EAAYz7B,EAAS7f,SACrBu7C,EAAaD,EAAU3mE,QAAQ8tC,GAC/B+4B,EAAWF,EAAU3mE,QAAQguC,GAAU,EAC3C,OAAO04B,EAAsBx7B,EAASxmC,MAAMkiE,EAAYC,GAAUzhE,KAAI,SAAUjD,EAAOgsC,GACrF,IAAIlkC,EAAO9H,EAAM2B,UACbmkC,EAAQ9lC,EAAMsgC,mBAElB,OAAIqL,IAAaE,EACR7rC,EAAMlF,MAAM,CACjBgN,KAAMA,EAAKvF,MAAMqpC,EAAaE,GAC9BnI,cAAemC,EAAMvjC,MAAMqpC,EAAaE,KAIxCE,IAAaL,EACR3rC,EAAMlF,MAAM,CACjBgN,KAAMA,EAAKvF,MAAMqpC,GACjBjI,cAAemC,EAAMvjC,MAAMqpC,KAI3BI,IAAaH,EACR7rC,EAAMlF,MAAM,CACjBgN,KAAMA,EAAKvF,MAAM,EAAGupC,GACpBnI,cAAemC,EAAMvjC,MAAM,EAAGupC,KAI3B9rC,CACT,IACF,C,iCCpCAuI,EAAOC,QARP,SAAoC0N,GAClC,OAAKA,GAASA,EAAKgjC,cAIZhjC,EAAKgjC,cAHHyrB,QAIX,C,qCCNA,IAAIr1B,EAAiB,EAAQ,OAEzBmO,EAAO,EAAQ,OAEfrR,EAAY,EAAQ,OAEpBmjB,EAAQnjB,EAAUojB,WAAW,YAI7BoV,EAA2BrV,GAASnjB,EAAUU,UAAU,gBACxDgjB,EAAqBxgB,EAAewgB,mBACpCL,EAAmBngB,EAAemgB,iBAEtC,SAASoV,EAAiBvuE,GACxB,OAAOi5D,GAASj5D,EAAEq5D,QAAUF,EAAiBn5D,EAC/C,CAkHAiS,EAAOC,QA/EP,SAA8BlS,GAC5B,OAAQA,EAAEunE,SACR,KAAK,GAEH,OAAO/N,EAAmBx5D,GAAK,OAAS,KAE1C,KAAK,GAEH,OAAOm5D,EAAiBn5D,GAAK,SAAW,KAE1C,KAAK,GAEH,OAAOm5D,EAAiBn5D,GAAK,YAAc,KAE7C,KAAK,GAEH,OAAOw5D,EAAmBx5D,GAAK,SAAW,KAE5C,KAAK,GAEH,OAAOw5D,EAAmBx5D,GAAK,OAAS,KAE1C,KAAK,GAEH,OAAOi5D,GAASE,EAAiBn5D,GAAK,gBAAkB,KAE1D,KAAK,GAIL,KAAK,GAEH,OAAOm5D,EAAiBn5D,GAAK,cAAgB,KAE/C,KAAK,GAEH,OAAOi5D,GAASE,EAAiBn5D,GAAK,uBAAyB,KAEjE,KAAK,GAEH,OAAOw5D,EAAmBx5D,GAAK,YAAc,KAE/C,KAAK,GAEH,OAAOi5D,GAASE,EAAiBn5D,GAAK,iBAAmB,KAE3D,KAAK,GAEH,OAAIm5D,EAAiBn5D,GACZi5D,EAAQ,kBAAoB,OAG9B,KAET,KAAK,GAEH,OArFN,SAAqBj5D,GACnB,OAAKw5D,EAAmBx5D,GAIjBA,EAAEy6D,SAAW,OAAS,OAHpB,IAIX,CA+Ea+T,CAAYxuE,IAAM,KAE3B,KAAKmnD,EAAKe,OACR,MAAO,cAET,KAAKf,EAAKpzC,OACR,OAnFN,SAA0B/T,GAExB,OAAKi5D,GAASj5D,EAAEy6D,SACP,KAGF8T,EAAiBvuE,GAAK,cAAgB,QAC/C,CA4EayuE,CAAiBzuE,GAE1B,KAAKmnD,EAAKunB,UACR,OA7EN,SAA6B1uE,GAC3B,OAAIw5D,EAAmBx5D,IAAMi5D,EACpB,6BAGFsV,EAAiBvuE,GAAK,iBAAmB,WAClD,CAuEa2uE,CAAoB3uE,GAG7B,KAAKmnD,EAAKa,KACR,OAAOsmB,GAA4B9U,EAAmBx5D,GAAK,mCAAqC,KAElG,KAAKmnD,EAAKY,MACR,OAAOumB,GAA4B9U,EAAmBx5D,GAAK,iCAAmC,KAEhG,QACE,OAAO,KAEb,C,qCChIA,IAAI4uE,EAAmC,EAAQ,OA4B/C38D,EAAOC,QArBP,SAAiCzM,EAAawe,GAC5C,IAAIvgB,EAAYugB,EAAK2+B,cAAcuiB,YAAYxhE,eAC3C06D,EAAa36D,EAAU26D,WACvBj6D,EAAeV,EAAUU,aACzBihE,EAAY3hE,EAAU2hE,UACtBhhE,EAAcX,EAAUW,YAG5B,OACe,IAHEX,EAAU0hE,YAKb,MAAd/G,GAAmC,MAAbgH,EACb,CACL54B,eAAgBhnC,EAAY9B,eAAesM,IAAI,YAAY,GAC3D25D,eAAe,GAIZgF,EAAiCnpE,EAAawe,EAAMo6C,EAAYj6D,EAAcihE,EAAWhhE,EAClG,C,qCC1BA,IAAI0xC,EAAwB,EAAQ,OAEhC22B,EAA+B,EAAQ,OAEvCvhB,EAA2B,EAAQ,OAEnC5uC,EAAY,EAAQ,OAEpB6xC,EAAY,EAAQ,OAEpBnY,EAAa,EAAQ,OA+FzB,SAAS44B,EAAuBC,EAAYC,EAAWC,GACrD,IAAIpvD,EAAOmvD,EACPl3B,EAAY9B,EAAsBn2B,IACvB,MAAbi4B,GAAqBi3B,IAAeA,IAAelvD,GAAQkvD,EAAWlzB,aAAeh8B,IAAwGrD,GAAU,GAGrMuyD,IAAelvD,KACjBA,EAAOA,EAAKg8B,WACXwS,EAAUxuC,IAAwGrD,GAAU,GAKpF,UADzCqD,EAHiBA,GAIVshD,aAAa,kBAAoI3kD,GAAU,GAE9JyyD,EAAc,IAChBA,EAAcpvD,EAAKogD,WAAW1/D,SAQlC,GAAoB,IAAhB0uE,EAAmB,CACrB,IAAIluE,EAAM,KAEV,GAAiB,MAAb+2C,EACF/2C,EAAM+2C,MACD,CACL,IAAIo3B,EApDV,SAAsBrvD,GACpB,KAAOA,EAAKg8B,aACZwS,EAAUxuC,EAAKg8B,aAA+D,SAAhDh8B,EAAKg8B,WAAWslB,aAAa,gBAA6BwL,EAA6B9sD,EAAKg8B,cACxHh8B,EAAOA,EAAKg8B,WAGd,OAAOh8B,CACT,CA6CsBsvD,CAAatvD,GAC7B9e,EAAMm1C,EAAWy2B,EAA6BuC,GAChD,CAEA,MAAO,CACLnuE,IAAKA,EACLyK,OAAQ,EAEZ,CAEA,IAAI4jE,EAAmBvvD,EAAKogD,WAAWgP,EAAc,GACjDzmB,EAAU,KACVjZ,EAAa,KAEjB,GAAKo9B,EAA6ByC,GAM3B,CAGL,IAAI5qB,EA9DR,SAAqB3kC,GACnB,KAAOA,EAAKwvD,YACZhhB,EAAUxuC,EAAKwvD,YAA6D,SAA/CxvD,EAAKwvD,UAAUlO,aAAa,gBAA6BwL,EAA6B9sD,EAAKwvD,aACtHxvD,EAAOA,EAAKwvD,UAGd,OAAOxvD,CACT,CAuDmByvD,CAAYF,GAC3B5mB,EAAUtS,EAAWy2B,EAA6BnoB,IAClDjV,EAAaggC,EAAqB/qB,EACpC,MAREgE,EAAUtS,EAAW4B,GACrBvI,EAAaggC,EAAqBH,GASpC,MAAO,CACLruE,IAAKynD,EACLh9C,OAAQ+jC,EAEZ,CASA,SAASggC,EAAqB1vD,GAC5B,IAAIg4B,EAAch4B,EAAKg4B,YACvB,MAAuB,OAAhBA,EAAuB,EAAIA,EAAYt3C,MAChD,CAEA2R,EAAOC,QArKP,SAA0CzM,EAAawe,EAAMo6C,EAAYj6D,EAAcihE,EAAWhhE,GAChG,IAAIkrE,EAAmBlR,EAAW1+C,WAAas3B,KAAK2W,UAChD4hB,EAAkBnK,EAAU1lD,WAAas3B,KAAK2W,UAIlD,GAAI2hB,GAAoBC,EACtB,MAAO,CACL/iC,eAAgB0e,EAAyB1lD,EAAawwC,EAAWF,EAAsBsoB,IAAcj6D,EAAc6xC,EAAWF,EAAsBsvB,IAAahhE,GACjKulE,eAAe,GAInB,IAAI6F,EAAc,KACdC,EAAa,KACb9F,GAAgB,EA0CpB,OAxBI2F,GACFE,EAAc,CACZ3uE,IAAKm1C,EAAWF,EAAsBsoB,IACtC9yD,OAAQnH,GAEVsrE,EAAab,EAAuB5qD,EAAMohD,EAAWhhE,IAC5CmrE,GACTE,EAAa,CACX5uE,IAAKm1C,EAAWF,EAAsBsvB,IACtC95D,OAAQlH,GAEVorE,EAAcZ,EAAuB5qD,EAAMo6C,EAAYj6D,KAEvDqrE,EAAcZ,EAAuB5qD,EAAMo6C,EAAYj6D,GACvDsrE,EAAab,EAAuB5qD,EAAMohD,EAAWhhE,GAKjDg6D,IAAegH,GAAajhE,IAAiBC,IAC/CulE,IAAkBvL,EAAWziB,YAAiD,OAAnCyiB,EAAWziB,WAAWijB,WAI9D,CACLpyB,eAAgB0e,EAAyB1lD,EAAagqE,EAAY3uE,IAAK2uE,EAAYlkE,OAAQmkE,EAAW5uE,IAAK4uE,EAAWnkE,QACtHq+D,cAAeA,EAEnB,C,oCC7EA,IACInG,EADW,EAAQ,OACIA,YAwC3B,SAASkM,EAAUn9B,EAAWpI,GAC5B,OAAIq5B,EAAYr5B,IAGoB,YAFrBoI,EAAU8B,MAAMlK,GAEfmlB,gBAAgCnlB,EAGzC,IACT,CAEAn4B,EAAOC,QA1CP,SAAkC/G,EAAcyhC,GAC9C,IAAIxC,EAEJ,GAAIwC,EAAgBukB,cAAe,CACjC,IAAIrwD,EAAM8rC,EAAgB5oC,eACtBuH,EAASqhC,EAAgBglB,kBAE7B,OAAIrmD,EAAS,GACX6+B,EAAYj/B,EAAatH,eAAe/C,GAAKwwC,YAAY/lC,EAAS,MAEhDJ,EAAatH,eAAe/C,GAAKwwC,YAAY/lC,GACtD,KAGFokE,EAAUxkE,EAAaynC,eAAgBxI,GAGzC,IACT,CAEA,IAAIiL,EAAWzI,EAAgBlnC,cAC3B4vC,EAAc1I,EAAgB8B,iBAC9B+iB,EAAatmD,EAAatH,eAAewxC,GAE7C,OADAjL,EAAYkL,IAAgBmc,EAAWntD,YAAc,KAAOmtD,EAAWngB,YAAYgE,GAC5Eq6B,EAAUxkE,EAAaynC,eAAgBxI,EAChD,C,qCClCA,IAAIqmB,EAA0B,EAAQ,OAYtCx+C,EAAOC,QAVP,SAAkCzM,GAChC,IAAIgnC,EAAiBhnC,EAAY9B,eAEjC,OAAI8oC,EAAe0kB,cACV,KAGFV,EAAwBhrD,EAAYhC,oBAAqBgpC,EAClE,C,oCCPA,IAAIX,EAAmB,EAAQ,OAmC/B75B,EAAOC,QAjCwB,SAAkCxI,EAAO+oC,GAGtE,KAF8B/oC,aAAiBoiC,GAG7C,OAAO,KAGT,IAAI8a,EAAiBl9C,EAAMwoC,oBAE3B,GAAI0U,EACF,OAAOA,EAGT,IAAI9U,EAASpoC,EAAMsoC,eAEnB,IAAKF,EACH,OAAO,KAKT,IAFA,IAAI89B,EAAyBn9B,EAASzmC,IAAI8lC,GAEnC89B,IAA2BA,EAAuB19B,qBAAqB,CAC5E,IAAI2iB,EAAY+a,EAAuB59B,eACvC49B,EAAyB/a,EAAYpiB,EAASzmC,IAAI6oD,GAAa,IACjE,CAEA,OAAK+a,EAIEA,EAAuB19B,oBAHrB,IAIX,C,+BCtBAjgC,EAAOC,QANP,SAA4B/E,GAC1B,OAAO1M,OAAO6G,KAAK6F,GAAKR,KAAI,SAAU7L,GACpC,OAAOqM,EAAIrM,EACb,GACF,C,qCCZA,IAAIwpE,EAAsB,EAAQ,OAwDlCr4D,EAAOC,QAnDP,SAAoCkwD,GAKlC,IAAIoI,EAAQF,EAAoBlI,GAC5B0I,EAAM,EACN7gD,EAAQ,EACR8gD,EAAS,EACT/gD,EAAO,EAEX,GAAIwgD,EAAMlqE,OAAQ,CAIhB,GAAIkqE,EAAMlqE,OAAS,GAAwB,IAAnBkqE,EAAM,GAAG/nE,MAAa,CAC5C,IAAIotE,EAAUrF,EAAM,GACpBM,EAAM+E,EAAQ/E,IACd7gD,EAAQ4lD,EAAQ5lD,MAChB8gD,EAAS8E,EAAQ9E,OACjB/gD,EAAO6lD,EAAQ7lD,IACjB,KAAO,CACL,IAAI8lD,EAAWtF,EAAM,GACrBM,EAAMgF,EAAShF,IACf7gD,EAAQ6lD,EAAS7lD,MACjB8gD,EAAS+E,EAAS/E,OAClB/gD,EAAO8lD,EAAS9lD,IAClB,CAEA,IAAK,IAAIjV,EAAK,EAAGA,EAAKy1D,EAAMlqE,OAAQyU,IAAM,CACxC,IAAI81D,EAAOL,EAAMz1D,GAEG,IAAhB81D,EAAKtoE,QAA+B,IAAfsoE,EAAKpoE,QAC5BqoE,EAAMl2D,KAAKkB,IAAIg1D,EAAKD,EAAKC,KACzB7gD,EAAQrV,KAAKC,IAAIoV,EAAO4gD,EAAK5gD,OAC7B8gD,EAASn2D,KAAKC,IAAIk2D,EAAQF,EAAKE,QAC/B/gD,EAAOpV,KAAKkB,IAAIkU,EAAM6gD,EAAK7gD,MAE/B,CACF,CAEA,MAAO,CACL8gD,IAAKA,EACL7gD,MAAOA,EACP8gD,OAAQA,EACR/gD,KAAMA,EACNvnB,MAAOwnB,EAAQD,EACfznB,OAAQwoE,EAASD,EAErB,C,qCCtDA,IAAIh1B,EAAY,EAAQ,OAEpBv5B,EAAY,EAAQ,OA+CxB,IAAI+tD,EA7CWx0B,EAAUU,UAAU,UAQnC,SAAmC4rB,GAIjC,IAHA,IAAI2N,EAAY3N,EAAMkJ,aAClB0E,EAAc,GAETC,EAAW7N,EAAM8J,aAA0B,MAAZ+D,EAAkBA,EAAWA,EAAS7J,WAAY,CAGxF,IAAI8J,EAAmBD,IAAa7N,EAAM+N,wBAEtCD,EACFH,EAAU3D,SAAShK,EAAMvW,eAAgBuW,EAAM9sB,aAE/Cy6B,EAAU3D,SAAS2D,EAAU7D,aAAc,GAG7C,IAIM7qE,EAJFmpE,EAAQpqE,MAAMoqB,KAAKulD,EAAUK,kBAGjC,GAFAJ,EAAY9qE,KAAKslE,GAEb0F,EAIF,OADAF,EAAYp3D,WACJvX,EAAO,IAAI+H,OAAOlI,MAAMG,EAAM2uE,GAGxCD,EAAUM,aAAaJ,EACzB,CAE6I1zD,GAAU,EACzJ,EAQiE,SAAU6lD,GACzE,OAAOhiE,MAAMoqB,KAAK43C,EAAMgO,iBAC1B,EACAn+D,EAAOC,QAAUo4D,C,qCCpDjB,IAAI/tD,EAAY,EAAQ,OAyBxBtK,EAAOC,QAdP,SAAiCxI,EAAO5I,GACtC,IAAIqjC,EAAS,GAUb,OATAz6B,EAAMgoC,kBAAiB,SAAUvzB,GAC/B,OAAOA,EAAE0rB,cAAgB/oC,CAC3B,IAAG,SAAU8b,EAAOnH,GAClB0uB,EAAOj/B,KAAK,CACV0X,MAAOA,EACPnH,IAAKA,GAET,IACG0uB,EAAO7jC,QAA2Gic,GAAU,GACxH4nB,CACT,C,qCCvBA,IAAI2R,EAAY,EAAQ,OAEpBv5B,EAAY,EAAQ,OAEpB+zD,EAAUx6B,EAAUU,UAAU,WAkBlCvkC,EAAOC,QAdP,SAA6BsgD,GAC3B,IAAI+d,EACAtsD,EAAO,KASX,OAPKqsD,GAAWjC,SAASmC,gBAAkBnC,SAASmC,eAAeC,sBACjEF,EAAMlC,SAASmC,eAAeC,mBAAmB,QAC5C3wD,iBAA4GvD,GAAU,GAC3Hg0D,EAAIzwD,gBAAgB4wD,UAAYle,EAChCvuC,EAAOssD,EAAII,qBAAqB,QAAQ,IAGnC1sD,CACT,C,qCChBA,IAAImqC,EAAY,EAAQ,OAuBxBn8C,EAAOC,QArBP,SAASw6D,EAA6B9sD,GACpC,GAAIwuC,EAAUxuC,GAAO,CACnB,IAAIgxD,EAAahxD,EACbi4B,EAAY+4B,EAAW1P,aAAa,mBAExC,GAAIrpB,EACF,OAAOA,EAGT,IAAK,IAAI9iC,EAAK,EAAGA,EAAK67D,EAAW5Q,WAAW1/D,OAAQyU,IAAM,CACxD,IAAI87D,EAAiBnE,EAA6BkE,EAAW5Q,WAAWjrD,IAExE,GAAI87D,EACF,OAAOA,CAEX,CACF,CAEA,OAAO,IACT,C,mCCzBA,IAAIt0D,EAAY,EAAQ,OAEpBu0D,EAAsB,kBACtBC,EAAa,CACf,cAAc,EACd,aAAa,EACb,YAAY,GAkEd9+D,EAAOC,QA1DP,SAAiC+5C,EAAOvwB,GACtC,IAAIs1C,EAAY,EACZC,EAAU,GACdhlB,EAAMzjD,SAAQ,SAEd0oE,IAkBF,SAAkBA,EAAMx1C,GACtB,IAAK,EAAAonB,EAAOquB,YAAcD,EAAK7uE,QAAU6uE,EAAK7uE,QAAQ0uE,GAEpD,YADAr1C,EAAS,IAIX,GAAkB,KAAdw1C,EAAK7uE,KAAa,CACpB,IAAI+uE,EAAY,GAUhB,OALIN,EAAoB7uC,KAAKivC,EAAK//C,QAChCigD,EAAYF,EAAK//C,KAAKkR,QAAQyuC,EAAqB,UAGrDp1C,EAAS01C,EAEX,CAEA,IAAIC,EAAS,IAAIF,WAEjBE,EAAOC,OAAS,WACd,IAAI1nE,EAASynE,EAAOznE,OACA,kBAAXA,GAAyJ2S,GAAU,GAC5Kmf,EAAS9xB,EACX,EAEAynE,EAAOE,QAAU,WACf71C,EAAS,GACX,EAEA21C,EAAOG,WAAWN,EACpB,CAlDIO,CAASP,GAAM,SAEf1/D,GACEw/D,IACAx/D,GAAQy/D,EAAQ/rE,KAAKsM,EAAKvF,MAAM,EAfV,MAiBlB+kE,GAAa/kB,EAAM3rD,QACrBo7B,EAASu1C,EAAQ3mE,KAAK,MAE1B,GACF,GACF,C,qCC/BA,IAAI24C,EAAiB,EAAQ,MAEzBhN,EAAa,EAAQ,OAuEzBhkC,EAAOC,QArEP,SAAkCzM,EAAaijD,EAAWtkD,EAAcukD,EAAUtkD,GAChF,IAAIX,EAAYuyC,EAAWxwC,EAAY9B,gBAEvC,IAAK+kD,IAAcC,EAOjB,OAAOjlD,EAGT,IAAIguE,EAAazuB,EAAeqF,OAAOI,GACnCipB,EAAiBD,EAAWh8B,SAC5Bk8B,EAAsBnsE,EAAYihD,aAAairB,GAC/CE,EAAaD,GAAuBA,EAAoB76C,MAAM,CAAC26C,EAAWviC,aAAc,SAAUuiC,EAAWnpB,UAC7GupB,EAAY7uB,EAAeqF,OAAOK,GAClCopB,EAAgBD,EAAUp8B,SAC1Bs8B,EAAqBvsE,EAAYihD,aAAaqrB,GAC9CE,EAAYD,GAAsBA,EAAmBj7C,MAAM,CAAC+6C,EAAU3iC,aAAc,SAAU2iC,EAAUvpB,UAE5G,IAAKspB,IAAeI,EAOlB,OAAOvuE,EAGT,IAAIwuE,EAAkBL,EAAW7lE,IAAI,SACjCmmE,EAAiBF,EAAUjmE,IAAI,SAC/BomE,EAAoBP,EAAaK,EAAkB9tE,EAAe,KAClEiuE,EAAmBJ,EAAYE,EAAiB9tE,EAAc,KAGlE,GAFeX,EAAUM,iBAAmB2tE,GAAkBjuE,EAAUkuD,oBAAsBwgB,GAAqB1uE,EAAUI,gBAAkBiuE,GAAiBruE,EAAUiuD,mBAAqB0gB,EAG7L,OAAO3uE,EAGT,IAAIklD,GAAa,EAEjB,GAAI+oB,IAAmBI,EAAe,CACpC,IAAIO,EAAgBT,EAAW7lE,IAAI,OAC/BumE,EAAeN,EAAUjmE,IAAI,OAG/B48C,EADEupB,IAAmBD,GAAmBK,IAAiBD,EAC5CjuE,EAAcD,EAEd+tE,EAAiBD,CAElC,KAAO,CAILtpB,EAHenjD,EAAYhC,oBAAoBovC,cAAcjgB,SAASmF,WAAU,SAAUrhB,GACxF,OAAOA,IAAMi7D,GAAkBj7D,IAAMq7D,CACvC,IAAGl7C,UACuBk7C,CAC5B,CAEA,OAAOruE,EAAUc,MAAM,CACrBkkD,UAAWipB,EACXvtE,aAAcguE,EACdzpB,SAAUopB,EACV1tE,YAAaguE,EACbzpB,WAAYA,GAEhB,C,qCCvEA,IAAI4pB,EAA6B,EAAQ,OAiCzCvgE,EAAOC,QAvBP,SAAiCugE,GAC/B,IAAI/uE,EAAY+uE,EAAO9uE,eAEvB,IAAKD,EAAU0hE,WACb,OAAO,KAGT,IAAIhD,EAAQ1+D,EAAUgvE,WAAW,GAC7BC,EAAeH,EAA2BpQ,GAC1C0I,EAAM6H,EAAa7H,IACnB7gD,EAAQ0oD,EAAa1oD,MACrB8gD,EAAS4H,EAAa5H,OACtB/gD,EAAO2oD,EAAa3oD,KAIxB,OAAY,IAAR8gD,GAAuB,IAAV7gD,GAA0B,IAAX8gD,GAAyB,IAAT/gD,EACvC,KAGF2oD,CACT,C,iCCvBA1gE,EAAOC,QARP,SAA0B0N,GACxB,OAAKA,GAASA,EAAKgjC,eAAkBhjC,EAAKgjC,cAAcuiB,YAIjDvlD,EAAKgjC,cAAcuiB,YAHjB/oB,MAIX,C,iCCPAnqC,EAAOC,QAAU,SAAUif,GACzB,QAAsB,qBAAXirB,SAA0BA,OAAOw2B,gBACjCx2B,OAAOw2B,YAAYzhD,EAIhC,C,qCCLA,IAAIwa,EAAkB,EAAQ,OAE1BG,EAAmB,EAAQ,OAE3BI,EAAY,EAAQ,OAEpB2mC,EAAiB,EAAQ,OAEzBt2D,EAAY,EAAQ,OAEpB0xD,EAAwB,EAAQ,OAEhC3hE,EAAO4/B,EAAU5/B,KA6JjB67D,EAAiB,SAAwBh9D,EAAcshC,EAAgBgG,EAAU/E,EAAUolC,EAAWC,GACxG,IAAIC,EAAsBvgC,EAAS5b,kBAAmBiV,EAClDmnC,EAAc,GACdC,EAAexlC,EAASpgC,KACxB3M,EAAS8xC,EAASzmC,IAAI8mE,GACtB1+C,EAAOsZ,EAAS7W,QAChBzM,EAAOsjB,EAAS17B,OAChBmhE,EAAc/oD,EAAK9lB,YACnB8uE,EAAWhpD,EAAK0kB,SAChBukC,EAAmCL,KAAyBryE,EAAOoxC,eAAexb,YAAcnC,EAAK2d,eAAexb,WACxHkc,EAASjqC,SAAQ,SAAUkB,EAAOgsC,GAC5BA,IAAao9B,GAKbO,EACFJ,EAAY/tE,KAAKwE,GAEjBupE,EAAY/tE,KA7HD,SAAoBwE,EAAOqpE,EAAcrlC,GACxD,IAAIl8B,EAAO9H,EAAM2B,UACbmkC,EAAQ9lC,EAAMsgC,mBAEdspC,EAAW9hE,EAAKvF,MAAM,EAAG8mE,GACzBQ,EAAiB/jC,EAAMvjC,MAAM,EAAG8mE,GAChCS,EAAe9lC,EAAS7W,QAC5B,OAAOntB,EAAMlF,MAAM,CACjBgN,KAAM8hE,EAAWE,EAAanoE,UAC9BgiC,cAAekmC,EAAenqE,OAAOoqE,EAAaxpC,oBAClD3nC,KAAMixE,EAAW5pE,EAAM/D,UAAY6tE,EAAa7tE,UAChDggC,KAAM6tC,EAAa5tC,WAEvB,CAgHuB6tC,CAAW/pE,EAAOqpE,EAAcrlC,IAInDA,EAGCzhC,MAAMonE,EAAmC,EAAI,EAAGH,EAAe,GAAG1qE,SAAQ,SAAUkrE,GACnF,OAAOT,EAAY/tE,KAAKwuE,EAC1B,IAEAT,EAAY/tE,KApHC,SAAoBwE,EAAOqpE,EAAcrlC,GAExD,IAAIl8B,EAAO9H,EAAM2B,UACbmkC,EAAQ9lC,EAAMsgC,mBAEd2pC,EAAYniE,EAAKlR,OACjBszE,EAAWpiE,EAAKvF,MAAM8mE,EAAcY,GACpCE,EAAiBrkC,EAAMvjC,MAAM8mE,EAAcY,GAC3CG,EAAgBpmC,EAAS17B,OAC7B,OAAO8hE,EAActvE,MAAM,CACzBgN,KAAMsiE,EAAczoE,UAAYuoE,EAChCvmC,cAAeymC,EAAc9pC,mBAAmB5gC,OAAOyqE,GACvDluC,KAAMmuC,EAAcluC,WAExB,CAsGqBmuC,CAAWrqE,EAAOqpE,EAAcrlC,KAlB/CulC,EAAY/tE,KAAKwE,EAmBrB,IACA,IAAIsqE,EAAkBroC,EAAgBgC,gBAAgBslC,GAMtD,OAJID,IACFgB,EA/EsB,SAA6BvhC,EAAUwhC,EAAkB3lC,EAAa4lC,GAC9F,OAAOzhC,EAAStyB,eAAc,SAAUg0D,GACtC,IAAIrB,EAAYxkC,EAAYQ,SACxBslC,EAAUF,EAAkBplC,SAC5BulC,EAAgB/lC,EAAY4D,oBAC5BoiC,EAAkBhmC,EAAY0D,eAC9BuiC,EAhCY,SAAuB7qE,EAAO+oC,GAChD,IAAI2hC,EAAU1qE,EAAMolC,SAChB0lC,EAAY9qE,EACZ+qE,EAAa,GASjB,IAJIhiC,EAASzmC,IAAIooE,IACfK,EAAWvvE,KAAKkvE,GAGXI,GAAaA,EAAUtiC,qBAAqB,CACjD,IAAIwiC,EAAiBF,EAAUtiC,oBAE/B,IAAKwiC,EACH,MAGFD,EAAWvvE,KAAKwvE,GAChBF,EAAY/hC,EAASzmC,IAAI0oE,EAC3B,CAEA,OAAOD,CACT,CAQ6BE,CAAcT,EAAmBzhC,GACtDmiC,EAA2BL,EAAmBA,EAAmBj0E,OAAS,GAwB9E,GAtBI6zE,EAAcnoE,IAAIooE,IAEpBD,EAAc3zD,MAAM,CAACsyD,EAAW,eAAgBsB,GAChDD,EAAc3zD,MAAM,CAAC4zD,EAAS,eAAgBtB,KAG9CqB,EAAc3zD,MAAM,CAACsyD,EAAW,eAAgBoB,EAAkBhiC,qBAClEiiC,EAAc3zD,MAAM,CAAC0zD,EAAkBhiC,oBAAqB,eAAgB4gC,IAI9EqB,EAAc3zD,MAAM,CAACo0D,EAA0B,eAAgBP,GAE3DA,GACFF,EAAc3zD,MAAM,CAAC6zD,EAAe,eAAgBO,GAItDL,EAAmB/rE,SAAQ,SAAUktC,GACnC,OAAOy+B,EAAc3zD,MAAM,CAACk1B,EAAU,UAAW4+B,EACnD,IAEIA,EAAiB,CACnB,IACIO,EADepiC,EAASzmC,IAAIsoE,GACiBviC,eAE7C+iC,EADmBD,EAA8BttE,QAAQurE,GACrB,EACpCiC,EAAuBF,EAA8Bl8D,UAEzDo8D,EAAqBxsD,OAAOrnB,MAAM6zE,EAAsB,CAACD,EAAgB,GAAG1rE,OAAOmrE,IACnFJ,EAAc3zD,MAAM,CAAC8zD,EAAiB,YAAahoE,EAAKyoE,GAC1D,CACF,GACF,CAqCsBC,CAAoBhB,EAAiBvhC,EAAU9xC,EAAQyzB,IAGpEjpB,EAAa3G,MAAM,CACxBiuC,SAAUuhC,EACVjmC,gBAAiBtB,EACjBuB,eAAgBvB,EAAejoC,MAAM,CACnCkkD,UAAW0qB,EACXhvE,aAAc+uE,EACdxqB,SAAUyqB,EACV/uE,YAAa8uE,EACbvqB,YAAY,KAGlB,EAwBA32C,EAAOC,QAtB8B,SAAwC/G,EAAcshC,EAAgBwoC,GACzG,IAAI3jB,EAAiB/wD,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAK,wBACxFksC,EAAe0kB,eAAuJ50C,GAAU,GACjL,IAAIk2B,EAAWtnC,EAAa0nC,cACxBnF,EAAWugC,EAAsBgH,GACjCnC,EAAYrmC,EAAe/mC,cAC3BqtE,EAAetmC,EAAeiC,iBAC9BJ,EAAcmE,EAASzmC,IAAI8mE,GAQ/B,OANIxkC,aAAuBxC,IACxBwC,EAAYyD,eAAexb,WAAmJha,GAAU,IAKrK,IAAlBmxB,EAASpgC,KA7NW,SAA6BnC,EAAcshC,EAAgBgG,EAAUihC,EAAeZ,EAAWC,GACvH,IAAIzhB,EAAiB/wD,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAK,wBACrF+tC,EAAcmE,EAASzmC,IAAI8mE,GAC3BthE,EAAO88B,EAAYjjC,UACnBmkC,EAAQlB,EAAYtE,mBACpBopC,EAAWN,EACXK,EAAcJ,EAAeW,EAAcroE,UAAU/K,OACrDqlC,EAAO,KAEX,OAAQ2rB,GACN,IAAK,6BACH3rB,EAAO+tC,EAAc9tC,UAAUphC,MAAM8pC,EAAY1I,WACjD,MAEF,IAAK,wBACHD,EAAO+tC,EAAc9tC,UAIzB,IAAIvjC,EAAOisC,EAAY3oC,UAEnB6L,GAAiB,aAATnP,IACVA,EAAOqxE,EAAc/tE,WAGvB,IAAIuuD,EAAW5lB,EAAY9pC,MAAM,CAC/BgN,KAAMA,EAAKvF,MAAM,EAAG8mE,GAAgBW,EAAcroE,UAAYmG,EAAKvF,MAAM8mE,GACzE1lC,cAAewlC,EAAerjC,EAAOkkC,EAAc1pC,mBAAoB+oC,GACvE1wE,KAAMA,EACNsjC,KAAMA,IAER,OAAOx6B,EAAa3G,MAAM,CACxBiuC,SAAUA,EAASxiC,IAAI6iE,EAAW5e,GAClCnmB,gBAAiBtB,EACjBuB,eAAgBvB,EAAejoC,MAAM,CACnCkkD,UAAW0qB,EACXhvE,aAAc+uE,EACdxqB,SAAUyqB,EACV/uE,YAAa8uE,EACbvqB,YAAY,KAGlB,CAoLWssB,CAAoB/pE,EAAcshC,EAAgBgG,EAAU/E,EAAS7W,QAASi8C,EAAWC,EAAczhB,GAGzG6W,EAAeh9D,EAAcshC,EAAgBgG,EAAU/E,EAAUolC,EAAWC,EACrF,C,iCCzNA9gE,EAAOC,QApBP,SAAwBijE,EAAeC,EAAU7pE,GAC/C,IAAI8pE,EAAaF,EAEjB,GAAI5pE,IAAW8pE,EAAW/xD,QACxB8xD,EAAS5sE,SAAQ,SAAU2V,GACzBk3D,EAAaA,EAAWnwE,KAAKiZ,EAC/B,SACK,GAAe,IAAX5S,EACT6pE,EAASx8D,UAAUpQ,SAAQ,SAAU2V,GACnCk3D,EAAaA,EAAWtsD,QAAQ5K,EAClC,QACK,CACL,IAAIiW,EAAOihD,EAAWppE,MAAM,EAAGV,GAC3B6e,EAAOirD,EAAWppE,MAAMV,GAC5B8pE,EAAajhD,EAAKhrB,OAAOgsE,EAAUhrD,GAAMnP,QAC3C,CAEA,OAAOo6D,CACT,C,oCCrBA,IAAInpC,EAAY,EAAQ,OAEpB2mC,EAAiB,EAAQ,OAEzBt2D,EAAY,EAAQ,OAEpBJ,EAAS+vB,EAAU/vB,OAiCvBlK,EAAOC,QA/BP,SAAoC/G,EAAcshC,EAAgBj7B,EAAMkvD,GACrEj0B,EAAe0kB,eAAyI50C,GAAU,GACnK,IAAI5H,EAAM,KAMV,GAJY,MAARnD,IACFmD,EAAMnD,EAAKlR,QAGF,MAAPqU,GAAuB,IAARA,EACjB,OAAOxJ,EAGT,IAAIsnC,EAAWtnC,EAAa0nC,cACxB/xC,EAAM2rC,EAAe/mC,cACrB6F,EAASkhC,EAAeiC,iBACxBhlC,EAAQ+oC,EAASzmC,IAAIlL,GACrBw0E,EAAY5rE,EAAM2B,UAClB6oD,EAAWxqD,EAAMlF,MAAM,CACzBgN,KAAM8jE,EAAUrpE,MAAM,EAAGV,GAAUiG,EAAO8jE,EAAUrpE,MAAMV,EAAQ7B,EAAMpF,aACxE+oC,cAAewlC,EAAenpE,EAAMsgC,mBAAoB7tB,EAAOukD,EAAmB/rD,GAAKsG,SAAU1P,KAE/FgqE,EAAYhqE,EAASoJ,EACzB,OAAOxJ,EAAa3G,MAAM,CACxBiuC,SAAUA,EAASxiC,IAAInP,EAAKozD,GAC5BlmB,eAAgBvB,EAAejoC,MAAM,CACnCJ,aAAcmxE,EACdlxE,YAAakxE,KAGnB,C,iCC7BAtjE,EAAOC,QARP,SAAmB0N,GACjB,SAAKA,IAASA,EAAKgjC,gBAIZhjC,EAAKD,WAAas3B,KAAKgvB,YAChC,C,iCCEAh0D,EAAOC,QAJP,SAAwBK,GACtB,MAAiB,YAAVA,IAAiC,IAAVA,CAChC,C,qCCNA,IAAI67C,EAAY,EAAQ,OAUxBn8C,EAAOC,QARP,SAA6B0N,GAC3B,SAAKA,IAASA,EAAKgjC,iBAIZwL,EAAUxuC,IAA2B,MAAlBA,EAAKi/C,SACjC,C,qCCRA,IAAIzQ,EAAY,EAAQ,OAUxBn8C,EAAOC,QARP,SAAyB0N,GACvB,SAAKA,IAASA,EAAKgjC,iBAIZwL,EAAUxuC,IAA2B,OAAlBA,EAAKi/C,SACjC,C,iCCQA5sD,EAAOC,QAhBP,SAAuB0N,GACrB,SAAKA,IAASA,EAAKgjC,iBAIdhjC,EAAKgjC,cAAcuiB,YAIpBvlD,aAAgBA,EAAKgjC,cAAcuiB,YAAYqQ,YAH1C51D,aAAgB41D,YAQ3B,C,oCCdA,IAAIpnB,EAAY,EAAQ,OAUxBn8C,EAAOC,QARP,SAA4B0N,GAC1B,SAAKA,IAASA,EAAKgjC,iBAIZwL,EAAUxuC,IAA2B,QAAlBA,EAAKi/C,SACjC,C,iCCaA5sD,EAAOC,QArBP,SAA0BvR,GAExB,IAAKA,KAAY,kBAAmBA,GAClC,OAAO,EAGT,GAAI,kBAAmBA,EAAQ,CAC7B,IAAIif,EAAOjf,EAEX,IAAKif,EAAKgjC,cAAcuiB,YACtB,OAAOvlD,aAAgBq3B,KAGzB,GAAIr3B,aAAgBA,EAAKgjC,cAAcuiB,YAAYluB,KACjD,OAAO,CAEX,CAEA,OAAO,CACT,C,iCCWAhlC,EAAOC,QA9BP,SAAgCzM,GAC9B,IAAI/B,EAAY+B,EAAY9B,eACxB+kD,EAAYhlD,EAAUM,eACtByxE,EAAYhwE,EAAYihD,aAAagC,GACrCn9C,EAAS7H,EAAUgrC,iBACnBgnC,GAAY,EAsBhB,OArBAD,EAAUvsE,MAAK,SAAUm7C,GACvB,OAAI94C,IAAW84C,EAAQr4C,IAAI,UACzB0pE,GAAY,GACL,GAGLnqE,EAAS84C,EAAQr4C,IAAI,QAChBq4C,EAAQr4C,IAAI,UAAU9C,MAAK,SAAUymC,GAC1C,IAAIgmC,EAAYhmC,EAAK3jC,IAAI,SAEzB,OAAIT,IAAWoqE,IACbD,GAAY,GACL,EAIX,GAIJ,IACOA,CACT,C,qCC5BA,IAAIvuB,EAAO,EAAQ,OAMnBl1C,EAAOC,QAJP,SAA4BlS,GAC1B,OAAOA,EAAE8nD,QAAUX,EAAKe,SAAWloD,EAAE41E,iBAAiB,UAAY51E,EAAE41E,iBAAiB,QAAU51E,EAAE41E,iBAAiB,WACpH,C,qCCJA,IAAI3wE,EAAc,EAAQ,OAEtB4wE,EAA2B,EAAQ,OAEnCjH,EAAmC,EAAQ,OAE3CkH,EAAwB,EAAQ,OAEhCC,EAAyB,EAAQ,MA4BrC9jE,EAAOC,QA1BP,SAA0CzM,EAAazF,GACrD,IAAI0sC,EAAeqpC,EAAuBtwE,GAAa,SAAUuwE,GAC/D,IAAItyE,EAAYsyE,EAAcryE,eAE9B,GAAID,EAAUytD,eAAiD,IAAhCztD,EAAUkuD,kBACvC,OAAOkkB,EAAsBE,EAAe,GAG9C,IAMI5T,EANgBpiE,EAAE0rD,cAAc9I,cACHuiB,YAAYxhE,eAKpB+uE,WAAW,GAEpC,OADAtQ,EAAQyT,EAAyBzT,GAC1BwM,EAAiCoH,EAAe,KAAM5T,EAAM8J,aAAc9J,EAAM5sB,UAAW4sB,EAAMvW,eAAgBuW,EAAM9sB,aAAa7I,cAC7I,GAAG,YAEH,OAAIC,IAAiBjnC,EAAYhC,oBACxBgC,EAGFR,EAAYC,KAAKO,EAAainC,EAAc,eACrD,C,qCClCA,IAAI6mB,EAAqB,EAAQ,OAE7BtuD,EAAc,EAAQ,OAEtB6wE,EAAwB,EAAQ,OAEhCC,EAAyB,EAAQ,MA8BrC9jE,EAAOC,QAvBP,SAAiCzM,GAC/B,IAAIinC,EAAeqpC,EAAuBtwE,GAAa,SAAUuwE,GAC/D,IAAItyE,EAAYsyE,EAAcryE,eAC1B4H,EAAS7H,EAAUgrC,iBAEvB,GAAe,IAAXnjC,EACF,OAAOuqE,EAAsBE,EAAe,GAG9C,IAAIl1E,EAAM4C,EAAUgC,cAEhB8L,EADUwkE,EAAcvyE,oBACTI,eAAe/C,GAAKuK,UAAUY,MAAM,EAAGV,GACtD0qE,EAAW1iB,EAAmBC,YAAYhiD,GAC9C,OAAOskE,EAAsBE,EAAeC,EAAS31E,QAAU,EACjE,GAAG,YAEH,OAAIosC,IAAiBjnC,EAAYhC,oBACxBgC,EAGFR,EAAYC,KAAKO,EAAainC,EAAc,eACrD,C,qCClCA,IAAI6mB,EAAqB,EAAQ,OAE7BtuD,EAAc,EAAQ,OAEtBixE,EAAuB,EAAQ,OAE/BH,EAAyB,EAAQ,MA0BrC9jE,EAAOC,QAnBP,SAA8BzM,GAC5B,IAAIinC,EAAeqpC,EAAuBtwE,GAAa,SAAUuwE,GAC/D,IAAItyE,EAAYsyE,EAAcryE,eAC1B4H,EAAS7H,EAAUgrC,iBACnB5tC,EAAM4C,EAAUgC,cAEhB8L,EADUwkE,EAAcvyE,oBACTI,eAAe/C,GAAKuK,UAAUY,MAAMV,GACnD0qE,EAAW1iB,EAAmBE,WAAWjiD,GAE7C,OAAO0kE,EAAqBF,EAAeC,EAAS31E,QAAU,EAChE,GAAG,WAEH,OAAIosC,IAAiBjnC,EAAYhC,oBACxBgC,EAGFR,EAAYC,KAAKO,EAAainC,EAAc,eACrD,C,qCC9BA,IAAIX,EAAgB,EAAQ,OAExB9mC,EAAc,EAAQ,OAO1BgN,EAAOC,QALP,SAAiCzM,GAC/B,IAAI0F,EAAe4gC,EAAcgB,WAAWtnC,EAAYhC,oBAAqBgC,EAAY9B,gBACzF,OAAOsB,EAAYC,KAAKO,EAAa0F,EAAc,cACrD,C,qCCPA,IAAIlG,EAAc,EAAQ,OAuB1BgN,EAAOC,QAjBP,SAA6CzM,GAC3C,IAAI/B,EAAY+B,EAAY9B,eACxB4xC,EAAS7xC,EAAU6qC,YAEnBe,EADU7pC,EAAYhC,oBACDI,eAAe0xC,GAAQjxC,YAChD,OAAOW,EAAYgL,IAAIxK,EAAa,CAClC/B,UAAWA,EAAUc,MAAM,CACzBkkD,UAAWnT,EACXnxC,aAAckrC,EACdqZ,SAAUpT,EACVlxC,YAAairC,EACbsZ,YAAY,IAEdrM,gBAAgB,GAEpB,C,qCCrBA,IAAIt3C,EAAc,EAAQ,OAuB1BgN,EAAOC,QAfP,SAA+CzM,GAC7C,IAAI/B,EAAY+B,EAAY9B,eACxB0xC,EAAW3xC,EAAUgC,cACzB,OAAOT,EAAYgL,IAAIxK,EAAa,CAClC/B,UAAWA,EAAUc,MAAM,CACzBkkD,UAAWrT,EACXjxC,aAAc,EACdukD,SAAUtT,EACVhxC,YAAa,EACbukD,YAAY,IAEdrM,gBAAgB,GAEpB,C,qCCrBA,IAAIt3C,EAAc,EAAQ,OAEtBs+D,EAAe,EAAQ,OAEvBuS,EAAwB,EAAQ,OAEhCC,EAAyB,EAAQ,MA0BrC9jE,EAAOC,QAlBP,SAAkCzM,GAChC,IAAIinC,EAAeqpC,EAAuBtwE,GAAa,SAAUuwE,GAC/D,IAAItyE,EAAYsyE,EAAcryE,eAC1BmB,EAAUkxE,EAAcvyE,oBACxB3C,EAAM4C,EAAUM,eAChBuH,EAAS7H,EAAUkuD,kBACnBukB,EAAarxE,EAAQjB,eAAe/C,GAAKuK,UAAUE,EAAS,GAChE,OAAOuqE,EAAsBE,EAAeG,EAAa5S,EAAa6S,eAAeD,EAAY,GAAK,EACxG,GAAG,YAEH,GAAIzpC,IAAiBjnC,EAAYhC,oBAC/B,OAAOgC,EAGT,IAAI/B,EAAY+B,EAAY9B,eAC5B,OAAOsB,EAAYC,KAAKO,EAAainC,EAAaz8B,IAAI,kBAAmBvM,GAAYA,EAAUytD,cAAgB,sBAAwB,eACzI,C,oCC9BA,IAAIlsD,EAAc,EAAQ,OAEtBs+D,EAAe,EAAQ,OAEvB2S,EAAuB,EAAQ,OAE/BH,EAAyB,EAAQ,MA0BrC9jE,EAAOC,QAlBP,SAA+BzM,GAC7B,IAAIinC,EAAeqpC,EAAuBtwE,GAAa,SAAUuwE,GAC/D,IAAItyE,EAAYsyE,EAAcryE,eAC1BmB,EAAUkxE,EAAcvyE,oBACxB3C,EAAM4C,EAAUM,eAChBuH,EAAS7H,EAAUkuD,kBACnBykB,EAAYvxE,EAAQjB,eAAe/C,GAAKuK,UAAUE,GACtD,OAAO2qE,EAAqBF,EAAeK,EAAY9S,EAAa6S,eAAeC,EAAW,GAAK,EACrG,GAAG,WAEH,GAAI3pC,IAAiBjnC,EAAYhC,oBAC/B,OAAOgC,EAGT,IAAI/B,EAAY+B,EAAY9B,eAC5B,OAAOsB,EAAYC,KAAKO,EAAainC,EAAaz8B,IAAI,kBAAmBvM,GAAYA,EAAUytD,cAAgB,mBAAqB,eACtI,C,qCC9BA,IAAIplB,EAAgB,EAAQ,OAExB9mC,EAAc,EAAQ,OAEtBwrD,EAA0B,EAAQ,OA0DtCx+C,EAAOC,QAlDP,SAAuCzM,GACrC,IAAI/B,EAAY+B,EAAY9B,eAE5B,IAAKD,EAAUytD,cACb,OAAO1rD,EAGT,IAAI8F,EAAS7H,EAAUkuD,kBAEvB,GAAe,IAAXrmD,EACF,OAAO9F,EAGT,IASI2rD,EACAklB,EAVA5gC,EAAWhyC,EAAUM,eACrBc,EAAUW,EAAYhC,oBAEtBnD,EADQwE,EAAQjB,eAAe6xC,GAChBpxC,YAEnB,GAAIhE,GAAU,EACZ,OAAOmF,EAML8F,IAAWjL,GAEb8wD,EAAe1tD,EAAUuM,IAAI,eAAgB1E,EAAS,GACtD+qE,EAAiB5yE,GAGjB4yE,GADAllB,EAAe1tD,EAAUuM,IAAI,cAAe1E,EAAS,IACvB0E,IAAI,eAAgB1E,EAAS,GAK7D,IAAI8lD,EAAgBZ,EAAwB3rD,EAASssD,GACjD1kB,EAAeX,EAAcY,YAAY7nC,EAASssD,EAAc,YAEhEpjB,EAAiBtB,EAAaG,oBAC9BkmC,EAAe/kC,EAAe4jB,kBAAoB,EAClDzjB,EAAcH,EAAexpC,MAAM,CACrCJ,aAAc2uE,EACd1uE,YAAa0uE,IAEXwD,EAAcxqC,EAAc8B,oBAAoBnB,EAAcyB,EAAakjB,GAC3EpjD,EAAiBhJ,EAAYC,KAAKO,EAAa8wE,EAAa,mBAChE,OAAOtxE,EAAYikD,gBAAgBj7C,EAAgBqoE,EACrD,C,oCC5DA,IAAIrxE,EAAc,EAAQ,OAoC1BgN,EAAOC,QAlCP,SAAwBlS,EAAGyF,EAAa+wE,GACtC,IAAIC,EAAcxxE,EAAY0zD,KAAKlzD,GAKnC,GAAwC,sBAApCA,EAAYiyD,oBAShB13D,EAAEkC,iBAEGuD,EAAYgkD,8BAOjB+sB,EAASvxE,EAAYgL,IAAIxK,EAAa,CACpC0wD,wBAAyB,QAI3BvO,YAAW,WACT4uB,EAASC,EACX,GAAG,IAbDD,EAASC,OAZX,CACE,IAAItgB,EAA0BsgB,EAAYhzE,oBAC1C+yE,EAASvxE,EAAYgL,IAAIwmE,EAAa,CACpCtgB,wBAAyBA,IAG7B,CAoBF,C,oCClCA,IAEIjnD,EAFY,EAAQ,OAEJA,IAkBpB+C,EAAOC,QAhBP,SAAoC/G,EAAcshC,EAAgBiqC,GAChE,IAAIrhC,EAAW5I,EAAe/mC,cAC1B6vC,EAAS9I,EAAe8B,YACxBkE,EAAWtnC,EAAa0nC,cACxB4C,EAAYhD,EAASl7B,QAAQwgB,WAAU,SAAU/b,EAAGvF,GACtD,OAAOA,IAAM4+B,CACf,IAAGld,WAAU,SAAUnc,EAAGvF,GACxB,OAAOA,IAAM8+B,CACf,IAAGnsC,OAAO8F,EAAI,CAAC,CAACqmC,EAAQ9C,EAASzmC,IAAIupC,OAAY5oC,IAAI+pE,GACrD,OAAOvrE,EAAa3G,MAAM,CACxBiuC,SAAUA,EAASjuC,MAAMixC,GACzB1H,gBAAiBtB,EACjBuB,eAAgBvB,GAEpB,C,qCClBA,IAAIX,EAAmB,EAAQ,OAE3B6qC,EAA2B,EAAQ,MAEnCzqC,EAAY,EAAQ,OAEpB3vB,EAAY,EAAQ,OAEpB2F,EAAagqB,EAAUhqB,WACvB5V,EAAO4/B,EAAU5/B,KAEjBsqE,EAAiB,SAAwB91E,EAAK2xC,EAAUokC,GAC1D,GAAK/1E,EAAL,CAIA,IAAI4I,EAAQ+oC,EAASzmC,IAAIlL,GAEpB4I,GAIL+oC,EAASxiC,IAAInP,EAAK+1E,EAAKntE,GARvB,CASF,EAEIsrE,EAAsB,SAA6BviC,EAAUqkC,EAAwBC,EAAqB3oC,EAAe4oC,GAC3H,IAAKA,EACH,OAAOvkC,EAIT,IAAIwkC,EAA0C,UAAlB7oC,EACxB8oC,EAAmBJ,EAAuBhoC,SAC1CqoC,EAAoBJ,EAAoBjoC,SACxCsoC,EAAoBN,EAAuB9kC,eAC3CqlC,EAAyBP,EAAuB5kC,oBAChDolC,EAAyBR,EAAuB7kC,oBAChDslC,EAAeR,EAAoB/kC,eACnCwlC,EAAoBP,EAAwBF,EAAoB7kC,oBAAsBilC,EACtFM,EAAoBR,EAAwBE,EAAoBJ,EAAoB9kC,oBACxF,OAAOQ,EAAStyB,eAAc,SAAU2mB,GAEtC8vC,EAAeQ,EAAmBtwC,GAAQ,SAAUp9B,GAClD,IAAIguE,EAAqBhuE,EAAMqoC,eAC/B,OAAOroC,EAAMlF,MAAM,CACjBjD,SAAUm2E,EAA2B,OAAEA,EAAmBnwE,QAAQ2vE,KAEtE,IAEAN,EAAeU,EAAwBxwC,GAAQ,SAAUp9B,GACvD,OAAOA,EAAMlF,MAAM,CACjB+oC,YAAa8pC,GAEjB,IAEAT,EAAeS,EAAwBvwC,GAAQ,SAAUp9B,GACvD,OAAOA,EAAMlF,MAAM,CACjBgpC,YAAa8pC,GAEjB,IAEAV,EAAeY,EAAmB1wC,GAAQ,SAAUp9B,GAClD,OAAOA,EAAMlF,MAAM,CACjBgpC,YAAa0pC,GAEjB,IAEAN,EAAea,EAAmB3wC,GAAQ,SAAUp9B,GAClD,OAAOA,EAAMlF,MAAM,CACjB+oC,YAAa2pC,GAEjB,IAEAN,EAAeW,EAAczwC,GAAQ,SAAUp9B,GAC7C,IAAIiuE,EAAwBjuE,EAAMqoC,eAC9B6lC,EAAmBD,EAAsBpwE,QAAQ4vE,GACjDrC,EAAiBmC,EAAwBW,EAAmB,EAAyB,IAArBA,EAAyBA,EAAmB,EAAI,EAChHC,EAAmBF,EAAsBh/D,UAE7C,OADAk/D,EAAiBtvD,OAAOusD,EAAgB,EAAGoC,GACpCxtE,EAAMlF,MAAM,CACjBjD,SAAU+K,EAAKurE,IAEnB,IAEAjB,EAAeM,EAAkBpwC,GAAQ,SAAUp9B,GACjD,OAAOA,EAAMlF,MAAM,CACjB+oC,YAAaiqC,EACbhqC,YAAaiqC,EACb3lC,OAAQylC,GAEZ,GACF,GACF,EA+DAtlE,EAAOC,QA7DuB,SAAiC/G,EAAc2sE,EAAgBxpC,EAAaF,GACpF,YAAlBA,GAAgI7xB,GAAU,GAC5I,IAAIu2D,EAAYxkC,EAAYQ,SACxB4G,EAAWoiC,EAAehpC,SAC5B4G,IAAao9B,GAAiHv2D,GAAU,GAC1I,IAAIk2B,EAAWtnC,EAAa0nC,cACxBmkC,EAA0Bc,aAA0BhsC,EACpDisC,EAAkB,CAACD,GACnBE,EAAiCvlC,EAAiB,OAAEiD,GAEpDshC,IACFe,EAAkB,GAClBC,EAAiCvlC,EAAStyB,eAAc,SAAU2mB,GAChE,IAAI8f,EAAiBkxB,EAAe5lC,oBAChC+lC,EAAwBtB,EAAyBmB,EAAgBhxC,GACrEA,EAAOvvB,QAAQwgB,WAAU,SAAUruB,GACjC,OAAOA,EAAMolC,WAAa4G,CAC5B,IAAGxd,WAAU,SAAUxuB,GACrB,IAAI5I,EAAM4I,EAAMolC,SACZopC,EAAmBp3E,IAAQ40C,EAC3ByiC,EAAoCvxB,GAAkB9lD,IAAQ8lD,EAC9DwxB,GAA2CxxB,GAAkBl9C,EAAMsoC,kBAAoBimC,GAAyBn3E,IAAQm3E,GAC5H,SAAUC,GAAoBC,GAAqCC,EACrE,IAAG5vE,SAAQ,SAAUkB,GACnBquE,EAAgB7yE,KAAKwE,GACrBo9B,EAAe,OAAEp9B,EAAMolC,SACzB,GACF,KAGF,IAAIupC,EAAeL,EAA+BzgE,QAAQ4gB,WAAU,SAAUzhB,GAC5E,OAAOA,IAAM43B,CACf,IACIgqC,EAAcN,EAA+BzgE,QAAQwgB,WAAU,SAAUrhB,GAC3E,OAAOA,IAAM43B,CACf,IAAG3W,KAAK,GACJ4gD,EAAeR,EAAgBprE,KAAI,SAAUjD,GAC/C,MAAO,CAACA,EAAMolC,SAAUplC,EAC1B,IACI+rC,EAAYvzB,IAEhB,GAAsB,WAAlBksB,EAA4B,CAC9B,IAAI6rB,EAAc9uD,EAAa+nC,eAAe4/B,GAC3C7Y,GAAeA,EAAYnrB,WAAagpC,EAAehpC,UAAgHvyB,GAAU,GACpLk5B,EAAY4iC,EAAajvE,OAAO,GAAGA,OAAOmvE,EAAc,CAAC,CAACzF,EAAWxkC,KAAgBgqC,GAAapjD,cACpG,MAAO,GAAsB,UAAlBkZ,EAA2B,CACpC,IAAIisB,EAAalvD,EAAa8nC,cAAc6/B,GACzCzY,GAAcA,EAAWvrB,WAAa4G,GAAgHn5B,GAAU,GACnKk5B,EAAY4iC,EAAajvE,OAAO,CAAC,CAAC0pE,EAAWxkC,IAAcllC,OAAOmvE,GAAeD,GAAapjD,cAChG,CAEA,OAAO/pB,EAAa3G,MAAM,CACxBiuC,SAAUuiC,EAAoBv/B,EAAWqiC,EAAgBxpC,EAAaF,EAAe4oC,GACrFjpC,gBAAiB5iC,EAAa0hC,oBAC9BmB,eAAgB7iC,EAAa0hC,oBAAoBroC,MAAM,CACrDkkD,UAAWhT,EACXiT,SAAUjT,KAGhB,C,qCCzJc,EAAQ,OA0CtBzjC,EAAOC,QA/BP,SAA+BzM,EAAa+yE,GAC1C,IAAI90E,EAAY+B,EAAY9B,eAGxBmB,EAAUW,EAAYhC,oBACtB3C,EAAM4C,EAAUgC,cAChB6F,EAAS7H,EAAUgrC,iBACnBia,EAAW7nD,EACXuD,EAAc,EAElB,GAAIm0E,EAAcjtE,EAAQ,CACxB,IAAIktE,EAAY3zE,EAAQiuC,aAAajyC,GAErC,GAAiB,MAAb23E,EACF9vB,EAAW7nD,OAEX6nD,EAAW8vB,EAEXp0E,EADkBS,EAAQjB,eAAe40E,GACfptE,UAAU/K,MAExC,MACE+D,EAAckH,EAASitE,EAGzB,OAAO90E,EAAUc,MAAM,CACrBmkD,SAAUA,EACVtkD,YAAaA,EACbukD,YAAY,GAEhB,C,qCCxCc,EAAQ,OAmCtB32C,EAAOC,QAxBP,SAA8BzM,EAAa+yE,GACzC,IAOIn0E,EAPAX,EAAY+B,EAAY9B,eAGxB7C,EAAM4C,EAAUgC,cAChB6F,EAAS7H,EAAUgrC,iBACnB5pC,EAAUW,EAAYhC,oBACtBklD,EAAW7nD,EAWf,OAPI03E,EAFQ1zE,EAAQjB,eAAe/C,GAEXuK,UAAU/K,OAASiL,GACzCo9C,EAAW7jD,EAAQkuC,YAAYlyC,GAC/BuD,EAAc,GAEdA,EAAckH,EAASitE,EAGlB90E,EAAUc,MAAM,CACrBmkD,SAAUA,EACVtkD,YAAaA,GAEjB,C,qCCjCA,IAAIynC,EAAmB,EAAQ,OAE3BE,EAAoB,EAAQ,MAI5B9pB,EAFY,EAAQ,OAEGA,WA0F3BjQ,EAAOC,QAVqB,SAA+BugC,GAGzD,OAF0BA,EAAS5b,kBAAmBiV,EA/EpB,SAAuC2G,GACzE,IAEIimC,EAFAC,EAAa,CAAC,EAGlB,OAAOz2D,EAAWuwB,EAAStyB,eAAc,SAAUg0D,GACjDA,EAAc3rE,SAAQ,SAAUkB,EAAOoC,GACrC,IAAI8sE,EAASlvE,EAAMolC,SACf+pC,EAAUnvE,EAAMwoC,oBAChB4mC,EAAUpvE,EAAMuoC,oBAChB8mC,EAAervE,EAAMqoC,eACrB8iB,EAAYnrD,EAAMsoC,eAElBlxC,EAAMkrC,IA0BV,GAxBA2sC,EAAWC,GAAU93E,EAEjB+3E,IACc1E,EAAcnoE,IAAI6sE,GAGhC1E,EAAc3zD,MAAM,CAACq4D,EAAS,eAAgB/3E,GAG9CqzE,EAAc3zD,MAAM,CAACo4D,EAAQ,eAAgB,OAI7CE,IACc3E,EAAcnoE,IAAI8sE,GAGhC3E,EAAc3zD,MAAM,CAACs4D,EAAS,eAAgBh4E,GAG9CqzE,EAAc3zD,MAAM,CAACo4D,EAAQ,eAAgB,OAI7C/jB,GAAasf,EAAcnoE,IAAI6oD,GAAY,CAC7C,IACI6iB,EADcvD,EAAcnoE,IAAI6oD,GACC9iB,eACrCoiC,EAAc3zD,MAAM,CAACq0C,EAAW,YAAa6iB,EAAmBznE,IAAIynE,EAAmBnwE,QAAQmC,EAAMolC,UAAWhuC,GAClH,MAEEqzE,EAAc3zD,MAAM,CAACo4D,EAAQ,UAAW,MAEpCF,IACFvE,EAAc3zD,MAAM,CAACk4D,EAAc5pC,SAAU,eAAgBhuC,GAC7DqzE,EAAc3zD,MAAM,CAACo4D,EAAQ,eAAgBD,EAAWD,EAAc5pC,YAGxE4pC,EAAgBvE,EAAcnoE,IAAI4sE,GAGpCG,EAAavwE,SAAQ,SAAUwwE,GACZ7E,EAAcnoE,IAAIgtE,GAGjC7E,EAAc3zD,MAAM,CAACw4D,EAAU,UAAWl4E,GAE1CqzE,EAAc3zD,MAAM,CAACo4D,EAAQ,YAAalvE,EAAMqoC,eAAe1uC,QAAO,SAAUkjD,GAC9E,OAAOA,IAAUyyB,CACnB,IAEJ,GACF,GACF,IAAGrgE,UAAUhM,KAAI,SAAUjD,GACzB,MAAO,CAACivE,EAAWjvE,EAAMolC,UAAWplC,EAAMuG,IAAI,MAAO0oE,EAAWjvE,EAAMolC,WACxE,IACF,CAgBSmqC,CAA8BxmC,GAdP,SAAmCA,GACjE,OAAOvwB,EAAWuwB,EAAS95B,UAAUhM,KAAI,SAAUjD,GACjD,IAAI5I,EAAMkrC,IACV,MAAO,CAAClrC,EAAK4I,EAAMuG,IAAI,MAAOnP,GAChC,IACF,CAMWo4E,CAA0BzmC,EAIrC,C,qCC9FA,IAAI7G,EAAoB,EAAQ,OAE5BmD,EAAsB,EAAQ,OAE9BxyB,EAAY,EAAQ,OA2ExB,SAAS48D,EAAe3mC,EAAW9oC,EAAO6B,GACxC,IAAIikC,EAAQ9lC,EAAMsgC,mBACdovC,EAAa7tE,EAAS,EAAIikC,EAAMxjC,IAAIT,EAAS,QAAK1B,EAClDwvE,EAAY9tE,EAASikC,EAAMlsB,QAAUksB,EAAMxjC,IAAIT,QAAU1B,EACzDyvE,EAAqBF,EAAaA,EAAWvvC,iBAAchgC,EAC3D0vE,EAAoBF,EAAYA,EAAUxvC,iBAAchgC,EAE5D,GAAI0vE,GAAqBA,IAAsBD,GAGd,YAFlB9mC,EAAU8B,MAAMilC,GAElBhqB,gBAA+B,CAOxC,IANA,IAII1Z,EAJA2jC,EAzCV,SAAyB5pC,EAAYxF,EAAW7+B,GAC9C,IAAI6lD,EA0BJ,OAlBAriB,EAAoBa,GACpB,SAAUn0B,EAAGC,GACX,OAAOD,EAAEouB,cAAgBnuB,EAAEmuB,WAC7B,IACA,SAAU34B,GACR,OAAOA,EAAQ24B,cAAgBO,CACjC,IACA,SAAUxtB,EAAOnH,GAEXmH,GAASrR,GAAUkK,GAAOlK,IAE5B6lD,EAAe,CACbx0C,MAAOA,EACPnH,IAAKA,GAGX,IAC0B,kBAAjB27C,GAA2I70C,GAAU,GACvJ60C,CACT,CAa6B5B,CAAgBhgB,EAAO+pC,EAAmBhuE,GAC7DqR,EAAQ48D,EAAiB58D,MACzBnH,EAAM+jE,EAAiB/jE,IAIpBmH,EAAQnH,GACbogC,EAAUrG,EAAMxjC,IAAI4Q,GACpB4yB,EAAQA,EAAMv/B,IAAI2M,EAAOgvB,EAAkByE,YAAYwF,EAAS,OAChEj5B,IAGF,OAAOlT,EAAMuG,IAAI,gBAAiBu/B,EACpC,CAGF,OAAO9lC,CACT,CAEAuI,EAAOC,QAvGP,SAA+B/G,EAAcshC,GAC3C,IAAIgG,EAAWtnC,EAAa0nC,cACxBL,EAAYrnC,EAAaynC,eACzB6mC,EAAgB,CAAC,EACjBpkC,EAAW5I,EAAe/mC,cAC1B4vC,EAAc7I,EAAeiC,iBAC7B+iB,EAAahf,EAASzmC,IAAIqpC,GAC1BqkC,EAAeP,EAAe3mC,EAAWif,EAAYnc,GAErDokC,IAAiBjoB,IACnBgoB,EAAcpkC,GAAYqkC,GAG5B,IAAInkC,EAAS9I,EAAe8B,YACxBiH,EAAY/I,EAAekC,eAC3B+iB,EAAWjf,EAASzmC,IAAIupC,GAExBF,IAAaE,IACfmc,EAAWgoB,GAGb,IAAIC,EAAaR,EAAe3mC,EAAWkf,EAAUlc,GAMrD,OAJImkC,IAAejoB,IACjB+nB,EAAclkC,GAAUokC,GAGrBl5E,OAAO6G,KAAKmyE,GAAen5E,OAIzB6K,EAAa3G,MAAM,CACxBiuC,SAAUA,EAASjuC,MAAMi1E,GACzBzrC,eAAgBvB,IALTthC,EAAa8E,IAAI,iBAAkBw8B,EAO9C,C,qCCzCA,IAAIX,EAAmB,EAAQ,OAE3B6qC,EAA2B,EAAQ,MAEnCzqC,EAAY,EAAQ,OAGpBh9B,GADOg9B,EAAU5/B,KACX4/B,EAAUh9B,KAEhB0nE,EAAiB,SAAwB91E,EAAK2xC,EAAUokC,GAC1D,GAAK/1E,EAAL,CAIA,IAAI4I,EAAQ+oC,EAASzmC,IAAIlL,GAEpB4I,GAIL+oC,EAASxiC,IAAInP,EAAK+1E,EAAKntE,GARvB,CASF,EAOIkwE,EAAmB,SAA0BlkC,EAAUjD,GACzD,IAAIonC,EAAU,GAEd,IAAKnkC,EACH,OAAOmkC,EAKT,IAFA,IAAIl2B,EAAYlR,EAASzmC,IAAI0pC,GAEtBiO,GAAaA,EAAU3R,gBAAgB,CAC5C,IAAI6iB,EAAYlR,EAAU3R,eAEtB6iB,GACFglB,EAAQ30E,KAAK2vD,GAGflR,EAAYkR,EAAYpiB,EAASzmC,IAAI6oD,GAAa,IACpD,CAEA,OAAOglB,CACT,EA2BIC,EAAsB,SAA6BpwE,EAAO+oC,EAAUwhC,GACtE,IAAKvqE,EACH,OAAO,KAOT,IAFA,IAAIqwE,EAAsB9F,EAAiBjoE,IAAItC,EAAMolC,UAAUoD,oBAExD6nC,IAAwBtnC,EAASzmC,IAAI+tE,IAC1CA,EAAsB9F,EAAiBjoE,IAAI+tE,GAAqB7nC,qBAAuB,KAGzF,OAAO6nC,CACT,EAEIC,EAAsB,SAA6BtwE,EAAO+oC,EAAUwhC,GACtE,IAAKvqE,EACH,OAAO,KAOT,IAFA,IAAIuwE,EAAsBhG,EAAiBjoE,IAAItC,EAAMolC,UAAUmD,oBAExDgoC,IAAwBxnC,EAASzmC,IAAIiuE,IAC1CA,EAAsBhG,EAAiBjoE,IAAIiuE,GAAqBhoC,qBAAuB,KAGzF,OAAOgoC,CACT,EAEIjF,EAAsB,SAA6BviC,EAAUgf,EAAYC,EAAUuiB,GACrF,OAAOxhC,EAAStyB,eAAc,SAAU2mB,GAyEtC,GAvEA8vC,EAAenlB,EAAW3iB,SAAUhI,GAAQ,SAAUp9B,GACpD,OAAOA,EAAMlF,MAAM,CACjB+oC,YAAausC,EAAoBpwE,EAAOo9B,EAAQmtC,GAChDzmC,YAAawsC,EAAoBtwE,EAAOo9B,EAAQmtC,IAEpD,IAEA2C,EAAellB,EAAS5iB,SAAUhI,GAAQ,SAAUp9B,GAClD,OAAOA,EAAMlF,MAAM,CACjB+oC,YAAausC,EAAoBpwE,EAAOo9B,EAAQmtC,GAChDzmC,YAAawsC,EAAoBtwE,EAAOo9B,EAAQmtC,IAEpD,IAEA2F,EAAiBnoB,EAAW3iB,SAAUmlC,GAAkBzrE,SAAQ,SAAUqsD,GACxE,OAAO+hB,EAAe/hB,EAAW/tB,GAAQ,SAAUp9B,GACjD,OAAOA,EAAMlF,MAAM,CACjBjD,SAAUmI,EAAMqoC,eAAe1uC,QAAO,SAAUvC,GAC9C,OAAOgmC,EAAO96B,IAAIlL,EACpB,IACAysC,YAAausC,EAAoBpwE,EAAOo9B,EAAQmtC,GAChDzmC,YAAawsC,EAAoBtwE,EAAOo9B,EAAQmtC,IAEpD,GACF,IAEA2C,EAAenlB,EAAWvf,oBAAqBpL,GAAQ,SAAUp9B,GAC/D,OAAOA,EAAMlF,MAAM,CACjBgpC,YAAaikB,EAAWxf,qBAE5B,IAEA2kC,EAAenlB,EAAWxf,oBAAqBnL,GAAQ,SAAUp9B,GAC/D,OAAOA,EAAMlF,MAAM,CACjB+oC,YAAausC,EAAoBpwE,EAAOo9B,EAAQmtC,IAEpD,IAEA2C,EAAellB,EAASxf,oBAAqBpL,GAAQ,SAAUp9B,GAC7D,OAAOA,EAAMlF,MAAM,CACjBgpC,YAAawsC,EAAoBtwE,EAAOo9B,EAAQmtC,IAEpD,IAEA2C,EAAellB,EAASzf,oBAAqBnL,GAAQ,SAAUp9B,GAC7D,OAAOA,EAAMlF,MAAM,CACjB+oC,YAAamkB,EAASxf,qBAE1B,IAEA0nC,EAAiBloB,EAAS5iB,SAAUmlC,GAAkBzrE,SAAQ,SAAUqsD,GACtE+hB,EAAe/hB,EAAW/tB,GAAQ,SAAUp9B,GAC1C,OAAOA,EAAMlF,MAAM,CACjBjD,SAAUmI,EAAMqoC,eAAe1uC,QAAO,SAAUvC,GAC9C,OAAOgmC,EAAO96B,IAAIlL,EACpB,IACAysC,YAAausC,EAAoBpwE,EAAOo9B,EAAQmtC,GAChDzmC,YAAawsC,EAAoBtwE,EAAOo9B,EAAQmtC,IAEpD,GACF,IAnH6B,SAAoCvqE,EAAO+oC,GAC1E,IAAIynC,EAAiB,GAErB,IAAKxwE,EACH,OAAOwwE,EAKT,IAFA,IAAIC,EAAgBxD,EAAyBjtE,EAAO+oC,GAE7C0nC,GAAiB1nC,EAASzmC,IAAImuE,IAAgB,CACnD,IAAI9vB,EAAS5X,EAASzmC,IAAImuE,GAE1BD,EAAeh1E,KAAKi1E,GAEpBA,EAAgB9vB,EAAOrY,eAAiB2kC,EAAyBtsB,EAAQ5X,GAAY,IACvF,CAEA,OAAOynC,CACT,CAmGIE,CAA2B1oB,EAAUuiB,GAAkBzrE,SAAQ,SAAU6xE,GACvE,OAAOzD,EAAeyD,EAAcvzC,GAAQ,SAAUp9B,GACpD,OAAOA,EAAMlF,MAAM,CACjB+oC,YAAausC,EAAoBpwE,EAAOo9B,EAAQmtC,GAChDzmC,YAAawsC,EAAoBtwE,EAAOo9B,EAAQmtC,IAEpD,GACF,IAEyC,MAArCxhC,EAASzmC,IAAIylD,EAAW3iB,WAAwD,MAAnC2D,EAASzmC,IAAI0lD,EAAS5iB,WAAqB4iB,EAAS1f,iBAAmByf,EAAW3iB,UAA4C,MAAhC4iB,EAASzf,oBAA6B,CACnL,IAAI6iB,EAAiBrD,EAAWxf,oBAEhC2kC,EAAellB,EAAS5iB,SAAUhI,GAAQ,SAAUp9B,GAClD,OAAOA,EAAMlF,MAAM,CACjBgpC,YAAasnB,GAEjB,IACA8hB,EAAe9hB,EAAgBhuB,GAAQ,SAAUp9B,GAC/C,OAAOA,EAAMlF,MAAM,CACjB+oC,YAAamkB,EAAS5iB,UAE1B,IAEA,IAAItB,EAAcsnB,EAAiBriB,EAASzmC,IAAI8oD,GAAkB,KAC9DyiB,EAAe/pC,EAAcA,EAAYwE,eAAiB,KAU9D,GATAyf,EAAW1f,eAAevpC,SAAQ,SAAUwwE,GAC1CpC,EAAeoC,EAAUlyC,GAAQ,SAAUp9B,GACzC,OAAOA,EAAMlF,MAAM,CACjBstC,OAAQylC,GAGZ,GACF,IAEoB,MAAhBA,EAAsB,CACxB,IAAI9iB,EAAYhiB,EAASzmC,IAAIurE,GAC7BX,EAAeW,EAAczwC,GAAQ,SAAUp9B,GAC7C,OAAOA,EAAMlF,MAAM,CACjBjD,SAAUkzD,EAAU1iB,eAAe3oC,OAAOqoD,EAAW1f,iBAEzD,GACF,CAGA6kC,EAAenlB,EAAW1f,eAAevc,MAAK,SAAU10B,GAEtD,OAAqC,OADzB2xC,EAASzmC,IAAIlL,GACZoxC,mBACf,IAAIpL,GAAQ,SAAUp9B,GACpB,OAAOA,EAAMlF,MAAM,CACjB+oC,YAAakkB,EAAWvf,qBAE5B,GACF,CACF,GACF,EAsFIooC,EAAiB,SAAwBjF,EAAY//B,EAAaE,GACpE,GAAoB,IAAhBF,EACF,KAAOA,EAAcE,GACnB6/B,EAAaA,EAAW9wD,QACxB+wB,SAEG,GAAIE,IAAc6/B,EAAW/xD,QAClC,KAAOkyB,EAAYF,GACjB+/B,EAAaA,EAAW1uD,MACxB6uB,QAEG,CACL,IAAIphB,EAAOihD,EAAWppE,MAAM,EAAGqpC,GAC3BlrB,EAAOirD,EAAWppE,MAAMupC,GAC5B6/B,EAAajhD,EAAKhrB,OAAOghB,GAAMnP,QACjC,CAEA,OAAOo6D,CACT,EAEApjE,EAAOC,QAxG2B,SAAqC/G,EAAcshC,GACnF,GAAIA,EAAe0kB,cACjB,OAAOhmD,EAGT,IA6BIkiC,EA7BAoF,EAAWtnC,EAAa0nC,cACxBwC,EAAW5I,EAAe/mC,cAC1B4vC,EAAc7I,EAAeiC,iBAC7B6G,EAAS9I,EAAe8B,YACxBiH,EAAY/I,EAAekC,eAC3B8iB,EAAahf,EAASzmC,IAAIqpC,GAC1Bqc,EAAWjf,EAASzmC,IAAIupC,GAExByhC,EAA0BvlB,aAAsB3lB,EAEhDyuC,EAAkB,GAEtB,GAAIvD,EAAyB,CAC3B,IAAIwD,EAAuB9oB,EAAS3f,eAChC0oC,EAAoBb,EAAiBrkC,EAAQ9C,GAE7Cif,EAASxf,sBACXqoC,EAAkBA,EAAgBnxE,OAAOqxE,IAItCD,EAAqBjkD,YACxBgkD,EAAkBA,EAAgBnxE,OAAOqxE,EAAkBrxE,OAAO,CAACmsC,MAIrEglC,EAAkBA,EAAgBnxE,OAAOwwE,EAAiBjD,EAAyBjlB,EAAUjf,GAAWA,GAC1G,CAKEpF,EADEokB,IAAeC,EACD4oB,EAAe7oB,EAAWznB,mBAAoBsL,EAAaE,GAE3Dic,EAAWznB,mBAAmB/9B,MAAM,EAAGqpC,GAAalsC,OAAOsoD,EAAS1nB,mBAAmB/9B,MAAMupC,IAG/G,IAAIklC,EAAgBjpB,EAAWjtD,MAAM,CACnCgN,KAAMigD,EAAWpmD,UAAUY,MAAM,EAAGqpC,GAAeoc,EAASrmD,UAAUY,MAAMupC,GAC5EnI,cAAeA,IAKboI,EADqBuhC,GAA2C,IAAhB1hC,GAAmC,IAAdE,GAAmBkc,EAAS1f,iBAAmBqD,GAA4C,MAAhCqc,EAASzf,oBACxG/iC,EAAI,CAAC,CAACmmC,EAAU,QAAU5C,EAASl7B,QAAQwgB,WAAU,SAAU/b,EAAGvF,GACrG,OAAOA,IAAM4+B,CACf,IAAGld,WAAU,SAAUnc,EAAGvF,GACxB,OAAOA,IAAM8+B,CACf,IAAGlyC,QAAO,SAAU2Y,EAAGvF,GACrB,OAAuC,IAAhC8jE,EAAgBhzE,QAAQkP,EACjC,IAAGrN,OAAO8F,EAAI,CAAC,CAACqmC,EAAQ,SAAS5oC,KAAI,SAAUqP,EAAGvF,GAChD,OAAOA,IAAM4+B,EAAWqlC,EAAgB,IAC1C,IACI1G,EAAkBvhC,EAASjuC,MAAMixC,GAAWpyC,QAAO,SAAUqG,GAC/D,QAASA,CACX,IAMA,OAJIstE,GAA2BvlB,IAAeC,IAC5CsiB,EAAkBgB,EAAoBhB,EAAiBviB,EAAYC,EAAUjf,IAGxEtnC,EAAa3G,MAAM,CACxBiuC,SAAUuhC,EACVjmC,gBAAiBtB,EACjBuB,eAAgBvB,EAAejoC,MAAM,CACnCkkD,UAAWrT,EACXjxC,aAAckxC,EACdqT,SAAUtT,EACVhxC,YAAaixC,EACbsT,YAAY,KAGlB,C,oCCjTA,IAAI7c,EAAgB,EAAQ,OAIxBK,EAFM,EAAQ,MAEgBH,CAAI,2BAyDtCh6B,EAAOC,QAnDP,SAAgCzM,EAAaorC,EAAU6S,GACrD,IAAIhgD,EAAY+B,EAAY9B,eACxBmB,EAAUW,EAAYhC,oBACtB9C,EAAS+C,EACTglD,EAAYhlD,EAAUM,eACtB2kD,EAAWjlD,EAAUI,cACrBC,EAAce,EAAQjB,eAAe6kD,GAEzC,GAAItc,GACgB,YAAdsX,GACEgF,IAAcC,EAGhB,OAAO7jD,EAKb,GAAIpB,EAAUytD,cAAe,CAC3B,GAAkB,YAAdzN,EAAyB,CAC3B,GAAIj+C,EAAYyyD,4BACd,OAAOpzD,EAGT,GAAIsnC,EAGF,GAFqB1oC,EAAUkuD,oBAAsB9sD,EAAQjB,eAAe6kD,GAAWpkD,YAEnE,CAClB,IAAIq2E,EAAqB71E,EAAQjB,eAAeE,EAAYwpC,aAE5D,IAAKotC,GAAyD,IAAnCA,EAAmBr2E,YAG5C,OAAOQ,CAEX,CAEJ,MAAO,GAAIW,EAAYwyD,8BACrB,OAAOnzD,EAKT,IAFAnE,EAASkwC,EAASprC,MAEH/B,EACb,OAAOoB,CAEX,CAEA,OAAOinC,EAAcY,YAAY7nC,EAASnE,EAAQ+iD,EACpD,C,iCC3DA,IAAIk3B,EAAwB,IAAI1nB,OAAO,KAAM,KAM7CjhD,EAAOC,QAJP,SAA2B2oE,GACzB,OAAOA,EAAMx4C,QAAQu4C,EAAuB,GAC9C,C,qCCJA,IAAIngC,EAAe,EAAQ,KAEvB6uB,EAAsB,EAAQ,OAE9BxzB,EAAY,EAAQ,OAEpB+uB,EAAe,EAAQ,MAEvBC,EAAmB,EAAQ,OAE3B7Z,EAA6B,EAAQ,OAErC1uC,EAAY,EAAQ,OAEpB6xC,EAAY,EAAQ,OAEpBtT,EAAOhF,EAAUU,UAAU,MAE/B,SAASskC,EAAiBl7D,EAAMm7D,GAC9B,IAAKn7D,EACH,MAAO,UAGT,IAAIo7D,EAAaC,EAAoBr7D,EAAMm7D,GAE3C,OAAIC,EAAWr7D,WAAas3B,KAAK2W,UACxBotB,EAAWpjC,aAGnBwW,EAAU4sB,IAA8Hz+D,GAAU,GAC/Hy+D,EACCE,UACvB,CAEA,SAASD,EAAoBr7D,EAAMm7D,GACjC,IAAII,OAA2BtxE,IAAlBkxE,EAA8BA,EAAcn7D,GAAQ,GAEjE,GAAIA,EAAKD,WAAas3B,KAAK2W,UAAW,CACpC,IAAIttD,EAASsf,EAAKg4B,YAAYt3C,OAC9B,OAAO2qD,EAA2BrrC,GAAMw7D,eAAe,SAAW96E,GAAU66E,EAAO76E,OAAS,MAAQ66E,EAAO7wE,KAAK,MAAQ,IAAM,IAChI,CAEA,IAAI+wE,EAAQz7D,EAAK07D,YAEM,IAAnBD,EAAM17D,UAAkBw7D,EAAO76E,QACjC+6E,EAAME,aAAa,cAAeJ,EAAO7wE,KAAK,OAKhD,IAFA,IAAI01D,EAAapgD,EAAKogD,WAEbjrD,EAAK,EAAGA,EAAKirD,EAAW1/D,OAAQyU,IACvCsmE,EAAMvP,YAAYmP,EAAoBjb,EAAWjrD,GAAKgmE,IAGxD,OAAOM,CACT,CAEA,SAASG,EAAuB57D,EAAMm7D,GAMpC,IAJA,IAAI3lB,EAAcx1C,EAEdgxD,EAAaxb,EAEVA,GAAa,CAClB,GAAIhH,EAAUgH,IAAgBwb,EAAW6K,aAAa,mBAEpD,OAAOX,EAAiB1lB,EAAa2lB,GAGrCnK,EADAxb,EAAcA,EAAYgR,UAG9B,CAEA,MAAO,+CACT,CAEA,SAAS4E,EAAcprD,GACrB,OAA0B,OAAnBA,EAAKymD,UAAqBzmD,EAAKogD,WAAW1/D,OAASsf,EAAKymD,UAAU/lE,MAC3E,CA0FA,SAASo7E,EAAoBh4E,EAAWkc,EAAMrU,EAAQkhC,GACpD,IAAIkvC,EAAgB7W,IAIpB,GAHaphE,EAAUk4E,QAGD,MAARh8D,GAAgBilD,EAAa8W,EAAe/7D,GAAO,CAO3DrU,EAASy/D,EAAcprD,IAEzB0pD,EAAoBhZ,yBAAyB,CAC3CiZ,cAAeiS,EAAuB57D,GACtC4pD,YAAarwC,KAAKC,UAAU,CAC1B7tB,OAAQA,IAEVkhC,eAAgBtT,KAAKC,UAAUqT,EAAe5/B,UAKlD,IAAIgvE,EAAej8D,IAASlc,EAAU2hE,UAEtC,IAIM3hE,EAAU0hE,WAAa,GAAK1hE,EAAUk4E,QACxCl4E,EAAUk4E,OAAOh8D,EAAMrU,EAE3B,CAAE,MAAOvL,GAmCP,MAlCAspE,EAAoBhZ,yBAAyB,CAC3CiZ,cAAeiS,EAAuB57D,GAAM,SAAUzf,GACpD,IAAIg7E,EAAS,GAcb,OAZIh7E,IAAMw7E,GACRR,EAAOj2E,KAAK,kBAGV/E,IAAMuD,EAAU26D,YAClB8c,EAAOj2E,KAAK,yBAGV/E,IAAMuD,EAAU2hE,WAClB8V,EAAOj2E,KAAK,wBAGPi2E,CACT,IACA3R,YAAarwC,KAAKC,UAAU,CAC1B0iD,kBAAmBH,EAAgBA,EAAc9c,SAAW,KAC5Dkd,YAAan8D,IAASlc,EAAU2hE,UAChCwW,aAAcA,EACdG,oBAAqBt4E,EAAU0hE,WAC/B6W,wBAAyBv4E,EAAU26D,WAAa36D,EAAU26D,WAAWQ,SAAW,KAChFqd,sBAAuBx4E,EAAUU,aACjC+3E,uBAAwBz4E,EAAU2hE,UAAY3hE,EAAU2hE,UAAUxG,SAAW,KAC7Eud,qBAAsB14E,EAAUW,YAChCg4E,QAASr8E,EAAI,GAAKA,EAAI,KACtBuL,OAAQA,GACP,KAAM,GACTkhC,eAAgBtT,KAAKC,UAAUqT,EAAe5/B,OAAQ,KAAM,KAIxD7M,CACR,CACF,MAME,GAAI4f,GAAQlc,EAAU0hE,WAAa,EAAG,CACpC,IAAIhD,EAAQ1+D,EAAUgvE,WAAW,GACjCtQ,EAAMka,OAAO18D,EAAMrU,GACnB7H,EAAU64E,SAASna,EAAMkJ,aAC3B,CAEJ,CAEA,SAASkR,EAAoB94E,EAAWkc,EAAMrU,EAAQkhC,GACpD,IAAI21B,EAAQnX,EAA2BrrC,GAAM68D,cAgB7C,GAdIlxE,EAASy/D,EAAcprD,KAEzB0pD,EAAoBhZ,yBAAyB,CAC3CiZ,cAAeiS,EAAuB57D,GACtC4pD,YAAarwC,KAAKC,UAAU,CAC1B7tB,OAAQA,IAEVkhC,eAAgBtT,KAAKC,UAAUqT,EAAe5/B,UAEhD4tC,EAAamU,8BAGfwT,EAAMgK,SAASxsD,EAAMrU,GAEjBuvC,EACF,IACEp3C,EAAU64E,SAASna,EACrB,CAAE,MAAOpiE,GACH,CAIN,MAEA0D,EAAU64E,SAASna,EAEvB,CAEAnwD,EAAOC,QAAU,CACfs7C,wBAlMF,SAAiC/gB,EAAgB7sB,EAAM81B,EAAUgnC,EAAWC,GAI1E,IAAIC,EAAiB3xB,EAA2BrrC,GAEhD,GAAKilD,EAAa+X,EAAe98D,gBAAiBF,GAAlD,CAIA,IAAIlc,EAAYk5E,EAAezX,YAAYxhE,eACvC+kD,EAAYjc,EAAezoC,eAC3BI,EAAeqoC,EAAemlB,kBAC9BjJ,EAAWlc,EAAe3oC,cAC1BO,EAAcooC,EAAeklB,iBAC7B/I,EAAanc,EAAevoC,gBAEhC,IAAKR,EAAUk4E,QAAUhzB,EAAY,CACnC,IAAIi0B,EAAUn0B,EACVo0B,EAAa14E,EACjBskD,EAAYC,EACZvkD,EAAeC,EACfskD,EAAWk0B,EACXx4E,EAAcy4E,EACdl0B,GAAa,CACf,CAEA,IAAIm0B,EAAYr0B,IAAchT,GAAYgnC,GAAat4E,GAAgBu4E,GAAWv4E,EAC9E8pD,EAAWvF,IAAajT,GAAYgnC,GAAar4E,GAAes4E,GAAWt4E,EAG/E,GAAI04E,GAAa7uB,EAIf,OAHAxqD,EAAU4hE,kBACVkX,EAAoB94E,EAAWkc,EAAMxb,EAAes4E,EAAWjwC,QAC/DivC,EAAoBh4E,EAAWkc,EAAMvb,EAAcq4E,EAAWjwC,GAIhE,GAAKmc,GA0BH,GATIsF,IACFxqD,EAAU4hE,kBACVkX,EAAoB94E,EAAWkc,EAAMvb,EAAcq4E,EAAWjwC,IAO5DswC,EAAW,CACb,IAAIC,EAAkBt5E,EAAU2hE,UAC5B4X,EAAoBv5E,EAAUW,YAClCX,EAAU4hE,kBACVkX,EAAoB94E,EAAWkc,EAAMxb,EAAes4E,EAAWjwC,GAC/DivC,EAAoBh4E,EAAWs5E,EAAiBC,EAAmBxwC,EACrE,OA9BIswC,IACFr5E,EAAU4hE,kBACVkX,EAAoB94E,EAAWkc,EAAMxb,EAAes4E,EAAWjwC,IAM7DyhB,GACFwtB,EAAoBh4E,EAAWkc,EAAMvb,EAAcq4E,EAAWjwC,EAzClE,CAgEF,EA2HEivC,oBAAqBA,E,qCC7RvB,IAAI5vC,EAAmB,EAAQ,OAE3BE,EAAoB,EAAQ,MAE5BE,EAAY,EAAQ,OAEpB3vB,EAAY,EAAQ,OAEpBq0C,EAA6B,EAAQ,MAErCtkD,EAAO4/B,EAAU5/B,KACjB4C,EAAMg9B,EAAUh9B,IAEhB0nE,EAAiB,SAAwB91E,EAAK2xC,EAAUokC,GAC1D,GAAK/1E,EAAL,CAIA,IAAI4I,EAAQ+oC,EAASzmC,IAAIlL,GAEpB4I,GAIL+oC,EAASxiC,IAAInP,EAAK+1E,EAAKntE,GARvB,CASF,EAiGAuI,EAAOC,QA5DwB,SAAkC/G,EAAcshC,GAC5EA,EAAe0kB,eAAiH50C,GAAU,GAC3I,IAAIzb,EAAM2rC,EAAezoC,eACrByuC,EAAWtnC,EAAa0nC,cACxBqqC,EAAezqC,EAASzmC,IAAIlL,GAC5B0Q,EAAO0rE,EAAa7xE,UAExB,IAAKmG,EAAM,CACT,IAAIhM,EAAY03E,EAAav3E,UAE7B,GAAkB,wBAAdH,GAAqD,sBAAdA,EACzC,OAAOorD,EAA2BzlD,EAAcshC,GAAgB,SAAU/iC,GACxE,OAAOA,EAAMlF,MAAM,CACjBnC,KAAM,WACNqtB,MAAO,GAEX,GAEJ,CAEA,IAAInkB,EAASkhC,EAAemlB,kBACxBpiB,EAAQ0tC,EAAalzC,mBACrBmzC,EAAWnxC,IACXgrC,EAA0BkG,aAAwBpxC,EAClDsxC,EAAaF,EAAa14E,MAAM,CAClCgN,KAAMA,EAAKvF,MAAM,EAAGV,GACpB8hC,cAAemC,EAAMvjC,MAAM,EAAGV,KAE5B8xE,EAAaD,EAAW54E,MAAM,CAChC1D,IAAKq8E,EACL3rE,KAAMA,EAAKvF,MAAMV,GACjB8hC,cAAemC,EAAMvjC,MAAMV,GAC3Bo6B,KAAMz2B,MAEJmpE,EAAe5lC,EAASl7B,QAAQ4gB,WAAU,SAAUzhB,GACtD,OAAOA,IAAMwmE,CACf,IACI5E,EAAc7lC,EAASl7B,QAAQwgB,WAAU,SAAUrhB,GACrD,OAAOA,IAAMwmE,CACf,IAAGjzE,OACCwrC,EAAY4iC,EAAajvE,OAAO,CAAC,CAACtI,EAAKs8E,GAAa,CAACD,EAAUE,IAAc/E,GAAapjD,eAO9F,OALI8hD,IACDkG,EAAanrC,eAAexb,WAAkHha,GAAU,GACzJk5B,EA/EsB,SAA6BhD,EAAU6qC,EAAeC,GAC9E,OAAO9qC,EAAStyB,eAAc,SAAU2mB,GACtC,IAAIowC,EAAmBoG,EAAcxuC,SACjC0uC,EAAgBD,EAAWzuC,SAE/B8nC,EAAe0G,EAActrC,eAAgBlL,GAAQ,SAAUp9B,GAC7D,IAAIguE,EAAqBhuE,EAAMqoC,eAC3B+iC,EAAiB4C,EAAmBnwE,QAAQ2vE,GAAoB,EAChEW,EAAmBH,EAAmB/+D,UAE1C,OADAk/D,EAAiBtvD,OAAOusD,EAAgB,EAAG0I,GACpC9zE,EAAMlF,MAAM,CACjBjD,SAAU+K,EAAKurE,IAEnB,IAEAjB,EAAe0G,EAAcprC,oBAAqBpL,GAAQ,SAAUp9B,GAClE,OAAOA,EAAMlF,MAAM,CACjBgpC,YAAagwC,GAEjB,IAEA5G,EAAeM,EAAkBpwC,GAAQ,SAAUp9B,GACjD,OAAOA,EAAMlF,MAAM,CACjB+oC,YAAaiwC,GAEjB,IAEA5G,EAAe4G,EAAe12C,GAAQ,SAAUp9B,GAC9C,OAAOA,EAAMlF,MAAM,CACjBgpC,YAAa0pC,GAEjB,GACF,GACF,CA8CgBlC,CAAoBv/B,EAAW2nC,EAAYC,IAGlDlyE,EAAa3G,MAAM,CACxBiuC,SAAUgD,EACV1H,gBAAiBtB,EACjBuB,eAAgBvB,EAAejoC,MAAM,CACnCkkD,UAAWy0B,EACX/4E,aAAc,EACdukD,SAAUw0B,EACV94E,YAAa,EACbukD,YAAY,KAGlB,C,iCCxHA,IAAI60B,EAAgB,YAMpBxrE,EAAOC,QAJP,SAAiCV,GAC/B,OAAOA,EAAK3F,MAAM4xE,EACpB,C,iCCQAxrE,EAAOC,QARP,WACE,MAAO,uCAAuCmwB,QAAQ,SAAS,SAAUlkB,GACvE,IAAIpe,EAAoB,GAAhB6U,KAAKw4D,SAAgB,EAE7B,OADa,KAALjvD,EAAWpe,EAAQ,EAAJA,EAAU,GACxBiY,SAAS,GACpB,GACF,C,oBCZiE/F,EAAOC,QAGhE,WAAc,aAAa,IAAIC,EAAU/R,MAAMW,UAAUkL,MAE/D,SAASmG,EAAYC,EAAM1E,GACrBA,IACF0E,EAAKtR,UAAYN,OAAOmP,OAAOjC,EAAW5M,YAE5CsR,EAAKtR,UAAU8O,YAAcwC,CAC/B,CAEA,SAASC,EAASC,GACd,OAAOC,EAAWD,GAASA,EAAQE,EAAIF,EACzC,CAIA,SAASG,EAAcH,GACrB,OAAOI,EAAQJ,GAASA,EAAQK,EAASL,EAC3C,CAIA,SAASM,EAAgBN,GACvB,OAAOO,EAAUP,GAASA,EAAQQ,EAAWR,EAC/C,CAIA,SAASS,EAAYT,GACnB,OAAOC,EAAWD,KAAWU,EAAcV,GAASA,EAAQW,EAAOX,EACrE,CAIF,SAASC,EAAWW,GAClB,SAAUA,IAAiBA,EAAcC,GAC3C,CAEA,SAAST,EAAQU,GACf,SAAUA,IAAcA,EAAWC,GACrC,CAEA,SAASR,EAAUS,GACjB,SAAUA,IAAgBA,EAAaC,GACzC,CAEA,SAASP,EAAcQ,GACrB,OAAOd,EAAQc,IAAqBX,EAAUW,EAChD,CAEA,SAASC,EAAUC,GACjB,SAAUA,IAAgBA,EAAaC,GACzC,CArCAxB,EAAYM,EAAeJ,GAM3BF,EAAYS,EAAiBP,GAM7BF,EAAYY,EAAaV,GA2BzBA,EAASE,WAAaA,EACtBF,EAASK,QAAUA,EACnBL,EAASQ,UAAYA,EACrBR,EAASW,cAAgBA,EACzBX,EAASoB,UAAYA,EAErBpB,EAASuB,MAAQnB,EACjBJ,EAASwB,QAAUjB,EACnBP,EAAS/J,IAAMyK,EAGf,IAAII,EAAuB,6BACvBE,EAAoB,0BACpBE,EAAsB,4BACtBI,EAAsB,4BAGtBG,EAAS,SAGTC,EAAQ,EACRC,EAAO,GAAKD,EACZE,EAAOD,EAAO,EAIdE,EAAU,CAAC,EAGXC,EAAgB,CAAE7B,OAAO,GACzB8B,EAAY,CAAE9B,OAAO,GAEzB,SAAS+B,EAAQrD,GAEf,OADAA,EAAIsB,OAAQ,EACLtB,CACT,CAEA,SAASsD,EAAOtD,GACdA,IAAQA,EAAIsB,OAAQ,EACtB,CAKA,SAASiC,IAAW,CAGpB,SAASC,EAAQC,EAAKnJ,GACpBA,EAASA,GAAU,EAGnB,IAFA,IAAIoJ,EAAMC,KAAKC,IAAI,EAAGH,EAAIpU,OAASiL,GAC/BuJ,EAAS,IAAI1U,MAAMuU,GACdI,EAAK,EAAGA,EAAKJ,EAAKI,IACzBD,EAAOC,GAAML,EAAIK,EAAKxJ,GAExB,OAAOuJ,CACT,CAEA,SAASE,EAAWC,GAIlB,YAHkBpL,IAAdoL,EAAK3H,OACP2H,EAAK3H,KAAO2H,EAAKC,UAAUC,IAEtBF,EAAK3H,IACd,CAEA,SAAS8H,EAAUH,EAAMnJ,GAQvB,GAAqB,kBAAVA,EAAoB,CAC7B,IAAIuJ,EAAcvJ,IAAU,EAC5B,GAAI,GAAKuJ,IAAgBvJ,GAAyB,aAAhBuJ,EAChC,OAAOC,IAETxJ,EAAQuJ,CACV,CACA,OAAOvJ,EAAQ,EAAIkJ,EAAWC,GAAQnJ,EAAQA,CAChD,CAEA,SAASqJ,IACP,OAAO,CACT,CAEA,SAASI,EAAWC,EAAOC,EAAKnI,GAC9B,OAAkB,IAAVkI,QAAyB3L,IAATyD,GAAsBkI,IAAUlI,UAC7CzD,IAAR4L,QAA+B5L,IAATyD,GAAsBmI,GAAOnI,EACxD,CAEA,SAASoI,EAAaF,EAAOlI,GAC3B,OAAOqI,EAAaH,EAAOlI,EAAM,EACnC,CAEA,SAASsI,EAAWH,EAAKnI,GACvB,OAAOqI,EAAaF,EAAKnI,EAAMA,EACjC,CAEA,SAASqI,EAAa7J,EAAOwB,EAAMuI,GACjC,YAAiBhM,IAAViC,EACL+J,EACA/J,EAAQ,EACN8I,KAAKC,IAAI,EAAGvH,EAAOxB,QACVjC,IAATyD,EACExB,EACA8I,KAAKkB,IAAIxI,EAAMxB,EACvB,CAIA,IAAIiK,EAAe,EACfC,EAAiB,EACjBC,EAAkB,EAElBC,EAAyC,oBAAXC,QAAyBA,OAAOC,SAC9DC,EAAuB,aAEvBC,EAAkBJ,GAAwBG,EAG9C,SAASE,EAASlG,GACdlP,KAAKkP,KAAOA,CACd,CAkBF,SAASmG,EAAcnU,EAAMoU,EAAGC,EAAGC,GACjC,IAAIpE,EAAiB,IAATlQ,EAAaoU,EAAa,IAATpU,EAAaqU,EAAI,CAACD,EAAGC,GAIlD,OAHAC,EAAkBA,EAAepE,MAAQA,EAAUoE,EAAiB,CAClEpE,MAAOA,EAAOqE,MAAM,GAEfD,CACT,CAEA,SAASE,IACP,MAAO,CAAEtE,WAAO1I,EAAW+M,MAAM,EACnC,CAEA,SAASE,EAAY3D,GACnB,QAAS4D,EAAc5D,EACzB,CAEA,SAAS6D,EAAWC,GAClB,OAAOA,GAA+C,oBAAvBA,EAAc5G,IAC/C,CAEA,SAAS6G,EAAYC,GACnB,IAAIC,EAAaL,EAAcI,GAC/B,OAAOC,GAAcA,EAAWnW,KAAKkW,EACvC,CAEA,SAASJ,EAAcI,GACrB,IAAIC,EAAaD,IACdjB,GAAwBiB,EAASjB,IAClCiB,EAASd,IAEX,GAA0B,oBAAfe,EACT,OAAOA,CAEX,CAEA,SAASC,EAAY9E,GACnB,OAAOA,GAAiC,kBAAjBA,EAAMjS,MAC/B,CAGE,SAASmS,EAAIF,GACX,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsB+E,KAC7C9E,EAAWD,GAASA,EAAMgF,QAAUC,GAAajF,EACrD,CAqCA,SAASK,EAASL,GAChB,OAAiB,OAAVA,QAA4B1I,IAAV0I,EACvB+E,KAAgBG,aAChBjF,EAAWD,GACRI,EAAQJ,GAASA,EAAMgF,QAAUhF,EAAMmF,eACxCC,GAAkBpF,EACxB,CASA,SAASQ,EAAWR,GAClB,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsB+E,KAC5C9E,EAAWD,GACZI,EAAQJ,GAASA,EAAMqF,WAAarF,EAAMsF,eADrBC,GAAoBvF,EAE7C,CAyBA,SAASW,EAAOX,GACd,OACY,OAAVA,QAA4B1I,IAAV0I,EAAsB+E,KACvC9E,EAAWD,GACZI,EAAQJ,GAASA,EAAMqF,WAAarF,EADfuF,GAAoBvF,IAEzCwF,UACJ,CAlJAxB,EAASxV,UAAUiX,SAAW,WAC5B,MAAO,YACT,EAGFzB,EAAS0B,KAAOlC,EAChBQ,EAAS2B,OAASlC,EAClBO,EAAS4B,QAAUlC,EAEnBM,EAASxV,UAAUqX,QACnB7B,EAASxV,UAAUsX,SAAW,WAAc,OAAOlX,KAAK6W,UAAY,EACpEzB,EAASxV,UAAUuV,GAAmB,WACpC,OAAOnV,IACT,EA0CAiR,EAAYK,EAAKH,GAMfG,EAAI6F,GAAK,WACP,OAAO7F,EAAIlS,UACb,EAEAkS,EAAI1R,UAAUwW,MAAQ,WACpB,OAAOpW,IACT,EAEAsR,EAAI1R,UAAUiX,SAAW,WACvB,OAAO7W,KAAKoX,WAAW,QAAS,IAClC,EAEA9F,EAAI1R,UAAUyX,YAAc,WAK1B,OAJKrX,KAAKsX,QAAUtX,KAAKuX,oBACvBvX,KAAKsX,OAAStX,KAAKyW,WAAWe,UAC9BxX,KAAKmM,KAAOnM,KAAKsX,OAAOnY,QAEnBa,IACT,EAIAsR,EAAI1R,UAAUmU,UAAY,SAAS/L,EAAIyP,GACrC,OAAOC,GAAW1X,KAAMgI,EAAIyP,GAAS,EACvC,EAIAnG,EAAI1R,UAAU+X,WAAa,SAASzW,EAAMuW,GACxC,OAAOG,GAAY5X,KAAMkB,EAAMuW,GAAS,EAC1C,EAIFxG,EAAYQ,EAAUH,GASpBG,EAAS7R,UAAU0W,WAAa,WAC9B,OAAOtW,IACT,EAIFiR,EAAYW,EAAYN,GAOtBM,EAAWuF,GAAK,WACd,OAAOvF,EAAWxS,UACpB,EAEAwS,EAAWhS,UAAU8W,aAAe,WAClC,OAAO1W,IACT,EAEA4R,EAAWhS,UAAUiX,SAAW,WAC9B,OAAO7W,KAAKoX,WAAW,QAAS,IAClC,EAEAxF,EAAWhS,UAAUmU,UAAY,SAAS/L,EAAIyP,GAC5C,OAAOC,GAAW1X,KAAMgI,EAAIyP,GAAS,EACvC,EAEA7F,EAAWhS,UAAU+X,WAAa,SAASzW,EAAMuW,GAC/C,OAAOG,GAAY5X,KAAMkB,EAAMuW,GAAS,EAC1C,EAIFxG,EAAYc,EAAQT,GASlBS,EAAOoF,GAAK,WACV,OAAOpF,EAAO3S,UAChB,EAEA2S,EAAOnS,UAAUgX,SAAW,WAC1B,OAAO5W,IACT,EAIFsR,EAAIuG,MAAQA,GACZvG,EAAIoB,MAAQjB,EACZH,EAAIlK,IAAM2K,EACVT,EAAIqB,QAAUf,EAEd,IA2LIkG,EAuUAC,EAqHAC,EAvnBAC,GAAkB,wBAOpB,SAASC,GAASC,GAChBnY,KAAKoY,OAASD,EACdnY,KAAKmM,KAAOgM,EAAMhZ,MACpB,CA+BA,SAASkZ,GAAUC,GACjB,IAAInS,EAAO7G,OAAO6G,KAAKmS,GACvBtY,KAAKuY,QAAUD,EACftY,KAAKwY,MAAQrS,EACbnG,KAAKmM,KAAOhG,EAAKhH,MACnB,CA2CA,SAASsZ,GAAYzC,GACnBhW,KAAK0Y,UAAY1C,EACjBhW,KAAKmM,KAAO6J,EAAS7W,QAAU6W,EAAS7J,IAC1C,CAuCA,SAASwM,GAAY1D,GACnBjV,KAAK4Y,UAAY3D,EACjBjV,KAAK6Y,eAAiB,EACxB,CAiDF,SAAShB,GAAMiB,GACb,SAAUA,IAAYA,EAASb,IACjC,CAIA,SAAS9B,KACP,OAAO2B,IAAcA,EAAY,IAAII,GAAS,IAChD,CAEA,SAAS1B,GAAkBpF,GACzB,IAAI2H,EACF9Z,MAAMC,QAAQkS,GAAS,IAAI8G,GAAS9G,GAAOmF,eAC3CV,EAAWzE,GAAS,IAAIuH,GAAYvH,GAAOmF,eAC3CZ,EAAYvE,GAAS,IAAIqH,GAAYrH,GAAOmF,eAC3B,kBAAVnF,EAAqB,IAAIiH,GAAUjH,QAC1C1I,EACF,IAAKqQ,EACH,MAAM,IAAIC,UACR,yEACsB5H,GAG1B,OAAO2H,CACT,CAEA,SAASpC,GAAoBvF,GAC3B,IAAI2H,EAAME,GAAyB7H,GACnC,IAAK2H,EACH,MAAM,IAAIC,UACR,gDAAkD5H,GAGtD,OAAO2H,CACT,CAEA,SAAS1C,GAAajF,GACpB,IAAI2H,EAAME,GAAyB7H,IACf,kBAAVA,GAAsB,IAAIiH,GAAUjH,GAC9C,IAAK2H,EACH,MAAM,IAAIC,UACR,iEAAmE5H,GAGvE,OAAO2H,CACT,CAEA,SAASE,GAAyB7H,GAChC,OACE8E,EAAY9E,GAAS,IAAI8G,GAAS9G,GAClCyE,EAAWzE,GAAS,IAAIuH,GAAYvH,GACpCuE,EAAYvE,GAAS,IAAIqH,GAAYrH,QACrC1I,CAEJ,CAEA,SAASgP,GAAWqB,EAAK/Q,EAAIyP,EAASyB,GACpC,IAAIC,EAAQJ,EAAIzB,OAChB,GAAI6B,EAAO,CAET,IADA,IAAIC,EAAWD,EAAMha,OAAS,EACrByU,EAAK,EAAGA,GAAMwF,EAAUxF,IAAM,CACrC,IAAIyF,EAAQF,EAAM1B,EAAU2B,EAAWxF,EAAKA,GAC5C,IAAmD,IAA/C5L,EAAGqR,EAAM,GAAIH,EAAUG,EAAM,GAAKzF,EAAImF,GACxC,OAAOnF,EAAK,CAEhB,CACA,OAAOA,CACT,CACA,OAAOmF,EAAIxB,kBAAkBvP,EAAIyP,EACnC,CAEA,SAASG,GAAYmB,EAAK7X,EAAMuW,EAASyB,GACvC,IAAIC,EAAQJ,EAAIzB,OAChB,GAAI6B,EAAO,CACT,IAAIC,EAAWD,EAAMha,OAAS,EAC1ByU,EAAK,EACT,OAAO,IAAIwB,GAAS,WAClB,IAAIiE,EAAQF,EAAM1B,EAAU2B,EAAWxF,EAAKA,GAC5C,OAAOA,IAAOwF,EACZ1D,IACAL,EAAcnU,EAAMgY,EAAUG,EAAM,GAAKzF,EAAK,EAAGyF,EAAM,GAC3D,GACF,CACA,OAAON,EAAIO,mBAAmBpY,EAAMuW,EACtC,CAEA,SAAS8B,GAAOC,EAAMC,GACpB,OAAOA,EACLC,GAAWD,EAAWD,EAAM,GAAI,CAAC,GAAIA,IACrCG,GAAcH,EAClB,CAEA,SAASE,GAAWD,EAAWD,EAAM7Z,EAAKia,GACxC,OAAI3a,MAAMC,QAAQsa,GACTC,EAAU3Z,KAAK8Z,EAAYja,EAAKiS,EAAW4H,GAAMhO,KAAI,SAAS+J,EAAGD,GAAK,OAAOoE,GAAWD,EAAWlE,EAAGD,EAAGkE,EAAK,KAEnHK,GAAWL,GACNC,EAAU3Z,KAAK8Z,EAAYja,EAAK8R,EAAS+H,GAAMhO,KAAI,SAAS+J,EAAGD,GAAK,OAAOoE,GAAWD,EAAWlE,EAAGD,EAAGkE,EAAK,KAE9GA,CACT,CAEA,SAASG,GAAcH,GACrB,OAAIva,MAAMC,QAAQsa,GACT5H,EAAW4H,GAAMhO,IAAImO,IAAeG,SAEzCD,GAAWL,GACN/H,EAAS+H,GAAMhO,IAAImO,IAAeI,QAEpCP,CACT,CAEA,SAASK,GAAWzI,GAClB,OAAOA,IAAUA,EAAM1C,cAAgBpP,aAAgCoJ,IAAtB0I,EAAM1C,YACzD,CAwDA,SAASsL,GAAGC,EAAQC,GAClB,GAAID,IAAWC,GAAWD,IAAWA,GAAUC,IAAWA,EACxD,OAAO,EAET,IAAKD,IAAWC,EACd,OAAO,EAET,GAA8B,oBAAnBD,EAAOE,SACY,oBAAnBD,EAAOC,QAAwB,CAGxC,IAFAF,EAASA,EAAOE,cAChBD,EAASA,EAAOC,YACUF,IAAWA,GAAUC,IAAWA,EACxD,OAAO,EAET,IAAKD,IAAWC,EACd,OAAO,CAEX,CACA,QAA6B,oBAAlBD,EAAOG,QACW,oBAAlBF,EAAOE,SACdH,EAAOG,OAAOF,GAIpB,CAEA,SAASG,GAAUC,EAAGC,GACpB,GAAID,IAAMC,EACR,OAAO,EAGT,IACGlJ,EAAWkJ,SACD7R,IAAX4R,EAAEnO,WAAiCzD,IAAX6R,EAAEpO,MAAsBmO,EAAEnO,OAASoO,EAAEpO,WAChDzD,IAAb4R,EAAEE,aAAqC9R,IAAb6R,EAAEC,QAAwBF,EAAEE,SAAWD,EAAEC,QACnEhJ,EAAQ8I,KAAO9I,EAAQ+I,IACvB5I,EAAU2I,KAAO3I,EAAU4I,IAC3BhI,EAAU+H,KAAO/H,EAAUgI,GAE3B,OAAO,EAGT,GAAe,IAAXD,EAAEnO,MAAyB,IAAXoO,EAAEpO,KACpB,OAAO,EAGT,IAAIsO,GAAkB3I,EAAcwI,GAEpC,GAAI/H,EAAU+H,GAAI,CAChB,IAAII,EAAUJ,EAAEI,UAChB,OAAOH,EAAEI,OAAM,SAASpF,EAAGD,GACzB,IAAI+D,EAAQqB,EAAQxL,OAAOkC,MAC3B,OAAOiI,GAASW,GAAGX,EAAM,GAAI9D,KAAOkF,GAAkBT,GAAGX,EAAM,GAAI/D,GACrE,KAAMoF,EAAQxL,OAAOuG,IACvB,CAEA,IAAImF,GAAU,EAEd,QAAelS,IAAX4R,EAAEnO,KACJ,QAAezD,IAAX6R,EAAEpO,KACyB,oBAAlBmO,EAAEjD,aACXiD,EAAEjD,kBAEC,CACLuD,GAAU,EACV,IAAIC,EAAIP,EACRA,EAAIC,EACJA,EAAIM,CACN,CAGF,IAAIC,GAAW,EACXC,EAAQR,EAAExG,WAAU,SAASwB,EAAGD,GAClC,GAAImF,GAAkBH,EAAEtY,IAAIuT,GACxBqF,GAAWZ,GAAGzE,EAAG+E,EAAEzP,IAAIyK,EAAGtC,KAAagH,GAAGM,EAAEzP,IAAIyK,EAAGtC,GAAUuC,GAE/D,OADAuF,GAAW,GACJ,CAEX,IAEA,OAAOA,GAAYR,EAAEnO,OAAS4O,CAChC,CAIE,SAASC,GAAO5J,EAAO6J,GACrB,KAAMjb,gBAAgBgb,IACpB,OAAO,IAAIA,GAAO5J,EAAO6J,GAI3B,GAFAjb,KAAKkb,OAAS9J,EACdpR,KAAKmM,UAAiBzD,IAAVuS,EAAsBE,IAAW1H,KAAKC,IAAI,EAAGuH,GACvC,IAAdjb,KAAKmM,KAAY,CACnB,GAAI4L,EACF,OAAOA,EAETA,EAAe/X,IACjB,CACF,CAkEF,SAASob,GAAUC,EAAWC,GAC5B,IAAKD,EAAW,MAAM,IAAIE,MAAMD,EAClC,CAIE,SAASE,GAAMC,EAAOnH,EAAKoH,GACzB,KAAM1b,gBAAgBwb,IACpB,OAAO,IAAIA,GAAMC,EAAOnH,EAAKoH,GAe/B,GAbAN,GAAmB,IAATM,EAAY,4BACtBD,EAAQA,GAAS,OACL/S,IAAR4L,IACFA,EAAM6G,KAERO,OAAgBhT,IAATgT,EAAqB,EAAIjI,KAAKkI,IAAID,GACrCpH,EAAMmH,IACRC,GAAQA,GAEV1b,KAAK4b,OAASH,EACdzb,KAAK6b,KAAOvH,EACZtU,KAAK8b,MAAQJ,EACb1b,KAAKmM,KAAOsH,KAAKC,IAAI,EAAGD,KAAKsI,MAAMzH,EAAMmH,GAASC,EAAO,GAAK,GAC5C,IAAd1b,KAAKmM,KAAY,CACnB,GAAI6L,EACF,OAAOA,EAETA,EAAchY,IAChB,CACF,CAyFA,SAASgc,KACP,MAAMhD,UAAU,WAClB,CAGuC,SAASiD,KAAmB,CAE1B,SAASC,KAAqB,CAElC,SAASC,KAAiB,CAjoBjE7K,EAAI1R,UAAUqY,KAAmB,EAIjChH,EAAYiH,GAAUtG,GAMpBsG,GAAStY,UAAUiL,IAAM,SAASF,EAAOyR,GACvC,OAAOpc,KAAKgC,IAAI2I,GAAS3K,KAAKoY,OAAOnE,EAAUjU,KAAM2K,IAAUyR,CACjE,EAEAlE,GAAStY,UAAUmU,UAAY,SAAS/L,EAAIyP,GAG1C,IAFA,IAAIU,EAAQnY,KAAKoY,OACbgB,EAAWjB,EAAMhZ,OAAS,EACrByU,EAAK,EAAGA,GAAMwF,EAAUxF,IAC/B,IAA0D,IAAtD5L,EAAGmQ,EAAMV,EAAU2B,EAAWxF,EAAKA,GAAKA,EAAI5T,MAC9C,OAAO4T,EAAK,EAGhB,OAAOA,CACT,EAEAsE,GAAStY,UAAU+X,WAAa,SAASzW,EAAMuW,GAC7C,IAAIU,EAAQnY,KAAKoY,OACbgB,EAAWjB,EAAMhZ,OAAS,EAC1ByU,EAAK,EACT,OAAO,IAAIwB,GAAS,WACjB,OAAOxB,EAAKwF,EACX1D,IACAL,EAAcnU,EAAM0S,EAAIuE,EAAMV,EAAU2B,EAAWxF,IAAOA,KAAM,GAEtE,EAIF3C,EAAYoH,GAAW5G,GAQrB4G,GAAUzY,UAAUiL,IAAM,SAASlL,EAAKyc,GACtC,YAAoB1T,IAAhB0T,GAA8Bpc,KAAKgC,IAAIrC,GAGpCK,KAAKuY,QAAQ5Y,GAFXyc,CAGX,EAEA/D,GAAUzY,UAAUoC,IAAM,SAASrC,GACjC,OAAOK,KAAKuY,QAAQ1Y,eAAeF,EACrC,EAEA0Y,GAAUzY,UAAUmU,UAAY,SAAS/L,EAAIyP,GAI3C,IAHA,IAAIa,EAAStY,KAAKuY,QACdpS,EAAOnG,KAAKwY,MACZY,EAAWjT,EAAKhH,OAAS,EACpByU,EAAK,EAAGA,GAAMwF,EAAUxF,IAAM,CACrC,IAAIjU,EAAMwG,EAAKsR,EAAU2B,EAAWxF,EAAKA,GACzC,IAAmC,IAA/B5L,EAAGsQ,EAAO3Y,GAAMA,EAAKK,MACvB,OAAO4T,EAAK,CAEhB,CACA,OAAOA,CACT,EAEAyE,GAAUzY,UAAU+X,WAAa,SAASzW,EAAMuW,GAC9C,IAAIa,EAAStY,KAAKuY,QACdpS,EAAOnG,KAAKwY,MACZY,EAAWjT,EAAKhH,OAAS,EACzByU,EAAK,EACT,OAAO,IAAIwB,GAAS,WAClB,IAAIzV,EAAMwG,EAAKsR,EAAU2B,EAAWxF,EAAKA,GACzC,OAAOA,IAAOwF,EACZ1D,IACAL,EAAcnU,EAAMvB,EAAK2Y,EAAO3Y,GACpC,GACF,EAEF0Y,GAAUzY,UAAU6S,IAAuB,EAG3CxB,EAAYwH,GAAa7G,GAMvB6G,GAAY7Y,UAAU2X,kBAAoB,SAASvP,EAAIyP,GACrD,GAAIA,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAE1C,IACIxC,EAAWc,EADA/V,KAAK0Y,WAEhB2D,EAAa,EACjB,GAAIxG,EAAWZ,GAEb,IADA,IAAIyG,IACKA,EAAOzG,EAAS/F,QAAQuG,OACY,IAAvCzN,EAAG0T,EAAKtK,MAAOiL,IAAcrc,QAKrC,OAAOqc,CACT,EAEA5D,GAAY7Y,UAAU0Z,mBAAqB,SAASpY,EAAMuW,GACxD,GAAIA,EACF,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAE7C,IACIxC,EAAWc,EADA/V,KAAK0Y,WAEpB,IAAK7C,EAAWZ,GACd,OAAO,IAAIG,EAASM,GAEtB,IAAI2G,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,OAAOwM,EAAKjG,KAAOiG,EAAOrG,EAAcnU,EAAMmb,IAAcX,EAAKtK,MACnE,GACF,EAIFH,EAAY0H,GAAa/G,GAMvB+G,GAAY/Y,UAAU2X,kBAAoB,SAASvP,EAAIyP,GACrD,GAAIA,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAK1C,IAHA,IAQIiE,EARAzG,EAAWjV,KAAK4Y,UAChBO,EAAQnZ,KAAK6Y,eACbwD,EAAa,EACVA,EAAalD,EAAMha,QACxB,IAAkD,IAA9C6I,EAAGmR,EAAMkD,GAAaA,IAAcrc,MACtC,OAAOqc,EAIX,OAASX,EAAOzG,EAAS/F,QAAQuG,MAAM,CACrC,IAAI6G,EAAMZ,EAAKtK,MAEf,GADA+H,EAAMkD,GAAcC,GACgB,IAAhCtU,EAAGsU,EAAKD,IAAcrc,MACxB,KAEJ,CACA,OAAOqc,CACT,EAEA1D,GAAY/Y,UAAU0Z,mBAAqB,SAASpY,EAAMuW,GACxD,GAAIA,EACF,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAE7C,IAAIxC,EAAWjV,KAAK4Y,UAChBO,EAAQnZ,KAAK6Y,eACbwD,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,GAAIiH,GAAclD,EAAMha,OAAQ,CAC9B,IAAIuc,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAETvC,EAAMkD,GAAcX,EAAKtK,KAC3B,CACA,OAAOiE,EAAcnU,EAAMmb,EAAYlD,EAAMkD,KAC/C,GACF,EAoQFpL,EAAY+J,GAAQpJ,GAgBlBoJ,GAAOpb,UAAUiX,SAAW,WAC1B,OAAkB,IAAd7W,KAAKmM,KACA,YAEF,YAAcnM,KAAKkb,OAAS,IAAMlb,KAAKmM,KAAO,UACvD,EAEA6O,GAAOpb,UAAUiL,IAAM,SAASF,EAAOyR,GACrC,OAAOpc,KAAKgC,IAAI2I,GAAS3K,KAAKkb,OAASkB,CACzC,EAEApB,GAAOpb,UAAU2c,SAAW,SAASC,GACnC,OAAOxC,GAAGha,KAAKkb,OAAQsB,EACzB,EAEAxB,GAAOpb,UAAUkL,MAAQ,SAASuJ,EAAOC,GACvC,IAAInI,EAAOnM,KAAKmM,KAChB,OAAOiI,EAAWC,EAAOC,EAAKnI,GAAQnM,KACpC,IAAIgb,GAAOhb,KAAKkb,OAAQzG,EAAWH,EAAKnI,GAAQoI,EAAaF,EAAOlI,GACxE,EAEA6O,GAAOpb,UAAU6X,QAAU,WACzB,OAAOzX,IACT,EAEAgb,GAAOpb,UAAUwG,QAAU,SAASoW,GAClC,OAAIxC,GAAGha,KAAKkb,OAAQsB,GACX,GAED,CACV,EAEAxB,GAAOpb,UAAU6c,YAAc,SAASD,GACtC,OAAIxC,GAAGha,KAAKkb,OAAQsB,GACXxc,KAAKmM,MAEN,CACV,EAEA6O,GAAOpb,UAAUmU,UAAY,SAAS/L,EAAIyP,GACxC,IAAK,IAAI7D,EAAK,EAAGA,EAAK5T,KAAKmM,KAAMyH,IAC/B,IAAkC,IAA9B5L,EAAGhI,KAAKkb,OAAQtH,EAAI5T,MACtB,OAAO4T,EAAK,EAGhB,OAAOA,CACT,EAEAoH,GAAOpb,UAAU+X,WAAa,SAASzW,EAAMuW,GAAU,IAAIiF,EAAS1c,KAC9D4T,EAAK,EACT,OAAO,IAAIwB,GAAS,WACjB,OAAOxB,EAAK8I,EAAOvQ,KAAOkJ,EAAcnU,EAAM0S,IAAM8I,EAAOxB,QAAUxF,GAAc,GAExF,EAEAsF,GAAOpb,UAAUwa,OAAS,SAASuC,GACjC,OAAOA,aAAiB3B,GACtBhB,GAAGha,KAAKkb,OAAQyB,EAAMzB,QACtBb,GAAUsC,EACd,EASF1L,EAAYuK,GAAO5J,GA2BjB4J,GAAM5b,UAAUiX,SAAW,WACzB,OAAkB,IAAd7W,KAAKmM,KACA,WAEF,WACLnM,KAAK4b,OAAS,MAAQ5b,KAAK6b,MAC1B7b,KAAK8b,MAAQ,EAAI,OAAS9b,KAAK8b,MAAQ,IAC1C,IACF,EAEAN,GAAM5b,UAAUiL,IAAM,SAASF,EAAOyR,GACpC,OAAOpc,KAAKgC,IAAI2I,GACd3K,KAAK4b,OAAS3H,EAAUjU,KAAM2K,GAAS3K,KAAK8b,MAC5CM,CACJ,EAEAZ,GAAM5b,UAAU2c,SAAW,SAASC,GAClC,IAAII,GAAiBJ,EAAcxc,KAAK4b,QAAU5b,KAAK8b,MACvD,OAAOc,GAAiB,GACtBA,EAAgB5c,KAAKmM,MACrByQ,IAAkBnJ,KAAKoJ,MAAMD,EACjC,EAEApB,GAAM5b,UAAUkL,MAAQ,SAASuJ,EAAOC,GACtC,OAAIF,EAAWC,EAAOC,EAAKtU,KAAKmM,MACvBnM,MAETqU,EAAQE,EAAaF,EAAOrU,KAAKmM,OACjCmI,EAAMG,EAAWH,EAAKtU,KAAKmM,QAChBkI,EACF,IAAImH,GAAM,EAAG,GAEf,IAAIA,GAAMxb,KAAK6K,IAAIwJ,EAAOrU,KAAK6b,MAAO7b,KAAK6K,IAAIyJ,EAAKtU,KAAK6b,MAAO7b,KAAK8b,OAC9E,EAEAN,GAAM5b,UAAUwG,QAAU,SAASoW,GACjC,IAAIM,EAAcN,EAAcxc,KAAK4b,OACrC,GAAIkB,EAAc9c,KAAK8b,QAAU,EAAG,CAClC,IAAInR,EAAQmS,EAAc9c,KAAK8b,MAC/B,GAAInR,GAAS,GAAKA,EAAQ3K,KAAKmM,KAC7B,OAAOxB,CAEX,CACA,OAAQ,CACV,EAEA6Q,GAAM5b,UAAU6c,YAAc,SAASD,GACrC,OAAOxc,KAAKoG,QAAQoW,EACtB,EAEAhB,GAAM5b,UAAUmU,UAAY,SAAS/L,EAAIyP,GAIvC,IAHA,IAAI2B,EAAWpZ,KAAKmM,KAAO,EACvBuP,EAAO1b,KAAK8b,MACZ1K,EAAQqG,EAAUzX,KAAK4b,OAASxC,EAAWsC,EAAO1b,KAAK4b,OAClDhI,EAAK,EAAGA,GAAMwF,EAAUxF,IAAM,CACrC,IAA4B,IAAxB5L,EAAGoJ,EAAOwC,EAAI5T,MAChB,OAAO4T,EAAK,EAEdxC,GAASqG,GAAWiE,EAAOA,CAC7B,CACA,OAAO9H,CACT,EAEA4H,GAAM5b,UAAU+X,WAAa,SAASzW,EAAMuW,GAC1C,IAAI2B,EAAWpZ,KAAKmM,KAAO,EACvBuP,EAAO1b,KAAK8b,MACZ1K,EAAQqG,EAAUzX,KAAK4b,OAASxC,EAAWsC,EAAO1b,KAAK4b,OACvDhI,EAAK,EACT,OAAO,IAAIwB,GAAS,WAClB,IAAIG,EAAInE,EAER,OADAA,GAASqG,GAAWiE,EAAOA,EACpB9H,EAAKwF,EAAW1D,IAAiBL,EAAcnU,EAAM0S,IAAM2B,EACpE,GACF,EAEAiG,GAAM5b,UAAUwa,OAAS,SAASuC,GAChC,OAAOA,aAAiBnB,GACtBxb,KAAK4b,SAAWe,EAAMf,QACtB5b,KAAK6b,OAASc,EAAMd,MACpB7b,KAAK8b,QAAUa,EAAMb,MACrBzB,GAAUra,KAAM2c,EACpB,EAKF1L,EAAY+K,GAAY7K,GAMxBF,EAAYgL,GAAiBD,IAE7B/K,EAAYiL,GAAmBF,IAE/B/K,EAAYkL,GAAeH,IAG3BA,GAAWtJ,MAAQuJ,GACnBD,GAAWrJ,QAAUuJ,GACrBF,GAAW5U,IAAM+U,GAEjB,IAAIY,GACmB,oBAAdtJ,KAAKsJ,OAAqD,IAA9BtJ,KAAKsJ,KAAK,WAAY,GACzDtJ,KAAKsJ,KACL,SAAczC,EAAGC,GAGf,IAAIyC,EAAQ,OAFZ1C,GAAQ,GAGJ9Y,EAAQ,OAFZ+Y,GAAQ,GAIR,OAAQyC,EAAIxb,IAAS8Y,IAAM,IAAM9Y,EAAIwb,GAAKzC,IAAM,KAAQ,KAAQ,GAAK,CACvE,EAMF,SAAS0C,GAAIC,GACX,OAASA,IAAQ,EAAK,WAAqB,WAANA,CACvC,CAEA,SAASC,GAAKvX,GACZ,IAAU,IAANA,GAAqB,OAANA,QAAoB8C,IAAN9C,EAC/B,OAAO,EAET,GAAyB,oBAAdA,EAAEuU,WAED,KADVvU,EAAIA,EAAEuU,YACmB,OAANvU,QAAoB8C,IAAN9C,GAC/B,OAAO,EAGX,IAAU,IAANA,EACF,OAAO,EAET,IAAI1E,SAAc0E,EAClB,GAAa,WAAT1E,EAAmB,CACrB,IAAIkc,EAAQ,EAAJxX,EAIR,IAHIwX,IAAMxX,IACRwX,GAAS,WAAJxX,GAEAA,EAAI,YAETwX,GADAxX,GAAK,WAGP,OAAOqX,GAAIG,EACb,CACA,GAAa,WAATlc,EACF,OAAO0E,EAAEzG,OAASke,GAA+BC,GAAiB1X,GAAK2X,GAAW3X,GAEpF,GAA0B,oBAAfA,EAAE4X,SACX,OAAO5X,EAAE4X,WAEX,GAAa,WAATtc,EACF,OAAOuc,GAAU7X,GAEnB,GAA0B,oBAAfA,EAAEiR,SACX,OAAO0G,GAAW3X,EAAEiR,YAEtB,MAAM,IAAI0E,MAAM,cAAgBra,EAAO,qBACzC,CAEA,SAASoc,GAAiBI,GACxB,IAAIP,EAAOQ,GAAgBD,GAU3B,YATahV,IAATyU,IACFA,EAAOI,GAAWG,GACdE,KAA2BC,KAC7BD,GAAyB,EACzBD,GAAkB,CAAC,GAErBC,KACAD,GAAgBD,GAAUP,GAErBA,CACT,CAGA,SAASI,GAAWG,GAQlB,IADA,IAAIP,EAAO,EACFvJ,EAAK,EAAGA,EAAK8J,EAAOve,OAAQyU,IACnCuJ,EAAO,GAAKA,EAAOO,EAAOI,WAAWlK,GAAM,EAE7C,OAAOqJ,GAAIE,EACb,CAEA,SAASM,GAAUzR,GACjB,IAAImR,EACJ,GAAIY,SAEWrV,KADbyU,EAAOa,GAAQnT,IAAImB,IAEjB,OAAOmR,EAKX,QAAazU,KADbyU,EAAOnR,EAAIiS,KAET,OAAOd,EAGT,IAAKe,GAAmB,CAEtB,QAAaxV,KADbyU,EAAOnR,EAAImS,sBAAwBnS,EAAImS,qBAAqBF,KAE1D,OAAOd,EAIT,QAAazU,KADbyU,EAAOiB,GAAcpS,IAEnB,OAAOmR,CAEX,CAOA,GALAA,IAASkB,GACQ,WAAbA,KACFA,GAAa,GAGXN,GACFC,GAAQlP,IAAI9C,EAAKmR,OACZ,SAAqBzU,IAAjB4V,KAAoD,IAAtBA,GAAatS,GACpD,MAAM,IAAIuP,MAAM,mDACX,GAAI2C,GACT5e,OAAOif,eAAevS,EAAKiS,GAAc,CACvC,YAAc,EACd,cAAgB,EAChB,UAAY,EACZ,MAASd,SAEN,QAAiCzU,IAA7BsD,EAAImS,sBACJnS,EAAImS,uBAAyBnS,EAAI0C,YAAY9O,UAAUue,qBAKhEnS,EAAImS,qBAAuB,WACzB,OAAOne,KAAK0O,YAAY9O,UAAUue,qBAAqBpe,MAAMC,KAAMZ,UACrE,EACA4M,EAAImS,qBAAqBF,IAAgBd,MACpC,SAAqBzU,IAAjBsD,EAAIwS,SAOb,MAAM,IAAIjD,MAAM,sDAFhBvP,EAAIiS,IAAgBd,CAGtB,EAEA,OAAOA,CACT,CAGA,IAAImB,GAAehf,OAAOgf,aAGtBJ,GAAqB,WACvB,IAEE,OADA5e,OAAOif,eAAe,CAAC,EAAG,IAAK,CAAC,IACzB,CACT,CAAE,MAAO1f,GACP,OAAO,CACT,CACF,CAPwB,GAWxB,SAASuf,GAAcK,GACrB,GAAIA,GAAQA,EAAKD,SAAW,EAC1B,OAAQC,EAAKD,UACX,KAAK,EACH,OAAOC,EAAKC,SACd,KAAK,EACH,OAAOD,EAAKE,iBAAmBF,EAAKE,gBAAgBD,SAG5D,CAGA,IACIV,GADAD,GAAkC,oBAAZa,QAEtBb,KACFC,GAAU,IAAIY,SAGhB,IAAIP,GAAa,EAEbJ,GAAe,oBACG,oBAAXjJ,SACTiJ,GAAejJ,OAAOiJ,KAGxB,IAAIZ,GAA+B,GAC/BQ,GAA6B,IAC7BD,GAAyB,EACzBD,GAAkB,CAAC,EAEvB,SAASkB,GAAkB1S,GACzBiP,GACEjP,IAASgP,IACT,oDAEJ,CAME,SAASpN,GAAIqD,GACX,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsB0N,KAC7CC,GAAM3N,KAAWmB,EAAUnB,GAASA,EACpC0N,KAAWE,eAAc,SAASxT,GAChC,IAAIsI,EAAOvC,EAAcH,GACzByN,GAAkB/K,EAAK3H,MACvB2H,EAAKzM,SAAQ,SAASkO,EAAGD,GAAK,OAAO9J,EAAIsD,IAAIwG,EAAGC,EAAE,GACpD,GACJ,CAgKF,SAASwJ,GAAME,GACb,SAAUA,IAAYA,EAASC,IACjC,CA9KAjO,EAAYlD,GAAKkO,IAcflO,GAAInO,UAAUiX,SAAW,WACvB,OAAO7W,KAAKoX,WAAW,QAAS,IAClC,EAIArJ,GAAInO,UAAUiL,IAAM,SAASyK,EAAG8G,GAC9B,OAAOpc,KAAKmf,MACVnf,KAAKmf,MAAMtU,IAAI,OAAGnC,EAAW4M,EAAG8G,GAChCA,CACJ,EAIArO,GAAInO,UAAUkP,IAAM,SAASwG,EAAGC,GAC9B,OAAO6J,GAAUpf,KAAMsV,EAAGC,EAC5B,EAEAxH,GAAInO,UAAUyf,MAAQ,SAASC,EAAS/J,GACtC,OAAOvV,KAAKuf,SAASD,EAAStM,GAAS,WAAa,OAAOuC,CAAC,GAC9D,EAEAxH,GAAInO,UAAU4f,OAAS,SAASlK,GAC9B,OAAO8J,GAAUpf,KAAMsV,EAAGtC,EAC5B,EAEAjF,GAAInO,UAAU6f,SAAW,SAASH,GAChC,OAAOtf,KAAKuf,SAASD,GAAS,WAAa,OAAOtM,CAAO,GAC3D,EAEAjF,GAAInO,UAAU8f,OAAS,SAASpK,EAAG8G,EAAauD,GAC9C,OAA4B,IAArBvgB,UAAUD,OACfmW,EAAEtV,MACFA,KAAKuf,SAAS,CAACjK,GAAI8G,EAAauD,EACpC,EAEA5R,GAAInO,UAAU2f,SAAW,SAASD,EAASlD,EAAauD,GACjDA,IACHA,EAAUvD,EACVA,OAAc1T,GAEhB,IAAIkX,EAAeC,GACjB7f,KACA8f,GAAcR,GACdlD,EACAuD,GAEF,OAAOC,IAAiB5M,OAAUtK,EAAYkX,CAChD,EAEA7R,GAAInO,UAAUmgB,MAAQ,WACpB,OAAkB,IAAd/f,KAAKmM,KACAnM,KAELA,KAAKggB,WACPhgB,KAAKmM,KAAO,EACZnM,KAAKmf,MAAQ,KACbnf,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEF8e,IACT,EAIA/Q,GAAInO,UAAUyD,MAAQ,WACpB,OAAO6c,GAAiBlgB,UAAM0I,EAAWtJ,UAC3C,EAEA2O,GAAInO,UAAUugB,UAAY,SAASC,GACjC,OAAOF,GAAiBlgB,KAAMogB,EADwBpP,EAAQlR,KAAKV,UAAW,GAEhF,EAEA2O,GAAInO,UAAUygB,QAAU,SAASf,GAAU,IAAIgB,EAAQtP,EAAQlR,KAAKV,UAAW,GAC7E,OAAOY,KAAKuf,SACVD,EACAR,MACA,SAASyB,GAAK,MAA0B,oBAAZA,EAAEld,MAC5Bkd,EAAEld,MAAMtD,MAAMwgB,EAAGD,GACjBA,EAAMA,EAAMnhB,OAAS,EAAE,GAE7B,EAEA4O,GAAInO,UAAU4gB,UAAY,WACxB,OAAON,GAAiBlgB,KAAMygB,GAAYrhB,UAC5C,EAEA2O,GAAInO,UAAU8gB,cAAgB,SAASN,GAAS,IAAIE,EAAQtP,EAAQlR,KAAKV,UAAW,GAClF,OAAO8gB,GAAiBlgB,KAAM2gB,GAAeP,GAASE,EACxD,EAEAvS,GAAInO,UAAUghB,YAAc,SAAStB,GAAU,IAAIgB,EAAQtP,EAAQlR,KAAKV,UAAW,GACjF,OAAOY,KAAKuf,SACVD,EACAR,MACA,SAASyB,GAAK,MAA8B,oBAAhBA,EAAEC,UAC5BD,EAAEC,UAAUzgB,MAAMwgB,EAAGD,GACrBA,EAAMA,EAAMnhB,OAAS,EAAE,GAE7B,EAEA4O,GAAInO,UAAUihB,KAAO,SAASC,GAE5B,OAAOC,GAAWC,GAAYhhB,KAAM8gB,GACtC,EAEA/S,GAAInO,UAAUqhB,OAAS,SAASC,EAAQJ,GAEtC,OAAOC,GAAWC,GAAYhhB,KAAM8gB,EAAYI,GAClD,EAIAnT,GAAInO,UAAUof,cAAgB,SAAShX,GACrC,IAAImZ,EAAUnhB,KAAKohB,YAEnB,OADApZ,EAAGmZ,GACIA,EAAQE,aAAeF,EAAQG,cAActhB,KAAKggB,WAAahgB,IACxE,EAEA+N,GAAInO,UAAUwhB,UAAY,WACxB,OAAOphB,KAAKggB,UAAYhgB,KAAOA,KAAKshB,cAAc,IAAIjO,EACxD,EAEAtF,GAAInO,UAAU2hB,YAAc,WAC1B,OAAOvhB,KAAKshB,eACd,EAEAvT,GAAInO,UAAUyhB,WAAa,WACzB,OAAOrhB,KAAKigB,SACd,EAEAlS,GAAInO,UAAU+X,WAAa,SAASzW,EAAMuW,GACxC,OAAO,IAAI+J,GAAYxhB,KAAMkB,EAAMuW,EACrC,EAEA1J,GAAInO,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KACxDqc,EAAa,EAKjB,OAJArc,KAAKmf,OAASnf,KAAKmf,MAAMsC,SAAQ,SAASpI,GAExC,OADAgD,IACOrU,EAAGqR,EAAM,GAAIA,EAAM,GAAIqD,EAChC,GAAGjF,GACI4E,CACT,EAEAtO,GAAInO,UAAU0hB,cAAgB,SAASI,GACrC,OAAIA,IAAY1hB,KAAKggB,UACZhgB,KAEJ0hB,EAKEC,GAAQ3hB,KAAKmM,KAAMnM,KAAKmf,MAAOuC,EAAS1hB,KAAKwa,SAJlDxa,KAAKggB,UAAY0B,EACjB1hB,KAAKigB,WAAY,EACVjgB,KAGX,EAOF+N,GAAIgR,MAAQA,GAEZ,IA2ZI6C,GA3ZA1C,GAAkB,wBAElB2C,GAAe9T,GAAInO,UAUrB,SAASkiB,GAAaJ,EAAShH,GAC7B1a,KAAK0hB,QAAUA,EACf1hB,KAAK0a,QAAUA,CACjB,CA+DA,SAASqH,GAAkBL,EAASM,EAAQC,GAC1CjiB,KAAK0hB,QAAUA,EACf1hB,KAAKgiB,OAASA,EACdhiB,KAAKiiB,MAAQA,CACf,CAiEA,SAASC,GAAiBR,EAASS,EAAOF,GACxCjiB,KAAK0hB,QAAUA,EACf1hB,KAAKmiB,MAAQA,EACbniB,KAAKiiB,MAAQA,CACf,CAsDA,SAASG,GAAkBV,EAASW,EAAS3H,GAC3C1a,KAAK0hB,QAAUA,EACf1hB,KAAKqiB,QAAUA,EACfriB,KAAK0a,QAAUA,CACjB,CAwEA,SAAS4H,GAAUZ,EAASW,EAAShJ,GACnCrZ,KAAK0hB,QAAUA,EACf1hB,KAAKqiB,QAAUA,EACfriB,KAAKqZ,MAAQA,CACf,CA+DA,SAASmI,GAAYhW,EAAKtK,EAAMuW,GAC9BzX,KAAKuiB,MAAQrhB,EACblB,KAAKwiB,SAAW/K,EAChBzX,KAAKyiB,OAASjX,EAAI2T,OAASuD,GAAiBlX,EAAI2T,MAClD,CAqCF,SAASwD,GAAiBzhB,EAAMmY,GAC9B,OAAOhE,EAAcnU,EAAMmY,EAAM,GAAIA,EAAM,GAC7C,CAEA,SAASqJ,GAAiBjE,EAAMmE,GAC9B,MAAO,CACLnE,KAAMA,EACN9T,MAAO,EACPkY,OAAQD,EAEZ,CAEA,SAASjB,GAAQxV,EAAM2W,EAAMpB,EAASvE,GACpC,IAAI3R,EAAMlM,OAAOmP,OAAOoT,IAMxB,OALArW,EAAIW,KAAOA,EACXX,EAAI2T,MAAQ2D,EACZtX,EAAIwU,UAAY0B,EAChBlW,EAAIgP,OAAS2C,EACb3R,EAAIyU,WAAY,EACTzU,CACT,CAGA,SAASsT,KACP,OAAO8C,KAAcA,GAAYD,GAAQ,GAC3C,CAEA,SAASvC,GAAU5T,EAAK8J,EAAGC,GACzB,IAAIwN,EACAC,EACJ,GAAKxX,EAAI2T,MAMF,CACL,IAAI8D,EAAgB9P,EAAQF,GACxBiQ,EAAW/P,EAAQD,GAEvB,GADA6P,EAAUI,GAAW3X,EAAI2T,MAAO3T,EAAIwU,UAAW,OAAGtX,EAAW4M,EAAGC,EAAG0N,EAAeC,IAC7EA,EAAS9R,MACZ,OAAO5F,EAETwX,EAAUxX,EAAIW,MAAQ8W,EAAc7R,MAAQmE,IAAMvC,GAAW,EAAI,EAAI,EACvE,KAdgB,CACd,GAAIuC,IAAMvC,EACR,OAAOxH,EAETwX,EAAU,EACVD,EAAU,IAAIjB,GAAatW,EAAIwU,UAAW,CAAC,CAAC1K,EAAGC,IACjD,CASA,OAAI/J,EAAIwU,WACNxU,EAAIW,KAAO6W,EACXxX,EAAI2T,MAAQ4D,EACZvX,EAAIgP,YAAS9R,EACb8C,EAAIyU,WAAY,EACTzU,GAEFuX,EAAUpB,GAAQqB,EAASD,GAAWjE,IAC/C,CAEA,SAASqE,GAAW1E,EAAMiD,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAC5E,OAAKzE,EAQEA,EAAKiB,OAAOgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAPjE9R,IAAU4B,EACLyL,GAETrL,EAAO8P,GACP9P,EAAO6P,GACA,IAAIX,GAAUZ,EAASW,EAAS,CAAC1iB,EAAKyR,IAGjD,CAEA,SAASiS,GAAW5E,GAClB,OAAOA,EAAK/P,cAAgB4T,IAAa7D,EAAK/P,cAAgB0T,EAChE,CAEA,SAASkB,GAAc7E,EAAMiD,EAAS0B,EAAOf,EAAShJ,GACpD,GAAIoF,EAAK4D,UAAYA,EACnB,OAAO,IAAID,GAAkBV,EAASW,EAAS,CAAC5D,EAAKpF,MAAOA,IAG9D,IAGIkK,EAHAC,GAAkB,IAAVJ,EAAc3E,EAAK4D,QAAU5D,EAAK4D,UAAYe,GAASrQ,EAC/D0Q,GAAkB,IAAVL,EAAcf,EAAUA,IAAYe,GAASrQ,EAOzD,OAAO,IAAIgP,GAAkBL,EAAU,GAAK8B,EAAS,GAAKC,EAJ9CD,IAASC,EACnB,CAACH,GAAc7E,EAAMiD,EAAS0B,EAAQvQ,EAAOwP,EAAShJ,KACpDkK,EAAU,IAAIjB,GAAUZ,EAASW,EAAShJ,GAASmK,EAAOC,EAAO,CAAChF,EAAM8E,GAAW,CAACA,EAAS9E,IAGnG,CAEA,SAASiF,GAAYhC,EAAShH,EAAS/a,EAAKyR,GACrCsQ,IACHA,EAAU,IAAIrO,GAGhB,IADA,IAAIoL,EAAO,IAAI6D,GAAUZ,EAASvE,GAAKxd,GAAM,CAACA,EAAKyR,IAC1CwC,EAAK,EAAGA,EAAK8G,EAAQvb,OAAQyU,IAAM,CAC1C,IAAIyF,EAAQqB,EAAQ9G,GACpB6K,EAAOA,EAAKiB,OAAOgC,EAAS,OAAGhZ,EAAW2Q,EAAM,GAAIA,EAAM,GAC5D,CACA,OAAOoF,CACT,CAEA,SAASkF,GAAUjC,EAASO,EAAOE,EAAOyB,GAIxC,IAHA,IAAI5B,EAAS,EACT6B,EAAW,EACXC,EAAc,IAAI7kB,MAAMkjB,GACnBvO,EAAK,EAAGmQ,EAAM,EAAGvQ,EAAMyO,EAAM9iB,OAAQyU,EAAKJ,EAAKI,IAAMmQ,IAAQ,EAAG,CACvE,IAAItF,EAAOwD,EAAMrO,QACJlL,IAAT+V,GAAsB7K,IAAOgQ,IAC/B5B,GAAU+B,EACVD,EAAYD,KAAcpF,EAE9B,CACA,OAAO,IAAIsD,GAAkBL,EAASM,EAAQ8B,EAChD,CAEA,SAASE,GAAYtC,EAASO,EAAOD,EAAQiC,EAAWxF,GAGtD,IAFA,IAAI0D,EAAQ,EACR+B,EAAgB,IAAIjlB,MAAM6T,GACrBc,EAAK,EAAc,IAAXoO,EAAcpO,IAAMoO,KAAY,EAC/CkC,EAActQ,GAAe,EAAToO,EAAaC,EAAME,UAAWzZ,EAGpD,OADAwb,EAAcD,GAAaxF,EACpB,IAAIyD,GAAiBR,EAASS,EAAQ,EAAG+B,EAClD,CAEA,SAAShE,GAAiB1U,EAAK4U,EAAQ+D,GAErC,IADA,IAAI7D,EAAQ,GACH1M,EAAK,EAAGA,EAAKuQ,EAAUhlB,OAAQyU,IAAM,CAC5C,IAAIxC,EAAQ+S,EAAUvQ,GAClBE,EAAOvC,EAAcH,GACpBC,EAAWD,KACd0C,EAAOA,EAAKtI,KAAI,SAAS+J,GAAK,OAAOgE,GAAOhE,EAAE,KAEhD+K,EAAMvc,KAAK+P,EACb,CACA,OAAOsQ,GAAwB5Y,EAAK4U,EAAQE,EAC9C,CAEA,SAASG,GAAW4D,EAAUjT,EAAOzR,GACnC,OAAO0kB,GAAYA,EAAS7D,WAAanP,EAAWD,GAClDiT,EAAS7D,UAAUpP,GACnB4I,GAAGqK,EAAUjT,GAASiT,EAAWjT,CACrC,CAEA,SAASuP,GAAeP,GACtB,OAAO,SAASiE,EAAUjT,EAAOzR,GAC/B,GAAI0kB,GAAYA,EAAS3D,eAAiBrP,EAAWD,GACnD,OAAOiT,EAAS3D,cAAcN,EAAQhP,GAExC,IAAIkT,EAAYlE,EAAOiE,EAAUjT,EAAOzR,GACxC,OAAOqa,GAAGqK,EAAUC,GAAaD,EAAWC,CAC9C,CACF,CAEA,SAASF,GAAwBG,EAAYnE,EAAQE,GAEnD,OAAqB,KADrBA,EAAQA,EAAMpe,QAAO,SAASsiB,GAAK,OAAkB,IAAXA,EAAErY,IAAU,KAC5ChN,OACDolB,EAEe,IAApBA,EAAWpY,MAAeoY,EAAWvE,WAA8B,IAAjBM,EAAMnhB,OAGrDolB,EAAWvF,eAAc,SAASuF,GAUvC,IATA,IAAIE,EAAerE,EACjB,SAAShP,EAAOzR,GACd4kB,EAAW7E,OAAO/f,EAAKqT,GAAS,SAASqR,GACtC,OAAOA,IAAarR,EAAU5B,EAAQgP,EAAOiE,EAAUjT,EAAOzR,EAAI,GAEvE,EACA,SAASyR,EAAOzR,GACd4kB,EAAWzV,IAAInP,EAAKyR,EACtB,EACOwC,EAAK,EAAGA,EAAK0M,EAAMnhB,OAAQyU,IAClC0M,EAAM1M,GAAIvM,QAAQod,EAEtB,IAfSF,EAAW7V,YAAY4R,EAAM,GAgBxC,CAEA,SAAST,GAAgBwE,EAAUK,EAAatI,EAAauD,GAC3D,IAAIgF,EAAWN,IAAarR,EACxB0I,EAAOgJ,EAAYxV,OACvB,GAAIwM,EAAKjG,KAAM,CACb,IAAImP,EAAgBD,EAAWvI,EAAciI,EACzCQ,EAAWlF,EAAQiF,GACvB,OAAOC,IAAaD,EAAgBP,EAAWQ,CACjD,CACAzJ,GACEuJ,GAAaN,GAAYA,EAASvV,IAClC,mBAEF,IAAInP,EAAM+b,EAAKtK,MACX0T,EAAeH,EAAW3R,EAAUqR,EAASxZ,IAAIlL,EAAKqT,GACtD+R,EAAclF,GAChBiF,EACAJ,EACAtI,EACAuD,GAEF,OAAOoF,IAAgBD,EAAeT,EACpCU,IAAgB/R,EAAUqR,EAAS7E,OAAO7f,IACzCglB,EAAW7F,KAAauF,GAAUvV,IAAInP,EAAKolB,EAChD,CAEA,SAASC,GAASR,GAMhB,OAHAA,GADAA,GAAS,WADTA,GAAUA,GAAK,EAAK,cACKA,GAAK,EAAK,aACzBA,GAAK,GAAM,UACrBA,GAASA,GAAK,EAEH,KADXA,GAASA,GAAK,GAEhB,CAEA,SAASnF,GAAMlH,EAAO8M,EAAK3I,EAAK4I,GAC9B,IAAIC,EAAWD,EAAU/M,EAAQ7E,EAAQ6E,GAEzC,OADAgN,EAASF,GAAO3I,EACT6I,CACT,CAEA,SAASC,GAASjN,EAAO8M,EAAK3I,EAAK4I,GACjC,IAAIG,EAASlN,EAAMhZ,OAAS,EAC5B,GAAI+lB,GAAWD,EAAM,IAAMI,EAEzB,OADAlN,EAAM8M,GAAO3I,EACNnE,EAIT,IAFA,IAAIgN,EAAW,IAAIlmB,MAAMomB,GACrBC,EAAQ,EACH1R,EAAK,EAAGA,EAAKyR,EAAQzR,IACxBA,IAAOqR,GACTE,EAASvR,GAAM0I,EACfgJ,GAAS,GAETH,EAASvR,GAAMuE,EAAMvE,EAAK0R,GAG9B,OAAOH,CACT,CAEA,SAASI,GAAUpN,EAAO8M,EAAKC,GAC7B,IAAIG,EAASlN,EAAMhZ,OAAS,EAC5B,GAAI+lB,GAAWD,IAAQI,EAErB,OADAlN,EAAMqN,MACCrN,EAIT,IAFA,IAAIgN,EAAW,IAAIlmB,MAAMomB,GACrBC,EAAQ,EACH1R,EAAK,EAAGA,EAAKyR,EAAQzR,IACxBA,IAAOqR,IACTK,EAAQ,GAEVH,EAASvR,GAAMuE,EAAMvE,EAAK0R,GAE5B,OAAOH,CACT,CA5nBAtD,GAAa3C,KAAmB,EAChC2C,GAAajP,GAAUiP,GAAarC,OACpCqC,GAAa4D,SAAW5D,GAAapC,SAYnCqC,GAAaliB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,GAEzD,IADA,IAAI1B,EAAU1a,KAAK0a,QACV9G,EAAK,EAAGJ,EAAMkH,EAAQvb,OAAQyU,EAAKJ,EAAKI,IAC/C,GAAIoG,GAAGra,EAAK+a,EAAQ9G,GAAI,IACtB,OAAO8G,EAAQ9G,GAAI,GAGvB,OAAOwI,CACT,EAEA0F,GAAaliB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAK3F,IAJA,IAAIwC,EAAUtU,IAAU4B,EAEpB0H,EAAU1a,KAAK0a,QACfuK,EAAM,EACDzR,EAAMkH,EAAQvb,OAAQ8lB,EAAMzR,IAC/BwG,GAAGra,EAAK+a,EAAQuK,GAAK,IADeA,KAK1C,IAAIU,EAASV,EAAMzR,EAEnB,GAAImS,EAASjL,EAAQuK,GAAK,KAAO7T,EAAQsU,EACvC,OAAO1lB,KAMT,GAHAoT,EAAO8P,IACNwC,IAAYC,IAAWvS,EAAO6P,IAE3ByC,GAA8B,IAAnBhL,EAAQvb,OAAvB,CAIA,IAAKwmB,IAAWD,GAAWhL,EAAQvb,QAAUymB,GAC3C,OAAOlC,GAAYhC,EAAShH,EAAS/a,EAAKyR,GAG5C,IAAIyU,EAAanE,GAAWA,IAAY1hB,KAAK0hB,QACzCoE,EAAaD,EAAanL,EAAUpH,EAAQoH,GAYhD,OAVIiL,EACED,EACFT,IAAQzR,EAAM,EAAIsS,EAAWN,MAASM,EAAWb,GAAOa,EAAWN,MAEnEM,EAAWb,GAAO,CAACtlB,EAAKyR,GAG1B0U,EAAW/hB,KAAK,CAACpE,EAAKyR,IAGpByU,GACF7lB,KAAK0a,QAAUoL,EACR9lB,MAGF,IAAI8hB,GAAaJ,EAASoE,EAxBjC,CAyBF,EAWA/D,GAAkBniB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,QAC9C1T,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAEjB,IAAIokB,EAAO,KAAiB,IAAVX,EAAcf,EAAUA,IAAYe,GAASrQ,GAC3DiP,EAAShiB,KAAKgiB,OAClB,OAA0B,KAAlBA,EAAS+B,GAAa3H,EAC5Bpc,KAAKiiB,MAAM+C,GAAShD,EAAU+B,EAAM,IAAKlZ,IAAIuY,EAAQvQ,EAAOwP,EAAS1iB,EAAKyc,EAC9E,EAEA2F,GAAkBniB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,QAChFxa,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAEjB,IAAIomB,GAAyB,IAAV3C,EAAcf,EAAUA,IAAYe,GAASrQ,EAC5DgR,EAAM,GAAKgC,EACX/D,EAAShiB,KAAKgiB,OACd2D,EAA4B,KAAlB3D,EAAS+B,GAEvB,IAAK4B,GAAUvU,IAAU4B,EACvB,OAAOhT,KAGT,IAAIilB,EAAMD,GAAShD,EAAU+B,EAAM,GAC/B9B,EAAQjiB,KAAKiiB,MACbxD,EAAOkH,EAAS1D,EAAMgD,QAAOvc,EAC7B6a,EAAUJ,GAAW1E,EAAMiD,EAAS0B,EAAQvQ,EAAOwP,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAE3F,GAAIK,IAAY9E,EACd,OAAOze,KAGT,IAAK2lB,GAAUpC,GAAWtB,EAAM9iB,QAAU6mB,GACxC,OAAOhC,GAAYtC,EAASO,EAAOD,EAAQ+D,EAAaxC,GAG1D,GAAIoC,IAAWpC,GAA4B,IAAjBtB,EAAM9iB,QAAgBkkB,GAAWpB,EAAY,EAANgD,IAC/D,OAAOhD,EAAY,EAANgD,GAGf,GAAIU,GAAUpC,GAA4B,IAAjBtB,EAAM9iB,QAAgBkkB,GAAWE,GACxD,OAAOA,EAGT,IAAIsC,EAAanE,GAAWA,IAAY1hB,KAAK0hB,QACzCuE,EAAYN,EAASpC,EAAUvB,EAASA,EAAS+B,EAAM/B,EAAS+B,EAChEmC,EAAWP,EAASpC,EACtBlE,GAAM4C,EAAOgD,EAAK1B,EAASsC,GAC3BN,GAAUtD,EAAOgD,EAAKY,GACtBT,GAASnD,EAAOgD,EAAK1B,EAASsC,GAEhC,OAAIA,GACF7lB,KAAKgiB,OAASiE,EACdjmB,KAAKiiB,MAAQiE,EACNlmB,MAGF,IAAI+hB,GAAkBL,EAASuE,EAAWC,EACnD,EAWAhE,GAAiBtiB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,QAC7C1T,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAEjB,IAAIslB,GAAiB,IAAV7B,EAAcf,EAAUA,IAAYe,GAASrQ,EACpD0L,EAAOze,KAAKiiB,MAAMgD,GACtB,OAAOxG,EAAOA,EAAK5T,IAAIuY,EAAQvQ,EAAOwP,EAAS1iB,EAAKyc,GAAeA,CACrE,EAEA8F,GAAiBtiB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,QAC/Exa,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAEjB,IAAIslB,GAAiB,IAAV7B,EAAcf,EAAUA,IAAYe,GAASrQ,EACpD2S,EAAUtU,IAAU4B,EACpBiP,EAAQjiB,KAAKiiB,MACbxD,EAAOwD,EAAMgD,GAEjB,GAAIS,IAAYjH,EACd,OAAOze,KAGT,IAAIujB,EAAUJ,GAAW1E,EAAMiD,EAAS0B,EAAQvQ,EAAOwP,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAC3F,GAAIK,IAAY9E,EACd,OAAOze,KAGT,IAAImmB,EAAWnmB,KAAKmiB,MACpB,GAAK1D,GAEE,IAAK8E,KACV4C,EACeC,GACb,OAAOzC,GAAUjC,EAASO,EAAOkE,EAAUlB,QAJ7CkB,IAQF,IAAIN,EAAanE,GAAWA,IAAY1hB,KAAK0hB,QACzCwE,EAAW7G,GAAM4C,EAAOgD,EAAK1B,EAASsC,GAE1C,OAAIA,GACF7lB,KAAKmiB,MAAQgE,EACbnmB,KAAKiiB,MAAQiE,EACNlmB,MAGF,IAAIkiB,GAAiBR,EAASyE,EAAUD,EACjD,EAWA9D,GAAkBxiB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,GAE9D,IADA,IAAI1B,EAAU1a,KAAK0a,QACV9G,EAAK,EAAGJ,EAAMkH,EAAQvb,OAAQyU,EAAKJ,EAAKI,IAC/C,GAAIoG,GAAGra,EAAK+a,EAAQ9G,GAAI,IACtB,OAAO8G,EAAQ9G,GAAI,GAGvB,OAAOwI,CACT,EAEAgG,GAAkBxiB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,QAChFxa,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAGjB,IAAI+lB,EAAUtU,IAAU4B,EAExB,GAAIqP,IAAYriB,KAAKqiB,QACnB,OAAIqD,EACK1lB,MAEToT,EAAO8P,GACP9P,EAAO6P,GACAK,GAActjB,KAAM0hB,EAAS0B,EAAOf,EAAS,CAAC1iB,EAAKyR,KAK5D,IAFA,IAAIsJ,EAAU1a,KAAK0a,QACfuK,EAAM,EACDzR,EAAMkH,EAAQvb,OAAQ8lB,EAAMzR,IAC/BwG,GAAGra,EAAK+a,EAAQuK,GAAK,IADeA,KAK1C,IAAIU,EAASV,EAAMzR,EAEnB,GAAImS,EAASjL,EAAQuK,GAAK,KAAO7T,EAAQsU,EACvC,OAAO1lB,KAMT,GAHAoT,EAAO8P,IACNwC,IAAYC,IAAWvS,EAAO6P,GAE3ByC,GAAmB,IAARlS,EACb,OAAO,IAAI8O,GAAUZ,EAAS1hB,KAAKqiB,QAAS3H,EAAc,EAANuK,IAGtD,IAAIY,EAAanE,GAAWA,IAAY1hB,KAAK0hB,QACzCoE,EAAaD,EAAanL,EAAUpH,EAAQoH,GAYhD,OAVIiL,EACED,EACFT,IAAQzR,EAAM,EAAIsS,EAAWN,MAASM,EAAWb,GAAOa,EAAWN,MAEnEM,EAAWb,GAAO,CAACtlB,EAAKyR,GAG1B0U,EAAW/hB,KAAK,CAACpE,EAAKyR,IAGpByU,GACF7lB,KAAK0a,QAAUoL,EACR9lB,MAGF,IAAIoiB,GAAkBV,EAAS1hB,KAAKqiB,QAASyD,EACtD,EAWAxD,GAAU1iB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,GACtD,OAAOpC,GAAGra,EAAKK,KAAKqZ,MAAM,IAAMrZ,KAAKqZ,MAAM,GAAK+C,CAClD,EAEAkG,GAAU1iB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GACxF,IAAIwC,EAAUtU,IAAU4B,EACpBqT,EAAWrM,GAAGra,EAAKK,KAAKqZ,MAAM,IAClC,OAAIgN,EAAWjV,IAAUpR,KAAKqZ,MAAM,GAAKqM,GAChC1lB,MAGToT,EAAO8P,GAEHwC,OACFtS,EAAO6P,GAILoD,EACE3E,GAAWA,IAAY1hB,KAAK0hB,SAC9B1hB,KAAKqZ,MAAM,GAAKjI,EACTpR,MAEF,IAAIsiB,GAAUZ,EAAS1hB,KAAKqiB,QAAS,CAAC1iB,EAAKyR,KAGpDgC,EAAO6P,GACAK,GAActjB,KAAM0hB,EAAS0B,EAAOjG,GAAKxd,GAAM,CAACA,EAAKyR,KAC9D,EAMF0Q,GAAaliB,UAAU6hB,QACvBW,GAAkBxiB,UAAU6hB,QAAU,SAAUzZ,EAAIyP,GAElD,IADA,IAAIiD,EAAU1a,KAAK0a,QACV9G,EAAK,EAAGwF,EAAWsB,EAAQvb,OAAS,EAAGyU,GAAMwF,EAAUxF,IAC9D,IAAkD,IAA9C5L,EAAG0S,EAAQjD,EAAU2B,EAAWxF,EAAKA,IACvC,OAAO,CAGb,EAEAmO,GAAkBniB,UAAU6hB,QAC5BS,GAAiBtiB,UAAU6hB,QAAU,SAAUzZ,EAAIyP,GAEjD,IADA,IAAIwK,EAAQjiB,KAAKiiB,MACRrO,EAAK,EAAGwF,EAAW6I,EAAM9iB,OAAS,EAAGyU,GAAMwF,EAAUxF,IAAM,CAClE,IAAI6K,EAAOwD,EAAMxK,EAAU2B,EAAWxF,EAAKA,GAC3C,GAAI6K,IAAsC,IAA9BA,EAAKgD,QAAQzZ,EAAIyP,GAC3B,OAAO,CAEX,CACF,EAEA6K,GAAU1iB,UAAU6hB,QAAU,SAAUzZ,EAAIyP,GAC1C,OAAOzP,EAAGhI,KAAKqZ,MACjB,EAEApI,EAAYuQ,GAAapM,GAQvBoM,GAAY5hB,UAAUsP,KAAO,WAG3B,IAFA,IAAIhO,EAAOlB,KAAKuiB,MACZ+D,EAAQtmB,KAAKyiB,OACV6D,GAAO,CACZ,IAEIlN,EAFAqF,EAAO6H,EAAM7H,KACb9T,EAAQ2b,EAAM3b,QAElB,GAAI8T,EAAKpF,OACP,GAAc,IAAV1O,EACF,OAAOgY,GAAiBzhB,EAAMud,EAAKpF,YAEhC,GAAIoF,EAAK/D,SAEd,GAAI/P,IADJyO,EAAWqF,EAAK/D,QAAQvb,OAAS,GAE/B,OAAOwjB,GAAiBzhB,EAAMud,EAAK/D,QAAQ1a,KAAKwiB,SAAWpJ,EAAWzO,EAAQA,SAIhF,GAAIA,IADJyO,EAAWqF,EAAKwD,MAAM9iB,OAAS,GACR,CACrB,IAAIonB,EAAU9H,EAAKwD,MAAMjiB,KAAKwiB,SAAWpJ,EAAWzO,EAAQA,GAC5D,GAAI4b,EAAS,CACX,GAAIA,EAAQlN,MACV,OAAOsJ,GAAiBzhB,EAAMqlB,EAAQlN,OAExCiN,EAAQtmB,KAAKyiB,OAASC,GAAiB6D,EAASD,EAClD,CACA,QACF,CAEFA,EAAQtmB,KAAKyiB,OAASziB,KAAKyiB,OAAOI,MACpC,CACA,OAAOnN,GACT,EA+PF,IAAIkQ,GAAqB9S,EAAO,EAC5BkT,GAA0BlT,EAAO,EACjCsT,GAA0BtT,EAAO,EAMnC,SAAS3H,GAAKiG,GACZ,IAAIoV,EAAQC,KACZ,GAAc,OAAVrV,QAA4B1I,IAAV0I,EACpB,OAAOoV,EAET,GAAIE,GAAOtV,GACT,OAAOA,EAET,IAAI0C,EAAOpC,EAAgBN,GACvBjF,EAAO2H,EAAK3H,KAChB,OAAa,IAATA,EACKqa,GAET3H,GAAkB1S,GACdA,EAAO,GAAKA,EAAO2G,EACd6T,GAAS,EAAGxa,EAAM0G,EAAO,KAAM,IAAI+T,GAAM9S,EAAK0D,YAEhDgP,EAAMxH,eAAc,SAAS6H,GAClCA,EAAKC,QAAQ3a,GACb2H,EAAKzM,SAAQ,SAASkO,EAAG9V,GAAK,OAAOonB,EAAK/X,IAAIrP,EAAG8V,EAAE,GACrD,IACF,CA0JF,SAASmR,GAAOK,GACd,SAAUA,IAAaA,EAAUC,IACnC,CArLA/V,EAAY9F,GAAM+Q,IA2BhB/Q,GAAKgM,GAAK,WACR,OAAOnX,KAAKZ,UACd,EAEA+L,GAAKvL,UAAUiX,SAAW,WACxB,OAAO7W,KAAKoX,WAAW,SAAU,IACnC,EAIAjM,GAAKvL,UAAUiL,IAAM,SAASF,EAAOyR,GAEnC,IADAzR,EAAQsJ,EAAUjU,KAAM2K,KACX,GAAKA,EAAQ3K,KAAKmM,KAAM,CAEnC,IAAIsS,EAAOwI,GAAYjnB,KADvB2K,GAAS3K,KAAKknB,SAEd,OAAOzI,GAAQA,EAAKtG,MAAMxN,EAAQoI,EACpC,CACA,OAAOqJ,CACT,EAIAjR,GAAKvL,UAAUkP,IAAM,SAASnE,EAAOyG,GACnC,OAAO+V,GAAWnnB,KAAM2K,EAAOyG,EACjC,EAEAjG,GAAKvL,UAAU4f,OAAS,SAAS7U,GAC/B,OAAQ3K,KAAKgC,IAAI2I,GACL,IAAVA,EAAc3K,KAAKojB,QACnBzY,IAAU3K,KAAKmM,KAAO,EAAInM,KAAKwlB,MAC/BxlB,KAAKonB,OAAOzc,EAAO,GAHK3K,IAI5B,EAEAmL,GAAKvL,UAAUynB,OAAS,SAAS1c,EAAOyG,GACtC,OAAOpR,KAAKonB,OAAOzc,EAAO,EAAGyG,EAC/B,EAEAjG,GAAKvL,UAAUmgB,MAAQ,WACrB,OAAkB,IAAd/f,KAAKmM,KACAnM,KAELA,KAAKggB,WACPhgB,KAAKmM,KAAOnM,KAAKknB,QAAUlnB,KAAKsnB,UAAY,EAC5CtnB,KAAKunB,OAAS1U,EACd7S,KAAKmf,MAAQnf,KAAKwnB,MAAQ,KAC1BxnB,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEFymB,IACT,EAEAtb,GAAKvL,UAAUmE,KAAO,WACpB,IAAI0jB,EAASroB,UACTsoB,EAAU1nB,KAAKmM,KACnB,OAAOnM,KAAKgf,eAAc,SAAS6H,GACjCc,GAAcd,EAAM,EAAGa,EAAUD,EAAOtoB,QACxC,IAAK,IAAIyU,EAAK,EAAGA,EAAK6T,EAAOtoB,OAAQyU,IACnCiT,EAAK/X,IAAI4Y,EAAU9T,EAAI6T,EAAO7T,GAElC,GACF,EAEAzI,GAAKvL,UAAU4lB,IAAM,WACnB,OAAOmC,GAAc3nB,KAAM,GAAI,EACjC,EAEAmL,GAAKvL,UAAUgoB,QAAU,WACvB,IAAIH,EAASroB,UACb,OAAOY,KAAKgf,eAAc,SAAS6H,GACjCc,GAAcd,GAAOY,EAAOtoB,QAC5B,IAAK,IAAIyU,EAAK,EAAGA,EAAK6T,EAAOtoB,OAAQyU,IACnCiT,EAAK/X,IAAI8E,EAAI6T,EAAO7T,GAExB,GACF,EAEAzI,GAAKvL,UAAUwjB,MAAQ,WACrB,OAAOuE,GAAc3nB,KAAM,EAC7B,EAIAmL,GAAKvL,UAAUyD,MAAQ,WACrB,OAAOwkB,GAAkB7nB,UAAM0I,EAAWtJ,UAC5C,EAEA+L,GAAKvL,UAAUugB,UAAY,SAASC,GAClC,OAAOyH,GAAkB7nB,KAAMogB,EADwBpP,EAAQlR,KAAKV,UAAW,GAEjF,EAEA+L,GAAKvL,UAAU4gB,UAAY,WACzB,OAAOqH,GAAkB7nB,KAAMygB,GAAYrhB,UAC7C,EAEA+L,GAAKvL,UAAU8gB,cAAgB,SAASN,GAAS,IAAIE,EAAQtP,EAAQlR,KAAKV,UAAW,GACnF,OAAOyoB,GAAkB7nB,KAAM2gB,GAAeP,GAASE,EACzD,EAEAnV,GAAKvL,UAAUknB,QAAU,SAAS3a,GAChC,OAAOwb,GAAc3nB,KAAM,EAAGmM,EAChC,EAIAhB,GAAKvL,UAAUkL,MAAQ,SAASuJ,EAAOC,GACrC,IAAInI,EAAOnM,KAAKmM,KAChB,OAAIiI,EAAWC,EAAOC,EAAKnI,GAClBnM,KAEF2nB,GACL3nB,KACAuU,EAAaF,EAAOlI,GACpBsI,EAAWH,EAAKnI,GAEpB,EAEAhB,GAAKvL,UAAU+X,WAAa,SAASzW,EAAMuW,GACzC,IAAI9M,EAAQ,EACR8c,EAASK,GAAY9nB,KAAMyX,GAC/B,OAAO,IAAIrC,GAAS,WAClB,IAAIhE,EAAQqW,IACZ,OAAOrW,IAAU2W,GACfrS,IACAL,EAAcnU,EAAMyJ,IAASyG,EACjC,GACF,EAEAjG,GAAKvL,UAAUmU,UAAY,SAAS/L,EAAIyP,GAItC,IAHA,IAEIrG,EAFAzG,EAAQ,EACR8c,EAASK,GAAY9nB,KAAMyX,IAEvBrG,EAAQqW,OAAcM,KACK,IAA7B/f,EAAGoJ,EAAOzG,IAAS3K,QAIzB,OAAO2K,CACT,EAEAQ,GAAKvL,UAAU0hB,cAAgB,SAASI,GACtC,OAAIA,IAAY1hB,KAAKggB,UACZhgB,KAEJ0hB,EAIEiF,GAAS3mB,KAAKknB,QAASlnB,KAAKsnB,UAAWtnB,KAAKunB,OAAQvnB,KAAKmf,MAAOnf,KAAKwnB,MAAO9F,EAAS1hB,KAAKwa,SAH/Fxa,KAAKggB,UAAY0B,EACV1hB,KAGX,EAOFmL,GAAKub,OAASA,GAEd,IAAIM,GAAmB,yBAEnBgB,GAAgB7c,GAAKvL,UAiBvB,SAASgnB,GAAMzO,EAAOuJ,GACpB1hB,KAAKmY,MAAQA,EACbnY,KAAK0hB,QAAUA,CACjB,CAnBFsG,GAAchB,KAAoB,EAClCgB,GAAcpV,GAAUoV,GAAcxI,OACtCwI,GAAc3I,MAAQwC,GAAaxC,MACnC2I,GAAcvI,SACduI,GAAcvC,SAAW5D,GAAa4D,SACtCuC,GAActI,OAASmC,GAAanC,OACpCsI,GAAczI,SAAWsC,GAAatC,SACtCyI,GAAc3H,QAAUwB,GAAaxB,QACrC2H,GAAcpH,YAAciB,GAAajB,YACzCoH,GAAchJ,cAAgB6C,GAAa7C,cAC3CgJ,GAAc5G,UAAYS,GAAaT,UACvC4G,GAAczG,YAAcM,GAAaN,YACzCyG,GAAc3G,WAAaQ,GAAaR,WAWtCuF,GAAMhnB,UAAUqoB,aAAe,SAASvG,EAASwG,EAAOvd,GACtD,GAAIA,IAAUud,EAAQ,GAAKA,EAAmC,IAAtBloB,KAAKmY,MAAMhZ,OACjD,OAAOa,KAET,IAAImoB,EAAexd,IAAUud,EAASnV,EACtC,GAAIoV,GAAenoB,KAAKmY,MAAMhZ,OAC5B,OAAO,IAAIynB,GAAM,GAAIlF,GAEvB,IACI0G,EADAC,EAAgC,IAAhBF,EAEpB,GAAID,EAAQ,EAAG,CACb,IAAII,EAAWtoB,KAAKmY,MAAMgQ,GAE1B,IADAC,EAAWE,GAAYA,EAASL,aAAavG,EAASwG,EAAQrV,EAAOlI,MACpD2d,GAAYD,EAC3B,OAAOroB,IAEX,CACA,GAAIqoB,IAAkBD,EACpB,OAAOpoB,KAET,IAAIuoB,EAAWC,GAAcxoB,KAAM0hB,GACnC,IAAK2G,EACH,IAAK,IAAIzU,EAAK,EAAGA,EAAKuU,EAAavU,IACjC2U,EAASpQ,MAAMvE,QAAMlL,EAMzB,OAHI0f,IACFG,EAASpQ,MAAMgQ,GAAeC,GAEzBG,CACT,EAEA3B,GAAMhnB,UAAU6oB,YAAc,SAAS/G,EAASwG,EAAOvd,GACrD,GAAIA,KAAWud,EAAQ,GAAKA,EAAQ,IAA4B,IAAtBloB,KAAKmY,MAAMhZ,OACnD,OAAOa,KAET,IAKIooB,EALAM,EAAc/d,EAAQ,IAAOud,EAASnV,EAC1C,GAAI2V,GAAa1oB,KAAKmY,MAAMhZ,OAC1B,OAAOa,KAIT,GAAIkoB,EAAQ,EAAG,CACb,IAAII,EAAWtoB,KAAKmY,MAAMuQ,GAE1B,IADAN,EAAWE,GAAYA,EAASG,YAAY/G,EAASwG,EAAQrV,EAAOlI,MACnD2d,GAAYI,IAAc1oB,KAAKmY,MAAMhZ,OAAS,EAC7D,OAAOa,IAEX,CAEA,IAAIuoB,EAAWC,GAAcxoB,KAAM0hB,GAKnC,OAJA6G,EAASpQ,MAAMiP,OAAOsB,EAAY,GAC9BN,IACFG,EAASpQ,MAAMuQ,GAAaN,GAEvBG,CACT,EAIF,IA2EII,GAiWAC,GA5aAb,GAAO,CAAC,EAEZ,SAASD,GAAYjB,EAAMpP,GACzB,IAAIoR,EAAOhC,EAAKK,QACZ4B,EAAQjC,EAAKS,UACbyB,EAAUC,GAAcF,GACxBG,EAAOpC,EAAKW,MAEhB,OAAO0B,EAAkBrC,EAAK1H,MAAO0H,EAAKU,OAAQ,GAElD,SAAS2B,EAAkBzK,EAAMyJ,EAAO9d,GACtC,OAAiB,IAAV8d,EACLiB,EAAY1K,EAAMrU,GAClBgf,EAAY3K,EAAMyJ,EAAO9d,EAC7B,CAEA,SAAS+e,EAAY1K,EAAMrU,GACzB,IAAI+N,EAAQ/N,IAAW2e,EAAUE,GAAQA,EAAK9Q,MAAQsG,GAAQA,EAAKtG,MAC/DkR,EAAOjf,EAASye,EAAO,EAAIA,EAAOze,EAClCkf,EAAKR,EAAQ1e,EAIjB,OAHIkf,EAAKxW,IACPwW,EAAKxW,GAEA,WACL,GAAIuW,IAASC,EACX,OAAOvB,GAET,IAAI9C,EAAMxN,IAAY6R,EAAKD,IAC3B,OAAOlR,GAASA,EAAM8M,EACxB,CACF,CAEA,SAASmE,EAAY3K,EAAMyJ,EAAO9d,GAChC,IAAIqd,EACAtP,EAAQsG,GAAQA,EAAKtG,MACrBkR,EAAOjf,EAASye,EAAO,EAAKA,EAAOze,GAAW8d,EAC9CoB,EAAmC,GAA5BR,EAAQ1e,GAAW8d,GAI9B,OAHIoB,EAAKxW,IACPwW,EAAKxW,GAEA,WACL,OAAG,CACD,GAAI2U,EAAQ,CACV,IAAIrW,EAAQqW,IACZ,GAAIrW,IAAU2W,GACZ,OAAO3W,EAETqW,EAAS,IACX,CACA,GAAI4B,IAASC,EACX,OAAOvB,GAET,IAAI9C,EAAMxN,IAAY6R,EAAKD,IAC3B5B,EAASyB,EACP/Q,GAASA,EAAM8M,GAAMiD,EAAQrV,EAAOzI,GAAU6a,GAAOiD,GAEzD,CACF,CACF,CACF,CAEA,SAASvB,GAAS4C,EAAQC,EAAUtB,EAAOpF,EAAMmG,EAAMvH,EAASvE,GAC9D,IAAI0J,EAAOvnB,OAAOmP,OAAOuZ,IAUzB,OATAnB,EAAK1a,KAAOqd,EAAWD,EACvB1C,EAAKK,QAAUqC,EACf1C,EAAKS,UAAYkC,EACjB3C,EAAKU,OAASW,EACdrB,EAAK1H,MAAQ2D,EACb+D,EAAKW,MAAQyB,EACbpC,EAAK7G,UAAY0B,EACjBmF,EAAKrM,OAAS2C,EACd0J,EAAK5G,WAAY,EACV4G,CACT,CAGA,SAASJ,KACP,OAAOkC,KAAeA,GAAahC,GAAS,EAAG,EAAG9T,GACpD,CAEA,SAASsU,GAAWN,EAAMlc,EAAOyG,GAG/B,IAFAzG,EAAQsJ,EAAU4S,EAAMlc,MAEVA,EACZ,OAAOkc,EAGT,GAAIlc,GAASkc,EAAK1a,MAAQxB,EAAQ,EAChC,OAAOkc,EAAK7H,eAAc,SAAS6H,GACjClc,EAAQ,EACNgd,GAAcd,EAAMlc,GAAOmE,IAAI,EAAGsC,GAClCuW,GAAcd,EAAM,EAAGlc,EAAQ,GAAGmE,IAAInE,EAAOyG,EACjD,IAGFzG,GAASkc,EAAKK,QAEd,IAAIuC,EAAU5C,EAAKW,MACfzE,EAAU8D,EAAK1H,MACf+D,EAAW/P,EAAQD,GAOvB,OANIvI,GAASqe,GAAcnC,EAAKS,WAC9BmC,EAAUC,GAAYD,EAAS5C,EAAK7G,UAAW,EAAGrV,EAAOyG,EAAO8R,GAEhEH,EAAU2G,GAAY3G,EAAS8D,EAAK7G,UAAW6G,EAAKU,OAAQ5c,EAAOyG,EAAO8R,GAGvEA,EAAS9R,MAIVyV,EAAK7G,WACP6G,EAAK1H,MAAQ4D,EACb8D,EAAKW,MAAQiC,EACb5C,EAAKrM,YAAS9R,EACdme,EAAK5G,WAAY,EACV4G,GAEFF,GAASE,EAAKK,QAASL,EAAKS,UAAWT,EAAKU,OAAQxE,EAAS0G,GAV3D5C,CAWX,CAEA,SAAS6C,GAAYjL,EAAMiD,EAASwG,EAAOvd,EAAOyG,EAAO8R,GACvD,IAMIK,EANA0B,EAAOta,IAAUud,EAASnV,EAC1B4W,EAAUlL,GAAQwG,EAAMxG,EAAKtG,MAAMhZ,OACvC,IAAKwqB,QAAqBjhB,IAAV0I,EACd,OAAOqN,EAKT,GAAIyJ,EAAQ,EAAG,CACb,IAAI0B,EAAYnL,GAAQA,EAAKtG,MAAM8M,GAC/B4E,EAAeH,GAAYE,EAAWlI,EAASwG,EAAQrV,EAAOlI,EAAOyG,EAAO8R,GAChF,OAAI2G,IAAiBD,EACZnL,IAET8E,EAAUiF,GAAc/J,EAAMiD,IACtBvJ,MAAM8M,GAAO4E,EACdtG,EACT,CAEA,OAAIoG,GAAWlL,EAAKtG,MAAM8M,KAAS7T,EAC1BqN,GAGTrL,EAAO8P,GAEPK,EAAUiF,GAAc/J,EAAMiD,QAChBhZ,IAAV0I,GAAuB6T,IAAQ1B,EAAQpL,MAAMhZ,OAAS,EACxDokB,EAAQpL,MAAMqN,MAEdjC,EAAQpL,MAAM8M,GAAO7T,EAEhBmS,EACT,CAEA,SAASiF,GAAc/J,EAAMiD,GAC3B,OAAIA,GAAWjD,GAAQiD,IAAYjD,EAAKiD,QAC/BjD,EAEF,IAAImI,GAAMnI,EAAOA,EAAKtG,MAAMrN,QAAU,GAAI4W,EACnD,CAEA,SAASuF,GAAYJ,EAAMiD,GACzB,GAAIA,GAAYd,GAAcnC,EAAKS,WACjC,OAAOT,EAAKW,MAEd,GAAIsC,EAAW,GAAMjD,EAAKU,OAAS1U,EAAQ,CAGzC,IAFA,IAAI4L,EAAOoI,EAAK1H,MACZ+I,EAAQrB,EAAKU,OACV9I,GAAQyJ,EAAQ,GACrBzJ,EAAOA,EAAKtG,MAAO2R,IAAa5B,EAASnV,GACzCmV,GAASrV,EAEX,OAAO4L,CACT,CACF,CAEA,SAASkJ,GAAcd,EAAMxS,EAAOC,QAGpB5L,IAAV2L,IACFA,GAAgB,QAEN3L,IAAR4L,IACFA,GAAY,GAEd,IAAIyV,EAAQlD,EAAK7G,WAAa,IAAI3M,EAC9B2W,EAAYnD,EAAKK,QACjB+C,EAAcpD,EAAKS,UACnB4C,EAAYF,EAAY3V,EACxB8V,OAAsBzhB,IAAR4L,EAAoB2V,EAAc3V,EAAM,EAAI2V,EAAc3V,EAAM0V,EAAY1V,EAC9F,GAAI4V,IAAcF,GAAaG,IAAgBF,EAC7C,OAAOpD,EAIT,GAAIqD,GAAaC,EACf,OAAOtD,EAAK9G,QAQd,IALA,IAAIqK,EAAWvD,EAAKU,OAChBxE,EAAU8D,EAAK1H,MAGfkL,EAAc,EACXH,EAAYG,EAAc,GAC/BtH,EAAU,IAAI6D,GAAM7D,GAAWA,EAAQ5K,MAAMhZ,OAAS,MAACuJ,EAAWqa,GAAW,GAAIgH,GAEjFM,GAAe,IADfD,GAAYvX,GAGVwX,IACFH,GAAaG,EACbL,GAAaK,EACbF,GAAeE,EACfJ,GAAeI,GAOjB,IAJA,IAAIC,EAAgBtB,GAAciB,GAC9BM,EAAgBvB,GAAcmB,GAG3BI,GAAiB,GAAMH,EAAWvX,GACvCkQ,EAAU,IAAI6D,GAAM7D,GAAWA,EAAQ5K,MAAMhZ,OAAS,CAAC4jB,GAAW,GAAIgH,GACtEK,GAAYvX,EAId,IAAI2X,EAAU3D,EAAKW,MACfiC,EAAUc,EAAgBD,EAC5BrD,GAAYJ,EAAMsD,EAAc,GAChCI,EAAgBD,EAAgB,IAAI1D,GAAM,GAAImD,GAASS,EAGzD,GAAIA,GAAWD,EAAgBD,GAAiBJ,EAAYD,GAAeO,EAAQrS,MAAMhZ,OAAQ,CAG/F,IADA,IAAIsf,EADJsE,EAAUyF,GAAczF,EAASgH,GAExB7B,EAAQkC,EAAUlC,EAAQrV,EAAOqV,GAASrV,EAAO,CACxD,IAAIoS,EAAOqF,IAAkBpC,EAASnV,EACtC0L,EAAOA,EAAKtG,MAAM8M,GAAOuD,GAAc/J,EAAKtG,MAAM8M,GAAM8E,EAC1D,CACAtL,EAAKtG,MAAOmS,IAAkBzX,EAASE,GAAQyX,CACjD,CAQA,GALIL,EAAcF,IAChBR,EAAUA,GAAWA,EAAQhB,YAAYsB,EAAO,EAAGI,IAIjDD,GAAaK,EACfL,GAAaK,EACbJ,GAAeI,EACfH,EAAWvX,EACXkQ,EAAU,KACV0G,EAAUA,GAAWA,EAAQxB,aAAa8B,EAAO,EAAGG,QAG/C,GAAIA,EAAYF,GAAaO,EAAgBD,EAAe,CAIjE,IAHAD,EAAc,EAGPtH,GAAS,CACd,IAAI0H,EAAcP,IAAcE,EAAYrX,EAC5C,GAAI0X,IAAgBF,IAAkBH,EAAYrX,EAChD,MAEE0X,IACFJ,IAAgB,GAAKD,GAAYK,GAEnCL,GAAYvX,EACZkQ,EAAUA,EAAQ5K,MAAMsS,EAC1B,CAGI1H,GAAWmH,EAAYF,IACzBjH,EAAUA,EAAQkF,aAAa8B,EAAOK,EAAUF,EAAYG,IAE1DtH,GAAWwH,EAAgBD,IAC7BvH,EAAUA,EAAQ0F,YAAYsB,EAAOK,EAAUG,EAAgBF,IAE7DA,IACFH,GAAaG,EACbF,GAAeE,EAEnB,CAEA,OAAIxD,EAAK7G,WACP6G,EAAK1a,KAAOge,EAAcD,EAC1BrD,EAAKK,QAAUgD,EACfrD,EAAKS,UAAY6C,EACjBtD,EAAKU,OAAS6C,EACdvD,EAAK1H,MAAQ4D,EACb8D,EAAKW,MAAQiC,EACb5C,EAAKrM,YAAS9R,EACdme,EAAK5G,WAAY,EACV4G,GAEFF,GAASuD,EAAWC,EAAaC,EAAUrH,EAAS0G,EAC7D,CAEA,SAAS5B,GAAkBhB,EAAMzG,EAAQ+D,GAGvC,IAFA,IAAI7D,EAAQ,GACRoK,EAAU,EACL9W,EAAK,EAAGA,EAAKuQ,EAAUhlB,OAAQyU,IAAM,CAC5C,IAAIxC,EAAQ+S,EAAUvQ,GAClBE,EAAOpC,EAAgBN,GACvB0C,EAAK3H,KAAOue,IACdA,EAAU5W,EAAK3H,MAEZkF,EAAWD,KACd0C,EAAOA,EAAKtI,KAAI,SAAS+J,GAAK,OAAOgE,GAAOhE,EAAE,KAEhD+K,EAAMvc,KAAK+P,EACb,CAIA,OAHI4W,EAAU7D,EAAK1a,OACjB0a,EAAOA,EAAKC,QAAQ4D,IAEftG,GAAwByC,EAAMzG,EAAQE,EAC/C,CAEA,SAAS0I,GAAc7c,GACrB,OAAOA,EAAO2G,EAAO,EAAO3G,EAAO,IAAO0G,GAAUA,CACtD,CAME,SAASkO,GAAW3P,GAClB,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsBuZ,KAC7CC,GAAaxZ,GAASA,EACtBuZ,KAAkB3L,eAAc,SAASxT,GACvC,IAAIsI,EAAOvC,EAAcH,GACzByN,GAAkB/K,EAAK3H,MACvB2H,EAAKzM,SAAQ,SAASkO,EAAGD,GAAK,OAAO9J,EAAIsD,IAAIwG,EAAGC,EAAE,GACpD,GACJ,CAuEF,SAASqV,GAAaC,GACpB,OAAO9L,GAAM8L,IAAoBtY,EAAUsY,EAC7C,CASA,SAASC,GAAetf,EAAKqb,EAAMnF,EAASvE,GAC1C,IAAI4N,EAAOzrB,OAAOmP,OAAOsS,GAAWnhB,WAMpC,OALAmrB,EAAK5e,KAAOX,EAAMA,EAAIW,KAAO,EAC7B4e,EAAKC,KAAOxf,EACZuf,EAAKE,MAAQpE,EACbkE,EAAK/K,UAAY0B,EACjBqJ,EAAKvQ,OAAS2C,EACP4N,CACT,CAGA,SAASJ,KACP,OAAO/B,KAAsBA,GAAoBkC,GAAehM,KAAY2H,MAC9E,CAEA,SAASyE,GAAiBH,EAAMzV,EAAGC,GACjC,IAII4V,EACAC,EALA5f,EAAMuf,EAAKC,KACXnE,EAAOkE,EAAKE,MACZxrB,EAAI+L,EAAIX,IAAIyK,GACZtT,OAAY0G,IAANjJ,EAGV,GAAI8V,IAAMvC,EAAS,CACjB,IAAKhR,EACH,OAAO+oB,EAELlE,EAAK1a,MAAQ2G,GAAQ+T,EAAK1a,MAAmB,EAAXX,EAAIW,MAExCgf,GADAC,EAAUvE,EAAK3kB,QAAO,SAASmX,EAAO4L,GAAO,YAAiBvc,IAAV2Q,GAAuB5Z,IAAMwlB,CAAG,KACnE3O,aAAa9K,KAAI,SAAS6N,GAAS,OAAOA,EAAM,EAAE,IAAGgS,OAAOtR,QACzEgR,EAAK/K,YACPmL,EAAOnL,UAAYoL,EAAQpL,UAAY+K,EAAK/K,aAG9CmL,EAAS3f,EAAIgU,OAAOlK,GACpB8V,EAAU3rB,IAAMonB,EAAK1a,KAAO,EAAI0a,EAAKrB,MAAQqB,EAAK/X,IAAIrP,OAAGiJ,GAE7D,MACE,GAAI1G,EAAK,CACP,GAAIuT,IAAMsR,EAAKhc,IAAIpL,GAAG,GACpB,OAAOsrB,EAETI,EAAS3f,EACT4f,EAAUvE,EAAK/X,IAAIrP,EAAG,CAAC6V,EAAGC,GAC5B,MACE4V,EAAS3f,EAAIsD,IAAIwG,EAAGuR,EAAK1a,MACzBif,EAAUvE,EAAK/X,IAAI+X,EAAK1a,KAAM,CAACmJ,EAAGC,IAGtC,OAAIwV,EAAK/K,WACP+K,EAAK5e,KAAOgf,EAAOhf,KACnB4e,EAAKC,KAAOG,EACZJ,EAAKE,MAAQG,EACbL,EAAKvQ,YAAS9R,EACPqiB,GAEFD,GAAeK,EAAQC,EAChC,CAGE,SAASE,GAAgBC,EAASrS,GAChClZ,KAAKwrB,MAAQD,EACbvrB,KAAKyrB,SAAWvS,EAChBlZ,KAAKmM,KAAOof,EAAQpf,IACtB,CA0DA,SAASuf,GAAkB5X,GACzB9T,KAAKwrB,MAAQ1X,EACb9T,KAAKmM,KAAO2H,EAAK3H,IACnB,CAwBA,SAASwf,GAAc7X,GACrB9T,KAAKwrB,MAAQ1X,EACb9T,KAAKmM,KAAO2H,EAAK3H,IACnB,CAsBA,SAASyf,GAAoBlR,GAC3B1a,KAAKwrB,MAAQ9Q,EACb1a,KAAKmM,KAAOuO,EAAQvO,IACtB,CAuDF,SAAS0f,GAAY7V,GACnB,IAAI8V,EAAeC,GAAa/V,GAiChC,OAhCA8V,EAAaN,MAAQxV,EACrB8V,EAAa3f,KAAO6J,EAAS7J,KAC7B2f,EAAaT,KAAO,WAAa,OAAOrV,CAAQ,EAChD8V,EAAarU,QAAU,WACrB,IAAIuU,EAAmBhW,EAASyB,QAAQ1X,MAAMC,MAE9C,OADAgsB,EAAiBX,KAAO,WAAa,OAAOrV,EAASyB,SAAS,EACvDuU,CACT,EACAF,EAAa9pB,IAAM,SAASrC,GAAO,OAAOqW,EAASuG,SAAS5c,EAAI,EAChEmsB,EAAavP,SAAW,SAAS5c,GAAO,OAAOqW,EAAShU,IAAIrC,EAAI,EAChEmsB,EAAazU,YAAc4U,GAC3BH,EAAavU,kBAAoB,SAAUvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACpE,OAAOgW,EAASjC,WAAU,SAASwB,EAAGD,GAAK,OAA4B,IAArBtN,EAAGsN,EAAGC,EAAGmH,EAAiB,GAAGjF,EACjF,EACAqU,EAAaxS,mBAAqB,SAASpY,EAAMuW,GAC/C,GAAIvW,IAAS4T,EAAiB,CAC5B,IAAIG,EAAWe,EAAS2B,WAAWzW,EAAMuW,GACzC,OAAO,IAAIrC,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,IAAKwM,EAAKjG,KAAM,CACd,IAAIH,EAAIoG,EAAKtK,MAAM,GACnBsK,EAAKtK,MAAM,GAAKsK,EAAKtK,MAAM,GAC3BsK,EAAKtK,MAAM,GAAKkE,CAClB,CACA,OAAOoG,CACT,GACF,CACA,OAAO1F,EAAS2B,WACdzW,IAAS2T,EAAiBD,EAAeC,EACzC4C,EAEJ,EACOqU,CACT,CAGA,SAASI,GAAWlW,EAAUkL,EAAQiL,GACpC,IAAIC,EAAiBL,GAAa/V,GAgClC,OA/BAoW,EAAejgB,KAAO6J,EAAS7J,KAC/BigB,EAAepqB,IAAM,SAASrC,GAAO,OAAOqW,EAAShU,IAAIrC,EAAI,EAC7DysB,EAAevhB,IAAM,SAASlL,EAAKyc,GACjC,IAAI7G,EAAIS,EAASnL,IAAIlL,EAAKqT,GAC1B,OAAOuC,IAAMvC,EACXoJ,EACA8E,EAAOphB,KAAKqsB,EAAS5W,EAAG5V,EAAKqW,EACjC,EACAoW,EAAe7U,kBAAoB,SAAUvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACtE,OAAOgW,EAASjC,WACd,SAASwB,EAAGD,EAAG0H,GAAK,OAAwD,IAAjDhV,EAAGkZ,EAAOphB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,GAAI1H,EAAGoH,EAAiB,GACjFjF,EAEJ,EACA2U,EAAe9S,mBAAqB,SAAUpY,EAAMuW,GAClD,IAAIxC,EAAWe,EAAS2B,WAAW7C,EAAiB2C,GACpD,OAAO,IAAIrC,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAET,IAAIrC,EAAQqC,EAAKtK,MACbzR,EAAM0Z,EAAM,GAChB,OAAOhE,EACLnU,EACAvB,EACAuhB,EAAOphB,KAAKqsB,EAAS9S,EAAM,GAAI1Z,EAAKqW,GACpC0F,EAEJ,GACF,EACO0Q,CACT,CAGA,SAASC,GAAerW,EAAUkD,GAChC,IAAI8S,EAAmBD,GAAa/V,GAsBpC,OArBAgW,EAAiBR,MAAQxV,EACzBgW,EAAiB7f,KAAO6J,EAAS7J,KACjC6f,EAAiBvU,QAAU,WAAa,OAAOzB,CAAQ,EACnDA,EAASqV,OACXW,EAAiBX,KAAO,WACtB,IAAIS,EAAeD,GAAY7V,GAE/B,OADA8V,EAAarU,QAAU,WAAa,OAAOzB,EAASqV,MAAM,EACnDS,CACT,GAEFE,EAAiBnhB,IAAM,SAASlL,EAAKyc,GAClC,OAAOpG,EAASnL,IAAIqO,EAAUvZ,GAAO,EAAIA,EAAKyc,EAAY,EAC7D4P,EAAiBhqB,IAAM,SAASrC,GAC7B,OAAOqW,EAAShU,IAAIkX,EAAUvZ,GAAO,EAAIA,EAAI,EAChDqsB,EAAiBzP,SAAW,SAASnL,GAAS,OAAO4E,EAASuG,SAASnL,EAAM,EAC7E4a,EAAiB3U,YAAc4U,GAC/BD,EAAiBjY,UAAY,SAAU/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KAChE,OAAOgW,EAASjC,WAAU,SAASwB,EAAGD,GAAK,OAAOtN,EAAGuN,EAAGD,EAAGoH,EAAO,IAAIjF,EACxE,EACAuU,EAAiBrU,WACf,SAASzW,EAAMuW,GAAW,OAAOzB,EAAS2B,WAAWzW,GAAOuW,EAAQ,EAC/DuU,CACT,CAGA,SAASM,GAActW,EAAUuW,EAAWJ,EAASjT,GACnD,IAAIsT,EAAiBT,GAAa/V,GAwClC,OAvCIkD,IACFsT,EAAexqB,IAAM,SAASrC,GAC5B,IAAI4V,EAAIS,EAASnL,IAAIlL,EAAKqT,GAC1B,OAAOuC,IAAMvC,KAAauZ,EAAUzsB,KAAKqsB,EAAS5W,EAAG5V,EAAKqW,EAC5D,EACAwW,EAAe3hB,IAAM,SAASlL,EAAKyc,GACjC,IAAI7G,EAAIS,EAASnL,IAAIlL,EAAKqT,GAC1B,OAAOuC,IAAMvC,GAAWuZ,EAAUzsB,KAAKqsB,EAAS5W,EAAG5V,EAAKqW,GACtDT,EAAI6G,CACR,GAEFoQ,EAAejV,kBAAoB,SAAUvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KAClEqc,EAAa,EAOjB,OANArG,EAASjC,WAAU,SAASwB,EAAGD,EAAG0H,GAChC,GAAIuP,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,GAEhC,OADAX,IACOrU,EAAGuN,EAAG2D,EAAU5D,EAAI+G,EAAa,EAAGK,EAE/C,GAAGjF,GACI4E,CACT,EACAmQ,EAAelT,mBAAqB,SAAUpY,EAAMuW,GAClD,IAAIxC,EAAWe,EAAS2B,WAAW7C,EAAiB2C,GAChD4E,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,OAAa,CACX,IAAIsG,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAET,IAAIrC,EAAQqC,EAAKtK,MACbzR,EAAM0Z,EAAM,GACZjI,EAAQiI,EAAM,GAClB,GAAIkT,EAAUzsB,KAAKqsB,EAAS/a,EAAOzR,EAAKqW,GACtC,OAAOX,EAAcnU,EAAMgY,EAAUvZ,EAAM0c,IAAcjL,EAAOsK,EAEpE,CACF,GACF,EACO8Q,CACT,CAGA,SAASC,GAAezW,EAAU0W,EAASP,GACzC,IAAIQ,EAAS5e,KAAMqT,YAQnB,OAPApL,EAASjC,WAAU,SAASwB,EAAGD,GAC7BqX,EAAOjN,OACLgN,EAAQ5sB,KAAKqsB,EAAS5W,EAAGD,EAAGU,GAC5B,GACA,SAASsE,GAAK,OAAOA,EAAI,CAAC,GAE9B,IACOqS,EAAOpL,aAChB,CAGA,SAASqL,GAAe5W,EAAU0W,EAASP,GACzC,IAAIU,EAAcrb,EAAQwE,GACtB2W,GAAUpa,EAAUyD,GAAY+K,KAAehT,MAAOqT,YAC1DpL,EAASjC,WAAU,SAASwB,EAAGD,GAC7BqX,EAAOjN,OACLgN,EAAQ5sB,KAAKqsB,EAAS5W,EAAGD,EAAGU,IAC5B,SAASsE,GAAK,OAAQA,EAAIA,GAAK,IAAMvW,KAAK8oB,EAAc,CAACvX,EAAGC,GAAKA,GAAI+E,CAAE,GAE3E,IACA,IAAIwS,EAASC,GAAc/W,GAC3B,OAAO2W,EAAOnhB,KAAI,SAAS+H,GAAO,OAAOyZ,GAAMhX,EAAU8W,EAAOvZ,GAAK,GACvE,CAGA,SAAS0Z,GAAajX,EAAU3B,EAAOC,EAAK4E,GAC1C,IAAIgU,EAAelX,EAAS7J,KAW5B,QAPczD,IAAV2L,IACFA,GAAgB,QAEN3L,IAAR4L,IACFA,GAAY,GAGVF,EAAWC,EAAOC,EAAK4Y,GACzB,OAAOlX,EAGT,IAAImX,EAAgB5Y,EAAaF,EAAO6Y,GACpCE,EAAc3Y,EAAWH,EAAK4Y,GAKlC,GAAIC,IAAkBA,GAAiBC,IAAgBA,EACrD,OAAOH,GAAajX,EAASI,QAAQiB,cAAehD,EAAOC,EAAK4E,GAOlE,IACImU,EADAC,EAAeF,EAAcD,EAE7BG,IAAiBA,IACnBD,EAAYC,EAAe,EAAI,EAAIA,GAGrC,IAAIC,EAAWxB,GAAa/V,GA6D5B,OAzDAuX,EAASphB,KAAqB,IAAdkhB,EAAkBA,EAAYrX,EAAS7J,MAAQkhB,QAAa3kB,GAEvEwQ,GAAWrB,GAAM7B,IAAaqX,GAAa,IAC9CE,EAAS1iB,IAAM,SAAUF,EAAOyR,GAE9B,OADAzR,EAAQsJ,EAAUjU,KAAM2K,KACR,GAAKA,EAAQ0iB,EAC3BrX,EAASnL,IAAIF,EAAQwiB,EAAe/Q,GACpCA,CACJ,GAGFmR,EAAShW,kBAAoB,SAASvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KAC/D,GAAkB,IAAdqtB,EACF,OAAO,EAET,GAAI5V,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAE1C,IAAI+V,EAAU,EACVC,GAAa,EACbpR,EAAa,EAQjB,OAPArG,EAASjC,WAAU,SAASwB,EAAGD,GAC7B,IAAMmY,KAAeA,EAAaD,IAAYL,GAE5C,OADA9Q,KACuD,IAAhDrU,EAAGuN,EAAG2D,EAAU5D,EAAI+G,EAAa,EAAGK,IACpCL,IAAegR,CAE1B,IACOhR,CACT,EAEAkR,EAASjU,mBAAqB,SAASpY,EAAMuW,GAC3C,GAAkB,IAAd4V,GAAmB5V,EACrB,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAG7C,IAAIxC,EAAyB,IAAdoY,GAAmBrX,EAAS2B,WAAWzW,EAAMuW,GACxD+V,EAAU,EACVnR,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,KAAOoY,IAAYL,GACjBlY,EAAS/F,OAEX,KAAMmN,EAAagR,EACjB,OAAO3X,IAET,IAAIgG,EAAOzG,EAAS/F,OACpB,OAAIgK,GAAWhY,IAAS2T,EACf6G,EAEArG,EAAcnU,EAAMmb,EAAa,EAD/Bnb,IAAS0T,OACyBlM,EAEAgT,EAAKtK,MAAM,GAFAsK,EAI1D,GACF,EAEO6R,CACT,CAGA,SAASG,GAAiB1X,EAAUuW,EAAWJ,GAC7C,IAAIwB,EAAe5B,GAAa/V,GAoChC,OAnCA2X,EAAapW,kBAAoB,SAASvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACnE,GAAIyX,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAE1C,IAAI4E,EAAa,EAIjB,OAHArG,EAASjC,WAAU,SAASwB,EAAGD,EAAG0H,GAC/B,OAAOuP,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,MAAQX,GAAcrU,EAAGuN,EAAGD,EAAGoH,EAAO,IAEvEL,CACT,EACAsR,EAAarU,mBAAqB,SAASpY,EAAMuW,GAAU,IAAIiF,EAAS1c,KACtE,GAAIyX,EACF,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAE7C,IAAIxC,EAAWe,EAAS2B,WAAW7C,EAAiB2C,GAChDmW,GAAY,EAChB,OAAO,IAAIxY,GAAS,WAClB,IAAKwY,EACH,OAAOlY,IAET,IAAIgG,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAET,IAAIrC,EAAQqC,EAAKtK,MACbkE,EAAI+D,EAAM,GACV9D,EAAI8D,EAAM,GACd,OAAKkT,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAGoH,GAI5Bxb,IAAS4T,EAAkB4G,EAChCrG,EAAcnU,EAAMoU,EAAGC,EAAGmG,IAJ1BkS,GAAY,EACLlY,IAIX,GACF,EACOiY,CACT,CAGA,SAASE,GAAiB7X,EAAUuW,EAAWJ,EAASjT,GACtD,IAAI4U,EAAe/B,GAAa/V,GA4ChC,OA3CA8X,EAAavW,kBAAoB,SAAUvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACpE,GAAIyX,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAE1C,IAAIgW,GAAa,EACbpR,EAAa,EAOjB,OANArG,EAASjC,WAAU,SAASwB,EAAGD,EAAG0H,GAChC,IAAMyQ,KAAeA,EAAalB,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,IAE9D,OADAX,IACOrU,EAAGuN,EAAG2D,EAAU5D,EAAI+G,EAAa,EAAGK,EAE/C,IACOL,CACT,EACAyR,EAAaxU,mBAAqB,SAASpY,EAAMuW,GAAU,IAAIiF,EAAS1c,KACtE,GAAIyX,EACF,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAE7C,IAAIxC,EAAWe,EAAS2B,WAAW7C,EAAiB2C,GAChDsW,GAAW,EACX1R,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,IAAIsG,EAAMpG,EAAGC,EACb,EAAG,CAED,IADAmG,EAAOzG,EAAS/F,QACPuG,KACP,OAAIyD,GAAWhY,IAAS2T,EACf6G,EAEArG,EAAcnU,EAAMmb,IADlBnb,IAAS0T,OACuBlM,EAEAgT,EAAKtK,MAAM,GAFAsK,GAKxD,IAAIrC,EAAQqC,EAAKtK,MACjBkE,EAAI+D,EAAM,GACV9D,EAAI8D,EAAM,GACV0U,IAAaA,EAAWxB,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAGoH,GACxD,OAASqR,GACT,OAAO7sB,IAAS4T,EAAkB4G,EAChCrG,EAAcnU,EAAMoU,EAAGC,EAAGmG,EAC9B,GACF,EACOoS,CACT,CAGA,SAASE,GAAchY,EAAUyR,GAC/B,IAAIwG,EAAkBzc,EAAQwE,GAC1BsK,EAAQ,CAACtK,GAAU/N,OAAOwf,GAAQjc,KAAI,SAAS+J,GAQjD,OAPKlE,EAAWkE,GAIL0Y,IACT1Y,EAAIhE,EAAcgE,IAJlBA,EAAI0Y,EACFzX,GAAkBjB,GAClBoB,GAAoB1X,MAAMC,QAAQqW,GAAKA,EAAI,CAACA,IAIzCA,CACT,IAAGrT,QAAO,SAASqT,GAAK,OAAkB,IAAXA,EAAEpJ,IAAU,IAE3C,GAAqB,IAAjBmU,EAAMnhB,OACR,OAAO6W,EAGT,GAAqB,IAAjBsK,EAAMnhB,OAAc,CACtB,IAAI+uB,EAAY5N,EAAM,GACtB,GAAI4N,IAAclY,GACdiY,GAAmBzc,EAAQ0c,IAC3Bvc,EAAUqE,IAAarE,EAAUuc,GACnC,OAAOA,CAEX,CAEA,IAAIC,EAAY,IAAIjW,GAASoI,GAkB7B,OAjBI2N,EACFE,EAAYA,EAAU7X,aACZ3E,EAAUqE,KACpBmY,EAAYA,EAAUvX,aAExBuX,EAAYA,EAAUC,SAAQ,IACpBjiB,KAAOmU,EAAM5c,QACrB,SAAS2qB,EAAKtV,GACZ,QAAYrQ,IAAR2lB,EAAmB,CACrB,IAAIliB,EAAO4M,EAAI5M,KACf,QAAazD,IAATyD,EACF,OAAOkiB,EAAMliB,CAEjB,CACF,GACA,GAEKgiB,CACT,CAGA,SAASG,GAAetY,EAAUuY,EAAOrV,GACvC,IAAIsV,EAAezC,GAAa/V,GA0ChC,OAzCAwY,EAAajX,kBAAoB,SAASvP,EAAIyP,GAC5C,IAAI4E,EAAa,EACboS,GAAU,EACd,SAASC,EAAS5a,EAAM6a,GAAe,IAAIjS,EAAS1c,KAClD8T,EAAKC,WAAU,SAASwB,EAAGD,GAMzB,QALMiZ,GAASI,EAAeJ,IAAUld,EAAWkE,GACjDmZ,EAASnZ,EAAGoZ,EAAe,IAC4B,IAA9C3mB,EAAGuN,EAAG2D,EAAU5D,EAAI+G,IAAcK,KAC3C+R,GAAU,IAEJA,CACV,GAAGhX,EACL,CAEA,OADAiX,EAAS1Y,EAAU,GACZqG,CACT,EACAmS,EAAalV,mBAAqB,SAASpY,EAAMuW,GAC/C,IAAIxC,EAAWe,EAAS2B,WAAWzW,EAAMuW,GACrC6O,EAAQ,GACRjK,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,KAAOH,GAAU,CACf,IAAIyG,EAAOzG,EAAS/F,OACpB,IAAkB,IAAdwM,EAAKjG,KAAT,CAIA,IAAIF,EAAImG,EAAKtK,MAIb,GAHIlQ,IAAS4T,IACXS,EAAIA,EAAE,IAEFgZ,KAASjI,EAAMnnB,OAASovB,KAAUld,EAAWkE,GAIjD,OAAO2D,EAAUwC,EAAOrG,EAAcnU,EAAMmb,IAAc9G,EAAGmG,GAH7D4K,EAAMviB,KAAKkR,GACXA,EAAWM,EAAEoC,WAAWzW,EAAMuW,EAPhC,MAFExC,EAAWqR,EAAMd,KAarB,CACA,OAAO9P,GACT,GACF,EACO8Y,CACT,CAGA,SAASI,GAAe5Y,EAAUkL,EAAQiL,GACxC,IAAIW,EAASC,GAAc/W,GAC3B,OAAOA,EAASI,QAAQ5K,KACtB,SAAS+J,EAAGD,GAAK,OAAOwX,EAAO5L,EAAOphB,KAAKqsB,EAAS5W,EAAGD,EAAGU,GAAU,IACpEoY,SAAQ,EACZ,CAGA,SAASS,GAAiB7Y,EAAU8Y,GAClC,IAAIC,EAAqBhD,GAAa/V,GA2BtC,OA1BA+Y,EAAmB5iB,KAAO6J,EAAS7J,MAAwB,EAAhB6J,EAAS7J,KAAU,EAC9D4iB,EAAmBxX,kBAAoB,SAASvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACrEqc,EAAa,EAMjB,OALArG,EAASjC,WAAU,SAASwB,EAAGD,GAC5B,QAAS+G,IAAsD,IAAxCrU,EAAG8mB,EAAWzS,IAAcK,MACpB,IAAhC1U,EAAGuN,EAAG8G,IAAcK,EAAiB,GACrCjF,GAEK4E,CACT,EACA0S,EAAmBzV,mBAAqB,SAASpY,EAAMuW,GACrD,IAEIiE,EAFAzG,EAAWe,EAAS2B,WAAW9C,EAAgB4C,GAC/C4E,EAAa,EAEjB,OAAO,IAAIjH,GAAS,WAClB,QAAKsG,GAAQW,EAAa,KACxBX,EAAOzG,EAAS/F,QACPuG,KACAiG,EAGJW,EAAa,EAClBhH,EAAcnU,EAAMmb,IAAcyS,GAClCzZ,EAAcnU,EAAMmb,IAAcX,EAAKtK,MAAOsK,EAClD,GACF,EACOqT,CACT,CAGA,SAAS/N,GAAYhL,EAAU8K,EAAYI,GACpCJ,IACHA,EAAakO,IAEf,IAAIf,EAAkBzc,EAAQwE,GAC1BrL,EAAQ,EACR+P,EAAU1E,EAASI,QAAQ5K,KAC7B,SAAS+J,EAAGD,GAAK,MAAO,CAACA,EAAGC,EAAG5K,IAASuW,EAASA,EAAO3L,EAAGD,EAAGU,GAAYT,EAAE,IAC5EiC,UAMF,OALAkD,EAAQmG,MAAK,SAASvG,EAAGC,GAAK,OAAOuG,EAAWxG,EAAE,GAAIC,EAAE,KAAOD,EAAE,GAAKC,EAAE,EAAE,IAAGlT,QAC3E4mB,EACA,SAAS1Y,EAAG9V,GAAMib,EAAQjb,GAAGN,OAAS,CAAG,EACzC,SAASoW,EAAG9V,GAAMib,EAAQjb,GAAK8V,EAAE,EAAI,GAEhC0Y,EAAkBxc,EAASiJ,GAChC/I,EAAUqE,GAAYpE,EAAW8I,GACjC3I,EAAO2I,EACX,CAGA,SAASuU,GAAWjZ,EAAU8K,EAAYI,GAIxC,GAHKJ,IACHA,EAAakO,IAEX9N,EAAQ,CACV,IAAI7H,EAAQrD,EAASI,QAClB5K,KAAI,SAAS+J,EAAGD,GAAK,MAAO,CAACC,EAAG2L,EAAO3L,EAAGD,EAAGU,GAAU,IACvDtS,QAAO,SAAS4W,EAAGC,GAAK,OAAO2U,GAAWpO,EAAYxG,EAAE,GAAIC,EAAE,IAAMA,EAAID,CAAC,IAC5E,OAAOjB,GAASA,EAAM,EACxB,CACE,OAAOrD,EAAStS,QAAO,SAAS4W,EAAGC,GAAK,OAAO2U,GAAWpO,EAAYxG,EAAGC,GAAKA,EAAID,CAAC,GAEvF,CAEA,SAAS4U,GAAWpO,EAAYxG,EAAGC,GACjC,IAAI4U,EAAOrO,EAAWvG,EAAGD,GAGzB,OAAiB,IAAT6U,GAAc5U,IAAMD,SAAY5R,IAAN6R,GAAyB,OAANA,GAAcA,IAAMA,IAAO4U,EAAO,CACzF,CAGA,SAASC,GAAeC,EAASC,EAAQhP,GACvC,IAAIiP,EAAcxD,GAAasD,GAkD/B,OAjDAE,EAAYpjB,KAAO,IAAI+L,GAASoI,GAAO9U,KAAI,SAAS/L,GAAK,OAAOA,EAAE0M,IAAI,IAAGwI,MAGzE4a,EAAYxb,UAAY,SAAS/L,EAAIyP,GAiBnC,IAHA,IACIiE,EADAzG,EAAWjV,KAAK2X,WAAW9C,EAAgB4C,GAE3C4E,EAAa,IACRX,EAAOzG,EAAS/F,QAAQuG,OACY,IAAvCzN,EAAG0T,EAAKtK,MAAOiL,IAAcrc,QAInC,OAAOqc,CACT,EACAkT,EAAYjW,mBAAqB,SAASpY,EAAMuW,GAC9C,IAAI+X,EAAYlP,EAAM9U,KAAI,SAAS/L,GAChC,OAAQA,EAAI0R,EAAS1R,GAAIsW,EAAY0B,EAAUhY,EAAEgY,UAAYhY,EAAG,IAE/D4c,EAAa,EACboT,GAAS,EACb,OAAO,IAAIra,GAAS,WAClB,IAAIsa,EAKJ,OAJKD,IACHC,EAAQF,EAAUhkB,KAAI,SAAS/L,GAAK,OAAOA,EAAEyP,MAAM,IACnDugB,EAASC,EAAM3nB,MAAK,SAAS4nB,GAAK,OAAOA,EAAEla,IAAI,KAE7Cga,EACK/Z,IAEFL,EACLnU,EACAmb,IACAiT,EAAOvvB,MAAM,KAAM2vB,EAAMlkB,KAAI,SAASmkB,GAAK,OAAOA,EAAEve,KAAK,KAE7D,GACF,EACOme,CACT,CAKA,SAASvC,GAAMlZ,EAAMiF,GACnB,OAAOlB,GAAM/D,GAAQiF,EAAMjF,EAAKpF,YAAYqK,EAC9C,CAEA,SAAS6W,GAAcvW,GACrB,GAAIA,IAAU/Z,OAAO+Z,GACnB,MAAM,IAAIL,UAAU,0BAA4BK,EAEpD,CAEA,SAASwW,GAAY/b,GAEnB,OADA+K,GAAkB/K,EAAK3H,MAChB0H,EAAWC,EACpB,CAEA,SAASiZ,GAAc/W,GACrB,OAAOxE,EAAQwE,GAAYzE,EACzBI,EAAUqE,GAAYtE,EACtBG,CACJ,CAEA,SAASka,GAAa/V,GACpB,OAAO1W,OAAOmP,QAEV+C,EAAQwE,GAAYvE,EACpBE,EAAUqE,GAAYpE,EACtBG,GACAnS,UAEN,CAEA,SAASqsB,KACP,OAAIjsB,KAAKwrB,MAAMnU,aACbrX,KAAKwrB,MAAMnU,cACXrX,KAAKmM,KAAOnM,KAAKwrB,MAAMrf,KAChBnM,MAEAsR,EAAI1R,UAAUyX,YAAYvX,KAAKE,KAE1C,CAEA,SAASgvB,GAAkB1U,EAAGC,GAC5B,OAAOD,EAAIC,EAAI,EAAID,EAAIC,GAAK,EAAI,CAClC,CAEA,SAASuF,GAAcR,GACrB,IAAIxL,EAAOiC,EAAYuJ,GACvB,IAAKxL,EAAM,CAGT,IAAKoC,EAAYoJ,GACf,MAAM,IAAItG,UAAU,oCAAsCsG,GAE5DxL,EAAOiC,EAAY5E,EAASmO,GAC9B,CACA,OAAOxL,CACT,CAIE,SAASgc,GAAOC,EAAeC,GAC7B,IAAIC,EAEAC,EAAa,SAAgBzI,GAC/B,GAAIA,aAAkByI,EACpB,OAAOzI,EAET,KAAMznB,gBAAgBkwB,GACpB,OAAO,IAAIA,EAAWzI,GAExB,IAAKwI,EAAgB,CACnBA,GAAiB,EACjB,IAAI9pB,EAAO7G,OAAO6G,KAAK4pB,GACvBI,GAASC,EAAqBjqB,GAC9BiqB,EAAoBjkB,KAAOhG,EAAKhH,OAChCixB,EAAoBC,MAAQL,EAC5BI,EAAoB5X,MAAQrS,EAC5BiqB,EAAoBE,eAAiBP,CACvC,CACA/vB,KAAKgrB,KAAOjd,GAAI0Z,EAClB,EAEI2I,EAAsBF,EAAWtwB,UAAYN,OAAOmP,OAAO8hB,IAG/D,OAFAH,EAAoB1hB,YAAcwhB,EAE3BA,CACT,CAl/BFjf,EAAY8P,GAAYhT,IActBgT,GAAW5J,GAAK,WACd,OAAOnX,KAAKZ,UACd,EAEA2hB,GAAWnhB,UAAUiX,SAAW,WAC9B,OAAO7W,KAAKoX,WAAW,eAAgB,IACzC,EAIA2J,GAAWnhB,UAAUiL,IAAM,SAASyK,EAAG8G,GACrC,IAAIzR,EAAQ3K,KAAKgrB,KAAKngB,IAAIyK,GAC1B,YAAiB5M,IAAViC,EAAsB3K,KAAKirB,MAAMpgB,IAAIF,GAAO,GAAKyR,CAC1D,EAIA2E,GAAWnhB,UAAUmgB,MAAQ,WAC3B,OAAkB,IAAd/f,KAAKmM,KACAnM,KAELA,KAAKggB,WACPhgB,KAAKmM,KAAO,EACZnM,KAAKgrB,KAAKjL,QACV/f,KAAKirB,MAAMlL,QACJ/f,MAEF2qB,IACT,EAEA5J,GAAWnhB,UAAUkP,IAAM,SAASwG,EAAGC,GACrC,OAAO2V,GAAiBlrB,KAAMsV,EAAGC,EACnC,EAEAwL,GAAWnhB,UAAU4f,OAAS,SAASlK,GACrC,OAAO4V,GAAiBlrB,KAAMsV,EAAGtC,EACnC,EAEA+N,GAAWnhB,UAAUyhB,WAAa,WAChC,OAAOrhB,KAAKgrB,KAAK3J,cAAgBrhB,KAAKirB,MAAM5J,YAC9C,EAEAN,GAAWnhB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KACnE,OAAOA,KAAKirB,MAAMlX,WAChB,SAASsF,GAAS,OAAOA,GAASrR,EAAGqR,EAAM,GAAIA,EAAM,GAAIqD,EAAO,GAChEjF,EAEJ,EAEAsJ,GAAWnhB,UAAU+X,WAAa,SAASzW,EAAMuW,GAC/C,OAAOzX,KAAKirB,MAAM1U,eAAeoB,WAAWzW,EAAMuW,EACpD,EAEAsJ,GAAWnhB,UAAU0hB,cAAgB,SAASI,GAC5C,GAAIA,IAAY1hB,KAAKggB,UACnB,OAAOhgB,KAET,IAAImrB,EAASnrB,KAAKgrB,KAAK1J,cAAcI,GACjC0J,EAAUprB,KAAKirB,MAAM3J,cAAcI,GACvC,OAAKA,EAMEoJ,GAAeK,EAAQC,EAAS1J,EAAS1hB,KAAKwa,SALnDxa,KAAKggB,UAAY0B,EACjB1hB,KAAKgrB,KAAOG,EACZnrB,KAAKirB,MAAQG,EACNprB,KAGX,EAOF+gB,GAAW6J,aAAeA,GAE1B7J,GAAWnhB,UAAU6S,IAAuB,EAC5CsO,GAAWnhB,UAAUgT,GAAUmO,GAAWnhB,UAAU4f,OA8DpDvO,EAAYqa,GAAiB7Z,GAO3B6Z,GAAgB1rB,UAAUiL,IAAM,SAASlL,EAAKyc,GAC5C,OAAOpc,KAAKwrB,MAAM3gB,IAAIlL,EAAKyc,EAC7B,EAEAkP,GAAgB1rB,UAAUoC,IAAM,SAASrC,GACvC,OAAOK,KAAKwrB,MAAMxpB,IAAIrC,EACxB,EAEA2rB,GAAgB1rB,UAAU4wB,SAAW,WACnC,OAAOxwB,KAAKwrB,MAAMgF,UACpB,EAEAlF,GAAgB1rB,UAAU6X,QAAU,WAAY,IAAIiF,EAAS1c,KACvDgsB,EAAmBK,GAAersB,MAAM,GAI5C,OAHKA,KAAKyrB,WACRO,EAAiBwE,SAAW,WAAa,OAAO9T,EAAO8O,MAAMpV,QAAQqB,SAAS,GAEzEuU,CACT,EAEAV,GAAgB1rB,UAAU4L,IAAM,SAAS0V,EAAQiL,GAAU,IAAIzP,EAAS1c,KAClEosB,EAAiBF,GAAWlsB,KAAMkhB,EAAQiL,GAI9C,OAHKnsB,KAAKyrB,WACRW,EAAeoE,SAAW,WAAa,OAAO9T,EAAO8O,MAAMpV,QAAQ5K,IAAI0V,EAAQiL,EAAQ,GAElFC,CACT,EAEAd,GAAgB1rB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IACvD7D,EAD2D8I,EAAS1c,KAExE,OAAOA,KAAKwrB,MAAMzX,UAChB/T,KAAKyrB,SACH,SAASlW,EAAGD,GAAK,OAAOtN,EAAGuN,EAAGD,EAAGoH,EAAO,GACtC9I,EAAK6D,EAAUoY,GAAY7vB,MAAQ,EACnC,SAASuV,GAAK,OAAOvN,EAAGuN,EAAGkC,IAAY7D,EAAKA,IAAM8I,EAAO,GAC7DjF,EAEJ,EAEA6T,GAAgB1rB,UAAU+X,WAAa,SAASzW,EAAMuW,GACpD,GAAIzX,KAAKyrB,SACP,OAAOzrB,KAAKwrB,MAAM7T,WAAWzW,EAAMuW,GAErC,IAAIxC,EAAWjV,KAAKwrB,MAAM7T,WAAW9C,EAAgB4C,GACjD7D,EAAK6D,EAAUoY,GAAY7vB,MAAQ,EACvC,OAAO,IAAIoV,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,OAAOwM,EAAKjG,KAAOiG,EACjBrG,EAAcnU,EAAMuW,IAAY7D,EAAKA,IAAM8H,EAAKtK,MAAOsK,EAC3D,GACF,EAEF4P,GAAgB1rB,UAAU6S,IAAuB,EAGjDxB,EAAYya,GAAmB9Z,GAM7B8Z,GAAkB9rB,UAAU2c,SAAW,SAASnL,GAC9C,OAAOpR,KAAKwrB,MAAMjP,SAASnL,EAC7B,EAEAsa,GAAkB9rB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KACtEqc,EAAa,EACjB,OAAOrc,KAAKwrB,MAAMzX,WAAU,SAASwB,GAAK,OAAOvN,EAAGuN,EAAG8G,IAAcK,EAAO,GAAGjF,EACjF,EAEAiU,GAAkB9rB,UAAU+X,WAAa,SAASzW,EAAMuW,GACtD,IAAIxC,EAAWjV,KAAKwrB,MAAM7T,WAAW9C,EAAgB4C,GACjD4E,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,OAAOwM,EAAKjG,KAAOiG,EACjBrG,EAAcnU,EAAMmb,IAAcX,EAAKtK,MAAOsK,EAClD,GACF,EAIFzK,EAAY0a,GAAe5Z,GAMzB4Z,GAAc/rB,UAAUoC,IAAM,SAASrC,GACrC,OAAOK,KAAKwrB,MAAMjP,SAAS5c,EAC7B,EAEAgsB,GAAc/rB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KACtE,OAAOA,KAAKwrB,MAAMzX,WAAU,SAASwB,GAAK,OAAOvN,EAAGuN,EAAGA,EAAGmH,EAAO,GAAGjF,EACtE,EAEAkU,GAAc/rB,UAAU+X,WAAa,SAASzW,EAAMuW,GAClD,IAAIxC,EAAWjV,KAAKwrB,MAAM7T,WAAW9C,EAAgB4C,GACrD,OAAO,IAAIrC,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,OAAOwM,EAAKjG,KAAOiG,EACjBrG,EAAcnU,EAAMwa,EAAKtK,MAAOsK,EAAKtK,MAAOsK,EAChD,GACF,EAIFzK,EAAY2a,GAAqBna,GAM/Bma,GAAoBhsB,UAAU6W,SAAW,WACvC,OAAOzW,KAAKwrB,MAAMpV,OACpB,EAEAwV,GAAoBhsB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KAC5E,OAAOA,KAAKwrB,MAAMzX,WAAU,SAASsF,GAGnC,GAAIA,EAAO,CACTuW,GAAcvW,GACd,IAAIoX,EAAkBpf,EAAWgI,GACjC,OAAOrR,EACLyoB,EAAkBpX,EAAMxO,IAAI,GAAKwO,EAAM,GACvCoX,EAAkBpX,EAAMxO,IAAI,GAAKwO,EAAM,GACvCqD,EAEJ,CACF,GAAGjF,EACL,EAEAmU,GAAoBhsB,UAAU+X,WAAa,SAASzW,EAAMuW,GACxD,IAAIxC,EAAWjV,KAAKwrB,MAAM7T,WAAW9C,EAAgB4C,GACrD,OAAO,IAAIrC,GAAS,WAClB,OAAa,CACX,IAAIsG,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAET,IAAIrC,EAAQqC,EAAKtK,MAGjB,GAAIiI,EAAO,CACTuW,GAAcvW,GACd,IAAIoX,EAAkBpf,EAAWgI,GACjC,OAAOhE,EACLnU,EACAuvB,EAAkBpX,EAAMxO,IAAI,GAAKwO,EAAM,GACvCoX,EAAkBpX,EAAMxO,IAAI,GAAKwO,EAAM,GACvCqC,EAEJ,CACF,CACF,GACF,EAGFgQ,GAAkB9rB,UAAUyX,YAC5BiU,GAAgB1rB,UAAUyX,YAC1BsU,GAAc/rB,UAAUyX,YACxBuU,GAAoBhsB,UAAUyX,YAC5B4U,GAopBFhb,EAAY6e,GAAQ7T,IA8BlB6T,GAAOlwB,UAAUiX,SAAW,WAC1B,OAAO7W,KAAKoX,WAAWsZ,GAAW1wB,MAAQ,KAAM,IAClD,EAIA8vB,GAAOlwB,UAAUoC,IAAM,SAASsT,GAC9B,OAAOtV,KAAKswB,eAAezwB,eAAeyV,EAC5C,EAEAwa,GAAOlwB,UAAUiL,IAAM,SAASyK,EAAG8G,GACjC,IAAKpc,KAAKgC,IAAIsT,GACZ,OAAO8G,EAET,IAAIuU,EAAa3wB,KAAKswB,eAAehb,GACrC,OAAOtV,KAAKgrB,KAAOhrB,KAAKgrB,KAAKngB,IAAIyK,EAAGqb,GAAcA,CACpD,EAIAb,GAAOlwB,UAAUmgB,MAAQ,WACvB,GAAI/f,KAAKggB,UAEP,OADAhgB,KAAKgrB,MAAQhrB,KAAKgrB,KAAKjL,QAChB/f,KAET,IAAIkwB,EAAalwB,KAAK0O,YACtB,OAAOwhB,EAAWU,SAAWV,EAAWU,OAASC,GAAW7wB,KAAM8e,MACpE,EAEAgR,GAAOlwB,UAAUkP,IAAM,SAASwG,EAAGC,GACjC,IAAKvV,KAAKgC,IAAIsT,GACZ,MAAM,IAAIiG,MAAM,2BAA6BjG,EAAI,QAAUob,GAAW1wB,OAExE,IAAImrB,EAASnrB,KAAKgrB,MAAQhrB,KAAKgrB,KAAKlc,IAAIwG,EAAGC,GAC3C,OAAIvV,KAAKggB,WAAamL,IAAWnrB,KAAKgrB,KAC7BhrB,KAEF6wB,GAAW7wB,KAAMmrB,EAC1B,EAEA2E,GAAOlwB,UAAU4f,OAAS,SAASlK,GACjC,IAAKtV,KAAKgC,IAAIsT,GACZ,OAAOtV,KAET,IAAImrB,EAASnrB,KAAKgrB,MAAQhrB,KAAKgrB,KAAKxL,OAAOlK,GAC3C,OAAItV,KAAKggB,WAAamL,IAAWnrB,KAAKgrB,KAC7BhrB,KAEF6wB,GAAW7wB,KAAMmrB,EAC1B,EAEA2E,GAAOlwB,UAAUyhB,WAAa,WAC5B,OAAOrhB,KAAKgrB,KAAK3J,YACnB,EAEAyO,GAAOlwB,UAAU+X,WAAa,SAASzW,EAAMuW,GAAU,IAAIiF,EAAS1c,KAClE,OAAOuR,EAAcvR,KAAKswB,gBAAgB9kB,KAAI,SAASqP,EAAGvF,GAAK,OAAOoH,EAAO7R,IAAIyK,EAAE,IAAGqC,WAAWzW,EAAMuW,EACzG,EAEAqY,GAAOlwB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KAC/D,OAAOuR,EAAcvR,KAAKswB,gBAAgB9kB,KAAI,SAASqP,EAAGvF,GAAK,OAAOoH,EAAO7R,IAAIyK,EAAE,IAAGvB,UAAU/L,EAAIyP,EACtG,EAEAqY,GAAOlwB,UAAU0hB,cAAgB,SAASI,GACxC,GAAIA,IAAY1hB,KAAKggB,UACnB,OAAOhgB,KAET,IAAImrB,EAASnrB,KAAKgrB,MAAQhrB,KAAKgrB,KAAK1J,cAAcI,GAClD,OAAKA,EAKEmP,GAAW7wB,KAAMmrB,EAAQzJ,IAJ9B1hB,KAAKggB,UAAY0B,EACjB1hB,KAAKgrB,KAAOG,EACLnrB,KAGX,EAGF,IAAIuwB,GAAkBT,GAAOlwB,UAkB7B,SAASixB,GAAWC,EAAYtlB,EAAKkW,GACnC,IAAIqP,EAASzxB,OAAOmP,OAAOnP,OAAO0xB,eAAeF,IAGjD,OAFAC,EAAO/F,KAAOxf,EACdulB,EAAO/Q,UAAY0B,EACZqP,CACT,CAEA,SAASL,GAAWK,GAClB,OAAOA,EAAOV,OAASU,EAAOriB,YAAYshB,MAAQ,QACpD,CAEA,SAASG,GAASvwB,EAAWqxB,GAC3B,IACEA,EAAM5pB,QAAQ6pB,GAAQC,UAAKzoB,EAAW9I,GACxC,CAAE,MAAO0b,GAET,CACF,CAEA,SAAS4V,GAAQtxB,EAAWowB,GAC1B1wB,OAAOif,eAAe3e,EAAWowB,EAAM,CACrCnlB,IAAK,WACH,OAAO7K,KAAK6K,IAAImlB,EAClB,EACAlhB,IAAK,SAASsC,GACZgK,GAAUpb,KAAKggB,UAAW,sCAC1BhgB,KAAK8O,IAAIkhB,EAAM5e,EACjB,GAEJ,CAME,SAAShK,GAAIgK,GACX,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsBggB,KAC7CC,GAAMjgB,KAAWmB,EAAUnB,GAASA,EACpCggB,KAAWpS,eAAc,SAASlQ,GAChC,IAAIgF,EAAOjC,EAAYT,GACvByN,GAAkB/K,EAAK3H,MACvB2H,EAAKzM,SAAQ,SAASkO,GAAK,OAAOzG,EAAItH,IAAI+N,EAAE,GAC9C,GACJ,CA6HF,SAAS8b,GAAMC,GACb,SAAUA,IAAYA,EAASC,IACjC,CA3LAhB,GAAgB3d,GAAU2d,GAAgB/Q,OAC1C+Q,GAAgB9Q,SAChB8Q,GAAgB9K,SAAW5D,GAAa4D,SACxC8K,GAAgBltB,MAAQwe,GAAaxe,MACrCktB,GAAgBpQ,UAAY0B,GAAa1B,UACzCoQ,GAAgBlQ,QAAUwB,GAAaxB,QACvCkQ,GAAgB/P,UAAYqB,GAAarB,UACzC+P,GAAgB7P,cAAgBmB,GAAanB,cAC7C6P,GAAgB3P,YAAciB,GAAajB,YAC3C2P,GAAgBlR,MAAQwC,GAAaxC,MACrCkR,GAAgB7Q,OAASmC,GAAanC,OACtC6Q,GAAgBhR,SAAWsC,GAAatC,SACxCgR,GAAgBvR,cAAgB6C,GAAa7C,cAC7CuR,GAAgBnP,UAAYS,GAAaT,UACzCmP,GAAgBhP,YAAcM,GAAaN,YAkC3CtQ,EAAY7J,GAAK+U,IAcf/U,GAAI+P,GAAK,WACP,OAAOnX,KAAKZ,UACd,EAEAgI,GAAIoqB,SAAW,SAASpgB,GACtB,OAAOpR,KAAKuR,EAAcH,GAAOqgB,SACnC,EAEArqB,GAAIxH,UAAUiX,SAAW,WACvB,OAAO7W,KAAKoX,WAAW,QAAS,IAClC,EAIAhQ,GAAIxH,UAAUoC,IAAM,SAASoP,GAC3B,OAAOpR,KAAKgrB,KAAKhpB,IAAIoP,EACvB,EAIAhK,GAAIxH,UAAU4H,IAAM,SAAS4J,GAC3B,OAAOsgB,GAAU1xB,KAAMA,KAAKgrB,KAAKlc,IAAIsC,GAAO,GAC9C,EAEAhK,GAAIxH,UAAU4f,OAAS,SAASpO,GAC9B,OAAOsgB,GAAU1xB,KAAMA,KAAKgrB,KAAKxL,OAAOpO,GAC1C,EAEAhK,GAAIxH,UAAUmgB,MAAQ,WACpB,OAAO2R,GAAU1xB,KAAMA,KAAKgrB,KAAKjL,QACnC,EAIA3Y,GAAIxH,UAAU+xB,MAAQ,WAAY,IAAIrR,EAAQtP,EAAQlR,KAAKV,UAAW,GAEpE,OAAqB,KADrBkhB,EAAQA,EAAMpe,QAAO,SAASsiB,GAAK,OAAkB,IAAXA,EAAErY,IAAU,KAC5ChN,OACDa,KAES,IAAdA,KAAKmM,MAAenM,KAAKggB,WAA8B,IAAjBM,EAAMnhB,OAGzCa,KAAKgf,eAAc,SAASlQ,GACjC,IAAK,IAAI8E,EAAK,EAAGA,EAAK0M,EAAMnhB,OAAQyU,IAClC/B,EAAYyO,EAAM1M,IAAKvM,SAAQ,SAAS+J,GAAS,OAAOtC,EAAItH,IAAI4J,EAAM,GAE1E,IANSpR,KAAK0O,YAAY4R,EAAM,GAOlC,EAEAlZ,GAAIxH,UAAUgyB,UAAY,WAAY,IAAItR,EAAQtP,EAAQlR,KAAKV,UAAW,GACxE,GAAqB,IAAjBkhB,EAAMnhB,OACR,OAAOa,KAETsgB,EAAQA,EAAM9U,KAAI,SAASsI,GAAQ,OAAOjC,EAAYiC,EAAK,IAC3D,IAAI+d,EAAc7xB,KAClB,OAAOA,KAAKgf,eAAc,SAASlQ,GACjC+iB,EAAYxqB,SAAQ,SAAS+J,GACtBkP,EAAM3F,OAAM,SAAS7G,GAAQ,OAAOA,EAAKyI,SAASnL,EAAM,KAC3DtC,EAAI0Q,OAAOpO,EAEf,GACF,GACF,EAEAhK,GAAIxH,UAAUkyB,SAAW,WAAY,IAAIxR,EAAQtP,EAAQlR,KAAKV,UAAW,GACvE,GAAqB,IAAjBkhB,EAAMnhB,OACR,OAAOa,KAETsgB,EAAQA,EAAM9U,KAAI,SAASsI,GAAQ,OAAOjC,EAAYiC,EAAK,IAC3D,IAAI+d,EAAc7xB,KAClB,OAAOA,KAAKgf,eAAc,SAASlQ,GACjC+iB,EAAYxqB,SAAQ,SAAS+J,GACvBkP,EAAMvY,MAAK,SAAS+L,GAAQ,OAAOA,EAAKyI,SAASnL,EAAM,KACzDtC,EAAI0Q,OAAOpO,EAEf,GACF,GACF,EAEAhK,GAAIxH,UAAUyD,MAAQ,WACpB,OAAOrD,KAAK2xB,MAAM5xB,MAAMC,KAAMZ,UAChC,EAEAgI,GAAIxH,UAAUugB,UAAY,SAASC,GAAS,IAAIE,EAAQtP,EAAQlR,KAAKV,UAAW,GAC9E,OAAOY,KAAK2xB,MAAM5xB,MAAMC,KAAMsgB,EAChC,EAEAlZ,GAAIxH,UAAUihB,KAAO,SAASC,GAE5B,OAAOiR,GAAW/Q,GAAYhhB,KAAM8gB,GACtC,EAEA1Z,GAAIxH,UAAUqhB,OAAS,SAASC,EAAQJ,GAEtC,OAAOiR,GAAW/Q,GAAYhhB,KAAM8gB,EAAYI,GAClD,EAEA9Z,GAAIxH,UAAUyhB,WAAa,WACzB,OAAOrhB,KAAKgrB,KAAK3J,YACnB,EAEAja,GAAIxH,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KAC5D,OAAOA,KAAKgrB,KAAKjX,WAAU,SAAS8G,EAAGvF,GAAK,OAAOtN,EAAGsN,EAAGA,EAAGoH,EAAO,GAAGjF,EACxE,EAEArQ,GAAIxH,UAAU+X,WAAa,SAASzW,EAAMuW,GACxC,OAAOzX,KAAKgrB,KAAKxf,KAAI,SAASqP,EAAGvF,GAAK,OAAOA,CAAC,IAAGqC,WAAWzW,EAAMuW,EACpE,EAEArQ,GAAIxH,UAAU0hB,cAAgB,SAASI,GACrC,GAAIA,IAAY1hB,KAAKggB,UACnB,OAAOhgB,KAET,IAAImrB,EAASnrB,KAAKgrB,KAAK1J,cAAcI,GACrC,OAAKA,EAKE1hB,KAAKgyB,OAAO7G,EAAQzJ,IAJzB1hB,KAAKggB,UAAY0B,EACjB1hB,KAAKgrB,KAAOG,EACLnrB,KAGX,EAOFoH,GAAIiqB,MAAQA,GAEZ,IAiCIY,GAjCAV,GAAkB,wBAElBW,GAAe9qB,GAAIxH,UAYvB,SAAS8xB,GAAU5iB,EAAKqc,GACtB,OAAIrc,EAAIkR,WACNlR,EAAI3C,KAAOgf,EAAOhf,KAClB2C,EAAIkc,KAAOG,EACJrc,GAEFqc,IAAWrc,EAAIkc,KAAOlc,EACX,IAAhBqc,EAAOhf,KAAa2C,EAAIqjB,UACxBrjB,EAAIkjB,OAAO7G,EACf,CAEA,SAASiH,GAAQ5mB,EAAKkW,GACpB,IAAI5S,EAAMxP,OAAOmP,OAAOyjB,IAIxB,OAHApjB,EAAI3C,KAAOX,EAAMA,EAAIW,KAAO,EAC5B2C,EAAIkc,KAAOxf,EACXsD,EAAIkR,UAAY0B,EACT5S,CACT,CAGA,SAASsiB,KACP,OAAOa,KAAcA,GAAYG,GAAQtT,MAC3C,CAME,SAASiT,GAAW3gB,GAClB,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsBihB,KAC7CC,GAAalhB,GAASA,EACtBihB,KAAkBrT,eAAc,SAASlQ,GACvC,IAAIgF,EAAOjC,EAAYT,GACvByN,GAAkB/K,EAAK3H,MACvB2H,EAAKzM,SAAQ,SAASkO,GAAK,OAAOzG,EAAItH,IAAI+N,EAAE,GAC9C,GACJ,CAeF,SAAS+c,GAAaC,GACpB,OAAOlB,GAAMkB,IAAoBhgB,EAAUggB,EAC7C,CAhEAL,GAAaX,KAAmB,EAChCW,GAAatf,GAAUsf,GAAa1S,OACpC0S,GAAa1R,UAAY0R,GAAa7uB,MACtC6uB,GAAaxR,cAAgBwR,GAAa/R,UAC1C+R,GAAalT,cAAgB6C,GAAa7C,cAC1CkT,GAAa9Q,UAAYS,GAAaT,UACtC8Q,GAAa3Q,YAAcM,GAAaN,YAExC2Q,GAAaC,QAAUf,GACvBc,GAAaF,OAASI,GA0BtBnhB,EAAY8gB,GAAY3qB,IActB2qB,GAAW5a,GAAK,WACd,OAAOnX,KAAKZ,UACd,EAEA2yB,GAAWP,SAAW,SAASpgB,GAC7B,OAAOpR,KAAKuR,EAAcH,GAAOqgB,SACnC,EAEAM,GAAWnyB,UAAUiX,SAAW,WAC9B,OAAO7W,KAAKoX,WAAW,eAAgB,IACzC,EAOF2a,GAAWO,aAAeA,GAE1B,IAcIE,GAdAC,GAAsBV,GAAWnyB,UAMrC,SAAS8yB,GAAelnB,EAAKkW,GAC3B,IAAI5S,EAAMxP,OAAOmP,OAAOgkB,IAIxB,OAHA3jB,EAAI3C,KAAOX,EAAMA,EAAIW,KAAO,EAC5B2C,EAAIkc,KAAOxf,EACXsD,EAAIkR,UAAY0B,EACT5S,CACT,CAGA,SAASujB,KACP,OAAOG,KAAsBA,GAAoBE,GAAe/H,MAClE,CAME,SAASgI,GAAMvhB,GACb,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsBwhB,KAC7CC,GAAQzhB,GAASA,EACjBwhB,KAAaE,WAAW1hB,EAC5B,CAiLF,SAASyhB,GAAQE,GACf,SAAUA,IAAcA,EAAWC,IACrC,CA7MAP,GAAoBhgB,IAAuB,EAE3CggB,GAAoBN,QAAUE,GAC9BI,GAAoBT,OAASU,GAe7BzhB,EAAY0hB,GAAOzW,IAUjByW,GAAMxb,GAAK,WACT,OAAOnX,KAAKZ,UACd,EAEAuzB,GAAM/yB,UAAUiX,SAAW,WACzB,OAAO7W,KAAKoX,WAAW,UAAW,IACpC,EAIAub,GAAM/yB,UAAUiL,IAAM,SAASF,EAAOyR,GACpC,IAAI6W,EAAOjzB,KAAKkzB,MAEhB,IADAvoB,EAAQsJ,EAAUjU,KAAM2K,GACjBsoB,GAAQtoB,KACbsoB,EAAOA,EAAK/jB,KAEd,OAAO+jB,EAAOA,EAAK7hB,MAAQgL,CAC7B,EAEAuW,GAAM/yB,UAAUuzB,KAAO,WACrB,OAAOnzB,KAAKkzB,OAASlzB,KAAKkzB,MAAM9hB,KAClC,EAIAuhB,GAAM/yB,UAAUmE,KAAO,WACrB,GAAyB,IAArB3E,UAAUD,OACZ,OAAOa,KAIT,IAFA,IAAIgjB,EAAUhjB,KAAKmM,KAAO/M,UAAUD,OAChC8zB,EAAOjzB,KAAKkzB,MACPtf,EAAKxU,UAAUD,OAAS,EAAGyU,GAAM,EAAGA,IAC3Cqf,EAAO,CACL7hB,MAAOhS,UAAUwU,GACjB1E,KAAM+jB,GAGV,OAAIjzB,KAAKggB,WACPhgB,KAAKmM,KAAO6W,EACZhjB,KAAKkzB,MAAQD,EACbjzB,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEFozB,GAAUpQ,EAASiQ,EAC5B,EAEAN,GAAM/yB,UAAUyzB,QAAU,SAASvf,GAEjC,GAAkB,KADlBA,EAAOpC,EAAgBoC,IACd3H,KACP,OAAOnM,KAET6e,GAAkB/K,EAAK3H,MACvB,IAAI6W,EAAUhjB,KAAKmM,KACf8mB,EAAOjzB,KAAKkzB,MAQhB,OAPApf,EAAK2D,UAAUpQ,SAAQ,SAAS+J,GAC9B4R,IACAiQ,EAAO,CACL7hB,MAAOA,EACPlC,KAAM+jB,EAEV,IACIjzB,KAAKggB,WACPhgB,KAAKmM,KAAO6W,EACZhjB,KAAKkzB,MAAQD,EACbjzB,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEFozB,GAAUpQ,EAASiQ,EAC5B,EAEAN,GAAM/yB,UAAU4lB,IAAM,WACpB,OAAOxlB,KAAK8K,MAAM,EACpB,EAEA6nB,GAAM/yB,UAAUgoB,QAAU,WACxB,OAAO5nB,KAAK+D,KAAKhE,MAAMC,KAAMZ,UAC/B,EAEAuzB,GAAM/yB,UAAUkzB,WAAa,SAAShf,GACpC,OAAO9T,KAAKqzB,QAAQvf,EACtB,EAEA6e,GAAM/yB,UAAUwjB,MAAQ,WACtB,OAAOpjB,KAAKwlB,IAAIzlB,MAAMC,KAAMZ,UAC9B,EAEAuzB,GAAM/yB,UAAUmgB,MAAQ,WACtB,OAAkB,IAAd/f,KAAKmM,KACAnM,KAELA,KAAKggB,WACPhgB,KAAKmM,KAAO,EACZnM,KAAKkzB,WAAQxqB,EACb1I,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEF4yB,IACT,EAEAD,GAAM/yB,UAAUkL,MAAQ,SAASuJ,EAAOC,GACtC,GAAIF,EAAWC,EAAOC,EAAKtU,KAAKmM,MAC9B,OAAOnM,KAET,IAAImtB,EAAgB5Y,EAAaF,EAAOrU,KAAKmM,MAE7C,GADkBsI,EAAWH,EAAKtU,KAAKmM,QACnBnM,KAAKmM,KAEvB,OAAO+P,GAAkBtc,UAAUkL,MAAMhL,KAAKE,KAAMqU,EAAOC,GAI7D,IAFA,IAAI0O,EAAUhjB,KAAKmM,KAAOghB,EACtB8F,EAAOjzB,KAAKkzB,MACT/F,KACL8F,EAAOA,EAAK/jB,KAEd,OAAIlP,KAAKggB,WACPhgB,KAAKmM,KAAO6W,EACZhjB,KAAKkzB,MAAQD,EACbjzB,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEFozB,GAAUpQ,EAASiQ,EAC5B,EAIAN,GAAM/yB,UAAU0hB,cAAgB,SAASI,GACvC,OAAIA,IAAY1hB,KAAKggB,UACZhgB,KAEJ0hB,EAKE0R,GAAUpzB,KAAKmM,KAAMnM,KAAKkzB,MAAOxR,EAAS1hB,KAAKwa,SAJpDxa,KAAKggB,UAAY0B,EACjB1hB,KAAKigB,WAAY,EACVjgB,KAGX,EAIA2yB,GAAM/yB,UAAUmU,UAAY,SAAS/L,EAAIyP,GACvC,GAAIA,EACF,OAAOzX,KAAKyX,UAAU1D,UAAU/L,GAIlC,IAFA,IAAIqU,EAAa,EACboC,EAAOze,KAAKkzB,MACTzU,IACsC,IAAvCzW,EAAGyW,EAAKrN,MAAOiL,IAAcrc,OAGjCye,EAAOA,EAAKvP,KAEd,OAAOmN,CACT,EAEAsW,GAAM/yB,UAAU+X,WAAa,SAASzW,EAAMuW,GAC1C,GAAIA,EACF,OAAOzX,KAAKyX,UAAUE,WAAWzW,GAEnC,IAAImb,EAAa,EACboC,EAAOze,KAAKkzB,MAChB,OAAO,IAAI9d,GAAS,WAClB,GAAIqJ,EAAM,CACR,IAAIrN,EAAQqN,EAAKrN,MAEjB,OADAqN,EAAOA,EAAKvP,KACLmG,EAAcnU,EAAMmb,IAAcjL,EAC3C,CACA,OAAOsE,GACT,GACF,EAOFid,GAAME,QAAUA,GAEhB,IAoBIS,GApBAN,GAAoB,0BAEpBO,GAAiBZ,GAAM/yB,UAQ3B,SAASwzB,GAAUjnB,EAAM8mB,EAAMvR,EAASvE,GACtC,IAAI3R,EAAMlM,OAAOmP,OAAO8kB,IAMxB,OALA/nB,EAAIW,KAAOA,EACXX,EAAI0nB,MAAQD,EACZznB,EAAIwU,UAAY0B,EAChBlW,EAAIgP,OAAS2C,EACb3R,EAAIyU,WAAY,EACTzU,CACT,CAGA,SAASonB,KACP,OAAOU,KAAgBA,GAAcF,GAAU,GACjD,CAKA,SAASI,GAAMtiB,EAAMuiB,GACnB,IAAIC,EAAY,SAAS/zB,GAAQuR,EAAKtR,UAAUD,GAAO8zB,EAAQ9zB,EAAM,EAIrE,OAHAL,OAAO6G,KAAKstB,GAASpsB,QAAQqsB,GAC7Bp0B,OAAOq0B,uBACLr0B,OAAOq0B,sBAAsBF,GAASpsB,QAAQqsB,GACzCxiB,CACT,CA/BAqiB,GAAeP,KAAqB,EACpCO,GAAevU,cAAgB6C,GAAa7C,cAC5CuU,GAAenS,UAAYS,GAAaT,UACxCmS,GAAehS,YAAcM,GAAaN,YAC1CgS,GAAelS,WAAaQ,GAAaR,WA6BzClQ,EAASiE,SAAWA,EAEpBoe,GAAMriB,EAAU,CAIdqG,QAAS,WACPqH,GAAkB7e,KAAKmM,MACvB,IAAIgM,EAAQ,IAAIlZ,MAAMe,KAAKmM,MAAQ,GAEnC,OADAnM,KAAKwwB,WAAWzc,WAAU,SAASwB,EAAG9V,GAAM0Y,EAAM1Y,GAAK8V,CAAG,IACnD4C,CACT,EAEAzB,aAAc,WACZ,OAAO,IAAIgV,GAAkB1rB,KAC/B,EAEA0L,KAAM,WACJ,OAAO1L,KAAKoW,QAAQ5K,KAClB,SAAS4F,GAAS,OAAOA,GAA+B,oBAAfA,EAAM1F,KAAsB0F,EAAM1F,OAAS0F,CAAK,IACzFwiB,QACJ,EAEAC,OAAQ,WACN,OAAO7zB,KAAKoW,QAAQ5K,KAClB,SAAS4F,GAAS,OAAOA,GAAiC,oBAAjBA,EAAMyiB,OAAwBziB,EAAMyiB,SAAWziB,CAAK,IAC7FwiB,QACJ,EAEAtd,WAAY,WACV,OAAO,IAAIgV,GAAgBtrB,MAAM,EACnC,EAEA+Z,MAAO,WAEL,OAAOhM,GAAI/N,KAAKsW,aAClB,EAEAwd,SAAU,WACRjV,GAAkB7e,KAAKmM,MACvB,IAAImM,EAAS,CAAC,EAEd,OADAtY,KAAK+T,WAAU,SAASwB,EAAGD,GAAMgD,EAAOhD,GAAKC,CAAG,IACzC+C,CACT,EAEAyb,aAAc,WAEZ,OAAOhT,GAAW/gB,KAAKsW,aACzB,EAEA0d,aAAc,WAEZ,OAAOjC,GAAWvgB,EAAQxR,MAAQA,KAAKwwB,WAAaxwB,KACtD,EAEAi0B,MAAO,WAEL,OAAO7sB,GAAIoK,EAAQxR,MAAQA,KAAKwwB,WAAaxwB,KAC/C,EAEA4W,SAAU,WACR,OAAO,IAAI+U,GAAc3rB,KAC3B,EAEAoW,MAAO,WACL,OAAOzE,EAAU3R,MAAQA,KAAK0W,eAC5BlF,EAAQxR,MAAQA,KAAKsW,aACrBtW,KAAK4W,UACT,EAEAsd,QAAS,WAEP,OAAOvB,GAAMnhB,EAAQxR,MAAQA,KAAKwwB,WAAaxwB,KACjD,EAEA8Z,OAAQ,WAEN,OAAO3O,GAAKqG,EAAQxR,MAAQA,KAAKwwB,WAAaxwB,KAChD,EAKA6W,SAAU,WACR,MAAO,YACT,EAEAO,WAAY,SAAS6b,EAAMhK,GACzB,OAAkB,IAAdjpB,KAAKmM,KACA8mB,EAAOhK,EAETgK,EAAO,IAAMjzB,KAAKoW,QAAQ5K,IAAIxL,KAAKm0B,kBAAkBhrB,KAAK,MAAQ,IAAM8f,CACjF,EAKAhhB,OAAQ,WACN,OAAO+kB,GAAMhtB,KAAMguB,GAAchuB,KADFgR,EAAQlR,KAAKV,UAAW,IAEzD,EAEAmd,SAAU,SAASC,GACjB,OAAOxc,KAAK+H,MAAK,SAASqJ,GAAS,OAAO4I,GAAG5I,EAAOoL,EAAY,GAClE,EAEA9B,QAAS,WACP,OAAO1a,KAAK2X,WAAW7C,EACzB,EAEA6F,MAAO,SAAS4R,EAAWJ,GACzBtN,GAAkB7e,KAAKmM,MACvB,IAAIioB,GAAc,EAOlB,OANAp0B,KAAK+T,WAAU,SAASwB,EAAGD,EAAG0H,GAC5B,IAAKuP,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,GAEjC,OADAoX,GAAc,GACP,CAEX,IACOA,CACT,EAEAlyB,OAAQ,SAASqqB,EAAWJ,GAC1B,OAAOa,GAAMhtB,KAAMssB,GAActsB,KAAMusB,EAAWJ,GAAS,GAC7D,EAEAkI,KAAM,SAAS9H,EAAWJ,EAAS/P,GACjC,IAAI/C,EAAQrZ,KAAKs0B,UAAU/H,EAAWJ,GACtC,OAAO9S,EAAQA,EAAM,GAAK+C,CAC5B,EAEAkY,UAAW,SAAS/H,EAAWJ,GAC7B,IAAIoI,EAOJ,OANAv0B,KAAK+T,WAAU,SAASwB,EAAGD,EAAG0H,GAC5B,GAAIuP,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,GAEhC,OADAuX,EAAQ,CAACjf,EAAGC,IACL,CAEX,IACOgf,CACT,EAEAC,cAAe,SAASjI,EAAWJ,GACjC,OAAOnsB,KAAKoW,QAAQqB,UAAU6c,UAAU/H,EAAWJ,EACrD,EAEA9kB,QAAS,SAASotB,EAAYtI,GAE5B,OADAtN,GAAkB7e,KAAKmM,MAChBnM,KAAK+T,UAAUoY,EAAUsI,EAAWtD,KAAKhF,GAAWsI,EAC7D,EAEAtrB,KAAM,SAAS2lB,GACbjQ,GAAkB7e,KAAKmM,MACvB2iB,OAA0BpmB,IAAdomB,EAA0B,GAAKA,EAAY,IACvD,IAAI4F,EAAS,GACTC,GAAU,EAKd,OAJA30B,KAAK+T,WAAU,SAASwB,GACtBof,EAAWA,GAAU,EAAUD,GAAU5F,EACzC4F,GAAgB,OAANnf,QAAoB7M,IAAN6M,EAAkBA,EAAEsB,WAAa,EAC3D,IACO6d,CACT,EAEAvuB,KAAM,WACJ,OAAOnG,KAAK2X,WAAW/C,EACzB,EAEApJ,IAAK,SAAS0V,EAAQiL,GACpB,OAAOa,GAAMhtB,KAAMksB,GAAWlsB,KAAMkhB,EAAQiL,GAC9C,EAEAzoB,OAAQ,SAASkxB,EAASC,EAAkB1I,GAE1C,IAAI2I,EACAC,EAcJ,OAhBAlW,GAAkB7e,KAAKmM,MAGnB/M,UAAUD,OAAS,EACrB41B,GAAW,EAEXD,EAAYD,EAEd70B,KAAK+T,WAAU,SAASwB,EAAGD,EAAG0H,GACxB+X,GACFA,GAAW,EACXD,EAAYvf,GAEZuf,EAAYF,EAAQ90B,KAAKqsB,EAAS2I,EAAWvf,EAAGD,EAAG0H,EAEvD,IACO8X,CACT,EAEAE,YAAa,SAASJ,EAASC,EAAkB1I,GAC/C,IAAI8I,EAAWj1B,KAAKsW,aAAamB,UACjC,OAAOwd,EAASvxB,OAAO3D,MAAMk1B,EAAU71B,UACzC,EAEAqY,QAAS,WACP,OAAOuV,GAAMhtB,KAAMqsB,GAAersB,MAAM,GAC1C,EAEA8K,MAAO,SAASuJ,EAAOC,GACrB,OAAO0Y,GAAMhtB,KAAMitB,GAAajtB,KAAMqU,EAAOC,GAAK,GACpD,EAEAvM,KAAM,SAASwkB,EAAWJ,GACxB,OAAQnsB,KAAK2a,MAAMua,GAAI3I,GAAYJ,EACrC,EAEAtL,KAAM,SAASC,GACb,OAAOkM,GAAMhtB,KAAMghB,GAAYhhB,KAAM8gB,GACvC,EAEA2G,OAAQ,WACN,OAAOznB,KAAK2X,WAAW9C,EACzB,EAKAsgB,QAAS,WACP,OAAOn1B,KAAK8K,MAAM,GAAI,EACxB,EAEAsqB,QAAS,WACP,YAAqB1sB,IAAd1I,KAAKmM,KAAmC,IAAdnM,KAAKmM,MAAcnM,KAAK+H,MAAK,WAAa,OAAO,CAAI,GACxF,EAEAoa,MAAO,SAASoK,EAAWJ,GACzB,OAAOtY,EACL0Y,EAAYvsB,KAAKoW,QAAQlU,OAAOqqB,EAAWJ,GAAWnsB,KAE1D,EAEAq1B,QAAS,SAAS3I,EAASP,GACzB,OAAOM,GAAezsB,KAAM0sB,EAASP,EACvC,EAEA/R,OAAQ,SAASuC,GACf,OAAOtC,GAAUra,KAAM2c,EACzB,EAEAlG,SAAU,WACR,IAAIT,EAAWhW,KACf,GAAIgW,EAASsB,OAEX,OAAO,IAAIY,GAASlC,EAASsB,QAE/B,IAAIge,EAAkBtf,EAASI,QAAQ5K,IAAI+pB,IAAa7e,eAExD,OADA4e,EAAgB/e,aAAe,WAAa,OAAOP,EAASI,OAAO,EAC5Dkf,CACT,EAEAE,UAAW,SAASjJ,EAAWJ,GAC7B,OAAOnsB,KAAKkC,OAAOgzB,GAAI3I,GAAYJ,EACrC,EAEAsJ,SAAU,SAASlJ,EAAWJ,EAAS/P,GACrC,OAAOpc,KAAKsW,aAAamB,UAAU4c,KAAK9H,EAAWJ,EAAS/P,EAC9D,EAEAsZ,MAAO,WACL,OAAO11B,KAAKq0B,KAAKrgB,EACnB,EAEA5I,QAAS,SAAS8V,EAAQiL,GACxB,OAAOa,GAAMhtB,KAAM4uB,GAAe5uB,KAAMkhB,EAAQiL,GAClD,EAEAiC,QAAS,SAASG,GAChB,OAAOvB,GAAMhtB,KAAMsuB,GAAetuB,KAAMuuB,GAAO,GACjD,EAEAhY,aAAc,WACZ,OAAO,IAAIqV,GAAoB5rB,KACjC,EAEA6K,IAAK,SAAS8qB,EAAWvZ,GACvB,OAAOpc,KAAKq0B,MAAK,SAASxZ,EAAGlb,GAAO,OAAOqa,GAAGra,EAAKg2B,EAAU,QAAGjtB,EAAW0T,EAC7E,EAEAwZ,MAAO,SAASC,EAAezZ,GAM7B,IALA,IAIIV,EAJAoa,EAAS91B,KAGT8T,EAAOgM,GAAc+V,KAEhBna,EAAO5H,EAAK5E,QAAQuG,MAAM,CACjC,IAAI9V,EAAM+b,EAAKtK,MAEf,IADA0kB,EAASA,GAAUA,EAAOjrB,IAAMirB,EAAOjrB,IAAIlL,EAAKqT,GAAWA,KAC5CA,EACb,OAAOoJ,CAEX,CACA,OAAO0Z,CACT,EAEAC,QAAS,SAASrJ,EAASP,GACzB,OAAOS,GAAe5sB,KAAM0sB,EAASP,EACvC,EAEAnqB,IAAK,SAAS2zB,GACZ,OAAO31B,KAAK6K,IAAI8qB,EAAW3iB,KAAaA,CAC1C,EAEAgjB,MAAO,SAASH,GACd,OAAO71B,KAAK41B,MAAMC,EAAe7iB,KAAaA,CAChD,EAEAijB,SAAU,SAASniB,GAEjB,OADAA,EAAgC,oBAAlBA,EAAKyI,SAA0BzI,EAAO3C,EAAS2C,GACtD9T,KAAK2a,OAAM,SAASvJ,GAAS,OAAO0C,EAAKyI,SAASnL,EAAM,GACjE,EAEA8kB,WAAY,SAASpiB,GAEnB,OADAA,EAAgC,oBAAlBA,EAAKmiB,SAA0BniB,EAAO3C,EAAS2C,IACjDmiB,SAASj2B,KACvB,EAEAyxB,OAAQ,WACN,OAAOzxB,KAAKoW,QAAQ5K,IAAI2qB,IAAWzf,cACrC,EAEA7F,KAAM,WACJ,OAAO7Q,KAAKoW,QAAQqB,UAAUie,OAChC,EAEAhiB,IAAK,SAASoN,GACZ,OAAOmO,GAAWjvB,KAAM8gB,EAC1B,EAEAsV,MAAO,SAASlV,EAAQJ,GACtB,OAAOmO,GAAWjvB,KAAM8gB,EAAYI,EACtC,EAEAvM,IAAK,SAASmM,GACZ,OAAOmO,GAAWjvB,KAAM8gB,EAAauV,GAAIvV,GAAcwV,GACzD,EAEAC,MAAO,SAASrV,EAAQJ,GACtB,OAAOmO,GAAWjvB,KAAM8gB,EAAauV,GAAIvV,GAAcwV,GAAsBpV,EAC/E,EAEApY,KAAM,WACJ,OAAO9I,KAAK8K,MAAM,EACpB,EAEA0rB,KAAM,SAASC,GACb,OAAOz2B,KAAK8K,MAAM2I,KAAKC,IAAI,EAAG+iB,GAChC,EAEAC,SAAU,SAASD,GACjB,OAAOzJ,GAAMhtB,KAAMA,KAAKoW,QAAQqB,UAAU+e,KAAKC,GAAQhf,UACzD,EAEAkf,UAAW,SAASpK,EAAWJ,GAC7B,OAAOa,GAAMhtB,KAAM6tB,GAAiB7tB,KAAMusB,EAAWJ,GAAS,GAChE,EAEAyK,UAAW,SAASrK,EAAWJ,GAC7B,OAAOnsB,KAAK22B,UAAUzB,GAAI3I,GAAYJ,EACxC,EAEAlL,OAAQ,SAASC,EAAQJ,GACvB,OAAOkM,GAAMhtB,KAAMghB,GAAYhhB,KAAM8gB,EAAYI,GACnD,EAEA2V,KAAM,SAASJ,GACb,OAAOz2B,KAAK8K,MAAM,EAAG2I,KAAKC,IAAI,EAAG+iB,GACnC,EAEAK,SAAU,SAASL,GACjB,OAAOzJ,GAAMhtB,KAAMA,KAAKoW,QAAQqB,UAAUof,KAAKJ,GAAQhf,UACzD,EAEAsf,UAAW,SAASxK,EAAWJ,GAC7B,OAAOa,GAAMhtB,KAAM0tB,GAAiB1tB,KAAMusB,EAAWJ,GACvD,EAEA6K,UAAW,SAASzK,EAAWJ,GAC7B,OAAOnsB,KAAK+2B,UAAU7B,GAAI3I,GAAYJ,EACxC,EAEAqE,SAAU,WACR,OAAOxwB,KAAK0W,cACd,EAKA8G,SAAU,WACR,OAAOxd,KAAKwa,SAAWxa,KAAKwa,OAASyc,GAAaj3B,MACpD,IAeF,IAAIk3B,GAAoB/lB,EAASvR,UACjCs3B,GAAkBjlB,IAAwB,EAC1CilB,GAAkB/hB,GAAmB+hB,GAAkBzP,OACvDyP,GAAkBtD,OAASsD,GAAkB1f,QAC7C0f,GAAkB/C,iBAAmBgD,GACrCD,GAAkBjgB,QAClBigB,GAAkBhgB,SAAW,WAAa,OAAOlX,KAAK6W,UAAY,EAClEqgB,GAAkBE,MAAQF,GAAkB9rB,QAC5C8rB,GAAkBG,SAAWH,GAAkB3a,SAG/C,WACE,IACEjd,OAAOif,eAAe2Y,GAAmB,SAAU,CACjDrsB,IAAK,WACH,IAAKsG,EAASmmB,gBAAiB,CAC7B,IAAIhR,EACJ,IACE,MAAM,IAAI/K,KACZ,CAAE,MAAOD,GACPgL,EAAQhL,EAAMgL,KAChB,CACA,IAAsC,IAAlCA,EAAMlgB,QAAQ,eAOhB,OANAmxB,SAAWA,QAAQC,MAAQD,QAAQC,KACjC,4IAGAlR,GAEKtmB,KAAKmM,IAEhB,CACF,GAEJ,CAAE,MAAOtN,GAAI,CACd,CAxBD,GA4BA20B,GAAMjiB,EAAe,CAInB8Z,KAAM,WACJ,OAAO2B,GAAMhtB,KAAM6rB,GAAY7rB,MACjC,EAEAy3B,QAAS,SAASlL,EAAWJ,GAC3B,IAAI9S,EAAQrZ,KAAKs0B,UAAU/H,EAAWJ,GACtC,OAAO9S,GAASA,EAAM,EACxB,EAEAqe,YAAa,SAASnL,EAAWJ,GAC/B,OAAOnsB,KAAKoW,QAAQqB,UAAUggB,QAAQlL,EAAWJ,EACnD,EAEAwL,MAAO,SAASnb,GACd,OAAOxc,KAAKy3B,SAAQ,SAASrmB,GAAS,OAAO4I,GAAG5I,EAAOoL,EAAY,GACrE,EAEAob,UAAW,SAASpb,GAClB,OAAOxc,KAAK03B,aAAY,SAAStmB,GAAS,OAAO4I,GAAG5I,EAAOoL,EAAY,GACzE,EAEAqb,WAAY,SAAS3W,EAAQiL,GAAU,IAAIzP,EAAS1c,KAC9Cqc,EAAa,EACjB,OAAO2Q,GAAMhtB,KACXA,KAAKoW,QAAQ5K,KACX,SAAS+J,EAAGD,GAAK,OAAO4L,EAAOphB,KAAKqsB,EAAS,CAAC7W,EAAGC,GAAI8G,IAAcK,EAAO,IAC1EnG,eAEN,EAEAuhB,QAAS,SAAS5W,EAAQiL,GAAU,IAAIzP,EAAS1c,KAC/C,OAAOgtB,GAAMhtB,KACXA,KAAKoW,QAAQiV,OAAO7f,KAClB,SAAS8J,EAAGC,GAAK,OAAO2L,EAAOphB,KAAKqsB,EAAS7W,EAAGC,EAAGmH,EAAO,IAC1D2O,OAEN,IAIF,IAAI0M,GAAyBxmB,EAAc3R,UAiL3C,SAASu2B,GAAU5gB,EAAGD,GACpB,OAAOA,CACT,CAEA,SAASigB,GAAYhgB,EAAGD,GACtB,MAAO,CAACA,EAAGC,EACb,CAEA,SAAS2f,GAAI3I,GACX,OAAO,WACL,OAAQA,EAAUxsB,MAAMC,KAAMZ,UAChC,CACF,CAEA,SAASi3B,GAAI9J,GACX,OAAO,WACL,OAAQA,EAAUxsB,MAAMC,KAAMZ,UAChC,CACF,CAEA,SAAS+3B,GAAY/lB,GACnB,MAAwB,kBAAVA,EAAqB4mB,KAAKC,UAAU7mB,GAASA,CAC7D,CAEA,SAAS8mB,KACP,OAAO5kB,EAAQlU,UACjB,CAEA,SAASk3B,GAAqBhc,EAAGC,GAC/B,OAAOD,EAAIC,EAAI,EAAID,EAAIC,GAAK,EAAI,CAClC,CAEA,SAAS0c,GAAajhB,GACpB,GAAIA,EAAS7J,OAASgP,IACpB,OAAO,EAET,IAAIgd,EAAU5lB,EAAUyD,GACpBoiB,EAAQ5mB,EAAQwE,GAChBoH,EAAI+a,EAAU,EAAI,EAUtB,OAAOE,GATIriB,EAASjC,UAClBqkB,EACED,EACE,SAAS5iB,EAAGD,GAAM8H,EAAI,GAAKA,EAAIkb,GAAUnb,GAAK5H,GAAI4H,GAAK7H,IAAM,CAAG,EAChE,SAASC,EAAGD,GAAM8H,EAAIA,EAAIkb,GAAUnb,GAAK5H,GAAI4H,GAAK7H,IAAM,CAAG,EAC7D6iB,EACE,SAAS5iB,GAAM6H,EAAI,GAAKA,EAAID,GAAK5H,GAAK,CAAG,EACzC,SAASA,GAAM6H,EAAIA,EAAID,GAAK5H,GAAK,CAAG,GAEZ6H,EAChC,CAEA,SAASib,GAAiBlsB,EAAMiR,GAQ9B,OAPAA,EAAIL,GAAKK,EAAG,YACZA,EAAIL,GAAKK,GAAK,GAAKA,KAAO,GAAI,WAC9BA,EAAIL,GAAKK,GAAK,GAAKA,KAAO,GAAI,GAE9BA,EAAIL,IADJK,EAAKA,EAAI,WAAkBjR,GACdiR,IAAM,GAAI,YAEvBA,EAAIH,IADJG,EAAIL,GAAKK,EAAIA,IAAM,GAAI,aACXA,IAAM,GAEpB,CAEA,SAASkb,GAAUhe,EAAGC,GACpB,OAAOD,EAAIC,EAAI,YAAcD,GAAK,IAAMA,GAAK,EAC/C,CAwBA,OAxQAyd,GAAuB5lB,IAAqB,EAC5C4lB,GAAuB5iB,GAAmB+hB,GAAkBxc,QAC5Dqd,GAAuBnE,OAASsD,GAAkBpD,SAClDiE,GAAuB5D,iBAAmB,SAAS5e,EAAGD,GAAK,OAAO0iB,KAAKC,UAAU3iB,GAAK,KAAO6hB,GAAY5hB,EAAE,EAI3Gie,GAAM9hB,EAAiB,CAIrB4E,WAAY,WACV,OAAO,IAAIgV,GAAgBtrB,MAAM,EACnC,EAKAkC,OAAQ,SAASqqB,EAAWJ,GAC1B,OAAOa,GAAMhtB,KAAMssB,GAActsB,KAAMusB,EAAWJ,GAAS,GAC7D,EAEAoM,UAAW,SAAShM,EAAWJ,GAC7B,IAAI9S,EAAQrZ,KAAKs0B,UAAU/H,EAAWJ,GACtC,OAAO9S,EAAQA,EAAM,IAAM,CAC7B,EAEAjT,QAAS,SAASoW,GAChB,IAAI7c,EAAMK,KAAKsW,aAAaqhB,MAAMnb,GAClC,YAAe9T,IAAR/I,GAAqB,EAAIA,CAClC,EAEA8c,YAAa,SAASD,GACpB,IAAI7c,EAAMK,KAAKsW,aAAamB,UAAUkgB,MAAMnb,GAC5C,YAAe9T,IAAR/I,GAAqB,EAAIA,CAIlC,EAEA8X,QAAS,WACP,OAAOuV,GAAMhtB,KAAMqsB,GAAersB,MAAM,GAC1C,EAEA8K,MAAO,SAASuJ,EAAOC,GACrB,OAAO0Y,GAAMhtB,KAAMitB,GAAajtB,KAAMqU,EAAOC,GAAK,GACpD,EAEA8S,OAAQ,SAASzc,EAAO6tB,GACtB,IAAIC,EAAUr5B,UAAUD,OAExB,GADAq5B,EAAY/kB,KAAKC,IAAgB,EAAZ8kB,EAAe,GACpB,IAAZC,GAA8B,IAAZA,IAAkBD,EACtC,OAAOx4B,KAKT2K,EAAQ4J,EAAa5J,EAAOA,EAAQ,EAAI3K,KAAKmiB,QAAUniB,KAAKmM,MAC5D,IAAIusB,EAAU14B,KAAK8K,MAAM,EAAGH,GAC5B,OAAOqiB,GACLhtB,KACY,IAAZy4B,EACEC,EACAA,EAAQzwB,OAAOqL,EAAQlU,UAAW,GAAIY,KAAK8K,MAAMH,EAAQ6tB,IAE/D,EAKAG,cAAe,SAASpM,EAAWJ,GACjC,IAAIxsB,EAAMK,KAAKsW,aAAaohB,YAAYnL,EAAWJ,GACnD,YAAezjB,IAAR/I,GAAqB,EAAIA,CAClC,EAEA+1B,MAAO,WACL,OAAO11B,KAAK6K,IAAI,EAClB,EAEAujB,QAAS,SAASG,GAChB,OAAOvB,GAAMhtB,KAAMsuB,GAAetuB,KAAMuuB,GAAO,GACjD,EAEA1jB,IAAK,SAASF,EAAOyR,GAEnB,OADAzR,EAAQsJ,EAAUjU,KAAM2K,IACR,GAAM3K,KAAKmM,OAASgP,UACjBzS,IAAd1I,KAAKmM,MAAsBxB,EAAQ3K,KAAKmM,KAC3CiQ,EACApc,KAAKq0B,MAAK,SAASxZ,EAAGlb,GAAO,OAAOA,IAAQgL,CAAK,QAAGjC,EAAW0T,EACnE,EAEApa,IAAK,SAAS2I,GAEZ,OADAA,EAAQsJ,EAAUjU,KAAM2K,KACR,SAAoBjC,IAAd1I,KAAKmM,KACzBnM,KAAKmM,OAASgP,KAAYxQ,EAAQ3K,KAAKmM,MACd,IAAzBnM,KAAKoG,QAAQuE,GAEjB,EAEAiuB,UAAW,SAAS9J,GAClB,OAAO9B,GAAMhtB,KAAM6uB,GAAiB7uB,KAAM8uB,GAC5C,EAEA+J,WAAY,WACV,IAAI1U,EAAY,CAACnkB,MAAMiI,OAAOqL,EAAQlU,YAClC05B,EAAS1J,GAAepvB,KAAKoW,QAASxE,EAAWuF,GAAIgN,GACrD4U,EAAcD,EAAO1K,SAAQ,GAIjC,OAHI0K,EAAO3sB,OACT4sB,EAAY5sB,KAAO2sB,EAAO3sB,KAAOgY,EAAUhlB,QAEtC6tB,GAAMhtB,KAAM+4B,EACrB,EAEAloB,KAAM,WACJ,OAAO7Q,KAAK6K,KAAK,EACnB,EAEA8rB,UAAW,SAASpK,EAAWJ,GAC7B,OAAOa,GAAMhtB,KAAM6tB,GAAiB7tB,KAAMusB,EAAWJ,GAAS,GAChE,EAEA6M,IAAK,WAEH,OAAOhM,GAAMhtB,KAAMovB,GAAepvB,KAAMk4B,GADxB,CAACl4B,MAAMiI,OAAOqL,EAAQlU,aAExC,EAEA65B,QAAS,SAAS3J,GAChB,IAAInL,EAAY7Q,EAAQlU,WAExB,OADA+kB,EAAU,GAAKnkB,KACRgtB,GAAMhtB,KAAMovB,GAAepvB,KAAMsvB,EAAQnL,GAClD,IAIFzS,EAAgB9R,UAAUyS,IAAuB,EACjDX,EAAgB9R,UAAU6S,IAAuB,EAIjD+gB,GAAM3hB,EAAa,CAIjBhH,IAAK,SAASuG,EAAOgL,GACnB,OAAOpc,KAAKgC,IAAIoP,GAASA,EAAQgL,CACnC,EAEAG,SAAU,SAASnL,GACjB,OAAOpR,KAAKgC,IAAIoP,EAClB,EAKAqgB,OAAQ,WACN,OAAOzxB,KAAKwwB,UACd,IAIF3e,EAAYjS,UAAUoC,IAAMk1B,GAAkB3a,SAK9CiX,GAAM/hB,EAAUF,EAAc3R,WAC9B4zB,GAAM5hB,EAAYF,EAAgB9R,WAClC4zB,GAAMzhB,EAAQF,EAAYjS,WAE1B4zB,GAAMvX,GAAiB1K,EAAc3R,WACrC4zB,GAAMtX,GAAmBxK,EAAgB9R,WACzC4zB,GAAMrX,GAAetK,EAAYjS,WAuEjB,CAEduR,SAAUA,EAEVG,IAAKA,EACL0K,WAAYA,GACZjO,IAAKA,GACLgT,WAAYA,GACZ5V,KAAMA,GACNwnB,MAAOA,GACPvrB,IAAKA,GACL2qB,WAAYA,GAEZjC,OAAQA,GACRtU,MAAOA,GACPR,OAAQA,GAERhB,GAAIA,GACJT,OAAQA,GAMZ,CA32JkF2f,E,qCCAlF,IAAIqjD,EAAiB,EAAQ,MAEzBC,EAAuB,EAAQ,OAE/BC,EAAgB,EAAQ,OAExBC,EAAc,IAAI3qB,OAAO,OAAQ,KAEjC4qB,EAAkB,CACpB,WAAY,EACZ,YAAa,GASf,SAASC,EAAwBhiD,GAC/B,GAAiB,QAAbA,EAAKiiD,KACP,OAAOjiD,EAAKkiD,WAEhB,CAEA,IAAIjzB,EAEJ,WAIE,SAASA,EAAarlB,GACpBxkC,KAAKwkC,KAAOA,EAEZxkC,KAAK6nE,MAAQrjC,EAAKqjC,MAAQ2U,EAAqBh4C,EAAKqjC,OAAS,EAC/D,CAQA,IAAI/9D,EAAS+/C,EAAajqD,UA8J1B,OA5JAkK,EAAOo9D,WAAa,WAKlB,SAAIlnE,KAAKsnE,YAAatnE,KAAKkK,aAMvBlK,KAAK+8E,WAIF/8E,KAAK6nE,MAAM9/D,MAAK,SAAU7G,GAC/B,OAAOy7E,EAAgBz7E,EACzB,GACF,EAQA4I,EAAOI,QAAU,WACf,IAAImG,EAUJ,OARIrQ,KAAKwkC,KAAKC,UACPzkC,KAAK6nE,MAAM1oE,QAEgC,GAArCa,KAAK6nE,MAAMzhE,QAAQ,gBAC5BiK,EAAOrQ,KAAKwkC,KAAKC,QAAQ,eAFzBp0B,EAAOrQ,KAAKwkC,KAAKC,QAAQ,SAMtBp0B,EAAOA,EAAK6wB,QAAQw7C,EA3EjB,MA2EyC,IACrD,EAQA5yE,EAAOw9D,QAAU,WACf,GAAItnE,KAAKwkC,KAAKC,QAAS,CACrB,IAAKzkC,KAAK6nE,MAAM1oE,OACd,OAAOa,KAAKwkC,KAAKC,QAAQ,QACpB,IAAwC,GAApCzkC,KAAK6nE,MAAMzhE,QAAQ,aAC5B,OAAOpG,KAAKwkC,KAAKC,QAAQ,YAE7B,CACF,EAQA36B,EAAOkzE,OAAS,WACd,OAAOh9E,KAAK6nE,MAAM9/D,MAAK,SAAU7G,GAC/B,OAA+B,GAAxBA,EAAKkF,QAAQ,SAAkD,GAAlClF,EAAKkF,QAAQ,kBAA0BlF,EAAKkF,QAAQ,iBAC1F,GACF,EAQA0D,EAAOmzE,QAAU,WACf,OAAIj9E,KAAKwkC,KAAKC,SACiC,GAAzCzkC,KAAK6nE,MAAMzhE,QAAQ,kBACXpG,KAAKwkC,KAAKC,QAAQ,kBAAkB/5B,MAAM,MACzC,IAGkC,GAAxC1K,KAAK6nE,MAAMzhE,QAAQ,iBAAyBpG,KAAKwkC,KAAKC,QAAQ,iBAAmBzkC,KAAKwkC,KAAKC,QAAQ,OAGrG,IACT,EAQA36B,EAAOizE,QAAU,WACf,IAAIA,EAAU/8E,KAAK6nE,MAAM9/D,MAAK,SAAU7G,GAGtC,OAAkD,GAA3CA,EAAKkF,QAAQ,yBACtB,IAEA,GAAI22E,EACF,OAAO,EAKT,IAFA,IAAIG,EAAQl9E,KAAK+qD,WAERtrD,EAAI,EAAGA,EAAIy9E,EAAM/9E,OAAQM,IAAK,CACrC,IAAIyB,EAAOg8E,EAAMz9E,GAAGyB,KAEpB,IAAKq7E,EAAeQ,QAAQ77E,GAC1B,OAAO,CAEX,CAEA,OAAO,CACT,EAEA4I,EAAOqzE,SAAW,WAChB,OAAIn9E,KAAKwkC,KAAK3kC,eAAe,SACpBG,KAAKwkC,KAAK04C,MAAM/9E,OACda,KAAKwkC,KAAK3kC,eAAe,gBAC3BG,KAAKwkC,KAAK44C,aACRp9E,KAAKwkC,KAAKsmB,MACZ9qD,KAAKwkC,KAAKsmB,MAAM3rD,OAGlB,IACT,EAQA2K,EAAOihD,SAAW,WAChB,OAAI/qD,KAAKwkC,KAAK04C,MAELj+E,MAAMW,UAAUkL,MAAMhL,KAAKE,KAAKwkC,KAAK04C,OAAO1xE,IAAIoxE,GAAyB16E,OAAOu6E,EAAcY,qBAC5Fr9E,KAAKwkC,KAAKsmB,MACZ7rD,MAAMW,UAAUkL,MAAMhL,KAAKE,KAAKwkC,KAAKsmB,OAErC,EAEX,EAQAhhD,EAAOwzE,SAAW,WAChB,OAAOt9E,KAAK+qD,WAAW5rD,OAAS,CAClC,EAEO0qD,CACT,CA/KA,GAiLA/4C,EAAOC,QAAU84C,C,iCC7MjB/4C,EAAOC,QAAU,CACfw8D,UAAW,EACX7G,IAAK,EACL3f,OAAQ,GACRw2B,IAAK,GACL9W,IAAK,GACLI,MAAO,GACP2W,QAAS,GACTC,UAAW,GACXC,IAAK,GACLC,KAAM,GACN92B,KAAM,GACN8f,GAAI,GACJ/f,MAAO,GACPggB,KAAM,GACNh0D,OAAQ,GACRgrE,MAAO,IACPC,OAAQ,IACRC,EAAG,GACHC,EAAG,GACHC,KAAM,GACNC,SAAU,GACVC,SAAU,I,gCCtBZ,IAAI3B,EAAiB,CACnBQ,QAAS,SAAiBoB,GACxB,MAAmC,UAA5BC,EAASD,GAAY,EAC9B,EACAE,OAAQ,SAAgBF,GACtB,IAAI1zE,EAAQ2zE,EAASD,GACrB,OAAO5B,EAAeQ,QAAQoB,KACjB,SAAb1zE,EAAM,IAA8B,UAAbA,EAAM,GAC/B,GAGF,SAAS2zE,EAASD,GAChB,OAAOA,EAAWzzE,MAAM,IAC1B,CAEAoG,EAAOC,QAAUwrE,C,iCCTjB,SAAS+B,EAAyBvuE,EAASq/D,GACzC,QAASA,IAAQr/D,IAAYq/D,EAAIzwD,iBAAmB5O,IAAYq/D,EAAItL,KACtE,CAeA,IAAIvqB,EAAS,CAKXuJ,OAAQ,SAAgB/yC,GACtB,IAAIq/D,EAAMr/D,EAAQ0xC,cAClB,OAAO68B,EAAyBvuE,EAASq/D,GAGzCA,EAAItL,KAAKya,WAAanP,EAAIzwD,gBAAgB4/D,UAAYxuE,EAAQwuE,SAChE,EAMApjC,OAAQ,SAAgBprC,EAASyuE,GAC/B,IAAIpP,EAAMr/D,EAAQ0xC,cAEd68B,EAAyBvuE,EAASq/D,GACpCA,EAAItL,KAAKya,UAAYnP,EAAIzwD,gBAAgB4/D,UAAYC,EAErDzuE,EAAQwuE,UAAYC,CAExB,EAMAC,QAAS,SAAiB1uE,GACxB,IAAIq/D,EAAMr/D,EAAQ0xC,cAClB,OAAO68B,EAAyBvuE,EAASq/D,GAAOA,EAAItL,KAAK4a,YAActP,EAAIzwD,gBAAgB+/D,WAAa3uE,EAAQ2uE,UAClH,EAMAC,QAAS,SAAiB5uE,EAAS6uE,GACjC,IAAIxP,EAAMr/D,EAAQ0xC,cAEd68B,EAAyBvuE,EAASq/D,GACpCA,EAAItL,KAAK4a,WAAatP,EAAIzwD,gBAAgB+/D,WAAaE,EAEvD7uE,EAAQ2uE,WAAaE,CAEzB,GAEF9tE,EAAOC,QAAUwoC,C,oCChEjB,SAASslC,EAAkB9uE,EAASigB,GAClC,IAAI8uD,EAAWtlC,EAAM3uC,IAAIkF,EAASigB,GAClC,MAAoB,SAAb8uD,GAAoC,WAAbA,CAChC,CAMA,IAAItlC,EAAQ,CASV3uC,IA1BqB,EAAQ,OAoC7BkwC,gBAAiB,SAAyBt8B,GACxC,IAAKA,EACH,OAAO,KAKT,IAFA,IAAIgjC,EAAgBhjC,EAAKgjC,cAElBhjC,GAAQA,IAASgjC,EAAcqiB,MAAM,CAC1C,GAAI+a,EAAkBpgE,EAAM,aAAeogE,EAAkBpgE,EAAM,cAAgBogE,EAAkBpgE,EAAM,aACzG,OAAOA,EAGTA,EAAOA,EAAKwmD,UACd,CAEA,OAAOxjB,EAAcuiB,aAAeviB,EAAcs9B,YACpD,GAEFjuE,EAAOC,QAAUyoC,C,iCCtCjB1oC,EAAOC,QAAU,CACf8gD,eAAgB,WACd,MAHc,uRAIhB,E,iCCjBF,IAAI0J,EAEJ,WACE,SAASA,EAAI5C,GALf,IAAyB3sD,EAAKrM,EAAKyR,SAMD,GANJzR,EAMJ,UANDqM,EAMLhM,MAN0CV,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAQvLpR,KAAKg/E,KAAOrmB,CACd,CAQA,OANa4C,EAAI37D,UAEViX,SAAW,WAChB,OAAO7W,KAAKg/E,IACd,EAEOzjB,CACT,CAdA,GAgBAzqD,EAAOC,QAAUwqD,C,qCCXjB,IAAIvZ,EAAuB,EAAQ,OAE/B5mC,EAAY,EAAQ,OAUpB6jE,EAEC,mZAFDA,EAGE,+eAEFC,EAAe,IAAIntB,OAAO,IAJzB,s5NAIsDktB,EAAuBA,EAAwB,KACtGE,EAAY,IAAIptB,OAAO,IAAMktB,EAAuBA,EAAwB,KAQhF,SAASG,EAAgBC,GACvB,IAAIC,EAAQJ,EAAa/sB,KAAKktB,GAC9B,OAAgB,MAATC,EAAgB,KAAOA,EAAM,EACtC,CAUA,SAASC,EAAmBF,GAC1B,IAAIG,EAAaJ,EAAgBC,GAEjC,OAAkB,MAAdG,EACKx9B,EAAqBy9B,QAGvBN,EAAUhtB,KAAKqtB,GAAcx9B,EAAqB09B,IAAM19B,EAAqB29B,GACtF,CAgBA,SAASC,EAAgBP,EAAKQ,GAG5B,GAFAA,EAAWA,GAAY79B,EAAqBy9B,SAEvCJ,EAAIlgF,OACP,OAAO0gF,EAGT,IAAIC,EAAWP,EAAmBF,GAClC,OAAOS,IAAa99B,EAAqBy9B,QAAUI,EAAWC,CAChE,CAqBA,SAASh8B,EAAau7B,EAAKU,GAMzB,OALKA,IACHA,EAAiB/9B,EAAqBg+B,gBAGvCh+B,EAAqBi+B,SAASF,IAA8H3kE,GAAU,GAChKwkE,EAAgBP,EAAKU,EAC9B,CA4BA,IAAIh+B,EAAc,CAChBq9B,gBAAiBA,EACjBG,mBAAoBA,EACpBK,gBAAiBA,EACjB97B,aAAcA,EACdo8B,eAtBF,SAAwBb,EAAKU,GAC3B,OAAOj8B,EAAau7B,EAAKU,KAAoB/9B,EAAqB29B,GACpE,EAqBEQ,eAVF,SAAwBd,EAAKU,GAC3B,OAAOj8B,EAAau7B,EAAKU,KAAoB/9B,EAAqB09B,GACpE,GAUA5uE,EAAOC,QAAUgxC,C,qCClIjB,IAAI3mC,EAAY,EAAQ,OAIpBukE,EAAM,MAEND,EAAM,MAENU,EAAY,KAMhB,SAASH,EAASr8B,GAChB,OAAOA,IAAQ+7B,GAAO/7B,IAAQ87B,CAChC,CAOA,SAASW,EAAWz8B,GAElB,OADCq8B,EAASr8B,IAAwIxoC,GAAU,GACrJwoC,IAAQ+7B,EAAM,MAAQ,KAC/B,CAmBA,SAASW,EAAa18B,GACpBw8B,EAAYx8B,CACd,CAuBA,IAAI5B,EAAuB,CAEzBy9B,QAtEY,UAuEZE,IAAKA,EACLD,IAAKA,EAELO,SAAUA,EACVI,WAAYA,EACZx8B,sBA5CF,SAA+BD,EAAK28B,GAGlC,OAFCN,EAASr8B,IAAwIxoC,GAAU,GAC3J6kE,EAASM,IAAkJnlE,GAAU,GAC/JwoC,IAAQ28B,EAAW,KAAOF,EAAWz8B,EAC9C,EA0CE08B,aAAcA,EACdE,cA5BF,WACEF,EAAaX,EACf,EA2BEK,aArBF,WAME,OALKI,GACHpgF,KAAKwgF,gBAGNJ,GAAoGhlE,GAAU,GACxGglE,CACT,GAgBAtvE,EAAOC,QAAUixC,C,qCCpEjB,SAASpmB,EAAgB5vB,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CAEhN,IAAI+1C,EAAc,EAAQ,OAEtBC,EAAuB,EAAQ,OAE/B5mC,EAAY,EAAQ,OAEpBk5C,EAEJ,WAME,SAASA,EAAmBmsB,GAC1B7kD,EAAgB57B,KAAM,mBAAe,GAErC47B,EAAgB57B,KAAM,gBAAY,GAE7BygF,EAGFz+B,EAAqBi+B,SAASQ,IAAsIrlE,GAAU,GAF/KqlE,EAAaz+B,EAAqBg+B,eAKpChgF,KAAK0gF,YAAcD,EACnBzgF,KAAKy0D,OACP,CASA,IAAI3qD,EAASwqD,EAAmB10D,UAmBhC,OAjBAkK,EAAO2qD,MAAQ,WACbz0D,KAAK2gF,SAAW3gF,KAAK0gF,WACvB,EAUA52E,EAAOg6C,aAAe,SAAsBu7B,GAE1C,OADAr/E,KAAK2gF,SAAW5+B,EAAY+B,aAAau7B,EAAKr/E,KAAK2gF,UAC5C3gF,KAAK2gF,QACd,EAEOrsB,CACT,CAhDA,GAkDAxjD,EAAOC,QAAUujD,C,qCChFjB,IAAIl5C,EAAY,EAAQ,OAIpBwlE,EAAuB,MAGvBC,EAAoB,MACpBC,EAAwB,kBAM5B,SAASC,EAA2BC,GAClC,OAAOJ,GAAwBI,GAAYA,GAAYH,CACzD,CA6BA,SAASI,EAAiB5B,GACxB,OAAOyB,EAAsBhgD,KAAKu+C,EACpC,CAqBA,SAASpK,EAAeoK,EAAK6B,GAC3B,OAAO,EAAIH,EAA2B1B,EAAIvhE,WAAWojE,GACvD,CAkCA,SAAS/e,EAAOkd,EAAK5jE,EAAOtc,GAI1B,GAHAsc,EAAQA,GAAS,EACjBtc,OAAoBuJ,IAAXvJ,EAAuBgc,IAAWhc,GAAU,GAEhD8hF,EAAiB5B,GACpB,OAAOA,EAAIld,OAAO1mD,EAAOtc,GAI3B,IAAIgN,EAAOkzE,EAAIlgF,OAEf,GAAIgN,GAAQ,GAAKsP,EAAQtP,GAAQhN,GAAU,EACzC,MAAO,GAIT,IAAIgiF,EAAO,EAEX,GAAI1lE,EAAQ,EAAG,CACb,KAAOA,EAAQ,GAAK0lE,EAAOh1E,EAAMsP,IAC/B0lE,GAAQlM,EAAeoK,EAAK8B,GAG9B,GAAIA,GAAQh1E,EACV,MAAO,EAEX,MAAO,GAAIsP,EAAQ,EAAG,CACpB,IAAK0lE,EAAOh1E,EAAMsP,EAAQ,GAAK,EAAI0lE,EAAM1lE,IACvC0lE,GAAQlM,EAAeoK,EAAK8B,EAAO,GAGjCA,EAAO,IACTA,EAAO,EAEX,CAGA,IAAIC,EAAOj1E,EAEX,GAAIhN,EAASgN,EACX,IAAKi1E,EAAOD,EAAMhiF,EAAS,GAAKiiF,EAAOj1E,EAAMhN,IAC3CiiF,GAAQnM,EAAeoK,EAAK+B,GAIhC,OAAO/B,EAAIgC,UAAUF,EAAMC,EAC7B,CA8CA,IAAIhf,EAAe,CACjBkf,cAXF,SAAuBjC,GAGrB,IAFA,IAAIkC,EAAa,GAERL,EAAM,EAAGA,EAAM7B,EAAIlgF,OAAQ+hF,GAAOjM,EAAeoK,EAAK6B,GAC7DK,EAAWx9E,KAAKs7E,EAAImC,YAAYN,IAGlC,OAAOK,CACT,EAIEtM,eAAgBA,EAChBgM,iBAAkBA,EAClBF,2BAA4BA,EAC5BzV,gBA7KF,SAAyB+T,EAAK10E,GAG5B,GAFE,GAAKA,GAASA,EAAQ00E,EAAIlgF,QAAmJic,GAAU,GAErLzQ,EAAQ,IAAM00E,EAAIlgF,OACpB,OAAO,EAGT,IAAIu2B,EAAQ2pD,EAAIvhE,WAAWnT,GACvB82E,EAASpC,EAAIvhE,WAAWnT,EAAQ,GACpC,OAAOi2E,GAAwBlrD,GAASA,GAhCjB,OACC,OA+BsE+rD,GAAUA,GAAUZ,CACpH,EAoKEnY,OA3HF,SAAgB2W,GAEd,IAAK4B,EAAiB5B,GACpB,OAAOA,EAAIlgF,OAKb,IAFA,IAAIqU,EAAM,EAED0tE,EAAM,EAAGA,EAAM7B,EAAIlgF,OAAQ+hF,GAAOjM,EAAeoK,EAAK6B,GAC7D1tE,IAGF,OAAOA,CACT,EA+GE6tE,UAzCF,SAAmBhC,EAAK5jE,EAAOnH,IAC7BmH,EAAQA,GAAS,GAGL,IACVA,EAAQ,IAHVnH,OAAc5L,IAAR4L,EAAoB6G,IAAW7G,GAAO,GAMlC,IACRA,EAAM,GAGR,IAAInV,EAASsU,KAAKkI,IAAIrH,EAAMmH,GAE5B,OAAO0mD,EAAOkd,EADd5jE,EAAQA,EAAQnH,EAAMmH,EAAQnH,EACJnV,EAC5B,EA2BEgjE,OAAQA,GAEVrxD,EAAOC,QAAUqxD,C,qCC1NjB,IAAIsf,EAAgB,EAAQ,OAExBC,EAAe,EAAQ,OAEvBC,EAAY,EAAQ,OAEpBC,EAAoB,EAAQ,OAYhC,SAASC,EAAQ9xD,EAAM+xD,EAASC,EAAOC,GAErC,GAAIjyD,IAASgyD,EACX,OAAO,EAIT,IAAKA,EAAMv6E,WAAWuoB,GACpB,OAAO,EAIT,IAAIixC,EAAQ+gB,EAAMl3E,MAAMklB,EAAK7wB,QAE7B,QAAI4iF,IACF9gB,EAAQghB,EAAaA,EAAWhhB,GAASA,EAClC0gB,EAAatqD,SAAS4pC,EAAO8gB,GAIxC,CAYA,SAASG,EAAyBH,GAChC,MAAmC,YAA/BL,EAAcS,aACTJ,EAAQ7gD,QAAQ,SAAU,IAG5B6gD,CACT,CAOA,IAAIptC,EAAY,CA4CdU,UAAW,SAAmB2sC,GAC5B,OAAOF,EAAQJ,EAAcU,YAAaV,EAAcW,mBAAoBL,EAC9E,EAUAM,sBAAuB,SAA+BN,GACpD,OAAOF,EAAQJ,EAAca,oBAAqB,KAAMP,EAC1D,EA0BAQ,SAAU,SAAkBR,GAC1B,OAAOF,EAAQJ,EAAce,WAAY,KAAMT,EACjD,EAwBArd,SAAU,SAAkBqd,GAC1B,OAAOF,EAAQJ,EAAcgB,WAAYhB,EAAciB,cAAeX,EACxE,EAqCAjqB,WAAY,SAAoBiqB,GAC9B,OAAOF,EAAQJ,EAAcS,aAAcT,EAAckB,oBAAqBZ,EAAOE,EACvF,EAUAW,uBAAwB,SAAgCb,GACtD,OAAOF,EAAQJ,EAAcoB,qBAAsB,KAAMd,EAC3D,GAEFlxE,EAAOC,QAAU6wE,EAAUjtC,EAAWktC,E,qCCzNtC,IAAIkB,EAAW,EAAQ,OAEnBC,EAAU,UACVC,EAAe,CACjB,SAAU,YAoCZ,IA9B6BjzD,EA+BzB8/C,GADS,IAAIiT,GACIG,YAEjBC,EAvBJ,SAA2BpB,GACzB,IAAKA,EACH,MAAO,CACLqB,MAAO,GACPC,MAAO,IAIX,IAAI54E,EAAQs3E,EAAQr3E,MAAM,KAC1B,MAAO,CACL04E,MAAO34E,EAAM,GACb44E,MAAO54E,EAAM,GAEjB,CAUyB64E,CAAkBxT,EAAQyT,QAAQxB,SACvDyB,EAAS,CACXjB,oBAAqBzS,EAAQ2T,IAAIC,cAAgBV,EACjDX,mBAAoBvS,EAAQyT,QAAQxB,SAAWiB,EAC/CW,oBAAqBR,EAAmBE,OAASL,EACjDZ,YAAatS,EAAQyT,QAAQvzD,MAAQgzD,EACrCY,eAAgB9T,EAAQyT,QAAQH,OAASJ,EACzCP,WAAY3S,EAAQ+T,OAAOC,OAASd,EACpCN,WAAY5S,EAAQiU,OAAO/zD,MAAQgzD,EACnCL,cAAe7S,EAAQiU,OAAOhC,SAAWiB,EACzCF,qBAAsBhT,EAAQ2T,IAAIC,cAAgBV,EAClDb,cA5C2BnyD,EA4CO8/C,EAAQkU,GAAGh0D,KA3CtCizD,EAAajzD,IAASA,GA2CyBgzD,GACtDiB,gBAAiBnU,EAAQkU,GAAGjC,SAAWiB,EACvCJ,oBAAqB9S,EAAQkU,GAAGjC,SAAWiB,GAE7ClyE,EAAOC,QAAUyyE,C,qCCrEjB,IAAIpoE,EAAY,EAAQ,OAEpB8oE,EAAiB,KACjBC,EAAU,OACVC,EAAa,WACbC,EAAgB,+BAChBC,EAAe,aAUnB,SAASC,EAAkBtjB,EAAO8gB,GAChC,IAAIyC,EAAcvjB,EAAMv2D,MAAMy5E,GAE9B,OAAIK,EAAYrlF,OAAS,EAChBqlF,EAAYz8E,MAAK,SAAUk5D,GAChC,OAAO0gB,EAAatqD,SAAS4pC,EAAO8gB,EACtC,IAgBJ,SAA8B9gB,EAAO8gB,GACnC,IAAIyC,EAAcvjB,EAAMv2D,MAAM05E,GAG9B,GAFEI,EAAYrlF,OAAS,GAAKqlF,EAAYrlF,QAAU,GAA+Gic,GAAU,GAEhJ,IAAvBopE,EAAYrlF,OACd,OAAOslF,EAAsBD,EAAY,GAAIzC,GAE7C,IAAI2C,EAAeF,EAAY,GAC3BG,EAAaH,EAAY,GAE7B,OADEI,EAAgBF,IAAiBE,EAAgBD,IAAwIvpE,GAAU,GAC9LqpE,EAAsB,KAAOC,EAAc3C,IAAY0C,EAAsB,KAAOE,EAAY5C,EAE3G,CAzBW8C,CADP5jB,EAAQujB,EAAY,GAAGr+C,OACY47C,EAEvC,CAkCA,SAAS0C,EAAsBxjB,EAAO8gB,GAGpC,GAAc,MAFd9gB,EAAQA,EAAM96B,QAGZ,OAAO,EAGT,IAiDI19B,EAjDAq8E,EAAoB/C,EAAQr3E,MAAMw5E,GAElCa,EAAwBC,EAAyB/jB,GACjDgkB,EAAWF,EAAsBE,SACjCC,EAAkBH,EAAsBG,gBAE5C,OAAQD,GACN,IAAK,IACH,OAAOE,EAAcL,EAAmBI,GAE1C,IAAK,KACH,OAuCe,KADfz8E,EAAS28E,EAtCmBN,EAAmBI,KAuChB,IAAXz8E,EArCtB,IAAK,KACH,OAAO48E,EAAwBP,EAAmBI,GAEpD,IAAK,IACH,OAqEN,SAA0B5qE,EAAGC,GAC3B,OAAmC,IAA5B6qE,EAAkB9qE,EAAGC,EAC9B,CAvEa+qE,CAAiBR,EAAmBI,GAE7C,IAAK,IACL,IAAK,KACH,OA+EN,SAAiC5qE,EAAGC,GAClC,IAAIgrE,EAAahrE,EAAEzP,QACf06E,EAAajrE,EAAEzP,QAEf06E,EAAWrmF,OAAS,GACtBqmF,EAAWhgE,MAGb,IAAIigE,EAAYD,EAAWrmF,OAAS,EAChCumF,EAAU31C,SAASy1C,EAAWC,GAAY,IAE1CE,EAASD,KACXF,EAAWC,GAAaC,EAAU,EAAI,IAGxC,OAAOL,EAAwB/qE,EAAGirE,IAAeJ,EAAc7qE,EAAGkrE,EACpE,CA/FaI,CAAwBd,EAAmBI,GAEpD,QACE,OAqCN,SAAoB5qE,EAAGC,GACrB,OAAmC,IAA5B6qE,EAAkB9qE,EAAGC,EAC9B,CAvCasrE,CAAWf,EAAmBI,GAE3C,CAUA,SAASC,EAAc7qE,EAAGC,GACxB,OAAoC,IAA7B6qE,EAAkB9qE,EAAGC,EAC9B,CAmCA,SAAS8qE,EAAwB/qE,EAAGC,GAClC,IAAI9R,EAAS28E,EAAkB9qE,EAAGC,GAClC,OAAkB,IAAX9R,GAA2B,IAAXA,CACzB,CAqDA,SAASu8E,EAAyB/jB,GAChC,IAAIikB,EAAkBjkB,EAAMv2D,MAAMw5E,GAC9BhyB,EAAUgzB,EAAgB,GAAG5F,MAAM+E,GAEvC,OADCnyB,GAA+G92C,GAAU,GACnH,CACL6pE,SAAU/yB,EAAQ,GAClBgzB,gBAAiB,CAAChzB,EAAQ,IAAIjqD,OAAOi9E,EAAgBp6E,MAAM,IAE/D,CASA,SAAS66E,EAASG,GAChB,OAAQ9Z,MAAM8Z,IAAWC,SAASD,EACpC,CAUA,SAASlB,EAAgB3jB,GACvB,OAAQ+jB,EAAyB/jB,GAAOgkB,QAC1C,CASA,SAASe,EAAQ7tE,EAAOhZ,GACtB,IAAK,IAAIM,EAAI0Y,EAAMhZ,OAAQM,EAAIN,EAAQM,IACrC0Y,EAAM1Y,GAAK,GAEf,CAkDA,SAASwmF,EAAe3rE,EAAGC,GACzB,IAAI2rE,EAAU5rE,EAAEglE,MAAMgF,GAAc,GAChC6B,EAAU5rE,EAAE+kE,MAAMgF,GAAc,GAChC8B,EAAWr2C,SAASm2C,EAAS,IAC7BG,EAAWt2C,SAASo2C,EAAS,IAEjC,OAAIR,EAASS,IAAaT,EAASU,IAAaD,IAAaC,EACpDvE,EAAQsE,EAAUC,GAElBvE,EAAQxnE,EAAGC,EAEtB,CAWA,SAASunE,EAAQxnE,EAAGC,GAGlB,cAFSD,WAAaC,GAAwGa,GAAU,GAEpId,EAAIC,EACC,EACED,EAAIC,GACL,EAED,CAEX,CAWA,SAAS6qE,EAAkB9qE,EAAGC,GAK5B,IAJA,IAAI+rE,EA9EN,SAA2BhsE,EAAGC,GAG5ByrE,EAFA1rE,EAAIA,EAAExP,SACNyP,EAAIA,EAAEzP,SACO3L,QAEb,IAAK,IAAIM,EAAI,EAAGA,EAAI8a,EAAEpb,OAAQM,IAAK,CACjC,IAAIyyD,EAAU33C,EAAE9a,GAAG6/E,MAAM,WAEzB,GAAIptB,IACF33C,EAAE9a,GAAK6a,EAAE7a,GAAK,IAEK,MAAfyyD,EAAQ,IAAczyD,IAAM8a,EAAEpb,OAAS,GACzC,IAAK,IAAIonF,EAAI9mF,EAAG8mF,EAAIjsE,EAAEnb,OAAQonF,IAC5BjsE,EAAEisE,GAAK,GAIf,CAGA,OADAP,EAAQzrE,EAAGD,EAAEnb,QACN,CAACmb,EAAGC,EACb,CAyD2BisE,CAAkBlsE,EAAGC,GAC1CksE,EAAcH,EAAmB,GACjCI,EAAcJ,EAAmB,GAE5B7mF,EAAI,EAAGA,EAAIinF,EAAYvnF,OAAQM,IAAK,CAC3C,IAAIgJ,EAASw9E,EAAeQ,EAAYhnF,GAAIinF,EAAYjnF,IAExD,GAAIgJ,EACF,OAAOA,CAEX,CAEA,OAAO,CACT,CAEA,IAAIk5E,EAAe,CAgCjBtqD,SAAU,SAAkB4pC,EAAO8gB,GACjC,OAAOwC,EAAkBtjB,EAAM96B,OAAQ47C,EAAQ57C,OACjD,GAEFr1B,EAAOC,QAAU4wE,C,gCCjYjB,IAAIgF,EAAiB,QAiBrB71E,EAAOC,QANP,SAAkB2M,GAChB,OAAOA,EAAOwjB,QAAQylD,GAAgB,SAAU9rE,EAAGwwB,GACjD,OAAOA,EAAUxB,aACnB,GACF,C,oCCfA,IAAI+8C,EAAa,EAAQ,OA0BzB91E,EAAOC,QAlBP,SAAS2yD,EAAamjB,EAAWC,GAC/B,SAAKD,IAAcC,KAERD,IAAcC,IAEdF,EAAWC,KAEXD,EAAWE,GACbpjB,EAAamjB,EAAWC,EAAU7hB,YAChC,aAAc4hB,EAChBA,EAAUxvD,SAASyvD,KACjBD,EAAUE,4BACsC,GAA/CF,EAAUE,wBAAwBD,KAIhD,C,qCCxBA,IAAI1rE,EAAY,EAAQ,OAuGxBtK,EAAOC,QAVP,SAA8B/E,GAC5B,OArCF,SAAwBA,GACtB,QACIA,IACY,iBAAPA,GAAiC,mBAAPA,IACjC,WAAYA,KACV,gBAAiBA,IAEI,iBAAhBA,EAAIwS,WACXvf,MAAMC,QAAQ8M,IACd,WAAYA,GACZ,SAAUA,EAEd,CAyBOg7E,CAAeh7E,GAET/M,MAAMC,QAAQ8M,GAChBA,EAAIlB,QArFf,SAAiBkB,GACf,IAAI7M,EAAS6M,EAAI7M,OAUjB,IAPGF,MAAMC,QAAQ8M,IAAwB,kBAARA,GAAmC,oBAARA,IAAyHoP,GAAU,GAC3K,kBAAXjc,GAA6Hic,GAAU,GACnI,IAAXjc,GAAgBA,EAAS,KAAK6M,GAAkHoP,GAAU,GACpI,oBAAfpP,EAAIi7E,QAAmM7rE,GAAU,GAItNpP,EAAInM,eACN,IACE,OAAOZ,MAAMW,UAAUkL,MAAMhL,KAAKkM,EACpC,CAAE,MAAOnN,GACT,CAOF,IAFA,IAAIqoF,EAAMjoF,MAAME,GAEPyU,EAAK,EAAGA,EAAKzU,EAAQyU,IAC5BszE,EAAItzE,GAAM5H,EAAI4H,GAGhB,OAAOszE,CACT,CA4DW1vE,CAAQxL,GAJR,CAACA,EAMZ,C,iCC5EA,SAASk1B,EAAQm+C,GACf,OAAOA,EAAIn+C,QAAQ,MAAO,IAC5B,CAEApwB,EAAOC,QAdP,SAAYo2E,GACV,MAAyB,iBAAdA,EACF7nF,OAAO6G,KAAKghF,GAAYjlF,QAAO,SAAUzB,GAC9C,OAAO0mF,EAAW1mF,EACpB,IAAG+K,IAAI01B,GAAS/3B,KAAK,KAGhBlK,MAAMW,UAAU4L,IAAI1L,KAAKV,UAAW8hC,GAAS/3B,KAAK,IAC3D,C,iCCvBA,SAASi+E,EAAkBx2E,GACzB,OAAO,WACL,OAAOA,CACT,CACF,CAQA,IAAI6rE,EAAgB,WAA0B,EAE9CA,EAAc4K,YAAcD,EAC5B3K,EAAc6K,iBAAmBF,GAAkB,GACnD3K,EAAc8K,gBAAkBH,GAAkB,GAClD3K,EAAc+K,gBAAkBJ,EAAkB,MAElD3K,EAAcgL,gBAAkB,WAC9B,OAAOznF,IACT,EAEAy8E,EAAcY,oBAAsB,SAAUzsE,GAC5C,OAAOA,CACT,EAEAE,EAAOC,QAAU0rE,C,iCCEjB3rE,EAAOC,QAhBP,SAA0Bq+D,GAKxB,GAAmB,qBAFnBA,EAAMA,IAA4B,qBAAblC,SAA2BA,cAAWxkE,IAGzD,OAAO,KAGT,IACE,OAAO0mE,EAAIoL,eAAiBpL,EAAItL,IAClC,CAAE,MAAOjlE,GACP,OAAOuwE,EAAItL,IACb,CACF,C,iCC3BA,IAAI4jB,EAAgC,qBAAdC,WAA6BA,UAAUC,UAAUxhF,QAAQ,gBAAkB,EAqBjG0K,EAAOC,QAVP,SAAkCq+D,GAGhC,OAFAA,EAAMA,GAAOlC,UAEL2a,iBACCzY,EAAIyY,iBAGLH,GAA+B,eAAnBtY,EAAI0Y,WAAoD1Y,EAAItL,KAA1BsL,EAAIzwD,eAC5D,C,qCCnBA,IAAIopE,EAAiB,EAAQ,OAoB7Bj3E,EAAOC,QAVP,SAA4BhB,GAC1B,IAAI25D,EAAOqe,EAAeh4E,GAC1B,MAAO,CACLyU,EAAGklD,EAAK7gD,KACRmyB,EAAG0uB,EAAKC,IACRroE,MAAOooE,EAAK5gD,MAAQ4gD,EAAK7gD,KACzBznB,OAAQsoE,EAAKE,OAASF,EAAKC,IAE/B,C,qCClBA,IAAIjG,EAAe,EAAQ,MAmC3B5yD,EAAOC,QA1BP,SAAwBi3E,GACtB,IAAIC,EAAUD,EAAKvmC,cAAc9iC,gBAGjC,KAAM,0BAA2BqpE,KAAUtkB,EAAaukB,EAASD,GAC/D,MAAO,CACLn/D,KAAM,EACNC,MAAO,EACP6gD,IAAK,EACLC,OAAQ,GAQZ,IAAIF,EAAOse,EAAKpd,wBAChB,MAAO,CACL/hD,KAAMpV,KAAKy0E,MAAMxe,EAAK7gD,MAAQo/D,EAAQE,WACtCr/D,MAAOrV,KAAKy0E,MAAMxe,EAAK5gD,OAASm/D,EAAQE,WACxCxe,IAAKl2D,KAAKy0E,MAAMxe,EAAKC,KAAOse,EAAQG,UACpCxe,OAAQn2D,KAAKy0E,MAAMxe,EAAKE,QAAUqe,EAAQG,UAE9C,C,qCCjCA,IAAIC,EAA2B,EAAQ,OAEnCC,EAA6B,EAAQ,OA+BzCx3E,EAAOC,QAhBP,SAA2Bw3E,GACzB,IAAIC,EAAwBH,EAAyBE,EAAW9mC,eAAiB8mC,EAAWrb,UAExFqb,EAAWE,QAAUF,aAAsBA,EAAWE,SACxDF,EAAaC,GAGf,IAAI9tC,EAAiB4tC,EAA2BC,GAC5CG,EAAWH,IAAeC,EAAwBD,EAAW9mC,cAAc9iC,gBAAkB4pE,EAC7FI,EAAOJ,EAAWK,YAAcF,EAASG,YACzCC,EAAOP,EAAWQ,aAAeL,EAASM,aAG9C,OAFAtuC,EAAel2B,EAAI/Q,KAAKC,IAAI,EAAGD,KAAKkB,IAAI+lC,EAAel2B,EAAGmkE,IAC1DjuC,EAAeM,EAAIvnC,KAAKC,IAAI,EAAGD,KAAKkB,IAAI+lC,EAAeM,EAAG8tC,IACnDpuC,CACT,C,qCC/BA,IAAIuuC,EAAW,EAAQ,MAEnBC,EAAY,EAAQ,OAExB,SAASC,EAAS/3E,GAGhB,OAAgB,MAATA,EAAgBA,EAAQ2vB,OAAO3vB,EACxC,CA6CAN,EAAOC,QA3CP,SAEA0N,EAEAuR,GAGE,IAAIo5D,EAEJ,GAAInuC,OAAOovB,mBAET+e,EAAgBnuC,OAAOovB,iBAAiB5rD,EAAM,OAG5C,OAAO0qE,EAASC,EAAcC,iBAAiBH,EAAUl5D,KAK7D,GAAIk9C,SAASlJ,aAAekJ,SAASlJ,YAAYqG,iBAAkB,CAGjE,GAFA+e,EAAgBlc,SAASlJ,YAAYqG,iBAAiB5rD,EAAM,MAG1D,OAAO0qE,EAASC,EAAcC,iBAAiBH,EAAUl5D,KAG3D,GAAa,YAATA,EACF,MAAO,MAEX,CAGA,OAAIvR,EAAKipC,aAEEyhC,EADI,UAATn5D,EACcvR,EAAKipC,aAAa4hC,UAAY7qE,EAAKipC,aAAa6hC,WAGlD9qE,EAAKipC,aAAauhC,EAASj5D,KAGtCm5D,EAAS1qE,EAAKtc,OAASsc,EAAKtc,MAAM8mF,EAASj5D,IACpD,C,iCC3BAlf,EAAOC,QAdP,SAAoCw3E,GAClC,OAAIA,EAAWE,QAAUF,aAAsBA,EAAWE,OACjD,CACLjkE,EAAG+jE,EAAWiB,aAAejB,EAAWrb,SAASvuD,gBAAgB+/D,WACjE1jC,EAAGutC,EAAWkB,aAAelB,EAAWrb,SAASvuD,gBAAgB4/D,WAI9D,CACL/5D,EAAG+jE,EAAW7J,WACd1jC,EAAGutC,EAAWhK,UAElB,C,iCCrBA,SAASmL,IACP,IAAIpoF,EAUJ,OARI4rE,SAASvuD,kBACXrd,EAAQ4rE,SAASvuD,gBAAgBkqE,cAG9BvnF,GAAS4rE,SAASpJ,OACrBxiE,EAAQ4rE,SAASpJ,KAAK+kB,aAGjBvnF,GAAS,CAClB,CAEA,SAASqoF,IACP,IAAIvoF,EAUJ,OARI8rE,SAASvuD,kBACXvd,EAAS8rE,SAASvuD,gBAAgBqqE,eAG/B5nF,GAAU8rE,SAASpJ,OACtB1iE,EAAS8rE,SAASpJ,KAAKklB,cAGlB5nF,GAAU,CACnB,CAMA,SAAS8gD,IACP,MAAO,CACL5gD,MAAO25C,OAAO2uC,YAAcF,IAC5BtoF,OAAQ65C,OAAO4uC,aAAeF,IAElC,CAMAznC,EAAsB4nC,kBAAoB,WACxC,MAAO,CACLxoF,MAAOooF,IACPtoF,OAAQuoF,IAEZ,EAEA74E,EAAOC,QAAUmxC,C,iCCnDjB,IAAI6nC,EAAoB,WAkBxBj5E,EAAOC,QAJP,SAAmB2M,GACjB,OAAOA,EAAOwjB,QAAQ6oD,EAAmB,OAAO5oD,aAClD,C,iCChBA,IAAI6oD,EAIA,SAAUC,GAAS,EAqCvBn5E,EAAOC,QA1BP,SAAmBsK,EAAW4uE,GAC5B,IAAK,IAAIzgF,EAAOpK,UAAUD,OAAQ0I,EAAO,IAAI5I,MAAMuK,EAAO,EAAIA,EAAO,EAAI,GAAIC,EAAO,EAAGA,EAAOD,EAAMC,IAClG5B,EAAK4B,EAAO,GAAKrK,UAAUqK,GAK7B,GAFAugF,EAAeC,IAEV5uE,EAAW,CACd,IAAIC,EAEJ,QAAe5S,IAAXuhF,EACF3uE,EAAQ,IAAIC,MAAM,qIACb,CACL,IAAI2uE,EAAW,GACf5uE,EAAQ,IAAIC,MAAM0uE,EAAO/oD,QAAQ,OAAO,WACtC,OAAOH,OAAOl5B,EAAKqiF,KACrB,MACMl6D,KAAO,qBACf,CAIA,MAFA1U,EAAM6uE,YAAc,EAEd7uE,CACR,CACF,C,iCC5BAxK,EAAOC,QANP,SAAgBuH,GACd,IACI0rD,GADM1rD,EAASA,EAAOmpC,eAAiBnpC,EAAS40D,UAC9BlJ,aAAe/oB,OACrC,SAAU3iC,KAAuC,oBAArB0rD,EAAYluB,KAAsBx9B,aAAkB0rD,EAAYluB,KAAyB,kBAAXx9B,GAAkD,kBAApBA,EAAOkG,UAAoD,kBAApBlG,EAAOolD,UACxL,C,qCCTA,IAAI6G,EAAS,EAAQ,OAWrBzzD,EAAOC,QAJP,SAAoBuH,GAClB,OAAOisD,EAAOjsD,IAA8B,GAAnBA,EAAOkG,QAClC,C,iCCYA1N,EAAOC,QAjBP,SAAqBtQ,GACnB,IAAI2pF,EAAe3pF,GAAa,GAC5B4pF,EAAYjrF,UAAUD,OAE1B,GAAIkrF,EAAY,EACd,IAAK,IAAI1/E,EAAQ,EAAGA,EAAQ0/E,EAAW1/E,IAAS,CAC9C,IAAI2/E,EAAYlrF,UAAUuL,GAEtB2/E,IACFF,GAAgBA,EAAeA,EAAe,IAAM,IAAME,EAE9D,CAGF,OAAOF,CACT,C,iCCpBA,IAAIvqF,EAAiBP,OAAOM,UAAUC,eAwCtCiR,EAAOC,QAhBP,SAAmBuH,EAAQiiB,EAAUpO,GACnC,IAAK7T,EACH,OAAO,KAGT,IAAI7P,EAAS,CAAC,EAEd,IAAK,IAAIunB,KAAQ1X,EACXzY,EAAeC,KAAKwY,EAAQ0X,KAC9BvnB,EAAOunB,GAAQuK,EAASz6B,KAAKqsB,EAAS7T,EAAO0X,GAAOA,EAAM1X,IAI9D,OAAO7P,CACT,C,iCCtBAqI,EAAOC,QAXP,SAA2BwpB,GACzB,IAAIphB,EAAQ,CAAC,EACb,OAAO,SAAUuE,GAKf,OAJKvE,EAAMtZ,eAAe6d,KACxBvE,EAAMuE,GAAU6c,EAASz6B,KAAKE,KAAM0d,IAG/BvE,EAAMuE,EACf,CACF,C,iCCLA5M,EAAOC,QARU,SAAoByT,GACnC,GAAS,MAALA,EACF,OAAOA,EAGT,MAAM,IAAIjJ,MAAM,mCAClB,C,qCCNA,EAAQ,OAERzK,EAAOC,QAAU,EAAA4wC,EAAO6gB,Y,qCC4BxB,IAAI+nB,EA/BgB,EAAQ,OA4C5Bz5E,EAAOC,QAAUw5E,C,mBC7CgDz5E,EAAOC,QAGhE,WAAc,aAAa,IAAIC,EAAU/R,MAAMW,UAAUkL,MAE/D,SAASmG,EAAYC,EAAM1E,GACrBA,IACF0E,EAAKtR,UAAYN,OAAOmP,OAAOjC,EAAW5M,YAE5CsR,EAAKtR,UAAU8O,YAAcwC,CAC/B,CAEA,SAASC,EAASC,GACd,OAAOC,EAAWD,GAASA,EAAQE,EAAIF,EACzC,CAIA,SAASG,EAAcH,GACrB,OAAOI,EAAQJ,GAASA,EAAQK,EAASL,EAC3C,CAIA,SAASM,EAAgBN,GACvB,OAAOO,EAAUP,GAASA,EAAQQ,EAAWR,EAC/C,CAIA,SAASS,EAAYT,GACnB,OAAOC,EAAWD,KAAWU,EAAcV,GAASA,EAAQW,EAAOX,EACrE,CAIF,SAASC,EAAWW,GAClB,SAAUA,IAAiBA,EAAcC,GAC3C,CAEA,SAAST,EAAQU,GACf,SAAUA,IAAcA,EAAWC,GACrC,CAEA,SAASR,EAAUS,GACjB,SAAUA,IAAgBA,EAAaC,GACzC,CAEA,SAASP,EAAcQ,GACrB,OAAOd,EAAQc,IAAqBX,EAAUW,EAChD,CAEA,SAASC,EAAUC,GACjB,SAAUA,IAAgBA,EAAaC,GACzC,CArCAxB,EAAYM,EAAeJ,GAM3BF,EAAYS,EAAiBP,GAM7BF,EAAYY,EAAaV,GA2BzBA,EAASE,WAAaA,EACtBF,EAASK,QAAUA,EACnBL,EAASQ,UAAYA,EACrBR,EAASW,cAAgBA,EACzBX,EAASoB,UAAYA,EAErBpB,EAASuB,MAAQnB,EACjBJ,EAASwB,QAAUjB,EACnBP,EAAS/J,IAAMyK,EAGf,IAAII,EAAuB,6BACvBE,EAAoB,0BACpBE,EAAsB,4BACtBI,EAAsB,4BAGtBG,EAAS,SAGTC,EAAQ,EACRC,EAAO,GAAKD,EACZE,EAAOD,EAAO,EAIdE,EAAU,CAAC,EAGXC,EAAgB,CAAE7B,OAAO,GACzB8B,EAAY,CAAE9B,OAAO,GAEzB,SAAS+B,EAAQrD,GAEf,OADAA,EAAIsB,OAAQ,EACLtB,CACT,CAEA,SAASsD,EAAOtD,GACdA,IAAQA,EAAIsB,OAAQ,EACtB,CAKA,SAASiC,IAAW,CAGpB,SAASC,EAAQC,EAAKnJ,GACpBA,EAASA,GAAU,EAGnB,IAFA,IAAIoJ,EAAMC,KAAKC,IAAI,EAAGH,EAAIpU,OAASiL,GAC/BuJ,EAAS,IAAI1U,MAAMuU,GACdI,EAAK,EAAGA,EAAKJ,EAAKI,IACzBD,EAAOC,GAAML,EAAIK,EAAKxJ,GAExB,OAAOuJ,CACT,CAEA,SAASE,EAAWC,GAIlB,YAHkBpL,IAAdoL,EAAK3H,OACP2H,EAAK3H,KAAO2H,EAAKC,UAAUC,IAEtBF,EAAK3H,IACd,CAEA,SAAS8H,EAAUH,EAAMnJ,GAQvB,GAAqB,kBAAVA,EAAoB,CAC7B,IAAIuJ,EAAcvJ,IAAU,EAC5B,GAAI,GAAKuJ,IAAgBvJ,GAAyB,aAAhBuJ,EAChC,OAAOC,IAETxJ,EAAQuJ,CACV,CACA,OAAOvJ,EAAQ,EAAIkJ,EAAWC,GAAQnJ,EAAQA,CAChD,CAEA,SAASqJ,IACP,OAAO,CACT,CAEA,SAASI,EAAWC,EAAOC,EAAKnI,GAC9B,OAAkB,IAAVkI,QAAyB3L,IAATyD,GAAsBkI,IAAUlI,UAC7CzD,IAAR4L,QAA+B5L,IAATyD,GAAsBmI,GAAOnI,EACxD,CAEA,SAASoI,EAAaF,EAAOlI,GAC3B,OAAOqI,EAAaH,EAAOlI,EAAM,EACnC,CAEA,SAASsI,EAAWH,EAAKnI,GACvB,OAAOqI,EAAaF,EAAKnI,EAAMA,EACjC,CAEA,SAASqI,EAAa7J,EAAOwB,EAAMuI,GACjC,YAAiBhM,IAAViC,EACL+J,EACA/J,EAAQ,EACN8I,KAAKC,IAAI,EAAGvH,EAAOxB,QACVjC,IAATyD,EACExB,EACA8I,KAAKkB,IAAIxI,EAAMxB,EACvB,CAIA,IAAIiK,EAAe,EACfC,EAAiB,EACjBC,EAAkB,EAElBC,EAAyC,oBAAXC,QAAyBA,OAAOC,SAC9DC,EAAuB,aAEvBC,EAAkBJ,GAAwBG,EAG9C,SAASE,EAASlG,GACdlP,KAAKkP,KAAOA,CACd,CAkBF,SAASmG,EAAcnU,EAAMoU,EAAGC,EAAGC,GACjC,IAAIpE,EAAiB,IAATlQ,EAAaoU,EAAa,IAATpU,EAAaqU,EAAI,CAACD,EAAGC,GAIlD,OAHAC,EAAkBA,EAAepE,MAAQA,EAAUoE,EAAiB,CAClEpE,MAAOA,EAAOqE,MAAM,GAEfD,CACT,CAEA,SAASE,IACP,MAAO,CAAEtE,WAAO1I,EAAW+M,MAAM,EACnC,CAEA,SAASE,EAAY3D,GACnB,QAAS4D,EAAc5D,EACzB,CAEA,SAAS6D,EAAWC,GAClB,OAAOA,GAA+C,oBAAvBA,EAAc5G,IAC/C,CAEA,SAAS6G,EAAYC,GACnB,IAAIC,EAAaL,EAAcI,GAC/B,OAAOC,GAAcA,EAAWnW,KAAKkW,EACvC,CAEA,SAASJ,EAAcI,GACrB,IAAIC,EAAaD,IACdjB,GAAwBiB,EAASjB,IAClCiB,EAASd,IAEX,GAA0B,oBAAfe,EACT,OAAOA,CAEX,CAEA,SAASC,EAAY9E,GACnB,OAAOA,GAAiC,kBAAjBA,EAAMjS,MAC/B,CAGE,SAASmS,EAAIF,GACX,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsB+E,KAC7C9E,EAAWD,GAASA,EAAMgF,QAAUC,GAAajF,EACrD,CAqCA,SAASK,EAASL,GAChB,OAAiB,OAAVA,QAA4B1I,IAAV0I,EACvB+E,KAAgBG,aAChBjF,EAAWD,GACRI,EAAQJ,GAASA,EAAMgF,QAAUhF,EAAMmF,eACxCC,GAAkBpF,EACxB,CASA,SAASQ,EAAWR,GAClB,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsB+E,KAC5C9E,EAAWD,GACZI,EAAQJ,GAASA,EAAMqF,WAAarF,EAAMsF,eADrBC,GAAoBvF,EAE7C,CAyBA,SAASW,EAAOX,GACd,OACY,OAAVA,QAA4B1I,IAAV0I,EAAsB+E,KACvC9E,EAAWD,GACZI,EAAQJ,GAASA,EAAMqF,WAAarF,EADfuF,GAAoBvF,IAEzCwF,UACJ,CAlJAxB,EAASxV,UAAUiX,SAAW,WAC5B,MAAO,YACT,EAGFzB,EAAS0B,KAAOlC,EAChBQ,EAAS2B,OAASlC,EAClBO,EAAS4B,QAAUlC,EAEnBM,EAASxV,UAAUqX,QACnB7B,EAASxV,UAAUsX,SAAW,WAAc,OAAOlX,KAAK6W,UAAY,EACpEzB,EAASxV,UAAUuV,GAAmB,WACpC,OAAOnV,IACT,EA0CAiR,EAAYK,EAAKH,GAMfG,EAAI6F,GAAK,WACP,OAAO7F,EAAIlS,UACb,EAEAkS,EAAI1R,UAAUwW,MAAQ,WACpB,OAAOpW,IACT,EAEAsR,EAAI1R,UAAUiX,SAAW,WACvB,OAAO7W,KAAKoX,WAAW,QAAS,IAClC,EAEA9F,EAAI1R,UAAUyX,YAAc,WAK1B,OAJKrX,KAAKsX,QAAUtX,KAAKuX,oBACvBvX,KAAKsX,OAAStX,KAAKyW,WAAWe,UAC9BxX,KAAKmM,KAAOnM,KAAKsX,OAAOnY,QAEnBa,IACT,EAIAsR,EAAI1R,UAAUmU,UAAY,SAAS/L,EAAIyP,GACrC,OAAOC,GAAW1X,KAAMgI,EAAIyP,GAAS,EACvC,EAIAnG,EAAI1R,UAAU+X,WAAa,SAASzW,EAAMuW,GACxC,OAAOG,GAAY5X,KAAMkB,EAAMuW,GAAS,EAC1C,EAIFxG,EAAYQ,EAAUH,GASpBG,EAAS7R,UAAU0W,WAAa,WAC9B,OAAOtW,IACT,EAIFiR,EAAYW,EAAYN,GAOtBM,EAAWuF,GAAK,WACd,OAAOvF,EAAWxS,UACpB,EAEAwS,EAAWhS,UAAU8W,aAAe,WAClC,OAAO1W,IACT,EAEA4R,EAAWhS,UAAUiX,SAAW,WAC9B,OAAO7W,KAAKoX,WAAW,QAAS,IAClC,EAEAxF,EAAWhS,UAAUmU,UAAY,SAAS/L,EAAIyP,GAC5C,OAAOC,GAAW1X,KAAMgI,EAAIyP,GAAS,EACvC,EAEA7F,EAAWhS,UAAU+X,WAAa,SAASzW,EAAMuW,GAC/C,OAAOG,GAAY5X,KAAMkB,EAAMuW,GAAS,EAC1C,EAIFxG,EAAYc,EAAQT,GASlBS,EAAOoF,GAAK,WACV,OAAOpF,EAAO3S,UAChB,EAEA2S,EAAOnS,UAAUgX,SAAW,WAC1B,OAAO5W,IACT,EAIFsR,EAAIuG,MAAQA,GACZvG,EAAIoB,MAAQjB,EACZH,EAAIlK,IAAM2K,EACVT,EAAIqB,QAAUf,EAEd,IA2LIkG,EAuUAC,EAqHAC,EAvnBAC,GAAkB,wBAOpB,SAASC,GAASC,GAChBnY,KAAKoY,OAASD,EACdnY,KAAKmM,KAAOgM,EAAMhZ,MACpB,CA+BA,SAASkZ,GAAUC,GACjB,IAAInS,EAAO7G,OAAO6G,KAAKmS,GACvBtY,KAAKuY,QAAUD,EACftY,KAAKwY,MAAQrS,EACbnG,KAAKmM,KAAOhG,EAAKhH,MACnB,CA2CA,SAASsZ,GAAYzC,GACnBhW,KAAK0Y,UAAY1C,EACjBhW,KAAKmM,KAAO6J,EAAS7W,QAAU6W,EAAS7J,IAC1C,CAuCA,SAASwM,GAAY1D,GACnBjV,KAAK4Y,UAAY3D,EACjBjV,KAAK6Y,eAAiB,EACxB,CAiDF,SAAShB,GAAMiB,GACb,SAAUA,IAAYA,EAASb,IACjC,CAIA,SAAS9B,KACP,OAAO2B,IAAcA,EAAY,IAAII,GAAS,IAChD,CAEA,SAAS1B,GAAkBpF,GACzB,IAAI2H,EACF9Z,MAAMC,QAAQkS,GAAS,IAAI8G,GAAS9G,GAAOmF,eAC3CV,EAAWzE,GAAS,IAAIuH,GAAYvH,GAAOmF,eAC3CZ,EAAYvE,GAAS,IAAIqH,GAAYrH,GAAOmF,eAC3B,kBAAVnF,EAAqB,IAAIiH,GAAUjH,QAC1C1I,EACF,IAAKqQ,EACH,MAAM,IAAIC,UACR,yEACsB5H,GAG1B,OAAO2H,CACT,CAEA,SAASpC,GAAoBvF,GAC3B,IAAI2H,EAAME,GAAyB7H,GACnC,IAAK2H,EACH,MAAM,IAAIC,UACR,gDAAkD5H,GAGtD,OAAO2H,CACT,CAEA,SAAS1C,GAAajF,GACpB,IAAI2H,EAAME,GAAyB7H,IACf,kBAAVA,GAAsB,IAAIiH,GAAUjH,GAC9C,IAAK2H,EACH,MAAM,IAAIC,UACR,iEAAmE5H,GAGvE,OAAO2H,CACT,CAEA,SAASE,GAAyB7H,GAChC,OACE8E,EAAY9E,GAAS,IAAI8G,GAAS9G,GAClCyE,EAAWzE,GAAS,IAAIuH,GAAYvH,GACpCuE,EAAYvE,GAAS,IAAIqH,GAAYrH,QACrC1I,CAEJ,CAEA,SAASgP,GAAWqB,EAAK/Q,EAAIyP,EAASyB,GACpC,IAAIC,EAAQJ,EAAIzB,OAChB,GAAI6B,EAAO,CAET,IADA,IAAIC,EAAWD,EAAMha,OAAS,EACrByU,EAAK,EAAGA,GAAMwF,EAAUxF,IAAM,CACrC,IAAIyF,EAAQF,EAAM1B,EAAU2B,EAAWxF,EAAKA,GAC5C,IAAmD,IAA/C5L,EAAGqR,EAAM,GAAIH,EAAUG,EAAM,GAAKzF,EAAImF,GACxC,OAAOnF,EAAK,CAEhB,CACA,OAAOA,CACT,CACA,OAAOmF,EAAIxB,kBAAkBvP,EAAIyP,EACnC,CAEA,SAASG,GAAYmB,EAAK7X,EAAMuW,EAASyB,GACvC,IAAIC,EAAQJ,EAAIzB,OAChB,GAAI6B,EAAO,CACT,IAAIC,EAAWD,EAAMha,OAAS,EAC1ByU,EAAK,EACT,OAAO,IAAIwB,GAAS,WAClB,IAAIiE,EAAQF,EAAM1B,EAAU2B,EAAWxF,EAAKA,GAC5C,OAAOA,IAAOwF,EACZ1D,IACAL,EAAcnU,EAAMgY,EAAUG,EAAM,GAAKzF,EAAK,EAAGyF,EAAM,GAC3D,GACF,CACA,OAAON,EAAIO,mBAAmBpY,EAAMuW,EACtC,CAEA,SAAS8B,GAAOC,EAAMC,GACpB,OAAOA,EACLC,GAAWD,EAAWD,EAAM,GAAI,CAAC,GAAIA,IACrCG,GAAcH,EAClB,CAEA,SAASE,GAAWD,EAAWD,EAAM7Z,EAAKia,GACxC,OAAI3a,MAAMC,QAAQsa,GACTC,EAAU3Z,KAAK8Z,EAAYja,EAAKiS,EAAW4H,GAAMhO,KAAI,SAAS+J,EAAGD,GAAK,OAAOoE,GAAWD,EAAWlE,EAAGD,EAAGkE,EAAK,KAEnHK,GAAWL,GACNC,EAAU3Z,KAAK8Z,EAAYja,EAAK8R,EAAS+H,GAAMhO,KAAI,SAAS+J,EAAGD,GAAK,OAAOoE,GAAWD,EAAWlE,EAAGD,EAAGkE,EAAK,KAE9GA,CACT,CAEA,SAASG,GAAcH,GACrB,OAAIva,MAAMC,QAAQsa,GACT5H,EAAW4H,GAAMhO,IAAImO,IAAeG,SAEzCD,GAAWL,GACN/H,EAAS+H,GAAMhO,IAAImO,IAAeI,QAEpCP,CACT,CAEA,SAASK,GAAWzI,GAClB,OAAOA,IAAUA,EAAM1C,cAAgBpP,aAAgCoJ,IAAtB0I,EAAM1C,YACzD,CAwDA,SAASsL,GAAGC,EAAQC,GAClB,GAAID,IAAWC,GAAWD,IAAWA,GAAUC,IAAWA,EACxD,OAAO,EAET,IAAKD,IAAWC,EACd,OAAO,EAET,GAA8B,oBAAnBD,EAAOE,SACY,oBAAnBD,EAAOC,QAAwB,CAGxC,IAFAF,EAASA,EAAOE,cAChBD,EAASA,EAAOC,YACUF,IAAWA,GAAUC,IAAWA,EACxD,OAAO,EAET,IAAKD,IAAWC,EACd,OAAO,CAEX,CACA,QAA6B,oBAAlBD,EAAOG,QACW,oBAAlBF,EAAOE,SACdH,EAAOG,OAAOF,GAIpB,CAEA,SAASG,GAAUC,EAAGC,GACpB,GAAID,IAAMC,EACR,OAAO,EAGT,IACGlJ,EAAWkJ,SACD7R,IAAX4R,EAAEnO,WAAiCzD,IAAX6R,EAAEpO,MAAsBmO,EAAEnO,OAASoO,EAAEpO,WAChDzD,IAAb4R,EAAEE,aAAqC9R,IAAb6R,EAAEC,QAAwBF,EAAEE,SAAWD,EAAEC,QACnEhJ,EAAQ8I,KAAO9I,EAAQ+I,IACvB5I,EAAU2I,KAAO3I,EAAU4I,IAC3BhI,EAAU+H,KAAO/H,EAAUgI,GAE3B,OAAO,EAGT,GAAe,IAAXD,EAAEnO,MAAyB,IAAXoO,EAAEpO,KACpB,OAAO,EAGT,IAAIsO,GAAkB3I,EAAcwI,GAEpC,GAAI/H,EAAU+H,GAAI,CAChB,IAAII,EAAUJ,EAAEI,UAChB,OAAOH,EAAEI,OAAM,SAASpF,EAAGD,GACzB,IAAI+D,EAAQqB,EAAQxL,OAAOkC,MAC3B,OAAOiI,GAASW,GAAGX,EAAM,GAAI9D,KAAOkF,GAAkBT,GAAGX,EAAM,GAAI/D,GACrE,KAAMoF,EAAQxL,OAAOuG,IACvB,CAEA,IAAImF,GAAU,EAEd,QAAelS,IAAX4R,EAAEnO,KACJ,QAAezD,IAAX6R,EAAEpO,KACyB,oBAAlBmO,EAAEjD,aACXiD,EAAEjD,kBAEC,CACLuD,GAAU,EACV,IAAIC,EAAIP,EACRA,EAAIC,EACJA,EAAIM,CACN,CAGF,IAAIC,GAAW,EACXC,EAAQR,EAAExG,WAAU,SAASwB,EAAGD,GAClC,GAAImF,GAAkBH,EAAEtY,IAAIuT,GACxBqF,GAAWZ,GAAGzE,EAAG+E,EAAEzP,IAAIyK,EAAGtC,KAAagH,GAAGM,EAAEzP,IAAIyK,EAAGtC,GAAUuC,GAE/D,OADAuF,GAAW,GACJ,CAEX,IAEA,OAAOA,GAAYR,EAAEnO,OAAS4O,CAChC,CAIE,SAASC,GAAO5J,EAAO6J,GACrB,KAAMjb,gBAAgBgb,IACpB,OAAO,IAAIA,GAAO5J,EAAO6J,GAI3B,GAFAjb,KAAKkb,OAAS9J,EACdpR,KAAKmM,UAAiBzD,IAAVuS,EAAsBE,IAAW1H,KAAKC,IAAI,EAAGuH,GACvC,IAAdjb,KAAKmM,KAAY,CACnB,GAAI4L,EACF,OAAOA,EAETA,EAAe/X,IACjB,CACF,CAkEF,SAASob,GAAUC,EAAWC,GAC5B,IAAKD,EAAW,MAAM,IAAIE,MAAMD,EAClC,CAIE,SAASE,GAAMC,EAAOnH,EAAKoH,GACzB,KAAM1b,gBAAgBwb,IACpB,OAAO,IAAIA,GAAMC,EAAOnH,EAAKoH,GAe/B,GAbAN,GAAmB,IAATM,EAAY,4BACtBD,EAAQA,GAAS,OACL/S,IAAR4L,IACFA,EAAM6G,KAERO,OAAgBhT,IAATgT,EAAqB,EAAIjI,KAAKkI,IAAID,GACrCpH,EAAMmH,IACRC,GAAQA,GAEV1b,KAAK4b,OAASH,EACdzb,KAAK6b,KAAOvH,EACZtU,KAAK8b,MAAQJ,EACb1b,KAAKmM,KAAOsH,KAAKC,IAAI,EAAGD,KAAKsI,MAAMzH,EAAMmH,GAASC,EAAO,GAAK,GAC5C,IAAd1b,KAAKmM,KAAY,CACnB,GAAI6L,EACF,OAAOA,EAETA,EAAchY,IAChB,CACF,CAyFA,SAASgc,KACP,MAAMhD,UAAU,WAClB,CAGuC,SAASiD,KAAmB,CAE1B,SAASC,KAAqB,CAElC,SAASC,KAAiB,CAjoBjE7K,EAAI1R,UAAUqY,KAAmB,EAIjChH,EAAYiH,GAAUtG,GAMpBsG,GAAStY,UAAUiL,IAAM,SAASF,EAAOyR,GACvC,OAAOpc,KAAKgC,IAAI2I,GAAS3K,KAAKoY,OAAOnE,EAAUjU,KAAM2K,IAAUyR,CACjE,EAEAlE,GAAStY,UAAUmU,UAAY,SAAS/L,EAAIyP,GAG1C,IAFA,IAAIU,EAAQnY,KAAKoY,OACbgB,EAAWjB,EAAMhZ,OAAS,EACrByU,EAAK,EAAGA,GAAMwF,EAAUxF,IAC/B,IAA0D,IAAtD5L,EAAGmQ,EAAMV,EAAU2B,EAAWxF,EAAKA,GAAKA,EAAI5T,MAC9C,OAAO4T,EAAK,EAGhB,OAAOA,CACT,EAEAsE,GAAStY,UAAU+X,WAAa,SAASzW,EAAMuW,GAC7C,IAAIU,EAAQnY,KAAKoY,OACbgB,EAAWjB,EAAMhZ,OAAS,EAC1ByU,EAAK,EACT,OAAO,IAAIwB,GAAS,WACjB,OAAOxB,EAAKwF,EACX1D,IACAL,EAAcnU,EAAM0S,EAAIuE,EAAMV,EAAU2B,EAAWxF,IAAOA,KAAM,GAEtE,EAIF3C,EAAYoH,GAAW5G,GAQrB4G,GAAUzY,UAAUiL,IAAM,SAASlL,EAAKyc,GACtC,YAAoB1T,IAAhB0T,GAA8Bpc,KAAKgC,IAAIrC,GAGpCK,KAAKuY,QAAQ5Y,GAFXyc,CAGX,EAEA/D,GAAUzY,UAAUoC,IAAM,SAASrC,GACjC,OAAOK,KAAKuY,QAAQ1Y,eAAeF,EACrC,EAEA0Y,GAAUzY,UAAUmU,UAAY,SAAS/L,EAAIyP,GAI3C,IAHA,IAAIa,EAAStY,KAAKuY,QACdpS,EAAOnG,KAAKwY,MACZY,EAAWjT,EAAKhH,OAAS,EACpByU,EAAK,EAAGA,GAAMwF,EAAUxF,IAAM,CACrC,IAAIjU,EAAMwG,EAAKsR,EAAU2B,EAAWxF,EAAKA,GACzC,IAAmC,IAA/B5L,EAAGsQ,EAAO3Y,GAAMA,EAAKK,MACvB,OAAO4T,EAAK,CAEhB,CACA,OAAOA,CACT,EAEAyE,GAAUzY,UAAU+X,WAAa,SAASzW,EAAMuW,GAC9C,IAAIa,EAAStY,KAAKuY,QACdpS,EAAOnG,KAAKwY,MACZY,EAAWjT,EAAKhH,OAAS,EACzByU,EAAK,EACT,OAAO,IAAIwB,GAAS,WAClB,IAAIzV,EAAMwG,EAAKsR,EAAU2B,EAAWxF,EAAKA,GACzC,OAAOA,IAAOwF,EACZ1D,IACAL,EAAcnU,EAAMvB,EAAK2Y,EAAO3Y,GACpC,GACF,EAEF0Y,GAAUzY,UAAU6S,IAAuB,EAG3CxB,EAAYwH,GAAa7G,GAMvB6G,GAAY7Y,UAAU2X,kBAAoB,SAASvP,EAAIyP,GACrD,GAAIA,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAE1C,IACIxC,EAAWc,EADA/V,KAAK0Y,WAEhB2D,EAAa,EACjB,GAAIxG,EAAWZ,GAEb,IADA,IAAIyG,IACKA,EAAOzG,EAAS/F,QAAQuG,OACY,IAAvCzN,EAAG0T,EAAKtK,MAAOiL,IAAcrc,QAKrC,OAAOqc,CACT,EAEA5D,GAAY7Y,UAAU0Z,mBAAqB,SAASpY,EAAMuW,GACxD,GAAIA,EACF,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAE7C,IACIxC,EAAWc,EADA/V,KAAK0Y,WAEpB,IAAK7C,EAAWZ,GACd,OAAO,IAAIG,EAASM,GAEtB,IAAI2G,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,OAAOwM,EAAKjG,KAAOiG,EAAOrG,EAAcnU,EAAMmb,IAAcX,EAAKtK,MACnE,GACF,EAIFH,EAAY0H,GAAa/G,GAMvB+G,GAAY/Y,UAAU2X,kBAAoB,SAASvP,EAAIyP,GACrD,GAAIA,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAK1C,IAHA,IAQIiE,EARAzG,EAAWjV,KAAK4Y,UAChBO,EAAQnZ,KAAK6Y,eACbwD,EAAa,EACVA,EAAalD,EAAMha,QACxB,IAAkD,IAA9C6I,EAAGmR,EAAMkD,GAAaA,IAAcrc,MACtC,OAAOqc,EAIX,OAASX,EAAOzG,EAAS/F,QAAQuG,MAAM,CACrC,IAAI6G,EAAMZ,EAAKtK,MAEf,GADA+H,EAAMkD,GAAcC,GACgB,IAAhCtU,EAAGsU,EAAKD,IAAcrc,MACxB,KAEJ,CACA,OAAOqc,CACT,EAEA1D,GAAY/Y,UAAU0Z,mBAAqB,SAASpY,EAAMuW,GACxD,GAAIA,EACF,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAE7C,IAAIxC,EAAWjV,KAAK4Y,UAChBO,EAAQnZ,KAAK6Y,eACbwD,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,GAAIiH,GAAclD,EAAMha,OAAQ,CAC9B,IAAIuc,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAETvC,EAAMkD,GAAcX,EAAKtK,KAC3B,CACA,OAAOiE,EAAcnU,EAAMmb,EAAYlD,EAAMkD,KAC/C,GACF,EAoQFpL,EAAY+J,GAAQpJ,GAgBlBoJ,GAAOpb,UAAUiX,SAAW,WAC1B,OAAkB,IAAd7W,KAAKmM,KACA,YAEF,YAAcnM,KAAKkb,OAAS,IAAMlb,KAAKmM,KAAO,UACvD,EAEA6O,GAAOpb,UAAUiL,IAAM,SAASF,EAAOyR,GACrC,OAAOpc,KAAKgC,IAAI2I,GAAS3K,KAAKkb,OAASkB,CACzC,EAEApB,GAAOpb,UAAU2c,SAAW,SAASC,GACnC,OAAOxC,GAAGha,KAAKkb,OAAQsB,EACzB,EAEAxB,GAAOpb,UAAUkL,MAAQ,SAASuJ,EAAOC,GACvC,IAAInI,EAAOnM,KAAKmM,KAChB,OAAOiI,EAAWC,EAAOC,EAAKnI,GAAQnM,KACpC,IAAIgb,GAAOhb,KAAKkb,OAAQzG,EAAWH,EAAKnI,GAAQoI,EAAaF,EAAOlI,GACxE,EAEA6O,GAAOpb,UAAU6X,QAAU,WACzB,OAAOzX,IACT,EAEAgb,GAAOpb,UAAUwG,QAAU,SAASoW,GAClC,OAAIxC,GAAGha,KAAKkb,OAAQsB,GACX,GAED,CACV,EAEAxB,GAAOpb,UAAU6c,YAAc,SAASD,GACtC,OAAIxC,GAAGha,KAAKkb,OAAQsB,GACXxc,KAAKmM,MAEN,CACV,EAEA6O,GAAOpb,UAAUmU,UAAY,SAAS/L,EAAIyP,GACxC,IAAK,IAAI7D,EAAK,EAAGA,EAAK5T,KAAKmM,KAAMyH,IAC/B,IAAkC,IAA9B5L,EAAGhI,KAAKkb,OAAQtH,EAAI5T,MACtB,OAAO4T,EAAK,EAGhB,OAAOA,CACT,EAEAoH,GAAOpb,UAAU+X,WAAa,SAASzW,EAAMuW,GAAU,IAAIiF,EAAS1c,KAC9D4T,EAAK,EACT,OAAO,IAAIwB,GAAS,WACjB,OAAOxB,EAAK8I,EAAOvQ,KAAOkJ,EAAcnU,EAAM0S,IAAM8I,EAAOxB,QAAUxF,GAAc,GAExF,EAEAsF,GAAOpb,UAAUwa,OAAS,SAASuC,GACjC,OAAOA,aAAiB3B,GACtBhB,GAAGha,KAAKkb,OAAQyB,EAAMzB,QACtBb,GAAUsC,EACd,EASF1L,EAAYuK,GAAO5J,GA2BjB4J,GAAM5b,UAAUiX,SAAW,WACzB,OAAkB,IAAd7W,KAAKmM,KACA,WAEF,WACLnM,KAAK4b,OAAS,MAAQ5b,KAAK6b,MACX,IAAf7b,KAAK8b,MAAc,OAAS9b,KAAK8b,MAAQ,IAC5C,IACF,EAEAN,GAAM5b,UAAUiL,IAAM,SAASF,EAAOyR,GACpC,OAAOpc,KAAKgC,IAAI2I,GACd3K,KAAK4b,OAAS3H,EAAUjU,KAAM2K,GAAS3K,KAAK8b,MAC5CM,CACJ,EAEAZ,GAAM5b,UAAU2c,SAAW,SAASC,GAClC,IAAII,GAAiBJ,EAAcxc,KAAK4b,QAAU5b,KAAK8b,MACvD,OAAOc,GAAiB,GACtBA,EAAgB5c,KAAKmM,MACrByQ,IAAkBnJ,KAAKoJ,MAAMD,EACjC,EAEApB,GAAM5b,UAAUkL,MAAQ,SAASuJ,EAAOC,GACtC,OAAIF,EAAWC,EAAOC,EAAKtU,KAAKmM,MACvBnM,MAETqU,EAAQE,EAAaF,EAAOrU,KAAKmM,OACjCmI,EAAMG,EAAWH,EAAKtU,KAAKmM,QAChBkI,EACF,IAAImH,GAAM,EAAG,GAEf,IAAIA,GAAMxb,KAAK6K,IAAIwJ,EAAOrU,KAAK6b,MAAO7b,KAAK6K,IAAIyJ,EAAKtU,KAAK6b,MAAO7b,KAAK8b,OAC9E,EAEAN,GAAM5b,UAAUwG,QAAU,SAASoW,GACjC,IAAIM,EAAcN,EAAcxc,KAAK4b,OACrC,GAAIkB,EAAc9c,KAAK8b,QAAU,EAAG,CAClC,IAAInR,EAAQmS,EAAc9c,KAAK8b,MAC/B,GAAInR,GAAS,GAAKA,EAAQ3K,KAAKmM,KAC7B,OAAOxB,CAEX,CACA,OAAQ,CACV,EAEA6Q,GAAM5b,UAAU6c,YAAc,SAASD,GACrC,OAAOxc,KAAKoG,QAAQoW,EACtB,EAEAhB,GAAM5b,UAAUmU,UAAY,SAAS/L,EAAIyP,GAIvC,IAHA,IAAI2B,EAAWpZ,KAAKmM,KAAO,EACvBuP,EAAO1b,KAAK8b,MACZ1K,EAAQqG,EAAUzX,KAAK4b,OAASxC,EAAWsC,EAAO1b,KAAK4b,OAClDhI,EAAK,EAAGA,GAAMwF,EAAUxF,IAAM,CACrC,IAA4B,IAAxB5L,EAAGoJ,EAAOwC,EAAI5T,MAChB,OAAO4T,EAAK,EAEdxC,GAASqG,GAAWiE,EAAOA,CAC7B,CACA,OAAO9H,CACT,EAEA4H,GAAM5b,UAAU+X,WAAa,SAASzW,EAAMuW,GAC1C,IAAI2B,EAAWpZ,KAAKmM,KAAO,EACvBuP,EAAO1b,KAAK8b,MACZ1K,EAAQqG,EAAUzX,KAAK4b,OAASxC,EAAWsC,EAAO1b,KAAK4b,OACvDhI,EAAK,EACT,OAAO,IAAIwB,GAAS,WAClB,IAAIG,EAAInE,EAER,OADAA,GAASqG,GAAWiE,EAAOA,EACpB9H,EAAKwF,EAAW1D,IAAiBL,EAAcnU,EAAM0S,IAAM2B,EACpE,GACF,EAEAiG,GAAM5b,UAAUwa,OAAS,SAASuC,GAChC,OAAOA,aAAiBnB,GACtBxb,KAAK4b,SAAWe,EAAMf,QACtB5b,KAAK6b,OAASc,EAAMd,MACpB7b,KAAK8b,QAAUa,EAAMb,MACrBzB,GAAUra,KAAM2c,EACpB,EAKF1L,EAAY+K,GAAY7K,GAMxBF,EAAYgL,GAAiBD,IAE7B/K,EAAYiL,GAAmBF,IAE/B/K,EAAYkL,GAAeH,IAG3BA,GAAWtJ,MAAQuJ,GACnBD,GAAWrJ,QAAUuJ,GACrBF,GAAW5U,IAAM+U,GAEjB,IAAIY,GACmB,oBAAdtJ,KAAKsJ,OAAqD,IAA9BtJ,KAAKsJ,KAAK,WAAY,GACzDtJ,KAAKsJ,KACL,SAAczC,EAAGC,GAGf,IAAIyC,EAAQ,OAFZ1C,GAAQ,GAGJ9Y,EAAQ,OAFZ+Y,GAAQ,GAIR,OAAQyC,EAAIxb,IAAS8Y,IAAM,IAAM9Y,EAAIwb,GAAKzC,IAAM,KAAQ,KAAQ,GAAK,CACvE,EAMF,SAAS0C,GAAIC,GACX,OAASA,IAAQ,EAAK,WAAqB,WAANA,CACvC,CAEA,SAASC,GAAKvX,GACZ,IAAU,IAANA,GAAqB,OAANA,QAAoB8C,IAAN9C,EAC/B,OAAO,EAET,GAAyB,oBAAdA,EAAEuU,WAED,KADVvU,EAAIA,EAAEuU,YACmB,OAANvU,QAAoB8C,IAAN9C,GAC/B,OAAO,EAGX,IAAU,IAANA,EACF,OAAO,EAET,IAAI1E,SAAc0E,EAClB,GAAa,WAAT1E,EAAmB,CACrB,GAAI0E,IAAMA,GAAKA,IAAMuV,IACnB,OAAO,EAET,IAAIiC,EAAQ,EAAJxX,EAIR,IAHIwX,IAAMxX,IACRwX,GAAS,WAAJxX,GAEAA,EAAI,YAETwX,GADAxX,GAAK,WAGP,OAAOqX,GAAIG,EACb,CACA,GAAa,WAATlc,EACF,OAAO0E,EAAEzG,OAASke,GAA+BC,GAAiB1X,GAAK2X,GAAW3X,GAEpF,GAA0B,oBAAfA,EAAE4X,SACX,OAAO5X,EAAE4X,WAEX,GAAa,WAATtc,EACF,OAAOuc,GAAU7X,GAEnB,GAA0B,oBAAfA,EAAEiR,SACX,OAAO0G,GAAW3X,EAAEiR,YAEtB,MAAM,IAAI0E,MAAM,cAAgBra,EAAO,qBACzC,CAEA,SAASoc,GAAiBI,GACxB,IAAIP,EAAOQ,GAAgBD,GAU3B,YATahV,IAATyU,IACFA,EAAOI,GAAWG,GACdE,KAA2BC,KAC7BD,GAAyB,EACzBD,GAAkB,CAAC,GAErBC,KACAD,GAAgBD,GAAUP,GAErBA,CACT,CAGA,SAASI,GAAWG,GAQlB,IADA,IAAIP,EAAO,EACFvJ,EAAK,EAAGA,EAAK8J,EAAOve,OAAQyU,IACnCuJ,EAAO,GAAKA,EAAOO,EAAOI,WAAWlK,GAAM,EAE7C,OAAOqJ,GAAIE,EACb,CAEA,SAASM,GAAUzR,GACjB,IAAImR,EACJ,GAAIY,SAEWrV,KADbyU,EAAOa,GAAQnT,IAAImB,IAEjB,OAAOmR,EAKX,QAAazU,KADbyU,EAAOnR,EAAIiS,KAET,OAAOd,EAGT,IAAKe,GAAmB,CAEtB,QAAaxV,KADbyU,EAAOnR,EAAImS,sBAAwBnS,EAAImS,qBAAqBF,KAE1D,OAAOd,EAIT,QAAazU,KADbyU,EAAOiB,GAAcpS,IAEnB,OAAOmR,CAEX,CAOA,GALAA,IAASkB,GACQ,WAAbA,KACFA,GAAa,GAGXN,GACFC,GAAQlP,IAAI9C,EAAKmR,OACZ,SAAqBzU,IAAjB4V,KAAoD,IAAtBA,GAAatS,GACpD,MAAM,IAAIuP,MAAM,mDACX,GAAI2C,GACT5e,OAAOif,eAAevS,EAAKiS,GAAc,CACvC,YAAc,EACd,cAAgB,EAChB,UAAY,EACZ,MAASd,SAEN,QAAiCzU,IAA7BsD,EAAImS,sBACJnS,EAAImS,uBAAyBnS,EAAI0C,YAAY9O,UAAUue,qBAKhEnS,EAAImS,qBAAuB,WACzB,OAAOne,KAAK0O,YAAY9O,UAAUue,qBAAqBpe,MAAMC,KAAMZ,UACrE,EACA4M,EAAImS,qBAAqBF,IAAgBd,MACpC,SAAqBzU,IAAjBsD,EAAIwS,SAOb,MAAM,IAAIjD,MAAM,sDAFhBvP,EAAIiS,IAAgBd,CAGtB,EAEA,OAAOA,CACT,CAGA,IAAImB,GAAehf,OAAOgf,aAGtBJ,GAAqB,WACvB,IAEE,OADA5e,OAAOif,eAAe,CAAC,EAAG,IAAK,CAAC,IACzB,CACT,CAAE,MAAO1f,GACP,OAAO,CACT,CACF,CAPwB,GAWxB,SAASuf,GAAcK,GACrB,GAAIA,GAAQA,EAAKD,SAAW,EAC1B,OAAQC,EAAKD,UACX,KAAK,EACH,OAAOC,EAAKC,SACd,KAAK,EACH,OAAOD,EAAKE,iBAAmBF,EAAKE,gBAAgBD,SAG5D,CAGA,IACIV,GADAD,GAAkC,oBAAZa,QAEtBb,KACFC,GAAU,IAAIY,SAGhB,IAAIP,GAAa,EAEbJ,GAAe,oBACG,oBAAXjJ,SACTiJ,GAAejJ,OAAOiJ,KAGxB,IAAIZ,GAA+B,GAC/BQ,GAA6B,IAC7BD,GAAyB,EACzBD,GAAkB,CAAC,EAEvB,SAASkB,GAAkB1S,GACzBiP,GACEjP,IAASgP,IACT,oDAEJ,CAME,SAASpN,GAAIqD,GACX,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsB0N,KAC7CC,GAAM3N,KAAWmB,EAAUnB,GAASA,EACpC0N,KAAWE,eAAc,SAASxT,GAChC,IAAIsI,EAAOvC,EAAcH,GACzByN,GAAkB/K,EAAK3H,MACvB2H,EAAKzM,SAAQ,SAASkO,EAAGD,GAAK,OAAO9J,EAAIsD,IAAIwG,EAAGC,EAAE,GACpD,GACJ,CA2KF,SAASwJ,GAAME,GACb,SAAUA,IAAYA,EAASC,IACjC,CAzLAjO,EAAYlD,GAAKkO,IAcflO,GAAIoJ,GAAK,WAAY,IAAIqzE,EAAYx5E,EAAQlR,KAAKV,UAAW,GAC3D,OAAO0f,KAAWE,eAAc,SAASxT,GACvC,IAAK,IAAI/L,EAAI,EAAGA,EAAI+qF,EAAUrrF,OAAQM,GAAK,EAAG,CAC5C,GAAIA,EAAI,GAAK+qF,EAAUrrF,OACrB,MAAM,IAAIoc,MAAM,0BAA4BivE,EAAU/qF,IAExD+L,EAAIsD,IAAI07E,EAAU/qF,GAAI+qF,EAAU/qF,EAAI,GACtC,CACF,GACF,EAEAsO,GAAInO,UAAUiX,SAAW,WACvB,OAAO7W,KAAKoX,WAAW,QAAS,IAClC,EAIArJ,GAAInO,UAAUiL,IAAM,SAASyK,EAAG8G,GAC9B,OAAOpc,KAAKmf,MACVnf,KAAKmf,MAAMtU,IAAI,OAAGnC,EAAW4M,EAAG8G,GAChCA,CACJ,EAIArO,GAAInO,UAAUkP,IAAM,SAASwG,EAAGC,GAC9B,OAAO6J,GAAUpf,KAAMsV,EAAGC,EAC5B,EAEAxH,GAAInO,UAAUyf,MAAQ,SAASC,EAAS/J,GACtC,OAAOvV,KAAKuf,SAASD,EAAStM,GAAS,WAAa,OAAOuC,CAAC,GAC9D,EAEAxH,GAAInO,UAAU4f,OAAS,SAASlK,GAC9B,OAAO8J,GAAUpf,KAAMsV,EAAGtC,EAC5B,EAEAjF,GAAInO,UAAU6f,SAAW,SAASH,GAChC,OAAOtf,KAAKuf,SAASD,GAAS,WAAa,OAAOtM,CAAO,GAC3D,EAEAjF,GAAInO,UAAU8f,OAAS,SAASpK,EAAG8G,EAAauD,GAC9C,OAA4B,IAArBvgB,UAAUD,OACfmW,EAAEtV,MACFA,KAAKuf,SAAS,CAACjK,GAAI8G,EAAauD,EACpC,EAEA5R,GAAInO,UAAU2f,SAAW,SAASD,EAASlD,EAAauD,GACjDA,IACHA,EAAUvD,EACVA,OAAc1T,GAEhB,IAAIkX,EAAeC,GACjB7f,KACA8f,GAAcR,GACdlD,EACAuD,GAEF,OAAOC,IAAiB5M,OAAUtK,EAAYkX,CAChD,EAEA7R,GAAInO,UAAUmgB,MAAQ,WACpB,OAAkB,IAAd/f,KAAKmM,KACAnM,KAELA,KAAKggB,WACPhgB,KAAKmM,KAAO,EACZnM,KAAKmf,MAAQ,KACbnf,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEF8e,IACT,EAIA/Q,GAAInO,UAAUyD,MAAQ,WACpB,OAAO6c,GAAiBlgB,UAAM0I,EAAWtJ,UAC3C,EAEA2O,GAAInO,UAAUugB,UAAY,SAASC,GACjC,OAAOF,GAAiBlgB,KAAMogB,EADwBpP,EAAQlR,KAAKV,UAAW,GAEhF,EAEA2O,GAAInO,UAAUygB,QAAU,SAASf,GAAU,IAAIgB,EAAQtP,EAAQlR,KAAKV,UAAW,GAC7E,OAAOY,KAAKuf,SACVD,EACAR,MACA,SAASyB,GAAK,MAA0B,oBAAZA,EAAEld,MAC5Bkd,EAAEld,MAAMtD,MAAMwgB,EAAGD,GACjBA,EAAMA,EAAMnhB,OAAS,EAAE,GAE7B,EAEA4O,GAAInO,UAAU4gB,UAAY,WACxB,OAAON,GAAiBlgB,KAAMygB,GAAYrhB,UAC5C,EAEA2O,GAAInO,UAAU8gB,cAAgB,SAASN,GAAS,IAAIE,EAAQtP,EAAQlR,KAAKV,UAAW,GAClF,OAAO8gB,GAAiBlgB,KAAM2gB,GAAeP,GAASE,EACxD,EAEAvS,GAAInO,UAAUghB,YAAc,SAAStB,GAAU,IAAIgB,EAAQtP,EAAQlR,KAAKV,UAAW,GACjF,OAAOY,KAAKuf,SACVD,EACAR,MACA,SAASyB,GAAK,MAA8B,oBAAhBA,EAAEC,UAC5BD,EAAEC,UAAUzgB,MAAMwgB,EAAGD,GACrBA,EAAMA,EAAMnhB,OAAS,EAAE,GAE7B,EAEA4O,GAAInO,UAAUihB,KAAO,SAASC,GAE5B,OAAOC,GAAWC,GAAYhhB,KAAM8gB,GACtC,EAEA/S,GAAInO,UAAUqhB,OAAS,SAASC,EAAQJ,GAEtC,OAAOC,GAAWC,GAAYhhB,KAAM8gB,EAAYI,GAClD,EAIAnT,GAAInO,UAAUof,cAAgB,SAAShX,GACrC,IAAImZ,EAAUnhB,KAAKohB,YAEnB,OADApZ,EAAGmZ,GACIA,EAAQE,aAAeF,EAAQG,cAActhB,KAAKggB,WAAahgB,IACxE,EAEA+N,GAAInO,UAAUwhB,UAAY,WACxB,OAAOphB,KAAKggB,UAAYhgB,KAAOA,KAAKshB,cAAc,IAAIjO,EACxD,EAEAtF,GAAInO,UAAU2hB,YAAc,WAC1B,OAAOvhB,KAAKshB,eACd,EAEAvT,GAAInO,UAAUyhB,WAAa,WACzB,OAAOrhB,KAAKigB,SACd,EAEAlS,GAAInO,UAAU+X,WAAa,SAASzW,EAAMuW,GACxC,OAAO,IAAI+J,GAAYxhB,KAAMkB,EAAMuW,EACrC,EAEA1J,GAAInO,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KACxDqc,EAAa,EAKjB,OAJArc,KAAKmf,OAASnf,KAAKmf,MAAMsC,SAAQ,SAASpI,GAExC,OADAgD,IACOrU,EAAGqR,EAAM,GAAIA,EAAM,GAAIqD,EAChC,GAAGjF,GACI4E,CACT,EAEAtO,GAAInO,UAAU0hB,cAAgB,SAASI,GACrC,OAAIA,IAAY1hB,KAAKggB,UACZhgB,KAEJ0hB,EAKEC,GAAQ3hB,KAAKmM,KAAMnM,KAAKmf,MAAOuC,EAAS1hB,KAAKwa,SAJlDxa,KAAKggB,UAAY0B,EACjB1hB,KAAKigB,WAAY,EACVjgB,KAGX,EAOF+N,GAAIgR,MAAQA,GAEZ,IA2ZI6C,GA3ZA1C,GAAkB,wBAElB2C,GAAe9T,GAAInO,UAUrB,SAASkiB,GAAaJ,EAAShH,GAC7B1a,KAAK0hB,QAAUA,EACf1hB,KAAK0a,QAAUA,CACjB,CA+DA,SAASqH,GAAkBL,EAASM,EAAQC,GAC1CjiB,KAAK0hB,QAAUA,EACf1hB,KAAKgiB,OAASA,EACdhiB,KAAKiiB,MAAQA,CACf,CAiEA,SAASC,GAAiBR,EAASS,EAAOF,GACxCjiB,KAAK0hB,QAAUA,EACf1hB,KAAKmiB,MAAQA,EACbniB,KAAKiiB,MAAQA,CACf,CAsDA,SAASG,GAAkBV,EAASW,EAAS3H,GAC3C1a,KAAK0hB,QAAUA,EACf1hB,KAAKqiB,QAAUA,EACfriB,KAAK0a,QAAUA,CACjB,CAwEA,SAAS4H,GAAUZ,EAASW,EAAShJ,GACnCrZ,KAAK0hB,QAAUA,EACf1hB,KAAKqiB,QAAUA,EACfriB,KAAKqZ,MAAQA,CACf,CA+DA,SAASmI,GAAYhW,EAAKtK,EAAMuW,GAC9BzX,KAAKuiB,MAAQrhB,EACblB,KAAKwiB,SAAW/K,EAChBzX,KAAKyiB,OAASjX,EAAI2T,OAASuD,GAAiBlX,EAAI2T,MAClD,CAqCF,SAASwD,GAAiBzhB,EAAMmY,GAC9B,OAAOhE,EAAcnU,EAAMmY,EAAM,GAAIA,EAAM,GAC7C,CAEA,SAASqJ,GAAiBjE,EAAMmE,GAC9B,MAAO,CACLnE,KAAMA,EACN9T,MAAO,EACPkY,OAAQD,EAEZ,CAEA,SAASjB,GAAQxV,EAAM2W,EAAMpB,EAASvE,GACpC,IAAI3R,EAAMlM,OAAOmP,OAAOoT,IAMxB,OALArW,EAAIW,KAAOA,EACXX,EAAI2T,MAAQ2D,EACZtX,EAAIwU,UAAY0B,EAChBlW,EAAIgP,OAAS2C,EACb3R,EAAIyU,WAAY,EACTzU,CACT,CAGA,SAASsT,KACP,OAAO8C,KAAcA,GAAYD,GAAQ,GAC3C,CAEA,SAASvC,GAAU5T,EAAK8J,EAAGC,GACzB,IAAIwN,EACAC,EACJ,GAAKxX,EAAI2T,MAMF,CACL,IAAI8D,EAAgB9P,EAAQF,GACxBiQ,EAAW/P,EAAQD,GAEvB,GADA6P,EAAUI,GAAW3X,EAAI2T,MAAO3T,EAAIwU,UAAW,OAAGtX,EAAW4M,EAAGC,EAAG0N,EAAeC,IAC7EA,EAAS9R,MACZ,OAAO5F,EAETwX,EAAUxX,EAAIW,MAAQ8W,EAAc7R,MAAQmE,IAAMvC,GAAW,EAAI,EAAI,EACvE,KAdgB,CACd,GAAIuC,IAAMvC,EACR,OAAOxH,EAETwX,EAAU,EACVD,EAAU,IAAIjB,GAAatW,EAAIwU,UAAW,CAAC,CAAC1K,EAAGC,IACjD,CASA,OAAI/J,EAAIwU,WACNxU,EAAIW,KAAO6W,EACXxX,EAAI2T,MAAQ4D,EACZvX,EAAIgP,YAAS9R,EACb8C,EAAIyU,WAAY,EACTzU,GAEFuX,EAAUpB,GAAQqB,EAASD,GAAWjE,IAC/C,CAEA,SAASqE,GAAW1E,EAAMiD,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAC5E,OAAKzE,EAQEA,EAAKiB,OAAOgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAPjE9R,IAAU4B,EACLyL,GAETrL,EAAO8P,GACP9P,EAAO6P,GACA,IAAIX,GAAUZ,EAASW,EAAS,CAAC1iB,EAAKyR,IAGjD,CAEA,SAASiS,GAAW5E,GAClB,OAAOA,EAAK/P,cAAgB4T,IAAa7D,EAAK/P,cAAgB0T,EAChE,CAEA,SAASkB,GAAc7E,EAAMiD,EAAS0B,EAAOf,EAAShJ,GACpD,GAAIoF,EAAK4D,UAAYA,EACnB,OAAO,IAAID,GAAkBV,EAASW,EAAS,CAAC5D,EAAKpF,MAAOA,IAG9D,IAGIkK,EAHAC,GAAkB,IAAVJ,EAAc3E,EAAK4D,QAAU5D,EAAK4D,UAAYe,GAASrQ,EAC/D0Q,GAAkB,IAAVL,EAAcf,EAAUA,IAAYe,GAASrQ,EAOzD,OAAO,IAAIgP,GAAkBL,EAAU,GAAK8B,EAAS,GAAKC,EAJ9CD,IAASC,EACnB,CAACH,GAAc7E,EAAMiD,EAAS0B,EAAQvQ,EAAOwP,EAAShJ,KACpDkK,EAAU,IAAIjB,GAAUZ,EAASW,EAAShJ,GAASmK,EAAOC,EAAO,CAAChF,EAAM8E,GAAW,CAACA,EAAS9E,IAGnG,CAEA,SAASiF,GAAYhC,EAAShH,EAAS/a,EAAKyR,GACrCsQ,IACHA,EAAU,IAAIrO,GAGhB,IADA,IAAIoL,EAAO,IAAI6D,GAAUZ,EAASvE,GAAKxd,GAAM,CAACA,EAAKyR,IAC1CwC,EAAK,EAAGA,EAAK8G,EAAQvb,OAAQyU,IAAM,CAC1C,IAAIyF,EAAQqB,EAAQ9G,GACpB6K,EAAOA,EAAKiB,OAAOgC,EAAS,OAAGhZ,EAAW2Q,EAAM,GAAIA,EAAM,GAC5D,CACA,OAAOoF,CACT,CAEA,SAASkF,GAAUjC,EAASO,EAAOE,EAAOyB,GAIxC,IAHA,IAAI5B,EAAS,EACT6B,EAAW,EACXC,EAAc,IAAI7kB,MAAMkjB,GACnBvO,EAAK,EAAGmQ,EAAM,EAAGvQ,EAAMyO,EAAM9iB,OAAQyU,EAAKJ,EAAKI,IAAMmQ,IAAQ,EAAG,CACvE,IAAItF,EAAOwD,EAAMrO,QACJlL,IAAT+V,GAAsB7K,IAAOgQ,IAC/B5B,GAAU+B,EACVD,EAAYD,KAAcpF,EAE9B,CACA,OAAO,IAAIsD,GAAkBL,EAASM,EAAQ8B,EAChD,CAEA,SAASE,GAAYtC,EAASO,EAAOD,EAAQiC,EAAWxF,GAGtD,IAFA,IAAI0D,EAAQ,EACR+B,EAAgB,IAAIjlB,MAAM6T,GACrBc,EAAK,EAAc,IAAXoO,EAAcpO,IAAMoO,KAAY,EAC/CkC,EAActQ,GAAe,EAAToO,EAAaC,EAAME,UAAWzZ,EAGpD,OADAwb,EAAcD,GAAaxF,EACpB,IAAIyD,GAAiBR,EAASS,EAAQ,EAAG+B,EAClD,CAEA,SAAShE,GAAiB1U,EAAK4U,EAAQ+D,GAErC,IADA,IAAI7D,EAAQ,GACH1M,EAAK,EAAGA,EAAKuQ,EAAUhlB,OAAQyU,IAAM,CAC5C,IAAIxC,EAAQ+S,EAAUvQ,GAClBE,EAAOvC,EAAcH,GACpBC,EAAWD,KACd0C,EAAOA,EAAKtI,KAAI,SAAS+J,GAAK,OAAOgE,GAAOhE,EAAE,KAEhD+K,EAAMvc,KAAK+P,EACb,CACA,OAAOsQ,GAAwB5Y,EAAK4U,EAAQE,EAC9C,CAEA,SAASG,GAAW4D,EAAUjT,EAAOzR,GACnC,OAAO0kB,GAAYA,EAAS7D,WAAanP,EAAWD,GAClDiT,EAAS7D,UAAUpP,GACnB4I,GAAGqK,EAAUjT,GAASiT,EAAWjT,CACrC,CAEA,SAASuP,GAAeP,GACtB,OAAO,SAASiE,EAAUjT,EAAOzR,GAC/B,GAAI0kB,GAAYA,EAAS3D,eAAiBrP,EAAWD,GACnD,OAAOiT,EAAS3D,cAAcN,EAAQhP,GAExC,IAAIkT,EAAYlE,EAAOiE,EAAUjT,EAAOzR,GACxC,OAAOqa,GAAGqK,EAAUC,GAAaD,EAAWC,CAC9C,CACF,CAEA,SAASF,GAAwBG,EAAYnE,EAAQE,GAEnD,OAAqB,KADrBA,EAAQA,EAAMpe,QAAO,SAASsiB,GAAK,OAAkB,IAAXA,EAAErY,IAAU,KAC5ChN,OACDolB,EAEe,IAApBA,EAAWpY,MAAeoY,EAAWvE,WAA8B,IAAjBM,EAAMnhB,OAGrDolB,EAAWvF,eAAc,SAASuF,GAUvC,IATA,IAAIE,EAAerE,EACjB,SAAShP,EAAOzR,GACd4kB,EAAW7E,OAAO/f,EAAKqT,GAAS,SAASqR,GACtC,OAAOA,IAAarR,EAAU5B,EAAQgP,EAAOiE,EAAUjT,EAAOzR,EAAI,GAEvE,EACA,SAASyR,EAAOzR,GACd4kB,EAAWzV,IAAInP,EAAKyR,EACtB,EACOwC,EAAK,EAAGA,EAAK0M,EAAMnhB,OAAQyU,IAClC0M,EAAM1M,GAAIvM,QAAQod,EAEtB,IAfSF,EAAW7V,YAAY4R,EAAM,GAgBxC,CAEA,SAAST,GAAgBwE,EAAUK,EAAatI,EAAauD,GAC3D,IAAIgF,EAAWN,IAAarR,EACxB0I,EAAOgJ,EAAYxV,OACvB,GAAIwM,EAAKjG,KAAM,CACb,IAAImP,EAAgBD,EAAWvI,EAAciI,EACzCQ,EAAWlF,EAAQiF,GACvB,OAAOC,IAAaD,EAAgBP,EAAWQ,CACjD,CACAzJ,GACEuJ,GAAaN,GAAYA,EAASvV,IAClC,mBAEF,IAAInP,EAAM+b,EAAKtK,MACX0T,EAAeH,EAAW3R,EAAUqR,EAASxZ,IAAIlL,EAAKqT,GACtD+R,EAAclF,GAChBiF,EACAJ,EACAtI,EACAuD,GAEF,OAAOoF,IAAgBD,EAAeT,EACpCU,IAAgB/R,EAAUqR,EAAS7E,OAAO7f,IACzCglB,EAAW7F,KAAauF,GAAUvV,IAAInP,EAAKolB,EAChD,CAEA,SAASC,GAASR,GAMhB,OAHAA,GADAA,GAAS,WADTA,GAAUA,GAAK,EAAK,cACKA,GAAK,EAAK,aACzBA,GAAK,GAAM,UACrBA,GAASA,GAAK,EAEH,KADXA,GAASA,GAAK,GAEhB,CAEA,SAASnF,GAAMlH,EAAO8M,EAAK3I,EAAK4I,GAC9B,IAAIC,EAAWD,EAAU/M,EAAQ7E,EAAQ6E,GAEzC,OADAgN,EAASF,GAAO3I,EACT6I,CACT,CAEA,SAASC,GAASjN,EAAO8M,EAAK3I,EAAK4I,GACjC,IAAIG,EAASlN,EAAMhZ,OAAS,EAC5B,GAAI+lB,GAAWD,EAAM,IAAMI,EAEzB,OADAlN,EAAM8M,GAAO3I,EACNnE,EAIT,IAFA,IAAIgN,EAAW,IAAIlmB,MAAMomB,GACrBC,EAAQ,EACH1R,EAAK,EAAGA,EAAKyR,EAAQzR,IACxBA,IAAOqR,GACTE,EAASvR,GAAM0I,EACfgJ,GAAS,GAETH,EAASvR,GAAMuE,EAAMvE,EAAK0R,GAG9B,OAAOH,CACT,CAEA,SAASI,GAAUpN,EAAO8M,EAAKC,GAC7B,IAAIG,EAASlN,EAAMhZ,OAAS,EAC5B,GAAI+lB,GAAWD,IAAQI,EAErB,OADAlN,EAAMqN,MACCrN,EAIT,IAFA,IAAIgN,EAAW,IAAIlmB,MAAMomB,GACrBC,EAAQ,EACH1R,EAAK,EAAGA,EAAKyR,EAAQzR,IACxBA,IAAOqR,IACTK,EAAQ,GAEVH,EAASvR,GAAMuE,EAAMvE,EAAK0R,GAE5B,OAAOH,CACT,CA5nBAtD,GAAa3C,KAAmB,EAChC2C,GAAajP,GAAUiP,GAAarC,OACpCqC,GAAa4D,SAAW5D,GAAapC,SAYnCqC,GAAaliB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,GAEzD,IADA,IAAI1B,EAAU1a,KAAK0a,QACV9G,EAAK,EAAGJ,EAAMkH,EAAQvb,OAAQyU,EAAKJ,EAAKI,IAC/C,GAAIoG,GAAGra,EAAK+a,EAAQ9G,GAAI,IACtB,OAAO8G,EAAQ9G,GAAI,GAGvB,OAAOwI,CACT,EAEA0F,GAAaliB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAK3F,IAJA,IAAIwC,EAAUtU,IAAU4B,EAEpB0H,EAAU1a,KAAK0a,QACfuK,EAAM,EACDzR,EAAMkH,EAAQvb,OAAQ8lB,EAAMzR,IAC/BwG,GAAGra,EAAK+a,EAAQuK,GAAK,IADeA,KAK1C,IAAIU,EAASV,EAAMzR,EAEnB,GAAImS,EAASjL,EAAQuK,GAAK,KAAO7T,EAAQsU,EACvC,OAAO1lB,KAMT,GAHAoT,EAAO8P,IACNwC,IAAYC,IAAWvS,EAAO6P,IAE3ByC,GAA8B,IAAnBhL,EAAQvb,OAAvB,CAIA,IAAKwmB,IAAWD,GAAWhL,EAAQvb,QAAUymB,GAC3C,OAAOlC,GAAYhC,EAAShH,EAAS/a,EAAKyR,GAG5C,IAAIyU,EAAanE,GAAWA,IAAY1hB,KAAK0hB,QACzCoE,EAAaD,EAAanL,EAAUpH,EAAQoH,GAYhD,OAVIiL,EACED,EACFT,IAAQzR,EAAM,EAAIsS,EAAWN,MAASM,EAAWb,GAAOa,EAAWN,MAEnEM,EAAWb,GAAO,CAACtlB,EAAKyR,GAG1B0U,EAAW/hB,KAAK,CAACpE,EAAKyR,IAGpByU,GACF7lB,KAAK0a,QAAUoL,EACR9lB,MAGF,IAAI8hB,GAAaJ,EAASoE,EAxBjC,CAyBF,EAWA/D,GAAkBniB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,QAC9C1T,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAEjB,IAAIokB,EAAO,KAAiB,IAAVX,EAAcf,EAAUA,IAAYe,GAASrQ,GAC3DiP,EAAShiB,KAAKgiB,OAClB,OAA0B,KAAlBA,EAAS+B,GAAa3H,EAC5Bpc,KAAKiiB,MAAM+C,GAAShD,EAAU+B,EAAM,IAAKlZ,IAAIuY,EAAQvQ,EAAOwP,EAAS1iB,EAAKyc,EAC9E,EAEA2F,GAAkBniB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,QAChFxa,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAEjB,IAAIomB,GAAyB,IAAV3C,EAAcf,EAAUA,IAAYe,GAASrQ,EAC5DgR,EAAM,GAAKgC,EACX/D,EAAShiB,KAAKgiB,OACd2D,EAA4B,KAAlB3D,EAAS+B,GAEvB,IAAK4B,GAAUvU,IAAU4B,EACvB,OAAOhT,KAGT,IAAIilB,EAAMD,GAAShD,EAAU+B,EAAM,GAC/B9B,EAAQjiB,KAAKiiB,MACbxD,EAAOkH,EAAS1D,EAAMgD,QAAOvc,EAC7B6a,EAAUJ,GAAW1E,EAAMiD,EAAS0B,EAAQvQ,EAAOwP,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAE3F,GAAIK,IAAY9E,EACd,OAAOze,KAGT,IAAK2lB,GAAUpC,GAAWtB,EAAM9iB,QAAU6mB,GACxC,OAAOhC,GAAYtC,EAASO,EAAOD,EAAQ+D,EAAaxC,GAG1D,GAAIoC,IAAWpC,GAA4B,IAAjBtB,EAAM9iB,QAAgBkkB,GAAWpB,EAAY,EAANgD,IAC/D,OAAOhD,EAAY,EAANgD,GAGf,GAAIU,GAAUpC,GAA4B,IAAjBtB,EAAM9iB,QAAgBkkB,GAAWE,GACxD,OAAOA,EAGT,IAAIsC,EAAanE,GAAWA,IAAY1hB,KAAK0hB,QACzCuE,EAAYN,EAASpC,EAAUvB,EAASA,EAAS+B,EAAM/B,EAAS+B,EAChEmC,EAAWP,EAASpC,EACtBlE,GAAM4C,EAAOgD,EAAK1B,EAASsC,GAC3BN,GAAUtD,EAAOgD,EAAKY,GACtBT,GAASnD,EAAOgD,EAAK1B,EAASsC,GAEhC,OAAIA,GACF7lB,KAAKgiB,OAASiE,EACdjmB,KAAKiiB,MAAQiE,EACNlmB,MAGF,IAAI+hB,GAAkBL,EAASuE,EAAWC,EACnD,EAWAhE,GAAiBtiB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,QAC7C1T,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAEjB,IAAIslB,GAAiB,IAAV7B,EAAcf,EAAUA,IAAYe,GAASrQ,EACpD0L,EAAOze,KAAKiiB,MAAMgD,GACtB,OAAOxG,EAAOA,EAAK5T,IAAIuY,EAAQvQ,EAAOwP,EAAS1iB,EAAKyc,GAAeA,CACrE,EAEA8F,GAAiBtiB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,QAC/Exa,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAEjB,IAAIslB,GAAiB,IAAV7B,EAAcf,EAAUA,IAAYe,GAASrQ,EACpD2S,EAAUtU,IAAU4B,EACpBiP,EAAQjiB,KAAKiiB,MACbxD,EAAOwD,EAAMgD,GAEjB,GAAIS,IAAYjH,EACd,OAAOze,KAGT,IAAIujB,EAAUJ,GAAW1E,EAAMiD,EAAS0B,EAAQvQ,EAAOwP,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GAC3F,GAAIK,IAAY9E,EACd,OAAOze,KAGT,IAAImmB,EAAWnmB,KAAKmiB,MACpB,GAAK1D,GAEE,IAAK8E,KACV4C,EACeC,GACb,OAAOzC,GAAUjC,EAASO,EAAOkE,EAAUlB,QAJ7CkB,IAQF,IAAIN,EAAanE,GAAWA,IAAY1hB,KAAK0hB,QACzCwE,EAAW7G,GAAM4C,EAAOgD,EAAK1B,EAASsC,GAE1C,OAAIA,GACF7lB,KAAKmiB,MAAQgE,EACbnmB,KAAKiiB,MAAQiE,EACNlmB,MAGF,IAAIkiB,GAAiBR,EAASyE,EAAUD,EACjD,EAWA9D,GAAkBxiB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,GAE9D,IADA,IAAI1B,EAAU1a,KAAK0a,QACV9G,EAAK,EAAGJ,EAAMkH,EAAQvb,OAAQyU,EAAKJ,EAAKI,IAC/C,GAAIoG,GAAGra,EAAK+a,EAAQ9G,GAAI,IACtB,OAAO8G,EAAQ9G,GAAI,GAGvB,OAAOwI,CACT,EAEAgG,GAAkBxiB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,QAChFxa,IAAZ2Z,IACFA,EAAUlF,GAAKxd,IAGjB,IAAI+lB,EAAUtU,IAAU4B,EAExB,GAAIqP,IAAYriB,KAAKqiB,QACnB,OAAIqD,EACK1lB,MAEToT,EAAO8P,GACP9P,EAAO6P,GACAK,GAActjB,KAAM0hB,EAAS0B,EAAOf,EAAS,CAAC1iB,EAAKyR,KAK5D,IAFA,IAAIsJ,EAAU1a,KAAK0a,QACfuK,EAAM,EACDzR,EAAMkH,EAAQvb,OAAQ8lB,EAAMzR,IAC/BwG,GAAGra,EAAK+a,EAAQuK,GAAK,IADeA,KAK1C,IAAIU,EAASV,EAAMzR,EAEnB,GAAImS,EAASjL,EAAQuK,GAAK,KAAO7T,EAAQsU,EACvC,OAAO1lB,KAMT,GAHAoT,EAAO8P,IACNwC,IAAYC,IAAWvS,EAAO6P,GAE3ByC,GAAmB,IAARlS,EACb,OAAO,IAAI8O,GAAUZ,EAAS1hB,KAAKqiB,QAAS3H,EAAc,EAANuK,IAGtD,IAAIY,EAAanE,GAAWA,IAAY1hB,KAAK0hB,QACzCoE,EAAaD,EAAanL,EAAUpH,EAAQoH,GAYhD,OAVIiL,EACED,EACFT,IAAQzR,EAAM,EAAIsS,EAAWN,MAASM,EAAWb,GAAOa,EAAWN,MAEnEM,EAAWb,GAAO,CAACtlB,EAAKyR,GAG1B0U,EAAW/hB,KAAK,CAACpE,EAAKyR,IAGpByU,GACF7lB,KAAK0a,QAAUoL,EACR9lB,MAGF,IAAIoiB,GAAkBV,EAAS1hB,KAAKqiB,QAASyD,EACtD,EAWAxD,GAAU1iB,UAAUiL,IAAM,SAASuY,EAAOf,EAAS1iB,EAAKyc,GACtD,OAAOpC,GAAGra,EAAKK,KAAKqZ,MAAM,IAAMrZ,KAAKqZ,MAAM,GAAK+C,CAClD,EAEAkG,GAAU1iB,UAAU8f,OAAS,SAASgC,EAAS0B,EAAOf,EAAS1iB,EAAKyR,EAAO6R,EAAeC,GACxF,IAAIwC,EAAUtU,IAAU4B,EACpBqT,EAAWrM,GAAGra,EAAKK,KAAKqZ,MAAM,IAClC,OAAIgN,EAAWjV,IAAUpR,KAAKqZ,MAAM,GAAKqM,GAChC1lB,MAGToT,EAAO8P,GAEHwC,OACFtS,EAAO6P,GAILoD,EACE3E,GAAWA,IAAY1hB,KAAK0hB,SAC9B1hB,KAAKqZ,MAAM,GAAKjI,EACTpR,MAEF,IAAIsiB,GAAUZ,EAAS1hB,KAAKqiB,QAAS,CAAC1iB,EAAKyR,KAGpDgC,EAAO6P,GACAK,GAActjB,KAAM0hB,EAAS0B,EAAOjG,GAAKxd,GAAM,CAACA,EAAKyR,KAC9D,EAMF0Q,GAAaliB,UAAU6hB,QACvBW,GAAkBxiB,UAAU6hB,QAAU,SAAUzZ,EAAIyP,GAElD,IADA,IAAIiD,EAAU1a,KAAK0a,QACV9G,EAAK,EAAGwF,EAAWsB,EAAQvb,OAAS,EAAGyU,GAAMwF,EAAUxF,IAC9D,IAAkD,IAA9C5L,EAAG0S,EAAQjD,EAAU2B,EAAWxF,EAAKA,IACvC,OAAO,CAGb,EAEAmO,GAAkBniB,UAAU6hB,QAC5BS,GAAiBtiB,UAAU6hB,QAAU,SAAUzZ,EAAIyP,GAEjD,IADA,IAAIwK,EAAQjiB,KAAKiiB,MACRrO,EAAK,EAAGwF,EAAW6I,EAAM9iB,OAAS,EAAGyU,GAAMwF,EAAUxF,IAAM,CAClE,IAAI6K,EAAOwD,EAAMxK,EAAU2B,EAAWxF,EAAKA,GAC3C,GAAI6K,IAAsC,IAA9BA,EAAKgD,QAAQzZ,EAAIyP,GAC3B,OAAO,CAEX,CACF,EAEA6K,GAAU1iB,UAAU6hB,QAAU,SAAUzZ,EAAIyP,GAC1C,OAAOzP,EAAGhI,KAAKqZ,MACjB,EAEApI,EAAYuQ,GAAapM,GAQvBoM,GAAY5hB,UAAUsP,KAAO,WAG3B,IAFA,IAAIhO,EAAOlB,KAAKuiB,MACZ+D,EAAQtmB,KAAKyiB,OACV6D,GAAO,CACZ,IAEIlN,EAFAqF,EAAO6H,EAAM7H,KACb9T,EAAQ2b,EAAM3b,QAElB,GAAI8T,EAAKpF,OACP,GAAc,IAAV1O,EACF,OAAOgY,GAAiBzhB,EAAMud,EAAKpF,YAEhC,GAAIoF,EAAK/D,SAEd,GAAI/P,IADJyO,EAAWqF,EAAK/D,QAAQvb,OAAS,GAE/B,OAAOwjB,GAAiBzhB,EAAMud,EAAK/D,QAAQ1a,KAAKwiB,SAAWpJ,EAAWzO,EAAQA,SAIhF,GAAIA,IADJyO,EAAWqF,EAAKwD,MAAM9iB,OAAS,GACR,CACrB,IAAIonB,EAAU9H,EAAKwD,MAAMjiB,KAAKwiB,SAAWpJ,EAAWzO,EAAQA,GAC5D,GAAI4b,EAAS,CACX,GAAIA,EAAQlN,MACV,OAAOsJ,GAAiBzhB,EAAMqlB,EAAQlN,OAExCiN,EAAQtmB,KAAKyiB,OAASC,GAAiB6D,EAASD,EAClD,CACA,QACF,CAEFA,EAAQtmB,KAAKyiB,OAASziB,KAAKyiB,OAAOI,MACpC,CACA,OAAOnN,GACT,EA+PF,IAAIkQ,GAAqB9S,EAAO,EAC5BkT,GAA0BlT,EAAO,EACjCsT,GAA0BtT,EAAO,EAMnC,SAAS3H,GAAKiG,GACZ,IAAIoV,EAAQC,KACZ,GAAc,OAAVrV,QAA4B1I,IAAV0I,EACpB,OAAOoV,EAET,GAAIE,GAAOtV,GACT,OAAOA,EAET,IAAI0C,EAAOpC,EAAgBN,GACvBjF,EAAO2H,EAAK3H,KAChB,OAAa,IAATA,EACKqa,GAET3H,GAAkB1S,GACdA,EAAO,GAAKA,EAAO2G,EACd6T,GAAS,EAAGxa,EAAM0G,EAAO,KAAM,IAAI+T,GAAM9S,EAAK0D,YAEhDgP,EAAMxH,eAAc,SAAS6H,GAClCA,EAAKC,QAAQ3a,GACb2H,EAAKzM,SAAQ,SAASkO,EAAG9V,GAAK,OAAOonB,EAAK/X,IAAIrP,EAAG8V,EAAE,GACrD,IACF,CA0JF,SAASmR,GAAOK,GACd,SAAUA,IAAaA,EAAUC,IACnC,CArLA/V,EAAY9F,GAAM+Q,IA2BhB/Q,GAAKgM,GAAK,WACR,OAAOnX,KAAKZ,UACd,EAEA+L,GAAKvL,UAAUiX,SAAW,WACxB,OAAO7W,KAAKoX,WAAW,SAAU,IACnC,EAIAjM,GAAKvL,UAAUiL,IAAM,SAASF,EAAOyR,GAEnC,IADAzR,EAAQsJ,EAAUjU,KAAM2K,KACX,GAAKA,EAAQ3K,KAAKmM,KAAM,CAEnC,IAAIsS,EAAOwI,GAAYjnB,KADvB2K,GAAS3K,KAAKknB,SAEd,OAAOzI,GAAQA,EAAKtG,MAAMxN,EAAQoI,EACpC,CACA,OAAOqJ,CACT,EAIAjR,GAAKvL,UAAUkP,IAAM,SAASnE,EAAOyG,GACnC,OAAO+V,GAAWnnB,KAAM2K,EAAOyG,EACjC,EAEAjG,GAAKvL,UAAU4f,OAAS,SAAS7U,GAC/B,OAAQ3K,KAAKgC,IAAI2I,GACL,IAAVA,EAAc3K,KAAKojB,QACnBzY,IAAU3K,KAAKmM,KAAO,EAAInM,KAAKwlB,MAC/BxlB,KAAKonB,OAAOzc,EAAO,GAHK3K,IAI5B,EAEAmL,GAAKvL,UAAUynB,OAAS,SAAS1c,EAAOyG,GACtC,OAAOpR,KAAKonB,OAAOzc,EAAO,EAAGyG,EAC/B,EAEAjG,GAAKvL,UAAUmgB,MAAQ,WACrB,OAAkB,IAAd/f,KAAKmM,KACAnM,KAELA,KAAKggB,WACPhgB,KAAKmM,KAAOnM,KAAKknB,QAAUlnB,KAAKsnB,UAAY,EAC5CtnB,KAAKunB,OAAS1U,EACd7S,KAAKmf,MAAQnf,KAAKwnB,MAAQ,KAC1BxnB,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEFymB,IACT,EAEAtb,GAAKvL,UAAUmE,KAAO,WACpB,IAAI0jB,EAASroB,UACTsoB,EAAU1nB,KAAKmM,KACnB,OAAOnM,KAAKgf,eAAc,SAAS6H,GACjCc,GAAcd,EAAM,EAAGa,EAAUD,EAAOtoB,QACxC,IAAK,IAAIyU,EAAK,EAAGA,EAAK6T,EAAOtoB,OAAQyU,IACnCiT,EAAK/X,IAAI4Y,EAAU9T,EAAI6T,EAAO7T,GAElC,GACF,EAEAzI,GAAKvL,UAAU4lB,IAAM,WACnB,OAAOmC,GAAc3nB,KAAM,GAAI,EACjC,EAEAmL,GAAKvL,UAAUgoB,QAAU,WACvB,IAAIH,EAASroB,UACb,OAAOY,KAAKgf,eAAc,SAAS6H,GACjCc,GAAcd,GAAOY,EAAOtoB,QAC5B,IAAK,IAAIyU,EAAK,EAAGA,EAAK6T,EAAOtoB,OAAQyU,IACnCiT,EAAK/X,IAAI8E,EAAI6T,EAAO7T,GAExB,GACF,EAEAzI,GAAKvL,UAAUwjB,MAAQ,WACrB,OAAOuE,GAAc3nB,KAAM,EAC7B,EAIAmL,GAAKvL,UAAUyD,MAAQ,WACrB,OAAOwkB,GAAkB7nB,UAAM0I,EAAWtJ,UAC5C,EAEA+L,GAAKvL,UAAUugB,UAAY,SAASC,GAClC,OAAOyH,GAAkB7nB,KAAMogB,EADwBpP,EAAQlR,KAAKV,UAAW,GAEjF,EAEA+L,GAAKvL,UAAU4gB,UAAY,WACzB,OAAOqH,GAAkB7nB,KAAMygB,GAAYrhB,UAC7C,EAEA+L,GAAKvL,UAAU8gB,cAAgB,SAASN,GAAS,IAAIE,EAAQtP,EAAQlR,KAAKV,UAAW,GACnF,OAAOyoB,GAAkB7nB,KAAM2gB,GAAeP,GAASE,EACzD,EAEAnV,GAAKvL,UAAUknB,QAAU,SAAS3a,GAChC,OAAOwb,GAAc3nB,KAAM,EAAGmM,EAChC,EAIAhB,GAAKvL,UAAUkL,MAAQ,SAASuJ,EAAOC,GACrC,IAAInI,EAAOnM,KAAKmM,KAChB,OAAIiI,EAAWC,EAAOC,EAAKnI,GAClBnM,KAEF2nB,GACL3nB,KACAuU,EAAaF,EAAOlI,GACpBsI,EAAWH,EAAKnI,GAEpB,EAEAhB,GAAKvL,UAAU+X,WAAa,SAASzW,EAAMuW,GACzC,IAAI9M,EAAQ,EACR8c,EAASK,GAAY9nB,KAAMyX,GAC/B,OAAO,IAAIrC,GAAS,WAClB,IAAIhE,EAAQqW,IACZ,OAAOrW,IAAU2W,GACfrS,IACAL,EAAcnU,EAAMyJ,IAASyG,EACjC,GACF,EAEAjG,GAAKvL,UAAUmU,UAAY,SAAS/L,EAAIyP,GAItC,IAHA,IAEIrG,EAFAzG,EAAQ,EACR8c,EAASK,GAAY9nB,KAAMyX,IAEvBrG,EAAQqW,OAAcM,KACK,IAA7B/f,EAAGoJ,EAAOzG,IAAS3K,QAIzB,OAAO2K,CACT,EAEAQ,GAAKvL,UAAU0hB,cAAgB,SAASI,GACtC,OAAIA,IAAY1hB,KAAKggB,UACZhgB,KAEJ0hB,EAIEiF,GAAS3mB,KAAKknB,QAASlnB,KAAKsnB,UAAWtnB,KAAKunB,OAAQvnB,KAAKmf,MAAOnf,KAAKwnB,MAAO9F,EAAS1hB,KAAKwa,SAH/Fxa,KAAKggB,UAAY0B,EACV1hB,KAGX,EAOFmL,GAAKub,OAASA,GAEd,IAAIM,GAAmB,yBAEnBgB,GAAgB7c,GAAKvL,UAiBvB,SAASgnB,GAAMzO,EAAOuJ,GACpB1hB,KAAKmY,MAAQA,EACbnY,KAAK0hB,QAAUA,CACjB,CAnBFsG,GAAchB,KAAoB,EAClCgB,GAAcpV,GAAUoV,GAAcxI,OACtCwI,GAAc3I,MAAQwC,GAAaxC,MACnC2I,GAAcvI,SACduI,GAAcvC,SAAW5D,GAAa4D,SACtCuC,GAActI,OAASmC,GAAanC,OACpCsI,GAAczI,SAAWsC,GAAatC,SACtCyI,GAAc3H,QAAUwB,GAAaxB,QACrC2H,GAAcpH,YAAciB,GAAajB,YACzCoH,GAAchJ,cAAgB6C,GAAa7C,cAC3CgJ,GAAc5G,UAAYS,GAAaT,UACvC4G,GAAczG,YAAcM,GAAaN,YACzCyG,GAAc3G,WAAaQ,GAAaR,WAWtCuF,GAAMhnB,UAAUqoB,aAAe,SAASvG,EAASwG,EAAOvd,GACtD,GAAIA,IAAUud,EAAQ,GAAKA,EAAmC,IAAtBloB,KAAKmY,MAAMhZ,OACjD,OAAOa,KAET,IAAImoB,EAAexd,IAAUud,EAASnV,EACtC,GAAIoV,GAAenoB,KAAKmY,MAAMhZ,OAC5B,OAAO,IAAIynB,GAAM,GAAIlF,GAEvB,IACI0G,EADAC,EAAgC,IAAhBF,EAEpB,GAAID,EAAQ,EAAG,CACb,IAAII,EAAWtoB,KAAKmY,MAAMgQ,GAE1B,IADAC,EAAWE,GAAYA,EAASL,aAAavG,EAASwG,EAAQrV,EAAOlI,MACpD2d,GAAYD,EAC3B,OAAOroB,IAEX,CACA,GAAIqoB,IAAkBD,EACpB,OAAOpoB,KAET,IAAIuoB,EAAWC,GAAcxoB,KAAM0hB,GACnC,IAAK2G,EACH,IAAK,IAAIzU,EAAK,EAAGA,EAAKuU,EAAavU,IACjC2U,EAASpQ,MAAMvE,QAAMlL,EAMzB,OAHI0f,IACFG,EAASpQ,MAAMgQ,GAAeC,GAEzBG,CACT,EAEA3B,GAAMhnB,UAAU6oB,YAAc,SAAS/G,EAASwG,EAAOvd,GACrD,GAAIA,KAAWud,EAAQ,GAAKA,EAAQ,IAA4B,IAAtBloB,KAAKmY,MAAMhZ,OACnD,OAAOa,KAET,IAKIooB,EALAM,EAAc/d,EAAQ,IAAOud,EAASnV,EAC1C,GAAI2V,GAAa1oB,KAAKmY,MAAMhZ,OAC1B,OAAOa,KAIT,GAAIkoB,EAAQ,EAAG,CACb,IAAII,EAAWtoB,KAAKmY,MAAMuQ,GAE1B,IADAN,EAAWE,GAAYA,EAASG,YAAY/G,EAASwG,EAAQrV,EAAOlI,MACnD2d,GAAYI,IAAc1oB,KAAKmY,MAAMhZ,OAAS,EAC7D,OAAOa,IAEX,CAEA,IAAIuoB,EAAWC,GAAcxoB,KAAM0hB,GAKnC,OAJA6G,EAASpQ,MAAMiP,OAAOsB,EAAY,GAC9BN,IACFG,EAASpQ,MAAMuQ,GAAaN,GAEvBG,CACT,EAIF,IA2EII,GAiWAC,GA5aAb,GAAO,CAAC,EAEZ,SAASD,GAAYjB,EAAMpP,GACzB,IAAIoR,EAAOhC,EAAKK,QACZ4B,EAAQjC,EAAKS,UACbyB,EAAUC,GAAcF,GACxBG,EAAOpC,EAAKW,MAEhB,OAAO0B,EAAkBrC,EAAK1H,MAAO0H,EAAKU,OAAQ,GAElD,SAAS2B,EAAkBzK,EAAMyJ,EAAO9d,GACtC,OAAiB,IAAV8d,EACLiB,EAAY1K,EAAMrU,GAClBgf,EAAY3K,EAAMyJ,EAAO9d,EAC7B,CAEA,SAAS+e,EAAY1K,EAAMrU,GACzB,IAAI+N,EAAQ/N,IAAW2e,EAAUE,GAAQA,EAAK9Q,MAAQsG,GAAQA,EAAKtG,MAC/DkR,EAAOjf,EAASye,EAAO,EAAIA,EAAOze,EAClCkf,EAAKR,EAAQ1e,EAIjB,OAHIkf,EAAKxW,IACPwW,EAAKxW,GAEA,WACL,GAAIuW,IAASC,EACX,OAAOvB,GAET,IAAI9C,EAAMxN,IAAY6R,EAAKD,IAC3B,OAAOlR,GAASA,EAAM8M,EACxB,CACF,CAEA,SAASmE,EAAY3K,EAAMyJ,EAAO9d,GAChC,IAAIqd,EACAtP,EAAQsG,GAAQA,EAAKtG,MACrBkR,EAAOjf,EAASye,EAAO,EAAKA,EAAOze,GAAW8d,EAC9CoB,EAAmC,GAA5BR,EAAQ1e,GAAW8d,GAI9B,OAHIoB,EAAKxW,IACPwW,EAAKxW,GAEA,WACL,OAAG,CACD,GAAI2U,EAAQ,CACV,IAAIrW,EAAQqW,IACZ,GAAIrW,IAAU2W,GACZ,OAAO3W,EAETqW,EAAS,IACX,CACA,GAAI4B,IAASC,EACX,OAAOvB,GAET,IAAI9C,EAAMxN,IAAY6R,EAAKD,IAC3B5B,EAASyB,EACP/Q,GAASA,EAAM8M,GAAMiD,EAAQrV,EAAOzI,GAAU6a,GAAOiD,GAEzD,CACF,CACF,CACF,CAEA,SAASvB,GAAS4C,EAAQC,EAAUtB,EAAOpF,EAAMmG,EAAMvH,EAASvE,GAC9D,IAAI0J,EAAOvnB,OAAOmP,OAAOuZ,IAUzB,OATAnB,EAAK1a,KAAOqd,EAAWD,EACvB1C,EAAKK,QAAUqC,EACf1C,EAAKS,UAAYkC,EACjB3C,EAAKU,OAASW,EACdrB,EAAK1H,MAAQ2D,EACb+D,EAAKW,MAAQyB,EACbpC,EAAK7G,UAAY0B,EACjBmF,EAAKrM,OAAS2C,EACd0J,EAAK5G,WAAY,EACV4G,CACT,CAGA,SAASJ,KACP,OAAOkC,KAAeA,GAAahC,GAAS,EAAG,EAAG9T,GACpD,CAEA,SAASsU,GAAWN,EAAMlc,EAAOyG,GAG/B,IAFAzG,EAAQsJ,EAAU4S,EAAMlc,MAEVA,EACZ,OAAOkc,EAGT,GAAIlc,GAASkc,EAAK1a,MAAQxB,EAAQ,EAChC,OAAOkc,EAAK7H,eAAc,SAAS6H,GACjClc,EAAQ,EACNgd,GAAcd,EAAMlc,GAAOmE,IAAI,EAAGsC,GAClCuW,GAAcd,EAAM,EAAGlc,EAAQ,GAAGmE,IAAInE,EAAOyG,EACjD,IAGFzG,GAASkc,EAAKK,QAEd,IAAIuC,EAAU5C,EAAKW,MACfzE,EAAU8D,EAAK1H,MACf+D,EAAW/P,EAAQD,GAOvB,OANIvI,GAASqe,GAAcnC,EAAKS,WAC9BmC,EAAUC,GAAYD,EAAS5C,EAAK7G,UAAW,EAAGrV,EAAOyG,EAAO8R,GAEhEH,EAAU2G,GAAY3G,EAAS8D,EAAK7G,UAAW6G,EAAKU,OAAQ5c,EAAOyG,EAAO8R,GAGvEA,EAAS9R,MAIVyV,EAAK7G,WACP6G,EAAK1H,MAAQ4D,EACb8D,EAAKW,MAAQiC,EACb5C,EAAKrM,YAAS9R,EACdme,EAAK5G,WAAY,EACV4G,GAEFF,GAASE,EAAKK,QAASL,EAAKS,UAAWT,EAAKU,OAAQxE,EAAS0G,GAV3D5C,CAWX,CAEA,SAAS6C,GAAYjL,EAAMiD,EAASwG,EAAOvd,EAAOyG,EAAO8R,GACvD,IAMIK,EANA0B,EAAOta,IAAUud,EAASnV,EAC1B4W,EAAUlL,GAAQwG,EAAMxG,EAAKtG,MAAMhZ,OACvC,IAAKwqB,QAAqBjhB,IAAV0I,EACd,OAAOqN,EAKT,GAAIyJ,EAAQ,EAAG,CACb,IAAI0B,EAAYnL,GAAQA,EAAKtG,MAAM8M,GAC/B4E,EAAeH,GAAYE,EAAWlI,EAASwG,EAAQrV,EAAOlI,EAAOyG,EAAO8R,GAChF,OAAI2G,IAAiBD,EACZnL,IAET8E,EAAUiF,GAAc/J,EAAMiD,IACtBvJ,MAAM8M,GAAO4E,EACdtG,EACT,CAEA,OAAIoG,GAAWlL,EAAKtG,MAAM8M,KAAS7T,EAC1BqN,GAGTrL,EAAO8P,GAEPK,EAAUiF,GAAc/J,EAAMiD,QAChBhZ,IAAV0I,GAAuB6T,IAAQ1B,EAAQpL,MAAMhZ,OAAS,EACxDokB,EAAQpL,MAAMqN,MAEdjC,EAAQpL,MAAM8M,GAAO7T,EAEhBmS,EACT,CAEA,SAASiF,GAAc/J,EAAMiD,GAC3B,OAAIA,GAAWjD,GAAQiD,IAAYjD,EAAKiD,QAC/BjD,EAEF,IAAImI,GAAMnI,EAAOA,EAAKtG,MAAMrN,QAAU,GAAI4W,EACnD,CAEA,SAASuF,GAAYJ,EAAMiD,GACzB,GAAIA,GAAYd,GAAcnC,EAAKS,WACjC,OAAOT,EAAKW,MAEd,GAAIsC,EAAW,GAAMjD,EAAKU,OAAS1U,EAAQ,CAGzC,IAFA,IAAI4L,EAAOoI,EAAK1H,MACZ+I,EAAQrB,EAAKU,OACV9I,GAAQyJ,EAAQ,GACrBzJ,EAAOA,EAAKtG,MAAO2R,IAAa5B,EAASnV,GACzCmV,GAASrV,EAEX,OAAO4L,CACT,CACF,CAEA,SAASkJ,GAAcd,EAAMxS,EAAOC,QAGpB5L,IAAV2L,IACFA,GAAgB,QAEN3L,IAAR4L,IACFA,GAAY,GAEd,IAAIyV,EAAQlD,EAAK7G,WAAa,IAAI3M,EAC9B2W,EAAYnD,EAAKK,QACjB+C,EAAcpD,EAAKS,UACnB4C,EAAYF,EAAY3V,EACxB8V,OAAsBzhB,IAAR4L,EAAoB2V,EAAc3V,EAAM,EAAI2V,EAAc3V,EAAM0V,EAAY1V,EAC9F,GAAI4V,IAAcF,GAAaG,IAAgBF,EAC7C,OAAOpD,EAIT,GAAIqD,GAAaC,EACf,OAAOtD,EAAK9G,QAQd,IALA,IAAIqK,EAAWvD,EAAKU,OAChBxE,EAAU8D,EAAK1H,MAGfkL,EAAc,EACXH,EAAYG,EAAc,GAC/BtH,EAAU,IAAI6D,GAAM7D,GAAWA,EAAQ5K,MAAMhZ,OAAS,MAACuJ,EAAWqa,GAAW,GAAIgH,GAEjFM,GAAe,IADfD,GAAYvX,GAGVwX,IACFH,GAAaG,EACbL,GAAaK,EACbF,GAAeE,EACfJ,GAAeI,GAOjB,IAJA,IAAIC,EAAgBtB,GAAciB,GAC9BM,EAAgBvB,GAAcmB,GAG3BI,GAAiB,GAAMH,EAAWvX,GACvCkQ,EAAU,IAAI6D,GAAM7D,GAAWA,EAAQ5K,MAAMhZ,OAAS,CAAC4jB,GAAW,GAAIgH,GACtEK,GAAYvX,EAId,IAAI2X,EAAU3D,EAAKW,MACfiC,EAAUc,EAAgBD,EAC5BrD,GAAYJ,EAAMsD,EAAc,GAChCI,EAAgBD,EAAgB,IAAI1D,GAAM,GAAImD,GAASS,EAGzD,GAAIA,GAAWD,EAAgBD,GAAiBJ,EAAYD,GAAeO,EAAQrS,MAAMhZ,OAAQ,CAG/F,IADA,IAAIsf,EADJsE,EAAUyF,GAAczF,EAASgH,GAExB7B,EAAQkC,EAAUlC,EAAQrV,EAAOqV,GAASrV,EAAO,CACxD,IAAIoS,EAAOqF,IAAkBpC,EAASnV,EACtC0L,EAAOA,EAAKtG,MAAM8M,GAAOuD,GAAc/J,EAAKtG,MAAM8M,GAAM8E,EAC1D,CACAtL,EAAKtG,MAAOmS,IAAkBzX,EAASE,GAAQyX,CACjD,CAQA,GALIL,EAAcF,IAChBR,EAAUA,GAAWA,EAAQhB,YAAYsB,EAAO,EAAGI,IAIjDD,GAAaK,EACfL,GAAaK,EACbJ,GAAeI,EACfH,EAAWvX,EACXkQ,EAAU,KACV0G,EAAUA,GAAWA,EAAQxB,aAAa8B,EAAO,EAAGG,QAG/C,GAAIA,EAAYF,GAAaO,EAAgBD,EAAe,CAIjE,IAHAD,EAAc,EAGPtH,GAAS,CACd,IAAI0H,EAAcP,IAAcE,EAAYrX,EAC5C,GAAI0X,IAAgBF,IAAkBH,EAAYrX,EAChD,MAEE0X,IACFJ,IAAgB,GAAKD,GAAYK,GAEnCL,GAAYvX,EACZkQ,EAAUA,EAAQ5K,MAAMsS,EAC1B,CAGI1H,GAAWmH,EAAYF,IACzBjH,EAAUA,EAAQkF,aAAa8B,EAAOK,EAAUF,EAAYG,IAE1DtH,GAAWwH,EAAgBD,IAC7BvH,EAAUA,EAAQ0F,YAAYsB,EAAOK,EAAUG,EAAgBF,IAE7DA,IACFH,GAAaG,EACbF,GAAeE,EAEnB,CAEA,OAAIxD,EAAK7G,WACP6G,EAAK1a,KAAOge,EAAcD,EAC1BrD,EAAKK,QAAUgD,EACfrD,EAAKS,UAAY6C,EACjBtD,EAAKU,OAAS6C,EACdvD,EAAK1H,MAAQ4D,EACb8D,EAAKW,MAAQiC,EACb5C,EAAKrM,YAAS9R,EACdme,EAAK5G,WAAY,EACV4G,GAEFF,GAASuD,EAAWC,EAAaC,EAAUrH,EAAS0G,EAC7D,CAEA,SAAS5B,GAAkBhB,EAAMzG,EAAQ+D,GAGvC,IAFA,IAAI7D,EAAQ,GACRoK,EAAU,EACL9W,EAAK,EAAGA,EAAKuQ,EAAUhlB,OAAQyU,IAAM,CAC5C,IAAIxC,EAAQ+S,EAAUvQ,GAClBE,EAAOpC,EAAgBN,GACvB0C,EAAK3H,KAAOue,IACdA,EAAU5W,EAAK3H,MAEZkF,EAAWD,KACd0C,EAAOA,EAAKtI,KAAI,SAAS+J,GAAK,OAAOgE,GAAOhE,EAAE,KAEhD+K,EAAMvc,KAAK+P,EACb,CAIA,OAHI4W,EAAU7D,EAAK1a,OACjB0a,EAAOA,EAAKC,QAAQ4D,IAEftG,GAAwByC,EAAMzG,EAAQE,EAC/C,CAEA,SAAS0I,GAAc7c,GACrB,OAAOA,EAAO2G,EAAO,EAAO3G,EAAO,IAAO0G,GAAUA,CACtD,CAME,SAASkO,GAAW3P,GAClB,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsBuZ,KAC7CC,GAAaxZ,GAASA,EACtBuZ,KAAkB3L,eAAc,SAASxT,GACvC,IAAIsI,EAAOvC,EAAcH,GACzByN,GAAkB/K,EAAK3H,MACvB2H,EAAKzM,SAAQ,SAASkO,EAAGD,GAAK,OAAO9J,EAAIsD,IAAIwG,EAAGC,EAAE,GACpD,GACJ,CAuEF,SAASqV,GAAaC,GACpB,OAAO9L,GAAM8L,IAAoBtY,EAAUsY,EAC7C,CASA,SAASC,GAAetf,EAAKqb,EAAMnF,EAASvE,GAC1C,IAAI4N,EAAOzrB,OAAOmP,OAAOsS,GAAWnhB,WAMpC,OALAmrB,EAAK5e,KAAOX,EAAMA,EAAIW,KAAO,EAC7B4e,EAAKC,KAAOxf,EACZuf,EAAKE,MAAQpE,EACbkE,EAAK/K,UAAY0B,EACjBqJ,EAAKvQ,OAAS2C,EACP4N,CACT,CAGA,SAASJ,KACP,OAAO/B,KAAsBA,GAAoBkC,GAAehM,KAAY2H,MAC9E,CAEA,SAASyE,GAAiBH,EAAMzV,EAAGC,GACjC,IAII4V,EACAC,EALA5f,EAAMuf,EAAKC,KACXnE,EAAOkE,EAAKE,MACZxrB,EAAI+L,EAAIX,IAAIyK,GACZtT,OAAY0G,IAANjJ,EAGV,GAAI8V,IAAMvC,EAAS,CACjB,IAAKhR,EACH,OAAO+oB,EAELlE,EAAK1a,MAAQ2G,GAAQ+T,EAAK1a,MAAmB,EAAXX,EAAIW,MAExCgf,GADAC,EAAUvE,EAAK3kB,QAAO,SAASmX,EAAO4L,GAAO,YAAiBvc,IAAV2Q,GAAuB5Z,IAAMwlB,CAAG,KACnE3O,aAAa9K,KAAI,SAAS6N,GAAS,OAAOA,EAAM,EAAE,IAAGgS,OAAOtR,QACzEgR,EAAK/K,YACPmL,EAAOnL,UAAYoL,EAAQpL,UAAY+K,EAAK/K,aAG9CmL,EAAS3f,EAAIgU,OAAOlK,GACpB8V,EAAU3rB,IAAMonB,EAAK1a,KAAO,EAAI0a,EAAKrB,MAAQqB,EAAK/X,IAAIrP,OAAGiJ,GAE7D,MACE,GAAI1G,EAAK,CACP,GAAIuT,IAAMsR,EAAKhc,IAAIpL,GAAG,GACpB,OAAOsrB,EAETI,EAAS3f,EACT4f,EAAUvE,EAAK/X,IAAIrP,EAAG,CAAC6V,EAAGC,GAC5B,MACE4V,EAAS3f,EAAIsD,IAAIwG,EAAGuR,EAAK1a,MACzBif,EAAUvE,EAAK/X,IAAI+X,EAAK1a,KAAM,CAACmJ,EAAGC,IAGtC,OAAIwV,EAAK/K,WACP+K,EAAK5e,KAAOgf,EAAOhf,KACnB4e,EAAKC,KAAOG,EACZJ,EAAKE,MAAQG,EACbL,EAAKvQ,YAAS9R,EACPqiB,GAEFD,GAAeK,EAAQC,EAChC,CAGE,SAASE,GAAgBC,EAASrS,GAChClZ,KAAKwrB,MAAQD,EACbvrB,KAAKyrB,SAAWvS,EAChBlZ,KAAKmM,KAAOof,EAAQpf,IACtB,CA0DA,SAASuf,GAAkB5X,GACzB9T,KAAKwrB,MAAQ1X,EACb9T,KAAKmM,KAAO2H,EAAK3H,IACnB,CAwBA,SAASwf,GAAc7X,GACrB9T,KAAKwrB,MAAQ1X,EACb9T,KAAKmM,KAAO2H,EAAK3H,IACnB,CAsBA,SAASyf,GAAoBlR,GAC3B1a,KAAKwrB,MAAQ9Q,EACb1a,KAAKmM,KAAOuO,EAAQvO,IACtB,CAuDF,SAAS0f,GAAY7V,GACnB,IAAI8V,EAAeC,GAAa/V,GAiChC,OAhCA8V,EAAaN,MAAQxV,EACrB8V,EAAa3f,KAAO6J,EAAS7J,KAC7B2f,EAAaT,KAAO,WAAa,OAAOrV,CAAQ,EAChD8V,EAAarU,QAAU,WACrB,IAAIuU,EAAmBhW,EAASyB,QAAQ1X,MAAMC,MAE9C,OADAgsB,EAAiBX,KAAO,WAAa,OAAOrV,EAASyB,SAAS,EACvDuU,CACT,EACAF,EAAa9pB,IAAM,SAASrC,GAAO,OAAOqW,EAASuG,SAAS5c,EAAI,EAChEmsB,EAAavP,SAAW,SAAS5c,GAAO,OAAOqW,EAAShU,IAAIrC,EAAI,EAChEmsB,EAAazU,YAAc4U,GAC3BH,EAAavU,kBAAoB,SAAUvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACpE,OAAOgW,EAASjC,WAAU,SAASwB,EAAGD,GAAK,OAA4B,IAArBtN,EAAGsN,EAAGC,EAAGmH,EAAiB,GAAGjF,EACjF,EACAqU,EAAaxS,mBAAqB,SAASpY,EAAMuW,GAC/C,GAAIvW,IAAS4T,EAAiB,CAC5B,IAAIG,EAAWe,EAAS2B,WAAWzW,EAAMuW,GACzC,OAAO,IAAIrC,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,IAAKwM,EAAKjG,KAAM,CACd,IAAIH,EAAIoG,EAAKtK,MAAM,GACnBsK,EAAKtK,MAAM,GAAKsK,EAAKtK,MAAM,GAC3BsK,EAAKtK,MAAM,GAAKkE,CAClB,CACA,OAAOoG,CACT,GACF,CACA,OAAO1F,EAAS2B,WACdzW,IAAS2T,EAAiBD,EAAeC,EACzC4C,EAEJ,EACOqU,CACT,CAGA,SAASI,GAAWlW,EAAUkL,EAAQiL,GACpC,IAAIC,EAAiBL,GAAa/V,GAgClC,OA/BAoW,EAAejgB,KAAO6J,EAAS7J,KAC/BigB,EAAepqB,IAAM,SAASrC,GAAO,OAAOqW,EAAShU,IAAIrC,EAAI,EAC7DysB,EAAevhB,IAAM,SAASlL,EAAKyc,GACjC,IAAI7G,EAAIS,EAASnL,IAAIlL,EAAKqT,GAC1B,OAAOuC,IAAMvC,EACXoJ,EACA8E,EAAOphB,KAAKqsB,EAAS5W,EAAG5V,EAAKqW,EACjC,EACAoW,EAAe7U,kBAAoB,SAAUvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACtE,OAAOgW,EAASjC,WACd,SAASwB,EAAGD,EAAG0H,GAAK,OAAwD,IAAjDhV,EAAGkZ,EAAOphB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,GAAI1H,EAAGoH,EAAiB,GACjFjF,EAEJ,EACA2U,EAAe9S,mBAAqB,SAAUpY,EAAMuW,GAClD,IAAIxC,EAAWe,EAAS2B,WAAW7C,EAAiB2C,GACpD,OAAO,IAAIrC,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAET,IAAIrC,EAAQqC,EAAKtK,MACbzR,EAAM0Z,EAAM,GAChB,OAAOhE,EACLnU,EACAvB,EACAuhB,EAAOphB,KAAKqsB,EAAS9S,EAAM,GAAI1Z,EAAKqW,GACpC0F,EAEJ,GACF,EACO0Q,CACT,CAGA,SAASC,GAAerW,EAAUkD,GAChC,IAAI8S,EAAmBD,GAAa/V,GAsBpC,OArBAgW,EAAiBR,MAAQxV,EACzBgW,EAAiB7f,KAAO6J,EAAS7J,KACjC6f,EAAiBvU,QAAU,WAAa,OAAOzB,CAAQ,EACnDA,EAASqV,OACXW,EAAiBX,KAAO,WACtB,IAAIS,EAAeD,GAAY7V,GAE/B,OADA8V,EAAarU,QAAU,WAAa,OAAOzB,EAASqV,MAAM,EACnDS,CACT,GAEFE,EAAiBnhB,IAAM,SAASlL,EAAKyc,GAClC,OAAOpG,EAASnL,IAAIqO,EAAUvZ,GAAO,EAAIA,EAAKyc,EAAY,EAC7D4P,EAAiBhqB,IAAM,SAASrC,GAC7B,OAAOqW,EAAShU,IAAIkX,EAAUvZ,GAAO,EAAIA,EAAI,EAChDqsB,EAAiBzP,SAAW,SAASnL,GAAS,OAAO4E,EAASuG,SAASnL,EAAM,EAC7E4a,EAAiB3U,YAAc4U,GAC/BD,EAAiBjY,UAAY,SAAU/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KAChE,OAAOgW,EAASjC,WAAU,SAASwB,EAAGD,GAAK,OAAOtN,EAAGuN,EAAGD,EAAGoH,EAAO,IAAIjF,EACxE,EACAuU,EAAiBrU,WACf,SAASzW,EAAMuW,GAAW,OAAOzB,EAAS2B,WAAWzW,GAAOuW,EAAQ,EAC/DuU,CACT,CAGA,SAASM,GAActW,EAAUuW,EAAWJ,EAASjT,GACnD,IAAIsT,EAAiBT,GAAa/V,GAwClC,OAvCIkD,IACFsT,EAAexqB,IAAM,SAASrC,GAC5B,IAAI4V,EAAIS,EAASnL,IAAIlL,EAAKqT,GAC1B,OAAOuC,IAAMvC,KAAauZ,EAAUzsB,KAAKqsB,EAAS5W,EAAG5V,EAAKqW,EAC5D,EACAwW,EAAe3hB,IAAM,SAASlL,EAAKyc,GACjC,IAAI7G,EAAIS,EAASnL,IAAIlL,EAAKqT,GAC1B,OAAOuC,IAAMvC,GAAWuZ,EAAUzsB,KAAKqsB,EAAS5W,EAAG5V,EAAKqW,GACtDT,EAAI6G,CACR,GAEFoQ,EAAejV,kBAAoB,SAAUvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KAClEqc,EAAa,EAOjB,OANArG,EAASjC,WAAU,SAASwB,EAAGD,EAAG0H,GAChC,GAAIuP,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,GAEhC,OADAX,IACOrU,EAAGuN,EAAG2D,EAAU5D,EAAI+G,EAAa,EAAGK,EAE/C,GAAGjF,GACI4E,CACT,EACAmQ,EAAelT,mBAAqB,SAAUpY,EAAMuW,GAClD,IAAIxC,EAAWe,EAAS2B,WAAW7C,EAAiB2C,GAChD4E,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,OAAa,CACX,IAAIsG,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAET,IAAIrC,EAAQqC,EAAKtK,MACbzR,EAAM0Z,EAAM,GACZjI,EAAQiI,EAAM,GAClB,GAAIkT,EAAUzsB,KAAKqsB,EAAS/a,EAAOzR,EAAKqW,GACtC,OAAOX,EAAcnU,EAAMgY,EAAUvZ,EAAM0c,IAAcjL,EAAOsK,EAEpE,CACF,GACF,EACO8Q,CACT,CAGA,SAASC,GAAezW,EAAU0W,EAASP,GACzC,IAAIQ,EAAS5e,KAAMqT,YAQnB,OAPApL,EAASjC,WAAU,SAASwB,EAAGD,GAC7BqX,EAAOjN,OACLgN,EAAQ5sB,KAAKqsB,EAAS5W,EAAGD,EAAGU,GAC5B,GACA,SAASsE,GAAK,OAAOA,EAAI,CAAC,GAE9B,IACOqS,EAAOpL,aAChB,CAGA,SAASqL,GAAe5W,EAAU0W,EAASP,GACzC,IAAIU,EAAcrb,EAAQwE,GACtB2W,GAAUpa,EAAUyD,GAAY+K,KAAehT,MAAOqT,YAC1DpL,EAASjC,WAAU,SAASwB,EAAGD,GAC7BqX,EAAOjN,OACLgN,EAAQ5sB,KAAKqsB,EAAS5W,EAAGD,EAAGU,IAC5B,SAASsE,GAAK,OAAQA,EAAIA,GAAK,IAAMvW,KAAK8oB,EAAc,CAACvX,EAAGC,GAAKA,GAAI+E,CAAE,GAE3E,IACA,IAAIwS,EAASC,GAAc/W,GAC3B,OAAO2W,EAAOnhB,KAAI,SAAS+H,GAAO,OAAOyZ,GAAMhX,EAAU8W,EAAOvZ,GAAK,GACvE,CAGA,SAAS0Z,GAAajX,EAAU3B,EAAOC,EAAK4E,GAC1C,IAAIgU,EAAelX,EAAS7J,KAe5B,QAXczD,IAAV2L,IACFA,GAAgB,QAEN3L,IAAR4L,IACEA,IAAQ6G,IACV7G,EAAM4Y,EAEN5Y,GAAY,GAIZF,EAAWC,EAAOC,EAAK4Y,GACzB,OAAOlX,EAGT,IAAImX,EAAgB5Y,EAAaF,EAAO6Y,GACpCE,EAAc3Y,EAAWH,EAAK4Y,GAKlC,GAAIC,IAAkBA,GAAiBC,IAAgBA,EACrD,OAAOH,GAAajX,EAASI,QAAQiB,cAAehD,EAAOC,EAAK4E,GAOlE,IACImU,EADAC,EAAeF,EAAcD,EAE7BG,IAAiBA,IACnBD,EAAYC,EAAe,EAAI,EAAIA,GAGrC,IAAIC,EAAWxB,GAAa/V,GA6D5B,OAzDAuX,EAASphB,KAAqB,IAAdkhB,EAAkBA,EAAYrX,EAAS7J,MAAQkhB,QAAa3kB,GAEvEwQ,GAAWrB,GAAM7B,IAAaqX,GAAa,IAC9CE,EAAS1iB,IAAM,SAAUF,EAAOyR,GAE9B,OADAzR,EAAQsJ,EAAUjU,KAAM2K,KACR,GAAKA,EAAQ0iB,EAC3BrX,EAASnL,IAAIF,EAAQwiB,EAAe/Q,GACpCA,CACJ,GAGFmR,EAAShW,kBAAoB,SAASvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KAC/D,GAAkB,IAAdqtB,EACF,OAAO,EAET,GAAI5V,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAE1C,IAAI+V,EAAU,EACVC,GAAa,EACbpR,EAAa,EAQjB,OAPArG,EAASjC,WAAU,SAASwB,EAAGD,GAC7B,IAAMmY,KAAeA,EAAaD,IAAYL,GAE5C,OADA9Q,KACuD,IAAhDrU,EAAGuN,EAAG2D,EAAU5D,EAAI+G,EAAa,EAAGK,IACpCL,IAAegR,CAE1B,IACOhR,CACT,EAEAkR,EAASjU,mBAAqB,SAASpY,EAAMuW,GAC3C,GAAkB,IAAd4V,GAAmB5V,EACrB,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAG7C,IAAIxC,EAAyB,IAAdoY,GAAmBrX,EAAS2B,WAAWzW,EAAMuW,GACxD+V,EAAU,EACVnR,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,KAAOoY,IAAYL,GACjBlY,EAAS/F,OAEX,KAAMmN,EAAagR,EACjB,OAAO3X,IAET,IAAIgG,EAAOzG,EAAS/F,OACpB,OAAIgK,GAAWhY,IAAS2T,EACf6G,EAEArG,EAAcnU,EAAMmb,EAAa,EAD/Bnb,IAAS0T,OACyBlM,EAEAgT,EAAKtK,MAAM,GAFAsK,EAI1D,GACF,EAEO6R,CACT,CAGA,SAASG,GAAiB1X,EAAUuW,EAAWJ,GAC7C,IAAIwB,EAAe5B,GAAa/V,GAoChC,OAnCA2X,EAAapW,kBAAoB,SAASvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACnE,GAAIyX,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAE1C,IAAI4E,EAAa,EAIjB,OAHArG,EAASjC,WAAU,SAASwB,EAAGD,EAAG0H,GAC/B,OAAOuP,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,MAAQX,GAAcrU,EAAGuN,EAAGD,EAAGoH,EAAO,IAEvEL,CACT,EACAsR,EAAarU,mBAAqB,SAASpY,EAAMuW,GAAU,IAAIiF,EAAS1c,KACtE,GAAIyX,EACF,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAE7C,IAAIxC,EAAWe,EAAS2B,WAAW7C,EAAiB2C,GAChDmW,GAAY,EAChB,OAAO,IAAIxY,GAAS,WAClB,IAAKwY,EACH,OAAOlY,IAET,IAAIgG,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAET,IAAIrC,EAAQqC,EAAKtK,MACbkE,EAAI+D,EAAM,GACV9D,EAAI8D,EAAM,GACd,OAAKkT,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAGoH,GAI5Bxb,IAAS4T,EAAkB4G,EAChCrG,EAAcnU,EAAMoU,EAAGC,EAAGmG,IAJ1BkS,GAAY,EACLlY,IAIX,GACF,EACOiY,CACT,CAGA,SAASE,GAAiB7X,EAAUuW,EAAWJ,EAASjT,GACtD,IAAI4U,EAAe/B,GAAa/V,GA4ChC,OA3CA8X,EAAavW,kBAAoB,SAAUvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACpE,GAAIyX,EACF,OAAOzX,KAAKqX,cAActD,UAAU/L,EAAIyP,GAE1C,IAAIgW,GAAa,EACbpR,EAAa,EAOjB,OANArG,EAASjC,WAAU,SAASwB,EAAGD,EAAG0H,GAChC,IAAMyQ,KAAeA,EAAalB,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,IAE9D,OADAX,IACOrU,EAAGuN,EAAG2D,EAAU5D,EAAI+G,EAAa,EAAGK,EAE/C,IACOL,CACT,EACAyR,EAAaxU,mBAAqB,SAASpY,EAAMuW,GAAU,IAAIiF,EAAS1c,KACtE,GAAIyX,EACF,OAAOzX,KAAKqX,cAAcM,WAAWzW,EAAMuW,GAE7C,IAAIxC,EAAWe,EAAS2B,WAAW7C,EAAiB2C,GAChDsW,GAAW,EACX1R,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,IAAIsG,EAAMpG,EAAGC,EACb,EAAG,CAED,IADAmG,EAAOzG,EAAS/F,QACPuG,KACP,OAAIyD,GAAWhY,IAAS2T,EACf6G,EAEArG,EAAcnU,EAAMmb,IADlBnb,IAAS0T,OACuBlM,EAEAgT,EAAKtK,MAAM,GAFAsK,GAKxD,IAAIrC,EAAQqC,EAAKtK,MACjBkE,EAAI+D,EAAM,GACV9D,EAAI8D,EAAM,GACV0U,IAAaA,EAAWxB,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAGoH,GACxD,OAASqR,GACT,OAAO7sB,IAAS4T,EAAkB4G,EAChCrG,EAAcnU,EAAMoU,EAAGC,EAAGmG,EAC9B,GACF,EACOoS,CACT,CAGA,SAASE,GAAchY,EAAUyR,GAC/B,IAAIwG,EAAkBzc,EAAQwE,GAC1BsK,EAAQ,CAACtK,GAAU/N,OAAOwf,GAAQjc,KAAI,SAAS+J,GAQjD,OAPKlE,EAAWkE,GAIL0Y,IACT1Y,EAAIhE,EAAcgE,IAJlBA,EAAI0Y,EACFzX,GAAkBjB,GAClBoB,GAAoB1X,MAAMC,QAAQqW,GAAKA,EAAI,CAACA,IAIzCA,CACT,IAAGrT,QAAO,SAASqT,GAAK,OAAkB,IAAXA,EAAEpJ,IAAU,IAE3C,GAAqB,IAAjBmU,EAAMnhB,OACR,OAAO6W,EAGT,GAAqB,IAAjBsK,EAAMnhB,OAAc,CACtB,IAAI+uB,EAAY5N,EAAM,GACtB,GAAI4N,IAAclY,GACdiY,GAAmBzc,EAAQ0c,IAC3Bvc,EAAUqE,IAAarE,EAAUuc,GACnC,OAAOA,CAEX,CAEA,IAAIC,EAAY,IAAIjW,GAASoI,GAkB7B,OAjBI2N,EACFE,EAAYA,EAAU7X,aACZ3E,EAAUqE,KACpBmY,EAAYA,EAAUvX,aAExBuX,EAAYA,EAAUC,SAAQ,IACpBjiB,KAAOmU,EAAM5c,QACrB,SAAS2qB,EAAKtV,GACZ,QAAYrQ,IAAR2lB,EAAmB,CACrB,IAAIliB,EAAO4M,EAAI5M,KACf,QAAazD,IAATyD,EACF,OAAOkiB,EAAMliB,CAEjB,CACF,GACA,GAEKgiB,CACT,CAGA,SAASG,GAAetY,EAAUuY,EAAOrV,GACvC,IAAIsV,EAAezC,GAAa/V,GA0ChC,OAzCAwY,EAAajX,kBAAoB,SAASvP,EAAIyP,GAC5C,IAAI4E,EAAa,EACboS,GAAU,EACd,SAASC,EAAS5a,EAAM6a,GAAe,IAAIjS,EAAS1c,KAClD8T,EAAKC,WAAU,SAASwB,EAAGD,GAMzB,QALMiZ,GAASI,EAAeJ,IAAUld,EAAWkE,GACjDmZ,EAASnZ,EAAGoZ,EAAe,IAC4B,IAA9C3mB,EAAGuN,EAAG2D,EAAU5D,EAAI+G,IAAcK,KAC3C+R,GAAU,IAEJA,CACV,GAAGhX,EACL,CAEA,OADAiX,EAAS1Y,EAAU,GACZqG,CACT,EACAmS,EAAalV,mBAAqB,SAASpY,EAAMuW,GAC/C,IAAIxC,EAAWe,EAAS2B,WAAWzW,EAAMuW,GACrC6O,EAAQ,GACRjK,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,KAAOH,GAAU,CACf,IAAIyG,EAAOzG,EAAS/F,OACpB,IAAkB,IAAdwM,EAAKjG,KAAT,CAIA,IAAIF,EAAImG,EAAKtK,MAIb,GAHIlQ,IAAS4T,IACXS,EAAIA,EAAE,IAEFgZ,KAASjI,EAAMnnB,OAASovB,KAAUld,EAAWkE,GAIjD,OAAO2D,EAAUwC,EAAOrG,EAAcnU,EAAMmb,IAAc9G,EAAGmG,GAH7D4K,EAAMviB,KAAKkR,GACXA,EAAWM,EAAEoC,WAAWzW,EAAMuW,EAPhC,MAFExC,EAAWqR,EAAMd,KAarB,CACA,OAAO9P,GACT,GACF,EACO8Y,CACT,CAGA,SAASI,GAAe5Y,EAAUkL,EAAQiL,GACxC,IAAIW,EAASC,GAAc/W,GAC3B,OAAOA,EAASI,QAAQ5K,KACtB,SAAS+J,EAAGD,GAAK,OAAOwX,EAAO5L,EAAOphB,KAAKqsB,EAAS5W,EAAGD,EAAGU,GAAU,IACpEoY,SAAQ,EACZ,CAGA,SAASS,GAAiB7Y,EAAU8Y,GAClC,IAAIC,EAAqBhD,GAAa/V,GA2BtC,OA1BA+Y,EAAmB5iB,KAAO6J,EAAS7J,MAAwB,EAAhB6J,EAAS7J,KAAU,EAC9D4iB,EAAmBxX,kBAAoB,SAASvP,EAAIyP,GAAU,IAAIiF,EAAS1c,KACrEqc,EAAa,EAMjB,OALArG,EAASjC,WAAU,SAASwB,EAAGD,GAC5B,QAAS+G,IAAsD,IAAxCrU,EAAG8mB,EAAWzS,IAAcK,MACpB,IAAhC1U,EAAGuN,EAAG8G,IAAcK,EAAiB,GACrCjF,GAEK4E,CACT,EACA0S,EAAmBzV,mBAAqB,SAASpY,EAAMuW,GACrD,IAEIiE,EAFAzG,EAAWe,EAAS2B,WAAW9C,EAAgB4C,GAC/C4E,EAAa,EAEjB,OAAO,IAAIjH,GAAS,WAClB,QAAKsG,GAAQW,EAAa,KACxBX,EAAOzG,EAAS/F,QACPuG,KACAiG,EAGJW,EAAa,EAClBhH,EAAcnU,EAAMmb,IAAcyS,GAClCzZ,EAAcnU,EAAMmb,IAAcX,EAAKtK,MAAOsK,EAClD,GACF,EACOqT,CACT,CAGA,SAAS/N,GAAYhL,EAAU8K,EAAYI,GACpCJ,IACHA,EAAakO,IAEf,IAAIf,EAAkBzc,EAAQwE,GAC1BrL,EAAQ,EACR+P,EAAU1E,EAASI,QAAQ5K,KAC7B,SAAS+J,EAAGD,GAAK,MAAO,CAACA,EAAGC,EAAG5K,IAASuW,EAASA,EAAO3L,EAAGD,EAAGU,GAAYT,EAAE,IAC5EiC,UAMF,OALAkD,EAAQmG,MAAK,SAASvG,EAAGC,GAAK,OAAOuG,EAAWxG,EAAE,GAAIC,EAAE,KAAOD,EAAE,GAAKC,EAAE,EAAE,IAAGlT,QAC3E4mB,EACA,SAAS1Y,EAAG9V,GAAMib,EAAQjb,GAAGN,OAAS,CAAG,EACzC,SAASoW,EAAG9V,GAAMib,EAAQjb,GAAK8V,EAAE,EAAI,GAEhC0Y,EAAkBxc,EAASiJ,GAChC/I,EAAUqE,GAAYpE,EAAW8I,GACjC3I,EAAO2I,EACX,CAGA,SAASuU,GAAWjZ,EAAU8K,EAAYI,GAIxC,GAHKJ,IACHA,EAAakO,IAEX9N,EAAQ,CACV,IAAI7H,EAAQrD,EAASI,QAClB5K,KAAI,SAAS+J,EAAGD,GAAK,MAAO,CAACC,EAAG2L,EAAO3L,EAAGD,EAAGU,GAAU,IACvDtS,QAAO,SAAS4W,EAAGC,GAAK,OAAO2U,GAAWpO,EAAYxG,EAAE,GAAIC,EAAE,IAAMA,EAAID,CAAC,IAC5E,OAAOjB,GAASA,EAAM,EACxB,CACE,OAAOrD,EAAStS,QAAO,SAAS4W,EAAGC,GAAK,OAAO2U,GAAWpO,EAAYxG,EAAGC,GAAKA,EAAID,CAAC,GAEvF,CAEA,SAAS4U,GAAWpO,EAAYxG,EAAGC,GACjC,IAAI4U,EAAOrO,EAAWvG,EAAGD,GAGzB,OAAiB,IAAT6U,GAAc5U,IAAMD,SAAY5R,IAAN6R,GAAyB,OAANA,GAAcA,IAAMA,IAAO4U,EAAO,CACzF,CAGA,SAASC,GAAeC,EAASC,EAAQhP,GACvC,IAAIiP,EAAcxD,GAAasD,GAkD/B,OAjDAE,EAAYpjB,KAAO,IAAI+L,GAASoI,GAAO9U,KAAI,SAAS/L,GAAK,OAAOA,EAAE0M,IAAI,IAAGwI,MAGzE4a,EAAYxb,UAAY,SAAS/L,EAAIyP,GAiBnC,IAHA,IACIiE,EADAzG,EAAWjV,KAAK2X,WAAW9C,EAAgB4C,GAE3C4E,EAAa,IACRX,EAAOzG,EAAS/F,QAAQuG,OACY,IAAvCzN,EAAG0T,EAAKtK,MAAOiL,IAAcrc,QAInC,OAAOqc,CACT,EACAkT,EAAYjW,mBAAqB,SAASpY,EAAMuW,GAC9C,IAAI+X,EAAYlP,EAAM9U,KAAI,SAAS/L,GAChC,OAAQA,EAAI0R,EAAS1R,GAAIsW,EAAY0B,EAAUhY,EAAEgY,UAAYhY,EAAG,IAE/D4c,EAAa,EACboT,GAAS,EACb,OAAO,IAAIra,GAAS,WAClB,IAAIsa,EAKJ,OAJKD,IACHC,EAAQF,EAAUhkB,KAAI,SAAS/L,GAAK,OAAOA,EAAEyP,MAAM,IACnDugB,EAASC,EAAM3nB,MAAK,SAAS4nB,GAAK,OAAOA,EAAEla,IAAI,KAE7Cga,EACK/Z,IAEFL,EACLnU,EACAmb,IACAiT,EAAOvvB,MAAM,KAAM2vB,EAAMlkB,KAAI,SAASmkB,GAAK,OAAOA,EAAEve,KAAK,KAE7D,GACF,EACOme,CACT,CAKA,SAASvC,GAAMlZ,EAAMiF,GACnB,OAAOlB,GAAM/D,GAAQiF,EAAMjF,EAAKpF,YAAYqK,EAC9C,CAEA,SAAS6W,GAAcvW,GACrB,GAAIA,IAAU/Z,OAAO+Z,GACnB,MAAM,IAAIL,UAAU,0BAA4BK,EAEpD,CAEA,SAASwW,GAAY/b,GAEnB,OADA+K,GAAkB/K,EAAK3H,MAChB0H,EAAWC,EACpB,CAEA,SAASiZ,GAAc/W,GACrB,OAAOxE,EAAQwE,GAAYzE,EACzBI,EAAUqE,GAAYtE,EACtBG,CACJ,CAEA,SAASka,GAAa/V,GACpB,OAAO1W,OAAOmP,QAEV+C,EAAQwE,GAAYvE,EACpBE,EAAUqE,GAAYpE,EACtBG,GACAnS,UAEN,CAEA,SAASqsB,KACP,OAAIjsB,KAAKwrB,MAAMnU,aACbrX,KAAKwrB,MAAMnU,cACXrX,KAAKmM,KAAOnM,KAAKwrB,MAAMrf,KAChBnM,MAEAsR,EAAI1R,UAAUyX,YAAYvX,KAAKE,KAE1C,CAEA,SAASgvB,GAAkB1U,EAAGC,GAC5B,OAAOD,EAAIC,EAAI,EAAID,EAAIC,GAAK,EAAI,CAClC,CAEA,SAASuF,GAAcR,GACrB,IAAIxL,EAAOiC,EAAYuJ,GACvB,IAAKxL,EAAM,CAGT,IAAKoC,EAAYoJ,GACf,MAAM,IAAItG,UAAU,oCAAsCsG,GAE5DxL,EAAOiC,EAAY5E,EAASmO,GAC9B,CACA,OAAOxL,CACT,CAIE,SAASgc,GAAOC,EAAeC,GAC7B,IAAIC,EAEAC,EAAa,SAAgBzI,GAC/B,GAAIA,aAAkByI,EACpB,OAAOzI,EAET,KAAMznB,gBAAgBkwB,GACpB,OAAO,IAAIA,EAAWzI,GAExB,IAAKwI,EAAgB,CACnBA,GAAiB,EACjB,IAAI9pB,EAAO7G,OAAO6G,KAAK4pB,GACvBI,GAASC,EAAqBjqB,GAC9BiqB,EAAoBjkB,KAAOhG,EAAKhH,OAChCixB,EAAoBC,MAAQL,EAC5BI,EAAoB5X,MAAQrS,EAC5BiqB,EAAoBE,eAAiBP,CACvC,CACA/vB,KAAKgrB,KAAOjd,GAAI0Z,EAClB,EAEI2I,EAAsBF,EAAWtwB,UAAYN,OAAOmP,OAAO8hB,IAG/D,OAFAH,EAAoB1hB,YAAcwhB,EAE3BA,CACT,CAt/BFjf,EAAY8P,GAAYhT,IActBgT,GAAW5J,GAAK,WACd,OAAOnX,KAAKZ,UACd,EAEA2hB,GAAWnhB,UAAUiX,SAAW,WAC9B,OAAO7W,KAAKoX,WAAW,eAAgB,IACzC,EAIA2J,GAAWnhB,UAAUiL,IAAM,SAASyK,EAAG8G,GACrC,IAAIzR,EAAQ3K,KAAKgrB,KAAKngB,IAAIyK,GAC1B,YAAiB5M,IAAViC,EAAsB3K,KAAKirB,MAAMpgB,IAAIF,GAAO,GAAKyR,CAC1D,EAIA2E,GAAWnhB,UAAUmgB,MAAQ,WAC3B,OAAkB,IAAd/f,KAAKmM,KACAnM,KAELA,KAAKggB,WACPhgB,KAAKmM,KAAO,EACZnM,KAAKgrB,KAAKjL,QACV/f,KAAKirB,MAAMlL,QACJ/f,MAEF2qB,IACT,EAEA5J,GAAWnhB,UAAUkP,IAAM,SAASwG,EAAGC,GACrC,OAAO2V,GAAiBlrB,KAAMsV,EAAGC,EACnC,EAEAwL,GAAWnhB,UAAU4f,OAAS,SAASlK,GACrC,OAAO4V,GAAiBlrB,KAAMsV,EAAGtC,EACnC,EAEA+N,GAAWnhB,UAAUyhB,WAAa,WAChC,OAAOrhB,KAAKgrB,KAAK3J,cAAgBrhB,KAAKirB,MAAM5J,YAC9C,EAEAN,GAAWnhB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KACnE,OAAOA,KAAKirB,MAAMlX,WAChB,SAASsF,GAAS,OAAOA,GAASrR,EAAGqR,EAAM,GAAIA,EAAM,GAAIqD,EAAO,GAChEjF,EAEJ,EAEAsJ,GAAWnhB,UAAU+X,WAAa,SAASzW,EAAMuW,GAC/C,OAAOzX,KAAKirB,MAAM1U,eAAeoB,WAAWzW,EAAMuW,EACpD,EAEAsJ,GAAWnhB,UAAU0hB,cAAgB,SAASI,GAC5C,GAAIA,IAAY1hB,KAAKggB,UACnB,OAAOhgB,KAET,IAAImrB,EAASnrB,KAAKgrB,KAAK1J,cAAcI,GACjC0J,EAAUprB,KAAKirB,MAAM3J,cAAcI,GACvC,OAAKA,EAMEoJ,GAAeK,EAAQC,EAAS1J,EAAS1hB,KAAKwa,SALnDxa,KAAKggB,UAAY0B,EACjB1hB,KAAKgrB,KAAOG,EACZnrB,KAAKirB,MAAQG,EACNprB,KAGX,EAOF+gB,GAAW6J,aAAeA,GAE1B7J,GAAWnhB,UAAU6S,IAAuB,EAC5CsO,GAAWnhB,UAAUgT,GAAUmO,GAAWnhB,UAAU4f,OA8DpDvO,EAAYqa,GAAiB7Z,GAO3B6Z,GAAgB1rB,UAAUiL,IAAM,SAASlL,EAAKyc,GAC5C,OAAOpc,KAAKwrB,MAAM3gB,IAAIlL,EAAKyc,EAC7B,EAEAkP,GAAgB1rB,UAAUoC,IAAM,SAASrC,GACvC,OAAOK,KAAKwrB,MAAMxpB,IAAIrC,EACxB,EAEA2rB,GAAgB1rB,UAAU4wB,SAAW,WACnC,OAAOxwB,KAAKwrB,MAAMgF,UACpB,EAEAlF,GAAgB1rB,UAAU6X,QAAU,WAAY,IAAIiF,EAAS1c,KACvDgsB,EAAmBK,GAAersB,MAAM,GAI5C,OAHKA,KAAKyrB,WACRO,EAAiBwE,SAAW,WAAa,OAAO9T,EAAO8O,MAAMpV,QAAQqB,SAAS,GAEzEuU,CACT,EAEAV,GAAgB1rB,UAAU4L,IAAM,SAAS0V,EAAQiL,GAAU,IAAIzP,EAAS1c,KAClEosB,EAAiBF,GAAWlsB,KAAMkhB,EAAQiL,GAI9C,OAHKnsB,KAAKyrB,WACRW,EAAeoE,SAAW,WAAa,OAAO9T,EAAO8O,MAAMpV,QAAQ5K,IAAI0V,EAAQiL,EAAQ,GAElFC,CACT,EAEAd,GAAgB1rB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IACvD7D,EAD2D8I,EAAS1c,KAExE,OAAOA,KAAKwrB,MAAMzX,UAChB/T,KAAKyrB,SACH,SAASlW,EAAGD,GAAK,OAAOtN,EAAGuN,EAAGD,EAAGoH,EAAO,GACtC9I,EAAK6D,EAAUoY,GAAY7vB,MAAQ,EACnC,SAASuV,GAAK,OAAOvN,EAAGuN,EAAGkC,IAAY7D,EAAKA,IAAM8I,EAAO,GAC7DjF,EAEJ,EAEA6T,GAAgB1rB,UAAU+X,WAAa,SAASzW,EAAMuW,GACpD,GAAIzX,KAAKyrB,SACP,OAAOzrB,KAAKwrB,MAAM7T,WAAWzW,EAAMuW,GAErC,IAAIxC,EAAWjV,KAAKwrB,MAAM7T,WAAW9C,EAAgB4C,GACjD7D,EAAK6D,EAAUoY,GAAY7vB,MAAQ,EACvC,OAAO,IAAIoV,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,OAAOwM,EAAKjG,KAAOiG,EACjBrG,EAAcnU,EAAMuW,IAAY7D,EAAKA,IAAM8H,EAAKtK,MAAOsK,EAC3D,GACF,EAEF4P,GAAgB1rB,UAAU6S,IAAuB,EAGjDxB,EAAYya,GAAmB9Z,GAM7B8Z,GAAkB9rB,UAAU2c,SAAW,SAASnL,GAC9C,OAAOpR,KAAKwrB,MAAMjP,SAASnL,EAC7B,EAEAsa,GAAkB9rB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KACtEqc,EAAa,EACjB,OAAOrc,KAAKwrB,MAAMzX,WAAU,SAASwB,GAAK,OAAOvN,EAAGuN,EAAG8G,IAAcK,EAAO,GAAGjF,EACjF,EAEAiU,GAAkB9rB,UAAU+X,WAAa,SAASzW,EAAMuW,GACtD,IAAIxC,EAAWjV,KAAKwrB,MAAM7T,WAAW9C,EAAgB4C,GACjD4E,EAAa,EACjB,OAAO,IAAIjH,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,OAAOwM,EAAKjG,KAAOiG,EACjBrG,EAAcnU,EAAMmb,IAAcX,EAAKtK,MAAOsK,EAClD,GACF,EAIFzK,EAAY0a,GAAe5Z,GAMzB4Z,GAAc/rB,UAAUoC,IAAM,SAASrC,GACrC,OAAOK,KAAKwrB,MAAMjP,SAAS5c,EAC7B,EAEAgsB,GAAc/rB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KACtE,OAAOA,KAAKwrB,MAAMzX,WAAU,SAASwB,GAAK,OAAOvN,EAAGuN,EAAGA,EAAGmH,EAAO,GAAGjF,EACtE,EAEAkU,GAAc/rB,UAAU+X,WAAa,SAASzW,EAAMuW,GAClD,IAAIxC,EAAWjV,KAAKwrB,MAAM7T,WAAW9C,EAAgB4C,GACrD,OAAO,IAAIrC,GAAS,WAClB,IAAIsG,EAAOzG,EAAS/F,OACpB,OAAOwM,EAAKjG,KAAOiG,EACjBrG,EAAcnU,EAAMwa,EAAKtK,MAAOsK,EAAKtK,MAAOsK,EAChD,GACF,EAIFzK,EAAY2a,GAAqBna,GAM/Bma,GAAoBhsB,UAAU6W,SAAW,WACvC,OAAOzW,KAAKwrB,MAAMpV,OACpB,EAEAwV,GAAoBhsB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KAC5E,OAAOA,KAAKwrB,MAAMzX,WAAU,SAASsF,GAGnC,GAAIA,EAAO,CACTuW,GAAcvW,GACd,IAAIoX,EAAkBpf,EAAWgI,GACjC,OAAOrR,EACLyoB,EAAkBpX,EAAMxO,IAAI,GAAKwO,EAAM,GACvCoX,EAAkBpX,EAAMxO,IAAI,GAAKwO,EAAM,GACvCqD,EAEJ,CACF,GAAGjF,EACL,EAEAmU,GAAoBhsB,UAAU+X,WAAa,SAASzW,EAAMuW,GACxD,IAAIxC,EAAWjV,KAAKwrB,MAAM7T,WAAW9C,EAAgB4C,GACrD,OAAO,IAAIrC,GAAS,WAClB,OAAa,CACX,IAAIsG,EAAOzG,EAAS/F,OACpB,GAAIwM,EAAKjG,KACP,OAAOiG,EAET,IAAIrC,EAAQqC,EAAKtK,MAGjB,GAAIiI,EAAO,CACTuW,GAAcvW,GACd,IAAIoX,EAAkBpf,EAAWgI,GACjC,OAAOhE,EACLnU,EACAuvB,EAAkBpX,EAAMxO,IAAI,GAAKwO,EAAM,GACvCoX,EAAkBpX,EAAMxO,IAAI,GAAKwO,EAAM,GACvCqC,EAEJ,CACF,CACF,GACF,EAGFgQ,GAAkB9rB,UAAUyX,YAC5BiU,GAAgB1rB,UAAUyX,YAC1BsU,GAAc/rB,UAAUyX,YACxBuU,GAAoBhsB,UAAUyX,YAC5B4U,GAwpBFhb,EAAY6e,GAAQ7T,IA8BlB6T,GAAOlwB,UAAUiX,SAAW,WAC1B,OAAO7W,KAAKoX,WAAWsZ,GAAW1wB,MAAQ,KAAM,IAClD,EAIA8vB,GAAOlwB,UAAUoC,IAAM,SAASsT,GAC9B,OAAOtV,KAAKswB,eAAezwB,eAAeyV,EAC5C,EAEAwa,GAAOlwB,UAAUiL,IAAM,SAASyK,EAAG8G,GACjC,IAAKpc,KAAKgC,IAAIsT,GACZ,OAAO8G,EAET,IAAIuU,EAAa3wB,KAAKswB,eAAehb,GACrC,OAAOtV,KAAKgrB,KAAOhrB,KAAKgrB,KAAKngB,IAAIyK,EAAGqb,GAAcA,CACpD,EAIAb,GAAOlwB,UAAUmgB,MAAQ,WACvB,GAAI/f,KAAKggB,UAEP,OADAhgB,KAAKgrB,MAAQhrB,KAAKgrB,KAAKjL,QAChB/f,KAET,IAAIkwB,EAAalwB,KAAK0O,YACtB,OAAOwhB,EAAWU,SAAWV,EAAWU,OAASC,GAAW7wB,KAAM8e,MACpE,EAEAgR,GAAOlwB,UAAUkP,IAAM,SAASwG,EAAGC,GACjC,IAAKvV,KAAKgC,IAAIsT,GACZ,MAAM,IAAIiG,MAAM,2BAA6BjG,EAAI,QAAUob,GAAW1wB,OAExE,GAAIA,KAAKgrB,OAAShrB,KAAKgrB,KAAKhpB,IAAIsT,IAE1BC,IADavV,KAAKswB,eAAehb,GAEnC,OAAOtV,KAGX,IAAImrB,EAASnrB,KAAKgrB,MAAQhrB,KAAKgrB,KAAKlc,IAAIwG,EAAGC,GAC3C,OAAIvV,KAAKggB,WAAamL,IAAWnrB,KAAKgrB,KAC7BhrB,KAEF6wB,GAAW7wB,KAAMmrB,EAC1B,EAEA2E,GAAOlwB,UAAU4f,OAAS,SAASlK,GACjC,IAAKtV,KAAKgC,IAAIsT,GACZ,OAAOtV,KAET,IAAImrB,EAASnrB,KAAKgrB,MAAQhrB,KAAKgrB,KAAKxL,OAAOlK,GAC3C,OAAItV,KAAKggB,WAAamL,IAAWnrB,KAAKgrB,KAC7BhrB,KAEF6wB,GAAW7wB,KAAMmrB,EAC1B,EAEA2E,GAAOlwB,UAAUyhB,WAAa,WAC5B,OAAOrhB,KAAKgrB,KAAK3J,YACnB,EAEAyO,GAAOlwB,UAAU+X,WAAa,SAASzW,EAAMuW,GAAU,IAAIiF,EAAS1c,KAClE,OAAOuR,EAAcvR,KAAKswB,gBAAgB9kB,KAAI,SAASqP,EAAGvF,GAAK,OAAOoH,EAAO7R,IAAIyK,EAAE,IAAGqC,WAAWzW,EAAMuW,EACzG,EAEAqY,GAAOlwB,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KAC/D,OAAOuR,EAAcvR,KAAKswB,gBAAgB9kB,KAAI,SAASqP,EAAGvF,GAAK,OAAOoH,EAAO7R,IAAIyK,EAAE,IAAGvB,UAAU/L,EAAIyP,EACtG,EAEAqY,GAAOlwB,UAAU0hB,cAAgB,SAASI,GACxC,GAAIA,IAAY1hB,KAAKggB,UACnB,OAAOhgB,KAET,IAAImrB,EAASnrB,KAAKgrB,MAAQhrB,KAAKgrB,KAAK1J,cAAcI,GAClD,OAAKA,EAKEmP,GAAW7wB,KAAMmrB,EAAQzJ,IAJ9B1hB,KAAKggB,UAAY0B,EACjB1hB,KAAKgrB,KAAOG,EACLnrB,KAGX,EAGF,IAAIuwB,GAAkBT,GAAOlwB,UAkB7B,SAASixB,GAAWC,EAAYtlB,EAAKkW,GACnC,IAAIqP,EAASzxB,OAAOmP,OAAOnP,OAAO0xB,eAAeF,IAGjD,OAFAC,EAAO/F,KAAOxf,EACdulB,EAAO/Q,UAAY0B,EACZqP,CACT,CAEA,SAASL,GAAWK,GAClB,OAAOA,EAAOV,OAASU,EAAOriB,YAAYshB,MAAQ,QACpD,CAEA,SAASG,GAASvwB,EAAWqxB,GAC3B,IACEA,EAAM5pB,QAAQ6pB,GAAQC,UAAKzoB,EAAW9I,GACxC,CAAE,MAAO0b,GAET,CACF,CAEA,SAAS4V,GAAQtxB,EAAWowB,GAC1B1wB,OAAOif,eAAe3e,EAAWowB,EAAM,CACrCnlB,IAAK,WACH,OAAO7K,KAAK6K,IAAImlB,EAClB,EACAlhB,IAAK,SAASsC,GACZgK,GAAUpb,KAAKggB,UAAW,sCAC1BhgB,KAAK8O,IAAIkhB,EAAM5e,EACjB,GAEJ,CAME,SAAShK,GAAIgK,GACX,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsBggB,KAC7CC,GAAMjgB,KAAWmB,EAAUnB,GAASA,EACpCggB,KAAWpS,eAAc,SAASlQ,GAChC,IAAIgF,EAAOjC,EAAYT,GACvByN,GAAkB/K,EAAK3H,MACvB2H,EAAKzM,SAAQ,SAASkO,GAAK,OAAOzG,EAAItH,IAAI+N,EAAE,GAC9C,GACJ,CA6HF,SAAS8b,GAAMC,GACb,SAAUA,IAAYA,EAASC,IACjC,CA3LAhB,GAAgB3d,GAAU2d,GAAgB/Q,OAC1C+Q,GAAgB9Q,SAChB8Q,GAAgB9K,SAAW5D,GAAa4D,SACxC8K,GAAgBltB,MAAQwe,GAAaxe,MACrCktB,GAAgBpQ,UAAY0B,GAAa1B,UACzCoQ,GAAgBlQ,QAAUwB,GAAaxB,QACvCkQ,GAAgB/P,UAAYqB,GAAarB,UACzC+P,GAAgB7P,cAAgBmB,GAAanB,cAC7C6P,GAAgB3P,YAAciB,GAAajB,YAC3C2P,GAAgBlR,MAAQwC,GAAaxC,MACrCkR,GAAgB7Q,OAASmC,GAAanC,OACtC6Q,GAAgBhR,SAAWsC,GAAatC,SACxCgR,GAAgBvR,cAAgB6C,GAAa7C,cAC7CuR,GAAgBnP,UAAYS,GAAaT,UACzCmP,GAAgBhP,YAAcM,GAAaN,YAkC3CtQ,EAAY7J,GAAK+U,IAcf/U,GAAI+P,GAAK,WACP,OAAOnX,KAAKZ,UACd,EAEAgI,GAAIoqB,SAAW,SAASpgB,GACtB,OAAOpR,KAAKuR,EAAcH,GAAOqgB,SACnC,EAEArqB,GAAIxH,UAAUiX,SAAW,WACvB,OAAO7W,KAAKoX,WAAW,QAAS,IAClC,EAIAhQ,GAAIxH,UAAUoC,IAAM,SAASoP,GAC3B,OAAOpR,KAAKgrB,KAAKhpB,IAAIoP,EACvB,EAIAhK,GAAIxH,UAAU4H,IAAM,SAAS4J,GAC3B,OAAOsgB,GAAU1xB,KAAMA,KAAKgrB,KAAKlc,IAAIsC,GAAO,GAC9C,EAEAhK,GAAIxH,UAAU4f,OAAS,SAASpO,GAC9B,OAAOsgB,GAAU1xB,KAAMA,KAAKgrB,KAAKxL,OAAOpO,GAC1C,EAEAhK,GAAIxH,UAAUmgB,MAAQ,WACpB,OAAO2R,GAAU1xB,KAAMA,KAAKgrB,KAAKjL,QACnC,EAIA3Y,GAAIxH,UAAU+xB,MAAQ,WAAY,IAAIrR,EAAQtP,EAAQlR,KAAKV,UAAW,GAEpE,OAAqB,KADrBkhB,EAAQA,EAAMpe,QAAO,SAASsiB,GAAK,OAAkB,IAAXA,EAAErY,IAAU,KAC5ChN,OACDa,KAES,IAAdA,KAAKmM,MAAenM,KAAKggB,WAA8B,IAAjBM,EAAMnhB,OAGzCa,KAAKgf,eAAc,SAASlQ,GACjC,IAAK,IAAI8E,EAAK,EAAGA,EAAK0M,EAAMnhB,OAAQyU,IAClC/B,EAAYyO,EAAM1M,IAAKvM,SAAQ,SAAS+J,GAAS,OAAOtC,EAAItH,IAAI4J,EAAM,GAE1E,IANSpR,KAAK0O,YAAY4R,EAAM,GAOlC,EAEAlZ,GAAIxH,UAAUgyB,UAAY,WAAY,IAAItR,EAAQtP,EAAQlR,KAAKV,UAAW,GACxE,GAAqB,IAAjBkhB,EAAMnhB,OACR,OAAOa,KAETsgB,EAAQA,EAAM9U,KAAI,SAASsI,GAAQ,OAAOjC,EAAYiC,EAAK,IAC3D,IAAI+d,EAAc7xB,KAClB,OAAOA,KAAKgf,eAAc,SAASlQ,GACjC+iB,EAAYxqB,SAAQ,SAAS+J,GACtBkP,EAAM3F,OAAM,SAAS7G,GAAQ,OAAOA,EAAKyI,SAASnL,EAAM,KAC3DtC,EAAI0Q,OAAOpO,EAEf,GACF,GACF,EAEAhK,GAAIxH,UAAUkyB,SAAW,WAAY,IAAIxR,EAAQtP,EAAQlR,KAAKV,UAAW,GACvE,GAAqB,IAAjBkhB,EAAMnhB,OACR,OAAOa,KAETsgB,EAAQA,EAAM9U,KAAI,SAASsI,GAAQ,OAAOjC,EAAYiC,EAAK,IAC3D,IAAI+d,EAAc7xB,KAClB,OAAOA,KAAKgf,eAAc,SAASlQ,GACjC+iB,EAAYxqB,SAAQ,SAAS+J,GACvBkP,EAAMvY,MAAK,SAAS+L,GAAQ,OAAOA,EAAKyI,SAASnL,EAAM,KACzDtC,EAAI0Q,OAAOpO,EAEf,GACF,GACF,EAEAhK,GAAIxH,UAAUyD,MAAQ,WACpB,OAAOrD,KAAK2xB,MAAM5xB,MAAMC,KAAMZ,UAChC,EAEAgI,GAAIxH,UAAUugB,UAAY,SAASC,GAAS,IAAIE,EAAQtP,EAAQlR,KAAKV,UAAW,GAC9E,OAAOY,KAAK2xB,MAAM5xB,MAAMC,KAAMsgB,EAChC,EAEAlZ,GAAIxH,UAAUihB,KAAO,SAASC,GAE5B,OAAOiR,GAAW/Q,GAAYhhB,KAAM8gB,GACtC,EAEA1Z,GAAIxH,UAAUqhB,OAAS,SAASC,EAAQJ,GAEtC,OAAOiR,GAAW/Q,GAAYhhB,KAAM8gB,EAAYI,GAClD,EAEA9Z,GAAIxH,UAAUyhB,WAAa,WACzB,OAAOrhB,KAAKgrB,KAAK3J,YACnB,EAEAja,GAAIxH,UAAUmU,UAAY,SAAS/L,EAAIyP,GAAU,IAAIiF,EAAS1c,KAC5D,OAAOA,KAAKgrB,KAAKjX,WAAU,SAAS8G,EAAGvF,GAAK,OAAOtN,EAAGsN,EAAGA,EAAGoH,EAAO,GAAGjF,EACxE,EAEArQ,GAAIxH,UAAU+X,WAAa,SAASzW,EAAMuW,GACxC,OAAOzX,KAAKgrB,KAAKxf,KAAI,SAASqP,EAAGvF,GAAK,OAAOA,CAAC,IAAGqC,WAAWzW,EAAMuW,EACpE,EAEArQ,GAAIxH,UAAU0hB,cAAgB,SAASI,GACrC,GAAIA,IAAY1hB,KAAKggB,UACnB,OAAOhgB,KAET,IAAImrB,EAASnrB,KAAKgrB,KAAK1J,cAAcI,GACrC,OAAKA,EAKE1hB,KAAKgyB,OAAO7G,EAAQzJ,IAJzB1hB,KAAKggB,UAAY0B,EACjB1hB,KAAKgrB,KAAOG,EACLnrB,KAGX,EAOFoH,GAAIiqB,MAAQA,GAEZ,IAiCIY,GAjCAV,GAAkB,wBAElBW,GAAe9qB,GAAIxH,UAYvB,SAAS8xB,GAAU5iB,EAAKqc,GACtB,OAAIrc,EAAIkR,WACNlR,EAAI3C,KAAOgf,EAAOhf,KAClB2C,EAAIkc,KAAOG,EACJrc,GAEFqc,IAAWrc,EAAIkc,KAAOlc,EACX,IAAhBqc,EAAOhf,KAAa2C,EAAIqjB,UACxBrjB,EAAIkjB,OAAO7G,EACf,CAEA,SAASiH,GAAQ5mB,EAAKkW,GACpB,IAAI5S,EAAMxP,OAAOmP,OAAOyjB,IAIxB,OAHApjB,EAAI3C,KAAOX,EAAMA,EAAIW,KAAO,EAC5B2C,EAAIkc,KAAOxf,EACXsD,EAAIkR,UAAY0B,EACT5S,CACT,CAGA,SAASsiB,KACP,OAAOa,KAAcA,GAAYG,GAAQtT,MAC3C,CAME,SAASiT,GAAW3gB,GAClB,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsBihB,KAC7CC,GAAalhB,GAASA,EACtBihB,KAAkBrT,eAAc,SAASlQ,GACvC,IAAIgF,EAAOjC,EAAYT,GACvByN,GAAkB/K,EAAK3H,MACvB2H,EAAKzM,SAAQ,SAASkO,GAAK,OAAOzG,EAAItH,IAAI+N,EAAE,GAC9C,GACJ,CAeF,SAAS+c,GAAaC,GACpB,OAAOlB,GAAMkB,IAAoBhgB,EAAUggB,EAC7C,CAhEAL,GAAaX,KAAmB,EAChCW,GAAatf,GAAUsf,GAAa1S,OACpC0S,GAAa1R,UAAY0R,GAAa7uB,MACtC6uB,GAAaxR,cAAgBwR,GAAa/R,UAC1C+R,GAAalT,cAAgB6C,GAAa7C,cAC1CkT,GAAa9Q,UAAYS,GAAaT,UACtC8Q,GAAa3Q,YAAcM,GAAaN,YAExC2Q,GAAaC,QAAUf,GACvBc,GAAaF,OAASI,GA0BtBnhB,EAAY8gB,GAAY3qB,IActB2qB,GAAW5a,GAAK,WACd,OAAOnX,KAAKZ,UACd,EAEA2yB,GAAWP,SAAW,SAASpgB,GAC7B,OAAOpR,KAAKuR,EAAcH,GAAOqgB,SACnC,EAEAM,GAAWnyB,UAAUiX,SAAW,WAC9B,OAAO7W,KAAKoX,WAAW,eAAgB,IACzC,EAOF2a,GAAWO,aAAeA,GAE1B,IAcIE,GAdAC,GAAsBV,GAAWnyB,UAMrC,SAAS8yB,GAAelnB,EAAKkW,GAC3B,IAAI5S,EAAMxP,OAAOmP,OAAOgkB,IAIxB,OAHA3jB,EAAI3C,KAAOX,EAAMA,EAAIW,KAAO,EAC5B2C,EAAIkc,KAAOxf,EACXsD,EAAIkR,UAAY0B,EACT5S,CACT,CAGA,SAASujB,KACP,OAAOG,KAAsBA,GAAoBE,GAAe/H,MAClE,CAME,SAASgI,GAAMvhB,GACb,OAAiB,OAAVA,QAA4B1I,IAAV0I,EAAsBwhB,KAC7CC,GAAQzhB,GAASA,EACjBwhB,KAAaE,WAAW1hB,EAC5B,CAiLF,SAASyhB,GAAQE,GACf,SAAUA,IAAcA,EAAWC,IACrC,CA7MAP,GAAoBhgB,IAAuB,EAE3CggB,GAAoBN,QAAUE,GAC9BI,GAAoBT,OAASU,GAe7BzhB,EAAY0hB,GAAOzW,IAUjByW,GAAMxb,GAAK,WACT,OAAOnX,KAAKZ,UACd,EAEAuzB,GAAM/yB,UAAUiX,SAAW,WACzB,OAAO7W,KAAKoX,WAAW,UAAW,IACpC,EAIAub,GAAM/yB,UAAUiL,IAAM,SAASF,EAAOyR,GACpC,IAAI6W,EAAOjzB,KAAKkzB,MAEhB,IADAvoB,EAAQsJ,EAAUjU,KAAM2K,GACjBsoB,GAAQtoB,KACbsoB,EAAOA,EAAK/jB,KAEd,OAAO+jB,EAAOA,EAAK7hB,MAAQgL,CAC7B,EAEAuW,GAAM/yB,UAAUuzB,KAAO,WACrB,OAAOnzB,KAAKkzB,OAASlzB,KAAKkzB,MAAM9hB,KAClC,EAIAuhB,GAAM/yB,UAAUmE,KAAO,WACrB,GAAyB,IAArB3E,UAAUD,OACZ,OAAOa,KAIT,IAFA,IAAIgjB,EAAUhjB,KAAKmM,KAAO/M,UAAUD,OAChC8zB,EAAOjzB,KAAKkzB,MACPtf,EAAKxU,UAAUD,OAAS,EAAGyU,GAAM,EAAGA,IAC3Cqf,EAAO,CACL7hB,MAAOhS,UAAUwU,GACjB1E,KAAM+jB,GAGV,OAAIjzB,KAAKggB,WACPhgB,KAAKmM,KAAO6W,EACZhjB,KAAKkzB,MAAQD,EACbjzB,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEFozB,GAAUpQ,EAASiQ,EAC5B,EAEAN,GAAM/yB,UAAUyzB,QAAU,SAASvf,GAEjC,GAAkB,KADlBA,EAAOpC,EAAgBoC,IACd3H,KACP,OAAOnM,KAET6e,GAAkB/K,EAAK3H,MACvB,IAAI6W,EAAUhjB,KAAKmM,KACf8mB,EAAOjzB,KAAKkzB,MAQhB,OAPApf,EAAK2D,UAAUpQ,SAAQ,SAAS+J,GAC9B4R,IACAiQ,EAAO,CACL7hB,MAAOA,EACPlC,KAAM+jB,EAEV,IACIjzB,KAAKggB,WACPhgB,KAAKmM,KAAO6W,EACZhjB,KAAKkzB,MAAQD,EACbjzB,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEFozB,GAAUpQ,EAASiQ,EAC5B,EAEAN,GAAM/yB,UAAU4lB,IAAM,WACpB,OAAOxlB,KAAK8K,MAAM,EACpB,EAEA6nB,GAAM/yB,UAAUgoB,QAAU,WACxB,OAAO5nB,KAAK+D,KAAKhE,MAAMC,KAAMZ,UAC/B,EAEAuzB,GAAM/yB,UAAUkzB,WAAa,SAAShf,GACpC,OAAO9T,KAAKqzB,QAAQvf,EACtB,EAEA6e,GAAM/yB,UAAUwjB,MAAQ,WACtB,OAAOpjB,KAAKwlB,IAAIzlB,MAAMC,KAAMZ,UAC9B,EAEAuzB,GAAM/yB,UAAUmgB,MAAQ,WACtB,OAAkB,IAAd/f,KAAKmM,KACAnM,KAELA,KAAKggB,WACPhgB,KAAKmM,KAAO,EACZnM,KAAKkzB,WAAQxqB,EACb1I,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEF4yB,IACT,EAEAD,GAAM/yB,UAAUkL,MAAQ,SAASuJ,EAAOC,GACtC,GAAIF,EAAWC,EAAOC,EAAKtU,KAAKmM,MAC9B,OAAOnM,KAET,IAAImtB,EAAgB5Y,EAAaF,EAAOrU,KAAKmM,MAE7C,GADkBsI,EAAWH,EAAKtU,KAAKmM,QACnBnM,KAAKmM,KAEvB,OAAO+P,GAAkBtc,UAAUkL,MAAMhL,KAAKE,KAAMqU,EAAOC,GAI7D,IAFA,IAAI0O,EAAUhjB,KAAKmM,KAAOghB,EACtB8F,EAAOjzB,KAAKkzB,MACT/F,KACL8F,EAAOA,EAAK/jB,KAEd,OAAIlP,KAAKggB,WACPhgB,KAAKmM,KAAO6W,EACZhjB,KAAKkzB,MAAQD,EACbjzB,KAAKwa,YAAS9R,EACd1I,KAAKigB,WAAY,EACVjgB,MAEFozB,GAAUpQ,EAASiQ,EAC5B,EAIAN,GAAM/yB,UAAU0hB,cAAgB,SAASI,GACvC,OAAIA,IAAY1hB,KAAKggB,UACZhgB,KAEJ0hB,EAKE0R,GAAUpzB,KAAKmM,KAAMnM,KAAKkzB,MAAOxR,EAAS1hB,KAAKwa,SAJpDxa,KAAKggB,UAAY0B,EACjB1hB,KAAKigB,WAAY,EACVjgB,KAGX,EAIA2yB,GAAM/yB,UAAUmU,UAAY,SAAS/L,EAAIyP,GACvC,GAAIA,EACF,OAAOzX,KAAKyX,UAAU1D,UAAU/L,GAIlC,IAFA,IAAIqU,EAAa,EACboC,EAAOze,KAAKkzB,MACTzU,IACsC,IAAvCzW,EAAGyW,EAAKrN,MAAOiL,IAAcrc,OAGjCye,EAAOA,EAAKvP,KAEd,OAAOmN,CACT,EAEAsW,GAAM/yB,UAAU+X,WAAa,SAASzW,EAAMuW,GAC1C,GAAIA,EACF,OAAOzX,KAAKyX,UAAUE,WAAWzW,GAEnC,IAAImb,EAAa,EACboC,EAAOze,KAAKkzB,MAChB,OAAO,IAAI9d,GAAS,WAClB,GAAIqJ,EAAM,CACR,IAAIrN,EAAQqN,EAAKrN,MAEjB,OADAqN,EAAOA,EAAKvP,KACLmG,EAAcnU,EAAMmb,IAAcjL,EAC3C,CACA,OAAOsE,GACT,GACF,EAOFid,GAAME,QAAUA,GAEhB,IAoBIS,GApBAN,GAAoB,0BAEpBO,GAAiBZ,GAAM/yB,UAQ3B,SAASwzB,GAAUjnB,EAAM8mB,EAAMvR,EAASvE,GACtC,IAAI3R,EAAMlM,OAAOmP,OAAO8kB,IAMxB,OALA/nB,EAAIW,KAAOA,EACXX,EAAI0nB,MAAQD,EACZznB,EAAIwU,UAAY0B,EAChBlW,EAAIgP,OAAS2C,EACb3R,EAAIyU,WAAY,EACTzU,CACT,CAGA,SAASonB,KACP,OAAOU,KAAgBA,GAAcF,GAAU,GACjD,CAKA,SAASI,GAAMtiB,EAAMuiB,GACnB,IAAIC,EAAY,SAAS/zB,GAAQuR,EAAKtR,UAAUD,GAAO8zB,EAAQ9zB,EAAM,EAIrE,OAHAL,OAAO6G,KAAKstB,GAASpsB,QAAQqsB,GAC7Bp0B,OAAOq0B,uBACLr0B,OAAOq0B,sBAAsBF,GAASpsB,QAAQqsB,GACzCxiB,CACT,CA/BAqiB,GAAeP,KAAqB,EACpCO,GAAevU,cAAgB6C,GAAa7C,cAC5CuU,GAAenS,UAAYS,GAAaT,UACxCmS,GAAehS,YAAcM,GAAaN,YAC1CgS,GAAelS,WAAaQ,GAAaR,WA6BzClQ,EAASiE,SAAWA,EAEpBoe,GAAMriB,EAAU,CAIdqG,QAAS,WACPqH,GAAkB7e,KAAKmM,MACvB,IAAIgM,EAAQ,IAAIlZ,MAAMe,KAAKmM,MAAQ,GAEnC,OADAnM,KAAKwwB,WAAWzc,WAAU,SAASwB,EAAG9V,GAAM0Y,EAAM1Y,GAAK8V,CAAG,IACnD4C,CACT,EAEAzB,aAAc,WACZ,OAAO,IAAIgV,GAAkB1rB,KAC/B,EAEA0L,KAAM,WACJ,OAAO1L,KAAKoW,QAAQ5K,KAClB,SAAS4F,GAAS,OAAOA,GAA+B,oBAAfA,EAAM1F,KAAsB0F,EAAM1F,OAAS0F,CAAK,IACzFwiB,QACJ,EAEAC,OAAQ,WACN,OAAO7zB,KAAKoW,QAAQ5K,KAClB,SAAS4F,GAAS,OAAOA,GAAiC,oBAAjBA,EAAMyiB,OAAwBziB,EAAMyiB,SAAWziB,CAAK,IAC7FwiB,QACJ,EAEAtd,WAAY,WACV,OAAO,IAAIgV,GAAgBtrB,MAAM,EACnC,EAEA+Z,MAAO,WAEL,OAAOhM,GAAI/N,KAAKsW,aAClB,EAEAwd,SAAU,WACRjV,GAAkB7e,KAAKmM,MACvB,IAAImM,EAAS,CAAC,EAEd,OADAtY,KAAK+T,WAAU,SAASwB,EAAGD,GAAMgD,EAAOhD,GAAKC,CAAG,IACzC+C,CACT,EAEAyb,aAAc,WAEZ,OAAOhT,GAAW/gB,KAAKsW,aACzB,EAEA0d,aAAc,WAEZ,OAAOjC,GAAWvgB,EAAQxR,MAAQA,KAAKwwB,WAAaxwB,KACtD,EAEAi0B,MAAO,WAEL,OAAO7sB,GAAIoK,EAAQxR,MAAQA,KAAKwwB,WAAaxwB,KAC/C,EAEA4W,SAAU,WACR,OAAO,IAAI+U,GAAc3rB,KAC3B,EAEAoW,MAAO,WACL,OAAOzE,EAAU3R,MAAQA,KAAK0W,eAC5BlF,EAAQxR,MAAQA,KAAKsW,aACrBtW,KAAK4W,UACT,EAEAsd,QAAS,WAEP,OAAOvB,GAAMnhB,EAAQxR,MAAQA,KAAKwwB,WAAaxwB,KACjD,EAEA8Z,OAAQ,WAEN,OAAO3O,GAAKqG,EAAQxR,MAAQA,KAAKwwB,WAAaxwB,KAChD,EAKA6W,SAAU,WACR,MAAO,YACT,EAEAO,WAAY,SAAS6b,EAAMhK,GACzB,OAAkB,IAAdjpB,KAAKmM,KACA8mB,EAAOhK,EAETgK,EAAO,IAAMjzB,KAAKoW,QAAQ5K,IAAIxL,KAAKm0B,kBAAkBhrB,KAAK,MAAQ,IAAM8f,CACjF,EAKAhhB,OAAQ,WACN,OAAO+kB,GAAMhtB,KAAMguB,GAAchuB,KADFgR,EAAQlR,KAAKV,UAAW,IAEzD,EAEAmd,SAAU,SAASC,GACjB,OAAOxc,KAAK+H,MAAK,SAASqJ,GAAS,OAAO4I,GAAG5I,EAAOoL,EAAY,GAClE,EAEA9B,QAAS,WACP,OAAO1a,KAAK2X,WAAW7C,EACzB,EAEA6F,MAAO,SAAS4R,EAAWJ,GACzBtN,GAAkB7e,KAAKmM,MACvB,IAAIioB,GAAc,EAOlB,OANAp0B,KAAK+T,WAAU,SAASwB,EAAGD,EAAG0H,GAC5B,IAAKuP,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,GAEjC,OADAoX,GAAc,GACP,CAEX,IACOA,CACT,EAEAlyB,OAAQ,SAASqqB,EAAWJ,GAC1B,OAAOa,GAAMhtB,KAAMssB,GAActsB,KAAMusB,EAAWJ,GAAS,GAC7D,EAEAkI,KAAM,SAAS9H,EAAWJ,EAAS/P,GACjC,IAAI/C,EAAQrZ,KAAKs0B,UAAU/H,EAAWJ,GACtC,OAAO9S,EAAQA,EAAM,GAAK+C,CAC5B,EAEA/U,QAAS,SAASotB,EAAYtI,GAE5B,OADAtN,GAAkB7e,KAAKmM,MAChBnM,KAAK+T,UAAUoY,EAAUsI,EAAWtD,KAAKhF,GAAWsI,EAC7D,EAEAtrB,KAAM,SAAS2lB,GACbjQ,GAAkB7e,KAAKmM,MACvB2iB,OAA0BpmB,IAAdomB,EAA0B,GAAKA,EAAY,IACvD,IAAI4F,EAAS,GACTC,GAAU,EAKd,OAJA30B,KAAK+T,WAAU,SAASwB,GACtBof,EAAWA,GAAU,EAAUD,GAAU5F,EACzC4F,GAAgB,OAANnf,QAAoB7M,IAAN6M,EAAkBA,EAAEsB,WAAa,EAC3D,IACO6d,CACT,EAEAvuB,KAAM,WACJ,OAAOnG,KAAK2X,WAAW/C,EACzB,EAEApJ,IAAK,SAAS0V,EAAQiL,GACpB,OAAOa,GAAMhtB,KAAMksB,GAAWlsB,KAAMkhB,EAAQiL,GAC9C,EAEAzoB,OAAQ,SAASkxB,EAASC,EAAkB1I,GAE1C,IAAI2I,EACAC,EAcJ,OAhBAlW,GAAkB7e,KAAKmM,MAGnB/M,UAAUD,OAAS,EACrB41B,GAAW,EAEXD,EAAYD,EAEd70B,KAAK+T,WAAU,SAASwB,EAAGD,EAAG0H,GACxB+X,GACFA,GAAW,EACXD,EAAYvf,GAEZuf,EAAYF,EAAQ90B,KAAKqsB,EAAS2I,EAAWvf,EAAGD,EAAG0H,EAEvD,IACO8X,CACT,EAEAE,YAAa,SAASJ,EAASC,EAAkB1I,GAC/C,IAAI8I,EAAWj1B,KAAKsW,aAAamB,UACjC,OAAOwd,EAASvxB,OAAO3D,MAAMk1B,EAAU71B,UACzC,EAEAqY,QAAS,WACP,OAAOuV,GAAMhtB,KAAMqsB,GAAersB,MAAM,GAC1C,EAEA8K,MAAO,SAASuJ,EAAOC,GACrB,OAAO0Y,GAAMhtB,KAAMitB,GAAajtB,KAAMqU,EAAOC,GAAK,GACpD,EAEAvM,KAAM,SAASwkB,EAAWJ,GACxB,OAAQnsB,KAAK2a,MAAMua,GAAI3I,GAAYJ,EACrC,EAEAtL,KAAM,SAASC,GACb,OAAOkM,GAAMhtB,KAAMghB,GAAYhhB,KAAM8gB,GACvC,EAEA2G,OAAQ,WACN,OAAOznB,KAAK2X,WAAW9C,EACzB,EAKAsgB,QAAS,WACP,OAAOn1B,KAAK8K,MAAM,GAAI,EACxB,EAEAsqB,QAAS,WACP,YAAqB1sB,IAAd1I,KAAKmM,KAAmC,IAAdnM,KAAKmM,MAAcnM,KAAK+H,MAAK,WAAa,OAAO,CAAI,GACxF,EAEAoa,MAAO,SAASoK,EAAWJ,GACzB,OAAOtY,EACL0Y,EAAYvsB,KAAKoW,QAAQlU,OAAOqqB,EAAWJ,GAAWnsB,KAE1D,EAEAq1B,QAAS,SAAS3I,EAASP,GACzB,OAAOM,GAAezsB,KAAM0sB,EAASP,EACvC,EAEA/R,OAAQ,SAASuC,GACf,OAAOtC,GAAUra,KAAM2c,EACzB,EAEAlG,SAAU,WACR,IAAIT,EAAWhW,KACf,GAAIgW,EAASsB,OAEX,OAAO,IAAIY,GAASlC,EAASsB,QAE/B,IAAIge,EAAkBtf,EAASI,QAAQ5K,IAAI+pB,IAAa7e,eAExD,OADA4e,EAAgB/e,aAAe,WAAa,OAAOP,EAASI,OAAO,EAC5Dkf,CACT,EAEAE,UAAW,SAASjJ,EAAWJ,GAC7B,OAAOnsB,KAAKkC,OAAOgzB,GAAI3I,GAAYJ,EACrC,EAEAmI,UAAW,SAAS/H,EAAWJ,EAAS/P,GACtC,IAAImY,EAAQnY,EAOZ,OANApc,KAAK+T,WAAU,SAASwB,EAAGD,EAAG0H,GAC5B,GAAIuP,EAAUzsB,KAAKqsB,EAAS5W,EAAGD,EAAG0H,GAEhC,OADAuX,EAAQ,CAACjf,EAAGC,IACL,CAEX,IACOgf,CACT,EAEAkD,QAAS,SAASlL,EAAWJ,GAC3B,IAAI9S,EAAQrZ,KAAKs0B,UAAU/H,EAAWJ,GACtC,OAAO9S,GAASA,EAAM,EACxB,EAEAoc,SAAU,SAASlJ,EAAWJ,EAAS/P,GACrC,OAAOpc,KAAKsW,aAAamB,UAAU4c,KAAK9H,EAAWJ,EAAS/P,EAC9D,EAEAoY,cAAe,SAASjI,EAAWJ,EAAS/P,GAC1C,OAAOpc,KAAKsW,aAAamB,UAAU6c,UAAU/H,EAAWJ,EAAS/P,EACnE,EAEAsb,YAAa,SAASnL,EAAWJ,GAC/B,OAAOnsB,KAAKsW,aAAamB,UAAUggB,QAAQlL,EAAWJ,EACxD,EAEAuJ,MAAO,WACL,OAAO11B,KAAKq0B,KAAKrgB,EACnB,EAEA5I,QAAS,SAAS8V,EAAQiL,GACxB,OAAOa,GAAMhtB,KAAM4uB,GAAe5uB,KAAMkhB,EAAQiL,GAClD,EAEAiC,QAAS,SAASG,GAChB,OAAOvB,GAAMhtB,KAAMsuB,GAAetuB,KAAMuuB,GAAO,GACjD,EAEAhY,aAAc,WACZ,OAAO,IAAIqV,GAAoB5rB,KACjC,EAEA6K,IAAK,SAAS8qB,EAAWvZ,GACvB,OAAOpc,KAAKq0B,MAAK,SAASxZ,EAAGlb,GAAO,OAAOqa,GAAGra,EAAKg2B,EAAU,QAAGjtB,EAAW0T,EAC7E,EAEAwZ,MAAO,SAASC,EAAezZ,GAM7B,IALA,IAIIV,EAJAoa,EAAS91B,KAGT8T,EAAOgM,GAAc+V,KAEhBna,EAAO5H,EAAK5E,QAAQuG,MAAM,CACjC,IAAI9V,EAAM+b,EAAKtK,MAEf,IADA0kB,EAASA,GAAUA,EAAOjrB,IAAMirB,EAAOjrB,IAAIlL,EAAKqT,GAAWA,KAC5CA,EACb,OAAOoJ,CAEX,CACA,OAAO0Z,CACT,EAEAC,QAAS,SAASrJ,EAASP,GACzB,OAAOS,GAAe5sB,KAAM0sB,EAASP,EACvC,EAEAnqB,IAAK,SAAS2zB,GACZ,OAAO31B,KAAK6K,IAAI8qB,EAAW3iB,KAAaA,CAC1C,EAEAgjB,MAAO,SAASH,GACd,OAAO71B,KAAK41B,MAAMC,EAAe7iB,KAAaA,CAChD,EAEAijB,SAAU,SAASniB,GAEjB,OADAA,EAAgC,oBAAlBA,EAAKyI,SAA0BzI,EAAO3C,EAAS2C,GACtD9T,KAAK2a,OAAM,SAASvJ,GAAS,OAAO0C,EAAKyI,SAASnL,EAAM,GACjE,EAEA8kB,WAAY,SAASpiB,GAEnB,OADAA,EAAgC,oBAAlBA,EAAKmiB,SAA0BniB,EAAO3C,EAAS2C,IACjDmiB,SAASj2B,KACvB,EAEA23B,MAAO,SAASnb,GACd,OAAOxc,KAAKy3B,SAAQ,SAASrmB,GAAS,OAAO4I,GAAG5I,EAAOoL,EAAY,GACrE,EAEAiV,OAAQ,WACN,OAAOzxB,KAAKoW,QAAQ5K,IAAI2qB,IAAWzf,cACrC,EAEA7F,KAAM,WACJ,OAAO7Q,KAAKoW,QAAQqB,UAAUie,OAChC,EAEAkC,UAAW,SAASpb,GAClB,OAAOxc,KAAKsW,aAAamB,UAAUkgB,MAAMnb,EAC3C,EAEA9I,IAAK,SAASoN,GACZ,OAAOmO,GAAWjvB,KAAM8gB,EAC1B,EAEAsV,MAAO,SAASlV,EAAQJ,GACtB,OAAOmO,GAAWjvB,KAAM8gB,EAAYI,EACtC,EAEAvM,IAAK,SAASmM,GACZ,OAAOmO,GAAWjvB,KAAM8gB,EAAauV,GAAIvV,GAAcwV,GACzD,EAEAC,MAAO,SAASrV,EAAQJ,GACtB,OAAOmO,GAAWjvB,KAAM8gB,EAAauV,GAAIvV,GAAcwV,GAAsBpV,EAC/E,EAEApY,KAAM,WACJ,OAAO9I,KAAK8K,MAAM,EACpB,EAEA0rB,KAAM,SAASC,GACb,OAAOz2B,KAAK8K,MAAM2I,KAAKC,IAAI,EAAG+iB,GAChC,EAEAC,SAAU,SAASD,GACjB,OAAOzJ,GAAMhtB,KAAMA,KAAKoW,QAAQqB,UAAU+e,KAAKC,GAAQhf,UACzD,EAEAkf,UAAW,SAASpK,EAAWJ,GAC7B,OAAOa,GAAMhtB,KAAM6tB,GAAiB7tB,KAAMusB,EAAWJ,GAAS,GAChE,EAEAyK,UAAW,SAASrK,EAAWJ,GAC7B,OAAOnsB,KAAK22B,UAAUzB,GAAI3I,GAAYJ,EACxC,EAEAlL,OAAQ,SAASC,EAAQJ,GACvB,OAAOkM,GAAMhtB,KAAMghB,GAAYhhB,KAAM8gB,EAAYI,GACnD,EAEA2V,KAAM,SAASJ,GACb,OAAOz2B,KAAK8K,MAAM,EAAG2I,KAAKC,IAAI,EAAG+iB,GACnC,EAEAK,SAAU,SAASL,GACjB,OAAOzJ,GAAMhtB,KAAMA,KAAKoW,QAAQqB,UAAUof,KAAKJ,GAAQhf,UACzD,EAEAsf,UAAW,SAASxK,EAAWJ,GAC7B,OAAOa,GAAMhtB,KAAM0tB,GAAiB1tB,KAAMusB,EAAWJ,GACvD,EAEA6K,UAAW,SAASzK,EAAWJ,GAC7B,OAAOnsB,KAAK+2B,UAAU7B,GAAI3I,GAAYJ,EACxC,EAEAqE,SAAU,WACR,OAAOxwB,KAAK0W,cACd,EAKA8G,SAAU,WACR,OAAOxd,KAAKwa,SAAWxa,KAAKwa,OAASyc,GAAaj3B,MACpD,IAeF,IAAIk3B,GAAoB/lB,EAASvR,UACjCs3B,GAAkBjlB,IAAwB,EAC1CilB,GAAkB/hB,GAAmB+hB,GAAkBzP,OACvDyP,GAAkBtD,OAASsD,GAAkB1f,QAC7C0f,GAAkB/C,iBAAmBgD,GACrCD,GAAkBjgB,QAClBigB,GAAkBhgB,SAAW,WAAa,OAAOlX,KAAK6W,UAAY,EAClEqgB,GAAkBE,MAAQF,GAAkB9rB,QAC5C8rB,GAAkBG,SAAWH,GAAkB3a,SAE/CiX,GAAMjiB,EAAe,CAInB8Z,KAAM,WACJ,OAAO2B,GAAMhtB,KAAM6rB,GAAY7rB,MACjC,EAEA63B,WAAY,SAAS3W,EAAQiL,GAAU,IAAIzP,EAAS1c,KAC9Cqc,EAAa,EACjB,OAAO2Q,GAAMhtB,KACXA,KAAKoW,QAAQ5K,KACX,SAAS+J,EAAGD,GAAK,OAAO4L,EAAOphB,KAAKqsB,EAAS,CAAC7W,EAAGC,GAAI8G,IAAcK,EAAO,IAC1EnG,eAEN,EAEAuhB,QAAS,SAAS5W,EAAQiL,GAAU,IAAIzP,EAAS1c,KAC/C,OAAOgtB,GAAMhtB,KACXA,KAAKoW,QAAQiV,OAAO7f,KAClB,SAAS8J,EAAGC,GAAK,OAAO2L,EAAOphB,KAAKqsB,EAAS7W,EAAGC,EAAGmH,EAAO,IAC1D2O,OAEN,IAIF,IAAI0M,GAAyBxmB,EAAc3R,UAmL3C,SAASu2B,GAAU5gB,EAAGD,GACpB,OAAOA,CACT,CAEA,SAASigB,GAAYhgB,EAAGD,GACtB,MAAO,CAACA,EAAGC,EACb,CAEA,SAAS2f,GAAI3I,GACX,OAAO,WACL,OAAQA,EAAUxsB,MAAMC,KAAMZ,UAChC,CACF,CAEA,SAASi3B,GAAI9J,GACX,OAAO,WACL,OAAQA,EAAUxsB,MAAMC,KAAMZ,UAChC,CACF,CAEA,SAAS+3B,GAAY/lB,GACnB,MAAwB,kBAAVA,EAAqB4mB,KAAKC,UAAU7mB,GAAS2vB,OAAO3vB,EACpE,CAEA,SAAS8mB,KACP,OAAO5kB,EAAQlU,UACjB,CAEA,SAASk3B,GAAqBhc,EAAGC,GAC/B,OAAOD,EAAIC,EAAI,EAAID,EAAIC,GAAK,EAAI,CAClC,CAEA,SAAS0c,GAAajhB,GACpB,GAAIA,EAAS7J,OAASgP,IACpB,OAAO,EAET,IAAIgd,EAAU5lB,EAAUyD,GACpBoiB,EAAQ5mB,EAAQwE,GAChBoH,EAAI+a,EAAU,EAAI,EAUtB,OAAOE,GATIriB,EAASjC,UAClBqkB,EACED,EACE,SAAS5iB,EAAGD,GAAM8H,EAAI,GAAKA,EAAIkb,GAAUnb,GAAK5H,GAAI4H,GAAK7H,IAAM,CAAG,EAChE,SAASC,EAAGD,GAAM8H,EAAIA,EAAIkb,GAAUnb,GAAK5H,GAAI4H,GAAK7H,IAAM,CAAG,EAC7D6iB,EACE,SAAS5iB,GAAM6H,EAAI,GAAKA,EAAID,GAAK5H,GAAK,CAAG,EACzC,SAASA,GAAM6H,EAAIA,EAAID,GAAK5H,GAAK,CAAG,GAEZ6H,EAChC,CAEA,SAASib,GAAiBlsB,EAAMiR,GAQ9B,OAPAA,EAAIL,GAAKK,EAAG,YACZA,EAAIL,GAAKK,GAAK,GAAKA,KAAO,GAAI,WAC9BA,EAAIL,GAAKK,GAAK,GAAKA,KAAO,GAAI,GAE9BA,EAAIL,IADJK,EAAKA,EAAI,WAAkBjR,GACdiR,IAAM,GAAI,YAEvBA,EAAIH,IADJG,EAAIL,GAAKK,EAAIA,IAAM,GAAI,aACXA,IAAM,GAEpB,CAEA,SAASkb,GAAUhe,EAAGC,GACpB,OAAOD,EAAIC,EAAI,YAAcD,GAAK,IAAMA,GAAK,EAC/C,CAwBA,OA1QAyd,GAAuB5lB,IAAqB,EAC5C4lB,GAAuB5iB,GAAmB+hB,GAAkBxc,QAC5Dqd,GAAuBnE,OAASsD,GAAkBpD,SAClDiE,GAAuB5D,iBAAmB,SAAS5e,EAAGD,GAAK,OAAO0iB,KAAKC,UAAU3iB,GAAK,KAAO6hB,GAAY5hB,EAAE,EAI3Gie,GAAM9hB,EAAiB,CAIrB4E,WAAY,WACV,OAAO,IAAIgV,GAAgBtrB,MAAM,EACnC,EAKAkC,OAAQ,SAASqqB,EAAWJ,GAC1B,OAAOa,GAAMhtB,KAAMssB,GAActsB,KAAMusB,EAAWJ,GAAS,GAC7D,EAEAoM,UAAW,SAAShM,EAAWJ,GAC7B,IAAI9S,EAAQrZ,KAAKs0B,UAAU/H,EAAWJ,GACtC,OAAO9S,EAAQA,EAAM,IAAM,CAC7B,EAEAjT,QAAS,SAASoW,GAChB,IAAI7c,EAAMK,KAAK23B,MAAMnb,GACrB,YAAe9T,IAAR/I,GAAqB,EAAIA,CAClC,EAEA8c,YAAa,SAASD,GACpB,IAAI7c,EAAMK,KAAK43B,UAAUpb,GACzB,YAAe9T,IAAR/I,GAAqB,EAAIA,CAClC,EAEA8X,QAAS,WACP,OAAOuV,GAAMhtB,KAAMqsB,GAAersB,MAAM,GAC1C,EAEA8K,MAAO,SAASuJ,EAAOC,GACrB,OAAO0Y,GAAMhtB,KAAMitB,GAAajtB,KAAMqU,EAAOC,GAAK,GACpD,EAEA8S,OAAQ,SAASzc,EAAO6tB,GACtB,IAAIC,EAAUr5B,UAAUD,OAExB,GADAq5B,EAAY/kB,KAAKC,IAAgB,EAAZ8kB,EAAe,GACpB,IAAZC,GAA8B,IAAZA,IAAkBD,EACtC,OAAOx4B,KAKT2K,EAAQ4J,EAAa5J,EAAOA,EAAQ,EAAI3K,KAAKmiB,QAAUniB,KAAKmM,MAC5D,IAAIusB,EAAU14B,KAAK8K,MAAM,EAAGH,GAC5B,OAAOqiB,GACLhtB,KACY,IAAZy4B,EACEC,EACAA,EAAQzwB,OAAOqL,EAAQlU,UAAW,GAAIY,KAAK8K,MAAMH,EAAQ6tB,IAE/D,EAKAG,cAAe,SAASpM,EAAWJ,GACjC,IAAI9S,EAAQrZ,KAAKw0B,cAAcjI,EAAWJ,GAC1C,OAAO9S,EAAQA,EAAM,IAAM,CAC7B,EAEAqc,MAAO,WACL,OAAO11B,KAAK6K,IAAI,EAClB,EAEAujB,QAAS,SAASG,GAChB,OAAOvB,GAAMhtB,KAAMsuB,GAAetuB,KAAMuuB,GAAO,GACjD,EAEA1jB,IAAK,SAASF,EAAOyR,GAEnB,OADAzR,EAAQsJ,EAAUjU,KAAM2K,IACR,GAAM3K,KAAKmM,OAASgP,UACjBzS,IAAd1I,KAAKmM,MAAsBxB,EAAQ3K,KAAKmM,KAC3CiQ,EACApc,KAAKq0B,MAAK,SAASxZ,EAAGlb,GAAO,OAAOA,IAAQgL,CAAK,QAAGjC,EAAW0T,EACnE,EAEApa,IAAK,SAAS2I,GAEZ,OADAA,EAAQsJ,EAAUjU,KAAM2K,KACR,SAAoBjC,IAAd1I,KAAKmM,KACzBnM,KAAKmM,OAASgP,KAAYxQ,EAAQ3K,KAAKmM,MACd,IAAzBnM,KAAKoG,QAAQuE,GAEjB,EAEAiuB,UAAW,SAAS9J,GAClB,OAAO9B,GAAMhtB,KAAM6uB,GAAiB7uB,KAAM8uB,GAC5C,EAEA+J,WAAY,WACV,IAAI1U,EAAY,CAACnkB,MAAMiI,OAAOqL,EAAQlU,YAClC05B,EAAS1J,GAAepvB,KAAKoW,QAASxE,EAAWuF,GAAIgN,GACrD4U,EAAcD,EAAO1K,SAAQ,GAIjC,OAHI0K,EAAO3sB,OACT4sB,EAAY5sB,KAAO2sB,EAAO3sB,KAAOgY,EAAUhlB,QAEtC6tB,GAAMhtB,KAAM+4B,EACrB,EAEAtH,OAAQ,WACN,OAAOjW,GAAM,EAAGxb,KAAKmM,KACvB,EAEA0E,KAAM,WACJ,OAAO7Q,KAAK6K,KAAK,EACnB,EAEA8rB,UAAW,SAASpK,EAAWJ,GAC7B,OAAOa,GAAMhtB,KAAM6tB,GAAiB7tB,KAAMusB,EAAWJ,GAAS,GAChE,EAEA6M,IAAK,WAEH,OAAOhM,GAAMhtB,KAAMovB,GAAepvB,KAAMk4B,GADxB,CAACl4B,MAAMiI,OAAOqL,EAAQlU,aAExC,EAEA65B,QAAS,SAAS3J,GAChB,IAAInL,EAAY7Q,EAAQlU,WAExB,OADA+kB,EAAU,GAAKnkB,KACRgtB,GAAMhtB,KAAMovB,GAAepvB,KAAMsvB,EAAQnL,GAClD,IAIFzS,EAAgB9R,UAAUyS,IAAuB,EACjDX,EAAgB9R,UAAU6S,IAAuB,EAIjD+gB,GAAM3hB,EAAa,CAIjBhH,IAAK,SAASuG,EAAOgL,GACnB,OAAOpc,KAAKgC,IAAIoP,GAASA,EAAQgL,CACnC,EAEAG,SAAU,SAASnL,GACjB,OAAOpR,KAAKgC,IAAIoP,EAClB,EAKAqgB,OAAQ,WACN,OAAOzxB,KAAKwwB,UACd,IAIF3e,EAAYjS,UAAUoC,IAAMk1B,GAAkB3a,SAC9C1K,EAAYjS,UAAUy3B,SAAWxlB,EAAYjS,UAAU2c,SAKvDiX,GAAM/hB,EAAUF,EAAc3R,WAC9B4zB,GAAM5hB,EAAYF,EAAgB9R,WAClC4zB,GAAMzhB,EAAQF,EAAYjS,WAE1B4zB,GAAMvX,GAAiB1K,EAAc3R,WACrC4zB,GAAMtX,GAAmBxK,EAAgB9R,WACzC4zB,GAAMrX,GAAetK,EAAYjS,WAuEjB,CAEduR,SAAUA,EAEVG,IAAKA,EACL0K,WAAYA,GACZjO,IAAKA,GACLgT,WAAYA,GACZ5V,KAAMA,GACNwnB,MAAOA,GACPvrB,IAAKA,GACL2qB,WAAYA,GAEZjC,OAAQA,GACRtU,MAAOA,GACPR,OAAQA,GAERhB,GAAIA,GACJT,OAAQA,GAMZ,CAx2JkF2f,E,oBCalFpoB,EAAOC,QAZP,SAAmBoH,EAAOsyE,GAIxB,IAHA,IAAI9/E,GAAS,EACTxL,EAAkB,MAATgZ,EAAgB,EAAIA,EAAMhZ,SAE9BwL,EAAQxL,IAC8B,IAAzCsrF,EAAStyE,EAAMxN,GAAQA,EAAOwN,KAIpC,OAAOA,CACT,C,wBCnBA,IAAIuyE,EAAa,EAAQ,OACrBvkF,EAAO,EAAQ,OAenB2K,EAAOC,QAJP,SAAoBuH,EAAQ5Y,GAC1B,OAAO4Y,GAAUoyE,EAAWhrF,EAAQyG,EAAKzG,GAAS4Y,EACpD,C,wBCdA,IAAIoyE,EAAa,EAAQ,OACrBC,EAAS,EAAQ,OAerB75E,EAAOC,QAJP,SAAsBuH,EAAQ5Y,GAC5B,OAAO4Y,GAAUoyE,EAAWhrF,EAAQirF,EAAOjrF,GAAS4Y,EACtD,C,uBCdA,IAAIqa,EAAQ,EAAQ,OAChBi4D,EAAY,EAAQ,OACpBC,EAAc,EAAQ,OACtBC,EAAa,EAAQ,OACrBC,EAAe,EAAQ,OACvBC,EAAc,EAAQ,OACtBC,EAAY,EAAQ,OACpBC,EAAc,EAAQ,OACtBC,EAAgB,EAAQ,OACxBC,EAAa,EAAQ,OACrBC,EAAe,EAAQ,OACvBC,EAAS,EAAQ,MACjBC,EAAiB,EAAQ,OACzBC,EAAiB,EAAQ,OACzBC,EAAkB,EAAQ,OAC1BvsF,EAAU,EAAQ,OAClBwsF,EAAW,EAAQ,MACnB3sE,EAAQ,EAAQ,OAChB4sE,EAAW,EAAQ,OACnBt6D,EAAQ,EAAQ,OAChBlrB,EAAO,EAAQ,OACfwkF,EAAS,EAAQ,OAQjBiB,EAAU,qBAKVC,EAAU,oBAIVC,EAAY,kBAoBZC,EAAgB,CAAC,EACrBA,EAAcH,GAAWG,EA7BV,kBA8BfA,EAfqB,wBAeWA,EAdd,qBAelBA,EA9Bc,oBA8BWA,EA7BX,iBA8BdA,EAfiB,yBAeWA,EAdX,yBAejBA,EAdc,sBAcWA,EAbV,uBAcfA,EAbe,uBAaWA,EA5Bb,gBA6BbA,EA5BgB,mBA4BWA,EAAcD,GACzCC,EA3BgB,mBA2BWA,EA1Bd,gBA2BbA,EA1BgB,mBA0BWA,EAzBX,mBA0BhBA,EAhBe,uBAgBWA,EAfJ,8BAgBtBA,EAfgB,wBAeWA,EAdX,yBAcsC,EACtDA,EArCe,kBAqCWA,EAAcF,GACxCE,EA5BiB,qBA4BW,EA8F5Bj7E,EAAOC,QA5EP,SAASi7E,EAAU56E,EAAO66E,EAASC,EAAYvsF,EAAK2Y,EAAQgO,GAC1D,IAAI7d,EACA0jF,EAnEgB,EAmEPF,EACTG,EAnEgB,EAmEPH,EACTI,EAnEmB,EAmEVJ,EAKb,GAHIC,IACFzjF,EAAS6P,EAAS4zE,EAAW96E,EAAOzR,EAAK2Y,EAAQgO,GAAS4lE,EAAW96E,SAExD1I,IAAXD,EACF,OAAOA,EAET,IAAKkjF,EAASv6E,GACZ,OAAOA,EAET,IAAIk7E,EAAQptF,EAAQkS,GACpB,GAAIk7E,GAEF,GADA7jF,EAAS8iF,EAAen6E,IACnB+6E,EACH,OAAOlB,EAAU75E,EAAO3I,OAErB,CACL,IAAIo/B,EAAMyjD,EAAOl6E,GACbm7E,EAAS1kD,GAAOgkD,GA7EX,8BA6EsBhkD,EAE/B,GAAI6jD,EAASt6E,GACX,OAAO45E,EAAY55E,EAAO+6E,GAE5B,GAAItkD,GAAOikD,GAAajkD,GAAO+jD,GAAYW,IAAWj0E,GAEpD,GADA7P,EAAU2jF,GAAUG,EAAU,CAAC,EAAId,EAAgBr6E,IAC9C+6E,EACH,OAAOC,EACHjB,EAAc/5E,EAAO25E,EAAatiF,EAAQ2I,IAC1C85E,EAAY95E,EAAO05E,EAAWriF,EAAQ2I,QAEvC,CACL,IAAK26E,EAAclkD,GACjB,OAAOvvB,EAASlH,EAAQ,CAAC,EAE3B3I,EAAS+iF,EAAep6E,EAAOy2B,EAAKskD,EACtC,CACF,CAEA7lE,IAAUA,EAAQ,IAAIqM,GACtB,IAAI65D,EAAUlmE,EAAMzb,IAAIuG,GACxB,GAAIo7E,EACF,OAAOA,EAETlmE,EAAMxX,IAAIsC,EAAO3I,GAEb4oB,EAAMjgB,GACRA,EAAM/J,SAAQ,SAASolF,GACrBhkF,EAAOjB,IAAIwkF,EAAUS,EAAUR,EAASC,EAAYO,EAAUr7E,EAAOkV,GACvE,IACSvH,EAAM3N,IACfA,EAAM/J,SAAQ,SAASolF,EAAU9sF,GAC/B8I,EAAOqG,IAAInP,EAAKqsF,EAAUS,EAAUR,EAASC,EAAYvsF,EAAKyR,EAAOkV,GACvE,IAGF,IAIIjmB,EAAQisF,OAAQ5jF,GAJL2jF,EACVD,EAASf,EAAeD,EACxBgB,EAASzB,EAASxkF,GAEkBiL,GASzC,OARAw5E,EAAUvqF,GAAS+Q,GAAO,SAASq7E,EAAU9sF,GACvCU,IAEFosF,EAAWr7E,EADXzR,EAAM8sF,IAIR5B,EAAYpiF,EAAQ9I,EAAKqsF,EAAUS,EAAUR,EAASC,EAAYvsF,EAAKyR,EAAOkV,GAChF,IACO7d,CACT,C,wBCnKA,IAAIikF,EAAa,EAAQ,OAWrBC,EAViB,EAAQ,MAUdC,CAAeF,GAE9B57E,EAAOC,QAAU47E,C,oBCSjB77E,EAAOC,QAZP,SAAyBoH,EAAO/G,EAAOy7E,EAAW/rE,GAIhD,IAHA,IAAInW,EAAQkiF,EAAY,EACpB1tF,EAASgZ,EAAMhZ,SAEVwL,EAAQxL,GACf,GAAI2hB,EAAW3I,EAAMxN,GAAQyG,GAC3B,OAAOzG,EAGX,OAAQ,CACV,C,wBCpBA,IAAI2gF,EAAS,EAAQ,MACjBwB,EAAe,EAAQ,OAgB3Bh8E,EAAOC,QAJP,SAAmBK,GACjB,OAAO07E,EAAa17E,IAVT,gBAUmBk6E,EAAOl6E,EACvC,C,wBCfA,IAAIk6E,EAAS,EAAQ,MACjBwB,EAAe,EAAQ,OAgB3Bh8E,EAAOC,QAJP,SAAmBK,GACjB,OAAO07E,EAAa17E,IAVT,gBAUmBk6E,EAAOl6E,EACvC,C,uBCfA,IAAIu7E,EAAW,EAAQ,OACnBz2E,EAAc,EAAQ,OAoB1BpF,EAAOC,QAVP,SAAiBwT,EAAYkmE,GAC3B,IAAI9/E,GAAS,EACTlC,EAASyN,EAAYqO,GAActlB,MAAMslB,EAAWplB,QAAU,GAKlE,OAHAwtF,EAASpoE,GAAY,SAASnT,EAAOzR,EAAK4kB,GACxC9b,IAASkC,GAAS8/E,EAASr5E,EAAOzR,EAAK4kB,EACzC,IACO9b,CACT,C,wBCnBA,IAAIskF,EAAW,EAAQ,OACnBC,EAAU,EAAQ,OAClBC,EAAe,EAAQ,OACvBC,EAAU,EAAQ,MAClBC,EAAa,EAAQ,OACrBC,EAAY,EAAQ,OACpBC,EAAkB,EAAQ,OAC1BC,EAAW,EAAQ,OACnBpuF,EAAU,EAAQ,OAwCtB4R,EAAOC,QA7BP,SAAqBwT,EAAYgpE,EAAWC,GAExCD,EADEA,EAAUpuF,OACA4tF,EAASQ,GAAW,SAAS9C,GACvC,OAAIvrF,EAAQurF,GACH,SAASr5E,GACd,OAAO47E,EAAQ57E,EAA2B,IAApBq5E,EAAStrF,OAAesrF,EAAS,GAAKA,EAC9D,EAEKA,CACT,IAEY,CAAC6C,GAGf,IAAI3iF,GAAS,EACb4iF,EAAYR,EAASQ,EAAWH,EAAUH,IAE1C,IAAIxkF,EAASykF,EAAQ3oE,GAAY,SAASnT,EAAOzR,EAAK4kB,GAIpD,MAAO,CAAE,SAHMwoE,EAASQ,GAAW,SAAS9C,GAC1C,OAAOA,EAASr5E,EAClB,IAC+B,QAAWzG,EAAO,MAASyG,EAC5D,IAEA,OAAO+7E,EAAW1kF,GAAQ,SAAS6P,EAAQqE,GACzC,OAAO0wE,EAAgB/0E,EAAQqE,EAAO6wE,EACxC,GACF,C,wBC9CA,IAAIT,EAAW,EAAQ,OACnBU,EAAc,EAAQ,OACtBC,EAAkB,EAAQ,OAC1BN,EAAY,EAAQ,OACpBnC,EAAY,EAAQ,OAMpB7jE,EAHanoB,MAAMW,UAGCwnB,OAwCxBtW,EAAOC,QA3BP,SAAqBoH,EAAOsP,EAAQgjE,EAAU3pE,GAC5C,IAAI1a,EAAU0a,EAAa4sE,EAAkBD,EACzC9iF,GAAS,EACTxL,EAASsoB,EAAOtoB,OAChBwuF,EAAOx1E,EAQX,IANIA,IAAUsP,IACZA,EAASwjE,EAAUxjE,IAEjBgjE,IACFkD,EAAOZ,EAAS50E,EAAOi1E,EAAU3C,OAE1B9/E,EAAQxL,GAKf,IAJA,IAAI0tF,EAAY,EACZz7E,EAAQqW,EAAO9c,GACfy/D,EAAWqgB,EAAWA,EAASr5E,GAASA,GAEpCy7E,EAAYzmF,EAAQunF,EAAMvjB,EAAUyiB,EAAW/rE,KAAgB,GACjE6sE,IAASx1E,GACXiP,EAAOtnB,KAAK6tF,EAAMd,EAAW,GAE/BzlE,EAAOtnB,KAAKqY,EAAO00E,EAAW,GAGlC,OAAO10E,CACT,C,oBC1BArH,EAAOC,QATP,SAAoBwT,EAAYkmE,EAAUmD,EAAaC,EAAWC,GAMhE,OALAA,EAASvpE,GAAY,SAASnT,EAAOzG,EAAO4Z,GAC1CqpE,EAAcC,GACTA,GAAY,EAAOz8E,GACpBq5E,EAASmD,EAAax8E,EAAOzG,EAAO4Z,EAC1C,IACOqpE,CACT,C,oBCAA98E,EAAOC,QAVP,SAAoBoH,EAAO41E,GACzB,IAAI5uF,EAASgZ,EAAMhZ,OAGnB,IADAgZ,EAAM0I,KAAKktE,GACJ5uF,KACLgZ,EAAMhZ,GAAUgZ,EAAMhZ,GAAQiS,MAEhC,OAAO+G,CACT,C,wBClBA,IAAI40E,EAAW,EAAQ,OAkBvBj8E,EAAOC,QANP,SAAoBuH,EAAQjY,GAC1B,OAAO0sF,EAAS1sF,GAAO,SAASV,GAC9B,OAAO2Y,EAAO3Y,EAChB,GACF,C,wBChBA,IAAI2tF,EAAW,EAAQ,OAavBx8E,EAAOC,QAJP,SAAsBK,GACpB,MAAuB,mBAATA,EAAsBA,EAAQk8E,CAC9C,C,wBCXA,IAAIU,EAAmB,EAAQ,OAe/Bl9E,EAAOC,QALP,SAAuBk9E,EAAU9B,GAC/B,IAAI+B,EAAS/B,EAAS6B,EAAiBC,EAASC,QAAUD,EAASC,OACnE,OAAO,IAAID,EAASv/E,YAAYw/E,EAAQD,EAASE,WAAYF,EAASG,WACxE,C,oBCZA,IAAIC,EAAU,OAedv9E,EAAOC,QANP,SAAqBu9E,GACnB,IAAI7lF,EAAS,IAAI6lF,EAAO5/E,YAAY4/E,EAAO5uF,OAAQ2uF,EAAQl8B,KAAKm8B,IAEhE,OADA7lF,EAAOg9E,UAAY6I,EAAO7I,UACnBh9E,CACT,C,wBCdA,IAAIuM,EAAS,EAAQ,OAGjBu5E,EAAcv5E,EAASA,EAAOpV,eAAY8I,EAC1C8lF,EAAgBD,EAAcA,EAAYp0E,aAAUzR,EAaxDoI,EAAOC,QAJP,SAAqB09E,GACnB,OAAOD,EAAgBlvF,OAAOkvF,EAAc1uF,KAAK2uF,IAAW,CAAC,CAC/D,C,wBCfA,IAAIC,EAAW,EAAQ,OAwCvB59E,EAAOC,QA9BP,SAA0BK,EAAOuL,GAC/B,GAAIvL,IAAUuL,EAAO,CACnB,IAAIgyE,OAAyBjmF,IAAV0I,EACfw9E,EAAsB,OAAVx9E,EACZy9E,EAAiBz9E,IAAUA,EAC3B09E,EAAcJ,EAASt9E,GAEvB29E,OAAyBrmF,IAAViU,EACfqyE,EAAsB,OAAVryE,EACZsyE,EAAiBtyE,IAAUA,EAC3BuyE,EAAcR,EAAS/xE,GAE3B,IAAMqyE,IAAcE,IAAgBJ,GAAe19E,EAAQuL,GACtDmyE,GAAeC,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BN,GAAgBM,IACjBJ,EACH,OAAO,EAET,IAAMD,IAAcE,IAAgBI,GAAe99E,EAAQuL,GACtDuyE,GAAeP,GAAgBE,IAAmBD,IAAcE,GAChEE,GAAaL,GAAgBE,IAC5BE,GAAgBF,IACjBI,EACH,OAAQ,CAEZ,CACA,OAAO,CACT,C,wBCtCA,IAAIE,EAAmB,EAAQ,OA2C/Br+E,EAAOC,QA3BP,SAAyBuH,EAAQqE,EAAO6wE,GAOtC,IANA,IAAI7iF,GAAS,EACTykF,EAAc92E,EAAO+2E,SACrBC,EAAc3yE,EAAM0yE,SACpBlwF,EAASiwF,EAAYjwF,OACrBowF,EAAe/B,EAAOruF,SAEjBwL,EAAQxL,GAAQ,CACvB,IAAIsJ,EAAS0mF,EAAiBC,EAAYzkF,GAAQ2kF,EAAY3kF,IAC9D,GAAIlC,EACF,OAAIkC,GAAS4kF,EACJ9mF,EAGFA,GAAmB,QADd+kF,EAAO7iF,IACiB,EAAI,EAE5C,CAQA,OAAO2N,EAAO3N,MAAQgS,EAAMhS,KAC9B,C,wBCzCA,IAAI+/E,EAAa,EAAQ,OACrB8E,EAAa,EAAQ,MAczB1+E,EAAOC,QAJP,SAAqBrR,EAAQ4Y,GAC3B,OAAOoyE,EAAWhrF,EAAQ8vF,EAAW9vF,GAAS4Y,EAChD,C,wBCbA,IAAIoyE,EAAa,EAAQ,OACrB+E,EAAe,EAAQ,OAc3B3+E,EAAOC,QAJP,SAAuBrR,EAAQ4Y,GAC7B,OAAOoyE,EAAWhrF,EAAQ+vF,EAAa/vF,GAAS4Y,EAClD,C,wBCbA,IAAIpC,EAAc,EAAQ,OA+B1BpF,EAAOC,QArBP,SAAwB+8E,EAAU4B,GAChC,OAAO,SAASnrE,EAAYkmE,GAC1B,GAAkB,MAAdlmE,EACF,OAAOA,EAET,IAAKrO,EAAYqO,GACf,OAAOupE,EAASvpE,EAAYkmE,GAM9B,IAJA,IAAItrF,EAASolB,EAAWplB,OACpBwL,EAAQ+kF,EAAYvwF,GAAU,EAC9B6W,EAAW1W,OAAOilB,IAEdmrE,EAAY/kF,MAAYA,EAAQxL,KACa,IAA/CsrF,EAASz0E,EAASrL,GAAQA,EAAOqL,KAIvC,OAAOuO,CACT,CACF,C,wBC7BA,IAAIorE,EAAiB,EAAQ,OACzBF,EAAe,EAAQ,OACvB9E,EAAS,EAAQ,OAcrB75E,EAAOC,QAJP,SAAsBuH,GACpB,OAAOq3E,EAAer3E,EAAQqyE,EAAQ8E,EACxC,C,wBCdA,IAAIG,EAAY,EAAQ,OACpBC,EAAe,EAAQ,OACvBL,EAAa,EAAQ,MACrBM,EAAY,EAAQ,OAYpBL,EATmBnwF,OAAOq0B,sBASqB,SAASrb,GAE1D,IADA,IAAI7P,EAAS,GACN6P,GACLs3E,EAAUnnF,EAAQ+mF,EAAWl3E,IAC7BA,EAASu3E,EAAav3E,GAExB,OAAO7P,CACT,EAPuCqnF,EASvCh/E,EAAOC,QAAU0+E,C,oBCvBjB,IAGI5vF,EAHcP,OAAOM,UAGQC,eAqBjCiR,EAAOC,QAZP,SAAwBoH,GACtB,IAAIhZ,EAASgZ,EAAMhZ,OACfsJ,EAAS,IAAI0P,EAAMzJ,YAAYvP,GAOnC,OAJIA,GAA6B,iBAAZgZ,EAAM,IAAkBtY,EAAeC,KAAKqY,EAAO,WACtE1P,EAAOkC,MAAQwN,EAAMxN,MACrBlC,EAAOixE,MAAQvhE,EAAMuhE,OAEhBjxE,CACT,C,wBCvBA,IAAIulF,EAAmB,EAAQ,OAC3B+B,EAAgB,EAAQ,OACxBC,EAAc,EAAQ,OACtBC,EAAc,EAAQ,OACtBC,EAAkB,EAAQ,OAwE9Bp/E,EAAOC,QApCP,SAAwBuH,EAAQuvB,EAAKskD,GACnC,IAAIgE,EAAO73E,EAAO5J,YAClB,OAAQm5B,GACN,IA3BiB,uBA4Bf,OAAOmmD,EAAiB11E,GAE1B,IAvCU,mBAwCV,IAvCU,gBAwCR,OAAO,IAAI63E,GAAM73E,GAEnB,IAjCc,oBAkCZ,OAAOy3E,EAAcz3E,EAAQ6zE,GAE/B,IAnCa,wBAmCI,IAlCJ,wBAmCb,IAlCU,qBAkCI,IAjCH,sBAiCkB,IAhClB,sBAiCX,IAhCW,sBAgCI,IA/BG,6BA+BmB,IA9BzB,uBA8ByC,IA7BzC,uBA8BV,OAAO+D,EAAgB53E,EAAQ6zE,GAEjC,IAjDS,eA2DT,IAxDS,eAyDP,OAAO,IAAIgE,EARb,IAnDY,kBAoDZ,IAjDY,kBAkDV,OAAO,IAAIA,EAAK73E,GAElB,IAtDY,kBAuDV,OAAO03E,EAAY13E,GAKrB,IAzDY,kBA0DV,OAAO23E,EAAY33E,GAEzB,C,wBC1EA,IAAI0zE,EAAY,EAAQ,MA4BxBl7E,EAAOC,QAJP,SAAmBK,GACjB,OAAO46E,EAAU56E,EAAOg/E,EAC1B,C,oBCIAt/E,EAAOC,QAfP,SAAiBoH,GAMf,IALA,IAAIxN,GAAS,EACTxL,EAAkB,MAATgZ,EAAgB,EAAIA,EAAMhZ,OACnCkxF,EAAW,EACX5nF,EAAS,KAEJkC,EAAQxL,GAAQ,CACvB,IAAIiS,EAAQ+G,EAAMxN,GACdyG,IACF3I,EAAO4nF,KAAcj/E,EAEzB,CACA,OAAO3I,CACT,C,wBC5BA,IAAIkjF,EAAW,EAAQ,OACnB2E,EAAM,EAAQ,OACdC,EAAW,EAAQ,OAMnBC,EAAY/8E,KAAKC,IACjB+8E,EAAYh9E,KAAKkB,IAqLrB7D,EAAOC,QA7HP,SAAkB2kE,EAAMgb,EAAMzrD,GAC5B,IAAI0rD,EACAC,EACAC,EACApoF,EACAqoF,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACTC,GAAW,EAEf,GAAmB,mBAARzb,EACT,MAAM,IAAI18D,UAzEQ,uBAmFpB,SAASo4E,EAAWC,GAClB,IAAIxpF,EAAO8oF,EACPW,EAAUV,EAKd,OAHAD,EAAWC,OAAWloF,EACtBsoF,EAAiBK,EACjB5oF,EAASitE,EAAK31E,MAAMuxF,EAASzpF,EAE/B,CAqBA,SAAS0pF,EAAaF,GACpB,IAAIG,EAAoBH,EAAON,EAM/B,YAAyBroF,IAAjBqoF,GAA+BS,GAAqBd,GACzDc,EAAoB,GAAON,GANJG,EAAOL,GAM8BH,CACjE,CAEA,SAASY,IACP,IAAIJ,EAAOf,IACX,GAAIiB,EAAaF,GACf,OAAOK,EAAaL,GAGtBP,EAAUrqC,WAAWgrC,EA3BvB,SAAuBJ,GACrB,IAEIM,EAAcjB,GAFMW,EAAON,GAI/B,OAAOG,EACHT,EAAUkB,EAAad,GAJDQ,EAAOL,IAK7BW,CACN,CAmBqCC,CAAcP,GACnD,CAEA,SAASK,EAAaL,GAKpB,OAJAP,OAAUpoF,EAINyoF,GAAYR,EACPS,EAAWC,IAEpBV,EAAWC,OAAWloF,EACfD,EACT,CAcA,SAASopF,IACP,IAAIR,EAAOf,IACPwB,EAAaP,EAAaF,GAM9B,GAJAV,EAAWvxF,UACXwxF,EAAW5wF,KACX+wF,EAAeM,EAEXS,EAAY,CACd,QAAgBppF,IAAZooF,EACF,OAzEN,SAAqBO,GAMnB,OAJAL,EAAiBK,EAEjBP,EAAUrqC,WAAWgrC,EAAcf,GAE5BO,EAAUG,EAAWC,GAAQ5oF,CACtC,CAkEaspF,CAAYhB,GAErB,GAAIG,EAIF,OAFAc,aAAalB,GACbA,EAAUrqC,WAAWgrC,EAAcf,GAC5BU,EAAWL,EAEtB,CAIA,YAHgBroF,IAAZooF,IACFA,EAAUrqC,WAAWgrC,EAAcf,IAE9BjoF,CACT,CAGA,OA3GAioF,EAAOH,EAASG,IAAS,EACrB/E,EAAS1mD,KACXgsD,IAAYhsD,EAAQgsD,QAEpBJ,GADAK,EAAS,YAAajsD,GACHurD,EAAUD,EAAStrD,EAAQ4rD,UAAY,EAAGH,GAAQG,EACrEM,EAAW,aAAclsD,IAAYA,EAAQksD,SAAWA,GAoG1DU,EAAUI,OApCV,gBACkBvpF,IAAZooF,GACFkB,aAAalB,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,OAAUpoF,CACjD,EA+BAmpF,EAAUK,MA7BV,WACE,YAAmBxpF,IAAZooF,EAAwBroF,EAASipF,EAAapB,IACvD,EA4BOuB,CACT,C,wBC5LA/gF,EAAOC,QAAU,EAAjB,M,wBCAA,IAAI65E,EAAY,EAAQ,OACpB+B,EAAW,EAAQ,OACnBwF,EAAe,EAAQ,OACvBjzF,EAAU,EAAQ,OAqCtB4R,EAAOC,QALP,SAAiBwT,EAAYkmE,GAE3B,OADWvrF,EAAQqlB,GAAcqmE,EAAY+B,GACjCpoE,EAAY4tE,EAAa1H,GACvC,C,wBCtCA,IAAIiC,EAAa,EAAQ,OACrByF,EAAe,EAAQ,OAkC3BrhF,EAAOC,QAJP,SAAgBuH,EAAQmyE,GACtB,OAAOnyE,GAAUo0E,EAAWp0E,EAAQ65E,EAAa1H,GACnD,C,wBCjCA,IAAIgD,EAAc,EAAQ,OACtBv3E,EAAc,EAAQ,OACtBk8E,EAAW,EAAQ,OACnBC,EAAY,EAAQ,OACpB5qE,EAAS,EAAQ,OAGjB+oE,EAAY/8E,KAAKC,IA6CrB5C,EAAOC,QAbP,SAAkBwT,EAAYnT,EAAOy7E,EAAWyF,GAC9C/tE,EAAarO,EAAYqO,GAAcA,EAAakD,EAAOlD,GAC3DsoE,EAAaA,IAAcyF,EAASD,EAAUxF,GAAa,EAE3D,IAAI1tF,EAASolB,EAAWplB,OAIxB,OAHI0tF,EAAY,IACdA,EAAY2D,EAAUrxF,EAAS0tF,EAAW,IAErCuF,EAAS7tE,GACXsoE,GAAa1tF,GAAUolB,EAAWne,QAAQgL,EAAOy7E,IAAc,IAC7D1tF,GAAUsuF,EAAYlpE,EAAYnT,EAAOy7E,IAAc,CAChE,C,wBClDA,IAAI0F,EAAY,EAAQ,OACpBnF,EAAY,EAAQ,OACpBoF,EAAW,EAAQ,OAGnBC,EAAYD,GAAYA,EAASzzE,MAmBjCA,EAAQ0zE,EAAYrF,EAAUqF,GAAaF,EAE/CzhF,EAAOC,QAAUgO,C,wBC1BjB,IAAI2zE,EAAY,EAAQ,OACpBtF,EAAY,EAAQ,OACpBoF,EAAW,EAAQ,OAGnBG,EAAYH,GAAYA,EAASnhE,MAmBjCA,EAAQshE,EAAYvF,EAAUuF,GAAaD,EAE/C5hF,EAAOC,QAAUsgB,C,wBC1BjB,IAAIuhE,EAAa,EAAQ,OACrB1zF,EAAU,EAAQ,OAClB4tF,EAAe,EAAQ,OA2B3Bh8E,EAAOC,QALP,SAAkBK,GAChB,MAAuB,iBAATA,IACVlS,EAAQkS,IAAU07E,EAAa17E,IArBrB,mBAqB+BwhF,EAAWxhF,EAC1D,C,wBC3BA,IAAI27E,EAAW,EAAQ,OACnBE,EAAe,EAAQ,OACvBC,EAAU,EAAQ,MAClBhuF,EAAU,EAAQ,OAiDtB4R,EAAOC,QALP,SAAawT,EAAYkmE,GAEvB,OADWvrF,EAAQqlB,GAAcwoE,EAAWG,GAChC3oE,EAAY0oE,EAAaxC,EAAU,GACjD,C,wBClDA,IAAI3nE,EAAO,EAAQ,MAsBnBhS,EAAOC,QAJG,WACR,OAAO+R,EAAK+vE,KAAKvC,KACnB,C,wBCpBA,IAAIwC,EAAc,EAAQ,OACtB5zF,EAAU,EAAQ,OA6CtB4R,EAAOC,QAdP,SAAiBwT,EAAYgpE,EAAWC,EAAQ8E,GAC9C,OAAkB,MAAd/tE,EACK,IAEJrlB,EAAQquF,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAGnCruF,EADLsuF,EAAS8E,OAAQ5pF,EAAY8kF,KAE3BA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BsF,EAAYvuE,EAAYgpE,EAAWC,GAC5C,C,wBC5CA,IA0BIuF,EA1BW,EAAQ,MA0BZC,CAzBG,EAAQ,QA2BtBliF,EAAOC,QAAUgiF,C,wBC5BjB,IAAIE,EAAc,EAAQ,OA4B1BniF,EAAOC,QANP,SAAiBoH,EAAOsP,GACtB,OAAQtP,GAASA,EAAMhZ,QAAUsoB,GAAUA,EAAOtoB,OAC9C8zF,EAAY96E,EAAOsP,GACnBtP,CACN,C,wBC1BA,IAAI+6E,EAAc,EAAQ,OACtBvG,EAAW,EAAQ,OACnBM,EAAe,EAAQ,OACvBkG,EAAa,EAAQ,OACrBj0F,EAAU,EAAQ,OA8CtB4R,EAAOC,QAPP,SAAgBwT,EAAYkmE,EAAUmD,GACpC,IAAIlY,EAAOx2E,EAAQqlB,GAAc2uE,EAAcC,EAC3CtF,EAAYzuF,UAAUD,OAAS,EAEnC,OAAOu2E,EAAKnxD,EAAY0oE,EAAaxC,EAAU,GAAImD,EAAaC,EAAWlB,EAC7E,C,uBChDA,IAAIyG,EAAW,EAAQ,OACnBzH,EAAW,EAAQ,OAmEvB76E,EAAOC,QAlBP,SAAkB2kE,EAAMgb,EAAMzrD,GAC5B,IAAIgsD,GAAU,EACVE,GAAW,EAEf,GAAmB,mBAARzb,EACT,MAAM,IAAI18D,UAnDQ,uBAyDpB,OAJI2yE,EAAS1mD,KACXgsD,EAAU,YAAahsD,IAAYA,EAAQgsD,QAAUA,EACrDE,EAAW,aAAclsD,IAAYA,EAAQksD,SAAWA,GAEnDiC,EAAS1d,EAAMgb,EAAM,CAC1B,QAAWO,EACX,QAAWP,EACX,SAAYS,GAEhB,C,wBClEA,IAAIkC,EAAW,EAAQ,OAmCvBviF,EAAOC,QAPP,SAAmBK,GACjB,IAAI3I,EAAS4qF,EAASjiF,GAClBkiF,EAAY7qF,EAAS,EAEzB,OAAOA,IAAWA,EAAU6qF,EAAY7qF,EAAS6qF,EAAY7qF,EAAU,CACzE,C,wBCjCA,IAAI8qF,EAAa,EAAQ,OACrBptF,EAAO,EAAQ,OAgCnB2K,EAAOC,QAJP,SAAgBuH,GACd,OAAiB,MAAVA,EAAiB,GAAKi7E,EAAWj7E,EAAQnS,EAAKmS,GACvD,C,iCCLA,SAASzY,EAAemM,EAAKwnF,GAC3B,OAAOl0F,OAAOM,UAAUC,eAAeC,KAAKkM,EAAKwnF,EACnD,CAEA1iF,EAAOC,QAAU,SAAS0iF,EAAIC,EAAKC,EAAI1uD,GACrCyuD,EAAMA,GAAO,IACbC,EAAKA,GAAM,IACX,IAAI3nF,EAAM,CAAC,EAEX,GAAkB,kBAAPynF,GAAiC,IAAdA,EAAGt0F,OAC/B,OAAO6M,EAGT,IAAIsiF,EAAS,MACbmF,EAAKA,EAAG/oF,MAAMgpF,GAEd,IAAIE,EAAU,IACV3uD,GAAsC,kBAApBA,EAAQ2uD,UAC5BA,EAAU3uD,EAAQ2uD,SAGpB,IAAIpgF,EAAMigF,EAAGt0F,OAETy0F,EAAU,GAAKpgF,EAAMogF,IACvBpgF,EAAMogF,GAGR,IAAK,IAAIn0F,EAAI,EAAGA,EAAI+T,IAAO/T,EAAG,CAC5B,IAEIo0F,EAAMC,EAAMx+E,EAAGC,EAFfiP,EAAIivE,EAAGh0F,GAAGyhC,QAAQotD,EAAQ,OAC1BrpE,EAAMT,EAAEpe,QAAQutF,GAGhB1uE,GAAO,GACT4uE,EAAOrvE,EAAE29C,OAAO,EAAGl9C,GACnB6uE,EAAOtvE,EAAE29C,OAAOl9C,EAAM,KAEtB4uE,EAAOrvE,EACPsvE,EAAO,IAGTx+E,EAAIy+E,mBAAmBF,GACvBt+E,EAAIw+E,mBAAmBD,GAElBj0F,EAAemM,EAAKsJ,GAEdrW,MAAMC,QAAQ8M,EAAIsJ,IAC3BtJ,EAAIsJ,GAAGvR,KAAKwR,GAEZvJ,EAAIsJ,GAAK,CAACtJ,EAAIsJ,GAAIC,GAJlBvJ,EAAIsJ,GAAKC,CAMb,CAEA,OAAOvJ,CACT,C,iCCxDA,IAAIgoF,EAAqB,SAASz+E,GAChC,cAAeA,GACb,IAAK,SACH,OAAOA,EAET,IAAK,UACH,OAAOA,EAAI,OAAS,QAEtB,IAAK,SACH,OAAOwwE,SAASxwE,GAAKA,EAAI,GAE3B,QACE,MAAO,GAEb,EAEAzE,EAAOC,QAAU,SAAS/E,EAAK0nF,EAAKC,EAAI3jE,GAOtC,OANA0jE,EAAMA,GAAO,IACbC,EAAKA,GAAM,IACC,OAAR3nF,IACFA,OAAMtD,GAGW,kBAARsD,EACF1M,OAAO6G,KAAK6F,GAAKR,KAAI,SAAS8J,GACnC,IAAI2+E,EAAKC,mBAAmBF,EAAmB1+E,IAAMq+E,EACrD,OAAI10F,MAAMC,QAAQ8M,EAAIsJ,IACbtJ,EAAIsJ,GAAG9J,KAAI,SAAS+J,GACzB,OAAO0+E,EAAKC,mBAAmBF,EAAmBz+E,GACpD,IAAGpM,KAAKuqF,GAEDO,EAAKC,mBAAmBF,EAAmBhoF,EAAIsJ,IAE1D,IAAGpT,OAAO0hE,SAASz6D,KAAKuqF,GAIrB1jE,EACEkkE,mBAAmBF,EAAmBhkE,IAAS2jE,EAC/CO,mBAAmBF,EAAmBhoF,IAF3B,EAGpB,C,qCC7DA+E,EAAQo2C,OAASp2C,EAAQojF,MAAQ,EAAhB,OACjBpjF,EAAQuyC,OAASvyC,EAAQknB,UAAY,EAApB,M,qCCDjB34B,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQqjF,WAAQ1rF,EAEhB,IAAIrJ,EAAWC,OAAOC,QAAU,SAAUC,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAE3P60F,EAAe,WAAc,SAASv4D,EAAiBt8B,EAAQa,GAAS,IAAK,IAAIZ,EAAI,EAAGA,EAAIY,EAAMlB,OAAQM,IAAK,CAAE,IAAI+jC,EAAanjC,EAAMZ,GAAI+jC,EAAW9H,WAAa8H,EAAW9H,aAAc,EAAO8H,EAAWzH,cAAe,EAAU,UAAWyH,IAAYA,EAAWxH,UAAW,GAAM18B,OAAOif,eAAe/e,EAAQgkC,EAAW7jC,IAAK6jC,EAAa,CAAE,CAAE,OAAO,SAAU2B,EAAaK,EAAYC,GAAiJ,OAA9HD,GAAY1J,EAAiBqJ,EAAYvlC,UAAW4lC,GAAiBC,GAAa3J,EAAiBqJ,EAAaM,GAAqBN,CAAa,CAAG,CAA7hB,GAEfmvD,EAAS,EAAQ,OAEjBC,EAAUC,EAAuBF,GAIjCG,EAAaD,EAFD,EAAQ,QAMpBE,EAMJ,SAAiC1oF,GAAO,GAAIA,GAAOA,EAAI2oF,WAAc,OAAO3oF,EAAc,IAAI4oF,EAAS,CAAC,EAAG,GAAW,MAAP5oF,EAAe,IAAK,IAAIrM,KAAOqM,EAAW1M,OAAOM,UAAUC,eAAeC,KAAKkM,EAAKrM,KAAMi1F,EAAOj1F,GAAOqM,EAAIrM,IAAgC,OAAtBi1F,EAAOC,QAAU7oF,EAAY4oF,CAAU,CANhQE,CAFC,EAAQ,QAMjBC,EAAeP,EAFD,EAAQ,QAM1B,SAASA,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAI9F,SAASgpF,EAA2Bn8C,EAAM/4C,GAAQ,IAAK+4C,EAAQ,MAAM,IAAIC,eAAe,6DAAgE,OAAOh5C,GAAyB,kBAATA,GAAqC,oBAATA,EAA8B+4C,EAAP/4C,CAAa,CAI/O,IAAIs0F,EAAQrjF,EAAQqjF,MAAQ,SAAUl0F,GAGpC,SAASk0F,IACP,IAAItrD,EAEAmsD,EAAOvoF,GAZf,SAAyBw4B,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAInsB,UAAU,oCAAwC,CAcpJosB,CAAgBplC,KAAMo0F,GAEtB,IAAK,IAAI5qF,EAAOpK,UAAUD,OAAQ0I,EAAO5I,MAAMuK,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC3E5B,EAAK4B,GAAQrK,UAAUqK,GAGzB,OAAewrF,EAASvoF,EAAQsoF,EAA2Bh1F,MAAO8oC,EAAQsrD,EAAMruF,WAAazG,OAAO0xB,eAAeojE,IAAQt0F,KAAKC,MAAM+oC,EAAO,CAAC9oC,MAAMiI,OAAOJ,KAAiB6E,EAAMwoF,aAAe,SAAUr2F,GACzM,IAAIs2F,EAAST,EAAMU,gBAAgBv2F,EAAG6N,EAAMrM,MAAMg1F,IAAK3oF,EAAMrM,MAAMkiD,UAAW71C,EAAMrM,MAAMia,EAAG5N,EAAM6oC,WACnG4/C,GAA0C,oBAAzBzoF,EAAMrM,MAAM4K,UAA2ByB,EAAMrM,MAAM4K,SAASkqF,EAAQt2F,EACvF,EAAG6N,EAAM4oF,gBAAkB,SAAUz2F,GACnC6N,EAAMwoF,aAAar2F,GACnBo8C,OAAOhF,iBAAiB,YAAavpC,EAAMwoF,cAC3Cj6C,OAAOhF,iBAAiB,UAAWvpC,EAAM6oF,cAC3C,EAAG7oF,EAAM6oF,cAAgB,WACvB7oF,EAAM8oF,sBACR,EAAG9oF,EAAM8oF,qBAAuB,WAC9Bv6C,OAAO5E,oBAAoB,YAAa3pC,EAAMwoF,cAC9Cj6C,OAAO5E,oBAAoB,UAAW3pC,EAAM6oF,cAC9C,EAAWP,EAA2BtoF,EAAnCuoF,EACL,CA8FA,OA3HF,SAAmB1oF,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIwM,UAAU,kEAAoExM,GAAeD,EAAS3M,UAAYN,OAAOmP,OAAOjC,GAAcA,EAAW5M,UAAW,CAAE8O,YAAa,CAAE0C,MAAO7E,EAAUmvB,YAAY,EAAOM,UAAU,EAAMD,cAAc,KAAevvB,IAAYlN,OAAOwG,eAAiBxG,OAAOwG,eAAeyG,EAAUC,GAAcD,EAASxG,UAAYyG,EAAY,CAG3eipF,CAAUrB,EAAOl0F,GA4BjBm0F,EAAaD,EAAO,CAAC,CACnBz0F,IAAK,uBACLyR,MAAO,WACLpR,KAAKw1F,sBACP,GACC,CACD71F,IAAK,SACLyR,MAAO,WACL,IAAI7B,EAASvP,KAET01F,EAAM11F,KAAKK,MAAMq1F,IACjBxsF,GAAS,EAAIurF,EAAWI,SAAS,CACnC,QAAW,CACTH,MAAO,CACLiB,SAAU,kBACVC,aAAc51F,KAAKK,MAAMw1F,QAE3BC,WAAY,CACVH,SAAU,kBACV7W,SAAU,SACV8W,aAAc51F,KAAKK,MAAMw1F,QAE3BE,SAAU,CACRJ,SAAU,kBACVK,WAAY,kCAAoCN,EAAI92F,EAAI,IAAM82F,EAAI/zC,EAAI,IAAM+zC,EAAIn7E,EAAI,6BAA+Bm7E,EAAI92F,EAAI,IAAM82F,EAAI/zC,EAAI,IAAM+zC,EAAIn7E,EAAI,aACvJ07E,UAAWj2F,KAAKK,MAAM61F,OACtBN,aAAc51F,KAAKK,MAAMw1F,QAE3BtgD,UAAW,CACTk1B,SAAU,WACVrpE,OAAQ,OACR+0F,OAAQ,SAEVC,QAAS,CACP3rB,SAAU,WACV5hD,KAAc,IAAR6sE,EAAIp7E,EAAU,KAEtB+7E,OAAQ,CACN/0F,MAAO,MACPs0F,aAAc,MACdx0F,OAAQ,MACR60F,UAAW,4BACXD,WAAY,OACZM,UAAW,MACXC,UAAW,qBAGf,SAAY,CACVR,SAAU,CACRC,WAAY,mCAAqCN,EAAI92F,EAAI,IAAM82F,EAAI/zC,EAAI,IAAM+zC,EAAIn7E,EAAI,6BAA+Bm7E,EAAI92F,EAAI,IAAM82F,EAAI/zC,EAAI,IAAM+zC,EAAIn7E,EAAI,cAE1J67E,QAAS,CACPvtE,KAAM,EACN8gD,IAAa,IAAR+rB,EAAIp7E,EAAU,MAGvB,UAAajb,EAAS,CAAC,EAAGW,KAAKK,MAAM8B,QACpC,CACDq0F,SAAmC,aAAzBx2F,KAAKK,MAAMkiD,UACrBk0C,WAAW,IAGb,OAAOlC,EAAQM,QAAQ79C,cACrB,MACA,CAAE70C,MAAO+G,EAAOwrF,OAChBH,EAAQM,QAAQ79C,cACd,MACA,CAAE70C,MAAO+G,EAAO4sF,YAChBvB,EAAQM,QAAQ79C,cAAc+9C,EAAaF,QAAS,CAAE6B,UAAW12F,KAAKK,MAAMq2F,aAE9EnC,EAAQM,QAAQ79C,cAAc,MAAO,CAAE70C,MAAO+G,EAAO6sF,WACrDxB,EAAQM,QAAQ79C,cACd,MACA,CACE70C,MAAO+G,EAAOqsC,UACdzlC,IAAK,SAAaylC,GAChB,OAAOhmC,EAAOgmC,UAAYA,CAC5B,EACA10C,YAAab,KAAKs1F,gBAClBqB,YAAa32F,KAAKk1F,aAClB0B,aAAc52F,KAAKk1F,cAErBX,EAAQM,QAAQ79C,cACd,MACA,CAAE70C,MAAO+G,EAAOktF,SAChBp2F,KAAKK,MAAM+1F,QAAU7B,EAAQM,QAAQ79C,cAAch3C,KAAKK,MAAM+1F,QAASp2F,KAAKK,OAASk0F,EAAQM,QAAQ79C,cAAc,MAAO,CAAE70C,MAAO+G,EAAOmtF,WAIlJ,KAGKjC,CACT,CA1H4B,CA0H1BE,EAAOuC,eAAiBvC,EAAO7oF,WAEjCsF,EAAA,QAAkBqjF,C,qCC/JlB90F,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQ+lF,gBAAapuF,EAErB,IAAIrJ,EAAWC,OAAOC,QAAU,SAAUC,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAE3P80F,EAAS,EAAQ,OAEjBC,EAAUC,EAAuBF,GAIjCG,EAAaD,EAFD,EAAQ,QAMpBsB,EAEJ,SAAiC9pF,GAAO,GAAIA,GAAOA,EAAI2oF,WAAc,OAAO3oF,EAAc,IAAI4oF,EAAS,CAAC,EAAG,GAAW,MAAP5oF,EAAe,IAAK,IAAIrM,KAAOqM,EAAW1M,OAAOM,UAAUC,eAAeC,KAAKkM,EAAKrM,KAAMi1F,EAAOj1F,GAAOqM,EAAIrM,IAAgC,OAAtBi1F,EAAOC,QAAU7oF,EAAY4oF,CAAU,CAF3PE,CAFC,EAAQ,QAM1B,SAASN,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAE9F,IAAI8qF,EAAa/lF,EAAQ+lF,WAAa,SAAoB52F,GACxD,IAAI62F,EAAQ72F,EAAK62F,MACbC,EAAO92F,EAAK82F,KACZ7qF,EAAOjM,EAAKiM,KACZuqF,EAAYx2F,EAAKw2F,UACjBd,EAAe11F,EAAK01F,aACpBK,EAAY/1F,EAAK+1F,UACjB71F,EAAWF,EAAKE,SAEhB8I,GAAS,EAAIurF,EAAWI,SAAS,CACnC,QAAW,CACToC,KAAM,CACJrB,aAAcA,EACdK,UAAWA,EACXN,SAAU,kBACVK,WAAY,OAASF,EAAWjrF,IAAIksF,EAAOC,EAAM7qF,EAAMuqF,EAAUQ,QAAU,oBAIjF,OAAO,EAAI5C,EAAO6C,gBAAgB/2F,GAAYm0F,EAAQM,QAAQ/uC,aAAa1lD,EAAUf,EAAS,CAAC,EAAGe,EAASC,MAAO,CAAE8B,MAAO9C,EAAS,CAAC,EAAGe,EAASC,MAAM8B,MAAO+G,EAAO+tF,SAAY1C,EAAQM,QAAQ79C,cAAc,MAAO,CAAE70C,MAAO+G,EAAO+tF,MACxO,EAEAH,EAAW5mF,aAAe,CACxB/D,KAAM,EACN4qF,MAAO,cACPC,KAAM,kBACNN,UAAW,CAAC,GAGd3lF,EAAA,QAAkB+lF,C,qCCpDlBx3F,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQqmF,eAAY1uF,EAEpB,IAAIrJ,EAAWC,OAAOC,QAAU,SAAUC,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAE3P60F,EAAe,WAAc,SAASv4D,EAAiBt8B,EAAQa,GAAS,IAAK,IAAIZ,EAAI,EAAGA,EAAIY,EAAMlB,OAAQM,IAAK,CAAE,IAAI+jC,EAAanjC,EAAMZ,GAAI+jC,EAAW9H,WAAa8H,EAAW9H,aAAc,EAAO8H,EAAWzH,cAAe,EAAU,UAAWyH,IAAYA,EAAWxH,UAAW,GAAM18B,OAAOif,eAAe/e,EAAQgkC,EAAW7jC,IAAK6jC,EAAa,CAAE,CAAE,OAAO,SAAU2B,EAAaK,EAAYC,GAAiJ,OAA9HD,GAAY1J,EAAiBqJ,EAAYvlC,UAAW4lC,GAAiBC,GAAa3J,EAAiBqJ,EAAaM,GAAqBN,CAAa,CAAG,CAA7hB,GAEfmvD,EAAS,EAAQ,OAEjBC,EAAUC,EAAuBF,GAIjC+C,EAAa7C,EAFD,EAAQ,QAMpB8C,EAEJ,SAAiCtrF,GAAO,GAAIA,GAAOA,EAAI2oF,WAAc,OAAO3oF,EAAc,IAAI4oF,EAAS,CAAC,EAAG,GAAW,MAAP5oF,EAAe,IAAK,IAAIrM,KAAOqM,EAAW1M,OAAOM,UAAUC,eAAeC,KAAKkM,EAAKrM,KAAMi1F,EAAOj1F,GAAOqM,EAAIrM,IAAgC,OAAtBi1F,EAAOC,QAAU7oF,EAAY4oF,CAAU,CAFhQE,CAFC,EAAQ,QAMrB,SAASN,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAQ9F,IAAIorF,EAAYrmF,EAAQqmF,UAAY,SAAmBG,GACrD,IAAIC,EAAc,SAAUt3F,GAG1B,SAASs3F,EAAYn3F,IAVzB,SAAyB6kC,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAInsB,UAAU,oCAAwC,CAWlJosB,CAAgBplC,KAAMw3F,GAEtB,IAAI9qF,EAXV,SAAoCmsC,EAAM/4C,GAAQ,IAAK+4C,EAAQ,MAAM,IAAIC,eAAe,6DAAgE,OAAOh5C,GAAyB,kBAATA,GAAqC,oBAATA,EAA8B+4C,EAAP/4C,CAAa,CAW7Nk1F,CAA2Bh1F,MAAOw3F,EAAYzxF,WAAazG,OAAO0xB,eAAewmE,IAAc13F,KAAKE,OAyBhH,OAvBA0M,EAAMwoF,aAAe,SAAU1wD,EAAM1jC,GAEnC,GADmBw2F,EAAMG,yBAAyBjzD,GAChC,CAChB,IAAIkzD,EAASJ,EAAMK,QAAQnzD,EAAMA,EAAKpnB,GAAK1Q,EAAME,MAAMgrF,QACvDlrF,EAAMW,SAASqqF,GACfhrF,EAAMrM,MAAMw3F,kBAAoBnrF,EAAM0mF,SAAS1mF,EAAMrM,MAAMw3F,iBAAkBH,EAAQ52F,GACrF4L,EAAMrM,MAAM4K,UAAYyB,EAAMrM,MAAM4K,SAASysF,EAAQ52F,EACvD,CACF,EAEA4L,EAAMorF,kBAAoB,SAAUtzD,EAAM1jC,GAExC,GADmBw2F,EAAMG,yBAAyBjzD,GAChC,CAChB,IAAIkzD,EAASJ,EAAMK,QAAQnzD,EAAMA,EAAKpnB,GAAK1Q,EAAME,MAAMgrF,QACvDlrF,EAAMrM,MAAM03F,eAAiBrrF,EAAMrM,MAAM03F,cAAcL,EAAQ52F,EACjE,CACF,EAEA4L,EAAME,MAAQvN,EAAS,CAAC,EAAGi4F,EAAMK,QAAQt3F,EAAMi3F,MAAO,IAEtD5qF,EAAM0mF,UAAW,EAAIiE,EAAWxC,UAAS,SAAU7sF,EAAIw8B,EAAM1jC,GAC3DkH,EAAGw8B,EAAM1jC,EACX,GAAG,KACI4L,CACT,CAqBA,OAxDJ,SAAmBH,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIwM,UAAU,kEAAoExM,GAAeD,EAAS3M,UAAYN,OAAOmP,OAAOjC,GAAcA,EAAW5M,UAAW,CAAE8O,YAAa,CAAE0C,MAAO7E,EAAUmvB,YAAY,EAAOM,UAAU,EAAMD,cAAc,KAAevvB,IAAYlN,OAAOwG,eAAiBxG,OAAOwG,eAAeyG,EAAUC,GAAcD,EAASxG,UAAYyG,EAAY,CAIzeipF,CAAU+B,EAAat3F,GAiCvBm0F,EAAamD,EAAa,CAAC,CACzB73F,IAAK,SACLyR,MAAO,WACL,IAAI4mF,EAAiB,CAAC,EAKtB,OAJIh4F,KAAKK,MAAM03F,gBACbC,EAAeD,cAAgB/3F,KAAK83F,mBAG/BvD,EAAQM,QAAQ79C,cAAcugD,EAAQl4F,EAAS,CAAC,EAAGW,KAAKK,MAAOL,KAAK4M,MAAO,CAChF3B,SAAUjL,KAAKk1F,cACd8C,GACL,IACE,CAAC,CACHr4F,IAAK,2BACLyR,MAAO,SAAkCixC,EAAWz1C,GAClD,OAAOvN,EAAS,CAAC,EAAGi4F,EAAMK,QAAQt1C,EAAUi1C,MAAO1qF,EAAMgrF,QAC3D,KAGKJ,CACT,CAtDkB,CAsDhBlD,EAAOuC,eAAiBvC,EAAO7oF,WAajC,OAXA+rF,EAAYxnF,UAAY3Q,EAAS,CAAC,EAAGk4F,EAAOvnF,WAE5CwnF,EAAYtnF,aAAe7Q,EAAS,CAAC,EAAGk4F,EAAOrnF,aAAc,CAC3DonF,MAAO,CACLl6E,EAAG,IACHuS,EAAG,GACH6vC,EAAG,GACHllD,EAAG,KAIAk9E,CACT,EAEAzmF,EAAA,QAAkBqmF,C,oCCtGlB93F,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQknF,mBAAgBvvF,EAExB,IAAI2rF,EAAe,WAAc,SAASv4D,EAAiBt8B,EAAQa,GAAS,IAAK,IAAIZ,EAAI,EAAGA,EAAIY,EAAMlB,OAAQM,IAAK,CAAE,IAAI+jC,EAAanjC,EAAMZ,GAAI+jC,EAAW9H,WAAa8H,EAAW9H,aAAc,EAAO8H,EAAWzH,cAAe,EAAU,UAAWyH,IAAYA,EAAWxH,UAAW,GAAM18B,OAAOif,eAAe/e,EAAQgkC,EAAW7jC,IAAK6jC,EAAa,CAAE,CAAE,OAAO,SAAU2B,EAAaK,EAAYC,GAAiJ,OAA9HD,GAAY1J,EAAiBqJ,EAAYvlC,UAAW4lC,GAAiBC,GAAa3J,EAAiBqJ,EAAaM,GAAqBN,CAAa,CAAG,CAA7hB,GAEfmvD,EAAS,EAAQ,OAEjBC,EAAUC,EAAuBF,GAIjCG,EAAaD,EAFD,EAAQ,QAIxB,SAASA,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAU9F,IAIIksF,EAAkB,CAFJ,GACE,IAShBC,EAAY,EAEZF,EAAgBlnF,EAAQknF,cAAgB,SAAU/3F,GAGpD,SAAS+3F,EAAc53F,IAvBzB,SAAyB6kC,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAInsB,UAAU,oCAAwC,CAwBpJosB,CAAgBplC,KAAMi4F,GAEtB,IAAIvrF,EAxBR,SAAoCmsC,EAAM/4C,GAAQ,IAAK+4C,EAAQ,MAAM,IAAIC,eAAe,6DAAgE,OAAOh5C,GAAyB,kBAATA,GAAqC,oBAATA,EAA8B+4C,EAAP/4C,CAAa,CAwB/Nk1F,CAA2Bh1F,MAAOi4F,EAAclyF,WAAazG,OAAO0xB,eAAeinE,IAAgBn4F,KAAKE,OA0DpH,OAxDA0M,EAAM0rF,WAAa,WACb1rF,EAAME,MAAMyrF,WACd3rF,EAAMW,SAAS,CAAE+D,MAAO1E,EAAME,MAAMyrF,UAAWA,UAAW,MAE9D,EAEA3rF,EAAMwoF,aAAe,SAAUr2F,GAC7B6N,EAAM4rF,gBAAgBz5F,EAAEW,OAAO4R,MAAOvS,EACxC,EAEA6N,EAAM6rF,cAAgB,SAAU15F,GAI9B,IA/BuCunE,EA+BnCh1D,EA5BW,SAAwBA,GAC3C,OAAOxG,OAAOm2B,OAAO3vB,GAAO8vB,QAAQ,KAAM,IAC5C,CA0BkBs3D,CAAe35F,EAAEW,OAAO4R,OACpC,IAAK46D,MAAM56D,KAhC4Bg1D,EAgCHvnE,EAAEunE,QA/BnC8xB,EAAgB9xF,QAAQggE,IAAY,GA+BS,CAC9C,IAAIh8D,EAASsC,EAAM+rF,iBACf74E,EArCM,KAqCS/gB,EAAEunE,QAA0Bh1D,EAAQhH,EAASgH,EAAQhH,EAExEsC,EAAM4rF,gBAAgB14E,EAAc/gB,EACtC,CACF,EAEA6N,EAAMgsF,WAAa,SAAU75F,GAC3B,GAAI6N,EAAMrM,MAAMs4F,UAAW,CACzB,IAAI9zE,EAAWpR,KAAKy0E,MAAMx7E,EAAMrM,MAAM+Q,MAAQvS,EAAE+5F,WAC5C/zE,GAAY,GAAKA,GAAYnY,EAAMrM,MAAMw4F,SAC3CnsF,EAAMrM,MAAM4K,UAAYyB,EAAMrM,MAAM4K,SAASyB,EAAMosF,wBAAwBj0E,GAAWhmB,EAE1F,CACF,EAEA6N,EAAM4oF,gBAAkB,SAAUz2F,GAC5B6N,EAAMrM,MAAMs4F,YACd95F,EAAEkC,iBACF2L,EAAMgsF,WAAW75F,GACjBo8C,OAAOhF,iBAAiB,YAAavpC,EAAMgsF,YAC3Cz9C,OAAOhF,iBAAiB,UAAWvpC,EAAM6oF,eAE7C,EAEA7oF,EAAM6oF,cAAgB,WACpB7oF,EAAM8oF,sBACR,EAEA9oF,EAAM8oF,qBAAuB,WAC3Bv6C,OAAO5E,oBAAoB,YAAa3pC,EAAMgsF,YAC9Cz9C,OAAO5E,oBAAoB,UAAW3pC,EAAM6oF,cAC9C,EAEA7oF,EAAME,MAAQ,CACZwE,MAAO2vB,OAAO1gC,EAAM+Q,OAAOy4B,cAC3BwuD,UAAWt3D,OAAO1gC,EAAM+Q,OAAOy4B,eAGjCn9B,EAAMqsF,QAAU,qBAAuBZ,IAChCzrF,CACT,CA0FA,OA3KF,SAAmBH,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIwM,UAAU,kEAAoExM,GAAeD,EAAS3M,UAAYN,OAAOmP,OAAOjC,GAAcA,EAAW5M,UAAW,CAAE8O,YAAa,CAAE0C,MAAO7E,EAAUmvB,YAAY,EAAOM,UAAU,EAAMD,cAAc,KAAevvB,IAAYlN,OAAOwG,eAAiBxG,OAAOwG,eAAeyG,EAAUC,GAAcD,EAASxG,UAAYyG,EAAY,CAiB3eipF,CAAUwC,EAAe/3F,GAkEzBm0F,EAAa4D,EAAe,CAAC,CAC3Bt4F,IAAK,qBACLyR,MAAO,SAA4BnC,EAAW+pF,GACxCh5F,KAAKK,MAAM+Q,QAAUpR,KAAK4M,MAAMwE,OAAUnC,EAAUmC,QAAUpR,KAAKK,MAAM+Q,OAAS4nF,EAAU5nF,QAAUpR,KAAK4M,MAAMwE,QAC/GpR,KAAK05E,QAAUxM,SAASsN,cAC1Bx6E,KAAKqN,SAAS,CAAEgrF,UAAWt3D,OAAO/gC,KAAKK,MAAM+Q,OAAOy4B,gBAEpD7pC,KAAKqN,SAAS,CAAE+D,MAAO2vB,OAAO/gC,KAAKK,MAAM+Q,OAAOy4B,cAAewuD,WAAYr4F,KAAK4M,MAAMyrF,WAAat3D,OAAO/gC,KAAKK,MAAM+Q,OAAOy4B,gBAGlI,GACC,CACDlqC,IAAK,uBACLyR,MAAO,WACLpR,KAAKw1F,sBACP,GACC,CACD71F,IAAK,0BACLyR,MAAO,SAAiCA,GACtC,OA5GN,SAAyBpF,EAAKrM,EAAKyR,GAAiK,OAApJzR,KAAOqM,EAAO1M,OAAOif,eAAevS,EAAKrM,EAAK,CAAEyR,MAAOA,EAAOsqB,YAAY,EAAMK,cAAc,EAAMC,UAAU,IAAkBhwB,EAAIrM,GAAOyR,EAAgBpF,CAAK,CA4GnM4vB,CAAgB,CAAC,EAAG57B,KAAKK,MAAM44F,MAAO7nF,EAC/C,GACC,CACDzR,IAAK,iBACLyR,MAAO,WACL,OAAOpR,KAAKK,MAAM64F,aAzGG,CA0GvB,GACC,CACDv5F,IAAK,kBACLyR,MAAO,SAAyBA,EAAOvS,GACrC,IAAIs6F,EAAgBn5F,KAAKK,MAAM44F,MAAQj5F,KAAK84F,wBAAwB1nF,GAASA,EAC7EpR,KAAKK,MAAM4K,UAAYjL,KAAKK,MAAM4K,SAASkuF,EAAet6F,GAE1DmB,KAAKqN,SAAS,CAAE+D,MAAOA,GACzB,GACC,CACDzR,IAAK,SACLyR,MAAO,WACL,IAAI7B,EAASvP,KAETkJ,GAAS,EAAIurF,EAAWI,SAAS,CACnC,QAAW,CACTuE,KAAM,CACJ3uB,SAAU,aAGd,gBAAiB,CACf2uB,KAAMp5F,KAAKK,MAAM8B,OAASnC,KAAKK,MAAM8B,MAAMi3F,KAAOp5F,KAAKK,MAAM8B,MAAMi3F,KAAO,CAAC,EAC3E1f,MAAO15E,KAAKK,MAAM8B,OAASnC,KAAKK,MAAM8B,MAAMu3E,MAAQ15E,KAAKK,MAAM8B,MAAMu3E,MAAQ,CAAC,EAC9Euf,MAAOj5F,KAAKK,MAAM8B,OAASnC,KAAKK,MAAM8B,MAAM82F,MAAQj5F,KAAKK,MAAM8B,MAAM82F,MAAQ,CAAC,GAEhF,iBAAkB,CAChBA,MAAO,CACL52B,OAAQ,eAGX,CACD,iBAAiB,GAChBriE,KAAKK,OAER,OAAOk0F,EAAQM,QAAQ79C,cACrB,MACA,CAAE70C,MAAO+G,EAAOkwF,MAChB7E,EAAQM,QAAQ79C,cAAc,QAAS,CACrCgW,GAAIhtD,KAAK+4F,QACT52F,MAAO+G,EAAOwwE,MACd5pE,IAAK,SAAa4pE,GAChB,OAAOnqE,EAAOmqE,MAAQA,CACxB,EACAtoE,MAAOpR,KAAK4M,MAAMwE,MAClBuvC,UAAW3gD,KAAKu4F,cAChBttF,SAAUjL,KAAKk1F,aACfl1C,OAAQhgD,KAAKo4F,WACbp6C,YAAah+C,KAAKK,MAAM29C,YACxBiD,WAAY,UAEdjhD,KAAKK,MAAM44F,QAAUj5F,KAAKK,MAAMg5F,UAAY9E,EAAQM,QAAQ79C,cAC1D,QACA,CACEvZ,QAASz9B,KAAK+4F,QACd52F,MAAO+G,EAAO+vF,MACdp4F,YAAab,KAAKs1F,iBAEpBt1F,KAAKK,MAAM44F,OACT,KAER,KAGKhB,CACT,CA5J4C,CA4J1C3D,EAAOuC,eAAiBvC,EAAO7oF,WAEjCsF,EAAA,QAAkBknF,C,qCCrMlB34F,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQuoF,SAAM5wF,EAEd,IAAI2rF,EAAe,WAAc,SAASv4D,EAAiBt8B,EAAQa,GAAS,IAAK,IAAIZ,EAAI,EAAGA,EAAIY,EAAMlB,OAAQM,IAAK,CAAE,IAAI+jC,EAAanjC,EAAMZ,GAAI+jC,EAAW9H,WAAa8H,EAAW9H,aAAc,EAAO8H,EAAWzH,cAAe,EAAU,UAAWyH,IAAYA,EAAWxH,UAAW,GAAM18B,OAAOif,eAAe/e,EAAQgkC,EAAW7jC,IAAK6jC,EAAa,CAAE,CAAE,OAAO,SAAU2B,EAAaK,EAAYC,GAAiJ,OAA9HD,GAAY1J,EAAiBqJ,EAAYvlC,UAAW4lC,GAAiBC,GAAa3J,EAAiBqJ,EAAaM,GAAqBN,CAAa,CAAG,CAA7hB,GAEfmvD,EAAS,EAAQ,OAEjBC,EAAUC,EAAuBF,GAIjCG,EAAaD,EAFD,EAAQ,QAMpB+E,EAEJ,SAAiCvtF,GAAO,GAAIA,GAAOA,EAAI2oF,WAAc,OAAO3oF,EAAc,IAAI4oF,EAAS,CAAC,EAAG,GAAW,MAAP5oF,EAAe,IAAK,IAAIrM,KAAOqM,EAAW1M,OAAOM,UAAUC,eAAeC,KAAKkM,EAAKrM,KAAMi1F,EAAOj1F,GAAOqM,EAAIrM,IAAgC,OAAtBi1F,EAAOC,QAAU7oF,EAAY4oF,CAAU,CAFlQE,CAFC,EAAQ,QAMnB,SAASN,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAI9F,SAASgpF,EAA2Bn8C,EAAM/4C,GAAQ,IAAK+4C,EAAQ,MAAM,IAAIC,eAAe,6DAAgE,OAAOh5C,GAAyB,kBAATA,GAAqC,oBAATA,EAA8B+4C,EAAP/4C,CAAa,CAI/O,IAAIw5F,EAAMvoF,EAAQuoF,IAAM,SAAUp5F,GAGhC,SAASo5F,IACP,IAAIxwD,EAEAmsD,EAAOvoF,GAZf,SAAyBw4B,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAInsB,UAAU,oCAAwC,CAcpJosB,CAAgBplC,KAAMs5F,GAEtB,IAAK,IAAI9vF,EAAOpK,UAAUD,OAAQ0I,EAAO5I,MAAMuK,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC3E5B,EAAK4B,GAAQrK,UAAUqK,GAGzB,OAAewrF,EAASvoF,EAAQsoF,EAA2Bh1F,MAAO8oC,EAAQwwD,EAAIvzF,WAAazG,OAAO0xB,eAAesoE,IAAMx5F,KAAKC,MAAM+oC,EAAO,CAAC9oC,MAAMiI,OAAOJ,KAAiB6E,EAAMwoF,aAAe,SAAUr2F,GACrM,IAAIs2F,EAASoE,EAAInE,gBAAgBv2F,EAAG6N,EAAMrM,MAAMkiD,UAAW71C,EAAMrM,MAAMg1F,IAAK3oF,EAAM6oC,WAClF4/C,GAA0C,oBAAzBzoF,EAAMrM,MAAM4K,UAA2ByB,EAAMrM,MAAM4K,SAASkqF,EAAQt2F,EACvF,EAAG6N,EAAM4oF,gBAAkB,SAAUz2F,GACnC6N,EAAMwoF,aAAar2F,GACnBo8C,OAAOhF,iBAAiB,YAAavpC,EAAMwoF,cAC3Cj6C,OAAOhF,iBAAiB,UAAWvpC,EAAM6oF,cAC3C,EAAG7oF,EAAM6oF,cAAgB,WACvB7oF,EAAM8oF,sBACR,EAAWR,EAA2BtoF,EAAnCuoF,EACL,CAuFA,OAjHF,SAAmB1oF,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIwM,UAAU,kEAAoExM,GAAeD,EAAS3M,UAAYN,OAAOmP,OAAOjC,GAAcA,EAAW5M,UAAW,CAAE8O,YAAa,CAAE0C,MAAO7E,EAAUmvB,YAAY,EAAOM,UAAU,EAAMD,cAAc,KAAevvB,IAAYlN,OAAOwG,eAAiBxG,OAAOwG,eAAeyG,EAAUC,GAAcD,EAASxG,UAAYyG,EAAY,CAG3eipF,CAAU6D,EAAKp5F,GAyBfm0F,EAAaiF,EAAK,CAAC,CACjB35F,IAAK,uBACLyR,MAAO,WACLpR,KAAKw1F,sBACP,GACC,CACD71F,IAAK,uBACLyR,MAAO,WACL6pC,OAAO5E,oBAAoB,YAAar2C,KAAKk1F,cAC7Cj6C,OAAO5E,oBAAoB,UAAWr2C,KAAKu1F,cAC7C,GACC,CACD51F,IAAK,SACLyR,MAAO,WACL,IAAI7B,EAASvP,KAETw5F,EAAmBx5F,KAAKK,MAAMkiD,UAC9BA,OAAiC75C,IAArB8wF,EAAiC,aAAeA,EAG5DtwF,GAAS,EAAIurF,EAAWI,SAAS,CACnC,QAAW,CACT0E,IAAK,CACH5D,SAAU,kBACVC,aAAc51F,KAAKK,MAAMw1F,OACzBI,UAAWj2F,KAAKK,MAAM61F,QAExB3gD,UAAW,CACTkkD,QAAS,QACThvB,SAAU,WACVrpE,OAAQ,OACRw0F,aAAc51F,KAAKK,MAAMw1F,QAE3BO,QAAS,CACP3rB,SAAU,WACV5hD,KAAyB,IAAnB7oB,KAAKK,MAAMg1F,IAAIj4E,EAAU,IAAM,KAEvCi5E,OAAQ,CACNC,UAAW,MACXh1F,MAAO,MACPs0F,aAAc,MACdx0F,OAAQ,MACR60F,UAAW,4BACXD,WAAY,OACZO,UAAW,qBAGf,SAAY,CACVH,QAAS,CACPvtE,KAAM,MACN8gD,KAA0B,IAAnB3pE,KAAKK,MAAMg1F,IAAIj4E,EAAU,IAAO,IAAM,OAGhD,CAAEo5E,SAAwB,aAAdj0C,IAEf,OAAOgyC,EAAQM,QAAQ79C,cACrB,MACA,CAAE70C,MAAO+G,EAAOqwF,KAChBhF,EAAQM,QAAQ79C,cACd,MACA,CACEv2C,UAAW,OAAS8hD,EACpBpgD,MAAO+G,EAAOqsC,UACdzlC,IAAK,SAAaylC,GAChB,OAAOhmC,EAAOgmC,UAAYA,CAC5B,EACA10C,YAAab,KAAKs1F,gBAClBqB,YAAa32F,KAAKk1F,aAClB0B,aAAc52F,KAAKk1F,cAErBX,EAAQM,QAAQ79C,cACd,QACA,KACA,4qBAEFu9C,EAAQM,QAAQ79C,cACd,MACA,CAAE70C,MAAO+G,EAAOktF,SAChBp2F,KAAKK,MAAM+1F,QAAU7B,EAAQM,QAAQ79C,cAAch3C,KAAKK,MAAM+1F,QAASp2F,KAAKK,OAASk0F,EAAQM,QAAQ79C,cAAc,MAAO,CAAE70C,MAAO+G,EAAOmtF,WAIlJ,KAGKiD,CACT,CAhHwB,CAgHtBhF,EAAOuC,eAAiBvC,EAAO7oF,WAEjCsF,EAAA,QAAkBuoF,C,qCC/IlBh6F,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQ2oF,YAAShxF,EAEjB,IAEI6rF,EAAUC,EAFD,EAAQ,QAMjBmF,EAAcnF,EAFD,EAAQ,OAMrBC,EAAaD,EAFD,EAAQ,QAMpBoF,EAAUpF,EAFD,EAAQ,QAIrB,SAASA,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAE9F,IAAI0tF,EAAS3oF,EAAQ2oF,OAAS,SAAgBx5F,GAC5C,IAAI25F,EAAS35F,EAAK25F,OACdhE,EAAS31F,EAAK21F,OACdG,EAAa91F,EAAK81F,WAClB51F,EAAWF,EAAKE,SAChB05F,EAAc55F,EAAKgJ,OACnB6wF,OAA+BrxF,IAAhBoxF,EAA4B,CAAC,EAAIA,EAEhD5wF,GAAS,EAAIurF,EAAWI,UAAS,EAAI+E,EAAQ/E,SAAS,CACxD,QAAW,CACTuE,KAAM,CACJ3uB,SAAU,WACVU,QAAS,gBAEXxnE,QAAS,CACP8mE,SAAU,YAEZuvB,GAAI,CACFrE,SAAU,kBACVM,UAAW,KAAO4D,EAAS,MAAiB,EAATA,EAAa,qBAChDjE,aAAcC,EACdG,WAAYA,IAGhB,WAAY,CACVgE,GAAI,CACF/D,UAAW,SAIf,WAAY,CACV+D,GAAI,CACF/D,UAAW,0DAGf,WAAY,CACV+D,GAAI,CACF/D,UAAW,0DAGf,WAAY,CACV+D,GAAI,CACF/D,UAAW,6DAGf,WAAY,CACV+D,GAAI,CACF/D,UAAW,6DAGf,WAAY,CACV+D,GAAI,CACF/D,UAAW,4DAGf,OAAU,CACR+D,GAAI,CACFpE,aAAc,MAGlB,OAAU,CACRoE,GAAI,CACFpE,aAAc,SAGjBmE,GAAe,CAAE,WAAuB,IAAXF,IAEhC,OAAOtF,EAAQM,QAAQ79C,cACrB,MACA,CAAE70C,MAAO+G,EAAOkwF,MAChB7E,EAAQM,QAAQ79C,cAAc,MAAO,CAAE70C,MAAO+G,EAAO8wF,KACrDzF,EAAQM,QAAQ79C,cACd,MACA,CAAE70C,MAAO+G,EAAOvF,SAChBvD,GAGN,EAEAs5F,EAAO1pF,UAAY,CACjBgmF,WAAY2D,EAAY9E,QAAQn3E,OAChCm8E,OAAQF,EAAY9E,QAAQoF,MAAM,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,IAClDpE,OAAQ8D,EAAY9E,QAAQ/O,OAC5B58E,OAAQywF,EAAY9E,QAAQv8E,QAG9BohF,EAAOxpF,aAAe,CACpB8lF,WAAY,OACZ6D,OAAQ,EACRhE,OAAQ,EACR3sF,OAAQ,CAAC,GAGX6H,EAAA,QAAkB2oF,C,oCCpHlBp6F,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQmpF,gBAAaxxF,EAErB,IAAI2rF,EAAe,WAAc,SAASv4D,EAAiBt8B,EAAQa,GAAS,IAAK,IAAIZ,EAAI,EAAGA,EAAIY,EAAMlB,OAAQM,IAAK,CAAE,IAAI+jC,EAAanjC,EAAMZ,GAAI+jC,EAAW9H,WAAa8H,EAAW9H,aAAc,EAAO8H,EAAWzH,cAAe,EAAU,UAAWyH,IAAYA,EAAWxH,UAAW,GAAM18B,OAAOif,eAAe/e,EAAQgkC,EAAW7jC,IAAK6jC,EAAa,CAAE,CAAE,OAAO,SAAU2B,EAAaK,EAAYC,GAAiJ,OAA9HD,GAAY1J,EAAiBqJ,EAAYvlC,UAAW4lC,GAAiBC,GAAa3J,EAAiBqJ,EAAaM,GAAqBN,CAAa,CAAG,CAA7hB,GAEfmvD,EAAS,EAAQ,OAEjBC,EAAUC,EAAuBF,GAIjCG,EAAaD,EAFD,EAAQ,QAMpB2F,EAAa3F,EAFD,EAAQ,OAMpB4F,EAEJ,SAAiCpuF,GAAO,GAAIA,GAAOA,EAAI2oF,WAAc,OAAO3oF,EAAc,IAAI4oF,EAAS,CAAC,EAAG,GAAW,MAAP5oF,EAAe,IAAK,IAAIrM,KAAOqM,EAAW1M,OAAOM,UAAUC,eAAeC,KAAKkM,EAAKrM,KAAMi1F,EAAOj1F,GAAOqM,EAAIrM,IAAgC,OAAtBi1F,EAAOC,QAAU7oF,EAAY4oF,CAAU,CAF3PE,CAFC,EAAQ,QAM1B,SAASN,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAQ9F,IAAIkuF,EAAanpF,EAAQmpF,WAAa,SAAUh6F,GAG9C,SAASg6F,EAAW75F,IATtB,SAAyB6kC,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAInsB,UAAU,oCAAwC,CAUpJosB,CAAgBplC,KAAMk6F,GAEtB,IAAIxtF,EAVR,SAAoCmsC,EAAM/4C,GAAQ,IAAK+4C,EAAQ,MAAM,IAAIC,eAAe,6DAAgE,OAAOh5C,GAAyB,kBAATA,GAAqC,oBAATA,EAA8B+4C,EAAP/4C,CAAa,CAU/Nk1F,CAA2Bh1F,MAAOk6F,EAAWn0F,WAAazG,OAAO0xB,eAAekpE,IAAap6F,KAAKE,KAAMK,IAoBpH,OAlBAqM,EAAMwoF,aAAe,SAAUr2F,GACG,oBAAzB6N,EAAMrM,MAAM4K,UAA2ByB,EAAM2tF,SAAS3tF,EAAMrM,MAAM4K,SAAUmvF,EAAWhF,gBAAgBv2F,EAAG6N,EAAMrM,MAAMg1F,IAAK3oF,EAAM6oC,WAAY12C,EACtJ,EAEA6N,EAAM4oF,gBAAkB,SAAUz2F,GAChC6N,EAAMwoF,aAAar2F,GACnB,IAAIy7F,EAAe5tF,EAAM6tF,2BACzBD,EAAarkD,iBAAiB,YAAavpC,EAAMwoF,cACjDoF,EAAarkD,iBAAiB,UAAWvpC,EAAM6oF,cACjD,EAEA7oF,EAAM6oF,cAAgB,WACpB7oF,EAAM8oF,sBACR,EAEA9oF,EAAM2tF,UAAW,EAAIF,EAAWtF,UAAS,SAAU7sF,EAAIw8B,EAAM3lC,GAC3DmJ,EAAGw8B,EAAM3lC,EACX,GAAG,IACI6N,CACT,CA4GA,OAzIF,SAAmBH,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIwM,UAAU,kEAAoExM,GAAeD,EAAS3M,UAAYN,OAAOmP,OAAOjC,GAAcA,EAAW5M,UAAW,CAAE8O,YAAa,CAAE0C,MAAO7E,EAAUmvB,YAAY,EAAOM,UAAU,EAAMD,cAAc,KAAevvB,IAAYlN,OAAOwG,eAAiBxG,OAAOwG,eAAeyG,EAAUC,GAAcD,EAASxG,UAAYyG,EAAY,CAG3eipF,CAAUyE,EAAYh6F,GA4BtBm0F,EAAa6F,EAAY,CAAC,CACxBv6F,IAAK,uBACLyR,MAAO,WACLpR,KAAKq6F,SAASpI,SACdjyF,KAAKw1F,sBACP,GACC,CACD71F,IAAK,2BACLyR,MAAO,WAIL,IAHA,IAAImkC,EAAYv1C,KAAKu1C,UAEjB+kD,EAAer/C,QACXq/C,EAAaptB,SAAS71C,SAASke,IAAc+kD,EAAa3pD,SAAW2pD,GAC3EA,EAAeA,EAAa3pD,OAE9B,OAAO2pD,CACT,GACC,CACD36F,IAAK,uBACLyR,MAAO,WACL,IAAIkpF,EAAet6F,KAAKu6F,2BACxBD,EAAajkD,oBAAoB,YAAar2C,KAAKk1F,cACnDoF,EAAajkD,oBAAoB,UAAWr2C,KAAKu1F,cACnD,GACC,CACD51F,IAAK,SACLyR,MAAO,WACL,IAAI7B,EAASvP,KAET8oC,EAAQ9oC,KAAKK,MAAM8B,OAAS,CAAC,EAC7Bm1F,EAAQxuD,EAAMwuD,MACdP,EAAQjuD,EAAMiuD,MACdyD,EAAQ1xD,EAAM0xD,MACdpE,EAAUttD,EAAMstD,QAChBqE,EAAS3xD,EAAM2xD,OAEfvxF,GAAS,EAAIurF,EAAWI,SAAS,CACnC,QAAW,CACTyC,MAAO,CACL3B,SAAU,kBACVK,WAAY,OAASh2F,KAAKK,MAAMg1F,IAAIj4E,EAAI,cACxCw4E,aAAc51F,KAAKK,MAAMw1F,QAE3BkB,MAAO,CACLpB,SAAU,kBACVC,aAAc51F,KAAKK,MAAMw1F,QAE3B2E,MAAO,CACL7E,SAAU,kBACVM,UAAWj2F,KAAKK,MAAM61F,OACtBN,aAAc51F,KAAKK,MAAMw1F,QAE3BO,QAAS,CACP3rB,SAAU,WACVd,KAA0B,IAAnB3pE,KAAKK,MAAMq6F,IAAInlF,EAAW,IAAM,IACvCsT,KAAyB,IAAnB7oB,KAAKK,MAAMq6F,IAAI/qE,EAAU,IAC/B0yC,OAAQ,WAEVo4B,OAAQ,CACNn5F,MAAO,MACPF,OAAQ,MACR60F,UAAW,8FACXL,aAAc,MACdvzB,OAAQ,OACRk0B,UAAW,0BAGf,OAAU,CACRe,MAAOA,EACPP,MAAOA,EACPyD,MAAOA,EACPpE,QAASA,EACTqE,OAAQA,IAET,CAAE,SAAYz6F,KAAKK,MAAM8B,QAE5B,OAAOoyF,EAAQM,QAAQ79C,cACrB,MACA,CACE70C,MAAO+G,EAAOouF,MACdxnF,IAAK,SAAaylC,GAChB,OAAOhmC,EAAOgmC,UAAYA,CAC5B,EACA10C,YAAab,KAAKs1F,gBAClBqB,YAAa32F,KAAKk1F,aAClB0B,aAAc52F,KAAKk1F,cAErBX,EAAQM,QAAQ79C,cACd,QACA,KACA,kaAEFu9C,EAAQM,QAAQ79C,cACd,MACA,CAAE70C,MAAO+G,EAAO6tF,MAAOt2F,UAAW,oBAClC8zF,EAAQM,QAAQ79C,cAAc,MAAO,CAAE70C,MAAO+G,EAAOsxF,MAAO/5F,UAAW,qBACvE8zF,EAAQM,QAAQ79C,cACd,MACA,CAAE70C,MAAO+G,EAAOktF,SAChBp2F,KAAKK,MAAM+1F,QAAU7B,EAAQM,QAAQ79C,cAAch3C,KAAKK,MAAM+1F,QAASp2F,KAAKK,OAASk0F,EAAQM,QAAQ79C,cAAc,MAAO,CAAE70C,MAAO+G,EAAOuxF,WAIlJ,KAGKP,CACT,CAxIsC,CAwIpC5F,EAAOuC,eAAiBvC,EAAO7oF,WAEjCsF,EAAA,QAAkBmpF,C,qCC3KlB56F,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQ4pF,YAASjyF,EAEjB,IAAIrJ,EAAWC,OAAOC,QAAU,SAAUC,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAI3P+0F,EAAUC,EAFD,EAAQ,QAMjBC,EAAaD,EAFD,EAAQ,QAIpBoG,EAAe,EAAQ,OAIvB7F,EAAeP,EAFD,EAAQ,QAI1B,SAASA,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAE9F,IAEI2uF,EAAS5pF,EAAQ4pF,OAAS,SAAgBz6F,GAC5C,IAAIo3F,EAAQp3F,EAAKo3F,MACbn1F,EAAQjC,EAAKiC,MACb04F,EAAe36F,EAAKc,QACpBA,OAA2B0H,IAAjBmyF,EAA6B,WAAa,EAAIA,EACxDC,EAAU56F,EAAK46F,QACfC,EAAa76F,EAAK+jC,MAClBA,OAAuBv7B,IAAfqyF,EAA2BzD,EAAQyD,EAC3C36F,EAAWF,EAAKE,SAChBuO,EAAQzO,EAAKyO,MACbqsF,EAAkB96F,EAAK+6F,WACvBA,OAAiCvyF,IAApBsyF,EAAgC,CAAC,EAAIA,EAElDE,EAAwB,gBAAV5D,EACdpuF,GAAS,EAAIurF,EAAWI,SAAS,CACnCA,QAAS,CACPsG,OAAQ97F,EAAS,CACf22F,WAAYsB,EACZl2F,OAAQ,OACRE,MAAO,OACP+gE,OAAQ,UACRoI,SAAU,WACVvpB,QAAS,QACR/+C,EAAOwM,EAAQssF,EAAa,CAAC,MAchCjD,EAAiB,CAAC,EAKtB,OAJI8C,IACF9C,EAAeoD,YANC,SAAqBv8F,GACrC,OAAOi8F,EAAQxD,EAAOz4F,EACxB,GAOO01F,EAAQM,QAAQ79C,cACrB,MACA33C,EAAS,CACP8C,MAAO+G,EAAOiyF,OACdn6F,QAnBc,SAAqBnC,GACrC,OAAOmC,EAAQs2F,EAAOz4F,EACxB,EAkBIolC,MAAOA,EACPsd,SAAU,EACVZ,UAnBgB,SAAuB9hD,GACzC,OAjCQ,KAiCDA,EAAEunE,SAAqBplE,EAAQs2F,EAAOz4F,EAC/C,GAkBKm5F,GACH53F,EACA86F,GAAe3G,EAAQM,QAAQ79C,cAAc+9C,EAAaF,QAAS,CACjEe,aAAc1sF,EAAOiyF,OAAOvF,aAC5BK,UAAW,oCAGjB,EAEAllF,EAAA,SAAkB,EAAI6pF,EAAaS,aAAaV,E,oCCpFhDr7F,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAGT,IAAIkqF,EAAS,EAAQ,OAErBh8F,OAAOif,eAAexN,EAAS,QAA/B,CACE2qB,YAAY,EACZ7wB,IAAK,WACH,OAAO2pF,EAAuB8G,GAAQzG,OACxC,IAGF,IAAI0G,EAAc,EAAQ,OAE1Bj8F,OAAOif,eAAexN,EAAS,aAA/B,CACE2qB,YAAY,EACZ7wB,IAAK,WACH,OAAO2pF,EAAuB+G,GAAa1G,OAC7C,IAGF,IAAI2G,EAAiB,EAAQ,MAE7Bl8F,OAAOif,eAAexN,EAAS,gBAA/B,CACE2qB,YAAY,EACZ7wB,IAAK,WACH,OAAO2pF,EAAuBgH,GAAgB3G,OAChD,IAGF,IAAI4G,EAAO,EAAQ,OAEnBn8F,OAAOif,eAAexN,EAAS,MAA/B,CACE2qB,YAAY,EACZ7wB,IAAK,WACH,OAAO2pF,EAAuBiH,GAAM5G,OACtC,IAGF,IAAI6G,EAAU,EAAQ,OAEtBp8F,OAAOif,eAAexN,EAAS,SAA/B,CACE2qB,YAAY,EACZ7wB,IAAK,WACH,OAAO2pF,EAAuBkH,GAAS7G,OACzC,IAGF,IAAI8G,EAAc,EAAQ,MAE1Br8F,OAAOif,eAAexN,EAAS,aAA/B,CACE2qB,YAAY,EACZ7wB,IAAK,WACH,OAAO2pF,EAAuBmH,GAAa9G,OAC7C,IAGF,IAAI+G,EAAa,EAAQ,OAEzBt8F,OAAOif,eAAexN,EAAS,YAA/B,CACE2qB,YAAY,EACZ7wB,IAAK,WACH,OAAO2pF,EAAuBoH,GAAY/G,OAC5C,IAGF,IAAIgH,EAAU,EAAQ,OAStB,SAASrH,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAP9F1M,OAAOif,eAAexN,EAAS,SAA/B,CACE2qB,YAAY,EACZ7wB,IAAK,WACH,OAAO2pF,EAAuBqH,GAAShH,OACzC,G,qCCzEFv1F,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQ+qF,kBAAepzF,EAEvB,IAEI6rF,EAAUC,EAFD,EAAQ,QAMjBC,EAAaD,EAFD,EAAQ,QAMpB8C,EAIJ,SAAiCtrF,GAAO,GAAIA,GAAOA,EAAI2oF,WAAc,OAAO3oF,EAAc,IAAI4oF,EAAS,CAAC,EAAG,GAAW,MAAP5oF,EAAe,IAAK,IAAIrM,KAAOqM,EAAW1M,OAAOM,UAAUC,eAAeC,KAAKkM,EAAKrM,KAAMi1F,EAAOj1F,GAAOqM,EAAIrM,IAAgC,OAAtBi1F,EAAOC,QAAU7oF,EAAY4oF,CAAU,CAJhQE,CAFC,EAAQ,QAIjBiH,EAAU,EAAQ,MAItB,SAASvH,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAI9F,IAAI8vF,EAAe/qF,EAAQ+qF,aAAe,SAAsB57F,GAC9D,IAAI+K,EAAW/K,EAAK+K,SAChByqF,EAAMx1F,EAAKw1F,IACXL,EAAMn1F,EAAKm1F,IACX2G,EAAM97F,EAAK87F,IACXC,EAAe/7F,EAAK+7F,aAEpB/yF,GAAS,EAAIurF,EAAWI,SAAS,CACnC,QAAW,CACTqH,OAAQ,CACN/wB,QAAS,OACTgxB,WAAY,OAEdC,OAAQ,CACNz9D,KAAM,IACN09D,YAAa,OAEf3H,MAAO,CACL/1D,KAAM,IACN09D,YAAa,OAEfC,OAAQ,CACN39D,KAAM,KAER+6C,MAAO,CACLp4E,MAAO,MACPm4F,QAAS,cACT8C,OAAQ,OACRtG,UAAW,uBACXzrB,SAAU,QAEZyuB,MAAO,CACL9tB,QAAS,QACTqxB,UAAW,SACXhyB,SAAU,OACV8sB,MAAO,OACP6E,WAAY,MACZM,cAAe,MACfC,cAAe,eAGnB,aAAgB,CACdhI,MAAO,CACLvpB,QAAS,UAGZ,CAAE8wB,aAAcA,IAEf/G,EAAe,SAAsB1wD,EAAM3lC,GACzC2lC,EAAKw3D,IACP1E,EAAMqF,WAAWn4D,EAAKw3D,MAAQ/wF,EAAS,CACrC+wF,IAAKx3D,EAAKw3D,IACVt8F,OAAQ,OACPb,GACM2lC,EAAK5lC,GAAK4lC,EAAKmd,GAAKnd,EAAKjqB,EAClCtP,EAAS,CACPrM,EAAG4lC,EAAK5lC,GAAK82F,EAAI92F,EACjB+iD,EAAGnd,EAAKmd,GAAK+zC,EAAI/zC,EACjBpnC,EAAGiqB,EAAKjqB,GAAKm7E,EAAIn7E,EACjBD,EAAGo7E,EAAIp7E,EACP5a,OAAQ,OACPb,GACM2lC,EAAKlqB,IACVkqB,EAAKlqB,EAAI,EACXkqB,EAAKlqB,EAAI,EACAkqB,EAAKlqB,EAAI,MAClBkqB,EAAKlqB,EAAI,KAGXkqB,EAAKlqB,GAAK,IACVrP,EAAS,CACPmS,EAAGi4E,EAAIj4E,EACPuS,EAAG0lE,EAAI1lE,EACP6vC,EAAG61B,EAAI71B,EACPllD,EAAGkqB,EAAKlqB,EACR5a,OAAQ,OACPb,GAEP,EAEA,OAAO01F,EAAQM,QAAQ79C,cACrB,MACA,CAAE70C,MAAO+G,EAAOgzF,OAAQz7F,UAAW,eACnC8zF,EAAQM,QAAQ79C,cACd,MACA,CAAE70C,MAAO+G,EAAOozF,QAChB/H,EAAQM,QAAQ79C,cAAc+kD,EAAQ9D,cAAe,CACnD91F,MAAO,CAAEu3E,MAAOxwE,EAAOwwE,MAAOuf,MAAO/vF,EAAO+vF,OAC5CA,MAAO,MACP7nF,MAAO4qF,EAAI96D,QAAQ,IAAK,IACxBj2B,SAAUiqF,KAGdX,EAAQM,QAAQ79C,cACd,MACA,CAAE70C,MAAO+G,EAAOkzF,QAChB7H,EAAQM,QAAQ79C,cAAc+kD,EAAQ9D,cAAe,CACnD91F,MAAO,CAAEu3E,MAAOxwE,EAAOwwE,MAAOuf,MAAO/vF,EAAO+vF,OAC5CA,MAAO,IACP7nF,MAAOskF,EAAI92F,EACXqM,SAAUiqF,EACVyD,UAAW,OACXE,QAAS,SAGbtE,EAAQM,QAAQ79C,cACd,MACA,CAAE70C,MAAO+G,EAAOkzF,QAChB7H,EAAQM,QAAQ79C,cAAc+kD,EAAQ9D,cAAe,CACnD91F,MAAO,CAAEu3E,MAAOxwE,EAAOwwE,MAAOuf,MAAO/vF,EAAO+vF,OAC5CA,MAAO,IACP7nF,MAAOskF,EAAI/zC,EACX12C,SAAUiqF,EACVyD,UAAW,OACXE,QAAS,SAGbtE,EAAQM,QAAQ79C,cACd,MACA,CAAE70C,MAAO+G,EAAOkzF,QAChB7H,EAAQM,QAAQ79C,cAAc+kD,EAAQ9D,cAAe,CACnD91F,MAAO,CAAEu3E,MAAOxwE,EAAOwwE,MAAOuf,MAAO/vF,EAAO+vF,OAC5CA,MAAO,IACP7nF,MAAOskF,EAAIn7E,EACXtP,SAAUiqF,EACVyD,UAAW,OACXE,QAAS,SAGbtE,EAAQM,QAAQ79C,cACd,MACA,CAAE70C,MAAO+G,EAAOwrF,OAChBH,EAAQM,QAAQ79C,cAAc+kD,EAAQ9D,cAAe,CACnD91F,MAAO,CAAEu3E,MAAOxwE,EAAOwwE,MAAOuf,MAAO/vF,EAAO+vF,OAC5CA,MAAO,IACP7nF,MAAOqC,KAAKy0E,MAAc,IAARwN,EAAIp7E,GACtBrP,SAAUiqF,EACVyD,UAAW,OACXE,QAAS,SAIjB,EAEA9nF,EAAA,QAAkB+qF,C,qCCzKlBx8F,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQ6rF,wBAAqBl0F,EAE7B,IAAIrJ,EAAWC,OAAOC,QAAU,SAAUC,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAI3P+0F,EAAUC,EAFD,EAAQ,QAMjBmF,EAAcnF,EAFD,EAAQ,OAMrBC,EAAaD,EAFD,EAAQ,QAIpBuH,EAAU,EAAQ,MAEtB,SAASvH,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAE9F,IAAI4wF,EAAqB7rF,EAAQ6rF,mBAAqB,SAA4B18F,GAChF,IAAIw3F,EAASx3F,EAAKw3F,OACdmD,EAAe36F,EAAKc,QACpBA,OAA2B0H,IAAjBmyF,EAA6B,WAAa,EAAIA,EACxD9C,EAAgB73F,EAAK63F,cAErB7uF,GAAS,EAAIurF,EAAWI,SAAS,CACnC,QAAW,CACT6C,OAAQ,CACNvB,OAAQ,UACRsD,QAAS,gBACToD,UAAW,iBACX1xB,QAAS,OACT2xB,SAAU,OACVryB,SAAU,YAEZsyB,WAAY,CACVz7F,MAAO,OACPF,OAAQ,OACR+0F,OAAQ,iBAEVgF,OAAQ,CACNvF,aAAc,MACdK,UAAW,oCAGf,aAAc,CACZyB,OAAQ,CACNvsB,QAAS,UAGZ,CACD,cAAeusB,IAAWA,EAAOv4F,SAG/B69F,EAAc,SAAqBhB,EAAKn9F,GAC1CmC,EAAQ,CACNg7F,IAAKA,EACLt8F,OAAQ,OACPb,EACL,EAEA,OAAO01F,EAAQM,QAAQ79C,cACrB,MACA,CAAE70C,MAAO+G,EAAOwuF,OAAQj3F,UAAW,eACnCi3F,EAAOlsF,KAAI,SAAUyxF,GACnB,IAAIjgF,EAAgC,kBAArBigF,EAAgC,CAAE3F,MAAO2F,GAAqBA,EACzEt9F,EAAM,GAAKqd,EAAEs6E,OAASt6E,EAAEinB,OAAS,IACrC,OAAOswD,EAAQM,QAAQ79C,cACrB,MACA,CAAEr3C,IAAKA,EAAKwC,MAAO+G,EAAO6zF,YAC1BxI,EAAQM,QAAQ79C,cAAc+kD,EAAQpB,OAAQt7F,EAAS,CAAC,EAAG2d,EAAG,CAC5D7a,MAAO+G,EAAOiyF,OACdn6F,QAASg8F,EACTlC,QAAS/C,EACTkD,WAAY,CACVhF,UAAW,4CAA8Cj5E,EAAEs6E,UAInE,IAEJ,EAEAsF,EAAmB5sF,UAAY,CAC7B0nF,OAAQiC,EAAY9E,QAAQqI,QAAQvD,EAAY9E,QAAQsI,UAAU,CAACxD,EAAY9E,QAAQn3E,OAAQi8E,EAAY9E,QAAQuI,MAAM,CACvH9F,MAAOqC,EAAY9E,QAAQn3E,OAC3BumB,MAAO01D,EAAY9E,QAAQn3E,YACvBzN,YAGRc,EAAA,QAAkB6rF,C,mCC9FlBt9F,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAEaL,EAAQqkF,gBAAkB,SAAyBv2F,EAAGw2F,EAAK9yC,EAAW86C,EAAU9nD,GACpG,IAAI+nD,EAAiB/nD,EAAUszC,YAC3B0U,EAAkBhoD,EAAUyzC,aAC5BxkE,EAAuB,kBAAZ3lB,EAAE2+F,MAAqB3+F,EAAE2+F,MAAQ3+F,EAAE4+F,QAAQ,GAAGD,MACzDxiD,EAAuB,kBAAZn8C,EAAE6+F,MAAqB7+F,EAAE6+F,MAAQ7+F,EAAE4+F,QAAQ,GAAGC,MACzD70E,EAAOrE,GAAK+wB,EAAUq1B,wBAAwB/hD,KAAOoyB,OAAOuuC,aAC5D7f,EAAM3uB,GAAKzF,EAAUq1B,wBAAwBjB,IAAM1uB,OAAOwuC,aAE9D,GAAkB,aAAdlnC,EAA0B,CAC5B,IAAIjoC,OAAI,EASR,GAPEA,EADEqvD,EAAM,EACJ,EACKA,EAAM4zB,EACX,EAEA9pF,KAAKy0E,MAAY,IAANve,EAAY4zB,GAAmB,IAG5ClI,EAAI/6E,IAAMA,EACZ,MAAO,CACL8C,EAAGi4E,EAAIj4E,EACPuS,EAAG0lE,EAAI1lE,EACP6vC,EAAG61B,EAAI71B,EACPllD,EAAGA,EACH5a,OAAQ,MAGd,KAAO,CACL,IAAIi+F,OAAK,EAST,GAAIN,KAPFM,EADE90E,EAAO,EACJ,EACIA,EAAOy0E,EACX,EAEA7pF,KAAKy0E,MAAa,IAAPr/D,EAAay0E,GAAkB,KAI/C,MAAO,CACLlgF,EAAGi4E,EAAIj4E,EACPuS,EAAG0lE,EAAI1lE,EACP6vC,EAAG61B,EAAI71B,EACPllD,EAAGqjF,EACHj+F,OAAQ,MAGd,CACA,OAAO,IACT,C,mCCnDAJ,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAET,IAAIwsF,EAAkB,CAAC,EAEnBnuF,EAASsB,EAAQtB,OAAS,SAAgBouF,EAAIC,EAAI3xF,EAAM4xF,GAC1D,GAAwB,qBAAb7wB,WAA6B6wB,EACtC,OAAO,KAET,IAAI7G,EAAS6G,EAAe,IAAIA,EAAiB7wB,SAASl2B,cAAc,UACxEkgD,EAAO51F,MAAe,EAAP6K,EACf+qF,EAAO91F,OAAgB,EAAP+K,EAChB,IAAI6xF,EAAM9G,EAAO+G,WAAW,MAC5B,OAAKD,GAGLA,EAAIE,UAAYL,EAChBG,EAAIG,SAAS,EAAG,EAAGjH,EAAO51F,MAAO41F,EAAO91F,QACxC48F,EAAIE,UAAYJ,EAChBE,EAAIG,SAAS,EAAG,EAAGhyF,EAAMA,GACzB6xF,EAAII,UAAUjyF,EAAMA,GACpB6xF,EAAIG,SAAS,EAAG,EAAGhyF,EAAMA,GAClB+qF,EAAOmH,aARL,IASX,EAEUttF,EAAQlG,IAAM,SAAagzF,EAAIC,EAAI3xF,EAAM4xF,GACjD,IAAIp+F,EAAMk+F,EAAK,IAAMC,EAAK,IAAM3xF,GAAQ4xF,EAAe,UAAY,IAEnE,GAAIH,EAAgBj+F,GAClB,OAAOi+F,EAAgBj+F,GAGzB,IAAIm2F,EAAarmF,EAAOouF,EAAIC,EAAI3xF,EAAM4xF,GAEtC,OADAH,EAAgBj+F,GAAOm2F,EAChBA,CACT,C,qCCnCAx2F,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQutF,mBAAqBvtF,EAAQwtF,IAAMxtF,EAAQytF,oBAAsBztF,EAAQ4rF,WAAa5rF,EAAQ4mF,QAAU5mF,EAAQ0mF,8BAA2B/uF,EAEnJ,IAEI+1F,EAASjK,EAFD,EAAQ,QAMhBkK,EAAclK,EAFD,EAAQ,QAIzB,SAASA,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAE/D+E,EAAQ0mF,yBAA2B,SAAkCjzD,GAClG,IACIm6D,EAAU,EACVC,EAAS,EAeb,OAdA,EAAIH,EAAO5J,SAHO,CAAC,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,MAGrB,SAAUgK,GACzC,GAAIr6D,EAAKq6D,KACPF,GAAW,EACN3yB,MAAMxnC,EAAKq6D,MACdD,GAAU,GAEG,MAAXC,GAA6B,MAAXA,GAAgB,CAClB,SACF/9D,KAAK0D,EAAKq6D,MACxBD,GAAU,EAEd,CAEJ,IACOD,IAAYC,GAASp6D,CAC9B,EAnBA,IAqBImzD,EAAU5mF,EAAQ4mF,QAAU,SAAiBnzD,EAAMozD,GACrD,IAAIN,EAAQ9yD,EAAKw3D,KAAM,EAAI0C,EAAY7J,SAASrwD,EAAKw3D,MAAO,EAAI0C,EAAY7J,SAASrwD,GACjF6wD,EAAMiC,EAAMwH,QACZpE,EAAMpD,EAAMyH,QACZrJ,EAAM4B,EAAM0H,QACZhD,EAAM1E,EAAM2H,QAOhB,OANc,IAAV5J,EAAI1lE,IACN0lE,EAAIj4E,EAAIw6E,GAAU,EAClB8C,EAAIt9E,EAAIw6E,GAAU,GAIb,CACLvC,IAAKA,EACL2G,IAJwB,WAARA,GAA8B,IAAVtG,EAAIp7E,EAIrB,cAAgB,IAAM0hF,EACzCtG,IAAKA,EACLgF,IAAKA,EACL9C,OAAQpzD,EAAKpnB,GAAKw6E,GAAUvC,EAAIj4E,EAChC1d,OAAQ8kC,EAAK9kC,OAEjB,EAEiBqR,EAAQ4rF,WAAa,SAAoBX,GACxD,GAAY,gBAARA,EACF,OAAO,EAGT,IAAIkD,EAA+B,MAA1Bn+D,OAAOi7D,GAAKmD,OAAO,GAAa,EAAI,EAC7C,OAAOnD,EAAI78F,SAAW,EAAI+/F,GAAMlD,EAAI78F,OAAS,EAAI+/F,IAAM,EAAIR,EAAY7J,SAASmH,GAAKoD,SACvF,EAE0BruF,EAAQytF,oBAAsB,SAA6Bh6D,GACnF,IAAKA,EACH,MAAO,OAET,IAAI66D,EAAM1H,EAAQnzD,GAClB,MAAgB,gBAAZ66D,EAAIrD,IACC,mBAEc,IAAZqD,EAAI3J,IAAI92F,EAAsB,IAAZygG,EAAI3J,IAAI/zC,EAAsB,IAAZ09C,EAAI3J,IAAIn7E,GAAW,KACpD,IAAM,OAAS,MAC/B,EAEUxJ,EAAQwtF,IAAM,CACtBlJ,IAAK,CAAE/6E,EAAG,EAAG8C,EAAG,EAAGoiD,EAAG,GAAK7vC,EAAG,GAC9BqsE,IAAK,UACLtG,IAAK,CAAE92F,EAAG,IAAK+iD,EAAG,EAAGpnC,EAAG,EAAGD,EAAG,GAC9BogF,IAAK,CAAEt9E,EAAG,EAAGuS,EAAG,EAAGpa,EAAG,EAAG+E,EAAG,IAGLvJ,EAAQutF,mBAAqB,SAA4B5gF,EAAQxc,GACxF,IAAIo+F,EAAsB5hF,EAAOwjB,QAAQ,OAAK,IAC9C,OAAO,EAAIw9D,EAAY7J,SAAS3zF,EAAO,KAAOo+F,EAAsB,KAAKC,GAC3E,C,mCCzFAjgG,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAEaL,EAAQqkF,gBAAkB,SAAyBv2F,EAAG0jD,EAAW8yC,EAAK9/C,GAC1F,IAAI+nD,EAAiB/nD,EAAUszC,YAC3B0U,EAAkBhoD,EAAUyzC,aAC5BxkE,EAAuB,kBAAZ3lB,EAAE2+F,MAAqB3+F,EAAE2+F,MAAQ3+F,EAAE4+F,QAAQ,GAAGD,MACzDxiD,EAAuB,kBAAZn8C,EAAE6+F,MAAqB7+F,EAAE6+F,MAAQ7+F,EAAE4+F,QAAQ,GAAGC,MACzD70E,EAAOrE,GAAK+wB,EAAUq1B,wBAAwB/hD,KAAOoyB,OAAOuuC,aAC5D7f,EAAM3uB,GAAKzF,EAAUq1B,wBAAwBjB,IAAM1uB,OAAOwuC,aAE9D,GAAkB,aAAdlnC,EAA0B,CAC5B,IAAInlC,OAAI,EACR,GAAIusD,EAAM,EACRvsD,EAAI,SACC,GAAIusD,EAAM4zB,EACfngF,EAAI,MACC,CAELA,EAAI,MADkB,IAANusD,EAAY4zB,EAAmB,KAC3B,GACtB,CAEA,GAAIlI,EAAIj4E,IAAMA,EACZ,MAAO,CACLA,EAAGA,EACHuS,EAAG0lE,EAAI1lE,EACP6vC,EAAG61B,EAAI71B,EACPllD,EAAG+6E,EAAI/6E,EACP5a,OAAQ,MAGd,KAAO,CACL,IAAI8/F,OAAK,EACT,GAAI32E,EAAO,EACT22E,EAAK,OACA,GAAI32E,EAAOy0E,EAChBkC,EAAK,QACA,CAELA,EAAK,KADiB,IAAP32E,EAAay0E,GACN,GACxB,CAEA,GAAIjI,EAAIj4E,IAAMoiF,EACZ,MAAO,CACLpiF,EAAGoiF,EACH7vE,EAAG0lE,EAAI1lE,EACP6vC,EAAG61B,EAAI71B,EACPllD,EAAG+6E,EAAI/6E,EACP5a,OAAQ,MAGd,CACA,OAAO,IACT,C,qCCrDAJ,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQsqF,iBAAc3yF,EAEtB,IAQgCsD,EAR5B3M,EAAWC,OAAOC,QAAU,SAAUC,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAE3P60F,EAAe,WAAc,SAASv4D,EAAiBt8B,EAAQa,GAAS,IAAK,IAAIZ,EAAI,EAAGA,EAAIY,EAAMlB,OAAQM,IAAK,CAAE,IAAI+jC,EAAanjC,EAAMZ,GAAI+jC,EAAW9H,WAAa8H,EAAW9H,aAAc,EAAO8H,EAAWzH,cAAe,EAAU,UAAWyH,IAAYA,EAAWxH,UAAW,GAAM18B,OAAOif,eAAe/e,EAAQgkC,EAAW7jC,IAAK6jC,EAAa,CAAE,CAAE,OAAO,SAAU2B,EAAaK,EAAYC,GAAiJ,OAA9HD,GAAY1J,EAAiBqJ,EAAYvlC,UAAW4lC,GAAiBC,GAAa3J,EAAiBqJ,EAAaM,GAAqBN,CAAa,CAAG,CAA7hB,GAEfmvD,EAAS,EAAQ,OAEjBC,GAE4BvoF,EAFKsoF,IAEgBtoF,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,GAIvF,SAASgpF,EAA2Bn8C,EAAM/4C,GAAQ,IAAK+4C,EAAQ,MAAM,IAAIC,eAAe,6DAAgE,OAAOh5C,GAAyB,kBAATA,GAAqC,oBAATA,EAA8B+4C,EAAP/4C,CAAa,CAK7NiR,EAAQsqF,YAAc,SAAqB5vF,GAC3D,IAAIg0F,EAAOrgG,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAK,OAC/E,OAAO,SAAUg6B,GAGf,SAASsmE,IACP,IAAIx/F,EAEA+0F,EAAOvoF,GAfjB,SAAyBw4B,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAInsB,UAAU,oCAAwC,CAiBlJosB,CAAgBplC,KAAM0/F,GAEtB,IAAK,IAAIl2F,EAAOpK,UAAUD,OAAQ0I,EAAO5I,MAAMuK,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC3E5B,EAAK4B,GAAQrK,UAAUqK,GAGzB,OAAewrF,EAASvoF,EAAQsoF,EAA2Bh1F,MAAOE,EAAOw/F,EAAM35F,WAAazG,OAAO0xB,eAAe0uE,IAAQ5/F,KAAKC,MAAMG,EAAM,CAACF,MAAMiI,OAAOJ,KAAiB6E,EAAME,MAAQ,CAAE+B,OAAO,GAASjC,EAAM2uF,YAAc,WAC5N,OAAO3uF,EAAMW,SAAS,CAAEsB,OAAO,GACjC,EAAGjC,EAAM0rF,WAAa,WACpB,OAAO1rF,EAAMW,SAAS,CAAEsB,OAAO,GACjC,EAAWqmF,EAA2BtoF,EAAnCuoF,EACL,CAaA,OArCJ,SAAmB1oF,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIwM,UAAU,kEAAoExM,GAAeD,EAAS3M,UAAYN,OAAOmP,OAAOjC,GAAcA,EAAW5M,UAAW,CAAE8O,YAAa,CAAE0C,MAAO7E,EAAUmvB,YAAY,EAAOM,UAAU,EAAMD,cAAc,KAAevvB,IAAYlN,OAAOwG,eAAiBxG,OAAOwG,eAAeyG,EAAUC,GAAcD,EAASxG,UAAYyG,EAAY,CAMzeipF,CAAUiK,EAAOtmE,GAoBjBi7D,EAAaqL,EAAO,CAAC,CACnB//F,IAAK,SACLyR,MAAO,WACL,OAAOmjF,EAAQM,QAAQ79C,cACrByoD,EACA,CAAEh/C,QAASzgD,KAAKq7F,YAAar7C,OAAQhgD,KAAKo4F,YAC1C7D,EAAQM,QAAQ79C,cAAcvrC,EAAWpM,EAAS,CAAC,EAAGW,KAAKK,MAAOL,KAAK4M,QAE3E,KAGK8yF,CACT,CAjCO,CAiCLnL,EAAQM,QAAQppF,UACpB,C,mCC1DAnM,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAEaL,EAAQqkF,gBAAkB,SAAyBv2F,EAAGw2F,EAAK9/C,GAC/E,IAAIoqD,EAAwBpqD,EAAUq1B,wBAClC0yB,EAAiBqC,EAAsBr+F,MACvCi8F,EAAkBoC,EAAsBv+F,OAExCojB,EAAuB,kBAAZ3lB,EAAE2+F,MAAqB3+F,EAAE2+F,MAAQ3+F,EAAE4+F,QAAQ,GAAGD,MACzDxiD,EAAuB,kBAAZn8C,EAAE6+F,MAAqB7+F,EAAE6+F,MAAQ7+F,EAAE4+F,QAAQ,GAAGC,MACzD70E,EAAOrE,GAAK+wB,EAAUq1B,wBAAwB/hD,KAAOoyB,OAAOuuC,aAC5D7f,EAAM3uB,GAAKzF,EAAUq1B,wBAAwBjB,IAAM1uB,OAAOwuC,aAE1D5gE,EAAO,EACTA,EAAO,EACEA,EAAOy0E,IAChBz0E,EAAOy0E,GAGL3zB,EAAM,EACRA,EAAM,EACGA,EAAM4zB,IACf5zB,EAAM4zB,GAGR,IAAInD,EAAavxE,EAAOy0E,EACpBsC,EAAS,EAAIj2B,EAAM4zB,EAEvB,MAAO,CACLngF,EAAGi4E,EAAIj4E,EACPuS,EAAGyqE,EACH7kF,EAAGqqF,EACHtlF,EAAG+6E,EAAI/6E,EACP5a,OAAQ,MAEZ,C,qfCpCWmgG,EAAiC,gBAAoB,MCIhE,IAAIC,EAJJ,SAA0BvlE,GACxBA,GACF,EAQWwlE,EAAW,WACpB,OAAOD,CACT,ECTIE,EAAgB,CAClBC,OAAQ,WAAmB,GAmE7B,IAAIC,EAA4B,WAC9B,SAASA,EAAazmE,EAAO0mE,GAC3BngG,KAAKy5B,MAAQA,EACbz5B,KAAKmgG,UAAYA,EACjBngG,KAAKogG,YAAc,KACnBpgG,KAAKq6B,UAAY2lE,EACjBhgG,KAAKqgG,oBAAsBrgG,KAAKqgG,oBAAoBlvE,KAAKnxB,KAC3D,CAEA,IAAI8J,EAASo2F,EAAatgG,UAqC1B,OAnCAkK,EAAOw2F,aAAe,SAAsB7lE,GAE1C,OADAz6B,KAAKugG,eACEvgG,KAAKq6B,UAAUmmE,UAAU/lE,EAClC,EAEA3wB,EAAO22F,iBAAmB,WACxBzgG,KAAKq6B,UAAU4lE,QACjB,EAEAn2F,EAAOu2F,oBAAsB,WACvBrgG,KAAK0gG,eACP1gG,KAAK0gG,eAET,EAEA52F,EAAO62F,aAAe,WACpB,OAAO/8B,QAAQ5jE,KAAKogG,YACtB,EAEAt2F,EAAOy2F,aAAe,WACfvgG,KAAKogG,cACRpgG,KAAKogG,YAAcpgG,KAAKmgG,UAAYngG,KAAKmgG,UAAUG,aAAatgG,KAAKqgG,qBAAuBrgG,KAAKy5B,MAAM+mE,UAAUxgG,KAAKqgG,qBACtHrgG,KAAKq6B,UAjGX,WACE,IAAIylE,EAAQC,IACRrqE,EAAQ,KACR7kB,EAAO,KACX,MAAO,CACLkP,MAAO,WACL2V,EAAQ,KACR7kB,EAAO,IACT,EACAovF,OAAQ,WACNH,GAAM,WAGJ,IAFA,IAAIrlE,EAAW/E,EAER+E,GACLA,EAASF,WACTE,EAAWA,EAASvrB,IAExB,GACF,EACArE,IAAK,WAIH,IAHA,IAAIwvB,EAAY,GACZI,EAAW/E,EAER+E,GACLJ,EAAUt2B,KAAK02B,GACfA,EAAWA,EAASvrB,KAGtB,OAAOmrB,CACT,EACAmmE,UAAW,SAAmBjmE,GAC5B,IAAIomE,GAAe,EACflmE,EAAW5pB,EAAO,CACpB0pB,SAAUA,EACVrrB,KAAM,KACN0T,KAAM/R,GASR,OANI4pB,EAAS7X,KACX6X,EAAS7X,KAAK1T,KAAOurB,EAErB/E,EAAQ+E,EAGH,WACAkmE,GAA0B,OAAVjrE,IACrBirE,GAAe,EAEXlmE,EAASvrB,KACXurB,EAASvrB,KAAK0T,KAAO6X,EAAS7X,KAE9B/R,EAAO4pB,EAAS7X,KAGd6X,EAAS7X,KACX6X,EAAS7X,KAAK1T,KAAOurB,EAASvrB,KAE9BwmB,EAAQ+E,EAASvrB,KAErB,CACF,EAEJ,CAmCuB0xF,GAErB,EAEA92F,EAAO+2F,eAAiB,WAClB7gG,KAAKogG,cACPpgG,KAAKogG,cACLpgG,KAAKogG,YAAc,KACnBpgG,KAAKq6B,UAAUta,QACf/f,KAAKq6B,UAAY2lE,EAErB,EAEOE,CACT,CA/CgC,GC/DrBY,EAA8C,qBAAX7lD,QAAqD,qBAApBA,OAAOiyB,UAAqE,qBAAlCjyB,OAAOiyB,SAASl2B,cAAgC,EAAA+pD,gBAAkB,EAAAC,UC2C3L,MA9CA,SAAkB9gG,GAChB,IAAIu5B,EAAQv5B,EAAKu5B,MACbtN,EAAUjsB,EAAKisB,QACf/rB,EAAWF,EAAKE,SAChB6gG,GAAe,IAAAC,UAAQ,WACzB,IAAIC,EAAe,IAAIjB,EAAazmE,GAEpC,OADA0nE,EAAaT,cAAgBS,EAAaV,iBACnC,CACLhnE,MAAOA,EACP0nE,aAAcA,EAElB,GAAG,CAAC1nE,IACA2nE,GAAgB,IAAAF,UAAQ,WAC1B,OAAOznE,EAAM4nE,UACf,GAAG,CAAC5nE,IACJqnE,GAA0B,WACxB,IAAIK,EAAeF,EAAaE,aAOhC,OANAA,EAAaZ,eAETa,IAAkB3nE,EAAM4nE,YAC1BF,EAAaV,mBAGR,WACLU,EAAaN,iBACbM,EAAaT,cAAgB,IAC/B,CACF,GAAG,CAACO,EAAcG,IAClB,IAAIE,EAAUn1E,GAAW0zE,EACzB,OAAoB,gBAAoByB,EAAQC,SAAU,CACxDnwF,MAAO6vF,GACN7gG,EACL,ECtCe,SAASf,IAetB,OAdAA,EAAWC,OAAOC,QAAU,SAAUC,GACpC,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CACzC,IAAIC,EAASN,UAAUK,GAEvB,IAAK,IAAIE,KAAOD,EACVJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAC/CH,EAAOG,GAAOD,EAAOC,GAG3B,CAEA,OAAOH,CACT,EAEOH,EAASU,MAAMC,KAAMZ,UAC9B,CChBe,SAAS4G,EAA8BtG,EAAQuG,GAC5D,GAAc,MAAVvG,EAAgB,MAAO,CAAC,EAC5B,IAEIC,EAAKF,EAFLD,EAAS,CAAC,EACV0G,EAAa5G,OAAO6G,KAAKzG,GAG7B,IAAKD,EAAI,EAAGA,EAAIyG,EAAW/G,OAAQM,IACjCE,EAAMuG,EAAWzG,GACbwG,EAASG,QAAQzG,IAAQ,IAC7BH,EAAOG,GAAOD,EAAOC,IAGvB,OAAOH,CACT,C,kCCJIspE,EAAc,GACd04B,EAAwB,CAAC,KAAM,MAUnC,SAASC,EAAyB70F,EAAO80F,GACvC,IAAIC,EAAc/0F,EAAM,GACxB,MAAO,CAAC80F,EAAOE,QAASD,EAAc,EACxC,CAEA,SAASE,EAAkCC,EAAYC,EAAYC,GACjElB,GAA0B,WACxB,OAAOgB,EAAW/hG,WAAM,EAAQgiG,EAClC,GAAGC,EACL,CAEA,SAASC,EAAoBC,EAAkBC,EAAgBC,EAAmBC,EAAcC,EAAkBC,EAA2B9B,GAE3IyB,EAAiBxtD,QAAU2tD,EAC3BF,EAAeztD,QAAU4tD,EACzBF,EAAkB1tD,SAAU,EAExB6tD,EAA0B7tD,UAC5B6tD,EAA0B7tD,QAAU,KACpC+rD,IAEJ,CAEA,SAAS+B,EAAiBC,EAA0BhpE,EAAO0nE,EAAcuB,EAAoBR,EAAkBC,EAAgBC,EAAmBG,EAA2B9B,EAAkBkC,GAE7L,GAAKF,EAAL,CAEA,IAAIG,GAAiB,EACjBC,EAAkB,KAElBC,EAAkB,WACpB,IAAIF,EAAJ,CAMA,IACIG,EAAeznF,EADf0nF,EAAmBvpE,EAAM4nE,WAG7B,IAGE0B,EAAgBL,EAAmBM,EAAkBd,EAAiBxtD,QACxE,CAAE,MAAO71C,GACPyc,EAAQzc,EACRgkG,EAAkBhkG,CACpB,CAEKyc,IACHunF,EAAkB,MAIhBE,IAAkBZ,EAAeztD,QAC9B0tD,EAAkB1tD,SACrB+rD,KAOF0B,EAAeztD,QAAUquD,EACzBR,EAA0B7tD,QAAUquD,EACpCX,EAAkB1tD,SAAU,EAE5BiuD,EAA6B,CAC3BzhG,KAAM,gBACN0gG,QAAS,CACPtmF,MAAOA,KAnCb,CAuCF,EAGA6lF,EAAaT,cAAgBoC,EAC7B3B,EAAaZ,eAGbuC,IAiBA,OAfyB,WAKvB,GAJAF,GAAiB,EACjBzB,EAAaN,iBACbM,EAAaT,cAAgB,KAEzBmC,EAMF,MAAMA,CAEV,CAvEqC,CA0EvC,CAEA,IAAII,EAAmB,WACrB,MAAO,CAAC,KAAM,EAChB,EAEe,SAASC,EAexBC,EACAjjG,QACe,IAATA,IACFA,EAAO,CAAC,GAGV,IAAI4oC,EAAQ5oC,EACRkjG,EAAuBt6D,EAAMu6D,eAC7BA,OAA0C,IAAzBD,EAAkC,SAAUpzE,GAC/D,MAAO,mBAAqBA,EAAO,GACrC,EAAIozE,EACAE,EAAmBx6D,EAAMphC,WACzBA,OAAkC,IAArB47F,EAA8B,kBAAoBA,EAC/DC,EAAwBz6D,EAAM06D,gBAC9BA,OAA4C,IAA1BD,OAAmC76F,EAAY66F,EACjEE,EAAwB36D,EAAM25D,yBAC9BA,OAAqD,IAA1BgB,GAA0CA,EACrEC,EAAiB56D,EAAM66D,SACvBA,OAA8B,IAAnBD,EAA4B,QAAUA,EAGjDE,GAFgB96D,EAAM+6D,QAEH/6D,EAAMg7D,YACzBA,OAAkC,IAArBF,GAAsCA,EACnDG,EAAgBj7D,EAAM3c,QACtBA,OAA4B,IAAlB43E,EAA2BlE,EAAoBkE,EACzDC,EAAiBh+F,EAA8B8iC,EAAO,CAAC,iBAAkB,aAAc,kBAAmB,2BAA4B,WAAY,UAAW,aAAc,YAkB3Kw4D,EAAUn1E,EACd,OAAO,SAAyB83E,GAK9B,IAAIC,EAAuBD,EAAiBE,aAAeF,EAAiBj0E,MAAQ,YAChFm0E,EAAcd,EAAea,GAE7BE,EAAyB/kG,EAAS,CAAC,EAAG2kG,EAAgB,CACxDX,eAAgBA,EAChB37F,WAAYA,EACZ87F,gBAAiBA,EACjBf,yBAA0BA,EAC1BkB,SAAUA,EACVQ,YAAaA,EACbD,qBAAsBA,EACtBD,iBAAkBA,IAGhBI,EAAOL,EAAeK,KAS1B,IAAIC,EAAkBD,EAAO,EAAAnD,QAAU,SAAU3mE,GAC/C,OAAOA,GACT,EAEA,SAASgqE,EAAgBlkG,GACvB,IAAImkG,GAAW,IAAAtD,UAAQ,WAIrB,IAAIuD,EAAyBpkG,EAAMokG,uBAC/BpC,EAAer8F,EAA8B3F,EAAO,CAAC,2BAEzD,MAAO,CAACA,EAAM8rB,QAASs4E,EAAwBpC,EACjD,GAAG,CAAChiG,IACAqkG,EAAeF,EAAS,GACxBC,EAAyBD,EAAS,GAClCnC,EAAemC,EAAS,GAExBG,GAAe,IAAAzD,UAAQ,WAGzB,OAAOwD,GAAgBA,EAAaE,WAAY,IAAAC,mBAAgC,gBAAoBH,EAAaE,SAAU,OAASF,EAAepD,CACrJ,GAAG,CAACoD,EAAcpD,IAEdL,GAAe,IAAA6D,YAAWH,GAI1BI,EAAwBnhC,QAAQvjE,EAAMo5B,QAAUmqC,QAAQvjE,EAAMo5B,MAAM4nE,WAAaz9B,QAAQvjE,EAAMo5B,MAAMurE,UAC3EphC,QAAQq9B,IAAiBr9B,QAAQq9B,EAAaxnE,OAO5E,IAAIA,EAAQsrE,EAAwB1kG,EAAMo5B,MAAQwnE,EAAaxnE,MAC3DipE,GAAqB,IAAAxB,UAAQ,WAG/B,OA/CJ,SAA6BznE,GAC3B,OAAO0pE,EAAgB1pE,EAAMurE,SAAUZ,EACzC,CA6CWa,CAAoBxrE,EAC7B,GAAG,CAACA,IAEAyrE,GAAY,IAAAhE,UAAQ,WACtB,IAAKuB,EAA0B,OAAOjB,EAGtC,IAAIL,EAAe,IAAIjB,EAAazmE,EAAOsrE,EAAwB,KAAO9D,EAAaE,cAKnFV,EAAmBU,EAAaV,iBAAiBtvE,KAAKgwE,GAC1D,MAAO,CAACA,EAAcV,EACxB,GAAG,CAAChnE,EAAOsrE,EAAuB9D,IAC9BE,EAAe+D,EAAU,GACzBzE,EAAmByE,EAAU,GAI7BC,GAAyB,IAAAjE,UAAQ,WACnC,OAAI6D,EAIK9D,EAKF5hG,EAAS,CAAC,EAAG4hG,EAAc,CAChCE,aAAcA,GAElB,GAAG,CAAC4D,EAAuB9D,EAAcE,IAGrCiE,GAAc,IAAAC,YAAW5D,EAA0B34B,EAAam6B,GAEhEqC,EADeF,EAAY,GACc,GACzCzC,EAA+ByC,EAAY,GAG/C,GAAIE,GAA6BA,EAA0BhqF,MACzD,MAAMgqF,EAA0BhqF,MAIlC,IAAI6mF,GAAiB,IAAAoD,UACjBrD,GAAmB,IAAAqD,QAAOlD,GAC1BE,GAA4B,IAAAgD,UAC5BnD,GAAoB,IAAAmD,SAAO,GAC3BjD,EAAmBgC,GAAgB,WAOrC,OAAI/B,EAA0B7tD,SAAW2tD,IAAiBH,EAAiBxtD,QAClE6tD,EAA0B7tD,QAO5BguD,EAAmBjpE,EAAM4nE,WAAYgB,EAC9C,GAAG,CAAC5oE,EAAO6rE,EAA2BjD,IAItCR,EAAkCI,EAAqB,CAACC,EAAkBC,EAAgBC,EAAmBC,EAAcC,EAAkBC,EAA2B9B,IAExKoB,EAAkCW,EAAkB,CAACC,EAA0BhpE,EAAO0nE,EAAcuB,EAAoBR,EAAkBC,EAAgBC,EAAmBG,EAA2B9B,EAAkBkC,GAA+B,CAAClpE,EAAO0nE,EAAcuB,IAG/Q,IAAI8C,GAA2B,IAAAtE,UAAQ,WACrC,OAAoB,gBAAoB+C,EAAkB5kG,EAAS,CAAC,EAAGijG,EAAkB,CACvFxyF,IAAK20F,IAET,GAAG,CAACA,EAAwBR,EAAkB3B,IAe9C,OAZoB,IAAApB,UAAQ,WAC1B,OAAIuB,EAIkB,gBAAoBkC,EAAapD,SAAU,CAC7DnwF,MAAO+zF,GACNK,GAGEA,CACT,GAAG,CAACb,EAAca,EAA0BL,GAE9C,CAGA,IAAIM,EAAUpB,EAAO,OAAWE,GAAmBA,EAInD,GAHAkB,EAAQxB,iBAAmBA,EAC3BwB,EAAQtB,YAAcI,EAAgBJ,YAAcA,EAEhDL,EAAY,CACd,IAAI4B,EAAY,cAAiB,SAA2BrlG,EAAOyP,GACjE,OAAoB,gBAAoB21F,EAASpmG,EAAS,CAAC,EAAGgB,EAAO,CACnEokG,uBAAwB30F,IAE5B,IAGA,OAFA41F,EAAUvB,YAAcA,EACxBuB,EAAUzB,iBAAmBA,EACtB,IAAayB,EAAWzB,EACjC,CAEA,OAAO,IAAawB,EAASxB,EAC/B,CACF,CChXA,SAASjqF,EAAGwK,EAAGw2B,GACb,OAAIx2B,IAAMw2B,EACK,IAANx2B,GAAiB,IAANw2B,GAAW,EAAIx2B,IAAM,EAAIw2B,EAEpCx2B,IAAMA,GAAKw2B,IAAMA,CAE5B,CAEe,SAAS2qD,EAAaC,EAAMC,GACzC,GAAI7rF,EAAG4rF,EAAMC,GAAO,OAAO,EAE3B,GAAoB,kBAATD,GAA8B,OAATA,GAAiC,kBAATC,GAA8B,OAATA,EAC3E,OAAO,EAGT,IAAIC,EAAQxmG,OAAO6G,KAAKy/F,GACpBG,EAAQzmG,OAAO6G,KAAK0/F,GACxB,GAAIC,EAAM3mG,SAAW4mG,EAAM5mG,OAAQ,OAAO,EAE1C,IAAK,IAAIM,EAAI,EAAGA,EAAIqmG,EAAM3mG,OAAQM,IAChC,IAAKH,OAAOM,UAAUC,eAAeC,KAAK+lG,EAAMC,EAAMrmG,MAAQua,EAAG4rF,EAAKE,EAAMrmG,IAAKomG,EAAKC,EAAMrmG,KAC1F,OAAO,EAIX,OAAO,CACT,CCzBO,SAASumG,EAAuBC,GACrC,OAAO,SAA8BjB,EAAU//D,GAC7C,IAAIihE,EAAWD,EAAYjB,EAAU//D,GAErC,SAASkhE,IACP,OAAOD,CACT,CAGA,OADAC,EAAiBC,mBAAoB,EAC9BD,CACT,CACF,CAQO,SAASE,EAAqBC,GACnC,OAAwC,OAAjCA,EAAWF,wBAA+D19F,IAAjC49F,EAAWF,kBAAkCxiC,QAAQ0iC,EAAWF,mBAA2C,IAAtBE,EAAWnnG,MAClJ,CAaO,SAASonG,EAAmBD,EAAY5+F,GAC7C,OAAO,SAA2Bs9F,EAAU9kG,GACxBA,EAAKikG,YAAvB,IAEIqC,EAAQ,SAAyBC,EAAiBC,GACpD,OAAOF,EAAMJ,kBAAoBI,EAAMF,WAAWG,EAAiBC,GAAYF,EAAMF,WAAWG,EAClG,EAoBA,OAjBAD,EAAMJ,mBAAoB,EAE1BI,EAAMF,WAAa,SAAgCG,EAAiBC,GAClEF,EAAMF,WAAaA,EACnBE,EAAMJ,kBAAoBC,EAAqBC,GAC/C,IAAIjmG,EAAQmmG,EAAMC,EAAiBC,GASnC,MAPqB,oBAAVrmG,IACTmmG,EAAMF,WAAajmG,EACnBmmG,EAAMJ,kBAAoBC,EAAqBhmG,GAC/CA,EAAQmmG,EAAMC,EAAiBC,IAI1BrmG,CACT,EAEOmmG,CACT,CACF,CC9CA,OAfO,SAA0CG,GAC/C,MAAqC,oBAAvBA,EAAoCJ,EAAmBI,QAA4Cj+F,CACnH,EACO,SAAyCi+F,GAC9C,OAAQA,OAIHj+F,EAJwBs9F,GAAuB,SAAUhB,GAC5D,MAAO,CACLA,SAAUA,EAEd,GACF,EACO,SAAwC2B,GAC7C,OAAOA,GAAoD,kBAAvBA,EAAkCX,GAAuB,SAAUhB,GACrG,OCdW,SAA4B4B,EAAgB5B,GACzD,IAAI6B,EAAsB,CAAC,EAEvBC,EAAQ,SAAennG,GACzB,IAAIonG,EAAgBH,EAAejnG,GAEN,oBAAlBonG,IACTF,EAAoBlnG,GAAO,WACzB,OAAOqlG,EAAS+B,EAAchnG,WAAM,EAAQX,WAC9C,EAEJ,EAEA,IAAK,IAAIO,KAAOinG,EACdE,EAAMnnG,GAGR,OAAOknG,CACT,CDJWG,CAAmBL,EAAoB3B,EAChD,SAAKt8F,CACP,GEPA,OARO,SAAuCu+F,GAC5C,MAAkC,oBAApBA,EAAiCV,EAAmBU,QAAsCv+F,CAC1G,EACO,SAAsCu+F,GAC3C,OAAQA,OAEHv+F,EAFqBs9F,GAAuB,WAC/C,MAAO,CAAC,CACV,GACF,GCNO,SAASkB,EAAkBC,EAAYC,EAAeV,GAC3D,OAAOrnG,EAAS,CAAC,EAAGqnG,EAAUS,EAAYC,EAC5C,CA+BA,OARO,SAAkCC,GACvC,MAA6B,oBAAfA,EAvBT,SAA4BA,GACjC,OAAO,SAA6BrC,EAAU9kG,GAC1BA,EAAKikG,YAAvB,IAIImD,EAHAjD,EAAOnkG,EAAKmkG,KACZkD,EAAsBrnG,EAAKqnG,oBAC3BC,GAAa,EAEjB,OAAO,SAAyBL,EAAYC,EAAeV,GACzD,IAAIe,EAAkBJ,EAAWF,EAAYC,EAAeV,GAU5D,OARIc,EACGnD,GAASkD,EAAoBE,EAAiBH,KAAcA,EAAcG,IAE/ED,GAAa,EACbF,EAAcG,GAITH,CACT,CACF,CACF,CAE4CI,CAAmBL,QAAc3+F,CAC7E,EACO,SAAiC2+F,GACtC,OAAQA,OAEJ3+F,EAFiB,WACnB,OAAOw+F,CACT,CACF,GChCO,SAASS,EAAgCV,EAAiBN,EAAoBU,EAAYrC,GAC/F,OAAO,SAAkCp4F,EAAO85F,GAC9C,OAAOW,EAAWJ,EAAgBr6F,EAAO85F,GAAWC,EAAmB3B,EAAU0B,GAAWA,EAC9F,CACF,CACO,SAASkB,EAA8BX,EAAiBN,EAAoBU,EAAYrC,EAAU9kG,GACvG,IAII0M,EACA85F,EACAS,EACAC,EACAE,EARAO,EAAiB3nG,EAAK2nG,eACtBC,EAAmB5nG,EAAK4nG,iBACxBC,EAAqB7nG,EAAK6nG,mBAC1BC,GAAoB,EAuCxB,SAASC,EAAsBC,EAAWC,GACxC,IARIC,EACAC,EAOAC,GAAgBR,EAAiBK,EAAczB,GAC/C6B,GAAgBV,EAAeK,EAAWt7F,GAG9C,OAFAA,EAAQs7F,EACRxB,EAAWyB,EACPG,GAAgBC,GA1BpBpB,EAAaF,EAAgBr6F,EAAO85F,GAChCC,EAAmBP,oBAAmBgB,EAAgBT,EAAmB3B,EAAU0B,IACvFY,EAAcD,EAAWF,EAAYC,EAAeV,IAyBhD4B,GApBArB,EAAgBb,oBAAmBe,EAAaF,EAAgBr6F,EAAO85F,IACvEC,EAAmBP,oBAAmBgB,EAAgBT,EAAmB3B,EAAU0B,IACvFY,EAAcD,EAAWF,EAAYC,EAAeV,IAmBhD6B,GAdAH,EAAiBnB,EAAgBr6F,EAAO85F,GACxC2B,GAAqBN,EAAmBK,EAAgBjB,GAC5DA,EAAaiB,EACTC,IAAmBf,EAAcD,EAAWF,EAAYC,EAAeV,IACpEY,GAWAA,CACT,CAEA,OAAO,SAAgCY,EAAWC,GAChD,OAAOH,EAAoBC,EAAsBC,EAAWC,IAzC5DhB,EAAaF,EAFbr6F,EA2C4Fs7F,EA1C5FxB,EA0CuGyB,GAxCvGf,EAAgBT,EAAmB3B,EAAU0B,GAC7CY,EAAcD,EAAWF,EAAYC,EAAeV,GACpDsB,GAAoB,EACbV,EAsCT,CACF,CAMe,SAASkB,EAA0BxD,EAAUl8D,GAC1D,IAAI2/D,EAAsB3/D,EAAM2/D,oBAC5BC,EAAyB5/D,EAAM4/D,uBAC/BC,EAAiB7/D,EAAM6/D,eACvB1jE,EAAUj/B,EAA8B8iC,EAAO,CAAC,sBAAuB,yBAA0B,mBAEjGm+D,EAAkBwB,EAAoBzD,EAAU//D,GAChD0hE,EAAqB+B,EAAuB1D,EAAU//D,GACtDoiE,EAAasB,EAAe3D,EAAU//D,GAO1C,OADsBA,EAAQo/D,KAAOuD,EAAgCD,GAC9CV,EAAiBN,EAAoBU,EAAYrC,EAAU//D,EACpF,CC7DA,SAASq6C,EAAM1uE,EAAKg4F,EAAW54E,GAC7B,IAAK,IAAIvwB,EAAImpG,EAAUzpG,OAAS,EAAGM,GAAK,EAAGA,IAAK,CAC9C,IAAIgJ,EAASmgG,EAAUnpG,GAAGmR,GAC1B,GAAInI,EAAQ,OAAOA,CACrB,CAEA,OAAO,SAAUu8F,EAAU//D,GACzB,MAAM,IAAI1pB,MAAM,gCAAkC3K,EAAM,QAAUof,EAAO,uCAAyCiV,EAAQi/D,qBAAuB,IACnJ,CACF,CAEA,SAAS2E,EAAYvuF,EAAGC,GACtB,OAAOD,IAAMC,CACf,CAIO,SAASuuF,EAAc7T,GAC5B,IAAI/0F,OAAiB,IAAV+0F,EAAmB,CAAC,EAAIA,EAC/B8T,EAAkB7oG,EAAK8oG,WACvBA,OAAiC,IAApBD,EAA6B7F,EAAkB6F,EAC5DE,EAAwB/oG,EAAKgpG,yBAC7BA,OAAqD,IAA1BD,EAAmC,EAAkCA,EAChGE,EAAwBjpG,EAAKkpG,4BAC7BA,OAAwD,IAA1BD,EAAmC,EAAqCA,EACtGE,EAAwBnpG,EAAKopG,oBAC7BA,OAAgD,IAA1BD,EAAmC,EAA6BA,EACtFE,EAAuBrpG,EAAKijG,gBAC5BA,OAA2C,IAAzBoG,EAAkC,EAAyBA,EAEjF,OAAO,SAAiBtC,EAAiBN,EAAoBU,EAAYv+D,QACzD,IAAVA,IACFA,EAAQ,CAAC,GAGX,IAAIE,EAAQF,EACR0gE,EAAaxgE,EAAMq7D,KACnBA,OAAsB,IAAfmF,GAA+BA,EACtCC,EAAuBzgE,EAAM6+D,eAC7BA,OAA0C,IAAzB4B,EAAkCZ,EAAcY,EACjEC,EAAwB1gE,EAAM8+D,iBAC9BA,OAA6C,IAA1B4B,EAAmC/D,EAAe+D,EACrEC,EAAwB3gE,EAAM++D,mBAC9BA,OAA+C,IAA1B4B,EAAmChE,EAAegE,EACvEC,EAAwB5gE,EAAMu+D,oBAC9BA,OAAgD,IAA1BqC,EAAmCjE,EAAeiE,EACxEC,EAAe7jG,EAA8BgjC,EAAO,CAAC,OAAQ,iBAAkB,mBAAoB,qBAAsB,wBAEzHy/D,EAAsBnpB,EAAM2nB,EAAiBiC,EAA0B,mBACvER,EAAyBppB,EAAMqnB,EAAoByC,EAA6B,sBAChFT,EAAiBrpB,EAAM+nB,EAAYiC,EAAqB,cAC5D,OAAON,EAAW7F,EAAiB9jG,EAAS,CAE1CqI,WAAY,UAEZ27F,eAAgB,SAAwBrzE,GACtC,MAAO,WAAaA,EAAO,GAC7B,EAEAyyE,yBAA0B7+B,QAAQqjC,GAElCwB,oBAAqBA,EACrBC,uBAAwBA,EACxBC,eAAgBA,EAChBtE,KAAMA,EACNwD,eAAgBA,EAChBC,iBAAkBA,EAClBC,mBAAoBA,EACpBR,oBAAqBA,GACpBsC,GACL,CACF,CACA,MAA4Bf,IC9ErB,SAAS,IAOd,OANmB,IAAAhE,YAAWjF,EAOhC,CCjBO,SAASiK,EAAgB39E,QACd,IAAZA,IACFA,EAAU0zE,GAGZ,IAAIkK,EAAkB59E,IAAY0zE,EAAoB,EAAyB,WAC7E,OAAO,IAAAiF,YAAW34E,EACpB,EACA,OAAO,WAIL,OAHuB49E,IACMtwE,KAG/B,CACF,CAiBO,IAAI,EAAwBqwE,IChC5B,SAASE,EAAmB79E,QACjB,IAAZA,IACFA,EAAU0zE,GAGZ,IAAIoK,EAAW99E,IAAY0zE,EAAoB,EAAkBiK,EAAgB39E,GACjF,OAAO,WAEL,OADY89E,IACCjF,QACf,CACF,CAuBO,IAAIkF,EAA2BF,ICpClCG,EAAc,SAAqB7vF,EAAGC,GACxC,OAAOD,IAAMC,CACf,EAqFO,SAAS6vF,EAAmBj+E,QACjB,IAAZA,IACFA,EAAU0zE,GAGZ,IAAIkK,EAAkB59E,IAAY0zE,EAAoB,EAAyB,WAC7E,OAAO,IAAAiF,YAAW34E,EACpB,EACA,OAAO,SAAqBk+E,EAAUC,QACjB,IAAfA,IACFA,EAAaH,GAiBf,IAAII,EAAmBR,IAInBS,EAlHR,SAA6CH,EAAUC,EAAY7wE,EAAOgxE,GACxE,IAaID,EAVAE,GAHc,IAAArF,aAAW,SAAU11E,GACrC,OAAOA,EAAI,CACb,GAAG,GAC2B,GAE1BwxE,GAAe,IAAAD,UAAQ,WACzB,OAAO,IAAIhB,EAAazmE,EAAOgxE,EACjC,GAAG,CAAChxE,EAAOgxE,IACPE,GAAkC,IAAApF,UAClCqF,GAAiB,IAAArF,UACjBvC,GAAmB,IAAAuC,UACnBsF,GAAsB,IAAAtF,UACtBuF,EAAarxE,EAAM4nE,WAGvB,IACE,GAAIgJ,IAAaO,EAAel2D,SAAWo2D,IAAe9H,EAAiBtuD,SAAWi2D,EAAgCj2D,QAAS,CAC7H,IAAIq2D,EAAmBV,EAASS,GAK9BN,OAHkC9hG,IAAhCmiG,EAAoBn2D,SAA0B41D,EAAWS,EAAkBF,EAAoBn2D,SAGjFm2D,EAAoBn2D,QAFpBq2D,CAIpB,MACEP,EAAgBK,EAAoBn2D,OAExC,CAAE,MAAOjY,GAKP,MAJIkuE,EAAgCj2D,UAClCjY,EAAIy+C,SAAW,4DAA8DyvB,EAAgCj2D,QAAQpuB,MAAQ,QAGzHmW,CACR,CAuCA,OArCAqkE,GAA0B,WACxB8J,EAAel2D,QAAU21D,EACzBrH,EAAiBtuD,QAAUo2D,EAC3BD,EAAoBn2D,QAAU81D,EAC9BG,EAAgCj2D,aAAUhsC,CAC5C,IACAo4F,GAA0B,WACxB,SAASgC,IACP,IACE,IAAIkI,EAAgBvxE,EAAM4nE,WAEtB4J,EAAoBL,EAAel2D,QAAQs2D,GAE/C,GAAIV,EAAWW,EAAmBJ,EAAoBn2D,SACpD,OAGFm2D,EAAoBn2D,QAAUu2D,EAC9BjI,EAAiBtuD,QAAUs2D,CAC7B,CAAE,MAAOvuE,GAKPkuE,EAAgCj2D,QAAUjY,CAC5C,CAEAiuE,GACF,CAKA,OAHAvJ,EAAaT,cAAgBoC,EAC7B3B,EAAaZ,eACbuC,IACO,WACL,OAAO3B,EAAaN,gBACtB,CACF,GAAG,CAACpnE,EAAO0nE,IACJqJ,CACT,CAwCwBU,CAAoCb,EAAUC,EAHtDC,EAAiB9wE,MACZ8wE,EAAiBpJ,cAIlC,OADA,IAAAgK,eAAcX,GACPA,CACT,CACF,CAyBO,IlBlJiCY,EkBkJ7BC,EAA2BjB,I,WlBlJEgB,EmBG/B,0BnBFAtL,EAAQsL,C,qCoBNjB9rG,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQu6F,gBAAa5iG,EAErB,IAMgCsD,EAN5Bu/F,EAAW,EAAQ,OAEnBC,GAI4Bx/F,EAJMu/F,IAIev/F,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,GAFnF3M,EAAWC,OAAOC,QAAU,SAAUC,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAI/P,IAAIisG,EAAa,CACf7V,aAAc,SAAsBxkF,GAClC,MAAO,CACLs6F,eAAgBt6F,EAChBu6F,gBAAiBv6F,EACjBw6F,cAAex6F,EACfy6F,mBAAoBz6F,EACpBwkF,aAAcxkF,EAElB,EACA6kF,UAAW,SAAmB7kF,GAC5B,MAAO,CACL06F,YAAa16F,EACb26F,aAAc36F,EACd46F,WAAY56F,EACZ66F,gBAAiB76F,EACjB6kF,UAAW7kF,EAEf,EACA+vC,WAAY,SAAoB/vC,GAC9B,MAAO,CACL86F,mBAAoB96F,EACpB+6F,gBAAiB/6F,EACjBg7F,cAAeh7F,EACfi7F,aAAcj7F,EACdgwC,iBAAkBhwC,EAClB+vC,WAAY/vC,EAEhB,EAEAutB,KAAM,SAAcvtB,GAClB,MAAO,CACLk7F,cAAel7F,EACfm7F,WAAYn7F,EACZo7F,WAAYp7F,EACZq7F,OAAQr7F,EACRutB,KAAMvtB,EAEV,EACAs7F,UAAW,SAAmBt7F,GAC5B,MAAO,CACLu7F,gBAAiBv7F,EACjBs7F,UAAWt7F,EAEf,EACAw7F,eAAgB,SAAwBx7F,GACtC,MAAO,CACLy7F,qBAAsBz7F,EACtBw7F,eAAgBx7F,EAEpB,EAEA07F,WAAY,SAAoB17F,GAC9B,MAAO,CACL27F,aAAc37F,EACd47F,cAAe57F,EACf67F,YAAa77F,EACb87F,iBAAkB97F,EAClB07F,WAAY17F,EAEhB,EAEAmlF,UAAW,SAAmBnlF,GAC5B,MAAO,CACL+7F,YAAa/7F,EACbg8F,aAAch8F,EACdi8F,WAAYj8F,EACZk8F,gBAAiBl8F,EACjBmlF,UAAWnlF,EAEf,EACAukF,SAAU,SAAkBvkF,GAC1B,IAAImxC,EAAYnxC,GAASA,EAAM1G,MAAM,KACrC,MAAO,CACL+/D,SAAU,WACVd,IAAKpnB,GAAaA,EAAU,GAC5Bz5B,MAAOy5B,GAAaA,EAAU,GAC9BqnB,OAAQrnB,GAAaA,EAAU,GAC/B15B,KAAM05B,GAAaA,EAAU,GAEjC,EACAk4B,OAAQ,SAAgBzqD,EAAMu9E,GAC5B,IAAIC,EAAaD,EAAmBv9E,GACpC,OAAIw9E,GAGG,CACL,OAAUx9E,EAEd,GAGEs7E,EAAav6F,EAAQu6F,WAAa,SAAoB9qC,GACxD,IAAIitC,EAAW,CAAC,EAahB,OAZA,EAAIjC,EAAS3W,SAASr0B,GAAU,SAAUt3D,EAAQ6G,GAChD,IAAI29F,EAAW,CAAC,GAChB,EAAIlC,EAAS3W,SAAS3rF,GAAQ,SAAUkI,EAAOzR,GAC7C,IAAI42F,EAAYkV,EAAW9rG,GACvB42F,EACFmX,EAAWruG,EAAS,CAAC,EAAGquG,EAAUnX,EAAUnlF,IAE5Cs8F,EAAS/tG,GAAOyR,CAEpB,IACAq8F,EAAS19F,GAAW29F,CACtB,IACOD,CACT,EAEA18F,EAAA,QAAkBu6F,C,qCC1HlBhsG,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQpQ,YAAS+H,EAEjB,IAMgCsD,EAN5B3M,EAAWC,OAAOC,QAAU,SAAUC,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAE3P80F,EAAS,EAAQ,OAEjBC,GAE4BvoF,EAFKsoF,IAEgBtoF,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,GAIvF,SAASgpF,EAA2Bn8C,EAAM/4C,GAAQ,IAAK+4C,EAAQ,MAAM,IAAIC,eAAe,6DAAgE,OAAOh5C,GAAyB,kBAATA,GAAqC,oBAATA,EAA8B+4C,EAAP/4C,CAAa,CAI/O,IAAIa,EAASoQ,EAAQpQ,OAAS,SAAgB8K,GAC5C,IAAIg0F,EAAOrgG,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAK,OAE/E,OAAO,SAAUg6B,GAGf,SAASu0E,IACP,IAAIztG,EAEA+0F,EAAOvoF,GAfjB,SAAyBw4B,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAInsB,UAAU,oCAAwC,CAiBlJosB,CAAgBplC,KAAM2tG,GAEtB,IAAK,IAAInkG,EAAOpK,UAAUD,OAAQ0I,EAAO5I,MAAMuK,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC3E5B,EAAK4B,GAAQrK,UAAUqK,GAGzB,OAAewrF,EAASvoF,EAAQsoF,EAA2Bh1F,MAAOE,EAAOytG,EAAO5nG,WAAazG,OAAO0xB,eAAe28E,IAAS7tG,KAAKC,MAAMG,EAAM,CAACF,MAAMiI,OAAOJ,KAAiB6E,EAAME,MAAQ,CAAEjM,QAAQ,GAAS+L,EAAM4oF,gBAAkB,WACnO,OAAO5oF,EAAMW,SAAS,CAAE1M,QAAQ,GAClC,EAAG+L,EAAM6oF,cAAgB,WACvB,OAAO7oF,EAAMW,SAAS,CAAE1M,QAAQ,GAClC,EAAG+L,EAAM+C,OAAS,WAChB,OAAO8kF,EAAQM,QAAQ79C,cACrByoD,EACA,CAAE5+F,YAAa6L,EAAM4oF,gBAAiBx0C,UAAWp0C,EAAM6oF,eACvDhB,EAAQM,QAAQ79C,cAAcvrC,EAAWpM,EAAS,CAAC,EAAGqN,EAAMrM,MAAOqM,EAAME,QAE7E,EAAWooF,EAA2BtoF,EAAnCuoF,EACL,CAEA,OAhCJ,SAAmB1oF,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIwM,UAAU,kEAAoExM,GAAeD,EAAS3M,UAAYN,OAAOmP,OAAOjC,GAAcA,EAAW5M,UAAW,CAAE8O,YAAa,CAAE0C,MAAO7E,EAAUmvB,YAAY,EAAOM,UAAU,EAAMD,cAAc,KAAevvB,IAAYlN,OAAOwG,eAAiBxG,OAAOwG,eAAeyG,EAAUC,GAAcD,EAASxG,UAAYyG,EAAY,CAMzeipF,CAAUkY,EAAQv0E,GA0BXu0E,CACT,CA5BO,CA4BLpZ,EAAQM,QAAQppF,UACpB,EAEAsF,EAAA,QAAkBpQ,C,qCCrDlBrB,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQ68F,WAAQllG,EAEhB,IAMgCsD,EAN5B3M,EAAWC,OAAOC,QAAU,SAAUC,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAE3P80F,EAAS,EAAQ,OAEjBC,GAE4BvoF,EAFKsoF,IAEgBtoF,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,GAIvF,SAASgpF,EAA2Bn8C,EAAM/4C,GAAQ,IAAK+4C,EAAQ,MAAM,IAAIC,eAAe,6DAAgE,OAAOh5C,GAAyB,kBAATA,GAAqC,oBAATA,EAA8B+4C,EAAP/4C,CAAa,CAI/O,IAAI8tG,EAAQ78F,EAAQ68F,MAAQ,SAAeniG,GACzC,IAAIg0F,EAAOrgG,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAK,OAE/E,OAAO,SAAUg6B,GAGf,SAASy0E,IACP,IAAI3tG,EAEA+0F,EAAOvoF,GAfjB,SAAyBw4B,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAInsB,UAAU,oCAAwC,CAiBlJosB,CAAgBplC,KAAM6tG,GAEtB,IAAK,IAAIrkG,EAAOpK,UAAUD,OAAQ0I,EAAO5I,MAAMuK,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC3E5B,EAAK4B,GAAQrK,UAAUqK,GAGzB,OAAewrF,EAASvoF,EAAQsoF,EAA2Bh1F,MAAOE,EAAO2tG,EAAM9nG,WAAazG,OAAO0xB,eAAe68E,IAAQ/tG,KAAKC,MAAMG,EAAM,CAACF,MAAMiI,OAAOJ,KAAiB6E,EAAME,MAAQ,CAAEghG,OAAO,GAASlhG,EAAMohG,gBAAkB,WAChO,OAAOphG,EAAMW,SAAS,CAAEugG,OAAO,GACjC,EAAGlhG,EAAMqhG,eAAiB,WACxB,OAAOrhG,EAAMW,SAAS,CAAEugG,OAAO,GACjC,EAAGlhG,EAAM+C,OAAS,WAChB,OAAO8kF,EAAQM,QAAQ79C,cACrByoD,EACA,CAAErE,YAAa1uF,EAAMohG,gBAAiBE,WAAYthG,EAAMqhG,gBACxDxZ,EAAQM,QAAQ79C,cAAcvrC,EAAWpM,EAAS,CAAC,EAAGqN,EAAMrM,MAAOqM,EAAME,QAE7E,EAAWooF,EAA2BtoF,EAAnCuoF,EACL,CAEA,OAhCJ,SAAmB1oF,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIwM,UAAU,kEAAoExM,GAAeD,EAAS3M,UAAYN,OAAOmP,OAAOjC,GAAcA,EAAW5M,UAAW,CAAE8O,YAAa,CAAE0C,MAAO7E,EAAUmvB,YAAY,EAAOM,UAAU,EAAMD,cAAc,KAAevvB,IAAYlN,OAAOwG,eAAiBxG,OAAOwG,eAAeyG,EAAUC,GAAcD,EAASxG,UAAYyG,EAAY,CAMzeipF,CAAUoY,EAAOz0E,GA0BVy0E,CACT,CA5BO,CA4BLtZ,EAAQM,QAAQppF,UACpB,EAEAsF,EAAA,QAAkB68F,C,qCCrDlBtuG,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQk9F,kBAAevlG,EAEvB,IAEIwlG,EAAa1Z,EAFA,EAAQ,QAMrBgX,EAAWhX,EAFA,EAAQ,QAMnB2Z,EAAkB3Z,EAFA,EAAQ,QAM1B4Z,EAAQ5Z,EAFA,EAAQ,QAIpB,SAASA,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAE9F,IAAIiiG,EAAel9F,EAAQk9F,aAAe,SAASA,IACjD,IAAII,EAASjvG,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAK,GAE7E6xB,EAAQ,GAiBZ,OAfA,EAAIm9E,EAAMvZ,SAASwZ,GAAQ,SAAUC,GAC/BrvG,MAAMC,QAAQovG,GAChBL,EAAaK,GAAO9iG,KAAI,SAAUwkB,GAChC,OAAOiB,EAAMltB,KAAKisB,EACpB,KACS,EAAIm+E,EAAgBtZ,SAASyZ,IACtC,EAAI9C,EAAS3W,SAASyZ,GAAO,SAAUl9F,EAAOzR,IAClC,IAAVyR,GAAkB6f,EAAMltB,KAAKpE,GAC7BsxB,EAAMltB,KAAKpE,EAAM,IAAMyR,EACzB,KACS,EAAI88F,EAAWrZ,SAASyZ,IACjCr9E,EAAMltB,KAAKuqG,EAEf,IAEOr9E,CACT,EAEAlgB,EAAA,QAAkBk9F,C,qCC9ClB3uG,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQw9F,SAAWx9F,EAAQy9F,KAAOz9F,EAAQ09F,aAAe19F,EAAQ29F,YAAc39F,EAAQ68F,WAAQllG,EAE/F,IAEIimG,EAAiBna,EAFD,EAAQ,QAMxBoa,EAAiBpa,EAFD,EAAQ,QAMxBqa,EAAera,EAFD,EAAQ,QAMtBsa,EAAUta,EAFA,EAAQ,QAMlBua,EAAWva,EAFD,EAAQ,QAMlBwa,EAASxa,EAFA,EAAQ,QAIrB,SAASA,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAE9F+E,EAAQ68F,MAAQkB,EAAQja,QACxB9jF,EAAQ29F,YAAcI,EAAQja,QAC9B9jF,EAAQ09F,aAAeM,EAASla,QAChC9jF,EAAQy9F,KAAOQ,EAAOna,QACtB,IAAI0Z,EAAWx9F,EAAQw9F,SAAW,SAAkBU,GAClD,IAAK,IAAIzlG,EAAOpK,UAAUD,OAAQ+vG,EAAcjwG,MAAMuK,EAAO,EAAIA,EAAO,EAAI,GAAIC,EAAO,EAAGA,EAAOD,EAAMC,IACrGylG,EAAYzlG,EAAO,GAAKrK,UAAUqK,GAGpC,IAAI0lG,GAAc,EAAIR,EAAe9Z,SAASqa,GAC1CE,GAAS,EAAIR,EAAe/Z,SAASoa,EAASE,GAClD,OAAO,EAAIN,EAAaha,SAASua,EACnC,EAEAr+F,EAAA,QAAkBw9F,C,mCC7ClBjvG,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAmBTL,EAAA,QAjBe,SAAkBtR,EAAGN,GAClC,IAAIkB,EAAQ,CAAC,EACT6wB,EAAU,SAAiBlB,GAC7B,IAAI5e,IAAQhS,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,KAAmBA,UAAU,GAE3EiB,EAAM2vB,GAAQ5e,CAChB,EAQA,OANM,IAAN3R,GAAWyxB,EAAQ,eACnBzxB,IAAMN,EAAS,GAAK+xB,EAAQ,eACrB,IAANzxB,GAAWA,EAAI,IAAM,IAAMyxB,EAAQ,QAChB,IAApBzd,KAAKkI,IAAIlc,EAAI,IAAYyxB,EAAQ,OACjCA,EAAQ,YAAazxB,GAEdY,CACT,C,qCClBAf,OAAOif,eAAexN,EAAS,aAAc,CAC3CK,OAAO,IAETL,EAAQs+F,kBAAe3mG,EAEvB,IAEI8iG,EAAWhX,EAFA,EAAQ,QAMnB8a,EAAc9a,EAFA,EAAQ,QAItBn1F,EAAWC,OAAOC,QAAU,SAAUC,GAAU,IAAK,IAAIC,EAAI,EAAGA,EAAIL,UAAUD,OAAQM,IAAK,CAAE,IAAIC,EAASN,UAAUK,GAAI,IAAK,IAAIE,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAE/P,SAASg1F,EAAuBxoF,GAAO,OAAOA,GAAOA,EAAI2oF,WAAa3oF,EAAM,CAAE6oF,QAAS7oF,EAAO,CAE9F,IAAIqjG,EAAet+F,EAAQs+F,aAAe,SAAsBJ,GAC9D,IAAIE,EAAc/vG,UAAUD,OAAS,QAAsBuJ,IAAjBtJ,UAAU,GAAmBA,UAAU,GAAK,GAElF8J,EAAS+lG,EAAQpa,UAAW,EAAIya,EAAYza,SAASoa,EAAQpa,UAAY,CAAC,EAe9E,OAdAsa,EAAY3jG,KAAI,SAAUwkB,GACxB,IAAI4iB,EAAUq8D,EAAQj/E,GAWtB,OAVI4iB,IACF,EAAI44D,EAAS3W,SAASjiD,GAAS,SAAUxhC,EAAOzR,GACzCuJ,EAAOvJ,KACVuJ,EAAOvJ,GAAO,CAAC,GAGjBuJ,EAAOvJ,GAAON,EAAS,CAAC,EAAG6J,EAAOvJ,GAAMizC,EAAQjzC,GAClD,IAGKqwB,CACT,IACO9mB,CACT,EAEA6H,EAAA,QAAkBs+F,C,yBCxCjB,SAAU/9B,EAAQ5oE,GACf,aAEA,IAAI4oE,EAAO9O,aAAX,CAIA,IAII+sC,EA6HIl+C,EAZAm+C,EArBAC,EACAC,EAjGJC,EAAa,EACbC,EAAgB,CAAC,EACjBC,GAAwB,EACxBzgC,EAAMkC,EAAOpE,SAoJb4iC,EAAWxwG,OAAO0xB,gBAAkB1xB,OAAO0xB,eAAesgD,GAC9Dw+B,EAAWA,GAAYA,EAASrpD,WAAaqpD,EAAWx+B,EAGf,qBAArC,CAAC,EAAEz6D,SAAS/W,KAAKwxE,EAAOy+B,SApFxBR,EAAoB,SAASS,GACzBD,QAAQE,UAAS,WAAcC,EAAaF,EAAS,GACzD,GAGJ,WAGI,GAAI1+B,EAAO6+B,cAAgB7+B,EAAO8+B,cAAe,CAC7C,IAAIC,GAA4B,EAC5BC,EAAeh/B,EAAOi/B,UAM1B,OALAj/B,EAAOi/B,UAAY,WACfF,GAA4B,CAChC,EACA/+B,EAAO6+B,YAAY,GAAI,KACvB7+B,EAAOi/B,UAAYD,EACZD,CACX,CACJ,CAsEWG,GAIAl/B,EAAOm/B,iBA9CVjB,EAAU,IAAIiB,gBACVC,MAAMH,UAAY,SAASzvG,GAE/BovG,EADapvG,EAAM0jC,KAEvB,EAEA+qE,EAAoB,SAASS,GACzBR,EAAQmB,MAAMR,YAAYH,EAC9B,GA0CO5gC,GAAO,uBAAwBA,EAAIp4B,cAAc,WAtCpDqa,EAAO+d,EAAIzwD,gBACf4wF,EAAoB,SAASS,GAGzB,IAAIY,EAASxhC,EAAIp4B,cAAc,UAC/B45D,EAAOC,mBAAqB,WACxBX,EAAaF,GACbY,EAAOC,mBAAqB,KAC5Bx/C,EAAK8T,YAAYyrC,GACjBA,EAAS,IACb,EACAv/C,EAAKsZ,YAAYimC,EACrB,GAIArB,EAAoB,SAASS,GACzBvpD,WAAWypD,EAAc,EAAGF,EAChC,GAnDIP,EAAgB,gBAAkBh8F,KAAKw4D,SAAW,IAClDyjC,EAAkB,SAAS5uG,GACvBA,EAAMpB,SAAW4xE,GACK,kBAAfxwE,EAAM0jC,MACyB,IAAtC1jC,EAAM0jC,KAAKp+B,QAAQqpG,IACnBS,GAAcpvG,EAAM0jC,KAAK15B,MAAM2kG,EAActwG,QAErD,EAEImyE,EAAOr7B,iBACPq7B,EAAOr7B,iBAAiB,UAAWy5D,GAAiB,GAEpDp+B,EAAOw/B,YAAY,YAAapB,GAGpCH,EAAoB,SAASS,GACzB1+B,EAAO6+B,YAAYV,EAAgBO,EAAQ,IAC/C,GA+DJF,EAASttC,aA1KT,SAAsBjoC,GAEI,oBAAbA,IACTA,EAAW,IAAIw2E,SAAS,GAAKx2E,IAI/B,IADA,IAAI1yB,EAAO,IAAI5I,MAAMG,UAAUD,OAAS,GAC/BM,EAAI,EAAGA,EAAIoI,EAAK1I,OAAQM,IAC7BoI,EAAKpI,GAAKL,UAAUK,EAAI,GAG5B,IAAIuxG,EAAO,CAAEz2E,SAAUA,EAAU1yB,KAAMA,GAGvC,OAFA+nG,EAAcD,GAAcqB,EAC5BzB,EAAkBI,GACXA,GACT,EA4JAG,EAASmB,eAAiBA,CAnL1B,CAyBA,SAASA,EAAejB,UACbJ,EAAcI,EACzB,CAwBA,SAASE,EAAaF,GAGlB,GAAIH,EAGAppD,WAAWypD,EAAc,EAAGF,OACzB,CACH,IAAIgB,EAAOpB,EAAcI,GACzB,GAAIgB,EAAM,CACNnB,GAAwB,EACxB,KAjCZ,SAAamB,GACT,IAAIz2E,EAAWy2E,EAAKz2E,SAChB1yB,EAAOmpG,EAAKnpG,KAChB,OAAQA,EAAK1I,QACb,KAAK,EACDo7B,IACA,MACJ,KAAK,EACDA,EAAS1yB,EAAK,IACd,MACJ,KAAK,EACD0yB,EAAS1yB,EAAK,GAAIA,EAAK,IACvB,MACJ,KAAK,EACD0yB,EAAS1yB,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAChC,MACJ,QACI0yB,EAASx6B,MAAM2I,EAAWb,GAGlC,CAcgBqpG,CAAIF,EACR,CAAE,QACEC,EAAejB,GACfH,GAAwB,CAC5B,CACJ,CACJ,CACJ,CA8GJ,CAzLA,CAyLkB,qBAATh3D,KAAyC,qBAAX,EAAA8I,EAAyB3hD,KAAO,EAAA2hD,EAAS9I,K,wBCzLhF,OAIA,SAAUplC,GAEV,IAAIgsD,EAAW,OACXC,EAAY,OACZyxC,EAAc,EACdC,EAAY39F,EAAKy0E,MACjBmpB,EAAU59F,EAAKkB,IACf28F,EAAU79F,EAAKC,IACf69F,EAAa99F,EAAKw4D,OAEtB,SAASulC,EAAWla,EAAOma,GAMvB,GAHAA,EAAOA,GAAQ,CAAE,GADjBna,EAAQ,GAAkB,cAILka,EAClB,OAAOla,EAGV,KAAMt3F,gBAAgBwxG,GAClB,OAAO,IAAIA,EAAUla,EAAOma,GAGhC,IAAI/b,EAoRR,SAAoB4B,GAEhB,IAAI5B,EAAM,CAAE92F,EAAG,EAAG+iD,EAAG,EAAGpnC,EAAG,GACvBD,EAAI,EACJqV,EAAI,KACJpa,EAAI,KACJiqD,EAAI,KACJkyC,GAAK,EACLznB,GAAS,EAEO,iBAATqN,IACPA,EAywBR,SAA6BA,GAEzBA,EAAQA,EAAMp2D,QAAQu+B,EAAS,IAAIv+B,QAAQw+B,EAAW,IAAIv+B,cAC1D,IAaIm+C,EAbAqyB,GAAQ,EACZ,GAAI1gF,EAAMqmE,GACNA,EAAQrmE,EAAMqmE,GACdqa,GAAQ,OAEP,GAAa,eAATra,EACL,MAAO,CAAE14F,EAAG,EAAG+iD,EAAG,EAAGpnC,EAAG,EAAGD,EAAG,EAAG2vE,OAAQ,QAQ7C,GAAK3K,EAAQsyB,EAASlc,IAAIvjC,KAAKmlC,GAC3B,MAAO,CAAE14F,EAAG0gF,EAAM,GAAI39B,EAAG29B,EAAM,GAAI/kE,EAAG+kE,EAAM,IAEhD,GAAKA,EAAQsyB,EAASC,KAAK1/C,KAAKmlC,GAC5B,MAAO,CAAE14F,EAAG0gF,EAAM,GAAI39B,EAAG29B,EAAM,GAAI/kE,EAAG+kE,EAAM,GAAIhlE,EAAGglE,EAAM,IAE7D,GAAKA,EAAQsyB,EAASvc,IAAIljC,KAAKmlC,GAC3B,MAAO,CAAEl6E,EAAGkiE,EAAM,GAAI3vD,EAAG2vD,EAAM,GAAI9f,EAAG8f,EAAM,IAEhD,GAAKA,EAAQsyB,EAASE,KAAK3/C,KAAKmlC,GAC5B,MAAO,CAAEl6E,EAAGkiE,EAAM,GAAI3vD,EAAG2vD,EAAM,GAAI9f,EAAG8f,EAAM,GAAIhlE,EAAGglE,EAAM,IAE7D,GAAKA,EAAQsyB,EAASlX,IAAIvoC,KAAKmlC,GAC3B,MAAO,CAAEl6E,EAAGkiE,EAAM,GAAI3vD,EAAG2vD,EAAM,GAAI/pE,EAAG+pE,EAAM,IAEhD,GAAKA,EAAQsyB,EAASG,KAAK5/C,KAAKmlC,GAC5B,MAAO,CAAEl6E,EAAGkiE,EAAM,GAAI3vD,EAAG2vD,EAAM,GAAI/pE,EAAG+pE,EAAM,GAAIhlE,EAAGglE,EAAM,IAE7D,GAAKA,EAAQsyB,EAASI,KAAK7/C,KAAKmlC,GAC5B,MAAO,CACH14F,EAAGqzG,EAAgB3yB,EAAM,IACzB39B,EAAGswD,EAAgB3yB,EAAM,IACzB/kE,EAAG03F,EAAgB3yB,EAAM,IACzBhlE,EAAG43F,EAAoB5yB,EAAM,IAC7B2K,OAAQ0nB,EAAQ,OAAS,QAGjC,GAAKryB,EAAQsyB,EAASO,KAAKhgD,KAAKmlC,GAC5B,MAAO,CACH14F,EAAGqzG,EAAgB3yB,EAAM,IACzB39B,EAAGswD,EAAgB3yB,EAAM,IACzB/kE,EAAG03F,EAAgB3yB,EAAM,IACzB2K,OAAQ0nB,EAAQ,OAAS,OAGjC,GAAKryB,EAAQsyB,EAASQ,KAAKjgD,KAAKmlC,GAC5B,MAAO,CACH14F,EAAGqzG,EAAgB3yB,EAAM,GAAK,GAAKA,EAAM,IACzC39B,EAAGswD,EAAgB3yB,EAAM,GAAK,GAAKA,EAAM,IACzC/kE,EAAG03F,EAAgB3yB,EAAM,GAAK,GAAKA,EAAM,IACzChlE,EAAG43F,EAAoB5yB,EAAM,GAAK,GAAKA,EAAM,IAC7C2K,OAAQ0nB,EAAQ,OAAS,QAGjC,GAAKryB,EAAQsyB,EAASS,KAAKlgD,KAAKmlC,GAC5B,MAAO,CACH14F,EAAGqzG,EAAgB3yB,EAAM,GAAK,GAAKA,EAAM,IACzC39B,EAAGswD,EAAgB3yB,EAAM,GAAK,GAAKA,EAAM,IACzC/kE,EAAG03F,EAAgB3yB,EAAM,GAAK,GAAKA,EAAM,IACzC2K,OAAQ0nB,EAAQ,OAAS,OAIjC,OAAO,CACX,CAh1BgBW,CAAoBhb,IAGZ,iBAATA,IACHib,EAAejb,EAAM14F,IAAM2zG,EAAejb,EAAM31C,IAAM4wD,EAAejb,EAAM/8E,IAiDrE3b,EAhDS04F,EAAM14F,EAgDZ+iD,EAhDe21C,EAAM31C,EAgDlBpnC,EAhDqB+8E,EAAM/8E,EAAvCm7E,EAiDD,CACH92F,EAAqB,IAAlB4zG,EAAQ5zG,EAAG,KACd+iD,EAAqB,IAAlB6wD,EAAQ7wD,EAAG,KACdpnC,EAAqB,IAAlBi4F,EAAQj4F,EAAG,MAnDVm3F,GAAK,EACLznB,EAAwC,MAA/BlpD,OAAOu2D,EAAM14F,GAAGujE,QAAQ,GAAa,OAAS,OAElDowC,EAAejb,EAAMl6E,IAAMm1F,EAAejb,EAAM3nE,IAAM4iF,EAAejb,EAAM/hF,IAChFoa,EAAI8iF,EAAoBnb,EAAM3nE,GAC9Bpa,EAAIk9F,EAAoBnb,EAAM/hF,GAC9BmgF,EAoJX,SAAkBt4E,EAAGuS,EAAGpa,GAErB6H,EAAsB,EAAlBo1F,EAAQp1F,EAAG,KACfuS,EAAI6iF,EAAQ7iF,EAAG,KACfpa,EAAIi9F,EAAQj9F,EAAG,KAEf,IAAI9V,EAAIgU,EAAKoJ,MAAMO,GACfre,EAAIqe,EAAI3d,EACRoG,EAAI0P,GAAK,EAAIoa,GACb+iF,EAAIn9F,GAAK,EAAIxW,EAAI4wB,GACjB7wB,EAAIyW,GAAK,GAAK,EAAIxW,GAAK4wB,GACvBgjF,EAAMlzG,EAAI,EACVb,EAAI,CAAC2W,EAAGm9F,EAAG7sG,EAAGA,EAAG/G,EAAGyW,GAAGo9F,GACvBhxD,EAAI,CAAC7iD,EAAGyW,EAAGA,EAAGm9F,EAAG7sG,EAAGA,GAAG8sG,GACvBp4F,EAAI,CAAC1U,EAAGA,EAAG/G,EAAGyW,EAAGA,EAAGm9F,GAAGC,GAE3B,MAAO,CAAE/zG,EAAO,IAAJA,EAAS+iD,EAAO,IAAJA,EAASpnC,EAAO,IAAJA,EACxC,CArKkBq4F,CAAStb,EAAMl6E,EAAGuS,EAAGpa,GAC3Bm8F,GAAK,EACLznB,EAAS,OAEJsoB,EAAejb,EAAMl6E,IAAMm1F,EAAejb,EAAM3nE,IAAM4iF,EAAejb,EAAM93B,KAChF7vC,EAAI8iF,EAAoBnb,EAAM3nE,GAC9B6vC,EAAIizC,EAAoBnb,EAAM93B,GAC9Bk2B,EA6EZ,SAAkBt4E,EAAGuS,EAAG6vC,GACpB,IAAI5gE,EAAG+iD,EAAGpnC,EAMV,SAASs4F,EAAQhtG,EAAG6sG,EAAG5zG,GAGnB,OAFGA,EAAI,IAAGA,GAAK,GACZA,EAAI,IAAGA,GAAK,GACZA,EAAI,EAAE,EAAU+G,EAAc,GAAT6sG,EAAI7sG,GAAS/G,EAClCA,EAAI,GAAY4zG,EAChB5zG,EAAI,EAAE,EAAU+G,GAAK6sG,EAAI7sG,IAAM,EAAE,EAAI/G,GAAK,EACtC+G,CACX,CAEA,GAbAuX,EAAIo1F,EAAQp1F,EAAG,KACfuS,EAAI6iF,EAAQ7iF,EAAG,KACf6vC,EAAIgzC,EAAQhzC,EAAG,KAWN,IAAN7vC,EACC/wB,EAAI+iD,EAAIpnC,EAAIilD,MAEX,CACD,IAAIkzC,EAAIlzC,EAAI,GAAMA,GAAK,EAAI7vC,GAAK6vC,EAAI7vC,EAAI6vC,EAAI7vC,EACxC9pB,EAAI,EAAI25D,EAAIkzC,EAChB9zG,EAAIi0G,EAAQhtG,EAAG6sG,EAAGt1F,EAAI,EAAE,GACxBukC,EAAIkxD,EAAQhtG,EAAG6sG,EAAGt1F,GAClB7C,EAAIs4F,EAAQhtG,EAAG6sG,EAAGt1F,EAAI,EAAE,EAC5B,CAEA,MAAO,CAAExe,EAAO,IAAJA,EAAS+iD,EAAO,IAAJA,EAASpnC,EAAO,IAAJA,EACxC,CAzGkBu4F,CAASxb,EAAMl6E,EAAGuS,EAAG6vC,GAC3BkyC,GAAK,EACLznB,EAAS,OAGTqN,EAAMz3F,eAAe,OACrBya,EAAIg9E,EAAMh9E,IA4BtB,IAAkB1b,EAAG+iD,EAAGpnC,EAtBpB,OAFAD,EAAIy4F,EAAWz4F,GAER,CACHo3F,GAAIA,EACJznB,OAAQqN,EAAMrN,QAAUA,EACxBrrF,EAAGyyG,EAAQ,IAAKC,EAAQ5b,EAAI92F,EAAG,IAC/B+iD,EAAG0vD,EAAQ,IAAKC,EAAQ5b,EAAI/zC,EAAG,IAC/BpnC,EAAG82F,EAAQ,IAAKC,EAAQ5b,EAAIn7E,EAAG,IAC/BD,EAAGA,EAEX,CAtUc04F,CAAW1b,GACrBt3F,KAAKizG,eAAiB3b,EACtBt3F,KAAKkzG,GAAKxd,EAAI92F,EACdoB,KAAKmzG,GAAKzd,EAAI/zC,EACd3hD,KAAKozG,GAAK1d,EAAIn7E,EACdva,KAAK29F,GAAKjI,EAAIp7E,EACdta,KAAKqzG,QAAUjC,EAAU,IAAIpxG,KAAK29F,IAAM,IACxC39F,KAAKszG,QAAU7B,EAAKxnB,QAAUyL,EAAIzL,OAClCjqF,KAAKuzG,cAAgB9B,EAAK+B,aAMtBxzG,KAAKkzG,GAAK,IAAKlzG,KAAKkzG,GAAK9B,EAAUpxG,KAAKkzG,KACxClzG,KAAKmzG,GAAK,IAAKnzG,KAAKmzG,GAAK/B,EAAUpxG,KAAKmzG,KACxCnzG,KAAKozG,GAAK,IAAKpzG,KAAKozG,GAAKhC,EAAUpxG,KAAKozG,KAE5CpzG,KAAKu/F,IAAM7J,EAAIgc,GACf1xG,KAAKyzG,OAAStC,GAClB,CA4UA,SAASuC,EAAS90G,EAAG+iD,EAAGpnC,GAEpB3b,EAAI4zG,EAAQ5zG,EAAG,KACf+iD,EAAI6wD,EAAQ7wD,EAAG,KACfpnC,EAAIi4F,EAAQj4F,EAAG,KAEf,IACI6C,EAAGuS,EADHjc,EAAM49F,EAAQ1yG,EAAG+iD,EAAGpnC,GAAI5F,EAAM08F,EAAQzyG,EAAG+iD,EAAGpnC,GACtCilD,GAAK9rD,EAAMiB,GAAO,EAE5B,GAAGjB,GAAOiB,EACNyI,EAAIuS,EAAI,MAEP,CACD,IAAInuB,EAAIkS,EAAMiB,EAEd,OADAgb,EAAI6vC,EAAI,GAAMh+D,GAAK,EAAIkS,EAAMiB,GAAOnT,GAAKkS,EAAMiB,GACxCjB,GACH,KAAK9U,EAAGwe,GAAKukC,EAAIpnC,GAAK/Y,GAAKmgD,EAAIpnC,EAAI,EAAI,GAAI,MAC3C,KAAKonC,EAAGvkC,GAAK7C,EAAI3b,GAAK4C,EAAI,EAAG,MAC7B,KAAK+Y,EAAG6C,GAAKxe,EAAI+iD,GAAKngD,EAAI,EAG9B4b,GAAK,CACT,CAEA,MAAO,CAAEA,EAAGA,EAAGuS,EAAGA,EAAG6vC,EAAGA,EAC5B,CAwCA,SAASm0C,EAAS/0G,EAAG+iD,EAAGpnC,GAEpB3b,EAAI4zG,EAAQ5zG,EAAG,KACf+iD,EAAI6wD,EAAQ7wD,EAAG,KACfpnC,EAAIi4F,EAAQj4F,EAAG,KAEf,IACI6C,EAAGuS,EADHjc,EAAM49F,EAAQ1yG,EAAG+iD,EAAGpnC,GAAI5F,EAAM08F,EAAQzyG,EAAG+iD,EAAGpnC,GACtChF,EAAI7B,EAEVlS,EAAIkS,EAAMiB,EAGd,GAFAgb,EAAY,IAARjc,EAAY,EAAIlS,EAAIkS,EAErBA,GAAOiB,EACNyI,EAAI,MAEH,CACD,OAAO1J,GACH,KAAK9U,EAAGwe,GAAKukC,EAAIpnC,GAAK/Y,GAAKmgD,EAAIpnC,EAAI,EAAI,GAAI,MAC3C,KAAKonC,EAAGvkC,GAAK7C,EAAI3b,GAAK4C,EAAI,EAAG,MAC7B,KAAK+Y,EAAG6C,GAAKxe,EAAI+iD,GAAKngD,EAAI,EAE9B4b,GAAK,CACT,CACA,MAAO,CAAEA,EAAGA,EAAGuS,EAAGA,EAAGpa,EAAGA,EAC5B,CA6BA,SAASq+F,EAASh1G,EAAG+iD,EAAGpnC,EAAGs5F,GAEvB,IAAI7X,EAAM,CACN8X,EAAK1C,EAAUxyG,GAAGiY,SAAS,KAC3Bi9F,EAAK1C,EAAUzvD,GAAG9qC,SAAS,KAC3Bi9F,EAAK1C,EAAU72F,GAAG1D,SAAS,MAI/B,OAAIg9F,GAAc7X,EAAI,GAAGmD,OAAO,IAAMnD,EAAI,GAAGmD,OAAO,IAAMnD,EAAI,GAAGmD,OAAO,IAAMnD,EAAI,GAAGmD,OAAO,IAAMnD,EAAI,GAAGmD,OAAO,IAAMnD,EAAI,GAAGmD,OAAO,GACzHnD,EAAI,GAAGmD,OAAO,GAAKnD,EAAI,GAAGmD,OAAO,GAAKnD,EAAI,GAAGmD,OAAO,GAGxDnD,EAAI7yF,KAAK,GACpB,CA0BA,SAAS4qG,EAAcn1G,EAAG+iD,EAAGpnC,EAAGD,GAS5B,MAPU,CACNw5F,EAAKE,EAAoB15F,IACzBw5F,EAAK1C,EAAUxyG,GAAGiY,SAAS,KAC3Bi9F,EAAK1C,EAAUzvD,GAAG9qC,SAAS,KAC3Bi9F,EAAK1C,EAAU72F,GAAG1D,SAAS,MAGpB1N,KAAK,GACpB,CAuBA,SAAS8qG,EAAW3c,EAAO7gE,GACvBA,EAAqB,IAAXA,EAAgB,EAAKA,GAAU,GACzC,IAAI4+D,EAAMmc,EAAUla,GAAOwH,QAG3B,OAFAzJ,EAAI1lE,GAAK8G,EAAS,IAClB4+D,EAAI1lE,EAAIukF,EAAQ7e,EAAI1lE,GACb6hF,EAAUnc,EACrB,CAEA,SAAS8e,EAAS7c,EAAO7gE,GACrBA,EAAqB,IAAXA,EAAgB,EAAKA,GAAU,GACzC,IAAI4+D,EAAMmc,EAAUla,GAAOwH,QAG3B,OAFAzJ,EAAI1lE,GAAK8G,EAAS,IAClB4+D,EAAI1lE,EAAIukF,EAAQ7e,EAAI1lE,GACb6hF,EAAUnc,EACrB,CAEA,SAAS+e,EAAU9c,GACf,OAAOka,EAAUla,GAAO2c,WAAW,IACvC,CAEA,SAASI,EAAS/c,EAAO7gE,GACrBA,EAAqB,IAAXA,EAAgB,EAAKA,GAAU,GACzC,IAAI4+D,EAAMmc,EAAUla,GAAOwH,QAG3B,OAFAzJ,EAAI71B,GAAK/oC,EAAS,IAClB4+D,EAAI71B,EAAI00C,EAAQ7e,EAAI71B,GACbgyC,EAAUnc,EACrB,CAEA,SAASif,EAAShd,EAAO7gE,GACrBA,EAAqB,IAAXA,EAAgB,EAAKA,GAAU,GACzC,IAAIi/D,EAAM8b,EAAUla,GAAO0H,QAI3B,OAHAtJ,EAAI92F,EAAI0yG,EAAQ,EAAGD,EAAQ,IAAK3b,EAAI92F,EAAIwyG,GAAmB36E,EAAS,IAAlB,OAClDi/D,EAAI/zC,EAAI2vD,EAAQ,EAAGD,EAAQ,IAAK3b,EAAI/zC,EAAIyvD,GAAmB36E,EAAS,IAAlB,OAClDi/D,EAAIn7E,EAAI+2F,EAAQ,EAAGD,EAAQ,IAAK3b,EAAIn7E,EAAI62F,GAAmB36E,EAAS,IAAlB,OAC3C+6E,EAAU9b,EACrB,CAEA,SAAS6e,EAAQjd,EAAO7gE,GACpBA,EAAqB,IAAXA,EAAgB,EAAKA,GAAU,GACzC,IAAI4+D,EAAMmc,EAAUla,GAAOwH,QAG3B,OAFAzJ,EAAI71B,GAAK/oC,EAAS,IAClB4+D,EAAI71B,EAAI00C,EAAQ7e,EAAI71B,GACbgyC,EAAUnc,EACrB,CAIA,SAASmf,EAAKld,EAAO7gE,GACjB,IAAI4+D,EAAMmc,EAAUla,GAAOwH,QACvBvF,GAAOlE,EAAIj4E,EAAIqZ,GAAU,IAE7B,OADA4+D,EAAIj4E,EAAIm8E,EAAM,EAAI,IAAMA,EAAMA,EACvBiY,EAAUnc,EACrB,CAOA,SAASof,EAAWnd,GAChB,IAAIjC,EAAMmc,EAAUla,GAAOwH,QAE3B,OADAzJ,EAAIj4E,GAAKi4E,EAAIj4E,EAAI,KAAO,IACjBo0F,EAAUnc,EACrB,CAEA,SAASqf,EAAMpd,GACX,IAAIjC,EAAMmc,EAAUla,GAAOwH,QACvB1hF,EAAIi4E,EAAIj4E,EACZ,MAAO,CACHo0F,EAAUla,GACVka,EAAU,CAAEp0F,GAAIA,EAAI,KAAO,IAAKuS,EAAG0lE,EAAI1lE,EAAG6vC,EAAG61B,EAAI71B,IACjDgyC,EAAU,CAAEp0F,GAAIA,EAAI,KAAO,IAAKuS,EAAG0lE,EAAI1lE,EAAG6vC,EAAG61B,EAAI71B,IAEzD,CAEA,SAASm1C,EAAOrd,GACZ,IAAIjC,EAAMmc,EAAUla,GAAOwH,QACvB1hF,EAAIi4E,EAAIj4E,EACZ,MAAO,CACHo0F,EAAUla,GACVka,EAAU,CAAEp0F,GAAIA,EAAI,IAAM,IAAKuS,EAAG0lE,EAAI1lE,EAAG6vC,EAAG61B,EAAI71B,IAChDgyC,EAAU,CAAEp0F,GAAIA,EAAI,KAAO,IAAKuS,EAAG0lE,EAAI1lE,EAAG6vC,EAAG61B,EAAI71B,IACjDgyC,EAAU,CAAEp0F,GAAIA,EAAI,KAAO,IAAKuS,EAAG0lE,EAAI1lE,EAAG6vC,EAAG61B,EAAI71B,IAEzD,CAEA,SAASo1C,EAAgBtd,GACrB,IAAIjC,EAAMmc,EAAUla,GAAOwH,QACvB1hF,EAAIi4E,EAAIj4E,EACZ,MAAO,CACHo0F,EAAUla,GACVka,EAAU,CAAEp0F,GAAIA,EAAI,IAAM,IAAKuS,EAAG0lE,EAAI1lE,EAAG6vC,EAAG61B,EAAI71B,IAChDgyC,EAAU,CAAEp0F,GAAIA,EAAI,KAAO,IAAKuS,EAAG0lE,EAAI1lE,EAAG6vC,EAAG61B,EAAI71B,IAEzD,CAEA,SAASq1C,EAAUvd,EAAOxnB,EAASglC,GAC/BhlC,EAAUA,GAAW,EACrBglC,EAASA,GAAU,GAEnB,IAAIzf,EAAMmc,EAAUla,GAAOwH,QACvBiW,EAAO,IAAMD,EACb5tB,EAAM,CAACsqB,EAAUla,IAErB,IAAKjC,EAAIj4E,GAAMi4E,EAAIj4E,GAAK23F,EAAOjlC,GAAW,GAAM,KAAO,MAAOA,GAC1DulB,EAAIj4E,GAAKi4E,EAAIj4E,EAAI23F,GAAQ,IACzB7tB,EAAInjF,KAAKytG,EAAUnc,IAEvB,OAAOnO,CACX,CAEA,SAAS8tB,EAAc1d,EAAOxnB,GAC1BA,EAAUA,GAAW,EAMrB,IALA,IAAI4qB,EAAM8W,EAAUla,GAAOyH,QACvB3hF,EAAIs9E,EAAIt9E,EAAGuS,EAAI+qE,EAAI/qE,EAAGpa,EAAImlF,EAAInlF,EAC9B2xE,EAAM,GACN+tB,EAAe,EAAInlC,EAEhBA,KACHoX,EAAInjF,KAAKytG,EAAU,CAAEp0F,EAAGA,EAAGuS,EAAGA,EAAGpa,EAAGA,KACpCA,GAAKA,EAAI0/F,GAAgB,EAG7B,OAAO/tB,CACX,CAroBAsqB,EAAU5xG,UAAY,CAClBs1G,OAAQ,WACJ,OAAOl1G,KAAKm1G,gBAAkB,GAClC,EACAC,QAAS,WACL,OAAQp1G,KAAKk1G,QACjB,EACA9V,QAAS,WACL,OAAOp/F,KAAKu/F,GAChB,EACA8V,iBAAkB,WAChB,OAAOr1G,KAAKizG,cACd,EACAqC,UAAW,WACP,OAAOt1G,KAAKszG,OAChB,EACAiC,SAAU,WACN,OAAOv1G,KAAK29F,EAChB,EACAwX,cAAe,WAEX,IAAIzf,EAAM11F,KAAKg/F,QACf,OAAgB,IAARtJ,EAAI92F,EAAkB,IAAR82F,EAAI/zC,EAAkB,IAAR+zC,EAAIn7E,GAAW,GACvD,EACAi7F,aAAc,WAEV,IACIC,EAAOC,EAAOC,EADdjgB,EAAM11F,KAAKg/F,QASf,OAPAyW,EAAQ/f,EAAI92F,EAAE,IACd82G,EAAQhgB,EAAI/zC,EAAE,IACdg0D,EAAQjgB,EAAIn7E,EAAE,IAKN,OAHJk7F,GAAS,OAAcA,EAAQ,MAAkBhiG,EAAKs4D,KAAM0pC,EAAQ,MAAS,MAAQ,MAGlE,OAFnBC,GAAS,OAAcA,EAAQ,MAAkBjiG,EAAKs4D,KAAM2pC,EAAQ,MAAS,MAAQ,MAEnD,OADlCC,GAAS,OAAcA,EAAQ,MAAkBliG,EAAKs4D,KAAM4pC,EAAQ,MAAS,MAAQ,KAE7F,EACAC,SAAU,SAASxkG,GAGf,OAFApR,KAAK29F,GAAKoV,EAAW3hG,GACrBpR,KAAKqzG,QAAUjC,EAAU,IAAIpxG,KAAK29F,IAAM,IACjC39F,IACX,EACA++F,MAAO,WACH,IAAIrE,EAAMiZ,EAAS3zG,KAAKkzG,GAAIlzG,KAAKmzG,GAAInzG,KAAKozG,IAC1C,MAAO,CAAEh2F,EAAW,IAARs9E,EAAIt9E,EAASuS,EAAG+qE,EAAI/qE,EAAGpa,EAAGmlF,EAAInlF,EAAG+E,EAAGta,KAAK29F,GACzD,EACAkY,YAAa,WACT,IAAInb,EAAMiZ,EAAS3zG,KAAKkzG,GAAIlzG,KAAKmzG,GAAInzG,KAAKozG,IACtCh2F,EAAIg0F,EAAkB,IAAR1W,EAAIt9E,GAAUuS,EAAIyhF,EAAkB,IAAR1W,EAAI/qE,GAAUpa,EAAI67F,EAAkB,IAAR1W,EAAInlF,GAC9E,OAAmB,GAAXvV,KAAK29F,GACX,OAAUvgF,EAAI,KAAOuS,EAAI,MAAQpa,EAAI,KACrC,QAAU6H,EAAI,KAAOuS,EAAI,MAAQpa,EAAI,MAAOvV,KAAKqzG,QAAU,GACjE,EACAvU,MAAO,WACH,IAAIzJ,EAAMqe,EAAS1zG,KAAKkzG,GAAIlzG,KAAKmzG,GAAInzG,KAAKozG,IAC1C,MAAO,CAAEh2F,EAAW,IAARi4E,EAAIj4E,EAASuS,EAAG0lE,EAAI1lE,EAAG6vC,EAAG61B,EAAI71B,EAAGllD,EAAGta,KAAK29F,GACzD,EACAmY,YAAa,WACT,IAAIzgB,EAAMqe,EAAS1zG,KAAKkzG,GAAIlzG,KAAKmzG,GAAInzG,KAAKozG,IACtCh2F,EAAIg0F,EAAkB,IAAR/b,EAAIj4E,GAAUuS,EAAIyhF,EAAkB,IAAR/b,EAAI1lE,GAAU6vC,EAAI4xC,EAAkB,IAAR/b,EAAI71B,GAC9E,OAAmB,GAAXx/D,KAAK29F,GACX,OAAUvgF,EAAI,KAAOuS,EAAI,MAAQ6vC,EAAI,KACrC,QAAUpiD,EAAI,KAAOuS,EAAI,MAAQ6vC,EAAI,MAAOx/D,KAAKqzG,QAAU,GACjE,EACApU,MAAO,SAAS4U,GACZ,OAAOD,EAAS5zG,KAAKkzG,GAAIlzG,KAAKmzG,GAAInzG,KAAKozG,GAAIS,EAC/C,EACAkC,YAAa,SAASlC,GAClB,MAAO,IAAM7zG,KAAKi/F,MAAM4U,EAC5B,EACAmC,OAAQ,SAASC,GACb,OA6YR,SAAmBr3G,EAAG+iD,EAAGpnC,EAAGD,EAAG27F,GAE3B,IAAIja,EAAM,CACN8X,EAAK1C,EAAUxyG,GAAGiY,SAAS,KAC3Bi9F,EAAK1C,EAAUzvD,GAAG9qC,SAAS,KAC3Bi9F,EAAK1C,EAAU72F,GAAG1D,SAAS,KAC3Bi9F,EAAKE,EAAoB15F,KAI7B,GAAI27F,GAAcja,EAAI,GAAGmD,OAAO,IAAMnD,EAAI,GAAGmD,OAAO,IAAMnD,EAAI,GAAGmD,OAAO,IAAMnD,EAAI,GAAGmD,OAAO,IAAMnD,EAAI,GAAGmD,OAAO,IAAMnD,EAAI,GAAGmD,OAAO,IAAMnD,EAAI,GAAGmD,OAAO,IAAMnD,EAAI,GAAGmD,OAAO,GACxK,OAAOnD,EAAI,GAAGmD,OAAO,GAAKnD,EAAI,GAAGmD,OAAO,GAAKnD,EAAI,GAAGmD,OAAO,GAAKnD,EAAI,GAAGmD,OAAO,GAGlF,OAAOnD,EAAI7yF,KAAK,GACpB,CA5Ze+sG,CAAUl2G,KAAKkzG,GAAIlzG,KAAKmzG,GAAInzG,KAAKozG,GAAIpzG,KAAK29F,GAAIsY,EACzD,EACAE,aAAc,SAASF,GACnB,MAAO,IAAMj2G,KAAKg2G,OAAOC,EAC7B,EACAjX,MAAO,WACH,MAAO,CAAEpgG,EAAGwyG,EAAUpxG,KAAKkzG,IAAKvxD,EAAGyvD,EAAUpxG,KAAKmzG,IAAK54F,EAAG62F,EAAUpxG,KAAKozG,IAAK94F,EAAGta,KAAK29F,GAC1F,EACAyY,YAAa,WACT,OAAmB,GAAXp2G,KAAK29F,GACX,OAAUyT,EAAUpxG,KAAKkzG,IAAM,KAAO9B,EAAUpxG,KAAKmzG,IAAM,KAAO/B,EAAUpxG,KAAKozG,IAAM,IACvF,QAAUhC,EAAUpxG,KAAKkzG,IAAM,KAAO9B,EAAUpxG,KAAKmzG,IAAM,KAAO/B,EAAUpxG,KAAKozG,IAAM,KAAOpzG,KAAKqzG,QAAU,GACnH,EACAgD,gBAAiB,WACb,MAAO,CAAEz3G,EAAGwyG,EAAkC,IAAxBoB,EAAQxyG,KAAKkzG,GAAI,MAAc,IAAKvxD,EAAGyvD,EAAkC,IAAxBoB,EAAQxyG,KAAKmzG,GAAI,MAAc,IAAK54F,EAAG62F,EAAkC,IAAxBoB,EAAQxyG,KAAKozG,GAAI,MAAc,IAAK94F,EAAGta,KAAK29F,GACxK,EACA2Y,sBAAuB,WACnB,OAAmB,GAAXt2G,KAAK29F,GACX,OAAUyT,EAAkC,IAAxBoB,EAAQxyG,KAAKkzG,GAAI,MAAc,MAAQ9B,EAAkC,IAAxBoB,EAAQxyG,KAAKmzG,GAAI,MAAc,MAAQ/B,EAAkC,IAAxBoB,EAAQxyG,KAAKozG,GAAI,MAAc,KACrJ,QAAUhC,EAAkC,IAAxBoB,EAAQxyG,KAAKkzG,GAAI,MAAc,MAAQ9B,EAAkC,IAAxBoB,EAAQxyG,KAAKmzG,GAAI,MAAc,MAAQ/B,EAAkC,IAAxBoB,EAAQxyG,KAAKozG,GAAI,MAAc,MAAQpzG,KAAKqzG,QAAU,GAClL,EACAkD,OAAQ,WACJ,OAAgB,IAAZv2G,KAAK29F,GACE,gBAGP39F,KAAK29F,GAAK,KAIP6Y,EAAS5C,EAAS5zG,KAAKkzG,GAAIlzG,KAAKmzG,GAAInzG,KAAKozG,IAAI,MAAU,EAClE,EACAqD,SAAU,SAASC,GACf,IAAIC,EAAa,IAAM5C,EAAc/zG,KAAKkzG,GAAIlzG,KAAKmzG,GAAInzG,KAAKozG,GAAIpzG,KAAK29F,IACjEiZ,EAAmBD,EACnBnD,EAAexzG,KAAKuzG,cAAgB,qBAAuB,GAE/D,GAAImD,EAAa,CACb,IAAI/mF,EAAI6hF,EAAUkF,GAClBE,EAAmB,IAAM7C,EAAcpkF,EAAEujF,GAAIvjF,EAAEwjF,GAAIxjF,EAAEyjF,GAAIzjF,EAAEguE,GAC/D,CAEA,MAAO,8CAA8C6V,EAAa,iBAAiBmD,EAAW,gBAAgBC,EAAiB,GACnI,EACA//F,SAAU,SAASozE,GACf,IAAI4sB,IAAc5sB,EAClBA,EAASA,GAAUjqF,KAAKszG,QAExB,IAAIwD,GAAkB,EAClBC,EAAW/2G,KAAK29F,GAAK,GAAK39F,KAAK29F,IAAM,EAGzC,OAFwBkZ,IAAaE,GAAwB,QAAX9sB,GAA+B,SAAXA,GAAgC,SAAXA,GAAgC,SAAXA,GAAgC,SAAXA,GAAgC,SAAXA,GAU3I,QAAXA,IACA6sB,EAAkB92G,KAAKo2G,eAEZ,SAAXnsB,IACA6sB,EAAkB92G,KAAKs2G,yBAEZ,QAAXrsB,GAA+B,SAAXA,IACpB6sB,EAAkB92G,KAAK+1G,eAEZ,SAAX9rB,IACA6sB,EAAkB92G,KAAK+1G,aAAY,IAExB,SAAX9rB,IACA6sB,EAAkB92G,KAAKm2G,cAAa,IAEzB,SAAXlsB,IACA6sB,EAAkB92G,KAAKm2G,gBAEZ,SAAXlsB,IACA6sB,EAAkB92G,KAAKu2G,UAEZ,QAAXtsB,IACA6sB,EAAkB92G,KAAK81G,eAEZ,QAAX7rB,IACA6sB,EAAkB92G,KAAK61G,eAGpBiB,GAAmB92G,KAAK+1G,eAjCZ,SAAX9rB,GAAiC,IAAZjqF,KAAK29F,GACnB39F,KAAKu2G,SAETv2G,KAAKo2G,aA+BpB,EACAl8B,MAAO,WACH,OAAOs3B,EAAUxxG,KAAK6W,WAC1B,EAEAmgG,mBAAoB,SAAShvG,EAAIH,GAC7B,IAAIyvF,EAAQtvF,EAAGjI,MAAM,KAAM,CAACC,MAAMiI,OAAO,GAAG6C,MAAMhL,KAAK+H,KAKvD,OAJA7H,KAAKkzG,GAAK5b,EAAM4b,GAChBlzG,KAAKmzG,GAAK7b,EAAM6b,GAChBnzG,KAAKozG,GAAK9b,EAAM8b,GAChBpzG,KAAK41G,SAASte,EAAMqG,IACb39F,IACX,EACAq0G,QAAS,WACL,OAAOr0G,KAAKg3G,mBAAmB3C,EAASj1G,UAC5C,EACAk1G,SAAU,WACN,OAAOt0G,KAAKg3G,mBAAmB1C,EAAUl1G,UAC7C,EACAm1G,OAAQ,WACJ,OAAOv0G,KAAKg3G,mBAAmBzC,EAAQn1G,UAC3C,EACA60G,WAAY,WACR,OAAOj0G,KAAKg3G,mBAAmB/C,EAAY70G,UAC/C,EACA+0G,SAAU,WACN,OAAOn0G,KAAKg3G,mBAAmB7C,EAAU/0G,UAC7C,EACAg1G,UAAW,WACP,OAAOp0G,KAAKg3G,mBAAmB5C,EAAWh1G,UAC9C,EACAo1G,KAAM,WACF,OAAOx0G,KAAKg3G,mBAAmBxC,EAAMp1G,UACzC,EAEA63G,kBAAmB,SAASjvG,EAAIH,GAC5B,OAAOG,EAAGjI,MAAM,KAAM,CAACC,MAAMiI,OAAO,GAAG6C,MAAMhL,KAAK+H,IACtD,EACAgtG,UAAW,WACP,OAAO70G,KAAKi3G,kBAAkBpC,EAAWz1G,UAC7C,EACAq1G,WAAY,WACR,OAAOz0G,KAAKi3G,kBAAkBxC,EAAYr1G,UAC9C,EACA41G,cAAe,WACX,OAAOh1G,KAAKi3G,kBAAkBjC,EAAe51G,UACjD,EACAw1G,gBAAiB,WACb,OAAO50G,KAAKi3G,kBAAkBrC,EAAiBx1G,UACnD,EACAs1G,MAAO,WACH,OAAO10G,KAAKi3G,kBAAkBvC,EAAOt1G,UACzC,EACAu1G,OAAQ,WACJ,OAAO30G,KAAKi3G,kBAAkBtC,EAAQv1G,UAC1C,GAKJoyG,EAAU0F,UAAY,SAAS5f,EAAOma,GAClC,GAAoB,iBAATna,EAAmB,CAC1B,IAAI6f,EAAW,CAAC,EAChB,IAAK,IAAI13G,KAAK63F,EACNA,EAAMz3F,eAAeJ,KAEjB03G,EAAS13G,GADH,MAANA,EACc63F,EAAM73F,GAGNgzG,EAAoBnb,EAAM73F,KAIpD63F,EAAQ6f,CACZ,CAEA,OAAO3F,EAAUla,EAAOma,EAC5B,EAyQAD,EAAUp3F,OAAS,SAAUg9F,EAAQC,GACjC,SAAKD,IAAWC,IACT7F,EAAU4F,GAAQhB,eAAiB5E,EAAU6F,GAAQjB,aAChE,EAEA5E,EAAUvlC,OAAS,WACf,OAAOulC,EAAU0F,UAAU,CACvBt4G,EAAG2yG,IACH5vD,EAAG4vD,IACHh3F,EAAGg3F,KAEX,EAyIAC,EAAU8F,IAAM,SAASF,EAAQC,EAAQ5gF,GACrCA,EAAqB,IAAXA,EAAgB,EAAKA,GAAU,GAEzC,IAAI8gF,EAAO/F,EAAU4F,GAAQpY,QACzBwY,EAAOhG,EAAU6F,GAAQrY,QAEzBn5F,EAAI4wB,EAAS,IASjB,OAAO+6E,EAPI,CACP5yG,GAAK44G,EAAK54G,EAAI24G,EAAK34G,GAAKiH,EAAK0xG,EAAK34G,EAClC+iD,GAAK61D,EAAK71D,EAAI41D,EAAK51D,GAAK97C,EAAK0xG,EAAK51D,EAClCpnC,GAAKi9F,EAAKj9F,EAAIg9F,EAAKh9F,GAAK1U,EAAK0xG,EAAKh9F,EAClCD,GAAKk9F,EAAKl9F,EAAIi9F,EAAKj9F,GAAKzU,EAAK0xG,EAAKj9F,GAI1C,EASAk3F,EAAUiG,YAAc,SAASL,EAAQC,GACrC,IAAIxZ,EAAK2T,EAAU4F,GACftZ,EAAK0T,EAAU6F,GACnB,OAAQ5jG,EAAKC,IAAImqF,EAAG2X,eAAe1X,EAAG0X,gBAAgB,MAAS/hG,EAAKkB,IAAIkpF,EAAG2X,eAAe1X,EAAG0X,gBAAgB,IACjH,EAYAhE,EAAUkG,WAAa,SAASN,EAAQC,EAAQM,GAC5C,IACIC,EAAYC,EADZJ,EAAcjG,EAAUiG,YAAYL,EAAQC,GAMhD,OAHAQ,GAAM,GAEND,EAkaJ,SAA4BE,GAGxB,IAAI5vF,EAAO/b,EAEX+b,IADA4vF,EAAQA,GAAS,CAAC,MAAQ,KAAM,KAAO,UACxB5vF,OAAS,MAAM2hB,cAC9B19B,GAAQ2rG,EAAM3rG,MAAQ,SAASg1B,cACjB,OAAVjZ,GAA4B,QAAVA,IAClBA,EAAQ,MAEC,UAAT/b,GAA6B,UAATA,IACpBA,EAAO,SAEX,MAAO,CAAC,MAAQ+b,EAAO,KAAO/b,EAClC,CAhbiB4rG,CAAmBJ,IACbzvF,MAAQ0vF,EAAWzrG,MAClC,IAAK,UACL,IAAK,WACD0rG,EAAMJ,GAAe,IACrB,MACJ,IAAK,UACDI,EAAMJ,GAAe,EACrB,MACJ,IAAK,WACDI,EAAMJ,GAAe,EAG7B,OAAOI,CAEX,EAWArG,EAAUwG,aAAe,SAASC,EAAWC,EAAWrwG,GACpD,IAEI4vG,EACAU,EAAuBjwF,EAAO/b,EAH9BisG,EAAY,KACZC,EAAY,EAIhBF,GADAtwG,EAAOA,GAAQ,CAAC,GACaswG,sBAC7BjwF,EAAQrgB,EAAKqgB,MACb/b,EAAOtE,EAAKsE,KAEZ,IAAK,IAAI1M,EAAG,EAAGA,EAAIy4G,EAAU/4G,OAASM,KAClCg4G,EAAcjG,EAAUiG,YAAYQ,EAAWC,EAAUz4G,KACvC44G,IACdA,EAAYZ,EACZW,EAAY5G,EAAU0G,EAAUz4G,KAIxC,OAAI+xG,EAAUkG,WAAWO,EAAWG,EAAW,CAAC,MAAQlwF,EAAM,KAAO/b,MAAWgsG,EACrEC,GAGPvwG,EAAKswG,uBAAsB,EACpB3G,EAAUwG,aAAaC,EAAU,CAAC,OAAQ,QAAQpwG,GAEjE,EAMA,IAAIopB,EAAQugF,EAAUvgF,MAAQ,CAC1BqnF,UAAW,SACXC,aAAc,SACdC,KAAM,MACNC,WAAY,SACZC,MAAO,SACPC,MAAO,SACPC,OAAQ,SACRpe,MAAO,MACPqe,eAAgB,SAChBC,KAAM,MACNC,WAAY,SACZC,MAAO,SACPC,UAAW,SACXC,YAAa,SACbC,UAAW,SACXC,WAAY,SACZC,UAAW,SACXC,MAAO,SACPC,eAAgB,SAChBC,SAAU,SACVC,QAAS,SACTC,KAAM,MACNC,SAAU,SACVC,SAAU,SACVC,cAAe,SACfC,SAAU,SACVC,UAAW,SACXC,SAAU,SACVC,UAAW,SACXC,YAAa,SACbC,eAAgB,SAChBC,WAAY,SACZC,WAAY,SACZC,QAAS,SACTC,WAAY,SACZC,aAAc,SACdC,cAAe,SACfC,cAAe,SACfC,cAAe,SACfC,cAAe,SACfC,WAAY,SACZC,SAAU,SACVC,YAAa,SACbC,QAAS,SACTC,QAAS,SACTC,WAAY,SACZC,UAAW,SACXC,YAAa,SACbC,YAAa,SACbC,QAAS,MACTC,UAAW,SACXC,WAAY,SACZC,KAAM,SACNC,UAAW,SACXC,KAAM,SACNC,MAAO,SACPC,YAAa,SACb7kB,KAAM,SACN8kB,SAAU,SACVC,QAAS,SACTC,UAAW,SACXC,OAAQ,SACRC,MAAO,SACPC,MAAO,SACPC,SAAU,SACVC,cAAe,SACfC,UAAW,SACXC,aAAc,SACdC,UAAW,SACXC,WAAY,SACZC,UAAW,SACXC,qBAAsB,SACtBC,UAAW,SACXC,WAAY,SACZC,UAAW,SACXC,UAAW,SACXC,YAAa,SACbC,cAAe,SACfC,aAAc,SACdC,eAAgB,MAChBC,eAAgB,MAChBC,eAAgB,SAChBC,YAAa,SACbC,KAAM,MACNC,UAAW,SACXC,MAAO,SACPC,QAAS,MACTC,OAAQ,SACRC,iBAAkB,SAClBC,WAAY,SACZC,aAAc,SACdC,aAAc,SACdC,eAAgB,SAChBC,gBAAiB,SACjBC,kBAAmB,SACnBC,gBAAiB,SACjBC,gBAAiB,SACjBC,aAAc,SACdC,UAAW,SACXC,UAAW,SACXC,SAAU,SACVC,YAAa,SACbC,KAAM,SACNC,QAAS,SACTC,MAAO,SACPC,UAAW,SACXC,OAAQ,SACRC,UAAW,SACXC,OAAQ,SACRC,cAAe,SACfC,UAAW,SACXC,cAAe,SACfC,cAAe,SACfC,WAAY,SACZC,UAAW,SACXC,KAAM,SACNC,KAAM,SACNC,KAAM,SACNC,WAAY,SACZC,OAAQ,SACRC,cAAe,SACfrhB,IAAK,MACLshB,UAAW,SACXC,UAAW,SACXC,YAAa,SACbC,OAAQ,SACRC,WAAY,SACZC,SAAU,SACVC,SAAU,SACVC,OAAQ,SACRC,OAAQ,SACRC,QAAS,SACTC,UAAW,SACXC,UAAW,SACXC,UAAW,SACXC,KAAM,SACNC,YAAa,SACbC,UAAW,SACXC,IAAK,SACLC,KAAM,SACNC,QAAS,SACTC,OAAQ,SACRC,UAAW,SACXC,OAAQ,SACRC,MAAO,SACPpqB,MAAO,MACPqqB,WAAY,SACZC,OAAQ,MACRC,YAAa,UAIb9K,EAAWhF,EAAUgF,SAOzB,SAAc5wG,GACV,IAAIgV,EAAU,CAAE,EAChB,IAAK,IAAInb,KAAKmG,EACNA,EAAE/F,eAAeJ,KACjBmb,EAAQhV,EAAEnG,IAAMA,GAGxB,OAAOmb,CACX,CAfoCyQ,CAAK4F,GAkBzC,SAAS8hF,EAAWz4F,GAOhB,OANAA,EAAIinG,WAAWjnG,IAEX0xD,MAAM1xD,IAAMA,EAAI,GAAKA,EAAI,KACzBA,EAAI,GAGDA,CACX,CAGA,SAASk4F,EAAQxzG,EAAG0U,IAgCpB,SAAwB1U,GACpB,MAAmB,iBAALA,IAAoC,GAAnBA,EAAEoH,QAAQ,MAAgC,IAAlBm7G,WAAWviH,EACtE,EAjCQwiH,CAAexiH,KAAMA,EAAI,QAE7B,IAAIyiH,EAkCR,SAAsBziH,GAClB,MAAoB,kBAANA,IAAqC,GAAnBA,EAAEoH,QAAQ,IAC9C,CApCyBs7G,CAAa1iH,GASlC,OARAA,EAAIqyG,EAAQ39F,EAAK49F,EAAQ,EAAGiQ,WAAWviH,KAGnCyiH,IACAziH,EAAI+wC,SAAS/wC,EAAI0U,EAAK,IAAM,KAI3BD,EAAKkI,IAAI3c,EAAI0U,GAAO,KACd,EAIH1U,EAAI0U,EAAO6tG,WAAW7tG,EAClC,CAGA,SAASwgG,EAAQ53F,GACb,OAAO+0F,EAAQ,EAAGC,EAAQ,EAAGh1F,GACjC,CAGA,SAAS21F,EAAgB31F,GACrB,OAAOyzB,SAASzzB,EAAK,GACzB,CAcA,SAASw3F,EAAK92F,GACV,OAAmB,GAAZA,EAAE7d,OAAc,IAAM6d,EAAI,GAAKA,CAC1C,CAGA,SAASy1F,EAAoBzzG,GAKzB,OAJIA,GAAK,IACLA,EAAS,IAAJA,EAAW,KAGbA,CACX,CAGA,SAASg1G,EAAoBxyG,GACzB,OAAOiS,EAAKy0E,MAAsB,IAAhBq5B,WAAW//G,IAAUqV,SAAS,GACpD,CAEA,SAASq7F,EAAoB90F,GACzB,OAAQ60F,EAAgB70F,GAAK,GACjC,CAEA,IASQukG,EAKAC,EACAC,EAfJjQ,GAcIgQ,EAAoB,eALpBD,EAAW,8CAKoC,aAAeA,EAAW,aAAeA,EAAW,YACnGE,EAAoB,cAAgBF,EAAW,aAAeA,EAAW,aAAeA,EAAW,aAAeA,EAAW,YAE1H,CACHA,SAAU,IAAI5vD,OAAO4vD,GACrBjsB,IAAK,IAAI3jC,OAAO,MAAQ6vD,GACxB/P,KAAM,IAAI9/C,OAAO,OAAS8vD,GAC1BxsB,IAAK,IAAItjC,OAAO,MAAQ6vD,GACxB9P,KAAM,IAAI//C,OAAO,OAAS8vD,GAC1BnnB,IAAK,IAAI3oC,OAAO,MAAQ6vD,GACxB7P,KAAM,IAAIhgD,OAAO,OAAS8vD,GAC1BxP,KAAM,uDACNF,KAAM,uDACNC,KAAM,uEACNJ,KAAM,yEAOd,SAASO,EAAejb,GACpB,QAASsa,EAAS+P,SAASxvD,KAAKmlC,EACpC,CA+FqCxmF,EAAOC,QACxCD,EAAOC,QAAUygG,OAIqB,KAAtC,aAAoB,OAAOA,CAAW,+BAOzC,CAtqCD,CAsqCG/9F,K,qBCrqCF,SAAU0Y,GACP,aAEA,IAGI21F,EAAY,sGAEhB,SAASC,EAAiBrkG,EAAQunB,EAASthC,GACvC,OAAIA,EAAQxE,SAAWue,EAAOve,QAAW8lC,EAAQ+8E,SAGjDr+G,GAAWshC,EAAQ+8E,SAFRr+G,CAIf,CAWA,SAASs+G,EAASvkG,EAAQwkG,EAAWj9E,GACjC,IAGIx8B,EACAkC,EAJAhH,EAAU,GACVuuD,GAAU,EACViwD,EAAkBD,EAOtB,IAHAj9E,EAAUA,GAAW,CAAC,GACd+8E,SAAwC,qBAArB/8E,EAAQ+8E,SA9BT,SA8B+D/8E,EAAQ+8E,UAE5FtkG,GAA4B,IAAlBA,EAAOve,OAClB,MAAO,GAIX,IADA+yD,GAAU,EACHA,GAAS,CAIZ,GAHA4vD,EAAUr8B,UAAY9hF,EAAQxE,SAC9B+yD,EAAU4vD,EAAU3vD,KAAKz0C,KAERw0C,EAAQvnD,MAAQhH,EAAQxE,QAAWgjH,GAAmBL,EAAUr8B,WAAcy8B,EAAY,IAEvG,OADAv+G,GAAW+Z,EAAO2jE,UAAU19E,EAAQxE,OAAQ+iH,GACrCH,EAAiBrkG,EAAQunB,EAASthC,GAQ7C,GALA8E,EAASypD,EAAQ,GACjBvnD,EAAQunD,EAAQvnD,MAChBhH,GAAW+Z,EAAO2jE,UAAU19E,EAAQxE,OAAQwL,EAAQlC,EAAOtJ,SAC3DgjH,GAAmBx3G,EAAQlC,EAAOtJ,SAEX,EACnB,KAER,CAEA,OAAO4iH,EAAiBrkG,EAAQunB,EAASthC,EAC7C,CAEqCmN,EAAOC,QACxCD,EAAOC,QAAUkxG,EAEjB91F,EAAQ81F,SAAWA,CAE3B,CAnEA,CAmEElhF,O,wBCxEF,OAUA,SAAWka,EAAQvyC,GAEf,aAOA,IAGI05G,EAAc,WACdC,EAAc,YACdC,EAAc,SACdC,EAAc,SAEdC,EAAc,QACdC,EAAc,OACdC,EAAc,OACdC,EAAc,SACdC,EAAc,UACdC,EAAc,eACdC,EAAc,UACdC,EAAc,SACdC,EAAc,SACdC,EAAc,UACdC,EAAc,WACdC,EAAc,WAGdC,EAAU,SACVC,EAAU,QACVC,EAAU,OACVC,EAAa,aACbC,EAAU,UACVC,EAAU,SAEVC,EAAU,UACVC,EAAU,SACVC,EAAU,SACVC,EAAU,KACVC,EAAY,YACZC,EAAY,WACZC,EAAU,QACVC,EAAU,UACVC,EAAU,QACVC,EAAU,OACVC,EAAU,SACVC,EAAU,QACVC,EAAa,WAiBbC,EAAY,SAAUhxG,GAElB,IADA,IAAIixG,EAAQ,CAAC,EACJ/kH,EAAE,EAAGA,EAAE8T,EAAIpU,OAAQM,IACxB+kH,EAAMjxG,EAAI9T,GAAGoqC,eAAiBt2B,EAAI9T,GAEtC,OAAO+kH,CACX,EACAxiH,EAAM,SAAUyiH,EAAMC,GAClB,cAAcD,IAASlC,IAAuD,IAA5CoC,EAASD,GAAMt+G,QAAQu+G,EAASF,GACtE,EACAE,EAAW,SAAUtlC,GACjB,OAAOA,EAAIl+C,aACf,EAIAgF,EAAO,SAAUk5C,EAAK7rE,GAClB,UAAU,IAAU+uG,EAEhB,OADAljC,EAAMA,EAAIn+C,QAAQ,SA3EZ,WA4EO,IAAUmhF,EAAahjC,EAAMA,EAAIgC,UAAU,EAzDhD,IA2DpB,EAMIujC,EAAY,SAAUC,EAAIC,GAKtB,IAHA,IAAWv+B,EAAGjxE,EAAGzP,EAAG6sG,EAAGxgD,EAASotB,EAA5B7/E,EAAI,EAGDA,EAAIqlH,EAAO3lH,SAAW+yD,GAAS,CAElC,IAAI6yD,EAAQD,EAAOrlH,GACfY,EAAQykH,EAAOrlH,EAAI,GAIvB,IAHA8mF,EAAIjxE,EAAI,EAGDixE,EAAIw+B,EAAM5lH,SAAW+yD,GAIxB,GAFAA,EAAU6yD,EAAMx+B,KAAKp0B,KAAK0yD,GAGtB,IAAKh/G,EAAI,EAAGA,EAAIxF,EAAMlB,OAAQ0G,IAC1By5E,EAAQptB,IAAU58C,UAClBo9F,EAAIryG,EAAMwF,MAEOy8G,GAAY5P,EAAEvzG,OAAS,EACnB,IAAbuzG,EAAEvzG,cACSuzG,EAAE,IAAM0P,EAEfpiH,KAAK0yG,EAAE,IAAMA,EAAE,GAAG5yG,KAAKE,KAAMs/E,GAG7Bt/E,KAAK0yG,EAAE,IAAMA,EAAE,GAEC,IAAbA,EAAEvzG,cAEEuzG,EAAE,KAAO0P,GAAe1P,EAAE,GAAGvgD,MAAQugD,EAAE,GAAG5xE,KAKjD9gC,KAAK0yG,EAAE,IAAMpzB,EAAQA,EAAMp+C,QAAQwxE,EAAE,GAAIA,EAAE,IAAMhqG,EAHjD1I,KAAK0yG,EAAE,IAAMpzB,EAAQozB,EAAE,GAAG5yG,KAAKE,KAAMs/E,EAAOozB,EAAE,IAAMhqG,EAKpC,IAAbgqG,EAAEvzG,SACLa,KAAK0yG,EAAE,IAAMpzB,EAAQozB,EAAE,GAAG5yG,KAAKE,KAAMs/E,EAAMp+C,QAAQwxE,EAAE,GAAIA,EAAE,KAAOhqG,GAG1E1I,KAAK0yG,GAAKpzB,GAAgB52E,EAK1CjJ,GAAK,CACT,CACJ,EAEAulH,EAAY,SAAU3lC,EAAK7zE,GAEvB,IAAK,IAAI/L,KAAK+L,EAEV,UAAWA,EAAI/L,KAAO6iH,GAAY92G,EAAI/L,GAAGN,OAAS,GAC9C,IAAK,IAAIonF,EAAI,EAAGA,EAAI/6E,EAAI/L,GAAGN,OAAQonF,IAC/B,GAAIvkF,EAAIwJ,EAAI/L,GAAG8mF,GAAIlH,GACf,MA9IN,MA8Ic5/E,EAAiBiJ,EAAYjJ,OAG1C,GAAIuC,EAAIwJ,EAAI/L,GAAI4/E,GACnB,MAlJE,MAkJM5/E,EAAiBiJ,EAAYjJ,EAG7C,OAAO4/E,CACf,EAiBI4lC,EAAoB,CAChB,GAAc,OACd,UAAc,SACd,SAAc,QACd,IAAc,SACd,GAAc,CAAC,SAAU,UACzB,MAAc,SACd,EAAc,SACd,EAAc,SACd,IAAc,SACd,GAAc,CAAC,SAAU,WACzB,GAAc,OAOlBC,EAAU,CAEV3hC,QAAU,CAAC,CAEP,gCACG,CAACq/B,EAAS,CAACH,EAAM,WAAY,CAChC,+BACG,CAACG,EAAS,CAACH,EAAM,SAAU,CAG9B,4BACA,mDACA,2CACG,CAACA,EAAMG,GAAU,CACpB,yBACG,CAACA,EAAS,CAACH,EAAMuB,EAAM,UAAW,CACrC,qBACG,CAACpB,EAAS,CAACH,EAAMuB,IAAS,CAG7B,uBACA,8DAEA,qDACA,kCACA,2BAGA,+LAEA,uBACG,CAACvB,EAAMG,GAAU,CACpB,qDACG,CAACA,EAAS,CAACH,EAAM,KAAKe,IAAW,CACpC,+BACA,gCACG,CAACZ,EAAS,CAACH,EAAM,wBAAyB,CAC7C,8BACG,CAACG,EAAS,CAACH,EAAM,WAAY,CAChC,yBACG,CAACG,EAAS,CAACH,EAAM,cAAe,CACnC,+CACG,CAACG,EAAS,CAACH,EAAM,OAAQ,CAC5B,yBACG,CAACG,EAAS,CAACH,EAAM,WAAY,CAChC,2BACG,CAAC,CAACA,EAAM,OAAQ,aAAae,GAAUZ,GAAU,CACpD,uBACG,CAACA,EAAS,CAACH,EAAMiB,EAAQ,WAAY,CACxC,qBACG,CAACd,EAAS,CAACH,EAAMuB,EAAM,WAAY,CACtC,0BACG,CAACpB,EAAS,CAACH,EAAM,YAAa,CACjC,sBACG,CAACG,EAAS,CAACH,EAAM,YAAa,CACjC,qBACG,CAACG,EAAS,CAACH,EAAMuB,EAAM,WAAY,CACtC,2BACG,CAACpB,EAAS,CAACH,EAAM,QAAQe,IAAW,CACvC,sBACG,CAACZ,EAAS,CAACH,EAAMiB,IAAW,CAC/B,iCACG,CAAC,CAACjB,EAAM,OAAOe,IAAW,CAC7B,uDACG,CAAC,CAACf,EAAM,OAAQ,MAAMe,GAAUZ,GAAU,CAC7C,+BACG,CAAC,CAACH,EAAM,KAAM,KAAMG,GAAU,CACjC,gCACA,iDACA,0DACG,CAACH,EAAMG,GAAU,CACpB,2BACA,eACA,sBACG,CAACH,GAAO,CAGX,+DACG,CAAC,CAACA,EAAM6B,GAAW1B,GAAU,CAChC,4BACA,4BACA,wCACG,CAACH,EAAMG,GAAU,CACpB,gCACG,CAACA,EAAS,CAACH,EAAM,QAAS,CAE7B,oCACG,CAACG,EAAS,CAACH,EAAMgB,EAAO,cAAe,CAE1C,+BACG,CAAC,CAAChB,EAAMgB,EAAO,YAAab,GAAU,CAEzC,2DACG,CAACA,EAAS,CAACH,EAAM,WAAWe,IAAW,CAE1C,+DACG,CAACf,EAAMG,GAAU,CAEpB,gDACG,CAACA,EAAS,CAACH,EAAM,kBAAmB,CACvC,sDACG,CAACG,EAASH,GAAO,CACpB,gDACG,CAACA,EAAM,CAACG,EAASoC,EAnIT,CACX,MAAU,KACV,IAAU,KACV,IAAU,KACV,MAAU,OACV,QAAU,OACV,QAAU,OACV,QAAU,OACV,IAAU,OA2HqC,CAE/C,8BACG,CAACvC,EAAMG,GAAU,CAGpB,wCACG,CAAC,CAACH,EAAM,YAAaG,GAAU,CAClC,uCACG,CAACA,EAAS,CAACH,EAAMiB,EAAQ,aAAc,CAC1C,6BACA,cACA,mGAEA,+FAEA,wBACA,2CAGA,wHAEA,wBACG,CAACjB,EAAMG,GAAU,CAEpB,wBACG,CAACH,EAAM,CAACG,EAAS,eAAgB,MAGxCn/B,IAAM,CAAC,CAEH,iDACG,CAAC,CAACo/B,EAAc,UAAW,CAE9B,gBACG,CAAC,CAACA,EAAc8B,IAAY,CAE/B,0BACG,CAAC,CAAC9B,EAAc,SAAU,CAE7B,oCACG,CAAC,CAACA,EAAc,UAAW,CAE9B,mCACG,CAAC,CAACA,EAAc,UAAW,CAG9B,8BACG,CAAC,CAACA,EAAc,QAAS,CAE5B,0CACG,CAAC,CAACA,EAAc,OApVT,GAoVwB8B,IAAY,CAE9C,kBACG,CAAC,CAAC9B,EAAc,UAAW,CAE9B,2HAEG,CAAC,CAACA,EAAc8B,KAGvB9gC,OAAS,CAAC,CAQN,mFACG,CAAC2+B,EAAO,CAACG,EAAQsB,GAAU,CAACvB,EAAMM,IAAU,CAC/C,0CACA,uBACA,iBACG,CAACR,EAAO,CAACG,EAAQsB,GAAU,CAACvB,EAAMK,IAAU,CAG/C,6BACG,CAACP,EAAO,CAACG,EAAQU,GAAQ,CAACX,EAAMK,IAAU,CAC7C,6BACA,oCACA,kCACG,CAACP,EAAO,CAACG,EAAQU,GAAQ,CAACX,EAAMM,IAAU,CAC7C,iBACG,CAACR,EAAO,CAACG,EAAQU,IAAS,CAG7B,+DACG,CAACb,EAAO,CAACG,EAAQiB,GAAS,CAAClB,EAAMM,IAAU,CAC9C,kCACA,sEACG,CAACR,EAAO,CAACG,EAAQiB,GAAS,CAAClB,EAAMK,IAAU,CAG9C,6BACA,yBACA,uCACA,iDACA,yGACG,CAAC,CAACP,EAAO,KAAM,KAAM,CAACG,EAAQyB,GAAS,CAAC1B,EAAMK,IAAU,CAC3D,8CACE,CAAC,CAACP,EAAO,KAAM,KAAM,CAACG,EAAQyB,GAAS,CAAC1B,EAAMM,IAAU,CAG1D,sBACA,mEACG,CAACR,EAAO,CAACG,EAAQ,QAAS,CAACD,EAAMK,IAAU,CAG9C,yBACA,oCACG,CAACP,EAAO,CAACG,EAAQ,QAAS,CAACD,EAAMK,IAAU,CAG9C,kCACG,CAACP,EAAO,CAACG,EAAQ,UAAW,CAACD,EAAMK,IAAU,CAGhD,iFACA,4BACA,sDACG,CAACP,EAAO,CAACG,EAAQoB,GAAW,CAACrB,EAAMK,IAAU,CAChD,qCACG,CAACP,EAAO,CAACG,EAAQoB,GAAW,CAACrB,EAAMM,IAAU,CAGhD,iEACG,CAACR,EAAO,CAACG,EAAQkB,GAAK,CAACnB,EAAMM,IAAU,CAC1C,sDACA,oDACA,wBACG,CAACR,EAAO,CAACG,EAAQkB,GAAK,CAACnB,EAAMK,IAAU,CAG1C,oBACA,qEACG,CAACP,EAAO,CAACG,EAAQ,UAAW,CAACD,EAAMM,IAAU,CAGhD,qCACA,0BACG,CAAC,CAACR,EAAO,KAAM,KAAM,CAACG,EAAQ,SAAU,CAACD,EAAMK,IAAU,CAG5D,gBACG,CAACP,EAAO,CAACG,EAAQgB,GAAS,CAACjB,EAAMM,IAAU,CAC9C,6CACG,CAACR,EAAO,CAACG,EAAQgB,GAAS,CAACjB,EAAMK,IAAU,CAG9C,0GACG,CAACP,EAAO,CAACG,EAAQwB,GAAO,CAACzB,EAAMK,IAAU,CAC5C,oBACA,iCACG,CAAC,CAACP,EAAO,iBAAkB,CAACG,EAAQwB,GAAO,CAACzB,EAAMM,IAAU,CAG/D,sCACA,0CACG,CAACR,EAAO,CAACG,EAAQ,WAAY,CAACD,EAAMK,IAAU,CAGjD,eACA,2BACA,gCACG,CAACP,EAAO,CAACG,EAAQS,GAAS,CAACV,EAAMM,IAAU,CAC9C,iDACG,CAAC,CAACR,EAAO,QAAS,iBAAkB,CAACG,EAAQS,GAAS,CAACV,EAAMK,IAAU,CAG1E,gCACG,CAACP,EAAOG,EAAQ,CAACD,EAAMM,IAAU,CACpC,gCACA,kBACG,CAACR,EAAO,CAACG,EAAQY,GAAa,CAACb,EAAMK,IAAU,CAGlD,qFACG,CAACP,EAAO,CAACG,EAAQW,GAAO,CAACZ,EAAMM,IAAU,CAC5C,iDACG,CAACR,EAAO,CAACG,EAAQW,GAAO,CAACZ,EAAMK,IAAU,CAG5C,cACG,CAACP,EAAO,CAACG,EAAQ,OAAQ,CAACD,EAAMM,IAAU,CAC7C,2CAGA,oCACA,qEACG,CAACL,EAAQ,CAACH,EAAO,KAAM,KAAM,CAACE,EAAMK,IAAU,CAGjD,uCACG,CAACP,EAAO,CAACG,EAAQ,QAAS,CAACD,EAAMM,IAAU,CAG9C,8BACA,qBACG,CAACR,EAAO,CAACG,EAAQ,SAAU,CAACD,EAAMK,IAAU,CAG/C,iCACG,CAACP,EAAO,CAACG,EAAQuB,GAAQ,CAACxB,EAAMK,IAAU,CAG7C,kGAEA,mBACA,iBACA,8BACA,0BACA,WACA,yBACG,CAACJ,EAAQH,EAAO,CAACE,EAAMK,IAAU,CAEpC,wBACA,uCACA,uBACA,4BACA,iCACA,kCACA,8BACA,gCACA,mCACG,CAACJ,EAAQH,EAAO,CAACE,EAAMM,IAAU,CAEpC,kBACG,CAACR,EAAO,CAACG,EAAQmB,GAAY,CAACpB,EAAMM,IAAU,CACjD,qCACG,CAACR,EAAO,CAACG,EAAQ,aAAc,CAACD,EAAMK,IAAU,CACnD,aACG,CAACP,EAAO,CAACG,EAAQ,QAAS,CAACD,EAAMK,IAAU,CAC9C,gBACG,CAACP,EAAO,CAACG,EAAQ,WAAY,CAACD,EAAMK,IAAU,CACjD,iBACG,CAACP,EAAO,CAACG,EAAQ,OAAQ,CAACD,EAAMM,IAAU,CAC7C,0BACG,CAACR,EAAO,CAACG,EAAQ,QAAS,CAACD,EAAMM,IAAU,CAC9C,wBACG,CAACR,EAAO,CAACG,EAAQ,WAAY,CAACD,EAAMM,IAAU,CACjD,+CACG,CAACR,EAAO,CAACG,EAAQ,kBAAmB,CAACD,EAAMM,IAAU,CACxD,qBACG,CAACR,EAAO,CAACG,EAAQ,YAAa,CAACD,EAAMM,IAAU,CAClD,cACG,CAACR,EAAO,CAACG,EAAQ,OAAQ,CAACD,EAAMM,IAAU,CAC7C,mBACG,CAACR,EAAO,CAACG,EAAQ,OAAQ,CAACD,EAAMK,IAAU,CAC7C,wBACG,CAACP,EAAO,CAACG,EAAQ,SAAU,CAACD,EAAMK,IAAU,CAC/C,mBACG,CAACP,EAAO,CAACG,EAAQ,SAAU,CAACD,EAAMM,IAAU,CAC/C,wBACG,CAACR,EAAO,CAACG,EAAQ,QAAS,CAACD,EAAMM,IAAU,CAC9C,mBACA,sCACG,CAAC,CAACL,EAAQ,gBAAiBH,EAAO,CAACE,EAAMM,IAAU,CACtD,sBACG,CAACR,EAAO,CAACG,EAAQ,YAAa,CAACD,EAAMM,IAAU,CAClD,8BACG,CAACR,EAAO,CAACG,EAAQ,YAAa,CAACD,EAAMM,IAAU,CAClD,oDACG,CAAC,CAACL,EAAQ,SAAUH,EAAO,CAACE,EAAMK,IAAU,CAC/C,2BACG,CAAC,CAACJ,EAAQ,SAAUH,EAAO,CAACE,EAAMK,IAAU,CAC/C,cACG,CAACP,EAAO,CAACG,EAAQ,aAAc,CAACD,EAAMK,IAAU,CACnD,uCACG,CAACP,EAAO,CAACG,EAAQ,WAAY,CAACD,EAAMM,IAAU,CACjD,wBACG,CAACR,EAAO,CAACG,EAAQ,aAAc,CAACD,EAAMM,IAAU,CACnD,kBACG,CAACR,EAAO,CAACG,EAAQ,SAAU,CAACD,EAAMM,IAAU,CAC/C,qBACG,CAACR,EAAO,CAACG,EAAQ,UAAW,CAACD,EAAMM,IAAU,CAChD,mBACG,CAACL,EAAQH,EAAO,CAACE,EAAMK,IAAU,CACpC,sBACG,CAAC,CAACP,EAAO,MAAO,KAAM,CAACG,EAAQmB,GAAY,CAACpB,EAAMK,IAAU,CAC/D,yDACG,CAACP,EAAO,CAACG,EAAQ0B,GAAQ,CAAC3B,EAAMM,IAAU,CAC7C,yCACG,CAACR,EAAO,CAACG,EAAQ0B,GAAQ,CAAC3B,EAAMK,IAAU,CAM7C,UACA,8BACG,CAACJ,EAAQH,EAAO,CAACE,EAAMI,IAAW,CACrC,0BACG,CAACN,EAAO,CAACG,EAAQ,UAAW,CAACD,EAAMI,IAAW,CACjD,mCACG,CAACN,EAAO,CAACG,EAAQwB,GAAO,CAACzB,EAAMI,IAAW,CAC7C,sCACG,CAACN,EAAO,CAACG,EAAQmB,GAAY,CAACpB,EAAMI,IAAW,CAMlD,wBACG,CAACH,EAAQ,CAACD,EAAMO,IAAW,CAC9B,uBACG,CAAC,CAACT,EAAO,IAAK,WAAY,CAACG,EAAQsB,GAAU,CAACvB,EAAMO,IAAW,CAClE,8DACG,CAAC,CAACN,EAAQkB,GAAK,CAACnB,EAAMO,IAAW,CACpC,gBACG,CAACN,EAAQ,CAACH,EAAOa,EAAM,OAAQ,CAACX,EAAMO,IAAW,CACpD,UACG,CAAC,CAACT,EAAOiB,EAAO,QAAS,CAACd,EAAQgB,GAAS,CAACjB,EAAMO,IAAW,CAChE,4BACG,CAACT,EAAO,CAACG,EAAQS,GAAS,CAACV,EAAMO,IAAW,CAC/C,uBACA,uBACG,CAACT,EAAO,CAACG,EAAQuB,GAAQ,CAACxB,EAAMO,IAAU,CAC7C,4BACG,CAACT,EAAO,CAACG,EAAQwB,GAAO,CAACzB,EAAMO,IAAW,CAC7C,qBACG,CAACT,EAAO,CAACG,EAAQyB,GAAS,CAAC1B,EAAMO,IAAW,CAC/C,0CACA,uDACG,CAAC,CAACN,EAAQx8E,GAAO,CAACq8E,EAAOr8E,GAAO,CAACu8E,EAAMO,IAAW,CACrD,mDACG,CAAC,CAACP,EAAMO,IAAW,CAMtB,kBACG,CAACN,EAAQH,EAAO,CAACE,EAAMQ,IAAY,CACtC,wBACG,CAACV,EAAO,CAACG,EAAQgB,GAAS,CAACjB,EAAMQ,IAAY,CAChD,6BACG,CAACV,EAAO,CAACG,EAAQ0B,GAAQ,CAAC3B,EAAMQ,IAAY,CAC/C,iBACG,CAACV,EAAO,CAACG,EAAQ2B,GAAW,CAAC5B,EAAMQ,IAAY,CAMlD,wCACG,CAACP,EAAQ,CAACD,EAAMS,IAAY,CAM/B,2DACG,CAACX,EAAO,CAACE,EAAMK,IAAU,CAC5B,+DACG,CAACP,EAAO,CAACE,EAAMM,IAAU,CAC5B,gDACG,CAAC,CAACN,EAAMM,IAAU,CACrB,kEACG,CAAC,CAACN,EAAMK,IAAU,CACrB,kCACG,CAACP,EAAO,CAACG,EAAQ,aAGxB5+B,OAAS,CAAC,CAEN,8BACG,CAAC6+B,EAAS,CAACH,EAAM0C,aAAe,CAEnC,6CACG,CAACvC,EAAS,CAACH,EAAM,UAAW,CAE/B,uBACA,sEACA,0BACA,yCACA,+BACG,CAACA,EAAMG,GAAU,CAEpB,iCACG,CAACA,EAASH,IAGjBz+B,GAAK,CAAC,CAGF,mCACG,CAACy+B,EAAMG,GAAU,CACpB,4BACA,wDACA,8CACG,CAACH,EAAM,CAACG,EAASoC,EAAWC,IAAqB,CACpD,sCACG,CAAC,CAACxC,EAAM,WAAY,CAACG,EAASoC,EAAWC,IAAqB,CAGjE,sDACA,wBACG,CAAC,CAACrC,EAAS,KAAM,KAAM,CAACH,EAAM,QAAS,CAC1C,0BACA,yCACG,CAAC,CAACA,EAAM,UAAW,CAACG,EAAS,KAAM,MAAO,CAG7C,kDACG,CAACA,EAASH,GAAO,CACpB,+EACA,8BACA,+BACA,kBACG,CAACA,EAAMG,GAAU,CACpB,cACG,CAACA,EAAS,CAACH,EAAMc,IAAc,CAClC,6DACG,CAACX,EAAS,CAACH,EAAM,YAAa,CACjC,mFACG,CAACG,EAAS,CAACH,EAAMiB,EAAQ,QAAS,CACrC,kBACA,wCACG,CAACd,EAAS,CAACH,EAAM,UAAW,CAG/B,qBACG,CAACG,EAAS,CAACH,EAAMgB,EAAO,SAAU,CACrC,6BACG,CAAC,CAAChB,EAAM,eAAgBG,GAAS,CAGpC,mDACA,2BAGA,wCACA,yBACA,4BACA,8SAEA,2BACA,oBACA,6EACA,kBACG,CAACH,EAAMG,GAAU,CACpB,yBACG,CAAC,CAACH,EAAM,WAAYG,GAAU,CACjC,sCACA,kCACA,wDACA,sBACG,CAACH,EAAMG,KAQd7/B,EAAW,SAAU8hC,EAAIO,GAOzB,UALWP,IAAOvC,IACd8C,EAAaP,EACbA,EAAKn8G,KAGH1I,gBAAgB+iF,GAClB,OAAO,IAAIA,EAAS8hC,EAAIO,GAAYliC,YAGxC,IAAImiC,EAAMR,WAAe5pE,IAAWonE,GAAcpnE,EAAO0sC,WAAa1sC,EAAO0sC,UAAUC,UAAa3sC,EAAO0sC,UAAUC,UApvBvG,IAqvBV09B,EAAUF,EAvsBL,SAAUF,EAASE,GACxB,IAAIG,EAAgB,CAAC,EACrB,IAAK,IAAI9lH,KAAKylH,EACNE,EAAW3lH,IAAM2lH,EAAW3lH,GAAGN,OAAS,IAAM,EAC9ComH,EAAc9lH,GAAK2lH,EAAW3lH,GAAGwI,OAAOi9G,EAAQzlH,IAEhD8lH,EAAc9lH,GAAKylH,EAAQzlH,GAGnC,OAAO8lH,CACX,CA6rB2B9qC,CAAOyqC,EAASE,GAAcF,EAwDzD,OAtDAllH,KAAKwlH,WAAa,WACd,IAlrBiBzjC,EAkrBb0jC,EAAW,CAAC,EAKhB,OAJAA,EAAShD,GAAQ/5G,EACjB+8G,EAAS7C,GAAWl6G,EACpBk8G,EAAU9kH,KAAK2lH,EAAUJ,EAAKC,EAAQ/hC,SACtCkiC,EAASriC,aAtrBQrB,EAsrBS0jC,EAAS1jC,WArrBRwgC,EAAWxgC,EAAQ7gD,QAAQ,WAvE5C,IAuE+Dx2B,MAAM,KAAK,GAAKhC,EAsrBlF+8G,CACX,EACAzlH,KAAK0lH,OAAS,WACV,IAAIC,EAAO,CAAC,EAGZ,OAFAA,EAAK9C,GAAgBn6G,EACrBk8G,EAAU9kH,KAAK6lH,EAAMN,EAAKC,EAAQ7hC,KAC3BkiC,CACX,EACA3lH,KAAK4lH,UAAY,WACb,IAAIC,EAAU,CAAC,EAKf,OAJAA,EAAQlD,GAAUj6G,EAClBm9G,EAAQrD,GAAS95G,EACjBm9G,EAAQnD,GAAQh6G,EAChBk8G,EAAU9kH,KAAK+lH,EAASR,EAAKC,EAAQzhC,QAC9BgiC,CACX,EACA7lH,KAAK8lH,UAAY,WACb,IAAIC,EAAU,CAAC,EAIf,OAHAA,EAAQtD,GAAQ/5G,EAChBq9G,EAAQnD,GAAWl6G,EACnBk8G,EAAU9kH,KAAKimH,EAASV,EAAKC,EAAQvhC,QAC9BgiC,CACX,EACA/lH,KAAKgmH,MAAQ,WACT,IAAIC,EAAM,CAAC,EAIX,OAHAA,EAAIxD,GAAQ/5G,EACZu9G,EAAIrD,GAAWl6G,EACfk8G,EAAU9kH,KAAKmmH,EAAKZ,EAAKC,EAAQthC,IAC1BiiC,CACX,EACAjmH,KAAKkjF,UAAY,WACb,MAAO,CACH2hC,GAAU7kH,KAAKkmH,QACf3iC,QAAUvjF,KAAKwlH,aACfzhC,OAAU/jF,KAAK8lH,YACf9hC,GAAUhkF,KAAKgmH,QACfniC,OAAU7jF,KAAK4lH,YACfniC,IAAUzjF,KAAK0lH,SAEvB,EACA1lH,KAAKkmH,MAAQ,WACT,OAAOb,CACX,EACArlH,KAAKmmH,MAAQ,SAAUtB,GAEnB,OADAQ,SAAcR,IAAOtC,GAAYsC,EAAG1lH,OAtxBxB,IAsxBkDgnC,EAAK0+E,EAtxBvD,KAsxB4EA,EACjF7kH,IACX,EACAA,KAAKmmH,MAAMd,GACJrlH,IACX,EAEA+iF,EAAS6/B,QAjzBS,SAkzBlB7/B,EAASygC,QAAWe,EAAU,CAAC9B,EAAMG,EA3yBnB,UA4yBlB7/B,EAASqjC,IAAM7B,EAAU,CAAC1B,IAC1B9/B,EAASsjC,OAAS9B,EAAU,CAAC/B,EAAOG,EAAQD,EAAMI,EAASC,EAAQE,EAASD,EAAQE,EAAUC,IAC9FpgC,EAASujC,OAASvjC,EAASwjC,GAAKhC,EAAU,CAAC9B,EAAMG,WAOvC,IAAcP,GAEgBvxG,EAAOC,UACvCA,EAAUD,EAAOC,QAAUgyE,GAE/BhyE,EAAQgyE,SAAWA,GAGiB,QAChC,aACI,OAAOA,CACV,2CACa9nC,IAAWonE,IAEzBpnE,EAAO8nC,SAAWA,GAS1B,IAAIyjC,SAAWvrE,IAAWonE,IAAepnE,EAAOwrE,QAAUxrE,EAAOyrE,OACjE,GAAIF,IAAMA,EAAE3B,GAAI,CACZ,IAAI8B,EAAS,IAAI5jC,EACjByjC,EAAE3B,GAAK8B,EAAOzjC,YACdsjC,EAAE3B,GAAGh6G,IAAM,WACP,OAAO87G,EAAOT,OAClB,EACAM,EAAE3B,GAAG/1G,IAAM,SAAU+1G,GACjB8B,EAAOR,MAAMtB,GACb,IAAIp8G,EAASk+G,EAAOzjC,YACpB,IAAK,IAAIsQ,KAAQ/qF,EACb+9G,EAAE3B,GAAGrxB,GAAQ/qF,EAAO+qF,EAE5B,CACJ,CAEH,CA52BD,CA42BqB,kBAAXv4C,OAAsBA,OAASj7C,K","sources":["webpack://mobicheckin-server/./node_modules/@draft-js-plugins/buttons/node_modules/clsx/dist/clsx.m.js","webpack://mobicheckin-server/./node_modules/@draft-js-plugins/buttons/lib/index.esm.js","webpack://mobicheckin-server/./node_modules/@draft-js-plugins/editor/lib/index.esm.js","webpack://mobicheckin-server/./node_modules/@draft-js-plugins/editor/node_modules/immutable/dist/immutable.js","webpack://mobicheckin-server/./node_modules/@draft-js-plugins/utils/lib/index.esm.js","webpack://mobicheckin-server/./node_modules/@draft-js-plugins/static-toolbar/lib/index.esm.js","webpack://mobicheckin-server/./node_modules/clsx/dist/clsx.mjs","webpack://mobicheckin-server/./node_modules/draft-js-export-html/esm/helpers/combineOrderedStyles.js","webpack://mobicheckin-server/./node_modules/draft-js-export-html/esm/helpers/normalizeAttributes.js","webpack://mobicheckin-server/./node_modules/draft-js-export-html/esm/helpers/styleToCSS.js","webpack://mobicheckin-server/./node_modules/draft-js-utils/esm/Constants.js","webpack://mobicheckin-server/./node_modules/draft-js-utils/esm/getEntityRanges.js","webpack://mobicheckin-server/./node_modules/draft-js-export-html/esm/stateToHTML.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/AtomicBlockUtils.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/BlockMapBuilder.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/BlockTree.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/CharacterMetadata.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/CompositeDraftDecorator.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/ContentBlock.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/ContentBlockNode.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/ContentState.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/ContentStateInlineStyle.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DOMObserver.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DefaultDraftBlockRenderMap.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DefaultDraftInlineStyle.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/Draft.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditor.react.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditorBlock.react.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditorBlockNode.react.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditorCompositionHandler.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditorContents-core.react.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditorContents.react.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditorContentsExperimental.react.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditorDecoratedLeaves.react.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditorDragHandler.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditorEditHandler.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditorFlushControlled.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditorLeaf.react.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditorNode.react.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditorPlaceholder.react.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEditorTextNode.react.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEffects.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEntity.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEntityInstance.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftEntitySegments.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftJsDebugLogging.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftModifier.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftOffsetKey.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftPasteProcessor.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftRemovableWord.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftStringKey.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftTreeAdapter.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/DraftTreeInvariants.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/EditorBidiService.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/EditorState.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/KeyBindingUtil.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/RichTextEditorUtil.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/SecondaryClipboard.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/SelectionState.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/adjustBlockDepthForContentState.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/applyEntityToContentBlock.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/applyEntityToContentState.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/convertFromDraftStateToRaw.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/convertFromHTMLToContentBlocks.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/convertFromRawToDraftState.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/createCharacterList.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/decodeEntityRanges.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/decodeInlineStyleRanges.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/draftKeyUtils.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/editOnBeforeInput.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/editOnBlur.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/editOnCompositionStart.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/editOnCopy.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/editOnCut.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/editOnDragOver.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/editOnDragStart.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/editOnFocus.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/editOnInput.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/editOnKeyDown.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/editOnPaste.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/editOnSelect.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/encodeEntityRanges.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/encodeInlineStyleRanges.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/expandRangeToStartOfLine.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/findAncestorOffsetKey.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/findRangesImmutable.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/generateRandomKey.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getCharacterRemovalRange.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getContentEditableContainer.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getContentStateFragment.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getCorrectDocumentFromNode.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getDefaultKeyBinding.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getDraftEditorSelection.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getDraftEditorSelectionWithNodes.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getEntityKeyForSelection.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getFragmentFromSelection.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getNextDelimiterBlockKey.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getOwnObjectValues.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getRangeBoundingClientRect.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getRangeClientRects.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getRangesForDraftEntity.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getSafeBodyFromHTML.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getSelectionOffsetKeyForNode.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getTextContentFromFiles.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getUpdatedSelectionState.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getVisibleSelectionRect.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/getWindowForNode.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/gkx.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/insertFragmentIntoContentState.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/insertIntoList.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/insertTextIntoContentState.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/isElement.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/isEventHandled.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/isHTMLAnchorElement.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/isHTMLBRElement.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/isHTMLElement.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/isHTMLImageElement.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/isInstanceOfNode.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/isSelectionAtLeafStart.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/isSoftNewlineEvent.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/keyCommandBackspaceToStartOfLine.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/keyCommandBackspaceWord.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/keyCommandDeleteWord.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/keyCommandInsertNewline.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/keyCommandMoveSelectionToEndOfBlock.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/keyCommandMoveSelectionToStartOfBlock.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/keyCommandPlainBackspace.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/keyCommandPlainDelete.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/keyCommandTransposeCharacters.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/keyCommandUndo.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/modifyBlockForContentState.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/moveBlockInContentState.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/moveSelectionBackward.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/moveSelectionForward.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/randomizeBlockMapKeys.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/removeEntitiesAtEdges.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/removeRangeFromContentState.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/removeTextWithStrategy.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/sanitizeDraftText.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/setDraftEditorSelection.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/splitBlockInContentState.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/splitTextIntoTextBlocks.js","webpack://mobicheckin-server/./node_modules/draft-js/lib/uuid.js","webpack://mobicheckin-server/./node_modules/draft-js/node_modules/immutable/dist/immutable.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/DataTransfer.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/Keys.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/PhotosMimeType.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/Scroll.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/Style.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/TokenizeUtil.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/URI.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/UnicodeBidi.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/UnicodeBidiDirection.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/UnicodeBidiService.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/UnicodeUtils.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/UserAgent.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/UserAgentData.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/VersionRange.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/camelize.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/containsNode.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/createArrayFromMixed.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/cx.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/emptyFunction.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/getActiveElement.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/getDocumentScrollElement.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/getElementPosition.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/getElementRect.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/getScrollPosition.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/getStyleProperty.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/getUnboundedScrollPosition.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/getViewportDimensions.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/hyphenate.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/invariant.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/isNode.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/isTextNode.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/joinClasses.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/mapObject.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/memoizeStringOnly.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/nullthrows.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/setImmediate.js","webpack://mobicheckin-server/./node_modules/fbjs/lib/warning.js","webpack://mobicheckin-server/./node_modules/immutable/dist/immutable.js","webpack://mobicheckin-server/./node_modules/lodash/_arrayEach.js","webpack://mobicheckin-server/./node_modules/lodash/_baseAssign.js","webpack://mobicheckin-server/./node_modules/lodash/_baseAssignIn.js","webpack://mobicheckin-server/./node_modules/lodash/_baseClone.js","webpack://mobicheckin-server/./node_modules/lodash/_baseEach.js","webpack://mobicheckin-server/./node_modules/lodash/_baseIndexOfWith.js","webpack://mobicheckin-server/./node_modules/lodash/_baseIsMap.js","webpack://mobicheckin-server/./node_modules/lodash/_baseIsSet.js","webpack://mobicheckin-server/./node_modules/lodash/_baseMap.js","webpack://mobicheckin-server/./node_modules/lodash/_baseOrderBy.js","webpack://mobicheckin-server/./node_modules/lodash/_basePullAll.js","webpack://mobicheckin-server/./node_modules/lodash/_baseReduce.js","webpack://mobicheckin-server/./node_modules/lodash/_baseSortBy.js","webpack://mobicheckin-server/./node_modules/lodash/_baseValues.js","webpack://mobicheckin-server/./node_modules/lodash/_castFunction.js","webpack://mobicheckin-server/./node_modules/lodash/_cloneDataView.js","webpack://mobicheckin-server/./node_modules/lodash/_cloneRegExp.js","webpack://mobicheckin-server/./node_modules/lodash/_cloneSymbol.js","webpack://mobicheckin-server/./node_modules/lodash/_compareAscending.js","webpack://mobicheckin-server/./node_modules/lodash/_compareMultiple.js","webpack://mobicheckin-server/./node_modules/lodash/_copySymbols.js","webpack://mobicheckin-server/./node_modules/lodash/_copySymbolsIn.js","webpack://mobicheckin-server/./node_modules/lodash/_createBaseEach.js","webpack://mobicheckin-server/./node_modules/lodash/_getAllKeysIn.js","webpack://mobicheckin-server/./node_modules/lodash/_getSymbolsIn.js","webpack://mobicheckin-server/./node_modules/lodash/_initCloneArray.js","webpack://mobicheckin-server/./node_modules/lodash/_initCloneByTag.js","webpack://mobicheckin-server/./node_modules/lodash/cloneDeep.js","webpack://mobicheckin-server/./node_modules/lodash/compact.js","webpack://mobicheckin-server/./node_modules/lodash/debounce.js","webpack://mobicheckin-server/./node_modules/lodash/each.js","webpack://mobicheckin-server/./node_modules/lodash/forEach.js","webpack://mobicheckin-server/./node_modules/lodash/forOwn.js","webpack://mobicheckin-server/./node_modules/lodash/includes.js","webpack://mobicheckin-server/./node_modules/lodash/isMap.js","webpack://mobicheckin-server/./node_modules/lodash/isSet.js","webpack://mobicheckin-server/./node_modules/lodash/isString.js","webpack://mobicheckin-server/./node_modules/lodash/map.js","webpack://mobicheckin-server/./node_modules/lodash/now.js","webpack://mobicheckin-server/./node_modules/lodash/orderBy.js","webpack://mobicheckin-server/./node_modules/lodash/pull.js","webpack://mobicheckin-server/./node_modules/lodash/pullAll.js","webpack://mobicheckin-server/./node_modules/lodash/reduce.js","webpack://mobicheckin-server/./node_modules/lodash/throttle.js","webpack://mobicheckin-server/./node_modules/lodash/toInteger.js","webpack://mobicheckin-server/./node_modules/lodash/values.js","webpack://mobicheckin-server/./node_modules/querystring/decode.js","webpack://mobicheckin-server/./node_modules/querystring/encode.js","webpack://mobicheckin-server/./node_modules/querystring/index.js","webpack://mobicheckin-server/./node_modules/react-color/lib/components/common/Alpha.js","webpack://mobicheckin-server/./node_modules/react-color/lib/components/common/Checkboard.js","webpack://mobicheckin-server/./node_modules/react-color/lib/components/common/ColorWrap.js","webpack://mobicheckin-server/./node_modules/react-color/lib/components/common/EditableInput.js","webpack://mobicheckin-server/./node_modules/react-color/lib/components/common/Hue.js","webpack://mobicheckin-server/./node_modules/react-color/lib/components/common/Raised.js","webpack://mobicheckin-server/./node_modules/react-color/lib/components/common/Saturation.js","webpack://mobicheckin-server/./node_modules/react-color/lib/components/common/Swatch.js","webpack://mobicheckin-server/./node_modules/react-color/lib/components/common/index.js","webpack://mobicheckin-server/./node_modules/react-color/lib/components/sketch/SketchFields.js","webpack://mobicheckin-server/./node_modules/react-color/lib/components/sketch/SketchPresetColors.js","webpack://mobicheckin-server/./node_modules/react-color/lib/helpers/alpha.js","webpack://mobicheckin-server/./node_modules/react-color/lib/helpers/checkboard.js","webpack://mobicheckin-server/./node_modules/react-color/lib/helpers/color.js","webpack://mobicheckin-server/./node_modules/react-color/lib/helpers/hue.js","webpack://mobicheckin-server/./node_modules/react-color/lib/helpers/interaction.js","webpack://mobicheckin-server/./node_modules/react-color/lib/helpers/saturation.js","webpack://mobicheckin-server/./node_modules/react-redux/es/components/Context.js","webpack://mobicheckin-server/./node_modules/react-redux/es/utils/batch.js","webpack://mobicheckin-server/./node_modules/react-redux/es/utils/Subscription.js","webpack://mobicheckin-server/./node_modules/react-redux/es/utils/useIsomorphicLayoutEffect.js","webpack://mobicheckin-server/./node_modules/react-redux/es/components/Provider.js","webpack://mobicheckin-server/./node_modules/react-redux/node_modules/@babel/runtime/helpers/esm/extends.js","webpack://mobicheckin-server/./node_modules/react-redux/node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js","webpack://mobicheckin-server/./node_modules/react-redux/es/components/connectAdvanced.js","webpack://mobicheckin-server/./node_modules/react-redux/es/utils/shallowEqual.js","webpack://mobicheckin-server/./node_modules/react-redux/es/connect/wrapMapToProps.js","webpack://mobicheckin-server/./node_modules/react-redux/es/connect/mapDispatchToProps.js","webpack://mobicheckin-server/./node_modules/react-redux/es/utils/bindActionCreators.js","webpack://mobicheckin-server/./node_modules/react-redux/es/connect/mapStateToProps.js","webpack://mobicheckin-server/./node_modules/react-redux/es/connect/mergeProps.js","webpack://mobicheckin-server/./node_modules/react-redux/es/connect/selectorFactory.js","webpack://mobicheckin-server/./node_modules/react-redux/es/connect/connect.js","webpack://mobicheckin-server/./node_modules/react-redux/es/hooks/useReduxContext.js","webpack://mobicheckin-server/./node_modules/react-redux/es/hooks/useStore.js","webpack://mobicheckin-server/./node_modules/react-redux/es/hooks/useDispatch.js","webpack://mobicheckin-server/./node_modules/react-redux/es/hooks/useSelector.js","webpack://mobicheckin-server/./node_modules/react-redux/es/index.js","webpack://mobicheckin-server/./node_modules/reactcss/lib/autoprefix.js","webpack://mobicheckin-server/./node_modules/reactcss/lib/components/active.js","webpack://mobicheckin-server/./node_modules/reactcss/lib/components/hover.js","webpack://mobicheckin-server/./node_modules/reactcss/lib/flattenNames.js","webpack://mobicheckin-server/./node_modules/reactcss/lib/index.js","webpack://mobicheckin-server/./node_modules/reactcss/lib/loop.js","webpack://mobicheckin-server/./node_modules/reactcss/lib/mergeClasses.js","webpack://mobicheckin-server/./node_modules/setimmediate/setImmediate.js","webpack://mobicheckin-server/./node_modules/tinycolor2/tinycolor.js","webpack://mobicheckin-server/./node_modules/truncate/truncate.js","webpack://mobicheckin-server/./node_modules/ua-parser-js/src/ua-parser.js"],"sourcesContent":["function r(e){var t,f,n=\"\";if(\"string\"==typeof e||\"number\"==typeof e)n+=e;else if(\"object\"==typeof e)if(Array.isArray(e))for(t=0;t<e.length;t++)e[t]&&(f=r(e[t]))&&(n&&(n+=\" \"),n+=f);else for(t in e)e[t]&&(n&&(n+=\" \"),n+=t);return n}export function clsx(){for(var e,t,f=0,n=\"\";f<arguments.length;)(e=arguments[f++])&&(t=r(e))&&(n&&(n+=\" \"),n+=t);return n}export default clsx;","import React from 'react';\nimport clsx from 'clsx';\nimport { Modifier, EditorState, RichUtils } from 'draft-js';\n\nfunction _extends() {\n  _extends = Object.assign || function (target) {\n    for (var i = 1; i < arguments.length; i++) {\n      var source = arguments[i];\n\n      for (var key in source) {\n        if (Object.prototype.hasOwnProperty.call(source, key)) {\n          target[key] = source[key];\n        }\n      }\n    }\n\n    return target;\n  };\n\n  return _extends.apply(this, arguments);\n}\n\nfunction createBlockAlignmentButton(_ref) {\n  var alignment = _ref.alignment,\n      children = _ref.children;\n  return function BlockAlignmentButton(props) {\n    var activate = function activate(event) {\n      event.preventDefault();\n      props.setAlignment({\n        alignment: alignment\n      });\n    };\n\n    var preventBubblingUp = function preventBubblingUp(event) {\n      event.preventDefault();\n    };\n\n    var isActive = function isActive() {\n      return props.alignment === alignment;\n    };\n\n    var theme = props.theme,\n        _props$buttonProps = props.buttonProps,\n        buttonProps = _props$buttonProps === void 0 ? {} : _props$buttonProps;\n    var className = isActive() ? clsx(theme.button, theme.active) : theme.button;\n    return /*#__PURE__*/React.createElement(\"div\", {\n      className: theme.buttonWrapper,\n      onMouseDown: preventBubblingUp\n    }, /*#__PURE__*/React.createElement(\"button\", _extends({\n      children: children\n    }, buttonProps, {\n      className: className,\n      onClick: activate,\n      type: \"button\"\n    })));\n  };\n}\n\nvar AlignBlockCenterButton = createBlockAlignmentButton({\n  alignment: 'center',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M3,21 L21,21 L21,19 L3,19 L3,21 Z M3,3 L3,5 L21,5 L21,3 L3,3 Z M5,7 L5,17 L19,17 L19,7 L5,7 Z\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0z\",\n    fill: \"none\"\n  }))\n});\n\nvar AlignBlockDefaultButton = createBlockAlignmentButton({\n  alignment: 'default',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M3,21 L21,21 L21,19 L3,19 L3,21 Z M3,3 L3,5 L21,5 L21,3 L3,3 Z M3,7 L3,17 L17,17 L17,7 L3,7 Z\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0z\",\n    fill: \"none\"\n  }))\n});\n\nvar AlignBlockLeftButton = createBlockAlignmentButton({\n  alignment: 'left',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M21,15 L15,15 L15,17 L21,17 L21,15 Z M21,7 L15,7 L15,9 L21,9 L21,7 Z M15,13 L21,13 L21,11 L15,11 L15,13 Z M3,21 L21,21 L21,19 L3,19 L3,21 Z M3,3 L3,5 L21,5 L21,3 L3,3 Z M3,7 L3,17 L13,17 L13,7 L3,7 Z\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0z\",\n    fill: \"none\"\n  }))\n});\n\nvar AlignBlockRightButton = createBlockAlignmentButton({\n  alignment: 'right',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M9,15 L3,15 L3,17 L9,17 L9,15 Z M9,7 L3,7 L3,9 L9,9 L9,7 Z M3,13 L9,13 L9,11 L3,11 L3,13 Z M3,21 L21,21 L21,19 L3,19 L3,21 Z M3,3 L3,5 L21,5 L21,3 L3,3 Z M11,7 L11,17 L21,17 L21,7 L11,7 Z\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0z\",\n    fill: \"none\"\n  }))\n});\n\nfunction createTextAlignmentButton(_ref) {\n  var alignment = _ref.alignment,\n      children = _ref.children;\n  return function InlineStyleButton(props) {\n    var toggleStyle = function toggleStyle(event) {\n      if (!props.getEditorState) return;\n      event.preventDefault();\n      var alignmentStyles = ['left', 'center', 'right'];\n      var removeStyles = alignmentStyles.filter(function (style) {\n        return style !== alignment;\n      });\n      var currentEditorState = props.getEditorState();\n      var currentContent = props.getEditorState().getCurrentContent();\n      var selection = props.getEditorState().getSelection();\n      var focusBlock = currentContent.getBlockForKey(selection.getFocusKey());\n      var anchorBlock = currentContent.getBlockForKey(selection.getAnchorKey());\n      var selectionIsBackward = selection.getIsBackward();\n      var changes = {\n        anchorOffset: 0,\n        focusOffset: focusBlock.getLength()\n      };\n\n      if (selectionIsBackward) {\n        changes = {\n          focusOffset: 0,\n          anchorOffset: anchorBlock.getLength()\n        };\n      }\n\n      var selectWholeBlocks = selection.merge(changes);\n      var modifiedContent = Modifier.applyInlineStyle(currentContent, selectWholeBlocks, alignment);\n      var finalContent = removeStyles.reduce(function (content, style) {\n        return Modifier.removeInlineStyle(content, selectWholeBlocks, style);\n      }, modifiedContent);\n      var nextEditorState = EditorState.push(currentEditorState, finalContent, 'change-inline-style');\n      props.setEditorState(nextEditorState);\n    };\n\n    var preventBubblingUp = function preventBubblingUp(event) {\n      event.preventDefault();\n    };\n\n    var styleIsActive = function styleIsActive() {\n      return props.getEditorState && props.getEditorState().getCurrentInlineStyle().has(alignment);\n    };\n\n    var theme = props.theme,\n        _props$buttonProps = props.buttonProps,\n        buttonProps = _props$buttonProps === void 0 ? {} : _props$buttonProps;\n    var className = styleIsActive() ? clsx(theme.button, theme.active) : theme.button;\n    return /*#__PURE__*/React.createElement(\"div\", {\n      className: theme.buttonWrapper,\n      onMouseDown: preventBubblingUp\n    }, /*#__PURE__*/React.createElement(\"button\", _extends({\n      children: children\n    }, buttonProps, {\n      className: className,\n      onClick: toggleStyle,\n      type: \"button\"\n    })));\n  };\n}\n\nvar AlignTextCenterButton = createTextAlignmentButton({\n  alignment: 'center',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M7 15v2h10v-2H7zm-4 6h18v-2H3v2zm0-8h18v-2H3v2zm4-6v2h10V7H7zM3 3v2h18V3H3z\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0z\",\n    fill: \"none\"\n  }))\n});\n\nvar AlignTextLeftButton = createTextAlignmentButton({\n  alignment: 'left',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M15 15H3v2h12v-2zm0-8H3v2h12V7zM3 13h18v-2H3v2zm0 8h18v-2H3v2zM3 3v2h18V3H3z\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0z\",\n    fill: \"none\"\n  }))\n});\n\nvar AlignTextRightButton = createTextAlignmentButton({\n  alignment: 'right',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M3 21h18v-2H3v2zm6-4h12v-2H9v2zm-6-4h18v-2H3v2zm6-4h12V7H9v2zM3 3v2h18V3H3z\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0z\",\n    fill: \"none\"\n  }))\n});\n\nfunction createBlockStyleButton(_ref) {\n  var blockType = _ref.blockType,\n      children = _ref.children;\n  return function BlockStyleButton(props) {\n    var toggleStyle = function toggleStyle(event) {\n      event.preventDefault();\n      props.setEditorState(RichUtils.toggleBlockType(props.getEditorState(), blockType));\n    };\n\n    var preventBubblingUp = function preventBubblingUp(event) {\n      event.preventDefault();\n    };\n\n    var blockTypeIsActive = function blockTypeIsActive() {\n      // if the button is rendered before the editor\n      if (!props.getEditorState) {\n        return false;\n      }\n\n      var editorState = props.getEditorState();\n      var type = editorState.getCurrentContent().getBlockForKey(editorState.getSelection().getStartKey()).getType();\n      return type === blockType;\n    };\n\n    var theme = props.theme,\n        _props$buttonProps = props.buttonProps,\n        buttonProps = _props$buttonProps === void 0 ? {} : _props$buttonProps;\n    var className = blockTypeIsActive() ? clsx(theme.button, theme.active) : theme.button;\n    return /*#__PURE__*/React.createElement(\"div\", {\n      className: theme.buttonWrapper,\n      onMouseDown: preventBubblingUp\n    }, /*#__PURE__*/React.createElement(\"button\", _extends({\n      children: children\n    }, buttonProps, {\n      className: className,\n      onClick: toggleStyle,\n      type: \"button\"\n    })));\n  };\n}\n\nvar BlockquoteButton = createBlockStyleButton({\n  blockType: 'blockquote',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M6 17h3l2-4V7H5v6h3zm8 0h3l2-4V7h-6v6h3z\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0z\",\n    fill: \"none\"\n  }))\n});\n\nfunction createInlineStyleButton(_ref) {\n  var style = _ref.style,\n      children = _ref.children;\n  return function InlineStyleButton(props) {\n    var toggleStyle = function toggleStyle(event) {\n      event.preventDefault();\n      props.setEditorState(RichUtils.toggleInlineStyle(props.getEditorState(), style));\n    };\n\n    var preventBubblingUp = function preventBubblingUp(event) {\n      event.preventDefault();\n    }; // we check if this.props.getEditorstate is undefined first in case the button is rendered before the editor\n\n\n    var styleIsActive = function styleIsActive() {\n      return props.getEditorState && props.getEditorState().getCurrentInlineStyle().has(style);\n    };\n\n    var theme = props.theme,\n        _props$buttonProps = props.buttonProps,\n        buttonProps = _props$buttonProps === void 0 ? {} : _props$buttonProps;\n    var className = styleIsActive() ? clsx(theme.button, theme.active) : theme.button;\n    return /*#__PURE__*/React.createElement(\"div\", {\n      className: theme.buttonWrapper,\n      onMouseDown: preventBubblingUp\n    }, /*#__PURE__*/React.createElement(\"button\", _extends({\n      children: children\n    }, buttonProps, {\n      className: className,\n      onClick: toggleStyle,\n      type: \"button\"\n    })));\n  };\n}\n\nvar BoldButton = createInlineStyleButton({\n  style: 'BOLD',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M15.6 10.79c.97-.67 1.65-1.77 1.65-2.79 0-2.26-1.75-4-4-4H7v14h7.04c2.09 0 3.71-1.7 3.71-3.79 0-1.52-.86-2.82-2.15-3.42zM10 6.5h3c.83 0 1.5.67 1.5 1.5s-.67 1.5-1.5 1.5h-3v-3zm3.5 9H10v-3h3.5c.83 0 1.5.67 1.5 1.5s-.67 1.5-1.5 1.5z\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0z\",\n    fill: \"none\"\n  }))\n});\n\nvar CodeBlockButton = createBlockStyleButton({\n  blockType: 'code-block',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0V0z\",\n    fill: \"none\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M9.4 16.6L4.8 12l4.6-4.6L8 6l-6 6 6 6 1.4-1.4zm5.2 0l4.6-4.6-4.6-4.6L16 6l6 6-6 6-1.4-1.4z\"\n  }))\n});\n\nvar CodeButton = createInlineStyleButton({\n  style: 'CODE',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0V0z\",\n    fill: \"none\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M9.4 16.6L4.8 12l4.6-4.6L8 6l-6 6 6 6 1.4-1.4zm5.2 0l4.6-4.6-4.6-4.6L16 6l6 6-6 6-1.4-1.4z\"\n  }))\n});\n\nvar HeadlineOneButton = createBlockStyleButton({\n  blockType: 'header-one',\n  children: 'H1'\n});\n\nvar HeadlineThreeButton = createBlockStyleButton({\n  blockType: 'header-three',\n  children: 'H3'\n});\n\nvar HeadlineTwoButton = createBlockStyleButton({\n  blockType: 'header-two',\n  children: 'H2'\n});\n\nvar ItalicButton = createInlineStyleButton({\n  style: 'ITALIC',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0z\",\n    fill: \"none\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M10 4v3h2.21l-3.42 8H6v3h8v-3h-2.21l3.42-8H18V4z\"\n  }))\n});\n\nvar OrderedListButton = createBlockStyleButton({\n  blockType: 'ordered-list-item',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M2 17h2v.5H3v1h1v.5H2v1h3v-4H2v1zm1-9h1V4H2v1h1v3zm-1 3h1.8L2 13.1v.9h3v-1H3.2L5 10.9V10H2v1zm5-6v2h14V5H7zm0 14h14v-2H7v2zm0-6h14v-2H7v2z\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0z\",\n    fill: \"none\"\n  }))\n});\n\nvar SubButton = createInlineStyleButton({\n  style: 'SUBSCRIPT',\n  children: /*#__PURE__*/React.createElement(\"div\", null, \"x\", /*#__PURE__*/React.createElement(\"sub\", null, \"2\"))\n});\n\nvar SupButton = createInlineStyleButton({\n  style: 'SUPERSCRIPT',\n  children: /*#__PURE__*/React.createElement(\"div\", null, \"x\", /*#__PURE__*/React.createElement(\"sup\", null, \"2\"))\n});\n\nvar UnderlineButton = createInlineStyleButton({\n  style: 'UNDERLINE',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0z\",\n    fill: \"none\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M12 17c3.31 0 6-2.69 6-6V3h-2.5v8c0 1.93-1.57 3.5-3.5 3.5S8.5 12.93 8.5 11V3H6v8c0 3.31 2.69 6 6 6zm-7 2v2h14v-2H5z\"\n  }))\n});\n\nvar UnorderedListButton = createBlockStyleButton({\n  blockType: 'unordered-list-item',\n  children: /*#__PURE__*/React.createElement(\"svg\", {\n    height: \"24\",\n    viewBox: \"0 0 24 24\",\n    width: \"24\",\n    xmlns: \"http://www.w3.org/2000/svg\"\n  }, /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M4 10.5c-.83 0-1.5.67-1.5 1.5s.67 1.5 1.5 1.5 1.5-.67 1.5-1.5-.67-1.5-1.5-1.5zm0-6c-.83 0-1.5.67-1.5 1.5S3.17 7.5 4 7.5 5.5 6.83 5.5 6 4.83 4.5 4 4.5zm0 12c-.83 0-1.5.68-1.5 1.5s.68 1.5 1.5 1.5 1.5-.68 1.5-1.5-.67-1.5-1.5-1.5zM7 19h14v-2H7v2zm0-6h14v-2H7v2zm0-8v2h14V5H7z\"\n  }), /*#__PURE__*/React.createElement(\"path\", {\n    d: \"M0 0h24v24H0V0z\",\n    fill: \"none\"\n  }))\n});\n\nexport { AlignBlockCenterButton, AlignBlockDefaultButton, AlignBlockLeftButton, AlignBlockRightButton, AlignTextCenterButton, AlignTextLeftButton, AlignTextRightButton, BlockquoteButton, BoldButton, CodeBlockButton, CodeButton, HeadlineOneButton, HeadlineThreeButton, HeadlineTwoButton, ItalicButton, OrderedListButton, SubButton, SupButton, UnderlineButton, UnorderedListButton, createBlockAlignmentButton, createBlockStyleButton, createInlineStyleButton, createTextAlignmentButton };\n","import { EditorState, ContentState, getDefaultKeyBinding, RichUtils, CompositeDecorator, Editor, DefaultDraftBlockRenderMap } from 'draft-js';\nimport Immutable, { List, Map } from 'immutable';\nimport PropTypes from 'prop-types';\nimport React, { Component } from 'react';\n\n/**\n * Create an editor state with some text in it already\n */\nfunction createEditorStateWithText$1(text) {\n  // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n  // @ts-ignore\n  if (EditorState.createWithText) {\n    // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n    // @ts-ignore\n    return EditorState.createWithText(text);\n  }\n\n  return EditorState.createWithContent(ContentState.createFromText(text));\n}\n\n// This code originally has been copied from Recompose\n// https://github.com/acdlite/recompose/blob/master/src/packages/recompose/compose.js\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nfunction composeDecorators$1() {\n  for (var _len = arguments.length, funcs = new Array(_len), _key = 0; _key < _len; _key++) {\n    funcs[_key] = arguments[_key];\n  }\n\n  if (funcs.length === 0) {\n    return function (arg) {\n      return arg;\n    };\n  }\n\n  if (funcs.length === 1) {\n    return funcs[0];\n  }\n\n  var last = funcs[funcs.length - 1];\n  return function () {\n    var result = last.apply(void 0, arguments);\n\n    for (var i = funcs.length - 2; i >= 0; i -= 1) {\n      var f = funcs[i];\n      result = f(result);\n    }\n\n    return result;\n  };\n}\n\nfunction _extends() {\n  _extends = Object.assign || function (target) {\n    for (var i = 1; i < arguments.length; i++) {\n      var source = arguments[i];\n\n      for (var key in source) {\n        if (Object.prototype.hasOwnProperty.call(source, key)) {\n          target[key] = source[key];\n        }\n      }\n    }\n\n    return target;\n  };\n\n  return _extends.apply(this, arguments);\n}\n\nfunction _inheritsLoose(subClass, superClass) {\n  subClass.prototype = Object.create(superClass.prototype);\n  subClass.prototype.constructor = subClass;\n\n  _setPrototypeOf(subClass, superClass);\n}\n\nfunction _setPrototypeOf(o, p) {\n  _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) {\n    o.__proto__ = p;\n    return o;\n  };\n\n  return _setPrototypeOf(o, p);\n}\n\nfunction _objectWithoutPropertiesLoose(source, excluded) {\n  if (source == null) return {};\n  var target = {};\n  var sourceKeys = Object.keys(source);\n  var key, i;\n\n  for (i = 0; i < sourceKeys.length; i++) {\n    key = sourceKeys[i];\n    if (excluded.indexOf(key) >= 0) continue;\n    target[key] = source[key];\n  }\n\n  return target;\n}\n\nfunction keyBindingFn(event) {\n  return getDefaultKeyBinding(event);\n}\n\nfunction handleKeyCommand(command, editorState, eventTimeStamp, _ref) {\n  var setEditorState = _ref.setEditorState;\n  var newState;\n\n  switch (command) {\n    case 'backspace':\n    case 'backspace-word':\n    case 'backspace-to-start-of-line':\n      newState = RichUtils.onBackspace(editorState);\n      break;\n\n    case 'delete':\n    case 'delete-word':\n    case 'delete-to-end-of-block':\n      newState = RichUtils.onDelete(editorState);\n      break;\n\n    default:\n      return 'not-handled';\n  }\n\n  if (newState != null) {\n    setEditorState(newState);\n    return 'handled';\n  }\n\n  return 'not-handled';\n}\n\nvar _excluded$1 = [\"props\"],\n    _excluded2 = [\"props\"];\n\nfunction isEditorHandleKey(key) {\n  return key.startsWith('handle');\n}\n\nfunction isEditorEventKey(key) {\n  return key.startsWith('on');\n}\n\nfunction isEditorFnKey(key) {\n  return key.endsWith('Fn');\n}\n\nfunction blockRendererFnHook(plugins, pluginMethods) {\n  return function (block) {\n    var resultBlock = {\n      props: {}\n    };\n    plugins.forEach(function (plugin) {\n      if (typeof plugin.blockRendererFn !== 'function') {\n        return;\n      }\n\n      var result = plugin.blockRendererFn(block, pluginMethods);\n\n      if (result !== undefined && result !== null) {\n        var pluginProps = result.props,\n            pluginRest = _objectWithoutPropertiesLoose(result, _excluded$1); // eslint-disable-line no-use-before-define\n\n\n        var _resultBlock = resultBlock,\n            props = _resultBlock.props,\n            rest = _objectWithoutPropertiesLoose(_resultBlock, _excluded2); // eslint-disable-line no-use-before-define\n\n\n        resultBlock = _extends({}, rest, pluginRest, {\n          props: _extends({}, props, pluginProps)\n        });\n      }\n    });\n    return resultBlock.component ? resultBlock : false;\n  };\n}\n\nfunction blockStyleFnHook(plugins, pluginMethods) {\n  return function (block) {\n    var styles = [];\n    plugins.forEach(function (plugin) {\n      if (typeof plugin.blockStyleFn !== 'function') {\n        return;\n      }\n\n      var result = plugin.blockStyleFn(block, pluginMethods);\n\n      if (result !== undefined && result !== null) {\n        styles.push(result);\n      }\n    });\n    return styles.join(' ');\n  };\n}\n\nfunction customStyleFnHook(plugins, pluginMethods) {\n  return function (style, block) {\n    var result;\n    var wasHandled = plugins.some(function (plugin) {\n      if (typeof plugin.customStyleFn !== 'function') {\n        return false;\n      }\n\n      result = plugin.customStyleFn(style, block, pluginMethods);\n      return result !== undefined;\n    });\n    return wasHandled && result ? result : {};\n  };\n}\n\nfunction keyBindingFnHook(plugins, pluginMethods) {\n  return function (event) {\n    var result = null;\n    var wasHandled = plugins.some(function (plugin) {\n      if (typeof plugin.keyBindingFn !== 'function') {\n        return false;\n      }\n\n      result = plugin.keyBindingFn(event, pluginMethods);\n      return result !== undefined;\n    });\n    return wasHandled ? result : null;\n  };\n}\n\nfunction createHandleHooks(methodName, plugins, pluginMethods) {\n  return function () {\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return plugins.some(function (plugin) {\n      var fn = plugin[methodName];\n      return (// eslint-disable-next-line @typescript-eslint/ban-ts-comment\n        // @ts-ignore\n        typeof fn === 'function' && fn.apply(void 0, args.concat([pluginMethods])) === 'handled'\n      );\n    }) ? 'handled' : 'not-handled';\n  };\n}\n\nfunction createEventHooks(methodName, plugins, pluginMethods) {\n  return function () {\n    for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n      args[_key2] = arguments[_key2];\n    }\n\n    return plugins.some(function (plugin) {\n      var fn = plugin[methodName]; // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n      // @ts-ignore\n\n      return typeof fn === 'function' && fn.apply(void 0, args.concat([pluginMethods])) === true;\n    });\n  };\n}\n\nfunction createPluginHooks(plugins, pluginFunction) {\n  var pluginHooks = {}; //onchange is here ignored\n\n  var handledAttributes = new Set(['onChange']);\n  plugins.forEach(function (plugin) {\n    Object.keys(plugin).forEach(function (attrName) {\n      // if `attrName` has been added as a hook key already, ignore this one\n      if (handledAttributes.has(attrName)) {\n        return;\n      }\n\n      handledAttributes.add(attrName);\n\n      if (isEditorEventKey(attrName)) {\n        pluginHooks[attrName] = createEventHooks(attrName, plugins, pluginFunction);\n      } else if (isEditorHandleKey(attrName)) {\n        pluginHooks[attrName] = createHandleHooks(attrName, plugins, pluginFunction);\n      } else if (isEditorFnKey(attrName)) {\n        if (attrName === 'blockRendererFn') {\n          pluginHooks.blockRendererFn = blockRendererFnHook(plugins, pluginFunction);\n        } else if (attrName === 'blockStyleFn') {\n          pluginHooks.blockStyleFn = blockStyleFnHook(plugins, pluginFunction);\n        } else if (attrName === 'customStyleFn') {\n          pluginHooks.customStyleFn = customStyleFnHook(plugins, pluginFunction);\n        } else if (attrName === 'keyBindingFn') {\n          pluginHooks.keyBindingFn = keyBindingFnHook(plugins, pluginFunction);\n        }\n      }\n    });\n  });\n  return pluginHooks;\n}\n\nfunction createCompositeDecorator(decorators, getEditorState, setEditorState) {\n  var convertedDecorators = List(decorators).map(function (decorator) {\n    var Component = decorator.component;\n\n    var DecoratedComponent = function DecoratedComponent(props) {\n      return /*#__PURE__*/React.createElement(Component, _extends({}, props, {\n        getEditorState: getEditorState,\n        setEditorState: setEditorState\n      }));\n    };\n\n    return _extends({}, decorator, {\n      component: DecoratedComponent\n    });\n  }).toJS();\n  return new CompositeDecorator(convertedDecorators);\n}\n\nvar KEY_SEPARATOR = '-';\n\nvar MultiDecorator = /*#__PURE__*/function () {\n  function MultiDecorator(decorators) {\n    this.decorators = void 0;\n    this.decorators = Immutable.List(decorators);\n  }\n  /**\n   * Return list of decoration IDs per character\n   */\n\n\n  var _proto = MultiDecorator.prototype;\n\n  _proto.getDecorations = function getDecorations(block, contentState) {\n    var decorations = new Array(block.getText().length).fill(null);\n    this.decorators.forEach(function (decorator, i) {\n      var subDecorations = decorator.getDecorations(block, contentState);\n      subDecorations.forEach(function (key, offset) {\n        if (!key) {\n          return;\n        }\n\n        decorations[offset] = i + KEY_SEPARATOR + key;\n      });\n    });\n    return Immutable.List(decorations);\n  }\n  /**\n   * Return component to render a decoration\n   */\n  // eslint-disable-next-line @typescript-eslint/ban-types\n  ;\n\n  _proto.getComponentForKey = function getComponentForKey(key) {\n    var decorator = this.getDecoratorForKey(key);\n    return decorator.getComponentForKey(MultiDecorator.getInnerKey(key));\n  }\n  /**\n   * Return props to render a decoration\n   */\n  // eslint-disable-next-line @typescript-eslint/ban-types\n  ;\n\n  _proto.getPropsForKey = function getPropsForKey(key) {\n    var decorator = this.getDecoratorForKey(key);\n    return decorator.getPropsForKey(MultiDecorator.getInnerKey(key));\n  }\n  /**\n   * Return a decorator for a specific key\n   */\n  ;\n\n  _proto.getDecoratorForKey = function getDecoratorForKey(key) {\n    var parts = key.split(KEY_SEPARATOR);\n    var index = Number(parts[0]);\n    return this.decorators.get(index);\n  }\n  /**\n   * Return inner key for a decorator\n   */\n  ;\n\n  MultiDecorator.getInnerKey = function getInnerKey(key) {\n    var parts = key.split(KEY_SEPARATOR);\n    return parts.slice(1).join(KEY_SEPARATOR);\n  };\n\n  return MultiDecorator;\n}();\n\n// @see https://github.com/facebook/draft-js/blob/master/src/model/decorators/DraftDecoratorType.js\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n\nvar decoratorIsCustom = function decoratorIsCustom(decorator) {\n  return typeof decorator.getDecorations === 'function' && typeof decorator.getComponentForKey === 'function' && typeof decorator.getPropsForKey === 'function';\n};\n\nvar getDecoratorsFromProps = function getDecoratorsFromProps(_ref) {\n  var decorators = _ref.decorators,\n      _ref$plugins = _ref.plugins,\n      plugins = _ref$plugins === void 0 ? [] : _ref$plugins;\n  return List([{\n    decorators: decorators\n  }].concat(plugins)).filter(function (plugin) {\n    return (plugin == null ? void 0 : plugin.decorators) !== undefined;\n  }).flatMap(function (plugin) {\n    return plugin == null ? void 0 : plugin.decorators;\n  });\n};\n\nfunction resolveDecorators(props, getEditorState, onChange) {\n  var decorators = getDecoratorsFromProps(props);\n  var compositeDecorator = createCompositeDecorator(decorators.filter(function (decorator) {\n    return !decoratorIsCustom(decorator);\n  }), getEditorState, onChange);\n  var customDecorators = decorators.filter(function (decorator) {\n    return decoratorIsCustom(decorator);\n  });\n  return new MultiDecorator(customDecorators.push(compositeDecorator));\n}\n\nvar _excluded = [\"keyBindingFn\"];\n\nvar getDecoratorLength = function getDecoratorLength(obj) {\n  if ((obj == null ? void 0 : obj.decorators) != null) {\n    var _obj$decorators;\n\n    return (_obj$decorators = obj.decorators) == null ? void 0 : _obj$decorators.size;\n  } else if ((obj == null ? void 0 : obj._decorators) != null) {\n    var _obj$_decorators;\n\n    return (_obj$_decorators = obj._decorators) == null ? void 0 : _obj$_decorators.length;\n  }\n\n  return undefined;\n};\n/**\n * The main editor component\n */\n\n\nvar PluginEditor = /*#__PURE__*/function (_Component) {\n  _inheritsLoose(PluginEditor, _Component);\n\n  function PluginEditor(_props) {\n    var _this;\n\n    _this = _Component.call(this, _props) || this;\n    _this.editor = null;\n    _this.state = {\n      readOnly: false // TODO for Nik: ask ben why this is relevent\n\n    };\n\n    _this.onChange = function (editorState) {\n      var newEditorState = editorState;\n\n      _this.resolvePlugins().forEach(function (plugin) {\n        if (plugin.onChange) {\n          newEditorState = plugin.onChange(newEditorState, _this.getPluginMethods());\n        }\n      });\n\n      if (_this.props.onChange) {\n        _this.props.onChange(newEditorState);\n      }\n    };\n\n    _this.getPlugins = function () {\n      return [].concat(_this.props.plugins);\n    };\n\n    _this.getProps = function () {\n      return _extends({}, _this.props);\n    };\n\n    _this.getReadOnly = function () {\n      return _this.props.readOnly || _this.state.readOnly;\n    };\n\n    _this.setReadOnly = function (readOnly) {\n      if (readOnly !== _this.state.readOnly) {\n        _this.setState({\n          readOnly: readOnly\n        });\n      }\n    };\n\n    _this.getEditorRef = function () {\n      return _this.editor;\n    };\n\n    _this.getEditorState = function () {\n      return _this.props.editorState;\n    };\n\n    _this.getPluginMethods = function () {\n      return {\n        getPlugins: _this.getPlugins,\n        getProps: _this.getProps,\n        setEditorState: _this.onChange,\n        getEditorState: _this.getEditorState,\n        getReadOnly: _this.getReadOnly,\n        setReadOnly: _this.setReadOnly,\n        getEditorRef: _this.getEditorRef\n      };\n    };\n\n    _this.createPluginHooks = function () {\n      var plugins = [_this.props].concat(_this.resolvePlugins());\n      return createPluginHooks(plugins, _this.getPluginMethods());\n    };\n\n    _this.resolvePlugins = function () {\n      var plugins = _this.getPlugins();\n\n      if (_this.props.defaultKeyBindings === true) {\n        plugins.push({\n          keyBindingFn: keyBindingFn\n        });\n      }\n\n      if (_this.props.defaultKeyCommands === true) {\n        plugins.push({\n          handleKeyCommand: handleKeyCommand\n        });\n      }\n\n      return plugins;\n    };\n\n    _this.resolveCustomStyleMap = function () {\n      var customStyleMap = _this.props.plugins.filter(function (plug) {\n        return plug.customStyleMap !== undefined;\n      }).map(function (plug) {\n        return plug.customStyleMap;\n      });\n\n      return customStyleMap.concat([_this.props.customStyleMap]).reduce(function (styles, style) {\n        return _extends({}, styles, style);\n      }, {});\n    };\n\n    _this.resolveblockRenderMap = function () {\n      var blockRenderMap = _this.props.plugins.filter(function (plug) {\n        return plug.blockRenderMap !== undefined;\n      }).reduce(function (maps, plug) {\n        return maps.merge(plug.blockRenderMap);\n      }, Map({}));\n\n      if (_this.props.defaultBlockRenderMap) {\n        blockRenderMap = DefaultDraftBlockRenderMap.merge(blockRenderMap);\n      }\n\n      if (_this.props.blockRenderMap) {\n        blockRenderMap = blockRenderMap.merge(_this.props.blockRenderMap);\n      }\n\n      return blockRenderMap;\n    };\n\n    _this.resolveAccessibilityProps = function () {\n      var accessibilityProps = {};\n\n      _this.resolvePlugins().forEach(function (plugin) {\n        if (typeof plugin.getAccessibilityProps !== 'function') {\n          return;\n        }\n\n        var props = plugin.getAccessibilityProps();\n        var popupProps = {};\n\n        if (accessibilityProps.ariaHasPopup === undefined) {\n          popupProps.ariaHasPopup = props.ariaHasPopup;\n        } else if (props.ariaHasPopup === 'true') {\n          popupProps.ariaHasPopup = 'true';\n        }\n\n        if (accessibilityProps.ariaExpanded === undefined) {\n          popupProps.ariaExpanded = props.ariaExpanded;\n        } else if (props.ariaExpanded === true) {\n          popupProps.ariaExpanded = true;\n        }\n\n        accessibilityProps = _extends({}, accessibilityProps, props, popupProps);\n      });\n\n      return accessibilityProps;\n    };\n\n    var _plugins = [_this.props].concat(_this.resolvePlugins());\n\n    _plugins.forEach(function (plugin) {\n      if (plugin && typeof plugin.initialize === 'function') {\n        plugin.initialize(_this.getPluginMethods());\n      }\n    });\n\n    return _this;\n  }\n\n  var _proto = PluginEditor.prototype;\n\n  _proto.focus = function focus() {\n    if (this.editor) {\n      this.editor.focus();\n    }\n  };\n\n  _proto.blur = function blur() {\n    if (this.editor) {\n      this.editor.blur();\n    }\n  };\n\n  _proto.componentDidMount = function componentDidMount() {\n    var decorator = resolveDecorators(this.props, this.getEditorState, this.onChange);\n    var editorState = EditorState.set(this.props.editorState, {\n      decorator: decorator\n    });\n    this.onChange(EditorState.moveSelectionToEnd(editorState));\n  };\n\n  _proto.componentDidUpdate = function componentDidUpdate(prevProps) {\n    var next = this.props;\n    var currDec = prevProps.editorState.getDecorator();\n    var nextDec = next.editorState.getDecorator(); // If there is not current decorator, there's nothing to carry over to the next editor state\n\n    if (!currDec) {\n      return;\n    } // If the current decorator is the same as the new one, don't call onChange to avoid infinite loops\n\n\n    if (currDec === nextDec) {\n      return;\n    } // If the old and the new decorator are the same, but no the same object, also don't call onChange to avoid infinite loops\n\n\n    if (currDec && nextDec && getDecoratorLength(currDec) === getDecoratorLength(nextDec)) {\n      return;\n    }\n\n    var editorState = EditorState.set(next.editorState, {\n      decorator: currDec\n    });\n    this.onChange(EditorState.moveSelectionToEnd(editorState));\n  };\n\n  _proto.componentWillUnmount = function componentWillUnmount() {\n    var _this2 = this;\n\n    this.resolvePlugins().forEach(function (plugin) {\n      if (plugin.willUnmount) {\n        plugin.willUnmount({\n          getEditorState: _this2.getEditorState,\n          setEditorState: _this2.onChange\n        });\n      }\n    });\n  } // Cycle through the plugins, changing the editor state with what the plugins\n  // changed (or didn't)\n  ;\n\n  _proto.render = function render() {\n    var _this3 = this;\n\n    var pluginHooks = this.createPluginHooks();\n    var customStyleMap = this.resolveCustomStyleMap();\n    var accessibilityProps = this.resolveAccessibilityProps();\n    var blockRenderMap = this.resolveblockRenderMap();\n\n    var _this$props = this.props;\n        _this$props.keyBindingFn;\n        var editorProps = _objectWithoutPropertiesLoose(_this$props, _excluded);\n\n    return /*#__PURE__*/React.createElement(Editor, _extends({}, editorProps, accessibilityProps, pluginHooks, {\n      readOnly: this.props.readOnly || this.state.readOnly,\n      customStyleMap: customStyleMap,\n      blockRenderMap: blockRenderMap,\n      onChange: this.onChange,\n      editorState: this.props.editorState,\n      ref: function ref(element) {\n        _this3.editor = element;\n      }\n    }));\n  };\n\n  return PluginEditor;\n}(Component);\n\nPluginEditor.propTypes = {\n  editorState: PropTypes.object.isRequired,\n  onChange: PropTypes.func.isRequired,\n  plugins: PropTypes.array,\n  defaultKeyBindings: PropTypes.bool,\n  defaultKeyCommands: PropTypes.bool,\n  defaultBlockRenderMap: PropTypes.bool,\n  customStyleMap: PropTypes.object,\n  // eslint-disable-next-line react/no-unused-prop-types\n  decorators: PropTypes.array\n};\nPluginEditor.defaultProps = {\n  defaultBlockRenderMap: true,\n  defaultKeyBindings: true,\n  defaultKeyCommands: true,\n  customStyleMap: {},\n  plugins: [],\n  decorators: []\n};\nvar PluginEditor$1 = PluginEditor;\n\nvar createEditorStateWithText = createEditorStateWithText$1;\nvar composeDecorators = composeDecorators$1;\n\nexport { composeDecorators, createEditorStateWithText, PluginEditor$1 as default };\n","/**\n *  Copyright (c) 2014-2015, Facebook, Inc.\n *  All rights reserved.\n *\n *  This source code is licensed under the BSD-style license found in the\n *  LICENSE file in the root directory of this source tree. An additional grant\n *  of patent rights can be found in the PATENTS file in the same directory.\n */\n\n(function (global, factory) {\n  typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n  typeof define === 'function' && define.amd ? define(factory) :\n  global.Immutable = factory();\n}(this, function () { 'use strict';var SLICE$0 = Array.prototype.slice;\n\n  function createClass(ctor, superClass) {\n    if (superClass) {\n      ctor.prototype = Object.create(superClass.prototype);\n    }\n    ctor.prototype.constructor = ctor;\n  }\n\n  function Iterable(value) {\n      return isIterable(value) ? value : Seq(value);\n    }\n\n\n  createClass(KeyedIterable, Iterable);\n    function KeyedIterable(value) {\n      return isKeyed(value) ? value : KeyedSeq(value);\n    }\n\n\n  createClass(IndexedIterable, Iterable);\n    function IndexedIterable(value) {\n      return isIndexed(value) ? value : IndexedSeq(value);\n    }\n\n\n  createClass(SetIterable, Iterable);\n    function SetIterable(value) {\n      return isIterable(value) && !isAssociative(value) ? value : SetSeq(value);\n    }\n\n\n\n  function isIterable(maybeIterable) {\n    return !!(maybeIterable && maybeIterable[IS_ITERABLE_SENTINEL]);\n  }\n\n  function isKeyed(maybeKeyed) {\n    return !!(maybeKeyed && maybeKeyed[IS_KEYED_SENTINEL]);\n  }\n\n  function isIndexed(maybeIndexed) {\n    return !!(maybeIndexed && maybeIndexed[IS_INDEXED_SENTINEL]);\n  }\n\n  function isAssociative(maybeAssociative) {\n    return isKeyed(maybeAssociative) || isIndexed(maybeAssociative);\n  }\n\n  function isOrdered(maybeOrdered) {\n    return !!(maybeOrdered && maybeOrdered[IS_ORDERED_SENTINEL]);\n  }\n\n  Iterable.isIterable = isIterable;\n  Iterable.isKeyed = isKeyed;\n  Iterable.isIndexed = isIndexed;\n  Iterable.isAssociative = isAssociative;\n  Iterable.isOrdered = isOrdered;\n\n  Iterable.Keyed = KeyedIterable;\n  Iterable.Indexed = IndexedIterable;\n  Iterable.Set = SetIterable;\n\n\n  var IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\n  var IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\n  var IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\n  var IS_ORDERED_SENTINEL = '@@__IMMUTABLE_ORDERED__@@';\n\n  // Used for setting prototype methods that IE8 chokes on.\n  var DELETE = 'delete';\n\n  // Constants describing the size of trie nodes.\n  var SHIFT = 5; // Resulted in best performance after ______?\n  var SIZE = 1 << SHIFT;\n  var MASK = SIZE - 1;\n\n  // A consistent shared value representing \"not set\" which equals nothing other\n  // than itself, and nothing that could be provided externally.\n  var NOT_SET = {};\n\n  // Boolean references, Rough equivalent of `bool &`.\n  var CHANGE_LENGTH = { value: false };\n  var DID_ALTER = { value: false };\n\n  function MakeRef(ref) {\n    ref.value = false;\n    return ref;\n  }\n\n  function SetRef(ref) {\n    ref && (ref.value = true);\n  }\n\n  // A function which returns a value representing an \"owner\" for transient writes\n  // to tries. The return value will only ever equal itself, and will not equal\n  // the return of any subsequent call of this function.\n  function OwnerID() {}\n\n  // http://jsperf.com/copy-array-inline\n  function arrCopy(arr, offset) {\n    offset = offset || 0;\n    var len = Math.max(0, arr.length - offset);\n    var newArr = new Array(len);\n    for (var ii = 0; ii < len; ii++) {\n      newArr[ii] = arr[ii + offset];\n    }\n    return newArr;\n  }\n\n  function ensureSize(iter) {\n    if (iter.size === undefined) {\n      iter.size = iter.__iterate(returnTrue);\n    }\n    return iter.size;\n  }\n\n  function wrapIndex(iter, index) {\n    // This implements \"is array index\" which the ECMAString spec defines as:\n    //\n    //     A String property name P is an array index if and only if\n    //     ToString(ToUint32(P)) is equal to P and ToUint32(P) is not equal\n    //     to 2^32−1.\n    //\n    // http://www.ecma-international.org/ecma-262/6.0/#sec-array-exotic-objects\n    if (typeof index !== 'number') {\n      var uint32Index = index >>> 0; // N >>> 0 is shorthand for ToUint32\n      if ('' + uint32Index !== index || uint32Index === 4294967295) {\n        return NaN;\n      }\n      index = uint32Index;\n    }\n    return index < 0 ? ensureSize(iter) + index : index;\n  }\n\n  function returnTrue() {\n    return true;\n  }\n\n  function wholeSlice(begin, end, size) {\n    return (begin === 0 || (size !== undefined && begin <= -size)) &&\n      (end === undefined || (size !== undefined && end >= size));\n  }\n\n  function resolveBegin(begin, size) {\n    return resolveIndex(begin, size, 0);\n  }\n\n  function resolveEnd(end, size) {\n    return resolveIndex(end, size, size);\n  }\n\n  function resolveIndex(index, size, defaultIndex) {\n    return index === undefined ?\n      defaultIndex :\n      index < 0 ?\n        Math.max(0, size + index) :\n        size === undefined ?\n          index :\n          Math.min(size, index);\n  }\n\n  /* global Symbol */\n\n  var ITERATE_KEYS = 0;\n  var ITERATE_VALUES = 1;\n  var ITERATE_ENTRIES = 2;\n\n  var REAL_ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;\n  var FAUX_ITERATOR_SYMBOL = '@@iterator';\n\n  var ITERATOR_SYMBOL = REAL_ITERATOR_SYMBOL || FAUX_ITERATOR_SYMBOL;\n\n\n  function Iterator(next) {\n      this.next = next;\n    }\n\n    Iterator.prototype.toString = function() {\n      return '[Iterator]';\n    };\n\n\n  Iterator.KEYS = ITERATE_KEYS;\n  Iterator.VALUES = ITERATE_VALUES;\n  Iterator.ENTRIES = ITERATE_ENTRIES;\n\n  Iterator.prototype.inspect =\n  Iterator.prototype.toSource = function () { return this.toString(); }\n  Iterator.prototype[ITERATOR_SYMBOL] = function () {\n    return this;\n  };\n\n\n  function iteratorValue(type, k, v, iteratorResult) {\n    var value = type === 0 ? k : type === 1 ? v : [k, v];\n    iteratorResult ? (iteratorResult.value = value) : (iteratorResult = {\n      value: value, done: false\n    });\n    return iteratorResult;\n  }\n\n  function iteratorDone() {\n    return { value: undefined, done: true };\n  }\n\n  function hasIterator(maybeIterable) {\n    return !!getIteratorFn(maybeIterable);\n  }\n\n  function isIterator(maybeIterator) {\n    return maybeIterator && typeof maybeIterator.next === 'function';\n  }\n\n  function getIterator(iterable) {\n    var iteratorFn = getIteratorFn(iterable);\n    return iteratorFn && iteratorFn.call(iterable);\n  }\n\n  function getIteratorFn(iterable) {\n    var iteratorFn = iterable && (\n      (REAL_ITERATOR_SYMBOL && iterable[REAL_ITERATOR_SYMBOL]) ||\n      iterable[FAUX_ITERATOR_SYMBOL]\n    );\n    if (typeof iteratorFn === 'function') {\n      return iteratorFn;\n    }\n  }\n\n  function isArrayLike(value) {\n    return value && typeof value.length === 'number';\n  }\n\n  createClass(Seq, Iterable);\n    function Seq(value) {\n      return value === null || value === undefined ? emptySequence() :\n        isIterable(value) ? value.toSeq() : seqFromValue(value);\n    }\n\n    Seq.of = function(/*...values*/) {\n      return Seq(arguments);\n    };\n\n    Seq.prototype.toSeq = function() {\n      return this;\n    };\n\n    Seq.prototype.toString = function() {\n      return this.__toString('Seq {', '}');\n    };\n\n    Seq.prototype.cacheResult = function() {\n      if (!this._cache && this.__iterateUncached) {\n        this._cache = this.entrySeq().toArray();\n        this.size = this._cache.length;\n      }\n      return this;\n    };\n\n    // abstract __iterateUncached(fn, reverse)\n\n    Seq.prototype.__iterate = function(fn, reverse) {\n      return seqIterate(this, fn, reverse, true);\n    };\n\n    // abstract __iteratorUncached(type, reverse)\n\n    Seq.prototype.__iterator = function(type, reverse) {\n      return seqIterator(this, type, reverse, true);\n    };\n\n\n\n  createClass(KeyedSeq, Seq);\n    function KeyedSeq(value) {\n      return value === null || value === undefined ?\n        emptySequence().toKeyedSeq() :\n        isIterable(value) ?\n          (isKeyed(value) ? value.toSeq() : value.fromEntrySeq()) :\n          keyedSeqFromValue(value);\n    }\n\n    KeyedSeq.prototype.toKeyedSeq = function() {\n      return this;\n    };\n\n\n\n  createClass(IndexedSeq, Seq);\n    function IndexedSeq(value) {\n      return value === null || value === undefined ? emptySequence() :\n        !isIterable(value) ? indexedSeqFromValue(value) :\n        isKeyed(value) ? value.entrySeq() : value.toIndexedSeq();\n    }\n\n    IndexedSeq.of = function(/*...values*/) {\n      return IndexedSeq(arguments);\n    };\n\n    IndexedSeq.prototype.toIndexedSeq = function() {\n      return this;\n    };\n\n    IndexedSeq.prototype.toString = function() {\n      return this.__toString('Seq [', ']');\n    };\n\n    IndexedSeq.prototype.__iterate = function(fn, reverse) {\n      return seqIterate(this, fn, reverse, false);\n    };\n\n    IndexedSeq.prototype.__iterator = function(type, reverse) {\n      return seqIterator(this, type, reverse, false);\n    };\n\n\n\n  createClass(SetSeq, Seq);\n    function SetSeq(value) {\n      return (\n        value === null || value === undefined ? emptySequence() :\n        !isIterable(value) ? indexedSeqFromValue(value) :\n        isKeyed(value) ? value.entrySeq() : value\n      ).toSetSeq();\n    }\n\n    SetSeq.of = function(/*...values*/) {\n      return SetSeq(arguments);\n    };\n\n    SetSeq.prototype.toSetSeq = function() {\n      return this;\n    };\n\n\n\n  Seq.isSeq = isSeq;\n  Seq.Keyed = KeyedSeq;\n  Seq.Set = SetSeq;\n  Seq.Indexed = IndexedSeq;\n\n  var IS_SEQ_SENTINEL = '@@__IMMUTABLE_SEQ__@@';\n\n  Seq.prototype[IS_SEQ_SENTINEL] = true;\n\n\n\n  createClass(ArraySeq, IndexedSeq);\n    function ArraySeq(array) {\n      this._array = array;\n      this.size = array.length;\n    }\n\n    ArraySeq.prototype.get = function(index, notSetValue) {\n      return this.has(index) ? this._array[wrapIndex(this, index)] : notSetValue;\n    };\n\n    ArraySeq.prototype.__iterate = function(fn, reverse) {\n      var array = this._array;\n      var maxIndex = array.length - 1;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        if (fn(array[reverse ? maxIndex - ii : ii], ii, this) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    };\n\n    ArraySeq.prototype.__iterator = function(type, reverse) {\n      var array = this._array;\n      var maxIndex = array.length - 1;\n      var ii = 0;\n      return new Iterator(function() \n        {return ii > maxIndex ?\n          iteratorDone() :\n          iteratorValue(type, ii, array[reverse ? maxIndex - ii++ : ii++])}\n      );\n    };\n\n\n\n  createClass(ObjectSeq, KeyedSeq);\n    function ObjectSeq(object) {\n      var keys = Object.keys(object);\n      this._object = object;\n      this._keys = keys;\n      this.size = keys.length;\n    }\n\n    ObjectSeq.prototype.get = function(key, notSetValue) {\n      if (notSetValue !== undefined && !this.has(key)) {\n        return notSetValue;\n      }\n      return this._object[key];\n    };\n\n    ObjectSeq.prototype.has = function(key) {\n      return this._object.hasOwnProperty(key);\n    };\n\n    ObjectSeq.prototype.__iterate = function(fn, reverse) {\n      var object = this._object;\n      var keys = this._keys;\n      var maxIndex = keys.length - 1;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        var key = keys[reverse ? maxIndex - ii : ii];\n        if (fn(object[key], key, this) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    };\n\n    ObjectSeq.prototype.__iterator = function(type, reverse) {\n      var object = this._object;\n      var keys = this._keys;\n      var maxIndex = keys.length - 1;\n      var ii = 0;\n      return new Iterator(function()  {\n        var key = keys[reverse ? maxIndex - ii : ii];\n        return ii++ > maxIndex ?\n          iteratorDone() :\n          iteratorValue(type, key, object[key]);\n      });\n    };\n\n  ObjectSeq.prototype[IS_ORDERED_SENTINEL] = true;\n\n\n  createClass(IterableSeq, IndexedSeq);\n    function IterableSeq(iterable) {\n      this._iterable = iterable;\n      this.size = iterable.length || iterable.size;\n    }\n\n    IterableSeq.prototype.__iterateUncached = function(fn, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var iterable = this._iterable;\n      var iterator = getIterator(iterable);\n      var iterations = 0;\n      if (isIterator(iterator)) {\n        var step;\n        while (!(step = iterator.next()).done) {\n          if (fn(step.value, iterations++, this) === false) {\n            break;\n          }\n        }\n      }\n      return iterations;\n    };\n\n    IterableSeq.prototype.__iteratorUncached = function(type, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterable = this._iterable;\n      var iterator = getIterator(iterable);\n      if (!isIterator(iterator)) {\n        return new Iterator(iteratorDone);\n      }\n      var iterations = 0;\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step : iteratorValue(type, iterations++, step.value);\n      });\n    };\n\n\n\n  createClass(IteratorSeq, IndexedSeq);\n    function IteratorSeq(iterator) {\n      this._iterator = iterator;\n      this._iteratorCache = [];\n    }\n\n    IteratorSeq.prototype.__iterateUncached = function(fn, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var iterator = this._iterator;\n      var cache = this._iteratorCache;\n      var iterations = 0;\n      while (iterations < cache.length) {\n        if (fn(cache[iterations], iterations++, this) === false) {\n          return iterations;\n        }\n      }\n      var step;\n      while (!(step = iterator.next()).done) {\n        var val = step.value;\n        cache[iterations] = val;\n        if (fn(val, iterations++, this) === false) {\n          break;\n        }\n      }\n      return iterations;\n    };\n\n    IteratorSeq.prototype.__iteratorUncached = function(type, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterator = this._iterator;\n      var cache = this._iteratorCache;\n      var iterations = 0;\n      return new Iterator(function()  {\n        if (iterations >= cache.length) {\n          var step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n          cache[iterations] = step.value;\n        }\n        return iteratorValue(type, iterations, cache[iterations++]);\n      });\n    };\n\n\n\n\n  // # pragma Helper functions\n\n  function isSeq(maybeSeq) {\n    return !!(maybeSeq && maybeSeq[IS_SEQ_SENTINEL]);\n  }\n\n  var EMPTY_SEQ;\n\n  function emptySequence() {\n    return EMPTY_SEQ || (EMPTY_SEQ = new ArraySeq([]));\n  }\n\n  function keyedSeqFromValue(value) {\n    var seq =\n      Array.isArray(value) ? new ArraySeq(value).fromEntrySeq() :\n      isIterator(value) ? new IteratorSeq(value).fromEntrySeq() :\n      hasIterator(value) ? new IterableSeq(value).fromEntrySeq() :\n      typeof value === 'object' ? new ObjectSeq(value) :\n      undefined;\n    if (!seq) {\n      throw new TypeError(\n        'Expected Array or iterable object of [k, v] entries, '+\n        'or keyed object: ' + value\n      );\n    }\n    return seq;\n  }\n\n  function indexedSeqFromValue(value) {\n    var seq = maybeIndexedSeqFromValue(value);\n    if (!seq) {\n      throw new TypeError(\n        'Expected Array or iterable object of values: ' + value\n      );\n    }\n    return seq;\n  }\n\n  function seqFromValue(value) {\n    var seq = maybeIndexedSeqFromValue(value) ||\n      (typeof value === 'object' && new ObjectSeq(value));\n    if (!seq) {\n      throw new TypeError(\n        'Expected Array or iterable object of values, or keyed object: ' + value\n      );\n    }\n    return seq;\n  }\n\n  function maybeIndexedSeqFromValue(value) {\n    return (\n      isArrayLike(value) ? new ArraySeq(value) :\n      isIterator(value) ? new IteratorSeq(value) :\n      hasIterator(value) ? new IterableSeq(value) :\n      undefined\n    );\n  }\n\n  function seqIterate(seq, fn, reverse, useKeys) {\n    var cache = seq._cache;\n    if (cache) {\n      var maxIndex = cache.length - 1;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        var entry = cache[reverse ? maxIndex - ii : ii];\n        if (fn(entry[1], useKeys ? entry[0] : ii, seq) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    }\n    return seq.__iterateUncached(fn, reverse);\n  }\n\n  function seqIterator(seq, type, reverse, useKeys) {\n    var cache = seq._cache;\n    if (cache) {\n      var maxIndex = cache.length - 1;\n      var ii = 0;\n      return new Iterator(function()  {\n        var entry = cache[reverse ? maxIndex - ii : ii];\n        return ii++ > maxIndex ?\n          iteratorDone() :\n          iteratorValue(type, useKeys ? entry[0] : ii - 1, entry[1]);\n      });\n    }\n    return seq.__iteratorUncached(type, reverse);\n  }\n\n  function fromJS(json, converter) {\n    return converter ?\n      fromJSWith(converter, json, '', {'': json}) :\n      fromJSDefault(json);\n  }\n\n  function fromJSWith(converter, json, key, parentJSON) {\n    if (Array.isArray(json)) {\n      return converter.call(parentJSON, key, IndexedSeq(json).map(function(v, k)  {return fromJSWith(converter, v, k, json)}));\n    }\n    if (isPlainObj(json)) {\n      return converter.call(parentJSON, key, KeyedSeq(json).map(function(v, k)  {return fromJSWith(converter, v, k, json)}));\n    }\n    return json;\n  }\n\n  function fromJSDefault(json) {\n    if (Array.isArray(json)) {\n      return IndexedSeq(json).map(fromJSDefault).toList();\n    }\n    if (isPlainObj(json)) {\n      return KeyedSeq(json).map(fromJSDefault).toMap();\n    }\n    return json;\n  }\n\n  function isPlainObj(value) {\n    return value && (value.constructor === Object || value.constructor === undefined);\n  }\n\n  /**\n   * An extension of the \"same-value\" algorithm as [described for use by ES6 Map\n   * and Set](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map#Key_equality)\n   *\n   * NaN is considered the same as NaN, however -0 and 0 are considered the same\n   * value, which is different from the algorithm described by\n   * [`Object.is`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is).\n   *\n   * This is extended further to allow Objects to describe the values they\n   * represent, by way of `valueOf` or `equals` (and `hashCode`).\n   *\n   * Note: because of this extension, the key equality of Immutable.Map and the\n   * value equality of Immutable.Set will differ from ES6 Map and Set.\n   *\n   * ### Defining custom values\n   *\n   * The easiest way to describe the value an object represents is by implementing\n   * `valueOf`. For example, `Date` represents a value by returning a unix\n   * timestamp for `valueOf`:\n   *\n   *     var date1 = new Date(1234567890000); // Fri Feb 13 2009 ...\n   *     var date2 = new Date(1234567890000);\n   *     date1.valueOf(); // 1234567890000\n   *     assert( date1 !== date2 );\n   *     assert( Immutable.is( date1, date2 ) );\n   *\n   * Note: overriding `valueOf` may have other implications if you use this object\n   * where JavaScript expects a primitive, such as implicit string coercion.\n   *\n   * For more complex types, especially collections, implementing `valueOf` may\n   * not be performant. An alternative is to implement `equals` and `hashCode`.\n   *\n   * `equals` takes another object, presumably of similar type, and returns true\n   * if the it is equal. Equality is symmetrical, so the same result should be\n   * returned if this and the argument are flipped.\n   *\n   *     assert( a.equals(b) === b.equals(a) );\n   *\n   * `hashCode` returns a 32bit integer number representing the object which will\n   * be used to determine how to store the value object in a Map or Set. You must\n   * provide both or neither methods, one must not exist without the other.\n   *\n   * Also, an important relationship between these methods must be upheld: if two\n   * values are equal, they *must* return the same hashCode. If the values are not\n   * equal, they might have the same hashCode; this is called a hash collision,\n   * and while undesirable for performance reasons, it is acceptable.\n   *\n   *     if (a.equals(b)) {\n   *       assert( a.hashCode() === b.hashCode() );\n   *     }\n   *\n   * All Immutable collections implement `equals` and `hashCode`.\n   *\n   */\n  function is(valueA, valueB) {\n    if (valueA === valueB || (valueA !== valueA && valueB !== valueB)) {\n      return true;\n    }\n    if (!valueA || !valueB) {\n      return false;\n    }\n    if (typeof valueA.valueOf === 'function' &&\n        typeof valueB.valueOf === 'function') {\n      valueA = valueA.valueOf();\n      valueB = valueB.valueOf();\n      if (valueA === valueB || (valueA !== valueA && valueB !== valueB)) {\n        return true;\n      }\n      if (!valueA || !valueB) {\n        return false;\n      }\n    }\n    if (typeof valueA.equals === 'function' &&\n        typeof valueB.equals === 'function' &&\n        valueA.equals(valueB)) {\n      return true;\n    }\n    return false;\n  }\n\n  function deepEqual(a, b) {\n    if (a === b) {\n      return true;\n    }\n\n    if (\n      !isIterable(b) ||\n      a.size !== undefined && b.size !== undefined && a.size !== b.size ||\n      a.__hash !== undefined && b.__hash !== undefined && a.__hash !== b.__hash ||\n      isKeyed(a) !== isKeyed(b) ||\n      isIndexed(a) !== isIndexed(b) ||\n      isOrdered(a) !== isOrdered(b)\n    ) {\n      return false;\n    }\n\n    if (a.size === 0 && b.size === 0) {\n      return true;\n    }\n\n    var notAssociative = !isAssociative(a);\n\n    if (isOrdered(a)) {\n      var entries = a.entries();\n      return b.every(function(v, k)  {\n        var entry = entries.next().value;\n        return entry && is(entry[1], v) && (notAssociative || is(entry[0], k));\n      }) && entries.next().done;\n    }\n\n    var flipped = false;\n\n    if (a.size === undefined) {\n      if (b.size === undefined) {\n        if (typeof a.cacheResult === 'function') {\n          a.cacheResult();\n        }\n      } else {\n        flipped = true;\n        var _ = a;\n        a = b;\n        b = _;\n      }\n    }\n\n    var allEqual = true;\n    var bSize = b.__iterate(function(v, k)  {\n      if (notAssociative ? !a.has(v) :\n          flipped ? !is(v, a.get(k, NOT_SET)) : !is(a.get(k, NOT_SET), v)) {\n        allEqual = false;\n        return false;\n      }\n    });\n\n    return allEqual && a.size === bSize;\n  }\n\n  createClass(Repeat, IndexedSeq);\n\n    function Repeat(value, times) {\n      if (!(this instanceof Repeat)) {\n        return new Repeat(value, times);\n      }\n      this._value = value;\n      this.size = times === undefined ? Infinity : Math.max(0, times);\n      if (this.size === 0) {\n        if (EMPTY_REPEAT) {\n          return EMPTY_REPEAT;\n        }\n        EMPTY_REPEAT = this;\n      }\n    }\n\n    Repeat.prototype.toString = function() {\n      if (this.size === 0) {\n        return 'Repeat []';\n      }\n      return 'Repeat [ ' + this._value + ' ' + this.size + ' times ]';\n    };\n\n    Repeat.prototype.get = function(index, notSetValue) {\n      return this.has(index) ? this._value : notSetValue;\n    };\n\n    Repeat.prototype.includes = function(searchValue) {\n      return is(this._value, searchValue);\n    };\n\n    Repeat.prototype.slice = function(begin, end) {\n      var size = this.size;\n      return wholeSlice(begin, end, size) ? this :\n        new Repeat(this._value, resolveEnd(end, size) - resolveBegin(begin, size));\n    };\n\n    Repeat.prototype.reverse = function() {\n      return this;\n    };\n\n    Repeat.prototype.indexOf = function(searchValue) {\n      if (is(this._value, searchValue)) {\n        return 0;\n      }\n      return -1;\n    };\n\n    Repeat.prototype.lastIndexOf = function(searchValue) {\n      if (is(this._value, searchValue)) {\n        return this.size;\n      }\n      return -1;\n    };\n\n    Repeat.prototype.__iterate = function(fn, reverse) {\n      for (var ii = 0; ii < this.size; ii++) {\n        if (fn(this._value, ii, this) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    };\n\n    Repeat.prototype.__iterator = function(type, reverse) {var this$0 = this;\n      var ii = 0;\n      return new Iterator(function() \n        {return ii < this$0.size ? iteratorValue(type, ii++, this$0._value) : iteratorDone()}\n      );\n    };\n\n    Repeat.prototype.equals = function(other) {\n      return other instanceof Repeat ?\n        is(this._value, other._value) :\n        deepEqual(other);\n    };\n\n\n  var EMPTY_REPEAT;\n\n  function invariant(condition, error) {\n    if (!condition) throw new Error(error);\n  }\n\n  createClass(Range, IndexedSeq);\n\n    function Range(start, end, step) {\n      if (!(this instanceof Range)) {\n        return new Range(start, end, step);\n      }\n      invariant(step !== 0, 'Cannot step a Range by 0');\n      start = start || 0;\n      if (end === undefined) {\n        end = Infinity;\n      }\n      step = step === undefined ? 1 : Math.abs(step);\n      if (end < start) {\n        step = -step;\n      }\n      this._start = start;\n      this._end = end;\n      this._step = step;\n      this.size = Math.max(0, Math.ceil((end - start) / step - 1) + 1);\n      if (this.size === 0) {\n        if (EMPTY_RANGE) {\n          return EMPTY_RANGE;\n        }\n        EMPTY_RANGE = this;\n      }\n    }\n\n    Range.prototype.toString = function() {\n      if (this.size === 0) {\n        return 'Range []';\n      }\n      return 'Range [ ' +\n        this._start + '...' + this._end +\n        (this._step > 1 ? ' by ' + this._step : '') +\n      ' ]';\n    };\n\n    Range.prototype.get = function(index, notSetValue) {\n      return this.has(index) ?\n        this._start + wrapIndex(this, index) * this._step :\n        notSetValue;\n    };\n\n    Range.prototype.includes = function(searchValue) {\n      var possibleIndex = (searchValue - this._start) / this._step;\n      return possibleIndex >= 0 &&\n        possibleIndex < this.size &&\n        possibleIndex === Math.floor(possibleIndex);\n    };\n\n    Range.prototype.slice = function(begin, end) {\n      if (wholeSlice(begin, end, this.size)) {\n        return this;\n      }\n      begin = resolveBegin(begin, this.size);\n      end = resolveEnd(end, this.size);\n      if (end <= begin) {\n        return new Range(0, 0);\n      }\n      return new Range(this.get(begin, this._end), this.get(end, this._end), this._step);\n    };\n\n    Range.prototype.indexOf = function(searchValue) {\n      var offsetValue = searchValue - this._start;\n      if (offsetValue % this._step === 0) {\n        var index = offsetValue / this._step;\n        if (index >= 0 && index < this.size) {\n          return index\n        }\n      }\n      return -1;\n    };\n\n    Range.prototype.lastIndexOf = function(searchValue) {\n      return this.indexOf(searchValue);\n    };\n\n    Range.prototype.__iterate = function(fn, reverse) {\n      var maxIndex = this.size - 1;\n      var step = this._step;\n      var value = reverse ? this._start + maxIndex * step : this._start;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        if (fn(value, ii, this) === false) {\n          return ii + 1;\n        }\n        value += reverse ? -step : step;\n      }\n      return ii;\n    };\n\n    Range.prototype.__iterator = function(type, reverse) {\n      var maxIndex = this.size - 1;\n      var step = this._step;\n      var value = reverse ? this._start + maxIndex * step : this._start;\n      var ii = 0;\n      return new Iterator(function()  {\n        var v = value;\n        value += reverse ? -step : step;\n        return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii++, v);\n      });\n    };\n\n    Range.prototype.equals = function(other) {\n      return other instanceof Range ?\n        this._start === other._start &&\n        this._end === other._end &&\n        this._step === other._step :\n        deepEqual(this, other);\n    };\n\n\n  var EMPTY_RANGE;\n\n  createClass(Collection, Iterable);\n    function Collection() {\n      throw TypeError('Abstract');\n    }\n\n\n  createClass(KeyedCollection, Collection);function KeyedCollection() {}\n\n  createClass(IndexedCollection, Collection);function IndexedCollection() {}\n\n  createClass(SetCollection, Collection);function SetCollection() {}\n\n\n  Collection.Keyed = KeyedCollection;\n  Collection.Indexed = IndexedCollection;\n  Collection.Set = SetCollection;\n\n  var imul =\n    typeof Math.imul === 'function' && Math.imul(0xffffffff, 2) === -2 ?\n    Math.imul :\n    function imul(a, b) {\n      a = a | 0; // int\n      b = b | 0; // int\n      var c = a & 0xffff;\n      var d = b & 0xffff;\n      // Shift by 0 fixes the sign on the high part.\n      return (c * d) + ((((a >>> 16) * d + c * (b >>> 16)) << 16) >>> 0) | 0; // int\n    };\n\n  // v8 has an optimization for storing 31-bit signed numbers.\n  // Values which have either 00 or 11 as the high order bits qualify.\n  // This function drops the highest order bit in a signed number, maintaining\n  // the sign bit.\n  function smi(i32) {\n    return ((i32 >>> 1) & 0x40000000) | (i32 & 0xBFFFFFFF);\n  }\n\n  function hash(o) {\n    if (o === false || o === null || o === undefined) {\n      return 0;\n    }\n    if (typeof o.valueOf === 'function') {\n      o = o.valueOf();\n      if (o === false || o === null || o === undefined) {\n        return 0;\n      }\n    }\n    if (o === true) {\n      return 1;\n    }\n    var type = typeof o;\n    if (type === 'number') {\n      var h = o | 0;\n      if (h !== o) {\n        h ^= o * 0xFFFFFFFF;\n      }\n      while (o > 0xFFFFFFFF) {\n        o /= 0xFFFFFFFF;\n        h ^= o;\n      }\n      return smi(h);\n    }\n    if (type === 'string') {\n      return o.length > STRING_HASH_CACHE_MIN_STRLEN ? cachedHashString(o) : hashString(o);\n    }\n    if (typeof o.hashCode === 'function') {\n      return o.hashCode();\n    }\n    if (type === 'object') {\n      return hashJSObj(o);\n    }\n    if (typeof o.toString === 'function') {\n      return hashString(o.toString());\n    }\n    throw new Error('Value type ' + type + ' cannot be hashed.');\n  }\n\n  function cachedHashString(string) {\n    var hash = stringHashCache[string];\n    if (hash === undefined) {\n      hash = hashString(string);\n      if (STRING_HASH_CACHE_SIZE === STRING_HASH_CACHE_MAX_SIZE) {\n        STRING_HASH_CACHE_SIZE = 0;\n        stringHashCache = {};\n      }\n      STRING_HASH_CACHE_SIZE++;\n      stringHashCache[string] = hash;\n    }\n    return hash;\n  }\n\n  // http://jsperf.com/hashing-strings\n  function hashString(string) {\n    // This is the hash from JVM\n    // The hash code for a string is computed as\n    // s[0] * 31 ^ (n - 1) + s[1] * 31 ^ (n - 2) + ... + s[n - 1],\n    // where s[i] is the ith character of the string and n is the length of\n    // the string. We \"mod\" the result to make it between 0 (inclusive) and 2^31\n    // (exclusive) by dropping high bits.\n    var hash = 0;\n    for (var ii = 0; ii < string.length; ii++) {\n      hash = 31 * hash + string.charCodeAt(ii) | 0;\n    }\n    return smi(hash);\n  }\n\n  function hashJSObj(obj) {\n    var hash;\n    if (usingWeakMap) {\n      hash = weakMap.get(obj);\n      if (hash !== undefined) {\n        return hash;\n      }\n    }\n\n    hash = obj[UID_HASH_KEY];\n    if (hash !== undefined) {\n      return hash;\n    }\n\n    if (!canDefineProperty) {\n      hash = obj.propertyIsEnumerable && obj.propertyIsEnumerable[UID_HASH_KEY];\n      if (hash !== undefined) {\n        return hash;\n      }\n\n      hash = getIENodeHash(obj);\n      if (hash !== undefined) {\n        return hash;\n      }\n    }\n\n    hash = ++objHashUID;\n    if (objHashUID & 0x40000000) {\n      objHashUID = 0;\n    }\n\n    if (usingWeakMap) {\n      weakMap.set(obj, hash);\n    } else if (isExtensible !== undefined && isExtensible(obj) === false) {\n      throw new Error('Non-extensible objects are not allowed as keys.');\n    } else if (canDefineProperty) {\n      Object.defineProperty(obj, UID_HASH_KEY, {\n        'enumerable': false,\n        'configurable': false,\n        'writable': false,\n        'value': hash\n      });\n    } else if (obj.propertyIsEnumerable !== undefined &&\n               obj.propertyIsEnumerable === obj.constructor.prototype.propertyIsEnumerable) {\n      // Since we can't define a non-enumerable property on the object\n      // we'll hijack one of the less-used non-enumerable properties to\n      // save our hash on it. Since this is a function it will not show up in\n      // `JSON.stringify` which is what we want.\n      obj.propertyIsEnumerable = function() {\n        return this.constructor.prototype.propertyIsEnumerable.apply(this, arguments);\n      };\n      obj.propertyIsEnumerable[UID_HASH_KEY] = hash;\n    } else if (obj.nodeType !== undefined) {\n      // At this point we couldn't get the IE `uniqueID` to use as a hash\n      // and we couldn't use a non-enumerable property to exploit the\n      // dontEnum bug so we simply add the `UID_HASH_KEY` on the node\n      // itself.\n      obj[UID_HASH_KEY] = hash;\n    } else {\n      throw new Error('Unable to set a non-enumerable property on object.');\n    }\n\n    return hash;\n  }\n\n  // Get references to ES5 object methods.\n  var isExtensible = Object.isExtensible;\n\n  // True if Object.defineProperty works as expected. IE8 fails this test.\n  var canDefineProperty = (function() {\n    try {\n      Object.defineProperty({}, '@', {});\n      return true;\n    } catch (e) {\n      return false;\n    }\n  }());\n\n  // IE has a `uniqueID` property on DOM nodes. We can construct the hash from it\n  // and avoid memory leaks from the IE cloneNode bug.\n  function getIENodeHash(node) {\n    if (node && node.nodeType > 0) {\n      switch (node.nodeType) {\n        case 1: // Element\n          return node.uniqueID;\n        case 9: // Document\n          return node.documentElement && node.documentElement.uniqueID;\n      }\n    }\n  }\n\n  // If possible, use a WeakMap.\n  var usingWeakMap = typeof WeakMap === 'function';\n  var weakMap;\n  if (usingWeakMap) {\n    weakMap = new WeakMap();\n  }\n\n  var objHashUID = 0;\n\n  var UID_HASH_KEY = '__immutablehash__';\n  if (typeof Symbol === 'function') {\n    UID_HASH_KEY = Symbol(UID_HASH_KEY);\n  }\n\n  var STRING_HASH_CACHE_MIN_STRLEN = 16;\n  var STRING_HASH_CACHE_MAX_SIZE = 255;\n  var STRING_HASH_CACHE_SIZE = 0;\n  var stringHashCache = {};\n\n  function assertNotInfinite(size) {\n    invariant(\n      size !== Infinity,\n      'Cannot perform this action with an infinite size.'\n    );\n  }\n\n  createClass(Map, KeyedCollection);\n\n    // @pragma Construction\n\n    function Map(value) {\n      return value === null || value === undefined ? emptyMap() :\n        isMap(value) && !isOrdered(value) ? value :\n        emptyMap().withMutations(function(map ) {\n          var iter = KeyedIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v, k)  {return map.set(k, v)});\n        });\n    }\n\n    Map.prototype.toString = function() {\n      return this.__toString('Map {', '}');\n    };\n\n    // @pragma Access\n\n    Map.prototype.get = function(k, notSetValue) {\n      return this._root ?\n        this._root.get(0, undefined, k, notSetValue) :\n        notSetValue;\n    };\n\n    // @pragma Modification\n\n    Map.prototype.set = function(k, v) {\n      return updateMap(this, k, v);\n    };\n\n    Map.prototype.setIn = function(keyPath, v) {\n      return this.updateIn(keyPath, NOT_SET, function()  {return v});\n    };\n\n    Map.prototype.remove = function(k) {\n      return updateMap(this, k, NOT_SET);\n    };\n\n    Map.prototype.deleteIn = function(keyPath) {\n      return this.updateIn(keyPath, function()  {return NOT_SET});\n    };\n\n    Map.prototype.update = function(k, notSetValue, updater) {\n      return arguments.length === 1 ?\n        k(this) :\n        this.updateIn([k], notSetValue, updater);\n    };\n\n    Map.prototype.updateIn = function(keyPath, notSetValue, updater) {\n      if (!updater) {\n        updater = notSetValue;\n        notSetValue = undefined;\n      }\n      var updatedValue = updateInDeepMap(\n        this,\n        forceIterator(keyPath),\n        notSetValue,\n        updater\n      );\n      return updatedValue === NOT_SET ? undefined : updatedValue;\n    };\n\n    Map.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = 0;\n        this._root = null;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return emptyMap();\n    };\n\n    // @pragma Composition\n\n    Map.prototype.merge = function(/*...iters*/) {\n      return mergeIntoMapWith(this, undefined, arguments);\n    };\n\n    Map.prototype.mergeWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoMapWith(this, merger, iters);\n    };\n\n    Map.prototype.mergeIn = function(keyPath) {var iters = SLICE$0.call(arguments, 1);\n      return this.updateIn(\n        keyPath,\n        emptyMap(),\n        function(m ) {return typeof m.merge === 'function' ?\n          m.merge.apply(m, iters) :\n          iters[iters.length - 1]}\n      );\n    };\n\n    Map.prototype.mergeDeep = function(/*...iters*/) {\n      return mergeIntoMapWith(this, deepMerger, arguments);\n    };\n\n    Map.prototype.mergeDeepWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoMapWith(this, deepMergerWith(merger), iters);\n    };\n\n    Map.prototype.mergeDeepIn = function(keyPath) {var iters = SLICE$0.call(arguments, 1);\n      return this.updateIn(\n        keyPath,\n        emptyMap(),\n        function(m ) {return typeof m.mergeDeep === 'function' ?\n          m.mergeDeep.apply(m, iters) :\n          iters[iters.length - 1]}\n      );\n    };\n\n    Map.prototype.sort = function(comparator) {\n      // Late binding\n      return OrderedMap(sortFactory(this, comparator));\n    };\n\n    Map.prototype.sortBy = function(mapper, comparator) {\n      // Late binding\n      return OrderedMap(sortFactory(this, comparator, mapper));\n    };\n\n    // @pragma Mutability\n\n    Map.prototype.withMutations = function(fn) {\n      var mutable = this.asMutable();\n      fn(mutable);\n      return mutable.wasAltered() ? mutable.__ensureOwner(this.__ownerID) : this;\n    };\n\n    Map.prototype.asMutable = function() {\n      return this.__ownerID ? this : this.__ensureOwner(new OwnerID());\n    };\n\n    Map.prototype.asImmutable = function() {\n      return this.__ensureOwner();\n    };\n\n    Map.prototype.wasAltered = function() {\n      return this.__altered;\n    };\n\n    Map.prototype.__iterator = function(type, reverse) {\n      return new MapIterator(this, type, reverse);\n    };\n\n    Map.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      this._root && this._root.iterate(function(entry ) {\n        iterations++;\n        return fn(entry[1], entry[0], this$0);\n      }, reverse);\n      return iterations;\n    };\n\n    Map.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this.__altered = false;\n        return this;\n      }\n      return makeMap(this.size, this._root, ownerID, this.__hash);\n    };\n\n\n  function isMap(maybeMap) {\n    return !!(maybeMap && maybeMap[IS_MAP_SENTINEL]);\n  }\n\n  Map.isMap = isMap;\n\n  var IS_MAP_SENTINEL = '@@__IMMUTABLE_MAP__@@';\n\n  var MapPrototype = Map.prototype;\n  MapPrototype[IS_MAP_SENTINEL] = true;\n  MapPrototype[DELETE] = MapPrototype.remove;\n  MapPrototype.removeIn = MapPrototype.deleteIn;\n\n\n  // #pragma Trie Nodes\n\n\n\n    function ArrayMapNode(ownerID, entries) {\n      this.ownerID = ownerID;\n      this.entries = entries;\n    }\n\n    ArrayMapNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      var entries = this.entries;\n      for (var ii = 0, len = entries.length; ii < len; ii++) {\n        if (is(key, entries[ii][0])) {\n          return entries[ii][1];\n        }\n      }\n      return notSetValue;\n    };\n\n    ArrayMapNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      var removed = value === NOT_SET;\n\n      var entries = this.entries;\n      var idx = 0;\n      for (var len = entries.length; idx < len; idx++) {\n        if (is(key, entries[idx][0])) {\n          break;\n        }\n      }\n      var exists = idx < len;\n\n      if (exists ? entries[idx][1] === value : removed) {\n        return this;\n      }\n\n      SetRef(didAlter);\n      (removed || !exists) && SetRef(didChangeSize);\n\n      if (removed && entries.length === 1) {\n        return; // undefined\n      }\n\n      if (!exists && !removed && entries.length >= MAX_ARRAY_MAP_SIZE) {\n        return createNodes(ownerID, entries, key, value);\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newEntries = isEditable ? entries : arrCopy(entries);\n\n      if (exists) {\n        if (removed) {\n          idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\n        } else {\n          newEntries[idx] = [key, value];\n        }\n      } else {\n        newEntries.push([key, value]);\n      }\n\n      if (isEditable) {\n        this.entries = newEntries;\n        return this;\n      }\n\n      return new ArrayMapNode(ownerID, newEntries);\n    };\n\n\n\n\n    function BitmapIndexedNode(ownerID, bitmap, nodes) {\n      this.ownerID = ownerID;\n      this.bitmap = bitmap;\n      this.nodes = nodes;\n    }\n\n    BitmapIndexedNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var bit = (1 << ((shift === 0 ? keyHash : keyHash >>> shift) & MASK));\n      var bitmap = this.bitmap;\n      return (bitmap & bit) === 0 ? notSetValue :\n        this.nodes[popCount(bitmap & (bit - 1))].get(shift + SHIFT, keyHash, key, notSetValue);\n    };\n\n    BitmapIndexedNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var keyHashFrag = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n      var bit = 1 << keyHashFrag;\n      var bitmap = this.bitmap;\n      var exists = (bitmap & bit) !== 0;\n\n      if (!exists && value === NOT_SET) {\n        return this;\n      }\n\n      var idx = popCount(bitmap & (bit - 1));\n      var nodes = this.nodes;\n      var node = exists ? nodes[idx] : undefined;\n      var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\n\n      if (newNode === node) {\n        return this;\n      }\n\n      if (!exists && newNode && nodes.length >= MAX_BITMAP_INDEXED_SIZE) {\n        return expandNodes(ownerID, nodes, bitmap, keyHashFrag, newNode);\n      }\n\n      if (exists && !newNode && nodes.length === 2 && isLeafNode(nodes[idx ^ 1])) {\n        return nodes[idx ^ 1];\n      }\n\n      if (exists && newNode && nodes.length === 1 && isLeafNode(newNode)) {\n        return newNode;\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newBitmap = exists ? newNode ? bitmap : bitmap ^ bit : bitmap | bit;\n      var newNodes = exists ? newNode ?\n        setIn(nodes, idx, newNode, isEditable) :\n        spliceOut(nodes, idx, isEditable) :\n        spliceIn(nodes, idx, newNode, isEditable);\n\n      if (isEditable) {\n        this.bitmap = newBitmap;\n        this.nodes = newNodes;\n        return this;\n      }\n\n      return new BitmapIndexedNode(ownerID, newBitmap, newNodes);\n    };\n\n\n\n\n    function HashArrayMapNode(ownerID, count, nodes) {\n      this.ownerID = ownerID;\n      this.count = count;\n      this.nodes = nodes;\n    }\n\n    HashArrayMapNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n      var node = this.nodes[idx];\n      return node ? node.get(shift + SHIFT, keyHash, key, notSetValue) : notSetValue;\n    };\n\n    HashArrayMapNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n      var removed = value === NOT_SET;\n      var nodes = this.nodes;\n      var node = nodes[idx];\n\n      if (removed && !node) {\n        return this;\n      }\n\n      var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\n      if (newNode === node) {\n        return this;\n      }\n\n      var newCount = this.count;\n      if (!node) {\n        newCount++;\n      } else if (!newNode) {\n        newCount--;\n        if (newCount < MIN_HASH_ARRAY_MAP_SIZE) {\n          return packNodes(ownerID, nodes, newCount, idx);\n        }\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newNodes = setIn(nodes, idx, newNode, isEditable);\n\n      if (isEditable) {\n        this.count = newCount;\n        this.nodes = newNodes;\n        return this;\n      }\n\n      return new HashArrayMapNode(ownerID, newCount, newNodes);\n    };\n\n\n\n\n    function HashCollisionNode(ownerID, keyHash, entries) {\n      this.ownerID = ownerID;\n      this.keyHash = keyHash;\n      this.entries = entries;\n    }\n\n    HashCollisionNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      var entries = this.entries;\n      for (var ii = 0, len = entries.length; ii < len; ii++) {\n        if (is(key, entries[ii][0])) {\n          return entries[ii][1];\n        }\n      }\n      return notSetValue;\n    };\n\n    HashCollisionNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n\n      var removed = value === NOT_SET;\n\n      if (keyHash !== this.keyHash) {\n        if (removed) {\n          return this;\n        }\n        SetRef(didAlter);\n        SetRef(didChangeSize);\n        return mergeIntoNode(this, ownerID, shift, keyHash, [key, value]);\n      }\n\n      var entries = this.entries;\n      var idx = 0;\n      for (var len = entries.length; idx < len; idx++) {\n        if (is(key, entries[idx][0])) {\n          break;\n        }\n      }\n      var exists = idx < len;\n\n      if (exists ? entries[idx][1] === value : removed) {\n        return this;\n      }\n\n      SetRef(didAlter);\n      (removed || !exists) && SetRef(didChangeSize);\n\n      if (removed && len === 2) {\n        return new ValueNode(ownerID, this.keyHash, entries[idx ^ 1]);\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newEntries = isEditable ? entries : arrCopy(entries);\n\n      if (exists) {\n        if (removed) {\n          idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\n        } else {\n          newEntries[idx] = [key, value];\n        }\n      } else {\n        newEntries.push([key, value]);\n      }\n\n      if (isEditable) {\n        this.entries = newEntries;\n        return this;\n      }\n\n      return new HashCollisionNode(ownerID, this.keyHash, newEntries);\n    };\n\n\n\n\n    function ValueNode(ownerID, keyHash, entry) {\n      this.ownerID = ownerID;\n      this.keyHash = keyHash;\n      this.entry = entry;\n    }\n\n    ValueNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      return is(key, this.entry[0]) ? this.entry[1] : notSetValue;\n    };\n\n    ValueNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      var removed = value === NOT_SET;\n      var keyMatch = is(key, this.entry[0]);\n      if (keyMatch ? value === this.entry[1] : removed) {\n        return this;\n      }\n\n      SetRef(didAlter);\n\n      if (removed) {\n        SetRef(didChangeSize);\n        return; // undefined\n      }\n\n      if (keyMatch) {\n        if (ownerID && ownerID === this.ownerID) {\n          this.entry[1] = value;\n          return this;\n        }\n        return new ValueNode(ownerID, this.keyHash, [key, value]);\n      }\n\n      SetRef(didChangeSize);\n      return mergeIntoNode(this, ownerID, shift, hash(key), [key, value]);\n    };\n\n\n\n  // #pragma Iterators\n\n  ArrayMapNode.prototype.iterate =\n  HashCollisionNode.prototype.iterate = function (fn, reverse) {\n    var entries = this.entries;\n    for (var ii = 0, maxIndex = entries.length - 1; ii <= maxIndex; ii++) {\n      if (fn(entries[reverse ? maxIndex - ii : ii]) === false) {\n        return false;\n      }\n    }\n  }\n\n  BitmapIndexedNode.prototype.iterate =\n  HashArrayMapNode.prototype.iterate = function (fn, reverse) {\n    var nodes = this.nodes;\n    for (var ii = 0, maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\n      var node = nodes[reverse ? maxIndex - ii : ii];\n      if (node && node.iterate(fn, reverse) === false) {\n        return false;\n      }\n    }\n  }\n\n  ValueNode.prototype.iterate = function (fn, reverse) {\n    return fn(this.entry);\n  }\n\n  createClass(MapIterator, Iterator);\n\n    function MapIterator(map, type, reverse) {\n      this._type = type;\n      this._reverse = reverse;\n      this._stack = map._root && mapIteratorFrame(map._root);\n    }\n\n    MapIterator.prototype.next = function() {\n      var type = this._type;\n      var stack = this._stack;\n      while (stack) {\n        var node = stack.node;\n        var index = stack.index++;\n        var maxIndex;\n        if (node.entry) {\n          if (index === 0) {\n            return mapIteratorValue(type, node.entry);\n          }\n        } else if (node.entries) {\n          maxIndex = node.entries.length - 1;\n          if (index <= maxIndex) {\n            return mapIteratorValue(type, node.entries[this._reverse ? maxIndex - index : index]);\n          }\n        } else {\n          maxIndex = node.nodes.length - 1;\n          if (index <= maxIndex) {\n            var subNode = node.nodes[this._reverse ? maxIndex - index : index];\n            if (subNode) {\n              if (subNode.entry) {\n                return mapIteratorValue(type, subNode.entry);\n              }\n              stack = this._stack = mapIteratorFrame(subNode, stack);\n            }\n            continue;\n          }\n        }\n        stack = this._stack = this._stack.__prev;\n      }\n      return iteratorDone();\n    };\n\n\n  function mapIteratorValue(type, entry) {\n    return iteratorValue(type, entry[0], entry[1]);\n  }\n\n  function mapIteratorFrame(node, prev) {\n    return {\n      node: node,\n      index: 0,\n      __prev: prev\n    };\n  }\n\n  function makeMap(size, root, ownerID, hash) {\n    var map = Object.create(MapPrototype);\n    map.size = size;\n    map._root = root;\n    map.__ownerID = ownerID;\n    map.__hash = hash;\n    map.__altered = false;\n    return map;\n  }\n\n  var EMPTY_MAP;\n  function emptyMap() {\n    return EMPTY_MAP || (EMPTY_MAP = makeMap(0));\n  }\n\n  function updateMap(map, k, v) {\n    var newRoot;\n    var newSize;\n    if (!map._root) {\n      if (v === NOT_SET) {\n        return map;\n      }\n      newSize = 1;\n      newRoot = new ArrayMapNode(map.__ownerID, [[k, v]]);\n    } else {\n      var didChangeSize = MakeRef(CHANGE_LENGTH);\n      var didAlter = MakeRef(DID_ALTER);\n      newRoot = updateNode(map._root, map.__ownerID, 0, undefined, k, v, didChangeSize, didAlter);\n      if (!didAlter.value) {\n        return map;\n      }\n      newSize = map.size + (didChangeSize.value ? v === NOT_SET ? -1 : 1 : 0);\n    }\n    if (map.__ownerID) {\n      map.size = newSize;\n      map._root = newRoot;\n      map.__hash = undefined;\n      map.__altered = true;\n      return map;\n    }\n    return newRoot ? makeMap(newSize, newRoot) : emptyMap();\n  }\n\n  function updateNode(node, ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n    if (!node) {\n      if (value === NOT_SET) {\n        return node;\n      }\n      SetRef(didAlter);\n      SetRef(didChangeSize);\n      return new ValueNode(ownerID, keyHash, [key, value]);\n    }\n    return node.update(ownerID, shift, keyHash, key, value, didChangeSize, didAlter);\n  }\n\n  function isLeafNode(node) {\n    return node.constructor === ValueNode || node.constructor === HashCollisionNode;\n  }\n\n  function mergeIntoNode(node, ownerID, shift, keyHash, entry) {\n    if (node.keyHash === keyHash) {\n      return new HashCollisionNode(ownerID, keyHash, [node.entry, entry]);\n    }\n\n    var idx1 = (shift === 0 ? node.keyHash : node.keyHash >>> shift) & MASK;\n    var idx2 = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n\n    var newNode;\n    var nodes = idx1 === idx2 ?\n      [mergeIntoNode(node, ownerID, shift + SHIFT, keyHash, entry)] :\n      ((newNode = new ValueNode(ownerID, keyHash, entry)), idx1 < idx2 ? [node, newNode] : [newNode, node]);\n\n    return new BitmapIndexedNode(ownerID, (1 << idx1) | (1 << idx2), nodes);\n  }\n\n  function createNodes(ownerID, entries, key, value) {\n    if (!ownerID) {\n      ownerID = new OwnerID();\n    }\n    var node = new ValueNode(ownerID, hash(key), [key, value]);\n    for (var ii = 0; ii < entries.length; ii++) {\n      var entry = entries[ii];\n      node = node.update(ownerID, 0, undefined, entry[0], entry[1]);\n    }\n    return node;\n  }\n\n  function packNodes(ownerID, nodes, count, excluding) {\n    var bitmap = 0;\n    var packedII = 0;\n    var packedNodes = new Array(count);\n    for (var ii = 0, bit = 1, len = nodes.length; ii < len; ii++, bit <<= 1) {\n      var node = nodes[ii];\n      if (node !== undefined && ii !== excluding) {\n        bitmap |= bit;\n        packedNodes[packedII++] = node;\n      }\n    }\n    return new BitmapIndexedNode(ownerID, bitmap, packedNodes);\n  }\n\n  function expandNodes(ownerID, nodes, bitmap, including, node) {\n    var count = 0;\n    var expandedNodes = new Array(SIZE);\n    for (var ii = 0; bitmap !== 0; ii++, bitmap >>>= 1) {\n      expandedNodes[ii] = bitmap & 1 ? nodes[count++] : undefined;\n    }\n    expandedNodes[including] = node;\n    return new HashArrayMapNode(ownerID, count + 1, expandedNodes);\n  }\n\n  function mergeIntoMapWith(map, merger, iterables) {\n    var iters = [];\n    for (var ii = 0; ii < iterables.length; ii++) {\n      var value = iterables[ii];\n      var iter = KeyedIterable(value);\n      if (!isIterable(value)) {\n        iter = iter.map(function(v ) {return fromJS(v)});\n      }\n      iters.push(iter);\n    }\n    return mergeIntoCollectionWith(map, merger, iters);\n  }\n\n  function deepMerger(existing, value, key) {\n    return existing && existing.mergeDeep && isIterable(value) ?\n      existing.mergeDeep(value) :\n      is(existing, value) ? existing : value;\n  }\n\n  function deepMergerWith(merger) {\n    return function(existing, value, key)  {\n      if (existing && existing.mergeDeepWith && isIterable(value)) {\n        return existing.mergeDeepWith(merger, value);\n      }\n      var nextValue = merger(existing, value, key);\n      return is(existing, nextValue) ? existing : nextValue;\n    };\n  }\n\n  function mergeIntoCollectionWith(collection, merger, iters) {\n    iters = iters.filter(function(x ) {return x.size !== 0});\n    if (iters.length === 0) {\n      return collection;\n    }\n    if (collection.size === 0 && !collection.__ownerID && iters.length === 1) {\n      return collection.constructor(iters[0]);\n    }\n    return collection.withMutations(function(collection ) {\n      var mergeIntoMap = merger ?\n        function(value, key)  {\n          collection.update(key, NOT_SET, function(existing )\n            {return existing === NOT_SET ? value : merger(existing, value, key)}\n          );\n        } :\n        function(value, key)  {\n          collection.set(key, value);\n        }\n      for (var ii = 0; ii < iters.length; ii++) {\n        iters[ii].forEach(mergeIntoMap);\n      }\n    });\n  }\n\n  function updateInDeepMap(existing, keyPathIter, notSetValue, updater) {\n    var isNotSet = existing === NOT_SET;\n    var step = keyPathIter.next();\n    if (step.done) {\n      var existingValue = isNotSet ? notSetValue : existing;\n      var newValue = updater(existingValue);\n      return newValue === existingValue ? existing : newValue;\n    }\n    invariant(\n      isNotSet || (existing && existing.set),\n      'invalid keyPath'\n    );\n    var key = step.value;\n    var nextExisting = isNotSet ? NOT_SET : existing.get(key, NOT_SET);\n    var nextUpdated = updateInDeepMap(\n      nextExisting,\n      keyPathIter,\n      notSetValue,\n      updater\n    );\n    return nextUpdated === nextExisting ? existing :\n      nextUpdated === NOT_SET ? existing.remove(key) :\n      (isNotSet ? emptyMap() : existing).set(key, nextUpdated);\n  }\n\n  function popCount(x) {\n    x = x - ((x >> 1) & 0x55555555);\n    x = (x & 0x33333333) + ((x >> 2) & 0x33333333);\n    x = (x + (x >> 4)) & 0x0f0f0f0f;\n    x = x + (x >> 8);\n    x = x + (x >> 16);\n    return x & 0x7f;\n  }\n\n  function setIn(array, idx, val, canEdit) {\n    var newArray = canEdit ? array : arrCopy(array);\n    newArray[idx] = val;\n    return newArray;\n  }\n\n  function spliceIn(array, idx, val, canEdit) {\n    var newLen = array.length + 1;\n    if (canEdit && idx + 1 === newLen) {\n      array[idx] = val;\n      return array;\n    }\n    var newArray = new Array(newLen);\n    var after = 0;\n    for (var ii = 0; ii < newLen; ii++) {\n      if (ii === idx) {\n        newArray[ii] = val;\n        after = -1;\n      } else {\n        newArray[ii] = array[ii + after];\n      }\n    }\n    return newArray;\n  }\n\n  function spliceOut(array, idx, canEdit) {\n    var newLen = array.length - 1;\n    if (canEdit && idx === newLen) {\n      array.pop();\n      return array;\n    }\n    var newArray = new Array(newLen);\n    var after = 0;\n    for (var ii = 0; ii < newLen; ii++) {\n      if (ii === idx) {\n        after = 1;\n      }\n      newArray[ii] = array[ii + after];\n    }\n    return newArray;\n  }\n\n  var MAX_ARRAY_MAP_SIZE = SIZE / 4;\n  var MAX_BITMAP_INDEXED_SIZE = SIZE / 2;\n  var MIN_HASH_ARRAY_MAP_SIZE = SIZE / 4;\n\n  createClass(List, IndexedCollection);\n\n    // @pragma Construction\n\n    function List(value) {\n      var empty = emptyList();\n      if (value === null || value === undefined) {\n        return empty;\n      }\n      if (isList(value)) {\n        return value;\n      }\n      var iter = IndexedIterable(value);\n      var size = iter.size;\n      if (size === 0) {\n        return empty;\n      }\n      assertNotInfinite(size);\n      if (size > 0 && size < SIZE) {\n        return makeList(0, size, SHIFT, null, new VNode(iter.toArray()));\n      }\n      return empty.withMutations(function(list ) {\n        list.setSize(size);\n        iter.forEach(function(v, i)  {return list.set(i, v)});\n      });\n    }\n\n    List.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    List.prototype.toString = function() {\n      return this.__toString('List [', ']');\n    };\n\n    // @pragma Access\n\n    List.prototype.get = function(index, notSetValue) {\n      index = wrapIndex(this, index);\n      if (index >= 0 && index < this.size) {\n        index += this._origin;\n        var node = listNodeFor(this, index);\n        return node && node.array[index & MASK];\n      }\n      return notSetValue;\n    };\n\n    // @pragma Modification\n\n    List.prototype.set = function(index, value) {\n      return updateList(this, index, value);\n    };\n\n    List.prototype.remove = function(index) {\n      return !this.has(index) ? this :\n        index === 0 ? this.shift() :\n        index === this.size - 1 ? this.pop() :\n        this.splice(index, 1);\n    };\n\n    List.prototype.insert = function(index, value) {\n      return this.splice(index, 0, value);\n    };\n\n    List.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = this._origin = this._capacity = 0;\n        this._level = SHIFT;\n        this._root = this._tail = null;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return emptyList();\n    };\n\n    List.prototype.push = function(/*...values*/) {\n      var values = arguments;\n      var oldSize = this.size;\n      return this.withMutations(function(list ) {\n        setListBounds(list, 0, oldSize + values.length);\n        for (var ii = 0; ii < values.length; ii++) {\n          list.set(oldSize + ii, values[ii]);\n        }\n      });\n    };\n\n    List.prototype.pop = function() {\n      return setListBounds(this, 0, -1);\n    };\n\n    List.prototype.unshift = function(/*...values*/) {\n      var values = arguments;\n      return this.withMutations(function(list ) {\n        setListBounds(list, -values.length);\n        for (var ii = 0; ii < values.length; ii++) {\n          list.set(ii, values[ii]);\n        }\n      });\n    };\n\n    List.prototype.shift = function() {\n      return setListBounds(this, 1);\n    };\n\n    // @pragma Composition\n\n    List.prototype.merge = function(/*...iters*/) {\n      return mergeIntoListWith(this, undefined, arguments);\n    };\n\n    List.prototype.mergeWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoListWith(this, merger, iters);\n    };\n\n    List.prototype.mergeDeep = function(/*...iters*/) {\n      return mergeIntoListWith(this, deepMerger, arguments);\n    };\n\n    List.prototype.mergeDeepWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoListWith(this, deepMergerWith(merger), iters);\n    };\n\n    List.prototype.setSize = function(size) {\n      return setListBounds(this, 0, size);\n    };\n\n    // @pragma Iteration\n\n    List.prototype.slice = function(begin, end) {\n      var size = this.size;\n      if (wholeSlice(begin, end, size)) {\n        return this;\n      }\n      return setListBounds(\n        this,\n        resolveBegin(begin, size),\n        resolveEnd(end, size)\n      );\n    };\n\n    List.prototype.__iterator = function(type, reverse) {\n      var index = 0;\n      var values = iterateList(this, reverse);\n      return new Iterator(function()  {\n        var value = values();\n        return value === DONE ?\n          iteratorDone() :\n          iteratorValue(type, index++, value);\n      });\n    };\n\n    List.prototype.__iterate = function(fn, reverse) {\n      var index = 0;\n      var values = iterateList(this, reverse);\n      var value;\n      while ((value = values()) !== DONE) {\n        if (fn(value, index++, this) === false) {\n          break;\n        }\n      }\n      return index;\n    };\n\n    List.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        return this;\n      }\n      return makeList(this._origin, this._capacity, this._level, this._root, this._tail, ownerID, this.__hash);\n    };\n\n\n  function isList(maybeList) {\n    return !!(maybeList && maybeList[IS_LIST_SENTINEL]);\n  }\n\n  List.isList = isList;\n\n  var IS_LIST_SENTINEL = '@@__IMMUTABLE_LIST__@@';\n\n  var ListPrototype = List.prototype;\n  ListPrototype[IS_LIST_SENTINEL] = true;\n  ListPrototype[DELETE] = ListPrototype.remove;\n  ListPrototype.setIn = MapPrototype.setIn;\n  ListPrototype.deleteIn =\n  ListPrototype.removeIn = MapPrototype.removeIn;\n  ListPrototype.update = MapPrototype.update;\n  ListPrototype.updateIn = MapPrototype.updateIn;\n  ListPrototype.mergeIn = MapPrototype.mergeIn;\n  ListPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\n  ListPrototype.withMutations = MapPrototype.withMutations;\n  ListPrototype.asMutable = MapPrototype.asMutable;\n  ListPrototype.asImmutable = MapPrototype.asImmutable;\n  ListPrototype.wasAltered = MapPrototype.wasAltered;\n\n\n\n    function VNode(array, ownerID) {\n      this.array = array;\n      this.ownerID = ownerID;\n    }\n\n    // TODO: seems like these methods are very similar\n\n    VNode.prototype.removeBefore = function(ownerID, level, index) {\n      if (index === level ? 1 << level : 0 || this.array.length === 0) {\n        return this;\n      }\n      var originIndex = (index >>> level) & MASK;\n      if (originIndex >= this.array.length) {\n        return new VNode([], ownerID);\n      }\n      var removingFirst = originIndex === 0;\n      var newChild;\n      if (level > 0) {\n        var oldChild = this.array[originIndex];\n        newChild = oldChild && oldChild.removeBefore(ownerID, level - SHIFT, index);\n        if (newChild === oldChild && removingFirst) {\n          return this;\n        }\n      }\n      if (removingFirst && !newChild) {\n        return this;\n      }\n      var editable = editableVNode(this, ownerID);\n      if (!removingFirst) {\n        for (var ii = 0; ii < originIndex; ii++) {\n          editable.array[ii] = undefined;\n        }\n      }\n      if (newChild) {\n        editable.array[originIndex] = newChild;\n      }\n      return editable;\n    };\n\n    VNode.prototype.removeAfter = function(ownerID, level, index) {\n      if (index === (level ? 1 << level : 0) || this.array.length === 0) {\n        return this;\n      }\n      var sizeIndex = ((index - 1) >>> level) & MASK;\n      if (sizeIndex >= this.array.length) {\n        return this;\n      }\n\n      var newChild;\n      if (level > 0) {\n        var oldChild = this.array[sizeIndex];\n        newChild = oldChild && oldChild.removeAfter(ownerID, level - SHIFT, index);\n        if (newChild === oldChild && sizeIndex === this.array.length - 1) {\n          return this;\n        }\n      }\n\n      var editable = editableVNode(this, ownerID);\n      editable.array.splice(sizeIndex + 1);\n      if (newChild) {\n        editable.array[sizeIndex] = newChild;\n      }\n      return editable;\n    };\n\n\n\n  var DONE = {};\n\n  function iterateList(list, reverse) {\n    var left = list._origin;\n    var right = list._capacity;\n    var tailPos = getTailOffset(right);\n    var tail = list._tail;\n\n    return iterateNodeOrLeaf(list._root, list._level, 0);\n\n    function iterateNodeOrLeaf(node, level, offset) {\n      return level === 0 ?\n        iterateLeaf(node, offset) :\n        iterateNode(node, level, offset);\n    }\n\n    function iterateLeaf(node, offset) {\n      var array = offset === tailPos ? tail && tail.array : node && node.array;\n      var from = offset > left ? 0 : left - offset;\n      var to = right - offset;\n      if (to > SIZE) {\n        to = SIZE;\n      }\n      return function()  {\n        if (from === to) {\n          return DONE;\n        }\n        var idx = reverse ? --to : from++;\n        return array && array[idx];\n      };\n    }\n\n    function iterateNode(node, level, offset) {\n      var values;\n      var array = node && node.array;\n      var from = offset > left ? 0 : (left - offset) >> level;\n      var to = ((right - offset) >> level) + 1;\n      if (to > SIZE) {\n        to = SIZE;\n      }\n      return function()  {\n        do {\n          if (values) {\n            var value = values();\n            if (value !== DONE) {\n              return value;\n            }\n            values = null;\n          }\n          if (from === to) {\n            return DONE;\n          }\n          var idx = reverse ? --to : from++;\n          values = iterateNodeOrLeaf(\n            array && array[idx], level - SHIFT, offset + (idx << level)\n          );\n        } while (true);\n      };\n    }\n  }\n\n  function makeList(origin, capacity, level, root, tail, ownerID, hash) {\n    var list = Object.create(ListPrototype);\n    list.size = capacity - origin;\n    list._origin = origin;\n    list._capacity = capacity;\n    list._level = level;\n    list._root = root;\n    list._tail = tail;\n    list.__ownerID = ownerID;\n    list.__hash = hash;\n    list.__altered = false;\n    return list;\n  }\n\n  var EMPTY_LIST;\n  function emptyList() {\n    return EMPTY_LIST || (EMPTY_LIST = makeList(0, 0, SHIFT));\n  }\n\n  function updateList(list, index, value) {\n    index = wrapIndex(list, index);\n\n    if (index !== index) {\n      return list;\n    }\n\n    if (index >= list.size || index < 0) {\n      return list.withMutations(function(list ) {\n        index < 0 ?\n          setListBounds(list, index).set(0, value) :\n          setListBounds(list, 0, index + 1).set(index, value)\n      });\n    }\n\n    index += list._origin;\n\n    var newTail = list._tail;\n    var newRoot = list._root;\n    var didAlter = MakeRef(DID_ALTER);\n    if (index >= getTailOffset(list._capacity)) {\n      newTail = updateVNode(newTail, list.__ownerID, 0, index, value, didAlter);\n    } else {\n      newRoot = updateVNode(newRoot, list.__ownerID, list._level, index, value, didAlter);\n    }\n\n    if (!didAlter.value) {\n      return list;\n    }\n\n    if (list.__ownerID) {\n      list._root = newRoot;\n      list._tail = newTail;\n      list.__hash = undefined;\n      list.__altered = true;\n      return list;\n    }\n    return makeList(list._origin, list._capacity, list._level, newRoot, newTail);\n  }\n\n  function updateVNode(node, ownerID, level, index, value, didAlter) {\n    var idx = (index >>> level) & MASK;\n    var nodeHas = node && idx < node.array.length;\n    if (!nodeHas && value === undefined) {\n      return node;\n    }\n\n    var newNode;\n\n    if (level > 0) {\n      var lowerNode = node && node.array[idx];\n      var newLowerNode = updateVNode(lowerNode, ownerID, level - SHIFT, index, value, didAlter);\n      if (newLowerNode === lowerNode) {\n        return node;\n      }\n      newNode = editableVNode(node, ownerID);\n      newNode.array[idx] = newLowerNode;\n      return newNode;\n    }\n\n    if (nodeHas && node.array[idx] === value) {\n      return node;\n    }\n\n    SetRef(didAlter);\n\n    newNode = editableVNode(node, ownerID);\n    if (value === undefined && idx === newNode.array.length - 1) {\n      newNode.array.pop();\n    } else {\n      newNode.array[idx] = value;\n    }\n    return newNode;\n  }\n\n  function editableVNode(node, ownerID) {\n    if (ownerID && node && ownerID === node.ownerID) {\n      return node;\n    }\n    return new VNode(node ? node.array.slice() : [], ownerID);\n  }\n\n  function listNodeFor(list, rawIndex) {\n    if (rawIndex >= getTailOffset(list._capacity)) {\n      return list._tail;\n    }\n    if (rawIndex < 1 << (list._level + SHIFT)) {\n      var node = list._root;\n      var level = list._level;\n      while (node && level > 0) {\n        node = node.array[(rawIndex >>> level) & MASK];\n        level -= SHIFT;\n      }\n      return node;\n    }\n  }\n\n  function setListBounds(list, begin, end) {\n    // Sanitize begin & end using this shorthand for ToInt32(argument)\n    // http://www.ecma-international.org/ecma-262/6.0/#sec-toint32\n    if (begin !== undefined) {\n      begin = begin | 0;\n    }\n    if (end !== undefined) {\n      end = end | 0;\n    }\n    var owner = list.__ownerID || new OwnerID();\n    var oldOrigin = list._origin;\n    var oldCapacity = list._capacity;\n    var newOrigin = oldOrigin + begin;\n    var newCapacity = end === undefined ? oldCapacity : end < 0 ? oldCapacity + end : oldOrigin + end;\n    if (newOrigin === oldOrigin && newCapacity === oldCapacity) {\n      return list;\n    }\n\n    // If it's going to end after it starts, it's empty.\n    if (newOrigin >= newCapacity) {\n      return list.clear();\n    }\n\n    var newLevel = list._level;\n    var newRoot = list._root;\n\n    // New origin might need creating a higher root.\n    var offsetShift = 0;\n    while (newOrigin + offsetShift < 0) {\n      newRoot = new VNode(newRoot && newRoot.array.length ? [undefined, newRoot] : [], owner);\n      newLevel += SHIFT;\n      offsetShift += 1 << newLevel;\n    }\n    if (offsetShift) {\n      newOrigin += offsetShift;\n      oldOrigin += offsetShift;\n      newCapacity += offsetShift;\n      oldCapacity += offsetShift;\n    }\n\n    var oldTailOffset = getTailOffset(oldCapacity);\n    var newTailOffset = getTailOffset(newCapacity);\n\n    // New size might need creating a higher root.\n    while (newTailOffset >= 1 << (newLevel + SHIFT)) {\n      newRoot = new VNode(newRoot && newRoot.array.length ? [newRoot] : [], owner);\n      newLevel += SHIFT;\n    }\n\n    // Locate or create the new tail.\n    var oldTail = list._tail;\n    var newTail = newTailOffset < oldTailOffset ?\n      listNodeFor(list, newCapacity - 1) :\n      newTailOffset > oldTailOffset ? new VNode([], owner) : oldTail;\n\n    // Merge Tail into tree.\n    if (oldTail && newTailOffset > oldTailOffset && newOrigin < oldCapacity && oldTail.array.length) {\n      newRoot = editableVNode(newRoot, owner);\n      var node = newRoot;\n      for (var level = newLevel; level > SHIFT; level -= SHIFT) {\n        var idx = (oldTailOffset >>> level) & MASK;\n        node = node.array[idx] = editableVNode(node.array[idx], owner);\n      }\n      node.array[(oldTailOffset >>> SHIFT) & MASK] = oldTail;\n    }\n\n    // If the size has been reduced, there's a chance the tail needs to be trimmed.\n    if (newCapacity < oldCapacity) {\n      newTail = newTail && newTail.removeAfter(owner, 0, newCapacity);\n    }\n\n    // If the new origin is within the tail, then we do not need a root.\n    if (newOrigin >= newTailOffset) {\n      newOrigin -= newTailOffset;\n      newCapacity -= newTailOffset;\n      newLevel = SHIFT;\n      newRoot = null;\n      newTail = newTail && newTail.removeBefore(owner, 0, newOrigin);\n\n    // Otherwise, if the root has been trimmed, garbage collect.\n    } else if (newOrigin > oldOrigin || newTailOffset < oldTailOffset) {\n      offsetShift = 0;\n\n      // Identify the new top root node of the subtree of the old root.\n      while (newRoot) {\n        var beginIndex = (newOrigin >>> newLevel) & MASK;\n        if (beginIndex !== (newTailOffset >>> newLevel) & MASK) {\n          break;\n        }\n        if (beginIndex) {\n          offsetShift += (1 << newLevel) * beginIndex;\n        }\n        newLevel -= SHIFT;\n        newRoot = newRoot.array[beginIndex];\n      }\n\n      // Trim the new sides of the new root.\n      if (newRoot && newOrigin > oldOrigin) {\n        newRoot = newRoot.removeBefore(owner, newLevel, newOrigin - offsetShift);\n      }\n      if (newRoot && newTailOffset < oldTailOffset) {\n        newRoot = newRoot.removeAfter(owner, newLevel, newTailOffset - offsetShift);\n      }\n      if (offsetShift) {\n        newOrigin -= offsetShift;\n        newCapacity -= offsetShift;\n      }\n    }\n\n    if (list.__ownerID) {\n      list.size = newCapacity - newOrigin;\n      list._origin = newOrigin;\n      list._capacity = newCapacity;\n      list._level = newLevel;\n      list._root = newRoot;\n      list._tail = newTail;\n      list.__hash = undefined;\n      list.__altered = true;\n      return list;\n    }\n    return makeList(newOrigin, newCapacity, newLevel, newRoot, newTail);\n  }\n\n  function mergeIntoListWith(list, merger, iterables) {\n    var iters = [];\n    var maxSize = 0;\n    for (var ii = 0; ii < iterables.length; ii++) {\n      var value = iterables[ii];\n      var iter = IndexedIterable(value);\n      if (iter.size > maxSize) {\n        maxSize = iter.size;\n      }\n      if (!isIterable(value)) {\n        iter = iter.map(function(v ) {return fromJS(v)});\n      }\n      iters.push(iter);\n    }\n    if (maxSize > list.size) {\n      list = list.setSize(maxSize);\n    }\n    return mergeIntoCollectionWith(list, merger, iters);\n  }\n\n  function getTailOffset(size) {\n    return size < SIZE ? 0 : (((size - 1) >>> SHIFT) << SHIFT);\n  }\n\n  createClass(OrderedMap, Map);\n\n    // @pragma Construction\n\n    function OrderedMap(value) {\n      return value === null || value === undefined ? emptyOrderedMap() :\n        isOrderedMap(value) ? value :\n        emptyOrderedMap().withMutations(function(map ) {\n          var iter = KeyedIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v, k)  {return map.set(k, v)});\n        });\n    }\n\n    OrderedMap.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    OrderedMap.prototype.toString = function() {\n      return this.__toString('OrderedMap {', '}');\n    };\n\n    // @pragma Access\n\n    OrderedMap.prototype.get = function(k, notSetValue) {\n      var index = this._map.get(k);\n      return index !== undefined ? this._list.get(index)[1] : notSetValue;\n    };\n\n    // @pragma Modification\n\n    OrderedMap.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = 0;\n        this._map.clear();\n        this._list.clear();\n        return this;\n      }\n      return emptyOrderedMap();\n    };\n\n    OrderedMap.prototype.set = function(k, v) {\n      return updateOrderedMap(this, k, v);\n    };\n\n    OrderedMap.prototype.remove = function(k) {\n      return updateOrderedMap(this, k, NOT_SET);\n    };\n\n    OrderedMap.prototype.wasAltered = function() {\n      return this._map.wasAltered() || this._list.wasAltered();\n    };\n\n    OrderedMap.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._list.__iterate(\n        function(entry ) {return entry && fn(entry[1], entry[0], this$0)},\n        reverse\n      );\n    };\n\n    OrderedMap.prototype.__iterator = function(type, reverse) {\n      return this._list.fromEntrySeq().__iterator(type, reverse);\n    };\n\n    OrderedMap.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      var newMap = this._map.__ensureOwner(ownerID);\n      var newList = this._list.__ensureOwner(ownerID);\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this._map = newMap;\n        this._list = newList;\n        return this;\n      }\n      return makeOrderedMap(newMap, newList, ownerID, this.__hash);\n    };\n\n\n  function isOrderedMap(maybeOrderedMap) {\n    return isMap(maybeOrderedMap) && isOrdered(maybeOrderedMap);\n  }\n\n  OrderedMap.isOrderedMap = isOrderedMap;\n\n  OrderedMap.prototype[IS_ORDERED_SENTINEL] = true;\n  OrderedMap.prototype[DELETE] = OrderedMap.prototype.remove;\n\n\n\n  function makeOrderedMap(map, list, ownerID, hash) {\n    var omap = Object.create(OrderedMap.prototype);\n    omap.size = map ? map.size : 0;\n    omap._map = map;\n    omap._list = list;\n    omap.__ownerID = ownerID;\n    omap.__hash = hash;\n    return omap;\n  }\n\n  var EMPTY_ORDERED_MAP;\n  function emptyOrderedMap() {\n    return EMPTY_ORDERED_MAP || (EMPTY_ORDERED_MAP = makeOrderedMap(emptyMap(), emptyList()));\n  }\n\n  function updateOrderedMap(omap, k, v) {\n    var map = omap._map;\n    var list = omap._list;\n    var i = map.get(k);\n    var has = i !== undefined;\n    var newMap;\n    var newList;\n    if (v === NOT_SET) { // removed\n      if (!has) {\n        return omap;\n      }\n      if (list.size >= SIZE && list.size >= map.size * 2) {\n        newList = list.filter(function(entry, idx)  {return entry !== undefined && i !== idx});\n        newMap = newList.toKeyedSeq().map(function(entry ) {return entry[0]}).flip().toMap();\n        if (omap.__ownerID) {\n          newMap.__ownerID = newList.__ownerID = omap.__ownerID;\n        }\n      } else {\n        newMap = map.remove(k);\n        newList = i === list.size - 1 ? list.pop() : list.set(i, undefined);\n      }\n    } else {\n      if (has) {\n        if (v === list.get(i)[1]) {\n          return omap;\n        }\n        newMap = map;\n        newList = list.set(i, [k, v]);\n      } else {\n        newMap = map.set(k, list.size);\n        newList = list.set(list.size, [k, v]);\n      }\n    }\n    if (omap.__ownerID) {\n      omap.size = newMap.size;\n      omap._map = newMap;\n      omap._list = newList;\n      omap.__hash = undefined;\n      return omap;\n    }\n    return makeOrderedMap(newMap, newList);\n  }\n\n  createClass(ToKeyedSequence, KeyedSeq);\n    function ToKeyedSequence(indexed, useKeys) {\n      this._iter = indexed;\n      this._useKeys = useKeys;\n      this.size = indexed.size;\n    }\n\n    ToKeyedSequence.prototype.get = function(key, notSetValue) {\n      return this._iter.get(key, notSetValue);\n    };\n\n    ToKeyedSequence.prototype.has = function(key) {\n      return this._iter.has(key);\n    };\n\n    ToKeyedSequence.prototype.valueSeq = function() {\n      return this._iter.valueSeq();\n    };\n\n    ToKeyedSequence.prototype.reverse = function() {var this$0 = this;\n      var reversedSequence = reverseFactory(this, true);\n      if (!this._useKeys) {\n        reversedSequence.valueSeq = function()  {return this$0._iter.toSeq().reverse()};\n      }\n      return reversedSequence;\n    };\n\n    ToKeyedSequence.prototype.map = function(mapper, context) {var this$0 = this;\n      var mappedSequence = mapFactory(this, mapper, context);\n      if (!this._useKeys) {\n        mappedSequence.valueSeq = function()  {return this$0._iter.toSeq().map(mapper, context)};\n      }\n      return mappedSequence;\n    };\n\n    ToKeyedSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      var ii;\n      return this._iter.__iterate(\n        this._useKeys ?\n          function(v, k)  {return fn(v, k, this$0)} :\n          ((ii = reverse ? resolveSize(this) : 0),\n            function(v ) {return fn(v, reverse ? --ii : ii++, this$0)}),\n        reverse\n      );\n    };\n\n    ToKeyedSequence.prototype.__iterator = function(type, reverse) {\n      if (this._useKeys) {\n        return this._iter.__iterator(type, reverse);\n      }\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      var ii = reverse ? resolveSize(this) : 0;\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step :\n          iteratorValue(type, reverse ? --ii : ii++, step.value, step);\n      });\n    };\n\n  ToKeyedSequence.prototype[IS_ORDERED_SENTINEL] = true;\n\n\n  createClass(ToIndexedSequence, IndexedSeq);\n    function ToIndexedSequence(iter) {\n      this._iter = iter;\n      this.size = iter.size;\n    }\n\n    ToIndexedSequence.prototype.includes = function(value) {\n      return this._iter.includes(value);\n    };\n\n    ToIndexedSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      return this._iter.__iterate(function(v ) {return fn(v, iterations++, this$0)}, reverse);\n    };\n\n    ToIndexedSequence.prototype.__iterator = function(type, reverse) {\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      var iterations = 0;\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step :\n          iteratorValue(type, iterations++, step.value, step)\n      });\n    };\n\n\n\n  createClass(ToSetSequence, SetSeq);\n    function ToSetSequence(iter) {\n      this._iter = iter;\n      this.size = iter.size;\n    }\n\n    ToSetSequence.prototype.has = function(key) {\n      return this._iter.includes(key);\n    };\n\n    ToSetSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._iter.__iterate(function(v ) {return fn(v, v, this$0)}, reverse);\n    };\n\n    ToSetSequence.prototype.__iterator = function(type, reverse) {\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step :\n          iteratorValue(type, step.value, step.value, step);\n      });\n    };\n\n\n\n  createClass(FromEntriesSequence, KeyedSeq);\n    function FromEntriesSequence(entries) {\n      this._iter = entries;\n      this.size = entries.size;\n    }\n\n    FromEntriesSequence.prototype.entrySeq = function() {\n      return this._iter.toSeq();\n    };\n\n    FromEntriesSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._iter.__iterate(function(entry ) {\n        // Check if entry exists first so array access doesn't throw for holes\n        // in the parent iteration.\n        if (entry) {\n          validateEntry(entry);\n          var indexedIterable = isIterable(entry);\n          return fn(\n            indexedIterable ? entry.get(1) : entry[1],\n            indexedIterable ? entry.get(0) : entry[0],\n            this$0\n          );\n        }\n      }, reverse);\n    };\n\n    FromEntriesSequence.prototype.__iterator = function(type, reverse) {\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      return new Iterator(function()  {\n        while (true) {\n          var step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n          var entry = step.value;\n          // Check if entry exists first so array access doesn't throw for holes\n          // in the parent iteration.\n          if (entry) {\n            validateEntry(entry);\n            var indexedIterable = isIterable(entry);\n            return iteratorValue(\n              type,\n              indexedIterable ? entry.get(0) : entry[0],\n              indexedIterable ? entry.get(1) : entry[1],\n              step\n            );\n          }\n        }\n      });\n    };\n\n\n  ToIndexedSequence.prototype.cacheResult =\n  ToKeyedSequence.prototype.cacheResult =\n  ToSetSequence.prototype.cacheResult =\n  FromEntriesSequence.prototype.cacheResult =\n    cacheResultThrough;\n\n\n  function flipFactory(iterable) {\n    var flipSequence = makeSequence(iterable);\n    flipSequence._iter = iterable;\n    flipSequence.size = iterable.size;\n    flipSequence.flip = function()  {return iterable};\n    flipSequence.reverse = function () {\n      var reversedSequence = iterable.reverse.apply(this); // super.reverse()\n      reversedSequence.flip = function()  {return iterable.reverse()};\n      return reversedSequence;\n    };\n    flipSequence.has = function(key ) {return iterable.includes(key)};\n    flipSequence.includes = function(key ) {return iterable.has(key)};\n    flipSequence.cacheResult = cacheResultThrough;\n    flipSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      return iterable.__iterate(function(v, k)  {return fn(k, v, this$0) !== false}, reverse);\n    }\n    flipSequence.__iteratorUncached = function(type, reverse) {\n      if (type === ITERATE_ENTRIES) {\n        var iterator = iterable.__iterator(type, reverse);\n        return new Iterator(function()  {\n          var step = iterator.next();\n          if (!step.done) {\n            var k = step.value[0];\n            step.value[0] = step.value[1];\n            step.value[1] = k;\n          }\n          return step;\n        });\n      }\n      return iterable.__iterator(\n        type === ITERATE_VALUES ? ITERATE_KEYS : ITERATE_VALUES,\n        reverse\n      );\n    }\n    return flipSequence;\n  }\n\n\n  function mapFactory(iterable, mapper, context) {\n    var mappedSequence = makeSequence(iterable);\n    mappedSequence.size = iterable.size;\n    mappedSequence.has = function(key ) {return iterable.has(key)};\n    mappedSequence.get = function(key, notSetValue)  {\n      var v = iterable.get(key, NOT_SET);\n      return v === NOT_SET ?\n        notSetValue :\n        mapper.call(context, v, key, iterable);\n    };\n    mappedSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      return iterable.__iterate(\n        function(v, k, c)  {return fn(mapper.call(context, v, k, c), k, this$0) !== false},\n        reverse\n      );\n    }\n    mappedSequence.__iteratorUncached = function (type, reverse) {\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      return new Iterator(function()  {\n        var step = iterator.next();\n        if (step.done) {\n          return step;\n        }\n        var entry = step.value;\n        var key = entry[0];\n        return iteratorValue(\n          type,\n          key,\n          mapper.call(context, entry[1], key, iterable),\n          step\n        );\n      });\n    }\n    return mappedSequence;\n  }\n\n\n  function reverseFactory(iterable, useKeys) {\n    var reversedSequence = makeSequence(iterable);\n    reversedSequence._iter = iterable;\n    reversedSequence.size = iterable.size;\n    reversedSequence.reverse = function()  {return iterable};\n    if (iterable.flip) {\n      reversedSequence.flip = function () {\n        var flipSequence = flipFactory(iterable);\n        flipSequence.reverse = function()  {return iterable.flip()};\n        return flipSequence;\n      };\n    }\n    reversedSequence.get = function(key, notSetValue) \n      {return iterable.get(useKeys ? key : -1 - key, notSetValue)};\n    reversedSequence.has = function(key )\n      {return iterable.has(useKeys ? key : -1 - key)};\n    reversedSequence.includes = function(value ) {return iterable.includes(value)};\n    reversedSequence.cacheResult = cacheResultThrough;\n    reversedSequence.__iterate = function (fn, reverse) {var this$0 = this;\n      return iterable.__iterate(function(v, k)  {return fn(v, k, this$0)}, !reverse);\n    };\n    reversedSequence.__iterator =\n      function(type, reverse)  {return iterable.__iterator(type, !reverse)};\n    return reversedSequence;\n  }\n\n\n  function filterFactory(iterable, predicate, context, useKeys) {\n    var filterSequence = makeSequence(iterable);\n    if (useKeys) {\n      filterSequence.has = function(key ) {\n        var v = iterable.get(key, NOT_SET);\n        return v !== NOT_SET && !!predicate.call(context, v, key, iterable);\n      };\n      filterSequence.get = function(key, notSetValue)  {\n        var v = iterable.get(key, NOT_SET);\n        return v !== NOT_SET && predicate.call(context, v, key, iterable) ?\n          v : notSetValue;\n      };\n    }\n    filterSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      iterable.__iterate(function(v, k, c)  {\n        if (predicate.call(context, v, k, c)) {\n          iterations++;\n          return fn(v, useKeys ? k : iterations - 1, this$0);\n        }\n      }, reverse);\n      return iterations;\n    };\n    filterSequence.__iteratorUncached = function (type, reverse) {\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      var iterations = 0;\n      return new Iterator(function()  {\n        while (true) {\n          var step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n          var entry = step.value;\n          var key = entry[0];\n          var value = entry[1];\n          if (predicate.call(context, value, key, iterable)) {\n            return iteratorValue(type, useKeys ? key : iterations++, value, step);\n          }\n        }\n      });\n    }\n    return filterSequence;\n  }\n\n\n  function countByFactory(iterable, grouper, context) {\n    var groups = Map().asMutable();\n    iterable.__iterate(function(v, k)  {\n      groups.update(\n        grouper.call(context, v, k, iterable),\n        0,\n        function(a ) {return a + 1}\n      );\n    });\n    return groups.asImmutable();\n  }\n\n\n  function groupByFactory(iterable, grouper, context) {\n    var isKeyedIter = isKeyed(iterable);\n    var groups = (isOrdered(iterable) ? OrderedMap() : Map()).asMutable();\n    iterable.__iterate(function(v, k)  {\n      groups.update(\n        grouper.call(context, v, k, iterable),\n        function(a ) {return (a = a || [], a.push(isKeyedIter ? [k, v] : v), a)}\n      );\n    });\n    var coerce = iterableClass(iterable);\n    return groups.map(function(arr ) {return reify(iterable, coerce(arr))});\n  }\n\n\n  function sliceFactory(iterable, begin, end, useKeys) {\n    var originalSize = iterable.size;\n\n    // Sanitize begin & end using this shorthand for ToInt32(argument)\n    // http://www.ecma-international.org/ecma-262/6.0/#sec-toint32\n    if (begin !== undefined) {\n      begin = begin | 0;\n    }\n    if (end !== undefined) {\n      end = end | 0;\n    }\n\n    if (wholeSlice(begin, end, originalSize)) {\n      return iterable;\n    }\n\n    var resolvedBegin = resolveBegin(begin, originalSize);\n    var resolvedEnd = resolveEnd(end, originalSize);\n\n    // begin or end will be NaN if they were provided as negative numbers and\n    // this iterable's size is unknown. In that case, cache first so there is\n    // a known size and these do not resolve to NaN.\n    if (resolvedBegin !== resolvedBegin || resolvedEnd !== resolvedEnd) {\n      return sliceFactory(iterable.toSeq().cacheResult(), begin, end, useKeys);\n    }\n\n    // Note: resolvedEnd is undefined when the original sequence's length is\n    // unknown and this slice did not supply an end and should contain all\n    // elements after resolvedBegin.\n    // In that case, resolvedSize will be NaN and sliceSize will remain undefined.\n    var resolvedSize = resolvedEnd - resolvedBegin;\n    var sliceSize;\n    if (resolvedSize === resolvedSize) {\n      sliceSize = resolvedSize < 0 ? 0 : resolvedSize;\n    }\n\n    var sliceSeq = makeSequence(iterable);\n\n    // If iterable.size is undefined, the size of the realized sliceSeq is\n    // unknown at this point unless the number of items to slice is 0\n    sliceSeq.size = sliceSize === 0 ? sliceSize : iterable.size && sliceSize || undefined;\n\n    if (!useKeys && isSeq(iterable) && sliceSize >= 0) {\n      sliceSeq.get = function (index, notSetValue) {\n        index = wrapIndex(this, index);\n        return index >= 0 && index < sliceSize ?\n          iterable.get(index + resolvedBegin, notSetValue) :\n          notSetValue;\n      }\n    }\n\n    sliceSeq.__iterateUncached = function(fn, reverse) {var this$0 = this;\n      if (sliceSize === 0) {\n        return 0;\n      }\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var skipped = 0;\n      var isSkipping = true;\n      var iterations = 0;\n      iterable.__iterate(function(v, k)  {\n        if (!(isSkipping && (isSkipping = skipped++ < resolvedBegin))) {\n          iterations++;\n          return fn(v, useKeys ? k : iterations - 1, this$0) !== false &&\n                 iterations !== sliceSize;\n        }\n      });\n      return iterations;\n    };\n\n    sliceSeq.__iteratorUncached = function(type, reverse) {\n      if (sliceSize !== 0 && reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      // Don't bother instantiating parent iterator if taking 0.\n      var iterator = sliceSize !== 0 && iterable.__iterator(type, reverse);\n      var skipped = 0;\n      var iterations = 0;\n      return new Iterator(function()  {\n        while (skipped++ < resolvedBegin) {\n          iterator.next();\n        }\n        if (++iterations > sliceSize) {\n          return iteratorDone();\n        }\n        var step = iterator.next();\n        if (useKeys || type === ITERATE_VALUES) {\n          return step;\n        } else if (type === ITERATE_KEYS) {\n          return iteratorValue(type, iterations - 1, undefined, step);\n        } else {\n          return iteratorValue(type, iterations - 1, step.value[1], step);\n        }\n      });\n    }\n\n    return sliceSeq;\n  }\n\n\n  function takeWhileFactory(iterable, predicate, context) {\n    var takeSequence = makeSequence(iterable);\n    takeSequence.__iterateUncached = function(fn, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var iterations = 0;\n      iterable.__iterate(function(v, k, c) \n        {return predicate.call(context, v, k, c) && ++iterations && fn(v, k, this$0)}\n      );\n      return iterations;\n    };\n    takeSequence.__iteratorUncached = function(type, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      var iterating = true;\n      return new Iterator(function()  {\n        if (!iterating) {\n          return iteratorDone();\n        }\n        var step = iterator.next();\n        if (step.done) {\n          return step;\n        }\n        var entry = step.value;\n        var k = entry[0];\n        var v = entry[1];\n        if (!predicate.call(context, v, k, this$0)) {\n          iterating = false;\n          return iteratorDone();\n        }\n        return type === ITERATE_ENTRIES ? step :\n          iteratorValue(type, k, v, step);\n      });\n    };\n    return takeSequence;\n  }\n\n\n  function skipWhileFactory(iterable, predicate, context, useKeys) {\n    var skipSequence = makeSequence(iterable);\n    skipSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var isSkipping = true;\n      var iterations = 0;\n      iterable.__iterate(function(v, k, c)  {\n        if (!(isSkipping && (isSkipping = predicate.call(context, v, k, c)))) {\n          iterations++;\n          return fn(v, useKeys ? k : iterations - 1, this$0);\n        }\n      });\n      return iterations;\n    };\n    skipSequence.__iteratorUncached = function(type, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      var skipping = true;\n      var iterations = 0;\n      return new Iterator(function()  {\n        var step, k, v;\n        do {\n          step = iterator.next();\n          if (step.done) {\n            if (useKeys || type === ITERATE_VALUES) {\n              return step;\n            } else if (type === ITERATE_KEYS) {\n              return iteratorValue(type, iterations++, undefined, step);\n            } else {\n              return iteratorValue(type, iterations++, step.value[1], step);\n            }\n          }\n          var entry = step.value;\n          k = entry[0];\n          v = entry[1];\n          skipping && (skipping = predicate.call(context, v, k, this$0));\n        } while (skipping);\n        return type === ITERATE_ENTRIES ? step :\n          iteratorValue(type, k, v, step);\n      });\n    };\n    return skipSequence;\n  }\n\n\n  function concatFactory(iterable, values) {\n    var isKeyedIterable = isKeyed(iterable);\n    var iters = [iterable].concat(values).map(function(v ) {\n      if (!isIterable(v)) {\n        v = isKeyedIterable ?\n          keyedSeqFromValue(v) :\n          indexedSeqFromValue(Array.isArray(v) ? v : [v]);\n      } else if (isKeyedIterable) {\n        v = KeyedIterable(v);\n      }\n      return v;\n    }).filter(function(v ) {return v.size !== 0});\n\n    if (iters.length === 0) {\n      return iterable;\n    }\n\n    if (iters.length === 1) {\n      var singleton = iters[0];\n      if (singleton === iterable ||\n          isKeyedIterable && isKeyed(singleton) ||\n          isIndexed(iterable) && isIndexed(singleton)) {\n        return singleton;\n      }\n    }\n\n    var concatSeq = new ArraySeq(iters);\n    if (isKeyedIterable) {\n      concatSeq = concatSeq.toKeyedSeq();\n    } else if (!isIndexed(iterable)) {\n      concatSeq = concatSeq.toSetSeq();\n    }\n    concatSeq = concatSeq.flatten(true);\n    concatSeq.size = iters.reduce(\n      function(sum, seq)  {\n        if (sum !== undefined) {\n          var size = seq.size;\n          if (size !== undefined) {\n            return sum + size;\n          }\n        }\n      },\n      0\n    );\n    return concatSeq;\n  }\n\n\n  function flattenFactory(iterable, depth, useKeys) {\n    var flatSequence = makeSequence(iterable);\n    flatSequence.__iterateUncached = function(fn, reverse) {\n      var iterations = 0;\n      var stopped = false;\n      function flatDeep(iter, currentDepth) {var this$0 = this;\n        iter.__iterate(function(v, k)  {\n          if ((!depth || currentDepth < depth) && isIterable(v)) {\n            flatDeep(v, currentDepth + 1);\n          } else if (fn(v, useKeys ? k : iterations++, this$0) === false) {\n            stopped = true;\n          }\n          return !stopped;\n        }, reverse);\n      }\n      flatDeep(iterable, 0);\n      return iterations;\n    }\n    flatSequence.__iteratorUncached = function(type, reverse) {\n      var iterator = iterable.__iterator(type, reverse);\n      var stack = [];\n      var iterations = 0;\n      return new Iterator(function()  {\n        while (iterator) {\n          var step = iterator.next();\n          if (step.done !== false) {\n            iterator = stack.pop();\n            continue;\n          }\n          var v = step.value;\n          if (type === ITERATE_ENTRIES) {\n            v = v[1];\n          }\n          if ((!depth || stack.length < depth) && isIterable(v)) {\n            stack.push(iterator);\n            iterator = v.__iterator(type, reverse);\n          } else {\n            return useKeys ? step : iteratorValue(type, iterations++, v, step);\n          }\n        }\n        return iteratorDone();\n      });\n    }\n    return flatSequence;\n  }\n\n\n  function flatMapFactory(iterable, mapper, context) {\n    var coerce = iterableClass(iterable);\n    return iterable.toSeq().map(\n      function(v, k)  {return coerce(mapper.call(context, v, k, iterable))}\n    ).flatten(true);\n  }\n\n\n  function interposeFactory(iterable, separator) {\n    var interposedSequence = makeSequence(iterable);\n    interposedSequence.size = iterable.size && iterable.size * 2 -1;\n    interposedSequence.__iterateUncached = function(fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      iterable.__iterate(function(v, k) \n        {return (!iterations || fn(separator, iterations++, this$0) !== false) &&\n        fn(v, iterations++, this$0) !== false},\n        reverse\n      );\n      return iterations;\n    };\n    interposedSequence.__iteratorUncached = function(type, reverse) {\n      var iterator = iterable.__iterator(ITERATE_VALUES, reverse);\n      var iterations = 0;\n      var step;\n      return new Iterator(function()  {\n        if (!step || iterations % 2) {\n          step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n        }\n        return iterations % 2 ?\n          iteratorValue(type, iterations++, separator) :\n          iteratorValue(type, iterations++, step.value, step);\n      });\n    };\n    return interposedSequence;\n  }\n\n\n  function sortFactory(iterable, comparator, mapper) {\n    if (!comparator) {\n      comparator = defaultComparator;\n    }\n    var isKeyedIterable = isKeyed(iterable);\n    var index = 0;\n    var entries = iterable.toSeq().map(\n      function(v, k)  {return [k, v, index++, mapper ? mapper(v, k, iterable) : v]}\n    ).toArray();\n    entries.sort(function(a, b)  {return comparator(a[3], b[3]) || a[2] - b[2]}).forEach(\n      isKeyedIterable ?\n      function(v, i)  { entries[i].length = 2; } :\n      function(v, i)  { entries[i] = v[1]; }\n    );\n    return isKeyedIterable ? KeyedSeq(entries) :\n      isIndexed(iterable) ? IndexedSeq(entries) :\n      SetSeq(entries);\n  }\n\n\n  function maxFactory(iterable, comparator, mapper) {\n    if (!comparator) {\n      comparator = defaultComparator;\n    }\n    if (mapper) {\n      var entry = iterable.toSeq()\n        .map(function(v, k)  {return [v, mapper(v, k, iterable)]})\n        .reduce(function(a, b)  {return maxCompare(comparator, a[1], b[1]) ? b : a});\n      return entry && entry[0];\n    } else {\n      return iterable.reduce(function(a, b)  {return maxCompare(comparator, a, b) ? b : a});\n    }\n  }\n\n  function maxCompare(comparator, a, b) {\n    var comp = comparator(b, a);\n    // b is considered the new max if the comparator declares them equal, but\n    // they are not equal and b is in fact a nullish value.\n    return (comp === 0 && b !== a && (b === undefined || b === null || b !== b)) || comp > 0;\n  }\n\n\n  function zipWithFactory(keyIter, zipper, iters) {\n    var zipSequence = makeSequence(keyIter);\n    zipSequence.size = new ArraySeq(iters).map(function(i ) {return i.size}).min();\n    // Note: this a generic base implementation of __iterate in terms of\n    // __iterator which may be more generically useful in the future.\n    zipSequence.__iterate = function(fn, reverse) {\n      /* generic:\n      var iterator = this.__iterator(ITERATE_ENTRIES, reverse);\n      var step;\n      var iterations = 0;\n      while (!(step = iterator.next()).done) {\n        iterations++;\n        if (fn(step.value[1], step.value[0], this) === false) {\n          break;\n        }\n      }\n      return iterations;\n      */\n      // indexed:\n      var iterator = this.__iterator(ITERATE_VALUES, reverse);\n      var step;\n      var iterations = 0;\n      while (!(step = iterator.next()).done) {\n        if (fn(step.value, iterations++, this) === false) {\n          break;\n        }\n      }\n      return iterations;\n    };\n    zipSequence.__iteratorUncached = function(type, reverse) {\n      var iterators = iters.map(function(i )\n        {return (i = Iterable(i), getIterator(reverse ? i.reverse() : i))}\n      );\n      var iterations = 0;\n      var isDone = false;\n      return new Iterator(function()  {\n        var steps;\n        if (!isDone) {\n          steps = iterators.map(function(i ) {return i.next()});\n          isDone = steps.some(function(s ) {return s.done});\n        }\n        if (isDone) {\n          return iteratorDone();\n        }\n        return iteratorValue(\n          type,\n          iterations++,\n          zipper.apply(null, steps.map(function(s ) {return s.value}))\n        );\n      });\n    };\n    return zipSequence\n  }\n\n\n  // #pragma Helper Functions\n\n  function reify(iter, seq) {\n    return isSeq(iter) ? seq : iter.constructor(seq);\n  }\n\n  function validateEntry(entry) {\n    if (entry !== Object(entry)) {\n      throw new TypeError('Expected [K, V] tuple: ' + entry);\n    }\n  }\n\n  function resolveSize(iter) {\n    assertNotInfinite(iter.size);\n    return ensureSize(iter);\n  }\n\n  function iterableClass(iterable) {\n    return isKeyed(iterable) ? KeyedIterable :\n      isIndexed(iterable) ? IndexedIterable :\n      SetIterable;\n  }\n\n  function makeSequence(iterable) {\n    return Object.create(\n      (\n        isKeyed(iterable) ? KeyedSeq :\n        isIndexed(iterable) ? IndexedSeq :\n        SetSeq\n      ).prototype\n    );\n  }\n\n  function cacheResultThrough() {\n    if (this._iter.cacheResult) {\n      this._iter.cacheResult();\n      this.size = this._iter.size;\n      return this;\n    } else {\n      return Seq.prototype.cacheResult.call(this);\n    }\n  }\n\n  function defaultComparator(a, b) {\n    return a > b ? 1 : a < b ? -1 : 0;\n  }\n\n  function forceIterator(keyPath) {\n    var iter = getIterator(keyPath);\n    if (!iter) {\n      // Array might not be iterable in this environment, so we need a fallback\n      // to our wrapped type.\n      if (!isArrayLike(keyPath)) {\n        throw new TypeError('Expected iterable or array-like: ' + keyPath);\n      }\n      iter = getIterator(Iterable(keyPath));\n    }\n    return iter;\n  }\n\n  createClass(Record, KeyedCollection);\n\n    function Record(defaultValues, name) {\n      var hasInitialized;\n\n      var RecordType = function Record(values) {\n        if (values instanceof RecordType) {\n          return values;\n        }\n        if (!(this instanceof RecordType)) {\n          return new RecordType(values);\n        }\n        if (!hasInitialized) {\n          hasInitialized = true;\n          var keys = Object.keys(defaultValues);\n          setProps(RecordTypePrototype, keys);\n          RecordTypePrototype.size = keys.length;\n          RecordTypePrototype._name = name;\n          RecordTypePrototype._keys = keys;\n          RecordTypePrototype._defaultValues = defaultValues;\n        }\n        this._map = Map(values);\n      };\n\n      var RecordTypePrototype = RecordType.prototype = Object.create(RecordPrototype);\n      RecordTypePrototype.constructor = RecordType;\n\n      return RecordType;\n    }\n\n    Record.prototype.toString = function() {\n      return this.__toString(recordName(this) + ' {', '}');\n    };\n\n    // @pragma Access\n\n    Record.prototype.has = function(k) {\n      return this._defaultValues.hasOwnProperty(k);\n    };\n\n    Record.prototype.get = function(k, notSetValue) {\n      if (!this.has(k)) {\n        return notSetValue;\n      }\n      var defaultVal = this._defaultValues[k];\n      return this._map ? this._map.get(k, defaultVal) : defaultVal;\n    };\n\n    // @pragma Modification\n\n    Record.prototype.clear = function() {\n      if (this.__ownerID) {\n        this._map && this._map.clear();\n        return this;\n      }\n      var RecordType = this.constructor;\n      return RecordType._empty || (RecordType._empty = makeRecord(this, emptyMap()));\n    };\n\n    Record.prototype.set = function(k, v) {\n      if (!this.has(k)) {\n        throw new Error('Cannot set unknown key \"' + k + '\" on ' + recordName(this));\n      }\n      var newMap = this._map && this._map.set(k, v);\n      if (this.__ownerID || newMap === this._map) {\n        return this;\n      }\n      return makeRecord(this, newMap);\n    };\n\n    Record.prototype.remove = function(k) {\n      if (!this.has(k)) {\n        return this;\n      }\n      var newMap = this._map && this._map.remove(k);\n      if (this.__ownerID || newMap === this._map) {\n        return this;\n      }\n      return makeRecord(this, newMap);\n    };\n\n    Record.prototype.wasAltered = function() {\n      return this._map.wasAltered();\n    };\n\n    Record.prototype.__iterator = function(type, reverse) {var this$0 = this;\n      return KeyedIterable(this._defaultValues).map(function(_, k)  {return this$0.get(k)}).__iterator(type, reverse);\n    };\n\n    Record.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return KeyedIterable(this._defaultValues).map(function(_, k)  {return this$0.get(k)}).__iterate(fn, reverse);\n    };\n\n    Record.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      var newMap = this._map && this._map.__ensureOwner(ownerID);\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this._map = newMap;\n        return this;\n      }\n      return makeRecord(this, newMap, ownerID);\n    };\n\n\n  var RecordPrototype = Record.prototype;\n  RecordPrototype[DELETE] = RecordPrototype.remove;\n  RecordPrototype.deleteIn =\n  RecordPrototype.removeIn = MapPrototype.removeIn;\n  RecordPrototype.merge = MapPrototype.merge;\n  RecordPrototype.mergeWith = MapPrototype.mergeWith;\n  RecordPrototype.mergeIn = MapPrototype.mergeIn;\n  RecordPrototype.mergeDeep = MapPrototype.mergeDeep;\n  RecordPrototype.mergeDeepWith = MapPrototype.mergeDeepWith;\n  RecordPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\n  RecordPrototype.setIn = MapPrototype.setIn;\n  RecordPrototype.update = MapPrototype.update;\n  RecordPrototype.updateIn = MapPrototype.updateIn;\n  RecordPrototype.withMutations = MapPrototype.withMutations;\n  RecordPrototype.asMutable = MapPrototype.asMutable;\n  RecordPrototype.asImmutable = MapPrototype.asImmutable;\n\n\n  function makeRecord(likeRecord, map, ownerID) {\n    var record = Object.create(Object.getPrototypeOf(likeRecord));\n    record._map = map;\n    record.__ownerID = ownerID;\n    return record;\n  }\n\n  function recordName(record) {\n    return record._name || record.constructor.name || 'Record';\n  }\n\n  function setProps(prototype, names) {\n    try {\n      names.forEach(setProp.bind(undefined, prototype));\n    } catch (error) {\n      // Object.defineProperty failed. Probably IE8.\n    }\n  }\n\n  function setProp(prototype, name) {\n    Object.defineProperty(prototype, name, {\n      get: function() {\n        return this.get(name);\n      },\n      set: function(value) {\n        invariant(this.__ownerID, 'Cannot set on an immutable record.');\n        this.set(name, value);\n      }\n    });\n  }\n\n  createClass(Set, SetCollection);\n\n    // @pragma Construction\n\n    function Set(value) {\n      return value === null || value === undefined ? emptySet() :\n        isSet(value) && !isOrdered(value) ? value :\n        emptySet().withMutations(function(set ) {\n          var iter = SetIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v ) {return set.add(v)});\n        });\n    }\n\n    Set.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    Set.fromKeys = function(value) {\n      return this(KeyedIterable(value).keySeq());\n    };\n\n    Set.prototype.toString = function() {\n      return this.__toString('Set {', '}');\n    };\n\n    // @pragma Access\n\n    Set.prototype.has = function(value) {\n      return this._map.has(value);\n    };\n\n    // @pragma Modification\n\n    Set.prototype.add = function(value) {\n      return updateSet(this, this._map.set(value, true));\n    };\n\n    Set.prototype.remove = function(value) {\n      return updateSet(this, this._map.remove(value));\n    };\n\n    Set.prototype.clear = function() {\n      return updateSet(this, this._map.clear());\n    };\n\n    // @pragma Composition\n\n    Set.prototype.union = function() {var iters = SLICE$0.call(arguments, 0);\n      iters = iters.filter(function(x ) {return x.size !== 0});\n      if (iters.length === 0) {\n        return this;\n      }\n      if (this.size === 0 && !this.__ownerID && iters.length === 1) {\n        return this.constructor(iters[0]);\n      }\n      return this.withMutations(function(set ) {\n        for (var ii = 0; ii < iters.length; ii++) {\n          SetIterable(iters[ii]).forEach(function(value ) {return set.add(value)});\n        }\n      });\n    };\n\n    Set.prototype.intersect = function() {var iters = SLICE$0.call(arguments, 0);\n      if (iters.length === 0) {\n        return this;\n      }\n      iters = iters.map(function(iter ) {return SetIterable(iter)});\n      var originalSet = this;\n      return this.withMutations(function(set ) {\n        originalSet.forEach(function(value ) {\n          if (!iters.every(function(iter ) {return iter.includes(value)})) {\n            set.remove(value);\n          }\n        });\n      });\n    };\n\n    Set.prototype.subtract = function() {var iters = SLICE$0.call(arguments, 0);\n      if (iters.length === 0) {\n        return this;\n      }\n      iters = iters.map(function(iter ) {return SetIterable(iter)});\n      var originalSet = this;\n      return this.withMutations(function(set ) {\n        originalSet.forEach(function(value ) {\n          if (iters.some(function(iter ) {return iter.includes(value)})) {\n            set.remove(value);\n          }\n        });\n      });\n    };\n\n    Set.prototype.merge = function() {\n      return this.union.apply(this, arguments);\n    };\n\n    Set.prototype.mergeWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return this.union.apply(this, iters);\n    };\n\n    Set.prototype.sort = function(comparator) {\n      // Late binding\n      return OrderedSet(sortFactory(this, comparator));\n    };\n\n    Set.prototype.sortBy = function(mapper, comparator) {\n      // Late binding\n      return OrderedSet(sortFactory(this, comparator, mapper));\n    };\n\n    Set.prototype.wasAltered = function() {\n      return this._map.wasAltered();\n    };\n\n    Set.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._map.__iterate(function(_, k)  {return fn(k, k, this$0)}, reverse);\n    };\n\n    Set.prototype.__iterator = function(type, reverse) {\n      return this._map.map(function(_, k)  {return k}).__iterator(type, reverse);\n    };\n\n    Set.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      var newMap = this._map.__ensureOwner(ownerID);\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this._map = newMap;\n        return this;\n      }\n      return this.__make(newMap, ownerID);\n    };\n\n\n  function isSet(maybeSet) {\n    return !!(maybeSet && maybeSet[IS_SET_SENTINEL]);\n  }\n\n  Set.isSet = isSet;\n\n  var IS_SET_SENTINEL = '@@__IMMUTABLE_SET__@@';\n\n  var SetPrototype = Set.prototype;\n  SetPrototype[IS_SET_SENTINEL] = true;\n  SetPrototype[DELETE] = SetPrototype.remove;\n  SetPrototype.mergeDeep = SetPrototype.merge;\n  SetPrototype.mergeDeepWith = SetPrototype.mergeWith;\n  SetPrototype.withMutations = MapPrototype.withMutations;\n  SetPrototype.asMutable = MapPrototype.asMutable;\n  SetPrototype.asImmutable = MapPrototype.asImmutable;\n\n  SetPrototype.__empty = emptySet;\n  SetPrototype.__make = makeSet;\n\n  function updateSet(set, newMap) {\n    if (set.__ownerID) {\n      set.size = newMap.size;\n      set._map = newMap;\n      return set;\n    }\n    return newMap === set._map ? set :\n      newMap.size === 0 ? set.__empty() :\n      set.__make(newMap);\n  }\n\n  function makeSet(map, ownerID) {\n    var set = Object.create(SetPrototype);\n    set.size = map ? map.size : 0;\n    set._map = map;\n    set.__ownerID = ownerID;\n    return set;\n  }\n\n  var EMPTY_SET;\n  function emptySet() {\n    return EMPTY_SET || (EMPTY_SET = makeSet(emptyMap()));\n  }\n\n  createClass(OrderedSet, Set);\n\n    // @pragma Construction\n\n    function OrderedSet(value) {\n      return value === null || value === undefined ? emptyOrderedSet() :\n        isOrderedSet(value) ? value :\n        emptyOrderedSet().withMutations(function(set ) {\n          var iter = SetIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v ) {return set.add(v)});\n        });\n    }\n\n    OrderedSet.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    OrderedSet.fromKeys = function(value) {\n      return this(KeyedIterable(value).keySeq());\n    };\n\n    OrderedSet.prototype.toString = function() {\n      return this.__toString('OrderedSet {', '}');\n    };\n\n\n  function isOrderedSet(maybeOrderedSet) {\n    return isSet(maybeOrderedSet) && isOrdered(maybeOrderedSet);\n  }\n\n  OrderedSet.isOrderedSet = isOrderedSet;\n\n  var OrderedSetPrototype = OrderedSet.prototype;\n  OrderedSetPrototype[IS_ORDERED_SENTINEL] = true;\n\n  OrderedSetPrototype.__empty = emptyOrderedSet;\n  OrderedSetPrototype.__make = makeOrderedSet;\n\n  function makeOrderedSet(map, ownerID) {\n    var set = Object.create(OrderedSetPrototype);\n    set.size = map ? map.size : 0;\n    set._map = map;\n    set.__ownerID = ownerID;\n    return set;\n  }\n\n  var EMPTY_ORDERED_SET;\n  function emptyOrderedSet() {\n    return EMPTY_ORDERED_SET || (EMPTY_ORDERED_SET = makeOrderedSet(emptyOrderedMap()));\n  }\n\n  createClass(Stack, IndexedCollection);\n\n    // @pragma Construction\n\n    function Stack(value) {\n      return value === null || value === undefined ? emptyStack() :\n        isStack(value) ? value :\n        emptyStack().unshiftAll(value);\n    }\n\n    Stack.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    Stack.prototype.toString = function() {\n      return this.__toString('Stack [', ']');\n    };\n\n    // @pragma Access\n\n    Stack.prototype.get = function(index, notSetValue) {\n      var head = this._head;\n      index = wrapIndex(this, index);\n      while (head && index--) {\n        head = head.next;\n      }\n      return head ? head.value : notSetValue;\n    };\n\n    Stack.prototype.peek = function() {\n      return this._head && this._head.value;\n    };\n\n    // @pragma Modification\n\n    Stack.prototype.push = function(/*...values*/) {\n      if (arguments.length === 0) {\n        return this;\n      }\n      var newSize = this.size + arguments.length;\n      var head = this._head;\n      for (var ii = arguments.length - 1; ii >= 0; ii--) {\n        head = {\n          value: arguments[ii],\n          next: head\n        };\n      }\n      if (this.__ownerID) {\n        this.size = newSize;\n        this._head = head;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return makeStack(newSize, head);\n    };\n\n    Stack.prototype.pushAll = function(iter) {\n      iter = IndexedIterable(iter);\n      if (iter.size === 0) {\n        return this;\n      }\n      assertNotInfinite(iter.size);\n      var newSize = this.size;\n      var head = this._head;\n      iter.reverse().forEach(function(value ) {\n        newSize++;\n        head = {\n          value: value,\n          next: head\n        };\n      });\n      if (this.__ownerID) {\n        this.size = newSize;\n        this._head = head;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return makeStack(newSize, head);\n    };\n\n    Stack.prototype.pop = function() {\n      return this.slice(1);\n    };\n\n    Stack.prototype.unshift = function(/*...values*/) {\n      return this.push.apply(this, arguments);\n    };\n\n    Stack.prototype.unshiftAll = function(iter) {\n      return this.pushAll(iter);\n    };\n\n    Stack.prototype.shift = function() {\n      return this.pop.apply(this, arguments);\n    };\n\n    Stack.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = 0;\n        this._head = undefined;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return emptyStack();\n    };\n\n    Stack.prototype.slice = function(begin, end) {\n      if (wholeSlice(begin, end, this.size)) {\n        return this;\n      }\n      var resolvedBegin = resolveBegin(begin, this.size);\n      var resolvedEnd = resolveEnd(end, this.size);\n      if (resolvedEnd !== this.size) {\n        // super.slice(begin, end);\n        return IndexedCollection.prototype.slice.call(this, begin, end);\n      }\n      var newSize = this.size - resolvedBegin;\n      var head = this._head;\n      while (resolvedBegin--) {\n        head = head.next;\n      }\n      if (this.__ownerID) {\n        this.size = newSize;\n        this._head = head;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return makeStack(newSize, head);\n    };\n\n    // @pragma Mutability\n\n    Stack.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this.__altered = false;\n        return this;\n      }\n      return makeStack(this.size, this._head, ownerID, this.__hash);\n    };\n\n    // @pragma Iteration\n\n    Stack.prototype.__iterate = function(fn, reverse) {\n      if (reverse) {\n        return this.reverse().__iterate(fn);\n      }\n      var iterations = 0;\n      var node = this._head;\n      while (node) {\n        if (fn(node.value, iterations++, this) === false) {\n          break;\n        }\n        node = node.next;\n      }\n      return iterations;\n    };\n\n    Stack.prototype.__iterator = function(type, reverse) {\n      if (reverse) {\n        return this.reverse().__iterator(type);\n      }\n      var iterations = 0;\n      var node = this._head;\n      return new Iterator(function()  {\n        if (node) {\n          var value = node.value;\n          node = node.next;\n          return iteratorValue(type, iterations++, value);\n        }\n        return iteratorDone();\n      });\n    };\n\n\n  function isStack(maybeStack) {\n    return !!(maybeStack && maybeStack[IS_STACK_SENTINEL]);\n  }\n\n  Stack.isStack = isStack;\n\n  var IS_STACK_SENTINEL = '@@__IMMUTABLE_STACK__@@';\n\n  var StackPrototype = Stack.prototype;\n  StackPrototype[IS_STACK_SENTINEL] = true;\n  StackPrototype.withMutations = MapPrototype.withMutations;\n  StackPrototype.asMutable = MapPrototype.asMutable;\n  StackPrototype.asImmutable = MapPrototype.asImmutable;\n  StackPrototype.wasAltered = MapPrototype.wasAltered;\n\n\n  function makeStack(size, head, ownerID, hash) {\n    var map = Object.create(StackPrototype);\n    map.size = size;\n    map._head = head;\n    map.__ownerID = ownerID;\n    map.__hash = hash;\n    map.__altered = false;\n    return map;\n  }\n\n  var EMPTY_STACK;\n  function emptyStack() {\n    return EMPTY_STACK || (EMPTY_STACK = makeStack(0));\n  }\n\n  /**\n   * Contributes additional methods to a constructor\n   */\n  function mixin(ctor, methods) {\n    var keyCopier = function(key ) { ctor.prototype[key] = methods[key]; };\n    Object.keys(methods).forEach(keyCopier);\n    Object.getOwnPropertySymbols &&\n      Object.getOwnPropertySymbols(methods).forEach(keyCopier);\n    return ctor;\n  }\n\n  Iterable.Iterator = Iterator;\n\n  mixin(Iterable, {\n\n    // ### Conversion to other types\n\n    toArray: function() {\n      assertNotInfinite(this.size);\n      var array = new Array(this.size || 0);\n      this.valueSeq().__iterate(function(v, i)  { array[i] = v; });\n      return array;\n    },\n\n    toIndexedSeq: function() {\n      return new ToIndexedSequence(this);\n    },\n\n    toJS: function() {\n      return this.toSeq().map(\n        function(value ) {return value && typeof value.toJS === 'function' ? value.toJS() : value}\n      ).__toJS();\n    },\n\n    toJSON: function() {\n      return this.toSeq().map(\n        function(value ) {return value && typeof value.toJSON === 'function' ? value.toJSON() : value}\n      ).__toJS();\n    },\n\n    toKeyedSeq: function() {\n      return new ToKeyedSequence(this, true);\n    },\n\n    toMap: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return Map(this.toKeyedSeq());\n    },\n\n    toObject: function() {\n      assertNotInfinite(this.size);\n      var object = {};\n      this.__iterate(function(v, k)  { object[k] = v; });\n      return object;\n    },\n\n    toOrderedMap: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return OrderedMap(this.toKeyedSeq());\n    },\n\n    toOrderedSet: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return OrderedSet(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n    toSet: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return Set(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n    toSetSeq: function() {\n      return new ToSetSequence(this);\n    },\n\n    toSeq: function() {\n      return isIndexed(this) ? this.toIndexedSeq() :\n        isKeyed(this) ? this.toKeyedSeq() :\n        this.toSetSeq();\n    },\n\n    toStack: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return Stack(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n    toList: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return List(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n\n    // ### Common JavaScript methods and properties\n\n    toString: function() {\n      return '[Iterable]';\n    },\n\n    __toString: function(head, tail) {\n      if (this.size === 0) {\n        return head + tail;\n      }\n      return head + ' ' + this.toSeq().map(this.__toStringMapper).join(', ') + ' ' + tail;\n    },\n\n\n    // ### ES6 Collection methods (ES6 Array and Map)\n\n    concat: function() {var values = SLICE$0.call(arguments, 0);\n      return reify(this, concatFactory(this, values));\n    },\n\n    includes: function(searchValue) {\n      return this.some(function(value ) {return is(value, searchValue)});\n    },\n\n    entries: function() {\n      return this.__iterator(ITERATE_ENTRIES);\n    },\n\n    every: function(predicate, context) {\n      assertNotInfinite(this.size);\n      var returnValue = true;\n      this.__iterate(function(v, k, c)  {\n        if (!predicate.call(context, v, k, c)) {\n          returnValue = false;\n          return false;\n        }\n      });\n      return returnValue;\n    },\n\n    filter: function(predicate, context) {\n      return reify(this, filterFactory(this, predicate, context, true));\n    },\n\n    find: function(predicate, context, notSetValue) {\n      var entry = this.findEntry(predicate, context);\n      return entry ? entry[1] : notSetValue;\n    },\n\n    findEntry: function(predicate, context) {\n      var found;\n      this.__iterate(function(v, k, c)  {\n        if (predicate.call(context, v, k, c)) {\n          found = [k, v];\n          return false;\n        }\n      });\n      return found;\n    },\n\n    findLastEntry: function(predicate, context) {\n      return this.toSeq().reverse().findEntry(predicate, context);\n    },\n\n    forEach: function(sideEffect, context) {\n      assertNotInfinite(this.size);\n      return this.__iterate(context ? sideEffect.bind(context) : sideEffect);\n    },\n\n    join: function(separator) {\n      assertNotInfinite(this.size);\n      separator = separator !== undefined ? '' + separator : ',';\n      var joined = '';\n      var isFirst = true;\n      this.__iterate(function(v ) {\n        isFirst ? (isFirst = false) : (joined += separator);\n        joined += v !== null && v !== undefined ? v.toString() : '';\n      });\n      return joined;\n    },\n\n    keys: function() {\n      return this.__iterator(ITERATE_KEYS);\n    },\n\n    map: function(mapper, context) {\n      return reify(this, mapFactory(this, mapper, context));\n    },\n\n    reduce: function(reducer, initialReduction, context) {\n      assertNotInfinite(this.size);\n      var reduction;\n      var useFirst;\n      if (arguments.length < 2) {\n        useFirst = true;\n      } else {\n        reduction = initialReduction;\n      }\n      this.__iterate(function(v, k, c)  {\n        if (useFirst) {\n          useFirst = false;\n          reduction = v;\n        } else {\n          reduction = reducer.call(context, reduction, v, k, c);\n        }\n      });\n      return reduction;\n    },\n\n    reduceRight: function(reducer, initialReduction, context) {\n      var reversed = this.toKeyedSeq().reverse();\n      return reversed.reduce.apply(reversed, arguments);\n    },\n\n    reverse: function() {\n      return reify(this, reverseFactory(this, true));\n    },\n\n    slice: function(begin, end) {\n      return reify(this, sliceFactory(this, begin, end, true));\n    },\n\n    some: function(predicate, context) {\n      return !this.every(not(predicate), context);\n    },\n\n    sort: function(comparator) {\n      return reify(this, sortFactory(this, comparator));\n    },\n\n    values: function() {\n      return this.__iterator(ITERATE_VALUES);\n    },\n\n\n    // ### More sequential methods\n\n    butLast: function() {\n      return this.slice(0, -1);\n    },\n\n    isEmpty: function() {\n      return this.size !== undefined ? this.size === 0 : !this.some(function()  {return true});\n    },\n\n    count: function(predicate, context) {\n      return ensureSize(\n        predicate ? this.toSeq().filter(predicate, context) : this\n      );\n    },\n\n    countBy: function(grouper, context) {\n      return countByFactory(this, grouper, context);\n    },\n\n    equals: function(other) {\n      return deepEqual(this, other);\n    },\n\n    entrySeq: function() {\n      var iterable = this;\n      if (iterable._cache) {\n        // We cache as an entries array, so we can just return the cache!\n        return new ArraySeq(iterable._cache);\n      }\n      var entriesSequence = iterable.toSeq().map(entryMapper).toIndexedSeq();\n      entriesSequence.fromEntrySeq = function()  {return iterable.toSeq()};\n      return entriesSequence;\n    },\n\n    filterNot: function(predicate, context) {\n      return this.filter(not(predicate), context);\n    },\n\n    findLast: function(predicate, context, notSetValue) {\n      return this.toKeyedSeq().reverse().find(predicate, context, notSetValue);\n    },\n\n    first: function() {\n      return this.find(returnTrue);\n    },\n\n    flatMap: function(mapper, context) {\n      return reify(this, flatMapFactory(this, mapper, context));\n    },\n\n    flatten: function(depth) {\n      return reify(this, flattenFactory(this, depth, true));\n    },\n\n    fromEntrySeq: function() {\n      return new FromEntriesSequence(this);\n    },\n\n    get: function(searchKey, notSetValue) {\n      return this.find(function(_, key)  {return is(key, searchKey)}, undefined, notSetValue);\n    },\n\n    getIn: function(searchKeyPath, notSetValue) {\n      var nested = this;\n      // Note: in an ES6 environment, we would prefer:\n      // for (var key of searchKeyPath) {\n      var iter = forceIterator(searchKeyPath);\n      var step;\n      while (!(step = iter.next()).done) {\n        var key = step.value;\n        nested = nested && nested.get ? nested.get(key, NOT_SET) : NOT_SET;\n        if (nested === NOT_SET) {\n          return notSetValue;\n        }\n      }\n      return nested;\n    },\n\n    groupBy: function(grouper, context) {\n      return groupByFactory(this, grouper, context);\n    },\n\n    has: function(searchKey) {\n      return this.get(searchKey, NOT_SET) !== NOT_SET;\n    },\n\n    hasIn: function(searchKeyPath) {\n      return this.getIn(searchKeyPath, NOT_SET) !== NOT_SET;\n    },\n\n    isSubset: function(iter) {\n      iter = typeof iter.includes === 'function' ? iter : Iterable(iter);\n      return this.every(function(value ) {return iter.includes(value)});\n    },\n\n    isSuperset: function(iter) {\n      iter = typeof iter.isSubset === 'function' ? iter : Iterable(iter);\n      return iter.isSubset(this);\n    },\n\n    keySeq: function() {\n      return this.toSeq().map(keyMapper).toIndexedSeq();\n    },\n\n    last: function() {\n      return this.toSeq().reverse().first();\n    },\n\n    max: function(comparator) {\n      return maxFactory(this, comparator);\n    },\n\n    maxBy: function(mapper, comparator) {\n      return maxFactory(this, comparator, mapper);\n    },\n\n    min: function(comparator) {\n      return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator);\n    },\n\n    minBy: function(mapper, comparator) {\n      return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator, mapper);\n    },\n\n    rest: function() {\n      return this.slice(1);\n    },\n\n    skip: function(amount) {\n      return this.slice(Math.max(0, amount));\n    },\n\n    skipLast: function(amount) {\n      return reify(this, this.toSeq().reverse().skip(amount).reverse());\n    },\n\n    skipWhile: function(predicate, context) {\n      return reify(this, skipWhileFactory(this, predicate, context, true));\n    },\n\n    skipUntil: function(predicate, context) {\n      return this.skipWhile(not(predicate), context);\n    },\n\n    sortBy: function(mapper, comparator) {\n      return reify(this, sortFactory(this, comparator, mapper));\n    },\n\n    take: function(amount) {\n      return this.slice(0, Math.max(0, amount));\n    },\n\n    takeLast: function(amount) {\n      return reify(this, this.toSeq().reverse().take(amount).reverse());\n    },\n\n    takeWhile: function(predicate, context) {\n      return reify(this, takeWhileFactory(this, predicate, context));\n    },\n\n    takeUntil: function(predicate, context) {\n      return this.takeWhile(not(predicate), context);\n    },\n\n    valueSeq: function() {\n      return this.toIndexedSeq();\n    },\n\n\n    // ### Hashable Object\n\n    hashCode: function() {\n      return this.__hash || (this.__hash = hashIterable(this));\n    }\n\n\n    // ### Internal\n\n    // abstract __iterate(fn, reverse)\n\n    // abstract __iterator(type, reverse)\n  });\n\n  // var IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\n  // var IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\n  // var IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\n  // var IS_ORDERED_SENTINEL = '@@__IMMUTABLE_ORDERED__@@';\n\n  var IterablePrototype = Iterable.prototype;\n  IterablePrototype[IS_ITERABLE_SENTINEL] = true;\n  IterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.values;\n  IterablePrototype.__toJS = IterablePrototype.toArray;\n  IterablePrototype.__toStringMapper = quoteString;\n  IterablePrototype.inspect =\n  IterablePrototype.toSource = function() { return this.toString(); };\n  IterablePrototype.chain = IterablePrototype.flatMap;\n  IterablePrototype.contains = IterablePrototype.includes;\n\n  // Temporary warning about using length\n  (function () {\n    try {\n      Object.defineProperty(IterablePrototype, 'length', {\n        get: function () {\n          if (!Iterable.noLengthWarning) {\n            var stack;\n            try {\n              throw new Error();\n            } catch (error) {\n              stack = error.stack;\n            }\n            if (stack.indexOf('_wrapObject') === -1) {\n              console && console.warn && console.warn(\n                'iterable.length has been deprecated, '+\n                'use iterable.size or iterable.count(). '+\n                'This warning will become a silent error in a future version. ' +\n                stack\n              );\n              return this.size;\n            }\n          }\n        }\n      });\n    } catch (e) {}\n  })();\n\n\n\n  mixin(KeyedIterable, {\n\n    // ### More sequential methods\n\n    flip: function() {\n      return reify(this, flipFactory(this));\n    },\n\n    findKey: function(predicate, context) {\n      var entry = this.findEntry(predicate, context);\n      return entry && entry[0];\n    },\n\n    findLastKey: function(predicate, context) {\n      return this.toSeq().reverse().findKey(predicate, context);\n    },\n\n    keyOf: function(searchValue) {\n      return this.findKey(function(value ) {return is(value, searchValue)});\n    },\n\n    lastKeyOf: function(searchValue) {\n      return this.findLastKey(function(value ) {return is(value, searchValue)});\n    },\n\n    mapEntries: function(mapper, context) {var this$0 = this;\n      var iterations = 0;\n      return reify(this,\n        this.toSeq().map(\n          function(v, k)  {return mapper.call(context, [k, v], iterations++, this$0)}\n        ).fromEntrySeq()\n      );\n    },\n\n    mapKeys: function(mapper, context) {var this$0 = this;\n      return reify(this,\n        this.toSeq().flip().map(\n          function(k, v)  {return mapper.call(context, k, v, this$0)}\n        ).flip()\n      );\n    }\n\n  });\n\n  var KeyedIterablePrototype = KeyedIterable.prototype;\n  KeyedIterablePrototype[IS_KEYED_SENTINEL] = true;\n  KeyedIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.entries;\n  KeyedIterablePrototype.__toJS = IterablePrototype.toObject;\n  KeyedIterablePrototype.__toStringMapper = function(v, k)  {return JSON.stringify(k) + ': ' + quoteString(v)};\n\n\n\n  mixin(IndexedIterable, {\n\n    // ### Conversion to other types\n\n    toKeyedSeq: function() {\n      return new ToKeyedSequence(this, false);\n    },\n\n\n    // ### ES6 Collection methods (ES6 Array and Map)\n\n    filter: function(predicate, context) {\n      return reify(this, filterFactory(this, predicate, context, false));\n    },\n\n    findIndex: function(predicate, context) {\n      var entry = this.findEntry(predicate, context);\n      return entry ? entry[0] : -1;\n    },\n\n    indexOf: function(searchValue) {\n      var key = this.toKeyedSeq().keyOf(searchValue);\n      return key === undefined ? -1 : key;\n    },\n\n    lastIndexOf: function(searchValue) {\n      var key = this.toKeyedSeq().reverse().keyOf(searchValue);\n      return key === undefined ? -1 : key;\n\n      // var index =\n      // return this.toSeq().reverse().indexOf(searchValue);\n    },\n\n    reverse: function() {\n      return reify(this, reverseFactory(this, false));\n    },\n\n    slice: function(begin, end) {\n      return reify(this, sliceFactory(this, begin, end, false));\n    },\n\n    splice: function(index, removeNum /*, ...values*/) {\n      var numArgs = arguments.length;\n      removeNum = Math.max(removeNum | 0, 0);\n      if (numArgs === 0 || (numArgs === 2 && !removeNum)) {\n        return this;\n      }\n      // If index is negative, it should resolve relative to the size of the\n      // collection. However size may be expensive to compute if not cached, so\n      // only call count() if the number is in fact negative.\n      index = resolveBegin(index, index < 0 ? this.count() : this.size);\n      var spliced = this.slice(0, index);\n      return reify(\n        this,\n        numArgs === 1 ?\n          spliced :\n          spliced.concat(arrCopy(arguments, 2), this.slice(index + removeNum))\n      );\n    },\n\n\n    // ### More collection methods\n\n    findLastIndex: function(predicate, context) {\n      var key = this.toKeyedSeq().findLastKey(predicate, context);\n      return key === undefined ? -1 : key;\n    },\n\n    first: function() {\n      return this.get(0);\n    },\n\n    flatten: function(depth) {\n      return reify(this, flattenFactory(this, depth, false));\n    },\n\n    get: function(index, notSetValue) {\n      index = wrapIndex(this, index);\n      return (index < 0 || (this.size === Infinity ||\n          (this.size !== undefined && index > this.size))) ?\n        notSetValue :\n        this.find(function(_, key)  {return key === index}, undefined, notSetValue);\n    },\n\n    has: function(index) {\n      index = wrapIndex(this, index);\n      return index >= 0 && (this.size !== undefined ?\n        this.size === Infinity || index < this.size :\n        this.indexOf(index) !== -1\n      );\n    },\n\n    interpose: function(separator) {\n      return reify(this, interposeFactory(this, separator));\n    },\n\n    interleave: function(/*...iterables*/) {\n      var iterables = [this].concat(arrCopy(arguments));\n      var zipped = zipWithFactory(this.toSeq(), IndexedSeq.of, iterables);\n      var interleaved = zipped.flatten(true);\n      if (zipped.size) {\n        interleaved.size = zipped.size * iterables.length;\n      }\n      return reify(this, interleaved);\n    },\n\n    last: function() {\n      return this.get(-1);\n    },\n\n    skipWhile: function(predicate, context) {\n      return reify(this, skipWhileFactory(this, predicate, context, false));\n    },\n\n    zip: function(/*, ...iterables */) {\n      var iterables = [this].concat(arrCopy(arguments));\n      return reify(this, zipWithFactory(this, defaultZipper, iterables));\n    },\n\n    zipWith: function(zipper/*, ...iterables */) {\n      var iterables = arrCopy(arguments);\n      iterables[0] = this;\n      return reify(this, zipWithFactory(this, zipper, iterables));\n    }\n\n  });\n\n  IndexedIterable.prototype[IS_INDEXED_SENTINEL] = true;\n  IndexedIterable.prototype[IS_ORDERED_SENTINEL] = true;\n\n\n\n  mixin(SetIterable, {\n\n    // ### ES6 Collection methods (ES6 Array and Map)\n\n    get: function(value, notSetValue) {\n      return this.has(value) ? value : notSetValue;\n    },\n\n    includes: function(value) {\n      return this.has(value);\n    },\n\n\n    // ### More sequential methods\n\n    keySeq: function() {\n      return this.valueSeq();\n    }\n\n  });\n\n  SetIterable.prototype.has = IterablePrototype.includes;\n\n\n  // Mixin subclasses\n\n  mixin(KeyedSeq, KeyedIterable.prototype);\n  mixin(IndexedSeq, IndexedIterable.prototype);\n  mixin(SetSeq, SetIterable.prototype);\n\n  mixin(KeyedCollection, KeyedIterable.prototype);\n  mixin(IndexedCollection, IndexedIterable.prototype);\n  mixin(SetCollection, SetIterable.prototype);\n\n\n  // #pragma Helper functions\n\n  function keyMapper(v, k) {\n    return k;\n  }\n\n  function entryMapper(v, k) {\n    return [k, v];\n  }\n\n  function not(predicate) {\n    return function() {\n      return !predicate.apply(this, arguments);\n    }\n  }\n\n  function neg(predicate) {\n    return function() {\n      return -predicate.apply(this, arguments);\n    }\n  }\n\n  function quoteString(value) {\n    return typeof value === 'string' ? JSON.stringify(value) : value;\n  }\n\n  function defaultZipper() {\n    return arrCopy(arguments);\n  }\n\n  function defaultNegComparator(a, b) {\n    return a < b ? 1 : a > b ? -1 : 0;\n  }\n\n  function hashIterable(iterable) {\n    if (iterable.size === Infinity) {\n      return 0;\n    }\n    var ordered = isOrdered(iterable);\n    var keyed = isKeyed(iterable);\n    var h = ordered ? 1 : 0;\n    var size = iterable.__iterate(\n      keyed ?\n        ordered ?\n          function(v, k)  { h = 31 * h + hashMerge(hash(v), hash(k)) | 0; } :\n          function(v, k)  { h = h + hashMerge(hash(v), hash(k)) | 0; } :\n        ordered ?\n          function(v ) { h = 31 * h + hash(v) | 0; } :\n          function(v ) { h = h + hash(v) | 0; }\n    );\n    return murmurHashOfSize(size, h);\n  }\n\n  function murmurHashOfSize(size, h) {\n    h = imul(h, 0xCC9E2D51);\n    h = imul(h << 15 | h >>> -15, 0x1B873593);\n    h = imul(h << 13 | h >>> -13, 5);\n    h = (h + 0xE6546B64 | 0) ^ size;\n    h = imul(h ^ h >>> 16, 0x85EBCA6B);\n    h = imul(h ^ h >>> 13, 0xC2B2AE35);\n    h = smi(h ^ h >>> 16);\n    return h;\n  }\n\n  function hashMerge(a, b) {\n    return a ^ b + 0x9E3779B9 + (a << 6) + (a >> 2) | 0; // int\n  }\n\n  var Immutable = {\n\n    Iterable: Iterable,\n\n    Seq: Seq,\n    Collection: Collection,\n    Map: Map,\n    OrderedMap: OrderedMap,\n    List: List,\n    Stack: Stack,\n    Set: Set,\n    OrderedSet: OrderedSet,\n\n    Record: Record,\n    Range: Range,\n    Repeat: Repeat,\n\n    is: is,\n    fromJS: fromJS\n\n  };\n\n  return Immutable;\n\n}));","import { RichUtils, EditorState } from 'draft-js';\n\nfunction _extends() {\n  _extends = Object.assign || function (target) {\n    for (var i = 1; i < arguments.length; i++) {\n      var source = arguments[i];\n\n      for (var key in source) {\n        if (Object.prototype.hasOwnProperty.call(source, key)) {\n          target[key] = source[key];\n        }\n      }\n    }\n\n    return target;\n  };\n\n  return _extends.apply(this, arguments);\n}\n\n// eslint-disable-next-line @typescript-eslint/ban-types\n// eslint-disable-next-line @typescript-eslint/ban-types\nfunction createStore(initialState) {\n  if (initialState === void 0) {\n    initialState = {};\n  }\n\n  var state = initialState;\n  var listeners = {};\n  return {\n    subscribeToItem: function subscribeToItem(key, callback) {\n      listeners[key] = listeners[key] || [];\n      listeners[key].push(callback);\n    },\n    unsubscribeFromItem: function unsubscribeFromItem(key, callback) {\n      var listener = listeners[key];\n\n      if (listener) {\n        listeners[key] = listener.filter(function (currentListener) {\n          return currentListener !== callback;\n        });\n      }\n    },\n    updateItem: function updateItem(key, item) {\n      var _extends2;\n\n      state = _extends({}, state, (_extends2 = {}, _extends2[key] = item, _extends2));\n      var listener = listeners[key];\n\n      if (listener) {\n        listener.forEach(function (currentListener) {\n          return currentListener(state[key]);\n        });\n      }\n    },\n    getItem: function getItem(key) {\n      return state[key];\n    }\n  };\n}\n\nfunction findWithRegex(regex, contentBlock, callback) {\n  // Get the text from the contentBlock\n  var text = contentBlock.getText();\n  var matchArr;\n  var start; // Go through all matches in the text and return the indizes to the callback\n\n  while ((matchArr = regex.exec(text)) !== null) {\n    if (matchArr.index === regex.lastIndex) {\n      // eslint-disable-next-line no-param-reassign\n      regex.lastIndex += 1;\n    }\n\n    start = matchArr.index;\n    callback(start, start + matchArr[0].length);\n  }\n}\n\nvar index = {\n  decodeOffsetKey: function decodeOffsetKey(offsetKey) {\n    var _offsetKey$split = offsetKey.split('-'),\n        blockKey = _offsetKey$split[0],\n        decoratorKey = _offsetKey$split[1],\n        leafKey = _offsetKey$split[2];\n\n    return {\n      blockKey: blockKey,\n      decoratorKey: parseInt(decoratorKey, 10),\n      leafKey: parseInt(leafKey, 10)\n    };\n  },\n  createLinkAtSelection: function createLinkAtSelection(editorState, url) {\n    var contentState = editorState.getCurrentContent().createEntity('LINK', 'MUTABLE', {\n      url: url\n    });\n    var entityKey = contentState.getLastCreatedEntityKey();\n    var withLink = RichUtils.toggleLink(editorState, editorState.getSelection(), entityKey);\n    return EditorState.forceSelection(withLink, editorState.getSelection());\n  },\n  removeLinkAtSelection: function removeLinkAtSelection(editorState) {\n    var selection = editorState.getSelection();\n    return RichUtils.toggleLink(editorState, selection, null);\n  },\n  collapseToEnd: function collapseToEnd(editorState) {\n    var selection = editorState.getSelection();\n    return EditorState.forceSelection(editorState, selection.merge({\n      anchorKey: selection.getEndKey(),\n      focusKey: selection.getEndKey(),\n      anchorOffset: selection.getEndOffset(),\n      focusOffset: selection.getEndOffset()\n    }));\n  },\n  getCurrentEntityKey: function getCurrentEntityKey(editorState) {\n    var selection = editorState.getSelection();\n    var anchorKey = selection.getAnchorKey();\n    var contentState = editorState.getCurrentContent();\n    var anchorBlock = contentState.getBlockForKey(anchorKey);\n    var offset = selection.getAnchorOffset();\n    var index = selection.getIsBackward() ? offset - 1 : offset;\n    return anchorBlock.getEntityAt(index);\n  },\n  getCurrentEntity: function getCurrentEntity(editorState) {\n    var contentState = editorState.getCurrentContent();\n    var entityKey = this.getCurrentEntityKey(editorState);\n    return entityKey ? contentState.getEntity(entityKey) : null;\n  },\n  hasEntity: function hasEntity(editorState, entityType) {\n    var entity = this.getCurrentEntity(editorState);\n    return Boolean(entity && entity.getType() === entityType);\n  }\n};\n\nexport default index;\nexport { createStore, findWithRegex };\n","import React from 'react';\nimport { createStore } from '@draft-js-plugins/utils';\nimport { ItalicButton, BoldButton, UnderlineButton, CodeButton } from '@draft-js-plugins/buttons';\nimport PropTypes from 'prop-types';\n\nfunction _extends() {\n  _extends = Object.assign || function (target) {\n    for (var i = 1; i < arguments.length; i++) {\n      var source = arguments[i];\n\n      for (var key in source) {\n        if (Object.prototype.hasOwnProperty.call(source, key)) {\n          target[key] = source[key];\n        }\n      }\n    }\n\n    return target;\n  };\n\n  return _extends.apply(this, arguments);\n}\n\nfunction _inheritsLoose(subClass, superClass) {\n  subClass.prototype = Object.create(superClass.prototype);\n  subClass.prototype.constructor = subClass;\n\n  _setPrototypeOf(subClass, superClass);\n}\n\nfunction _setPrototypeOf(o, p) {\n  _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) {\n    o.__proto__ = p;\n    return o;\n  };\n\n  return _setPrototypeOf(o, p);\n}\n\nvar Toolbar = /*#__PURE__*/function (_React$Component) {\n  _inheritsLoose(Toolbar, _React$Component);\n\n  function Toolbar() {\n    var _this;\n\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    _this = _React$Component.call.apply(_React$Component, [this].concat(args)) || this;\n    _this.state = {\n      /**\n       * If this is set, the toolbar will render this instead of the regular\n       * structure and will also be shown when the editor loses focus.\n       * @type {Component}\n       */\n      overrideContent: undefined\n    };\n\n    _this.onOverrideContent = function (overrideContent) {\n      return _this.setState({\n        overrideContent: overrideContent\n      });\n    };\n\n    _this.renderDefaultButtons = function (externalProps) {\n      return /*#__PURE__*/React.createElement(\"div\", null, /*#__PURE__*/React.createElement(ItalicButton, externalProps), /*#__PURE__*/React.createElement(BoldButton, externalProps), /*#__PURE__*/React.createElement(UnderlineButton, externalProps), /*#__PURE__*/React.createElement(CodeButton, externalProps));\n    };\n\n    return _this;\n  }\n\n  var _proto = Toolbar.prototype;\n\n  _proto.render = function render() {\n    var _this$props = this.props,\n        theme = _this$props.theme,\n        store = _this$props.store;\n    var OverrideContent = this.state.overrideContent;\n    var childrenProps = {\n      theme: theme.buttonStyles,\n      getEditorState: store.getItem('getEditorState'),\n      setEditorState: store.getItem('setEditorState'),\n      onOverrideContent: this.onOverrideContent\n    };\n    return /*#__PURE__*/React.createElement(\"div\", {\n      className: theme.toolbarStyles.toolbar\n    }, OverrideContent ? /*#__PURE__*/React.createElement(OverrideContent, childrenProps) : (this.props.children || this.renderDefaultButtons)(childrenProps));\n  };\n\n  return Toolbar;\n}(React.Component);\n\nToolbar.propTypes = {\n  children: PropTypes.func\n};\n\nvar separator = \"s6m29i4\";\nfunction Seperator(_ref) {\n  var _ref$className = _ref.className,\n      className = _ref$className === void 0 ? separator : _ref$className;\n  return /*#__PURE__*/React.createElement(\"div\", {\n    className: className\n  });\n}\n\nvar buttonStyles = {\n  buttonWrapper: \"bi09khh\",\n  button: \"bc4rxid\",\n  active: \"akzb7t5\"\n};\nvar toolbarStyles = {\n  toolbar: \"t16lpgj\"\n};\nvar defaultTheme = {\n  buttonStyles: buttonStyles,\n  toolbarStyles: toolbarStyles\n};\n\nvar index = (function (config) {\n  if (config === void 0) {\n    config = {};\n  }\n\n  var store = createStore();\n  var _config = config,\n      _config$theme = _config.theme,\n      theme = _config$theme === void 0 ? defaultTheme : _config$theme;\n\n  var StaticToolbar = function StaticToolbar(props) {\n    return /*#__PURE__*/React.createElement(Toolbar, _extends({}, props, {\n      store: store,\n      theme: theme\n    }));\n  };\n\n  return {\n    initialize: function initialize(_ref) {\n      var getEditorState = _ref.getEditorState,\n          setEditorState = _ref.setEditorState;\n      store.updateItem('getEditorState', getEditorState);\n      store.updateItem('setEditorState', setEditorState);\n    },\n    // Re-Render the text-toolbar on selection change\n    onChange: function onChange(editorState) {\n      store.updateItem('selection', editorState.getSelection());\n      return editorState;\n    },\n    Toolbar: StaticToolbar\n  };\n});\n\nexport { Seperator as Separator, index as default };\n","function r(e){var t,f,n=\"\";if(\"string\"==typeof e||\"number\"==typeof e)n+=e;else if(\"object\"==typeof e)if(Array.isArray(e)){var o=e.length;for(t=0;t<o;t++)e[t]&&(f=r(e[t]))&&(n&&(n+=\" \"),n+=f)}else for(f in e)e[f]&&(n&&(n+=\" \"),n+=f);return n}export function clsx(){for(var e,t,f=0,n=\"\",o=arguments.length;f<o;f++)(e=arguments[f])&&(t=r(e))&&(n&&(n+=\" \"),n+=t);return n}export default clsx;","function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { keys.push.apply(keys, Object.getOwnPropertySymbols(object)); } if (enumerableOnly) keys = keys.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); 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(source, true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(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 _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nfunction combineOrderedStyles(customMap, defaults) {\n  if (customMap == null) {\n    return defaults;\n  }\n\n  var _defaults = _slicedToArray(defaults, 2),\n      defaultStyleMap = _defaults[0],\n      defaultStyleOrder = _defaults[1];\n\n  var styleMap = _objectSpread({}, defaultStyleMap);\n\n  var styleOrder = _toConsumableArray(defaultStyleOrder);\n\n  for (var _i2 = 0, _Object$keys = Object.keys(customMap); _i2 < _Object$keys.length; _i2++) {\n    var _styleName = _Object$keys[_i2];\n\n    if (defaultStyleMap.hasOwnProperty(_styleName)) {\n      var defaultStyles = defaultStyleMap[_styleName];\n      styleMap[_styleName] = _objectSpread({}, defaultStyles, {}, customMap[_styleName]);\n    } else {\n      styleMap[_styleName] = customMap[_styleName];\n      styleOrder.push(_styleName);\n    }\n  }\n\n  return [styleMap, styleOrder];\n}\n\nexport default combineOrderedStyles;","// Lifted from: https://github.com/facebook/react/blob/master/src/renderers/dom/shared/HTMLDOMPropertyConfig.js\nvar ATTR_NAME_MAP = {\n  acceptCharset: 'accept-charset',\n  className: 'class',\n  htmlFor: 'for',\n  httpEquiv: 'http-equiv'\n};\n\nfunction normalizeAttributes(attributes) {\n  if (attributes == null) {\n    return attributes;\n  }\n\n  var normalized = {};\n  var didNormalize = false;\n\n  for (var _i = 0, _Object$keys = Object.keys(attributes); _i < _Object$keys.length; _i++) {\n    var name = _Object$keys[_i];\n    var newName = name;\n\n    if (ATTR_NAME_MAP.hasOwnProperty(name)) {\n      newName = ATTR_NAME_MAP[name];\n      didNormalize = true;\n    }\n\n    normalized[newName] = attributes[name];\n  }\n\n  return didNormalize ? normalized : attributes;\n}\n\nexport default normalizeAttributes;","var VENDOR_PREFIX = /^(moz|ms|o|webkit)-/;\nvar NUMERIC_STRING = /^\\d+$/;\nvar UPPERCASE_PATTERN = /([A-Z])/g; // Lifted from:\n// https://github.com/facebook/react/blob/ab4ddf64939aebbbc8d31be1022efd56e834c95c/src/renderers/dom/shared/CSSProperty.js\n\nvar isUnitlessNumber = {\n  animationIterationCount: true,\n  borderImageOutset: true,\n  borderImageSlice: true,\n  borderImageWidth: true,\n  boxFlex: true,\n  boxFlexGroup: true,\n  boxOrdinalGroup: true,\n  columnCount: true,\n  flex: true,\n  flexGrow: true,\n  flexPositive: true,\n  flexShrink: true,\n  flexNegative: true,\n  flexOrder: true,\n  gridRow: true,\n  gridRowEnd: true,\n  gridRowSpan: true,\n  gridRowStart: true,\n  gridColumn: true,\n  gridColumnEnd: true,\n  gridColumnSpan: true,\n  gridColumnStart: true,\n  fontWeight: true,\n  lineClamp: true,\n  lineHeight: true,\n  opacity: true,\n  order: true,\n  orphans: true,\n  tabSize: true,\n  widows: true,\n  zIndex: true,\n  zoom: true,\n  // SVG-related properties\n  fillOpacity: true,\n  floodOpacity: true,\n  stopOpacity: true,\n  strokeDasharray: true,\n  strokeDashoffset: true,\n  strokeMiterlimit: true,\n  strokeOpacity: true,\n  strokeWidth: true\n}; // Lifted from: https://github.com/facebook/react/blob/master/src/renderers/dom/shared/CSSPropertyOperations.js\n\nfunction processStyleName(name) {\n  return name.replace(UPPERCASE_PATTERN, '-$1').toLowerCase().replace(VENDOR_PREFIX, '-$1-');\n} // Lifted from: https://github.com/facebook/react/blob/master/src/renderers/dom/shared/dangerousStyleValue.js\n\n\nfunction processStyleValue(name, value) {\n  var isNumeric;\n\n  if (typeof value === 'string') {\n    isNumeric = NUMERIC_STRING.test(value);\n  } else {\n    isNumeric = true;\n    value = String(value);\n  }\n\n  if (!isNumeric || value === '0' || isUnitlessNumber[name] === true) {\n    return value;\n  } else {\n    return value + 'px';\n  }\n}\n\nfunction styleToCSS(styleDescr) {\n  return Object.keys(styleDescr).map(function (name) {\n    var styleValue = processStyleValue(name, styleDescr[name]);\n    var styleName = processStyleName(name);\n    return \"\".concat(styleName, \": \").concat(styleValue);\n  }).join('; ');\n}\n\nexport default styleToCSS;","export var BLOCK_TYPE = {\n  // This is used to represent a normal text block (paragraph).\n  UNSTYLED: 'unstyled',\n  HEADER_ONE: 'header-one',\n  HEADER_TWO: 'header-two',\n  HEADER_THREE: 'header-three',\n  HEADER_FOUR: 'header-four',\n  HEADER_FIVE: 'header-five',\n  HEADER_SIX: 'header-six',\n  UNORDERED_LIST_ITEM: 'unordered-list-item',\n  ORDERED_LIST_ITEM: 'ordered-list-item',\n  BLOCKQUOTE: 'blockquote',\n  PULLQUOTE: 'pullquote',\n  CODE: 'code-block',\n  ATOMIC: 'atomic'\n};\nexport var ENTITY_TYPE = {\n  LINK: 'LINK',\n  IMAGE: 'IMAGE',\n  EMBED: 'embed'\n};\nexport var INLINE_STYLE = {\n  BOLD: 'BOLD',\n  CODE: 'CODE',\n  ITALIC: 'ITALIC',\n  STRIKETHROUGH: 'STRIKETHROUGH',\n  UNDERLINE: 'UNDERLINE'\n};\nexport default {\n  BLOCK_TYPE: BLOCK_TYPE,\n  ENTITY_TYPE: ENTITY_TYPE,\n  INLINE_STYLE: INLINE_STYLE\n};","import { OrderedSet, is } from 'immutable';\nexport var EMPTY_SET = new OrderedSet();\nexport default function getEntityRanges(text, charMetaList) {\n  var charEntity = null;\n  var prevCharEntity = null;\n  var ranges = [];\n  var rangeStart = 0;\n\n  for (var i = 0, len = text.length; i < len; i++) {\n    prevCharEntity = charEntity;\n    var meta = charMetaList.get(i);\n    charEntity = meta ? meta.getEntity() : null;\n\n    if (i > 0 && charEntity !== prevCharEntity) {\n      ranges.push([prevCharEntity, getStyleRanges(text.slice(rangeStart, i), charMetaList.slice(rangeStart, i))]);\n      rangeStart = i;\n    }\n  }\n\n  ranges.push([charEntity, getStyleRanges(text.slice(rangeStart), charMetaList.slice(rangeStart))]);\n  return ranges;\n}\n\nfunction getStyleRanges(text, charMetaList) {\n  var charStyle = EMPTY_SET;\n  var prevCharStyle = EMPTY_SET;\n  var ranges = [];\n  var rangeStart = 0;\n\n  for (var i = 0, len = text.length; i < len; i++) {\n    prevCharStyle = charStyle;\n    var meta = charMetaList.get(i);\n    charStyle = meta ? meta.getStyle() : EMPTY_SET;\n\n    if (i > 0 && !is(charStyle, prevCharStyle)) {\n      ranges.push([text.slice(rangeStart, i), prevCharStyle]);\n      rangeStart = i;\n    }\n  }\n\n  ranges.push([text.slice(rangeStart), charStyle]);\n  return ranges;\n}","var _DEFAULT_STYLE_MAP, _ENTITY_ATTR_MAP, _DATA_TO_ATTR;\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { keys.push.apply(keys, Object.getOwnPropertySymbols(object)); } if (enumerableOnly) keys = keys.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); 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(source, true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(source).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\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 _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 combineOrderedStyles from './helpers/combineOrderedStyles';\nimport normalizeAttributes from './helpers/normalizeAttributes';\nimport styleToCSS from './helpers/styleToCSS';\nimport { getEntityRanges, BLOCK_TYPE, ENTITY_TYPE, INLINE_STYLE } from 'draft-js-utils';\nvar BOLD = INLINE_STYLE.BOLD,\n    CODE = INLINE_STYLE.CODE,\n    ITALIC = INLINE_STYLE.ITALIC,\n    STRIKETHROUGH = INLINE_STYLE.STRIKETHROUGH,\n    UNDERLINE = INLINE_STYLE.UNDERLINE;\nvar INDENT = '  ';\nvar BREAK = '<br>';\nvar DATA_ATTRIBUTE = /^data-([a-z0-9-]+)$/;\nvar DEFAULT_STYLE_MAP = (_DEFAULT_STYLE_MAP = {}, _defineProperty(_DEFAULT_STYLE_MAP, BOLD, {\n  element: 'strong'\n}), _defineProperty(_DEFAULT_STYLE_MAP, CODE, {\n  element: 'code'\n}), _defineProperty(_DEFAULT_STYLE_MAP, ITALIC, {\n  element: 'em'\n}), _defineProperty(_DEFAULT_STYLE_MAP, STRIKETHROUGH, {\n  element: 'del'\n}), _defineProperty(_DEFAULT_STYLE_MAP, UNDERLINE, {\n  element: 'u'\n}), _DEFAULT_STYLE_MAP); // Order: inner-most style to outer-most.\n// Examle: <em><strong>foo</strong></em>\n\nvar DEFAULT_STYLE_ORDER = [BOLD, ITALIC, UNDERLINE, STRIKETHROUGH, CODE]; // Map entity data to element attributes.\n\nvar ENTITY_ATTR_MAP = (_ENTITY_ATTR_MAP = {}, _defineProperty(_ENTITY_ATTR_MAP, ENTITY_TYPE.LINK, {\n  url: 'href',\n  href: 'href',\n  rel: 'rel',\n  target: 'target',\n  title: 'title',\n  className: 'class'\n}), _defineProperty(_ENTITY_ATTR_MAP, ENTITY_TYPE.IMAGE, {\n  src: 'src',\n  height: 'height',\n  width: 'width',\n  alt: 'alt',\n  className: 'class'\n}), _ENTITY_ATTR_MAP); // Map entity data to element attributes.\n\nvar DATA_TO_ATTR = (_DATA_TO_ATTR = {}, _defineProperty(_DATA_TO_ATTR, ENTITY_TYPE.LINK, function (entityType, entity) {\n  var attrMap = ENTITY_ATTR_MAP.hasOwnProperty(entityType) ? ENTITY_ATTR_MAP[entityType] : {};\n  var data = entity.getData();\n  var attrs = {};\n\n  for (var _i = 0, _Object$keys = Object.keys(data); _i < _Object$keys.length; _i++) {\n    var dataKey = _Object$keys[_i];\n    var dataValue = data[dataKey];\n\n    if (attrMap.hasOwnProperty(dataKey)) {\n      var attrKey = attrMap[dataKey];\n      attrs[attrKey] = dataValue;\n    } else if (DATA_ATTRIBUTE.test(dataKey)) {\n      attrs[dataKey] = dataValue;\n    }\n  }\n\n  return attrs;\n}), _defineProperty(_DATA_TO_ATTR, ENTITY_TYPE.IMAGE, function (entityType, entity) {\n  var attrMap = ENTITY_ATTR_MAP.hasOwnProperty(entityType) ? ENTITY_ATTR_MAP[entityType] : {};\n  var data = entity.getData();\n  var attrs = {};\n\n  for (var _i2 = 0, _Object$keys2 = Object.keys(data); _i2 < _Object$keys2.length; _i2++) {\n    var dataKey = _Object$keys2[_i2];\n    var dataValue = data[dataKey];\n\n    if (attrMap.hasOwnProperty(dataKey)) {\n      var attrKey = attrMap[dataKey];\n      attrs[attrKey] = dataValue;\n    } else if (DATA_ATTRIBUTE.test(dataKey)) {\n      attrs[dataKey] = dataValue;\n    }\n  }\n\n  return attrs;\n}), _DATA_TO_ATTR); // The reason this returns an array is because a single block might get wrapped\n// in two tags.\n\nfunction getTags(blockType, defaultBlockTag) {\n  switch (blockType) {\n    case BLOCK_TYPE.HEADER_ONE:\n      return ['h1'];\n\n    case BLOCK_TYPE.HEADER_TWO:\n      return ['h2'];\n\n    case BLOCK_TYPE.HEADER_THREE:\n      return ['h3'];\n\n    case BLOCK_TYPE.HEADER_FOUR:\n      return ['h4'];\n\n    case BLOCK_TYPE.HEADER_FIVE:\n      return ['h5'];\n\n    case BLOCK_TYPE.HEADER_SIX:\n      return ['h6'];\n\n    case BLOCK_TYPE.UNORDERED_LIST_ITEM:\n    case BLOCK_TYPE.ORDERED_LIST_ITEM:\n      return ['li'];\n\n    case BLOCK_TYPE.BLOCKQUOTE:\n      return ['blockquote'];\n\n    case BLOCK_TYPE.CODE:\n      return ['pre', 'code'];\n\n    case BLOCK_TYPE.ATOMIC:\n      return ['figure'];\n\n    default:\n      if (defaultBlockTag === null) {\n        return [];\n      }\n\n      return [defaultBlockTag || 'p'];\n  }\n}\n\nfunction getWrapperTag(blockType) {\n  switch (blockType) {\n    case BLOCK_TYPE.UNORDERED_LIST_ITEM:\n      return 'ul';\n\n    case BLOCK_TYPE.ORDERED_LIST_ITEM:\n      return 'ol';\n\n    default:\n      return null;\n  }\n}\n\nvar MarkupGenerator =\n/*#__PURE__*/\nfunction () {\n  // These are related to state.\n  // These are related to user-defined options.\n  function MarkupGenerator(contentState, options) {\n    _classCallCheck(this, MarkupGenerator);\n\n    _defineProperty(this, \"blocks\", void 0);\n\n    _defineProperty(this, \"contentState\", void 0);\n\n    _defineProperty(this, \"currentBlock\", void 0);\n\n    _defineProperty(this, \"indentLevel\", void 0);\n\n    _defineProperty(this, \"output\", void 0);\n\n    _defineProperty(this, \"totalBlocks\", void 0);\n\n    _defineProperty(this, \"wrapperTag\", void 0);\n\n    _defineProperty(this, \"options\", void 0);\n\n    _defineProperty(this, \"inlineStyles\", void 0);\n\n    _defineProperty(this, \"inlineStyleFn\", void 0);\n\n    _defineProperty(this, \"styleOrder\", void 0);\n\n    if (options == null) {\n      options = {};\n    }\n\n    this.contentState = contentState;\n    this.options = options;\n\n    var _combineOrderedStyles = combineOrderedStyles(options.inlineStyles, [DEFAULT_STYLE_MAP, DEFAULT_STYLE_ORDER]),\n        _combineOrderedStyles2 = _slicedToArray(_combineOrderedStyles, 2),\n        inlineStyles = _combineOrderedStyles2[0],\n        styleOrder = _combineOrderedStyles2[1];\n\n    this.inlineStyles = inlineStyles;\n    this.inlineStyleFn = options.inlineStyleFn;\n    this.styleOrder = styleOrder;\n  }\n\n  _createClass(MarkupGenerator, [{\n    key: \"generate\",\n    value: function generate() {\n      this.output = [];\n      this.blocks = this.contentState.getBlocksAsArray();\n      this.totalBlocks = this.blocks.length;\n      this.currentBlock = 0;\n      this.indentLevel = 0;\n      this.wrapperTag = null;\n\n      while (this.currentBlock < this.totalBlocks) {\n        this.processBlock();\n      }\n\n      this.closeWrapperTag();\n      return this.output.join('').trim();\n    }\n  }, {\n    key: \"processBlock\",\n    value: function processBlock() {\n      var _this$options = this.options,\n          blockRenderers = _this$options.blockRenderers,\n          defaultBlockTag = _this$options.defaultBlockTag;\n      var block = this.blocks[this.currentBlock];\n      var blockType = block.getType();\n      var newWrapperTag = getWrapperTag(blockType);\n\n      if (this.wrapperTag !== newWrapperTag) {\n        if (this.wrapperTag) {\n          this.closeWrapperTag();\n        }\n\n        if (newWrapperTag) {\n          this.openWrapperTag(newWrapperTag);\n        }\n      }\n\n      this.indent(); // Allow blocks to be rendered using a custom renderer.\n\n      var customRenderer = blockRenderers != null && blockRenderers.hasOwnProperty(blockType) ? blockRenderers[blockType] : null;\n      var customRendererOutput = customRenderer ? customRenderer(block) : null; // Renderer can return null, which will cause processing to continue as normal.\n\n      if (customRendererOutput != null) {\n        this.output.push(customRendererOutput);\n        this.output.push('\\n');\n        this.currentBlock += 1;\n        return;\n      }\n\n      this.writeStartTag(block, defaultBlockTag);\n      this.output.push(this.renderBlockContent(block)); // Look ahead and see if we will nest list.\n\n      var nextBlock = this.getNextBlock();\n\n      if (canHaveDepth(blockType) && nextBlock && nextBlock.getDepth() === block.getDepth() + 1) {\n        this.output.push('\\n'); // This is a litle hacky: temporarily stash our current wrapperTag and\n        // render child list(s).\n\n        var thisWrapperTag = this.wrapperTag;\n        this.wrapperTag = null;\n        this.indentLevel += 1;\n        this.currentBlock += 1;\n        this.processBlocksAtDepth(nextBlock.getDepth());\n        this.wrapperTag = thisWrapperTag;\n        this.indentLevel -= 1;\n        this.indent();\n      } else {\n        this.currentBlock += 1;\n      }\n\n      this.writeEndTag(block, defaultBlockTag);\n    }\n  }, {\n    key: \"processBlocksAtDepth\",\n    value: function processBlocksAtDepth(depth) {\n      var block = this.blocks[this.currentBlock];\n\n      while (block && block.getDepth() === depth) {\n        this.processBlock();\n        block = this.blocks[this.currentBlock];\n      }\n\n      this.closeWrapperTag();\n    }\n  }, {\n    key: \"getNextBlock\",\n    value: function getNextBlock() {\n      return this.blocks[this.currentBlock + 1];\n    }\n  }, {\n    key: \"writeStartTag\",\n    value: function writeStartTag(block, defaultBlockTag) {\n      var tags = getTags(block.getType(), defaultBlockTag);\n      var attrString;\n\n      if (this.options.blockStyleFn) {\n        var _ref = this.options.blockStyleFn(block) || {},\n            attributes = _ref.attributes,\n            _style = _ref.style; // Normalize `className` -> `class`, etc.\n\n\n        attributes = normalizeAttributes(attributes);\n\n        if (_style != null) {\n          var styleAttr = styleToCSS(_style);\n          attributes = attributes == null ? {\n            style: styleAttr\n          } : _objectSpread({}, attributes, {\n            style: styleAttr\n          });\n        }\n\n        attrString = stringifyAttrs(attributes);\n      } else {\n        attrString = '';\n      }\n\n      var _iteratorNormalCompletion = true;\n      var _didIteratorError = false;\n      var _iteratorError = undefined;\n\n      try {\n        for (var _iterator = tags[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n          var tag = _step.value;\n          this.output.push(\"<\".concat(tag).concat(attrString, \">\"));\n        }\n      } catch (err) {\n        _didIteratorError = true;\n        _iteratorError = err;\n      } finally {\n        try {\n          if (!_iteratorNormalCompletion && _iterator[\"return\"] != null) {\n            _iterator[\"return\"]();\n          }\n        } finally {\n          if (_didIteratorError) {\n            throw _iteratorError;\n          }\n        }\n      }\n    }\n  }, {\n    key: \"writeEndTag\",\n    value: function writeEndTag(block, defaultBlockTag) {\n      var tags = getTags(block.getType(), defaultBlockTag);\n\n      if (tags.length === 1) {\n        this.output.push(\"</\".concat(tags[0], \">\\n\"));\n      } else {\n        var output = [];\n        var _iteratorNormalCompletion2 = true;\n        var _didIteratorError2 = false;\n        var _iteratorError2 = undefined;\n\n        try {\n          for (var _iterator2 = tags[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\n            var tag = _step2.value;\n            output.unshift(\"</\".concat(tag, \">\"));\n          }\n        } catch (err) {\n          _didIteratorError2 = true;\n          _iteratorError2 = err;\n        } finally {\n          try {\n            if (!_iteratorNormalCompletion2 && _iterator2[\"return\"] != null) {\n              _iterator2[\"return\"]();\n            }\n          } finally {\n            if (_didIteratorError2) {\n              throw _iteratorError2;\n            }\n          }\n        }\n\n        this.output.push(output.join('') + '\\n');\n      }\n    }\n  }, {\n    key: \"openWrapperTag\",\n    value: function openWrapperTag(wrapperTag) {\n      this.wrapperTag = wrapperTag;\n      this.indent();\n      this.output.push(\"<\".concat(wrapperTag, \">\\n\"));\n      this.indentLevel += 1;\n    }\n  }, {\n    key: \"closeWrapperTag\",\n    value: function closeWrapperTag() {\n      var wrapperTag = this.wrapperTag;\n\n      if (wrapperTag) {\n        this.indentLevel -= 1;\n        this.indent();\n        this.output.push(\"</\".concat(wrapperTag, \">\\n\"));\n        this.wrapperTag = null;\n      }\n    }\n  }, {\n    key: \"indent\",\n    value: function indent() {\n      this.output.push(INDENT.repeat(this.indentLevel));\n    }\n  }, {\n    key: \"withCustomInlineStyles\",\n    value: function withCustomInlineStyles(content, styleSet) {\n      if (!this.inlineStyleFn) {\n        return content;\n      }\n\n      var renderConfig = this.inlineStyleFn(styleSet);\n\n      if (!renderConfig) {\n        return content;\n      }\n\n      var _renderConfig$element = renderConfig.element,\n          element = _renderConfig$element === void 0 ? 'span' : _renderConfig$element,\n          attributes = renderConfig.attributes,\n          style = renderConfig.style;\n      var attrString = stringifyAttrs(_objectSpread({}, attributes, {\n        style: style && styleToCSS(style)\n      }));\n      return \"<\".concat(element).concat(attrString, \">\").concat(content, \"</\").concat(element, \">\");\n    }\n  }, {\n    key: \"renderBlockContent\",\n    value: function renderBlockContent(block) {\n      var _this = this;\n\n      var blockType = block.getType();\n      var text = block.getText();\n\n      if (text === '') {\n        // Prevent element collapse if completely empty.\n        return BREAK;\n      }\n\n      text = this.preserveWhitespace(text);\n      var charMetaList = block.getCharacterList();\n      var entityPieces = getEntityRanges(text, charMetaList);\n      return entityPieces.map(function (_ref2) {\n        var _ref3 = _slicedToArray(_ref2, 2),\n            entityKey = _ref3[0],\n            stylePieces = _ref3[1];\n\n        var content = stylePieces.map(function (_ref4) {\n          var _ref5 = _slicedToArray(_ref4, 2),\n              text = _ref5[0],\n              styleSet = _ref5[1];\n\n          var content = encodeContent(text);\n          var _iteratorNormalCompletion3 = true;\n          var _didIteratorError3 = false;\n          var _iteratorError3 = undefined;\n\n          try {\n            for (var _iterator3 = _this.styleOrder[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\n              var _styleName = _step3.value;\n\n              // If our block type is CODE then don't wrap inline code elements.\n              if (_styleName === CODE && blockType === BLOCK_TYPE.CODE) {\n                continue;\n              }\n\n              if (styleSet.has(_styleName)) {\n                var _this$inlineStyles$_s = _this.inlineStyles[_styleName],\n                    element = _this$inlineStyles$_s.element,\n                    attributes = _this$inlineStyles$_s.attributes,\n                    _style2 = _this$inlineStyles$_s.style;\n\n                if (element == null) {\n                  element = 'span';\n                } // Normalize `className` -> `class`, etc.\n\n\n                attributes = normalizeAttributes(attributes);\n\n                if (_style2 != null) {\n                  var styleAttr = styleToCSS(_style2);\n                  attributes = attributes == null ? {\n                    style: styleAttr\n                  } : _objectSpread({}, attributes, {\n                    style: styleAttr\n                  });\n                }\n\n                var attrString = stringifyAttrs(attributes);\n                content = \"<\".concat(element).concat(attrString, \">\").concat(content, \"</\").concat(element, \">\");\n              }\n            }\n          } catch (err) {\n            _didIteratorError3 = true;\n            _iteratorError3 = err;\n          } finally {\n            try {\n              if (!_iteratorNormalCompletion3 && _iterator3[\"return\"] != null) {\n                _iterator3[\"return\"]();\n              }\n            } finally {\n              if (_didIteratorError3) {\n                throw _iteratorError3;\n              }\n            }\n          }\n\n          return _this.withCustomInlineStyles(content, styleSet);\n        }).join('');\n        var entity = entityKey ? _this.contentState.getEntity(entityKey) : null; // Note: The `toUpperCase` below is for compatability with some libraries that use lower-case for image blocks.\n\n        var entityType = entity == null ? null : entity.getType().toUpperCase();\n        var entityStyle;\n\n        if (entity != null && _this.options.entityStyleFn && (entityStyle = _this.options.entityStyleFn(entity))) {\n          var _entityStyle = entityStyle,\n              element = _entityStyle.element,\n              attributes = _entityStyle.attributes,\n              _style3 = _entityStyle.style;\n\n          if (element == null) {\n            element = 'span';\n          } // Normalize `className` -> `class`, etc.\n\n\n          attributes = normalizeAttributes(attributes);\n\n          if (_style3 != null) {\n            var styleAttr = styleToCSS(_style3);\n            attributes = attributes == null ? {\n              style: styleAttr\n            } : _objectSpread({}, attributes, {\n              style: styleAttr\n            });\n          }\n\n          var attrString = stringifyAttrs(attributes);\n          return \"<\".concat(element).concat(attrString, \">\").concat(content, \"</\").concat(element, \">\");\n        } else if (entityType != null && entityType === ENTITY_TYPE.LINK) {\n          var attrs = DATA_TO_ATTR.hasOwnProperty(entityType) ? DATA_TO_ATTR[entityType](entityType, entity) : null;\n\n          var _attrString = stringifyAttrs(attrs);\n\n          return \"<a\".concat(_attrString, \">\").concat(content, \"</a>\");\n        } else if (entityType != null && entityType === ENTITY_TYPE.IMAGE) {\n          var _attrs = DATA_TO_ATTR.hasOwnProperty(entityType) ? DATA_TO_ATTR[entityType](entityType, entity) : null;\n\n          var _attrString2 = stringifyAttrs(_attrs);\n\n          return \"<img\".concat(_attrString2, \"/>\");\n        } else {\n          return content;\n        }\n      }).join('');\n    }\n  }, {\n    key: \"preserveWhitespace\",\n    value: function preserveWhitespace(text) {\n      var length = text.length; // Prevent leading/trailing/consecutive whitespace collapse.\n\n      var newText = new Array(length);\n\n      for (var i = 0; i < length; i++) {\n        if (text[i] === ' ' && (i === 0 || i === length - 1 || text[i - 1] === ' ')) {\n          newText[i] = '\\xA0';\n        } else {\n          newText[i] = text[i];\n        }\n      }\n\n      return newText.join('');\n    }\n  }]);\n\n  return MarkupGenerator;\n}();\n\nfunction stringifyAttrs(attrs) {\n  if (attrs == null) {\n    return '';\n  }\n\n  var parts = [];\n\n  for (var _i3 = 0, _Object$keys3 = Object.keys(attrs); _i3 < _Object$keys3.length; _i3++) {\n    var name = _Object$keys3[_i3];\n    var value = attrs[name];\n\n    if (value != null) {\n      parts.push(\" \".concat(name, \"=\\\"\").concat(encodeAttr(value + ''), \"\\\"\"));\n    }\n  }\n\n  return parts.join('');\n}\n\nfunction canHaveDepth(blockType) {\n  switch (blockType) {\n    case BLOCK_TYPE.UNORDERED_LIST_ITEM:\n    case BLOCK_TYPE.ORDERED_LIST_ITEM:\n      return true;\n\n    default:\n      return false;\n  }\n}\n\nfunction encodeContent(text) {\n  return text.split('&').join('&amp;').split('<').join('&lt;').split('>').join('&gt;').split('\\xA0').join('&nbsp;').split('\\n').join(BREAK + '\\n');\n}\n\nfunction encodeAttr(text) {\n  return text.split('&').join('&amp;').split('<').join('&lt;').split('>').join('&gt;').split('\"').join('&quot;');\n}\n\nexport default function stateToHTML(content, options) {\n  return new MarkupGenerator(content, options).generate();\n}","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, 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\nvar BlockMapBuilder = require(\"./BlockMapBuilder\");\n\nvar CharacterMetadata = require(\"./CharacterMetadata\");\n\nvar ContentBlock = require(\"./ContentBlock\");\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar generateRandomKey = require(\"./generateRandomKey\");\n\nvar gkx = require(\"./gkx\");\n\nvar Immutable = require(\"immutable\");\n\nvar moveBlockInContentState = require(\"./moveBlockInContentState\");\n\nvar experimentalTreeDataSupport = gkx('draft_tree_data_support');\nvar ContentBlockRecord = experimentalTreeDataSupport ? ContentBlockNode : ContentBlock;\nvar List = Immutable.List,\n    Repeat = Immutable.Repeat;\nvar AtomicBlockUtils = {\n  insertAtomicBlock: function insertAtomicBlock(editorState, entityKey, character) {\n    var contentState = editorState.getCurrentContent();\n    var selectionState = editorState.getSelection();\n    var afterRemoval = DraftModifier.removeRange(contentState, selectionState, 'backward');\n    var targetSelection = afterRemoval.getSelectionAfter();\n    var afterSplit = DraftModifier.splitBlock(afterRemoval, targetSelection);\n    var insertionTarget = afterSplit.getSelectionAfter();\n    var asAtomicBlock = DraftModifier.setBlockType(afterSplit, insertionTarget, 'atomic');\n    var charData = CharacterMetadata.create({\n      entity: entityKey\n    });\n    var atomicBlockConfig = {\n      key: generateRandomKey(),\n      type: 'atomic',\n      text: character,\n      characterList: List(Repeat(charData, character.length))\n    };\n    var atomicDividerBlockConfig = {\n      key: generateRandomKey(),\n      type: 'unstyled'\n    };\n\n    if (experimentalTreeDataSupport) {\n      atomicBlockConfig = _objectSpread({}, atomicBlockConfig, {\n        nextSibling: atomicDividerBlockConfig.key\n      });\n      atomicDividerBlockConfig = _objectSpread({}, atomicDividerBlockConfig, {\n        prevSibling: atomicBlockConfig.key\n      });\n    }\n\n    var fragmentArray = [new ContentBlockRecord(atomicBlockConfig), new ContentBlockRecord(atomicDividerBlockConfig)];\n    var fragment = BlockMapBuilder.createFromArray(fragmentArray);\n    var withAtomicBlock = DraftModifier.replaceWithFragment(asAtomicBlock, insertionTarget, fragment);\n    var newContent = withAtomicBlock.merge({\n      selectionBefore: selectionState,\n      selectionAfter: withAtomicBlock.getSelectionAfter().set('hasFocus', true)\n    });\n    return EditorState.push(editorState, newContent, 'insert-fragment');\n  },\n  moveAtomicBlock: function moveAtomicBlock(editorState, atomicBlock, targetRange, insertionMode) {\n    var contentState = editorState.getCurrentContent();\n    var selectionState = editorState.getSelection();\n    var withMovedAtomicBlock;\n\n    if (insertionMode === 'before' || insertionMode === 'after') {\n      var targetBlock = contentState.getBlockForKey(insertionMode === 'before' ? targetRange.getStartKey() : targetRange.getEndKey());\n      withMovedAtomicBlock = moveBlockInContentState(contentState, atomicBlock, targetBlock, insertionMode);\n    } else {\n      var afterRemoval = DraftModifier.removeRange(contentState, targetRange, 'backward');\n      var selectionAfterRemoval = afterRemoval.getSelectionAfter();\n\n      var _targetBlock = afterRemoval.getBlockForKey(selectionAfterRemoval.getFocusKey());\n\n      if (selectionAfterRemoval.getStartOffset() === 0) {\n        withMovedAtomicBlock = moveBlockInContentState(afterRemoval, atomicBlock, _targetBlock, 'before');\n      } else if (selectionAfterRemoval.getEndOffset() === _targetBlock.getLength()) {\n        withMovedAtomicBlock = moveBlockInContentState(afterRemoval, atomicBlock, _targetBlock, 'after');\n      } else {\n        var afterSplit = DraftModifier.splitBlock(afterRemoval, selectionAfterRemoval);\n        var selectionAfterSplit = afterSplit.getSelectionAfter();\n\n        var _targetBlock2 = afterSplit.getBlockForKey(selectionAfterSplit.getFocusKey());\n\n        withMovedAtomicBlock = moveBlockInContentState(afterSplit, atomicBlock, _targetBlock2, 'before');\n      }\n    }\n\n    var newContent = withMovedAtomicBlock.merge({\n      selectionBefore: selectionState,\n      selectionAfter: withMovedAtomicBlock.getSelectionAfter().set('hasFocus', true)\n    });\n    return EditorState.push(editorState, newContent, 'move-block');\n  }\n};\nmodule.exports = AtomicBlockUtils;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar Immutable = require(\"immutable\");\n\nvar OrderedMap = Immutable.OrderedMap;\nvar BlockMapBuilder = {\n  createFromArray: function createFromArray(blocks) {\n    return OrderedMap(blocks.map(function (block) {\n      return [block.getKey(), block];\n    }));\n  }\n};\nmodule.exports = BlockMapBuilder;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, 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 _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n\nvar findRangesImmutable = require(\"./findRangesImmutable\");\n\nvar getOwnObjectValues = require(\"./getOwnObjectValues\");\n\nvar Immutable = require(\"immutable\");\n\nvar List = Immutable.List,\n    Repeat = Immutable.Repeat,\n    Record = Immutable.Record;\n\nvar returnTrue = function returnTrue() {\n  return true;\n};\n\nvar defaultLeafRange = {\n  start: null,\n  end: null\n};\nvar LeafRange = Record(defaultLeafRange);\nvar defaultDecoratorRange = {\n  start: null,\n  end: null,\n  decoratorKey: null,\n  leaves: null\n};\nvar DecoratorRange = Record(defaultDecoratorRange);\nvar BlockTree = {\n  /**\n   * Generate a block tree for a given ContentBlock/decorator pair.\n   */\n  generate: function generate(contentState, block, decorator) {\n    var textLength = block.getLength();\n\n    if (!textLength) {\n      return List.of(new DecoratorRange({\n        start: 0,\n        end: 0,\n        decoratorKey: null,\n        leaves: List.of(new LeafRange({\n          start: 0,\n          end: 0\n        }))\n      }));\n    }\n\n    var leafSets = [];\n    var decorations = decorator ? decorator.getDecorations(block, contentState) : List(Repeat(null, textLength));\n    var chars = block.getCharacterList();\n    findRangesImmutable(decorations, areEqual, returnTrue, function (start, end) {\n      leafSets.push(new DecoratorRange({\n        start: start,\n        end: end,\n        decoratorKey: decorations.get(start),\n        leaves: generateLeaves(chars.slice(start, end).toList(), start)\n      }));\n    });\n    return List(leafSets);\n  },\n  fromJS: function fromJS(_ref) {\n    var leaves = _ref.leaves,\n        other = _objectWithoutPropertiesLoose(_ref, [\"leaves\"]);\n\n    return new DecoratorRange(_objectSpread({}, other, {\n      leaves: leaves != null ? List(Array.isArray(leaves) ? leaves : getOwnObjectValues(leaves)).map(function (leaf) {\n        return LeafRange(leaf);\n      }) : null\n    }));\n  }\n};\n/**\n * Generate LeafRange records for a given character list.\n */\n\nfunction generateLeaves(characters, offset) {\n  var leaves = [];\n  var inlineStyles = characters.map(function (c) {\n    return c.getStyle();\n  }).toList();\n  findRangesImmutable(inlineStyles, areEqual, returnTrue, function (start, end) {\n    leaves.push(new LeafRange({\n      start: start + offset,\n      end: end + offset\n    }));\n  });\n  return List(leaves);\n}\n\nfunction areEqual(a, b) {\n  return a === b;\n}\n\nmodule.exports = BlockTree;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar _require = require(\"immutable\"),\n    Map = _require.Map,\n    OrderedSet = _require.OrderedSet,\n    Record = _require.Record; // Immutable.map is typed such that the value for every key in the map\n// must be the same type\n\n\nvar EMPTY_SET = OrderedSet();\nvar defaultRecord = {\n  style: EMPTY_SET,\n  entity: null\n};\nvar CharacterMetadataRecord = Record(defaultRecord);\n\nvar CharacterMetadata = /*#__PURE__*/function (_CharacterMetadataRec) {\n  _inheritsLoose(CharacterMetadata, _CharacterMetadataRec);\n\n  function CharacterMetadata() {\n    return _CharacterMetadataRec.apply(this, arguments) || this;\n  }\n\n  var _proto = CharacterMetadata.prototype;\n\n  _proto.getStyle = function getStyle() {\n    return this.get('style');\n  };\n\n  _proto.getEntity = function getEntity() {\n    return this.get('entity');\n  };\n\n  _proto.hasStyle = function hasStyle(style) {\n    return this.getStyle().includes(style);\n  };\n\n  CharacterMetadata.applyStyle = function applyStyle(record, style) {\n    var withStyle = record.set('style', record.getStyle().add(style));\n    return CharacterMetadata.create(withStyle);\n  };\n\n  CharacterMetadata.removeStyle = function removeStyle(record, style) {\n    var withoutStyle = record.set('style', record.getStyle().remove(style));\n    return CharacterMetadata.create(withoutStyle);\n  };\n\n  CharacterMetadata.applyEntity = function applyEntity(record, entityKey) {\n    var withEntity = record.getEntity() === entityKey ? record : record.set('entity', entityKey);\n    return CharacterMetadata.create(withEntity);\n  }\n  /**\n   * Use this function instead of the `CharacterMetadata` constructor.\n   * Since most content generally uses only a very small number of\n   * style/entity permutations, we can reuse these objects as often as\n   * possible.\n   */\n  ;\n\n  CharacterMetadata.create = function create(config) {\n    if (!config) {\n      return EMPTY;\n    }\n\n    var defaultConfig = {\n      style: EMPTY_SET,\n      entity: null\n    }; // Fill in unspecified properties, if necessary.\n\n    var configMap = Map(defaultConfig).merge(config);\n    var existing = pool.get(configMap);\n\n    if (existing) {\n      return existing;\n    }\n\n    var newCharacter = new CharacterMetadata(configMap);\n    pool = pool.set(configMap, newCharacter);\n    return newCharacter;\n  };\n\n  CharacterMetadata.fromJS = function fromJS(_ref) {\n    var style = _ref.style,\n        entity = _ref.entity;\n    return new CharacterMetadata({\n      style: Array.isArray(style) ? OrderedSet(style) : style,\n      entity: Array.isArray(entity) ? OrderedSet(entity) : entity\n    });\n  };\n\n  return CharacterMetadata;\n}(CharacterMetadataRecord);\n\nvar EMPTY = new CharacterMetadata();\nvar pool = Map([[Map(defaultRecord), EMPTY]]);\nCharacterMetadata.EMPTY = EMPTY;\nmodule.exports = CharacterMetadata;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\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\nvar Immutable = require(\"immutable\");\n\nvar List = Immutable.List;\nvar DELIMITER = '.';\n/**\n * A CompositeDraftDecorator traverses through a list of DraftDecorator\n * instances to identify sections of a ContentBlock that should be rendered\n * in a \"decorated\" manner. For example, hashtags, mentions, and links may\n * be intended to stand out visually, be rendered as anchors, etc.\n *\n * The list of decorators supplied to the constructor will be used in the\n * order they are provided. This allows the caller to specify a priority for\n * string matching, in case of match collisions among decorators.\n *\n * For instance, I may have a link with a `#` in its text. Though this section\n * of text may match our hashtag decorator, it should not be treated as a\n * hashtag. I should therefore list my link DraftDecorator\n * before my hashtag DraftDecorator when constructing this composite\n * decorator instance.\n *\n * Thus, when a collision like this is encountered, the earlier match is\n * preserved and the new match is discarded.\n */\n\nvar CompositeDraftDecorator = /*#__PURE__*/function () {\n  function CompositeDraftDecorator(decorators) {\n    _defineProperty(this, \"_decorators\", void 0);\n\n    // Copy the decorator array, since we use this array order to determine\n    // precedence of decoration matching. If the array is mutated externally,\n    // we don't want to be affected here.\n    this._decorators = decorators.slice();\n  }\n\n  var _proto = CompositeDraftDecorator.prototype;\n\n  _proto.getDecorations = function getDecorations(block, contentState) {\n    var decorations = Array(block.getText().length).fill(null);\n\n    this._decorators.forEach(function (\n    /*object*/\n    decorator,\n    /*number*/\n    ii) {\n      var counter = 0;\n      var strategy = decorator.strategy;\n\n      var callback = function callback(\n      /*number*/\n      start,\n      /*number*/\n      end) {\n        // Find out if any of our matching range is already occupied\n        // by another decorator. If so, discard the match. Otherwise, store\n        // the component key for rendering.\n        if (canOccupySlice(decorations, start, end)) {\n          occupySlice(decorations, start, end, ii + DELIMITER + counter);\n          counter++;\n        }\n      };\n\n      strategy(block, callback, contentState);\n    });\n\n    return List(decorations);\n  };\n\n  _proto.getComponentForKey = function getComponentForKey(key) {\n    var componentKey = parseInt(key.split(DELIMITER)[0], 10);\n    return this._decorators[componentKey].component;\n  };\n\n  _proto.getPropsForKey = function getPropsForKey(key) {\n    var componentKey = parseInt(key.split(DELIMITER)[0], 10);\n    return this._decorators[componentKey].props;\n  };\n\n  return CompositeDraftDecorator;\n}();\n/**\n * Determine whether we can occupy the specified slice of the decorations\n * array.\n */\n\n\nfunction canOccupySlice(decorations, start, end) {\n  for (var ii = start; ii < end; ii++) {\n    if (decorations[ii] != null) {\n      return false;\n    }\n  }\n\n  return true;\n}\n/**\n * Splice the specified component into our decoration array at the desired\n * range.\n */\n\n\nfunction occupySlice(targetArr, start, end, componentKey) {\n  for (var ii = start; ii < end; ii++) {\n    targetArr[ii] = componentKey;\n  }\n}\n\nmodule.exports = CompositeDraftDecorator;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar CharacterMetadata = require(\"./CharacterMetadata\");\n\nvar findRangesImmutable = require(\"./findRangesImmutable\");\n\nvar Immutable = require(\"immutable\");\n\nvar List = Immutable.List,\n    Map = Immutable.Map,\n    OrderedSet = Immutable.OrderedSet,\n    Record = Immutable.Record,\n    Repeat = Immutable.Repeat;\nvar EMPTY_SET = OrderedSet();\nvar defaultRecord = {\n  key: '',\n  type: 'unstyled',\n  text: '',\n  characterList: List(),\n  depth: 0,\n  data: Map()\n};\nvar ContentBlockRecord = Record(defaultRecord);\n\nvar decorateCharacterList = function decorateCharacterList(config) {\n  if (!config) {\n    return config;\n  }\n\n  var characterList = config.characterList,\n      text = config.text;\n\n  if (text && !characterList) {\n    config.characterList = List(Repeat(CharacterMetadata.EMPTY, text.length));\n  }\n\n  return config;\n};\n\nvar ContentBlock = /*#__PURE__*/function (_ContentBlockRecord) {\n  _inheritsLoose(ContentBlock, _ContentBlockRecord);\n\n  function ContentBlock(config) {\n    return _ContentBlockRecord.call(this, decorateCharacterList(config)) || this;\n  }\n\n  var _proto = ContentBlock.prototype;\n\n  _proto.getKey = function getKey() {\n    return this.get('key');\n  };\n\n  _proto.getType = function getType() {\n    return this.get('type');\n  };\n\n  _proto.getText = function getText() {\n    return this.get('text');\n  };\n\n  _proto.getCharacterList = function getCharacterList() {\n    return this.get('characterList');\n  };\n\n  _proto.getLength = function getLength() {\n    return this.getText().length;\n  };\n\n  _proto.getDepth = function getDepth() {\n    return this.get('depth');\n  };\n\n  _proto.getData = function getData() {\n    return this.get('data');\n  };\n\n  _proto.getInlineStyleAt = function getInlineStyleAt(offset) {\n    var character = this.getCharacterList().get(offset);\n    return character ? character.getStyle() : EMPTY_SET;\n  };\n\n  _proto.getEntityAt = function getEntityAt(offset) {\n    var character = this.getCharacterList().get(offset);\n    return character ? character.getEntity() : null;\n  }\n  /**\n   * Execute a callback for every contiguous range of styles within the block.\n   */\n  ;\n\n  _proto.findStyleRanges = function findStyleRanges(filterFn, callback) {\n    findRangesImmutable(this.getCharacterList(), haveEqualStyle, filterFn, callback);\n  }\n  /**\n   * Execute a callback for every contiguous range of entities within the block.\n   */\n  ;\n\n  _proto.findEntityRanges = function findEntityRanges(filterFn, callback) {\n    findRangesImmutable(this.getCharacterList(), haveEqualEntity, filterFn, callback);\n  };\n\n  return ContentBlock;\n}(ContentBlockRecord);\n\nfunction haveEqualStyle(charA, charB) {\n  return charA.getStyle() === charB.getStyle();\n}\n\nfunction haveEqualEntity(charA, charB) {\n  return charA.getEntity() === charB.getEntity();\n}\n\nmodule.exports = ContentBlock;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n *\n * This file is a fork of ContentBlock adding support for nesting references by\n * providing links to children, parent, prevSibling, and nextSibling.\n *\n * This is unstable and not part of the public API and should not be used by\n * production systems. This file may be update/removed without notice.\n */\n'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar CharacterMetadata = require(\"./CharacterMetadata\");\n\nvar findRangesImmutable = require(\"./findRangesImmutable\");\n\nvar Immutable = require(\"immutable\");\n\nvar List = Immutable.List,\n    Map = Immutable.Map,\n    OrderedSet = Immutable.OrderedSet,\n    Record = Immutable.Record,\n    Repeat = Immutable.Repeat;\nvar EMPTY_SET = OrderedSet();\nvar defaultRecord = {\n  parent: null,\n  characterList: List(),\n  data: Map(),\n  depth: 0,\n  key: '',\n  text: '',\n  type: 'unstyled',\n  children: List(),\n  prevSibling: null,\n  nextSibling: null\n};\n\nvar haveEqualStyle = function haveEqualStyle(charA, charB) {\n  return charA.getStyle() === charB.getStyle();\n};\n\nvar haveEqualEntity = function haveEqualEntity(charA, charB) {\n  return charA.getEntity() === charB.getEntity();\n};\n\nvar decorateCharacterList = function decorateCharacterList(config) {\n  if (!config) {\n    return config;\n  }\n\n  var characterList = config.characterList,\n      text = config.text;\n\n  if (text && !characterList) {\n    config.characterList = List(Repeat(CharacterMetadata.EMPTY, text.length));\n  }\n\n  return config;\n};\n\nvar ContentBlockNode = /*#__PURE__*/function (_ref) {\n  _inheritsLoose(ContentBlockNode, _ref);\n\n  function ContentBlockNode() {\n    var props = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : defaultRecord;\n\n    /* eslint-disable-next-line constructor-super */\n    return _ref.call(this, decorateCharacterList(props)) || this;\n  }\n\n  var _proto = ContentBlockNode.prototype;\n\n  _proto.getKey = function getKey() {\n    return this.get('key');\n  };\n\n  _proto.getType = function getType() {\n    return this.get('type');\n  };\n\n  _proto.getText = function getText() {\n    return this.get('text');\n  };\n\n  _proto.getCharacterList = function getCharacterList() {\n    return this.get('characterList');\n  };\n\n  _proto.getLength = function getLength() {\n    return this.getText().length;\n  };\n\n  _proto.getDepth = function getDepth() {\n    return this.get('depth');\n  };\n\n  _proto.getData = function getData() {\n    return this.get('data');\n  };\n\n  _proto.getInlineStyleAt = function getInlineStyleAt(offset) {\n    var character = this.getCharacterList().get(offset);\n    return character ? character.getStyle() : EMPTY_SET;\n  };\n\n  _proto.getEntityAt = function getEntityAt(offset) {\n    var character = this.getCharacterList().get(offset);\n    return character ? character.getEntity() : null;\n  };\n\n  _proto.getChildKeys = function getChildKeys() {\n    return this.get('children');\n  };\n\n  _proto.getParentKey = function getParentKey() {\n    return this.get('parent');\n  };\n\n  _proto.getPrevSiblingKey = function getPrevSiblingKey() {\n    return this.get('prevSibling');\n  };\n\n  _proto.getNextSiblingKey = function getNextSiblingKey() {\n    return this.get('nextSibling');\n  };\n\n  _proto.findStyleRanges = function findStyleRanges(filterFn, callback) {\n    findRangesImmutable(this.getCharacterList(), haveEqualStyle, filterFn, callback);\n  };\n\n  _proto.findEntityRanges = function findEntityRanges(filterFn, callback) {\n    findRangesImmutable(this.getCharacterList(), haveEqualEntity, filterFn, callback);\n  };\n\n  return ContentBlockNode;\n}(Record(defaultRecord));\n\nmodule.exports = ContentBlockNode;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, 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 _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar BlockMapBuilder = require(\"./BlockMapBuilder\");\n\nvar CharacterMetadata = require(\"./CharacterMetadata\");\n\nvar ContentBlock = require(\"./ContentBlock\");\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar DraftEntity = require(\"./DraftEntity\");\n\nvar SelectionState = require(\"./SelectionState\");\n\nvar generateRandomKey = require(\"./generateRandomKey\");\n\nvar getOwnObjectValues = require(\"./getOwnObjectValues\");\n\nvar gkx = require(\"./gkx\");\n\nvar Immutable = require(\"immutable\");\n\nvar sanitizeDraftText = require(\"./sanitizeDraftText\");\n\nvar List = Immutable.List,\n    Record = Immutable.Record,\n    Repeat = Immutable.Repeat,\n    ImmutableMap = Immutable.Map,\n    OrderedMap = Immutable.OrderedMap;\nvar defaultRecord = {\n  entityMap: null,\n  blockMap: null,\n  selectionBefore: null,\n  selectionAfter: null\n};\nvar ContentStateRecord = Record(defaultRecord);\n/* $FlowFixMe[signature-verification-failure] Supressing a `signature-\n * verification-failure` error here. TODO: T65949050 Clean up the branch for\n * this GK */\n\nvar ContentBlockNodeRecord = gkx('draft_tree_data_support') ? ContentBlockNode : ContentBlock;\n\nvar ContentState = /*#__PURE__*/function (_ContentStateRecord) {\n  _inheritsLoose(ContentState, _ContentStateRecord);\n\n  function ContentState() {\n    return _ContentStateRecord.apply(this, arguments) || this;\n  }\n\n  var _proto = ContentState.prototype;\n\n  _proto.getEntityMap = function getEntityMap() {\n    // TODO: update this when we fully remove DraftEntity\n    return DraftEntity;\n  };\n\n  _proto.getBlockMap = function getBlockMap() {\n    return this.get('blockMap');\n  };\n\n  _proto.getSelectionBefore = function getSelectionBefore() {\n    return this.get('selectionBefore');\n  };\n\n  _proto.getSelectionAfter = function getSelectionAfter() {\n    return this.get('selectionAfter');\n  };\n\n  _proto.getBlockForKey = function getBlockForKey(key) {\n    var block = this.getBlockMap().get(key);\n    return block;\n  };\n\n  _proto.getKeyBefore = function getKeyBefore(key) {\n    return this.getBlockMap().reverse().keySeq().skipUntil(function (v) {\n      return v === key;\n    }).skip(1).first();\n  };\n\n  _proto.getKeyAfter = function getKeyAfter(key) {\n    return this.getBlockMap().keySeq().skipUntil(function (v) {\n      return v === key;\n    }).skip(1).first();\n  };\n\n  _proto.getBlockAfter = function getBlockAfter(key) {\n    return this.getBlockMap().skipUntil(function (_, k) {\n      return k === key;\n    }).skip(1).first();\n  };\n\n  _proto.getBlockBefore = function getBlockBefore(key) {\n    return this.getBlockMap().reverse().skipUntil(function (_, k) {\n      return k === key;\n    }).skip(1).first();\n  };\n\n  _proto.getBlocksAsArray = function getBlocksAsArray() {\n    return this.getBlockMap().toArray();\n  };\n\n  _proto.getFirstBlock = function getFirstBlock() {\n    return this.getBlockMap().first();\n  };\n\n  _proto.getLastBlock = function getLastBlock() {\n    return this.getBlockMap().last();\n  };\n\n  _proto.getPlainText = function getPlainText(delimiter) {\n    return this.getBlockMap().map(function (block) {\n      return block ? block.getText() : '';\n    }).join(delimiter || '\\n');\n  };\n\n  _proto.getLastCreatedEntityKey = function getLastCreatedEntityKey() {\n    // TODO: update this when we fully remove DraftEntity\n    return DraftEntity.__getLastCreatedEntityKey();\n  };\n\n  _proto.hasText = function hasText() {\n    var blockMap = this.getBlockMap();\n    return blockMap.size > 1 || // make sure that there are no zero width space chars\n    escape(blockMap.first().getText()).replace(/%u200B/g, '').length > 0;\n  };\n\n  _proto.createEntity = function createEntity(type, mutability, data) {\n    // TODO: update this when we fully remove DraftEntity\n    DraftEntity.__create(type, mutability, data);\n\n    return this;\n  };\n\n  _proto.mergeEntityData = function mergeEntityData(key, toMerge) {\n    // TODO: update this when we fully remove DraftEntity\n    DraftEntity.__mergeData(key, toMerge);\n\n    return this;\n  };\n\n  _proto.replaceEntityData = function replaceEntityData(key, newData) {\n    // TODO: update this when we fully remove DraftEntity\n    DraftEntity.__replaceData(key, newData);\n\n    return this;\n  };\n\n  _proto.addEntity = function addEntity(instance) {\n    // TODO: update this when we fully remove DraftEntity\n    DraftEntity.__add(instance);\n\n    return this;\n  };\n\n  _proto.getEntity = function getEntity(key) {\n    // TODO: update this when we fully remove DraftEntity\n    return DraftEntity.__get(key);\n  };\n\n  _proto.getAllEntities = function getAllEntities() {\n    return DraftEntity.__getAll();\n  };\n\n  _proto.loadWithEntities = function loadWithEntities(entities) {\n    return DraftEntity.__loadWithEntities(entities);\n  };\n\n  ContentState.createFromBlockArray = function createFromBlockArray( // TODO: update flow type when we completely deprecate the old entity API\n  blocks, entityMap) {\n    // TODO: remove this when we completely deprecate the old entity API\n    var theBlocks = Array.isArray(blocks) ? blocks : blocks.contentBlocks;\n    var blockMap = BlockMapBuilder.createFromArray(theBlocks);\n    var selectionState = blockMap.isEmpty() ? new SelectionState() : SelectionState.createEmpty(blockMap.first().getKey());\n    return new ContentState({\n      blockMap: blockMap,\n      entityMap: entityMap || DraftEntity,\n      selectionBefore: selectionState,\n      selectionAfter: selectionState\n    });\n  };\n\n  ContentState.createFromText = function createFromText(text) {\n    var delimiter = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : /\\r\\n?|\\n/g;\n    var strings = text.split(delimiter);\n    var blocks = strings.map(function (block) {\n      block = sanitizeDraftText(block);\n      return new ContentBlockNodeRecord({\n        key: generateRandomKey(),\n        text: block,\n        type: 'unstyled',\n        characterList: List(Repeat(CharacterMetadata.EMPTY, block.length))\n      });\n    });\n    return ContentState.createFromBlockArray(blocks);\n  };\n\n  ContentState.fromJS = function fromJS(state) {\n    return new ContentState(_objectSpread({}, state, {\n      blockMap: OrderedMap(state.blockMap).map(ContentState.createContentBlockFromJS),\n      selectionBefore: new SelectionState(state.selectionBefore),\n      selectionAfter: new SelectionState(state.selectionAfter)\n    }));\n  };\n\n  ContentState.createContentBlockFromJS = function createContentBlockFromJS(block) {\n    var characterList = block.characterList;\n    return new ContentBlockNodeRecord(_objectSpread({}, block, {\n      data: ImmutableMap(block.data),\n      characterList: characterList != null ? List((Array.isArray(characterList) ? characterList : getOwnObjectValues(characterList)).map(function (c) {\n        return CharacterMetadata.fromJS(c);\n      })) : undefined\n    }));\n  };\n\n  return ContentState;\n}(ContentStateRecord);\n\nmodule.exports = ContentState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar CharacterMetadata = require(\"./CharacterMetadata\");\n\nvar _require = require(\"immutable\"),\n    Map = _require.Map;\n\nvar ContentStateInlineStyle = {\n  add: function add(contentState, selectionState, inlineStyle) {\n    return modifyInlineStyle(contentState, selectionState, inlineStyle, true);\n  },\n  remove: function remove(contentState, selectionState, inlineStyle) {\n    return modifyInlineStyle(contentState, selectionState, inlineStyle, false);\n  }\n};\n\nfunction modifyInlineStyle(contentState, selectionState, inlineStyle, addOrRemove) {\n  var blockMap = contentState.getBlockMap();\n  var startKey = selectionState.getStartKey();\n  var startOffset = selectionState.getStartOffset();\n  var endKey = selectionState.getEndKey();\n  var endOffset = selectionState.getEndOffset();\n  var newBlocks = blockMap.skipUntil(function (_, k) {\n    return k === startKey;\n  }).takeUntil(function (_, k) {\n    return k === endKey;\n  }).concat(Map([[endKey, blockMap.get(endKey)]])).map(function (block, blockKey) {\n    var sliceStart;\n    var sliceEnd;\n\n    if (startKey === endKey) {\n      sliceStart = startOffset;\n      sliceEnd = endOffset;\n    } else {\n      sliceStart = blockKey === startKey ? startOffset : 0;\n      sliceEnd = blockKey === endKey ? endOffset : block.getLength();\n    }\n\n    var chars = block.getCharacterList();\n    var current;\n\n    while (sliceStart < sliceEnd) {\n      current = chars.get(sliceStart);\n      chars = chars.set(sliceStart, addOrRemove ? CharacterMetadata.applyStyle(current, inlineStyle) : CharacterMetadata.removeStyle(current, inlineStyle));\n      sliceStart++;\n    }\n\n    return block.set('characterList', chars);\n  });\n  return contentState.merge({\n    blockMap: blockMap.merge(newBlocks),\n    selectionBefore: selectionState,\n    selectionAfter: selectionState\n  });\n}\n\nmodule.exports = ContentStateInlineStyle;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\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\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nvar findAncestorOffsetKey = require(\"./findAncestorOffsetKey\");\n\nvar getWindowForNode = require(\"./getWindowForNode\");\n\nvar Immutable = require(\"immutable\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar nullthrows = require(\"fbjs/lib/nullthrows\");\n\nvar Map = Immutable.Map;\n// Heavily based on Prosemirror's DOMObserver https://github.com/ProseMirror/prosemirror-view/blob/master/src/domobserver.js\nvar DOM_OBSERVER_OPTIONS = {\n  subtree: true,\n  characterData: true,\n  childList: true,\n  characterDataOldValue: false,\n  attributes: false\n}; // IE11 has very broken mutation observers, so we also listen to DOMCharacterDataModified\n\nvar USE_CHAR_DATA = UserAgent.isBrowser('IE <= 11');\n\nvar DOMObserver = /*#__PURE__*/function () {\n  function DOMObserver(container) {\n    var _this = this;\n\n    _defineProperty(this, \"observer\", void 0);\n\n    _defineProperty(this, \"container\", void 0);\n\n    _defineProperty(this, \"mutations\", void 0);\n\n    _defineProperty(this, \"onCharData\", void 0);\n\n    this.container = container;\n    this.mutations = Map();\n    var containerWindow = getWindowForNode(container);\n\n    if (containerWindow.MutationObserver && !USE_CHAR_DATA) {\n      this.observer = new containerWindow.MutationObserver(function (mutations) {\n        return _this.registerMutations(mutations);\n      });\n    } else {\n      this.onCharData = function (e) {\n        !(e.target instanceof Node) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Expected target to be an instance of Node') : invariant(false) : void 0;\n\n        _this.registerMutation({\n          type: 'characterData',\n          target: e.target\n        });\n      };\n    }\n  }\n\n  var _proto = DOMObserver.prototype;\n\n  _proto.start = function start() {\n    if (this.observer) {\n      this.observer.observe(this.container, DOM_OBSERVER_OPTIONS);\n    } else {\n      /* $FlowFixMe[incompatible-call] (>=0.68.0 site=www,mobile) This event\n       * type is not defined by Flow's standard library */\n      this.container.addEventListener('DOMCharacterDataModified', this.onCharData);\n    }\n  };\n\n  _proto.stopAndFlushMutations = function stopAndFlushMutations() {\n    var observer = this.observer;\n\n    if (observer) {\n      this.registerMutations(observer.takeRecords());\n      observer.disconnect();\n    } else {\n      /* $FlowFixMe[incompatible-call] (>=0.68.0 site=www,mobile) This event\n       * type is not defined by Flow's standard library */\n      this.container.removeEventListener('DOMCharacterDataModified', this.onCharData);\n    }\n\n    var mutations = this.mutations;\n    this.mutations = Map();\n    return mutations;\n  };\n\n  _proto.registerMutations = function registerMutations(mutations) {\n    for (var i = 0; i < mutations.length; i++) {\n      this.registerMutation(mutations[i]);\n    }\n  };\n\n  _proto.getMutationTextContent = function getMutationTextContent(mutation) {\n    var type = mutation.type,\n        target = mutation.target,\n        removedNodes = mutation.removedNodes;\n\n    if (type === 'characterData') {\n      // When `textContent` is '', there is a race condition that makes\n      // getting the offsetKey from the target not possible.\n      // These events are also followed by a `childList`, which is the one\n      // we are able to retrieve the offsetKey and apply the '' text.\n      if (target.textContent !== '') {\n        // IE 11 considers the enter keypress that concludes the composition\n        // as an input char. This strips that newline character so the draft\n        // state does not receive spurious newlines.\n        if (USE_CHAR_DATA) {\n          return target.textContent.replace('\\n', '');\n        }\n\n        return target.textContent;\n      }\n    } else if (type === 'childList') {\n      if (removedNodes && removedNodes.length) {\n        // `characterData` events won't happen or are ignored when\n        // removing the last character of a leaf node, what happens\n        // instead is a `childList` event with a `removedNodes` array.\n        // For this case the textContent should be '' and\n        // `DraftModifier.replaceText` will make sure the content is\n        // updated properly.\n        return '';\n      } else if (target.textContent !== '') {\n        // Typing Chinese in an empty block in MS Edge results in a\n        // `childList` event with non-empty textContent.\n        // See https://github.com/facebook/draft-js/issues/2082\n        return target.textContent;\n      }\n    }\n\n    return null;\n  };\n\n  _proto.registerMutation = function registerMutation(mutation) {\n    var textContent = this.getMutationTextContent(mutation);\n\n    if (textContent != null) {\n      var offsetKey = nullthrows(findAncestorOffsetKey(mutation.target));\n      this.mutations = this.mutations.set(offsetKey, textContent);\n    }\n  };\n\n  return DOMObserver;\n}();\n\nmodule.exports = DOMObserver;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar React = require(\"react\");\n\nvar cx = require(\"fbjs/lib/cx\");\n\nvar _require = require(\"immutable\"),\n    Map = _require.Map;\n\nvar UL_WRAP = React.createElement(\"ul\", {\n  className: cx('public/DraftStyleDefault/ul')\n});\nvar OL_WRAP = React.createElement(\"ol\", {\n  className: cx('public/DraftStyleDefault/ol')\n});\nvar PRE_WRAP = React.createElement(\"pre\", {\n  className: cx('public/DraftStyleDefault/pre')\n});\nvar DefaultDraftBlockRenderMap = Map({\n  'header-one': {\n    element: 'h1'\n  },\n  'header-two': {\n    element: 'h2'\n  },\n  'header-three': {\n    element: 'h3'\n  },\n  'header-four': {\n    element: 'h4'\n  },\n  'header-five': {\n    element: 'h5'\n  },\n  'header-six': {\n    element: 'h6'\n  },\n  section: {\n    element: 'section'\n  },\n  article: {\n    element: 'article'\n  },\n  'unordered-list-item': {\n    element: 'li',\n    wrapper: UL_WRAP\n  },\n  'ordered-list-item': {\n    element: 'li',\n    wrapper: OL_WRAP\n  },\n  blockquote: {\n    element: 'blockquote'\n  },\n  atomic: {\n    element: 'figure'\n  },\n  'code-block': {\n    element: 'pre',\n    wrapper: PRE_WRAP\n  },\n  unstyled: {\n    element: 'div',\n    aliasedElements: ['p']\n  }\n});\nmodule.exports = DefaultDraftBlockRenderMap;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nmodule.exports = {\n  BOLD: {\n    fontWeight: 'bold'\n  },\n  CODE: {\n    fontFamily: 'monospace',\n    wordWrap: 'break-word'\n  },\n  ITALIC: {\n    fontStyle: 'italic'\n  },\n  STRIKETHROUGH: {\n    textDecoration: 'line-through'\n  },\n  UNDERLINE: {\n    textDecoration: 'underline'\n  }\n};","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n */\n'use strict';\n\nvar AtomicBlockUtils = require(\"./AtomicBlockUtils\");\n\nvar BlockMapBuilder = require(\"./BlockMapBuilder\");\n\nvar CharacterMetadata = require(\"./CharacterMetadata\");\n\nvar CompositeDraftDecorator = require(\"./CompositeDraftDecorator\");\n\nvar ContentBlock = require(\"./ContentBlock\");\n\nvar ContentState = require(\"./ContentState\");\n\nvar DefaultDraftBlockRenderMap = require(\"./DefaultDraftBlockRenderMap\");\n\nvar DefaultDraftInlineStyle = require(\"./DefaultDraftInlineStyle\");\n\nvar DraftEditor = require(\"./DraftEditor.react\");\n\nvar DraftEditorBlock = require(\"./DraftEditorBlock.react\");\n\nvar DraftEntity = require(\"./DraftEntity\");\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar DraftEntityInstance = require(\"./DraftEntityInstance\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar KeyBindingUtil = require(\"./KeyBindingUtil\");\n\nvar RawDraftContentState = require(\"./RawDraftContentState\");\n\nvar RichTextEditorUtil = require(\"./RichTextEditorUtil\");\n\nvar SelectionState = require(\"./SelectionState\");\n\nvar convertFromDraftStateToRaw = require(\"./convertFromDraftStateToRaw\");\n\nvar convertFromRawToDraftState = require(\"./convertFromRawToDraftState\");\n\nvar generateRandomKey = require(\"./generateRandomKey\");\n\nvar getDefaultKeyBinding = require(\"./getDefaultKeyBinding\");\n\nvar getVisibleSelectionRect = require(\"./getVisibleSelectionRect\");\n\nvar convertFromHTML = require(\"./convertFromHTMLToContentBlocks\");\n\nvar DraftPublic = {\n  Editor: DraftEditor,\n  EditorBlock: DraftEditorBlock,\n  EditorState: EditorState,\n  CompositeDecorator: CompositeDraftDecorator,\n  Entity: DraftEntity,\n  EntityInstance: DraftEntityInstance,\n  BlockMapBuilder: BlockMapBuilder,\n  CharacterMetadata: CharacterMetadata,\n  ContentBlock: ContentBlock,\n  ContentState: ContentState,\n  RawDraftContentState: RawDraftContentState,\n  SelectionState: SelectionState,\n  AtomicBlockUtils: AtomicBlockUtils,\n  KeyBindingUtil: KeyBindingUtil,\n  Modifier: DraftModifier,\n  RichUtils: RichTextEditorUtil,\n  DefaultDraftBlockRenderMap: DefaultDraftBlockRenderMap,\n  DefaultDraftInlineStyle: DefaultDraftInlineStyle,\n  convertFromHTML: convertFromHTML,\n  convertFromRaw: convertFromRawToDraftState,\n  convertToRaw: convertFromDraftStateToRaw,\n  genKey: generateRandomKey,\n  getDefaultKeyBinding: getDefaultKeyBinding,\n  getVisibleSelectionRect: getVisibleSelectionRect\n};\nmodule.exports = DraftPublic;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @preventMunge\n * @emails oncall+draft_js\n */\n'use strict';\n\nvar _assign = require(\"object-assign\");\n\nfunction _extends() { _extends = _assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, source[key]); }); } return target; }\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 _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 _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar DefaultDraftBlockRenderMap = require(\"./DefaultDraftBlockRenderMap\");\n\nvar DefaultDraftInlineStyle = require(\"./DefaultDraftInlineStyle\");\n\nvar DraftEditorCompositionHandler = require(\"./DraftEditorCompositionHandler\");\n\nvar DraftEditorContents = require(\"./DraftEditorContents.react\");\n\nvar DraftEditorDragHandler = require(\"./DraftEditorDragHandler\");\n\nvar DraftEditorEditHandler = require(\"./DraftEditorEditHandler\");\n\nvar flushControlled = require(\"./DraftEditorFlushControlled\");\n\nvar DraftEditorPlaceholder = require(\"./DraftEditorPlaceholder.react\");\n\nvar DraftEffects = require(\"./DraftEffects\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar React = require(\"react\");\n\nvar Scroll = require(\"fbjs/lib/Scroll\");\n\nvar Style = require(\"fbjs/lib/Style\");\n\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nvar cx = require(\"fbjs/lib/cx\");\n\nvar generateRandomKey = require(\"./generateRandomKey\");\n\nvar getDefaultKeyBinding = require(\"./getDefaultKeyBinding\");\n\nvar getScrollPosition = require(\"fbjs/lib/getScrollPosition\");\n\nvar gkx = require(\"./gkx\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar isHTMLElement = require(\"./isHTMLElement\");\n\nvar nullthrows = require(\"fbjs/lib/nullthrows\");\n\nvar isIE = UserAgent.isBrowser('IE'); // IE does not support the `input` event on contentEditable, so we can't\n// observe spellcheck behavior.\n\nvar allowSpellCheck = !isIE; // Define a set of handler objects to correspond to each possible `mode`\n// of editor behavior.\n\nvar handlerMap = {\n  edit: DraftEditorEditHandler,\n  composite: DraftEditorCompositionHandler,\n  drag: DraftEditorDragHandler,\n  cut: null,\n  render: null\n};\nvar didInitODS = false;\n\nvar UpdateDraftEditorFlags = /*#__PURE__*/function (_React$Component) {\n  _inheritsLoose(UpdateDraftEditorFlags, _React$Component);\n\n  function UpdateDraftEditorFlags() {\n    return _React$Component.apply(this, arguments) || this;\n  }\n\n  var _proto = UpdateDraftEditorFlags.prototype;\n\n  _proto.render = function render() {\n    return null;\n  };\n\n  _proto.componentDidMount = function componentDidMount() {\n    this._update();\n  };\n\n  _proto.componentDidUpdate = function componentDidUpdate() {\n    this._update();\n  };\n\n  _proto._update = function _update() {\n    var editor = this.props.editor;\n    /**\n     * Sometimes a render triggers a 'focus' or other event, and that will\n     * schedule a second render pass.\n     * In order to make sure the second render pass gets the latest editor\n     * state, we update it here.\n     * Example:\n     * render #1\n     * +\n     * |\n     * | cWU -> Nothing ... latestEditorState = STALE_STATE :(\n     * |\n     * | render -> this.props.editorState = FRESH_STATE\n     * | +         *and* set latestEditorState = FRESH_STATE\n     *   |\n     * | |\n     * | +--> triggers 'focus' event, calling 'handleFocus' with latestEditorState\n     * |                                                +\n     * |                                                |\n     * +>cdU -> latestEditorState = FRESH_STATE         | the 'handleFocus' call schedules render #2\n     *                                                  | with latestEditorState, which is FRESH_STATE\n     *                                                  |\n     * render #2 <--------------------------------------+\n     * +\n     * |\n     * | cwU -> nothing updates\n     * |\n     * | render -> this.props.editorState = FRESH_STATE which was passed in above\n     * |\n     * +>cdU fires and resets latestEditorState = FRESH_STATE\n     * ---\n     * Note that if we don't set latestEditorState in 'render' in the above\n     * diagram, then STALE_STATE gets passed to render #2.\n     */\n\n    editor._latestEditorState = this.props.editorState;\n    /**\n     * The reason we set this 'blockSelectEvents' flag is that  IE will fire a\n     * 'selectionChange' event when we programmatically change the selection,\n     * meaning it would trigger a new select event while we are in the middle\n     * of updating.\n     * We found that the 'selection.addRange' was what triggered the stray\n     * selectionchange event in IE.\n     * To be clear - we have not been able to reproduce specific bugs related\n     * to this stray selection event, but have recorded logs that some\n     * conditions do cause it to get bumped into during editOnSelect.\n     */\n\n    editor._blockSelectEvents = true;\n  };\n\n  return UpdateDraftEditorFlags;\n}(React.Component);\n/**\n * `DraftEditor` is the root editor component. It composes a `contentEditable`\n * div, and provides a wide variety of useful function props for managing the\n * state of the editor. See `DraftEditorProps` for details.\n */\n\n\nvar DraftEditor = /*#__PURE__*/function (_React$Component2) {\n  _inheritsLoose(DraftEditor, _React$Component2);\n\n  /**\n   * Define proxies that can route events to the current handler.\n   */\n  function DraftEditor(props) {\n    var _this;\n\n    _this = _React$Component2.call(this, props) || this;\n\n    _defineProperty(_assertThisInitialized(_this), \"_blockSelectEvents\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_clipboard\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_handler\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_dragCount\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_internalDrag\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_editorKey\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_placeholderAccessibilityID\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_latestEditorState\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_latestCommittedEditorState\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_pendingStateFromBeforeInput\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onBeforeInput\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onBlur\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onCharacterData\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onCompositionEnd\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onCompositionStart\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onCopy\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onCut\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onDragEnd\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onDragOver\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onDragStart\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onDrop\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onInput\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onFocus\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onKeyDown\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onKeyPress\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onKeyUp\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onMouseDown\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onMouseUp\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onPaste\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_onSelect\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"editor\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"editorContainer\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"focus\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"blur\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"setMode\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"exitCurrentMode\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"restoreEditorDOM\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"setClipboard\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"getClipboard\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"getEditorKey\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"update\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"onDragEnter\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"onDragLeave\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_handleEditorContainerRef\", function (node) {\n      _this.editorContainer = node; // Instead of having a direct ref on the child, we'll grab it here.\n      // This is safe as long as the rendered structure is static (which it is).\n      // This lets the child support ref={props.editorRef} without merging refs.\n\n      _this.editor = node !== null ? node.firstChild : null;\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"focus\", function (scrollPosition) {\n      var editorState = _this.props.editorState;\n      var alreadyHasFocus = editorState.getSelection().getHasFocus();\n      var editorNode = _this.editor;\n\n      if (!editorNode) {\n        // once in a while people call 'focus' in a setTimeout, and the node has\n        // been deleted, so it can be null in that case.\n        return;\n      }\n\n      var scrollParent = Style.getScrollParent(editorNode);\n\n      var _ref = scrollPosition || getScrollPosition(scrollParent),\n          x = _ref.x,\n          y = _ref.y;\n\n      !isHTMLElement(editorNode) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'editorNode is not an HTMLElement') : invariant(false) : void 0;\n      editorNode.focus(); // Restore scroll position\n\n      if (scrollParent === window) {\n        window.scrollTo(x, y);\n      } else {\n        Scroll.setTop(scrollParent, y);\n      } // On Chrome and Safari, calling focus on contenteditable focuses the\n      // cursor at the first character. This is something you don't expect when\n      // you're clicking on an input element but not directly on a character.\n      // Put the cursor back where it was before the blur.\n\n\n      if (!alreadyHasFocus) {\n        _this.update(EditorState.forceSelection(editorState, editorState.getSelection()));\n      }\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"blur\", function () {\n      var editorNode = _this.editor;\n\n      if (!editorNode) {\n        return;\n      }\n\n      !isHTMLElement(editorNode) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'editorNode is not an HTMLElement') : invariant(false) : void 0;\n      editorNode.blur();\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"setMode\", function (mode) {\n      var _this$props = _this.props,\n          onPaste = _this$props.onPaste,\n          onCut = _this$props.onCut,\n          onCopy = _this$props.onCopy;\n\n      var editHandler = _objectSpread({}, handlerMap.edit);\n\n      if (onPaste) {\n        /* $FlowFixMe[incompatible-type] (>=0.117.0 site=www,mobile) This comment\n         * suppresses an error found when Flow v0.117 was deployed. To see the\n         * error delete this comment and run Flow. */\n        editHandler.onPaste = onPaste;\n      }\n\n      if (onCut) {\n        editHandler.onCut = onCut;\n      }\n\n      if (onCopy) {\n        editHandler.onCopy = onCopy;\n      }\n\n      var handler = _objectSpread({}, handlerMap, {\n        edit: editHandler\n      });\n\n      _this._handler = handler[mode];\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"exitCurrentMode\", function () {\n      _this.setMode('edit');\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"restoreEditorDOM\", function (scrollPosition) {\n      _this.setState({\n        contentsKey: _this.state.contentsKey + 1\n      }, function () {\n        _this.focus(scrollPosition);\n      });\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"setClipboard\", function (clipboard) {\n      _this._clipboard = clipboard;\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"getClipboard\", function () {\n      return _this._clipboard;\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"update\", function (editorState) {\n      _this._latestEditorState = editorState;\n\n      _this.props.onChange(editorState);\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"onDragEnter\", function () {\n      _this._dragCount++;\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"onDragLeave\", function () {\n      _this._dragCount--;\n\n      if (_this._dragCount === 0) {\n        _this.exitCurrentMode();\n      }\n    });\n\n    _this._blockSelectEvents = false;\n    _this._clipboard = null;\n    _this._handler = null;\n    _this._dragCount = 0;\n    _this._editorKey = props.editorKey || generateRandomKey();\n    _this._placeholderAccessibilityID = 'placeholder-' + _this._editorKey;\n    _this._latestEditorState = props.editorState;\n    _this._latestCommittedEditorState = props.editorState;\n    _this._onBeforeInput = _this._buildHandler('onBeforeInput');\n    _this._onBlur = _this._buildHandler('onBlur');\n    _this._onCharacterData = _this._buildHandler('onCharacterData');\n    _this._onCompositionEnd = _this._buildHandler('onCompositionEnd');\n    _this._onCompositionStart = _this._buildHandler('onCompositionStart');\n    _this._onCopy = _this._buildHandler('onCopy');\n    _this._onCut = _this._buildHandler('onCut');\n    _this._onDragEnd = _this._buildHandler('onDragEnd');\n    _this._onDragOver = _this._buildHandler('onDragOver');\n    _this._onDragStart = _this._buildHandler('onDragStart');\n    _this._onDrop = _this._buildHandler('onDrop');\n    _this._onInput = _this._buildHandler('onInput');\n    _this._onFocus = _this._buildHandler('onFocus');\n    _this._onKeyDown = _this._buildHandler('onKeyDown');\n    _this._onKeyPress = _this._buildHandler('onKeyPress');\n    _this._onKeyUp = _this._buildHandler('onKeyUp');\n    _this._onMouseDown = _this._buildHandler('onMouseDown');\n    _this._onMouseUp = _this._buildHandler('onMouseUp');\n    _this._onPaste = _this._buildHandler('onPaste');\n    _this._onSelect = _this._buildHandler('onSelect');\n\n    _this.getEditorKey = function () {\n      return _this._editorKey;\n    };\n\n    if (process.env.NODE_ENV !== \"production\") {\n      ['onDownArrow', 'onEscape', 'onLeftArrow', 'onRightArrow', 'onTab', 'onUpArrow'].forEach(function (propName) {\n        if (props.hasOwnProperty(propName)) {\n          // eslint-disable-next-line no-console\n          console.warn(\"Supplying an `\".concat(propName, \"` prop to `DraftEditor` has \") + 'been deprecated. If your handler needs access to the keyboard ' + 'event, supply a custom `keyBindingFn` prop that falls back to ' + 'the default one (eg. https://is.gd/wHKQ3W).');\n        }\n      });\n    } // See `restoreEditorDOM()`.\n\n\n    _this.state = {\n      contentsKey: 0\n    };\n    return _this;\n  }\n  /**\n   * Build a method that will pass the event to the specified handler method.\n   * This allows us to look up the correct handler function for the current\n   * editor mode, if any has been specified.\n   */\n\n\n  var _proto2 = DraftEditor.prototype;\n\n  _proto2._buildHandler = function _buildHandler(eventName) {\n    var _this2 = this;\n\n    // Wrap event handlers in `flushControlled`. In sync mode, this is\n    // effectively a no-op. In async mode, this ensures all updates scheduled\n    // inside the handler are flushed before React yields to the browser.\n    return function (e) {\n      if (!_this2.props.readOnly) {\n        var method = _this2._handler && _this2._handler[eventName];\n\n        if (method) {\n          if (flushControlled) {\n            flushControlled(function () {\n              return method(_this2, e);\n            });\n          } else {\n            method(_this2, e);\n          }\n        }\n      }\n    };\n  };\n\n  _proto2._showPlaceholder = function _showPlaceholder() {\n    return !!this.props.placeholder && !this.props.editorState.isInCompositionMode() && !this.props.editorState.getCurrentContent().hasText();\n  };\n\n  _proto2._renderPlaceholder = function _renderPlaceholder() {\n    if (this._showPlaceholder()) {\n      var placeHolderProps = {\n        text: nullthrows(this.props.placeholder),\n        editorState: this.props.editorState,\n        textAlignment: this.props.textAlignment,\n        accessibilityID: this._placeholderAccessibilityID\n      };\n      /* $FlowFixMe[incompatible-type] (>=0.112.0 site=www,mobile) This comment\n       * suppresses an error found when Flow v0.112 was deployed. To see the\n       * error delete this comment and run Flow. */\n\n      return React.createElement(DraftEditorPlaceholder, placeHolderProps);\n    }\n\n    return null;\n  }\n  /**\n   * returns ariaDescribedBy prop with '{{editor_id_placeholder}}' replaced with\n   * the DOM id of the placeholder (if it exists)\n   * @returns aria-describedby attribute value\n   */\n  ;\n\n  _proto2._renderARIADescribedBy = function _renderARIADescribedBy() {\n    var describedBy = this.props.ariaDescribedBy || '';\n    var placeholderID = this._showPlaceholder() ? this._placeholderAccessibilityID : '';\n    return describedBy.replace('{{editor_id_placeholder}}', placeholderID) || undefined;\n  };\n\n  _proto2.render = function render() {\n    var _this$props2 = this.props,\n        blockRenderMap = _this$props2.blockRenderMap,\n        blockRendererFn = _this$props2.blockRendererFn,\n        blockStyleFn = _this$props2.blockStyleFn,\n        customStyleFn = _this$props2.customStyleFn,\n        customStyleMap = _this$props2.customStyleMap,\n        editorState = _this$props2.editorState,\n        preventScroll = _this$props2.preventScroll,\n        readOnly = _this$props2.readOnly,\n        textAlignment = _this$props2.textAlignment,\n        textDirectionality = _this$props2.textDirectionality;\n    var rootClass = cx({\n      'DraftEditor/root': true,\n      'DraftEditor/alignLeft': textAlignment === 'left',\n      'DraftEditor/alignRight': textAlignment === 'right',\n      'DraftEditor/alignCenter': textAlignment === 'center'\n    });\n    var contentStyle = {\n      outline: 'none',\n      // fix parent-draggable Safari bug. #1326\n      userSelect: 'text',\n      WebkitUserSelect: 'text',\n      whiteSpace: 'pre-wrap',\n      wordWrap: 'break-word'\n    }; // The aria-expanded and aria-haspopup properties should only be rendered\n    // for a combobox.\n\n    /* $FlowFixMe[prop-missing] (>=0.68.0 site=www,mobile) This comment\n     * suppresses an error found when Flow v0.68 was deployed. To see the error\n     * delete this comment and run Flow. */\n\n    var ariaRole = this.props.role || 'textbox';\n    var ariaExpanded = ariaRole === 'combobox' ? !!this.props.ariaExpanded : null;\n    var editorContentsProps = {\n      blockRenderMap: blockRenderMap,\n      blockRendererFn: blockRendererFn,\n      blockStyleFn: blockStyleFn,\n      customStyleMap: _objectSpread({}, DefaultDraftInlineStyle, customStyleMap),\n      customStyleFn: customStyleFn,\n      editorKey: this._editorKey,\n      editorState: editorState,\n      preventScroll: preventScroll,\n      textDirectionality: textDirectionality\n    };\n    return React.createElement(\"div\", {\n      className: rootClass\n    }, this._renderPlaceholder(), React.createElement(\"div\", {\n      className: cx('DraftEditor/editorContainer'),\n      ref: this._handleEditorContainerRef\n    }, React.createElement(\"div\", {\n      \"aria-activedescendant\": readOnly ? null : this.props.ariaActiveDescendantID,\n      \"aria-autocomplete\": readOnly ? null : this.props.ariaAutoComplete,\n      \"aria-controls\": readOnly ? null : this.props.ariaControls,\n      \"aria-describedby\": this._renderARIADescribedBy(),\n      \"aria-expanded\": readOnly ? null : ariaExpanded,\n      \"aria-label\": this.props.ariaLabel,\n      \"aria-labelledby\": this.props.ariaLabelledBy,\n      \"aria-multiline\": this.props.ariaMultiline,\n      \"aria-owns\": readOnly ? null : this.props.ariaOwneeID,\n      autoCapitalize: this.props.autoCapitalize,\n      autoComplete: this.props.autoComplete,\n      autoCorrect: this.props.autoCorrect,\n      className: cx({\n        // Chrome's built-in translation feature mutates the DOM in ways\n        // that Draft doesn't expect (ex: adding <font> tags inside\n        // DraftEditorLeaf spans) and causes problems. We add notranslate\n        // here which makes its autotranslation skip over this subtree.\n        notranslate: !readOnly,\n        'public/DraftEditor/content': true\n      }),\n      contentEditable: !readOnly,\n      \"data-testid\": this.props.webDriverTestID,\n      onBeforeInput: this._onBeforeInput,\n      onBlur: this._onBlur,\n      onCompositionEnd: this._onCompositionEnd,\n      onCompositionStart: this._onCompositionStart,\n      onCopy: this._onCopy,\n      onCut: this._onCut,\n      onDragEnd: this._onDragEnd,\n      onDragEnter: this.onDragEnter,\n      onDragLeave: this.onDragLeave,\n      onDragOver: this._onDragOver,\n      onDragStart: this._onDragStart,\n      onDrop: this._onDrop,\n      onFocus: this._onFocus,\n      onInput: this._onInput,\n      onKeyDown: this._onKeyDown,\n      onKeyPress: this._onKeyPress,\n      onKeyUp: this._onKeyUp,\n      onMouseUp: this._onMouseUp,\n      onPaste: this._onPaste,\n      onSelect: this._onSelect,\n      ref: this.props.editorRef,\n      role: readOnly ? null : ariaRole,\n      spellCheck: allowSpellCheck && this.props.spellCheck,\n      style: contentStyle,\n      suppressContentEditableWarning: true,\n      tabIndex: this.props.tabIndex\n    }, React.createElement(UpdateDraftEditorFlags, {\n      editor: this,\n      editorState: editorState\n    }), React.createElement(DraftEditorContents, _extends({}, editorContentsProps, {\n      key: 'contents' + this.state.contentsKey\n    })))));\n  };\n\n  _proto2.componentDidMount = function componentDidMount() {\n    this._blockSelectEvents = false;\n\n    if (!didInitODS && gkx('draft_ods_enabled')) {\n      didInitODS = true;\n      DraftEffects.initODS();\n    }\n\n    this.setMode('edit');\n    /**\n     * IE has a hardcoded \"feature\" that attempts to convert link text into\n     * anchors in contentEditable DOM. This breaks the editor's expectations of\n     * the DOM, and control is lost. Disable it to make IE behave.\n     * See: http://blogs.msdn.com/b/ieinternals/archive/2010/09/15/\n     * ie9-beta-minor-change-list.aspx\n     */\n\n    if (isIE) {\n      // editor can be null after mounting\n      // https://stackoverflow.com/questions/44074747/componentdidmount-called-before-ref-callback\n      if (!this.editor) {\n        global.execCommand('AutoUrlDetect', false, false);\n      } else {\n        this.editor.ownerDocument.execCommand('AutoUrlDetect', false, false);\n      }\n    }\n  };\n\n  _proto2.componentDidUpdate = function componentDidUpdate() {\n    this._blockSelectEvents = false;\n    this._latestEditorState = this.props.editorState;\n    this._latestCommittedEditorState = this.props.editorState;\n  }\n  /**\n   * Used via `this.focus()`.\n   *\n   * Force focus back onto the editor node.\n   *\n   * We attempt to preserve scroll position when focusing. You can also pass\n   * a specified scroll position (for cases like `cut` behavior where it should\n   * be restored to a known position).\n   */\n  ;\n\n  return DraftEditor;\n}(React.Component);\n\n_defineProperty(DraftEditor, \"defaultProps\", {\n  ariaDescribedBy: '{{editor_id_placeholder}}',\n  blockRenderMap: DefaultDraftBlockRenderMap,\n  blockRendererFn: function blockRendererFn() {\n    return null;\n  },\n  blockStyleFn: function blockStyleFn() {\n    return '';\n  },\n  keyBindingFn: getDefaultKeyBinding,\n  readOnly: false,\n  spellCheck: false,\n  stripPastedStyles: false\n});\n\nmodule.exports = DraftEditor;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar _assign = require(\"object-assign\");\n\nfunction _extends() { _extends = _assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\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 _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\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\nvar DraftEditorLeaf = require(\"./DraftEditorLeaf.react\");\n\nvar DraftOffsetKey = require(\"./DraftOffsetKey\");\n\nvar React = require(\"react\");\n\nvar Scroll = require(\"fbjs/lib/Scroll\");\n\nvar Style = require(\"fbjs/lib/Style\");\n\nvar UnicodeBidi = require(\"fbjs/lib/UnicodeBidi\");\n\nvar UnicodeBidiDirection = require(\"fbjs/lib/UnicodeBidiDirection\");\n\nvar cx = require(\"fbjs/lib/cx\");\n\nvar getElementPosition = require(\"fbjs/lib/getElementPosition\");\n\nvar getScrollPosition = require(\"fbjs/lib/getScrollPosition\");\n\nvar getViewportDimensions = require(\"fbjs/lib/getViewportDimensions\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar isHTMLElement = require(\"./isHTMLElement\");\n\nvar nullthrows = require(\"fbjs/lib/nullthrows\");\n\nvar SCROLL_BUFFER = 10;\n\n/**\n * Return whether a block overlaps with either edge of the `SelectionState`.\n */\nvar isBlockOnSelectionEdge = function isBlockOnSelectionEdge(selection, key) {\n  return selection.getAnchorKey() === key || selection.getFocusKey() === key;\n};\n/**\n * The default block renderer for a `DraftEditor` component.\n *\n * A `DraftEditorBlock` is able to render a given `ContentBlock` to its\n * appropriate decorator and inline style components.\n */\n\n\nvar DraftEditorBlock = /*#__PURE__*/function (_React$Component) {\n  _inheritsLoose(DraftEditorBlock, _React$Component);\n\n  function DraftEditorBlock() {\n    var _this;\n\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    _this = _React$Component.call.apply(_React$Component, [this].concat(args)) || this;\n\n    _defineProperty(_assertThisInitialized(_this), \"_node\", void 0);\n\n    return _this;\n  }\n\n  var _proto = DraftEditorBlock.prototype;\n\n  _proto.shouldComponentUpdate = function shouldComponentUpdate(nextProps) {\n    return this.props.block !== nextProps.block || this.props.tree !== nextProps.tree || this.props.direction !== nextProps.direction || isBlockOnSelectionEdge(nextProps.selection, nextProps.block.getKey()) && nextProps.forceSelection;\n  }\n  /**\n   * When a block is mounted and overlaps the selection state, we need to make\n   * sure that the cursor is visible to match native behavior. This may not\n   * be the case if the user has pressed `RETURN` or pasted some content, since\n   * programmatically creating these new blocks and setting the DOM selection\n   * will miss out on the browser natively scrolling to that position.\n   *\n   * To replicate native behavior, if the block overlaps the selection state\n   * on mount, force the scroll position. Check the scroll state of the scroll\n   * parent, and adjust it to align the entire block to the bottom of the\n   * scroll parent.\n   */\n  ;\n\n  _proto.componentDidMount = function componentDidMount() {\n    if (this.props.preventScroll) {\n      return;\n    }\n\n    var selection = this.props.selection;\n    var endKey = selection.getEndKey();\n\n    if (!selection.getHasFocus() || endKey !== this.props.block.getKey()) {\n      return;\n    }\n\n    var blockNode = this._node;\n\n    if (blockNode == null) {\n      return;\n    }\n\n    var scrollParent = Style.getScrollParent(blockNode);\n    var scrollPosition = getScrollPosition(scrollParent);\n    var scrollDelta;\n\n    if (scrollParent === window) {\n      var nodePosition = getElementPosition(blockNode);\n      var nodeBottom = nodePosition.y + nodePosition.height;\n      var viewportHeight = getViewportDimensions().height;\n      scrollDelta = nodeBottom - viewportHeight;\n\n      if (scrollDelta > 0) {\n        window.scrollTo(scrollPosition.x, scrollPosition.y + scrollDelta + SCROLL_BUFFER);\n      }\n    } else {\n      !isHTMLElement(blockNode) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'blockNode is not an HTMLElement') : invariant(false) : void 0;\n      var blockBottom = blockNode.offsetHeight + blockNode.offsetTop;\n      var pOffset = scrollParent.offsetTop + scrollParent.offsetHeight;\n      var scrollBottom = pOffset + scrollPosition.y;\n      scrollDelta = blockBottom - scrollBottom;\n\n      if (scrollDelta > 0) {\n        Scroll.setTop(scrollParent, Scroll.getTop(scrollParent) + scrollDelta + SCROLL_BUFFER);\n      }\n    }\n  };\n\n  _proto._renderChildren = function _renderChildren() {\n    var _this2 = this;\n\n    var block = this.props.block;\n    var blockKey = block.getKey();\n    var text = block.getText();\n    var lastLeafSet = this.props.tree.size - 1;\n    var hasSelection = isBlockOnSelectionEdge(this.props.selection, blockKey);\n    return this.props.tree.map(function (leafSet, ii) {\n      var leavesForLeafSet = leafSet.get('leaves'); // T44088704\n\n      if (leavesForLeafSet.size === 0) {\n        return null;\n      }\n\n      var lastLeaf = leavesForLeafSet.size - 1;\n      var leaves = leavesForLeafSet.map(function (leaf, jj) {\n        var offsetKey = DraftOffsetKey.encode(blockKey, ii, jj);\n        var start = leaf.get('start');\n        var end = leaf.get('end');\n        return React.createElement(DraftEditorLeaf, {\n          key: offsetKey,\n          offsetKey: offsetKey,\n          block: block,\n          start: start,\n          selection: hasSelection ? _this2.props.selection : null,\n          forceSelection: _this2.props.forceSelection,\n          text: text.slice(start, end),\n          styleSet: block.getInlineStyleAt(start),\n          customStyleMap: _this2.props.customStyleMap,\n          customStyleFn: _this2.props.customStyleFn,\n          isLast: ii === lastLeafSet && jj === lastLeaf\n        });\n      }).toArray();\n      var decoratorKey = leafSet.get('decoratorKey');\n\n      if (decoratorKey == null) {\n        return leaves;\n      }\n\n      if (!_this2.props.decorator) {\n        return leaves;\n      }\n\n      var decorator = nullthrows(_this2.props.decorator);\n      var DecoratorComponent = decorator.getComponentForKey(decoratorKey);\n\n      if (!DecoratorComponent) {\n        return leaves;\n      }\n\n      var decoratorProps = decorator.getPropsForKey(decoratorKey);\n      var decoratorOffsetKey = DraftOffsetKey.encode(blockKey, ii, 0);\n      var start = leavesForLeafSet.first().get('start');\n      var end = leavesForLeafSet.last().get('end');\n      var decoratedText = text.slice(start, end);\n      var entityKey = block.getEntityAt(leafSet.get('start')); // Resetting dir to the same value on a child node makes Chrome/Firefox\n      // confused on cursor movement. See http://jsfiddle.net/d157kLck/3/\n\n      var dir = UnicodeBidiDirection.getHTMLDirIfDifferent(UnicodeBidi.getDirection(decoratedText), _this2.props.direction);\n      var commonProps = {\n        contentState: _this2.props.contentState,\n        decoratedText: decoratedText,\n        dir: dir,\n        start: start,\n        end: end,\n        blockKey: blockKey,\n        entityKey: entityKey,\n        offsetKey: decoratorOffsetKey\n      };\n      return React.createElement(DecoratorComponent, _extends({}, decoratorProps, commonProps, {\n        key: decoratorOffsetKey\n      }), leaves);\n    }).toArray();\n  };\n\n  _proto.render = function render() {\n    var _this3 = this;\n\n    var _this$props = this.props,\n        direction = _this$props.direction,\n        offsetKey = _this$props.offsetKey;\n    var className = cx({\n      'public/DraftStyleDefault/block': true,\n      'public/DraftStyleDefault/ltr': direction === 'LTR',\n      'public/DraftStyleDefault/rtl': direction === 'RTL'\n    });\n    return React.createElement(\"div\", {\n      \"data-offset-key\": offsetKey,\n      className: className,\n      ref: function ref(_ref) {\n        return _this3._node = _ref;\n      }\n    }, this._renderChildren());\n  };\n\n  return DraftEditorBlock;\n}(React.Component);\n\nmodule.exports = DraftEditorBlock;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n *\n * This file is a fork of DraftEditorBlock.react.js and DraftEditorContents.react.js\n *\n * This is unstable and not part of the public API and should not be used by\n * production systems. This file may be update/removed without notice.\n */\n'use strict';\n\nvar _assign = require(\"object-assign\");\n\nfunction _extends() { _extends = _assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\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 _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, 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\nvar DraftEditorNode = require(\"./DraftEditorNode.react\");\n\nvar DraftOffsetKey = require(\"./DraftOffsetKey\");\n\nvar React = require(\"react\");\n\nvar Scroll = require(\"fbjs/lib/Scroll\");\n\nvar Style = require(\"fbjs/lib/Style\");\n\nvar getElementPosition = require(\"fbjs/lib/getElementPosition\");\n\nvar getScrollPosition = require(\"fbjs/lib/getScrollPosition\");\n\nvar getViewportDimensions = require(\"fbjs/lib/getViewportDimensions\");\n\nvar Immutable = require(\"immutable\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar isHTMLElement = require(\"./isHTMLElement\");\n\nvar SCROLL_BUFFER = 10;\nvar List = Immutable.List; // we should harden up the bellow flow types to make them more strict\n\n/**\n * Return whether a block overlaps with either edge of the `SelectionState`.\n */\nvar isBlockOnSelectionEdge = function isBlockOnSelectionEdge(selection, key) {\n  return selection.getAnchorKey() === key || selection.getFocusKey() === key;\n};\n/**\n * We will use this helper to identify blocks that need to be wrapped but have siblings that\n * also share the same wrapper element, this way we can do the wrapping once the last sibling\n * is added.\n */\n\n\nvar shouldNotAddWrapperElement = function shouldNotAddWrapperElement(block, contentState) {\n  var nextSiblingKey = block.getNextSiblingKey();\n  return nextSiblingKey ? contentState.getBlockForKey(nextSiblingKey).getType() === block.getType() : false;\n};\n\nvar applyWrapperElementToSiblings = function applyWrapperElementToSiblings(wrapperTemplate, Element, nodes) {\n  var wrappedSiblings = []; // we check back until we find a sibling that does not have same wrapper\n\n  var _iteratorNormalCompletion = true;\n  var _didIteratorError = false;\n  var _iteratorError = undefined;\n\n  try {\n    for (var _iterator = nodes.reverse()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n      var sibling = _step.value;\n\n      if (sibling.type !== Element) {\n        break;\n      }\n\n      wrappedSiblings.push(sibling);\n    } // we now should remove from acc the wrappedSiblings and add them back under same wrap\n\n  } catch (err) {\n    _didIteratorError = true;\n    _iteratorError = err;\n  } finally {\n    try {\n      if (!_iteratorNormalCompletion && _iterator[\"return\"] != null) {\n        _iterator[\"return\"]();\n      }\n    } finally {\n      if (_didIteratorError) {\n        throw _iteratorError;\n      }\n    }\n  }\n\n  nodes.splice(nodes.indexOf(wrappedSiblings[0]), wrappedSiblings.length + 1);\n  var childrenIs = wrappedSiblings.reverse();\n  var key = childrenIs[0].key;\n  nodes.push(React.cloneElement(wrapperTemplate, {\n    key: \"\".concat(key, \"-wrap\"),\n    'data-offset-key': DraftOffsetKey.encode(key, 0, 0)\n  }, childrenIs));\n  return nodes;\n};\n\nvar getDraftRenderConfig = function getDraftRenderConfig(block, blockRenderMap) {\n  var configForType = blockRenderMap.get(block.getType()) || blockRenderMap.get('unstyled');\n  var wrapperTemplate = configForType.wrapper;\n  var Element = configForType.element || blockRenderMap.get('unstyled').element;\n  return {\n    Element: Element,\n    wrapperTemplate: wrapperTemplate\n  };\n};\n\nvar getCustomRenderConfig = function getCustomRenderConfig(block, blockRendererFn) {\n  var customRenderer = blockRendererFn(block);\n\n  if (!customRenderer) {\n    return {};\n  }\n\n  var CustomComponent = customRenderer.component,\n      customProps = customRenderer.props,\n      customEditable = customRenderer.editable;\n  return {\n    CustomComponent: CustomComponent,\n    customProps: customProps,\n    customEditable: customEditable\n  };\n};\n\nvar getElementPropsConfig = function getElementPropsConfig(block, editorKey, offsetKey, blockStyleFn, customConfig, ref) {\n  var elementProps = {\n    'data-block': true,\n    'data-editor': editorKey,\n    'data-offset-key': offsetKey,\n    key: block.getKey(),\n    ref: ref\n  };\n  var customClass = blockStyleFn(block);\n\n  if (customClass) {\n    elementProps.className = customClass;\n  }\n\n  if (customConfig.customEditable !== undefined) {\n    elementProps = _objectSpread({}, elementProps, {\n      contentEditable: customConfig.customEditable,\n      suppressContentEditableWarning: true\n    });\n  }\n\n  return elementProps;\n};\n\nvar DraftEditorBlockNode = /*#__PURE__*/function (_React$Component) {\n  _inheritsLoose(DraftEditorBlockNode, _React$Component);\n\n  function DraftEditorBlockNode() {\n    var _this;\n\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    _this = _React$Component.call.apply(_React$Component, [this].concat(args)) || this;\n\n    _defineProperty(_assertThisInitialized(_this), \"wrapperRef\", React.createRef());\n\n    return _this;\n  }\n\n  var _proto = DraftEditorBlockNode.prototype;\n\n  _proto.shouldComponentUpdate = function shouldComponentUpdate(nextProps) {\n    var _this$props = this.props,\n        block = _this$props.block,\n        direction = _this$props.direction,\n        tree = _this$props.tree;\n    var isContainerNode = !block.getChildKeys().isEmpty();\n    var blockHasChanged = block !== nextProps.block || tree !== nextProps.tree || direction !== nextProps.direction || isBlockOnSelectionEdge(nextProps.selection, nextProps.block.getKey()) && nextProps.forceSelection; // if we have children at this stage we always re-render container nodes\n    // else if its a root node we avoid re-rendering by checking for block updates\n\n    return isContainerNode || blockHasChanged;\n  }\n  /**\n   * When a block is mounted and overlaps the selection state, we need to make\n   * sure that the cursor is visible to match native behavior. This may not\n   * be the case if the user has pressed `RETURN` or pasted some content, since\n   * programatically creating these new blocks and setting the DOM selection\n   * will miss out on the browser natively scrolling to that position.\n   *\n   * To replicate native behavior, if the block overlaps the selection state\n   * on mount, force the scroll position. Check the scroll state of the scroll\n   * parent, and adjust it to align the entire block to the bottom of the\n   * scroll parent.\n   */\n  ;\n\n  _proto.componentDidMount = function componentDidMount() {\n    var selection = this.props.selection;\n    var endKey = selection.getEndKey();\n\n    if (!selection.getHasFocus() || endKey !== this.props.block.getKey()) {\n      return;\n    }\n\n    var blockNode = this.wrapperRef.current;\n\n    if (!blockNode) {\n      // This Block Node was rendered without a wrapper element.\n      return;\n    }\n\n    var scrollParent = Style.getScrollParent(blockNode);\n    var scrollPosition = getScrollPosition(scrollParent);\n    var scrollDelta;\n\n    if (scrollParent === window) {\n      var nodePosition = getElementPosition(blockNode);\n      var nodeBottom = nodePosition.y + nodePosition.height;\n      var viewportHeight = getViewportDimensions().height;\n      scrollDelta = nodeBottom - viewportHeight;\n\n      if (scrollDelta > 0) {\n        window.scrollTo(scrollPosition.x, scrollPosition.y + scrollDelta + SCROLL_BUFFER);\n      }\n    } else {\n      !isHTMLElement(blockNode) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'blockNode is not an HTMLElement') : invariant(false) : void 0;\n      var htmlBlockNode = blockNode;\n      var blockBottom = htmlBlockNode.offsetHeight + htmlBlockNode.offsetTop;\n      var scrollBottom = scrollParent.offsetHeight + scrollPosition.y;\n      scrollDelta = blockBottom - scrollBottom;\n\n      if (scrollDelta > 0) {\n        Scroll.setTop(scrollParent, Scroll.getTop(scrollParent) + scrollDelta + SCROLL_BUFFER);\n      }\n    }\n  };\n\n  _proto.render = function render() {\n    var _this2 = this;\n\n    var _this$props2 = this.props,\n        block = _this$props2.block,\n        blockRenderMap = _this$props2.blockRenderMap,\n        blockRendererFn = _this$props2.blockRendererFn,\n        blockStyleFn = _this$props2.blockStyleFn,\n        contentState = _this$props2.contentState,\n        decorator = _this$props2.decorator,\n        editorKey = _this$props2.editorKey,\n        editorState = _this$props2.editorState,\n        customStyleFn = _this$props2.customStyleFn,\n        customStyleMap = _this$props2.customStyleMap,\n        direction = _this$props2.direction,\n        forceSelection = _this$props2.forceSelection,\n        selection = _this$props2.selection,\n        tree = _this$props2.tree;\n    var children = null;\n\n    if (block.children.size) {\n      children = block.children.reduce(function (acc, key) {\n        var offsetKey = DraftOffsetKey.encode(key, 0, 0);\n        var child = contentState.getBlockForKey(key);\n        var customConfig = getCustomRenderConfig(child, blockRendererFn);\n        var Component = customConfig.CustomComponent || DraftEditorBlockNode;\n\n        var _getDraftRenderConfig = getDraftRenderConfig(child, blockRenderMap),\n            Element = _getDraftRenderConfig.Element,\n            wrapperTemplate = _getDraftRenderConfig.wrapperTemplate;\n\n        var elementProps = getElementPropsConfig(child, editorKey, offsetKey, blockStyleFn, customConfig, null);\n\n        var childProps = _objectSpread({}, _this2.props, {\n          tree: editorState.getBlockTree(key),\n          blockProps: customConfig.customProps,\n          offsetKey: offsetKey,\n          block: child\n        });\n\n        acc.push(React.createElement(Element, elementProps, React.createElement(Component, childProps)));\n\n        if (!wrapperTemplate || shouldNotAddWrapperElement(child, contentState)) {\n          return acc;\n        } // if we are here it means we are the last block\n        // that has a wrapperTemplate so we should wrap itself\n        // and all other previous siblings that share the same wrapper\n\n\n        applyWrapperElementToSiblings(wrapperTemplate, Element, acc);\n        return acc;\n      }, []);\n    }\n\n    var blockKey = block.getKey();\n    var offsetKey = DraftOffsetKey.encode(blockKey, 0, 0);\n    var customConfig = getCustomRenderConfig(block, blockRendererFn);\n    var Component = customConfig.CustomComponent;\n    var blockNode = Component != null ? React.createElement(Component, _extends({}, this.props, {\n      tree: editorState.getBlockTree(blockKey),\n      blockProps: customConfig.customProps,\n      offsetKey: offsetKey,\n      block: block\n    })) : React.createElement(DraftEditorNode, {\n      block: block,\n      children: children,\n      contentState: contentState,\n      customStyleFn: customStyleFn,\n      customStyleMap: customStyleMap,\n      decorator: decorator,\n      direction: direction,\n      forceSelection: forceSelection,\n      hasSelection: isBlockOnSelectionEdge(selection, blockKey),\n      selection: selection,\n      tree: tree\n    });\n\n    if (block.getParentKey()) {\n      return blockNode;\n    }\n\n    var _getDraftRenderConfig2 = getDraftRenderConfig(block, blockRenderMap),\n        Element = _getDraftRenderConfig2.Element;\n\n    var elementProps = getElementPropsConfig(block, editorKey, offsetKey, blockStyleFn, customConfig, this.wrapperRef); // root block nodes needs to be wrapped\n\n    return React.createElement(Element, elementProps, blockNode);\n  };\n\n  return DraftEditorBlockNode;\n}(React.Component);\n\nmodule.exports = DraftEditorBlockNode;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DOMObserver = require(\"./DOMObserver\");\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar DraftOffsetKey = require(\"./DraftOffsetKey\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar Keys = require(\"fbjs/lib/Keys\");\n\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nvar editOnSelect = require(\"./editOnSelect\");\n\nvar getContentEditableContainer = require(\"./getContentEditableContainer\");\n\nvar getDraftEditorSelection = require(\"./getDraftEditorSelection\");\n\nvar getEntityKeyForSelection = require(\"./getEntityKeyForSelection\");\n\nvar nullthrows = require(\"fbjs/lib/nullthrows\");\n\nvar isIE = UserAgent.isBrowser('IE');\n/**\n * Millisecond delay to allow `compositionstart` to fire again upon\n * `compositionend`.\n *\n * This is used for Korean input to ensure that typing can continue without\n * the editor trying to render too quickly. More specifically, Safari 7.1+\n * triggers `compositionstart` a little slower than Chrome/FF, which\n * leads to composed characters being resolved and re-render occurring\n * sooner than we want.\n */\n\nvar RESOLVE_DELAY = 20;\n/**\n * A handful of variables used to track the current composition and its\n * resolution status. These exist at the module level because it is not\n * possible to have compositions occurring in multiple editors simultaneously,\n * and it simplifies state management with respect to the DraftEditor component.\n */\n\nvar resolved = false;\nvar stillComposing = false;\nvar domObserver = null;\n\nfunction startDOMObserver(editor) {\n  if (!domObserver) {\n    domObserver = new DOMObserver(getContentEditableContainer(editor));\n    domObserver.start();\n  }\n}\n\nvar DraftEditorCompositionHandler = {\n  /**\n   * A `compositionstart` event has fired while we're still in composition\n   * mode. Continue the current composition session to prevent a re-render.\n   */\n  onCompositionStart: function onCompositionStart(editor) {\n    stillComposing = true;\n    startDOMObserver(editor);\n  },\n\n  /**\n   * Attempt to end the current composition session.\n   *\n   * Defer handling because browser will still insert the chars into active\n   * element after `compositionend`. If a `compositionstart` event fires\n   * before `resolveComposition` executes, our composition session will\n   * continue.\n   *\n   * The `resolved` flag is useful because certain IME interfaces fire the\n   * `compositionend` event multiple times, thus queueing up multiple attempts\n   * at handling the composition. Since handling the same composition event\n   * twice could break the DOM, we only use the first event. Example: Arabic\n   * Google Input Tools on Windows 8.1 fires `compositionend` three times.\n   */\n  onCompositionEnd: function onCompositionEnd(editor) {\n    resolved = false;\n    stillComposing = false;\n    setTimeout(function () {\n      if (!resolved) {\n        DraftEditorCompositionHandler.resolveComposition(editor);\n      }\n    }, RESOLVE_DELAY);\n  },\n  onSelect: editOnSelect,\n\n  /**\n   * In Safari, keydown events may fire when committing compositions. If\n   * the arrow keys are used to commit, prevent default so that the cursor\n   * doesn't move, otherwise it will jump back noticeably on re-render.\n   */\n  onKeyDown: function onKeyDown(editor, e) {\n    if (!stillComposing) {\n      // If a keydown event is received after compositionend but before the\n      // 20ms timer expires (ex: type option-E then backspace, or type A then\n      // backspace in 2-Set Korean), we should immediately resolve the\n      // composition and reinterpret the key press in edit mode.\n      DraftEditorCompositionHandler.resolveComposition(editor);\n\n      editor._onKeyDown(e);\n\n      return;\n    }\n\n    if (e.which === Keys.RIGHT || e.which === Keys.LEFT) {\n      e.preventDefault();\n    }\n  },\n\n  /**\n   * Keypress events may fire when committing compositions. In Firefox,\n   * pressing RETURN commits the composition and inserts extra newline\n   * characters that we do not want. `preventDefault` allows the composition\n   * to be committed while preventing the extra characters.\n   */\n  onKeyPress: function onKeyPress(_editor, e) {\n    if (e.which === Keys.RETURN) {\n      e.preventDefault();\n    }\n  },\n\n  /**\n   * Attempt to insert composed characters into the document.\n   *\n   * If we are still in a composition session, do nothing. Otherwise, insert\n   * the characters into the document and terminate the composition session.\n   *\n   * If no characters were composed -- for instance, the user\n   * deleted all composed characters and committed nothing new --\n   * force a re-render. We also re-render when the composition occurs\n   * at the beginning of a leaf, to ensure that if the browser has\n   * created a new text node for the composition, we will discard it.\n   *\n   * Resetting innerHTML will move focus to the beginning of the editor,\n   * so we update to force it back to the correct place.\n   */\n  resolveComposition: function resolveComposition(editor) {\n    if (stillComposing) {\n      return;\n    }\n\n    var mutations = nullthrows(domObserver).stopAndFlushMutations();\n    domObserver = null;\n    resolved = true;\n    var editorState = EditorState.set(editor._latestEditorState, {\n      inCompositionMode: false\n    });\n    editor.exitCurrentMode();\n\n    if (!mutations.size) {\n      editor.update(editorState);\n      return;\n    } // TODO, check if Facebook still needs this flag or if it could be removed.\n    // Since there can be multiple mutations providing a `composedChars` doesn't\n    // apply well on this new model.\n    // if (\n    //   gkx('draft_handlebeforeinput_composed_text') &&\n    //   editor.props.handleBeforeInput &&\n    //   isEventHandled(\n    //     editor.props.handleBeforeInput(\n    //       composedChars,\n    //       editorState,\n    //       event.timeStamp,\n    //     ),\n    //   )\n    // ) {\n    //   return;\n    // }\n\n\n    var contentState = editorState.getCurrentContent();\n    mutations.forEach(function (composedChars, offsetKey) {\n      var _DraftOffsetKey$decod = DraftOffsetKey.decode(offsetKey),\n          blockKey = _DraftOffsetKey$decod.blockKey,\n          decoratorKey = _DraftOffsetKey$decod.decoratorKey,\n          leafKey = _DraftOffsetKey$decod.leafKey;\n\n      var _editorState$getBlock = editorState.getBlockTree(blockKey).getIn([decoratorKey, 'leaves', leafKey]),\n          start = _editorState$getBlock.start,\n          end = _editorState$getBlock.end;\n\n      var replacementRange = editorState.getSelection().merge({\n        anchorKey: blockKey,\n        focusKey: blockKey,\n        anchorOffset: start,\n        focusOffset: end,\n        isBackward: false\n      });\n      var entityKey = getEntityKeyForSelection(contentState, replacementRange);\n      var currentStyle = contentState.getBlockForKey(blockKey).getInlineStyleAt(start);\n      contentState = DraftModifier.replaceText(contentState, replacementRange, composedChars, currentStyle, entityKey); // We need to update the editorState so the leaf node ranges are properly\n      // updated and multiple mutations are correctly applied.\n\n      editorState = EditorState.set(editorState, {\n        currentContent: contentState\n      });\n    }); // When we apply the text changes to the ContentState, the selection always\n    // goes to the end of the field, but it should just stay where it is\n    // after compositionEnd.\n\n    var documentSelection = getDraftEditorSelection(editorState, getContentEditableContainer(editor));\n    var compositionEndSelectionState = documentSelection.selectionState;\n    editor.restoreEditorDOM(); // See:\n    // - https://github.com/facebook/draft-js/issues/2093\n    // - https://github.com/facebook/draft-js/pull/2094\n    // Apply this fix only in IE for now. We can test it in\n    // other browsers in the future to ensure no regressions\n\n    var editorStateWithUpdatedSelection = isIE ? EditorState.forceSelection(editorState, compositionEndSelectionState) : EditorState.acceptSelection(editorState, compositionEndSelectionState);\n    editor.update(EditorState.push(editorStateWithUpdatedSelection, contentState, 'insert-characters'));\n  }\n};\nmodule.exports = DraftEditorCompositionHandler;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar _assign = require(\"object-assign\");\n\nfunction _extends() { _extends = _assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, 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 _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar DraftEditorBlock = require(\"./DraftEditorBlock.react\");\n\nvar DraftOffsetKey = require(\"./DraftOffsetKey\");\n\nvar React = require(\"react\");\n\nvar cx = require(\"fbjs/lib/cx\");\n\nvar joinClasses = require(\"fbjs/lib/joinClasses\");\n\nvar nullthrows = require(\"fbjs/lib/nullthrows\");\n\n/**\n * Provide default styling for list items. This way, lists will be styled with\n * proper counters and indentation even if the caller does not specify\n * their own styling at all. If more than five levels of nesting are needed,\n * the necessary CSS classes can be provided via `blockStyleFn` configuration.\n */\nvar getListItemClasses = function getListItemClasses(type, depth, shouldResetCount, direction) {\n  return cx({\n    'public/DraftStyleDefault/unorderedListItem': type === 'unordered-list-item',\n    'public/DraftStyleDefault/orderedListItem': type === 'ordered-list-item',\n    'public/DraftStyleDefault/reset': shouldResetCount,\n    'public/DraftStyleDefault/depth0': depth === 0,\n    'public/DraftStyleDefault/depth1': depth === 1,\n    'public/DraftStyleDefault/depth2': depth === 2,\n    'public/DraftStyleDefault/depth3': depth === 3,\n    'public/DraftStyleDefault/depth4': depth >= 4,\n    'public/DraftStyleDefault/listLTR': direction === 'LTR',\n    'public/DraftStyleDefault/listRTL': direction === 'RTL'\n  });\n};\n/**\n * `DraftEditorContents` is the container component for all block components\n * rendered for a `DraftEditor`. It is optimized to aggressively avoid\n * re-rendering blocks whenever possible.\n *\n * This component is separate from `DraftEditor` because certain props\n * (for instance, ARIA props) must be allowed to update without affecting\n * the contents of the editor.\n */\n\n\nvar DraftEditorContents = /*#__PURE__*/function (_React$Component) {\n  _inheritsLoose(DraftEditorContents, _React$Component);\n\n  function DraftEditorContents() {\n    return _React$Component.apply(this, arguments) || this;\n  }\n\n  var _proto = DraftEditorContents.prototype;\n\n  _proto.shouldComponentUpdate = function shouldComponentUpdate(nextProps) {\n    var prevEditorState = this.props.editorState;\n    var nextEditorState = nextProps.editorState;\n    var prevDirectionMap = prevEditorState.getDirectionMap();\n    var nextDirectionMap = nextEditorState.getDirectionMap(); // Text direction has changed for one or more blocks. We must re-render.\n\n    if (prevDirectionMap !== nextDirectionMap) {\n      return true;\n    }\n\n    var didHaveFocus = prevEditorState.getSelection().getHasFocus();\n    var nowHasFocus = nextEditorState.getSelection().getHasFocus();\n\n    if (didHaveFocus !== nowHasFocus) {\n      return true;\n    }\n\n    var nextNativeContent = nextEditorState.getNativelyRenderedContent();\n    var wasComposing = prevEditorState.isInCompositionMode();\n    var nowComposing = nextEditorState.isInCompositionMode(); // If the state is unchanged or we're currently rendering a natively\n    // rendered state, there's nothing new to be done.\n\n    if (prevEditorState === nextEditorState || nextNativeContent !== null && nextEditorState.getCurrentContent() === nextNativeContent || wasComposing && nowComposing) {\n      return false;\n    }\n\n    var prevContent = prevEditorState.getCurrentContent();\n    var nextContent = nextEditorState.getCurrentContent();\n    var prevDecorator = prevEditorState.getDecorator();\n    var nextDecorator = nextEditorState.getDecorator();\n    return wasComposing !== nowComposing || prevContent !== nextContent || prevDecorator !== nextDecorator || nextEditorState.mustForceSelection();\n  };\n\n  _proto.render = function render() {\n    var _this$props = this.props,\n        blockRenderMap = _this$props.blockRenderMap,\n        blockRendererFn = _this$props.blockRendererFn,\n        blockStyleFn = _this$props.blockStyleFn,\n        customStyleMap = _this$props.customStyleMap,\n        customStyleFn = _this$props.customStyleFn,\n        editorState = _this$props.editorState,\n        editorKey = _this$props.editorKey,\n        preventScroll = _this$props.preventScroll,\n        textDirectionality = _this$props.textDirectionality;\n    var content = editorState.getCurrentContent();\n    var selection = editorState.getSelection();\n    var forceSelection = editorState.mustForceSelection();\n    var decorator = editorState.getDecorator();\n    var directionMap = nullthrows(editorState.getDirectionMap());\n    var blocksAsArray = content.getBlocksAsArray();\n    var processedBlocks = [];\n    var currentDepth = null;\n    var lastWrapperTemplate = null;\n\n    for (var ii = 0; ii < blocksAsArray.length; ii++) {\n      var _block = blocksAsArray[ii];\n\n      var key = _block.getKey();\n\n      var blockType = _block.getType();\n\n      var customRenderer = blockRendererFn(_block);\n      var CustomComponent = void 0,\n          customProps = void 0,\n          customEditable = void 0;\n\n      if (customRenderer) {\n        CustomComponent = customRenderer.component;\n        customProps = customRenderer.props;\n        customEditable = customRenderer.editable;\n      }\n\n      var direction = textDirectionality ? textDirectionality : directionMap.get(key);\n      var offsetKey = DraftOffsetKey.encode(key, 0, 0);\n      var componentProps = {\n        contentState: content,\n        block: _block,\n        blockProps: customProps,\n        blockStyleFn: blockStyleFn,\n        customStyleMap: customStyleMap,\n        customStyleFn: customStyleFn,\n        decorator: decorator,\n        direction: direction,\n        forceSelection: forceSelection,\n        offsetKey: offsetKey,\n        preventScroll: preventScroll,\n        selection: selection,\n        tree: editorState.getBlockTree(key)\n      };\n      var configForType = blockRenderMap.get(blockType) || blockRenderMap.get('unstyled');\n      var wrapperTemplate = configForType.wrapper;\n      var Element = configForType.element || blockRenderMap.get('unstyled').element;\n\n      var depth = _block.getDepth();\n\n      var _className = '';\n\n      if (blockStyleFn) {\n        _className = blockStyleFn(_block);\n      } // List items are special snowflakes, since we handle nesting and\n      // counters manually.\n\n\n      if (Element === 'li') {\n        var shouldResetCount = lastWrapperTemplate !== wrapperTemplate || currentDepth === null || depth > currentDepth;\n        _className = joinClasses(_className, getListItemClasses(blockType, depth, shouldResetCount, direction));\n      }\n\n      var Component = CustomComponent || DraftEditorBlock;\n      var childProps = {\n        className: _className,\n        'data-block': true,\n        'data-editor': editorKey,\n        'data-offset-key': offsetKey,\n        key: key\n      };\n\n      if (customEditable !== undefined) {\n        childProps = _objectSpread({}, childProps, {\n          contentEditable: customEditable,\n          suppressContentEditableWarning: true\n        });\n      }\n\n      var child = React.createElement(Element, childProps,\n      /* $FlowFixMe[incompatible-type] (>=0.112.0 site=www,mobile) This\n       * comment suppresses an error found when Flow v0.112 was deployed. To\n       * see the error delete this comment and run Flow. */\n      React.createElement(Component, _extends({}, componentProps, {\n        key: key\n      })));\n      processedBlocks.push({\n        block: child,\n        wrapperTemplate: wrapperTemplate,\n        key: key,\n        offsetKey: offsetKey\n      });\n\n      if (wrapperTemplate) {\n        currentDepth = _block.getDepth();\n      } else {\n        currentDepth = null;\n      }\n\n      lastWrapperTemplate = wrapperTemplate;\n    } // Group contiguous runs of blocks that have the same wrapperTemplate\n\n\n    var outputBlocks = [];\n\n    for (var _ii = 0; _ii < processedBlocks.length;) {\n      var info = processedBlocks[_ii];\n\n      if (info.wrapperTemplate) {\n        var blocks = [];\n\n        do {\n          blocks.push(processedBlocks[_ii].block);\n          _ii++;\n        } while (_ii < processedBlocks.length && processedBlocks[_ii].wrapperTemplate === info.wrapperTemplate);\n\n        var wrapperElement = React.cloneElement(info.wrapperTemplate, {\n          key: info.key + '-wrap',\n          'data-offset-key': info.offsetKey\n        }, blocks);\n        outputBlocks.push(wrapperElement);\n      } else {\n        outputBlocks.push(info.block);\n        _ii++;\n      }\n    }\n\n    return React.createElement(\"div\", {\n      \"data-contents\": \"true\"\n    }, outputBlocks);\n  };\n\n  return DraftEditorContents;\n}(React.Component);\n\nmodule.exports = DraftEditorContents;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n */\n'use strict';\n\nvar gkx = require(\"./gkx\");\n\nvar experimentalTreeDataSupport = gkx('draft_tree_data_support');\nmodule.exports = experimentalTreeDataSupport ? require(\"./DraftEditorContentsExperimental.react\") : require(\"./DraftEditorContents-core.react\");","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n *\n * This file is a fork of DraftEditorContents.react.js for tree nodes\n *\n * This is unstable and not part of the public API and should not be used by\n * production systems. This file may be update/removed without notice.\n */\n'use strict';\n\nvar _assign = require(\"object-assign\");\n\nfunction _extends() { _extends = _assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar DraftEditorBlockNode = require(\"./DraftEditorBlockNode.react\");\n\nvar DraftOffsetKey = require(\"./DraftOffsetKey\");\n\nvar React = require(\"react\");\n\nvar nullthrows = require(\"fbjs/lib/nullthrows\");\n\n/**\n * `DraftEditorContents` is the container component for all block components\n * rendered for a `DraftEditor`. It is optimized to aggressively avoid\n * re-rendering blocks whenever possible.\n *\n * This component is separate from `DraftEditor` because certain props\n * (for instance, ARIA props) must be allowed to update without affecting\n * the contents of the editor.\n */\nvar DraftEditorContentsExperimental = /*#__PURE__*/function (_React$Component) {\n  _inheritsLoose(DraftEditorContentsExperimental, _React$Component);\n\n  function DraftEditorContentsExperimental() {\n    return _React$Component.apply(this, arguments) || this;\n  }\n\n  var _proto = DraftEditorContentsExperimental.prototype;\n\n  _proto.shouldComponentUpdate = function shouldComponentUpdate(nextProps) {\n    var prevEditorState = this.props.editorState;\n    var nextEditorState = nextProps.editorState;\n    var prevDirectionMap = prevEditorState.getDirectionMap();\n    var nextDirectionMap = nextEditorState.getDirectionMap(); // Text direction has changed for one or more blocks. We must re-render.\n\n    if (prevDirectionMap !== nextDirectionMap) {\n      return true;\n    }\n\n    var didHaveFocus = prevEditorState.getSelection().getHasFocus();\n    var nowHasFocus = nextEditorState.getSelection().getHasFocus();\n\n    if (didHaveFocus !== nowHasFocus) {\n      return true;\n    }\n\n    var nextNativeContent = nextEditorState.getNativelyRenderedContent();\n    var wasComposing = prevEditorState.isInCompositionMode();\n    var nowComposing = nextEditorState.isInCompositionMode(); // If the state is unchanged or we're currently rendering a natively\n    // rendered state, there's nothing new to be done.\n\n    if (prevEditorState === nextEditorState || nextNativeContent !== null && nextEditorState.getCurrentContent() === nextNativeContent || wasComposing && nowComposing) {\n      return false;\n    }\n\n    var prevContent = prevEditorState.getCurrentContent();\n    var nextContent = nextEditorState.getCurrentContent();\n    var prevDecorator = prevEditorState.getDecorator();\n    var nextDecorator = nextEditorState.getDecorator();\n    return wasComposing !== nowComposing || prevContent !== nextContent || prevDecorator !== nextDecorator || nextEditorState.mustForceSelection();\n  };\n\n  _proto.render = function render() {\n    var _this$props = this.props,\n        blockRenderMap = _this$props.blockRenderMap,\n        blockRendererFn = _this$props.blockRendererFn,\n        blockStyleFn = _this$props.blockStyleFn,\n        customStyleMap = _this$props.customStyleMap,\n        customStyleFn = _this$props.customStyleFn,\n        editorState = _this$props.editorState,\n        editorKey = _this$props.editorKey,\n        textDirectionality = _this$props.textDirectionality;\n    var content = editorState.getCurrentContent();\n    var selection = editorState.getSelection();\n    var forceSelection = editorState.mustForceSelection();\n    var decorator = editorState.getDecorator();\n    var directionMap = nullthrows(editorState.getDirectionMap());\n    var blocksAsArray = content.getBlocksAsArray();\n    var rootBlock = blocksAsArray[0];\n    var processedBlocks = [];\n    var nodeBlock = rootBlock;\n\n    while (nodeBlock) {\n      var blockKey = nodeBlock.getKey();\n      var blockProps = {\n        blockRenderMap: blockRenderMap,\n        blockRendererFn: blockRendererFn,\n        blockStyleFn: blockStyleFn,\n        contentState: content,\n        customStyleFn: customStyleFn,\n        customStyleMap: customStyleMap,\n        decorator: decorator,\n        editorKey: editorKey,\n        editorState: editorState,\n        forceSelection: forceSelection,\n        selection: selection,\n        block: nodeBlock,\n        direction: textDirectionality ? textDirectionality : directionMap.get(blockKey),\n        tree: editorState.getBlockTree(blockKey)\n      };\n      var configForType = blockRenderMap.get(nodeBlock.getType()) || blockRenderMap.get('unstyled');\n      var wrapperTemplate = configForType.wrapper;\n      processedBlocks.push({\n        /* $FlowFixMe[incompatible-type] (>=0.112.0 site=www,mobile) This\n         * comment suppresses an error found when Flow v0.112 was deployed. To\n         * see the error delete this comment and run Flow. */\n        block: React.createElement(DraftEditorBlockNode, _extends({\n          key: blockKey\n        }, blockProps)),\n        wrapperTemplate: wrapperTemplate,\n        key: blockKey,\n        offsetKey: DraftOffsetKey.encode(blockKey, 0, 0)\n      });\n      var nextBlockKey = nodeBlock.getNextSiblingKey();\n      nodeBlock = nextBlockKey ? content.getBlockForKey(nextBlockKey) : null;\n    } // Group contiguous runs of blocks that have the same wrapperTemplate\n\n\n    var outputBlocks = [];\n\n    for (var ii = 0; ii < processedBlocks.length;) {\n      var info = processedBlocks[ii];\n\n      if (info.wrapperTemplate) {\n        var blocks = [];\n\n        do {\n          blocks.push(processedBlocks[ii].block);\n          ii++;\n        } while (ii < processedBlocks.length && processedBlocks[ii].wrapperTemplate === info.wrapperTemplate);\n\n        var wrapperElement = React.cloneElement(info.wrapperTemplate, {\n          key: info.key + '-wrap',\n          'data-offset-key': info.offsetKey\n        }, blocks);\n        outputBlocks.push(wrapperElement);\n      } else {\n        outputBlocks.push(info.block);\n        ii++;\n      }\n    }\n\n    return React.createElement(\"div\", {\n      \"data-contents\": \"true\"\n    }, outputBlocks);\n  };\n\n  return DraftEditorContentsExperimental;\n}(React.Component);\n\nmodule.exports = DraftEditorContentsExperimental;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n *\n * This is unstable and not part of the public API and should not be used by\n * production systems. This file may be update/removed without notice.\n */\n'use strict';\n\nvar _assign = require(\"object-assign\");\n\nfunction _extends() { _extends = _assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar DraftOffsetKey = require(\"./DraftOffsetKey\");\n\nvar React = require(\"react\");\n\nvar UnicodeBidi = require(\"fbjs/lib/UnicodeBidi\");\n\nvar UnicodeBidiDirection = require(\"fbjs/lib/UnicodeBidiDirection\");\n\nvar DraftEditorDecoratedLeaves = /*#__PURE__*/function (_React$Component) {\n  _inheritsLoose(DraftEditorDecoratedLeaves, _React$Component);\n\n  function DraftEditorDecoratedLeaves() {\n    return _React$Component.apply(this, arguments) || this;\n  }\n\n  var _proto = DraftEditorDecoratedLeaves.prototype;\n\n  _proto.render = function render() {\n    var _this$props = this.props,\n        block = _this$props.block,\n        children = _this$props.children,\n        contentState = _this$props.contentState,\n        decorator = _this$props.decorator,\n        decoratorKey = _this$props.decoratorKey,\n        direction = _this$props.direction,\n        leafSet = _this$props.leafSet,\n        text = _this$props.text;\n    var blockKey = block.getKey();\n    var leavesForLeafSet = leafSet.get('leaves');\n    var DecoratorComponent = decorator.getComponentForKey(decoratorKey);\n    var decoratorProps = decorator.getPropsForKey(decoratorKey);\n    var decoratorOffsetKey = DraftOffsetKey.encode(blockKey, parseInt(decoratorKey, 10), 0);\n    var decoratedText = text.slice(leavesForLeafSet.first().get('start'), leavesForLeafSet.last().get('end')); // Resetting dir to the same value on a child node makes Chrome/Firefox\n    // confused on cursor movement. See http://jsfiddle.net/d157kLck/3/\n\n    var dir = UnicodeBidiDirection.getHTMLDirIfDifferent(UnicodeBidi.getDirection(decoratedText), direction);\n    return React.createElement(DecoratorComponent, _extends({}, decoratorProps, {\n      contentState: contentState,\n      decoratedText: decoratedText,\n      dir: dir,\n      key: decoratorOffsetKey,\n      entityKey: block.getEntityAt(leafSet.get('start')),\n      offsetKey: decoratorOffsetKey\n    }), children);\n  };\n\n  return DraftEditorDecoratedLeaves;\n}(React.Component);\n\nmodule.exports = DraftEditorDecoratedLeaves;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DataTransfer = require(\"fbjs/lib/DataTransfer\");\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar findAncestorOffsetKey = require(\"./findAncestorOffsetKey\");\n\nvar getCorrectDocumentFromNode = require(\"./getCorrectDocumentFromNode\");\n\nvar getTextContentFromFiles = require(\"./getTextContentFromFiles\");\n\nvar getUpdatedSelectionState = require(\"./getUpdatedSelectionState\");\n\nvar getWindowForNode = require(\"./getWindowForNode\");\n\nvar isEventHandled = require(\"./isEventHandled\");\n\nvar nullthrows = require(\"fbjs/lib/nullthrows\");\n/**\n * Get a SelectionState for the supplied mouse event.\n */\n\n\nfunction getSelectionForEvent(event, editorState) {\n  var node = null;\n  var offset = null;\n  var eventTargetDocument = getCorrectDocumentFromNode(event.currentTarget);\n  /* $FlowFixMe[prop-missing] (>=0.68.0 site=www,mobile) This comment\n   * suppresses an error found when Flow v0.68 was deployed. To see the error\n   * delete this comment and run Flow. */\n\n  if (typeof eventTargetDocument.caretRangeFromPoint === 'function') {\n    /* $FlowFixMe[incompatible-use] (>=0.68.0 site=www,mobile) This comment\n     * suppresses an error found when Flow v0.68 was deployed. To see the error\n     * delete this comment and run Flow. */\n    var dropRange = eventTargetDocument.caretRangeFromPoint(event.x, event.y);\n    node = dropRange.startContainer;\n    offset = dropRange.startOffset;\n  } else if (event.rangeParent) {\n    node = event.rangeParent;\n    offset = event.rangeOffset;\n  } else {\n    return null;\n  }\n\n  node = nullthrows(node);\n  offset = nullthrows(offset);\n  var offsetKey = nullthrows(findAncestorOffsetKey(node));\n  return getUpdatedSelectionState(editorState, offsetKey, offset, offsetKey, offset);\n}\n\nvar DraftEditorDragHandler = {\n  /**\n   * Drag originating from input terminated.\n   */\n  onDragEnd: function onDragEnd(editor) {\n    editor.exitCurrentMode();\n    endDrag(editor);\n  },\n\n  /**\n   * Handle data being dropped.\n   */\n  onDrop: function onDrop(editor, e) {\n    var data = new DataTransfer(e.nativeEvent.dataTransfer);\n    var editorState = editor._latestEditorState;\n    var dropSelection = getSelectionForEvent(e.nativeEvent, editorState);\n    e.preventDefault();\n    editor._dragCount = 0;\n    editor.exitCurrentMode();\n\n    if (dropSelection == null) {\n      return;\n    }\n\n    var files = data.getFiles();\n\n    if (files.length > 0) {\n      if (editor.props.handleDroppedFiles && isEventHandled(editor.props.handleDroppedFiles(dropSelection, files))) {\n        return;\n      }\n      /* $FlowFixMe[incompatible-call] This comment suppresses an error found\n       * DataTransfer was typed. getFiles() returns an array of <Files extends\n       * Blob>, not Blob */\n\n\n      getTextContentFromFiles(files, function (fileText) {\n        fileText && editor.update(insertTextAtSelection(editorState, dropSelection, fileText));\n      });\n      return;\n    }\n\n    var dragType = editor._internalDrag ? 'internal' : 'external';\n\n    if (editor.props.handleDrop && isEventHandled(editor.props.handleDrop(dropSelection, data, dragType))) {// handled\n    } else if (editor._internalDrag) {\n      editor.update(moveText(editorState, dropSelection));\n    } else {\n      editor.update(insertTextAtSelection(editorState, dropSelection, data.getText()));\n    }\n\n    endDrag(editor);\n  }\n};\n\nfunction endDrag(editor) {\n  editor._internalDrag = false; // Fix issue #1383\n  // Prior to React v16.5.0 onDrop breaks onSelect event:\n  // https://github.com/facebook/react/issues/11379.\n  // Dispatching a mouseup event on DOM node will make it go back to normal.\n\n  var editorNode = editor.editorContainer;\n\n  if (editorNode) {\n    var mouseUpEvent = new MouseEvent('mouseup', {\n      view: getWindowForNode(editorNode),\n      bubbles: true,\n      cancelable: true\n    });\n    editorNode.dispatchEvent(mouseUpEvent);\n  }\n}\n\nfunction moveText(editorState, targetSelection) {\n  var newContentState = DraftModifier.moveText(editorState.getCurrentContent(), editorState.getSelection(), targetSelection);\n  return EditorState.push(editorState, newContentState, 'insert-fragment');\n}\n/**\n * Insert text at a specified selection.\n */\n\n\nfunction insertTextAtSelection(editorState, selection, text) {\n  var newContentState = DraftModifier.insertText(editorState.getCurrentContent(), selection, text, editorState.getCurrentInlineStyle());\n  return EditorState.push(editorState, newContentState, 'insert-fragment');\n}\n\nmodule.exports = DraftEditorDragHandler;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nvar onBeforeInput = require(\"./editOnBeforeInput\");\n\nvar onBlur = require(\"./editOnBlur\");\n\nvar onCompositionStart = require(\"./editOnCompositionStart\");\n\nvar onCopy = require(\"./editOnCopy\");\n\nvar onCut = require(\"./editOnCut\");\n\nvar onDragOver = require(\"./editOnDragOver\");\n\nvar onDragStart = require(\"./editOnDragStart\");\n\nvar onFocus = require(\"./editOnFocus\");\n\nvar onInput = require(\"./editOnInput\");\n\nvar onKeyDown = require(\"./editOnKeyDown\");\n\nvar onPaste = require(\"./editOnPaste\");\n\nvar onSelect = require(\"./editOnSelect\");\n\nvar isChrome = UserAgent.isBrowser('Chrome');\nvar isFirefox = UserAgent.isBrowser('Firefox');\nvar selectionHandler = isChrome || isFirefox ? onSelect : function (e) {};\nvar DraftEditorEditHandler = {\n  onBeforeInput: onBeforeInput,\n  onBlur: onBlur,\n  onCompositionStart: onCompositionStart,\n  onCopy: onCopy,\n  onCut: onCut,\n  onDragOver: onDragOver,\n  onDragStart: onDragStart,\n  onFocus: onFocus,\n  onInput: onInput,\n  onKeyDown: onKeyDown,\n  onPaste: onPaste,\n  onSelect: onSelect,\n  // In certain cases, contenteditable on chrome does not fire the onSelect\n  // event, causing problems with cursor positioning. Therefore, the selection\n  // state update handler is added to more events to ensure that the selection\n  // state is always synced with the actual cursor positions.\n  onMouseUp: selectionHandler,\n  onKeyUp: selectionHandler\n};\nmodule.exports = DraftEditorEditHandler;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nvar ReactDOMComet = require(\"react-dom\");\n\nvar flushControlled = ReactDOMComet.unstable_flushControlled;\nmodule.exports = flushControlled;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar _assign = require(\"object-assign\");\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 _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\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\nvar DraftEditorTextNode = require(\"./DraftEditorTextNode.react\");\n\nvar React = require(\"react\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar isHTMLBRElement = require(\"./isHTMLBRElement\");\n\nvar setDraftEditorSelection = require(\"./setDraftEditorSelection\").setDraftEditorSelection;\n\n/**\n * All leaf nodes in the editor are spans with single text nodes. Leaf\n * elements are styled based on the merging of an optional custom style map\n * and a default style map.\n *\n * `DraftEditorLeaf` also provides a wrapper for calling into the imperative\n * DOM Selection API. In this way, top-level components can declaratively\n * maintain the selection state.\n */\nvar DraftEditorLeaf = /*#__PURE__*/function (_React$Component) {\n  _inheritsLoose(DraftEditorLeaf, _React$Component);\n\n  function DraftEditorLeaf() {\n    var _this;\n\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    _this = _React$Component.call.apply(_React$Component, [this].concat(args)) || this;\n\n    _defineProperty(_assertThisInitialized(_this), \"leaf\", void 0);\n\n    return _this;\n  }\n\n  var _proto = DraftEditorLeaf.prototype;\n\n  _proto._setSelection = function _setSelection() {\n    var selection = this.props.selection; // If selection state is irrelevant to the parent block, no-op.\n\n    if (selection == null || !selection.getHasFocus()) {\n      return;\n    }\n\n    var _this$props = this.props,\n        block = _this$props.block,\n        start = _this$props.start,\n        text = _this$props.text;\n    var blockKey = block.getKey();\n    var end = start + text.length;\n\n    if (!selection.hasEdgeWithin(blockKey, start, end)) {\n      return;\n    } // Determine the appropriate target node for selection. If the child\n    // is not a text node, it is a <br /> spacer. In this case, use the\n    // <span> itself as the selection target.\n\n\n    var node = this.leaf;\n    !node ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Missing node') : invariant(false) : void 0;\n    var child = node.firstChild;\n    !child ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Missing child') : invariant(false) : void 0;\n    var targetNode;\n\n    if (child.nodeType === Node.TEXT_NODE) {\n      targetNode = child;\n    } else if (isHTMLBRElement(child)) {\n      targetNode = node;\n    } else {\n      targetNode = child.firstChild;\n      !targetNode ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Missing targetNode') : invariant(false) : void 0;\n    }\n\n    setDraftEditorSelection(selection, targetNode, blockKey, start, end);\n  };\n\n  _proto.shouldComponentUpdate = function shouldComponentUpdate(nextProps) {\n    var leafNode = this.leaf;\n    !leafNode ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Missing leafNode') : invariant(false) : void 0;\n    var shouldUpdate = leafNode.textContent !== nextProps.text || nextProps.styleSet !== this.props.styleSet || nextProps.forceSelection;\n    return shouldUpdate;\n  };\n\n  _proto.componentDidUpdate = function componentDidUpdate() {\n    this._setSelection();\n  };\n\n  _proto.componentDidMount = function componentDidMount() {\n    this._setSelection();\n  };\n\n  _proto.render = function render() {\n    var _this2 = this;\n\n    var block = this.props.block;\n    var text = this.props.text; // If the leaf is at the end of its block and ends in a soft newline, append\n    // an extra line feed character. Browsers collapse trailing newline\n    // characters, which leaves the cursor in the wrong place after a\n    // shift+enter. The extra character repairs this.\n\n    if (text.endsWith('\\n') && this.props.isLast) {\n      text += '\\n';\n    }\n\n    var _this$props2 = this.props,\n        customStyleMap = _this$props2.customStyleMap,\n        customStyleFn = _this$props2.customStyleFn,\n        offsetKey = _this$props2.offsetKey,\n        styleSet = _this$props2.styleSet;\n    var styleObj = styleSet.reduce(function (map, styleName) {\n      var mergedStyles = {};\n      var style = customStyleMap[styleName];\n\n      if (style !== undefined && map.textDecoration !== style.textDecoration) {\n        // .trim() is necessary for IE9/10/11 and Edge\n        mergedStyles.textDecoration = [map.textDecoration, style.textDecoration].join(' ').trim();\n      }\n\n      return _assign(map, style, mergedStyles);\n    }, {});\n\n    if (customStyleFn) {\n      var newStyles = customStyleFn(styleSet, block);\n      styleObj = _assign(styleObj, newStyles);\n    }\n\n    return React.createElement(\"span\", {\n      \"data-offset-key\": offsetKey,\n      ref: function ref(_ref) {\n        return _this2.leaf = _ref;\n      },\n      style: styleObj\n    }, React.createElement(DraftEditorTextNode, null, text));\n  };\n\n  return DraftEditorLeaf;\n}(React.Component);\n\nmodule.exports = DraftEditorLeaf;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n *\n * This is unstable and not part of the public API and should not be used by\n * production systems. This file may be update/removed without notice.\n */\n'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar DraftEditorDecoratedLeaves = require(\"./DraftEditorDecoratedLeaves.react\");\n\nvar DraftEditorLeaf = require(\"./DraftEditorLeaf.react\");\n\nvar DraftOffsetKey = require(\"./DraftOffsetKey\");\n\nvar Immutable = require(\"immutable\");\n\nvar React = require(\"react\");\n\nvar cx = require(\"fbjs/lib/cx\");\n\nvar List = Immutable.List;\n\nvar DraftEditorNode = /*#__PURE__*/function (_React$Component) {\n  _inheritsLoose(DraftEditorNode, _React$Component);\n\n  function DraftEditorNode() {\n    return _React$Component.apply(this, arguments) || this;\n  }\n\n  var _proto = DraftEditorNode.prototype;\n\n  _proto.render = function render() {\n    var _this$props = this.props,\n        block = _this$props.block,\n        contentState = _this$props.contentState,\n        customStyleFn = _this$props.customStyleFn,\n        customStyleMap = _this$props.customStyleMap,\n        decorator = _this$props.decorator,\n        direction = _this$props.direction,\n        forceSelection = _this$props.forceSelection,\n        hasSelection = _this$props.hasSelection,\n        selection = _this$props.selection,\n        tree = _this$props.tree;\n    var blockKey = block.getKey();\n    var text = block.getText();\n    var lastLeafSet = tree.size - 1;\n    var children = this.props.children || tree.map(function (leafSet, ii) {\n      var decoratorKey = leafSet.get('decoratorKey');\n      var leavesForLeafSet = leafSet.get('leaves');\n      var lastLeaf = leavesForLeafSet.size - 1;\n      var Leaves = leavesForLeafSet.map(function (leaf, jj) {\n        var offsetKey = DraftOffsetKey.encode(blockKey, ii, jj);\n        var start = leaf.get('start');\n        var end = leaf.get('end');\n        return React.createElement(DraftEditorLeaf, {\n          key: offsetKey,\n          offsetKey: offsetKey,\n          block: block,\n          start: start,\n          selection: hasSelection ? selection : null,\n          forceSelection: forceSelection,\n          text: text.slice(start, end),\n          styleSet: block.getInlineStyleAt(start),\n          customStyleMap: customStyleMap,\n          customStyleFn: customStyleFn,\n          isLast: decoratorKey === lastLeafSet && jj === lastLeaf\n        });\n      }).toArray();\n\n      if (!decoratorKey || !decorator) {\n        return Leaves;\n      }\n\n      return React.createElement(DraftEditorDecoratedLeaves, {\n        block: block,\n        children: Leaves,\n        contentState: contentState,\n        decorator: decorator,\n        decoratorKey: decoratorKey,\n        direction: direction,\n        leafSet: leafSet,\n        text: text,\n        key: ii\n      });\n    }).toArray();\n    return React.createElement(\"div\", {\n      \"data-offset-key\": DraftOffsetKey.encode(blockKey, 0, 0),\n      className: cx({\n        'public/DraftStyleDefault/block': true,\n        'public/DraftStyleDefault/ltr': direction === 'LTR',\n        'public/DraftStyleDefault/rtl': direction === 'RTL'\n      })\n    }, children);\n  };\n\n  return DraftEditorNode;\n}(React.Component);\n\nmodule.exports = DraftEditorNode;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar React = require(\"react\");\n\nvar cx = require(\"fbjs/lib/cx\");\n\n/**\n * This component is responsible for rendering placeholder text for the\n * `DraftEditor` component.\n *\n * Override placeholder style via CSS.\n */\nvar DraftEditorPlaceholder = /*#__PURE__*/function (_React$Component) {\n  _inheritsLoose(DraftEditorPlaceholder, _React$Component);\n\n  function DraftEditorPlaceholder() {\n    return _React$Component.apply(this, arguments) || this;\n  }\n\n  var _proto = DraftEditorPlaceholder.prototype;\n\n  _proto.shouldComponentUpdate = function shouldComponentUpdate(nextProps) {\n    return this.props.text !== nextProps.text || this.props.editorState.getSelection().getHasFocus() !== nextProps.editorState.getSelection().getHasFocus();\n  };\n\n  _proto.render = function render() {\n    var hasFocus = this.props.editorState.getSelection().getHasFocus();\n    var className = cx({\n      'public/DraftEditorPlaceholder/root': true,\n      'public/DraftEditorPlaceholder/hasFocus': hasFocus\n    });\n    var contentStyle = {\n      whiteSpace: 'pre-wrap'\n    };\n    return React.createElement(\"div\", {\n      className: className\n    }, React.createElement(\"div\", {\n      className: cx('public/DraftEditorPlaceholder/inner'),\n      id: this.props.accessibilityID,\n      style: contentStyle\n    }, this.props.text));\n  };\n\n  return DraftEditorPlaceholder;\n}(React.Component);\n\nmodule.exports = DraftEditorPlaceholder;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\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 _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\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\nvar React = require(\"react\");\n\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar isElement = require(\"./isElement\"); // In IE, spans with <br> tags render as two newlines. By rendering a span\n// with only a newline character, we can be sure to render a single line.\n\n\nvar useNewlineChar = UserAgent.isBrowser('IE <= 11');\n/**\n * Check whether the node should be considered a newline.\n */\n\nfunction isNewline(node) {\n  return useNewlineChar ? node.textContent === '\\n' : node.tagName === 'BR';\n}\n/**\n * Placeholder elements for empty text content.\n *\n * What is this `data-text` attribute, anyway? It turns out that we need to\n * put an attribute on the lowest-level text node in order to preserve correct\n * spellcheck handling. If the <span> is naked, Chrome and Safari may do\n * bizarre things to do the DOM -- split text nodes, create extra spans, etc.\n * If the <span> has an attribute, this appears not to happen.\n * See http://jsfiddle.net/9khdavod/ for the failure case, and\n * http://jsfiddle.net/7pg143f7/ for the fixed case.\n */\n\n\nvar NEWLINE_A = function NEWLINE_A(ref) {\n  return useNewlineChar ? React.createElement(\"span\", {\n    key: \"A\",\n    \"data-text\": \"true\",\n    ref: ref\n  }, '\\n') : React.createElement(\"br\", {\n    key: \"A\",\n    \"data-text\": \"true\",\n    ref: ref\n  });\n};\n\nvar NEWLINE_B = function NEWLINE_B(ref) {\n  return useNewlineChar ? React.createElement(\"span\", {\n    key: \"B\",\n    \"data-text\": \"true\",\n    ref: ref\n  }, '\\n') : React.createElement(\"br\", {\n    key: \"B\",\n    \"data-text\": \"true\",\n    ref: ref\n  });\n};\n\n/**\n * The lowest-level component in a `DraftEditor`, the text node component\n * replaces the default React text node implementation. This allows us to\n * perform custom handling of newline behavior and avoid re-rendering text\n * nodes with DOM state that already matches the expectations of our immutable\n * editor state.\n */\nvar DraftEditorTextNode = /*#__PURE__*/function (_React$Component) {\n  _inheritsLoose(DraftEditorTextNode, _React$Component);\n\n  function DraftEditorTextNode(props) {\n    var _this;\n\n    _this = _React$Component.call(this, props) || this; // By flipping this flag, we also keep flipping keys which forces\n    // React to remount this node every time it rerenders.\n\n    _defineProperty(_assertThisInitialized(_this), \"_forceFlag\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this), \"_node\", void 0);\n\n    _this._forceFlag = false;\n    return _this;\n  }\n\n  var _proto = DraftEditorTextNode.prototype;\n\n  _proto.shouldComponentUpdate = function shouldComponentUpdate(nextProps) {\n    var node = this._node;\n    var shouldBeNewline = nextProps.children === '';\n    !isElement(node) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'node is not an Element') : invariant(false) : void 0;\n    var elementNode = node;\n\n    if (shouldBeNewline) {\n      return !isNewline(elementNode);\n    }\n\n    return elementNode.textContent !== nextProps.children;\n  };\n\n  _proto.componentDidMount = function componentDidMount() {\n    this._forceFlag = !this._forceFlag;\n  };\n\n  _proto.componentDidUpdate = function componentDidUpdate() {\n    this._forceFlag = !this._forceFlag;\n  };\n\n  _proto.render = function render() {\n    var _this2 = this;\n\n    if (this.props.children === '') {\n      return this._forceFlag ? NEWLINE_A(function (ref) {\n        return _this2._node = ref;\n      }) : NEWLINE_B(function (ref) {\n        return _this2._node = ref;\n      });\n    }\n\n    return React.createElement(\"span\", {\n      key: this._forceFlag ? 'A' : 'B',\n      \"data-text\": \"true\",\n      ref: function ref(_ref) {\n        return _this2._node = _ref;\n      }\n    }, this.props.children);\n  };\n\n  return DraftEditorTextNode;\n}(React.Component);\n\nmodule.exports = DraftEditorTextNode;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n'use strict';\n\nmodule.exports = {\n  initODS: function initODS() {},\n  handleExtensionCausedError: function handleExtensionCausedError() {}\n};","\"use strict\";\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, 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\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nvar DraftEntityInstance = require(\"./DraftEntityInstance\");\n\nvar Immutable = require(\"immutable\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar uuid = require(\"./uuid\");\n\nvar Map = Immutable.Map;\nvar instances = Map();\nvar instanceKey = uuid();\n/**\n * Temporary utility for generating the warnings\n */\n\nfunction logWarning(oldMethodCall, newMethodCall) {\n  console.warn('WARNING: ' + oldMethodCall + ' will be deprecated soon!\\nPlease use \"' + newMethodCall + '\" instead.');\n}\n\n/**\n * A \"document entity\" is an object containing metadata associated with a\n * piece of text in a ContentBlock.\n *\n * For example, a `link` entity might include a `uri` property. When a\n * ContentBlock is rendered in the browser, text that refers to that link\n * entity may be rendered as an anchor, with the `uri` as the href value.\n *\n * In a ContentBlock, every position in the text may correspond to zero\n * or one entities. This correspondence is tracked using a key string,\n * generated via DraftEntity.create() and used to obtain entity metadata\n * via DraftEntity.get().\n */\nvar DraftEntity = {\n  /**\n   * WARNING: This method will be deprecated soon!\n   * Please use 'contentState.getLastCreatedEntityKey' instead.\n   * ---\n   * Get the random key string from whatever entity was last created.\n   * We need this to support the new API, as part of transitioning to put Entity\n   * storage in contentState.\n   */\n  getLastCreatedEntityKey: function getLastCreatedEntityKey() {\n    logWarning('DraftEntity.getLastCreatedEntityKey', 'contentState.getLastCreatedEntityKey');\n    return DraftEntity.__getLastCreatedEntityKey();\n  },\n\n  /**\n   * WARNING: This method will be deprecated soon!\n   * Please use 'contentState.createEntity' instead.\n   * ---\n   * Create a DraftEntityInstance and store it for later retrieval.\n   *\n   * A random key string will be generated and returned. This key may\n   * be used to track the entity's usage in a ContentBlock, and for\n   * retrieving data about the entity at render time.\n   */\n  create: function create(type, mutability, data) {\n    logWarning('DraftEntity.create', 'contentState.createEntity');\n    return DraftEntity.__create(type, mutability, data);\n  },\n\n  /**\n   * WARNING: This method will be deprecated soon!\n   * Please use 'contentState.addEntity' instead.\n   * ---\n   * Add an existing DraftEntityInstance to the DraftEntity map. This is\n   * useful when restoring instances from the server.\n   */\n  add: function add(instance) {\n    logWarning('DraftEntity.add', 'contentState.addEntity');\n    return DraftEntity.__add(instance);\n  },\n\n  /**\n   * WARNING: This method will be deprecated soon!\n   * Please use 'contentState.getEntity' instead.\n   * ---\n   * Retrieve the entity corresponding to the supplied key string.\n   */\n  get: function get(key) {\n    logWarning('DraftEntity.get', 'contentState.getEntity');\n    return DraftEntity.__get(key);\n  },\n\n  /**\n   * Get all the entities in the content state.\n   */\n  __getAll: function __getAll() {\n    return instances;\n  },\n\n  /**\n   * Load the entity map with the given set of entities.\n   */\n  __loadWithEntities: function __loadWithEntities(entities) {\n    instances = entities;\n    instanceKey = uuid();\n  },\n\n  /**\n   * WARNING: This method will be deprecated soon!\n   * Please use 'contentState.mergeEntityData' instead.\n   * ---\n   * Entity instances are immutable. If you need to update the data for an\n   * instance, this method will merge your data updates and return a new\n   * instance.\n   */\n  mergeData: function mergeData(key, toMerge) {\n    logWarning('DraftEntity.mergeData', 'contentState.mergeEntityData');\n    return DraftEntity.__mergeData(key, toMerge);\n  },\n\n  /**\n   * WARNING: This method will be deprecated soon!\n   * Please use 'contentState.replaceEntityData' instead.\n   * ---\n   * Completely replace the data for a given instance.\n   */\n  replaceData: function replaceData(key, newData) {\n    logWarning('DraftEntity.replaceData', 'contentState.replaceEntityData');\n    return DraftEntity.__replaceData(key, newData);\n  },\n  // ***********************************WARNING******************************\n  // --- the above public API will be deprecated in the next version of Draft!\n  // The methods below this line are private - don't call them directly.\n\n  /**\n   * Get the random key string from whatever entity was last created.\n   * We need this to support the new API, as part of transitioning to put Entity\n   * storage in contentState.\n   */\n  __getLastCreatedEntityKey: function __getLastCreatedEntityKey() {\n    return instanceKey;\n  },\n\n  /**\n   * Create a DraftEntityInstance and store it for later retrieval.\n   *\n   * A random key string will be generated and returned. This key may\n   * be used to track the entity's usage in a ContentBlock, and for\n   * retrieving data about the entity at render time.\n   */\n  __create: function __create(type, mutability, data) {\n    return DraftEntity.__add(new DraftEntityInstance({\n      type: type,\n      mutability: mutability,\n      data: data || {}\n    }));\n  },\n\n  /**\n   * Add an existing DraftEntityInstance to the DraftEntity map. This is\n   * useful when restoring instances from the server.\n   */\n  __add: function __add(instance) {\n    instanceKey = uuid();\n    instances = instances.set(instanceKey, instance);\n    return instanceKey;\n  },\n\n  /**\n   * Retrieve the entity corresponding to the supplied key string.\n   */\n  __get: function __get(key) {\n    var instance = instances.get(key);\n    !!!instance ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Unknown DraftEntity key: %s.', key) : invariant(false) : void 0;\n    return instance;\n  },\n\n  /**\n   * Entity instances are immutable. If you need to update the data for an\n   * instance, this method will merge your data updates and return a new\n   * instance.\n   */\n  __mergeData: function __mergeData(key, toMerge) {\n    var instance = DraftEntity.__get(key);\n\n    var newData = _objectSpread({}, instance.getData(), toMerge);\n\n    var newInstance = instance.set('data', newData);\n    instances = instances.set(key, newInstance);\n    return newInstance;\n  },\n\n  /**\n   * Completely replace the data for a given instance.\n   */\n  __replaceData: function __replaceData(key, newData) {\n    var instance = DraftEntity.__get(key);\n\n    var newInstance = instance.set('data', newData);\n    instances = instances.set(key, newInstance);\n    return newInstance;\n  }\n};\nmodule.exports = DraftEntity;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @legacyServerCallableInstance\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar Immutable = require(\"immutable\");\n\nvar Record = Immutable.Record;\nvar DraftEntityInstanceRecord = Record({\n  type: 'TOKEN',\n  mutability: 'IMMUTABLE',\n  data: Object\n});\n/**\n * An instance of a document entity, consisting of a `type` and relevant\n * `data`, metadata about the entity.\n *\n * For instance, a \"link\" entity might provide a URI, and a \"mention\"\n * entity might provide the mentioned user's ID. These pieces of data\n * may be used when rendering the entity as part of a ContentBlock DOM\n * representation. For a link, the data would be used as an href for\n * the rendered anchor. For a mention, the ID could be used to retrieve\n * a hovercard.\n */\n\nvar DraftEntityInstance = /*#__PURE__*/function (_DraftEntityInstanceR) {\n  _inheritsLoose(DraftEntityInstance, _DraftEntityInstanceR);\n\n  function DraftEntityInstance() {\n    return _DraftEntityInstanceR.apply(this, arguments) || this;\n  }\n\n  var _proto = DraftEntityInstance.prototype;\n\n  _proto.getType = function getType() {\n    return this.get('type');\n  };\n\n  _proto.getMutability = function getMutability() {\n    return this.get('mutability');\n  };\n\n  _proto.getData = function getData() {\n    return this.get('data');\n  };\n\n  return DraftEntityInstance;\n}(DraftEntityInstanceRecord);\n\nmodule.exports = DraftEntityInstance;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\n/**\n * Identify the range to delete from a segmented entity.\n *\n * Rules:\n *\n *  Example: 'John F. Kennedy'\n *\n *   - Deletion from within any non-whitespace (i.e. ['John', 'F.', 'Kennedy'])\n *     will return the range of that text.\n *\n *       'John F. Kennedy' -> 'John F.'\n *                  ^\n *\n *   - Forward deletion of whitespace will remove the following section:\n *\n *       'John F. Kennedy' -> 'John Kennedy'\n *            ^\n *\n *   - Backward deletion of whitespace will remove the previous section:\n *\n *       'John F. Kennedy' -> 'F. Kennedy'\n *            ^\n */\nvar DraftEntitySegments = {\n  getRemovalRange: function getRemovalRange(selectionStart, selectionEnd, text, entityStart, direction) {\n    var segments = text.split(' ');\n    segments = segments.map(function (\n    /*string*/\n    segment,\n    /*number*/\n    ii) {\n      if (direction === 'forward') {\n        if (ii > 0) {\n          return ' ' + segment;\n        }\n      } else if (ii < segments.length - 1) {\n        return segment + ' ';\n      }\n\n      return segment;\n    });\n    var segmentStart = entityStart;\n    var segmentEnd;\n    var segment;\n    var removalStart = null;\n    var removalEnd = null;\n\n    for (var jj = 0; jj < segments.length; jj++) {\n      segment = segments[jj];\n      segmentEnd = segmentStart + segment.length; // Our selection overlaps this segment.\n\n      if (selectionStart < segmentEnd && segmentStart < selectionEnd) {\n        if (removalStart !== null) {\n          removalEnd = segmentEnd;\n        } else {\n          removalStart = segmentStart;\n          removalEnd = segmentEnd;\n        }\n      } else if (removalStart !== null) {\n        break;\n      }\n\n      segmentStart = segmentEnd;\n    }\n\n    var entityEnd = entityStart + text.length;\n    var atStart = removalStart === entityStart;\n    var atEnd = removalEnd === entityEnd;\n\n    if (!atStart && atEnd || atStart && !atEnd) {\n      if (direction === 'forward') {\n        if (removalEnd !== entityEnd) {\n          removalEnd++;\n        }\n      } else if (removalStart !== entityStart) {\n        removalStart--;\n      }\n    }\n\n    return {\n      start: removalStart,\n      end: removalEnd\n    };\n  }\n};\nmodule.exports = DraftEntitySegments;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n'use strict';\n\nmodule.exports = {\n  logBlockedSelectionEvent: function logBlockedSelectionEvent() {\n    return null;\n  },\n  logSelectionStateFailure: function logSelectionStateFailure() {\n    return null;\n  }\n};","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar CharacterMetadata = require(\"./CharacterMetadata\");\n\nvar ContentStateInlineStyle = require(\"./ContentStateInlineStyle\");\n\nvar applyEntityToContentState = require(\"./applyEntityToContentState\");\n\nvar getCharacterRemovalRange = require(\"./getCharacterRemovalRange\");\n\nvar getContentStateFragment = require(\"./getContentStateFragment\");\n\nvar Immutable = require(\"immutable\");\n\nvar insertFragmentIntoContentState = require(\"./insertFragmentIntoContentState\");\n\nvar insertTextIntoContentState = require(\"./insertTextIntoContentState\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar modifyBlockForContentState = require(\"./modifyBlockForContentState\");\n\nvar removeEntitiesAtEdges = require(\"./removeEntitiesAtEdges\");\n\nvar removeRangeFromContentState = require(\"./removeRangeFromContentState\");\n\nvar splitBlockInContentState = require(\"./splitBlockInContentState\");\n\nvar OrderedSet = Immutable.OrderedSet;\n/**\n * `DraftModifier` provides a set of convenience methods that apply\n * modifications to a `ContentState` object based on a target `SelectionState`.\n *\n * Any change to a `ContentState` should be decomposable into a series of\n * transaction functions that apply the required changes and return output\n * `ContentState` objects.\n *\n * These functions encapsulate some of the most common transaction sequences.\n */\n\nvar DraftModifier = {\n  replaceText: function replaceText(contentState, rangeToReplace, text, inlineStyle, entityKey) {\n    var withoutEntities = removeEntitiesAtEdges(contentState, rangeToReplace);\n    var withoutText = removeRangeFromContentState(withoutEntities, rangeToReplace);\n    var character = CharacterMetadata.create({\n      style: inlineStyle || OrderedSet(),\n      entity: entityKey || null\n    });\n    return insertTextIntoContentState(withoutText, withoutText.getSelectionAfter(), text, character);\n  },\n  insertText: function insertText(contentState, targetRange, text, inlineStyle, entityKey) {\n    !targetRange.isCollapsed() ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Target range must be collapsed for `insertText`.') : invariant(false) : void 0;\n    return DraftModifier.replaceText(contentState, targetRange, text, inlineStyle, entityKey);\n  },\n  moveText: function moveText(contentState, removalRange, targetRange) {\n    var movedFragment = getContentStateFragment(contentState, removalRange);\n    var afterRemoval = DraftModifier.removeRange(contentState, removalRange, 'backward');\n    return DraftModifier.replaceWithFragment(afterRemoval, targetRange, movedFragment);\n  },\n  replaceWithFragment: function replaceWithFragment(contentState, targetRange, fragment) {\n    var mergeBlockData = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 'REPLACE_WITH_NEW_DATA';\n    var withoutEntities = removeEntitiesAtEdges(contentState, targetRange);\n    var withoutText = removeRangeFromContentState(withoutEntities, targetRange);\n    return insertFragmentIntoContentState(withoutText, withoutText.getSelectionAfter(), fragment, mergeBlockData);\n  },\n  removeRange: function removeRange(contentState, rangeToRemove, removalDirection) {\n    var startKey, endKey, startBlock, endBlock;\n\n    if (rangeToRemove.getIsBackward()) {\n      rangeToRemove = rangeToRemove.merge({\n        anchorKey: rangeToRemove.getFocusKey(),\n        anchorOffset: rangeToRemove.getFocusOffset(),\n        focusKey: rangeToRemove.getAnchorKey(),\n        focusOffset: rangeToRemove.getAnchorOffset(),\n        isBackward: false\n      });\n    }\n\n    startKey = rangeToRemove.getAnchorKey();\n    endKey = rangeToRemove.getFocusKey();\n    startBlock = contentState.getBlockForKey(startKey);\n    endBlock = contentState.getBlockForKey(endKey);\n    var startOffset = rangeToRemove.getStartOffset();\n    var endOffset = rangeToRemove.getEndOffset();\n    var startEntityKey = startBlock.getEntityAt(startOffset);\n    var endEntityKey = endBlock.getEntityAt(endOffset - 1); // Check whether the selection state overlaps with a single entity.\n    // If so, try to remove the appropriate substring of the entity text.\n\n    if (startKey === endKey) {\n      if (startEntityKey && startEntityKey === endEntityKey) {\n        var adjustedRemovalRange = getCharacterRemovalRange(contentState.getEntityMap(), startBlock, endBlock, rangeToRemove, removalDirection);\n        return removeRangeFromContentState(contentState, adjustedRemovalRange);\n      }\n    }\n\n    var withoutEntities = removeEntitiesAtEdges(contentState, rangeToRemove);\n    return removeRangeFromContentState(withoutEntities, rangeToRemove);\n  },\n  splitBlock: function splitBlock(contentState, selectionState) {\n    var withoutEntities = removeEntitiesAtEdges(contentState, selectionState);\n    var withoutText = removeRangeFromContentState(withoutEntities, selectionState);\n    return splitBlockInContentState(withoutText, withoutText.getSelectionAfter());\n  },\n  applyInlineStyle: function applyInlineStyle(contentState, selectionState, inlineStyle) {\n    return ContentStateInlineStyle.add(contentState, selectionState, inlineStyle);\n  },\n  removeInlineStyle: function removeInlineStyle(contentState, selectionState, inlineStyle) {\n    return ContentStateInlineStyle.remove(contentState, selectionState, inlineStyle);\n  },\n  setBlockType: function setBlockType(contentState, selectionState, blockType) {\n    return modifyBlockForContentState(contentState, selectionState, function (block) {\n      return block.merge({\n        type: blockType,\n        depth: 0\n      });\n    });\n  },\n  setBlockData: function setBlockData(contentState, selectionState, blockData) {\n    return modifyBlockForContentState(contentState, selectionState, function (block) {\n      return block.merge({\n        data: blockData\n      });\n    });\n  },\n  mergeBlockData: function mergeBlockData(contentState, selectionState, blockData) {\n    return modifyBlockForContentState(contentState, selectionState, function (block) {\n      return block.merge({\n        data: block.getData().merge(blockData)\n      });\n    });\n  },\n  applyEntity: function applyEntity(contentState, selectionState, entityKey) {\n    var withoutEntities = removeEntitiesAtEdges(contentState, selectionState);\n    return applyEntityToContentState(withoutEntities, selectionState, entityKey);\n  }\n};\nmodule.exports = DraftModifier;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar KEY_DELIMITER = '-';\nvar DraftOffsetKey = {\n  encode: function encode(blockKey, decoratorKey, leafKey) {\n    return blockKey + KEY_DELIMITER + decoratorKey + KEY_DELIMITER + leafKey;\n  },\n  decode: function decode(offsetKey) {\n    // Extracts the last two parts of offsetKey and captures the rest in blockKeyParts\n    var _offsetKey$split$reve = offsetKey.split(KEY_DELIMITER).reverse(),\n        leafKey = _offsetKey$split$reve[0],\n        decoratorKey = _offsetKey$split$reve[1],\n        blockKeyParts = _offsetKey$split$reve.slice(2);\n\n    return {\n      // Recomposes the parts of blockKey after reversing them\n      blockKey: blockKeyParts.reverse().join(KEY_DELIMITER),\n      decoratorKey: parseInt(decoratorKey, 10),\n      leafKey: parseInt(leafKey, 10)\n    };\n  }\n};\nmodule.exports = DraftOffsetKey;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, 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\nvar ContentBlock = require(\"./ContentBlock\");\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar convertFromHTMLToContentBlocks = require(\"./convertFromHTMLToContentBlocks\");\n\nvar generateRandomKey = require(\"./generateRandomKey\");\n\nvar getSafeBodyFromHTML = require(\"./getSafeBodyFromHTML\");\n\nvar gkx = require(\"./gkx\");\n\nvar Immutable = require(\"immutable\");\n\nvar sanitizeDraftText = require(\"./sanitizeDraftText\");\n\nvar List = Immutable.List,\n    Repeat = Immutable.Repeat;\nvar experimentalTreeDataSupport = gkx('draft_tree_data_support');\nvar ContentBlockRecord = experimentalTreeDataSupport ? ContentBlockNode : ContentBlock;\nvar DraftPasteProcessor = {\n  processHTML: function processHTML(html, blockRenderMap) {\n    return convertFromHTMLToContentBlocks(html, getSafeBodyFromHTML, blockRenderMap);\n  },\n  processText: function processText(textBlocks, character, type) {\n    return textBlocks.reduce(function (acc, textLine, index) {\n      textLine = sanitizeDraftText(textLine);\n      var key = generateRandomKey();\n      var blockNodeConfig = {\n        key: key,\n        type: type,\n        text: textLine,\n        characterList: List(Repeat(character, textLine.length))\n      }; // next block updates previous block\n\n      if (experimentalTreeDataSupport && index !== 0) {\n        var prevSiblingIndex = index - 1; // update previous block\n\n        var previousBlock = acc[prevSiblingIndex] = acc[prevSiblingIndex].merge({\n          nextSibling: key\n        });\n        blockNodeConfig = _objectSpread({}, blockNodeConfig, {\n          prevSibling: previousBlock.getKey()\n        });\n      }\n\n      acc.push(new ContentBlockRecord(blockNodeConfig));\n      return acc;\n    }, []);\n  }\n};\nmodule.exports = DraftPasteProcessor;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar TokenizeUtil = require(\"fbjs/lib/TokenizeUtil\");\n\nvar punctuation = TokenizeUtil.getPunctuation(); // The apostrophe and curly single quotes behave in a curious way: when\n// surrounded on both sides by word characters, they behave as word chars; when\n// either neighbor is punctuation or an end of the string, they behave as\n// punctuation.\n\nvar CHAMELEON_CHARS = \"['\\u2018\\u2019]\"; // Remove the underscore, which should count as part of the removable word. The\n// \"chameleon chars\" also count as punctuation in this regex.\n\nvar WHITESPACE_AND_PUNCTUATION = '\\\\s|(?![_])' + punctuation;\nvar DELETE_STRING = '^' + '(?:' + WHITESPACE_AND_PUNCTUATION + ')*' + '(?:' + CHAMELEON_CHARS + '|(?!' + WHITESPACE_AND_PUNCTUATION + ').)*' + '(?:(?!' + WHITESPACE_AND_PUNCTUATION + ').)';\nvar DELETE_REGEX = new RegExp(DELETE_STRING);\nvar BACKSPACE_STRING = '(?:(?!' + WHITESPACE_AND_PUNCTUATION + ').)' + '(?:' + CHAMELEON_CHARS + '|(?!' + WHITESPACE_AND_PUNCTUATION + ').)*' + '(?:' + WHITESPACE_AND_PUNCTUATION + ')*' + '$';\nvar BACKSPACE_REGEX = new RegExp(BACKSPACE_STRING);\n\nfunction getRemovableWord(text, isBackward) {\n  var matches = isBackward ? BACKSPACE_REGEX.exec(text) : DELETE_REGEX.exec(text);\n  return matches ? matches[0] : text;\n}\n\nvar DraftRemovableWord = {\n  getBackward: function getBackward(text) {\n    return getRemovableWord(text, true);\n  },\n  getForward: function getForward(text) {\n    return getRemovableWord(text, false);\n  }\n};\nmodule.exports = DraftRemovableWord;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftStringKey = {\n  stringify: function stringify(key) {\n    return '_' + String(key);\n  },\n  unstringify: function unstringify(key) {\n    return key.slice(1);\n  }\n};\nmodule.exports = DraftStringKey;","\"use strict\";\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, 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\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n *\n * This is unstable and not part of the public API and should not be used by\n * production systems. This file may be update/removed without notice.\n */\nvar generateRandomKey = require(\"./generateRandomKey\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar traverseInDepthOrder = function traverseInDepthOrder(blocks, fn) {\n  var stack = [].concat(blocks).reverse();\n\n  while (stack.length) {\n    var _block = stack.pop();\n\n    fn(_block);\n    var children = _block.children;\n    !Array.isArray(children) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Invalid tree raw block') : invariant(false) : void 0;\n    stack = stack.concat([].concat(children.reverse()));\n  }\n};\n\nvar isListBlock = function isListBlock(block) {\n  if (!(block && block.type)) {\n    return false;\n  }\n\n  var type = block.type;\n  return type === 'unordered-list-item' || type === 'ordered-list-item';\n};\n\nvar addDepthToChildren = function addDepthToChildren(block) {\n  if (Array.isArray(block.children)) {\n    block.children = block.children.map(function (child) {\n      return child.type === block.type ? _objectSpread({}, child, {\n        depth: (block.depth || 0) + 1\n      }) : child;\n    });\n  }\n};\n/**\n * This adapter is intended to be be used as an adapter to draft tree data\n *\n * draft state <=====> draft tree state\n */\n\n\nvar DraftTreeAdapter = {\n  /**\n   * Converts from a tree raw state back to draft raw state\n   */\n  fromRawTreeStateToRawState: function fromRawTreeStateToRawState(draftTreeState) {\n    var blocks = draftTreeState.blocks;\n    var transformedBlocks = [];\n    !Array.isArray(blocks) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Invalid raw state') : invariant(false) : void 0;\n\n    if (!Array.isArray(blocks) || !blocks.length) {\n      return draftTreeState;\n    }\n\n    traverseInDepthOrder(blocks, function (block) {\n      var newBlock = _objectSpread({}, block);\n\n      if (isListBlock(block)) {\n        newBlock.depth = newBlock.depth || 0;\n        addDepthToChildren(block); // if it's a non-leaf node, we don't do anything else\n\n        if (block.children != null && block.children.length > 0) {\n          return;\n        }\n      }\n\n      delete newBlock.children;\n      transformedBlocks.push(newBlock);\n    });\n    draftTreeState.blocks = transformedBlocks;\n    return _objectSpread({}, draftTreeState, {\n      blocks: transformedBlocks\n    });\n  },\n\n  /**\n   * Converts from draft raw state to tree draft state\n   */\n  fromRawStateToRawTreeState: function fromRawStateToRawTreeState(draftState) {\n    var transformedBlocks = [];\n    var parentStack = [];\n    draftState.blocks.forEach(function (block) {\n      var isList = isListBlock(block);\n      var depth = block.depth || 0;\n\n      var treeBlock = _objectSpread({}, block, {\n        children: []\n      });\n\n      if (!isList) {\n        transformedBlocks.push(treeBlock);\n        return;\n      }\n\n      var lastParent = parentStack[0]; // block is non-nested & there are no nested blocks, directly push block\n\n      if (lastParent == null && depth === 0) {\n        transformedBlocks.push(treeBlock); // block is first nested block or previous nested block is at a lower level\n      } else if (lastParent == null || lastParent.depth < depth - 1) {\n        // create new parent block\n        var newParent = {\n          key: generateRandomKey(),\n          text: '',\n          depth: depth - 1,\n          type: block.type,\n          children: [],\n          entityRanges: [],\n          inlineStyleRanges: []\n        };\n        parentStack.unshift(newParent);\n\n        if (depth === 1) {\n          // add as a root-level block\n          transformedBlocks.push(newParent);\n        } else if (lastParent != null) {\n          // depth > 1 => also add as previous parent's child\n          lastParent.children.push(newParent);\n        }\n\n        newParent.children.push(treeBlock);\n      } else if (lastParent.depth === depth - 1) {\n        // add as child of last parent\n        lastParent.children.push(treeBlock);\n      } else {\n        // pop out parents at levels above this one from the parent stack\n        while (lastParent != null && lastParent.depth >= depth) {\n          parentStack.shift();\n          lastParent = parentStack[0];\n        }\n\n        if (depth > 0) {\n          lastParent.children.push(treeBlock);\n        } else {\n          transformedBlocks.push(treeBlock);\n        }\n      }\n    });\n    return _objectSpread({}, draftState, {\n      blocks: transformedBlocks\n    });\n  }\n};\nmodule.exports = DraftTreeAdapter;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n *\n * This is unstable and not part of the public API and should not be used by\n * production systems. This file may be update/removed without notice.\n */\nvar warning = require(\"fbjs/lib/warning\");\n\nvar DraftTreeInvariants = {\n  /**\n   * Check if the block is valid\n   */\n  isValidBlock: function isValidBlock(block, blockMap) {\n    var key = block.getKey(); // is its parent's child\n\n    var parentKey = block.getParentKey();\n\n    if (parentKey != null) {\n      var parent = blockMap.get(parentKey);\n\n      if (!parent.getChildKeys().includes(key)) {\n        process.env.NODE_ENV !== \"production\" ? warning(true, 'Tree is missing parent -> child pointer on %s', key) : void 0;\n        return false;\n      }\n    } // is its children's parent\n\n\n    var children = block.getChildKeys().map(function (k) {\n      return blockMap.get(k);\n    });\n\n    if (!children.every(function (c) {\n      return c.getParentKey() === key;\n    })) {\n      process.env.NODE_ENV !== \"production\" ? warning(true, 'Tree is missing child -> parent pointer on %s', key) : void 0;\n      return false;\n    } // is its previous sibling's next sibling\n\n\n    var prevSiblingKey = block.getPrevSiblingKey();\n\n    if (prevSiblingKey != null) {\n      var prevSibling = blockMap.get(prevSiblingKey);\n\n      if (prevSibling.getNextSiblingKey() !== key) {\n        process.env.NODE_ENV !== \"production\" ? warning(true, \"Tree is missing nextSibling pointer on %s's prevSibling\", key) : void 0;\n        return false;\n      }\n    } // is its next sibling's previous sibling\n\n\n    var nextSiblingKey = block.getNextSiblingKey();\n\n    if (nextSiblingKey != null) {\n      var nextSibling = blockMap.get(nextSiblingKey);\n\n      if (nextSibling.getPrevSiblingKey() !== key) {\n        process.env.NODE_ENV !== \"production\" ? warning(true, \"Tree is missing prevSibling pointer on %s's nextSibling\", key) : void 0;\n        return false;\n      }\n    } // no 2-node cycles\n\n\n    if (nextSiblingKey !== null && prevSiblingKey !== null) {\n      if (prevSiblingKey === nextSiblingKey) {\n        process.env.NODE_ENV !== \"production\" ? warning(true, 'Tree has a two-node cycle at %s', key) : void 0;\n        return false;\n      }\n    } // if it's a leaf node, it has text but no children\n\n\n    if (block.text != '') {\n      if (block.getChildKeys().size > 0) {\n        process.env.NODE_ENV !== \"production\" ? warning(true, 'Leaf node %s has children', key) : void 0;\n        return false;\n      }\n    }\n\n    return true;\n  },\n\n  /**\n   * Checks that this is a connected tree on all the blocks\n   * starting from the first block, traversing nextSibling and child pointers\n   * should be a tree (preorder traversal - parent, then children)\n   * num of connected node === number of blocks\n   */\n  isConnectedTree: function isConnectedTree(blockMap) {\n    // exactly one node has no previous sibling + no parent\n    var eligibleFirstNodes = blockMap.toArray().filter(function (block) {\n      return block.getParentKey() == null && block.getPrevSiblingKey() == null;\n    });\n\n    if (eligibleFirstNodes.length !== 1) {\n      process.env.NODE_ENV !== \"production\" ? warning(true, 'Tree is not connected. More or less than one first node') : void 0;\n      return false;\n    }\n\n    var firstNode = eligibleFirstNodes.shift();\n    var nodesSeen = 0;\n    var currentKey = firstNode.getKey();\n    var visitedStack = [];\n\n    while (currentKey != null) {\n      var currentNode = blockMap.get(currentKey);\n      var childKeys = currentNode.getChildKeys();\n      var nextSiblingKey = currentNode.getNextSiblingKey(); // if the node has children, add parent's next sibling to stack and go to children\n\n      if (childKeys.size > 0) {\n        if (nextSiblingKey != null) {\n          visitedStack.unshift(nextSiblingKey);\n        }\n\n        var children = childKeys.map(function (k) {\n          return blockMap.get(k);\n        });\n\n        var _firstNode = children.find(function (block) {\n          return block.getPrevSiblingKey() == null;\n        });\n\n        if (_firstNode == null) {\n          process.env.NODE_ENV !== \"production\" ? warning(true, '%s has no first child', currentKey) : void 0;\n          return false;\n        }\n\n        currentKey = _firstNode.getKey(); // TODO(T32490138): Deal with multi-node cycles here\n      } else {\n        if (currentNode.getNextSiblingKey() != null) {\n          currentKey = currentNode.getNextSiblingKey();\n        } else {\n          currentKey = visitedStack.shift();\n        }\n      }\n\n      nodesSeen++;\n    }\n\n    if (nodesSeen !== blockMap.size) {\n      process.env.NODE_ENV !== \"production\" ? warning(true, 'Tree is not connected. %s nodes were seen instead of %s', nodesSeen, blockMap.size) : void 0;\n      return false;\n    }\n\n    return true;\n  },\n\n  /**\n   * Checks that the block map is a connected tree with valid blocks\n   */\n  isValidTree: function isValidTree(blockMap) {\n    var _this = this;\n\n    var blocks = blockMap.toArray();\n\n    if (!blocks.every(function (block) {\n      return _this.isValidBlock(block, blockMap);\n    })) {\n      return false;\n    }\n\n    return this.isConnectedTree(blockMap);\n  }\n};\nmodule.exports = DraftTreeInvariants;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar UnicodeBidiService = require(\"fbjs/lib/UnicodeBidiService\");\n\nvar Immutable = require(\"immutable\");\n\nvar nullthrows = require(\"fbjs/lib/nullthrows\");\n\nvar OrderedMap = Immutable.OrderedMap;\nvar bidiService;\nvar EditorBidiService = {\n  getDirectionMap: function getDirectionMap(content, prevBidiMap) {\n    if (!bidiService) {\n      bidiService = new UnicodeBidiService();\n    } else {\n      bidiService.reset();\n    }\n\n    var blockMap = content.getBlockMap();\n    var nextBidi = blockMap.valueSeq().map(function (block) {\n      return nullthrows(bidiService).getDirection(block.getText());\n    });\n    var bidiMap = OrderedMap(blockMap.keySeq().zip(nextBidi));\n\n    if (prevBidiMap != null && Immutable.is(prevBidiMap, bidiMap)) {\n      return prevBidiMap;\n    }\n\n    return bidiMap;\n  }\n};\nmodule.exports = EditorBidiService;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, 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\nvar BlockTree = require(\"./BlockTree\");\n\nvar ContentState = require(\"./ContentState\");\n\nvar EditorBidiService = require(\"./EditorBidiService\");\n\nvar SelectionState = require(\"./SelectionState\");\n\nvar Immutable = require(\"immutable\");\n\nvar OrderedSet = Immutable.OrderedSet,\n    Record = Immutable.Record,\n    Stack = Immutable.Stack,\n    OrderedMap = Immutable.OrderedMap,\n    List = Immutable.List; // When configuring an editor, the user can chose to provide or not provide\n// basically all keys. `currentContent` varies, so this type doesn't include it.\n// (See the types defined below.)\n\nvar defaultRecord = {\n  allowUndo: true,\n  currentContent: null,\n  decorator: null,\n  directionMap: null,\n  forceSelection: false,\n  inCompositionMode: false,\n  inlineStyleOverride: null,\n  lastChangeType: null,\n  nativelyRenderedContent: null,\n  redoStack: Stack(),\n  selection: null,\n  treeMap: null,\n  undoStack: Stack()\n};\nvar EditorStateRecord = Record(defaultRecord);\n\nvar EditorState = /*#__PURE__*/function () {\n  EditorState.createEmpty = function createEmpty(decorator) {\n    return this.createWithText('', decorator);\n  };\n\n  EditorState.createWithText = function createWithText(text, decorator) {\n    return EditorState.createWithContent(ContentState.createFromText(text), decorator);\n  };\n\n  EditorState.createWithContent = function createWithContent(contentState, decorator) {\n    if (contentState.getBlockMap().count() === 0) {\n      return EditorState.createEmpty(decorator);\n    }\n\n    var firstKey = contentState.getBlockMap().first().getKey();\n    return EditorState.create({\n      currentContent: contentState,\n      undoStack: Stack(),\n      redoStack: Stack(),\n      decorator: decorator || null,\n      selection: SelectionState.createEmpty(firstKey)\n    });\n  };\n\n  EditorState.create = function create(config) {\n    var currentContent = config.currentContent,\n        decorator = config.decorator;\n\n    var recordConfig = _objectSpread({}, config, {\n      treeMap: generateNewTreeMap(currentContent, decorator),\n      directionMap: EditorBidiService.getDirectionMap(currentContent)\n    });\n\n    return new EditorState(new EditorStateRecord(recordConfig));\n  };\n\n  EditorState.fromJS = function fromJS(config) {\n    return new EditorState(new EditorStateRecord(_objectSpread({}, config, {\n      directionMap: config.directionMap != null ? OrderedMap(config.directionMap) : config.directionMap,\n      inlineStyleOverride: config.inlineStyleOverride != null ? OrderedSet(config.inlineStyleOverride) : config.inlineStyleOverride,\n      nativelyRenderedContent: config.nativelyRenderedContent != null ? ContentState.fromJS(config.nativelyRenderedContent) : config.nativelyRenderedContent,\n      redoStack: config.redoStack != null ? Stack(config.redoStack.map(function (v) {\n        return ContentState.fromJS(v);\n      })) : config.redoStack,\n      selection: config.selection != null ? new SelectionState(config.selection) : config.selection,\n      treeMap: config.treeMap != null ? OrderedMap(config.treeMap).map(function (v) {\n        return List(v).map(function (v) {\n          return BlockTree.fromJS(v);\n        });\n      }) : config.treeMap,\n      undoStack: config.undoStack != null ? Stack(config.undoStack.map(function (v) {\n        return ContentState.fromJS(v);\n      })) : config.undoStack,\n      currentContent: ContentState.fromJS(config.currentContent)\n    })));\n  };\n\n  EditorState.set = function set(editorState, put) {\n    var map = editorState.getImmutable().withMutations(function (state) {\n      var existingDecorator = state.get('decorator');\n      var decorator = existingDecorator;\n\n      if (put.decorator === null) {\n        decorator = null;\n      } else if (put.decorator) {\n        decorator = put.decorator;\n      }\n\n      var newContent = put.currentContent || editorState.getCurrentContent();\n\n      if (decorator !== existingDecorator) {\n        var treeMap = state.get('treeMap');\n        var newTreeMap;\n\n        if (decorator && existingDecorator) {\n          newTreeMap = regenerateTreeForNewDecorator(newContent, newContent.getBlockMap(), treeMap, decorator, existingDecorator);\n        } else {\n          newTreeMap = generateNewTreeMap(newContent, decorator);\n        }\n\n        state.merge({\n          decorator: decorator,\n          treeMap: newTreeMap,\n          nativelyRenderedContent: null\n        });\n        return;\n      }\n\n      var existingContent = editorState.getCurrentContent();\n\n      if (newContent !== existingContent) {\n        state.set('treeMap', regenerateTreeForNewBlocks(editorState, newContent.getBlockMap(), newContent.getEntityMap(), decorator));\n      }\n\n      state.merge(put);\n    });\n    return new EditorState(map);\n  };\n\n  var _proto = EditorState.prototype;\n\n  _proto.toJS = function toJS() {\n    return this.getImmutable().toJS();\n  };\n\n  _proto.getAllowUndo = function getAllowUndo() {\n    return this.getImmutable().get('allowUndo');\n  };\n\n  _proto.getCurrentContent = function getCurrentContent() {\n    return this.getImmutable().get('currentContent');\n  };\n\n  _proto.getUndoStack = function getUndoStack() {\n    return this.getImmutable().get('undoStack');\n  };\n\n  _proto.getRedoStack = function getRedoStack() {\n    return this.getImmutable().get('redoStack');\n  };\n\n  _proto.getSelection = function getSelection() {\n    return this.getImmutable().get('selection');\n  };\n\n  _proto.getDecorator = function getDecorator() {\n    return this.getImmutable().get('decorator');\n  };\n\n  _proto.isInCompositionMode = function isInCompositionMode() {\n    return this.getImmutable().get('inCompositionMode');\n  };\n\n  _proto.mustForceSelection = function mustForceSelection() {\n    return this.getImmutable().get('forceSelection');\n  };\n\n  _proto.getNativelyRenderedContent = function getNativelyRenderedContent() {\n    return this.getImmutable().get('nativelyRenderedContent');\n  };\n\n  _proto.getLastChangeType = function getLastChangeType() {\n    return this.getImmutable().get('lastChangeType');\n  }\n  /**\n   * While editing, the user may apply inline style commands with a collapsed\n   * cursor, intending to type text that adopts the specified style. In this\n   * case, we track the specified style as an \"override\" that takes precedence\n   * over the inline style of the text adjacent to the cursor.\n   *\n   * If null, there is no override in place.\n   */\n  ;\n\n  _proto.getInlineStyleOverride = function getInlineStyleOverride() {\n    return this.getImmutable().get('inlineStyleOverride');\n  };\n\n  EditorState.setInlineStyleOverride = function setInlineStyleOverride(editorState, inlineStyleOverride) {\n    return EditorState.set(editorState, {\n      inlineStyleOverride: inlineStyleOverride\n    });\n  }\n  /**\n   * Get the appropriate inline style for the editor state. If an\n   * override is in place, use it. Otherwise, the current style is\n   * based on the location of the selection state.\n   */\n  ;\n\n  _proto.getCurrentInlineStyle = function getCurrentInlineStyle() {\n    var override = this.getInlineStyleOverride();\n\n    if (override != null) {\n      return override;\n    }\n\n    var content = this.getCurrentContent();\n    var selection = this.getSelection();\n\n    if (selection.isCollapsed()) {\n      return getInlineStyleForCollapsedSelection(content, selection);\n    }\n\n    return getInlineStyleForNonCollapsedSelection(content, selection);\n  };\n\n  _proto.getBlockTree = function getBlockTree(blockKey) {\n    return this.getImmutable().getIn(['treeMap', blockKey]);\n  };\n\n  _proto.isSelectionAtStartOfContent = function isSelectionAtStartOfContent() {\n    var firstKey = this.getCurrentContent().getBlockMap().first().getKey();\n    return this.getSelection().hasEdgeWithin(firstKey, 0, 0);\n  };\n\n  _proto.isSelectionAtEndOfContent = function isSelectionAtEndOfContent() {\n    var content = this.getCurrentContent();\n    var blockMap = content.getBlockMap();\n    var last = blockMap.last();\n    var end = last.getLength();\n    return this.getSelection().hasEdgeWithin(last.getKey(), end, end);\n  };\n\n  _proto.getDirectionMap = function getDirectionMap() {\n    return this.getImmutable().get('directionMap');\n  }\n  /**\n   * Incorporate native DOM selection changes into the EditorState. This\n   * method can be used when we simply want to accept whatever the DOM\n   * has given us to represent selection, and we do not need to re-render\n   * the editor.\n   *\n   * To forcibly move the DOM selection, see `EditorState.forceSelection`.\n   */\n  ;\n\n  EditorState.acceptSelection = function acceptSelection(editorState, selection) {\n    return updateSelection(editorState, selection, false);\n  }\n  /**\n   * At times, we need to force the DOM selection to be where we\n   * need it to be. This can occur when the anchor or focus nodes\n   * are non-text nodes, for instance. In this case, we want to trigger\n   * a re-render of the editor, which in turn forces selection into\n   * the correct place in the DOM. The `forceSelection` method\n   * accomplishes this.\n   *\n   * This method should be used in cases where you need to explicitly\n   * move the DOM selection from one place to another without a change\n   * in ContentState.\n   */\n  ;\n\n  EditorState.forceSelection = function forceSelection(editorState, selection) {\n    if (!selection.getHasFocus()) {\n      selection = selection.set('hasFocus', true);\n    }\n\n    return updateSelection(editorState, selection, true);\n  }\n  /**\n   * Move selection to the end of the editor without forcing focus.\n   */\n  ;\n\n  EditorState.moveSelectionToEnd = function moveSelectionToEnd(editorState) {\n    var content = editorState.getCurrentContent();\n    var lastBlock = content.getLastBlock();\n    var lastKey = lastBlock.getKey();\n    var length = lastBlock.getLength();\n    return EditorState.acceptSelection(editorState, new SelectionState({\n      anchorKey: lastKey,\n      anchorOffset: length,\n      focusKey: lastKey,\n      focusOffset: length,\n      isBackward: false\n    }));\n  }\n  /**\n   * Force focus to the end of the editor. This is useful in scenarios\n   * where we want to programmatically focus the input and it makes sense\n   * to allow the user to continue working seamlessly.\n   */\n  ;\n\n  EditorState.moveFocusToEnd = function moveFocusToEnd(editorState) {\n    var afterSelectionMove = EditorState.moveSelectionToEnd(editorState);\n    return EditorState.forceSelection(afterSelectionMove, afterSelectionMove.getSelection());\n  }\n  /**\n   * Push the current ContentState onto the undo stack if it should be\n   * considered a boundary state, and set the provided ContentState as the\n   * new current content.\n   */\n  ;\n\n  EditorState.push = function push(editorState, contentState, changeType) {\n    var forceSelection = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;\n\n    if (editorState.getCurrentContent() === contentState) {\n      return editorState;\n    }\n\n    var directionMap = EditorBidiService.getDirectionMap(contentState, editorState.getDirectionMap());\n\n    if (!editorState.getAllowUndo()) {\n      return EditorState.set(editorState, {\n        currentContent: contentState,\n        directionMap: directionMap,\n        lastChangeType: changeType,\n        selection: contentState.getSelectionAfter(),\n        forceSelection: forceSelection,\n        inlineStyleOverride: null\n      });\n    }\n\n    var selection = editorState.getSelection();\n    var currentContent = editorState.getCurrentContent();\n    var undoStack = editorState.getUndoStack();\n    var newContent = contentState;\n\n    if (selection !== currentContent.getSelectionAfter() || mustBecomeBoundary(editorState, changeType)) {\n      undoStack = undoStack.push(currentContent);\n      newContent = newContent.set('selectionBefore', selection);\n    } else if (changeType === 'insert-characters' || changeType === 'backspace-character' || changeType === 'delete-character') {\n      // Preserve the previous selection.\n      newContent = newContent.set('selectionBefore', currentContent.getSelectionBefore());\n    }\n\n    var inlineStyleOverride = editorState.getInlineStyleOverride(); // Don't discard inline style overrides for the following change types:\n\n    var overrideChangeTypes = ['adjust-depth', 'change-block-type', 'split-block'];\n\n    if (overrideChangeTypes.indexOf(changeType) === -1) {\n      inlineStyleOverride = null;\n    }\n\n    var editorStateChanges = {\n      currentContent: newContent,\n      directionMap: directionMap,\n      undoStack: undoStack,\n      redoStack: Stack(),\n      lastChangeType: changeType,\n      selection: contentState.getSelectionAfter(),\n      forceSelection: forceSelection,\n      inlineStyleOverride: inlineStyleOverride\n    };\n    return EditorState.set(editorState, editorStateChanges);\n  }\n  /**\n   * Make the top ContentState in the undo stack the new current content and\n   * push the current content onto the redo stack.\n   */\n  ;\n\n  EditorState.undo = function undo(editorState) {\n    if (!editorState.getAllowUndo()) {\n      return editorState;\n    }\n\n    var undoStack = editorState.getUndoStack();\n    var newCurrentContent = undoStack.peek();\n\n    if (!newCurrentContent) {\n      return editorState;\n    }\n\n    var currentContent = editorState.getCurrentContent();\n    var directionMap = EditorBidiService.getDirectionMap(newCurrentContent, editorState.getDirectionMap());\n    return EditorState.set(editorState, {\n      currentContent: newCurrentContent,\n      directionMap: directionMap,\n      undoStack: undoStack.shift(),\n      redoStack: editorState.getRedoStack().push(currentContent),\n      forceSelection: true,\n      inlineStyleOverride: null,\n      lastChangeType: 'undo',\n      nativelyRenderedContent: null,\n      selection: currentContent.getSelectionBefore()\n    });\n  }\n  /**\n   * Make the top ContentState in the redo stack the new current content and\n   * push the current content onto the undo stack.\n   */\n  ;\n\n  EditorState.redo = function redo(editorState) {\n    if (!editorState.getAllowUndo()) {\n      return editorState;\n    }\n\n    var redoStack = editorState.getRedoStack();\n    var newCurrentContent = redoStack.peek();\n\n    if (!newCurrentContent) {\n      return editorState;\n    }\n\n    var currentContent = editorState.getCurrentContent();\n    var directionMap = EditorBidiService.getDirectionMap(newCurrentContent, editorState.getDirectionMap());\n    return EditorState.set(editorState, {\n      currentContent: newCurrentContent,\n      directionMap: directionMap,\n      undoStack: editorState.getUndoStack().push(currentContent),\n      redoStack: redoStack.shift(),\n      forceSelection: true,\n      inlineStyleOverride: null,\n      lastChangeType: 'redo',\n      nativelyRenderedContent: null,\n      selection: newCurrentContent.getSelectionAfter()\n    });\n  }\n  /**\n   * Not for public consumption.\n   */\n  ;\n\n  function EditorState(immutable) {\n    _defineProperty(this, \"_immutable\", void 0);\n\n    this._immutable = immutable;\n  }\n  /**\n   * Not for public consumption.\n   */\n\n\n  _proto.getImmutable = function getImmutable() {\n    return this._immutable;\n  };\n\n  return EditorState;\n}();\n/**\n * Set the supplied SelectionState as the new current selection, and set\n * the `force` flag to trigger manual selection placement by the view.\n */\n\n\nfunction updateSelection(editorState, selection, forceSelection) {\n  return EditorState.set(editorState, {\n    selection: selection,\n    forceSelection: forceSelection,\n    nativelyRenderedContent: null,\n    inlineStyleOverride: null\n  });\n}\n/**\n * Regenerate the entire tree map for a given ContentState and decorator.\n * Returns an OrderedMap that maps all available ContentBlock objects.\n */\n\n\nfunction generateNewTreeMap(contentState, decorator) {\n  return contentState.getBlockMap().map(function (block) {\n    return BlockTree.generate(contentState, block, decorator);\n  }).toOrderedMap();\n}\n/**\n * Regenerate tree map objects for all ContentBlocks that have changed\n * between the current editorState and newContent. Returns an OrderedMap\n * with only changed regenerated tree map objects.\n */\n\n\nfunction regenerateTreeForNewBlocks(editorState, newBlockMap, newEntityMap, decorator) {\n  var contentState = editorState.getCurrentContent().set('entityMap', newEntityMap);\n  var prevBlockMap = contentState.getBlockMap();\n  var prevTreeMap = editorState.getImmutable().get('treeMap');\n  return prevTreeMap.merge(newBlockMap.toSeq().filter(function (block, key) {\n    return block !== prevBlockMap.get(key);\n  }).map(function (block) {\n    return BlockTree.generate(contentState, block, decorator);\n  }));\n}\n/**\n * Generate tree map objects for a new decorator object, preserving any\n * decorations that are unchanged from the previous decorator.\n *\n * Note that in order for this to perform optimally, decoration Lists for\n * decorators should be preserved when possible to allow for direct immutable\n * List comparison.\n */\n\n\nfunction regenerateTreeForNewDecorator(content, blockMap, previousTreeMap, decorator, existingDecorator) {\n  return previousTreeMap.merge(blockMap.toSeq().filter(function (block) {\n    return decorator.getDecorations(block, content) !== existingDecorator.getDecorations(block, content);\n  }).map(function (block) {\n    return BlockTree.generate(content, block, decorator);\n  }));\n}\n/**\n * Return whether a change should be considered a boundary state, given\n * the previous change type. Allows us to discard potential boundary states\n * during standard typing or deletion behavior.\n */\n\n\nfunction mustBecomeBoundary(editorState, changeType) {\n  var lastChangeType = editorState.getLastChangeType();\n  return changeType !== lastChangeType || changeType !== 'insert-characters' && changeType !== 'backspace-character' && changeType !== 'delete-character';\n}\n\nfunction getInlineStyleForCollapsedSelection(content, selection) {\n  var startKey = selection.getStartKey();\n  var startOffset = selection.getStartOffset();\n  var startBlock = content.getBlockForKey(startKey); // If the cursor is not at the start of the block, look backward to\n  // preserve the style of the preceding character.\n\n  if (startOffset > 0) {\n    return startBlock.getInlineStyleAt(startOffset - 1);\n  } // The caret is at position zero in this block. If the block has any\n  // text at all, use the style of the first character.\n\n\n  if (startBlock.getLength()) {\n    return startBlock.getInlineStyleAt(0);\n  } // Otherwise, look upward in the document to find the closest character.\n\n\n  return lookUpwardForInlineStyle(content, startKey);\n}\n\nfunction getInlineStyleForNonCollapsedSelection(content, selection) {\n  var startKey = selection.getStartKey();\n  var startOffset = selection.getStartOffset();\n  var startBlock = content.getBlockForKey(startKey); // If there is a character just inside the selection, use its style.\n\n  if (startOffset < startBlock.getLength()) {\n    return startBlock.getInlineStyleAt(startOffset);\n  } // Check if the selection at the end of a non-empty block. Use the last\n  // style in the block.\n\n\n  if (startOffset > 0) {\n    return startBlock.getInlineStyleAt(startOffset - 1);\n  } // Otherwise, look upward in the document to find the closest character.\n\n\n  return lookUpwardForInlineStyle(content, startKey);\n}\n\nfunction lookUpwardForInlineStyle(content, fromKey) {\n  var lastNonEmpty = content.getBlockMap().reverse().skipUntil(function (_, k) {\n    return k === fromKey;\n  }).skip(1).skipUntil(function (block, _) {\n    return block.getLength();\n  }).first();\n\n  if (lastNonEmpty) {\n    return lastNonEmpty.getInlineStyleAt(lastNonEmpty.getLength() - 1);\n  }\n\n  return OrderedSet();\n}\n\nmodule.exports = EditorState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nvar isSoftNewlineEvent = require(\"./isSoftNewlineEvent\");\n\nvar isOSX = UserAgent.isPlatform('Mac OS X');\nvar KeyBindingUtil = {\n  /**\n   * Check whether the ctrlKey modifier is *not* being used in conjunction with\n   * the altKey modifier. If they are combined, the result is an `altGraph`\n   * key modifier, which should not be handled by this set of key bindings.\n   */\n  isCtrlKeyCommand: function isCtrlKeyCommand(e) {\n    return !!e.ctrlKey && !e.altKey;\n  },\n  isOptionKeyCommand: function isOptionKeyCommand(e) {\n    return isOSX && e.altKey;\n  },\n  usesMacOSHeuristics: function usesMacOSHeuristics() {\n    return isOSX;\n  },\n  hasCommandModifier: function hasCommandModifier(e) {\n    return isOSX ? !!e.metaKey && !e.altKey : KeyBindingUtil.isCtrlKeyCommand(e);\n  },\n  isSoftNewlineEvent: isSoftNewlineEvent\n};\nmodule.exports = KeyBindingUtil;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar adjustBlockDepthForContentState = require(\"./adjustBlockDepthForContentState\");\n\nvar nullthrows = require(\"fbjs/lib/nullthrows\");\n\nvar RichTextEditorUtil = {\n  currentBlockContainsLink: function currentBlockContainsLink(editorState) {\n    var selection = editorState.getSelection();\n    var contentState = editorState.getCurrentContent();\n    var entityMap = contentState.getEntityMap();\n    return contentState.getBlockForKey(selection.getAnchorKey()).getCharacterList().slice(selection.getStartOffset(), selection.getEndOffset()).some(function (v) {\n      var entity = v.getEntity();\n      return !!entity && entityMap.__get(entity).getType() === 'LINK';\n    });\n  },\n  getCurrentBlockType: function getCurrentBlockType(editorState) {\n    var selection = editorState.getSelection();\n    return editorState.getCurrentContent().getBlockForKey(selection.getStartKey()).getType();\n  },\n  getDataObjectForLinkURL: function getDataObjectForLinkURL(uri) {\n    return {\n      url: uri.toString()\n    };\n  },\n  handleKeyCommand: function handleKeyCommand(editorState, command, eventTimeStamp) {\n    switch (command) {\n      case 'bold':\n        return RichTextEditorUtil.toggleInlineStyle(editorState, 'BOLD');\n\n      case 'italic':\n        return RichTextEditorUtil.toggleInlineStyle(editorState, 'ITALIC');\n\n      case 'underline':\n        return RichTextEditorUtil.toggleInlineStyle(editorState, 'UNDERLINE');\n\n      case 'code':\n        return RichTextEditorUtil.toggleCode(editorState);\n\n      case 'backspace':\n      case 'backspace-word':\n      case 'backspace-to-start-of-line':\n        return RichTextEditorUtil.onBackspace(editorState);\n\n      case 'delete':\n      case 'delete-word':\n      case 'delete-to-end-of-block':\n        return RichTextEditorUtil.onDelete(editorState);\n\n      default:\n        // they may have custom editor commands; ignore those\n        return null;\n    }\n  },\n  insertSoftNewline: function insertSoftNewline(editorState) {\n    var contentState = DraftModifier.insertText(editorState.getCurrentContent(), editorState.getSelection(), '\\n', editorState.getCurrentInlineStyle(), null);\n    var newEditorState = EditorState.push(editorState, contentState, 'insert-characters');\n    return EditorState.forceSelection(newEditorState, contentState.getSelectionAfter());\n  },\n\n  /**\n   * For collapsed selections at the start of styled blocks, backspace should\n   * just remove the existing style.\n   */\n  onBackspace: function onBackspace(editorState) {\n    var selection = editorState.getSelection();\n\n    if (!selection.isCollapsed() || selection.getAnchorOffset() || selection.getFocusOffset()) {\n      return null;\n    } // First, try to remove a preceding atomic block.\n\n\n    var content = editorState.getCurrentContent();\n    var startKey = selection.getStartKey();\n    var blockBefore = content.getBlockBefore(startKey);\n\n    if (blockBefore && blockBefore.getType() === 'atomic') {\n      var blockMap = content.getBlockMap()[\"delete\"](blockBefore.getKey());\n      var withoutAtomicBlock = content.merge({\n        blockMap: blockMap,\n        selectionAfter: selection\n      });\n\n      if (withoutAtomicBlock !== content) {\n        return EditorState.push(editorState, withoutAtomicBlock, 'remove-range');\n      }\n    } // If that doesn't succeed, try to remove the current block style.\n\n\n    var withoutBlockStyle = RichTextEditorUtil.tryToRemoveBlockStyle(editorState);\n\n    if (withoutBlockStyle) {\n      return EditorState.push(editorState, withoutBlockStyle, 'change-block-type');\n    }\n\n    return null;\n  },\n  onDelete: function onDelete(editorState) {\n    var selection = editorState.getSelection();\n\n    if (!selection.isCollapsed()) {\n      return null;\n    }\n\n    var content = editorState.getCurrentContent();\n    var startKey = selection.getStartKey();\n    var block = content.getBlockForKey(startKey);\n    var length = block.getLength(); // The cursor is somewhere within the text. Behave normally.\n\n    if (selection.getStartOffset() < length) {\n      return null;\n    }\n\n    var blockAfter = content.getBlockAfter(startKey);\n\n    if (!blockAfter || blockAfter.getType() !== 'atomic') {\n      return null;\n    }\n\n    var atomicBlockTarget = selection.merge({\n      focusKey: blockAfter.getKey(),\n      focusOffset: blockAfter.getLength()\n    });\n    var withoutAtomicBlock = DraftModifier.removeRange(content, atomicBlockTarget, 'forward');\n\n    if (withoutAtomicBlock !== content) {\n      return EditorState.push(editorState, withoutAtomicBlock, 'remove-range');\n    }\n\n    return null;\n  },\n  onTab: function onTab(event, editorState, maxDepth) {\n    var selection = editorState.getSelection();\n    var key = selection.getAnchorKey();\n\n    if (key !== selection.getFocusKey()) {\n      return editorState;\n    }\n\n    var content = editorState.getCurrentContent();\n    var block = content.getBlockForKey(key);\n    var type = block.getType();\n\n    if (type !== 'unordered-list-item' && type !== 'ordered-list-item') {\n      return editorState;\n    }\n\n    event.preventDefault();\n    var depth = block.getDepth();\n\n    if (!event.shiftKey && depth === maxDepth) {\n      return editorState;\n    }\n\n    var withAdjustment = adjustBlockDepthForContentState(content, selection, event.shiftKey ? -1 : 1, maxDepth);\n    return EditorState.push(editorState, withAdjustment, 'adjust-depth');\n  },\n  toggleBlockType: function toggleBlockType(editorState, blockType) {\n    var selection = editorState.getSelection();\n    var startKey = selection.getStartKey();\n    var endKey = selection.getEndKey();\n    var content = editorState.getCurrentContent();\n    var target = selection; // Triple-click can lead to a selection that includes offset 0 of the\n    // following block. The `SelectionState` for this case is accurate, but\n    // we should avoid toggling block type for the trailing block because it\n    // is a confusing interaction.\n\n    if (startKey !== endKey && selection.getEndOffset() === 0) {\n      var blockBefore = nullthrows(content.getBlockBefore(endKey));\n      endKey = blockBefore.getKey();\n      target = target.merge({\n        anchorKey: startKey,\n        anchorOffset: selection.getStartOffset(),\n        focusKey: endKey,\n        focusOffset: blockBefore.getLength(),\n        isBackward: false\n      });\n    }\n\n    var hasAtomicBlock = content.getBlockMap().skipWhile(function (_, k) {\n      return k !== startKey;\n    }).reverse().skipWhile(function (_, k) {\n      return k !== endKey;\n    }).some(function (v) {\n      return v.getType() === 'atomic';\n    });\n\n    if (hasAtomicBlock) {\n      return editorState;\n    }\n\n    var typeToSet = content.getBlockForKey(startKey).getType() === blockType ? 'unstyled' : blockType;\n    return EditorState.push(editorState, DraftModifier.setBlockType(content, target, typeToSet), 'change-block-type');\n  },\n  toggleCode: function toggleCode(editorState) {\n    var selection = editorState.getSelection();\n    var anchorKey = selection.getAnchorKey();\n    var focusKey = selection.getFocusKey();\n\n    if (selection.isCollapsed() || anchorKey !== focusKey) {\n      return RichTextEditorUtil.toggleBlockType(editorState, 'code-block');\n    }\n\n    return RichTextEditorUtil.toggleInlineStyle(editorState, 'CODE');\n  },\n\n  /**\n   * Toggle the specified inline style for the selection. If the\n   * user's selection is collapsed, apply or remove the style for the\n   * internal state. If it is not collapsed, apply the change directly\n   * to the document state.\n   */\n  toggleInlineStyle: function toggleInlineStyle(editorState, inlineStyle) {\n    var selection = editorState.getSelection();\n    var currentStyle = editorState.getCurrentInlineStyle(); // If the selection is collapsed, toggle the specified style on or off and\n    // set the result as the new inline style override. This will then be\n    // used as the inline style for the next character to be inserted.\n\n    if (selection.isCollapsed()) {\n      return EditorState.setInlineStyleOverride(editorState, currentStyle.has(inlineStyle) ? currentStyle.remove(inlineStyle) : currentStyle.add(inlineStyle));\n    } // If characters are selected, immediately apply or remove the\n    // inline style on the document state itself.\n\n\n    var content = editorState.getCurrentContent();\n    var newContent; // If the style is already present for the selection range, remove it.\n    // Otherwise, apply it.\n\n    if (currentStyle.has(inlineStyle)) {\n      newContent = DraftModifier.removeInlineStyle(content, selection, inlineStyle);\n    } else {\n      newContent = DraftModifier.applyInlineStyle(content, selection, inlineStyle);\n    }\n\n    return EditorState.push(editorState, newContent, 'change-inline-style');\n  },\n  toggleLink: function toggleLink(editorState, targetSelection, entityKey) {\n    var withoutLink = DraftModifier.applyEntity(editorState.getCurrentContent(), targetSelection, entityKey);\n    return EditorState.push(editorState, withoutLink, 'apply-entity');\n  },\n\n  /**\n   * When a collapsed cursor is at the start of a styled block, changes block\n   * type to 'unstyled'. Returns null if selection does not meet that criteria.\n   */\n  tryToRemoveBlockStyle: function tryToRemoveBlockStyle(editorState) {\n    var selection = editorState.getSelection();\n    var offset = selection.getAnchorOffset();\n\n    if (selection.isCollapsed() && offset === 0) {\n      var key = selection.getAnchorKey();\n      var content = editorState.getCurrentContent();\n      var block = content.getBlockForKey(key);\n      var type = block.getType();\n      var blockBefore = content.getBlockBefore(key);\n\n      if (type === 'code-block' && blockBefore && blockBefore.getType() === 'code-block' && blockBefore.getLength() !== 0) {\n        return null;\n      }\n\n      if (type !== 'unstyled') {\n        return DraftModifier.setBlockType(content, selection, 'unstyled');\n      }\n    }\n\n    return null;\n  }\n};\nmodule.exports = RichTextEditorUtil;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar getContentStateFragment = require(\"./getContentStateFragment\");\n\nvar nullthrows = require(\"fbjs/lib/nullthrows\");\n\nvar clipboard = null;\n/**\n * Some systems offer a \"secondary\" clipboard to allow quick internal cut\n * and paste behavior. For instance, Ctrl+K (cut) and Ctrl+Y (paste).\n */\n\nvar SecondaryClipboard = {\n  cut: function cut(editorState) {\n    var content = editorState.getCurrentContent();\n    var selection = editorState.getSelection();\n    var targetRange = null;\n\n    if (selection.isCollapsed()) {\n      var anchorKey = selection.getAnchorKey();\n      var blockEnd = content.getBlockForKey(anchorKey).getLength();\n\n      if (blockEnd === selection.getAnchorOffset()) {\n        var keyAfter = content.getKeyAfter(anchorKey);\n\n        if (keyAfter == null) {\n          return editorState;\n        }\n\n        targetRange = selection.set('focusKey', keyAfter).set('focusOffset', 0);\n      } else {\n        targetRange = selection.set('focusOffset', blockEnd);\n      }\n    } else {\n      targetRange = selection;\n    }\n\n    targetRange = nullthrows(targetRange); // TODO: This should actually append to the current state when doing\n    // successive ^K commands without any other cursor movement\n\n    clipboard = getContentStateFragment(content, targetRange);\n    var afterRemoval = DraftModifier.removeRange(content, targetRange, 'forward');\n\n    if (afterRemoval === content) {\n      return editorState;\n    }\n\n    return EditorState.push(editorState, afterRemoval, 'remove-range');\n  },\n  paste: function paste(editorState) {\n    if (!clipboard) {\n      return editorState;\n    }\n\n    var newContent = DraftModifier.replaceWithFragment(editorState.getCurrentContent(), editorState.getSelection(), clipboard);\n    return EditorState.push(editorState, newContent, 'insert-fragment');\n  }\n};\nmodule.exports = SecondaryClipboard;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar Immutable = require(\"immutable\");\n\nvar Record = Immutable.Record;\nvar defaultRecord = {\n  anchorKey: '',\n  anchorOffset: 0,\n  focusKey: '',\n  focusOffset: 0,\n  isBackward: false,\n  hasFocus: false\n};\n/* $FlowFixMe[unclear-type] This comment suppresses an error found when\n * automatically adding a type annotation with the codemod Komodo/Annotate_\n * exports. To see the error delete this comment and run Flow. */\n\nvar SelectionStateRecord = Record(defaultRecord);\n\nvar SelectionState = /*#__PURE__*/function (_SelectionStateRecord) {\n  _inheritsLoose(SelectionState, _SelectionStateRecord);\n\n  function SelectionState() {\n    return _SelectionStateRecord.apply(this, arguments) || this;\n  }\n\n  var _proto = SelectionState.prototype;\n\n  _proto.serialize = function serialize() {\n    return 'Anchor: ' + this.getAnchorKey() + ':' + this.getAnchorOffset() + ', ' + 'Focus: ' + this.getFocusKey() + ':' + this.getFocusOffset() + ', ' + 'Is Backward: ' + String(this.getIsBackward()) + ', ' + 'Has Focus: ' + String(this.getHasFocus());\n  };\n\n  _proto.getAnchorKey = function getAnchorKey() {\n    return this.get('anchorKey');\n  };\n\n  _proto.getAnchorOffset = function getAnchorOffset() {\n    return this.get('anchorOffset');\n  };\n\n  _proto.getFocusKey = function getFocusKey() {\n    return this.get('focusKey');\n  };\n\n  _proto.getFocusOffset = function getFocusOffset() {\n    return this.get('focusOffset');\n  };\n\n  _proto.getIsBackward = function getIsBackward() {\n    return this.get('isBackward');\n  };\n\n  _proto.getHasFocus = function getHasFocus() {\n    return this.get('hasFocus');\n  }\n  /**\n   * Return whether the specified range overlaps with an edge of the\n   * SelectionState.\n   */\n  ;\n\n  _proto.hasEdgeWithin = function hasEdgeWithin(blockKey, start, end) {\n    var anchorKey = this.getAnchorKey();\n    var focusKey = this.getFocusKey();\n\n    if (anchorKey === focusKey && anchorKey === blockKey) {\n      var selectionStart = this.getStartOffset();\n      var selectionEnd = this.getEndOffset();\n      return start <= selectionStart && selectionStart <= end || // selectionStart is between start and end, or\n      start <= selectionEnd && selectionEnd <= end // selectionEnd is between start and end\n      ;\n    }\n\n    if (blockKey !== anchorKey && blockKey !== focusKey) {\n      return false;\n    }\n\n    var offsetToCheck = blockKey === anchorKey ? this.getAnchorOffset() : this.getFocusOffset();\n    return start <= offsetToCheck && end >= offsetToCheck;\n  };\n\n  _proto.isCollapsed = function isCollapsed() {\n    return this.getAnchorKey() === this.getFocusKey() && this.getAnchorOffset() === this.getFocusOffset();\n  };\n\n  _proto.getStartKey = function getStartKey() {\n    return this.getIsBackward() ? this.getFocusKey() : this.getAnchorKey();\n  };\n\n  _proto.getStartOffset = function getStartOffset() {\n    return this.getIsBackward() ? this.getFocusOffset() : this.getAnchorOffset();\n  };\n\n  _proto.getEndKey = function getEndKey() {\n    return this.getIsBackward() ? this.getAnchorKey() : this.getFocusKey();\n  };\n\n  _proto.getEndOffset = function getEndOffset() {\n    return this.getIsBackward() ? this.getAnchorOffset() : this.getFocusOffset();\n  };\n\n  SelectionState.createEmpty = function createEmpty(key) {\n    return new SelectionState({\n      anchorKey: key,\n      anchorOffset: 0,\n      focusKey: key,\n      focusOffset: 0,\n      isBackward: false,\n      hasFocus: false\n    });\n  };\n\n  return SelectionState;\n}(SelectionStateRecord);\n\nmodule.exports = SelectionState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction adjustBlockDepthForContentState(contentState, selectionState, adjustment, maxDepth) {\n  var startKey = selectionState.getStartKey();\n  var endKey = selectionState.getEndKey();\n  var blockMap = contentState.getBlockMap();\n  var blocks = blockMap.toSeq().skipUntil(function (_, k) {\n    return k === startKey;\n  }).takeUntil(function (_, k) {\n    return k === endKey;\n  }).concat([[endKey, blockMap.get(endKey)]]).map(function (block) {\n    var depth = block.getDepth() + adjustment;\n    depth = Math.max(0, Math.min(depth, maxDepth));\n    return block.set('depth', depth);\n  });\n  blockMap = blockMap.merge(blocks);\n  return contentState.merge({\n    blockMap: blockMap,\n    selectionBefore: selectionState,\n    selectionAfter: selectionState\n  });\n}\n\nmodule.exports = adjustBlockDepthForContentState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar CharacterMetadata = require(\"./CharacterMetadata\");\n\nfunction applyEntityToContentBlock(contentBlock, startArg, end, entityKey) {\n  var start = startArg;\n  var characterList = contentBlock.getCharacterList();\n\n  while (start < end) {\n    characterList = characterList.set(start, CharacterMetadata.applyEntity(characterList.get(start), entityKey));\n    start++;\n  }\n\n  return contentBlock.set('characterList', characterList);\n}\n\nmodule.exports = applyEntityToContentBlock;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar applyEntityToContentBlock = require(\"./applyEntityToContentBlock\");\n\nvar Immutable = require(\"immutable\");\n\nfunction applyEntityToContentState(contentState, selectionState, entityKey) {\n  var blockMap = contentState.getBlockMap();\n  var startKey = selectionState.getStartKey();\n  var startOffset = selectionState.getStartOffset();\n  var endKey = selectionState.getEndKey();\n  var endOffset = selectionState.getEndOffset();\n  var newBlocks = blockMap.skipUntil(function (_, k) {\n    return k === startKey;\n  }).takeUntil(function (_, k) {\n    return k === endKey;\n  }).toOrderedMap().merge(Immutable.OrderedMap([[endKey, blockMap.get(endKey)]])).map(function (block, blockKey) {\n    var sliceStart = blockKey === startKey ? startOffset : 0;\n    var sliceEnd = blockKey === endKey ? endOffset : block.getLength();\n    return applyEntityToContentBlock(block, sliceStart, sliceEnd, entityKey);\n  });\n  return contentState.merge({\n    blockMap: blockMap.merge(newBlocks),\n    selectionBefore: selectionState,\n    selectionAfter: selectionState\n  });\n}\n\nmodule.exports = applyEntityToContentState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, 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\nvar ContentBlock = require(\"./ContentBlock\");\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar DraftStringKey = require(\"./DraftStringKey\");\n\nvar encodeEntityRanges = require(\"./encodeEntityRanges\");\n\nvar encodeInlineStyleRanges = require(\"./encodeInlineStyleRanges\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar createRawBlock = function createRawBlock(block, entityStorageMap) {\n  return {\n    key: block.getKey(),\n    text: block.getText(),\n    type: block.getType(),\n    depth: block.getDepth(),\n    inlineStyleRanges: encodeInlineStyleRanges(block),\n    entityRanges: encodeEntityRanges(block, entityStorageMap),\n    data: block.getData().toObject()\n  };\n};\n\nvar insertRawBlock = function insertRawBlock(block, entityMap, rawBlocks, blockCacheRef) {\n  if (block instanceof ContentBlock) {\n    rawBlocks.push(createRawBlock(block, entityMap));\n    return;\n  }\n\n  !(block instanceof ContentBlockNode) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'block is not a BlockNode') : invariant(false) : void 0;\n  var parentKey = block.getParentKey();\n\n  var rawBlock = blockCacheRef[block.getKey()] = _objectSpread({}, createRawBlock(block, entityMap), {\n    children: []\n  });\n\n  if (parentKey) {\n    blockCacheRef[parentKey].children.push(rawBlock);\n    return;\n  }\n\n  rawBlocks.push(rawBlock);\n};\n\nvar encodeRawBlocks = function encodeRawBlocks(contentState, rawState) {\n  var entityMap = rawState.entityMap;\n  var rawBlocks = [];\n  var blockCacheRef = {};\n  var entityCacheRef = {};\n  var entityStorageKey = 0;\n  contentState.getBlockMap().forEach(function (block) {\n    block.findEntityRanges(function (character) {\n      return character.getEntity() !== null;\n    }, function (start) {\n      var entityKey = block.getEntityAt(start); // Stringify to maintain order of otherwise numeric keys.\n\n      var stringifiedEntityKey = DraftStringKey.stringify(entityKey); // This makes this function resilient to two entities\n      // erroneously having the same key\n\n      if (entityCacheRef[stringifiedEntityKey]) {\n        return;\n      }\n\n      entityCacheRef[stringifiedEntityKey] = entityKey; // we need the `any` casting here since this is a temporary state\n      // where we will later on flip the entity map and populate it with\n      // real entity, at this stage we just need to map back the entity\n      // key used by the BlockNode\n\n      entityMap[stringifiedEntityKey] = \"\".concat(entityStorageKey);\n      entityStorageKey++;\n    });\n    insertRawBlock(block, entityMap, rawBlocks, blockCacheRef);\n  });\n  return {\n    blocks: rawBlocks,\n    entityMap: entityMap\n  };\n}; // Flip storage map so that our storage keys map to global\n// DraftEntity keys.\n\n\nvar encodeRawEntityMap = function encodeRawEntityMap(contentState, rawState) {\n  var blocks = rawState.blocks,\n      entityMap = rawState.entityMap;\n  var rawEntityMap = {};\n  Object.keys(entityMap).forEach(function (key, index) {\n    var entity = contentState.getEntity(DraftStringKey.unstringify(key));\n    rawEntityMap[index] = {\n      type: entity.getType(),\n      mutability: entity.getMutability(),\n      data: entity.getData()\n    };\n  });\n  return {\n    blocks: blocks,\n    entityMap: rawEntityMap\n  };\n};\n\nvar convertFromDraftStateToRaw = function convertFromDraftStateToRaw(contentState) {\n  var rawDraftContentState = {\n    entityMap: {},\n    blocks: []\n  }; // add blocks\n\n  rawDraftContentState = encodeRawBlocks(contentState, rawDraftContentState); // add entities\n\n  rawDraftContentState = encodeRawEntityMap(contentState, rawDraftContentState);\n  return rawDraftContentState;\n};\n\nmodule.exports = convertFromDraftStateToRaw;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar _knownListItemDepthCl;\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, 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\nvar CharacterMetadata = require(\"./CharacterMetadata\");\n\nvar ContentBlock = require(\"./ContentBlock\");\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar DefaultDraftBlockRenderMap = require(\"./DefaultDraftBlockRenderMap\");\n\nvar DraftEntity = require(\"./DraftEntity\");\n\nvar URI = require(\"fbjs/lib/URI\");\n\nvar cx = require(\"fbjs/lib/cx\");\n\nvar generateRandomKey = require(\"./generateRandomKey\");\n\nvar getSafeBodyFromHTML = require(\"./getSafeBodyFromHTML\");\n\nvar gkx = require(\"./gkx\");\n\nvar _require = require(\"immutable\"),\n    List = _require.List,\n    Map = _require.Map,\n    OrderedSet = _require.OrderedSet;\n\nvar isHTMLAnchorElement = require(\"./isHTMLAnchorElement\");\n\nvar isHTMLBRElement = require(\"./isHTMLBRElement\");\n\nvar isHTMLElement = require(\"./isHTMLElement\");\n\nvar isHTMLImageElement = require(\"./isHTMLImageElement\");\n\nvar experimentalTreeDataSupport = gkx('draft_tree_data_support');\nvar NBSP = '&nbsp;';\nvar SPACE = ' '; // used for replacing characters in HTML\n\nvar REGEX_CR = new RegExp('\\r', 'g');\nvar REGEX_LF = new RegExp('\\n', 'g');\nvar REGEX_LEADING_LF = new RegExp('^\\n', 'g');\nvar REGEX_NBSP = new RegExp(NBSP, 'g');\nvar REGEX_CARRIAGE = new RegExp('&#13;?', 'g');\nvar REGEX_ZWS = new RegExp('&#8203;?', 'g'); // https://developer.mozilla.org/en-US/docs/Web/CSS/font-weight\n\nvar boldValues = ['bold', 'bolder', '500', '600', '700', '800', '900'];\nvar notBoldValues = ['light', 'lighter', 'normal', '100', '200', '300', '400'];\nvar anchorAttr = ['className', 'href', 'rel', 'target', 'title'];\nvar imgAttr = ['alt', 'className', 'height', 'src', 'width'];\nvar knownListItemDepthClasses = (_knownListItemDepthCl = {}, _defineProperty(_knownListItemDepthCl, cx('public/DraftStyleDefault/depth0'), 0), _defineProperty(_knownListItemDepthCl, cx('public/DraftStyleDefault/depth1'), 1), _defineProperty(_knownListItemDepthCl, cx('public/DraftStyleDefault/depth2'), 2), _defineProperty(_knownListItemDepthCl, cx('public/DraftStyleDefault/depth3'), 3), _defineProperty(_knownListItemDepthCl, cx('public/DraftStyleDefault/depth4'), 4), _knownListItemDepthCl);\nvar HTMLTagToRawInlineStyleMap = Map({\n  b: 'BOLD',\n  code: 'CODE',\n  del: 'STRIKETHROUGH',\n  em: 'ITALIC',\n  i: 'ITALIC',\n  s: 'STRIKETHROUGH',\n  strike: 'STRIKETHROUGH',\n  strong: 'BOLD',\n  u: 'UNDERLINE',\n  mark: 'HIGHLIGHT'\n});\n\n/**\n * Build a mapping from HTML tags to draftjs block types\n * out of a BlockRenderMap.\n *\n * The BlockTypeMap for the default BlockRenderMap looks like this:\n *   Map({\n *     h1: 'header-one',\n *     h2: 'header-two',\n *     h3: 'header-three',\n *     h4: 'header-four',\n *     h5: 'header-five',\n *     h6: 'header-six',\n *     blockquote: 'blockquote',\n *     figure: 'atomic',\n *     pre: ['code-block'],\n *     div: 'unstyled',\n *     p: 'unstyled',\n *     li: ['ordered-list-item', 'unordered-list-item'],\n *   })\n */\nvar buildBlockTypeMap = function buildBlockTypeMap(blockRenderMap) {\n  var blockTypeMap = {};\n  blockRenderMap.mapKeys(function (blockType, desc) {\n    var elements = [desc.element];\n\n    if (desc.aliasedElements !== undefined) {\n      elements.push.apply(elements, desc.aliasedElements);\n    }\n\n    elements.forEach(function (element) {\n      if (blockTypeMap[element] === undefined) {\n        blockTypeMap[element] = blockType;\n      } else if (typeof blockTypeMap[element] === 'string') {\n        blockTypeMap[element] = [blockTypeMap[element], blockType];\n      } else {\n        blockTypeMap[element].push(blockType);\n      }\n    });\n  });\n  return Map(blockTypeMap);\n};\n\nvar detectInlineStyle = function detectInlineStyle(node) {\n  if (isHTMLElement(node)) {\n    var element = node; // Currently only used to detect preformatted inline code\n\n    if (element.style.fontFamily.includes('monospace')) {\n      return 'CODE';\n    }\n  }\n\n  return null;\n};\n/**\n * If we're pasting from one DraftEditor to another we can check to see if\n * existing list item depth classes are being used and preserve this style\n */\n\n\nvar getListItemDepth = function getListItemDepth(node) {\n  var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  Object.keys(knownListItemDepthClasses).some(function (depthClass) {\n    if (node.classList.contains(depthClass)) {\n      depth = knownListItemDepthClasses[depthClass];\n    }\n  });\n  return depth;\n};\n/**\n * Return true if the provided HTML Element can be used to build a\n * Draftjs-compatible link.\n */\n\n\nvar isValidAnchor = function isValidAnchor(node) {\n  if (!isHTMLAnchorElement(node)) {\n    return false;\n  }\n\n  var anchorNode = node;\n\n  if (!anchorNode.href || anchorNode.protocol !== 'http:' && anchorNode.protocol !== 'https:' && anchorNode.protocol !== 'mailto:' && anchorNode.protocol !== 'tel:') {\n    return false;\n  }\n\n  try {\n    // Just checking whether we can actually create a URI\n    var _ = new URI(anchorNode.href);\n\n    return true; // We need our catch statements to have arguments, else\n    // UglifyJS (which we use for our OSS builds) will crash.\n    // eslint-disable-next-line fb-www/no-unused-catch-bindings\n  } catch (_) {\n    return false;\n  }\n};\n/**\n * Return true if the provided HTML Element can be used to build a\n * Draftjs-compatible image.\n */\n\n\nvar isValidImage = function isValidImage(node) {\n  if (!isHTMLImageElement(node)) {\n    return false;\n  }\n\n  var imageNode = node;\n  return !!(imageNode.attributes.getNamedItem('src') && imageNode.attributes.getNamedItem('src').value);\n};\n/**\n * Try to guess the inline style of an HTML element based on its css\n * styles (font-weight, font-style and text-decoration).\n */\n\n\nvar styleFromNodeAttributes = function styleFromNodeAttributes(node, style) {\n  if (!isHTMLElement(node)) {\n    return style;\n  }\n\n  var htmlElement = node;\n  var fontWeight = htmlElement.style.fontWeight;\n  var fontStyle = htmlElement.style.fontStyle;\n  var textDecoration = htmlElement.style.textDecoration;\n  return style.withMutations(function (style) {\n    if (boldValues.indexOf(fontWeight) >= 0) {\n      style.add('BOLD');\n    } else if (notBoldValues.indexOf(fontWeight) >= 0) {\n      style.remove('BOLD');\n    }\n\n    if (fontStyle === 'italic') {\n      style.add('ITALIC');\n    } else if (fontStyle === 'normal') {\n      style.remove('ITALIC');\n    }\n\n    if (textDecoration === 'underline') {\n      style.add('UNDERLINE');\n    }\n\n    if (textDecoration === 'line-through') {\n      style.add('STRIKETHROUGH');\n    }\n\n    if (textDecoration === 'none') {\n      style.remove('UNDERLINE');\n      style.remove('STRIKETHROUGH');\n    }\n  });\n};\n/**\n * Determine if a nodeName is a list type, 'ul' or 'ol'\n */\n\n\nvar isListNode = function isListNode(nodeName) {\n  return nodeName === 'ul' || nodeName === 'ol';\n};\n/**\n *  ContentBlockConfig is a mutable data structure that holds all\n *  the information required to build a ContentBlock and an array of\n *  all the child nodes (childConfigs).\n *  It is being used a temporary data structure by the\n *  ContentBlocksBuilder class.\n */\n\n\n/**\n * ContentBlocksBuilder builds a list of ContentBlocks and an Entity Map\n * out of one (or several) HTMLElement(s).\n *\n * The algorithm has two passes: first it builds a tree of ContentBlockConfigs\n * by walking through the HTML nodes and their children, then it walks the\n * ContentBlockConfigs tree to compute parents/siblings and create\n * the actual ContentBlocks.\n *\n * Typical usage is:\n *     new ContentBlocksBuilder()\n *        .addDOMNode(someHTMLNode)\n *        .addDOMNode(someOtherHTMLNode)\n *       .getContentBlocks();\n *\n */\nvar ContentBlocksBuilder = /*#__PURE__*/function () {\n  // Most of the method in the class depend on the state of the content builder\n  // (i.e. currentBlockType, currentDepth, currentEntity etc.). Though it may\n  // be confusing at first, it made the code simpler than the alternative which\n  // is to pass those values around in every call.\n  // The following attributes are used to accumulate text and styles\n  // as we are walking the HTML node tree.\n  // Describes the future ContentState as a tree of content blocks\n  // The content blocks generated from the blockConfigs\n  // Entity map use to store links and images found in the HTML nodes\n  // Map HTML tags to draftjs block types and disambiguation function\n  function ContentBlocksBuilder(blockTypeMap, disambiguate) {\n    _defineProperty(this, \"characterList\", List());\n\n    _defineProperty(this, \"currentBlockType\", 'unstyled');\n\n    _defineProperty(this, \"currentDepth\", 0);\n\n    _defineProperty(this, \"currentEntity\", null);\n\n    _defineProperty(this, \"currentText\", '');\n\n    _defineProperty(this, \"wrapper\", null);\n\n    _defineProperty(this, \"blockConfigs\", []);\n\n    _defineProperty(this, \"contentBlocks\", []);\n\n    _defineProperty(this, \"entityMap\", DraftEntity);\n\n    _defineProperty(this, \"blockTypeMap\", void 0);\n\n    _defineProperty(this, \"disambiguate\", void 0);\n\n    this.clear();\n    this.blockTypeMap = blockTypeMap;\n    this.disambiguate = disambiguate;\n  }\n  /**\n   * Clear the internal state of the ContentBlocksBuilder\n   */\n\n\n  var _proto = ContentBlocksBuilder.prototype;\n\n  _proto.clear = function clear() {\n    this.characterList = List();\n    this.blockConfigs = [];\n    this.currentBlockType = 'unstyled';\n    this.currentDepth = 0;\n    this.currentEntity = null;\n    this.currentText = '';\n    this.entityMap = DraftEntity;\n    this.wrapper = null;\n    this.contentBlocks = [];\n  }\n  /**\n   * Add an HTMLElement to the ContentBlocksBuilder\n   */\n  ;\n\n  _proto.addDOMNode = function addDOMNode(node) {\n    var _this$blockConfigs;\n\n    this.contentBlocks = [];\n    this.currentDepth = 0; // Converts the HTML node to block config\n\n    (_this$blockConfigs = this.blockConfigs).push.apply(_this$blockConfigs, this._toBlockConfigs([node], OrderedSet())); // There might be some left over text in the builder's\n    // internal state, if so make a ContentBlock out of it.\n\n\n    this._trimCurrentText();\n\n    if (this.currentText !== '') {\n      this.blockConfigs.push(this._makeBlockConfig());\n    } // for chaining\n\n\n    return this;\n  }\n  /**\n   * Return the ContentBlocks and the EntityMap that corresponds\n   * to the previously added HTML nodes.\n   */\n  ;\n\n  _proto.getContentBlocks = function getContentBlocks() {\n    if (this.contentBlocks.length === 0) {\n      if (experimentalTreeDataSupport) {\n        this._toContentBlocks(this.blockConfigs);\n      } else {\n        this._toFlatContentBlocks(this.blockConfigs);\n      }\n    }\n\n    return {\n      contentBlocks: this.contentBlocks,\n      entityMap: this.entityMap\n    };\n  } // ***********************************WARNING******************************\n  // The methods below this line are private - don't call them directly.\n\n  /**\n   * Generate a new ContentBlockConfig out of the current internal state\n   * of the builder, then clears the internal state.\n   */\n  ;\n\n  _proto._makeBlockConfig = function _makeBlockConfig() {\n    var config = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n    var key = config.key || generateRandomKey();\n\n    var block = _objectSpread({\n      key: key,\n      type: this.currentBlockType,\n      text: this.currentText,\n      characterList: this.characterList,\n      depth: this.currentDepth,\n      parent: null,\n      children: List(),\n      prevSibling: null,\n      nextSibling: null,\n      childConfigs: []\n    }, config);\n\n    this.characterList = List();\n    this.currentBlockType = 'unstyled';\n    this.currentText = '';\n    return block;\n  }\n  /**\n   * Converts an array of HTML elements to a multi-root tree of content\n   * block configs. Some text content may be left in the builders internal\n   * state to enable chaining sucessive calls.\n   */\n  ;\n\n  _proto._toBlockConfigs = function _toBlockConfigs(nodes, style) {\n    var blockConfigs = [];\n\n    for (var i = 0; i < nodes.length; i++) {\n      var node = nodes[i];\n      var nodeName = node.nodeName.toLowerCase();\n\n      if (nodeName === 'body' || isListNode(nodeName)) {\n        // body, ol and ul are 'block' type nodes so create a block config\n        // with the text accumulated so far (if any)\n        this._trimCurrentText();\n\n        if (this.currentText !== '') {\n          blockConfigs.push(this._makeBlockConfig());\n        } // body, ol and ul nodes are ignored, but their children are inlined in\n        // the parent block config.\n\n\n        var wasCurrentDepth = this.currentDepth;\n        var wasWrapper = this.wrapper;\n\n        if (isListNode(nodeName)) {\n          this.wrapper = nodeName;\n\n          if (isListNode(wasWrapper)) {\n            this.currentDepth++;\n          }\n        }\n\n        blockConfigs.push.apply(blockConfigs, this._toBlockConfigs(Array.from(node.childNodes), style));\n        this.currentDepth = wasCurrentDepth;\n        this.wrapper = wasWrapper;\n        continue;\n      }\n\n      var blockType = this.blockTypeMap.get(nodeName);\n\n      if (blockType !== undefined) {\n        // 'block' type node means we need to create a block config\n        // with the text accumulated so far (if any)\n        this._trimCurrentText();\n\n        if (this.currentText !== '') {\n          blockConfigs.push(this._makeBlockConfig());\n        }\n\n        var _wasCurrentDepth = this.currentDepth;\n        var _wasWrapper = this.wrapper;\n        this.wrapper = nodeName === 'pre' ? 'pre' : this.wrapper;\n\n        if (typeof blockType !== 'string') {\n          blockType = this.disambiguate(nodeName, this.wrapper) || blockType[0] || 'unstyled';\n        }\n\n        if (!experimentalTreeDataSupport && isHTMLElement(node) && (blockType === 'unordered-list-item' || blockType === 'ordered-list-item')) {\n          var htmlElement = node;\n          this.currentDepth = getListItemDepth(htmlElement, this.currentDepth);\n        }\n\n        var key = generateRandomKey();\n\n        var childConfigs = this._toBlockConfigs(Array.from(node.childNodes), style);\n\n        this._trimCurrentText();\n\n        blockConfigs.push(this._makeBlockConfig({\n          key: key,\n          childConfigs: childConfigs,\n          type: blockType\n        }));\n        this.currentDepth = _wasCurrentDepth;\n        this.wrapper = _wasWrapper;\n        continue;\n      }\n\n      if (nodeName === '#text') {\n        this._addTextNode(node, style);\n\n        continue;\n      }\n\n      if (nodeName === 'br') {\n        this._addBreakNode(node, style);\n\n        continue;\n      }\n\n      if (isValidImage(node)) {\n        this._addImgNode(node, style);\n\n        continue;\n      }\n\n      if (isValidAnchor(node)) {\n        this._addAnchorNode(node, blockConfigs, style);\n\n        continue;\n      }\n\n      var newStyle = style;\n\n      if (HTMLTagToRawInlineStyleMap.has(nodeName)) {\n        newStyle = newStyle.add(HTMLTagToRawInlineStyleMap.get(nodeName));\n      }\n\n      newStyle = styleFromNodeAttributes(node, newStyle);\n      var inlineStyle = detectInlineStyle(node);\n\n      if (inlineStyle != null) {\n        newStyle = newStyle.add(inlineStyle);\n      }\n\n      blockConfigs.push.apply(blockConfigs, this._toBlockConfigs(Array.from(node.childNodes), newStyle));\n    }\n\n    return blockConfigs;\n  }\n  /**\n   * Append a string of text to the internal buffer.\n   */\n  ;\n\n  _proto._appendText = function _appendText(text, style) {\n    var _this$characterList;\n\n    this.currentText += text;\n    var characterMetadata = CharacterMetadata.create({\n      style: style,\n      entity: this.currentEntity\n    });\n    this.characterList = (_this$characterList = this.characterList).push.apply(_this$characterList, Array(text.length).fill(characterMetadata));\n  }\n  /**\n   * Trim the text in the internal buffer.\n   */\n  ;\n\n  _proto._trimCurrentText = function _trimCurrentText() {\n    var l = this.currentText.length;\n    var begin = l - this.currentText.trimLeft().length;\n    var end = this.currentText.trimRight().length; // We should not trim whitespaces for which an entity is defined.\n\n    var entity = this.characterList.findEntry(function (characterMetadata) {\n      return characterMetadata.getEntity() !== null;\n    });\n    begin = entity !== undefined ? Math.min(begin, entity[0]) : begin;\n    entity = this.characterList.reverse().findEntry(function (characterMetadata) {\n      return characterMetadata.getEntity() !== null;\n    });\n    end = entity !== undefined ? Math.max(end, l - entity[0]) : end;\n\n    if (begin > end) {\n      this.currentText = '';\n      this.characterList = List();\n    } else {\n      this.currentText = this.currentText.slice(begin, end);\n      this.characterList = this.characterList.slice(begin, end);\n    }\n  }\n  /**\n   * Add the content of an HTML text node to the internal state\n   */\n  ;\n\n  _proto._addTextNode = function _addTextNode(node, style) {\n    var text = node.textContent;\n    var trimmedText = text.trim(); // If we are not in a pre block and the trimmed content is empty,\n    // normalize to a single space.\n\n    if (trimmedText === '' && this.wrapper !== 'pre') {\n      text = ' ';\n    }\n\n    if (this.wrapper !== 'pre') {\n      // Trim leading line feed, which is invisible in HTML\n      text = text.replace(REGEX_LEADING_LF, ''); // Can't use empty string because MSWord\n\n      text = text.replace(REGEX_LF, SPACE);\n    }\n\n    this._appendText(text, style);\n  };\n\n  _proto._addBreakNode = function _addBreakNode(node, style) {\n    if (!isHTMLBRElement(node)) {\n      return;\n    }\n\n    this._appendText('\\n', style);\n  }\n  /**\n   * Add the content of an HTML img node to the internal state\n   */\n  ;\n\n  _proto._addImgNode = function _addImgNode(node, style) {\n    if (!isHTMLImageElement(node)) {\n      return;\n    }\n\n    var image = node;\n    var entityConfig = {};\n    imgAttr.forEach(function (attr) {\n      var imageAttribute = image.getAttribute(attr);\n\n      if (imageAttribute) {\n        entityConfig[attr] = imageAttribute;\n      }\n    }); // TODO: T15530363 update this when we remove DraftEntity entirely\n\n    this.currentEntity = this.entityMap.__create('IMAGE', 'IMMUTABLE', entityConfig); // The child text node cannot just have a space or return as content (since\n    // we strip those out), unless the image is for presentation only.\n    // See https://github.com/facebook/draft-js/issues/231 for some context.\n\n    if (gkx('draftjs_fix_paste_for_img')) {\n      if (image.getAttribute('role') !== 'presentation') {\n        this._appendText(\"\\uD83D\\uDCF7\", style);\n      }\n    } else {\n      this._appendText(\"\\uD83D\\uDCF7\", style);\n    }\n\n    this.currentEntity = null;\n  }\n  /**\n   * Add the content of an HTML 'a' node to the internal state. Child nodes\n   * (if any) are converted to Block Configs and appended to the provided\n   * blockConfig array.\n   */\n  ;\n\n  _proto._addAnchorNode = function _addAnchorNode(node, blockConfigs, style) {\n    // The check has already been made by isValidAnchor but\n    // we have to do it again to keep flow happy.\n    if (!isHTMLAnchorElement(node)) {\n      return;\n    }\n\n    var anchor = node;\n    var entityConfig = {};\n    anchorAttr.forEach(function (attr) {\n      var anchorAttribute = anchor.getAttribute(attr);\n\n      if (anchorAttribute) {\n        entityConfig[attr] = anchorAttribute;\n      }\n    });\n    entityConfig.url = new URI(anchor.href).toString(); // TODO: T15530363 update this when we remove DraftEntity completely\n\n    this.currentEntity = this.entityMap.__create('LINK', 'MUTABLE', entityConfig || {});\n    blockConfigs.push.apply(blockConfigs, this._toBlockConfigs(Array.from(node.childNodes), style));\n    this.currentEntity = null;\n  }\n  /**\n   * Walk the BlockConfig tree, compute parent/children/siblings,\n   * and generate the corresponding ContentBlockNode\n   */\n  ;\n\n  _proto._toContentBlocks = function _toContentBlocks(blockConfigs) {\n    var parent = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;\n    var l = blockConfigs.length - 1;\n\n    for (var i = 0; i <= l; i++) {\n      var config = blockConfigs[i];\n      config.parent = parent;\n      config.prevSibling = i > 0 ? blockConfigs[i - 1].key : null;\n      config.nextSibling = i < l ? blockConfigs[i + 1].key : null;\n      config.children = List(config.childConfigs.map(function (child) {\n        return child.key;\n      }));\n      this.contentBlocks.push(new ContentBlockNode(_objectSpread({}, config)));\n\n      this._toContentBlocks(config.childConfigs, config.key);\n    }\n  }\n  /**\n   * Remove 'useless' container nodes from the block config hierarchy, by\n   * replacing them with their children.\n   */\n  ;\n\n  _proto._hoistContainersInBlockConfigs = function _hoistContainersInBlockConfigs(blockConfigs) {\n    var _this = this;\n\n    var hoisted = List(blockConfigs).flatMap(function (blockConfig) {\n      // Don't mess with useful blocks\n      if (blockConfig.type !== 'unstyled' || blockConfig.text !== '') {\n        return [blockConfig];\n      }\n\n      return _this._hoistContainersInBlockConfigs(blockConfig.childConfigs);\n    });\n    return hoisted;\n  } // ***********************************************************************\n  // The two methods below are used for backward compatibility when\n  // experimentalTreeDataSupport is disabled.\n\n  /**\n   * Same as _toContentBlocks but replaces nested blocks by their\n   * text content.\n   */\n  ;\n\n  _proto._toFlatContentBlocks = function _toFlatContentBlocks(blockConfigs) {\n    var _this2 = this;\n\n    var cleanConfigs = this._hoistContainersInBlockConfigs(blockConfigs);\n\n    cleanConfigs.forEach(function (config) {\n      var _this2$_extractTextFr = _this2._extractTextFromBlockConfigs(config.childConfigs),\n          text = _this2$_extractTextFr.text,\n          characterList = _this2$_extractTextFr.characterList;\n\n      _this2.contentBlocks.push(new ContentBlock(_objectSpread({}, config, {\n        text: config.text + text,\n        characterList: config.characterList.concat(characterList)\n      })));\n    });\n  }\n  /**\n   * Extract the text and the associated inline styles form an\n   * array of content block configs.\n   */\n  ;\n\n  _proto._extractTextFromBlockConfigs = function _extractTextFromBlockConfigs(blockConfigs) {\n    var l = blockConfigs.length - 1;\n    var text = '';\n    var characterList = List();\n\n    for (var i = 0; i <= l; i++) {\n      var config = blockConfigs[i];\n      text += config.text;\n      characterList = characterList.concat(config.characterList);\n\n      if (text !== '' && config.type !== 'unstyled') {\n        text += '\\n';\n        characterList = characterList.push(characterList.last());\n      }\n\n      var children = this._extractTextFromBlockConfigs(config.childConfigs);\n\n      text += children.text;\n      characterList = characterList.concat(children.characterList);\n    }\n\n    return {\n      text: text,\n      characterList: characterList\n    };\n  };\n\n  return ContentBlocksBuilder;\n}();\n/**\n * Converts an HTML string to an array of ContentBlocks and an EntityMap\n * suitable to initialize the internal state of a Draftjs component.\n */\n\n\nvar convertFromHTMLToContentBlocks = function convertFromHTMLToContentBlocks(html) {\n  var DOMBuilder = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : getSafeBodyFromHTML;\n  var blockRenderMap = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : DefaultDraftBlockRenderMap;\n  // Be ABSOLUTELY SURE that the dom builder you pass here won't execute\n  // arbitrary code in whatever environment you're running this in. For an\n  // example of how we try to do this in-browser, see getSafeBodyFromHTML.\n  // Remove funky characters from the HTML string\n  html = html.trim().replace(REGEX_CR, '').replace(REGEX_NBSP, SPACE).replace(REGEX_CARRIAGE, '').replace(REGEX_ZWS, ''); // Build a DOM tree out of the HTML string\n\n  var safeBody = DOMBuilder(html);\n\n  if (!safeBody) {\n    return null;\n  } // Build a BlockTypeMap out of the BlockRenderMap\n\n\n  var blockTypeMap = buildBlockTypeMap(blockRenderMap); // Select the proper block type for the cases where the blockRenderMap\n  // uses multiple block types for the same html tag.\n\n  var disambiguate = function disambiguate(tag, wrapper) {\n    if (tag === 'li') {\n      return wrapper === 'ol' ? 'ordered-list-item' : 'unordered-list-item';\n    }\n\n    return null;\n  };\n\n  return new ContentBlocksBuilder(blockTypeMap, disambiguate).addDOMNode(safeBody).getContentBlocks();\n};\n\nmodule.exports = convertFromHTMLToContentBlocks;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, 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\nvar ContentBlock = require(\"./ContentBlock\");\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar ContentState = require(\"./ContentState\");\n\nvar DraftEntity = require(\"./DraftEntity\");\n\nvar DraftTreeAdapter = require(\"./DraftTreeAdapter\");\n\nvar DraftTreeInvariants = require(\"./DraftTreeInvariants\");\n\nvar SelectionState = require(\"./SelectionState\");\n\nvar createCharacterList = require(\"./createCharacterList\");\n\nvar decodeEntityRanges = require(\"./decodeEntityRanges\");\n\nvar decodeInlineStyleRanges = require(\"./decodeInlineStyleRanges\");\n\nvar generateRandomKey = require(\"./generateRandomKey\");\n\nvar gkx = require(\"./gkx\");\n\nvar Immutable = require(\"immutable\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar experimentalTreeDataSupport = gkx('draft_tree_data_support');\nvar List = Immutable.List,\n    Map = Immutable.Map,\n    OrderedMap = Immutable.OrderedMap;\n\nvar decodeBlockNodeConfig = function decodeBlockNodeConfig(block, entityMap) {\n  var key = block.key,\n      type = block.type,\n      data = block.data,\n      text = block.text,\n      depth = block.depth;\n  var blockNodeConfig = {\n    text: text,\n    depth: depth || 0,\n    type: type || 'unstyled',\n    key: key || generateRandomKey(),\n    data: Map(data),\n    characterList: decodeCharacterList(block, entityMap)\n  };\n  return blockNodeConfig;\n};\n\nvar decodeCharacterList = function decodeCharacterList(block, entityMap) {\n  var text = block.text,\n      rawEntityRanges = block.entityRanges,\n      rawInlineStyleRanges = block.inlineStyleRanges;\n  var entityRanges = rawEntityRanges || [];\n  var inlineStyleRanges = rawInlineStyleRanges || []; // Translate entity range keys to the DraftEntity map.\n\n  return createCharacterList(decodeInlineStyleRanges(text, inlineStyleRanges), decodeEntityRanges(text, entityRanges.filter(function (range) {\n    return entityMap.hasOwnProperty(range.key);\n  }).map(function (range) {\n    return _objectSpread({}, range, {\n      key: entityMap[range.key]\n    });\n  })));\n};\n\nvar addKeyIfMissing = function addKeyIfMissing(block) {\n  return _objectSpread({}, block, {\n    key: block.key || generateRandomKey()\n  });\n};\n/**\n * Node stack is responsible to ensure we traverse the tree only once\n * in depth order, while also providing parent refs to inner nodes to\n * construct their links.\n */\n\n\nvar updateNodeStack = function updateNodeStack(stack, nodes, parentRef) {\n  var nodesWithParentRef = nodes.map(function (block) {\n    return _objectSpread({}, block, {\n      parentRef: parentRef\n    });\n  }); // since we pop nodes from the stack we need to insert them in reverse\n\n  return stack.concat(nodesWithParentRef.reverse());\n};\n/**\n * This will build a tree draft content state by creating the node\n * reference links into a single tree walk. Each node has a link\n * reference to \"parent\", \"children\", \"nextSibling\" and \"prevSibling\"\n * blockMap will be created using depth ordering.\n */\n\n\nvar decodeContentBlockNodes = function decodeContentBlockNodes(blocks, entityMap) {\n  return blocks // ensure children have valid keys to enable sibling links\n  .map(addKeyIfMissing).reduce(function (blockMap, block, index) {\n    !Array.isArray(block.children) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'invalid RawDraftContentBlock can not be converted to ContentBlockNode') : invariant(false) : void 0; // ensure children have valid keys to enable sibling links\n\n    var children = block.children.map(addKeyIfMissing); // root level nodes\n\n    var contentBlockNode = new ContentBlockNode(_objectSpread({}, decodeBlockNodeConfig(block, entityMap), {\n      prevSibling: index === 0 ? null : blocks[index - 1].key,\n      nextSibling: index === blocks.length - 1 ? null : blocks[index + 1].key,\n      children: List(children.map(function (child) {\n        return child.key;\n      }))\n    })); // push root node to blockMap\n\n    blockMap = blockMap.set(contentBlockNode.getKey(), contentBlockNode); // this stack is used to ensure we visit all nodes respecting depth ordering\n\n    var stack = updateNodeStack([], children, contentBlockNode); // start computing children nodes\n\n    while (stack.length > 0) {\n      // we pop from the stack and start processing this node\n      var node = stack.pop(); // parentRef already points to a converted ContentBlockNode\n\n      var parentRef = node.parentRef;\n      var siblings = parentRef.getChildKeys();\n\n      var _index = siblings.indexOf(node.key);\n\n      var isValidBlock = Array.isArray(node.children);\n\n      if (!isValidBlock) {\n        !isValidBlock ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'invalid RawDraftContentBlock can not be converted to ContentBlockNode') : invariant(false) : void 0;\n        break;\n      } // ensure children have valid keys to enable sibling links\n\n\n      var _children = node.children.map(addKeyIfMissing);\n\n      var _contentBlockNode = new ContentBlockNode(_objectSpread({}, decodeBlockNodeConfig(node, entityMap), {\n        parent: parentRef.getKey(),\n        children: List(_children.map(function (child) {\n          return child.key;\n        })),\n        prevSibling: _index === 0 ? null : siblings.get(_index - 1),\n        nextSibling: _index === siblings.size - 1 ? null : siblings.get(_index + 1)\n      })); // push node to blockMap\n\n\n      blockMap = blockMap.set(_contentBlockNode.getKey(), _contentBlockNode); // this stack is used to ensure we visit all nodes respecting depth ordering\n\n      stack = updateNodeStack(stack, _children, _contentBlockNode);\n    }\n\n    return blockMap;\n  }, OrderedMap());\n};\n\nvar decodeContentBlocks = function decodeContentBlocks(blocks, entityMap) {\n  return OrderedMap(blocks.map(function (block) {\n    var contentBlock = new ContentBlock(decodeBlockNodeConfig(block, entityMap));\n    return [contentBlock.getKey(), contentBlock];\n  }));\n};\n\nvar decodeRawBlocks = function decodeRawBlocks(rawState, entityMap) {\n  var isTreeRawBlock = rawState.blocks.find(function (block) {\n    return Array.isArray(block.children) && block.children.length > 0;\n  });\n  var rawBlocks = experimentalTreeDataSupport && !isTreeRawBlock ? DraftTreeAdapter.fromRawStateToRawTreeState(rawState).blocks : rawState.blocks;\n\n  if (!experimentalTreeDataSupport) {\n    return decodeContentBlocks(isTreeRawBlock ? DraftTreeAdapter.fromRawTreeStateToRawState(rawState).blocks : rawBlocks, entityMap);\n  }\n\n  var blockMap = decodeContentBlockNodes(rawBlocks, entityMap); // in dev mode, check that the tree invariants are met\n\n  if (process.env.NODE_ENV !== \"production\") {\n    !DraftTreeInvariants.isValidTree(blockMap) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Should be a valid tree') : invariant(false) : void 0;\n  }\n\n  return blockMap;\n};\n\nvar decodeRawEntityMap = function decodeRawEntityMap(rawState) {\n  var rawEntityMap = rawState.entityMap;\n  var entityMap = {}; // TODO: Update this once we completely remove DraftEntity\n\n  Object.keys(rawEntityMap).forEach(function (rawEntityKey) {\n    var _rawEntityMap$rawEnti = rawEntityMap[rawEntityKey],\n        type = _rawEntityMap$rawEnti.type,\n        mutability = _rawEntityMap$rawEnti.mutability,\n        data = _rawEntityMap$rawEnti.data; // get the key reference to created entity\n\n    entityMap[rawEntityKey] = DraftEntity.__create(type, mutability, data || {});\n  });\n  return entityMap;\n};\n\nvar convertFromRawToDraftState = function convertFromRawToDraftState(rawState) {\n  !Array.isArray(rawState.blocks) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'invalid RawDraftContentState') : invariant(false) : void 0; // decode entities\n\n  var entityMap = decodeRawEntityMap(rawState); // decode blockMap\n\n  var blockMap = decodeRawBlocks(rawState, entityMap); // create initial selection\n\n  var selectionState = blockMap.isEmpty() ? new SelectionState() : SelectionState.createEmpty(blockMap.first().getKey());\n  return new ContentState({\n    blockMap: blockMap,\n    entityMap: entityMap,\n    selectionBefore: selectionState,\n    selectionAfter: selectionState\n  });\n};\n\nmodule.exports = convertFromRawToDraftState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar CharacterMetadata = require(\"./CharacterMetadata\");\n\nvar Immutable = require(\"immutable\");\n\nvar List = Immutable.List;\n\nfunction createCharacterList(inlineStyles, entities) {\n  var characterArray = inlineStyles.map(function (style, ii) {\n    var entity = entities[ii];\n    return CharacterMetadata.create({\n      style: style,\n      entity: entity\n    });\n  });\n  return List(characterArray);\n}\n\nmodule.exports = createCharacterList;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar UnicodeUtils = require(\"fbjs/lib/UnicodeUtils\");\n\nvar substr = UnicodeUtils.substr;\n/**\n * Convert to native JavaScript string lengths to determine ranges.\n */\n\nfunction decodeEntityRanges(text, ranges) {\n  var entities = Array(text.length).fill(null);\n\n  if (ranges) {\n    ranges.forEach(function (range) {\n      // Using Unicode-enabled substrings converted to JavaScript lengths,\n      // fill the output array with entity keys.\n      var start = substr(text, 0, range.offset).length;\n      var end = start + substr(text, range.offset, range.length).length;\n\n      for (var ii = start; ii < end; ii++) {\n        entities[ii] = range.key;\n      }\n    });\n  }\n\n  return entities;\n}\n\nmodule.exports = decodeEntityRanges;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar UnicodeUtils = require(\"fbjs/lib/UnicodeUtils\");\n\nvar _require = require(\"immutable\"),\n    OrderedSet = _require.OrderedSet;\n\nvar substr = UnicodeUtils.substr;\nvar EMPTY_SET = OrderedSet();\n/**\n * Convert to native JavaScript string lengths to determine ranges.\n */\n\nfunction decodeInlineStyleRanges(text, ranges) {\n  var styles = Array(text.length).fill(EMPTY_SET);\n\n  if (ranges) {\n    ranges.forEach(function (range) {\n      var cursor = substr(text, 0, range.offset).length;\n      var end = cursor + substr(text, range.offset, range.length).length;\n\n      while (cursor < end) {\n        styles[cursor] = styles[cursor].add(range.style);\n        cursor++;\n      }\n    });\n  }\n\n  return styles;\n}\n\nmodule.exports = decodeInlineStyleRanges;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * Provides utilities for handling draftjs keys.\n *\n * @emails oncall+draft_js\n * \n * @format\n */\n'use strict';\n\nfunction notEmptyKey(key) {\n  return key != null && key != '';\n}\n\nmodule.exports = {\n  notEmptyKey: notEmptyKey\n};","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nvar getEntityKeyForSelection = require(\"./getEntityKeyForSelection\");\n\nvar isEventHandled = require(\"./isEventHandled\");\n\nvar isSelectionAtLeafStart = require(\"./isSelectionAtLeafStart\");\n\nvar nullthrows = require(\"fbjs/lib/nullthrows\");\n\nvar setImmediate = require(\"fbjs/lib/setImmediate\"); // When nothing is focused, Firefox regards two characters, `'` and `/`, as\n// commands that should open and focus the \"quickfind\" search bar. This should\n// *never* happen while a contenteditable is focused, but as of v28, it\n// sometimes does, even when the keypress event target is the contenteditable.\n// This breaks the input. Special case these characters to ensure that when\n// they are typed, we prevent default on the event to make sure not to\n// trigger quickfind.\n\n\nvar FF_QUICKFIND_CHAR = \"'\";\nvar FF_QUICKFIND_LINK_CHAR = '/';\nvar isFirefox = UserAgent.isBrowser('Firefox');\n\nfunction mustPreventDefaultForCharacter(character) {\n  return isFirefox && (character == FF_QUICKFIND_CHAR || character == FF_QUICKFIND_LINK_CHAR);\n}\n/**\n * Replace the current selection with the specified text string, with the\n * inline style and entity key applied to the newly inserted text.\n */\n\n\nfunction replaceText(editorState, text, inlineStyle, entityKey, forceSelection) {\n  var contentState = DraftModifier.replaceText(editorState.getCurrentContent(), editorState.getSelection(), text, inlineStyle, entityKey);\n  return EditorState.push(editorState, contentState, 'insert-characters', forceSelection);\n}\n/**\n * When `onBeforeInput` executes, the browser is attempting to insert a\n * character into the editor. Apply this character data to the document,\n * allowing native insertion if possible.\n *\n * Native insertion is encouraged in order to limit re-rendering and to\n * preserve spellcheck highlighting, which disappears or flashes if re-render\n * occurs on the relevant text nodes.\n */\n\n\nfunction editOnBeforeInput(editor, e) {\n  if (editor._pendingStateFromBeforeInput !== undefined) {\n    editor.update(editor._pendingStateFromBeforeInput);\n    editor._pendingStateFromBeforeInput = undefined;\n  }\n\n  var editorState = editor._latestEditorState;\n  var chars = e.data; // In some cases (ex: IE ideographic space insertion) no character data\n  // is provided. There's nothing to do when this happens.\n\n  if (!chars) {\n    return;\n  } // Allow the top-level component to handle the insertion manually. This is\n  // useful when triggering interesting behaviors for a character insertion,\n  // Simple examples: replacing a raw text ':)' with a smile emoji or image\n  // decorator, or setting a block to be a list item after typing '- ' at the\n  // start of the block.\n\n\n  if (editor.props.handleBeforeInput && isEventHandled(editor.props.handleBeforeInput(chars, editorState, e.timeStamp))) {\n    e.preventDefault();\n    return;\n  } // If selection is collapsed, conditionally allow native behavior. This\n  // reduces re-renders and preserves spellcheck highlighting. If the selection\n  // is not collapsed, we will re-render.\n\n\n  var selection = editorState.getSelection();\n  var selectionStart = selection.getStartOffset();\n  var anchorKey = selection.getAnchorKey();\n\n  if (!selection.isCollapsed()) {\n    e.preventDefault();\n    editor.update(replaceText(editorState, chars, editorState.getCurrentInlineStyle(), getEntityKeyForSelection(editorState.getCurrentContent(), editorState.getSelection()), true));\n    return;\n  }\n\n  var newEditorState = replaceText(editorState, chars, editorState.getCurrentInlineStyle(), getEntityKeyForSelection(editorState.getCurrentContent(), editorState.getSelection()), false); // Bunch of different cases follow where we need to prevent native insertion.\n\n  var mustPreventNative = false;\n\n  if (!mustPreventNative) {\n    // Browsers tend to insert text in weird places in the DOM when typing at\n    // the start of a leaf, so we'll handle it ourselves.\n    mustPreventNative = isSelectionAtLeafStart(editor._latestCommittedEditorState);\n  }\n\n  if (!mustPreventNative) {\n    // Let's say we have a decorator that highlights hashtags. In many cases\n    // we need to prevent native behavior and rerender ourselves --\n    // particularly, any case *except* where the inserted characters end up\n    // anywhere except exactly where you put them.\n    //\n    // Using [] to denote a decorated leaf, some examples:\n    //\n    // 1. 'hi #' and append 'f'\n    // desired rendering: 'hi [#f]'\n    // native rendering would be: 'hi #f' (incorrect)\n    //\n    // 2. 'x [#foo]' and insert '#' before 'f'\n    // desired rendering: 'x #[#foo]'\n    // native rendering would be: 'x [##foo]' (incorrect)\n    //\n    // 3. '[#foobar]' and insert ' ' between 'foo' and 'bar'\n    // desired rendering: '[#foo] bar'\n    // native rendering would be: '[#foo bar]' (incorrect)\n    //\n    // 4. '[#foo]' and delete '#' [won't use this beforeinput codepath though]\n    // desired rendering: 'foo'\n    // native rendering would be: '[foo]' (incorrect)\n    //\n    // 5. '[#foo]' and append 'b'\n    // desired rendering: '[#foob]'\n    // native rendering would be: '[#foob]'\n    // (native insertion here would be ok for decorators like simple spans,\n    // but not more complex decorators. To be safe, we need to prevent it.)\n    //\n    // It is safe to allow native insertion if and only if the full list of\n    // decorator ranges matches what we expect native insertion to give, and\n    // the range lengths have not changed. We don't need to compare the content\n    // because the only possible mutation to consider here is inserting plain\n    // text and decorators can't affect text content.\n    var oldBlockTree = editorState.getBlockTree(anchorKey);\n    var newBlockTree = newEditorState.getBlockTree(anchorKey);\n    mustPreventNative = oldBlockTree.size !== newBlockTree.size || oldBlockTree.zip(newBlockTree).some(function (_ref) {\n      var oldLeafSet = _ref[0],\n          newLeafSet = _ref[1];\n      // selectionStart is guaranteed to be selectionEnd here\n      var oldStart = oldLeafSet.get('start');\n      var adjustedStart = oldStart + (oldStart >= selectionStart ? chars.length : 0);\n      var oldEnd = oldLeafSet.get('end');\n      var adjustedEnd = oldEnd + (oldEnd >= selectionStart ? chars.length : 0);\n      var newStart = newLeafSet.get('start');\n      var newEnd = newLeafSet.get('end');\n      var newDecoratorKey = newLeafSet.get('decoratorKey');\n      return (// Different decorators\n        oldLeafSet.get('decoratorKey') !== newDecoratorKey || // Different number of inline styles\n        oldLeafSet.get('leaves').size !== newLeafSet.get('leaves').size || // Different effective decorator position\n        adjustedStart !== newStart || adjustedEnd !== newEnd || // Decorator already existed and its length changed\n        newDecoratorKey != null && newEnd - newStart !== oldEnd - oldStart\n      );\n    });\n  }\n\n  if (!mustPreventNative) {\n    mustPreventNative = mustPreventDefaultForCharacter(chars);\n  }\n\n  if (!mustPreventNative) {\n    mustPreventNative = nullthrows(newEditorState.getDirectionMap()).get(anchorKey) !== nullthrows(editorState.getDirectionMap()).get(anchorKey);\n  }\n\n  if (mustPreventNative) {\n    e.preventDefault();\n    newEditorState = EditorState.set(newEditorState, {\n      forceSelection: true\n    });\n    editor.update(newEditorState);\n    return;\n  } // We made it all the way! Let the browser do its thing and insert the char.\n\n\n  newEditorState = EditorState.set(newEditorState, {\n    nativelyRenderedContent: newEditorState.getCurrentContent()\n  }); // The native event is allowed to occur. To allow user onChange handlers to\n  // change the inserted text, we wait until the text is actually inserted\n  // before we actually update our state. That way when we rerender, the text\n  // we see in the DOM will already have been inserted properly.\n\n  editor._pendingStateFromBeforeInput = newEditorState;\n  setImmediate(function () {\n    if (editor._pendingStateFromBeforeInput !== undefined) {\n      editor.update(editor._pendingStateFromBeforeInput);\n      editor._pendingStateFromBeforeInput = undefined;\n    }\n  });\n}\n\nmodule.exports = editOnBeforeInput;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n\nvar containsNode = require(\"fbjs/lib/containsNode\");\n\nvar getActiveElement = require(\"fbjs/lib/getActiveElement\");\n\nfunction editOnBlur(editor, e) {\n  // In a contentEditable element, when you select a range and then click\n  // another active element, this does trigger a `blur` event but will not\n  // remove the DOM selection from the contenteditable.\n  // This is consistent across all browsers, but we prefer that the editor\n  // behave like a textarea, where a `blur` event clears the DOM selection.\n  // We therefore force the issue to be certain, checking whether the active\n  // element is `body` to force it when blurring occurs within the window (as\n  // opposed to clicking to another tab or window).\n  var ownerDocument = e.currentTarget.ownerDocument;\n\n  if ( // This ESLint rule conflicts with `sketchy-null-bool` flow check\n  // eslint-disable-next-line no-extra-boolean-cast\n  !Boolean(editor.props.preserveSelectionOnBlur) && getActiveElement(ownerDocument) === ownerDocument.body) {\n    var _selection = ownerDocument.defaultView.getSelection();\n\n    var editorNode = editor.editor;\n\n    if (_selection.rangeCount === 1 && containsNode(editorNode, _selection.anchorNode) && containsNode(editorNode, _selection.focusNode)) {\n      _selection.removeAllRanges();\n    }\n  }\n\n  var editorState = editor._latestEditorState;\n  var currentSelection = editorState.getSelection();\n\n  if (!currentSelection.getHasFocus()) {\n    return;\n  }\n\n  var selection = currentSelection.set('hasFocus', false);\n  editor.props.onBlur && editor.props.onBlur(e);\n  editor.update(EditorState.acceptSelection(editorState, selection));\n}\n\nmodule.exports = editOnBlur;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n/**\n * The user has begun using an IME input system. Switching to `composite` mode\n * allows handling composition input and disables other edit behavior.\n */\n\n\nfunction editOnCompositionStart(editor, e) {\n  editor.setMode('composite');\n  editor.update(EditorState.set(editor._latestEditorState, {\n    inCompositionMode: true\n  })); // Allow composition handler to interpret the compositionstart event\n\n  editor._onCompositionStart(e);\n}\n\nmodule.exports = editOnCompositionStart;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar getFragmentFromSelection = require(\"./getFragmentFromSelection\");\n/**\n * If we have a selection, create a ContentState fragment and store\n * it in our internal clipboard. Subsequent paste events will use this\n * fragment if no external clipboard data is supplied.\n */\n\n\nfunction editOnCopy(editor, e) {\n  var editorState = editor._latestEditorState;\n  var selection = editorState.getSelection(); // No selection, so there's nothing to copy.\n\n  if (selection.isCollapsed()) {\n    e.preventDefault();\n    return;\n  }\n\n  editor.setClipboard(getFragmentFromSelection(editor._latestEditorState));\n}\n\nmodule.exports = editOnCopy;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar Style = require(\"fbjs/lib/Style\");\n\nvar getFragmentFromSelection = require(\"./getFragmentFromSelection\");\n\nvar getScrollPosition = require(\"fbjs/lib/getScrollPosition\");\n\nvar isNode = require(\"./isInstanceOfNode\");\n/**\n * On `cut` events, native behavior is allowed to occur so that the system\n * clipboard is set properly. This means that we need to take steps to recover\n * the editor DOM state after the `cut` has occurred in order to maintain\n * control of the component.\n *\n * In addition, we can keep a copy of the removed fragment, including all\n * styles and entities, for use as an internal paste.\n */\n\n\nfunction editOnCut(editor, e) {\n  var editorState = editor._latestEditorState;\n  var selection = editorState.getSelection();\n  var element = e.target;\n  var scrollPosition; // No selection, so there's nothing to cut.\n\n  if (selection.isCollapsed()) {\n    e.preventDefault();\n    return;\n  } // Track the current scroll position so that it can be forced back in place\n  // after the editor regains control of the DOM.\n\n\n  if (isNode(element)) {\n    var node = element;\n    scrollPosition = getScrollPosition(Style.getScrollParent(node));\n  }\n\n  var fragment = getFragmentFromSelection(editorState);\n  editor.setClipboard(fragment); // Set `cut` mode to disable all event handling temporarily.\n\n  editor.setMode('cut'); // Let native `cut` behavior occur, then recover control.\n\n  setTimeout(function () {\n    editor.restoreEditorDOM(scrollPosition);\n    editor.exitCurrentMode();\n    editor.update(removeFragment(editorState));\n  }, 0);\n}\n\nfunction removeFragment(editorState) {\n  var newContent = DraftModifier.removeRange(editorState.getCurrentContent(), editorState.getSelection(), 'forward');\n  return EditorState.push(editorState, newContent, 'remove-range');\n}\n\nmodule.exports = editOnCut;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\n/**\n * Drag behavior has begun from outside the editor element.\n */\nfunction editOnDragOver(editor, e) {\n  editor.setMode('drag');\n  e.preventDefault();\n}\n\nmodule.exports = editOnDragOver;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\n/**\n * A `dragstart` event has begun within the text editor component.\n */\nfunction editOnDragStart(editor) {\n  editor._internalDrag = true;\n  editor.setMode('drag');\n}\n\nmodule.exports = editOnDragStart;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nfunction editOnFocus(editor, e) {\n  var editorState = editor._latestEditorState;\n  var currentSelection = editorState.getSelection();\n\n  if (currentSelection.getHasFocus()) {\n    return;\n  }\n\n  var selection = currentSelection.set('hasFocus', true);\n  editor.props.onFocus && editor.props.onFocus(e); // When the tab containing this text editor is hidden and the user does a\n  // find-in-page in a _different_ tab, Chrome on Mac likes to forget what the\n  // selection was right after sending this focus event and (if you let it)\n  // moves the cursor back to the beginning of the editor, so we force the\n  // selection here instead of simply accepting it in order to preserve the\n  // old cursor position. See https://crbug.com/540004.\n  // But it looks like this is fixed in Chrome 60.0.3081.0.\n  // Other browsers also don't have this bug, so we prefer to acceptSelection\n  // when possible, to ensure that unfocusing and refocusing a Draft editor\n  // doesn't preserve the selection, matching how textareas work.\n\n  if (UserAgent.isBrowser('Chrome < 60.0.3081.0')) {\n    editor.update(EditorState.forceSelection(editorState, selection));\n  } else {\n    editor.update(EditorState.acceptSelection(editorState, selection));\n  }\n}\n\nmodule.exports = editOnFocus;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar DraftOffsetKey = require(\"./DraftOffsetKey\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nvar _require = require(\"./draftKeyUtils\"),\n    notEmptyKey = _require.notEmptyKey;\n\nvar findAncestorOffsetKey = require(\"./findAncestorOffsetKey\");\n\nvar keyCommandPlainBackspace = require(\"./keyCommandPlainBackspace\");\n\nvar nullthrows = require(\"fbjs/lib/nullthrows\");\n\nvar isGecko = UserAgent.isEngine('Gecko');\nvar DOUBLE_NEWLINE = '\\n\\n';\n\nfunction onInputType(inputType, editorState) {\n  switch (inputType) {\n    case 'deleteContentBackward':\n      return keyCommandPlainBackspace(editorState);\n  }\n\n  return editorState;\n}\n/**\n * This function serves two purposes\n *\n * 1. To update the editorState and call onChange method with the new\n * editorState. This editorState is calculated in editOnBeforeInput but the\n * onChange method is not called with the new state until this method does it.\n * It is done to handle a specific case where certain character inputs might\n * be replaced with something else. E.g. snippets ('rc' might be replaced\n * with boilerplate code for react component). More information on the\n * exact problem can be found here -\n * https://github.com/facebook/draft-js/commit/07892ba479bd4dfc6afd1e0ed179aaf51cd138b1\n *\n * 2. intended to handle spellcheck and autocorrect changes,\n * which occur in the DOM natively without any opportunity to observe or\n * interpret the changes before they occur.\n *\n * The `input` event fires in contentEditable elements reliably for non-IE\n * browsers, immediately after changes occur to the editor DOM. Since our other\n * handlers override or otherwise handle cover other varieties of text input,\n * the DOM state should match the model in all controlled input cases. Thus,\n * when an `input` change leads to a DOM/model mismatch, the change should be\n * due to a spellcheck change, and we can incorporate it into our model.\n */\n\n\nfunction editOnInput(editor, e) {\n  if (editor._pendingStateFromBeforeInput !== undefined) {\n    editor.update(editor._pendingStateFromBeforeInput);\n    editor._pendingStateFromBeforeInput = undefined;\n  } // at this point editor is not null for sure (after input)\n\n\n  var castedEditorElement = editor.editor;\n  var domSelection = castedEditorElement.ownerDocument.defaultView.getSelection();\n  var anchorNode = domSelection.anchorNode,\n      isCollapsed = domSelection.isCollapsed;\n  var isNotTextOrElementNode = (anchorNode === null || anchorNode === void 0 ? void 0 : anchorNode.nodeType) !== Node.TEXT_NODE && (anchorNode === null || anchorNode === void 0 ? void 0 : anchorNode.nodeType) !== Node.ELEMENT_NODE;\n\n  if (anchorNode == null || isNotTextOrElementNode) {\n    // TODO: (t16149272) figure out context for this change\n    return;\n  }\n\n  if (anchorNode.nodeType === Node.TEXT_NODE && (anchorNode.previousSibling !== null || anchorNode.nextSibling !== null)) {\n    // When typing at the beginning of a visual line, Chrome splits the text\n    // nodes into two. Why? No one knows. This commit is suspicious:\n    // https://chromium.googlesource.com/chromium/src/+/a3b600981286b135632371477f902214c55a1724\n    // To work around, we'll merge the sibling text nodes back into this one.\n    var span = anchorNode.parentNode;\n\n    if (span == null) {\n      // Handle null-parent case.\n      return;\n    }\n\n    anchorNode.nodeValue = span.textContent;\n\n    for (var child = span.firstChild; child != null; child = child.nextSibling) {\n      if (child !== anchorNode) {\n        span.removeChild(child);\n      }\n    }\n  }\n\n  var domText = anchorNode.textContent;\n  var editorState = editor._latestEditorState;\n  var offsetKey = nullthrows(findAncestorOffsetKey(anchorNode));\n\n  var _DraftOffsetKey$decod = DraftOffsetKey.decode(offsetKey),\n      blockKey = _DraftOffsetKey$decod.blockKey,\n      decoratorKey = _DraftOffsetKey$decod.decoratorKey,\n      leafKey = _DraftOffsetKey$decod.leafKey;\n\n  var _editorState$getBlock = editorState.getBlockTree(blockKey).getIn([decoratorKey, 'leaves', leafKey]),\n      start = _editorState$getBlock.start,\n      end = _editorState$getBlock.end;\n\n  var content = editorState.getCurrentContent();\n  var block = content.getBlockForKey(blockKey);\n  var modelText = block.getText().slice(start, end); // Special-case soft newlines here. If the DOM text ends in a soft newline,\n  // we will have manually inserted an extra soft newline in DraftEditorLeaf.\n  // We want to remove this extra newline for the purpose of our comparison\n  // of DOM and model text.\n\n  if (domText.endsWith(DOUBLE_NEWLINE)) {\n    domText = domText.slice(0, -1);\n  } // No change -- the DOM is up to date. Nothing to do here.\n\n\n  if (domText === modelText) {\n    // This can be buggy for some Android keyboards because they don't fire\n    // standard onkeydown/pressed events and only fired editOnInput\n    // so domText is already changed by the browser and ends up being equal\n    // to modelText unexpectedly.\n    // Newest versions of Android support the dom-inputevent-inputtype\n    // and we can use the `inputType` to properly apply the state changes.\n\n    /* $FlowFixMe[prop-missing] inputType is only defined on a draft of a\n     * standard. https://w3c.github.io/input-events/#dom-inputevent-inputtype\n     */\n    var inputType = e.nativeEvent.inputType;\n\n    if (inputType) {\n      var newEditorState = onInputType(inputType, editorState);\n\n      if (newEditorState !== editorState) {\n        editor.restoreEditorDOM();\n        editor.update(newEditorState);\n        return;\n      }\n    }\n\n    return;\n  }\n\n  var selection = editorState.getSelection(); // We'll replace the entire leaf with the text content of the target.\n\n  var targetRange = selection.merge({\n    anchorOffset: start,\n    focusOffset: end,\n    isBackward: false\n  });\n  var entityKey = block.getEntityAt(start);\n  var entity = notEmptyKey(entityKey) ? content.getEntity(entityKey) : null;\n  var entityType = entity != null ? entity.getMutability() : null;\n  var preserveEntity = entityType === 'MUTABLE'; // Immutable or segmented entities cannot properly be handled by the\n  // default browser undo, so we have to use a different change type to\n  // force using our internal undo method instead of falling through to the\n  // native browser undo.\n\n  var changeType = preserveEntity ? 'spellcheck-change' : 'apply-entity';\n  var newContent = DraftModifier.replaceText(content, targetRange, domText, block.getInlineStyleAt(start), preserveEntity ? block.getEntityAt(start) : null);\n  var anchorOffset, focusOffset, startOffset, endOffset;\n\n  if (isGecko) {\n    // Firefox selection does not change while the context menu is open, so\n    // we preserve the anchor and focus values of the DOM selection.\n    anchorOffset = domSelection.anchorOffset;\n    focusOffset = domSelection.focusOffset;\n    startOffset = start + Math.min(anchorOffset, focusOffset);\n    endOffset = startOffset + Math.abs(anchorOffset - focusOffset);\n    anchorOffset = startOffset;\n    focusOffset = endOffset;\n  } else {\n    // Browsers other than Firefox may adjust DOM selection while the context\n    // menu is open, and Safari autocorrect is prone to providing an inaccurate\n    // DOM selection. Don't trust it. Instead, use our existing SelectionState\n    // and adjust it based on the number of characters changed during the\n    // mutation.\n    var charDelta = domText.length - modelText.length;\n    startOffset = selection.getStartOffset();\n    endOffset = selection.getEndOffset();\n    anchorOffset = isCollapsed ? endOffset + charDelta : startOffset;\n    focusOffset = endOffset + charDelta;\n  } // Segmented entities are completely or partially removed when their\n  // text content changes. For this case we do not want any text to be selected\n  // after the change, so we are not merging the selection.\n\n\n  var contentWithAdjustedDOMSelection = newContent.merge({\n    selectionBefore: content.getSelectionAfter(),\n    selectionAfter: selection.merge({\n      anchorOffset: anchorOffset,\n      focusOffset: focusOffset\n    })\n  });\n  editor.update(EditorState.push(editorState, contentWithAdjustedDOMSelection, changeType));\n}\n\nmodule.exports = editOnInput;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar KeyBindingUtil = require(\"./KeyBindingUtil\");\n\nvar Keys = require(\"fbjs/lib/Keys\");\n\nvar SecondaryClipboard = require(\"./SecondaryClipboard\");\n\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nvar isEventHandled = require(\"./isEventHandled\");\n\nvar keyCommandBackspaceToStartOfLine = require(\"./keyCommandBackspaceToStartOfLine\");\n\nvar keyCommandBackspaceWord = require(\"./keyCommandBackspaceWord\");\n\nvar keyCommandDeleteWord = require(\"./keyCommandDeleteWord\");\n\nvar keyCommandInsertNewline = require(\"./keyCommandInsertNewline\");\n\nvar keyCommandMoveSelectionToEndOfBlock = require(\"./keyCommandMoveSelectionToEndOfBlock\");\n\nvar keyCommandMoveSelectionToStartOfBlock = require(\"./keyCommandMoveSelectionToStartOfBlock\");\n\nvar keyCommandPlainBackspace = require(\"./keyCommandPlainBackspace\");\n\nvar keyCommandPlainDelete = require(\"./keyCommandPlainDelete\");\n\nvar keyCommandTransposeCharacters = require(\"./keyCommandTransposeCharacters\");\n\nvar keyCommandUndo = require(\"./keyCommandUndo\");\n\nvar isOptionKeyCommand = KeyBindingUtil.isOptionKeyCommand;\nvar isChrome = UserAgent.isBrowser('Chrome');\n/**\n * Map a `DraftEditorCommand` command value to a corresponding function.\n */\n\nfunction onKeyCommand(command, editorState, e) {\n  switch (command) {\n    case 'redo':\n      return EditorState.redo(editorState);\n\n    case 'delete':\n      return keyCommandPlainDelete(editorState);\n\n    case 'delete-word':\n      return keyCommandDeleteWord(editorState);\n\n    case 'backspace':\n      return keyCommandPlainBackspace(editorState);\n\n    case 'backspace-word':\n      return keyCommandBackspaceWord(editorState);\n\n    case 'backspace-to-start-of-line':\n      return keyCommandBackspaceToStartOfLine(editorState, e);\n\n    case 'split-block':\n      return keyCommandInsertNewline(editorState);\n\n    case 'transpose-characters':\n      return keyCommandTransposeCharacters(editorState);\n\n    case 'move-selection-to-start-of-block':\n      return keyCommandMoveSelectionToStartOfBlock(editorState);\n\n    case 'move-selection-to-end-of-block':\n      return keyCommandMoveSelectionToEndOfBlock(editorState);\n\n    case 'secondary-cut':\n      return SecondaryClipboard.cut(editorState);\n\n    case 'secondary-paste':\n      return SecondaryClipboard.paste(editorState);\n\n    default:\n      return editorState;\n  }\n}\n/**\n * Intercept keydown behavior to handle keys and commands manually, if desired.\n *\n * Keydown combinations may be mapped to `DraftCommand` values, which may\n * correspond to command functions that modify the editor or its contents.\n *\n * See `getDefaultKeyBinding` for defaults. Alternatively, the top-level\n * component may provide a custom mapping via the `keyBindingFn` prop.\n */\n\n\nfunction editOnKeyDown(editor, e) {\n  var keyCode = e.which;\n  var editorState = editor._latestEditorState;\n\n  function callDeprecatedHandler(handlerName) {\n    var deprecatedHandler = editor.props[handlerName];\n\n    if (deprecatedHandler) {\n      deprecatedHandler(e);\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  switch (keyCode) {\n    case Keys.RETURN:\n      e.preventDefault(); // The top-level component may manually handle newline insertion. If\n      // no special handling is performed, fall through to command handling.\n\n      if (editor.props.handleReturn && isEventHandled(editor.props.handleReturn(e, editorState))) {\n        return;\n      }\n\n      break;\n\n    case Keys.ESC:\n      e.preventDefault();\n\n      if (callDeprecatedHandler('onEscape')) {\n        return;\n      }\n\n      break;\n\n    case Keys.TAB:\n      if (callDeprecatedHandler('onTab')) {\n        return;\n      }\n\n      break;\n\n    case Keys.UP:\n      if (callDeprecatedHandler('onUpArrow')) {\n        return;\n      }\n\n      break;\n\n    case Keys.RIGHT:\n      if (callDeprecatedHandler('onRightArrow')) {\n        return;\n      }\n\n      break;\n\n    case Keys.DOWN:\n      if (callDeprecatedHandler('onDownArrow')) {\n        return;\n      }\n\n      break;\n\n    case Keys.LEFT:\n      if (callDeprecatedHandler('onLeftArrow')) {\n        return;\n      }\n\n      break;\n\n    case Keys.SPACE:\n      // Prevent Chrome on OSX behavior where option + space scrolls.\n      if (isChrome && isOptionKeyCommand(e)) {\n        e.preventDefault();\n      }\n\n  }\n\n  var command = editor.props.keyBindingFn(e); // If no command is specified, allow keydown event to continue.\n\n  if (command == null || command === '') {\n    if (keyCode === Keys.SPACE && isChrome && isOptionKeyCommand(e)) {\n      // The default keydown event has already been prevented in order to stop\n      // Chrome from scrolling. Insert a nbsp into the editor as OSX would for\n      // other browsers.\n      var contentState = DraftModifier.replaceText(editorState.getCurrentContent(), editorState.getSelection(), \"\\xA0\");\n      editor.update(EditorState.push(editorState, contentState, 'insert-characters'));\n    }\n\n    return;\n  }\n\n  if (command === 'undo') {\n    // Since undo requires some special updating behavior to keep the editor\n    // in sync, handle it separately.\n    keyCommandUndo(e, editorState, editor.update);\n    return;\n  } // At this point, we know that we're handling a command of some kind, so\n  // we don't want to insert a character following the keydown.\n\n\n  e.preventDefault(); // Allow components higher up the tree to handle the command first.\n\n  if (editor.props.handleKeyCommand && isEventHandled(editor.props.handleKeyCommand(command, editorState, e.timeStamp))) {\n    return;\n  }\n\n  var newState = onKeyCommand(command, editorState, e);\n\n  if (newState !== editorState) {\n    editor.update(newState);\n  }\n}\n\nmodule.exports = editOnKeyDown;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar BlockMapBuilder = require(\"./BlockMapBuilder\");\n\nvar CharacterMetadata = require(\"./CharacterMetadata\");\n\nvar DataTransfer = require(\"fbjs/lib/DataTransfer\");\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar DraftPasteProcessor = require(\"./DraftPasteProcessor\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar RichTextEditorUtil = require(\"./RichTextEditorUtil\");\n\nvar getEntityKeyForSelection = require(\"./getEntityKeyForSelection\");\n\nvar getTextContentFromFiles = require(\"./getTextContentFromFiles\");\n\nvar isEventHandled = require(\"./isEventHandled\");\n\nvar splitTextIntoTextBlocks = require(\"./splitTextIntoTextBlocks\");\n/**\n * Paste content.\n */\n\n\nfunction editOnPaste(editor, e) {\n  e.preventDefault();\n  var data = new DataTransfer(e.clipboardData); // Get files, unless this is likely to be a string the user wants inline.\n\n  if (!data.isRichText()) {\n    var files = data.getFiles();\n    var defaultFileText = data.getText();\n\n    if (files.length > 0) {\n      // Allow customized paste handling for images, etc. Otherwise, fall\n      // through to insert text contents into the editor.\n      if (editor.props.handlePastedFiles && isEventHandled(editor.props.handlePastedFiles(files))) {\n        return;\n      }\n      /* $FlowFixMe[incompatible-call] This comment suppresses an error found\n       * DataTransfer was typed. getFiles() returns an array of <Files extends\n       * Blob>, not Blob */\n\n\n      getTextContentFromFiles(files, function (\n      /*string*/\n      fileText) {\n        fileText = fileText || defaultFileText;\n\n        if (!fileText) {\n          return;\n        }\n\n        var editorState = editor._latestEditorState;\n        var blocks = splitTextIntoTextBlocks(fileText);\n        var character = CharacterMetadata.create({\n          style: editorState.getCurrentInlineStyle(),\n          entity: getEntityKeyForSelection(editorState.getCurrentContent(), editorState.getSelection())\n        });\n        var currentBlockType = RichTextEditorUtil.getCurrentBlockType(editorState);\n        var text = DraftPasteProcessor.processText(blocks, character, currentBlockType);\n        var fragment = BlockMapBuilder.createFromArray(text);\n        var withInsertedText = DraftModifier.replaceWithFragment(editorState.getCurrentContent(), editorState.getSelection(), fragment);\n        editor.update(EditorState.push(editorState, withInsertedText, 'insert-fragment'));\n      });\n      return;\n    }\n  }\n\n  var textBlocks = [];\n  var text = data.getText();\n  var html = data.getHTML();\n  var editorState = editor._latestEditorState;\n\n  if (editor.props.formatPastedText) {\n    var _editor$props$formatP = editor.props.formatPastedText(text, html),\n        formattedText = _editor$props$formatP.text,\n        formattedHtml = _editor$props$formatP.html;\n\n    text = formattedText;\n    html = formattedHtml;\n  }\n\n  if (editor.props.handlePastedText && isEventHandled(editor.props.handlePastedText(text, html, editorState))) {\n    return;\n  }\n\n  if (text) {\n    textBlocks = splitTextIntoTextBlocks(text);\n  }\n\n  if (!editor.props.stripPastedStyles) {\n    // If the text from the paste event is rich content that matches what we\n    // already have on the internal clipboard, assume that we should just use\n    // the clipboard fragment for the paste. This will allow us to preserve\n    // styling and entities, if any are present. Note that newlines are\n    // stripped during comparison -- this is because copy/paste within the\n    // editor in Firefox and IE will not include empty lines. The resulting\n    // paste will preserve the newlines correctly.\n    var internalClipboard = editor.getClipboard();\n\n    if (!editor.props.formatPastedText && data.isRichText() && internalClipboard) {\n      var _html;\n\n      if ( // If the editorKey is present in the pasted HTML, it should be safe to\n      // assume this is an internal paste.\n      ((_html = html) === null || _html === void 0 ? void 0 : _html.indexOf(editor.getEditorKey())) !== -1 || // The copy may have been made within a single block, in which case the\n      // editor key won't be part of the paste. In this case, just check\n      // whether the pasted text matches the internal clipboard.\n      textBlocks.length === 1 && internalClipboard.size === 1 && internalClipboard.first().getText() === text) {\n        editor.update(insertFragment(editor._latestEditorState, internalClipboard));\n        return;\n      }\n    } else if (internalClipboard && data.types.includes('com.apple.webarchive') && !data.types.includes('text/html') && areTextBlocksAndClipboardEqual(textBlocks, internalClipboard)) {\n      // Safari does not properly store text/html in some cases.\n      // Use the internalClipboard if present and equal to what is on\n      // the clipboard. See https://bugs.webkit.org/show_bug.cgi?id=19893.\n      editor.update(insertFragment(editor._latestEditorState, internalClipboard));\n      return;\n    } // If there is html paste data, try to parse that.\n\n\n    if (html) {\n      var htmlFragment = DraftPasteProcessor.processHTML(html, editor.props.blockRenderMap);\n\n      if (htmlFragment) {\n        var contentBlocks = htmlFragment.contentBlocks,\n            entityMap = htmlFragment.entityMap;\n\n        if (contentBlocks) {\n          var htmlMap = BlockMapBuilder.createFromArray(contentBlocks);\n          editor.update(insertFragment(editor._latestEditorState, htmlMap, entityMap));\n          return;\n        }\n      }\n    } // Otherwise, create a new fragment from our pasted text. Also\n    // empty the internal clipboard, since it's no longer valid.\n\n\n    editor.setClipboard(null);\n  }\n\n  if (textBlocks.length) {\n    var character = CharacterMetadata.create({\n      style: editorState.getCurrentInlineStyle(),\n      entity: getEntityKeyForSelection(editorState.getCurrentContent(), editorState.getSelection())\n    });\n    var currentBlockType = RichTextEditorUtil.getCurrentBlockType(editorState);\n    var textFragment = DraftPasteProcessor.processText(textBlocks, character, currentBlockType);\n    var textMap = BlockMapBuilder.createFromArray(textFragment);\n    editor.update(insertFragment(editor._latestEditorState, textMap));\n  }\n}\n\nfunction insertFragment(editorState, fragment, entityMap) {\n  var newContent = DraftModifier.replaceWithFragment(editorState.getCurrentContent(), editorState.getSelection(), fragment); // TODO: merge the entity map once we stop using DraftEntity\n  // like this:\n  // const mergedEntityMap = newContent.getEntityMap().merge(entityMap);\n\n  return EditorState.push(editorState, newContent.set('entityMap', entityMap), 'insert-fragment');\n}\n\nfunction areTextBlocksAndClipboardEqual(textBlocks, blockMap) {\n  return textBlocks.length === blockMap.size && blockMap.valueSeq().every(function (block, ii) {\n    return block.getText() === textBlocks[ii];\n  });\n}\n\nmodule.exports = editOnPaste;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftJsDebugLogging = require(\"./DraftJsDebugLogging\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar getContentEditableContainer = require(\"./getContentEditableContainer\");\n\nvar getDraftEditorSelection = require(\"./getDraftEditorSelection\");\n\nfunction editOnSelect(editor) {\n  if (editor._blockSelectEvents || editor._latestEditorState !== editor.props.editorState) {\n    if (editor._blockSelectEvents) {\n      var _editorState = editor.props.editorState;\n\n      var selectionState = _editorState.getSelection();\n\n      DraftJsDebugLogging.logBlockedSelectionEvent({\n        // For now I don't think we need any other info\n        anonymizedDom: 'N/A',\n        extraParams: JSON.stringify({\n          stacktrace: new Error().stack\n        }),\n        selectionState: JSON.stringify(selectionState.toJS())\n      });\n    }\n\n    return;\n  }\n\n  var editorState = editor.props.editorState;\n  var documentSelection = getDraftEditorSelection(editorState, getContentEditableContainer(editor));\n  var updatedSelectionState = documentSelection.selectionState;\n\n  if (updatedSelectionState !== editorState.getSelection()) {\n    if (documentSelection.needsRecovery) {\n      editorState = EditorState.forceSelection(editorState, updatedSelectionState);\n    } else {\n      editorState = EditorState.acceptSelection(editorState, updatedSelectionState);\n    }\n\n    editor.update(editorState);\n  }\n}\n\nmodule.exports = editOnSelect;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftStringKey = require(\"./DraftStringKey\");\n\nvar UnicodeUtils = require(\"fbjs/lib/UnicodeUtils\");\n\nvar strlen = UnicodeUtils.strlen;\n/**\n * Convert to UTF-8 character counts for storage.\n */\n\nfunction encodeEntityRanges(block, storageMap) {\n  var encoded = [];\n  block.findEntityRanges(function (character) {\n    return !!character.getEntity();\n  }, function (\n  /*number*/\n  start,\n  /*number*/\n  end) {\n    var text = block.getText();\n    var key = block.getEntityAt(start);\n    encoded.push({\n      offset: strlen(text.slice(0, start)),\n      length: strlen(text.slice(start, end)),\n      // Encode the key as a number for range storage.\n      key: Number(storageMap[DraftStringKey.stringify(key)])\n    });\n  });\n  return encoded;\n}\n\nmodule.exports = encodeEntityRanges;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar UnicodeUtils = require(\"fbjs/lib/UnicodeUtils\");\n\nvar findRangesImmutable = require(\"./findRangesImmutable\");\n\nvar areEqual = function areEqual(a, b) {\n  return a === b;\n};\n\nvar isTruthy = function isTruthy(a) {\n  return !!a;\n};\n\nvar EMPTY_ARRAY = [];\n/**\n * Helper function for getting encoded styles for each inline style. Convert\n * to UTF-8 character counts for storage.\n */\n\nfunction getEncodedInlinesForType(block, styleList, styleToEncode) {\n  var ranges = []; // Obtain an array with ranges for only the specified style.\n\n  var filteredInlines = styleList.map(function (style) {\n    return style.has(styleToEncode);\n  }).toList();\n  findRangesImmutable(filteredInlines, areEqual, // We only want to keep ranges with nonzero style values.\n  isTruthy, function (start, end) {\n    var text = block.getText();\n    ranges.push({\n      offset: UnicodeUtils.strlen(text.slice(0, start)),\n      length: UnicodeUtils.strlen(text.slice(start, end)),\n      style: styleToEncode\n    });\n  });\n  return ranges;\n}\n/*\n * Retrieve the encoded arrays of inline styles, with each individual style\n * treated separately.\n */\n\n\nfunction encodeInlineStyleRanges(block) {\n  var styleList = block.getCharacterList().map(function (c) {\n    return c.getStyle();\n  }).toList();\n  var ranges = styleList.flatten().toSet().map(function (style) {\n    return getEncodedInlinesForType(block, styleList, style);\n  });\n  return Array.prototype.concat.apply(EMPTY_ARRAY, ranges.toJS());\n}\n\nmodule.exports = encodeInlineStyleRanges;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nvar UnicodeUtils = require(\"fbjs/lib/UnicodeUtils\");\n\nvar getCorrectDocumentFromNode = require(\"./getCorrectDocumentFromNode\");\n\nvar getRangeClientRects = require(\"./getRangeClientRects\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n/**\n * Return the computed line height, in pixels, for the provided element.\n */\n\n\nfunction getLineHeightPx(element) {\n  var computed = getComputedStyle(element);\n  var correctDocument = getCorrectDocumentFromNode(element);\n  var div = correctDocument.createElement('div');\n  div.style.fontFamily = computed.fontFamily;\n  div.style.fontSize = computed.fontSize;\n  div.style.fontStyle = computed.fontStyle;\n  div.style.fontWeight = computed.fontWeight;\n  div.style.lineHeight = computed.lineHeight;\n  div.style.position = 'absolute';\n  div.textContent = 'M';\n  var documentBody = correctDocument.body;\n  !documentBody ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Missing document.body') : invariant(false) : void 0; // forced layout here\n\n  documentBody.appendChild(div);\n  var rect = div.getBoundingClientRect();\n  documentBody.removeChild(div);\n  return rect.height;\n}\n/**\n * Return whether every ClientRect in the provided list lies on the same line.\n *\n * We assume that the rects on the same line all contain the baseline, so the\n * lowest top line needs to be above the highest bottom line (i.e., if you were\n * to project the rects onto the y-axis, their intersection would be nonempty).\n *\n * In addition, we require that no two boxes are lineHeight (or more) apart at\n * either top or bottom, which helps protect against false positives for fonts\n * with extremely large glyph heights (e.g., with a font size of 17px, Zapfino\n * produces rects of height 58px!).\n */\n\n\nfunction areRectsOnOneLine(rects, lineHeight) {\n  var minTop = Infinity;\n  var minBottom = Infinity;\n  var maxTop = -Infinity;\n  var maxBottom = -Infinity;\n\n  for (var ii = 0; ii < rects.length; ii++) {\n    var rect = rects[ii];\n\n    if (rect.width === 0 || rect.width === 1) {\n      // When a range starts or ends a soft wrap, many browsers (Chrome, IE,\n      // Safari) include an empty rect on the previous or next line. When the\n      // text lies in a container whose position is not integral (e.g., from\n      // margin: auto), Safari makes these empty rects have width 1 (instead of\n      // 0). Having one-pixel-wide characters seems unlikely (and most browsers\n      // report widths in subpixel precision anyway) so it's relatively safe to\n      // skip over them.\n      continue;\n    }\n\n    minTop = Math.min(minTop, rect.top);\n    minBottom = Math.min(minBottom, rect.bottom);\n    maxTop = Math.max(maxTop, rect.top);\n    maxBottom = Math.max(maxBottom, rect.bottom);\n  }\n\n  return maxTop <= minBottom && maxTop - minTop < lineHeight && maxBottom - minBottom < lineHeight;\n}\n/**\n * Return the length of a node, as used by Range offsets.\n */\n\n\nfunction getNodeLength(node) {\n  // http://www.w3.org/TR/dom/#concept-node-length\n  switch (node.nodeType) {\n    case Node.DOCUMENT_TYPE_NODE:\n      return 0;\n\n    case Node.TEXT_NODE:\n    case Node.PROCESSING_INSTRUCTION_NODE:\n    case Node.COMMENT_NODE:\n      return node.length;\n\n    default:\n      return node.childNodes.length;\n  }\n}\n/**\n * Given a collapsed range, move the start position backwards as far as\n * possible while the range still spans only a single line.\n */\n\n\nfunction expandRangeToStartOfLine(range) {\n  !range.collapsed ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'expandRangeToStartOfLine: Provided range is not collapsed.') : invariant(false) : void 0;\n  range = range.cloneRange();\n  var containingElement = range.startContainer;\n\n  if (containingElement.nodeType !== 1) {\n    containingElement = containingElement.parentNode;\n  }\n\n  var lineHeight = getLineHeightPx(containingElement); // Imagine our text looks like:\n  //   <div><span>once upon a time, there was a <em>boy\n  //   who lived</em> </span><q><strong>under^ the\n  //   stairs</strong> in a small closet.</q></div>\n  // where the caret represents the cursor. First, we crawl up the tree until\n  // the range spans multiple lines (setting the start point to before\n  // \"<strong>\", then before \"<div>\"), then at each level we do a search to\n  // find the latest point which is still on a previous line. We'll find that\n  // the break point is inside the span, then inside the <em>, then in its text\n  // node child, the actual break point before \"who\".\n\n  var bestContainer = range.endContainer;\n  var bestOffset = range.endOffset;\n  range.setStart(range.startContainer, 0);\n\n  while (areRectsOnOneLine(getRangeClientRects(range), lineHeight)) {\n    bestContainer = range.startContainer;\n    bestOffset = range.startOffset;\n    !bestContainer.parentNode ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Found unexpected detached subtree when traversing.') : invariant(false) : void 0;\n    range.setStartBefore(bestContainer);\n\n    if (bestContainer.nodeType === 1 && getComputedStyle(bestContainer).display !== 'inline') {\n      // The start of the line is never in a different block-level container.\n      break;\n    }\n  } // In the above example, range now spans from \"<div>\" to \"under\",\n  // bestContainer is <div>, and bestOffset is 1 (index of <q> inside <div>)].\n  // Picking out which child to recurse into here is a special case since we\n  // don't want to check past <q> -- once we find that the final range starts\n  // in <span>, we can look at all of its children (and all of their children)\n  // to find the break point.\n  // At all times, (bestContainer, bestOffset) is the latest single-line start\n  // point that we know of.\n\n\n  var currentContainer = bestContainer;\n  var maxIndexToConsider = bestOffset - 1;\n\n  do {\n    var nodeValue = currentContainer.nodeValue;\n    var ii = maxIndexToConsider;\n\n    for (; ii >= 0; ii--) {\n      if (nodeValue != null && ii > 0 && UnicodeUtils.isSurrogatePair(nodeValue, ii - 1)) {\n        // We're in the middle of a surrogate pair -- skip over so we never\n        // return a range with an endpoint in the middle of a code point.\n        continue;\n      }\n\n      range.setStart(currentContainer, ii);\n\n      if (areRectsOnOneLine(getRangeClientRects(range), lineHeight)) {\n        bestContainer = currentContainer;\n        bestOffset = ii;\n      } else {\n        break;\n      }\n    }\n\n    if (ii === -1 || currentContainer.childNodes.length === 0) {\n      // If ii === -1, then (bestContainer, bestOffset), which is equal to\n      // (currentContainer, 0), was a single-line start point but a start\n      // point before currentContainer wasn't, so the line break seems to\n      // have occurred immediately after currentContainer's start tag\n      //\n      // If currentContainer.childNodes.length === 0, we're already at a\n      // terminal node (e.g., text node) and should return our current best.\n      break;\n    }\n\n    currentContainer = currentContainer.childNodes[ii];\n    maxIndexToConsider = getNodeLength(currentContainer);\n  } while (true);\n\n  range.setStart(bestContainer, bestOffset);\n  return range;\n}\n\nmodule.exports = expandRangeToStartOfLine;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar getCorrectDocumentFromNode = require(\"./getCorrectDocumentFromNode\");\n\nvar getSelectionOffsetKeyForNode = require(\"./getSelectionOffsetKeyForNode\");\n/**\n * Get the key from the node's nearest offset-aware ancestor.\n */\n\n\nfunction findAncestorOffsetKey(node) {\n  var searchNode = node;\n\n  while (searchNode && searchNode !== getCorrectDocumentFromNode(node).documentElement) {\n    var key = getSelectionOffsetKeyForNode(searchNode);\n\n    if (key != null) {\n      return key;\n    }\n\n    searchNode = searchNode.parentNode;\n  }\n\n  return null;\n}\n\nmodule.exports = findAncestorOffsetKey;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\n/**\n * Search through an array to find contiguous stretches of elements that\n * match a specified filter function.\n *\n * When ranges are found, execute a specified `found` function to supply\n * the values to the caller.\n */\nfunction findRangesImmutable(haystack, areEqualFn, filterFn, foundFn) {\n  if (!haystack.size) {\n    return;\n  }\n\n  var cursor = 0;\n  haystack.reduce(function (value, nextValue, nextIndex) {\n    if (!areEqualFn(value, nextValue)) {\n      if (filterFn(value)) {\n        foundFn(cursor, nextIndex);\n      }\n\n      cursor = nextIndex;\n    }\n\n    return nextValue;\n  });\n  filterFn(haystack.last()) && foundFn(cursor, haystack.count());\n}\n\nmodule.exports = findRangesImmutable;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar seenKeys = {};\nvar MULTIPLIER = Math.pow(2, 24);\n\nfunction generateRandomKey() {\n  var key;\n\n  while (key === undefined || seenKeys.hasOwnProperty(key) || !isNaN(+key)) {\n    key = Math.floor(Math.random() * MULTIPLIER).toString(32);\n  }\n\n  seenKeys[key] = true;\n  return key;\n}\n\nmodule.exports = generateRandomKey;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftEntitySegments = require(\"./DraftEntitySegments\");\n\nvar getRangesForDraftEntity = require(\"./getRangesForDraftEntity\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n/**\n * Given a SelectionState and a removal direction, determine the entire range\n * that should be removed from a ContentState. This is based on any entities\n * within the target, with their `mutability` values taken into account.\n *\n * For instance, if we are attempting to remove part of an \"immutable\" entity\n * range, the entire entity must be removed. The returned `SelectionState`\n * will be adjusted accordingly.\n */\n\n\nfunction getCharacterRemovalRange(entityMap, startBlock, endBlock, selectionState, direction) {\n  var start = selectionState.getStartOffset();\n  var end = selectionState.getEndOffset();\n  var startEntityKey = startBlock.getEntityAt(start);\n  var endEntityKey = endBlock.getEntityAt(end - 1);\n\n  if (!startEntityKey && !endEntityKey) {\n    return selectionState;\n  }\n\n  var newSelectionState = selectionState;\n\n  if (startEntityKey && startEntityKey === endEntityKey) {\n    newSelectionState = getEntityRemovalRange(entityMap, startBlock, newSelectionState, direction, startEntityKey, true, true);\n  } else if (startEntityKey && endEntityKey) {\n    var startSelectionState = getEntityRemovalRange(entityMap, startBlock, newSelectionState, direction, startEntityKey, false, true);\n    var endSelectionState = getEntityRemovalRange(entityMap, endBlock, newSelectionState, direction, endEntityKey, false, false);\n    newSelectionState = newSelectionState.merge({\n      anchorOffset: startSelectionState.getAnchorOffset(),\n      focusOffset: endSelectionState.getFocusOffset(),\n      isBackward: false\n    });\n  } else if (startEntityKey) {\n    var _startSelectionState = getEntityRemovalRange(entityMap, startBlock, newSelectionState, direction, startEntityKey, false, true);\n\n    newSelectionState = newSelectionState.merge({\n      anchorOffset: _startSelectionState.getStartOffset(),\n      isBackward: false\n    });\n  } else if (endEntityKey) {\n    var _endSelectionState = getEntityRemovalRange(entityMap, endBlock, newSelectionState, direction, endEntityKey, false, false);\n\n    newSelectionState = newSelectionState.merge({\n      focusOffset: _endSelectionState.getEndOffset(),\n      isBackward: false\n    });\n  }\n\n  return newSelectionState;\n}\n\nfunction getEntityRemovalRange(entityMap, block, selectionState, direction, entityKey, isEntireSelectionWithinEntity, isEntityAtStart) {\n  var start = selectionState.getStartOffset();\n  var end = selectionState.getEndOffset();\n\n  var entity = entityMap.__get(entityKey);\n\n  var mutability = entity.getMutability();\n  var sideToConsider = isEntityAtStart ? start : end; // `MUTABLE` entities can just have the specified range of text removed\n  // directly. No adjustments are needed.\n\n  if (mutability === 'MUTABLE') {\n    return selectionState;\n  } // Find the entity range that overlaps with our removal range.\n\n\n  var entityRanges = getRangesForDraftEntity(block, entityKey).filter(function (range) {\n    return sideToConsider <= range.end && sideToConsider >= range.start;\n  });\n  !(entityRanges.length == 1) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'There should only be one entity range within this removal range.') : invariant(false) : void 0;\n  var entityRange = entityRanges[0]; // For `IMMUTABLE` entity types, we will remove the entire entity range.\n\n  if (mutability === 'IMMUTABLE') {\n    return selectionState.merge({\n      anchorOffset: entityRange.start,\n      focusOffset: entityRange.end,\n      isBackward: false\n    });\n  } // For `SEGMENTED` entity types, determine the appropriate segment to\n  // remove.\n\n\n  if (!isEntireSelectionWithinEntity) {\n    if (isEntityAtStart) {\n      end = entityRange.end;\n    } else {\n      start = entityRange.start;\n    }\n  }\n\n  var removalRange = DraftEntitySegments.getRemovalRange(start, end, block.getText().slice(entityRange.start, entityRange.end), entityRange.start, direction);\n  return selectionState.merge({\n    anchorOffset: removalRange.start,\n    focusOffset: removalRange.end,\n    isBackward: false\n  });\n}\n\nmodule.exports = getCharacterRemovalRange;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar isHTMLElement = require(\"./isHTMLElement\");\n\nfunction getContentEditableContainer(editor) {\n  var editorNode = editor.editorContainer;\n  !editorNode ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Missing editorNode') : invariant(false) : void 0;\n  !isHTMLElement(editorNode.firstChild) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'editorNode.firstChild is not an HTMLElement') : invariant(false) : void 0;\n  var htmlElement = editorNode.firstChild;\n  return htmlElement;\n}\n\nmodule.exports = getContentEditableContainer;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar randomizeBlockMapKeys = require(\"./randomizeBlockMapKeys\");\n\nvar removeEntitiesAtEdges = require(\"./removeEntitiesAtEdges\");\n\nvar getContentStateFragment = function getContentStateFragment(contentState, selectionState) {\n  var startKey = selectionState.getStartKey();\n  var startOffset = selectionState.getStartOffset();\n  var endKey = selectionState.getEndKey();\n  var endOffset = selectionState.getEndOffset(); // Edge entities should be stripped to ensure that we don't preserve\n  // invalid partial entities when the fragment is reused. We do, however,\n  // preserve entities that are entirely within the selection range.\n\n  var contentWithoutEdgeEntities = removeEntitiesAtEdges(contentState, selectionState);\n  var blockMap = contentWithoutEdgeEntities.getBlockMap();\n  var blockKeys = blockMap.keySeq();\n  var startIndex = blockKeys.indexOf(startKey);\n  var endIndex = blockKeys.indexOf(endKey) + 1;\n  return randomizeBlockMapKeys(blockMap.slice(startIndex, endIndex).map(function (block, blockKey) {\n    var text = block.getText();\n    var chars = block.getCharacterList();\n\n    if (startKey === endKey) {\n      return block.merge({\n        text: text.slice(startOffset, endOffset),\n        characterList: chars.slice(startOffset, endOffset)\n      });\n    }\n\n    if (blockKey === startKey) {\n      return block.merge({\n        text: text.slice(startOffset),\n        characterList: chars.slice(startOffset)\n      });\n    }\n\n    if (blockKey === endKey) {\n      return block.merge({\n        text: text.slice(0, endOffset),\n        characterList: chars.slice(0, endOffset)\n      });\n    }\n\n    return block;\n  }));\n};\n\nmodule.exports = getContentStateFragment;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nfunction getCorrectDocumentFromNode(node) {\n  if (!node || !node.ownerDocument) {\n    return document;\n  }\n\n  return node.ownerDocument;\n}\n\nmodule.exports = getCorrectDocumentFromNode;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar KeyBindingUtil = require(\"./KeyBindingUtil\");\n\nvar Keys = require(\"fbjs/lib/Keys\");\n\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nvar isOSX = UserAgent.isPlatform('Mac OS X'); // Firefox on OSX had a bug resulting in navigation instead of cursor movement.\n// This bug was fixed in Firefox 29. Feature detection is virtually impossible\n// so we just check the version number. See #342765.\n\nvar shouldFixFirefoxMovement = isOSX && UserAgent.isBrowser('Firefox < 29');\nvar hasCommandModifier = KeyBindingUtil.hasCommandModifier,\n    isCtrlKeyCommand = KeyBindingUtil.isCtrlKeyCommand;\n\nfunction shouldRemoveWord(e) {\n  return isOSX && e.altKey || isCtrlKeyCommand(e);\n}\n/**\n * Get the appropriate undo/redo command for a Z key command.\n */\n\n\nfunction getZCommand(e) {\n  if (!hasCommandModifier(e)) {\n    return null;\n  }\n\n  return e.shiftKey ? 'redo' : 'undo';\n}\n\nfunction getDeleteCommand(e) {\n  // Allow default \"cut\" behavior for PCs on Shift + Delete.\n  if (!isOSX && e.shiftKey) {\n    return null;\n  }\n\n  return shouldRemoveWord(e) ? 'delete-word' : 'delete';\n}\n\nfunction getBackspaceCommand(e) {\n  if (hasCommandModifier(e) && isOSX) {\n    return 'backspace-to-start-of-line';\n  }\n\n  return shouldRemoveWord(e) ? 'backspace-word' : 'backspace';\n}\n/**\n * Retrieve a bound key command for the given event.\n */\n\n\nfunction getDefaultKeyBinding(e) {\n  switch (e.keyCode) {\n    case 66:\n      // B\n      return hasCommandModifier(e) ? 'bold' : null;\n\n    case 68:\n      // D\n      return isCtrlKeyCommand(e) ? 'delete' : null;\n\n    case 72:\n      // H\n      return isCtrlKeyCommand(e) ? 'backspace' : null;\n\n    case 73:\n      // I\n      return hasCommandModifier(e) ? 'italic' : null;\n\n    case 74:\n      // J\n      return hasCommandModifier(e) ? 'code' : null;\n\n    case 75:\n      // K\n      return isOSX && isCtrlKeyCommand(e) ? 'secondary-cut' : null;\n\n    case 77:\n      // M\n      return isCtrlKeyCommand(e) ? 'split-block' : null;\n\n    case 79:\n      // O\n      return isCtrlKeyCommand(e) ? 'split-block' : null;\n\n    case 84:\n      // T\n      return isOSX && isCtrlKeyCommand(e) ? 'transpose-characters' : null;\n\n    case 85:\n      // U\n      return hasCommandModifier(e) ? 'underline' : null;\n\n    case 87:\n      // W\n      return isOSX && isCtrlKeyCommand(e) ? 'backspace-word' : null;\n\n    case 89:\n      // Y\n      if (isCtrlKeyCommand(e)) {\n        return isOSX ? 'secondary-paste' : 'redo';\n      }\n\n      return null;\n\n    case 90:\n      // Z\n      return getZCommand(e) || null;\n\n    case Keys.RETURN:\n      return 'split-block';\n\n    case Keys.DELETE:\n      return getDeleteCommand(e);\n\n    case Keys.BACKSPACE:\n      return getBackspaceCommand(e);\n    // LEFT/RIGHT handlers serve as a workaround for a Firefox bug.\n\n    case Keys.LEFT:\n      return shouldFixFirefoxMovement && hasCommandModifier(e) ? 'move-selection-to-start-of-block' : null;\n\n    case Keys.RIGHT:\n      return shouldFixFirefoxMovement && hasCommandModifier(e) ? 'move-selection-to-end-of-block' : null;\n\n    default:\n      return null;\n  }\n}\n\nmodule.exports = getDefaultKeyBinding;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar getDraftEditorSelectionWithNodes = require(\"./getDraftEditorSelectionWithNodes\");\n/**\n * Convert the current selection range to an anchor/focus pair of offset keys\n * and values that can be interpreted by components.\n */\n\n\nfunction getDraftEditorSelection(editorState, root) {\n  var selection = root.ownerDocument.defaultView.getSelection();\n  var anchorNode = selection.anchorNode,\n      anchorOffset = selection.anchorOffset,\n      focusNode = selection.focusNode,\n      focusOffset = selection.focusOffset,\n      rangeCount = selection.rangeCount;\n\n  if ( // No active selection.\n  rangeCount === 0 || // No selection, ever. As in, the user hasn't selected anything since\n  // opening the document.\n  anchorNode == null || focusNode == null) {\n    return {\n      selectionState: editorState.getSelection().set('hasFocus', false),\n      needsRecovery: false\n    };\n  }\n\n  return getDraftEditorSelectionWithNodes(editorState, root, anchorNode, anchorOffset, focusNode, focusOffset);\n}\n\nmodule.exports = getDraftEditorSelection;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar findAncestorOffsetKey = require(\"./findAncestorOffsetKey\");\n\nvar getSelectionOffsetKeyForNode = require(\"./getSelectionOffsetKeyForNode\");\n\nvar getUpdatedSelectionState = require(\"./getUpdatedSelectionState\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar isElement = require(\"./isElement\");\n\nvar nullthrows = require(\"fbjs/lib/nullthrows\");\n\n/**\n * Convert the current selection range to an anchor/focus pair of offset keys\n * and values that can be interpreted by components.\n */\nfunction getDraftEditorSelectionWithNodes(editorState, root, anchorNode, anchorOffset, focusNode, focusOffset) {\n  var anchorIsTextNode = anchorNode.nodeType === Node.TEXT_NODE;\n  var focusIsTextNode = focusNode.nodeType === Node.TEXT_NODE; // If the selection range lies only on text nodes, the task is simple.\n  // Find the nearest offset-aware elements and use the\n  // offset values supplied by the selection range.\n\n  if (anchorIsTextNode && focusIsTextNode) {\n    return {\n      selectionState: getUpdatedSelectionState(editorState, nullthrows(findAncestorOffsetKey(anchorNode)), anchorOffset, nullthrows(findAncestorOffsetKey(focusNode)), focusOffset),\n      needsRecovery: false\n    };\n  }\n\n  var anchorPoint = null;\n  var focusPoint = null;\n  var needsRecovery = true; // An element is selected. Convert this selection range into leaf offset\n  // keys and offset values for consumption at the component level. This\n  // is common in Firefox, where select-all and triple click behavior leads\n  // to entire elements being selected.\n  //\n  // Note that we use the `needsRecovery` parameter in the callback here. This\n  // is because when certain elements are selected, the behavior for subsequent\n  // cursor movement (e.g. via arrow keys) is uncertain and may not match\n  // expectations at the component level. For example, if an entire <div> is\n  // selected and the user presses the right arrow, Firefox keeps the selection\n  // on the <div>. If we allow subsequent keypresses to insert characters\n  // natively, they will be inserted into a browser-created text node to the\n  // right of that <div>. This is obviously undesirable.\n  //\n  // With the `needsRecovery` flag, we inform the caller that it is responsible\n  // for manually setting the selection state on the rendered document to\n  // ensure proper selection state maintenance.\n\n  if (anchorIsTextNode) {\n    anchorPoint = {\n      key: nullthrows(findAncestorOffsetKey(anchorNode)),\n      offset: anchorOffset\n    };\n    focusPoint = getPointForNonTextNode(root, focusNode, focusOffset);\n  } else if (focusIsTextNode) {\n    focusPoint = {\n      key: nullthrows(findAncestorOffsetKey(focusNode)),\n      offset: focusOffset\n    };\n    anchorPoint = getPointForNonTextNode(root, anchorNode, anchorOffset);\n  } else {\n    anchorPoint = getPointForNonTextNode(root, anchorNode, anchorOffset);\n    focusPoint = getPointForNonTextNode(root, focusNode, focusOffset); // If the selection is collapsed on an empty block, don't force recovery.\n    // This way, on arrow key selection changes, the browser can move the\n    // cursor from a non-zero offset on one block, through empty blocks,\n    // to a matching non-zero offset on other text blocks.\n\n    if (anchorNode === focusNode && anchorOffset === focusOffset) {\n      needsRecovery = !!anchorNode.firstChild && anchorNode.firstChild.nodeName !== 'BR';\n    }\n  }\n\n  return {\n    selectionState: getUpdatedSelectionState(editorState, anchorPoint.key, anchorPoint.offset, focusPoint.key, focusPoint.offset),\n    needsRecovery: needsRecovery\n  };\n}\n/**\n * Identify the first leaf descendant for the given node.\n */\n\n\nfunction getFirstLeaf(node) {\n  while (node.firstChild && ( // data-blocks has no offset\n  isElement(node.firstChild) && node.firstChild.getAttribute('data-blocks') === 'true' || getSelectionOffsetKeyForNode(node.firstChild))) {\n    node = node.firstChild;\n  }\n\n  return node;\n}\n/**\n * Identify the last leaf descendant for the given node.\n */\n\n\nfunction getLastLeaf(node) {\n  while (node.lastChild && ( // data-blocks has no offset\n  isElement(node.lastChild) && node.lastChild.getAttribute('data-blocks') === 'true' || getSelectionOffsetKeyForNode(node.lastChild))) {\n    node = node.lastChild;\n  }\n\n  return node;\n}\n\nfunction getPointForNonTextNode(editorRoot, startNode, childOffset) {\n  var node = startNode;\n  var offsetKey = findAncestorOffsetKey(node);\n  !(offsetKey != null || editorRoot && (editorRoot === node || editorRoot.firstChild === node)) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Unknown node in selection range.') : invariant(false) : void 0; // If the editorRoot is the selection, step downward into the content\n  // wrapper.\n\n  if (editorRoot === node) {\n    node = node.firstChild;\n    !isElement(node) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Invalid DraftEditorContents node.') : invariant(false) : void 0;\n    var castedNode = node; // assignment only added for flow :/\n    // otherwise it throws in line 200 saying that node can be null or undefined\n\n    node = castedNode;\n    !(node.getAttribute('data-contents') === 'true') ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Invalid DraftEditorContents structure.') : invariant(false) : void 0;\n\n    if (childOffset > 0) {\n      childOffset = node.childNodes.length;\n    }\n  } // If the child offset is zero and we have an offset key, we're done.\n  // If there's no offset key because the entire editor is selected,\n  // find the leftmost (\"first\") leaf in the tree and use that as the offset\n  // key.\n\n\n  if (childOffset === 0) {\n    var key = null;\n\n    if (offsetKey != null) {\n      key = offsetKey;\n    } else {\n      var firstLeaf = getFirstLeaf(node);\n      key = nullthrows(getSelectionOffsetKeyForNode(firstLeaf));\n    }\n\n    return {\n      key: key,\n      offset: 0\n    };\n  }\n\n  var nodeBeforeCursor = node.childNodes[childOffset - 1];\n  var leafKey = null;\n  var textLength = null;\n\n  if (!getSelectionOffsetKeyForNode(nodeBeforeCursor)) {\n    // Our target node may be a leaf or a text node, in which case we're\n    // already where we want to be and can just use the child's length as\n    // our offset.\n    leafKey = nullthrows(offsetKey);\n    textLength = getTextContentLength(nodeBeforeCursor);\n  } else {\n    // Otherwise, we'll look at the child to the left of the cursor and find\n    // the last leaf node in its subtree.\n    var lastLeaf = getLastLeaf(nodeBeforeCursor);\n    leafKey = nullthrows(getSelectionOffsetKeyForNode(lastLeaf));\n    textLength = getTextContentLength(lastLeaf);\n  }\n\n  return {\n    key: leafKey,\n    offset: textLength\n  };\n}\n/**\n * Return the length of a node's textContent, regarding single newline\n * characters as zero-length. This allows us to avoid problems with identifying\n * the correct selection offset for empty blocks in IE, in which we\n * render newlines instead of break tags.\n */\n\n\nfunction getTextContentLength(node) {\n  var textContent = node.textContent;\n  return textContent === '\\n' ? 0 : textContent.length;\n}\n\nmodule.exports = getDraftEditorSelectionWithNodes;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar _require = require(\"./draftKeyUtils\"),\n    notEmptyKey = _require.notEmptyKey;\n/**\n * Return the entity key that should be used when inserting text for the\n * specified target selection, only if the entity is `MUTABLE`. `IMMUTABLE`\n * and `SEGMENTED` entities should not be used for insertion behavior.\n */\n\n\nfunction getEntityKeyForSelection(contentState, targetSelection) {\n  var entityKey;\n\n  if (targetSelection.isCollapsed()) {\n    var key = targetSelection.getAnchorKey();\n    var offset = targetSelection.getAnchorOffset();\n\n    if (offset > 0) {\n      entityKey = contentState.getBlockForKey(key).getEntityAt(offset - 1);\n\n      if (entityKey !== contentState.getBlockForKey(key).getEntityAt(offset)) {\n        return null;\n      }\n\n      return filterKey(contentState.getEntityMap(), entityKey);\n    }\n\n    return null;\n  }\n\n  var startKey = targetSelection.getStartKey();\n  var startOffset = targetSelection.getStartOffset();\n  var startBlock = contentState.getBlockForKey(startKey);\n  entityKey = startOffset === startBlock.getLength() ? null : startBlock.getEntityAt(startOffset);\n  return filterKey(contentState.getEntityMap(), entityKey);\n}\n/**\n * Determine whether an entity key corresponds to a `MUTABLE` entity. If so,\n * return it. If not, return null.\n */\n\n\nfunction filterKey(entityMap, entityKey) {\n  if (notEmptyKey(entityKey)) {\n    var entity = entityMap.__get(entityKey);\n\n    return entity.getMutability() === 'MUTABLE' ? entityKey : null;\n  }\n\n  return null;\n}\n\nmodule.exports = getEntityKeyForSelection;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar getContentStateFragment = require(\"./getContentStateFragment\");\n\nfunction getFragmentFromSelection(editorState) {\n  var selectionState = editorState.getSelection();\n\n  if (selectionState.isCollapsed()) {\n    return null;\n  }\n\n  return getContentStateFragment(editorState.getCurrentContent(), selectionState);\n}\n\nmodule.exports = getFragmentFromSelection;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n *\n * This is unstable and not part of the public API and should not be used by\n * production systems. This file may be update/removed without notice.\n */\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar getNextDelimiterBlockKey = function getNextDelimiterBlockKey(block, blockMap) {\n  var isExperimentalTreeBlock = block instanceof ContentBlockNode;\n\n  if (!isExperimentalTreeBlock) {\n    return null;\n  }\n\n  var nextSiblingKey = block.getNextSiblingKey();\n\n  if (nextSiblingKey) {\n    return nextSiblingKey;\n  }\n\n  var parent = block.getParentKey();\n\n  if (!parent) {\n    return null;\n  }\n\n  var nextNonDescendantBlock = blockMap.get(parent);\n\n  while (nextNonDescendantBlock && !nextNonDescendantBlock.getNextSiblingKey()) {\n    var parentKey = nextNonDescendantBlock.getParentKey();\n    nextNonDescendantBlock = parentKey ? blockMap.get(parentKey) : null;\n  }\n\n  if (!nextNonDescendantBlock) {\n    return null;\n  }\n\n  return nextNonDescendantBlock.getNextSiblingKey();\n};\n\nmodule.exports = getNextDelimiterBlockKey;","\"use strict\";\n\n/**\n * Copyright 2004-present Facebook. All Rights Reserved.\n *\n * \n * @typechecks\n * @format\n */\n\n/**\n * Retrieve an object's own values as an array. If you want the values in the\n * protoype chain, too, use getObjectValuesIncludingPrototype.\n *\n * If you are looking for a function that creates an Array instance based\n * on an \"Array-like\" object, use createArrayFrom instead.\n *\n * @param {object} obj An object.\n * @return {array}     The object's values.\n */\nfunction getOwnObjectValues(obj) {\n  return Object.keys(obj).map(function (key) {\n    return obj[key];\n  });\n}\n\nmodule.exports = getOwnObjectValues;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar getRangeClientRects = require(\"./getRangeClientRects\");\n\n/**\n * Like range.getBoundingClientRect() but normalizes for browser bugs.\n */\nfunction getRangeBoundingClientRect(range) {\n  // \"Return a DOMRect object describing the smallest rectangle that includes\n  // the first rectangle in list and all of the remaining rectangles of which\n  // the height or width is not zero.\"\n  // http://www.w3.org/TR/cssom-view/#dom-range-getboundingclientrect\n  var rects = getRangeClientRects(range);\n  var top = 0;\n  var right = 0;\n  var bottom = 0;\n  var left = 0;\n\n  if (rects.length) {\n    // If the first rectangle has 0 width, we use the second, this is needed\n    // because Chrome renders a 0 width rectangle when the selection contains\n    // a line break.\n    if (rects.length > 1 && rects[0].width === 0) {\n      var _rects$ = rects[1];\n      top = _rects$.top;\n      right = _rects$.right;\n      bottom = _rects$.bottom;\n      left = _rects$.left;\n    } else {\n      var _rects$2 = rects[0];\n      top = _rects$2.top;\n      right = _rects$2.right;\n      bottom = _rects$2.bottom;\n      left = _rects$2.left;\n    }\n\n    for (var ii = 1; ii < rects.length; ii++) {\n      var rect = rects[ii];\n\n      if (rect.height !== 0 && rect.width !== 0) {\n        top = Math.min(top, rect.top);\n        right = Math.max(right, rect.right);\n        bottom = Math.max(bottom, rect.bottom);\n        left = Math.min(left, rect.left);\n      }\n    }\n  }\n\n  return {\n    top: top,\n    right: right,\n    bottom: bottom,\n    left: left,\n    width: right - left,\n    height: bottom - top\n  };\n}\n\nmodule.exports = getRangeBoundingClientRect;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar isChrome = UserAgent.isBrowser('Chrome'); // In Chrome, the client rects will include the entire bounds of all nodes that\n// begin (have a start tag) within the selection, even if the selection does\n// not overlap the entire node. To resolve this, we split the range at each\n// start tag and join the client rects together.\n// https://code.google.com/p/chromium/issues/detail?id=324437\n\n/* eslint-disable consistent-return */\n\nfunction getRangeClientRectsChrome(range) {\n  var tempRange = range.cloneRange();\n  var clientRects = [];\n\n  for (var ancestor = range.endContainer; ancestor != null; ancestor = ancestor.parentNode) {\n    // If we've climbed up to the common ancestor, we can now use the\n    // original start point and stop climbing the tree.\n    var atCommonAncestor = ancestor === range.commonAncestorContainer;\n\n    if (atCommonAncestor) {\n      tempRange.setStart(range.startContainer, range.startOffset);\n    } else {\n      tempRange.setStart(tempRange.endContainer, 0);\n    }\n\n    var rects = Array.from(tempRange.getClientRects());\n    clientRects.push(rects);\n\n    if (atCommonAncestor) {\n      var _ref;\n\n      clientRects.reverse();\n      return (_ref = []).concat.apply(_ref, clientRects);\n    }\n\n    tempRange.setEndBefore(ancestor);\n  }\n\n  !false ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Found an unexpected detached subtree when getting range client rects.') : invariant(false) : void 0;\n}\n/* eslint-enable consistent-return */\n\n/**\n * Like range.getClientRects() but normalizes for browser bugs.\n */\n\n\nvar getRangeClientRects = isChrome ? getRangeClientRectsChrome : function (range) {\n  return Array.from(range.getClientRects());\n};\nmodule.exports = getRangeClientRects;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar invariant = require(\"fbjs/lib/invariant\");\n/**\n * Obtain the start and end positions of the range that has the\n * specified entity applied to it.\n *\n * Entity keys are applied only to contiguous stretches of text, so this\n * method searches for the first instance of the entity key and returns\n * the subsequent range.\n */\n\n\nfunction getRangesForDraftEntity(block, key) {\n  var ranges = [];\n  block.findEntityRanges(function (c) {\n    return c.getEntity() === key;\n  }, function (start, end) {\n    ranges.push({\n      start: start,\n      end: end\n    });\n  });\n  !!!ranges.length ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Entity key not found in this range.') : invariant(false) : void 0;\n  return ranges;\n}\n\nmodule.exports = getRangesForDraftEntity;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar isOldIE = UserAgent.isBrowser('IE <= 9'); // Provides a dom node that will not execute scripts\n// https://developer.mozilla.org/en-US/docs/Web/API/DOMImplementation.createHTMLDocument\n// https://developer.mozilla.org/en-US/Add-ons/Code_snippets/HTML_to_DOM\n\nfunction getSafeBodyFromHTML(html) {\n  var doc;\n  var root = null; // Provides a safe context\n\n  if (!isOldIE && document.implementation && document.implementation.createHTMLDocument) {\n    doc = document.implementation.createHTMLDocument('foo');\n    !doc.documentElement ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Missing doc.documentElement') : invariant(false) : void 0;\n    doc.documentElement.innerHTML = html;\n    root = doc.getElementsByTagName('body')[0];\n  }\n\n  return root;\n}\n\nmodule.exports = getSafeBodyFromHTML;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n/**\n * Get offset key from a node or it's child nodes. Return the first offset key\n * found on the DOM tree of given node.\n */\n\nvar isElement = require(\"./isElement\");\n\nfunction getSelectionOffsetKeyForNode(node) {\n  if (isElement(node)) {\n    var castedNode = node;\n    var offsetKey = castedNode.getAttribute('data-offset-key');\n\n    if (offsetKey) {\n      return offsetKey;\n    }\n\n    for (var ii = 0; ii < castedNode.childNodes.length; ii++) {\n      var childOffsetKey = getSelectionOffsetKeyForNode(castedNode.childNodes[ii]);\n\n      if (childOffsetKey) {\n        return childOffsetKey;\n      }\n    }\n  }\n\n  return null;\n}\n\nmodule.exports = getSelectionOffsetKeyForNode;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar TEXT_CLIPPING_REGEX = /\\.textClipping$/;\nvar TEXT_TYPES = {\n  'text/plain': true,\n  'text/html': true,\n  'text/rtf': true\n}; // Somewhat arbitrary upper bound on text size. Let's not lock up the browser.\n\nvar TEXT_SIZE_UPPER_BOUND = 5000;\n/**\n * Extract the text content from a file list.\n */\n\nfunction getTextContentFromFiles(files, callback) {\n  var readCount = 0;\n  var results = [];\n  files.forEach(function (\n  /*blob*/\n  file) {\n    readFile(file, function (\n    /*string*/\n    text) {\n      readCount++;\n      text && results.push(text.slice(0, TEXT_SIZE_UPPER_BOUND));\n\n      if (readCount == files.length) {\n        callback(results.join('\\r'));\n      }\n    });\n  });\n}\n/**\n * todo isaac: Do work to turn html/rtf into a content fragment.\n */\n\n\nfunction readFile(file, callback) {\n  if (!global.FileReader || file.type && !(file.type in TEXT_TYPES)) {\n    callback('');\n    return;\n  }\n\n  if (file.type === '') {\n    var _contents = ''; // Special-case text clippings, which have an empty type but include\n    // `.textClipping` in the file name. `readAsText` results in an empty\n    // string for text clippings, so we force the file name to serve\n    // as the text value for the file.\n\n    if (TEXT_CLIPPING_REGEX.test(file.name)) {\n      _contents = file.name.replace(TEXT_CLIPPING_REGEX, '');\n    }\n\n    callback(_contents);\n    return;\n  }\n\n  var reader = new FileReader();\n\n  reader.onload = function () {\n    var result = reader.result;\n    !(typeof result === 'string') ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'We should be calling \"FileReader.readAsText\" which returns a string') : invariant(false) : void 0;\n    callback(result);\n  };\n\n  reader.onerror = function () {\n    callback('');\n  };\n\n  reader.readAsText(file);\n}\n\nmodule.exports = getTextContentFromFiles;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftOffsetKey = require(\"./DraftOffsetKey\");\n\nvar nullthrows = require(\"fbjs/lib/nullthrows\");\n\nfunction getUpdatedSelectionState(editorState, anchorKey, anchorOffset, focusKey, focusOffset) {\n  var selection = nullthrows(editorState.getSelection());\n\n  if (!anchorKey || !focusKey) {\n    // If we cannot make sense of the updated selection state, stick to the current one.\n    if (process.env.NODE_ENV !== \"production\") {\n      /* eslint-disable-next-line */\n      console.warn('Invalid selection state.', arguments, editorState.toJS());\n    }\n\n    return selection;\n  }\n\n  var anchorPath = DraftOffsetKey.decode(anchorKey);\n  var anchorBlockKey = anchorPath.blockKey;\n  var anchorLeafBlockTree = editorState.getBlockTree(anchorBlockKey);\n  var anchorLeaf = anchorLeafBlockTree && anchorLeafBlockTree.getIn([anchorPath.decoratorKey, 'leaves', anchorPath.leafKey]);\n  var focusPath = DraftOffsetKey.decode(focusKey);\n  var focusBlockKey = focusPath.blockKey;\n  var focusLeafBlockTree = editorState.getBlockTree(focusBlockKey);\n  var focusLeaf = focusLeafBlockTree && focusLeafBlockTree.getIn([focusPath.decoratorKey, 'leaves', focusPath.leafKey]);\n\n  if (!anchorLeaf || !focusLeaf) {\n    // If we cannot make sense of the updated selection state, stick to the current one.\n    if (process.env.NODE_ENV !== \"production\") {\n      /* eslint-disable-next-line */\n      console.warn('Invalid selection state.', arguments, editorState.toJS());\n    }\n\n    return selection;\n  }\n\n  var anchorLeafStart = anchorLeaf.get('start');\n  var focusLeafStart = focusLeaf.get('start');\n  var anchorBlockOffset = anchorLeaf ? anchorLeafStart + anchorOffset : null;\n  var focusBlockOffset = focusLeaf ? focusLeafStart + focusOffset : null;\n  var areEqual = selection.getAnchorKey() === anchorBlockKey && selection.getAnchorOffset() === anchorBlockOffset && selection.getFocusKey() === focusBlockKey && selection.getFocusOffset() === focusBlockOffset;\n\n  if (areEqual) {\n    return selection;\n  }\n\n  var isBackward = false;\n\n  if (anchorBlockKey === focusBlockKey) {\n    var anchorLeafEnd = anchorLeaf.get('end');\n    var focusLeafEnd = focusLeaf.get('end');\n\n    if (focusLeafStart === anchorLeafStart && focusLeafEnd === anchorLeafEnd) {\n      isBackward = focusOffset < anchorOffset;\n    } else {\n      isBackward = focusLeafStart < anchorLeafStart;\n    }\n  } else {\n    var startKey = editorState.getCurrentContent().getBlockMap().keySeq().skipUntil(function (v) {\n      return v === anchorBlockKey || v === focusBlockKey;\n    }).first();\n    isBackward = startKey === focusBlockKey;\n  }\n\n  return selection.merge({\n    anchorKey: anchorBlockKey,\n    anchorOffset: anchorBlockOffset,\n    focusKey: focusBlockKey,\n    focusOffset: focusBlockOffset,\n    isBackward: isBackward\n  });\n}\n\nmodule.exports = getUpdatedSelectionState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar getRangeBoundingClientRect = require(\"./getRangeBoundingClientRect\");\n/**\n * Return the bounding ClientRect for the visible DOM selection, if any.\n * In cases where there are no selected ranges or the bounding rect is\n * temporarily invalid, return null.\n *\n * When using from an iframe, you should pass the iframe window object\n */\n\n\nfunction getVisibleSelectionRect(global) {\n  var selection = global.getSelection();\n\n  if (!selection.rangeCount) {\n    return null;\n  }\n\n  var range = selection.getRangeAt(0);\n  var boundingRect = getRangeBoundingClientRect(range);\n  var top = boundingRect.top,\n      right = boundingRect.right,\n      bottom = boundingRect.bottom,\n      left = boundingRect.left; // When a re-render leads to a node being removed, the DOM selection will\n  // temporarily be placed on an ancestor node, which leads to an invalid\n  // bounding rect. Discard this state.\n\n  if (top === 0 && right === 0 && bottom === 0 && left === 0) {\n    return null;\n  }\n\n  return boundingRect;\n}\n\nmodule.exports = getVisibleSelectionRect;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nfunction getWindowForNode(node) {\n  if (!node || !node.ownerDocument || !node.ownerDocument.defaultView) {\n    return window;\n  }\n\n  return node.ownerDocument.defaultView;\n}\n\nmodule.exports = getWindowForNode;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n */\n'use strict';\n\nmodule.exports = function (name) {\n  if (typeof window !== 'undefined' && window.__DRAFT_GKX) {\n    return !!window.__DRAFT_GKX[name];\n  }\n\n  return false;\n};","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar BlockMapBuilder = require(\"./BlockMapBuilder\");\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar Immutable = require(\"immutable\");\n\nvar insertIntoList = require(\"./insertIntoList\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar randomizeBlockMapKeys = require(\"./randomizeBlockMapKeys\");\n\nvar List = Immutable.List;\n\nvar updateExistingBlock = function updateExistingBlock(contentState, selectionState, blockMap, fragmentBlock, targetKey, targetOffset) {\n  var mergeBlockData = arguments.length > 6 && arguments[6] !== undefined ? arguments[6] : 'REPLACE_WITH_NEW_DATA';\n  var targetBlock = blockMap.get(targetKey);\n  var text = targetBlock.getText();\n  var chars = targetBlock.getCharacterList();\n  var finalKey = targetKey;\n  var finalOffset = targetOffset + fragmentBlock.getText().length;\n  var data = null;\n\n  switch (mergeBlockData) {\n    case 'MERGE_OLD_DATA_TO_NEW_DATA':\n      data = fragmentBlock.getData().merge(targetBlock.getData());\n      break;\n\n    case 'REPLACE_WITH_NEW_DATA':\n      data = fragmentBlock.getData();\n      break;\n  }\n\n  var type = targetBlock.getType();\n\n  if (text && type === 'unstyled') {\n    type = fragmentBlock.getType();\n  }\n\n  var newBlock = targetBlock.merge({\n    text: text.slice(0, targetOffset) + fragmentBlock.getText() + text.slice(targetOffset),\n    characterList: insertIntoList(chars, fragmentBlock.getCharacterList(), targetOffset),\n    type: type,\n    data: data\n  });\n  return contentState.merge({\n    blockMap: blockMap.set(targetKey, newBlock),\n    selectionBefore: selectionState,\n    selectionAfter: selectionState.merge({\n      anchorKey: finalKey,\n      anchorOffset: finalOffset,\n      focusKey: finalKey,\n      focusOffset: finalOffset,\n      isBackward: false\n    })\n  });\n};\n/**\n * Appends text/characterList from the fragment first block to\n * target block.\n */\n\n\nvar updateHead = function updateHead(block, targetOffset, fragment) {\n  var text = block.getText();\n  var chars = block.getCharacterList(); // Modify head portion of block.\n\n  var headText = text.slice(0, targetOffset);\n  var headCharacters = chars.slice(0, targetOffset);\n  var appendToHead = fragment.first();\n  return block.merge({\n    text: headText + appendToHead.getText(),\n    characterList: headCharacters.concat(appendToHead.getCharacterList()),\n    type: headText ? block.getType() : appendToHead.getType(),\n    data: appendToHead.getData()\n  });\n};\n/**\n * Appends offset text/characterList from the target block to the last\n * fragment block.\n */\n\n\nvar updateTail = function updateTail(block, targetOffset, fragment) {\n  // Modify tail portion of block.\n  var text = block.getText();\n  var chars = block.getCharacterList(); // Modify head portion of block.\n\n  var blockSize = text.length;\n  var tailText = text.slice(targetOffset, blockSize);\n  var tailCharacters = chars.slice(targetOffset, blockSize);\n  var prependToTail = fragment.last();\n  return prependToTail.merge({\n    text: prependToTail.getText() + tailText,\n    characterList: prependToTail.getCharacterList().concat(tailCharacters),\n    data: prependToTail.getData()\n  });\n};\n\nvar getRootBlocks = function getRootBlocks(block, blockMap) {\n  var headKey = block.getKey();\n  var rootBlock = block;\n  var rootBlocks = []; // sometimes the fragment head block will not be part of the blockMap itself this can happen when\n  // the fragment head is used to update the target block, however when this does not happen we need\n  // to make sure that we include it on the rootBlocks since the first block of a fragment is always a\n  // fragment root block\n\n  if (blockMap.get(headKey)) {\n    rootBlocks.push(headKey);\n  }\n\n  while (rootBlock && rootBlock.getNextSiblingKey()) {\n    var lastSiblingKey = rootBlock.getNextSiblingKey();\n\n    if (!lastSiblingKey) {\n      break;\n    }\n\n    rootBlocks.push(lastSiblingKey);\n    rootBlock = blockMap.get(lastSiblingKey);\n  }\n\n  return rootBlocks;\n};\n\nvar updateBlockMapLinks = function updateBlockMapLinks(blockMap, originalBlockMap, targetBlock, fragmentHeadBlock) {\n  return blockMap.withMutations(function (blockMapState) {\n    var targetKey = targetBlock.getKey();\n    var headKey = fragmentHeadBlock.getKey();\n    var targetNextKey = targetBlock.getNextSiblingKey();\n    var targetParentKey = targetBlock.getParentKey();\n    var fragmentRootBlocks = getRootBlocks(fragmentHeadBlock, blockMap);\n    var lastRootFragmentBlockKey = fragmentRootBlocks[fragmentRootBlocks.length - 1];\n\n    if (blockMapState.get(headKey)) {\n      // update the fragment head when it is part of the blockMap otherwise\n      blockMapState.setIn([targetKey, 'nextSibling'], headKey);\n      blockMapState.setIn([headKey, 'prevSibling'], targetKey);\n    } else {\n      // update the target block that had the fragment head contents merged into it\n      blockMapState.setIn([targetKey, 'nextSibling'], fragmentHeadBlock.getNextSiblingKey());\n      blockMapState.setIn([fragmentHeadBlock.getNextSiblingKey(), 'prevSibling'], targetKey);\n    } // update the last root block fragment\n\n\n    blockMapState.setIn([lastRootFragmentBlockKey, 'nextSibling'], targetNextKey); // update the original target next block\n\n    if (targetNextKey) {\n      blockMapState.setIn([targetNextKey, 'prevSibling'], lastRootFragmentBlockKey);\n    } // update fragment parent links\n\n\n    fragmentRootBlocks.forEach(function (blockKey) {\n      return blockMapState.setIn([blockKey, 'parent'], targetParentKey);\n    }); // update targetBlock parent child links\n\n    if (targetParentKey) {\n      var targetParent = blockMap.get(targetParentKey);\n      var originalTargetParentChildKeys = targetParent.getChildKeys();\n      var targetBlockIndex = originalTargetParentChildKeys.indexOf(targetKey);\n      var insertionIndex = targetBlockIndex + 1;\n      var newChildrenKeysArray = originalTargetParentChildKeys.toArray(); // insert fragment children\n\n      newChildrenKeysArray.splice.apply(newChildrenKeysArray, [insertionIndex, 0].concat(fragmentRootBlocks));\n      blockMapState.setIn([targetParentKey, 'children'], List(newChildrenKeysArray));\n    }\n  });\n};\n\nvar insertFragment = function insertFragment(contentState, selectionState, blockMap, fragment, targetKey, targetOffset) {\n  var isTreeBasedBlockMap = blockMap.first() instanceof ContentBlockNode;\n  var newBlockArr = [];\n  var fragmentSize = fragment.size;\n  var target = blockMap.get(targetKey);\n  var head = fragment.first();\n  var tail = fragment.last();\n  var finalOffset = tail.getLength();\n  var finalKey = tail.getKey();\n  var shouldNotUpdateFromFragmentBlock = isTreeBasedBlockMap && (!target.getChildKeys().isEmpty() || !head.getChildKeys().isEmpty());\n  blockMap.forEach(function (block, blockKey) {\n    if (blockKey !== targetKey) {\n      newBlockArr.push(block);\n      return;\n    }\n\n    if (shouldNotUpdateFromFragmentBlock) {\n      newBlockArr.push(block);\n    } else {\n      newBlockArr.push(updateHead(block, targetOffset, fragment));\n    } // Insert fragment blocks after the head and before the tail.\n\n\n    fragment // when we are updating the target block with the head fragment block we skip the first fragment\n    // head since its contents have already been merged with the target block otherwise we include\n    // the whole fragment\n    .slice(shouldNotUpdateFromFragmentBlock ? 0 : 1, fragmentSize - 1).forEach(function (fragmentBlock) {\n      return newBlockArr.push(fragmentBlock);\n    }); // update tail\n\n    newBlockArr.push(updateTail(block, targetOffset, fragment));\n  });\n  var updatedBlockMap = BlockMapBuilder.createFromArray(newBlockArr);\n\n  if (isTreeBasedBlockMap) {\n    updatedBlockMap = updateBlockMapLinks(updatedBlockMap, blockMap, target, head);\n  }\n\n  return contentState.merge({\n    blockMap: updatedBlockMap,\n    selectionBefore: selectionState,\n    selectionAfter: selectionState.merge({\n      anchorKey: finalKey,\n      anchorOffset: finalOffset,\n      focusKey: finalKey,\n      focusOffset: finalOffset,\n      isBackward: false\n    })\n  });\n};\n\nvar insertFragmentIntoContentState = function insertFragmentIntoContentState(contentState, selectionState, fragmentBlockMap) {\n  var mergeBlockData = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 'REPLACE_WITH_NEW_DATA';\n  !selectionState.isCollapsed() ? process.env.NODE_ENV !== \"production\" ? invariant(false, '`insertFragment` should only be called with a collapsed selection state.') : invariant(false) : void 0;\n  var blockMap = contentState.getBlockMap();\n  var fragment = randomizeBlockMapKeys(fragmentBlockMap);\n  var targetKey = selectionState.getStartKey();\n  var targetOffset = selectionState.getStartOffset();\n  var targetBlock = blockMap.get(targetKey);\n\n  if (targetBlock instanceof ContentBlockNode) {\n    !targetBlock.getChildKeys().isEmpty() ? process.env.NODE_ENV !== \"production\" ? invariant(false, '`insertFragment` should not be called when a container node is selected.') : invariant(false) : void 0;\n  } // When we insert a fragment with a single block we simply update the target block\n  // with the contents of the inserted fragment block\n\n\n  if (fragment.size === 1) {\n    return updateExistingBlock(contentState, selectionState, blockMap, fragment.first(), targetKey, targetOffset, mergeBlockData);\n  }\n\n  return insertFragment(contentState, selectionState, blockMap, fragment, targetKey, targetOffset);\n};\n\nmodule.exports = insertFragmentIntoContentState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\n/**\n * Maintain persistence for target list when appending and prepending.\n */\nfunction insertIntoList(targetListArg, toInsert, offset) {\n  var targetList = targetListArg;\n\n  if (offset === targetList.count()) {\n    toInsert.forEach(function (c) {\n      targetList = targetList.push(c);\n    });\n  } else if (offset === 0) {\n    toInsert.reverse().forEach(function (c) {\n      targetList = targetList.unshift(c);\n    });\n  } else {\n    var head = targetList.slice(0, offset);\n    var tail = targetList.slice(offset);\n    targetList = head.concat(toInsert, tail).toList();\n  }\n\n  return targetList;\n}\n\nmodule.exports = insertIntoList;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar Immutable = require(\"immutable\");\n\nvar insertIntoList = require(\"./insertIntoList\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar Repeat = Immutable.Repeat;\n\nfunction insertTextIntoContentState(contentState, selectionState, text, characterMetadata) {\n  !selectionState.isCollapsed() ? process.env.NODE_ENV !== \"production\" ? invariant(false, '`insertText` should only be called with a collapsed range.') : invariant(false) : void 0;\n  var len = null;\n\n  if (text != null) {\n    len = text.length;\n  }\n\n  if (len == null || len === 0) {\n    return contentState;\n  }\n\n  var blockMap = contentState.getBlockMap();\n  var key = selectionState.getStartKey();\n  var offset = selectionState.getStartOffset();\n  var block = blockMap.get(key);\n  var blockText = block.getText();\n  var newBlock = block.merge({\n    text: blockText.slice(0, offset) + text + blockText.slice(offset, block.getLength()),\n    characterList: insertIntoList(block.getCharacterList(), Repeat(characterMetadata, len).toList(), offset)\n  });\n  var newOffset = offset + len;\n  return contentState.merge({\n    blockMap: blockMap.set(key, newBlock),\n    selectionAfter: selectionState.merge({\n      anchorOffset: newOffset,\n      focusOffset: newOffset\n    })\n  });\n}\n\nmodule.exports = insertTextIntoContentState;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nfunction isElement(node) {\n  if (!node || !node.ownerDocument) {\n    return false;\n  }\n\n  return node.nodeType === Node.ELEMENT_NODE;\n}\n\nmodule.exports = isElement;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\n/**\n * Utility method for determining whether or not the value returned\n * from a handler indicates that it was handled.\n */\nfunction isEventHandled(value) {\n  return value === 'handled' || value === true;\n}\n\nmodule.exports = isEventHandled;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nvar isElement = require(\"./isElement\");\n\nfunction isHTMLAnchorElement(node) {\n  if (!node || !node.ownerDocument) {\n    return false;\n  }\n\n  return isElement(node) && node.nodeName === 'A';\n}\n\nmodule.exports = isHTMLAnchorElement;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nvar isElement = require(\"./isElement\");\n\nfunction isHTMLBRElement(node) {\n  if (!node || !node.ownerDocument) {\n    return false;\n  }\n\n  return isElement(node) && node.nodeName === 'BR';\n}\n\nmodule.exports = isHTMLBRElement;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nfunction isHTMLElement(node) {\n  if (!node || !node.ownerDocument) {\n    return false;\n  }\n\n  if (!node.ownerDocument.defaultView) {\n    return node instanceof HTMLElement;\n  }\n\n  if (node instanceof node.ownerDocument.defaultView.HTMLElement) {\n    return true;\n  }\n\n  return false;\n}\n\nmodule.exports = isHTMLElement;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nvar isElement = require(\"./isElement\");\n\nfunction isHTMLImageElement(node) {\n  if (!node || !node.ownerDocument) {\n    return false;\n  }\n\n  return isElement(node) && node.nodeName === 'IMG';\n}\n\nmodule.exports = isHTMLImageElement;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nfunction isInstanceOfNode(target) {\n  // we changed the name because of having duplicate module provider (fbjs)\n  if (!target || !('ownerDocument' in target)) {\n    return false;\n  }\n\n  if ('ownerDocument' in target) {\n    var node = target;\n\n    if (!node.ownerDocument.defaultView) {\n      return node instanceof Node;\n    }\n\n    if (node instanceof node.ownerDocument.defaultView.Node) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\nmodule.exports = isInstanceOfNode;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction isSelectionAtLeafStart(editorState) {\n  var selection = editorState.getSelection();\n  var anchorKey = selection.getAnchorKey();\n  var blockTree = editorState.getBlockTree(anchorKey);\n  var offset = selection.getStartOffset();\n  var isAtStart = false;\n  blockTree.some(function (leafSet) {\n    if (offset === leafSet.get('start')) {\n      isAtStart = true;\n      return true;\n    }\n\n    if (offset < leafSet.get('end')) {\n      return leafSet.get('leaves').some(function (leaf) {\n        var leafStart = leaf.get('start');\n\n        if (offset === leafStart) {\n          isAtStart = true;\n          return true;\n        }\n\n        return false;\n      });\n    }\n\n    return false;\n  });\n  return isAtStart;\n}\n\nmodule.exports = isSelectionAtLeafStart;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar Keys = require(\"fbjs/lib/Keys\");\n\nfunction isSoftNewlineEvent(e) {\n  return e.which === Keys.RETURN && (e.getModifierState('Shift') || e.getModifierState('Alt') || e.getModifierState('Control'));\n}\n\nmodule.exports = isSoftNewlineEvent;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n\nvar expandRangeToStartOfLine = require(\"./expandRangeToStartOfLine\");\n\nvar getDraftEditorSelectionWithNodes = require(\"./getDraftEditorSelectionWithNodes\");\n\nvar moveSelectionBackward = require(\"./moveSelectionBackward\");\n\nvar removeTextWithStrategy = require(\"./removeTextWithStrategy\");\n\nfunction keyCommandBackspaceToStartOfLine(editorState, e) {\n  var afterRemoval = removeTextWithStrategy(editorState, function (strategyState) {\n    var selection = strategyState.getSelection();\n\n    if (selection.isCollapsed() && selection.getAnchorOffset() === 0) {\n      return moveSelectionBackward(strategyState, 1);\n    }\n\n    var ownerDocument = e.currentTarget.ownerDocument;\n    var domSelection = ownerDocument.defaultView.getSelection(); // getRangeAt can technically throw if there's no selection, but we know\n    // there is one here because text editor has focus (the cursor is a\n    // selection of length 0). Therefore, we don't need to wrap this in a\n    // try-catch block.\n\n    var range = domSelection.getRangeAt(0);\n    range = expandRangeToStartOfLine(range);\n    return getDraftEditorSelectionWithNodes(strategyState, null, range.endContainer, range.endOffset, range.startContainer, range.startOffset).selectionState;\n  }, 'backward');\n\n  if (afterRemoval === editorState.getCurrentContent()) {\n    return editorState;\n  }\n\n  return EditorState.push(editorState, afterRemoval, 'remove-range');\n}\n\nmodule.exports = keyCommandBackspaceToStartOfLine;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftRemovableWord = require(\"./DraftRemovableWord\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar moveSelectionBackward = require(\"./moveSelectionBackward\");\n\nvar removeTextWithStrategy = require(\"./removeTextWithStrategy\");\n/**\n * Delete the word that is left of the cursor, as well as any spaces or\n * punctuation after the word.\n */\n\n\nfunction keyCommandBackspaceWord(editorState) {\n  var afterRemoval = removeTextWithStrategy(editorState, function (strategyState) {\n    var selection = strategyState.getSelection();\n    var offset = selection.getStartOffset(); // If there are no words before the cursor, remove the preceding newline.\n\n    if (offset === 0) {\n      return moveSelectionBackward(strategyState, 1);\n    }\n\n    var key = selection.getStartKey();\n    var content = strategyState.getCurrentContent();\n    var text = content.getBlockForKey(key).getText().slice(0, offset);\n    var toRemove = DraftRemovableWord.getBackward(text);\n    return moveSelectionBackward(strategyState, toRemove.length || 1);\n  }, 'backward');\n\n  if (afterRemoval === editorState.getCurrentContent()) {\n    return editorState;\n  }\n\n  return EditorState.push(editorState, afterRemoval, 'remove-range');\n}\n\nmodule.exports = keyCommandBackspaceWord;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftRemovableWord = require(\"./DraftRemovableWord\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar moveSelectionForward = require(\"./moveSelectionForward\");\n\nvar removeTextWithStrategy = require(\"./removeTextWithStrategy\");\n/**\n * Delete the word that is right of the cursor, as well as any spaces or\n * punctuation before the word.\n */\n\n\nfunction keyCommandDeleteWord(editorState) {\n  var afterRemoval = removeTextWithStrategy(editorState, function (strategyState) {\n    var selection = strategyState.getSelection();\n    var offset = selection.getStartOffset();\n    var key = selection.getStartKey();\n    var content = strategyState.getCurrentContent();\n    var text = content.getBlockForKey(key).getText().slice(offset);\n    var toRemove = DraftRemovableWord.getForward(text); // If there are no words in front of the cursor, remove the newline.\n\n    return moveSelectionForward(strategyState, toRemove.length || 1);\n  }, 'forward');\n\n  if (afterRemoval === editorState.getCurrentContent()) {\n    return editorState;\n  }\n\n  return EditorState.push(editorState, afterRemoval, 'remove-range');\n}\n\nmodule.exports = keyCommandDeleteWord;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar EditorState = require(\"./EditorState\");\n\nfunction keyCommandInsertNewline(editorState) {\n  var contentState = DraftModifier.splitBlock(editorState.getCurrentContent(), editorState.getSelection());\n  return EditorState.push(editorState, contentState, 'split-block');\n}\n\nmodule.exports = keyCommandInsertNewline;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n/**\n * See comment for `moveSelectionToStartOfBlock`.\n */\n\n\nfunction keyCommandMoveSelectionToEndOfBlock(editorState) {\n  var selection = editorState.getSelection();\n  var endKey = selection.getEndKey();\n  var content = editorState.getCurrentContent();\n  var textLength = content.getBlockForKey(endKey).getLength();\n  return EditorState.set(editorState, {\n    selection: selection.merge({\n      anchorKey: endKey,\n      anchorOffset: textLength,\n      focusKey: endKey,\n      focusOffset: textLength,\n      isBackward: false\n    }),\n    forceSelection: true\n  });\n}\n\nmodule.exports = keyCommandMoveSelectionToEndOfBlock;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n/**\n * Collapse selection at the start of the first selected block. This is used\n * for Firefox versions that attempt to navigate forward/backward instead of\n * moving the cursor. Other browsers are able to move the cursor natively.\n */\n\n\nfunction keyCommandMoveSelectionToStartOfBlock(editorState) {\n  var selection = editorState.getSelection();\n  var startKey = selection.getStartKey();\n  return EditorState.set(editorState, {\n    selection: selection.merge({\n      anchorKey: startKey,\n      anchorOffset: 0,\n      focusKey: startKey,\n      focusOffset: 0,\n      isBackward: false\n    }),\n    forceSelection: true\n  });\n}\n\nmodule.exports = keyCommandMoveSelectionToStartOfBlock;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n\nvar UnicodeUtils = require(\"fbjs/lib/UnicodeUtils\");\n\nvar moveSelectionBackward = require(\"./moveSelectionBackward\");\n\nvar removeTextWithStrategy = require(\"./removeTextWithStrategy\");\n/**\n * Remove the selected range. If the cursor is collapsed, remove the preceding\n * character. This operation is Unicode-aware, so removing a single character\n * will remove a surrogate pair properly as well.\n */\n\n\nfunction keyCommandPlainBackspace(editorState) {\n  var afterRemoval = removeTextWithStrategy(editorState, function (strategyState) {\n    var selection = strategyState.getSelection();\n    var content = strategyState.getCurrentContent();\n    var key = selection.getAnchorKey();\n    var offset = selection.getAnchorOffset();\n    var charBehind = content.getBlockForKey(key).getText()[offset - 1];\n    return moveSelectionBackward(strategyState, charBehind ? UnicodeUtils.getUTF16Length(charBehind, 0) : 1);\n  }, 'backward');\n\n  if (afterRemoval === editorState.getCurrentContent()) {\n    return editorState;\n  }\n\n  var selection = editorState.getSelection();\n  return EditorState.push(editorState, afterRemoval.set('selectionBefore', selection), selection.isCollapsed() ? 'backspace-character' : 'remove-range');\n}\n\nmodule.exports = keyCommandPlainBackspace;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n\nvar UnicodeUtils = require(\"fbjs/lib/UnicodeUtils\");\n\nvar moveSelectionForward = require(\"./moveSelectionForward\");\n\nvar removeTextWithStrategy = require(\"./removeTextWithStrategy\");\n/**\n * Remove the selected range. If the cursor is collapsed, remove the following\n * character. This operation is Unicode-aware, so removing a single character\n * will remove a surrogate pair properly as well.\n */\n\n\nfunction keyCommandPlainDelete(editorState) {\n  var afterRemoval = removeTextWithStrategy(editorState, function (strategyState) {\n    var selection = strategyState.getSelection();\n    var content = strategyState.getCurrentContent();\n    var key = selection.getAnchorKey();\n    var offset = selection.getAnchorOffset();\n    var charAhead = content.getBlockForKey(key).getText()[offset];\n    return moveSelectionForward(strategyState, charAhead ? UnicodeUtils.getUTF16Length(charAhead, 0) : 1);\n  }, 'forward');\n\n  if (afterRemoval === editorState.getCurrentContent()) {\n    return editorState;\n  }\n\n  var selection = editorState.getSelection();\n  return EditorState.push(editorState, afterRemoval.set('selectionBefore', selection), selection.isCollapsed() ? 'delete-character' : 'remove-range');\n}\n\nmodule.exports = keyCommandPlainDelete;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar getContentStateFragment = require(\"./getContentStateFragment\");\n/**\n * Transpose the characters on either side of a collapsed cursor, or\n * if the cursor is at the end of the block, transpose the last two\n * characters.\n */\n\n\nfunction keyCommandTransposeCharacters(editorState) {\n  var selection = editorState.getSelection();\n\n  if (!selection.isCollapsed()) {\n    return editorState;\n  }\n\n  var offset = selection.getAnchorOffset();\n\n  if (offset === 0) {\n    return editorState;\n  }\n\n  var blockKey = selection.getAnchorKey();\n  var content = editorState.getCurrentContent();\n  var block = content.getBlockForKey(blockKey);\n  var length = block.getLength(); // Nothing to transpose if there aren't two characters.\n\n  if (length <= 1) {\n    return editorState;\n  }\n\n  var removalRange;\n  var finalSelection;\n\n  if (offset === length) {\n    // The cursor is at the end of the block. Swap the last two characters.\n    removalRange = selection.set('anchorOffset', offset - 1);\n    finalSelection = selection;\n  } else {\n    removalRange = selection.set('focusOffset', offset + 1);\n    finalSelection = removalRange.set('anchorOffset', offset + 1);\n  } // Extract the character to move as a fragment. This preserves its\n  // styling and entity, if any.\n\n\n  var movedFragment = getContentStateFragment(content, removalRange);\n  var afterRemoval = DraftModifier.removeRange(content, removalRange, 'backward'); // After the removal, the insertion target is one character back.\n\n  var selectionAfter = afterRemoval.getSelectionAfter();\n  var targetOffset = selectionAfter.getAnchorOffset() - 1;\n  var targetRange = selectionAfter.merge({\n    anchorOffset: targetOffset,\n    focusOffset: targetOffset\n  });\n  var afterInsert = DraftModifier.replaceWithFragment(afterRemoval, targetRange, movedFragment);\n  var newEditorState = EditorState.push(editorState, afterInsert, 'insert-fragment');\n  return EditorState.acceptSelection(newEditorState, finalSelection);\n}\n\nmodule.exports = keyCommandTransposeCharacters;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n\nfunction keyCommandUndo(e, editorState, updateFn) {\n  var undoneState = EditorState.undo(editorState); // If the last change to occur was a spellcheck change, allow the undo\n  // event to fall through to the browser. This allows the browser to record\n  // the unwanted change, which should soon lead it to learn not to suggest\n  // the correction again.\n\n  if (editorState.getLastChangeType() === 'spellcheck-change') {\n    var nativelyRenderedContent = undoneState.getCurrentContent();\n    updateFn(EditorState.set(undoneState, {\n      nativelyRenderedContent: nativelyRenderedContent\n    }));\n    return;\n  } // Otheriwse, manage the undo behavior manually.\n\n\n  e.preventDefault();\n\n  if (!editorState.getNativelyRenderedContent()) {\n    updateFn(undoneState);\n    return;\n  } // Trigger a re-render with the current content state to ensure that the\n  // component tree has up-to-date props for comparison.\n\n\n  updateFn(EditorState.set(editorState, {\n    nativelyRenderedContent: null\n  })); // Wait to ensure that the re-render has occurred before performing\n  // the undo action.\n\n  setTimeout(function () {\n    updateFn(undoneState);\n  }, 0);\n}\n\nmodule.exports = keyCommandUndo;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar Immutable = require(\"immutable\");\n\nvar Map = Immutable.Map;\n\nfunction modifyBlockForContentState(contentState, selectionState, operation) {\n  var startKey = selectionState.getStartKey();\n  var endKey = selectionState.getEndKey();\n  var blockMap = contentState.getBlockMap();\n  var newBlocks = blockMap.toSeq().skipUntil(function (_, k) {\n    return k === startKey;\n  }).takeUntil(function (_, k) {\n    return k === endKey;\n  }).concat(Map([[endKey, blockMap.get(endKey)]])).map(operation);\n  return contentState.merge({\n    blockMap: blockMap.merge(newBlocks),\n    selectionBefore: selectionState,\n    selectionAfter: selectionState\n  });\n}\n\nmodule.exports = modifyBlockForContentState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar getNextDelimiterBlockKey = require(\"./getNextDelimiterBlockKey\");\n\nvar Immutable = require(\"immutable\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar OrderedMap = Immutable.OrderedMap,\n    List = Immutable.List;\n\nvar transformBlock = function transformBlock(key, blockMap, func) {\n  if (!key) {\n    return;\n  }\n\n  var block = blockMap.get(key);\n\n  if (!block) {\n    return;\n  }\n\n  blockMap.set(key, func(block));\n};\n\nvar updateBlockMapLinks = function updateBlockMapLinks(blockMap, originalBlockToBeMoved, originalTargetBlock, insertionMode, isExperimentalTreeBlock) {\n  if (!isExperimentalTreeBlock) {\n    return blockMap;\n  } // possible values of 'insertionMode' are: 'after', 'before'\n\n\n  var isInsertedAfterTarget = insertionMode === 'after';\n  var originalBlockKey = originalBlockToBeMoved.getKey();\n  var originalTargetKey = originalTargetBlock.getKey();\n  var originalParentKey = originalBlockToBeMoved.getParentKey();\n  var originalNextSiblingKey = originalBlockToBeMoved.getNextSiblingKey();\n  var originalPrevSiblingKey = originalBlockToBeMoved.getPrevSiblingKey();\n  var newParentKey = originalTargetBlock.getParentKey();\n  var newNextSiblingKey = isInsertedAfterTarget ? originalTargetBlock.getNextSiblingKey() : originalTargetKey;\n  var newPrevSiblingKey = isInsertedAfterTarget ? originalTargetKey : originalTargetBlock.getPrevSiblingKey();\n  return blockMap.withMutations(function (blocks) {\n    // update old parent\n    transformBlock(originalParentKey, blocks, function (block) {\n      var parentChildrenList = block.getChildKeys();\n      return block.merge({\n        children: parentChildrenList[\"delete\"](parentChildrenList.indexOf(originalBlockKey))\n      });\n    }); // update old prev\n\n    transformBlock(originalPrevSiblingKey, blocks, function (block) {\n      return block.merge({\n        nextSibling: originalNextSiblingKey\n      });\n    }); // update old next\n\n    transformBlock(originalNextSiblingKey, blocks, function (block) {\n      return block.merge({\n        prevSibling: originalPrevSiblingKey\n      });\n    }); // update new next\n\n    transformBlock(newNextSiblingKey, blocks, function (block) {\n      return block.merge({\n        prevSibling: originalBlockKey\n      });\n    }); // update new prev\n\n    transformBlock(newPrevSiblingKey, blocks, function (block) {\n      return block.merge({\n        nextSibling: originalBlockKey\n      });\n    }); // update new parent\n\n    transformBlock(newParentKey, blocks, function (block) {\n      var newParentChildrenList = block.getChildKeys();\n      var targetBlockIndex = newParentChildrenList.indexOf(originalTargetKey);\n      var insertionIndex = isInsertedAfterTarget ? targetBlockIndex + 1 : targetBlockIndex !== 0 ? targetBlockIndex - 1 : 0;\n      var newChildrenArray = newParentChildrenList.toArray();\n      newChildrenArray.splice(insertionIndex, 0, originalBlockKey);\n      return block.merge({\n        children: List(newChildrenArray)\n      });\n    }); // update block\n\n    transformBlock(originalBlockKey, blocks, function (block) {\n      return block.merge({\n        nextSibling: newNextSiblingKey,\n        prevSibling: newPrevSiblingKey,\n        parent: newParentKey\n      });\n    });\n  });\n};\n\nvar moveBlockInContentState = function moveBlockInContentState(contentState, blockToBeMoved, targetBlock, insertionMode) {\n  !(insertionMode !== 'replace') ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Replacing blocks is not supported.') : invariant(false) : void 0;\n  var targetKey = targetBlock.getKey();\n  var blockKey = blockToBeMoved.getKey();\n  !(blockKey !== targetKey) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Block cannot be moved next to itself.') : invariant(false) : void 0;\n  var blockMap = contentState.getBlockMap();\n  var isExperimentalTreeBlock = blockToBeMoved instanceof ContentBlockNode;\n  var blocksToBeMoved = [blockToBeMoved];\n  var blockMapWithoutBlocksToBeMoved = blockMap[\"delete\"](blockKey);\n\n  if (isExperimentalTreeBlock) {\n    blocksToBeMoved = [];\n    blockMapWithoutBlocksToBeMoved = blockMap.withMutations(function (blocks) {\n      var nextSiblingKey = blockToBeMoved.getNextSiblingKey();\n      var nextDelimiterBlockKey = getNextDelimiterBlockKey(blockToBeMoved, blocks);\n      blocks.toSeq().skipUntil(function (block) {\n        return block.getKey() === blockKey;\n      }).takeWhile(function (block) {\n        var key = block.getKey();\n        var isBlockToBeMoved = key === blockKey;\n        var hasNextSiblingAndIsNotNextSibling = nextSiblingKey && key !== nextSiblingKey;\n        var doesNotHaveNextSiblingAndIsNotDelimiter = !nextSiblingKey && block.getParentKey() && (!nextDelimiterBlockKey || key !== nextDelimiterBlockKey);\n        return !!(isBlockToBeMoved || hasNextSiblingAndIsNotNextSibling || doesNotHaveNextSiblingAndIsNotDelimiter);\n      }).forEach(function (block) {\n        blocksToBeMoved.push(block);\n        blocks[\"delete\"](block.getKey());\n      });\n    });\n  }\n\n  var blocksBefore = blockMapWithoutBlocksToBeMoved.toSeq().takeUntil(function (v) {\n    return v === targetBlock;\n  });\n  var blocksAfter = blockMapWithoutBlocksToBeMoved.toSeq().skipUntil(function (v) {\n    return v === targetBlock;\n  }).skip(1);\n  var slicedBlocks = blocksToBeMoved.map(function (block) {\n    return [block.getKey(), block];\n  });\n  var newBlocks = OrderedMap();\n\n  if (insertionMode === 'before') {\n    var blockBefore = contentState.getBlockBefore(targetKey);\n    !(!blockBefore || blockBefore.getKey() !== blockToBeMoved.getKey()) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Block cannot be moved next to itself.') : invariant(false) : void 0;\n    newBlocks = blocksBefore.concat([].concat(slicedBlocks, [[targetKey, targetBlock]]), blocksAfter).toOrderedMap();\n  } else if (insertionMode === 'after') {\n    var blockAfter = contentState.getBlockAfter(targetKey);\n    !(!blockAfter || blockAfter.getKey() !== blockKey) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Block cannot be moved next to itself.') : invariant(false) : void 0;\n    newBlocks = blocksBefore.concat([[targetKey, targetBlock]].concat(slicedBlocks), blocksAfter).toOrderedMap();\n  }\n\n  return contentState.merge({\n    blockMap: updateBlockMapLinks(newBlocks, blockToBeMoved, targetBlock, insertionMode, isExperimentalTreeBlock),\n    selectionBefore: contentState.getSelectionAfter(),\n    selectionAfter: contentState.getSelectionAfter().merge({\n      anchorKey: blockKey,\n      focusKey: blockKey\n    })\n  });\n};\n\nmodule.exports = moveBlockInContentState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar warning = require(\"fbjs/lib/warning\");\n/**\n * Given a collapsed selection, move the focus `maxDistance` backward within\n * the selected block. If the selection will go beyond the start of the block,\n * move focus to the end of the previous block, but no further.\n *\n * This function is not Unicode-aware, so surrogate pairs will be treated\n * as having length 2.\n */\n\n\nfunction moveSelectionBackward(editorState, maxDistance) {\n  var selection = editorState.getSelection(); // Should eventually make this an invariant\n\n  process.env.NODE_ENV !== \"production\" ? warning(selection.isCollapsed(), 'moveSelectionBackward should only be called with a collapsed SelectionState') : void 0;\n  var content = editorState.getCurrentContent();\n  var key = selection.getStartKey();\n  var offset = selection.getStartOffset();\n  var focusKey = key;\n  var focusOffset = 0;\n\n  if (maxDistance > offset) {\n    var keyBefore = content.getKeyBefore(key);\n\n    if (keyBefore == null) {\n      focusKey = key;\n    } else {\n      focusKey = keyBefore;\n      var blockBefore = content.getBlockForKey(keyBefore);\n      focusOffset = blockBefore.getText().length;\n    }\n  } else {\n    focusOffset = offset - maxDistance;\n  }\n\n  return selection.merge({\n    focusKey: focusKey,\n    focusOffset: focusOffset,\n    isBackward: true\n  });\n}\n\nmodule.exports = moveSelectionBackward;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar warning = require(\"fbjs/lib/warning\");\n/**\n * Given a collapsed selection, move the focus `maxDistance` forward within\n * the selected block. If the selection will go beyond the end of the block,\n * move focus to the start of the next block, but no further.\n *\n * This function is not Unicode-aware, so surrogate pairs will be treated\n * as having length 2.\n */\n\n\nfunction moveSelectionForward(editorState, maxDistance) {\n  var selection = editorState.getSelection(); // Should eventually make this an invariant\n\n  process.env.NODE_ENV !== \"production\" ? warning(selection.isCollapsed(), 'moveSelectionForward should only be called with a collapsed SelectionState') : void 0;\n  var key = selection.getStartKey();\n  var offset = selection.getStartOffset();\n  var content = editorState.getCurrentContent();\n  var focusKey = key;\n  var focusOffset;\n  var block = content.getBlockForKey(key);\n\n  if (maxDistance > block.getText().length - offset) {\n    focusKey = content.getKeyAfter(key);\n    focusOffset = 0;\n  } else {\n    focusOffset = offset + maxDistance;\n  }\n\n  return selection.merge({\n    focusKey: focusKey,\n    focusOffset: focusOffset\n  });\n}\n\nmodule.exports = moveSelectionForward;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar generateRandomKey = require(\"./generateRandomKey\");\n\nvar Immutable = require(\"immutable\");\n\nvar OrderedMap = Immutable.OrderedMap;\n\nvar randomizeContentBlockNodeKeys = function randomizeContentBlockNodeKeys(blockMap) {\n  var newKeysRef = {}; // we keep track of root blocks in order to update subsequent sibling links\n\n  var lastRootBlock;\n  return OrderedMap(blockMap.withMutations(function (blockMapState) {\n    blockMapState.forEach(function (block, index) {\n      var oldKey = block.getKey();\n      var nextKey = block.getNextSiblingKey();\n      var prevKey = block.getPrevSiblingKey();\n      var childrenKeys = block.getChildKeys();\n      var parentKey = block.getParentKey(); // new key that we will use to build linking\n\n      var key = generateRandomKey(); // we will add it here to re-use it later\n\n      newKeysRef[oldKey] = key;\n\n      if (nextKey) {\n        var nextBlock = blockMapState.get(nextKey);\n\n        if (nextBlock) {\n          blockMapState.setIn([nextKey, 'prevSibling'], key);\n        } else {\n          // this can happen when generating random keys for fragments\n          blockMapState.setIn([oldKey, 'nextSibling'], null);\n        }\n      }\n\n      if (prevKey) {\n        var prevBlock = blockMapState.get(prevKey);\n\n        if (prevBlock) {\n          blockMapState.setIn([prevKey, 'nextSibling'], key);\n        } else {\n          // this can happen when generating random keys for fragments\n          blockMapState.setIn([oldKey, 'prevSibling'], null);\n        }\n      }\n\n      if (parentKey && blockMapState.get(parentKey)) {\n        var parentBlock = blockMapState.get(parentKey);\n        var parentChildrenList = parentBlock.getChildKeys();\n        blockMapState.setIn([parentKey, 'children'], parentChildrenList.set(parentChildrenList.indexOf(block.getKey()), key));\n      } else {\n        // blocks will then be treated as root block nodes\n        blockMapState.setIn([oldKey, 'parent'], null);\n\n        if (lastRootBlock) {\n          blockMapState.setIn([lastRootBlock.getKey(), 'nextSibling'], key);\n          blockMapState.setIn([oldKey, 'prevSibling'], newKeysRef[lastRootBlock.getKey()]);\n        }\n\n        lastRootBlock = blockMapState.get(oldKey);\n      }\n\n      childrenKeys.forEach(function (childKey) {\n        var childBlock = blockMapState.get(childKey);\n\n        if (childBlock) {\n          blockMapState.setIn([childKey, 'parent'], key);\n        } else {\n          blockMapState.setIn([oldKey, 'children'], block.getChildKeys().filter(function (child) {\n            return child !== childKey;\n          }));\n        }\n      });\n    });\n  }).toArray().map(function (block) {\n    return [newKeysRef[block.getKey()], block.set('key', newKeysRef[block.getKey()])];\n  }));\n};\n\nvar randomizeContentBlockKeys = function randomizeContentBlockKeys(blockMap) {\n  return OrderedMap(blockMap.toArray().map(function (block) {\n    var key = generateRandomKey();\n    return [key, block.set('key', key)];\n  }));\n};\n\nvar randomizeBlockMapKeys = function randomizeBlockMapKeys(blockMap) {\n  var isTreeBasedBlockMap = blockMap.first() instanceof ContentBlockNode;\n\n  if (!isTreeBasedBlockMap) {\n    return randomizeContentBlockKeys(blockMap);\n  }\n\n  return randomizeContentBlockNodeKeys(blockMap);\n};\n\nmodule.exports = randomizeBlockMapKeys;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar CharacterMetadata = require(\"./CharacterMetadata\");\n\nvar findRangesImmutable = require(\"./findRangesImmutable\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nfunction removeEntitiesAtEdges(contentState, selectionState) {\n  var blockMap = contentState.getBlockMap();\n  var entityMap = contentState.getEntityMap();\n  var updatedBlocks = {};\n  var startKey = selectionState.getStartKey();\n  var startOffset = selectionState.getStartOffset();\n  var startBlock = blockMap.get(startKey);\n  var updatedStart = removeForBlock(entityMap, startBlock, startOffset);\n\n  if (updatedStart !== startBlock) {\n    updatedBlocks[startKey] = updatedStart;\n  }\n\n  var endKey = selectionState.getEndKey();\n  var endOffset = selectionState.getEndOffset();\n  var endBlock = blockMap.get(endKey);\n\n  if (startKey === endKey) {\n    endBlock = updatedStart;\n  }\n\n  var updatedEnd = removeForBlock(entityMap, endBlock, endOffset);\n\n  if (updatedEnd !== endBlock) {\n    updatedBlocks[endKey] = updatedEnd;\n  }\n\n  if (!Object.keys(updatedBlocks).length) {\n    return contentState.set('selectionAfter', selectionState);\n  }\n\n  return contentState.merge({\n    blockMap: blockMap.merge(updatedBlocks),\n    selectionAfter: selectionState\n  });\n}\n/**\n * Given a list of characters and an offset that is in the middle of an entity,\n * returns the start and end of the entity that is overlapping the offset.\n * Note: This method requires that the offset be in an entity range.\n */\n\n\nfunction getRemovalRange(characters, entityKey, offset) {\n  var removalRange; // Iterates through a list looking for ranges of matching items\n  // based on the 'isEqual' callback.\n  // Then instead of returning the result, call the 'found' callback\n  // with each range.\n  // Then filters those ranges based on the 'filter' callback\n  //\n  // Here we use it to find ranges of characters with the same entity key.\n\n  findRangesImmutable(characters, // the list to iterate through\n  function (a, b) {\n    return a.getEntity() === b.getEntity();\n  }, // 'isEqual' callback\n  function (element) {\n    return element.getEntity() === entityKey;\n  }, // 'filter' callback\n  function (start, end) {\n    // 'found' callback\n    if (start <= offset && end >= offset) {\n      // this entity overlaps the offset index\n      removalRange = {\n        start: start,\n        end: end\n      };\n    }\n  });\n  !(typeof removalRange === 'object') ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Removal range must exist within character list.') : invariant(false) : void 0;\n  return removalRange;\n}\n\nfunction removeForBlock(entityMap, block, offset) {\n  var chars = block.getCharacterList();\n  var charBefore = offset > 0 ? chars.get(offset - 1) : undefined;\n  var charAfter = offset < chars.count() ? chars.get(offset) : undefined;\n  var entityBeforeCursor = charBefore ? charBefore.getEntity() : undefined;\n  var entityAfterCursor = charAfter ? charAfter.getEntity() : undefined;\n\n  if (entityAfterCursor && entityAfterCursor === entityBeforeCursor) {\n    var entity = entityMap.__get(entityAfterCursor);\n\n    if (entity.getMutability() !== 'MUTABLE') {\n      var _getRemovalRange = getRemovalRange(chars, entityAfterCursor, offset),\n          start = _getRemovalRange.start,\n          end = _getRemovalRange.end;\n\n      var current;\n\n      while (start < end) {\n        current = chars.get(start);\n        chars = chars.set(start, CharacterMetadata.applyEntity(current, null));\n        start++;\n      }\n\n      return block.set('characterList', chars);\n    }\n  }\n\n  return block;\n}\n\nmodule.exports = removeEntitiesAtEdges;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar getNextDelimiterBlockKey = require(\"./getNextDelimiterBlockKey\");\n\nvar Immutable = require(\"immutable\");\n\nvar List = Immutable.List,\n    Map = Immutable.Map;\n\nvar transformBlock = function transformBlock(key, blockMap, func) {\n  if (!key) {\n    return;\n  }\n\n  var block = blockMap.get(key);\n\n  if (!block) {\n    return;\n  }\n\n  blockMap.set(key, func(block));\n};\n/**\n * Ancestors needs to be preserved when there are non selected\n * children to make sure we do not leave any orphans behind\n */\n\n\nvar getAncestorsKeys = function getAncestorsKeys(blockKey, blockMap) {\n  var parents = [];\n\n  if (!blockKey) {\n    return parents;\n  }\n\n  var blockNode = blockMap.get(blockKey);\n\n  while (blockNode && blockNode.getParentKey()) {\n    var parentKey = blockNode.getParentKey();\n\n    if (parentKey) {\n      parents.push(parentKey);\n    }\n\n    blockNode = parentKey ? blockMap.get(parentKey) : null;\n  }\n\n  return parents;\n};\n/**\n * Get all next delimiter keys until we hit a root delimiter and return\n * an array of key references\n */\n\n\nvar getNextDelimitersBlockKeys = function getNextDelimitersBlockKeys(block, blockMap) {\n  var nextDelimiters = [];\n\n  if (!block) {\n    return nextDelimiters;\n  }\n\n  var nextDelimiter = getNextDelimiterBlockKey(block, blockMap);\n\n  while (nextDelimiter && blockMap.get(nextDelimiter)) {\n    var _block = blockMap.get(nextDelimiter);\n\n    nextDelimiters.push(nextDelimiter); // we do not need to keep checking all root node siblings, just the first occurance\n\n    nextDelimiter = _block.getParentKey() ? getNextDelimiterBlockKey(_block, blockMap) : null;\n  }\n\n  return nextDelimiters;\n};\n\nvar getNextValidSibling = function getNextValidSibling(block, blockMap, originalBlockMap) {\n  if (!block) {\n    return null;\n  } // note that we need to make sure we refer to the original block since this\n  // function is called within a withMutations\n\n\n  var nextValidSiblingKey = originalBlockMap.get(block.getKey()).getNextSiblingKey();\n\n  while (nextValidSiblingKey && !blockMap.get(nextValidSiblingKey)) {\n    nextValidSiblingKey = originalBlockMap.get(nextValidSiblingKey).getNextSiblingKey() || null;\n  }\n\n  return nextValidSiblingKey;\n};\n\nvar getPrevValidSibling = function getPrevValidSibling(block, blockMap, originalBlockMap) {\n  if (!block) {\n    return null;\n  } // note that we need to make sure we refer to the original block since this\n  // function is called within a withMutations\n\n\n  var prevValidSiblingKey = originalBlockMap.get(block.getKey()).getPrevSiblingKey();\n\n  while (prevValidSiblingKey && !blockMap.get(prevValidSiblingKey)) {\n    prevValidSiblingKey = originalBlockMap.get(prevValidSiblingKey).getPrevSiblingKey() || null;\n  }\n\n  return prevValidSiblingKey;\n};\n\nvar updateBlockMapLinks = function updateBlockMapLinks(blockMap, startBlock, endBlock, originalBlockMap) {\n  return blockMap.withMutations(function (blocks) {\n    // update start block if its retained\n    transformBlock(startBlock.getKey(), blocks, function (block) {\n      return block.merge({\n        nextSibling: getNextValidSibling(block, blocks, originalBlockMap),\n        prevSibling: getPrevValidSibling(block, blocks, originalBlockMap)\n      });\n    }); // update endblock if its retained\n\n    transformBlock(endBlock.getKey(), blocks, function (block) {\n      return block.merge({\n        nextSibling: getNextValidSibling(block, blocks, originalBlockMap),\n        prevSibling: getPrevValidSibling(block, blocks, originalBlockMap)\n      });\n    }); // update start block parent ancestors\n\n    getAncestorsKeys(startBlock.getKey(), originalBlockMap).forEach(function (parentKey) {\n      return transformBlock(parentKey, blocks, function (block) {\n        return block.merge({\n          children: block.getChildKeys().filter(function (key) {\n            return blocks.get(key);\n          }),\n          nextSibling: getNextValidSibling(block, blocks, originalBlockMap),\n          prevSibling: getPrevValidSibling(block, blocks, originalBlockMap)\n        });\n      });\n    }); // update start block next - can only happen if startBlock == endBlock\n\n    transformBlock(startBlock.getNextSiblingKey(), blocks, function (block) {\n      return block.merge({\n        prevSibling: startBlock.getPrevSiblingKey()\n      });\n    }); // update start block prev\n\n    transformBlock(startBlock.getPrevSiblingKey(), blocks, function (block) {\n      return block.merge({\n        nextSibling: getNextValidSibling(block, blocks, originalBlockMap)\n      });\n    }); // update end block next\n\n    transformBlock(endBlock.getNextSiblingKey(), blocks, function (block) {\n      return block.merge({\n        prevSibling: getPrevValidSibling(block, blocks, originalBlockMap)\n      });\n    }); // update end block prev\n\n    transformBlock(endBlock.getPrevSiblingKey(), blocks, function (block) {\n      return block.merge({\n        nextSibling: endBlock.getNextSiblingKey()\n      });\n    }); // update end block parent ancestors\n\n    getAncestorsKeys(endBlock.getKey(), originalBlockMap).forEach(function (parentKey) {\n      transformBlock(parentKey, blocks, function (block) {\n        return block.merge({\n          children: block.getChildKeys().filter(function (key) {\n            return blocks.get(key);\n          }),\n          nextSibling: getNextValidSibling(block, blocks, originalBlockMap),\n          prevSibling: getPrevValidSibling(block, blocks, originalBlockMap)\n        });\n      });\n    }); // update next delimiters all the way to a root delimiter\n\n    getNextDelimitersBlockKeys(endBlock, originalBlockMap).forEach(function (delimiterKey) {\n      return transformBlock(delimiterKey, blocks, function (block) {\n        return block.merge({\n          nextSibling: getNextValidSibling(block, blocks, originalBlockMap),\n          prevSibling: getPrevValidSibling(block, blocks, originalBlockMap)\n        });\n      });\n    }); // if parent (startBlock) was deleted\n\n    if (blockMap.get(startBlock.getKey()) == null && blockMap.get(endBlock.getKey()) != null && endBlock.getParentKey() === startBlock.getKey() && endBlock.getPrevSiblingKey() == null) {\n      var prevSiblingKey = startBlock.getPrevSiblingKey(); // endBlock becomes next sibling of parent's prevSibling\n\n      transformBlock(endBlock.getKey(), blocks, function (block) {\n        return block.merge({\n          prevSibling: prevSiblingKey\n        });\n      });\n      transformBlock(prevSiblingKey, blocks, function (block) {\n        return block.merge({\n          nextSibling: endBlock.getKey()\n        });\n      }); // Update parent for previous parent's children, and children for that parent\n\n      var prevSibling = prevSiblingKey ? blockMap.get(prevSiblingKey) : null;\n      var newParentKey = prevSibling ? prevSibling.getParentKey() : null;\n      startBlock.getChildKeys().forEach(function (childKey) {\n        transformBlock(childKey, blocks, function (block) {\n          return block.merge({\n            parent: newParentKey // set to null if there is no parent\n\n          });\n        });\n      });\n\n      if (newParentKey != null) {\n        var newParent = blockMap.get(newParentKey);\n        transformBlock(newParentKey, blocks, function (block) {\n          return block.merge({\n            children: newParent.getChildKeys().concat(startBlock.getChildKeys())\n          });\n        });\n      } // last child of deleted parent should point to next sibling\n\n\n      transformBlock(startBlock.getChildKeys().find(function (key) {\n        var block = blockMap.get(key);\n        return block.getNextSiblingKey() === null;\n      }), blocks, function (block) {\n        return block.merge({\n          nextSibling: startBlock.getNextSiblingKey()\n        });\n      });\n    }\n  });\n};\n\nvar removeRangeFromContentState = function removeRangeFromContentState(contentState, selectionState) {\n  if (selectionState.isCollapsed()) {\n    return contentState;\n  }\n\n  var blockMap = contentState.getBlockMap();\n  var startKey = selectionState.getStartKey();\n  var startOffset = selectionState.getStartOffset();\n  var endKey = selectionState.getEndKey();\n  var endOffset = selectionState.getEndOffset();\n  var startBlock = blockMap.get(startKey);\n  var endBlock = blockMap.get(endKey); // we assume that ContentBlockNode and ContentBlocks are not mixed together\n\n  var isExperimentalTreeBlock = startBlock instanceof ContentBlockNode; // used to retain blocks that should not be deleted to avoid orphan children\n\n  var parentAncestors = [];\n\n  if (isExperimentalTreeBlock) {\n    var endBlockchildrenKeys = endBlock.getChildKeys();\n    var endBlockAncestors = getAncestorsKeys(endKey, blockMap); // endBlock has unselected siblings so we can not remove its ancestors parents\n\n    if (endBlock.getNextSiblingKey()) {\n      parentAncestors = parentAncestors.concat(endBlockAncestors);\n    } // endBlock has children so can not remove this block or any of its ancestors\n\n\n    if (!endBlockchildrenKeys.isEmpty()) {\n      parentAncestors = parentAncestors.concat(endBlockAncestors.concat([endKey]));\n    } // we need to retain all ancestors of the next delimiter block\n\n\n    parentAncestors = parentAncestors.concat(getAncestorsKeys(getNextDelimiterBlockKey(endBlock, blockMap), blockMap));\n  }\n\n  var characterList;\n\n  if (startBlock === endBlock) {\n    characterList = removeFromList(startBlock.getCharacterList(), startOffset, endOffset);\n  } else {\n    characterList = startBlock.getCharacterList().slice(0, startOffset).concat(endBlock.getCharacterList().slice(endOffset));\n  }\n\n  var modifiedStart = startBlock.merge({\n    text: startBlock.getText().slice(0, startOffset) + endBlock.getText().slice(endOffset),\n    characterList: characterList\n  }); // If cursor (collapsed) is at the start of the first child, delete parent\n  // instead of child\n\n  var shouldDeleteParent = isExperimentalTreeBlock && startOffset === 0 && endOffset === 0 && endBlock.getParentKey() === startKey && endBlock.getPrevSiblingKey() == null;\n  var newBlocks = shouldDeleteParent ? Map([[startKey, null]]) : blockMap.toSeq().skipUntil(function (_, k) {\n    return k === startKey;\n  }).takeUntil(function (_, k) {\n    return k === endKey;\n  }).filter(function (_, k) {\n    return parentAncestors.indexOf(k) === -1;\n  }).concat(Map([[endKey, null]])).map(function (_, k) {\n    return k === startKey ? modifiedStart : null;\n  });\n  var updatedBlockMap = blockMap.merge(newBlocks).filter(function (block) {\n    return !!block;\n  }); // Only update tree block pointers if the range is across blocks\n\n  if (isExperimentalTreeBlock && startBlock !== endBlock) {\n    updatedBlockMap = updateBlockMapLinks(updatedBlockMap, startBlock, endBlock, blockMap);\n  }\n\n  return contentState.merge({\n    blockMap: updatedBlockMap,\n    selectionBefore: selectionState,\n    selectionAfter: selectionState.merge({\n      anchorKey: startKey,\n      anchorOffset: startOffset,\n      focusKey: startKey,\n      focusOffset: startOffset,\n      isBackward: false\n    })\n  });\n};\n/**\n * Maintain persistence for target list when removing characters on the\n * head and tail of the character list.\n */\n\n\nvar removeFromList = function removeFromList(targetList, startOffset, endOffset) {\n  if (startOffset === 0) {\n    while (startOffset < endOffset) {\n      targetList = targetList.shift();\n      startOffset++;\n    }\n  } else if (endOffset === targetList.count()) {\n    while (endOffset > startOffset) {\n      targetList = targetList.pop();\n      endOffset--;\n    }\n  } else {\n    var head = targetList.slice(0, startOffset);\n    var tail = targetList.slice(endOffset);\n    targetList = head.concat(tail).toList();\n  }\n\n  return targetList;\n};\n\nmodule.exports = removeRangeFromContentState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar gkx = require(\"./gkx\");\n\nvar experimentalTreeDataSupport = gkx('draft_tree_data_support');\n/**\n * For a collapsed selection state, remove text based on the specified strategy.\n * If the selection state is not collapsed, remove the entire selected range.\n */\n\nfunction removeTextWithStrategy(editorState, strategy, direction) {\n  var selection = editorState.getSelection();\n  var content = editorState.getCurrentContent();\n  var target = selection;\n  var anchorKey = selection.getAnchorKey();\n  var focusKey = selection.getFocusKey();\n  var anchorBlock = content.getBlockForKey(anchorKey);\n\n  if (experimentalTreeDataSupport) {\n    if (direction === 'forward') {\n      if (anchorKey !== focusKey) {\n        // For now we ignore forward delete across blocks,\n        // if there is demand for this we will implement it.\n        return content;\n      }\n    }\n  }\n\n  if (selection.isCollapsed()) {\n    if (direction === 'forward') {\n      if (editorState.isSelectionAtEndOfContent()) {\n        return content;\n      }\n\n      if (experimentalTreeDataSupport) {\n        var isAtEndOfBlock = selection.getAnchorOffset() === content.getBlockForKey(anchorKey).getLength();\n\n        if (isAtEndOfBlock) {\n          var anchorBlockSibling = content.getBlockForKey(anchorBlock.nextSibling);\n\n          if (!anchorBlockSibling || anchorBlockSibling.getLength() === 0) {\n            // For now we ignore forward delete at the end of a block,\n            // if there is demand for this we will implement it.\n            return content;\n          }\n        }\n      }\n    } else if (editorState.isSelectionAtStartOfContent()) {\n      return content;\n    }\n\n    target = strategy(editorState);\n\n    if (target === selection) {\n      return content;\n    }\n  }\n\n  return DraftModifier.removeRange(content, target, direction);\n}\n\nmodule.exports = removeTextWithStrategy;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar REGEX_BLOCK_DELIMITER = new RegExp('\\r', 'g');\n\nfunction sanitizeDraftText(input) {\n  return input.replace(REGEX_BLOCK_DELIMITER, '');\n}\n\nmodule.exports = sanitizeDraftText;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftEffects = require(\"./DraftEffects\");\n\nvar DraftJsDebugLogging = require(\"./DraftJsDebugLogging\");\n\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nvar containsNode = require(\"fbjs/lib/containsNode\");\n\nvar getActiveElement = require(\"fbjs/lib/getActiveElement\");\n\nvar getCorrectDocumentFromNode = require(\"./getCorrectDocumentFromNode\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar isElement = require(\"./isElement\");\n\nvar isIE = UserAgent.isBrowser('IE');\n\nfunction getAnonymizedDOM(node, getNodeLabels) {\n  if (!node) {\n    return '[empty]';\n  }\n\n  var anonymized = anonymizeTextWithin(node, getNodeLabels);\n\n  if (anonymized.nodeType === Node.TEXT_NODE) {\n    return anonymized.textContent;\n  }\n\n  !isElement(anonymized) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Node must be an Element if it is not a text node.') : invariant(false) : void 0;\n  var castedElement = anonymized;\n  return castedElement.outerHTML;\n}\n\nfunction anonymizeTextWithin(node, getNodeLabels) {\n  var labels = getNodeLabels !== undefined ? getNodeLabels(node) : [];\n\n  if (node.nodeType === Node.TEXT_NODE) {\n    var length = node.textContent.length;\n    return getCorrectDocumentFromNode(node).createTextNode('[text ' + length + (labels.length ? ' | ' + labels.join(', ') : '') + ']');\n  }\n\n  var clone = node.cloneNode();\n\n  if (clone.nodeType === 1 && labels.length) {\n    clone.setAttribute('data-labels', labels.join(', '));\n  }\n\n  var childNodes = node.childNodes;\n\n  for (var ii = 0; ii < childNodes.length; ii++) {\n    clone.appendChild(anonymizeTextWithin(childNodes[ii], getNodeLabels));\n  }\n\n  return clone;\n}\n\nfunction getAnonymizedEditorDOM(node, getNodeLabels) {\n  // grabbing the DOM content of the Draft editor\n  var currentNode = node; // this should only be used after checking with isElement\n\n  var castedNode = currentNode;\n\n  while (currentNode) {\n    if (isElement(currentNode) && castedNode.hasAttribute('contenteditable')) {\n      // found the Draft editor container\n      return getAnonymizedDOM(currentNode, getNodeLabels);\n    } else {\n      currentNode = currentNode.parentNode;\n      castedNode = currentNode;\n    }\n  }\n\n  return 'Could not find contentEditable parent of node';\n}\n\nfunction getNodeLength(node) {\n  return node.nodeValue === null ? node.childNodes.length : node.nodeValue.length;\n}\n/**\n * In modern non-IE browsers, we can support both forward and backward\n * selections.\n *\n * Note: IE10+ supports the Selection object, but it does not support\n * the `extend` method, which means that even in modern IE, it's not possible\n * to programatically create a backward selection. Thus, for all IE\n * versions, we use the old IE API to create our selections.\n */\n\n\nfunction setDraftEditorSelection(selectionState, node, blockKey, nodeStart, nodeEnd) {\n  // It's possible that the editor has been removed from the DOM but\n  // our selection code doesn't know it yet. Forcing selection in\n  // this case may lead to errors, so just bail now.\n  var documentObject = getCorrectDocumentFromNode(node);\n\n  if (!containsNode(documentObject.documentElement, node)) {\n    return;\n  }\n\n  var selection = documentObject.defaultView.getSelection();\n  var anchorKey = selectionState.getAnchorKey();\n  var anchorOffset = selectionState.getAnchorOffset();\n  var focusKey = selectionState.getFocusKey();\n  var focusOffset = selectionState.getFocusOffset();\n  var isBackward = selectionState.getIsBackward(); // IE doesn't support backward selection. Swap key/offset pairs.\n\n  if (!selection.extend && isBackward) {\n    var tempKey = anchorKey;\n    var tempOffset = anchorOffset;\n    anchorKey = focusKey;\n    anchorOffset = focusOffset;\n    focusKey = tempKey;\n    focusOffset = tempOffset;\n    isBackward = false;\n  }\n\n  var hasAnchor = anchorKey === blockKey && nodeStart <= anchorOffset && nodeEnd >= anchorOffset;\n  var hasFocus = focusKey === blockKey && nodeStart <= focusOffset && nodeEnd >= focusOffset; // If the selection is entirely bound within this node, set the selection\n  // and be done.\n\n  if (hasAnchor && hasFocus) {\n    selection.removeAllRanges();\n    addPointToSelection(selection, node, anchorOffset - nodeStart, selectionState);\n    addFocusToSelection(selection, node, focusOffset - nodeStart, selectionState);\n    return;\n  }\n\n  if (!isBackward) {\n    // If the anchor is within this node, set the range start.\n    if (hasAnchor) {\n      selection.removeAllRanges();\n      addPointToSelection(selection, node, anchorOffset - nodeStart, selectionState);\n    } // If the focus is within this node, we can assume that we have\n    // already set the appropriate start range on the selection, and\n    // can simply extend the selection.\n\n\n    if (hasFocus) {\n      addFocusToSelection(selection, node, focusOffset - nodeStart, selectionState);\n    }\n  } else {\n    // If this node has the focus, set the selection range to be a\n    // collapsed range beginning here. Later, when we encounter the anchor,\n    // we'll use this information to extend the selection.\n    if (hasFocus) {\n      selection.removeAllRanges();\n      addPointToSelection(selection, node, focusOffset - nodeStart, selectionState);\n    } // If this node has the anchor, we may assume that the correct\n    // focus information is already stored on the selection object.\n    // We keep track of it, reset the selection range, and extend it\n    // back to the focus point.\n\n\n    if (hasAnchor) {\n      var storedFocusNode = selection.focusNode;\n      var storedFocusOffset = selection.focusOffset;\n      selection.removeAllRanges();\n      addPointToSelection(selection, node, anchorOffset - nodeStart, selectionState);\n      addFocusToSelection(selection, storedFocusNode, storedFocusOffset, selectionState);\n    }\n  }\n}\n/**\n * Extend selection towards focus point.\n */\n\n\nfunction addFocusToSelection(selection, node, offset, selectionState) {\n  var activeElement = getActiveElement();\n  var extend = selection.extend; // containsNode returns false if node is null.\n  // Let's refine the type of this value out here so flow knows.\n\n  if (extend && node != null && containsNode(activeElement, node)) {\n    // If `extend` is called while another element has focus, an error is\n    // thrown. We therefore disable `extend` if the active element is somewhere\n    // other than the node we are selecting. This should only occur in Firefox,\n    // since it is the only browser to support multiple selections.\n    // See https://bugzilla.mozilla.org/show_bug.cgi?id=921444.\n    // logging to catch bug that is being reported in t16250795\n    if (offset > getNodeLength(node)) {\n      // the call to 'selection.extend' is about to throw\n      DraftJsDebugLogging.logSelectionStateFailure({\n        anonymizedDom: getAnonymizedEditorDOM(node),\n        extraParams: JSON.stringify({\n          offset: offset\n        }),\n        selectionState: JSON.stringify(selectionState.toJS())\n      });\n    } // logging to catch bug that is being reported in t18110632\n\n\n    var nodeWasFocus = node === selection.focusNode;\n\n    try {\n      // Fixes some reports of \"InvalidStateError: Failed to execute 'extend' on\n      // 'Selection': This Selection object doesn't have any Ranges.\"\n      // Note: selection.extend does not exist in IE.\n      if (selection.rangeCount > 0 && selection.extend) {\n        selection.extend(node, offset);\n      }\n    } catch (e) {\n      DraftJsDebugLogging.logSelectionStateFailure({\n        anonymizedDom: getAnonymizedEditorDOM(node, function (n) {\n          var labels = [];\n\n          if (n === activeElement) {\n            labels.push('active element');\n          }\n\n          if (n === selection.anchorNode) {\n            labels.push('selection anchor node');\n          }\n\n          if (n === selection.focusNode) {\n            labels.push('selection focus node');\n          }\n\n          return labels;\n        }),\n        extraParams: JSON.stringify({\n          activeElementName: activeElement ? activeElement.nodeName : null,\n          nodeIsFocus: node === selection.focusNode,\n          nodeWasFocus: nodeWasFocus,\n          selectionRangeCount: selection.rangeCount,\n          selectionAnchorNodeName: selection.anchorNode ? selection.anchorNode.nodeName : null,\n          selectionAnchorOffset: selection.anchorOffset,\n          selectionFocusNodeName: selection.focusNode ? selection.focusNode.nodeName : null,\n          selectionFocusOffset: selection.focusOffset,\n          message: e ? '' + e : null,\n          offset: offset\n        }, null, 2),\n        selectionState: JSON.stringify(selectionState.toJS(), null, 2)\n      }); // allow the error to be thrown -\n      // better than continuing in a broken state\n\n      throw e;\n    }\n  } else {\n    // IE doesn't support extend. This will mean no backward selection.\n    // Extract the existing selection range and add focus to it.\n    // Additionally, clone the selection range. IE11 throws an\n    // InvalidStateError when attempting to access selection properties\n    // after the range is detached.\n    if (node && selection.rangeCount > 0) {\n      var range = selection.getRangeAt(0);\n      range.setEnd(node, offset);\n      selection.addRange(range.cloneRange());\n    }\n  }\n}\n\nfunction addPointToSelection(selection, node, offset, selectionState) {\n  var range = getCorrectDocumentFromNode(node).createRange(); // logging to catch bug that is being reported in t16250795\n\n  if (offset > getNodeLength(node)) {\n    // in this case we know that the call to 'range.setStart' is about to throw\n    DraftJsDebugLogging.logSelectionStateFailure({\n      anonymizedDom: getAnonymizedEditorDOM(node),\n      extraParams: JSON.stringify({\n        offset: offset\n      }),\n      selectionState: JSON.stringify(selectionState.toJS())\n    });\n    DraftEffects.handleExtensionCausedError();\n  }\n\n  range.setStart(node, offset); // IE sometimes throws Unspecified Error when trying to addRange\n\n  if (isIE) {\n    try {\n      selection.addRange(range);\n    } catch (e) {\n      if (process.env.NODE_ENV !== \"production\") {\n        /* eslint-disable-next-line no-console */\n        console.warn('Call to selection.addRange() threw exception: ', e);\n      }\n    }\n  } else {\n    selection.addRange(range);\n  }\n}\n\nmodule.exports = {\n  setDraftEditorSelection: setDraftEditorSelection,\n  addFocusToSelection: addFocusToSelection\n};","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar generateRandomKey = require(\"./generateRandomKey\");\n\nvar Immutable = require(\"immutable\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar modifyBlockForContentState = require(\"./modifyBlockForContentState\");\n\nvar List = Immutable.List,\n    Map = Immutable.Map;\n\nvar transformBlock = function transformBlock(key, blockMap, func) {\n  if (!key) {\n    return;\n  }\n\n  var block = blockMap.get(key);\n\n  if (!block) {\n    return;\n  }\n\n  blockMap.set(key, func(block));\n};\n\nvar updateBlockMapLinks = function updateBlockMapLinks(blockMap, originalBlock, belowBlock) {\n  return blockMap.withMutations(function (blocks) {\n    var originalBlockKey = originalBlock.getKey();\n    var belowBlockKey = belowBlock.getKey(); // update block parent\n\n    transformBlock(originalBlock.getParentKey(), blocks, function (block) {\n      var parentChildrenList = block.getChildKeys();\n      var insertionIndex = parentChildrenList.indexOf(originalBlockKey) + 1;\n      var newChildrenArray = parentChildrenList.toArray();\n      newChildrenArray.splice(insertionIndex, 0, belowBlockKey);\n      return block.merge({\n        children: List(newChildrenArray)\n      });\n    }); // update original next block\n\n    transformBlock(originalBlock.getNextSiblingKey(), blocks, function (block) {\n      return block.merge({\n        prevSibling: belowBlockKey\n      });\n    }); // update original block\n\n    transformBlock(originalBlockKey, blocks, function (block) {\n      return block.merge({\n        nextSibling: belowBlockKey\n      });\n    }); // update below block\n\n    transformBlock(belowBlockKey, blocks, function (block) {\n      return block.merge({\n        prevSibling: originalBlockKey\n      });\n    });\n  });\n};\n\nvar splitBlockInContentState = function splitBlockInContentState(contentState, selectionState) {\n  !selectionState.isCollapsed() ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Selection range must be collapsed.') : invariant(false) : void 0;\n  var key = selectionState.getAnchorKey();\n  var blockMap = contentState.getBlockMap();\n  var blockToSplit = blockMap.get(key);\n  var text = blockToSplit.getText();\n\n  if (!text) {\n    var blockType = blockToSplit.getType();\n\n    if (blockType === 'unordered-list-item' || blockType === 'ordered-list-item') {\n      return modifyBlockForContentState(contentState, selectionState, function (block) {\n        return block.merge({\n          type: 'unstyled',\n          depth: 0\n        });\n      });\n    }\n  }\n\n  var offset = selectionState.getAnchorOffset();\n  var chars = blockToSplit.getCharacterList();\n  var keyBelow = generateRandomKey();\n  var isExperimentalTreeBlock = blockToSplit instanceof ContentBlockNode;\n  var blockAbove = blockToSplit.merge({\n    text: text.slice(0, offset),\n    characterList: chars.slice(0, offset)\n  });\n  var blockBelow = blockAbove.merge({\n    key: keyBelow,\n    text: text.slice(offset),\n    characterList: chars.slice(offset),\n    data: Map()\n  });\n  var blocksBefore = blockMap.toSeq().takeUntil(function (v) {\n    return v === blockToSplit;\n  });\n  var blocksAfter = blockMap.toSeq().skipUntil(function (v) {\n    return v === blockToSplit;\n  }).rest();\n  var newBlocks = blocksBefore.concat([[key, blockAbove], [keyBelow, blockBelow]], blocksAfter).toOrderedMap();\n\n  if (isExperimentalTreeBlock) {\n    !blockToSplit.getChildKeys().isEmpty() ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'ContentBlockNode must not have children') : invariant(false) : void 0;\n    newBlocks = updateBlockMapLinks(newBlocks, blockAbove, blockBelow);\n  }\n\n  return contentState.merge({\n    blockMap: newBlocks,\n    selectionBefore: selectionState,\n    selectionAfter: selectionState.merge({\n      anchorKey: keyBelow,\n      anchorOffset: 0,\n      focusKey: keyBelow,\n      focusOffset: 0,\n      isBackward: false\n    })\n  });\n};\n\nmodule.exports = splitBlockInContentState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar NEWLINE_REGEX = /\\r\\n?|\\n/g;\n\nfunction splitTextIntoTextBlocks(text) {\n  return text.split(NEWLINE_REGEX);\n}\n\nmodule.exports = splitTextIntoTextBlocks;","\"use strict\";\n\n/**\n * Copyright 2004-present Facebook. All Rights Reserved.\n *\n * @typechecks\n * \n * @format\n */\n\n/*eslint-disable no-bitwise */\n\n/**\n * Based on the rfc4122-compliant solution posted at\n * http://stackoverflow.com/questions/105034\n */\nfunction uuid() {\n  return 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx'.replace(/[xy]/g, function (c) {\n    var r = Math.random() * 16 | 0;\n    var v = c == 'x' ? r : r & 0x3 | 0x8;\n    return v.toString(16);\n  });\n}\n\nmodule.exports = uuid;","/**\n *  Copyright (c) 2014-2015, Facebook, Inc.\n *  All rights reserved.\n *\n *  This source code is licensed under the BSD-style license found in the\n *  LICENSE file in the root directory of this source tree. An additional grant\n *  of patent rights can be found in the PATENTS file in the same directory.\n */\n\n(function (global, factory) {\n  typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n  typeof define === 'function' && define.amd ? define(factory) :\n  global.Immutable = factory();\n}(this, function () { 'use strict';var SLICE$0 = Array.prototype.slice;\n\n  function createClass(ctor, superClass) {\n    if (superClass) {\n      ctor.prototype = Object.create(superClass.prototype);\n    }\n    ctor.prototype.constructor = ctor;\n  }\n\n  function Iterable(value) {\n      return isIterable(value) ? value : Seq(value);\n    }\n\n\n  createClass(KeyedIterable, Iterable);\n    function KeyedIterable(value) {\n      return isKeyed(value) ? value : KeyedSeq(value);\n    }\n\n\n  createClass(IndexedIterable, Iterable);\n    function IndexedIterable(value) {\n      return isIndexed(value) ? value : IndexedSeq(value);\n    }\n\n\n  createClass(SetIterable, Iterable);\n    function SetIterable(value) {\n      return isIterable(value) && !isAssociative(value) ? value : SetSeq(value);\n    }\n\n\n\n  function isIterable(maybeIterable) {\n    return !!(maybeIterable && maybeIterable[IS_ITERABLE_SENTINEL]);\n  }\n\n  function isKeyed(maybeKeyed) {\n    return !!(maybeKeyed && maybeKeyed[IS_KEYED_SENTINEL]);\n  }\n\n  function isIndexed(maybeIndexed) {\n    return !!(maybeIndexed && maybeIndexed[IS_INDEXED_SENTINEL]);\n  }\n\n  function isAssociative(maybeAssociative) {\n    return isKeyed(maybeAssociative) || isIndexed(maybeAssociative);\n  }\n\n  function isOrdered(maybeOrdered) {\n    return !!(maybeOrdered && maybeOrdered[IS_ORDERED_SENTINEL]);\n  }\n\n  Iterable.isIterable = isIterable;\n  Iterable.isKeyed = isKeyed;\n  Iterable.isIndexed = isIndexed;\n  Iterable.isAssociative = isAssociative;\n  Iterable.isOrdered = isOrdered;\n\n  Iterable.Keyed = KeyedIterable;\n  Iterable.Indexed = IndexedIterable;\n  Iterable.Set = SetIterable;\n\n\n  var IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\n  var IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\n  var IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\n  var IS_ORDERED_SENTINEL = '@@__IMMUTABLE_ORDERED__@@';\n\n  // Used for setting prototype methods that IE8 chokes on.\n  var DELETE = 'delete';\n\n  // Constants describing the size of trie nodes.\n  var SHIFT = 5; // Resulted in best performance after ______?\n  var SIZE = 1 << SHIFT;\n  var MASK = SIZE - 1;\n\n  // A consistent shared value representing \"not set\" which equals nothing other\n  // than itself, and nothing that could be provided externally.\n  var NOT_SET = {};\n\n  // Boolean references, Rough equivalent of `bool &`.\n  var CHANGE_LENGTH = { value: false };\n  var DID_ALTER = { value: false };\n\n  function MakeRef(ref) {\n    ref.value = false;\n    return ref;\n  }\n\n  function SetRef(ref) {\n    ref && (ref.value = true);\n  }\n\n  // A function which returns a value representing an \"owner\" for transient writes\n  // to tries. The return value will only ever equal itself, and will not equal\n  // the return of any subsequent call of this function.\n  function OwnerID() {}\n\n  // http://jsperf.com/copy-array-inline\n  function arrCopy(arr, offset) {\n    offset = offset || 0;\n    var len = Math.max(0, arr.length - offset);\n    var newArr = new Array(len);\n    for (var ii = 0; ii < len; ii++) {\n      newArr[ii] = arr[ii + offset];\n    }\n    return newArr;\n  }\n\n  function ensureSize(iter) {\n    if (iter.size === undefined) {\n      iter.size = iter.__iterate(returnTrue);\n    }\n    return iter.size;\n  }\n\n  function wrapIndex(iter, index) {\n    // This implements \"is array index\" which the ECMAString spec defines as:\n    //\n    //     A String property name P is an array index if and only if\n    //     ToString(ToUint32(P)) is equal to P and ToUint32(P) is not equal\n    //     to 2^32−1.\n    //\n    // http://www.ecma-international.org/ecma-262/6.0/#sec-array-exotic-objects\n    if (typeof index !== 'number') {\n      var uint32Index = index >>> 0; // N >>> 0 is shorthand for ToUint32\n      if ('' + uint32Index !== index || uint32Index === 4294967295) {\n        return NaN;\n      }\n      index = uint32Index;\n    }\n    return index < 0 ? ensureSize(iter) + index : index;\n  }\n\n  function returnTrue() {\n    return true;\n  }\n\n  function wholeSlice(begin, end, size) {\n    return (begin === 0 || (size !== undefined && begin <= -size)) &&\n      (end === undefined || (size !== undefined && end >= size));\n  }\n\n  function resolveBegin(begin, size) {\n    return resolveIndex(begin, size, 0);\n  }\n\n  function resolveEnd(end, size) {\n    return resolveIndex(end, size, size);\n  }\n\n  function resolveIndex(index, size, defaultIndex) {\n    return index === undefined ?\n      defaultIndex :\n      index < 0 ?\n        Math.max(0, size + index) :\n        size === undefined ?\n          index :\n          Math.min(size, index);\n  }\n\n  /* global Symbol */\n\n  var ITERATE_KEYS = 0;\n  var ITERATE_VALUES = 1;\n  var ITERATE_ENTRIES = 2;\n\n  var REAL_ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;\n  var FAUX_ITERATOR_SYMBOL = '@@iterator';\n\n  var ITERATOR_SYMBOL = REAL_ITERATOR_SYMBOL || FAUX_ITERATOR_SYMBOL;\n\n\n  function Iterator(next) {\n      this.next = next;\n    }\n\n    Iterator.prototype.toString = function() {\n      return '[Iterator]';\n    };\n\n\n  Iterator.KEYS = ITERATE_KEYS;\n  Iterator.VALUES = ITERATE_VALUES;\n  Iterator.ENTRIES = ITERATE_ENTRIES;\n\n  Iterator.prototype.inspect =\n  Iterator.prototype.toSource = function () { return this.toString(); }\n  Iterator.prototype[ITERATOR_SYMBOL] = function () {\n    return this;\n  };\n\n\n  function iteratorValue(type, k, v, iteratorResult) {\n    var value = type === 0 ? k : type === 1 ? v : [k, v];\n    iteratorResult ? (iteratorResult.value = value) : (iteratorResult = {\n      value: value, done: false\n    });\n    return iteratorResult;\n  }\n\n  function iteratorDone() {\n    return { value: undefined, done: true };\n  }\n\n  function hasIterator(maybeIterable) {\n    return !!getIteratorFn(maybeIterable);\n  }\n\n  function isIterator(maybeIterator) {\n    return maybeIterator && typeof maybeIterator.next === 'function';\n  }\n\n  function getIterator(iterable) {\n    var iteratorFn = getIteratorFn(iterable);\n    return iteratorFn && iteratorFn.call(iterable);\n  }\n\n  function getIteratorFn(iterable) {\n    var iteratorFn = iterable && (\n      (REAL_ITERATOR_SYMBOL && iterable[REAL_ITERATOR_SYMBOL]) ||\n      iterable[FAUX_ITERATOR_SYMBOL]\n    );\n    if (typeof iteratorFn === 'function') {\n      return iteratorFn;\n    }\n  }\n\n  function isArrayLike(value) {\n    return value && typeof value.length === 'number';\n  }\n\n  createClass(Seq, Iterable);\n    function Seq(value) {\n      return value === null || value === undefined ? emptySequence() :\n        isIterable(value) ? value.toSeq() : seqFromValue(value);\n    }\n\n    Seq.of = function(/*...values*/) {\n      return Seq(arguments);\n    };\n\n    Seq.prototype.toSeq = function() {\n      return this;\n    };\n\n    Seq.prototype.toString = function() {\n      return this.__toString('Seq {', '}');\n    };\n\n    Seq.prototype.cacheResult = function() {\n      if (!this._cache && this.__iterateUncached) {\n        this._cache = this.entrySeq().toArray();\n        this.size = this._cache.length;\n      }\n      return this;\n    };\n\n    // abstract __iterateUncached(fn, reverse)\n\n    Seq.prototype.__iterate = function(fn, reverse) {\n      return seqIterate(this, fn, reverse, true);\n    };\n\n    // abstract __iteratorUncached(type, reverse)\n\n    Seq.prototype.__iterator = function(type, reverse) {\n      return seqIterator(this, type, reverse, true);\n    };\n\n\n\n  createClass(KeyedSeq, Seq);\n    function KeyedSeq(value) {\n      return value === null || value === undefined ?\n        emptySequence().toKeyedSeq() :\n        isIterable(value) ?\n          (isKeyed(value) ? value.toSeq() : value.fromEntrySeq()) :\n          keyedSeqFromValue(value);\n    }\n\n    KeyedSeq.prototype.toKeyedSeq = function() {\n      return this;\n    };\n\n\n\n  createClass(IndexedSeq, Seq);\n    function IndexedSeq(value) {\n      return value === null || value === undefined ? emptySequence() :\n        !isIterable(value) ? indexedSeqFromValue(value) :\n        isKeyed(value) ? value.entrySeq() : value.toIndexedSeq();\n    }\n\n    IndexedSeq.of = function(/*...values*/) {\n      return IndexedSeq(arguments);\n    };\n\n    IndexedSeq.prototype.toIndexedSeq = function() {\n      return this;\n    };\n\n    IndexedSeq.prototype.toString = function() {\n      return this.__toString('Seq [', ']');\n    };\n\n    IndexedSeq.prototype.__iterate = function(fn, reverse) {\n      return seqIterate(this, fn, reverse, false);\n    };\n\n    IndexedSeq.prototype.__iterator = function(type, reverse) {\n      return seqIterator(this, type, reverse, false);\n    };\n\n\n\n  createClass(SetSeq, Seq);\n    function SetSeq(value) {\n      return (\n        value === null || value === undefined ? emptySequence() :\n        !isIterable(value) ? indexedSeqFromValue(value) :\n        isKeyed(value) ? value.entrySeq() : value\n      ).toSetSeq();\n    }\n\n    SetSeq.of = function(/*...values*/) {\n      return SetSeq(arguments);\n    };\n\n    SetSeq.prototype.toSetSeq = function() {\n      return this;\n    };\n\n\n\n  Seq.isSeq = isSeq;\n  Seq.Keyed = KeyedSeq;\n  Seq.Set = SetSeq;\n  Seq.Indexed = IndexedSeq;\n\n  var IS_SEQ_SENTINEL = '@@__IMMUTABLE_SEQ__@@';\n\n  Seq.prototype[IS_SEQ_SENTINEL] = true;\n\n\n\n  createClass(ArraySeq, IndexedSeq);\n    function ArraySeq(array) {\n      this._array = array;\n      this.size = array.length;\n    }\n\n    ArraySeq.prototype.get = function(index, notSetValue) {\n      return this.has(index) ? this._array[wrapIndex(this, index)] : notSetValue;\n    };\n\n    ArraySeq.prototype.__iterate = function(fn, reverse) {\n      var array = this._array;\n      var maxIndex = array.length - 1;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        if (fn(array[reverse ? maxIndex - ii : ii], ii, this) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    };\n\n    ArraySeq.prototype.__iterator = function(type, reverse) {\n      var array = this._array;\n      var maxIndex = array.length - 1;\n      var ii = 0;\n      return new Iterator(function() \n        {return ii > maxIndex ?\n          iteratorDone() :\n          iteratorValue(type, ii, array[reverse ? maxIndex - ii++ : ii++])}\n      );\n    };\n\n\n\n  createClass(ObjectSeq, KeyedSeq);\n    function ObjectSeq(object) {\n      var keys = Object.keys(object);\n      this._object = object;\n      this._keys = keys;\n      this.size = keys.length;\n    }\n\n    ObjectSeq.prototype.get = function(key, notSetValue) {\n      if (notSetValue !== undefined && !this.has(key)) {\n        return notSetValue;\n      }\n      return this._object[key];\n    };\n\n    ObjectSeq.prototype.has = function(key) {\n      return this._object.hasOwnProperty(key);\n    };\n\n    ObjectSeq.prototype.__iterate = function(fn, reverse) {\n      var object = this._object;\n      var keys = this._keys;\n      var maxIndex = keys.length - 1;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        var key = keys[reverse ? maxIndex - ii : ii];\n        if (fn(object[key], key, this) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    };\n\n    ObjectSeq.prototype.__iterator = function(type, reverse) {\n      var object = this._object;\n      var keys = this._keys;\n      var maxIndex = keys.length - 1;\n      var ii = 0;\n      return new Iterator(function()  {\n        var key = keys[reverse ? maxIndex - ii : ii];\n        return ii++ > maxIndex ?\n          iteratorDone() :\n          iteratorValue(type, key, object[key]);\n      });\n    };\n\n  ObjectSeq.prototype[IS_ORDERED_SENTINEL] = true;\n\n\n  createClass(IterableSeq, IndexedSeq);\n    function IterableSeq(iterable) {\n      this._iterable = iterable;\n      this.size = iterable.length || iterable.size;\n    }\n\n    IterableSeq.prototype.__iterateUncached = function(fn, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var iterable = this._iterable;\n      var iterator = getIterator(iterable);\n      var iterations = 0;\n      if (isIterator(iterator)) {\n        var step;\n        while (!(step = iterator.next()).done) {\n          if (fn(step.value, iterations++, this) === false) {\n            break;\n          }\n        }\n      }\n      return iterations;\n    };\n\n    IterableSeq.prototype.__iteratorUncached = function(type, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterable = this._iterable;\n      var iterator = getIterator(iterable);\n      if (!isIterator(iterator)) {\n        return new Iterator(iteratorDone);\n      }\n      var iterations = 0;\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step : iteratorValue(type, iterations++, step.value);\n      });\n    };\n\n\n\n  createClass(IteratorSeq, IndexedSeq);\n    function IteratorSeq(iterator) {\n      this._iterator = iterator;\n      this._iteratorCache = [];\n    }\n\n    IteratorSeq.prototype.__iterateUncached = function(fn, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var iterator = this._iterator;\n      var cache = this._iteratorCache;\n      var iterations = 0;\n      while (iterations < cache.length) {\n        if (fn(cache[iterations], iterations++, this) === false) {\n          return iterations;\n        }\n      }\n      var step;\n      while (!(step = iterator.next()).done) {\n        var val = step.value;\n        cache[iterations] = val;\n        if (fn(val, iterations++, this) === false) {\n          break;\n        }\n      }\n      return iterations;\n    };\n\n    IteratorSeq.prototype.__iteratorUncached = function(type, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterator = this._iterator;\n      var cache = this._iteratorCache;\n      var iterations = 0;\n      return new Iterator(function()  {\n        if (iterations >= cache.length) {\n          var step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n          cache[iterations] = step.value;\n        }\n        return iteratorValue(type, iterations, cache[iterations++]);\n      });\n    };\n\n\n\n\n  // # pragma Helper functions\n\n  function isSeq(maybeSeq) {\n    return !!(maybeSeq && maybeSeq[IS_SEQ_SENTINEL]);\n  }\n\n  var EMPTY_SEQ;\n\n  function emptySequence() {\n    return EMPTY_SEQ || (EMPTY_SEQ = new ArraySeq([]));\n  }\n\n  function keyedSeqFromValue(value) {\n    var seq =\n      Array.isArray(value) ? new ArraySeq(value).fromEntrySeq() :\n      isIterator(value) ? new IteratorSeq(value).fromEntrySeq() :\n      hasIterator(value) ? new IterableSeq(value).fromEntrySeq() :\n      typeof value === 'object' ? new ObjectSeq(value) :\n      undefined;\n    if (!seq) {\n      throw new TypeError(\n        'Expected Array or iterable object of [k, v] entries, '+\n        'or keyed object: ' + value\n      );\n    }\n    return seq;\n  }\n\n  function indexedSeqFromValue(value) {\n    var seq = maybeIndexedSeqFromValue(value);\n    if (!seq) {\n      throw new TypeError(\n        'Expected Array or iterable object of values: ' + value\n      );\n    }\n    return seq;\n  }\n\n  function seqFromValue(value) {\n    var seq = maybeIndexedSeqFromValue(value) ||\n      (typeof value === 'object' && new ObjectSeq(value));\n    if (!seq) {\n      throw new TypeError(\n        'Expected Array or iterable object of values, or keyed object: ' + value\n      );\n    }\n    return seq;\n  }\n\n  function maybeIndexedSeqFromValue(value) {\n    return (\n      isArrayLike(value) ? new ArraySeq(value) :\n      isIterator(value) ? new IteratorSeq(value) :\n      hasIterator(value) ? new IterableSeq(value) :\n      undefined\n    );\n  }\n\n  function seqIterate(seq, fn, reverse, useKeys) {\n    var cache = seq._cache;\n    if (cache) {\n      var maxIndex = cache.length - 1;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        var entry = cache[reverse ? maxIndex - ii : ii];\n        if (fn(entry[1], useKeys ? entry[0] : ii, seq) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    }\n    return seq.__iterateUncached(fn, reverse);\n  }\n\n  function seqIterator(seq, type, reverse, useKeys) {\n    var cache = seq._cache;\n    if (cache) {\n      var maxIndex = cache.length - 1;\n      var ii = 0;\n      return new Iterator(function()  {\n        var entry = cache[reverse ? maxIndex - ii : ii];\n        return ii++ > maxIndex ?\n          iteratorDone() :\n          iteratorValue(type, useKeys ? entry[0] : ii - 1, entry[1]);\n      });\n    }\n    return seq.__iteratorUncached(type, reverse);\n  }\n\n  function fromJS(json, converter) {\n    return converter ?\n      fromJSWith(converter, json, '', {'': json}) :\n      fromJSDefault(json);\n  }\n\n  function fromJSWith(converter, json, key, parentJSON) {\n    if (Array.isArray(json)) {\n      return converter.call(parentJSON, key, IndexedSeq(json).map(function(v, k)  {return fromJSWith(converter, v, k, json)}));\n    }\n    if (isPlainObj(json)) {\n      return converter.call(parentJSON, key, KeyedSeq(json).map(function(v, k)  {return fromJSWith(converter, v, k, json)}));\n    }\n    return json;\n  }\n\n  function fromJSDefault(json) {\n    if (Array.isArray(json)) {\n      return IndexedSeq(json).map(fromJSDefault).toList();\n    }\n    if (isPlainObj(json)) {\n      return KeyedSeq(json).map(fromJSDefault).toMap();\n    }\n    return json;\n  }\n\n  function isPlainObj(value) {\n    return value && (value.constructor === Object || value.constructor === undefined);\n  }\n\n  /**\n   * An extension of the \"same-value\" algorithm as [described for use by ES6 Map\n   * and Set](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map#Key_equality)\n   *\n   * NaN is considered the same as NaN, however -0 and 0 are considered the same\n   * value, which is different from the algorithm described by\n   * [`Object.is`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is).\n   *\n   * This is extended further to allow Objects to describe the values they\n   * represent, by way of `valueOf` or `equals` (and `hashCode`).\n   *\n   * Note: because of this extension, the key equality of Immutable.Map and the\n   * value equality of Immutable.Set will differ from ES6 Map and Set.\n   *\n   * ### Defining custom values\n   *\n   * The easiest way to describe the value an object represents is by implementing\n   * `valueOf`. For example, `Date` represents a value by returning a unix\n   * timestamp for `valueOf`:\n   *\n   *     var date1 = new Date(1234567890000); // Fri Feb 13 2009 ...\n   *     var date2 = new Date(1234567890000);\n   *     date1.valueOf(); // 1234567890000\n   *     assert( date1 !== date2 );\n   *     assert( Immutable.is( date1, date2 ) );\n   *\n   * Note: overriding `valueOf` may have other implications if you use this object\n   * where JavaScript expects a primitive, such as implicit string coercion.\n   *\n   * For more complex types, especially collections, implementing `valueOf` may\n   * not be performant. An alternative is to implement `equals` and `hashCode`.\n   *\n   * `equals` takes another object, presumably of similar type, and returns true\n   * if the it is equal. Equality is symmetrical, so the same result should be\n   * returned if this and the argument are flipped.\n   *\n   *     assert( a.equals(b) === b.equals(a) );\n   *\n   * `hashCode` returns a 32bit integer number representing the object which will\n   * be used to determine how to store the value object in a Map or Set. You must\n   * provide both or neither methods, one must not exist without the other.\n   *\n   * Also, an important relationship between these methods must be upheld: if two\n   * values are equal, they *must* return the same hashCode. If the values are not\n   * equal, they might have the same hashCode; this is called a hash collision,\n   * and while undesirable for performance reasons, it is acceptable.\n   *\n   *     if (a.equals(b)) {\n   *       assert( a.hashCode() === b.hashCode() );\n   *     }\n   *\n   * All Immutable collections implement `equals` and `hashCode`.\n   *\n   */\n  function is(valueA, valueB) {\n    if (valueA === valueB || (valueA !== valueA && valueB !== valueB)) {\n      return true;\n    }\n    if (!valueA || !valueB) {\n      return false;\n    }\n    if (typeof valueA.valueOf === 'function' &&\n        typeof valueB.valueOf === 'function') {\n      valueA = valueA.valueOf();\n      valueB = valueB.valueOf();\n      if (valueA === valueB || (valueA !== valueA && valueB !== valueB)) {\n        return true;\n      }\n      if (!valueA || !valueB) {\n        return false;\n      }\n    }\n    if (typeof valueA.equals === 'function' &&\n        typeof valueB.equals === 'function' &&\n        valueA.equals(valueB)) {\n      return true;\n    }\n    return false;\n  }\n\n  function deepEqual(a, b) {\n    if (a === b) {\n      return true;\n    }\n\n    if (\n      !isIterable(b) ||\n      a.size !== undefined && b.size !== undefined && a.size !== b.size ||\n      a.__hash !== undefined && b.__hash !== undefined && a.__hash !== b.__hash ||\n      isKeyed(a) !== isKeyed(b) ||\n      isIndexed(a) !== isIndexed(b) ||\n      isOrdered(a) !== isOrdered(b)\n    ) {\n      return false;\n    }\n\n    if (a.size === 0 && b.size === 0) {\n      return true;\n    }\n\n    var notAssociative = !isAssociative(a);\n\n    if (isOrdered(a)) {\n      var entries = a.entries();\n      return b.every(function(v, k)  {\n        var entry = entries.next().value;\n        return entry && is(entry[1], v) && (notAssociative || is(entry[0], k));\n      }) && entries.next().done;\n    }\n\n    var flipped = false;\n\n    if (a.size === undefined) {\n      if (b.size === undefined) {\n        if (typeof a.cacheResult === 'function') {\n          a.cacheResult();\n        }\n      } else {\n        flipped = true;\n        var _ = a;\n        a = b;\n        b = _;\n      }\n    }\n\n    var allEqual = true;\n    var bSize = b.__iterate(function(v, k)  {\n      if (notAssociative ? !a.has(v) :\n          flipped ? !is(v, a.get(k, NOT_SET)) : !is(a.get(k, NOT_SET), v)) {\n        allEqual = false;\n        return false;\n      }\n    });\n\n    return allEqual && a.size === bSize;\n  }\n\n  createClass(Repeat, IndexedSeq);\n\n    function Repeat(value, times) {\n      if (!(this instanceof Repeat)) {\n        return new Repeat(value, times);\n      }\n      this._value = value;\n      this.size = times === undefined ? Infinity : Math.max(0, times);\n      if (this.size === 0) {\n        if (EMPTY_REPEAT) {\n          return EMPTY_REPEAT;\n        }\n        EMPTY_REPEAT = this;\n      }\n    }\n\n    Repeat.prototype.toString = function() {\n      if (this.size === 0) {\n        return 'Repeat []';\n      }\n      return 'Repeat [ ' + this._value + ' ' + this.size + ' times ]';\n    };\n\n    Repeat.prototype.get = function(index, notSetValue) {\n      return this.has(index) ? this._value : notSetValue;\n    };\n\n    Repeat.prototype.includes = function(searchValue) {\n      return is(this._value, searchValue);\n    };\n\n    Repeat.prototype.slice = function(begin, end) {\n      var size = this.size;\n      return wholeSlice(begin, end, size) ? this :\n        new Repeat(this._value, resolveEnd(end, size) - resolveBegin(begin, size));\n    };\n\n    Repeat.prototype.reverse = function() {\n      return this;\n    };\n\n    Repeat.prototype.indexOf = function(searchValue) {\n      if (is(this._value, searchValue)) {\n        return 0;\n      }\n      return -1;\n    };\n\n    Repeat.prototype.lastIndexOf = function(searchValue) {\n      if (is(this._value, searchValue)) {\n        return this.size;\n      }\n      return -1;\n    };\n\n    Repeat.prototype.__iterate = function(fn, reverse) {\n      for (var ii = 0; ii < this.size; ii++) {\n        if (fn(this._value, ii, this) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    };\n\n    Repeat.prototype.__iterator = function(type, reverse) {var this$0 = this;\n      var ii = 0;\n      return new Iterator(function() \n        {return ii < this$0.size ? iteratorValue(type, ii++, this$0._value) : iteratorDone()}\n      );\n    };\n\n    Repeat.prototype.equals = function(other) {\n      return other instanceof Repeat ?\n        is(this._value, other._value) :\n        deepEqual(other);\n    };\n\n\n  var EMPTY_REPEAT;\n\n  function invariant(condition, error) {\n    if (!condition) throw new Error(error);\n  }\n\n  createClass(Range, IndexedSeq);\n\n    function Range(start, end, step) {\n      if (!(this instanceof Range)) {\n        return new Range(start, end, step);\n      }\n      invariant(step !== 0, 'Cannot step a Range by 0');\n      start = start || 0;\n      if (end === undefined) {\n        end = Infinity;\n      }\n      step = step === undefined ? 1 : Math.abs(step);\n      if (end < start) {\n        step = -step;\n      }\n      this._start = start;\n      this._end = end;\n      this._step = step;\n      this.size = Math.max(0, Math.ceil((end - start) / step - 1) + 1);\n      if (this.size === 0) {\n        if (EMPTY_RANGE) {\n          return EMPTY_RANGE;\n        }\n        EMPTY_RANGE = this;\n      }\n    }\n\n    Range.prototype.toString = function() {\n      if (this.size === 0) {\n        return 'Range []';\n      }\n      return 'Range [ ' +\n        this._start + '...' + this._end +\n        (this._step > 1 ? ' by ' + this._step : '') +\n      ' ]';\n    };\n\n    Range.prototype.get = function(index, notSetValue) {\n      return this.has(index) ?\n        this._start + wrapIndex(this, index) * this._step :\n        notSetValue;\n    };\n\n    Range.prototype.includes = function(searchValue) {\n      var possibleIndex = (searchValue - this._start) / this._step;\n      return possibleIndex >= 0 &&\n        possibleIndex < this.size &&\n        possibleIndex === Math.floor(possibleIndex);\n    };\n\n    Range.prototype.slice = function(begin, end) {\n      if (wholeSlice(begin, end, this.size)) {\n        return this;\n      }\n      begin = resolveBegin(begin, this.size);\n      end = resolveEnd(end, this.size);\n      if (end <= begin) {\n        return new Range(0, 0);\n      }\n      return new Range(this.get(begin, this._end), this.get(end, this._end), this._step);\n    };\n\n    Range.prototype.indexOf = function(searchValue) {\n      var offsetValue = searchValue - this._start;\n      if (offsetValue % this._step === 0) {\n        var index = offsetValue / this._step;\n        if (index >= 0 && index < this.size) {\n          return index\n        }\n      }\n      return -1;\n    };\n\n    Range.prototype.lastIndexOf = function(searchValue) {\n      return this.indexOf(searchValue);\n    };\n\n    Range.prototype.__iterate = function(fn, reverse) {\n      var maxIndex = this.size - 1;\n      var step = this._step;\n      var value = reverse ? this._start + maxIndex * step : this._start;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        if (fn(value, ii, this) === false) {\n          return ii + 1;\n        }\n        value += reverse ? -step : step;\n      }\n      return ii;\n    };\n\n    Range.prototype.__iterator = function(type, reverse) {\n      var maxIndex = this.size - 1;\n      var step = this._step;\n      var value = reverse ? this._start + maxIndex * step : this._start;\n      var ii = 0;\n      return new Iterator(function()  {\n        var v = value;\n        value += reverse ? -step : step;\n        return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii++, v);\n      });\n    };\n\n    Range.prototype.equals = function(other) {\n      return other instanceof Range ?\n        this._start === other._start &&\n        this._end === other._end &&\n        this._step === other._step :\n        deepEqual(this, other);\n    };\n\n\n  var EMPTY_RANGE;\n\n  createClass(Collection, Iterable);\n    function Collection() {\n      throw TypeError('Abstract');\n    }\n\n\n  createClass(KeyedCollection, Collection);function KeyedCollection() {}\n\n  createClass(IndexedCollection, Collection);function IndexedCollection() {}\n\n  createClass(SetCollection, Collection);function SetCollection() {}\n\n\n  Collection.Keyed = KeyedCollection;\n  Collection.Indexed = IndexedCollection;\n  Collection.Set = SetCollection;\n\n  var imul =\n    typeof Math.imul === 'function' && Math.imul(0xffffffff, 2) === -2 ?\n    Math.imul :\n    function imul(a, b) {\n      a = a | 0; // int\n      b = b | 0; // int\n      var c = a & 0xffff;\n      var d = b & 0xffff;\n      // Shift by 0 fixes the sign on the high part.\n      return (c * d) + ((((a >>> 16) * d + c * (b >>> 16)) << 16) >>> 0) | 0; // int\n    };\n\n  // v8 has an optimization for storing 31-bit signed numbers.\n  // Values which have either 00 or 11 as the high order bits qualify.\n  // This function drops the highest order bit in a signed number, maintaining\n  // the sign bit.\n  function smi(i32) {\n    return ((i32 >>> 1) & 0x40000000) | (i32 & 0xBFFFFFFF);\n  }\n\n  function hash(o) {\n    if (o === false || o === null || o === undefined) {\n      return 0;\n    }\n    if (typeof o.valueOf === 'function') {\n      o = o.valueOf();\n      if (o === false || o === null || o === undefined) {\n        return 0;\n      }\n    }\n    if (o === true) {\n      return 1;\n    }\n    var type = typeof o;\n    if (type === 'number') {\n      var h = o | 0;\n      if (h !== o) {\n        h ^= o * 0xFFFFFFFF;\n      }\n      while (o > 0xFFFFFFFF) {\n        o /= 0xFFFFFFFF;\n        h ^= o;\n      }\n      return smi(h);\n    }\n    if (type === 'string') {\n      return o.length > STRING_HASH_CACHE_MIN_STRLEN ? cachedHashString(o) : hashString(o);\n    }\n    if (typeof o.hashCode === 'function') {\n      return o.hashCode();\n    }\n    if (type === 'object') {\n      return hashJSObj(o);\n    }\n    if (typeof o.toString === 'function') {\n      return hashString(o.toString());\n    }\n    throw new Error('Value type ' + type + ' cannot be hashed.');\n  }\n\n  function cachedHashString(string) {\n    var hash = stringHashCache[string];\n    if (hash === undefined) {\n      hash = hashString(string);\n      if (STRING_HASH_CACHE_SIZE === STRING_HASH_CACHE_MAX_SIZE) {\n        STRING_HASH_CACHE_SIZE = 0;\n        stringHashCache = {};\n      }\n      STRING_HASH_CACHE_SIZE++;\n      stringHashCache[string] = hash;\n    }\n    return hash;\n  }\n\n  // http://jsperf.com/hashing-strings\n  function hashString(string) {\n    // This is the hash from JVM\n    // The hash code for a string is computed as\n    // s[0] * 31 ^ (n - 1) + s[1] * 31 ^ (n - 2) + ... + s[n - 1],\n    // where s[i] is the ith character of the string and n is the length of\n    // the string. We \"mod\" the result to make it between 0 (inclusive) and 2^31\n    // (exclusive) by dropping high bits.\n    var hash = 0;\n    for (var ii = 0; ii < string.length; ii++) {\n      hash = 31 * hash + string.charCodeAt(ii) | 0;\n    }\n    return smi(hash);\n  }\n\n  function hashJSObj(obj) {\n    var hash;\n    if (usingWeakMap) {\n      hash = weakMap.get(obj);\n      if (hash !== undefined) {\n        return hash;\n      }\n    }\n\n    hash = obj[UID_HASH_KEY];\n    if (hash !== undefined) {\n      return hash;\n    }\n\n    if (!canDefineProperty) {\n      hash = obj.propertyIsEnumerable && obj.propertyIsEnumerable[UID_HASH_KEY];\n      if (hash !== undefined) {\n        return hash;\n      }\n\n      hash = getIENodeHash(obj);\n      if (hash !== undefined) {\n        return hash;\n      }\n    }\n\n    hash = ++objHashUID;\n    if (objHashUID & 0x40000000) {\n      objHashUID = 0;\n    }\n\n    if (usingWeakMap) {\n      weakMap.set(obj, hash);\n    } else if (isExtensible !== undefined && isExtensible(obj) === false) {\n      throw new Error('Non-extensible objects are not allowed as keys.');\n    } else if (canDefineProperty) {\n      Object.defineProperty(obj, UID_HASH_KEY, {\n        'enumerable': false,\n        'configurable': false,\n        'writable': false,\n        'value': hash\n      });\n    } else if (obj.propertyIsEnumerable !== undefined &&\n               obj.propertyIsEnumerable === obj.constructor.prototype.propertyIsEnumerable) {\n      // Since we can't define a non-enumerable property on the object\n      // we'll hijack one of the less-used non-enumerable properties to\n      // save our hash on it. Since this is a function it will not show up in\n      // `JSON.stringify` which is what we want.\n      obj.propertyIsEnumerable = function() {\n        return this.constructor.prototype.propertyIsEnumerable.apply(this, arguments);\n      };\n      obj.propertyIsEnumerable[UID_HASH_KEY] = hash;\n    } else if (obj.nodeType !== undefined) {\n      // At this point we couldn't get the IE `uniqueID` to use as a hash\n      // and we couldn't use a non-enumerable property to exploit the\n      // dontEnum bug so we simply add the `UID_HASH_KEY` on the node\n      // itself.\n      obj[UID_HASH_KEY] = hash;\n    } else {\n      throw new Error('Unable to set a non-enumerable property on object.');\n    }\n\n    return hash;\n  }\n\n  // Get references to ES5 object methods.\n  var isExtensible = Object.isExtensible;\n\n  // True if Object.defineProperty works as expected. IE8 fails this test.\n  var canDefineProperty = (function() {\n    try {\n      Object.defineProperty({}, '@', {});\n      return true;\n    } catch (e) {\n      return false;\n    }\n  }());\n\n  // IE has a `uniqueID` property on DOM nodes. We can construct the hash from it\n  // and avoid memory leaks from the IE cloneNode bug.\n  function getIENodeHash(node) {\n    if (node && node.nodeType > 0) {\n      switch (node.nodeType) {\n        case 1: // Element\n          return node.uniqueID;\n        case 9: // Document\n          return node.documentElement && node.documentElement.uniqueID;\n      }\n    }\n  }\n\n  // If possible, use a WeakMap.\n  var usingWeakMap = typeof WeakMap === 'function';\n  var weakMap;\n  if (usingWeakMap) {\n    weakMap = new WeakMap();\n  }\n\n  var objHashUID = 0;\n\n  var UID_HASH_KEY = '__immutablehash__';\n  if (typeof Symbol === 'function') {\n    UID_HASH_KEY = Symbol(UID_HASH_KEY);\n  }\n\n  var STRING_HASH_CACHE_MIN_STRLEN = 16;\n  var STRING_HASH_CACHE_MAX_SIZE = 255;\n  var STRING_HASH_CACHE_SIZE = 0;\n  var stringHashCache = {};\n\n  function assertNotInfinite(size) {\n    invariant(\n      size !== Infinity,\n      'Cannot perform this action with an infinite size.'\n    );\n  }\n\n  createClass(Map, KeyedCollection);\n\n    // @pragma Construction\n\n    function Map(value) {\n      return value === null || value === undefined ? emptyMap() :\n        isMap(value) && !isOrdered(value) ? value :\n        emptyMap().withMutations(function(map ) {\n          var iter = KeyedIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v, k)  {return map.set(k, v)});\n        });\n    }\n\n    Map.prototype.toString = function() {\n      return this.__toString('Map {', '}');\n    };\n\n    // @pragma Access\n\n    Map.prototype.get = function(k, notSetValue) {\n      return this._root ?\n        this._root.get(0, undefined, k, notSetValue) :\n        notSetValue;\n    };\n\n    // @pragma Modification\n\n    Map.prototype.set = function(k, v) {\n      return updateMap(this, k, v);\n    };\n\n    Map.prototype.setIn = function(keyPath, v) {\n      return this.updateIn(keyPath, NOT_SET, function()  {return v});\n    };\n\n    Map.prototype.remove = function(k) {\n      return updateMap(this, k, NOT_SET);\n    };\n\n    Map.prototype.deleteIn = function(keyPath) {\n      return this.updateIn(keyPath, function()  {return NOT_SET});\n    };\n\n    Map.prototype.update = function(k, notSetValue, updater) {\n      return arguments.length === 1 ?\n        k(this) :\n        this.updateIn([k], notSetValue, updater);\n    };\n\n    Map.prototype.updateIn = function(keyPath, notSetValue, updater) {\n      if (!updater) {\n        updater = notSetValue;\n        notSetValue = undefined;\n      }\n      var updatedValue = updateInDeepMap(\n        this,\n        forceIterator(keyPath),\n        notSetValue,\n        updater\n      );\n      return updatedValue === NOT_SET ? undefined : updatedValue;\n    };\n\n    Map.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = 0;\n        this._root = null;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return emptyMap();\n    };\n\n    // @pragma Composition\n\n    Map.prototype.merge = function(/*...iters*/) {\n      return mergeIntoMapWith(this, undefined, arguments);\n    };\n\n    Map.prototype.mergeWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoMapWith(this, merger, iters);\n    };\n\n    Map.prototype.mergeIn = function(keyPath) {var iters = SLICE$0.call(arguments, 1);\n      return this.updateIn(\n        keyPath,\n        emptyMap(),\n        function(m ) {return typeof m.merge === 'function' ?\n          m.merge.apply(m, iters) :\n          iters[iters.length - 1]}\n      );\n    };\n\n    Map.prototype.mergeDeep = function(/*...iters*/) {\n      return mergeIntoMapWith(this, deepMerger, arguments);\n    };\n\n    Map.prototype.mergeDeepWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoMapWith(this, deepMergerWith(merger), iters);\n    };\n\n    Map.prototype.mergeDeepIn = function(keyPath) {var iters = SLICE$0.call(arguments, 1);\n      return this.updateIn(\n        keyPath,\n        emptyMap(),\n        function(m ) {return typeof m.mergeDeep === 'function' ?\n          m.mergeDeep.apply(m, iters) :\n          iters[iters.length - 1]}\n      );\n    };\n\n    Map.prototype.sort = function(comparator) {\n      // Late binding\n      return OrderedMap(sortFactory(this, comparator));\n    };\n\n    Map.prototype.sortBy = function(mapper, comparator) {\n      // Late binding\n      return OrderedMap(sortFactory(this, comparator, mapper));\n    };\n\n    // @pragma Mutability\n\n    Map.prototype.withMutations = function(fn) {\n      var mutable = this.asMutable();\n      fn(mutable);\n      return mutable.wasAltered() ? mutable.__ensureOwner(this.__ownerID) : this;\n    };\n\n    Map.prototype.asMutable = function() {\n      return this.__ownerID ? this : this.__ensureOwner(new OwnerID());\n    };\n\n    Map.prototype.asImmutable = function() {\n      return this.__ensureOwner();\n    };\n\n    Map.prototype.wasAltered = function() {\n      return this.__altered;\n    };\n\n    Map.prototype.__iterator = function(type, reverse) {\n      return new MapIterator(this, type, reverse);\n    };\n\n    Map.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      this._root && this._root.iterate(function(entry ) {\n        iterations++;\n        return fn(entry[1], entry[0], this$0);\n      }, reverse);\n      return iterations;\n    };\n\n    Map.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this.__altered = false;\n        return this;\n      }\n      return makeMap(this.size, this._root, ownerID, this.__hash);\n    };\n\n\n  function isMap(maybeMap) {\n    return !!(maybeMap && maybeMap[IS_MAP_SENTINEL]);\n  }\n\n  Map.isMap = isMap;\n\n  var IS_MAP_SENTINEL = '@@__IMMUTABLE_MAP__@@';\n\n  var MapPrototype = Map.prototype;\n  MapPrototype[IS_MAP_SENTINEL] = true;\n  MapPrototype[DELETE] = MapPrototype.remove;\n  MapPrototype.removeIn = MapPrototype.deleteIn;\n\n\n  // #pragma Trie Nodes\n\n\n\n    function ArrayMapNode(ownerID, entries) {\n      this.ownerID = ownerID;\n      this.entries = entries;\n    }\n\n    ArrayMapNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      var entries = this.entries;\n      for (var ii = 0, len = entries.length; ii < len; ii++) {\n        if (is(key, entries[ii][0])) {\n          return entries[ii][1];\n        }\n      }\n      return notSetValue;\n    };\n\n    ArrayMapNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      var removed = value === NOT_SET;\n\n      var entries = this.entries;\n      var idx = 0;\n      for (var len = entries.length; idx < len; idx++) {\n        if (is(key, entries[idx][0])) {\n          break;\n        }\n      }\n      var exists = idx < len;\n\n      if (exists ? entries[idx][1] === value : removed) {\n        return this;\n      }\n\n      SetRef(didAlter);\n      (removed || !exists) && SetRef(didChangeSize);\n\n      if (removed && entries.length === 1) {\n        return; // undefined\n      }\n\n      if (!exists && !removed && entries.length >= MAX_ARRAY_MAP_SIZE) {\n        return createNodes(ownerID, entries, key, value);\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newEntries = isEditable ? entries : arrCopy(entries);\n\n      if (exists) {\n        if (removed) {\n          idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\n        } else {\n          newEntries[idx] = [key, value];\n        }\n      } else {\n        newEntries.push([key, value]);\n      }\n\n      if (isEditable) {\n        this.entries = newEntries;\n        return this;\n      }\n\n      return new ArrayMapNode(ownerID, newEntries);\n    };\n\n\n\n\n    function BitmapIndexedNode(ownerID, bitmap, nodes) {\n      this.ownerID = ownerID;\n      this.bitmap = bitmap;\n      this.nodes = nodes;\n    }\n\n    BitmapIndexedNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var bit = (1 << ((shift === 0 ? keyHash : keyHash >>> shift) & MASK));\n      var bitmap = this.bitmap;\n      return (bitmap & bit) === 0 ? notSetValue :\n        this.nodes[popCount(bitmap & (bit - 1))].get(shift + SHIFT, keyHash, key, notSetValue);\n    };\n\n    BitmapIndexedNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var keyHashFrag = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n      var bit = 1 << keyHashFrag;\n      var bitmap = this.bitmap;\n      var exists = (bitmap & bit) !== 0;\n\n      if (!exists && value === NOT_SET) {\n        return this;\n      }\n\n      var idx = popCount(bitmap & (bit - 1));\n      var nodes = this.nodes;\n      var node = exists ? nodes[idx] : undefined;\n      var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\n\n      if (newNode === node) {\n        return this;\n      }\n\n      if (!exists && newNode && nodes.length >= MAX_BITMAP_INDEXED_SIZE) {\n        return expandNodes(ownerID, nodes, bitmap, keyHashFrag, newNode);\n      }\n\n      if (exists && !newNode && nodes.length === 2 && isLeafNode(nodes[idx ^ 1])) {\n        return nodes[idx ^ 1];\n      }\n\n      if (exists && newNode && nodes.length === 1 && isLeafNode(newNode)) {\n        return newNode;\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newBitmap = exists ? newNode ? bitmap : bitmap ^ bit : bitmap | bit;\n      var newNodes = exists ? newNode ?\n        setIn(nodes, idx, newNode, isEditable) :\n        spliceOut(nodes, idx, isEditable) :\n        spliceIn(nodes, idx, newNode, isEditable);\n\n      if (isEditable) {\n        this.bitmap = newBitmap;\n        this.nodes = newNodes;\n        return this;\n      }\n\n      return new BitmapIndexedNode(ownerID, newBitmap, newNodes);\n    };\n\n\n\n\n    function HashArrayMapNode(ownerID, count, nodes) {\n      this.ownerID = ownerID;\n      this.count = count;\n      this.nodes = nodes;\n    }\n\n    HashArrayMapNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n      var node = this.nodes[idx];\n      return node ? node.get(shift + SHIFT, keyHash, key, notSetValue) : notSetValue;\n    };\n\n    HashArrayMapNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n      var removed = value === NOT_SET;\n      var nodes = this.nodes;\n      var node = nodes[idx];\n\n      if (removed && !node) {\n        return this;\n      }\n\n      var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\n      if (newNode === node) {\n        return this;\n      }\n\n      var newCount = this.count;\n      if (!node) {\n        newCount++;\n      } else if (!newNode) {\n        newCount--;\n        if (newCount < MIN_HASH_ARRAY_MAP_SIZE) {\n          return packNodes(ownerID, nodes, newCount, idx);\n        }\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newNodes = setIn(nodes, idx, newNode, isEditable);\n\n      if (isEditable) {\n        this.count = newCount;\n        this.nodes = newNodes;\n        return this;\n      }\n\n      return new HashArrayMapNode(ownerID, newCount, newNodes);\n    };\n\n\n\n\n    function HashCollisionNode(ownerID, keyHash, entries) {\n      this.ownerID = ownerID;\n      this.keyHash = keyHash;\n      this.entries = entries;\n    }\n\n    HashCollisionNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      var entries = this.entries;\n      for (var ii = 0, len = entries.length; ii < len; ii++) {\n        if (is(key, entries[ii][0])) {\n          return entries[ii][1];\n        }\n      }\n      return notSetValue;\n    };\n\n    HashCollisionNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n\n      var removed = value === NOT_SET;\n\n      if (keyHash !== this.keyHash) {\n        if (removed) {\n          return this;\n        }\n        SetRef(didAlter);\n        SetRef(didChangeSize);\n        return mergeIntoNode(this, ownerID, shift, keyHash, [key, value]);\n      }\n\n      var entries = this.entries;\n      var idx = 0;\n      for (var len = entries.length; idx < len; idx++) {\n        if (is(key, entries[idx][0])) {\n          break;\n        }\n      }\n      var exists = idx < len;\n\n      if (exists ? entries[idx][1] === value : removed) {\n        return this;\n      }\n\n      SetRef(didAlter);\n      (removed || !exists) && SetRef(didChangeSize);\n\n      if (removed && len === 2) {\n        return new ValueNode(ownerID, this.keyHash, entries[idx ^ 1]);\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newEntries = isEditable ? entries : arrCopy(entries);\n\n      if (exists) {\n        if (removed) {\n          idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\n        } else {\n          newEntries[idx] = [key, value];\n        }\n      } else {\n        newEntries.push([key, value]);\n      }\n\n      if (isEditable) {\n        this.entries = newEntries;\n        return this;\n      }\n\n      return new HashCollisionNode(ownerID, this.keyHash, newEntries);\n    };\n\n\n\n\n    function ValueNode(ownerID, keyHash, entry) {\n      this.ownerID = ownerID;\n      this.keyHash = keyHash;\n      this.entry = entry;\n    }\n\n    ValueNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      return is(key, this.entry[0]) ? this.entry[1] : notSetValue;\n    };\n\n    ValueNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      var removed = value === NOT_SET;\n      var keyMatch = is(key, this.entry[0]);\n      if (keyMatch ? value === this.entry[1] : removed) {\n        return this;\n      }\n\n      SetRef(didAlter);\n\n      if (removed) {\n        SetRef(didChangeSize);\n        return; // undefined\n      }\n\n      if (keyMatch) {\n        if (ownerID && ownerID === this.ownerID) {\n          this.entry[1] = value;\n          return this;\n        }\n        return new ValueNode(ownerID, this.keyHash, [key, value]);\n      }\n\n      SetRef(didChangeSize);\n      return mergeIntoNode(this, ownerID, shift, hash(key), [key, value]);\n    };\n\n\n\n  // #pragma Iterators\n\n  ArrayMapNode.prototype.iterate =\n  HashCollisionNode.prototype.iterate = function (fn, reverse) {\n    var entries = this.entries;\n    for (var ii = 0, maxIndex = entries.length - 1; ii <= maxIndex; ii++) {\n      if (fn(entries[reverse ? maxIndex - ii : ii]) === false) {\n        return false;\n      }\n    }\n  }\n\n  BitmapIndexedNode.prototype.iterate =\n  HashArrayMapNode.prototype.iterate = function (fn, reverse) {\n    var nodes = this.nodes;\n    for (var ii = 0, maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\n      var node = nodes[reverse ? maxIndex - ii : ii];\n      if (node && node.iterate(fn, reverse) === false) {\n        return false;\n      }\n    }\n  }\n\n  ValueNode.prototype.iterate = function (fn, reverse) {\n    return fn(this.entry);\n  }\n\n  createClass(MapIterator, Iterator);\n\n    function MapIterator(map, type, reverse) {\n      this._type = type;\n      this._reverse = reverse;\n      this._stack = map._root && mapIteratorFrame(map._root);\n    }\n\n    MapIterator.prototype.next = function() {\n      var type = this._type;\n      var stack = this._stack;\n      while (stack) {\n        var node = stack.node;\n        var index = stack.index++;\n        var maxIndex;\n        if (node.entry) {\n          if (index === 0) {\n            return mapIteratorValue(type, node.entry);\n          }\n        } else if (node.entries) {\n          maxIndex = node.entries.length - 1;\n          if (index <= maxIndex) {\n            return mapIteratorValue(type, node.entries[this._reverse ? maxIndex - index : index]);\n          }\n        } else {\n          maxIndex = node.nodes.length - 1;\n          if (index <= maxIndex) {\n            var subNode = node.nodes[this._reverse ? maxIndex - index : index];\n            if (subNode) {\n              if (subNode.entry) {\n                return mapIteratorValue(type, subNode.entry);\n              }\n              stack = this._stack = mapIteratorFrame(subNode, stack);\n            }\n            continue;\n          }\n        }\n        stack = this._stack = this._stack.__prev;\n      }\n      return iteratorDone();\n    };\n\n\n  function mapIteratorValue(type, entry) {\n    return iteratorValue(type, entry[0], entry[1]);\n  }\n\n  function mapIteratorFrame(node, prev) {\n    return {\n      node: node,\n      index: 0,\n      __prev: prev\n    };\n  }\n\n  function makeMap(size, root, ownerID, hash) {\n    var map = Object.create(MapPrototype);\n    map.size = size;\n    map._root = root;\n    map.__ownerID = ownerID;\n    map.__hash = hash;\n    map.__altered = false;\n    return map;\n  }\n\n  var EMPTY_MAP;\n  function emptyMap() {\n    return EMPTY_MAP || (EMPTY_MAP = makeMap(0));\n  }\n\n  function updateMap(map, k, v) {\n    var newRoot;\n    var newSize;\n    if (!map._root) {\n      if (v === NOT_SET) {\n        return map;\n      }\n      newSize = 1;\n      newRoot = new ArrayMapNode(map.__ownerID, [[k, v]]);\n    } else {\n      var didChangeSize = MakeRef(CHANGE_LENGTH);\n      var didAlter = MakeRef(DID_ALTER);\n      newRoot = updateNode(map._root, map.__ownerID, 0, undefined, k, v, didChangeSize, didAlter);\n      if (!didAlter.value) {\n        return map;\n      }\n      newSize = map.size + (didChangeSize.value ? v === NOT_SET ? -1 : 1 : 0);\n    }\n    if (map.__ownerID) {\n      map.size = newSize;\n      map._root = newRoot;\n      map.__hash = undefined;\n      map.__altered = true;\n      return map;\n    }\n    return newRoot ? makeMap(newSize, newRoot) : emptyMap();\n  }\n\n  function updateNode(node, ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n    if (!node) {\n      if (value === NOT_SET) {\n        return node;\n      }\n      SetRef(didAlter);\n      SetRef(didChangeSize);\n      return new ValueNode(ownerID, keyHash, [key, value]);\n    }\n    return node.update(ownerID, shift, keyHash, key, value, didChangeSize, didAlter);\n  }\n\n  function isLeafNode(node) {\n    return node.constructor === ValueNode || node.constructor === HashCollisionNode;\n  }\n\n  function mergeIntoNode(node, ownerID, shift, keyHash, entry) {\n    if (node.keyHash === keyHash) {\n      return new HashCollisionNode(ownerID, keyHash, [node.entry, entry]);\n    }\n\n    var idx1 = (shift === 0 ? node.keyHash : node.keyHash >>> shift) & MASK;\n    var idx2 = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n\n    var newNode;\n    var nodes = idx1 === idx2 ?\n      [mergeIntoNode(node, ownerID, shift + SHIFT, keyHash, entry)] :\n      ((newNode = new ValueNode(ownerID, keyHash, entry)), idx1 < idx2 ? [node, newNode] : [newNode, node]);\n\n    return new BitmapIndexedNode(ownerID, (1 << idx1) | (1 << idx2), nodes);\n  }\n\n  function createNodes(ownerID, entries, key, value) {\n    if (!ownerID) {\n      ownerID = new OwnerID();\n    }\n    var node = new ValueNode(ownerID, hash(key), [key, value]);\n    for (var ii = 0; ii < entries.length; ii++) {\n      var entry = entries[ii];\n      node = node.update(ownerID, 0, undefined, entry[0], entry[1]);\n    }\n    return node;\n  }\n\n  function packNodes(ownerID, nodes, count, excluding) {\n    var bitmap = 0;\n    var packedII = 0;\n    var packedNodes = new Array(count);\n    for (var ii = 0, bit = 1, len = nodes.length; ii < len; ii++, bit <<= 1) {\n      var node = nodes[ii];\n      if (node !== undefined && ii !== excluding) {\n        bitmap |= bit;\n        packedNodes[packedII++] = node;\n      }\n    }\n    return new BitmapIndexedNode(ownerID, bitmap, packedNodes);\n  }\n\n  function expandNodes(ownerID, nodes, bitmap, including, node) {\n    var count = 0;\n    var expandedNodes = new Array(SIZE);\n    for (var ii = 0; bitmap !== 0; ii++, bitmap >>>= 1) {\n      expandedNodes[ii] = bitmap & 1 ? nodes[count++] : undefined;\n    }\n    expandedNodes[including] = node;\n    return new HashArrayMapNode(ownerID, count + 1, expandedNodes);\n  }\n\n  function mergeIntoMapWith(map, merger, iterables) {\n    var iters = [];\n    for (var ii = 0; ii < iterables.length; ii++) {\n      var value = iterables[ii];\n      var iter = KeyedIterable(value);\n      if (!isIterable(value)) {\n        iter = iter.map(function(v ) {return fromJS(v)});\n      }\n      iters.push(iter);\n    }\n    return mergeIntoCollectionWith(map, merger, iters);\n  }\n\n  function deepMerger(existing, value, key) {\n    return existing && existing.mergeDeep && isIterable(value) ?\n      existing.mergeDeep(value) :\n      is(existing, value) ? existing : value;\n  }\n\n  function deepMergerWith(merger) {\n    return function(existing, value, key)  {\n      if (existing && existing.mergeDeepWith && isIterable(value)) {\n        return existing.mergeDeepWith(merger, value);\n      }\n      var nextValue = merger(existing, value, key);\n      return is(existing, nextValue) ? existing : nextValue;\n    };\n  }\n\n  function mergeIntoCollectionWith(collection, merger, iters) {\n    iters = iters.filter(function(x ) {return x.size !== 0});\n    if (iters.length === 0) {\n      return collection;\n    }\n    if (collection.size === 0 && !collection.__ownerID && iters.length === 1) {\n      return collection.constructor(iters[0]);\n    }\n    return collection.withMutations(function(collection ) {\n      var mergeIntoMap = merger ?\n        function(value, key)  {\n          collection.update(key, NOT_SET, function(existing )\n            {return existing === NOT_SET ? value : merger(existing, value, key)}\n          );\n        } :\n        function(value, key)  {\n          collection.set(key, value);\n        }\n      for (var ii = 0; ii < iters.length; ii++) {\n        iters[ii].forEach(mergeIntoMap);\n      }\n    });\n  }\n\n  function updateInDeepMap(existing, keyPathIter, notSetValue, updater) {\n    var isNotSet = existing === NOT_SET;\n    var step = keyPathIter.next();\n    if (step.done) {\n      var existingValue = isNotSet ? notSetValue : existing;\n      var newValue = updater(existingValue);\n      return newValue === existingValue ? existing : newValue;\n    }\n    invariant(\n      isNotSet || (existing && existing.set),\n      'invalid keyPath'\n    );\n    var key = step.value;\n    var nextExisting = isNotSet ? NOT_SET : existing.get(key, NOT_SET);\n    var nextUpdated = updateInDeepMap(\n      nextExisting,\n      keyPathIter,\n      notSetValue,\n      updater\n    );\n    return nextUpdated === nextExisting ? existing :\n      nextUpdated === NOT_SET ? existing.remove(key) :\n      (isNotSet ? emptyMap() : existing).set(key, nextUpdated);\n  }\n\n  function popCount(x) {\n    x = x - ((x >> 1) & 0x55555555);\n    x = (x & 0x33333333) + ((x >> 2) & 0x33333333);\n    x = (x + (x >> 4)) & 0x0f0f0f0f;\n    x = x + (x >> 8);\n    x = x + (x >> 16);\n    return x & 0x7f;\n  }\n\n  function setIn(array, idx, val, canEdit) {\n    var newArray = canEdit ? array : arrCopy(array);\n    newArray[idx] = val;\n    return newArray;\n  }\n\n  function spliceIn(array, idx, val, canEdit) {\n    var newLen = array.length + 1;\n    if (canEdit && idx + 1 === newLen) {\n      array[idx] = val;\n      return array;\n    }\n    var newArray = new Array(newLen);\n    var after = 0;\n    for (var ii = 0; ii < newLen; ii++) {\n      if (ii === idx) {\n        newArray[ii] = val;\n        after = -1;\n      } else {\n        newArray[ii] = array[ii + after];\n      }\n    }\n    return newArray;\n  }\n\n  function spliceOut(array, idx, canEdit) {\n    var newLen = array.length - 1;\n    if (canEdit && idx === newLen) {\n      array.pop();\n      return array;\n    }\n    var newArray = new Array(newLen);\n    var after = 0;\n    for (var ii = 0; ii < newLen; ii++) {\n      if (ii === idx) {\n        after = 1;\n      }\n      newArray[ii] = array[ii + after];\n    }\n    return newArray;\n  }\n\n  var MAX_ARRAY_MAP_SIZE = SIZE / 4;\n  var MAX_BITMAP_INDEXED_SIZE = SIZE / 2;\n  var MIN_HASH_ARRAY_MAP_SIZE = SIZE / 4;\n\n  createClass(List, IndexedCollection);\n\n    // @pragma Construction\n\n    function List(value) {\n      var empty = emptyList();\n      if (value === null || value === undefined) {\n        return empty;\n      }\n      if (isList(value)) {\n        return value;\n      }\n      var iter = IndexedIterable(value);\n      var size = iter.size;\n      if (size === 0) {\n        return empty;\n      }\n      assertNotInfinite(size);\n      if (size > 0 && size < SIZE) {\n        return makeList(0, size, SHIFT, null, new VNode(iter.toArray()));\n      }\n      return empty.withMutations(function(list ) {\n        list.setSize(size);\n        iter.forEach(function(v, i)  {return list.set(i, v)});\n      });\n    }\n\n    List.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    List.prototype.toString = function() {\n      return this.__toString('List [', ']');\n    };\n\n    // @pragma Access\n\n    List.prototype.get = function(index, notSetValue) {\n      index = wrapIndex(this, index);\n      if (index >= 0 && index < this.size) {\n        index += this._origin;\n        var node = listNodeFor(this, index);\n        return node && node.array[index & MASK];\n      }\n      return notSetValue;\n    };\n\n    // @pragma Modification\n\n    List.prototype.set = function(index, value) {\n      return updateList(this, index, value);\n    };\n\n    List.prototype.remove = function(index) {\n      return !this.has(index) ? this :\n        index === 0 ? this.shift() :\n        index === this.size - 1 ? this.pop() :\n        this.splice(index, 1);\n    };\n\n    List.prototype.insert = function(index, value) {\n      return this.splice(index, 0, value);\n    };\n\n    List.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = this._origin = this._capacity = 0;\n        this._level = SHIFT;\n        this._root = this._tail = null;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return emptyList();\n    };\n\n    List.prototype.push = function(/*...values*/) {\n      var values = arguments;\n      var oldSize = this.size;\n      return this.withMutations(function(list ) {\n        setListBounds(list, 0, oldSize + values.length);\n        for (var ii = 0; ii < values.length; ii++) {\n          list.set(oldSize + ii, values[ii]);\n        }\n      });\n    };\n\n    List.prototype.pop = function() {\n      return setListBounds(this, 0, -1);\n    };\n\n    List.prototype.unshift = function(/*...values*/) {\n      var values = arguments;\n      return this.withMutations(function(list ) {\n        setListBounds(list, -values.length);\n        for (var ii = 0; ii < values.length; ii++) {\n          list.set(ii, values[ii]);\n        }\n      });\n    };\n\n    List.prototype.shift = function() {\n      return setListBounds(this, 1);\n    };\n\n    // @pragma Composition\n\n    List.prototype.merge = function(/*...iters*/) {\n      return mergeIntoListWith(this, undefined, arguments);\n    };\n\n    List.prototype.mergeWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoListWith(this, merger, iters);\n    };\n\n    List.prototype.mergeDeep = function(/*...iters*/) {\n      return mergeIntoListWith(this, deepMerger, arguments);\n    };\n\n    List.prototype.mergeDeepWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoListWith(this, deepMergerWith(merger), iters);\n    };\n\n    List.prototype.setSize = function(size) {\n      return setListBounds(this, 0, size);\n    };\n\n    // @pragma Iteration\n\n    List.prototype.slice = function(begin, end) {\n      var size = this.size;\n      if (wholeSlice(begin, end, size)) {\n        return this;\n      }\n      return setListBounds(\n        this,\n        resolveBegin(begin, size),\n        resolveEnd(end, size)\n      );\n    };\n\n    List.prototype.__iterator = function(type, reverse) {\n      var index = 0;\n      var values = iterateList(this, reverse);\n      return new Iterator(function()  {\n        var value = values();\n        return value === DONE ?\n          iteratorDone() :\n          iteratorValue(type, index++, value);\n      });\n    };\n\n    List.prototype.__iterate = function(fn, reverse) {\n      var index = 0;\n      var values = iterateList(this, reverse);\n      var value;\n      while ((value = values()) !== DONE) {\n        if (fn(value, index++, this) === false) {\n          break;\n        }\n      }\n      return index;\n    };\n\n    List.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        return this;\n      }\n      return makeList(this._origin, this._capacity, this._level, this._root, this._tail, ownerID, this.__hash);\n    };\n\n\n  function isList(maybeList) {\n    return !!(maybeList && maybeList[IS_LIST_SENTINEL]);\n  }\n\n  List.isList = isList;\n\n  var IS_LIST_SENTINEL = '@@__IMMUTABLE_LIST__@@';\n\n  var ListPrototype = List.prototype;\n  ListPrototype[IS_LIST_SENTINEL] = true;\n  ListPrototype[DELETE] = ListPrototype.remove;\n  ListPrototype.setIn = MapPrototype.setIn;\n  ListPrototype.deleteIn =\n  ListPrototype.removeIn = MapPrototype.removeIn;\n  ListPrototype.update = MapPrototype.update;\n  ListPrototype.updateIn = MapPrototype.updateIn;\n  ListPrototype.mergeIn = MapPrototype.mergeIn;\n  ListPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\n  ListPrototype.withMutations = MapPrototype.withMutations;\n  ListPrototype.asMutable = MapPrototype.asMutable;\n  ListPrototype.asImmutable = MapPrototype.asImmutable;\n  ListPrototype.wasAltered = MapPrototype.wasAltered;\n\n\n\n    function VNode(array, ownerID) {\n      this.array = array;\n      this.ownerID = ownerID;\n    }\n\n    // TODO: seems like these methods are very similar\n\n    VNode.prototype.removeBefore = function(ownerID, level, index) {\n      if (index === level ? 1 << level : 0 || this.array.length === 0) {\n        return this;\n      }\n      var originIndex = (index >>> level) & MASK;\n      if (originIndex >= this.array.length) {\n        return new VNode([], ownerID);\n      }\n      var removingFirst = originIndex === 0;\n      var newChild;\n      if (level > 0) {\n        var oldChild = this.array[originIndex];\n        newChild = oldChild && oldChild.removeBefore(ownerID, level - SHIFT, index);\n        if (newChild === oldChild && removingFirst) {\n          return this;\n        }\n      }\n      if (removingFirst && !newChild) {\n        return this;\n      }\n      var editable = editableVNode(this, ownerID);\n      if (!removingFirst) {\n        for (var ii = 0; ii < originIndex; ii++) {\n          editable.array[ii] = undefined;\n        }\n      }\n      if (newChild) {\n        editable.array[originIndex] = newChild;\n      }\n      return editable;\n    };\n\n    VNode.prototype.removeAfter = function(ownerID, level, index) {\n      if (index === (level ? 1 << level : 0) || this.array.length === 0) {\n        return this;\n      }\n      var sizeIndex = ((index - 1) >>> level) & MASK;\n      if (sizeIndex >= this.array.length) {\n        return this;\n      }\n\n      var newChild;\n      if (level > 0) {\n        var oldChild = this.array[sizeIndex];\n        newChild = oldChild && oldChild.removeAfter(ownerID, level - SHIFT, index);\n        if (newChild === oldChild && sizeIndex === this.array.length - 1) {\n          return this;\n        }\n      }\n\n      var editable = editableVNode(this, ownerID);\n      editable.array.splice(sizeIndex + 1);\n      if (newChild) {\n        editable.array[sizeIndex] = newChild;\n      }\n      return editable;\n    };\n\n\n\n  var DONE = {};\n\n  function iterateList(list, reverse) {\n    var left = list._origin;\n    var right = list._capacity;\n    var tailPos = getTailOffset(right);\n    var tail = list._tail;\n\n    return iterateNodeOrLeaf(list._root, list._level, 0);\n\n    function iterateNodeOrLeaf(node, level, offset) {\n      return level === 0 ?\n        iterateLeaf(node, offset) :\n        iterateNode(node, level, offset);\n    }\n\n    function iterateLeaf(node, offset) {\n      var array = offset === tailPos ? tail && tail.array : node && node.array;\n      var from = offset > left ? 0 : left - offset;\n      var to = right - offset;\n      if (to > SIZE) {\n        to = SIZE;\n      }\n      return function()  {\n        if (from === to) {\n          return DONE;\n        }\n        var idx = reverse ? --to : from++;\n        return array && array[idx];\n      };\n    }\n\n    function iterateNode(node, level, offset) {\n      var values;\n      var array = node && node.array;\n      var from = offset > left ? 0 : (left - offset) >> level;\n      var to = ((right - offset) >> level) + 1;\n      if (to > SIZE) {\n        to = SIZE;\n      }\n      return function()  {\n        do {\n          if (values) {\n            var value = values();\n            if (value !== DONE) {\n              return value;\n            }\n            values = null;\n          }\n          if (from === to) {\n            return DONE;\n          }\n          var idx = reverse ? --to : from++;\n          values = iterateNodeOrLeaf(\n            array && array[idx], level - SHIFT, offset + (idx << level)\n          );\n        } while (true);\n      };\n    }\n  }\n\n  function makeList(origin, capacity, level, root, tail, ownerID, hash) {\n    var list = Object.create(ListPrototype);\n    list.size = capacity - origin;\n    list._origin = origin;\n    list._capacity = capacity;\n    list._level = level;\n    list._root = root;\n    list._tail = tail;\n    list.__ownerID = ownerID;\n    list.__hash = hash;\n    list.__altered = false;\n    return list;\n  }\n\n  var EMPTY_LIST;\n  function emptyList() {\n    return EMPTY_LIST || (EMPTY_LIST = makeList(0, 0, SHIFT));\n  }\n\n  function updateList(list, index, value) {\n    index = wrapIndex(list, index);\n\n    if (index !== index) {\n      return list;\n    }\n\n    if (index >= list.size || index < 0) {\n      return list.withMutations(function(list ) {\n        index < 0 ?\n          setListBounds(list, index).set(0, value) :\n          setListBounds(list, 0, index + 1).set(index, value)\n      });\n    }\n\n    index += list._origin;\n\n    var newTail = list._tail;\n    var newRoot = list._root;\n    var didAlter = MakeRef(DID_ALTER);\n    if (index >= getTailOffset(list._capacity)) {\n      newTail = updateVNode(newTail, list.__ownerID, 0, index, value, didAlter);\n    } else {\n      newRoot = updateVNode(newRoot, list.__ownerID, list._level, index, value, didAlter);\n    }\n\n    if (!didAlter.value) {\n      return list;\n    }\n\n    if (list.__ownerID) {\n      list._root = newRoot;\n      list._tail = newTail;\n      list.__hash = undefined;\n      list.__altered = true;\n      return list;\n    }\n    return makeList(list._origin, list._capacity, list._level, newRoot, newTail);\n  }\n\n  function updateVNode(node, ownerID, level, index, value, didAlter) {\n    var idx = (index >>> level) & MASK;\n    var nodeHas = node && idx < node.array.length;\n    if (!nodeHas && value === undefined) {\n      return node;\n    }\n\n    var newNode;\n\n    if (level > 0) {\n      var lowerNode = node && node.array[idx];\n      var newLowerNode = updateVNode(lowerNode, ownerID, level - SHIFT, index, value, didAlter);\n      if (newLowerNode === lowerNode) {\n        return node;\n      }\n      newNode = editableVNode(node, ownerID);\n      newNode.array[idx] = newLowerNode;\n      return newNode;\n    }\n\n    if (nodeHas && node.array[idx] === value) {\n      return node;\n    }\n\n    SetRef(didAlter);\n\n    newNode = editableVNode(node, ownerID);\n    if (value === undefined && idx === newNode.array.length - 1) {\n      newNode.array.pop();\n    } else {\n      newNode.array[idx] = value;\n    }\n    return newNode;\n  }\n\n  function editableVNode(node, ownerID) {\n    if (ownerID && node && ownerID === node.ownerID) {\n      return node;\n    }\n    return new VNode(node ? node.array.slice() : [], ownerID);\n  }\n\n  function listNodeFor(list, rawIndex) {\n    if (rawIndex >= getTailOffset(list._capacity)) {\n      return list._tail;\n    }\n    if (rawIndex < 1 << (list._level + SHIFT)) {\n      var node = list._root;\n      var level = list._level;\n      while (node && level > 0) {\n        node = node.array[(rawIndex >>> level) & MASK];\n        level -= SHIFT;\n      }\n      return node;\n    }\n  }\n\n  function setListBounds(list, begin, end) {\n    // Sanitize begin & end using this shorthand for ToInt32(argument)\n    // http://www.ecma-international.org/ecma-262/6.0/#sec-toint32\n    if (begin !== undefined) {\n      begin = begin | 0;\n    }\n    if (end !== undefined) {\n      end = end | 0;\n    }\n    var owner = list.__ownerID || new OwnerID();\n    var oldOrigin = list._origin;\n    var oldCapacity = list._capacity;\n    var newOrigin = oldOrigin + begin;\n    var newCapacity = end === undefined ? oldCapacity : end < 0 ? oldCapacity + end : oldOrigin + end;\n    if (newOrigin === oldOrigin && newCapacity === oldCapacity) {\n      return list;\n    }\n\n    // If it's going to end after it starts, it's empty.\n    if (newOrigin >= newCapacity) {\n      return list.clear();\n    }\n\n    var newLevel = list._level;\n    var newRoot = list._root;\n\n    // New origin might need creating a higher root.\n    var offsetShift = 0;\n    while (newOrigin + offsetShift < 0) {\n      newRoot = new VNode(newRoot && newRoot.array.length ? [undefined, newRoot] : [], owner);\n      newLevel += SHIFT;\n      offsetShift += 1 << newLevel;\n    }\n    if (offsetShift) {\n      newOrigin += offsetShift;\n      oldOrigin += offsetShift;\n      newCapacity += offsetShift;\n      oldCapacity += offsetShift;\n    }\n\n    var oldTailOffset = getTailOffset(oldCapacity);\n    var newTailOffset = getTailOffset(newCapacity);\n\n    // New size might need creating a higher root.\n    while (newTailOffset >= 1 << (newLevel + SHIFT)) {\n      newRoot = new VNode(newRoot && newRoot.array.length ? [newRoot] : [], owner);\n      newLevel += SHIFT;\n    }\n\n    // Locate or create the new tail.\n    var oldTail = list._tail;\n    var newTail = newTailOffset < oldTailOffset ?\n      listNodeFor(list, newCapacity - 1) :\n      newTailOffset > oldTailOffset ? new VNode([], owner) : oldTail;\n\n    // Merge Tail into tree.\n    if (oldTail && newTailOffset > oldTailOffset && newOrigin < oldCapacity && oldTail.array.length) {\n      newRoot = editableVNode(newRoot, owner);\n      var node = newRoot;\n      for (var level = newLevel; level > SHIFT; level -= SHIFT) {\n        var idx = (oldTailOffset >>> level) & MASK;\n        node = node.array[idx] = editableVNode(node.array[idx], owner);\n      }\n      node.array[(oldTailOffset >>> SHIFT) & MASK] = oldTail;\n    }\n\n    // If the size has been reduced, there's a chance the tail needs to be trimmed.\n    if (newCapacity < oldCapacity) {\n      newTail = newTail && newTail.removeAfter(owner, 0, newCapacity);\n    }\n\n    // If the new origin is within the tail, then we do not need a root.\n    if (newOrigin >= newTailOffset) {\n      newOrigin -= newTailOffset;\n      newCapacity -= newTailOffset;\n      newLevel = SHIFT;\n      newRoot = null;\n      newTail = newTail && newTail.removeBefore(owner, 0, newOrigin);\n\n    // Otherwise, if the root has been trimmed, garbage collect.\n    } else if (newOrigin > oldOrigin || newTailOffset < oldTailOffset) {\n      offsetShift = 0;\n\n      // Identify the new top root node of the subtree of the old root.\n      while (newRoot) {\n        var beginIndex = (newOrigin >>> newLevel) & MASK;\n        if (beginIndex !== (newTailOffset >>> newLevel) & MASK) {\n          break;\n        }\n        if (beginIndex) {\n          offsetShift += (1 << newLevel) * beginIndex;\n        }\n        newLevel -= SHIFT;\n        newRoot = newRoot.array[beginIndex];\n      }\n\n      // Trim the new sides of the new root.\n      if (newRoot && newOrigin > oldOrigin) {\n        newRoot = newRoot.removeBefore(owner, newLevel, newOrigin - offsetShift);\n      }\n      if (newRoot && newTailOffset < oldTailOffset) {\n        newRoot = newRoot.removeAfter(owner, newLevel, newTailOffset - offsetShift);\n      }\n      if (offsetShift) {\n        newOrigin -= offsetShift;\n        newCapacity -= offsetShift;\n      }\n    }\n\n    if (list.__ownerID) {\n      list.size = newCapacity - newOrigin;\n      list._origin = newOrigin;\n      list._capacity = newCapacity;\n      list._level = newLevel;\n      list._root = newRoot;\n      list._tail = newTail;\n      list.__hash = undefined;\n      list.__altered = true;\n      return list;\n    }\n    return makeList(newOrigin, newCapacity, newLevel, newRoot, newTail);\n  }\n\n  function mergeIntoListWith(list, merger, iterables) {\n    var iters = [];\n    var maxSize = 0;\n    for (var ii = 0; ii < iterables.length; ii++) {\n      var value = iterables[ii];\n      var iter = IndexedIterable(value);\n      if (iter.size > maxSize) {\n        maxSize = iter.size;\n      }\n      if (!isIterable(value)) {\n        iter = iter.map(function(v ) {return fromJS(v)});\n      }\n      iters.push(iter);\n    }\n    if (maxSize > list.size) {\n      list = list.setSize(maxSize);\n    }\n    return mergeIntoCollectionWith(list, merger, iters);\n  }\n\n  function getTailOffset(size) {\n    return size < SIZE ? 0 : (((size - 1) >>> SHIFT) << SHIFT);\n  }\n\n  createClass(OrderedMap, Map);\n\n    // @pragma Construction\n\n    function OrderedMap(value) {\n      return value === null || value === undefined ? emptyOrderedMap() :\n        isOrderedMap(value) ? value :\n        emptyOrderedMap().withMutations(function(map ) {\n          var iter = KeyedIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v, k)  {return map.set(k, v)});\n        });\n    }\n\n    OrderedMap.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    OrderedMap.prototype.toString = function() {\n      return this.__toString('OrderedMap {', '}');\n    };\n\n    // @pragma Access\n\n    OrderedMap.prototype.get = function(k, notSetValue) {\n      var index = this._map.get(k);\n      return index !== undefined ? this._list.get(index)[1] : notSetValue;\n    };\n\n    // @pragma Modification\n\n    OrderedMap.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = 0;\n        this._map.clear();\n        this._list.clear();\n        return this;\n      }\n      return emptyOrderedMap();\n    };\n\n    OrderedMap.prototype.set = function(k, v) {\n      return updateOrderedMap(this, k, v);\n    };\n\n    OrderedMap.prototype.remove = function(k) {\n      return updateOrderedMap(this, k, NOT_SET);\n    };\n\n    OrderedMap.prototype.wasAltered = function() {\n      return this._map.wasAltered() || this._list.wasAltered();\n    };\n\n    OrderedMap.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._list.__iterate(\n        function(entry ) {return entry && fn(entry[1], entry[0], this$0)},\n        reverse\n      );\n    };\n\n    OrderedMap.prototype.__iterator = function(type, reverse) {\n      return this._list.fromEntrySeq().__iterator(type, reverse);\n    };\n\n    OrderedMap.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      var newMap = this._map.__ensureOwner(ownerID);\n      var newList = this._list.__ensureOwner(ownerID);\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this._map = newMap;\n        this._list = newList;\n        return this;\n      }\n      return makeOrderedMap(newMap, newList, ownerID, this.__hash);\n    };\n\n\n  function isOrderedMap(maybeOrderedMap) {\n    return isMap(maybeOrderedMap) && isOrdered(maybeOrderedMap);\n  }\n\n  OrderedMap.isOrderedMap = isOrderedMap;\n\n  OrderedMap.prototype[IS_ORDERED_SENTINEL] = true;\n  OrderedMap.prototype[DELETE] = OrderedMap.prototype.remove;\n\n\n\n  function makeOrderedMap(map, list, ownerID, hash) {\n    var omap = Object.create(OrderedMap.prototype);\n    omap.size = map ? map.size : 0;\n    omap._map = map;\n    omap._list = list;\n    omap.__ownerID = ownerID;\n    omap.__hash = hash;\n    return omap;\n  }\n\n  var EMPTY_ORDERED_MAP;\n  function emptyOrderedMap() {\n    return EMPTY_ORDERED_MAP || (EMPTY_ORDERED_MAP = makeOrderedMap(emptyMap(), emptyList()));\n  }\n\n  function updateOrderedMap(omap, k, v) {\n    var map = omap._map;\n    var list = omap._list;\n    var i = map.get(k);\n    var has = i !== undefined;\n    var newMap;\n    var newList;\n    if (v === NOT_SET) { // removed\n      if (!has) {\n        return omap;\n      }\n      if (list.size >= SIZE && list.size >= map.size * 2) {\n        newList = list.filter(function(entry, idx)  {return entry !== undefined && i !== idx});\n        newMap = newList.toKeyedSeq().map(function(entry ) {return entry[0]}).flip().toMap();\n        if (omap.__ownerID) {\n          newMap.__ownerID = newList.__ownerID = omap.__ownerID;\n        }\n      } else {\n        newMap = map.remove(k);\n        newList = i === list.size - 1 ? list.pop() : list.set(i, undefined);\n      }\n    } else {\n      if (has) {\n        if (v === list.get(i)[1]) {\n          return omap;\n        }\n        newMap = map;\n        newList = list.set(i, [k, v]);\n      } else {\n        newMap = map.set(k, list.size);\n        newList = list.set(list.size, [k, v]);\n      }\n    }\n    if (omap.__ownerID) {\n      omap.size = newMap.size;\n      omap._map = newMap;\n      omap._list = newList;\n      omap.__hash = undefined;\n      return omap;\n    }\n    return makeOrderedMap(newMap, newList);\n  }\n\n  createClass(ToKeyedSequence, KeyedSeq);\n    function ToKeyedSequence(indexed, useKeys) {\n      this._iter = indexed;\n      this._useKeys = useKeys;\n      this.size = indexed.size;\n    }\n\n    ToKeyedSequence.prototype.get = function(key, notSetValue) {\n      return this._iter.get(key, notSetValue);\n    };\n\n    ToKeyedSequence.prototype.has = function(key) {\n      return this._iter.has(key);\n    };\n\n    ToKeyedSequence.prototype.valueSeq = function() {\n      return this._iter.valueSeq();\n    };\n\n    ToKeyedSequence.prototype.reverse = function() {var this$0 = this;\n      var reversedSequence = reverseFactory(this, true);\n      if (!this._useKeys) {\n        reversedSequence.valueSeq = function()  {return this$0._iter.toSeq().reverse()};\n      }\n      return reversedSequence;\n    };\n\n    ToKeyedSequence.prototype.map = function(mapper, context) {var this$0 = this;\n      var mappedSequence = mapFactory(this, mapper, context);\n      if (!this._useKeys) {\n        mappedSequence.valueSeq = function()  {return this$0._iter.toSeq().map(mapper, context)};\n      }\n      return mappedSequence;\n    };\n\n    ToKeyedSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      var ii;\n      return this._iter.__iterate(\n        this._useKeys ?\n          function(v, k)  {return fn(v, k, this$0)} :\n          ((ii = reverse ? resolveSize(this) : 0),\n            function(v ) {return fn(v, reverse ? --ii : ii++, this$0)}),\n        reverse\n      );\n    };\n\n    ToKeyedSequence.prototype.__iterator = function(type, reverse) {\n      if (this._useKeys) {\n        return this._iter.__iterator(type, reverse);\n      }\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      var ii = reverse ? resolveSize(this) : 0;\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step :\n          iteratorValue(type, reverse ? --ii : ii++, step.value, step);\n      });\n    };\n\n  ToKeyedSequence.prototype[IS_ORDERED_SENTINEL] = true;\n\n\n  createClass(ToIndexedSequence, IndexedSeq);\n    function ToIndexedSequence(iter) {\n      this._iter = iter;\n      this.size = iter.size;\n    }\n\n    ToIndexedSequence.prototype.includes = function(value) {\n      return this._iter.includes(value);\n    };\n\n    ToIndexedSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      return this._iter.__iterate(function(v ) {return fn(v, iterations++, this$0)}, reverse);\n    };\n\n    ToIndexedSequence.prototype.__iterator = function(type, reverse) {\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      var iterations = 0;\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step :\n          iteratorValue(type, iterations++, step.value, step)\n      });\n    };\n\n\n\n  createClass(ToSetSequence, SetSeq);\n    function ToSetSequence(iter) {\n      this._iter = iter;\n      this.size = iter.size;\n    }\n\n    ToSetSequence.prototype.has = function(key) {\n      return this._iter.includes(key);\n    };\n\n    ToSetSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._iter.__iterate(function(v ) {return fn(v, v, this$0)}, reverse);\n    };\n\n    ToSetSequence.prototype.__iterator = function(type, reverse) {\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step :\n          iteratorValue(type, step.value, step.value, step);\n      });\n    };\n\n\n\n  createClass(FromEntriesSequence, KeyedSeq);\n    function FromEntriesSequence(entries) {\n      this._iter = entries;\n      this.size = entries.size;\n    }\n\n    FromEntriesSequence.prototype.entrySeq = function() {\n      return this._iter.toSeq();\n    };\n\n    FromEntriesSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._iter.__iterate(function(entry ) {\n        // Check if entry exists first so array access doesn't throw for holes\n        // in the parent iteration.\n        if (entry) {\n          validateEntry(entry);\n          var indexedIterable = isIterable(entry);\n          return fn(\n            indexedIterable ? entry.get(1) : entry[1],\n            indexedIterable ? entry.get(0) : entry[0],\n            this$0\n          );\n        }\n      }, reverse);\n    };\n\n    FromEntriesSequence.prototype.__iterator = function(type, reverse) {\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      return new Iterator(function()  {\n        while (true) {\n          var step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n          var entry = step.value;\n          // Check if entry exists first so array access doesn't throw for holes\n          // in the parent iteration.\n          if (entry) {\n            validateEntry(entry);\n            var indexedIterable = isIterable(entry);\n            return iteratorValue(\n              type,\n              indexedIterable ? entry.get(0) : entry[0],\n              indexedIterable ? entry.get(1) : entry[1],\n              step\n            );\n          }\n        }\n      });\n    };\n\n\n  ToIndexedSequence.prototype.cacheResult =\n  ToKeyedSequence.prototype.cacheResult =\n  ToSetSequence.prototype.cacheResult =\n  FromEntriesSequence.prototype.cacheResult =\n    cacheResultThrough;\n\n\n  function flipFactory(iterable) {\n    var flipSequence = makeSequence(iterable);\n    flipSequence._iter = iterable;\n    flipSequence.size = iterable.size;\n    flipSequence.flip = function()  {return iterable};\n    flipSequence.reverse = function () {\n      var reversedSequence = iterable.reverse.apply(this); // super.reverse()\n      reversedSequence.flip = function()  {return iterable.reverse()};\n      return reversedSequence;\n    };\n    flipSequence.has = function(key ) {return iterable.includes(key)};\n    flipSequence.includes = function(key ) {return iterable.has(key)};\n    flipSequence.cacheResult = cacheResultThrough;\n    flipSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      return iterable.__iterate(function(v, k)  {return fn(k, v, this$0) !== false}, reverse);\n    }\n    flipSequence.__iteratorUncached = function(type, reverse) {\n      if (type === ITERATE_ENTRIES) {\n        var iterator = iterable.__iterator(type, reverse);\n        return new Iterator(function()  {\n          var step = iterator.next();\n          if (!step.done) {\n            var k = step.value[0];\n            step.value[0] = step.value[1];\n            step.value[1] = k;\n          }\n          return step;\n        });\n      }\n      return iterable.__iterator(\n        type === ITERATE_VALUES ? ITERATE_KEYS : ITERATE_VALUES,\n        reverse\n      );\n    }\n    return flipSequence;\n  }\n\n\n  function mapFactory(iterable, mapper, context) {\n    var mappedSequence = makeSequence(iterable);\n    mappedSequence.size = iterable.size;\n    mappedSequence.has = function(key ) {return iterable.has(key)};\n    mappedSequence.get = function(key, notSetValue)  {\n      var v = iterable.get(key, NOT_SET);\n      return v === NOT_SET ?\n        notSetValue :\n        mapper.call(context, v, key, iterable);\n    };\n    mappedSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      return iterable.__iterate(\n        function(v, k, c)  {return fn(mapper.call(context, v, k, c), k, this$0) !== false},\n        reverse\n      );\n    }\n    mappedSequence.__iteratorUncached = function (type, reverse) {\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      return new Iterator(function()  {\n        var step = iterator.next();\n        if (step.done) {\n          return step;\n        }\n        var entry = step.value;\n        var key = entry[0];\n        return iteratorValue(\n          type,\n          key,\n          mapper.call(context, entry[1], key, iterable),\n          step\n        );\n      });\n    }\n    return mappedSequence;\n  }\n\n\n  function reverseFactory(iterable, useKeys) {\n    var reversedSequence = makeSequence(iterable);\n    reversedSequence._iter = iterable;\n    reversedSequence.size = iterable.size;\n    reversedSequence.reverse = function()  {return iterable};\n    if (iterable.flip) {\n      reversedSequence.flip = function () {\n        var flipSequence = flipFactory(iterable);\n        flipSequence.reverse = function()  {return iterable.flip()};\n        return flipSequence;\n      };\n    }\n    reversedSequence.get = function(key, notSetValue) \n      {return iterable.get(useKeys ? key : -1 - key, notSetValue)};\n    reversedSequence.has = function(key )\n      {return iterable.has(useKeys ? key : -1 - key)};\n    reversedSequence.includes = function(value ) {return iterable.includes(value)};\n    reversedSequence.cacheResult = cacheResultThrough;\n    reversedSequence.__iterate = function (fn, reverse) {var this$0 = this;\n      return iterable.__iterate(function(v, k)  {return fn(v, k, this$0)}, !reverse);\n    };\n    reversedSequence.__iterator =\n      function(type, reverse)  {return iterable.__iterator(type, !reverse)};\n    return reversedSequence;\n  }\n\n\n  function filterFactory(iterable, predicate, context, useKeys) {\n    var filterSequence = makeSequence(iterable);\n    if (useKeys) {\n      filterSequence.has = function(key ) {\n        var v = iterable.get(key, NOT_SET);\n        return v !== NOT_SET && !!predicate.call(context, v, key, iterable);\n      };\n      filterSequence.get = function(key, notSetValue)  {\n        var v = iterable.get(key, NOT_SET);\n        return v !== NOT_SET && predicate.call(context, v, key, iterable) ?\n          v : notSetValue;\n      };\n    }\n    filterSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      iterable.__iterate(function(v, k, c)  {\n        if (predicate.call(context, v, k, c)) {\n          iterations++;\n          return fn(v, useKeys ? k : iterations - 1, this$0);\n        }\n      }, reverse);\n      return iterations;\n    };\n    filterSequence.__iteratorUncached = function (type, reverse) {\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      var iterations = 0;\n      return new Iterator(function()  {\n        while (true) {\n          var step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n          var entry = step.value;\n          var key = entry[0];\n          var value = entry[1];\n          if (predicate.call(context, value, key, iterable)) {\n            return iteratorValue(type, useKeys ? key : iterations++, value, step);\n          }\n        }\n      });\n    }\n    return filterSequence;\n  }\n\n\n  function countByFactory(iterable, grouper, context) {\n    var groups = Map().asMutable();\n    iterable.__iterate(function(v, k)  {\n      groups.update(\n        grouper.call(context, v, k, iterable),\n        0,\n        function(a ) {return a + 1}\n      );\n    });\n    return groups.asImmutable();\n  }\n\n\n  function groupByFactory(iterable, grouper, context) {\n    var isKeyedIter = isKeyed(iterable);\n    var groups = (isOrdered(iterable) ? OrderedMap() : Map()).asMutable();\n    iterable.__iterate(function(v, k)  {\n      groups.update(\n        grouper.call(context, v, k, iterable),\n        function(a ) {return (a = a || [], a.push(isKeyedIter ? [k, v] : v), a)}\n      );\n    });\n    var coerce = iterableClass(iterable);\n    return groups.map(function(arr ) {return reify(iterable, coerce(arr))});\n  }\n\n\n  function sliceFactory(iterable, begin, end, useKeys) {\n    var originalSize = iterable.size;\n\n    // Sanitize begin & end using this shorthand for ToInt32(argument)\n    // http://www.ecma-international.org/ecma-262/6.0/#sec-toint32\n    if (begin !== undefined) {\n      begin = begin | 0;\n    }\n    if (end !== undefined) {\n      end = end | 0;\n    }\n\n    if (wholeSlice(begin, end, originalSize)) {\n      return iterable;\n    }\n\n    var resolvedBegin = resolveBegin(begin, originalSize);\n    var resolvedEnd = resolveEnd(end, originalSize);\n\n    // begin or end will be NaN if they were provided as negative numbers and\n    // this iterable's size is unknown. In that case, cache first so there is\n    // a known size and these do not resolve to NaN.\n    if (resolvedBegin !== resolvedBegin || resolvedEnd !== resolvedEnd) {\n      return sliceFactory(iterable.toSeq().cacheResult(), begin, end, useKeys);\n    }\n\n    // Note: resolvedEnd is undefined when the original sequence's length is\n    // unknown and this slice did not supply an end and should contain all\n    // elements after resolvedBegin.\n    // In that case, resolvedSize will be NaN and sliceSize will remain undefined.\n    var resolvedSize = resolvedEnd - resolvedBegin;\n    var sliceSize;\n    if (resolvedSize === resolvedSize) {\n      sliceSize = resolvedSize < 0 ? 0 : resolvedSize;\n    }\n\n    var sliceSeq = makeSequence(iterable);\n\n    // If iterable.size is undefined, the size of the realized sliceSeq is\n    // unknown at this point unless the number of items to slice is 0\n    sliceSeq.size = sliceSize === 0 ? sliceSize : iterable.size && sliceSize || undefined;\n\n    if (!useKeys && isSeq(iterable) && sliceSize >= 0) {\n      sliceSeq.get = function (index, notSetValue) {\n        index = wrapIndex(this, index);\n        return index >= 0 && index < sliceSize ?\n          iterable.get(index + resolvedBegin, notSetValue) :\n          notSetValue;\n      }\n    }\n\n    sliceSeq.__iterateUncached = function(fn, reverse) {var this$0 = this;\n      if (sliceSize === 0) {\n        return 0;\n      }\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var skipped = 0;\n      var isSkipping = true;\n      var iterations = 0;\n      iterable.__iterate(function(v, k)  {\n        if (!(isSkipping && (isSkipping = skipped++ < resolvedBegin))) {\n          iterations++;\n          return fn(v, useKeys ? k : iterations - 1, this$0) !== false &&\n                 iterations !== sliceSize;\n        }\n      });\n      return iterations;\n    };\n\n    sliceSeq.__iteratorUncached = function(type, reverse) {\n      if (sliceSize !== 0 && reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      // Don't bother instantiating parent iterator if taking 0.\n      var iterator = sliceSize !== 0 && iterable.__iterator(type, reverse);\n      var skipped = 0;\n      var iterations = 0;\n      return new Iterator(function()  {\n        while (skipped++ < resolvedBegin) {\n          iterator.next();\n        }\n        if (++iterations > sliceSize) {\n          return iteratorDone();\n        }\n        var step = iterator.next();\n        if (useKeys || type === ITERATE_VALUES) {\n          return step;\n        } else if (type === ITERATE_KEYS) {\n          return iteratorValue(type, iterations - 1, undefined, step);\n        } else {\n          return iteratorValue(type, iterations - 1, step.value[1], step);\n        }\n      });\n    }\n\n    return sliceSeq;\n  }\n\n\n  function takeWhileFactory(iterable, predicate, context) {\n    var takeSequence = makeSequence(iterable);\n    takeSequence.__iterateUncached = function(fn, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var iterations = 0;\n      iterable.__iterate(function(v, k, c) \n        {return predicate.call(context, v, k, c) && ++iterations && fn(v, k, this$0)}\n      );\n      return iterations;\n    };\n    takeSequence.__iteratorUncached = function(type, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      var iterating = true;\n      return new Iterator(function()  {\n        if (!iterating) {\n          return iteratorDone();\n        }\n        var step = iterator.next();\n        if (step.done) {\n          return step;\n        }\n        var entry = step.value;\n        var k = entry[0];\n        var v = entry[1];\n        if (!predicate.call(context, v, k, this$0)) {\n          iterating = false;\n          return iteratorDone();\n        }\n        return type === ITERATE_ENTRIES ? step :\n          iteratorValue(type, k, v, step);\n      });\n    };\n    return takeSequence;\n  }\n\n\n  function skipWhileFactory(iterable, predicate, context, useKeys) {\n    var skipSequence = makeSequence(iterable);\n    skipSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var isSkipping = true;\n      var iterations = 0;\n      iterable.__iterate(function(v, k, c)  {\n        if (!(isSkipping && (isSkipping = predicate.call(context, v, k, c)))) {\n          iterations++;\n          return fn(v, useKeys ? k : iterations - 1, this$0);\n        }\n      });\n      return iterations;\n    };\n    skipSequence.__iteratorUncached = function(type, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      var skipping = true;\n      var iterations = 0;\n      return new Iterator(function()  {\n        var step, k, v;\n        do {\n          step = iterator.next();\n          if (step.done) {\n            if (useKeys || type === ITERATE_VALUES) {\n              return step;\n            } else if (type === ITERATE_KEYS) {\n              return iteratorValue(type, iterations++, undefined, step);\n            } else {\n              return iteratorValue(type, iterations++, step.value[1], step);\n            }\n          }\n          var entry = step.value;\n          k = entry[0];\n          v = entry[1];\n          skipping && (skipping = predicate.call(context, v, k, this$0));\n        } while (skipping);\n        return type === ITERATE_ENTRIES ? step :\n          iteratorValue(type, k, v, step);\n      });\n    };\n    return skipSequence;\n  }\n\n\n  function concatFactory(iterable, values) {\n    var isKeyedIterable = isKeyed(iterable);\n    var iters = [iterable].concat(values).map(function(v ) {\n      if (!isIterable(v)) {\n        v = isKeyedIterable ?\n          keyedSeqFromValue(v) :\n          indexedSeqFromValue(Array.isArray(v) ? v : [v]);\n      } else if (isKeyedIterable) {\n        v = KeyedIterable(v);\n      }\n      return v;\n    }).filter(function(v ) {return v.size !== 0});\n\n    if (iters.length === 0) {\n      return iterable;\n    }\n\n    if (iters.length === 1) {\n      var singleton = iters[0];\n      if (singleton === iterable ||\n          isKeyedIterable && isKeyed(singleton) ||\n          isIndexed(iterable) && isIndexed(singleton)) {\n        return singleton;\n      }\n    }\n\n    var concatSeq = new ArraySeq(iters);\n    if (isKeyedIterable) {\n      concatSeq = concatSeq.toKeyedSeq();\n    } else if (!isIndexed(iterable)) {\n      concatSeq = concatSeq.toSetSeq();\n    }\n    concatSeq = concatSeq.flatten(true);\n    concatSeq.size = iters.reduce(\n      function(sum, seq)  {\n        if (sum !== undefined) {\n          var size = seq.size;\n          if (size !== undefined) {\n            return sum + size;\n          }\n        }\n      },\n      0\n    );\n    return concatSeq;\n  }\n\n\n  function flattenFactory(iterable, depth, useKeys) {\n    var flatSequence = makeSequence(iterable);\n    flatSequence.__iterateUncached = function(fn, reverse) {\n      var iterations = 0;\n      var stopped = false;\n      function flatDeep(iter, currentDepth) {var this$0 = this;\n        iter.__iterate(function(v, k)  {\n          if ((!depth || currentDepth < depth) && isIterable(v)) {\n            flatDeep(v, currentDepth + 1);\n          } else if (fn(v, useKeys ? k : iterations++, this$0) === false) {\n            stopped = true;\n          }\n          return !stopped;\n        }, reverse);\n      }\n      flatDeep(iterable, 0);\n      return iterations;\n    }\n    flatSequence.__iteratorUncached = function(type, reverse) {\n      var iterator = iterable.__iterator(type, reverse);\n      var stack = [];\n      var iterations = 0;\n      return new Iterator(function()  {\n        while (iterator) {\n          var step = iterator.next();\n          if (step.done !== false) {\n            iterator = stack.pop();\n            continue;\n          }\n          var v = step.value;\n          if (type === ITERATE_ENTRIES) {\n            v = v[1];\n          }\n          if ((!depth || stack.length < depth) && isIterable(v)) {\n            stack.push(iterator);\n            iterator = v.__iterator(type, reverse);\n          } else {\n            return useKeys ? step : iteratorValue(type, iterations++, v, step);\n          }\n        }\n        return iteratorDone();\n      });\n    }\n    return flatSequence;\n  }\n\n\n  function flatMapFactory(iterable, mapper, context) {\n    var coerce = iterableClass(iterable);\n    return iterable.toSeq().map(\n      function(v, k)  {return coerce(mapper.call(context, v, k, iterable))}\n    ).flatten(true);\n  }\n\n\n  function interposeFactory(iterable, separator) {\n    var interposedSequence = makeSequence(iterable);\n    interposedSequence.size = iterable.size && iterable.size * 2 -1;\n    interposedSequence.__iterateUncached = function(fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      iterable.__iterate(function(v, k) \n        {return (!iterations || fn(separator, iterations++, this$0) !== false) &&\n        fn(v, iterations++, this$0) !== false},\n        reverse\n      );\n      return iterations;\n    };\n    interposedSequence.__iteratorUncached = function(type, reverse) {\n      var iterator = iterable.__iterator(ITERATE_VALUES, reverse);\n      var iterations = 0;\n      var step;\n      return new Iterator(function()  {\n        if (!step || iterations % 2) {\n          step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n        }\n        return iterations % 2 ?\n          iteratorValue(type, iterations++, separator) :\n          iteratorValue(type, iterations++, step.value, step);\n      });\n    };\n    return interposedSequence;\n  }\n\n\n  function sortFactory(iterable, comparator, mapper) {\n    if (!comparator) {\n      comparator = defaultComparator;\n    }\n    var isKeyedIterable = isKeyed(iterable);\n    var index = 0;\n    var entries = iterable.toSeq().map(\n      function(v, k)  {return [k, v, index++, mapper ? mapper(v, k, iterable) : v]}\n    ).toArray();\n    entries.sort(function(a, b)  {return comparator(a[3], b[3]) || a[2] - b[2]}).forEach(\n      isKeyedIterable ?\n      function(v, i)  { entries[i].length = 2; } :\n      function(v, i)  { entries[i] = v[1]; }\n    );\n    return isKeyedIterable ? KeyedSeq(entries) :\n      isIndexed(iterable) ? IndexedSeq(entries) :\n      SetSeq(entries);\n  }\n\n\n  function maxFactory(iterable, comparator, mapper) {\n    if (!comparator) {\n      comparator = defaultComparator;\n    }\n    if (mapper) {\n      var entry = iterable.toSeq()\n        .map(function(v, k)  {return [v, mapper(v, k, iterable)]})\n        .reduce(function(a, b)  {return maxCompare(comparator, a[1], b[1]) ? b : a});\n      return entry && entry[0];\n    } else {\n      return iterable.reduce(function(a, b)  {return maxCompare(comparator, a, b) ? b : a});\n    }\n  }\n\n  function maxCompare(comparator, a, b) {\n    var comp = comparator(b, a);\n    // b is considered the new max if the comparator declares them equal, but\n    // they are not equal and b is in fact a nullish value.\n    return (comp === 0 && b !== a && (b === undefined || b === null || b !== b)) || comp > 0;\n  }\n\n\n  function zipWithFactory(keyIter, zipper, iters) {\n    var zipSequence = makeSequence(keyIter);\n    zipSequence.size = new ArraySeq(iters).map(function(i ) {return i.size}).min();\n    // Note: this a generic base implementation of __iterate in terms of\n    // __iterator which may be more generically useful in the future.\n    zipSequence.__iterate = function(fn, reverse) {\n      /* generic:\n      var iterator = this.__iterator(ITERATE_ENTRIES, reverse);\n      var step;\n      var iterations = 0;\n      while (!(step = iterator.next()).done) {\n        iterations++;\n        if (fn(step.value[1], step.value[0], this) === false) {\n          break;\n        }\n      }\n      return iterations;\n      */\n      // indexed:\n      var iterator = this.__iterator(ITERATE_VALUES, reverse);\n      var step;\n      var iterations = 0;\n      while (!(step = iterator.next()).done) {\n        if (fn(step.value, iterations++, this) === false) {\n          break;\n        }\n      }\n      return iterations;\n    };\n    zipSequence.__iteratorUncached = function(type, reverse) {\n      var iterators = iters.map(function(i )\n        {return (i = Iterable(i), getIterator(reverse ? i.reverse() : i))}\n      );\n      var iterations = 0;\n      var isDone = false;\n      return new Iterator(function()  {\n        var steps;\n        if (!isDone) {\n          steps = iterators.map(function(i ) {return i.next()});\n          isDone = steps.some(function(s ) {return s.done});\n        }\n        if (isDone) {\n          return iteratorDone();\n        }\n        return iteratorValue(\n          type,\n          iterations++,\n          zipper.apply(null, steps.map(function(s ) {return s.value}))\n        );\n      });\n    };\n    return zipSequence\n  }\n\n\n  // #pragma Helper Functions\n\n  function reify(iter, seq) {\n    return isSeq(iter) ? seq : iter.constructor(seq);\n  }\n\n  function validateEntry(entry) {\n    if (entry !== Object(entry)) {\n      throw new TypeError('Expected [K, V] tuple: ' + entry);\n    }\n  }\n\n  function resolveSize(iter) {\n    assertNotInfinite(iter.size);\n    return ensureSize(iter);\n  }\n\n  function iterableClass(iterable) {\n    return isKeyed(iterable) ? KeyedIterable :\n      isIndexed(iterable) ? IndexedIterable :\n      SetIterable;\n  }\n\n  function makeSequence(iterable) {\n    return Object.create(\n      (\n        isKeyed(iterable) ? KeyedSeq :\n        isIndexed(iterable) ? IndexedSeq :\n        SetSeq\n      ).prototype\n    );\n  }\n\n  function cacheResultThrough() {\n    if (this._iter.cacheResult) {\n      this._iter.cacheResult();\n      this.size = this._iter.size;\n      return this;\n    } else {\n      return Seq.prototype.cacheResult.call(this);\n    }\n  }\n\n  function defaultComparator(a, b) {\n    return a > b ? 1 : a < b ? -1 : 0;\n  }\n\n  function forceIterator(keyPath) {\n    var iter = getIterator(keyPath);\n    if (!iter) {\n      // Array might not be iterable in this environment, so we need a fallback\n      // to our wrapped type.\n      if (!isArrayLike(keyPath)) {\n        throw new TypeError('Expected iterable or array-like: ' + keyPath);\n      }\n      iter = getIterator(Iterable(keyPath));\n    }\n    return iter;\n  }\n\n  createClass(Record, KeyedCollection);\n\n    function Record(defaultValues, name) {\n      var hasInitialized;\n\n      var RecordType = function Record(values) {\n        if (values instanceof RecordType) {\n          return values;\n        }\n        if (!(this instanceof RecordType)) {\n          return new RecordType(values);\n        }\n        if (!hasInitialized) {\n          hasInitialized = true;\n          var keys = Object.keys(defaultValues);\n          setProps(RecordTypePrototype, keys);\n          RecordTypePrototype.size = keys.length;\n          RecordTypePrototype._name = name;\n          RecordTypePrototype._keys = keys;\n          RecordTypePrototype._defaultValues = defaultValues;\n        }\n        this._map = Map(values);\n      };\n\n      var RecordTypePrototype = RecordType.prototype = Object.create(RecordPrototype);\n      RecordTypePrototype.constructor = RecordType;\n\n      return RecordType;\n    }\n\n    Record.prototype.toString = function() {\n      return this.__toString(recordName(this) + ' {', '}');\n    };\n\n    // @pragma Access\n\n    Record.prototype.has = function(k) {\n      return this._defaultValues.hasOwnProperty(k);\n    };\n\n    Record.prototype.get = function(k, notSetValue) {\n      if (!this.has(k)) {\n        return notSetValue;\n      }\n      var defaultVal = this._defaultValues[k];\n      return this._map ? this._map.get(k, defaultVal) : defaultVal;\n    };\n\n    // @pragma Modification\n\n    Record.prototype.clear = function() {\n      if (this.__ownerID) {\n        this._map && this._map.clear();\n        return this;\n      }\n      var RecordType = this.constructor;\n      return RecordType._empty || (RecordType._empty = makeRecord(this, emptyMap()));\n    };\n\n    Record.prototype.set = function(k, v) {\n      if (!this.has(k)) {\n        throw new Error('Cannot set unknown key \"' + k + '\" on ' + recordName(this));\n      }\n      var newMap = this._map && this._map.set(k, v);\n      if (this.__ownerID || newMap === this._map) {\n        return this;\n      }\n      return makeRecord(this, newMap);\n    };\n\n    Record.prototype.remove = function(k) {\n      if (!this.has(k)) {\n        return this;\n      }\n      var newMap = this._map && this._map.remove(k);\n      if (this.__ownerID || newMap === this._map) {\n        return this;\n      }\n      return makeRecord(this, newMap);\n    };\n\n    Record.prototype.wasAltered = function() {\n      return this._map.wasAltered();\n    };\n\n    Record.prototype.__iterator = function(type, reverse) {var this$0 = this;\n      return KeyedIterable(this._defaultValues).map(function(_, k)  {return this$0.get(k)}).__iterator(type, reverse);\n    };\n\n    Record.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return KeyedIterable(this._defaultValues).map(function(_, k)  {return this$0.get(k)}).__iterate(fn, reverse);\n    };\n\n    Record.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      var newMap = this._map && this._map.__ensureOwner(ownerID);\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this._map = newMap;\n        return this;\n      }\n      return makeRecord(this, newMap, ownerID);\n    };\n\n\n  var RecordPrototype = Record.prototype;\n  RecordPrototype[DELETE] = RecordPrototype.remove;\n  RecordPrototype.deleteIn =\n  RecordPrototype.removeIn = MapPrototype.removeIn;\n  RecordPrototype.merge = MapPrototype.merge;\n  RecordPrototype.mergeWith = MapPrototype.mergeWith;\n  RecordPrototype.mergeIn = MapPrototype.mergeIn;\n  RecordPrototype.mergeDeep = MapPrototype.mergeDeep;\n  RecordPrototype.mergeDeepWith = MapPrototype.mergeDeepWith;\n  RecordPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\n  RecordPrototype.setIn = MapPrototype.setIn;\n  RecordPrototype.update = MapPrototype.update;\n  RecordPrototype.updateIn = MapPrototype.updateIn;\n  RecordPrototype.withMutations = MapPrototype.withMutations;\n  RecordPrototype.asMutable = MapPrototype.asMutable;\n  RecordPrototype.asImmutable = MapPrototype.asImmutable;\n\n\n  function makeRecord(likeRecord, map, ownerID) {\n    var record = Object.create(Object.getPrototypeOf(likeRecord));\n    record._map = map;\n    record.__ownerID = ownerID;\n    return record;\n  }\n\n  function recordName(record) {\n    return record._name || record.constructor.name || 'Record';\n  }\n\n  function setProps(prototype, names) {\n    try {\n      names.forEach(setProp.bind(undefined, prototype));\n    } catch (error) {\n      // Object.defineProperty failed. Probably IE8.\n    }\n  }\n\n  function setProp(prototype, name) {\n    Object.defineProperty(prototype, name, {\n      get: function() {\n        return this.get(name);\n      },\n      set: function(value) {\n        invariant(this.__ownerID, 'Cannot set on an immutable record.');\n        this.set(name, value);\n      }\n    });\n  }\n\n  createClass(Set, SetCollection);\n\n    // @pragma Construction\n\n    function Set(value) {\n      return value === null || value === undefined ? emptySet() :\n        isSet(value) && !isOrdered(value) ? value :\n        emptySet().withMutations(function(set ) {\n          var iter = SetIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v ) {return set.add(v)});\n        });\n    }\n\n    Set.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    Set.fromKeys = function(value) {\n      return this(KeyedIterable(value).keySeq());\n    };\n\n    Set.prototype.toString = function() {\n      return this.__toString('Set {', '}');\n    };\n\n    // @pragma Access\n\n    Set.prototype.has = function(value) {\n      return this._map.has(value);\n    };\n\n    // @pragma Modification\n\n    Set.prototype.add = function(value) {\n      return updateSet(this, this._map.set(value, true));\n    };\n\n    Set.prototype.remove = function(value) {\n      return updateSet(this, this._map.remove(value));\n    };\n\n    Set.prototype.clear = function() {\n      return updateSet(this, this._map.clear());\n    };\n\n    // @pragma Composition\n\n    Set.prototype.union = function() {var iters = SLICE$0.call(arguments, 0);\n      iters = iters.filter(function(x ) {return x.size !== 0});\n      if (iters.length === 0) {\n        return this;\n      }\n      if (this.size === 0 && !this.__ownerID && iters.length === 1) {\n        return this.constructor(iters[0]);\n      }\n      return this.withMutations(function(set ) {\n        for (var ii = 0; ii < iters.length; ii++) {\n          SetIterable(iters[ii]).forEach(function(value ) {return set.add(value)});\n        }\n      });\n    };\n\n    Set.prototype.intersect = function() {var iters = SLICE$0.call(arguments, 0);\n      if (iters.length === 0) {\n        return this;\n      }\n      iters = iters.map(function(iter ) {return SetIterable(iter)});\n      var originalSet = this;\n      return this.withMutations(function(set ) {\n        originalSet.forEach(function(value ) {\n          if (!iters.every(function(iter ) {return iter.includes(value)})) {\n            set.remove(value);\n          }\n        });\n      });\n    };\n\n    Set.prototype.subtract = function() {var iters = SLICE$0.call(arguments, 0);\n      if (iters.length === 0) {\n        return this;\n      }\n      iters = iters.map(function(iter ) {return SetIterable(iter)});\n      var originalSet = this;\n      return this.withMutations(function(set ) {\n        originalSet.forEach(function(value ) {\n          if (iters.some(function(iter ) {return iter.includes(value)})) {\n            set.remove(value);\n          }\n        });\n      });\n    };\n\n    Set.prototype.merge = function() {\n      return this.union.apply(this, arguments);\n    };\n\n    Set.prototype.mergeWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return this.union.apply(this, iters);\n    };\n\n    Set.prototype.sort = function(comparator) {\n      // Late binding\n      return OrderedSet(sortFactory(this, comparator));\n    };\n\n    Set.prototype.sortBy = function(mapper, comparator) {\n      // Late binding\n      return OrderedSet(sortFactory(this, comparator, mapper));\n    };\n\n    Set.prototype.wasAltered = function() {\n      return this._map.wasAltered();\n    };\n\n    Set.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._map.__iterate(function(_, k)  {return fn(k, k, this$0)}, reverse);\n    };\n\n    Set.prototype.__iterator = function(type, reverse) {\n      return this._map.map(function(_, k)  {return k}).__iterator(type, reverse);\n    };\n\n    Set.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      var newMap = this._map.__ensureOwner(ownerID);\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this._map = newMap;\n        return this;\n      }\n      return this.__make(newMap, ownerID);\n    };\n\n\n  function isSet(maybeSet) {\n    return !!(maybeSet && maybeSet[IS_SET_SENTINEL]);\n  }\n\n  Set.isSet = isSet;\n\n  var IS_SET_SENTINEL = '@@__IMMUTABLE_SET__@@';\n\n  var SetPrototype = Set.prototype;\n  SetPrototype[IS_SET_SENTINEL] = true;\n  SetPrototype[DELETE] = SetPrototype.remove;\n  SetPrototype.mergeDeep = SetPrototype.merge;\n  SetPrototype.mergeDeepWith = SetPrototype.mergeWith;\n  SetPrototype.withMutations = MapPrototype.withMutations;\n  SetPrototype.asMutable = MapPrototype.asMutable;\n  SetPrototype.asImmutable = MapPrototype.asImmutable;\n\n  SetPrototype.__empty = emptySet;\n  SetPrototype.__make = makeSet;\n\n  function updateSet(set, newMap) {\n    if (set.__ownerID) {\n      set.size = newMap.size;\n      set._map = newMap;\n      return set;\n    }\n    return newMap === set._map ? set :\n      newMap.size === 0 ? set.__empty() :\n      set.__make(newMap);\n  }\n\n  function makeSet(map, ownerID) {\n    var set = Object.create(SetPrototype);\n    set.size = map ? map.size : 0;\n    set._map = map;\n    set.__ownerID = ownerID;\n    return set;\n  }\n\n  var EMPTY_SET;\n  function emptySet() {\n    return EMPTY_SET || (EMPTY_SET = makeSet(emptyMap()));\n  }\n\n  createClass(OrderedSet, Set);\n\n    // @pragma Construction\n\n    function OrderedSet(value) {\n      return value === null || value === undefined ? emptyOrderedSet() :\n        isOrderedSet(value) ? value :\n        emptyOrderedSet().withMutations(function(set ) {\n          var iter = SetIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v ) {return set.add(v)});\n        });\n    }\n\n    OrderedSet.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    OrderedSet.fromKeys = function(value) {\n      return this(KeyedIterable(value).keySeq());\n    };\n\n    OrderedSet.prototype.toString = function() {\n      return this.__toString('OrderedSet {', '}');\n    };\n\n\n  function isOrderedSet(maybeOrderedSet) {\n    return isSet(maybeOrderedSet) && isOrdered(maybeOrderedSet);\n  }\n\n  OrderedSet.isOrderedSet = isOrderedSet;\n\n  var OrderedSetPrototype = OrderedSet.prototype;\n  OrderedSetPrototype[IS_ORDERED_SENTINEL] = true;\n\n  OrderedSetPrototype.__empty = emptyOrderedSet;\n  OrderedSetPrototype.__make = makeOrderedSet;\n\n  function makeOrderedSet(map, ownerID) {\n    var set = Object.create(OrderedSetPrototype);\n    set.size = map ? map.size : 0;\n    set._map = map;\n    set.__ownerID = ownerID;\n    return set;\n  }\n\n  var EMPTY_ORDERED_SET;\n  function emptyOrderedSet() {\n    return EMPTY_ORDERED_SET || (EMPTY_ORDERED_SET = makeOrderedSet(emptyOrderedMap()));\n  }\n\n  createClass(Stack, IndexedCollection);\n\n    // @pragma Construction\n\n    function Stack(value) {\n      return value === null || value === undefined ? emptyStack() :\n        isStack(value) ? value :\n        emptyStack().unshiftAll(value);\n    }\n\n    Stack.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    Stack.prototype.toString = function() {\n      return this.__toString('Stack [', ']');\n    };\n\n    // @pragma Access\n\n    Stack.prototype.get = function(index, notSetValue) {\n      var head = this._head;\n      index = wrapIndex(this, index);\n      while (head && index--) {\n        head = head.next;\n      }\n      return head ? head.value : notSetValue;\n    };\n\n    Stack.prototype.peek = function() {\n      return this._head && this._head.value;\n    };\n\n    // @pragma Modification\n\n    Stack.prototype.push = function(/*...values*/) {\n      if (arguments.length === 0) {\n        return this;\n      }\n      var newSize = this.size + arguments.length;\n      var head = this._head;\n      for (var ii = arguments.length - 1; ii >= 0; ii--) {\n        head = {\n          value: arguments[ii],\n          next: head\n        };\n      }\n      if (this.__ownerID) {\n        this.size = newSize;\n        this._head = head;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return makeStack(newSize, head);\n    };\n\n    Stack.prototype.pushAll = function(iter) {\n      iter = IndexedIterable(iter);\n      if (iter.size === 0) {\n        return this;\n      }\n      assertNotInfinite(iter.size);\n      var newSize = this.size;\n      var head = this._head;\n      iter.reverse().forEach(function(value ) {\n        newSize++;\n        head = {\n          value: value,\n          next: head\n        };\n      });\n      if (this.__ownerID) {\n        this.size = newSize;\n        this._head = head;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return makeStack(newSize, head);\n    };\n\n    Stack.prototype.pop = function() {\n      return this.slice(1);\n    };\n\n    Stack.prototype.unshift = function(/*...values*/) {\n      return this.push.apply(this, arguments);\n    };\n\n    Stack.prototype.unshiftAll = function(iter) {\n      return this.pushAll(iter);\n    };\n\n    Stack.prototype.shift = function() {\n      return this.pop.apply(this, arguments);\n    };\n\n    Stack.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = 0;\n        this._head = undefined;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return emptyStack();\n    };\n\n    Stack.prototype.slice = function(begin, end) {\n      if (wholeSlice(begin, end, this.size)) {\n        return this;\n      }\n      var resolvedBegin = resolveBegin(begin, this.size);\n      var resolvedEnd = resolveEnd(end, this.size);\n      if (resolvedEnd !== this.size) {\n        // super.slice(begin, end);\n        return IndexedCollection.prototype.slice.call(this, begin, end);\n      }\n      var newSize = this.size - resolvedBegin;\n      var head = this._head;\n      while (resolvedBegin--) {\n        head = head.next;\n      }\n      if (this.__ownerID) {\n        this.size = newSize;\n        this._head = head;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return makeStack(newSize, head);\n    };\n\n    // @pragma Mutability\n\n    Stack.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this.__altered = false;\n        return this;\n      }\n      return makeStack(this.size, this._head, ownerID, this.__hash);\n    };\n\n    // @pragma Iteration\n\n    Stack.prototype.__iterate = function(fn, reverse) {\n      if (reverse) {\n        return this.reverse().__iterate(fn);\n      }\n      var iterations = 0;\n      var node = this._head;\n      while (node) {\n        if (fn(node.value, iterations++, this) === false) {\n          break;\n        }\n        node = node.next;\n      }\n      return iterations;\n    };\n\n    Stack.prototype.__iterator = function(type, reverse) {\n      if (reverse) {\n        return this.reverse().__iterator(type);\n      }\n      var iterations = 0;\n      var node = this._head;\n      return new Iterator(function()  {\n        if (node) {\n          var value = node.value;\n          node = node.next;\n          return iteratorValue(type, iterations++, value);\n        }\n        return iteratorDone();\n      });\n    };\n\n\n  function isStack(maybeStack) {\n    return !!(maybeStack && maybeStack[IS_STACK_SENTINEL]);\n  }\n\n  Stack.isStack = isStack;\n\n  var IS_STACK_SENTINEL = '@@__IMMUTABLE_STACK__@@';\n\n  var StackPrototype = Stack.prototype;\n  StackPrototype[IS_STACK_SENTINEL] = true;\n  StackPrototype.withMutations = MapPrototype.withMutations;\n  StackPrototype.asMutable = MapPrototype.asMutable;\n  StackPrototype.asImmutable = MapPrototype.asImmutable;\n  StackPrototype.wasAltered = MapPrototype.wasAltered;\n\n\n  function makeStack(size, head, ownerID, hash) {\n    var map = Object.create(StackPrototype);\n    map.size = size;\n    map._head = head;\n    map.__ownerID = ownerID;\n    map.__hash = hash;\n    map.__altered = false;\n    return map;\n  }\n\n  var EMPTY_STACK;\n  function emptyStack() {\n    return EMPTY_STACK || (EMPTY_STACK = makeStack(0));\n  }\n\n  /**\n   * Contributes additional methods to a constructor\n   */\n  function mixin(ctor, methods) {\n    var keyCopier = function(key ) { ctor.prototype[key] = methods[key]; };\n    Object.keys(methods).forEach(keyCopier);\n    Object.getOwnPropertySymbols &&\n      Object.getOwnPropertySymbols(methods).forEach(keyCopier);\n    return ctor;\n  }\n\n  Iterable.Iterator = Iterator;\n\n  mixin(Iterable, {\n\n    // ### Conversion to other types\n\n    toArray: function() {\n      assertNotInfinite(this.size);\n      var array = new Array(this.size || 0);\n      this.valueSeq().__iterate(function(v, i)  { array[i] = v; });\n      return array;\n    },\n\n    toIndexedSeq: function() {\n      return new ToIndexedSequence(this);\n    },\n\n    toJS: function() {\n      return this.toSeq().map(\n        function(value ) {return value && typeof value.toJS === 'function' ? value.toJS() : value}\n      ).__toJS();\n    },\n\n    toJSON: function() {\n      return this.toSeq().map(\n        function(value ) {return value && typeof value.toJSON === 'function' ? value.toJSON() : value}\n      ).__toJS();\n    },\n\n    toKeyedSeq: function() {\n      return new ToKeyedSequence(this, true);\n    },\n\n    toMap: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return Map(this.toKeyedSeq());\n    },\n\n    toObject: function() {\n      assertNotInfinite(this.size);\n      var object = {};\n      this.__iterate(function(v, k)  { object[k] = v; });\n      return object;\n    },\n\n    toOrderedMap: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return OrderedMap(this.toKeyedSeq());\n    },\n\n    toOrderedSet: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return OrderedSet(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n    toSet: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return Set(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n    toSetSeq: function() {\n      return new ToSetSequence(this);\n    },\n\n    toSeq: function() {\n      return isIndexed(this) ? this.toIndexedSeq() :\n        isKeyed(this) ? this.toKeyedSeq() :\n        this.toSetSeq();\n    },\n\n    toStack: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return Stack(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n    toList: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return List(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n\n    // ### Common JavaScript methods and properties\n\n    toString: function() {\n      return '[Iterable]';\n    },\n\n    __toString: function(head, tail) {\n      if (this.size === 0) {\n        return head + tail;\n      }\n      return head + ' ' + this.toSeq().map(this.__toStringMapper).join(', ') + ' ' + tail;\n    },\n\n\n    // ### ES6 Collection methods (ES6 Array and Map)\n\n    concat: function() {var values = SLICE$0.call(arguments, 0);\n      return reify(this, concatFactory(this, values));\n    },\n\n    includes: function(searchValue) {\n      return this.some(function(value ) {return is(value, searchValue)});\n    },\n\n    entries: function() {\n      return this.__iterator(ITERATE_ENTRIES);\n    },\n\n    every: function(predicate, context) {\n      assertNotInfinite(this.size);\n      var returnValue = true;\n      this.__iterate(function(v, k, c)  {\n        if (!predicate.call(context, v, k, c)) {\n          returnValue = false;\n          return false;\n        }\n      });\n      return returnValue;\n    },\n\n    filter: function(predicate, context) {\n      return reify(this, filterFactory(this, predicate, context, true));\n    },\n\n    find: function(predicate, context, notSetValue) {\n      var entry = this.findEntry(predicate, context);\n      return entry ? entry[1] : notSetValue;\n    },\n\n    findEntry: function(predicate, context) {\n      var found;\n      this.__iterate(function(v, k, c)  {\n        if (predicate.call(context, v, k, c)) {\n          found = [k, v];\n          return false;\n        }\n      });\n      return found;\n    },\n\n    findLastEntry: function(predicate, context) {\n      return this.toSeq().reverse().findEntry(predicate, context);\n    },\n\n    forEach: function(sideEffect, context) {\n      assertNotInfinite(this.size);\n      return this.__iterate(context ? sideEffect.bind(context) : sideEffect);\n    },\n\n    join: function(separator) {\n      assertNotInfinite(this.size);\n      separator = separator !== undefined ? '' + separator : ',';\n      var joined = '';\n      var isFirst = true;\n      this.__iterate(function(v ) {\n        isFirst ? (isFirst = false) : (joined += separator);\n        joined += v !== null && v !== undefined ? v.toString() : '';\n      });\n      return joined;\n    },\n\n    keys: function() {\n      return this.__iterator(ITERATE_KEYS);\n    },\n\n    map: function(mapper, context) {\n      return reify(this, mapFactory(this, mapper, context));\n    },\n\n    reduce: function(reducer, initialReduction, context) {\n      assertNotInfinite(this.size);\n      var reduction;\n      var useFirst;\n      if (arguments.length < 2) {\n        useFirst = true;\n      } else {\n        reduction = initialReduction;\n      }\n      this.__iterate(function(v, k, c)  {\n        if (useFirst) {\n          useFirst = false;\n          reduction = v;\n        } else {\n          reduction = reducer.call(context, reduction, v, k, c);\n        }\n      });\n      return reduction;\n    },\n\n    reduceRight: function(reducer, initialReduction, context) {\n      var reversed = this.toKeyedSeq().reverse();\n      return reversed.reduce.apply(reversed, arguments);\n    },\n\n    reverse: function() {\n      return reify(this, reverseFactory(this, true));\n    },\n\n    slice: function(begin, end) {\n      return reify(this, sliceFactory(this, begin, end, true));\n    },\n\n    some: function(predicate, context) {\n      return !this.every(not(predicate), context);\n    },\n\n    sort: function(comparator) {\n      return reify(this, sortFactory(this, comparator));\n    },\n\n    values: function() {\n      return this.__iterator(ITERATE_VALUES);\n    },\n\n\n    // ### More sequential methods\n\n    butLast: function() {\n      return this.slice(0, -1);\n    },\n\n    isEmpty: function() {\n      return this.size !== undefined ? this.size === 0 : !this.some(function()  {return true});\n    },\n\n    count: function(predicate, context) {\n      return ensureSize(\n        predicate ? this.toSeq().filter(predicate, context) : this\n      );\n    },\n\n    countBy: function(grouper, context) {\n      return countByFactory(this, grouper, context);\n    },\n\n    equals: function(other) {\n      return deepEqual(this, other);\n    },\n\n    entrySeq: function() {\n      var iterable = this;\n      if (iterable._cache) {\n        // We cache as an entries array, so we can just return the cache!\n        return new ArraySeq(iterable._cache);\n      }\n      var entriesSequence = iterable.toSeq().map(entryMapper).toIndexedSeq();\n      entriesSequence.fromEntrySeq = function()  {return iterable.toSeq()};\n      return entriesSequence;\n    },\n\n    filterNot: function(predicate, context) {\n      return this.filter(not(predicate), context);\n    },\n\n    findLast: function(predicate, context, notSetValue) {\n      return this.toKeyedSeq().reverse().find(predicate, context, notSetValue);\n    },\n\n    first: function() {\n      return this.find(returnTrue);\n    },\n\n    flatMap: function(mapper, context) {\n      return reify(this, flatMapFactory(this, mapper, context));\n    },\n\n    flatten: function(depth) {\n      return reify(this, flattenFactory(this, depth, true));\n    },\n\n    fromEntrySeq: function() {\n      return new FromEntriesSequence(this);\n    },\n\n    get: function(searchKey, notSetValue) {\n      return this.find(function(_, key)  {return is(key, searchKey)}, undefined, notSetValue);\n    },\n\n    getIn: function(searchKeyPath, notSetValue) {\n      var nested = this;\n      // Note: in an ES6 environment, we would prefer:\n      // for (var key of searchKeyPath) {\n      var iter = forceIterator(searchKeyPath);\n      var step;\n      while (!(step = iter.next()).done) {\n        var key = step.value;\n        nested = nested && nested.get ? nested.get(key, NOT_SET) : NOT_SET;\n        if (nested === NOT_SET) {\n          return notSetValue;\n        }\n      }\n      return nested;\n    },\n\n    groupBy: function(grouper, context) {\n      return groupByFactory(this, grouper, context);\n    },\n\n    has: function(searchKey) {\n      return this.get(searchKey, NOT_SET) !== NOT_SET;\n    },\n\n    hasIn: function(searchKeyPath) {\n      return this.getIn(searchKeyPath, NOT_SET) !== NOT_SET;\n    },\n\n    isSubset: function(iter) {\n      iter = typeof iter.includes === 'function' ? iter : Iterable(iter);\n      return this.every(function(value ) {return iter.includes(value)});\n    },\n\n    isSuperset: function(iter) {\n      iter = typeof iter.isSubset === 'function' ? iter : Iterable(iter);\n      return iter.isSubset(this);\n    },\n\n    keySeq: function() {\n      return this.toSeq().map(keyMapper).toIndexedSeq();\n    },\n\n    last: function() {\n      return this.toSeq().reverse().first();\n    },\n\n    max: function(comparator) {\n      return maxFactory(this, comparator);\n    },\n\n    maxBy: function(mapper, comparator) {\n      return maxFactory(this, comparator, mapper);\n    },\n\n    min: function(comparator) {\n      return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator);\n    },\n\n    minBy: function(mapper, comparator) {\n      return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator, mapper);\n    },\n\n    rest: function() {\n      return this.slice(1);\n    },\n\n    skip: function(amount) {\n      return this.slice(Math.max(0, amount));\n    },\n\n    skipLast: function(amount) {\n      return reify(this, this.toSeq().reverse().skip(amount).reverse());\n    },\n\n    skipWhile: function(predicate, context) {\n      return reify(this, skipWhileFactory(this, predicate, context, true));\n    },\n\n    skipUntil: function(predicate, context) {\n      return this.skipWhile(not(predicate), context);\n    },\n\n    sortBy: function(mapper, comparator) {\n      return reify(this, sortFactory(this, comparator, mapper));\n    },\n\n    take: function(amount) {\n      return this.slice(0, Math.max(0, amount));\n    },\n\n    takeLast: function(amount) {\n      return reify(this, this.toSeq().reverse().take(amount).reverse());\n    },\n\n    takeWhile: function(predicate, context) {\n      return reify(this, takeWhileFactory(this, predicate, context));\n    },\n\n    takeUntil: function(predicate, context) {\n      return this.takeWhile(not(predicate), context);\n    },\n\n    valueSeq: function() {\n      return this.toIndexedSeq();\n    },\n\n\n    // ### Hashable Object\n\n    hashCode: function() {\n      return this.__hash || (this.__hash = hashIterable(this));\n    }\n\n\n    // ### Internal\n\n    // abstract __iterate(fn, reverse)\n\n    // abstract __iterator(type, reverse)\n  });\n\n  // var IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\n  // var IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\n  // var IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\n  // var IS_ORDERED_SENTINEL = '@@__IMMUTABLE_ORDERED__@@';\n\n  var IterablePrototype = Iterable.prototype;\n  IterablePrototype[IS_ITERABLE_SENTINEL] = true;\n  IterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.values;\n  IterablePrototype.__toJS = IterablePrototype.toArray;\n  IterablePrototype.__toStringMapper = quoteString;\n  IterablePrototype.inspect =\n  IterablePrototype.toSource = function() { return this.toString(); };\n  IterablePrototype.chain = IterablePrototype.flatMap;\n  IterablePrototype.contains = IterablePrototype.includes;\n\n  // Temporary warning about using length\n  (function () {\n    try {\n      Object.defineProperty(IterablePrototype, 'length', {\n        get: function () {\n          if (!Iterable.noLengthWarning) {\n            var stack;\n            try {\n              throw new Error();\n            } catch (error) {\n              stack = error.stack;\n            }\n            if (stack.indexOf('_wrapObject') === -1) {\n              console && console.warn && console.warn(\n                'iterable.length has been deprecated, '+\n                'use iterable.size or iterable.count(). '+\n                'This warning will become a silent error in a future version. ' +\n                stack\n              );\n              return this.size;\n            }\n          }\n        }\n      });\n    } catch (e) {}\n  })();\n\n\n\n  mixin(KeyedIterable, {\n\n    // ### More sequential methods\n\n    flip: function() {\n      return reify(this, flipFactory(this));\n    },\n\n    findKey: function(predicate, context) {\n      var entry = this.findEntry(predicate, context);\n      return entry && entry[0];\n    },\n\n    findLastKey: function(predicate, context) {\n      return this.toSeq().reverse().findKey(predicate, context);\n    },\n\n    keyOf: function(searchValue) {\n      return this.findKey(function(value ) {return is(value, searchValue)});\n    },\n\n    lastKeyOf: function(searchValue) {\n      return this.findLastKey(function(value ) {return is(value, searchValue)});\n    },\n\n    mapEntries: function(mapper, context) {var this$0 = this;\n      var iterations = 0;\n      return reify(this,\n        this.toSeq().map(\n          function(v, k)  {return mapper.call(context, [k, v], iterations++, this$0)}\n        ).fromEntrySeq()\n      );\n    },\n\n    mapKeys: function(mapper, context) {var this$0 = this;\n      return reify(this,\n        this.toSeq().flip().map(\n          function(k, v)  {return mapper.call(context, k, v, this$0)}\n        ).flip()\n      );\n    }\n\n  });\n\n  var KeyedIterablePrototype = KeyedIterable.prototype;\n  KeyedIterablePrototype[IS_KEYED_SENTINEL] = true;\n  KeyedIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.entries;\n  KeyedIterablePrototype.__toJS = IterablePrototype.toObject;\n  KeyedIterablePrototype.__toStringMapper = function(v, k)  {return JSON.stringify(k) + ': ' + quoteString(v)};\n\n\n\n  mixin(IndexedIterable, {\n\n    // ### Conversion to other types\n\n    toKeyedSeq: function() {\n      return new ToKeyedSequence(this, false);\n    },\n\n\n    // ### ES6 Collection methods (ES6 Array and Map)\n\n    filter: function(predicate, context) {\n      return reify(this, filterFactory(this, predicate, context, false));\n    },\n\n    findIndex: function(predicate, context) {\n      var entry = this.findEntry(predicate, context);\n      return entry ? entry[0] : -1;\n    },\n\n    indexOf: function(searchValue) {\n      var key = this.toKeyedSeq().keyOf(searchValue);\n      return key === undefined ? -1 : key;\n    },\n\n    lastIndexOf: function(searchValue) {\n      var key = this.toKeyedSeq().reverse().keyOf(searchValue);\n      return key === undefined ? -1 : key;\n\n      // var index =\n      // return this.toSeq().reverse().indexOf(searchValue);\n    },\n\n    reverse: function() {\n      return reify(this, reverseFactory(this, false));\n    },\n\n    slice: function(begin, end) {\n      return reify(this, sliceFactory(this, begin, end, false));\n    },\n\n    splice: function(index, removeNum /*, ...values*/) {\n      var numArgs = arguments.length;\n      removeNum = Math.max(removeNum | 0, 0);\n      if (numArgs === 0 || (numArgs === 2 && !removeNum)) {\n        return this;\n      }\n      // If index is negative, it should resolve relative to the size of the\n      // collection. However size may be expensive to compute if not cached, so\n      // only call count() if the number is in fact negative.\n      index = resolveBegin(index, index < 0 ? this.count() : this.size);\n      var spliced = this.slice(0, index);\n      return reify(\n        this,\n        numArgs === 1 ?\n          spliced :\n          spliced.concat(arrCopy(arguments, 2), this.slice(index + removeNum))\n      );\n    },\n\n\n    // ### More collection methods\n\n    findLastIndex: function(predicate, context) {\n      var key = this.toKeyedSeq().findLastKey(predicate, context);\n      return key === undefined ? -1 : key;\n    },\n\n    first: function() {\n      return this.get(0);\n    },\n\n    flatten: function(depth) {\n      return reify(this, flattenFactory(this, depth, false));\n    },\n\n    get: function(index, notSetValue) {\n      index = wrapIndex(this, index);\n      return (index < 0 || (this.size === Infinity ||\n          (this.size !== undefined && index > this.size))) ?\n        notSetValue :\n        this.find(function(_, key)  {return key === index}, undefined, notSetValue);\n    },\n\n    has: function(index) {\n      index = wrapIndex(this, index);\n      return index >= 0 && (this.size !== undefined ?\n        this.size === Infinity || index < this.size :\n        this.indexOf(index) !== -1\n      );\n    },\n\n    interpose: function(separator) {\n      return reify(this, interposeFactory(this, separator));\n    },\n\n    interleave: function(/*...iterables*/) {\n      var iterables = [this].concat(arrCopy(arguments));\n      var zipped = zipWithFactory(this.toSeq(), IndexedSeq.of, iterables);\n      var interleaved = zipped.flatten(true);\n      if (zipped.size) {\n        interleaved.size = zipped.size * iterables.length;\n      }\n      return reify(this, interleaved);\n    },\n\n    last: function() {\n      return this.get(-1);\n    },\n\n    skipWhile: function(predicate, context) {\n      return reify(this, skipWhileFactory(this, predicate, context, false));\n    },\n\n    zip: function(/*, ...iterables */) {\n      var iterables = [this].concat(arrCopy(arguments));\n      return reify(this, zipWithFactory(this, defaultZipper, iterables));\n    },\n\n    zipWith: function(zipper/*, ...iterables */) {\n      var iterables = arrCopy(arguments);\n      iterables[0] = this;\n      return reify(this, zipWithFactory(this, zipper, iterables));\n    }\n\n  });\n\n  IndexedIterable.prototype[IS_INDEXED_SENTINEL] = true;\n  IndexedIterable.prototype[IS_ORDERED_SENTINEL] = true;\n\n\n\n  mixin(SetIterable, {\n\n    // ### ES6 Collection methods (ES6 Array and Map)\n\n    get: function(value, notSetValue) {\n      return this.has(value) ? value : notSetValue;\n    },\n\n    includes: function(value) {\n      return this.has(value);\n    },\n\n\n    // ### More sequential methods\n\n    keySeq: function() {\n      return this.valueSeq();\n    }\n\n  });\n\n  SetIterable.prototype.has = IterablePrototype.includes;\n\n\n  // Mixin subclasses\n\n  mixin(KeyedSeq, KeyedIterable.prototype);\n  mixin(IndexedSeq, IndexedIterable.prototype);\n  mixin(SetSeq, SetIterable.prototype);\n\n  mixin(KeyedCollection, KeyedIterable.prototype);\n  mixin(IndexedCollection, IndexedIterable.prototype);\n  mixin(SetCollection, SetIterable.prototype);\n\n\n  // #pragma Helper functions\n\n  function keyMapper(v, k) {\n    return k;\n  }\n\n  function entryMapper(v, k) {\n    return [k, v];\n  }\n\n  function not(predicate) {\n    return function() {\n      return !predicate.apply(this, arguments);\n    }\n  }\n\n  function neg(predicate) {\n    return function() {\n      return -predicate.apply(this, arguments);\n    }\n  }\n\n  function quoteString(value) {\n    return typeof value === 'string' ? JSON.stringify(value) : value;\n  }\n\n  function defaultZipper() {\n    return arrCopy(arguments);\n  }\n\n  function defaultNegComparator(a, b) {\n    return a < b ? 1 : a > b ? -1 : 0;\n  }\n\n  function hashIterable(iterable) {\n    if (iterable.size === Infinity) {\n      return 0;\n    }\n    var ordered = isOrdered(iterable);\n    var keyed = isKeyed(iterable);\n    var h = ordered ? 1 : 0;\n    var size = iterable.__iterate(\n      keyed ?\n        ordered ?\n          function(v, k)  { h = 31 * h + hashMerge(hash(v), hash(k)) | 0; } :\n          function(v, k)  { h = h + hashMerge(hash(v), hash(k)) | 0; } :\n        ordered ?\n          function(v ) { h = 31 * h + hash(v) | 0; } :\n          function(v ) { h = h + hash(v) | 0; }\n    );\n    return murmurHashOfSize(size, h);\n  }\n\n  function murmurHashOfSize(size, h) {\n    h = imul(h, 0xCC9E2D51);\n    h = imul(h << 15 | h >>> -15, 0x1B873593);\n    h = imul(h << 13 | h >>> -13, 5);\n    h = (h + 0xE6546B64 | 0) ^ size;\n    h = imul(h ^ h >>> 16, 0x85EBCA6B);\n    h = imul(h ^ h >>> 13, 0xC2B2AE35);\n    h = smi(h ^ h >>> 16);\n    return h;\n  }\n\n  function hashMerge(a, b) {\n    return a ^ b + 0x9E3779B9 + (a << 6) + (a >> 2) | 0; // int\n  }\n\n  var Immutable = {\n\n    Iterable: Iterable,\n\n    Seq: Seq,\n    Collection: Collection,\n    Map: Map,\n    OrderedMap: OrderedMap,\n    List: List,\n    Stack: Stack,\n    Set: Set,\n    OrderedSet: OrderedSet,\n\n    Record: Record,\n    Range: Range,\n    Repeat: Repeat,\n\n    is: is,\n    fromJS: fromJS\n\n  };\n\n  return Immutable;\n\n}));","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\nvar PhotosMimeType = require(\"./PhotosMimeType\");\n\nvar createArrayFromMixed = require(\"./createArrayFromMixed\");\n\nvar emptyFunction = require(\"./emptyFunction\");\n\nvar CR_LF_REGEX = new RegExp(\"\\r\\n\", 'g');\nvar LF_ONLY = \"\\n\";\nvar RICH_TEXT_TYPES = {\n  'text/rtf': 1,\n  'text/html': 1\n};\n/**\n * If DataTransferItem is a file then return the Blob of data.\n *\n * @param {object} item\n * @return {?blob}\n */\n\nfunction getFileFromDataTransfer(item) {\n  if (item.kind == 'file') {\n    return item.getAsFile();\n  }\n}\n\nvar DataTransfer =\n/*#__PURE__*/\nfunction () {\n  /**\n   * @param {object} data\n   */\n  function DataTransfer(data) {\n    this.data = data; // Types could be DOMStringList or array\n\n    this.types = data.types ? createArrayFromMixed(data.types) : [];\n  }\n  /**\n   * Is this likely to be a rich text data transfer?\n   *\n   * @return {boolean}\n   */\n\n\n  var _proto = DataTransfer.prototype;\n\n  _proto.isRichText = function isRichText() {\n    // If HTML is available, treat this data as rich text. This way, we avoid\n    // using a pasted image if it is packaged with HTML -- this may occur with\n    // pastes from MS Word, for example.  However this is only rich text if\n    // there's accompanying text.\n    if (this.getHTML() && this.getText()) {\n      return true;\n    } // When an image is copied from a preview window, you end up with two\n    // DataTransferItems one of which is a file's metadata as text.  Skip those.\n\n\n    if (this.isImage()) {\n      return false;\n    }\n\n    return this.types.some(function (type) {\n      return RICH_TEXT_TYPES[type];\n    });\n  };\n  /**\n   * Get raw text.\n   *\n   * @return {?string}\n   */\n\n\n  _proto.getText = function getText() {\n    var text;\n\n    if (this.data.getData) {\n      if (!this.types.length) {\n        text = this.data.getData('Text');\n      } else if (this.types.indexOf('text/plain') != -1) {\n        text = this.data.getData('text/plain');\n      }\n    }\n\n    return text ? text.replace(CR_LF_REGEX, LF_ONLY) : null;\n  };\n  /**\n   * Get HTML paste data\n   *\n   * @return {?string}\n   */\n\n\n  _proto.getHTML = function getHTML() {\n    if (this.data.getData) {\n      if (!this.types.length) {\n        return this.data.getData('Text');\n      } else if (this.types.indexOf('text/html') != -1) {\n        return this.data.getData('text/html');\n      }\n    }\n  };\n  /**\n   * Is this a link data transfer?\n   *\n   * @return {boolean}\n   */\n\n\n  _proto.isLink = function isLink() {\n    return this.types.some(function (type) {\n      return type.indexOf('Url') != -1 || type.indexOf('text/uri-list') != -1 || type.indexOf('text/x-moz-url');\n    });\n  };\n  /**\n   * Get a link url.\n   *\n   * @return {?string}\n   */\n\n\n  _proto.getLink = function getLink() {\n    if (this.data.getData) {\n      if (this.types.indexOf('text/x-moz-url') != -1) {\n        var url = this.data.getData('text/x-moz-url').split('\\n');\n        return url[0];\n      }\n\n      return this.types.indexOf('text/uri-list') != -1 ? this.data.getData('text/uri-list') : this.data.getData('url');\n    }\n\n    return null;\n  };\n  /**\n   * Is this an image data transfer?\n   *\n   * @return {boolean}\n   */\n\n\n  _proto.isImage = function isImage() {\n    var isImage = this.types.some(function (type) {\n      // Firefox will have a type of application/x-moz-file for images during\n      // dragging\n      return type.indexOf('application/x-moz-file') != -1;\n    });\n\n    if (isImage) {\n      return true;\n    }\n\n    var items = this.getFiles();\n\n    for (var i = 0; i < items.length; i++) {\n      var type = items[i].type;\n\n      if (!PhotosMimeType.isImage(type)) {\n        return false;\n      }\n    }\n\n    return true;\n  };\n\n  _proto.getCount = function getCount() {\n    if (this.data.hasOwnProperty('items')) {\n      return this.data.items.length;\n    } else if (this.data.hasOwnProperty('mozItemCount')) {\n      return this.data.mozItemCount;\n    } else if (this.data.files) {\n      return this.data.files.length;\n    }\n\n    return null;\n  };\n  /**\n   * Get files.\n   *\n   * @return {array}\n   */\n\n\n  _proto.getFiles = function getFiles() {\n    if (this.data.items) {\n      // createArrayFromMixed doesn't properly handle DataTransferItemLists.\n      return Array.prototype.slice.call(this.data.items).map(getFileFromDataTransfer).filter(emptyFunction.thatReturnsArgument);\n    } else if (this.data.files) {\n      return Array.prototype.slice.call(this.data.files);\n    } else {\n      return [];\n    }\n  };\n  /**\n   * Are there any files to fetch?\n   *\n   * @return {boolean}\n   */\n\n\n  _proto.hasFiles = function hasFiles() {\n    return this.getFiles().length > 0;\n  };\n\n  return DataTransfer;\n}();\n\nmodule.exports = DataTransfer;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\nmodule.exports = {\n  BACKSPACE: 8,\n  TAB: 9,\n  RETURN: 13,\n  ALT: 18,\n  ESC: 27,\n  SPACE: 32,\n  PAGE_UP: 33,\n  PAGE_DOWN: 34,\n  END: 35,\n  HOME: 36,\n  LEFT: 37,\n  UP: 38,\n  RIGHT: 39,\n  DOWN: 40,\n  DELETE: 46,\n  COMMA: 188,\n  PERIOD: 190,\n  A: 65,\n  Z: 90,\n  ZERO: 48,\n  NUMPAD_0: 96,\n  NUMPAD_9: 105\n};","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\nvar PhotosMimeType = {\n  isImage: function isImage(mimeString) {\n    return getParts(mimeString)[0] === 'image';\n  },\n  isJpeg: function isJpeg(mimeString) {\n    var parts = getParts(mimeString);\n    return PhotosMimeType.isImage(mimeString) && ( // see http://fburl.com/10972194\n    parts[1] === 'jpeg' || parts[1] === 'pjpeg');\n  }\n};\n\nfunction getParts(mimeString) {\n  return mimeString.split('/');\n}\n\nmodule.exports = PhotosMimeType;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n/**\n * @param {DOMElement} element\n * @param {DOMDocument} doc\n * @return {boolean}\n */\nfunction _isViewportScrollElement(element, doc) {\n  return !!doc && (element === doc.documentElement || element === doc.body);\n}\n/**\n * Scroll Module. This class contains 4 simple static functions\n * to be used to access Element.scrollTop/scrollLeft properties.\n * To solve the inconsistencies between browsers when either\n * document.body or document.documentElement is supplied,\n * below logic will be used to alleviate the issue:\n *\n * 1. If 'element' is either 'document.body' or 'document.documentElement,\n *    get whichever element's 'scroll{Top,Left}' is larger.\n * 2. If 'element' is either 'document.body' or 'document.documentElement',\n *    set the 'scroll{Top,Left}' on both elements.\n */\n\n\nvar Scroll = {\n  /**\n   * @param {DOMElement} element\n   * @return {number}\n   */\n  getTop: function getTop(element) {\n    var doc = element.ownerDocument;\n    return _isViewportScrollElement(element, doc) ? // In practice, they will either both have the same value,\n    // or one will be zero and the other will be the scroll position\n    // of the viewport. So we can use `X || Y` instead of `Math.max(X, Y)`\n    doc.body.scrollTop || doc.documentElement.scrollTop : element.scrollTop;\n  },\n\n  /**\n   * @param {DOMElement} element\n   * @param {number} newTop\n   */\n  setTop: function setTop(element, newTop) {\n    var doc = element.ownerDocument;\n\n    if (_isViewportScrollElement(element, doc)) {\n      doc.body.scrollTop = doc.documentElement.scrollTop = newTop;\n    } else {\n      element.scrollTop = newTop;\n    }\n  },\n\n  /**\n   * @param {DOMElement} element\n   * @return {number}\n   */\n  getLeft: function getLeft(element) {\n    var doc = element.ownerDocument;\n    return _isViewportScrollElement(element, doc) ? doc.body.scrollLeft || doc.documentElement.scrollLeft : element.scrollLeft;\n  },\n\n  /**\n   * @param {DOMElement} element\n   * @param {number} newLeft\n   */\n  setLeft: function setLeft(element, newLeft) {\n    var doc = element.ownerDocument;\n\n    if (_isViewportScrollElement(element, doc)) {\n      doc.body.scrollLeft = doc.documentElement.scrollLeft = newLeft;\n    } else {\n      element.scrollLeft = newLeft;\n    }\n  }\n};\nmodule.exports = Scroll;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\nvar getStyleProperty = require(\"./getStyleProperty\");\n/**\n * @param {DOMNode} element [description]\n * @param {string} name Overflow style property name.\n * @return {boolean} True if the supplied ndoe is scrollable.\n */\n\n\nfunction _isNodeScrollable(element, name) {\n  var overflow = Style.get(element, name);\n  return overflow === 'auto' || overflow === 'scroll';\n}\n/**\n * Utilities for querying and mutating style properties.\n */\n\n\nvar Style = {\n  /**\n   * Gets the style property for the supplied node. This will return either the\n   * computed style, if available, or the declared style.\n   *\n   * @param {DOMNode} node\n   * @param {string} name Style property name.\n   * @return {?string} Style property value.\n   */\n  get: getStyleProperty,\n\n  /**\n   * Determines the nearest ancestor of a node that is scrollable.\n   *\n   * NOTE: This can be expensive if used repeatedly or on a node nested deeply.\n   *\n   * @param {?DOMNode} node Node from which to start searching.\n   * @return {?DOMWindow|DOMElement} Scroll parent of the supplied node.\n   */\n  getScrollParent: function getScrollParent(node) {\n    if (!node) {\n      return null;\n    }\n\n    var ownerDocument = node.ownerDocument;\n\n    while (node && node !== ownerDocument.body) {\n      if (_isNodeScrollable(node, 'overflow') || _isNodeScrollable(node, 'overflowY') || _isNodeScrollable(node, 'overflowX')) {\n        return node;\n      }\n\n      node = node.parentNode;\n    }\n\n    return ownerDocument.defaultView || ownerDocument.parentWindow;\n  }\n};\nmodule.exports = Style;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n * @stub\n * \n */\n'use strict'; // \\u00a1-\\u00b1\\u00b4-\\u00b8\\u00ba\\u00bb\\u00bf\n//             is latin supplement punctuation except fractions and superscript\n//             numbers\n// \\u2010-\\u2027\\u2030-\\u205e\n//             is punctuation from the general punctuation block:\n//             weird quotes, commas, bullets, dashes, etc.\n// \\u30fb\\u3001\\u3002\\u3008-\\u3011\\u3014-\\u301f\n//             is CJK punctuation\n// \\uff1a-\\uff1f\\uff01-\\uff0f\\uff3b-\\uff40\\uff5b-\\uff65\n//             is some full-width/half-width punctuation\n// \\u2E2E\\u061f\\u066a-\\u066c\\u061b\\u060c\\u060d\\uFD3e\\uFD3F\n//             is some Arabic punctuation marks\n// \\u1801\\u0964\\u104a\\u104b\n//             is misc. other language punctuation marks\n\nvar PUNCTUATION = '[.,+*?$|#{}()\\'\\\\^\\\\-\\\\[\\\\]\\\\\\\\\\\\/!@%\"~=<>_:;' + \"\\u30FB\\u3001\\u3002\\u3008-\\u3011\\u3014-\\u301F\\uFF1A-\\uFF1F\\uFF01-\\uFF0F\" + \"\\uFF3B-\\uFF40\\uFF5B-\\uFF65\\u2E2E\\u061F\\u066A-\\u066C\\u061B\\u060C\\u060D\" + \"\\uFD3E\\uFD3F\\u1801\\u0964\\u104A\\u104B\\u2010-\\u2027\\u2030-\\u205E\" + \"\\xA1-\\xB1\\xB4-\\xB8\\xBA\\xBB\\xBF]\";\nmodule.exports = {\n  getPunctuation: function getPunctuation() {\n    return PUNCTUATION;\n  }\n};","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * \n */\n'use strict';\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\nvar URI =\n/*#__PURE__*/\nfunction () {\n  function URI(uri) {\n    _defineProperty(this, \"_uri\", void 0);\n\n    this._uri = uri;\n  }\n\n  var _proto = URI.prototype;\n\n  _proto.toString = function toString() {\n    return this._uri;\n  };\n\n  return URI;\n}();\n\nmodule.exports = URI;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n * \n */\n\n/**\n * Basic (stateless) API for text direction detection\n *\n * Part of our implementation of Unicode Bidirectional Algorithm (UBA)\n * Unicode Standard Annex #9 (UAX9)\n * http://www.unicode.org/reports/tr9/\n */\n'use strict';\n\nvar UnicodeBidiDirection = require(\"./UnicodeBidiDirection\");\n\nvar invariant = require(\"./invariant\");\n\n/**\n * RegExp ranges of characters with a *Strong* Bidi_Class value.\n *\n * Data is based on DerivedBidiClass.txt in UCD version 7.0.0.\n *\n * NOTE: For performance reasons, we only support Unicode's\n *       Basic Multilingual Plane (BMP) for now.\n */\nvar RANGE_BY_BIDI_TYPE = {\n  L: \"A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u01BA\\u01BB\" + \"\\u01BC-\\u01BF\\u01C0-\\u01C3\\u01C4-\\u0293\\u0294\\u0295-\\u02AF\\u02B0-\\u02B8\" + \"\\u02BB-\\u02C1\\u02D0-\\u02D1\\u02E0-\\u02E4\\u02EE\\u0370-\\u0373\\u0376-\\u0377\" + \"\\u037A\\u037B-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\" + \"\\u03A3-\\u03F5\\u03F7-\\u0481\\u0482\\u048A-\\u052F\\u0531-\\u0556\\u0559\" + \"\\u055A-\\u055F\\u0561-\\u0587\\u0589\\u0903\\u0904-\\u0939\\u093B\\u093D\" + \"\\u093E-\\u0940\\u0949-\\u094C\\u094E-\\u094F\\u0950\\u0958-\\u0961\\u0964-\\u0965\" + \"\\u0966-\\u096F\\u0970\\u0971\\u0972-\\u0980\\u0982-\\u0983\\u0985-\\u098C\" + \"\\u098F-\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\" + \"\\u09BE-\\u09C0\\u09C7-\\u09C8\\u09CB-\\u09CC\\u09CE\\u09D7\\u09DC-\\u09DD\" + \"\\u09DF-\\u09E1\\u09E6-\\u09EF\\u09F0-\\u09F1\\u09F4-\\u09F9\\u09FA\\u0A03\" + \"\\u0A05-\\u0A0A\\u0A0F-\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32-\\u0A33\" + \"\\u0A35-\\u0A36\\u0A38-\\u0A39\\u0A3E-\\u0A40\\u0A59-\\u0A5C\\u0A5E\\u0A66-\\u0A6F\" + \"\\u0A72-\\u0A74\\u0A83\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\" + \"\\u0AB2-\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0ABE-\\u0AC0\\u0AC9\\u0ACB-\\u0ACC\\u0AD0\" + \"\\u0AE0-\\u0AE1\\u0AE6-\\u0AEF\\u0AF0\\u0B02-\\u0B03\\u0B05-\\u0B0C\\u0B0F-\\u0B10\" + \"\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32-\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B3E\\u0B40\" + \"\\u0B47-\\u0B48\\u0B4B-\\u0B4C\\u0B57\\u0B5C-\\u0B5D\\u0B5F-\\u0B61\\u0B66-\\u0B6F\" + \"\\u0B70\\u0B71\\u0B72-\\u0B77\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\" + \"\\u0B99-\\u0B9A\\u0B9C\\u0B9E-\\u0B9F\\u0BA3-\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\" + \"\\u0BBE-\\u0BBF\\u0BC1-\\u0BC2\\u0BC6-\\u0BC8\\u0BCA-\\u0BCC\\u0BD0\\u0BD7\" + \"\\u0BE6-\\u0BEF\\u0BF0-\\u0BF2\\u0C01-\\u0C03\\u0C05-\\u0C0C\\u0C0E-\\u0C10\" + \"\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C41-\\u0C44\\u0C58-\\u0C59\\u0C60-\\u0C61\" + \"\\u0C66-\\u0C6F\\u0C7F\\u0C82-\\u0C83\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\" + \"\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CBE\\u0CBF\\u0CC0-\\u0CC4\\u0CC6\" + \"\\u0CC7-\\u0CC8\\u0CCA-\\u0CCB\\u0CD5-\\u0CD6\\u0CDE\\u0CE0-\\u0CE1\\u0CE6-\\u0CEF\" + \"\\u0CF1-\\u0CF2\\u0D02-\\u0D03\\u0D05-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\" + \"\\u0D3E-\\u0D40\\u0D46-\\u0D48\\u0D4A-\\u0D4C\\u0D4E\\u0D57\\u0D60-\\u0D61\" + \"\\u0D66-\\u0D6F\\u0D70-\\u0D75\\u0D79\\u0D7A-\\u0D7F\\u0D82-\\u0D83\\u0D85-\\u0D96\" + \"\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0DCF-\\u0DD1\\u0DD8-\\u0DDF\" + \"\\u0DE6-\\u0DEF\\u0DF2-\\u0DF3\\u0DF4\\u0E01-\\u0E30\\u0E32-\\u0E33\\u0E40-\\u0E45\" + \"\\u0E46\\u0E4F\\u0E50-\\u0E59\\u0E5A-\\u0E5B\\u0E81-\\u0E82\\u0E84\\u0E87-\\u0E88\" + \"\\u0E8A\\u0E8D\\u0E94-\\u0E97\\u0E99-\\u0E9F\\u0EA1-\\u0EA3\\u0EA5\\u0EA7\" + \"\\u0EAA-\\u0EAB\\u0EAD-\\u0EB0\\u0EB2-\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\" + \"\\u0ED0-\\u0ED9\\u0EDC-\\u0EDF\\u0F00\\u0F01-\\u0F03\\u0F04-\\u0F12\\u0F13\\u0F14\" + \"\\u0F15-\\u0F17\\u0F1A-\\u0F1F\\u0F20-\\u0F29\\u0F2A-\\u0F33\\u0F34\\u0F36\\u0F38\" + \"\\u0F3E-\\u0F3F\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F7F\\u0F85\\u0F88-\\u0F8C\" + \"\\u0FBE-\\u0FC5\\u0FC7-\\u0FCC\\u0FCE-\\u0FCF\\u0FD0-\\u0FD4\\u0FD5-\\u0FD8\" + \"\\u0FD9-\\u0FDA\\u1000-\\u102A\\u102B-\\u102C\\u1031\\u1038\\u103B-\\u103C\\u103F\" + \"\\u1040-\\u1049\\u104A-\\u104F\\u1050-\\u1055\\u1056-\\u1057\\u105A-\\u105D\\u1061\" + \"\\u1062-\\u1064\\u1065-\\u1066\\u1067-\\u106D\\u106E-\\u1070\\u1075-\\u1081\" + \"\\u1083-\\u1084\\u1087-\\u108C\\u108E\\u108F\\u1090-\\u1099\\u109A-\\u109C\" + \"\\u109E-\\u109F\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FB\\u10FC\" + \"\\u10FD-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\" + \"\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\" + \"\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1360-\\u1368\" + \"\\u1369-\\u137C\\u1380-\\u138F\\u13A0-\\u13F4\\u1401-\\u166C\\u166D-\\u166E\" + \"\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16EB-\\u16ED\\u16EE-\\u16F0\" + \"\\u16F1-\\u16F8\\u1700-\\u170C\\u170E-\\u1711\\u1720-\\u1731\\u1735-\\u1736\" + \"\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17B6\\u17BE-\\u17C5\" + \"\\u17C7-\\u17C8\\u17D4-\\u17D6\\u17D7\\u17D8-\\u17DA\\u17DC\\u17E0-\\u17E9\" + \"\\u1810-\\u1819\\u1820-\\u1842\\u1843\\u1844-\\u1877\\u1880-\\u18A8\\u18AA\" + \"\\u18B0-\\u18F5\\u1900-\\u191E\\u1923-\\u1926\\u1929-\\u192B\\u1930-\\u1931\" + \"\\u1933-\\u1938\\u1946-\\u194F\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\" + \"\\u19B0-\\u19C0\\u19C1-\\u19C7\\u19C8-\\u19C9\\u19D0-\\u19D9\\u19DA\\u1A00-\\u1A16\" + \"\\u1A19-\\u1A1A\\u1A1E-\\u1A1F\\u1A20-\\u1A54\\u1A55\\u1A57\\u1A61\\u1A63-\\u1A64\" + \"\\u1A6D-\\u1A72\\u1A80-\\u1A89\\u1A90-\\u1A99\\u1AA0-\\u1AA6\\u1AA7\\u1AA8-\\u1AAD\" + \"\\u1B04\\u1B05-\\u1B33\\u1B35\\u1B3B\\u1B3D-\\u1B41\\u1B43-\\u1B44\\u1B45-\\u1B4B\" + \"\\u1B50-\\u1B59\\u1B5A-\\u1B60\\u1B61-\\u1B6A\\u1B74-\\u1B7C\\u1B82\\u1B83-\\u1BA0\" + \"\\u1BA1\\u1BA6-\\u1BA7\\u1BAA\\u1BAE-\\u1BAF\\u1BB0-\\u1BB9\\u1BBA-\\u1BE5\\u1BE7\" + \"\\u1BEA-\\u1BEC\\u1BEE\\u1BF2-\\u1BF3\\u1BFC-\\u1BFF\\u1C00-\\u1C23\\u1C24-\\u1C2B\" + \"\\u1C34-\\u1C35\\u1C3B-\\u1C3F\\u1C40-\\u1C49\\u1C4D-\\u1C4F\\u1C50-\\u1C59\" + \"\\u1C5A-\\u1C77\\u1C78-\\u1C7D\\u1C7E-\\u1C7F\\u1CC0-\\u1CC7\\u1CD3\\u1CE1\" + \"\\u1CE9-\\u1CEC\\u1CEE-\\u1CF1\\u1CF2-\\u1CF3\\u1CF5-\\u1CF6\\u1D00-\\u1D2B\" + \"\\u1D2C-\\u1D6A\\u1D6B-\\u1D77\\u1D78\\u1D79-\\u1D9A\\u1D9B-\\u1DBF\\u1E00-\\u1F15\" + \"\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\" + \"\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\" + \"\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u200E\" + \"\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\" + \"\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2134\\u2135-\\u2138\\u2139\" + \"\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u214F\\u2160-\\u2182\\u2183-\\u2184\" + \"\\u2185-\\u2188\\u2336-\\u237A\\u2395\\u249C-\\u24E9\\u26AC\\u2800-\\u28FF\" + \"\\u2C00-\\u2C2E\\u2C30-\\u2C5E\\u2C60-\\u2C7B\\u2C7C-\\u2C7D\\u2C7E-\\u2CE4\" + \"\\u2CEB-\\u2CEE\\u2CF2-\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\" + \"\\u2D70\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\" + \"\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u3005\\u3006\\u3007\" + \"\\u3021-\\u3029\\u302E-\\u302F\\u3031-\\u3035\\u3038-\\u303A\\u303B\\u303C\" + \"\\u3041-\\u3096\\u309D-\\u309E\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FE\\u30FF\" + \"\\u3105-\\u312D\\u3131-\\u318E\\u3190-\\u3191\\u3192-\\u3195\\u3196-\\u319F\" + \"\\u31A0-\\u31BA\\u31F0-\\u31FF\\u3200-\\u321C\\u3220-\\u3229\\u322A-\\u3247\" + \"\\u3248-\\u324F\\u3260-\\u327B\\u327F\\u3280-\\u3289\\u328A-\\u32B0\\u32C0-\\u32CB\" + \"\\u32D0-\\u32FE\\u3300-\\u3376\\u337B-\\u33DD\\u33E0-\\u33FE\\u3400-\\u4DB5\" + \"\\u4E00-\\u9FCC\\uA000-\\uA014\\uA015\\uA016-\\uA48C\\uA4D0-\\uA4F7\\uA4F8-\\uA4FD\" + \"\\uA4FE-\\uA4FF\\uA500-\\uA60B\\uA60C\\uA610-\\uA61F\\uA620-\\uA629\\uA62A-\\uA62B\" + \"\\uA640-\\uA66D\\uA66E\\uA680-\\uA69B\\uA69C-\\uA69D\\uA6A0-\\uA6E5\\uA6E6-\\uA6EF\" + \"\\uA6F2-\\uA6F7\\uA722-\\uA76F\\uA770\\uA771-\\uA787\\uA789-\\uA78A\\uA78B-\\uA78E\" + \"\\uA790-\\uA7AD\\uA7B0-\\uA7B1\\uA7F7\\uA7F8-\\uA7F9\\uA7FA\\uA7FB-\\uA801\" + \"\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA823-\\uA824\\uA827\\uA830-\\uA835\" + \"\\uA836-\\uA837\\uA840-\\uA873\\uA880-\\uA881\\uA882-\\uA8B3\\uA8B4-\\uA8C3\" + \"\\uA8CE-\\uA8CF\\uA8D0-\\uA8D9\\uA8F2-\\uA8F7\\uA8F8-\\uA8FA\\uA8FB\\uA900-\\uA909\" + \"\\uA90A-\\uA925\\uA92E-\\uA92F\\uA930-\\uA946\\uA952-\\uA953\\uA95F\\uA960-\\uA97C\" + \"\\uA983\\uA984-\\uA9B2\\uA9B4-\\uA9B5\\uA9BA-\\uA9BB\\uA9BD-\\uA9C0\\uA9C1-\\uA9CD\" + \"\\uA9CF\\uA9D0-\\uA9D9\\uA9DE-\\uA9DF\\uA9E0-\\uA9E4\\uA9E6\\uA9E7-\\uA9EF\" + \"\\uA9F0-\\uA9F9\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA2F-\\uAA30\\uAA33-\\uAA34\" + \"\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA4D\\uAA50-\\uAA59\\uAA5C-\\uAA5F\\uAA60-\\uAA6F\" + \"\\uAA70\\uAA71-\\uAA76\\uAA77-\\uAA79\\uAA7A\\uAA7B\\uAA7D\\uAA7E-\\uAAAF\\uAAB1\" + \"\\uAAB5-\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADC\\uAADD\\uAADE-\\uAADF\" + \"\\uAAE0-\\uAAEA\\uAAEB\\uAAEE-\\uAAEF\\uAAF0-\\uAAF1\\uAAF2\\uAAF3-\\uAAF4\\uAAF5\" + \"\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\" + \"\\uAB30-\\uAB5A\\uAB5B\\uAB5C-\\uAB5F\\uAB64-\\uAB65\\uABC0-\\uABE2\\uABE3-\\uABE4\" + \"\\uABE6-\\uABE7\\uABE9-\\uABEA\\uABEB\\uABEC\\uABF0-\\uABF9\\uAC00-\\uD7A3\" + \"\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uE000-\\uF8FF\\uF900-\\uFA6D\\uFA70-\\uFAD9\" + \"\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFF6F\\uFF70\" + \"\\uFF71-\\uFF9D\\uFF9E-\\uFF9F\\uFFA0-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\" + \"\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC\",\n  R: \"\\u0590\\u05BE\\u05C0\\u05C3\\u05C6\\u05C8-\\u05CF\\u05D0-\\u05EA\\u05EB-\\u05EF\" + \"\\u05F0-\\u05F2\\u05F3-\\u05F4\\u05F5-\\u05FF\\u07C0-\\u07C9\\u07CA-\\u07EA\" + \"\\u07F4-\\u07F5\\u07FA\\u07FB-\\u07FF\\u0800-\\u0815\\u081A\\u0824\\u0828\" + \"\\u082E-\\u082F\\u0830-\\u083E\\u083F\\u0840-\\u0858\\u085C-\\u085D\\u085E\" + \"\\u085F-\\u089F\\u200F\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB37\\uFB38-\\uFB3C\" + \"\\uFB3D\\uFB3E\\uFB3F\\uFB40-\\uFB41\\uFB42\\uFB43-\\uFB44\\uFB45\\uFB46-\\uFB4F\",\n  AL: \"\\u0608\\u060B\\u060D\\u061B\\u061C\\u061D\\u061E-\\u061F\\u0620-\\u063F\\u0640\" + \"\\u0641-\\u064A\\u066D\\u066E-\\u066F\\u0671-\\u06D3\\u06D4\\u06D5\\u06E5-\\u06E6\" + \"\\u06EE-\\u06EF\\u06FA-\\u06FC\\u06FD-\\u06FE\\u06FF\\u0700-\\u070D\\u070E\\u070F\" + \"\\u0710\\u0712-\\u072F\\u074B-\\u074C\\u074D-\\u07A5\\u07B1\\u07B2-\\u07BF\" + \"\\u08A0-\\u08B2\\u08B3-\\u08E3\\uFB50-\\uFBB1\\uFBB2-\\uFBC1\\uFBC2-\\uFBD2\" + \"\\uFBD3-\\uFD3D\\uFD40-\\uFD4F\\uFD50-\\uFD8F\\uFD90-\\uFD91\\uFD92-\\uFDC7\" + \"\\uFDC8-\\uFDCF\\uFDF0-\\uFDFB\\uFDFC\\uFDFE-\\uFDFF\\uFE70-\\uFE74\\uFE75\" + \"\\uFE76-\\uFEFC\\uFEFD-\\uFEFE\"\n};\nvar REGEX_STRONG = new RegExp('[' + RANGE_BY_BIDI_TYPE.L + RANGE_BY_BIDI_TYPE.R + RANGE_BY_BIDI_TYPE.AL + ']');\nvar REGEX_RTL = new RegExp('[' + RANGE_BY_BIDI_TYPE.R + RANGE_BY_BIDI_TYPE.AL + ']');\n/**\n * Returns the first strong character (has Bidi_Class value of L, R, or AL).\n *\n * @param str  A text block; e.g. paragraph, table cell, tag\n * @return     A character with strong bidi direction, or null if not found\n */\n\nfunction firstStrongChar(str) {\n  var match = REGEX_STRONG.exec(str);\n  return match == null ? null : match[0];\n}\n/**\n * Returns the direction of a block of text, based on the direction of its\n * first strong character (has Bidi_Class value of L, R, or AL).\n *\n * @param str  A text block; e.g. paragraph, table cell, tag\n * @return     The resolved direction\n */\n\n\nfunction firstStrongCharDir(str) {\n  var strongChar = firstStrongChar(str);\n\n  if (strongChar == null) {\n    return UnicodeBidiDirection.NEUTRAL;\n  }\n\n  return REGEX_RTL.exec(strongChar) ? UnicodeBidiDirection.RTL : UnicodeBidiDirection.LTR;\n}\n/**\n * Returns the direction of a block of text, based on the direction of its\n * first strong character (has Bidi_Class value of L, R, or AL), or a fallback\n * direction, if no strong character is found.\n *\n * This function is supposed to be used in respect to Higher-Level Protocol\n * rule HL1. (http://www.unicode.org/reports/tr9/#HL1)\n *\n * @param str       A text block; e.g. paragraph, table cell, tag\n * @param fallback  Fallback direction, used if no strong direction detected\n *                  for the block (default = NEUTRAL)\n * @return          The resolved direction\n */\n\n\nfunction resolveBlockDir(str, fallback) {\n  fallback = fallback || UnicodeBidiDirection.NEUTRAL;\n\n  if (!str.length) {\n    return fallback;\n  }\n\n  var blockDir = firstStrongCharDir(str);\n  return blockDir === UnicodeBidiDirection.NEUTRAL ? fallback : blockDir;\n}\n/**\n * Returns the direction of a block of text, based on the direction of its\n * first strong character (has Bidi_Class value of L, R, or AL), or a fallback\n * direction, if no strong character is found.\n *\n * NOTE: This function is similar to resolveBlockDir(), but uses the global\n * direction as the fallback, so it *always* returns a Strong direction,\n * making it useful for integration in places that you need to make the final\n * decision, like setting some CSS class.\n *\n * This function is supposed to be used in respect to Higher-Level Protocol\n * rule HL1. (http://www.unicode.org/reports/tr9/#HL1)\n *\n * @param str             A text block; e.g. paragraph, table cell\n * @param strongFallback  Fallback direction, used if no strong direction\n *                        detected for the block (default = global direction)\n * @return                The resolved Strong direction\n */\n\n\nfunction getDirection(str, strongFallback) {\n  if (!strongFallback) {\n    strongFallback = UnicodeBidiDirection.getGlobalDir();\n  }\n\n  !UnicodeBidiDirection.isStrong(strongFallback) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Fallback direction must be a strong direction') : invariant(false) : void 0;\n  return resolveBlockDir(str, strongFallback);\n}\n/**\n * Returns true if getDirection(arguments...) returns LTR.\n *\n * @param str             A text block; e.g. paragraph, table cell\n * @param strongFallback  Fallback direction, used if no strong direction\n *                        detected for the block (default = global direction)\n * @return                True if the resolved direction is LTR\n */\n\n\nfunction isDirectionLTR(str, strongFallback) {\n  return getDirection(str, strongFallback) === UnicodeBidiDirection.LTR;\n}\n/**\n * Returns true if getDirection(arguments...) returns RTL.\n *\n * @param str             A text block; e.g. paragraph, table cell\n * @param strongFallback  Fallback direction, used if no strong direction\n *                        detected for the block (default = global direction)\n * @return                True if the resolved direction is RTL\n */\n\n\nfunction isDirectionRTL(str, strongFallback) {\n  return getDirection(str, strongFallback) === UnicodeBidiDirection.RTL;\n}\n\nvar UnicodeBidi = {\n  firstStrongChar: firstStrongChar,\n  firstStrongCharDir: firstStrongCharDir,\n  resolveBlockDir: resolveBlockDir,\n  getDirection: getDirection,\n  isDirectionLTR: isDirectionLTR,\n  isDirectionRTL: isDirectionRTL\n};\nmodule.exports = UnicodeBidi;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n * \n */\n\n/**\n * Constants to represent text directionality\n *\n * Also defines a *global* direciton, to be used in bidi algorithms as a\n * default fallback direciton, when no better direction is found or provided.\n *\n * NOTE: Use `setGlobalDir()`, or update `initGlobalDir()`, to set the initial\n *       global direction value based on the application.\n *\n * Part of the implementation of Unicode Bidirectional Algorithm (UBA)\n * Unicode Standard Annex #9 (UAX9)\n * http://www.unicode.org/reports/tr9/\n */\n'use strict';\n\nvar invariant = require(\"./invariant\");\n\nvar NEUTRAL = 'NEUTRAL'; // No strong direction\n\nvar LTR = 'LTR'; // Left-to-Right direction\n\nvar RTL = 'RTL'; // Right-to-Left direction\n\nvar globalDir = null; // == Helpers ==\n\n/**\n * Check if a directionality value is a Strong one\n */\n\nfunction isStrong(dir) {\n  return dir === LTR || dir === RTL;\n}\n/**\n * Get string value to be used for `dir` HTML attribute or `direction` CSS\n * property.\n */\n\n\nfunction getHTMLDir(dir) {\n  !isStrong(dir) ? process.env.NODE_ENV !== \"production\" ? invariant(false, '`dir` must be a strong direction to be converted to HTML Direction') : invariant(false) : void 0;\n  return dir === LTR ? 'ltr' : 'rtl';\n}\n/**\n * Get string value to be used for `dir` HTML attribute or `direction` CSS\n * property, but returns null if `dir` has same value as `otherDir`.\n * `null`.\n */\n\n\nfunction getHTMLDirIfDifferent(dir, otherDir) {\n  !isStrong(dir) ? process.env.NODE_ENV !== \"production\" ? invariant(false, '`dir` must be a strong direction to be converted to HTML Direction') : invariant(false) : void 0;\n  !isStrong(otherDir) ? process.env.NODE_ENV !== \"production\" ? invariant(false, '`otherDir` must be a strong direction to be converted to HTML Direction') : invariant(false) : void 0;\n  return dir === otherDir ? null : getHTMLDir(dir);\n} // == Global Direction ==\n\n/**\n * Set the global direction.\n */\n\n\nfunction setGlobalDir(dir) {\n  globalDir = dir;\n}\n/**\n * Initialize the global direction\n */\n\n\nfunction initGlobalDir() {\n  setGlobalDir(LTR);\n}\n/**\n * Get the global direction\n */\n\n\nfunction getGlobalDir() {\n  if (!globalDir) {\n    this.initGlobalDir();\n  }\n\n  !globalDir ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Global direction not set.') : invariant(false) : void 0;\n  return globalDir;\n}\n\nvar UnicodeBidiDirection = {\n  // Values\n  NEUTRAL: NEUTRAL,\n  LTR: LTR,\n  RTL: RTL,\n  // Helpers\n  isStrong: isStrong,\n  getHTMLDir: getHTMLDir,\n  getHTMLDirIfDifferent: getHTMLDirIfDifferent,\n  // Global Direction\n  setGlobalDir: setGlobalDir,\n  initGlobalDir: initGlobalDir,\n  getGlobalDir: getGlobalDir\n};\nmodule.exports = UnicodeBidiDirection;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n * \n */\n\n/**\n * Stateful API for text direction detection\n *\n * This class can be used in applications where you need to detect the\n * direction of a sequence of text blocks, where each direction shall be used\n * as the fallback direction for the next one.\n *\n * NOTE: A default direction, if not provided, is set based on the global\n *       direction, as defined by `UnicodeBidiDirection`.\n *\n * == Example ==\n * ```\n * var UnicodeBidiService = require('UnicodeBidiService');\n *\n * var bidiService = new UnicodeBidiService();\n *\n * ...\n *\n * bidiService.reset();\n * for (var para in paragraphs) {\n *   var dir = bidiService.getDirection(para);\n *   ...\n * }\n * ```\n *\n * Part of our implementation of Unicode Bidirectional Algorithm (UBA)\n * Unicode Standard Annex #9 (UAX9)\n * http://www.unicode.org/reports/tr9/\n */\n'use strict';\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\nvar UnicodeBidi = require(\"./UnicodeBidi\");\n\nvar UnicodeBidiDirection = require(\"./UnicodeBidiDirection\");\n\nvar invariant = require(\"./invariant\");\n\nvar UnicodeBidiService =\n/*#__PURE__*/\nfunction () {\n  /**\n   * Stateful class for paragraph direction detection\n   *\n   * @param defaultDir  Default direction of the service\n   */\n  function UnicodeBidiService(defaultDir) {\n    _defineProperty(this, \"_defaultDir\", void 0);\n\n    _defineProperty(this, \"_lastDir\", void 0);\n\n    if (!defaultDir) {\n      defaultDir = UnicodeBidiDirection.getGlobalDir();\n    } else {\n      !UnicodeBidiDirection.isStrong(defaultDir) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Default direction must be a strong direction (LTR or RTL)') : invariant(false) : void 0;\n    }\n\n    this._defaultDir = defaultDir;\n    this.reset();\n  }\n  /**\n   * Reset the internal state\n   *\n   * Instead of creating a new instance, you can just reset() your instance\n   * everytime you start a new loop.\n   */\n\n\n  var _proto = UnicodeBidiService.prototype;\n\n  _proto.reset = function reset() {\n    this._lastDir = this._defaultDir;\n  };\n  /**\n   * Returns the direction of a block of text, and remembers it as the\n   * fall-back direction for the next paragraph.\n   *\n   * @param str  A text block, e.g. paragraph, table cell, tag\n   * @return     The resolved direction\n   */\n\n\n  _proto.getDirection = function getDirection(str) {\n    this._lastDir = UnicodeBidi.getDirection(str, this._lastDir);\n    return this._lastDir;\n  };\n\n  return UnicodeBidiService;\n}();\n\nmodule.exports = UnicodeBidiService;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\n\n/**\n * Unicode-enabled replacesments for basic String functions.\n *\n * All the functions in this module assume that the input string is a valid\n * UTF-16 encoding of a Unicode sequence. If it's not the case, the behavior\n * will be undefined.\n *\n * WARNING: Since this module is typechecks-enforced, you may find new bugs\n * when replacing normal String functions with ones provided here.\n */\n'use strict';\n\nvar invariant = require(\"./invariant\"); // These two ranges are consecutive so anything in [HIGH_START, LOW_END] is a\n// surrogate code unit.\n\n\nvar SURROGATE_HIGH_START = 0xD800;\nvar SURROGATE_HIGH_END = 0xDBFF;\nvar SURROGATE_LOW_START = 0xDC00;\nvar SURROGATE_LOW_END = 0xDFFF;\nvar SURROGATE_UNITS_REGEX = /[\\uD800-\\uDFFF]/;\n/**\n * @param {number} codeUnit   A Unicode code-unit, in range [0, 0x10FFFF]\n * @return {boolean}          Whether code-unit is in a surrogate (hi/low) range\n */\n\nfunction isCodeUnitInSurrogateRange(codeUnit) {\n  return SURROGATE_HIGH_START <= codeUnit && codeUnit <= SURROGATE_LOW_END;\n}\n/**\n * Returns whether the two characters starting at `index` form a surrogate pair.\n * For example, given the string s = \"\\uD83D\\uDE0A\", (s, 0) returns true and\n * (s, 1) returns false.\n *\n * @param {string} str\n * @param {number} index\n * @return {boolean}\n */\n\n\nfunction isSurrogatePair(str, index) {\n  !(0 <= index && index < str.length) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'isSurrogatePair: Invalid index %s for string length %s.', index, str.length) : invariant(false) : void 0;\n\n  if (index + 1 === str.length) {\n    return false;\n  }\n\n  var first = str.charCodeAt(index);\n  var second = str.charCodeAt(index + 1);\n  return SURROGATE_HIGH_START <= first && first <= SURROGATE_HIGH_END && SURROGATE_LOW_START <= second && second <= SURROGATE_LOW_END;\n}\n/**\n * @param {string} str  Non-empty string\n * @return {boolean}    True if the input includes any surrogate code units\n */\n\n\nfunction hasSurrogateUnit(str) {\n  return SURROGATE_UNITS_REGEX.test(str);\n}\n/**\n * Return the length of the original Unicode character at given position in the\n * String by looking into the UTF-16 code unit; that is equal to 1 for any\n * non-surrogate characters in BMP ([U+0000..U+D7FF] and [U+E000, U+FFFF]); and\n * returns 2 for the hi/low surrogates ([U+D800..U+DFFF]), which are in fact\n * representing non-BMP characters ([U+10000..U+10FFFF]).\n *\n * Examples:\n * - '\\u0020' => 1\n * - '\\u3020' => 1\n * - '\\uD835' => 2\n * - '\\uD835\\uDDEF' => 2\n * - '\\uDDEF' => 2\n *\n * @param {string} str  Non-empty string\n * @param {number} pos  Position in the string to look for one code unit\n * @return {number}      Number 1 or 2\n */\n\n\nfunction getUTF16Length(str, pos) {\n  return 1 + isCodeUnitInSurrogateRange(str.charCodeAt(pos));\n}\n/**\n * Fully Unicode-enabled replacement for String#length\n *\n * @param {string} str  Valid Unicode string\n * @return {number}     The number of Unicode characters in the string\n */\n\n\nfunction strlen(str) {\n  // Call the native functions if there's no surrogate char\n  if (!hasSurrogateUnit(str)) {\n    return str.length;\n  }\n\n  var len = 0;\n\n  for (var pos = 0; pos < str.length; pos += getUTF16Length(str, pos)) {\n    len++;\n  }\n\n  return len;\n}\n/**\n * Fully Unicode-enabled replacement for String#substr()\n *\n * @param {string} str      Valid Unicode string\n * @param {number} start    Location in Unicode sequence to begin extracting\n * @param {?number} length  The number of Unicode characters to extract\n *                          (default: to the end of the string)\n * @return {string}         Extracted sub-string\n */\n\n\nfunction substr(str, start, length) {\n  start = start || 0;\n  length = length === undefined ? Infinity : length || 0; // Call the native functions if there's no surrogate char\n\n  if (!hasSurrogateUnit(str)) {\n    return str.substr(start, length);\n  } // Obvious cases\n\n\n  var size = str.length;\n\n  if (size <= 0 || start > size || length <= 0) {\n    return '';\n  } // Find the actual starting position\n\n\n  var posA = 0;\n\n  if (start > 0) {\n    for (; start > 0 && posA < size; start--) {\n      posA += getUTF16Length(str, posA);\n    }\n\n    if (posA >= size) {\n      return '';\n    }\n  } else if (start < 0) {\n    for (posA = size; start < 0 && 0 < posA; start++) {\n      posA -= getUTF16Length(str, posA - 1);\n    }\n\n    if (posA < 0) {\n      posA = 0;\n    }\n  } // Find the actual ending position\n\n\n  var posB = size;\n\n  if (length < size) {\n    for (posB = posA; length > 0 && posB < size; length--) {\n      posB += getUTF16Length(str, posB);\n    }\n  }\n\n  return str.substring(posA, posB);\n}\n/**\n * Fully Unicode-enabled replacement for String#substring()\n *\n * @param {string} str    Valid Unicode string\n * @param {number} start  Location in Unicode sequence to begin extracting\n * @param {?number} end   Location in Unicode sequence to end extracting\n *                        (default: end of the string)\n * @return {string}       Extracted sub-string\n */\n\n\nfunction substring(str, start, end) {\n  start = start || 0;\n  end = end === undefined ? Infinity : end || 0;\n\n  if (start < 0) {\n    start = 0;\n  }\n\n  if (end < 0) {\n    end = 0;\n  }\n\n  var length = Math.abs(end - start);\n  start = start < end ? start : end;\n  return substr(str, start, length);\n}\n/**\n * Get a list of Unicode code-points from a String\n *\n * @param {string} str        Valid Unicode string\n * @return {array<number>}    A list of code-points in [0..0x10FFFF]\n */\n\n\nfunction getCodePoints(str) {\n  var codePoints = [];\n\n  for (var pos = 0; pos < str.length; pos += getUTF16Length(str, pos)) {\n    codePoints.push(str.codePointAt(pos));\n  }\n\n  return codePoints;\n}\n\nvar UnicodeUtils = {\n  getCodePoints: getCodePoints,\n  getUTF16Length: getUTF16Length,\n  hasSurrogateUnit: hasSurrogateUnit,\n  isCodeUnitInSurrogateRange: isCodeUnitInSurrogateRange,\n  isSurrogatePair: isSurrogatePair,\n  strlen: strlen,\n  substring: substring,\n  substr: substr\n};\nmodule.exports = UnicodeUtils;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n'use strict';\n\nvar UserAgentData = require(\"./UserAgentData\");\n\nvar VersionRange = require(\"./VersionRange\");\n\nvar mapObject = require(\"./mapObject\");\n\nvar memoizeStringOnly = require(\"./memoizeStringOnly\");\n/**\n * Checks to see whether `name` and `version` satisfy `query`.\n *\n * @param {string} name Name of the browser, device, engine or platform\n * @param {?string} version Version of the browser, engine or platform\n * @param {string} query Query of form \"Name [range expression]\"\n * @param {?function} normalizer Optional pre-processor for range expression\n * @return {boolean}\n */\n\n\nfunction compare(name, version, query, normalizer) {\n  // check for exact match with no version\n  if (name === query) {\n    return true;\n  } // check for non-matching names\n\n\n  if (!query.startsWith(name)) {\n    return false;\n  } // full comparison with version\n\n\n  var range = query.slice(name.length);\n\n  if (version) {\n    range = normalizer ? normalizer(range) : range;\n    return VersionRange.contains(range, version);\n  }\n\n  return false;\n}\n/**\n * Normalizes `version` by stripping any \"NT\" prefix, but only on the Windows\n * platform.\n *\n * Mimics the stripping performed by the `UserAgentWindowsPlatform` PHP class.\n *\n * @param {string} version\n * @return {string}\n */\n\n\nfunction normalizePlatformVersion(version) {\n  if (UserAgentData.platformName === 'Windows') {\n    return version.replace(/^\\s*NT/, '');\n  }\n\n  return version;\n}\n/**\n * Provides client-side access to the authoritative PHP-generated User Agent\n * information supplied by the server.\n */\n\n\nvar UserAgent = {\n  /**\n   * Check if the User Agent browser matches `query`.\n   *\n   * `query` should be a string like \"Chrome\" or \"Chrome > 33\".\n   *\n   * Valid browser names include:\n   *\n   * - ACCESS NetFront\n   * - AOL\n   * - Amazon Silk\n   * - Android\n   * - BlackBerry\n   * - BlackBerry PlayBook\n   * - Chrome\n   * - Chrome for iOS\n   * - Chrome frame\n   * - Facebook PHP SDK\n   * - Facebook for iOS\n   * - Firefox\n   * - IE\n   * - IE Mobile\n   * - Mobile Safari\n   * - Motorola Internet Browser\n   * - Nokia\n   * - Openwave Mobile Browser\n   * - Opera\n   * - Opera Mini\n   * - Opera Mobile\n   * - Safari\n   * - UIWebView\n   * - Unknown\n   * - webOS\n   * - etc...\n   *\n   * An authoritative list can be found in the PHP `BrowserDetector` class and\n   * related classes in the same file (see calls to `new UserAgentBrowser` here:\n   * https://fburl.com/50728104).\n   *\n   * @note Function results are memoized\n   *\n   * @param {string} query Query of the form \"Name [range expression]\"\n   * @return {boolean}\n   */\n  isBrowser: function isBrowser(query) {\n    return compare(UserAgentData.browserName, UserAgentData.browserFullVersion, query);\n  },\n\n  /**\n   * Check if the User Agent browser uses a 32 or 64 bit architecture.\n   *\n   * @note Function results are memoized\n   *\n   * @param {string} query Query of the form \"32\" or \"64\".\n   * @return {boolean}\n   */\n  isBrowserArchitecture: function isBrowserArchitecture(query) {\n    return compare(UserAgentData.browserArchitecture, null, query);\n  },\n\n  /**\n   * Check if the User Agent device matches `query`.\n   *\n   * `query` should be a string like \"iPhone\" or \"iPad\".\n   *\n   * Valid device names include:\n   *\n   * - Kindle\n   * - Kindle Fire\n   * - Unknown\n   * - iPad\n   * - iPhone\n   * - iPod\n   * - etc...\n   *\n   * An authoritative list can be found in the PHP `DeviceDetector` class and\n   * related classes in the same file (see calls to `new UserAgentDevice` here:\n   * https://fburl.com/50728332).\n   *\n   * @note Function results are memoized\n   *\n   * @param {string} query Query of the form \"Name\"\n   * @return {boolean}\n   */\n  isDevice: function isDevice(query) {\n    return compare(UserAgentData.deviceName, null, query);\n  },\n\n  /**\n   * Check if the User Agent rendering engine matches `query`.\n   *\n   * `query` should be a string like \"WebKit\" or \"WebKit >= 537\".\n   *\n   * Valid engine names include:\n   *\n   * - Gecko\n   * - Presto\n   * - Trident\n   * - WebKit\n   * - etc...\n   *\n   * An authoritative list can be found in the PHP `RenderingEngineDetector`\n   * class related classes in the same file (see calls to `new\n   * UserAgentRenderingEngine` here: https://fburl.com/50728617).\n   *\n   * @note Function results are memoized\n   *\n   * @param {string} query Query of the form \"Name [range expression]\"\n   * @return {boolean}\n   */\n  isEngine: function isEngine(query) {\n    return compare(UserAgentData.engineName, UserAgentData.engineVersion, query);\n  },\n\n  /**\n   * Check if the User Agent platform matches `query`.\n   *\n   * `query` should be a string like \"Windows\" or \"iOS 5 - 6\".\n   *\n   * Valid platform names include:\n   *\n   * - Android\n   * - BlackBerry OS\n   * - Java ME\n   * - Linux\n   * - Mac OS X\n   * - Mac OS X Calendar\n   * - Mac OS X Internet Account\n   * - Symbian\n   * - SymbianOS\n   * - Windows\n   * - Windows Mobile\n   * - Windows Phone\n   * - iOS\n   * - iOS Facebook Integration Account\n   * - iOS Facebook Social Sharing UI\n   * - webOS\n   * - Chrome OS\n   * - etc...\n   *\n   * An authoritative list can be found in the PHP `PlatformDetector` class and\n   * related classes in the same file (see calls to `new UserAgentPlatform`\n   * here: https://fburl.com/50729226).\n   *\n   * @note Function results are memoized\n   *\n   * @param {string} query Query of the form \"Name [range expression]\"\n   * @return {boolean}\n   */\n  isPlatform: function isPlatform(query) {\n    return compare(UserAgentData.platformName, UserAgentData.platformFullVersion, query, normalizePlatformVersion);\n  },\n\n  /**\n   * Check if the User Agent platform is a 32 or 64 bit architecture.\n   *\n   * @note Function results are memoized\n   *\n   * @param {string} query Query of the form \"32\" or \"64\".\n   * @return {boolean}\n   */\n  isPlatformArchitecture: function isPlatformArchitecture(query) {\n    return compare(UserAgentData.platformArchitecture, null, query);\n  }\n};\nmodule.exports = mapObject(UserAgent, memoizeStringOnly);","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n/**\n * Usage note:\n * This module makes a best effort to export the same data we would internally.\n * At Facebook we use a server-generated module that does the parsing and\n * exports the data for the client to use. We can't rely on a server-side\n * implementation in open source so instead we make use of an open source\n * library to do the heavy lifting and then make some adjustments as necessary.\n * It's likely there will be some differences. Some we can smooth over.\n * Others are going to be harder.\n */\n'use strict';\n\nvar UAParser = require(\"ua-parser-js\");\n\nvar UNKNOWN = 'Unknown';\nvar PLATFORM_MAP = {\n  'Mac OS': 'Mac OS X'\n};\n/**\n * Convert from UAParser platform name to what we expect.\n */\n\nfunction convertPlatformName(name) {\n  return PLATFORM_MAP[name] || name;\n}\n/**\n * Get the version number in parts. This is very naive. We actually get major\n * version as a part of UAParser already, which is generally good enough, but\n * let's get the minor just in case.\n */\n\n\nfunction getBrowserVersion(version) {\n  if (!version) {\n    return {\n      major: '',\n      minor: ''\n    };\n  }\n\n  var parts = version.split('.');\n  return {\n    major: parts[0],\n    minor: parts[1]\n  };\n}\n/**\n * Get the UA data fom UAParser and then convert it to the format we're\n * expecting for our APIS.\n */\n\n\nvar parser = new UAParser();\nvar results = parser.getResult(); // Do some conversion first.\n\nvar browserVersionData = getBrowserVersion(results.browser.version);\nvar uaData = {\n  browserArchitecture: results.cpu.architecture || UNKNOWN,\n  browserFullVersion: results.browser.version || UNKNOWN,\n  browserMinorVersion: browserVersionData.minor || UNKNOWN,\n  browserName: results.browser.name || UNKNOWN,\n  browserVersion: results.browser.major || UNKNOWN,\n  deviceName: results.device.model || UNKNOWN,\n  engineName: results.engine.name || UNKNOWN,\n  engineVersion: results.engine.version || UNKNOWN,\n  platformArchitecture: results.cpu.architecture || UNKNOWN,\n  platformName: convertPlatformName(results.os.name) || UNKNOWN,\n  platformVersion: results.os.version || UNKNOWN,\n  platformFullVersion: results.os.version || UNKNOWN\n};\nmodule.exports = uaData;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n'use strict';\n\nvar invariant = require(\"./invariant\");\n\nvar componentRegex = /\\./;\nvar orRegex = /\\|\\|/;\nvar rangeRegex = /\\s+\\-\\s+/;\nvar modifierRegex = /^(<=|<|=|>=|~>|~|>|)?\\s*(.+)/;\nvar numericRegex = /^(\\d*)(.*)/;\n/**\n * Splits input `range` on \"||\" and returns true if any subrange matches\n * `version`.\n *\n * @param {string} range\n * @param {string} version\n * @returns {boolean}\n */\n\nfunction checkOrExpression(range, version) {\n  var expressions = range.split(orRegex);\n\n  if (expressions.length > 1) {\n    return expressions.some(function (range) {\n      return VersionRange.contains(range, version);\n    });\n  } else {\n    range = expressions[0].trim();\n    return checkRangeExpression(range, version);\n  }\n}\n/**\n * Splits input `range` on \" - \" (the surrounding whitespace is required) and\n * returns true if version falls between the two operands.\n *\n * @param {string} range\n * @param {string} version\n * @returns {boolean}\n */\n\n\nfunction checkRangeExpression(range, version) {\n  var expressions = range.split(rangeRegex);\n  !(expressions.length > 0 && expressions.length <= 2) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'the \"-\" operator expects exactly 2 operands') : invariant(false) : void 0;\n\n  if (expressions.length === 1) {\n    return checkSimpleExpression(expressions[0], version);\n  } else {\n    var startVersion = expressions[0],\n        endVersion = expressions[1];\n    !(isSimpleVersion(startVersion) && isSimpleVersion(endVersion)) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'operands to the \"-\" operator must be simple (no modifiers)') : invariant(false) : void 0;\n    return checkSimpleExpression('>=' + startVersion, version) && checkSimpleExpression('<=' + endVersion, version);\n  }\n}\n/**\n * Checks if `range` matches `version`. `range` should be a \"simple\" range (ie.\n * not a compound range using the \" - \" or \"||\" operators).\n *\n * @param {string} range\n * @param {string} version\n * @returns {boolean}\n */\n\n\nfunction checkSimpleExpression(range, version) {\n  range = range.trim();\n\n  if (range === '') {\n    return true;\n  }\n\n  var versionComponents = version.split(componentRegex);\n\n  var _getModifierAndCompon = getModifierAndComponents(range),\n      modifier = _getModifierAndCompon.modifier,\n      rangeComponents = _getModifierAndCompon.rangeComponents;\n\n  switch (modifier) {\n    case '<':\n      return checkLessThan(versionComponents, rangeComponents);\n\n    case '<=':\n      return checkLessThanOrEqual(versionComponents, rangeComponents);\n\n    case '>=':\n      return checkGreaterThanOrEqual(versionComponents, rangeComponents);\n\n    case '>':\n      return checkGreaterThan(versionComponents, rangeComponents);\n\n    case '~':\n    case '~>':\n      return checkApproximateVersion(versionComponents, rangeComponents);\n\n    default:\n      return checkEqual(versionComponents, rangeComponents);\n  }\n}\n/**\n * Checks whether `a` is less than `b`.\n *\n * @param {array<string>} a\n * @param {array<string>} b\n * @returns {boolean}\n */\n\n\nfunction checkLessThan(a, b) {\n  return compareComponents(a, b) === -1;\n}\n/**\n * Checks whether `a` is less than or equal to `b`.\n *\n * @param {array<string>} a\n * @param {array<string>} b\n * @returns {boolean}\n */\n\n\nfunction checkLessThanOrEqual(a, b) {\n  var result = compareComponents(a, b);\n  return result === -1 || result === 0;\n}\n/**\n * Checks whether `a` is equal to `b`.\n *\n * @param {array<string>} a\n * @param {array<string>} b\n * @returns {boolean}\n */\n\n\nfunction checkEqual(a, b) {\n  return compareComponents(a, b) === 0;\n}\n/**\n * Checks whether `a` is greater than or equal to `b`.\n *\n * @param {array<string>} a\n * @param {array<string>} b\n * @returns {boolean}\n */\n\n\nfunction checkGreaterThanOrEqual(a, b) {\n  var result = compareComponents(a, b);\n  return result === 1 || result === 0;\n}\n/**\n * Checks whether `a` is greater than `b`.\n *\n * @param {array<string>} a\n * @param {array<string>} b\n * @returns {boolean}\n */\n\n\nfunction checkGreaterThan(a, b) {\n  return compareComponents(a, b) === 1;\n}\n/**\n * Checks whether `a` is \"reasonably close\" to `b` (as described in\n * https://www.npmjs.org/doc/misc/semver.html). For example, if `b` is \"1.3.1\"\n * then \"reasonably close\" is defined as \">= 1.3.1 and < 1.4\".\n *\n * @param {array<string>} a\n * @param {array<string>} b\n * @returns {boolean}\n */\n\n\nfunction checkApproximateVersion(a, b) {\n  var lowerBound = b.slice();\n  var upperBound = b.slice();\n\n  if (upperBound.length > 1) {\n    upperBound.pop();\n  }\n\n  var lastIndex = upperBound.length - 1;\n  var numeric = parseInt(upperBound[lastIndex], 10);\n\n  if (isNumber(numeric)) {\n    upperBound[lastIndex] = numeric + 1 + '';\n  }\n\n  return checkGreaterThanOrEqual(a, lowerBound) && checkLessThan(a, upperBound);\n}\n/**\n * Extracts the optional modifier (<, <=, =, >=, >, ~, ~>) and version\n * components from `range`.\n *\n * For example, given `range` \">= 1.2.3\" returns an object with a `modifier` of\n * `\">=\"` and `components` of `[1, 2, 3]`.\n *\n * @param {string} range\n * @returns {object}\n */\n\n\nfunction getModifierAndComponents(range) {\n  var rangeComponents = range.split(componentRegex);\n  var matches = rangeComponents[0].match(modifierRegex);\n  !matches ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'expected regex to match but it did not') : invariant(false) : void 0;\n  return {\n    modifier: matches[1],\n    rangeComponents: [matches[2]].concat(rangeComponents.slice(1))\n  };\n}\n/**\n * Determines if `number` is a number.\n *\n * @param {mixed} number\n * @returns {boolean}\n */\n\n\nfunction isNumber(number) {\n  return !isNaN(number) && isFinite(number);\n}\n/**\n * Tests whether `range` is a \"simple\" version number without any modifiers\n * (\">\", \"~\" etc).\n *\n * @param {string} range\n * @returns {boolean}\n */\n\n\nfunction isSimpleVersion(range) {\n  return !getModifierAndComponents(range).modifier;\n}\n/**\n * Zero-pads array `array` until it is at least `length` long.\n *\n * @param {array} array\n * @param {number} length\n */\n\n\nfunction zeroPad(array, length) {\n  for (var i = array.length; i < length; i++) {\n    array[i] = '0';\n  }\n}\n/**\n * Normalizes `a` and `b` in preparation for comparison by doing the following:\n *\n * - zero-pads `a` and `b`\n * - marks any \"x\", \"X\" or \"*\" component in `b` as equivalent by zero-ing it out\n *   in both `a` and `b`\n * - marks any final \"*\" component in `b` as a greedy wildcard by zero-ing it\n *   and all of its successors in `a`\n *\n * @param {array<string>} a\n * @param {array<string>} b\n * @returns {array<array<string>>}\n */\n\n\nfunction normalizeVersions(a, b) {\n  a = a.slice();\n  b = b.slice();\n  zeroPad(a, b.length); // mark \"x\" and \"*\" components as equal\n\n  for (var i = 0; i < b.length; i++) {\n    var matches = b[i].match(/^[x*]$/i);\n\n    if (matches) {\n      b[i] = a[i] = '0'; // final \"*\" greedily zeros all remaining components\n\n      if (matches[0] === '*' && i === b.length - 1) {\n        for (var j = i; j < a.length; j++) {\n          a[j] = '0';\n        }\n      }\n    }\n  }\n\n  zeroPad(b, a.length);\n  return [a, b];\n}\n/**\n * Returns the numerical -- not the lexicographical -- ordering of `a` and `b`.\n *\n * For example, `10-alpha` is greater than `2-beta`.\n *\n * @param {string} a\n * @param {string} b\n * @returns {number} -1, 0 or 1 to indicate whether `a` is less than, equal to,\n * or greater than `b`, respectively\n */\n\n\nfunction compareNumeric(a, b) {\n  var aPrefix = a.match(numericRegex)[1];\n  var bPrefix = b.match(numericRegex)[1];\n  var aNumeric = parseInt(aPrefix, 10);\n  var bNumeric = parseInt(bPrefix, 10);\n\n  if (isNumber(aNumeric) && isNumber(bNumeric) && aNumeric !== bNumeric) {\n    return compare(aNumeric, bNumeric);\n  } else {\n    return compare(a, b);\n  }\n}\n/**\n * Returns the ordering of `a` and `b`.\n *\n * @param {string|number} a\n * @param {string|number} b\n * @returns {number} -1, 0 or 1 to indicate whether `a` is less than, equal to,\n * or greater than `b`, respectively\n */\n\n\nfunction compare(a, b) {\n  !(typeof a === typeof b) ? process.env.NODE_ENV !== \"production\" ? invariant(false, '\"a\" and \"b\" must be of the same type') : invariant(false) : void 0;\n\n  if (a > b) {\n    return 1;\n  } else if (a < b) {\n    return -1;\n  } else {\n    return 0;\n  }\n}\n/**\n * Compares arrays of version components.\n *\n * @param {array<string>} a\n * @param {array<string>} b\n * @returns {number} -1, 0 or 1 to indicate whether `a` is less than, equal to,\n * or greater than `b`, respectively\n */\n\n\nfunction compareComponents(a, b) {\n  var _normalizeVersions = normalizeVersions(a, b),\n      aNormalized = _normalizeVersions[0],\n      bNormalized = _normalizeVersions[1];\n\n  for (var i = 0; i < bNormalized.length; i++) {\n    var result = compareNumeric(aNormalized[i], bNormalized[i]);\n\n    if (result) {\n      return result;\n    }\n  }\n\n  return 0;\n}\n\nvar VersionRange = {\n  /**\n   * Checks whether `version` satisfies the `range` specification.\n   *\n   * We support a subset of the expressions defined in\n   * https://www.npmjs.org/doc/misc/semver.html:\n   *\n   *    version   Must match version exactly\n   *    =version  Same as just version\n   *    >version  Must be greater than version\n   *    >=version Must be greater than or equal to version\n   *    <version  Must be less than version\n   *    <=version Must be less than or equal to version\n   *    ~version  Must be at least version, but less than the next significant\n   *              revision above version:\n   *              \"~1.2.3\" is equivalent to \">= 1.2.3 and < 1.3\"\n   *    ~>version Equivalent to ~version\n   *    1.2.x     Must match \"1.2.x\", where \"x\" is a wildcard that matches\n   *              anything\n   *    1.2.*     Similar to \"1.2.x\", but \"*\" in the trailing position is a\n   *              \"greedy\" wildcard, so will match any number of additional\n   *              components:\n   *              \"1.2.*\" will match \"1.2.1\", \"1.2.1.1\", \"1.2.1.1.1\" etc\n   *    *         Any version\n   *    \"\"        (Empty string) Same as *\n   *    v1 - v2   Equivalent to \">= v1 and <= v2\"\n   *    r1 || r2  Passes if either r1 or r2 are satisfied\n   *\n   * @param {string} range\n   * @param {string} version\n   * @returns {boolean}\n   */\n  contains: function contains(range, version) {\n    return checkOrExpression(range.trim(), version.trim());\n  }\n};\nmodule.exports = VersionRange;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\nvar _hyphenPattern = /-(.)/g;\n/**\n * Camelcases a hyphenated string, for example:\n *\n *   > camelize('background-color')\n *   < \"backgroundColor\"\n *\n * @param {string} string\n * @return {string}\n */\n\nfunction camelize(string) {\n  return string.replace(_hyphenPattern, function (_, character) {\n    return character.toUpperCase();\n  });\n}\n\nmodule.exports = camelize;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * \n */\nvar isTextNode = require(\"./isTextNode\");\n/*eslint-disable no-bitwise */\n\n/**\n * Checks if a given DOM node contains or is another DOM node.\n */\n\n\nfunction containsNode(outerNode, innerNode) {\n  if (!outerNode || !innerNode) {\n    return false;\n  } else if (outerNode === innerNode) {\n    return true;\n  } else if (isTextNode(outerNode)) {\n    return false;\n  } else if (isTextNode(innerNode)) {\n    return containsNode(outerNode, innerNode.parentNode);\n  } else if ('contains' in outerNode) {\n    return outerNode.contains(innerNode);\n  } else if (outerNode.compareDocumentPosition) {\n    return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n  } else {\n    return false;\n  }\n}\n\nmodule.exports = containsNode;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\nvar invariant = require(\"./invariant\");\n/**\n * Convert array-like objects to arrays.\n *\n * This API assumes the caller knows the contents of the data type. For less\n * well defined inputs use createArrayFromMixed.\n *\n * @param {object|function|filelist} obj\n * @return {array}\n */\n\n\nfunction toArray(obj) {\n  var length = obj.length; // Some browsers builtin objects can report typeof 'function' (e.g. NodeList\n  // in old versions of Safari).\n\n  !(!Array.isArray(obj) && (typeof obj === 'object' || typeof obj === 'function')) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'toArray: Array-like object expected') : invariant(false) : void 0;\n  !(typeof length === 'number') ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'toArray: Object needs a length property') : invariant(false) : void 0;\n  !(length === 0 || length - 1 in obj) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'toArray: Object should have keys for indices') : invariant(false) : void 0;\n  !(typeof obj.callee !== 'function') ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'toArray: Object can\\'t be `arguments`. Use rest params ' + '(function(...args) {}) or Array.from() instead.') : invariant(false) : void 0; // Old IE doesn't give collections access to hasOwnProperty. Assume inputs\n  // without method will throw during the slice call and skip straight to the\n  // fallback.\n\n  if (obj.hasOwnProperty) {\n    try {\n      return Array.prototype.slice.call(obj);\n    } catch (e) {// IE < 9 does not support Array#slice on collections objects\n    }\n  } // Fall back to copying key by key. This assumes all keys have a value,\n  // so will not preserve sparsely populated inputs.\n\n\n  var ret = Array(length);\n\n  for (var ii = 0; ii < length; ii++) {\n    ret[ii] = obj[ii];\n  }\n\n  return ret;\n}\n/**\n * Perform a heuristic test to determine if an object is \"array-like\".\n *\n *   A monk asked Joshu, a Zen master, \"Has a dog Buddha nature?\"\n *   Joshu replied: \"Mu.\"\n *\n * This function determines if its argument has \"array nature\": it returns\n * true if the argument is an actual array, an `arguments' object, or an\n * HTMLCollection (e.g. node.childNodes or node.getElementsByTagName()).\n *\n * It will return false for other array-like objects like Filelist.\n *\n * @param {*} obj\n * @return {boolean}\n */\n\n\nfunction hasArrayNature(obj) {\n  return (// not null/false\n    !!obj && ( // arrays are objects, NodeLists are functions in Safari\n    typeof obj == 'object' || typeof obj == 'function') && // quacks like an array\n    'length' in obj && // not window\n    !('setInterval' in obj) && // no DOM node should be considered an array-like\n    // a 'select' element has 'length' and 'item' properties on IE8\n    typeof obj.nodeType != 'number' && ( // a real array\n    Array.isArray(obj) || // arguments\n    'callee' in obj || // HTMLCollection/NodeList\n    'item' in obj)\n  );\n}\n/**\n * Ensure that the argument is an array by wrapping it in an array if it is not.\n * Creates a copy of the argument if it is already an array.\n *\n * This is mostly useful idiomatically:\n *\n *   var createArrayFromMixed = require('createArrayFromMixed');\n *\n *   function takesOneOrMoreThings(things) {\n *     things = createArrayFromMixed(things);\n *     ...\n *   }\n *\n * This allows you to treat `things' as an array, but accept scalars in the API.\n *\n * If you need to convert an array-like object, like `arguments`, into an array\n * use toArray instead.\n *\n * @param {*} obj\n * @return {array}\n */\n\n\nfunction createArrayFromMixed(obj) {\n  if (!hasArrayNature(obj)) {\n    return [obj];\n  } else if (Array.isArray(obj)) {\n    return obj.slice();\n  } else {\n    return toArray(obj);\n  }\n}\n\nmodule.exports = createArrayFromMixed;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n\n/**\n * This function is used to mark string literals representing CSS class names\n * so that they can be transformed statically. This allows for modularization\n * and minification of CSS class names.\n *\n * In static_upstream, this function is actually implemented, but it should\n * eventually be replaced with something more descriptive, and the transform\n * that is used in the main stack should be ported for use elsewhere.\n *\n * @param string|object className to modularize, or an object of key/values.\n *                      In the object case, the values are conditions that\n *                      determine if the className keys should be included.\n * @param [string ...]  Variable list of classNames in the string case.\n * @return string       Renderable space-separated CSS className.\n */\nfunction cx(classNames) {\n  if (typeof classNames == 'object') {\n    return Object.keys(classNames).filter(function (className) {\n      return classNames[className];\n    }).map(replace).join(' ');\n  }\n\n  return Array.prototype.map.call(arguments, replace).join(' ');\n}\n\nfunction replace(str) {\n  return str.replace(/\\//g, '-');\n}\n\nmodule.exports = cx;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * \n */\nfunction makeEmptyFunction(arg) {\n  return function () {\n    return arg;\n  };\n}\n/**\n * This function accepts and discards inputs; it has no side effects. This is\n * primarily useful idiomatically for overridable function endpoints which\n * always need to be callable, since JS lacks a null-call idiom ala Cocoa.\n */\n\n\nvar emptyFunction = function emptyFunction() {};\n\nemptyFunction.thatReturns = makeEmptyFunction;\nemptyFunction.thatReturnsFalse = makeEmptyFunction(false);\nemptyFunction.thatReturnsTrue = makeEmptyFunction(true);\nemptyFunction.thatReturnsNull = makeEmptyFunction(null);\n\nemptyFunction.thatReturnsThis = function () {\n  return this;\n};\n\nemptyFunction.thatReturnsArgument = function (arg) {\n  return arg;\n};\n\nmodule.exports = emptyFunction;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\n\n/* eslint-disable fb-www/typeof-undefined */\n\n/**\n * Same as document.activeElement but wraps in a try-catch block. In IE it is\n * not safe to call document.activeElement if there is nothing focused.\n *\n * The activeElement will be null only if the document or document body is not\n * yet defined.\n *\n * @param {?DOMDocument} doc Defaults to current document.\n * @return {?DOMElement}\n */\nfunction getActiveElement(doc)\n/*?DOMElement*/\n{\n  doc = doc || (typeof document !== 'undefined' ? document : undefined);\n\n  if (typeof doc === 'undefined') {\n    return null;\n  }\n\n  try {\n    return doc.activeElement || doc.body;\n  } catch (e) {\n    return doc.body;\n  }\n}\n\nmodule.exports = getActiveElement;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\n'use strict';\n\nvar isWebkit = typeof navigator !== 'undefined' && navigator.userAgent.indexOf('AppleWebKit') > -1;\n/**\n * Gets the element with the document scroll properties such as `scrollLeft` and\n * `scrollHeight`. This may differ across different browsers.\n *\n * NOTE: The return value can be null if the DOM is not yet ready.\n *\n * @param {?DOMDocument} doc Defaults to current document.\n * @return {?DOMElement}\n */\n\nfunction getDocumentScrollElement(doc) {\n  doc = doc || document;\n\n  if (doc.scrollingElement) {\n    return doc.scrollingElement;\n  }\n\n  return !isWebkit && doc.compatMode === 'CSS1Compat' ? doc.documentElement : doc.body;\n}\n\nmodule.exports = getDocumentScrollElement;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\nvar getElementRect = require(\"./getElementRect\");\n/**\n * Gets an element's position in pixels relative to the viewport. The returned\n * object represents the position of the element's top left corner.\n *\n * @param {DOMElement} element\n * @return {object}\n */\n\n\nfunction getElementPosition(element) {\n  var rect = getElementRect(element);\n  return {\n    x: rect.left,\n    y: rect.top,\n    width: rect.right - rect.left,\n    height: rect.bottom - rect.top\n  };\n}\n\nmodule.exports = getElementPosition;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\nvar containsNode = require(\"./containsNode\");\n/**\n * Gets an element's bounding rect in pixels relative to the viewport.\n *\n * @param {DOMElement} elem\n * @return {object}\n */\n\n\nfunction getElementRect(elem) {\n  var docElem = elem.ownerDocument.documentElement; // FF 2, Safari 3 and Opera 9.5- do not support getBoundingClientRect().\n  // IE9- will throw if the element is not in the document.\n\n  if (!('getBoundingClientRect' in elem) || !containsNode(docElem, elem)) {\n    return {\n      left: 0,\n      right: 0,\n      top: 0,\n      bottom: 0\n    };\n  } // Subtracts clientTop/Left because IE8- added a 2px border to the\n  // <html> element (see http://fburl.com/1493213). IE 7 in\n  // Quicksmode does not report clientLeft/clientTop so there\n  // will be an unaccounted offset of 2px when in quirksmode\n\n\n  var rect = elem.getBoundingClientRect();\n  return {\n    left: Math.round(rect.left) - docElem.clientLeft,\n    right: Math.round(rect.right) - docElem.clientLeft,\n    top: Math.round(rect.top) - docElem.clientTop,\n    bottom: Math.round(rect.bottom) - docElem.clientTop\n  };\n}\n\nmodule.exports = getElementRect;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\n'use strict';\n\nvar getDocumentScrollElement = require(\"./getDocumentScrollElement\");\n\nvar getUnboundedScrollPosition = require(\"./getUnboundedScrollPosition\");\n/**\n * Gets the scroll position of the supplied element or window.\n *\n * The return values are bounded. This means that if the scroll position is\n * negative or exceeds the element boundaries (which is possible using inertial\n * scrolling), you will get zero or the maximum scroll position, respectively.\n *\n * If you need the unbound scroll position, use `getUnboundedScrollPosition`.\n *\n * @param {DOMWindow|DOMElement} scrollable\n * @return {object} Map with `x` and `y` keys.\n */\n\n\nfunction getScrollPosition(scrollable) {\n  var documentScrollElement = getDocumentScrollElement(scrollable.ownerDocument || scrollable.document);\n\n  if (scrollable.Window && scrollable instanceof scrollable.Window) {\n    scrollable = documentScrollElement;\n  }\n\n  var scrollPosition = getUnboundedScrollPosition(scrollable);\n  var viewport = scrollable === documentScrollElement ? scrollable.ownerDocument.documentElement : scrollable;\n  var xMax = scrollable.scrollWidth - viewport.clientWidth;\n  var yMax = scrollable.scrollHeight - viewport.clientHeight;\n  scrollPosition.x = Math.max(0, Math.min(scrollPosition.x, xMax));\n  scrollPosition.y = Math.max(0, Math.min(scrollPosition.y, yMax));\n  return scrollPosition;\n}\n\nmodule.exports = getScrollPosition;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\nvar camelize = require(\"./camelize\");\n\nvar hyphenate = require(\"./hyphenate\");\n\nfunction asString(value)\n/*?string*/\n{\n  return value == null ? value : String(value);\n}\n\nfunction getStyleProperty(\n/*DOMNode*/\nnode,\n/*string*/\nname)\n/*?string*/\n{\n  var computedStyle; // W3C Standard\n\n  if (window.getComputedStyle) {\n    // In certain cases such as within an iframe in FF3, this returns null.\n    computedStyle = window.getComputedStyle(node, null);\n\n    if (computedStyle) {\n      return asString(computedStyle.getPropertyValue(hyphenate(name)));\n    }\n  } // Safari\n\n\n  if (document.defaultView && document.defaultView.getComputedStyle) {\n    computedStyle = document.defaultView.getComputedStyle(node, null); // A Safari bug causes this to return null for `display: none` elements.\n\n    if (computedStyle) {\n      return asString(computedStyle.getPropertyValue(hyphenate(name)));\n    }\n\n    if (name === 'display') {\n      return 'none';\n    }\n  } // Internet Explorer\n\n\n  if (node.currentStyle) {\n    if (name === 'float') {\n      return asString(node.currentStyle.cssFloat || node.currentStyle.styleFloat);\n    }\n\n    return asString(node.currentStyle[camelize(name)]);\n  }\n\n  return asString(node.style && node.style[camelize(name)]);\n}\n\nmodule.exports = getStyleProperty;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\n'use strict';\n/**\n * Gets the scroll position of the supplied element or window.\n *\n * The return values are unbounded, unlike `getScrollPosition`. This means they\n * may be negative or exceed the element boundaries (which is possible using\n * inertial scrolling).\n *\n * @param {DOMWindow|DOMElement} scrollable\n * @return {object} Map with `x` and `y` keys.\n */\n\nfunction getUnboundedScrollPosition(scrollable) {\n  if (scrollable.Window && scrollable instanceof scrollable.Window) {\n    return {\n      x: scrollable.pageXOffset || scrollable.document.documentElement.scrollLeft,\n      y: scrollable.pageYOffset || scrollable.document.documentElement.scrollTop\n    };\n  }\n\n  return {\n    x: scrollable.scrollLeft,\n    y: scrollable.scrollTop\n  };\n}\n\nmodule.exports = getUnboundedScrollPosition;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * \n * @typechecks\n */\nfunction getViewportWidth() {\n  var width;\n\n  if (document.documentElement) {\n    width = document.documentElement.clientWidth;\n  }\n\n  if (!width && document.body) {\n    width = document.body.clientWidth;\n  }\n\n  return width || 0;\n}\n\nfunction getViewportHeight() {\n  var height;\n\n  if (document.documentElement) {\n    height = document.documentElement.clientHeight;\n  }\n\n  if (!height && document.body) {\n    height = document.body.clientHeight;\n  }\n\n  return height || 0;\n}\n/**\n * Gets the viewport dimensions including any scrollbars.\n */\n\n\nfunction getViewportDimensions() {\n  return {\n    width: window.innerWidth || getViewportWidth(),\n    height: window.innerHeight || getViewportHeight()\n  };\n}\n/**\n * Gets the viewport dimensions excluding any scrollbars.\n */\n\n\ngetViewportDimensions.withoutScrollbars = function () {\n  return {\n    width: getViewportWidth(),\n    height: getViewportHeight()\n  };\n};\n\nmodule.exports = getViewportDimensions;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\nvar _uppercasePattern = /([A-Z])/g;\n/**\n * Hyphenates a camelcased string, for example:\n *\n *   > hyphenate('backgroundColor')\n *   < \"background-color\"\n *\n * For CSS style names, use `hyphenateStyleName` instead which works properly\n * with all vendor prefixes, including `ms`.\n *\n * @param {string} string\n * @return {string}\n */\n\nfunction hyphenate(string) {\n  return string.replace(_uppercasePattern, '-$1').toLowerCase();\n}\n\nmodule.exports = hyphenate;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * \n */\n'use strict';\n\nvar validateFormat = process.env.NODE_ENV !== \"production\" ? function (format) {\n  if (format === undefined) {\n    throw new Error('invariant(...): Second argument must be a string.');\n  }\n} : function (format) {};\n/**\n * Use invariant() to assert state which your program assumes to be true.\n *\n * Provide sprintf-style format (only %s is supported) and arguments to provide\n * information about what broke and what you were expecting.\n *\n * The invariant message will be stripped in production, but the invariant will\n * remain to ensure logic does not differ in production.\n */\n\nfunction invariant(condition, format) {\n  for (var _len = arguments.length, args = new Array(_len > 2 ? _len - 2 : 0), _key = 2; _key < _len; _key++) {\n    args[_key - 2] = arguments[_key];\n  }\n\n  validateFormat(format);\n\n  if (!condition) {\n    var error;\n\n    if (format === undefined) {\n      error = new Error('Minified exception occurred; use the non-minified dev environment ' + 'for the full error message and additional helpful warnings.');\n    } else {\n      var argIndex = 0;\n      error = new Error(format.replace(/%s/g, function () {\n        return String(args[argIndex++]);\n      }));\n      error.name = 'Invariant Violation';\n    }\n\n    error.framesToPop = 1; // Skip invariant's own stack frame.\n\n    throw error;\n  }\n}\n\nmodule.exports = invariant;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\n\n/**\n * @param {*} object The object to check.\n * @return {boolean} Whether or not the object is a DOM node.\n */\nfunction isNode(object) {\n  var doc = object ? object.ownerDocument || object : document;\n  var defaultView = doc.defaultView || window;\n  return !!(object && (typeof defaultView.Node === 'function' ? object instanceof defaultView.Node : typeof object === 'object' && typeof object.nodeType === 'number' && typeof object.nodeName === 'string'));\n}\n\nmodule.exports = isNode;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @typechecks\n */\nvar isNode = require(\"./isNode\");\n/**\n * @param {*} object The object to check.\n * @return {boolean} Whether or not the object is a DOM text node.\n */\n\n\nfunction isTextNode(object) {\n  return isNode(object) && object.nodeType == 3;\n}\n\nmodule.exports = isTextNode;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * \n * @typechecks static-only\n */\n'use strict';\n/**\n * Combines multiple className strings into one.\n */\n\nfunction joinClasses(className) {\n  var newClassName = className || '';\n  var argLength = arguments.length;\n\n  if (argLength > 1) {\n    for (var index = 1; index < argLength; index++) {\n      var nextClass = arguments[index];\n\n      if (nextClass) {\n        newClassName = (newClassName ? newClassName + ' ' : '') + nextClass;\n      }\n    }\n  }\n\n  return newClassName;\n}\n\nmodule.exports = joinClasses;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n'use strict';\n\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n/**\n * Executes the provided `callback` once for each enumerable own property in the\n * object and constructs a new object from the results. The `callback` is\n * invoked with three arguments:\n *\n *  - the property value\n *  - the property name\n *  - the object being traversed\n *\n * Properties that are added after the call to `mapObject` will not be visited\n * by `callback`. If the values of existing properties are changed, the value\n * passed to `callback` will be the value at the time `mapObject` visits them.\n * Properties that are deleted before being visited are not visited.\n *\n * @grep function objectMap()\n * @grep function objMap()\n *\n * @param {?object} object\n * @param {function} callback\n * @param {*} context\n * @return {?object}\n */\n\nfunction mapObject(object, callback, context) {\n  if (!object) {\n    return null;\n  }\n\n  var result = {};\n\n  for (var name in object) {\n    if (hasOwnProperty.call(object, name)) {\n      result[name] = callback.call(context, object[name], name, object);\n    }\n  }\n\n  return result;\n}\n\nmodule.exports = mapObject;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * \n * @typechecks static-only\n */\n'use strict';\n/**\n * Memoizes the return value of a function that accepts one string argument.\n */\n\nfunction memoizeStringOnly(callback) {\n  var cache = {};\n  return function (string) {\n    if (!cache.hasOwnProperty(string)) {\n      cache[string] = callback.call(this, string);\n    }\n\n    return cache[string];\n  };\n}\n\nmodule.exports = memoizeStringOnly;","\"use strict\";\n\n/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * \n */\nvar nullthrows = function nullthrows(x) {\n  if (x != null) {\n    return x;\n  }\n\n  throw new Error(\"Got unexpected null or undefined\");\n};\n\nmodule.exports = nullthrows;","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n'use strict'; // setimmediate adds setImmediate to the global. We want to make sure we export\n// the actual function.\n\nrequire(\"setimmediate\");\n\nmodule.exports = global.setImmediate;","/**\n * Copyright (c) 2014-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n */\n'use strict';\n\nvar emptyFunction = require(\"./emptyFunction\");\n/**\n * Similar to invariant but only logs a warning if the condition is not met.\n * This can be used to log issues in development environments in critical\n * paths. Removing the logging code for production environments will keep the\n * same logic and follow the same code paths.\n */\n\n\nfunction printWarning(format) {\n  for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    args[_key - 1] = arguments[_key];\n  }\n\n  var argIndex = 0;\n  var message = 'Warning: ' + format.replace(/%s/g, function () {\n    return args[argIndex++];\n  });\n\n  if (typeof console !== 'undefined') {\n    console.error(message);\n  }\n\n  try {\n    // --- Welcome to debugging React ---\n    // This error was thrown as a convenience so that you can use this stack\n    // to find the callsite that caused this warning to fire.\n    throw new Error(message);\n  } catch (x) {}\n}\n\nvar warning = process.env.NODE_ENV !== \"production\" ? function (condition, format) {\n  if (format === undefined) {\n    throw new Error('`warning(condition, format, ...args)` requires a warning ' + 'message argument');\n  }\n\n  if (!condition) {\n    for (var _len2 = arguments.length, args = new Array(_len2 > 2 ? _len2 - 2 : 0), _key2 = 2; _key2 < _len2; _key2++) {\n      args[_key2 - 2] = arguments[_key2];\n    }\n\n    printWarning.apply(void 0, [format].concat(args));\n  }\n} : emptyFunction;\nmodule.exports = warning;","/**\n * Copyright (c) 2014-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n(function (global, factory) {\n  typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n  typeof define === 'function' && define.amd ? define(factory) :\n  (global.Immutable = factory());\n}(this, function () { 'use strict';var SLICE$0 = Array.prototype.slice;\n\n  function createClass(ctor, superClass) {\n    if (superClass) {\n      ctor.prototype = Object.create(superClass.prototype);\n    }\n    ctor.prototype.constructor = ctor;\n  }\n\n  function Iterable(value) {\n      return isIterable(value) ? value : Seq(value);\n    }\n\n\n  createClass(KeyedIterable, Iterable);\n    function KeyedIterable(value) {\n      return isKeyed(value) ? value : KeyedSeq(value);\n    }\n\n\n  createClass(IndexedIterable, Iterable);\n    function IndexedIterable(value) {\n      return isIndexed(value) ? value : IndexedSeq(value);\n    }\n\n\n  createClass(SetIterable, Iterable);\n    function SetIterable(value) {\n      return isIterable(value) && !isAssociative(value) ? value : SetSeq(value);\n    }\n\n\n\n  function isIterable(maybeIterable) {\n    return !!(maybeIterable && maybeIterable[IS_ITERABLE_SENTINEL]);\n  }\n\n  function isKeyed(maybeKeyed) {\n    return !!(maybeKeyed && maybeKeyed[IS_KEYED_SENTINEL]);\n  }\n\n  function isIndexed(maybeIndexed) {\n    return !!(maybeIndexed && maybeIndexed[IS_INDEXED_SENTINEL]);\n  }\n\n  function isAssociative(maybeAssociative) {\n    return isKeyed(maybeAssociative) || isIndexed(maybeAssociative);\n  }\n\n  function isOrdered(maybeOrdered) {\n    return !!(maybeOrdered && maybeOrdered[IS_ORDERED_SENTINEL]);\n  }\n\n  Iterable.isIterable = isIterable;\n  Iterable.isKeyed = isKeyed;\n  Iterable.isIndexed = isIndexed;\n  Iterable.isAssociative = isAssociative;\n  Iterable.isOrdered = isOrdered;\n\n  Iterable.Keyed = KeyedIterable;\n  Iterable.Indexed = IndexedIterable;\n  Iterable.Set = SetIterable;\n\n\n  var IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\n  var IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\n  var IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\n  var IS_ORDERED_SENTINEL = '@@__IMMUTABLE_ORDERED__@@';\n\n  // Used for setting prototype methods that IE8 chokes on.\n  var DELETE = 'delete';\n\n  // Constants describing the size of trie nodes.\n  var SHIFT = 5; // Resulted in best performance after ______?\n  var SIZE = 1 << SHIFT;\n  var MASK = SIZE - 1;\n\n  // A consistent shared value representing \"not set\" which equals nothing other\n  // than itself, and nothing that could be provided externally.\n  var NOT_SET = {};\n\n  // Boolean references, Rough equivalent of `bool &`.\n  var CHANGE_LENGTH = { value: false };\n  var DID_ALTER = { value: false };\n\n  function MakeRef(ref) {\n    ref.value = false;\n    return ref;\n  }\n\n  function SetRef(ref) {\n    ref && (ref.value = true);\n  }\n\n  // A function which returns a value representing an \"owner\" for transient writes\n  // to tries. The return value will only ever equal itself, and will not equal\n  // the return of any subsequent call of this function.\n  function OwnerID() {}\n\n  // http://jsperf.com/copy-array-inline\n  function arrCopy(arr, offset) {\n    offset = offset || 0;\n    var len = Math.max(0, arr.length - offset);\n    var newArr = new Array(len);\n    for (var ii = 0; ii < len; ii++) {\n      newArr[ii] = arr[ii + offset];\n    }\n    return newArr;\n  }\n\n  function ensureSize(iter) {\n    if (iter.size === undefined) {\n      iter.size = iter.__iterate(returnTrue);\n    }\n    return iter.size;\n  }\n\n  function wrapIndex(iter, index) {\n    // This implements \"is array index\" which the ECMAString spec defines as:\n    //\n    //     A String property name P is an array index if and only if\n    //     ToString(ToUint32(P)) is equal to P and ToUint32(P) is not equal\n    //     to 2^32−1.\n    //\n    // http://www.ecma-international.org/ecma-262/6.0/#sec-array-exotic-objects\n    if (typeof index !== 'number') {\n      var uint32Index = index >>> 0; // N >>> 0 is shorthand for ToUint32\n      if ('' + uint32Index !== index || uint32Index === 4294967295) {\n        return NaN;\n      }\n      index = uint32Index;\n    }\n    return index < 0 ? ensureSize(iter) + index : index;\n  }\n\n  function returnTrue() {\n    return true;\n  }\n\n  function wholeSlice(begin, end, size) {\n    return (begin === 0 || (size !== undefined && begin <= -size)) &&\n      (end === undefined || (size !== undefined && end >= size));\n  }\n\n  function resolveBegin(begin, size) {\n    return resolveIndex(begin, size, 0);\n  }\n\n  function resolveEnd(end, size) {\n    return resolveIndex(end, size, size);\n  }\n\n  function resolveIndex(index, size, defaultIndex) {\n    return index === undefined ?\n      defaultIndex :\n      index < 0 ?\n        Math.max(0, size + index) :\n        size === undefined ?\n          index :\n          Math.min(size, index);\n  }\n\n  /* global Symbol */\n\n  var ITERATE_KEYS = 0;\n  var ITERATE_VALUES = 1;\n  var ITERATE_ENTRIES = 2;\n\n  var REAL_ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;\n  var FAUX_ITERATOR_SYMBOL = '@@iterator';\n\n  var ITERATOR_SYMBOL = REAL_ITERATOR_SYMBOL || FAUX_ITERATOR_SYMBOL;\n\n\n  function Iterator(next) {\n      this.next = next;\n    }\n\n    Iterator.prototype.toString = function() {\n      return '[Iterator]';\n    };\n\n\n  Iterator.KEYS = ITERATE_KEYS;\n  Iterator.VALUES = ITERATE_VALUES;\n  Iterator.ENTRIES = ITERATE_ENTRIES;\n\n  Iterator.prototype.inspect =\n  Iterator.prototype.toSource = function () { return this.toString(); }\n  Iterator.prototype[ITERATOR_SYMBOL] = function () {\n    return this;\n  };\n\n\n  function iteratorValue(type, k, v, iteratorResult) {\n    var value = type === 0 ? k : type === 1 ? v : [k, v];\n    iteratorResult ? (iteratorResult.value = value) : (iteratorResult = {\n      value: value, done: false\n    });\n    return iteratorResult;\n  }\n\n  function iteratorDone() {\n    return { value: undefined, done: true };\n  }\n\n  function hasIterator(maybeIterable) {\n    return !!getIteratorFn(maybeIterable);\n  }\n\n  function isIterator(maybeIterator) {\n    return maybeIterator && typeof maybeIterator.next === 'function';\n  }\n\n  function getIterator(iterable) {\n    var iteratorFn = getIteratorFn(iterable);\n    return iteratorFn && iteratorFn.call(iterable);\n  }\n\n  function getIteratorFn(iterable) {\n    var iteratorFn = iterable && (\n      (REAL_ITERATOR_SYMBOL && iterable[REAL_ITERATOR_SYMBOL]) ||\n      iterable[FAUX_ITERATOR_SYMBOL]\n    );\n    if (typeof iteratorFn === 'function') {\n      return iteratorFn;\n    }\n  }\n\n  function isArrayLike(value) {\n    return value && typeof value.length === 'number';\n  }\n\n  createClass(Seq, Iterable);\n    function Seq(value) {\n      return value === null || value === undefined ? emptySequence() :\n        isIterable(value) ? value.toSeq() : seqFromValue(value);\n    }\n\n    Seq.of = function(/*...values*/) {\n      return Seq(arguments);\n    };\n\n    Seq.prototype.toSeq = function() {\n      return this;\n    };\n\n    Seq.prototype.toString = function() {\n      return this.__toString('Seq {', '}');\n    };\n\n    Seq.prototype.cacheResult = function() {\n      if (!this._cache && this.__iterateUncached) {\n        this._cache = this.entrySeq().toArray();\n        this.size = this._cache.length;\n      }\n      return this;\n    };\n\n    // abstract __iterateUncached(fn, reverse)\n\n    Seq.prototype.__iterate = function(fn, reverse) {\n      return seqIterate(this, fn, reverse, true);\n    };\n\n    // abstract __iteratorUncached(type, reverse)\n\n    Seq.prototype.__iterator = function(type, reverse) {\n      return seqIterator(this, type, reverse, true);\n    };\n\n\n\n  createClass(KeyedSeq, Seq);\n    function KeyedSeq(value) {\n      return value === null || value === undefined ?\n        emptySequence().toKeyedSeq() :\n        isIterable(value) ?\n          (isKeyed(value) ? value.toSeq() : value.fromEntrySeq()) :\n          keyedSeqFromValue(value);\n    }\n\n    KeyedSeq.prototype.toKeyedSeq = function() {\n      return this;\n    };\n\n\n\n  createClass(IndexedSeq, Seq);\n    function IndexedSeq(value) {\n      return value === null || value === undefined ? emptySequence() :\n        !isIterable(value) ? indexedSeqFromValue(value) :\n        isKeyed(value) ? value.entrySeq() : value.toIndexedSeq();\n    }\n\n    IndexedSeq.of = function(/*...values*/) {\n      return IndexedSeq(arguments);\n    };\n\n    IndexedSeq.prototype.toIndexedSeq = function() {\n      return this;\n    };\n\n    IndexedSeq.prototype.toString = function() {\n      return this.__toString('Seq [', ']');\n    };\n\n    IndexedSeq.prototype.__iterate = function(fn, reverse) {\n      return seqIterate(this, fn, reverse, false);\n    };\n\n    IndexedSeq.prototype.__iterator = function(type, reverse) {\n      return seqIterator(this, type, reverse, false);\n    };\n\n\n\n  createClass(SetSeq, Seq);\n    function SetSeq(value) {\n      return (\n        value === null || value === undefined ? emptySequence() :\n        !isIterable(value) ? indexedSeqFromValue(value) :\n        isKeyed(value) ? value.entrySeq() : value\n      ).toSetSeq();\n    }\n\n    SetSeq.of = function(/*...values*/) {\n      return SetSeq(arguments);\n    };\n\n    SetSeq.prototype.toSetSeq = function() {\n      return this;\n    };\n\n\n\n  Seq.isSeq = isSeq;\n  Seq.Keyed = KeyedSeq;\n  Seq.Set = SetSeq;\n  Seq.Indexed = IndexedSeq;\n\n  var IS_SEQ_SENTINEL = '@@__IMMUTABLE_SEQ__@@';\n\n  Seq.prototype[IS_SEQ_SENTINEL] = true;\n\n\n\n  createClass(ArraySeq, IndexedSeq);\n    function ArraySeq(array) {\n      this._array = array;\n      this.size = array.length;\n    }\n\n    ArraySeq.prototype.get = function(index, notSetValue) {\n      return this.has(index) ? this._array[wrapIndex(this, index)] : notSetValue;\n    };\n\n    ArraySeq.prototype.__iterate = function(fn, reverse) {\n      var array = this._array;\n      var maxIndex = array.length - 1;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        if (fn(array[reverse ? maxIndex - ii : ii], ii, this) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    };\n\n    ArraySeq.prototype.__iterator = function(type, reverse) {\n      var array = this._array;\n      var maxIndex = array.length - 1;\n      var ii = 0;\n      return new Iterator(function() \n        {return ii > maxIndex ?\n          iteratorDone() :\n          iteratorValue(type, ii, array[reverse ? maxIndex - ii++ : ii++])}\n      );\n    };\n\n\n\n  createClass(ObjectSeq, KeyedSeq);\n    function ObjectSeq(object) {\n      var keys = Object.keys(object);\n      this._object = object;\n      this._keys = keys;\n      this.size = keys.length;\n    }\n\n    ObjectSeq.prototype.get = function(key, notSetValue) {\n      if (notSetValue !== undefined && !this.has(key)) {\n        return notSetValue;\n      }\n      return this._object[key];\n    };\n\n    ObjectSeq.prototype.has = function(key) {\n      return this._object.hasOwnProperty(key);\n    };\n\n    ObjectSeq.prototype.__iterate = function(fn, reverse) {\n      var object = this._object;\n      var keys = this._keys;\n      var maxIndex = keys.length - 1;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        var key = keys[reverse ? maxIndex - ii : ii];\n        if (fn(object[key], key, this) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    };\n\n    ObjectSeq.prototype.__iterator = function(type, reverse) {\n      var object = this._object;\n      var keys = this._keys;\n      var maxIndex = keys.length - 1;\n      var ii = 0;\n      return new Iterator(function()  {\n        var key = keys[reverse ? maxIndex - ii : ii];\n        return ii++ > maxIndex ?\n          iteratorDone() :\n          iteratorValue(type, key, object[key]);\n      });\n    };\n\n  ObjectSeq.prototype[IS_ORDERED_SENTINEL] = true;\n\n\n  createClass(IterableSeq, IndexedSeq);\n    function IterableSeq(iterable) {\n      this._iterable = iterable;\n      this.size = iterable.length || iterable.size;\n    }\n\n    IterableSeq.prototype.__iterateUncached = function(fn, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var iterable = this._iterable;\n      var iterator = getIterator(iterable);\n      var iterations = 0;\n      if (isIterator(iterator)) {\n        var step;\n        while (!(step = iterator.next()).done) {\n          if (fn(step.value, iterations++, this) === false) {\n            break;\n          }\n        }\n      }\n      return iterations;\n    };\n\n    IterableSeq.prototype.__iteratorUncached = function(type, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterable = this._iterable;\n      var iterator = getIterator(iterable);\n      if (!isIterator(iterator)) {\n        return new Iterator(iteratorDone);\n      }\n      var iterations = 0;\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step : iteratorValue(type, iterations++, step.value);\n      });\n    };\n\n\n\n  createClass(IteratorSeq, IndexedSeq);\n    function IteratorSeq(iterator) {\n      this._iterator = iterator;\n      this._iteratorCache = [];\n    }\n\n    IteratorSeq.prototype.__iterateUncached = function(fn, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var iterator = this._iterator;\n      var cache = this._iteratorCache;\n      var iterations = 0;\n      while (iterations < cache.length) {\n        if (fn(cache[iterations], iterations++, this) === false) {\n          return iterations;\n        }\n      }\n      var step;\n      while (!(step = iterator.next()).done) {\n        var val = step.value;\n        cache[iterations] = val;\n        if (fn(val, iterations++, this) === false) {\n          break;\n        }\n      }\n      return iterations;\n    };\n\n    IteratorSeq.prototype.__iteratorUncached = function(type, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterator = this._iterator;\n      var cache = this._iteratorCache;\n      var iterations = 0;\n      return new Iterator(function()  {\n        if (iterations >= cache.length) {\n          var step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n          cache[iterations] = step.value;\n        }\n        return iteratorValue(type, iterations, cache[iterations++]);\n      });\n    };\n\n\n\n\n  // # pragma Helper functions\n\n  function isSeq(maybeSeq) {\n    return !!(maybeSeq && maybeSeq[IS_SEQ_SENTINEL]);\n  }\n\n  var EMPTY_SEQ;\n\n  function emptySequence() {\n    return EMPTY_SEQ || (EMPTY_SEQ = new ArraySeq([]));\n  }\n\n  function keyedSeqFromValue(value) {\n    var seq =\n      Array.isArray(value) ? new ArraySeq(value).fromEntrySeq() :\n      isIterator(value) ? new IteratorSeq(value).fromEntrySeq() :\n      hasIterator(value) ? new IterableSeq(value).fromEntrySeq() :\n      typeof value === 'object' ? new ObjectSeq(value) :\n      undefined;\n    if (!seq) {\n      throw new TypeError(\n        'Expected Array or iterable object of [k, v] entries, '+\n        'or keyed object: ' + value\n      );\n    }\n    return seq;\n  }\n\n  function indexedSeqFromValue(value) {\n    var seq = maybeIndexedSeqFromValue(value);\n    if (!seq) {\n      throw new TypeError(\n        'Expected Array or iterable object of values: ' + value\n      );\n    }\n    return seq;\n  }\n\n  function seqFromValue(value) {\n    var seq = maybeIndexedSeqFromValue(value) ||\n      (typeof value === 'object' && new ObjectSeq(value));\n    if (!seq) {\n      throw new TypeError(\n        'Expected Array or iterable object of values, or keyed object: ' + value\n      );\n    }\n    return seq;\n  }\n\n  function maybeIndexedSeqFromValue(value) {\n    return (\n      isArrayLike(value) ? new ArraySeq(value) :\n      isIterator(value) ? new IteratorSeq(value) :\n      hasIterator(value) ? new IterableSeq(value) :\n      undefined\n    );\n  }\n\n  function seqIterate(seq, fn, reverse, useKeys) {\n    var cache = seq._cache;\n    if (cache) {\n      var maxIndex = cache.length - 1;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        var entry = cache[reverse ? maxIndex - ii : ii];\n        if (fn(entry[1], useKeys ? entry[0] : ii, seq) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    }\n    return seq.__iterateUncached(fn, reverse);\n  }\n\n  function seqIterator(seq, type, reverse, useKeys) {\n    var cache = seq._cache;\n    if (cache) {\n      var maxIndex = cache.length - 1;\n      var ii = 0;\n      return new Iterator(function()  {\n        var entry = cache[reverse ? maxIndex - ii : ii];\n        return ii++ > maxIndex ?\n          iteratorDone() :\n          iteratorValue(type, useKeys ? entry[0] : ii - 1, entry[1]);\n      });\n    }\n    return seq.__iteratorUncached(type, reverse);\n  }\n\n  function fromJS(json, converter) {\n    return converter ?\n      fromJSWith(converter, json, '', {'': json}) :\n      fromJSDefault(json);\n  }\n\n  function fromJSWith(converter, json, key, parentJSON) {\n    if (Array.isArray(json)) {\n      return converter.call(parentJSON, key, IndexedSeq(json).map(function(v, k)  {return fromJSWith(converter, v, k, json)}));\n    }\n    if (isPlainObj(json)) {\n      return converter.call(parentJSON, key, KeyedSeq(json).map(function(v, k)  {return fromJSWith(converter, v, k, json)}));\n    }\n    return json;\n  }\n\n  function fromJSDefault(json) {\n    if (Array.isArray(json)) {\n      return IndexedSeq(json).map(fromJSDefault).toList();\n    }\n    if (isPlainObj(json)) {\n      return KeyedSeq(json).map(fromJSDefault).toMap();\n    }\n    return json;\n  }\n\n  function isPlainObj(value) {\n    return value && (value.constructor === Object || value.constructor === undefined);\n  }\n\n  /**\n   * An extension of the \"same-value\" algorithm as [described for use by ES6 Map\n   * and Set](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map#Key_equality)\n   *\n   * NaN is considered the same as NaN, however -0 and 0 are considered the same\n   * value, which is different from the algorithm described by\n   * [`Object.is`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is).\n   *\n   * This is extended further to allow Objects to describe the values they\n   * represent, by way of `valueOf` or `equals` (and `hashCode`).\n   *\n   * Note: because of this extension, the key equality of Immutable.Map and the\n   * value equality of Immutable.Set will differ from ES6 Map and Set.\n   *\n   * ### Defining custom values\n   *\n   * The easiest way to describe the value an object represents is by implementing\n   * `valueOf`. For example, `Date` represents a value by returning a unix\n   * timestamp for `valueOf`:\n   *\n   *     var date1 = new Date(1234567890000); // Fri Feb 13 2009 ...\n   *     var date2 = new Date(1234567890000);\n   *     date1.valueOf(); // 1234567890000\n   *     assert( date1 !== date2 );\n   *     assert( Immutable.is( date1, date2 ) );\n   *\n   * Note: overriding `valueOf` may have other implications if you use this object\n   * where JavaScript expects a primitive, such as implicit string coercion.\n   *\n   * For more complex types, especially collections, implementing `valueOf` may\n   * not be performant. An alternative is to implement `equals` and `hashCode`.\n   *\n   * `equals` takes another object, presumably of similar type, and returns true\n   * if the it is equal. Equality is symmetrical, so the same result should be\n   * returned if this and the argument are flipped.\n   *\n   *     assert( a.equals(b) === b.equals(a) );\n   *\n   * `hashCode` returns a 32bit integer number representing the object which will\n   * be used to determine how to store the value object in a Map or Set. You must\n   * provide both or neither methods, one must not exist without the other.\n   *\n   * Also, an important relationship between these methods must be upheld: if two\n   * values are equal, they *must* return the same hashCode. If the values are not\n   * equal, they might have the same hashCode; this is called a hash collision,\n   * and while undesirable for performance reasons, it is acceptable.\n   *\n   *     if (a.equals(b)) {\n   *       assert( a.hashCode() === b.hashCode() );\n   *     }\n   *\n   * All Immutable collections implement `equals` and `hashCode`.\n   *\n   */\n  function is(valueA, valueB) {\n    if (valueA === valueB || (valueA !== valueA && valueB !== valueB)) {\n      return true;\n    }\n    if (!valueA || !valueB) {\n      return false;\n    }\n    if (typeof valueA.valueOf === 'function' &&\n        typeof valueB.valueOf === 'function') {\n      valueA = valueA.valueOf();\n      valueB = valueB.valueOf();\n      if (valueA === valueB || (valueA !== valueA && valueB !== valueB)) {\n        return true;\n      }\n      if (!valueA || !valueB) {\n        return false;\n      }\n    }\n    if (typeof valueA.equals === 'function' &&\n        typeof valueB.equals === 'function' &&\n        valueA.equals(valueB)) {\n      return true;\n    }\n    return false;\n  }\n\n  function deepEqual(a, b) {\n    if (a === b) {\n      return true;\n    }\n\n    if (\n      !isIterable(b) ||\n      a.size !== undefined && b.size !== undefined && a.size !== b.size ||\n      a.__hash !== undefined && b.__hash !== undefined && a.__hash !== b.__hash ||\n      isKeyed(a) !== isKeyed(b) ||\n      isIndexed(a) !== isIndexed(b) ||\n      isOrdered(a) !== isOrdered(b)\n    ) {\n      return false;\n    }\n\n    if (a.size === 0 && b.size === 0) {\n      return true;\n    }\n\n    var notAssociative = !isAssociative(a);\n\n    if (isOrdered(a)) {\n      var entries = a.entries();\n      return b.every(function(v, k)  {\n        var entry = entries.next().value;\n        return entry && is(entry[1], v) && (notAssociative || is(entry[0], k));\n      }) && entries.next().done;\n    }\n\n    var flipped = false;\n\n    if (a.size === undefined) {\n      if (b.size === undefined) {\n        if (typeof a.cacheResult === 'function') {\n          a.cacheResult();\n        }\n      } else {\n        flipped = true;\n        var _ = a;\n        a = b;\n        b = _;\n      }\n    }\n\n    var allEqual = true;\n    var bSize = b.__iterate(function(v, k)  {\n      if (notAssociative ? !a.has(v) :\n          flipped ? !is(v, a.get(k, NOT_SET)) : !is(a.get(k, NOT_SET), v)) {\n        allEqual = false;\n        return false;\n      }\n    });\n\n    return allEqual && a.size === bSize;\n  }\n\n  createClass(Repeat, IndexedSeq);\n\n    function Repeat(value, times) {\n      if (!(this instanceof Repeat)) {\n        return new Repeat(value, times);\n      }\n      this._value = value;\n      this.size = times === undefined ? Infinity : Math.max(0, times);\n      if (this.size === 0) {\n        if (EMPTY_REPEAT) {\n          return EMPTY_REPEAT;\n        }\n        EMPTY_REPEAT = this;\n      }\n    }\n\n    Repeat.prototype.toString = function() {\n      if (this.size === 0) {\n        return 'Repeat []';\n      }\n      return 'Repeat [ ' + this._value + ' ' + this.size + ' times ]';\n    };\n\n    Repeat.prototype.get = function(index, notSetValue) {\n      return this.has(index) ? this._value : notSetValue;\n    };\n\n    Repeat.prototype.includes = function(searchValue) {\n      return is(this._value, searchValue);\n    };\n\n    Repeat.prototype.slice = function(begin, end) {\n      var size = this.size;\n      return wholeSlice(begin, end, size) ? this :\n        new Repeat(this._value, resolveEnd(end, size) - resolveBegin(begin, size));\n    };\n\n    Repeat.prototype.reverse = function() {\n      return this;\n    };\n\n    Repeat.prototype.indexOf = function(searchValue) {\n      if (is(this._value, searchValue)) {\n        return 0;\n      }\n      return -1;\n    };\n\n    Repeat.prototype.lastIndexOf = function(searchValue) {\n      if (is(this._value, searchValue)) {\n        return this.size;\n      }\n      return -1;\n    };\n\n    Repeat.prototype.__iterate = function(fn, reverse) {\n      for (var ii = 0; ii < this.size; ii++) {\n        if (fn(this._value, ii, this) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    };\n\n    Repeat.prototype.__iterator = function(type, reverse) {var this$0 = this;\n      var ii = 0;\n      return new Iterator(function() \n        {return ii < this$0.size ? iteratorValue(type, ii++, this$0._value) : iteratorDone()}\n      );\n    };\n\n    Repeat.prototype.equals = function(other) {\n      return other instanceof Repeat ?\n        is(this._value, other._value) :\n        deepEqual(other);\n    };\n\n\n  var EMPTY_REPEAT;\n\n  function invariant(condition, error) {\n    if (!condition) throw new Error(error);\n  }\n\n  createClass(Range, IndexedSeq);\n\n    function Range(start, end, step) {\n      if (!(this instanceof Range)) {\n        return new Range(start, end, step);\n      }\n      invariant(step !== 0, 'Cannot step a Range by 0');\n      start = start || 0;\n      if (end === undefined) {\n        end = Infinity;\n      }\n      step = step === undefined ? 1 : Math.abs(step);\n      if (end < start) {\n        step = -step;\n      }\n      this._start = start;\n      this._end = end;\n      this._step = step;\n      this.size = Math.max(0, Math.ceil((end - start) / step - 1) + 1);\n      if (this.size === 0) {\n        if (EMPTY_RANGE) {\n          return EMPTY_RANGE;\n        }\n        EMPTY_RANGE = this;\n      }\n    }\n\n    Range.prototype.toString = function() {\n      if (this.size === 0) {\n        return 'Range []';\n      }\n      return 'Range [ ' +\n        this._start + '...' + this._end +\n        (this._step !== 1 ? ' by ' + this._step : '') +\n      ' ]';\n    };\n\n    Range.prototype.get = function(index, notSetValue) {\n      return this.has(index) ?\n        this._start + wrapIndex(this, index) * this._step :\n        notSetValue;\n    };\n\n    Range.prototype.includes = function(searchValue) {\n      var possibleIndex = (searchValue - this._start) / this._step;\n      return possibleIndex >= 0 &&\n        possibleIndex < this.size &&\n        possibleIndex === Math.floor(possibleIndex);\n    };\n\n    Range.prototype.slice = function(begin, end) {\n      if (wholeSlice(begin, end, this.size)) {\n        return this;\n      }\n      begin = resolveBegin(begin, this.size);\n      end = resolveEnd(end, this.size);\n      if (end <= begin) {\n        return new Range(0, 0);\n      }\n      return new Range(this.get(begin, this._end), this.get(end, this._end), this._step);\n    };\n\n    Range.prototype.indexOf = function(searchValue) {\n      var offsetValue = searchValue - this._start;\n      if (offsetValue % this._step === 0) {\n        var index = offsetValue / this._step;\n        if (index >= 0 && index < this.size) {\n          return index\n        }\n      }\n      return -1;\n    };\n\n    Range.prototype.lastIndexOf = function(searchValue) {\n      return this.indexOf(searchValue);\n    };\n\n    Range.prototype.__iterate = function(fn, reverse) {\n      var maxIndex = this.size - 1;\n      var step = this._step;\n      var value = reverse ? this._start + maxIndex * step : this._start;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        if (fn(value, ii, this) === false) {\n          return ii + 1;\n        }\n        value += reverse ? -step : step;\n      }\n      return ii;\n    };\n\n    Range.prototype.__iterator = function(type, reverse) {\n      var maxIndex = this.size - 1;\n      var step = this._step;\n      var value = reverse ? this._start + maxIndex * step : this._start;\n      var ii = 0;\n      return new Iterator(function()  {\n        var v = value;\n        value += reverse ? -step : step;\n        return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii++, v);\n      });\n    };\n\n    Range.prototype.equals = function(other) {\n      return other instanceof Range ?\n        this._start === other._start &&\n        this._end === other._end &&\n        this._step === other._step :\n        deepEqual(this, other);\n    };\n\n\n  var EMPTY_RANGE;\n\n  createClass(Collection, Iterable);\n    function Collection() {\n      throw TypeError('Abstract');\n    }\n\n\n  createClass(KeyedCollection, Collection);function KeyedCollection() {}\n\n  createClass(IndexedCollection, Collection);function IndexedCollection() {}\n\n  createClass(SetCollection, Collection);function SetCollection() {}\n\n\n  Collection.Keyed = KeyedCollection;\n  Collection.Indexed = IndexedCollection;\n  Collection.Set = SetCollection;\n\n  var imul =\n    typeof Math.imul === 'function' && Math.imul(0xffffffff, 2) === -2 ?\n    Math.imul :\n    function imul(a, b) {\n      a = a | 0; // int\n      b = b | 0; // int\n      var c = a & 0xffff;\n      var d = b & 0xffff;\n      // Shift by 0 fixes the sign on the high part.\n      return (c * d) + ((((a >>> 16) * d + c * (b >>> 16)) << 16) >>> 0) | 0; // int\n    };\n\n  // v8 has an optimization for storing 31-bit signed numbers.\n  // Values which have either 00 or 11 as the high order bits qualify.\n  // This function drops the highest order bit in a signed number, maintaining\n  // the sign bit.\n  function smi(i32) {\n    return ((i32 >>> 1) & 0x40000000) | (i32 & 0xBFFFFFFF);\n  }\n\n  function hash(o) {\n    if (o === false || o === null || o === undefined) {\n      return 0;\n    }\n    if (typeof o.valueOf === 'function') {\n      o = o.valueOf();\n      if (o === false || o === null || o === undefined) {\n        return 0;\n      }\n    }\n    if (o === true) {\n      return 1;\n    }\n    var type = typeof o;\n    if (type === 'number') {\n      if (o !== o || o === Infinity) {\n        return 0;\n      }\n      var h = o | 0;\n      if (h !== o) {\n        h ^= o * 0xFFFFFFFF;\n      }\n      while (o > 0xFFFFFFFF) {\n        o /= 0xFFFFFFFF;\n        h ^= o;\n      }\n      return smi(h);\n    }\n    if (type === 'string') {\n      return o.length > STRING_HASH_CACHE_MIN_STRLEN ? cachedHashString(o) : hashString(o);\n    }\n    if (typeof o.hashCode === 'function') {\n      return o.hashCode();\n    }\n    if (type === 'object') {\n      return hashJSObj(o);\n    }\n    if (typeof o.toString === 'function') {\n      return hashString(o.toString());\n    }\n    throw new Error('Value type ' + type + ' cannot be hashed.');\n  }\n\n  function cachedHashString(string) {\n    var hash = stringHashCache[string];\n    if (hash === undefined) {\n      hash = hashString(string);\n      if (STRING_HASH_CACHE_SIZE === STRING_HASH_CACHE_MAX_SIZE) {\n        STRING_HASH_CACHE_SIZE = 0;\n        stringHashCache = {};\n      }\n      STRING_HASH_CACHE_SIZE++;\n      stringHashCache[string] = hash;\n    }\n    return hash;\n  }\n\n  // http://jsperf.com/hashing-strings\n  function hashString(string) {\n    // This is the hash from JVM\n    // The hash code for a string is computed as\n    // s[0] * 31 ^ (n - 1) + s[1] * 31 ^ (n - 2) + ... + s[n - 1],\n    // where s[i] is the ith character of the string and n is the length of\n    // the string. We \"mod\" the result to make it between 0 (inclusive) and 2^31\n    // (exclusive) by dropping high bits.\n    var hash = 0;\n    for (var ii = 0; ii < string.length; ii++) {\n      hash = 31 * hash + string.charCodeAt(ii) | 0;\n    }\n    return smi(hash);\n  }\n\n  function hashJSObj(obj) {\n    var hash;\n    if (usingWeakMap) {\n      hash = weakMap.get(obj);\n      if (hash !== undefined) {\n        return hash;\n      }\n    }\n\n    hash = obj[UID_HASH_KEY];\n    if (hash !== undefined) {\n      return hash;\n    }\n\n    if (!canDefineProperty) {\n      hash = obj.propertyIsEnumerable && obj.propertyIsEnumerable[UID_HASH_KEY];\n      if (hash !== undefined) {\n        return hash;\n      }\n\n      hash = getIENodeHash(obj);\n      if (hash !== undefined) {\n        return hash;\n      }\n    }\n\n    hash = ++objHashUID;\n    if (objHashUID & 0x40000000) {\n      objHashUID = 0;\n    }\n\n    if (usingWeakMap) {\n      weakMap.set(obj, hash);\n    } else if (isExtensible !== undefined && isExtensible(obj) === false) {\n      throw new Error('Non-extensible objects are not allowed as keys.');\n    } else if (canDefineProperty) {\n      Object.defineProperty(obj, UID_HASH_KEY, {\n        'enumerable': false,\n        'configurable': false,\n        'writable': false,\n        'value': hash\n      });\n    } else if (obj.propertyIsEnumerable !== undefined &&\n               obj.propertyIsEnumerable === obj.constructor.prototype.propertyIsEnumerable) {\n      // Since we can't define a non-enumerable property on the object\n      // we'll hijack one of the less-used non-enumerable properties to\n      // save our hash on it. Since this is a function it will not show up in\n      // `JSON.stringify` which is what we want.\n      obj.propertyIsEnumerable = function() {\n        return this.constructor.prototype.propertyIsEnumerable.apply(this, arguments);\n      };\n      obj.propertyIsEnumerable[UID_HASH_KEY] = hash;\n    } else if (obj.nodeType !== undefined) {\n      // At this point we couldn't get the IE `uniqueID` to use as a hash\n      // and we couldn't use a non-enumerable property to exploit the\n      // dontEnum bug so we simply add the `UID_HASH_KEY` on the node\n      // itself.\n      obj[UID_HASH_KEY] = hash;\n    } else {\n      throw new Error('Unable to set a non-enumerable property on object.');\n    }\n\n    return hash;\n  }\n\n  // Get references to ES5 object methods.\n  var isExtensible = Object.isExtensible;\n\n  // True if Object.defineProperty works as expected. IE8 fails this test.\n  var canDefineProperty = (function() {\n    try {\n      Object.defineProperty({}, '@', {});\n      return true;\n    } catch (e) {\n      return false;\n    }\n  }());\n\n  // IE has a `uniqueID` property on DOM nodes. We can construct the hash from it\n  // and avoid memory leaks from the IE cloneNode bug.\n  function getIENodeHash(node) {\n    if (node && node.nodeType > 0) {\n      switch (node.nodeType) {\n        case 1: // Element\n          return node.uniqueID;\n        case 9: // Document\n          return node.documentElement && node.documentElement.uniqueID;\n      }\n    }\n  }\n\n  // If possible, use a WeakMap.\n  var usingWeakMap = typeof WeakMap === 'function';\n  var weakMap;\n  if (usingWeakMap) {\n    weakMap = new WeakMap();\n  }\n\n  var objHashUID = 0;\n\n  var UID_HASH_KEY = '__immutablehash__';\n  if (typeof Symbol === 'function') {\n    UID_HASH_KEY = Symbol(UID_HASH_KEY);\n  }\n\n  var STRING_HASH_CACHE_MIN_STRLEN = 16;\n  var STRING_HASH_CACHE_MAX_SIZE = 255;\n  var STRING_HASH_CACHE_SIZE = 0;\n  var stringHashCache = {};\n\n  function assertNotInfinite(size) {\n    invariant(\n      size !== Infinity,\n      'Cannot perform this action with an infinite size.'\n    );\n  }\n\n  createClass(Map, KeyedCollection);\n\n    // @pragma Construction\n\n    function Map(value) {\n      return value === null || value === undefined ? emptyMap() :\n        isMap(value) && !isOrdered(value) ? value :\n        emptyMap().withMutations(function(map ) {\n          var iter = KeyedIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v, k)  {return map.set(k, v)});\n        });\n    }\n\n    Map.of = function() {var keyValues = SLICE$0.call(arguments, 0);\n      return emptyMap().withMutations(function(map ) {\n        for (var i = 0; i < keyValues.length; i += 2) {\n          if (i + 1 >= keyValues.length) {\n            throw new Error('Missing value for key: ' + keyValues[i]);\n          }\n          map.set(keyValues[i], keyValues[i + 1]);\n        }\n      });\n    };\n\n    Map.prototype.toString = function() {\n      return this.__toString('Map {', '}');\n    };\n\n    // @pragma Access\n\n    Map.prototype.get = function(k, notSetValue) {\n      return this._root ?\n        this._root.get(0, undefined, k, notSetValue) :\n        notSetValue;\n    };\n\n    // @pragma Modification\n\n    Map.prototype.set = function(k, v) {\n      return updateMap(this, k, v);\n    };\n\n    Map.prototype.setIn = function(keyPath, v) {\n      return this.updateIn(keyPath, NOT_SET, function()  {return v});\n    };\n\n    Map.prototype.remove = function(k) {\n      return updateMap(this, k, NOT_SET);\n    };\n\n    Map.prototype.deleteIn = function(keyPath) {\n      return this.updateIn(keyPath, function()  {return NOT_SET});\n    };\n\n    Map.prototype.update = function(k, notSetValue, updater) {\n      return arguments.length === 1 ?\n        k(this) :\n        this.updateIn([k], notSetValue, updater);\n    };\n\n    Map.prototype.updateIn = function(keyPath, notSetValue, updater) {\n      if (!updater) {\n        updater = notSetValue;\n        notSetValue = undefined;\n      }\n      var updatedValue = updateInDeepMap(\n        this,\n        forceIterator(keyPath),\n        notSetValue,\n        updater\n      );\n      return updatedValue === NOT_SET ? undefined : updatedValue;\n    };\n\n    Map.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = 0;\n        this._root = null;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return emptyMap();\n    };\n\n    // @pragma Composition\n\n    Map.prototype.merge = function(/*...iters*/) {\n      return mergeIntoMapWith(this, undefined, arguments);\n    };\n\n    Map.prototype.mergeWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoMapWith(this, merger, iters);\n    };\n\n    Map.prototype.mergeIn = function(keyPath) {var iters = SLICE$0.call(arguments, 1);\n      return this.updateIn(\n        keyPath,\n        emptyMap(),\n        function(m ) {return typeof m.merge === 'function' ?\n          m.merge.apply(m, iters) :\n          iters[iters.length - 1]}\n      );\n    };\n\n    Map.prototype.mergeDeep = function(/*...iters*/) {\n      return mergeIntoMapWith(this, deepMerger, arguments);\n    };\n\n    Map.prototype.mergeDeepWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoMapWith(this, deepMergerWith(merger), iters);\n    };\n\n    Map.prototype.mergeDeepIn = function(keyPath) {var iters = SLICE$0.call(arguments, 1);\n      return this.updateIn(\n        keyPath,\n        emptyMap(),\n        function(m ) {return typeof m.mergeDeep === 'function' ?\n          m.mergeDeep.apply(m, iters) :\n          iters[iters.length - 1]}\n      );\n    };\n\n    Map.prototype.sort = function(comparator) {\n      // Late binding\n      return OrderedMap(sortFactory(this, comparator));\n    };\n\n    Map.prototype.sortBy = function(mapper, comparator) {\n      // Late binding\n      return OrderedMap(sortFactory(this, comparator, mapper));\n    };\n\n    // @pragma Mutability\n\n    Map.prototype.withMutations = function(fn) {\n      var mutable = this.asMutable();\n      fn(mutable);\n      return mutable.wasAltered() ? mutable.__ensureOwner(this.__ownerID) : this;\n    };\n\n    Map.prototype.asMutable = function() {\n      return this.__ownerID ? this : this.__ensureOwner(new OwnerID());\n    };\n\n    Map.prototype.asImmutable = function() {\n      return this.__ensureOwner();\n    };\n\n    Map.prototype.wasAltered = function() {\n      return this.__altered;\n    };\n\n    Map.prototype.__iterator = function(type, reverse) {\n      return new MapIterator(this, type, reverse);\n    };\n\n    Map.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      this._root && this._root.iterate(function(entry ) {\n        iterations++;\n        return fn(entry[1], entry[0], this$0);\n      }, reverse);\n      return iterations;\n    };\n\n    Map.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this.__altered = false;\n        return this;\n      }\n      return makeMap(this.size, this._root, ownerID, this.__hash);\n    };\n\n\n  function isMap(maybeMap) {\n    return !!(maybeMap && maybeMap[IS_MAP_SENTINEL]);\n  }\n\n  Map.isMap = isMap;\n\n  var IS_MAP_SENTINEL = '@@__IMMUTABLE_MAP__@@';\n\n  var MapPrototype = Map.prototype;\n  MapPrototype[IS_MAP_SENTINEL] = true;\n  MapPrototype[DELETE] = MapPrototype.remove;\n  MapPrototype.removeIn = MapPrototype.deleteIn;\n\n\n  // #pragma Trie Nodes\n\n\n\n    function ArrayMapNode(ownerID, entries) {\n      this.ownerID = ownerID;\n      this.entries = entries;\n    }\n\n    ArrayMapNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      var entries = this.entries;\n      for (var ii = 0, len = entries.length; ii < len; ii++) {\n        if (is(key, entries[ii][0])) {\n          return entries[ii][1];\n        }\n      }\n      return notSetValue;\n    };\n\n    ArrayMapNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      var removed = value === NOT_SET;\n\n      var entries = this.entries;\n      var idx = 0;\n      for (var len = entries.length; idx < len; idx++) {\n        if (is(key, entries[idx][0])) {\n          break;\n        }\n      }\n      var exists = idx < len;\n\n      if (exists ? entries[idx][1] === value : removed) {\n        return this;\n      }\n\n      SetRef(didAlter);\n      (removed || !exists) && SetRef(didChangeSize);\n\n      if (removed && entries.length === 1) {\n        return; // undefined\n      }\n\n      if (!exists && !removed && entries.length >= MAX_ARRAY_MAP_SIZE) {\n        return createNodes(ownerID, entries, key, value);\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newEntries = isEditable ? entries : arrCopy(entries);\n\n      if (exists) {\n        if (removed) {\n          idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\n        } else {\n          newEntries[idx] = [key, value];\n        }\n      } else {\n        newEntries.push([key, value]);\n      }\n\n      if (isEditable) {\n        this.entries = newEntries;\n        return this;\n      }\n\n      return new ArrayMapNode(ownerID, newEntries);\n    };\n\n\n\n\n    function BitmapIndexedNode(ownerID, bitmap, nodes) {\n      this.ownerID = ownerID;\n      this.bitmap = bitmap;\n      this.nodes = nodes;\n    }\n\n    BitmapIndexedNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var bit = (1 << ((shift === 0 ? keyHash : keyHash >>> shift) & MASK));\n      var bitmap = this.bitmap;\n      return (bitmap & bit) === 0 ? notSetValue :\n        this.nodes[popCount(bitmap & (bit - 1))].get(shift + SHIFT, keyHash, key, notSetValue);\n    };\n\n    BitmapIndexedNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var keyHashFrag = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n      var bit = 1 << keyHashFrag;\n      var bitmap = this.bitmap;\n      var exists = (bitmap & bit) !== 0;\n\n      if (!exists && value === NOT_SET) {\n        return this;\n      }\n\n      var idx = popCount(bitmap & (bit - 1));\n      var nodes = this.nodes;\n      var node = exists ? nodes[idx] : undefined;\n      var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\n\n      if (newNode === node) {\n        return this;\n      }\n\n      if (!exists && newNode && nodes.length >= MAX_BITMAP_INDEXED_SIZE) {\n        return expandNodes(ownerID, nodes, bitmap, keyHashFrag, newNode);\n      }\n\n      if (exists && !newNode && nodes.length === 2 && isLeafNode(nodes[idx ^ 1])) {\n        return nodes[idx ^ 1];\n      }\n\n      if (exists && newNode && nodes.length === 1 && isLeafNode(newNode)) {\n        return newNode;\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newBitmap = exists ? newNode ? bitmap : bitmap ^ bit : bitmap | bit;\n      var newNodes = exists ? newNode ?\n        setIn(nodes, idx, newNode, isEditable) :\n        spliceOut(nodes, idx, isEditable) :\n        spliceIn(nodes, idx, newNode, isEditable);\n\n      if (isEditable) {\n        this.bitmap = newBitmap;\n        this.nodes = newNodes;\n        return this;\n      }\n\n      return new BitmapIndexedNode(ownerID, newBitmap, newNodes);\n    };\n\n\n\n\n    function HashArrayMapNode(ownerID, count, nodes) {\n      this.ownerID = ownerID;\n      this.count = count;\n      this.nodes = nodes;\n    }\n\n    HashArrayMapNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n      var node = this.nodes[idx];\n      return node ? node.get(shift + SHIFT, keyHash, key, notSetValue) : notSetValue;\n    };\n\n    HashArrayMapNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n      var removed = value === NOT_SET;\n      var nodes = this.nodes;\n      var node = nodes[idx];\n\n      if (removed && !node) {\n        return this;\n      }\n\n      var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\n      if (newNode === node) {\n        return this;\n      }\n\n      var newCount = this.count;\n      if (!node) {\n        newCount++;\n      } else if (!newNode) {\n        newCount--;\n        if (newCount < MIN_HASH_ARRAY_MAP_SIZE) {\n          return packNodes(ownerID, nodes, newCount, idx);\n        }\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newNodes = setIn(nodes, idx, newNode, isEditable);\n\n      if (isEditable) {\n        this.count = newCount;\n        this.nodes = newNodes;\n        return this;\n      }\n\n      return new HashArrayMapNode(ownerID, newCount, newNodes);\n    };\n\n\n\n\n    function HashCollisionNode(ownerID, keyHash, entries) {\n      this.ownerID = ownerID;\n      this.keyHash = keyHash;\n      this.entries = entries;\n    }\n\n    HashCollisionNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      var entries = this.entries;\n      for (var ii = 0, len = entries.length; ii < len; ii++) {\n        if (is(key, entries[ii][0])) {\n          return entries[ii][1];\n        }\n      }\n      return notSetValue;\n    };\n\n    HashCollisionNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n\n      var removed = value === NOT_SET;\n\n      if (keyHash !== this.keyHash) {\n        if (removed) {\n          return this;\n        }\n        SetRef(didAlter);\n        SetRef(didChangeSize);\n        return mergeIntoNode(this, ownerID, shift, keyHash, [key, value]);\n      }\n\n      var entries = this.entries;\n      var idx = 0;\n      for (var len = entries.length; idx < len; idx++) {\n        if (is(key, entries[idx][0])) {\n          break;\n        }\n      }\n      var exists = idx < len;\n\n      if (exists ? entries[idx][1] === value : removed) {\n        return this;\n      }\n\n      SetRef(didAlter);\n      (removed || !exists) && SetRef(didChangeSize);\n\n      if (removed && len === 2) {\n        return new ValueNode(ownerID, this.keyHash, entries[idx ^ 1]);\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newEntries = isEditable ? entries : arrCopy(entries);\n\n      if (exists) {\n        if (removed) {\n          idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\n        } else {\n          newEntries[idx] = [key, value];\n        }\n      } else {\n        newEntries.push([key, value]);\n      }\n\n      if (isEditable) {\n        this.entries = newEntries;\n        return this;\n      }\n\n      return new HashCollisionNode(ownerID, this.keyHash, newEntries);\n    };\n\n\n\n\n    function ValueNode(ownerID, keyHash, entry) {\n      this.ownerID = ownerID;\n      this.keyHash = keyHash;\n      this.entry = entry;\n    }\n\n    ValueNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      return is(key, this.entry[0]) ? this.entry[1] : notSetValue;\n    };\n\n    ValueNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      var removed = value === NOT_SET;\n      var keyMatch = is(key, this.entry[0]);\n      if (keyMatch ? value === this.entry[1] : removed) {\n        return this;\n      }\n\n      SetRef(didAlter);\n\n      if (removed) {\n        SetRef(didChangeSize);\n        return; // undefined\n      }\n\n      if (keyMatch) {\n        if (ownerID && ownerID === this.ownerID) {\n          this.entry[1] = value;\n          return this;\n        }\n        return new ValueNode(ownerID, this.keyHash, [key, value]);\n      }\n\n      SetRef(didChangeSize);\n      return mergeIntoNode(this, ownerID, shift, hash(key), [key, value]);\n    };\n\n\n\n  // #pragma Iterators\n\n  ArrayMapNode.prototype.iterate =\n  HashCollisionNode.prototype.iterate = function (fn, reverse) {\n    var entries = this.entries;\n    for (var ii = 0, maxIndex = entries.length - 1; ii <= maxIndex; ii++) {\n      if (fn(entries[reverse ? maxIndex - ii : ii]) === false) {\n        return false;\n      }\n    }\n  }\n\n  BitmapIndexedNode.prototype.iterate =\n  HashArrayMapNode.prototype.iterate = function (fn, reverse) {\n    var nodes = this.nodes;\n    for (var ii = 0, maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\n      var node = nodes[reverse ? maxIndex - ii : ii];\n      if (node && node.iterate(fn, reverse) === false) {\n        return false;\n      }\n    }\n  }\n\n  ValueNode.prototype.iterate = function (fn, reverse) {\n    return fn(this.entry);\n  }\n\n  createClass(MapIterator, Iterator);\n\n    function MapIterator(map, type, reverse) {\n      this._type = type;\n      this._reverse = reverse;\n      this._stack = map._root && mapIteratorFrame(map._root);\n    }\n\n    MapIterator.prototype.next = function() {\n      var type = this._type;\n      var stack = this._stack;\n      while (stack) {\n        var node = stack.node;\n        var index = stack.index++;\n        var maxIndex;\n        if (node.entry) {\n          if (index === 0) {\n            return mapIteratorValue(type, node.entry);\n          }\n        } else if (node.entries) {\n          maxIndex = node.entries.length - 1;\n          if (index <= maxIndex) {\n            return mapIteratorValue(type, node.entries[this._reverse ? maxIndex - index : index]);\n          }\n        } else {\n          maxIndex = node.nodes.length - 1;\n          if (index <= maxIndex) {\n            var subNode = node.nodes[this._reverse ? maxIndex - index : index];\n            if (subNode) {\n              if (subNode.entry) {\n                return mapIteratorValue(type, subNode.entry);\n              }\n              stack = this._stack = mapIteratorFrame(subNode, stack);\n            }\n            continue;\n          }\n        }\n        stack = this._stack = this._stack.__prev;\n      }\n      return iteratorDone();\n    };\n\n\n  function mapIteratorValue(type, entry) {\n    return iteratorValue(type, entry[0], entry[1]);\n  }\n\n  function mapIteratorFrame(node, prev) {\n    return {\n      node: node,\n      index: 0,\n      __prev: prev\n    };\n  }\n\n  function makeMap(size, root, ownerID, hash) {\n    var map = Object.create(MapPrototype);\n    map.size = size;\n    map._root = root;\n    map.__ownerID = ownerID;\n    map.__hash = hash;\n    map.__altered = false;\n    return map;\n  }\n\n  var EMPTY_MAP;\n  function emptyMap() {\n    return EMPTY_MAP || (EMPTY_MAP = makeMap(0));\n  }\n\n  function updateMap(map, k, v) {\n    var newRoot;\n    var newSize;\n    if (!map._root) {\n      if (v === NOT_SET) {\n        return map;\n      }\n      newSize = 1;\n      newRoot = new ArrayMapNode(map.__ownerID, [[k, v]]);\n    } else {\n      var didChangeSize = MakeRef(CHANGE_LENGTH);\n      var didAlter = MakeRef(DID_ALTER);\n      newRoot = updateNode(map._root, map.__ownerID, 0, undefined, k, v, didChangeSize, didAlter);\n      if (!didAlter.value) {\n        return map;\n      }\n      newSize = map.size + (didChangeSize.value ? v === NOT_SET ? -1 : 1 : 0);\n    }\n    if (map.__ownerID) {\n      map.size = newSize;\n      map._root = newRoot;\n      map.__hash = undefined;\n      map.__altered = true;\n      return map;\n    }\n    return newRoot ? makeMap(newSize, newRoot) : emptyMap();\n  }\n\n  function updateNode(node, ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n    if (!node) {\n      if (value === NOT_SET) {\n        return node;\n      }\n      SetRef(didAlter);\n      SetRef(didChangeSize);\n      return new ValueNode(ownerID, keyHash, [key, value]);\n    }\n    return node.update(ownerID, shift, keyHash, key, value, didChangeSize, didAlter);\n  }\n\n  function isLeafNode(node) {\n    return node.constructor === ValueNode || node.constructor === HashCollisionNode;\n  }\n\n  function mergeIntoNode(node, ownerID, shift, keyHash, entry) {\n    if (node.keyHash === keyHash) {\n      return new HashCollisionNode(ownerID, keyHash, [node.entry, entry]);\n    }\n\n    var idx1 = (shift === 0 ? node.keyHash : node.keyHash >>> shift) & MASK;\n    var idx2 = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n\n    var newNode;\n    var nodes = idx1 === idx2 ?\n      [mergeIntoNode(node, ownerID, shift + SHIFT, keyHash, entry)] :\n      ((newNode = new ValueNode(ownerID, keyHash, entry)), idx1 < idx2 ? [node, newNode] : [newNode, node]);\n\n    return new BitmapIndexedNode(ownerID, (1 << idx1) | (1 << idx2), nodes);\n  }\n\n  function createNodes(ownerID, entries, key, value) {\n    if (!ownerID) {\n      ownerID = new OwnerID();\n    }\n    var node = new ValueNode(ownerID, hash(key), [key, value]);\n    for (var ii = 0; ii < entries.length; ii++) {\n      var entry = entries[ii];\n      node = node.update(ownerID, 0, undefined, entry[0], entry[1]);\n    }\n    return node;\n  }\n\n  function packNodes(ownerID, nodes, count, excluding) {\n    var bitmap = 0;\n    var packedII = 0;\n    var packedNodes = new Array(count);\n    for (var ii = 0, bit = 1, len = nodes.length; ii < len; ii++, bit <<= 1) {\n      var node = nodes[ii];\n      if (node !== undefined && ii !== excluding) {\n        bitmap |= bit;\n        packedNodes[packedII++] = node;\n      }\n    }\n    return new BitmapIndexedNode(ownerID, bitmap, packedNodes);\n  }\n\n  function expandNodes(ownerID, nodes, bitmap, including, node) {\n    var count = 0;\n    var expandedNodes = new Array(SIZE);\n    for (var ii = 0; bitmap !== 0; ii++, bitmap >>>= 1) {\n      expandedNodes[ii] = bitmap & 1 ? nodes[count++] : undefined;\n    }\n    expandedNodes[including] = node;\n    return new HashArrayMapNode(ownerID, count + 1, expandedNodes);\n  }\n\n  function mergeIntoMapWith(map, merger, iterables) {\n    var iters = [];\n    for (var ii = 0; ii < iterables.length; ii++) {\n      var value = iterables[ii];\n      var iter = KeyedIterable(value);\n      if (!isIterable(value)) {\n        iter = iter.map(function(v ) {return fromJS(v)});\n      }\n      iters.push(iter);\n    }\n    return mergeIntoCollectionWith(map, merger, iters);\n  }\n\n  function deepMerger(existing, value, key) {\n    return existing && existing.mergeDeep && isIterable(value) ?\n      existing.mergeDeep(value) :\n      is(existing, value) ? existing : value;\n  }\n\n  function deepMergerWith(merger) {\n    return function(existing, value, key)  {\n      if (existing && existing.mergeDeepWith && isIterable(value)) {\n        return existing.mergeDeepWith(merger, value);\n      }\n      var nextValue = merger(existing, value, key);\n      return is(existing, nextValue) ? existing : nextValue;\n    };\n  }\n\n  function mergeIntoCollectionWith(collection, merger, iters) {\n    iters = iters.filter(function(x ) {return x.size !== 0});\n    if (iters.length === 0) {\n      return collection;\n    }\n    if (collection.size === 0 && !collection.__ownerID && iters.length === 1) {\n      return collection.constructor(iters[0]);\n    }\n    return collection.withMutations(function(collection ) {\n      var mergeIntoMap = merger ?\n        function(value, key)  {\n          collection.update(key, NOT_SET, function(existing )\n            {return existing === NOT_SET ? value : merger(existing, value, key)}\n          );\n        } :\n        function(value, key)  {\n          collection.set(key, value);\n        }\n      for (var ii = 0; ii < iters.length; ii++) {\n        iters[ii].forEach(mergeIntoMap);\n      }\n    });\n  }\n\n  function updateInDeepMap(existing, keyPathIter, notSetValue, updater) {\n    var isNotSet = existing === NOT_SET;\n    var step = keyPathIter.next();\n    if (step.done) {\n      var existingValue = isNotSet ? notSetValue : existing;\n      var newValue = updater(existingValue);\n      return newValue === existingValue ? existing : newValue;\n    }\n    invariant(\n      isNotSet || (existing && existing.set),\n      'invalid keyPath'\n    );\n    var key = step.value;\n    var nextExisting = isNotSet ? NOT_SET : existing.get(key, NOT_SET);\n    var nextUpdated = updateInDeepMap(\n      nextExisting,\n      keyPathIter,\n      notSetValue,\n      updater\n    );\n    return nextUpdated === nextExisting ? existing :\n      nextUpdated === NOT_SET ? existing.remove(key) :\n      (isNotSet ? emptyMap() : existing).set(key, nextUpdated);\n  }\n\n  function popCount(x) {\n    x = x - ((x >> 1) & 0x55555555);\n    x = (x & 0x33333333) + ((x >> 2) & 0x33333333);\n    x = (x + (x >> 4)) & 0x0f0f0f0f;\n    x = x + (x >> 8);\n    x = x + (x >> 16);\n    return x & 0x7f;\n  }\n\n  function setIn(array, idx, val, canEdit) {\n    var newArray = canEdit ? array : arrCopy(array);\n    newArray[idx] = val;\n    return newArray;\n  }\n\n  function spliceIn(array, idx, val, canEdit) {\n    var newLen = array.length + 1;\n    if (canEdit && idx + 1 === newLen) {\n      array[idx] = val;\n      return array;\n    }\n    var newArray = new Array(newLen);\n    var after = 0;\n    for (var ii = 0; ii < newLen; ii++) {\n      if (ii === idx) {\n        newArray[ii] = val;\n        after = -1;\n      } else {\n        newArray[ii] = array[ii + after];\n      }\n    }\n    return newArray;\n  }\n\n  function spliceOut(array, idx, canEdit) {\n    var newLen = array.length - 1;\n    if (canEdit && idx === newLen) {\n      array.pop();\n      return array;\n    }\n    var newArray = new Array(newLen);\n    var after = 0;\n    for (var ii = 0; ii < newLen; ii++) {\n      if (ii === idx) {\n        after = 1;\n      }\n      newArray[ii] = array[ii + after];\n    }\n    return newArray;\n  }\n\n  var MAX_ARRAY_MAP_SIZE = SIZE / 4;\n  var MAX_BITMAP_INDEXED_SIZE = SIZE / 2;\n  var MIN_HASH_ARRAY_MAP_SIZE = SIZE / 4;\n\n  createClass(List, IndexedCollection);\n\n    // @pragma Construction\n\n    function List(value) {\n      var empty = emptyList();\n      if (value === null || value === undefined) {\n        return empty;\n      }\n      if (isList(value)) {\n        return value;\n      }\n      var iter = IndexedIterable(value);\n      var size = iter.size;\n      if (size === 0) {\n        return empty;\n      }\n      assertNotInfinite(size);\n      if (size > 0 && size < SIZE) {\n        return makeList(0, size, SHIFT, null, new VNode(iter.toArray()));\n      }\n      return empty.withMutations(function(list ) {\n        list.setSize(size);\n        iter.forEach(function(v, i)  {return list.set(i, v)});\n      });\n    }\n\n    List.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    List.prototype.toString = function() {\n      return this.__toString('List [', ']');\n    };\n\n    // @pragma Access\n\n    List.prototype.get = function(index, notSetValue) {\n      index = wrapIndex(this, index);\n      if (index >= 0 && index < this.size) {\n        index += this._origin;\n        var node = listNodeFor(this, index);\n        return node && node.array[index & MASK];\n      }\n      return notSetValue;\n    };\n\n    // @pragma Modification\n\n    List.prototype.set = function(index, value) {\n      return updateList(this, index, value);\n    };\n\n    List.prototype.remove = function(index) {\n      return !this.has(index) ? this :\n        index === 0 ? this.shift() :\n        index === this.size - 1 ? this.pop() :\n        this.splice(index, 1);\n    };\n\n    List.prototype.insert = function(index, value) {\n      return this.splice(index, 0, value);\n    };\n\n    List.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = this._origin = this._capacity = 0;\n        this._level = SHIFT;\n        this._root = this._tail = null;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return emptyList();\n    };\n\n    List.prototype.push = function(/*...values*/) {\n      var values = arguments;\n      var oldSize = this.size;\n      return this.withMutations(function(list ) {\n        setListBounds(list, 0, oldSize + values.length);\n        for (var ii = 0; ii < values.length; ii++) {\n          list.set(oldSize + ii, values[ii]);\n        }\n      });\n    };\n\n    List.prototype.pop = function() {\n      return setListBounds(this, 0, -1);\n    };\n\n    List.prototype.unshift = function(/*...values*/) {\n      var values = arguments;\n      return this.withMutations(function(list ) {\n        setListBounds(list, -values.length);\n        for (var ii = 0; ii < values.length; ii++) {\n          list.set(ii, values[ii]);\n        }\n      });\n    };\n\n    List.prototype.shift = function() {\n      return setListBounds(this, 1);\n    };\n\n    // @pragma Composition\n\n    List.prototype.merge = function(/*...iters*/) {\n      return mergeIntoListWith(this, undefined, arguments);\n    };\n\n    List.prototype.mergeWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoListWith(this, merger, iters);\n    };\n\n    List.prototype.mergeDeep = function(/*...iters*/) {\n      return mergeIntoListWith(this, deepMerger, arguments);\n    };\n\n    List.prototype.mergeDeepWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoListWith(this, deepMergerWith(merger), iters);\n    };\n\n    List.prototype.setSize = function(size) {\n      return setListBounds(this, 0, size);\n    };\n\n    // @pragma Iteration\n\n    List.prototype.slice = function(begin, end) {\n      var size = this.size;\n      if (wholeSlice(begin, end, size)) {\n        return this;\n      }\n      return setListBounds(\n        this,\n        resolveBegin(begin, size),\n        resolveEnd(end, size)\n      );\n    };\n\n    List.prototype.__iterator = function(type, reverse) {\n      var index = 0;\n      var values = iterateList(this, reverse);\n      return new Iterator(function()  {\n        var value = values();\n        return value === DONE ?\n          iteratorDone() :\n          iteratorValue(type, index++, value);\n      });\n    };\n\n    List.prototype.__iterate = function(fn, reverse) {\n      var index = 0;\n      var values = iterateList(this, reverse);\n      var value;\n      while ((value = values()) !== DONE) {\n        if (fn(value, index++, this) === false) {\n          break;\n        }\n      }\n      return index;\n    };\n\n    List.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        return this;\n      }\n      return makeList(this._origin, this._capacity, this._level, this._root, this._tail, ownerID, this.__hash);\n    };\n\n\n  function isList(maybeList) {\n    return !!(maybeList && maybeList[IS_LIST_SENTINEL]);\n  }\n\n  List.isList = isList;\n\n  var IS_LIST_SENTINEL = '@@__IMMUTABLE_LIST__@@';\n\n  var ListPrototype = List.prototype;\n  ListPrototype[IS_LIST_SENTINEL] = true;\n  ListPrototype[DELETE] = ListPrototype.remove;\n  ListPrototype.setIn = MapPrototype.setIn;\n  ListPrototype.deleteIn =\n  ListPrototype.removeIn = MapPrototype.removeIn;\n  ListPrototype.update = MapPrototype.update;\n  ListPrototype.updateIn = MapPrototype.updateIn;\n  ListPrototype.mergeIn = MapPrototype.mergeIn;\n  ListPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\n  ListPrototype.withMutations = MapPrototype.withMutations;\n  ListPrototype.asMutable = MapPrototype.asMutable;\n  ListPrototype.asImmutable = MapPrototype.asImmutable;\n  ListPrototype.wasAltered = MapPrototype.wasAltered;\n\n\n\n    function VNode(array, ownerID) {\n      this.array = array;\n      this.ownerID = ownerID;\n    }\n\n    // TODO: seems like these methods are very similar\n\n    VNode.prototype.removeBefore = function(ownerID, level, index) {\n      if (index === level ? 1 << level : 0 || this.array.length === 0) {\n        return this;\n      }\n      var originIndex = (index >>> level) & MASK;\n      if (originIndex >= this.array.length) {\n        return new VNode([], ownerID);\n      }\n      var removingFirst = originIndex === 0;\n      var newChild;\n      if (level > 0) {\n        var oldChild = this.array[originIndex];\n        newChild = oldChild && oldChild.removeBefore(ownerID, level - SHIFT, index);\n        if (newChild === oldChild && removingFirst) {\n          return this;\n        }\n      }\n      if (removingFirst && !newChild) {\n        return this;\n      }\n      var editable = editableVNode(this, ownerID);\n      if (!removingFirst) {\n        for (var ii = 0; ii < originIndex; ii++) {\n          editable.array[ii] = undefined;\n        }\n      }\n      if (newChild) {\n        editable.array[originIndex] = newChild;\n      }\n      return editable;\n    };\n\n    VNode.prototype.removeAfter = function(ownerID, level, index) {\n      if (index === (level ? 1 << level : 0) || this.array.length === 0) {\n        return this;\n      }\n      var sizeIndex = ((index - 1) >>> level) & MASK;\n      if (sizeIndex >= this.array.length) {\n        return this;\n      }\n\n      var newChild;\n      if (level > 0) {\n        var oldChild = this.array[sizeIndex];\n        newChild = oldChild && oldChild.removeAfter(ownerID, level - SHIFT, index);\n        if (newChild === oldChild && sizeIndex === this.array.length - 1) {\n          return this;\n        }\n      }\n\n      var editable = editableVNode(this, ownerID);\n      editable.array.splice(sizeIndex + 1);\n      if (newChild) {\n        editable.array[sizeIndex] = newChild;\n      }\n      return editable;\n    };\n\n\n\n  var DONE = {};\n\n  function iterateList(list, reverse) {\n    var left = list._origin;\n    var right = list._capacity;\n    var tailPos = getTailOffset(right);\n    var tail = list._tail;\n\n    return iterateNodeOrLeaf(list._root, list._level, 0);\n\n    function iterateNodeOrLeaf(node, level, offset) {\n      return level === 0 ?\n        iterateLeaf(node, offset) :\n        iterateNode(node, level, offset);\n    }\n\n    function iterateLeaf(node, offset) {\n      var array = offset === tailPos ? tail && tail.array : node && node.array;\n      var from = offset > left ? 0 : left - offset;\n      var to = right - offset;\n      if (to > SIZE) {\n        to = SIZE;\n      }\n      return function()  {\n        if (from === to) {\n          return DONE;\n        }\n        var idx = reverse ? --to : from++;\n        return array && array[idx];\n      };\n    }\n\n    function iterateNode(node, level, offset) {\n      var values;\n      var array = node && node.array;\n      var from = offset > left ? 0 : (left - offset) >> level;\n      var to = ((right - offset) >> level) + 1;\n      if (to > SIZE) {\n        to = SIZE;\n      }\n      return function()  {\n        do {\n          if (values) {\n            var value = values();\n            if (value !== DONE) {\n              return value;\n            }\n            values = null;\n          }\n          if (from === to) {\n            return DONE;\n          }\n          var idx = reverse ? --to : from++;\n          values = iterateNodeOrLeaf(\n            array && array[idx], level - SHIFT, offset + (idx << level)\n          );\n        } while (true);\n      };\n    }\n  }\n\n  function makeList(origin, capacity, level, root, tail, ownerID, hash) {\n    var list = Object.create(ListPrototype);\n    list.size = capacity - origin;\n    list._origin = origin;\n    list._capacity = capacity;\n    list._level = level;\n    list._root = root;\n    list._tail = tail;\n    list.__ownerID = ownerID;\n    list.__hash = hash;\n    list.__altered = false;\n    return list;\n  }\n\n  var EMPTY_LIST;\n  function emptyList() {\n    return EMPTY_LIST || (EMPTY_LIST = makeList(0, 0, SHIFT));\n  }\n\n  function updateList(list, index, value) {\n    index = wrapIndex(list, index);\n\n    if (index !== index) {\n      return list;\n    }\n\n    if (index >= list.size || index < 0) {\n      return list.withMutations(function(list ) {\n        index < 0 ?\n          setListBounds(list, index).set(0, value) :\n          setListBounds(list, 0, index + 1).set(index, value)\n      });\n    }\n\n    index += list._origin;\n\n    var newTail = list._tail;\n    var newRoot = list._root;\n    var didAlter = MakeRef(DID_ALTER);\n    if (index >= getTailOffset(list._capacity)) {\n      newTail = updateVNode(newTail, list.__ownerID, 0, index, value, didAlter);\n    } else {\n      newRoot = updateVNode(newRoot, list.__ownerID, list._level, index, value, didAlter);\n    }\n\n    if (!didAlter.value) {\n      return list;\n    }\n\n    if (list.__ownerID) {\n      list._root = newRoot;\n      list._tail = newTail;\n      list.__hash = undefined;\n      list.__altered = true;\n      return list;\n    }\n    return makeList(list._origin, list._capacity, list._level, newRoot, newTail);\n  }\n\n  function updateVNode(node, ownerID, level, index, value, didAlter) {\n    var idx = (index >>> level) & MASK;\n    var nodeHas = node && idx < node.array.length;\n    if (!nodeHas && value === undefined) {\n      return node;\n    }\n\n    var newNode;\n\n    if (level > 0) {\n      var lowerNode = node && node.array[idx];\n      var newLowerNode = updateVNode(lowerNode, ownerID, level - SHIFT, index, value, didAlter);\n      if (newLowerNode === lowerNode) {\n        return node;\n      }\n      newNode = editableVNode(node, ownerID);\n      newNode.array[idx] = newLowerNode;\n      return newNode;\n    }\n\n    if (nodeHas && node.array[idx] === value) {\n      return node;\n    }\n\n    SetRef(didAlter);\n\n    newNode = editableVNode(node, ownerID);\n    if (value === undefined && idx === newNode.array.length - 1) {\n      newNode.array.pop();\n    } else {\n      newNode.array[idx] = value;\n    }\n    return newNode;\n  }\n\n  function editableVNode(node, ownerID) {\n    if (ownerID && node && ownerID === node.ownerID) {\n      return node;\n    }\n    return new VNode(node ? node.array.slice() : [], ownerID);\n  }\n\n  function listNodeFor(list, rawIndex) {\n    if (rawIndex >= getTailOffset(list._capacity)) {\n      return list._tail;\n    }\n    if (rawIndex < 1 << (list._level + SHIFT)) {\n      var node = list._root;\n      var level = list._level;\n      while (node && level > 0) {\n        node = node.array[(rawIndex >>> level) & MASK];\n        level -= SHIFT;\n      }\n      return node;\n    }\n  }\n\n  function setListBounds(list, begin, end) {\n    // Sanitize begin & end using this shorthand for ToInt32(argument)\n    // http://www.ecma-international.org/ecma-262/6.0/#sec-toint32\n    if (begin !== undefined) {\n      begin = begin | 0;\n    }\n    if (end !== undefined) {\n      end = end | 0;\n    }\n    var owner = list.__ownerID || new OwnerID();\n    var oldOrigin = list._origin;\n    var oldCapacity = list._capacity;\n    var newOrigin = oldOrigin + begin;\n    var newCapacity = end === undefined ? oldCapacity : end < 0 ? oldCapacity + end : oldOrigin + end;\n    if (newOrigin === oldOrigin && newCapacity === oldCapacity) {\n      return list;\n    }\n\n    // If it's going to end after it starts, it's empty.\n    if (newOrigin >= newCapacity) {\n      return list.clear();\n    }\n\n    var newLevel = list._level;\n    var newRoot = list._root;\n\n    // New origin might need creating a higher root.\n    var offsetShift = 0;\n    while (newOrigin + offsetShift < 0) {\n      newRoot = new VNode(newRoot && newRoot.array.length ? [undefined, newRoot] : [], owner);\n      newLevel += SHIFT;\n      offsetShift += 1 << newLevel;\n    }\n    if (offsetShift) {\n      newOrigin += offsetShift;\n      oldOrigin += offsetShift;\n      newCapacity += offsetShift;\n      oldCapacity += offsetShift;\n    }\n\n    var oldTailOffset = getTailOffset(oldCapacity);\n    var newTailOffset = getTailOffset(newCapacity);\n\n    // New size might need creating a higher root.\n    while (newTailOffset >= 1 << (newLevel + SHIFT)) {\n      newRoot = new VNode(newRoot && newRoot.array.length ? [newRoot] : [], owner);\n      newLevel += SHIFT;\n    }\n\n    // Locate or create the new tail.\n    var oldTail = list._tail;\n    var newTail = newTailOffset < oldTailOffset ?\n      listNodeFor(list, newCapacity - 1) :\n      newTailOffset > oldTailOffset ? new VNode([], owner) : oldTail;\n\n    // Merge Tail into tree.\n    if (oldTail && newTailOffset > oldTailOffset && newOrigin < oldCapacity && oldTail.array.length) {\n      newRoot = editableVNode(newRoot, owner);\n      var node = newRoot;\n      for (var level = newLevel; level > SHIFT; level -= SHIFT) {\n        var idx = (oldTailOffset >>> level) & MASK;\n        node = node.array[idx] = editableVNode(node.array[idx], owner);\n      }\n      node.array[(oldTailOffset >>> SHIFT) & MASK] = oldTail;\n    }\n\n    // If the size has been reduced, there's a chance the tail needs to be trimmed.\n    if (newCapacity < oldCapacity) {\n      newTail = newTail && newTail.removeAfter(owner, 0, newCapacity);\n    }\n\n    // If the new origin is within the tail, then we do not need a root.\n    if (newOrigin >= newTailOffset) {\n      newOrigin -= newTailOffset;\n      newCapacity -= newTailOffset;\n      newLevel = SHIFT;\n      newRoot = null;\n      newTail = newTail && newTail.removeBefore(owner, 0, newOrigin);\n\n    // Otherwise, if the root has been trimmed, garbage collect.\n    } else if (newOrigin > oldOrigin || newTailOffset < oldTailOffset) {\n      offsetShift = 0;\n\n      // Identify the new top root node of the subtree of the old root.\n      while (newRoot) {\n        var beginIndex = (newOrigin >>> newLevel) & MASK;\n        if (beginIndex !== (newTailOffset >>> newLevel) & MASK) {\n          break;\n        }\n        if (beginIndex) {\n          offsetShift += (1 << newLevel) * beginIndex;\n        }\n        newLevel -= SHIFT;\n        newRoot = newRoot.array[beginIndex];\n      }\n\n      // Trim the new sides of the new root.\n      if (newRoot && newOrigin > oldOrigin) {\n        newRoot = newRoot.removeBefore(owner, newLevel, newOrigin - offsetShift);\n      }\n      if (newRoot && newTailOffset < oldTailOffset) {\n        newRoot = newRoot.removeAfter(owner, newLevel, newTailOffset - offsetShift);\n      }\n      if (offsetShift) {\n        newOrigin -= offsetShift;\n        newCapacity -= offsetShift;\n      }\n    }\n\n    if (list.__ownerID) {\n      list.size = newCapacity - newOrigin;\n      list._origin = newOrigin;\n      list._capacity = newCapacity;\n      list._level = newLevel;\n      list._root = newRoot;\n      list._tail = newTail;\n      list.__hash = undefined;\n      list.__altered = true;\n      return list;\n    }\n    return makeList(newOrigin, newCapacity, newLevel, newRoot, newTail);\n  }\n\n  function mergeIntoListWith(list, merger, iterables) {\n    var iters = [];\n    var maxSize = 0;\n    for (var ii = 0; ii < iterables.length; ii++) {\n      var value = iterables[ii];\n      var iter = IndexedIterable(value);\n      if (iter.size > maxSize) {\n        maxSize = iter.size;\n      }\n      if (!isIterable(value)) {\n        iter = iter.map(function(v ) {return fromJS(v)});\n      }\n      iters.push(iter);\n    }\n    if (maxSize > list.size) {\n      list = list.setSize(maxSize);\n    }\n    return mergeIntoCollectionWith(list, merger, iters);\n  }\n\n  function getTailOffset(size) {\n    return size < SIZE ? 0 : (((size - 1) >>> SHIFT) << SHIFT);\n  }\n\n  createClass(OrderedMap, Map);\n\n    // @pragma Construction\n\n    function OrderedMap(value) {\n      return value === null || value === undefined ? emptyOrderedMap() :\n        isOrderedMap(value) ? value :\n        emptyOrderedMap().withMutations(function(map ) {\n          var iter = KeyedIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v, k)  {return map.set(k, v)});\n        });\n    }\n\n    OrderedMap.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    OrderedMap.prototype.toString = function() {\n      return this.__toString('OrderedMap {', '}');\n    };\n\n    // @pragma Access\n\n    OrderedMap.prototype.get = function(k, notSetValue) {\n      var index = this._map.get(k);\n      return index !== undefined ? this._list.get(index)[1] : notSetValue;\n    };\n\n    // @pragma Modification\n\n    OrderedMap.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = 0;\n        this._map.clear();\n        this._list.clear();\n        return this;\n      }\n      return emptyOrderedMap();\n    };\n\n    OrderedMap.prototype.set = function(k, v) {\n      return updateOrderedMap(this, k, v);\n    };\n\n    OrderedMap.prototype.remove = function(k) {\n      return updateOrderedMap(this, k, NOT_SET);\n    };\n\n    OrderedMap.prototype.wasAltered = function() {\n      return this._map.wasAltered() || this._list.wasAltered();\n    };\n\n    OrderedMap.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._list.__iterate(\n        function(entry ) {return entry && fn(entry[1], entry[0], this$0)},\n        reverse\n      );\n    };\n\n    OrderedMap.prototype.__iterator = function(type, reverse) {\n      return this._list.fromEntrySeq().__iterator(type, reverse);\n    };\n\n    OrderedMap.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      var newMap = this._map.__ensureOwner(ownerID);\n      var newList = this._list.__ensureOwner(ownerID);\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this._map = newMap;\n        this._list = newList;\n        return this;\n      }\n      return makeOrderedMap(newMap, newList, ownerID, this.__hash);\n    };\n\n\n  function isOrderedMap(maybeOrderedMap) {\n    return isMap(maybeOrderedMap) && isOrdered(maybeOrderedMap);\n  }\n\n  OrderedMap.isOrderedMap = isOrderedMap;\n\n  OrderedMap.prototype[IS_ORDERED_SENTINEL] = true;\n  OrderedMap.prototype[DELETE] = OrderedMap.prototype.remove;\n\n\n\n  function makeOrderedMap(map, list, ownerID, hash) {\n    var omap = Object.create(OrderedMap.prototype);\n    omap.size = map ? map.size : 0;\n    omap._map = map;\n    omap._list = list;\n    omap.__ownerID = ownerID;\n    omap.__hash = hash;\n    return omap;\n  }\n\n  var EMPTY_ORDERED_MAP;\n  function emptyOrderedMap() {\n    return EMPTY_ORDERED_MAP || (EMPTY_ORDERED_MAP = makeOrderedMap(emptyMap(), emptyList()));\n  }\n\n  function updateOrderedMap(omap, k, v) {\n    var map = omap._map;\n    var list = omap._list;\n    var i = map.get(k);\n    var has = i !== undefined;\n    var newMap;\n    var newList;\n    if (v === NOT_SET) { // removed\n      if (!has) {\n        return omap;\n      }\n      if (list.size >= SIZE && list.size >= map.size * 2) {\n        newList = list.filter(function(entry, idx)  {return entry !== undefined && i !== idx});\n        newMap = newList.toKeyedSeq().map(function(entry ) {return entry[0]}).flip().toMap();\n        if (omap.__ownerID) {\n          newMap.__ownerID = newList.__ownerID = omap.__ownerID;\n        }\n      } else {\n        newMap = map.remove(k);\n        newList = i === list.size - 1 ? list.pop() : list.set(i, undefined);\n      }\n    } else {\n      if (has) {\n        if (v === list.get(i)[1]) {\n          return omap;\n        }\n        newMap = map;\n        newList = list.set(i, [k, v]);\n      } else {\n        newMap = map.set(k, list.size);\n        newList = list.set(list.size, [k, v]);\n      }\n    }\n    if (omap.__ownerID) {\n      omap.size = newMap.size;\n      omap._map = newMap;\n      omap._list = newList;\n      omap.__hash = undefined;\n      return omap;\n    }\n    return makeOrderedMap(newMap, newList);\n  }\n\n  createClass(ToKeyedSequence, KeyedSeq);\n    function ToKeyedSequence(indexed, useKeys) {\n      this._iter = indexed;\n      this._useKeys = useKeys;\n      this.size = indexed.size;\n    }\n\n    ToKeyedSequence.prototype.get = function(key, notSetValue) {\n      return this._iter.get(key, notSetValue);\n    };\n\n    ToKeyedSequence.prototype.has = function(key) {\n      return this._iter.has(key);\n    };\n\n    ToKeyedSequence.prototype.valueSeq = function() {\n      return this._iter.valueSeq();\n    };\n\n    ToKeyedSequence.prototype.reverse = function() {var this$0 = this;\n      var reversedSequence = reverseFactory(this, true);\n      if (!this._useKeys) {\n        reversedSequence.valueSeq = function()  {return this$0._iter.toSeq().reverse()};\n      }\n      return reversedSequence;\n    };\n\n    ToKeyedSequence.prototype.map = function(mapper, context) {var this$0 = this;\n      var mappedSequence = mapFactory(this, mapper, context);\n      if (!this._useKeys) {\n        mappedSequence.valueSeq = function()  {return this$0._iter.toSeq().map(mapper, context)};\n      }\n      return mappedSequence;\n    };\n\n    ToKeyedSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      var ii;\n      return this._iter.__iterate(\n        this._useKeys ?\n          function(v, k)  {return fn(v, k, this$0)} :\n          ((ii = reverse ? resolveSize(this) : 0),\n            function(v ) {return fn(v, reverse ? --ii : ii++, this$0)}),\n        reverse\n      );\n    };\n\n    ToKeyedSequence.prototype.__iterator = function(type, reverse) {\n      if (this._useKeys) {\n        return this._iter.__iterator(type, reverse);\n      }\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      var ii = reverse ? resolveSize(this) : 0;\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step :\n          iteratorValue(type, reverse ? --ii : ii++, step.value, step);\n      });\n    };\n\n  ToKeyedSequence.prototype[IS_ORDERED_SENTINEL] = true;\n\n\n  createClass(ToIndexedSequence, IndexedSeq);\n    function ToIndexedSequence(iter) {\n      this._iter = iter;\n      this.size = iter.size;\n    }\n\n    ToIndexedSequence.prototype.includes = function(value) {\n      return this._iter.includes(value);\n    };\n\n    ToIndexedSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      return this._iter.__iterate(function(v ) {return fn(v, iterations++, this$0)}, reverse);\n    };\n\n    ToIndexedSequence.prototype.__iterator = function(type, reverse) {\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      var iterations = 0;\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step :\n          iteratorValue(type, iterations++, step.value, step)\n      });\n    };\n\n\n\n  createClass(ToSetSequence, SetSeq);\n    function ToSetSequence(iter) {\n      this._iter = iter;\n      this.size = iter.size;\n    }\n\n    ToSetSequence.prototype.has = function(key) {\n      return this._iter.includes(key);\n    };\n\n    ToSetSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._iter.__iterate(function(v ) {return fn(v, v, this$0)}, reverse);\n    };\n\n    ToSetSequence.prototype.__iterator = function(type, reverse) {\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step :\n          iteratorValue(type, step.value, step.value, step);\n      });\n    };\n\n\n\n  createClass(FromEntriesSequence, KeyedSeq);\n    function FromEntriesSequence(entries) {\n      this._iter = entries;\n      this.size = entries.size;\n    }\n\n    FromEntriesSequence.prototype.entrySeq = function() {\n      return this._iter.toSeq();\n    };\n\n    FromEntriesSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._iter.__iterate(function(entry ) {\n        // Check if entry exists first so array access doesn't throw for holes\n        // in the parent iteration.\n        if (entry) {\n          validateEntry(entry);\n          var indexedIterable = isIterable(entry);\n          return fn(\n            indexedIterable ? entry.get(1) : entry[1],\n            indexedIterable ? entry.get(0) : entry[0],\n            this$0\n          );\n        }\n      }, reverse);\n    };\n\n    FromEntriesSequence.prototype.__iterator = function(type, reverse) {\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      return new Iterator(function()  {\n        while (true) {\n          var step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n          var entry = step.value;\n          // Check if entry exists first so array access doesn't throw for holes\n          // in the parent iteration.\n          if (entry) {\n            validateEntry(entry);\n            var indexedIterable = isIterable(entry);\n            return iteratorValue(\n              type,\n              indexedIterable ? entry.get(0) : entry[0],\n              indexedIterable ? entry.get(1) : entry[1],\n              step\n            );\n          }\n        }\n      });\n    };\n\n\n  ToIndexedSequence.prototype.cacheResult =\n  ToKeyedSequence.prototype.cacheResult =\n  ToSetSequence.prototype.cacheResult =\n  FromEntriesSequence.prototype.cacheResult =\n    cacheResultThrough;\n\n\n  function flipFactory(iterable) {\n    var flipSequence = makeSequence(iterable);\n    flipSequence._iter = iterable;\n    flipSequence.size = iterable.size;\n    flipSequence.flip = function()  {return iterable};\n    flipSequence.reverse = function () {\n      var reversedSequence = iterable.reverse.apply(this); // super.reverse()\n      reversedSequence.flip = function()  {return iterable.reverse()};\n      return reversedSequence;\n    };\n    flipSequence.has = function(key ) {return iterable.includes(key)};\n    flipSequence.includes = function(key ) {return iterable.has(key)};\n    flipSequence.cacheResult = cacheResultThrough;\n    flipSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      return iterable.__iterate(function(v, k)  {return fn(k, v, this$0) !== false}, reverse);\n    }\n    flipSequence.__iteratorUncached = function(type, reverse) {\n      if (type === ITERATE_ENTRIES) {\n        var iterator = iterable.__iterator(type, reverse);\n        return new Iterator(function()  {\n          var step = iterator.next();\n          if (!step.done) {\n            var k = step.value[0];\n            step.value[0] = step.value[1];\n            step.value[1] = k;\n          }\n          return step;\n        });\n      }\n      return iterable.__iterator(\n        type === ITERATE_VALUES ? ITERATE_KEYS : ITERATE_VALUES,\n        reverse\n      );\n    }\n    return flipSequence;\n  }\n\n\n  function mapFactory(iterable, mapper, context) {\n    var mappedSequence = makeSequence(iterable);\n    mappedSequence.size = iterable.size;\n    mappedSequence.has = function(key ) {return iterable.has(key)};\n    mappedSequence.get = function(key, notSetValue)  {\n      var v = iterable.get(key, NOT_SET);\n      return v === NOT_SET ?\n        notSetValue :\n        mapper.call(context, v, key, iterable);\n    };\n    mappedSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      return iterable.__iterate(\n        function(v, k, c)  {return fn(mapper.call(context, v, k, c), k, this$0) !== false},\n        reverse\n      );\n    }\n    mappedSequence.__iteratorUncached = function (type, reverse) {\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      return new Iterator(function()  {\n        var step = iterator.next();\n        if (step.done) {\n          return step;\n        }\n        var entry = step.value;\n        var key = entry[0];\n        return iteratorValue(\n          type,\n          key,\n          mapper.call(context, entry[1], key, iterable),\n          step\n        );\n      });\n    }\n    return mappedSequence;\n  }\n\n\n  function reverseFactory(iterable, useKeys) {\n    var reversedSequence = makeSequence(iterable);\n    reversedSequence._iter = iterable;\n    reversedSequence.size = iterable.size;\n    reversedSequence.reverse = function()  {return iterable};\n    if (iterable.flip) {\n      reversedSequence.flip = function () {\n        var flipSequence = flipFactory(iterable);\n        flipSequence.reverse = function()  {return iterable.flip()};\n        return flipSequence;\n      };\n    }\n    reversedSequence.get = function(key, notSetValue) \n      {return iterable.get(useKeys ? key : -1 - key, notSetValue)};\n    reversedSequence.has = function(key )\n      {return iterable.has(useKeys ? key : -1 - key)};\n    reversedSequence.includes = function(value ) {return iterable.includes(value)};\n    reversedSequence.cacheResult = cacheResultThrough;\n    reversedSequence.__iterate = function (fn, reverse) {var this$0 = this;\n      return iterable.__iterate(function(v, k)  {return fn(v, k, this$0)}, !reverse);\n    };\n    reversedSequence.__iterator =\n      function(type, reverse)  {return iterable.__iterator(type, !reverse)};\n    return reversedSequence;\n  }\n\n\n  function filterFactory(iterable, predicate, context, useKeys) {\n    var filterSequence = makeSequence(iterable);\n    if (useKeys) {\n      filterSequence.has = function(key ) {\n        var v = iterable.get(key, NOT_SET);\n        return v !== NOT_SET && !!predicate.call(context, v, key, iterable);\n      };\n      filterSequence.get = function(key, notSetValue)  {\n        var v = iterable.get(key, NOT_SET);\n        return v !== NOT_SET && predicate.call(context, v, key, iterable) ?\n          v : notSetValue;\n      };\n    }\n    filterSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      iterable.__iterate(function(v, k, c)  {\n        if (predicate.call(context, v, k, c)) {\n          iterations++;\n          return fn(v, useKeys ? k : iterations - 1, this$0);\n        }\n      }, reverse);\n      return iterations;\n    };\n    filterSequence.__iteratorUncached = function (type, reverse) {\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      var iterations = 0;\n      return new Iterator(function()  {\n        while (true) {\n          var step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n          var entry = step.value;\n          var key = entry[0];\n          var value = entry[1];\n          if (predicate.call(context, value, key, iterable)) {\n            return iteratorValue(type, useKeys ? key : iterations++, value, step);\n          }\n        }\n      });\n    }\n    return filterSequence;\n  }\n\n\n  function countByFactory(iterable, grouper, context) {\n    var groups = Map().asMutable();\n    iterable.__iterate(function(v, k)  {\n      groups.update(\n        grouper.call(context, v, k, iterable),\n        0,\n        function(a ) {return a + 1}\n      );\n    });\n    return groups.asImmutable();\n  }\n\n\n  function groupByFactory(iterable, grouper, context) {\n    var isKeyedIter = isKeyed(iterable);\n    var groups = (isOrdered(iterable) ? OrderedMap() : Map()).asMutable();\n    iterable.__iterate(function(v, k)  {\n      groups.update(\n        grouper.call(context, v, k, iterable),\n        function(a ) {return (a = a || [], a.push(isKeyedIter ? [k, v] : v), a)}\n      );\n    });\n    var coerce = iterableClass(iterable);\n    return groups.map(function(arr ) {return reify(iterable, coerce(arr))});\n  }\n\n\n  function sliceFactory(iterable, begin, end, useKeys) {\n    var originalSize = iterable.size;\n\n    // Sanitize begin & end using this shorthand for ToInt32(argument)\n    // http://www.ecma-international.org/ecma-262/6.0/#sec-toint32\n    if (begin !== undefined) {\n      begin = begin | 0;\n    }\n    if (end !== undefined) {\n      if (end === Infinity) {\n        end = originalSize;\n      } else {\n        end = end | 0;\n      }\n    }\n\n    if (wholeSlice(begin, end, originalSize)) {\n      return iterable;\n    }\n\n    var resolvedBegin = resolveBegin(begin, originalSize);\n    var resolvedEnd = resolveEnd(end, originalSize);\n\n    // begin or end will be NaN if they were provided as negative numbers and\n    // this iterable's size is unknown. In that case, cache first so there is\n    // a known size and these do not resolve to NaN.\n    if (resolvedBegin !== resolvedBegin || resolvedEnd !== resolvedEnd) {\n      return sliceFactory(iterable.toSeq().cacheResult(), begin, end, useKeys);\n    }\n\n    // Note: resolvedEnd is undefined when the original sequence's length is\n    // unknown and this slice did not supply an end and should contain all\n    // elements after resolvedBegin.\n    // In that case, resolvedSize will be NaN and sliceSize will remain undefined.\n    var resolvedSize = resolvedEnd - resolvedBegin;\n    var sliceSize;\n    if (resolvedSize === resolvedSize) {\n      sliceSize = resolvedSize < 0 ? 0 : resolvedSize;\n    }\n\n    var sliceSeq = makeSequence(iterable);\n\n    // If iterable.size is undefined, the size of the realized sliceSeq is\n    // unknown at this point unless the number of items to slice is 0\n    sliceSeq.size = sliceSize === 0 ? sliceSize : iterable.size && sliceSize || undefined;\n\n    if (!useKeys && isSeq(iterable) && sliceSize >= 0) {\n      sliceSeq.get = function (index, notSetValue) {\n        index = wrapIndex(this, index);\n        return index >= 0 && index < sliceSize ?\n          iterable.get(index + resolvedBegin, notSetValue) :\n          notSetValue;\n      }\n    }\n\n    sliceSeq.__iterateUncached = function(fn, reverse) {var this$0 = this;\n      if (sliceSize === 0) {\n        return 0;\n      }\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var skipped = 0;\n      var isSkipping = true;\n      var iterations = 0;\n      iterable.__iterate(function(v, k)  {\n        if (!(isSkipping && (isSkipping = skipped++ < resolvedBegin))) {\n          iterations++;\n          return fn(v, useKeys ? k : iterations - 1, this$0) !== false &&\n                 iterations !== sliceSize;\n        }\n      });\n      return iterations;\n    };\n\n    sliceSeq.__iteratorUncached = function(type, reverse) {\n      if (sliceSize !== 0 && reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      // Don't bother instantiating parent iterator if taking 0.\n      var iterator = sliceSize !== 0 && iterable.__iterator(type, reverse);\n      var skipped = 0;\n      var iterations = 0;\n      return new Iterator(function()  {\n        while (skipped++ < resolvedBegin) {\n          iterator.next();\n        }\n        if (++iterations > sliceSize) {\n          return iteratorDone();\n        }\n        var step = iterator.next();\n        if (useKeys || type === ITERATE_VALUES) {\n          return step;\n        } else if (type === ITERATE_KEYS) {\n          return iteratorValue(type, iterations - 1, undefined, step);\n        } else {\n          return iteratorValue(type, iterations - 1, step.value[1], step);\n        }\n      });\n    }\n\n    return sliceSeq;\n  }\n\n\n  function takeWhileFactory(iterable, predicate, context) {\n    var takeSequence = makeSequence(iterable);\n    takeSequence.__iterateUncached = function(fn, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var iterations = 0;\n      iterable.__iterate(function(v, k, c) \n        {return predicate.call(context, v, k, c) && ++iterations && fn(v, k, this$0)}\n      );\n      return iterations;\n    };\n    takeSequence.__iteratorUncached = function(type, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      var iterating = true;\n      return new Iterator(function()  {\n        if (!iterating) {\n          return iteratorDone();\n        }\n        var step = iterator.next();\n        if (step.done) {\n          return step;\n        }\n        var entry = step.value;\n        var k = entry[0];\n        var v = entry[1];\n        if (!predicate.call(context, v, k, this$0)) {\n          iterating = false;\n          return iteratorDone();\n        }\n        return type === ITERATE_ENTRIES ? step :\n          iteratorValue(type, k, v, step);\n      });\n    };\n    return takeSequence;\n  }\n\n\n  function skipWhileFactory(iterable, predicate, context, useKeys) {\n    var skipSequence = makeSequence(iterable);\n    skipSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var isSkipping = true;\n      var iterations = 0;\n      iterable.__iterate(function(v, k, c)  {\n        if (!(isSkipping && (isSkipping = predicate.call(context, v, k, c)))) {\n          iterations++;\n          return fn(v, useKeys ? k : iterations - 1, this$0);\n        }\n      });\n      return iterations;\n    };\n    skipSequence.__iteratorUncached = function(type, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      var skipping = true;\n      var iterations = 0;\n      return new Iterator(function()  {\n        var step, k, v;\n        do {\n          step = iterator.next();\n          if (step.done) {\n            if (useKeys || type === ITERATE_VALUES) {\n              return step;\n            } else if (type === ITERATE_KEYS) {\n              return iteratorValue(type, iterations++, undefined, step);\n            } else {\n              return iteratorValue(type, iterations++, step.value[1], step);\n            }\n          }\n          var entry = step.value;\n          k = entry[0];\n          v = entry[1];\n          skipping && (skipping = predicate.call(context, v, k, this$0));\n        } while (skipping);\n        return type === ITERATE_ENTRIES ? step :\n          iteratorValue(type, k, v, step);\n      });\n    };\n    return skipSequence;\n  }\n\n\n  function concatFactory(iterable, values) {\n    var isKeyedIterable = isKeyed(iterable);\n    var iters = [iterable].concat(values).map(function(v ) {\n      if (!isIterable(v)) {\n        v = isKeyedIterable ?\n          keyedSeqFromValue(v) :\n          indexedSeqFromValue(Array.isArray(v) ? v : [v]);\n      } else if (isKeyedIterable) {\n        v = KeyedIterable(v);\n      }\n      return v;\n    }).filter(function(v ) {return v.size !== 0});\n\n    if (iters.length === 0) {\n      return iterable;\n    }\n\n    if (iters.length === 1) {\n      var singleton = iters[0];\n      if (singleton === iterable ||\n          isKeyedIterable && isKeyed(singleton) ||\n          isIndexed(iterable) && isIndexed(singleton)) {\n        return singleton;\n      }\n    }\n\n    var concatSeq = new ArraySeq(iters);\n    if (isKeyedIterable) {\n      concatSeq = concatSeq.toKeyedSeq();\n    } else if (!isIndexed(iterable)) {\n      concatSeq = concatSeq.toSetSeq();\n    }\n    concatSeq = concatSeq.flatten(true);\n    concatSeq.size = iters.reduce(\n      function(sum, seq)  {\n        if (sum !== undefined) {\n          var size = seq.size;\n          if (size !== undefined) {\n            return sum + size;\n          }\n        }\n      },\n      0\n    );\n    return concatSeq;\n  }\n\n\n  function flattenFactory(iterable, depth, useKeys) {\n    var flatSequence = makeSequence(iterable);\n    flatSequence.__iterateUncached = function(fn, reverse) {\n      var iterations = 0;\n      var stopped = false;\n      function flatDeep(iter, currentDepth) {var this$0 = this;\n        iter.__iterate(function(v, k)  {\n          if ((!depth || currentDepth < depth) && isIterable(v)) {\n            flatDeep(v, currentDepth + 1);\n          } else if (fn(v, useKeys ? k : iterations++, this$0) === false) {\n            stopped = true;\n          }\n          return !stopped;\n        }, reverse);\n      }\n      flatDeep(iterable, 0);\n      return iterations;\n    }\n    flatSequence.__iteratorUncached = function(type, reverse) {\n      var iterator = iterable.__iterator(type, reverse);\n      var stack = [];\n      var iterations = 0;\n      return new Iterator(function()  {\n        while (iterator) {\n          var step = iterator.next();\n          if (step.done !== false) {\n            iterator = stack.pop();\n            continue;\n          }\n          var v = step.value;\n          if (type === ITERATE_ENTRIES) {\n            v = v[1];\n          }\n          if ((!depth || stack.length < depth) && isIterable(v)) {\n            stack.push(iterator);\n            iterator = v.__iterator(type, reverse);\n          } else {\n            return useKeys ? step : iteratorValue(type, iterations++, v, step);\n          }\n        }\n        return iteratorDone();\n      });\n    }\n    return flatSequence;\n  }\n\n\n  function flatMapFactory(iterable, mapper, context) {\n    var coerce = iterableClass(iterable);\n    return iterable.toSeq().map(\n      function(v, k)  {return coerce(mapper.call(context, v, k, iterable))}\n    ).flatten(true);\n  }\n\n\n  function interposeFactory(iterable, separator) {\n    var interposedSequence = makeSequence(iterable);\n    interposedSequence.size = iterable.size && iterable.size * 2 -1;\n    interposedSequence.__iterateUncached = function(fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      iterable.__iterate(function(v, k) \n        {return (!iterations || fn(separator, iterations++, this$0) !== false) &&\n        fn(v, iterations++, this$0) !== false},\n        reverse\n      );\n      return iterations;\n    };\n    interposedSequence.__iteratorUncached = function(type, reverse) {\n      var iterator = iterable.__iterator(ITERATE_VALUES, reverse);\n      var iterations = 0;\n      var step;\n      return new Iterator(function()  {\n        if (!step || iterations % 2) {\n          step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n        }\n        return iterations % 2 ?\n          iteratorValue(type, iterations++, separator) :\n          iteratorValue(type, iterations++, step.value, step);\n      });\n    };\n    return interposedSequence;\n  }\n\n\n  function sortFactory(iterable, comparator, mapper) {\n    if (!comparator) {\n      comparator = defaultComparator;\n    }\n    var isKeyedIterable = isKeyed(iterable);\n    var index = 0;\n    var entries = iterable.toSeq().map(\n      function(v, k)  {return [k, v, index++, mapper ? mapper(v, k, iterable) : v]}\n    ).toArray();\n    entries.sort(function(a, b)  {return comparator(a[3], b[3]) || a[2] - b[2]}).forEach(\n      isKeyedIterable ?\n      function(v, i)  { entries[i].length = 2; } :\n      function(v, i)  { entries[i] = v[1]; }\n    );\n    return isKeyedIterable ? KeyedSeq(entries) :\n      isIndexed(iterable) ? IndexedSeq(entries) :\n      SetSeq(entries);\n  }\n\n\n  function maxFactory(iterable, comparator, mapper) {\n    if (!comparator) {\n      comparator = defaultComparator;\n    }\n    if (mapper) {\n      var entry = iterable.toSeq()\n        .map(function(v, k)  {return [v, mapper(v, k, iterable)]})\n        .reduce(function(a, b)  {return maxCompare(comparator, a[1], b[1]) ? b : a});\n      return entry && entry[0];\n    } else {\n      return iterable.reduce(function(a, b)  {return maxCompare(comparator, a, b) ? b : a});\n    }\n  }\n\n  function maxCompare(comparator, a, b) {\n    var comp = comparator(b, a);\n    // b is considered the new max if the comparator declares them equal, but\n    // they are not equal and b is in fact a nullish value.\n    return (comp === 0 && b !== a && (b === undefined || b === null || b !== b)) || comp > 0;\n  }\n\n\n  function zipWithFactory(keyIter, zipper, iters) {\n    var zipSequence = makeSequence(keyIter);\n    zipSequence.size = new ArraySeq(iters).map(function(i ) {return i.size}).min();\n    // Note: this a generic base implementation of __iterate in terms of\n    // __iterator which may be more generically useful in the future.\n    zipSequence.__iterate = function(fn, reverse) {\n      /* generic:\n      var iterator = this.__iterator(ITERATE_ENTRIES, reverse);\n      var step;\n      var iterations = 0;\n      while (!(step = iterator.next()).done) {\n        iterations++;\n        if (fn(step.value[1], step.value[0], this) === false) {\n          break;\n        }\n      }\n      return iterations;\n      */\n      // indexed:\n      var iterator = this.__iterator(ITERATE_VALUES, reverse);\n      var step;\n      var iterations = 0;\n      while (!(step = iterator.next()).done) {\n        if (fn(step.value, iterations++, this) === false) {\n          break;\n        }\n      }\n      return iterations;\n    };\n    zipSequence.__iteratorUncached = function(type, reverse) {\n      var iterators = iters.map(function(i )\n        {return (i = Iterable(i), getIterator(reverse ? i.reverse() : i))}\n      );\n      var iterations = 0;\n      var isDone = false;\n      return new Iterator(function()  {\n        var steps;\n        if (!isDone) {\n          steps = iterators.map(function(i ) {return i.next()});\n          isDone = steps.some(function(s ) {return s.done});\n        }\n        if (isDone) {\n          return iteratorDone();\n        }\n        return iteratorValue(\n          type,\n          iterations++,\n          zipper.apply(null, steps.map(function(s ) {return s.value}))\n        );\n      });\n    };\n    return zipSequence\n  }\n\n\n  // #pragma Helper Functions\n\n  function reify(iter, seq) {\n    return isSeq(iter) ? seq : iter.constructor(seq);\n  }\n\n  function validateEntry(entry) {\n    if (entry !== Object(entry)) {\n      throw new TypeError('Expected [K, V] tuple: ' + entry);\n    }\n  }\n\n  function resolveSize(iter) {\n    assertNotInfinite(iter.size);\n    return ensureSize(iter);\n  }\n\n  function iterableClass(iterable) {\n    return isKeyed(iterable) ? KeyedIterable :\n      isIndexed(iterable) ? IndexedIterable :\n      SetIterable;\n  }\n\n  function makeSequence(iterable) {\n    return Object.create(\n      (\n        isKeyed(iterable) ? KeyedSeq :\n        isIndexed(iterable) ? IndexedSeq :\n        SetSeq\n      ).prototype\n    );\n  }\n\n  function cacheResultThrough() {\n    if (this._iter.cacheResult) {\n      this._iter.cacheResult();\n      this.size = this._iter.size;\n      return this;\n    } else {\n      return Seq.prototype.cacheResult.call(this);\n    }\n  }\n\n  function defaultComparator(a, b) {\n    return a > b ? 1 : a < b ? -1 : 0;\n  }\n\n  function forceIterator(keyPath) {\n    var iter = getIterator(keyPath);\n    if (!iter) {\n      // Array might not be iterable in this environment, so we need a fallback\n      // to our wrapped type.\n      if (!isArrayLike(keyPath)) {\n        throw new TypeError('Expected iterable or array-like: ' + keyPath);\n      }\n      iter = getIterator(Iterable(keyPath));\n    }\n    return iter;\n  }\n\n  createClass(Record, KeyedCollection);\n\n    function Record(defaultValues, name) {\n      var hasInitialized;\n\n      var RecordType = function Record(values) {\n        if (values instanceof RecordType) {\n          return values;\n        }\n        if (!(this instanceof RecordType)) {\n          return new RecordType(values);\n        }\n        if (!hasInitialized) {\n          hasInitialized = true;\n          var keys = Object.keys(defaultValues);\n          setProps(RecordTypePrototype, keys);\n          RecordTypePrototype.size = keys.length;\n          RecordTypePrototype._name = name;\n          RecordTypePrototype._keys = keys;\n          RecordTypePrototype._defaultValues = defaultValues;\n        }\n        this._map = Map(values);\n      };\n\n      var RecordTypePrototype = RecordType.prototype = Object.create(RecordPrototype);\n      RecordTypePrototype.constructor = RecordType;\n\n      return RecordType;\n    }\n\n    Record.prototype.toString = function() {\n      return this.__toString(recordName(this) + ' {', '}');\n    };\n\n    // @pragma Access\n\n    Record.prototype.has = function(k) {\n      return this._defaultValues.hasOwnProperty(k);\n    };\n\n    Record.prototype.get = function(k, notSetValue) {\n      if (!this.has(k)) {\n        return notSetValue;\n      }\n      var defaultVal = this._defaultValues[k];\n      return this._map ? this._map.get(k, defaultVal) : defaultVal;\n    };\n\n    // @pragma Modification\n\n    Record.prototype.clear = function() {\n      if (this.__ownerID) {\n        this._map && this._map.clear();\n        return this;\n      }\n      var RecordType = this.constructor;\n      return RecordType._empty || (RecordType._empty = makeRecord(this, emptyMap()));\n    };\n\n    Record.prototype.set = function(k, v) {\n      if (!this.has(k)) {\n        throw new Error('Cannot set unknown key \"' + k + '\" on ' + recordName(this));\n      }\n      if (this._map && !this._map.has(k)) {\n        var defaultVal = this._defaultValues[k];\n        if (v === defaultVal) {\n          return this;\n        }\n      }\n      var newMap = this._map && this._map.set(k, v);\n      if (this.__ownerID || newMap === this._map) {\n        return this;\n      }\n      return makeRecord(this, newMap);\n    };\n\n    Record.prototype.remove = function(k) {\n      if (!this.has(k)) {\n        return this;\n      }\n      var newMap = this._map && this._map.remove(k);\n      if (this.__ownerID || newMap === this._map) {\n        return this;\n      }\n      return makeRecord(this, newMap);\n    };\n\n    Record.prototype.wasAltered = function() {\n      return this._map.wasAltered();\n    };\n\n    Record.prototype.__iterator = function(type, reverse) {var this$0 = this;\n      return KeyedIterable(this._defaultValues).map(function(_, k)  {return this$0.get(k)}).__iterator(type, reverse);\n    };\n\n    Record.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return KeyedIterable(this._defaultValues).map(function(_, k)  {return this$0.get(k)}).__iterate(fn, reverse);\n    };\n\n    Record.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      var newMap = this._map && this._map.__ensureOwner(ownerID);\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this._map = newMap;\n        return this;\n      }\n      return makeRecord(this, newMap, ownerID);\n    };\n\n\n  var RecordPrototype = Record.prototype;\n  RecordPrototype[DELETE] = RecordPrototype.remove;\n  RecordPrototype.deleteIn =\n  RecordPrototype.removeIn = MapPrototype.removeIn;\n  RecordPrototype.merge = MapPrototype.merge;\n  RecordPrototype.mergeWith = MapPrototype.mergeWith;\n  RecordPrototype.mergeIn = MapPrototype.mergeIn;\n  RecordPrototype.mergeDeep = MapPrototype.mergeDeep;\n  RecordPrototype.mergeDeepWith = MapPrototype.mergeDeepWith;\n  RecordPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\n  RecordPrototype.setIn = MapPrototype.setIn;\n  RecordPrototype.update = MapPrototype.update;\n  RecordPrototype.updateIn = MapPrototype.updateIn;\n  RecordPrototype.withMutations = MapPrototype.withMutations;\n  RecordPrototype.asMutable = MapPrototype.asMutable;\n  RecordPrototype.asImmutable = MapPrototype.asImmutable;\n\n\n  function makeRecord(likeRecord, map, ownerID) {\n    var record = Object.create(Object.getPrototypeOf(likeRecord));\n    record._map = map;\n    record.__ownerID = ownerID;\n    return record;\n  }\n\n  function recordName(record) {\n    return record._name || record.constructor.name || 'Record';\n  }\n\n  function setProps(prototype, names) {\n    try {\n      names.forEach(setProp.bind(undefined, prototype));\n    } catch (error) {\n      // Object.defineProperty failed. Probably IE8.\n    }\n  }\n\n  function setProp(prototype, name) {\n    Object.defineProperty(prototype, name, {\n      get: function() {\n        return this.get(name);\n      },\n      set: function(value) {\n        invariant(this.__ownerID, 'Cannot set on an immutable record.');\n        this.set(name, value);\n      }\n    });\n  }\n\n  createClass(Set, SetCollection);\n\n    // @pragma Construction\n\n    function Set(value) {\n      return value === null || value === undefined ? emptySet() :\n        isSet(value) && !isOrdered(value) ? value :\n        emptySet().withMutations(function(set ) {\n          var iter = SetIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v ) {return set.add(v)});\n        });\n    }\n\n    Set.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    Set.fromKeys = function(value) {\n      return this(KeyedIterable(value).keySeq());\n    };\n\n    Set.prototype.toString = function() {\n      return this.__toString('Set {', '}');\n    };\n\n    // @pragma Access\n\n    Set.prototype.has = function(value) {\n      return this._map.has(value);\n    };\n\n    // @pragma Modification\n\n    Set.prototype.add = function(value) {\n      return updateSet(this, this._map.set(value, true));\n    };\n\n    Set.prototype.remove = function(value) {\n      return updateSet(this, this._map.remove(value));\n    };\n\n    Set.prototype.clear = function() {\n      return updateSet(this, this._map.clear());\n    };\n\n    // @pragma Composition\n\n    Set.prototype.union = function() {var iters = SLICE$0.call(arguments, 0);\n      iters = iters.filter(function(x ) {return x.size !== 0});\n      if (iters.length === 0) {\n        return this;\n      }\n      if (this.size === 0 && !this.__ownerID && iters.length === 1) {\n        return this.constructor(iters[0]);\n      }\n      return this.withMutations(function(set ) {\n        for (var ii = 0; ii < iters.length; ii++) {\n          SetIterable(iters[ii]).forEach(function(value ) {return set.add(value)});\n        }\n      });\n    };\n\n    Set.prototype.intersect = function() {var iters = SLICE$0.call(arguments, 0);\n      if (iters.length === 0) {\n        return this;\n      }\n      iters = iters.map(function(iter ) {return SetIterable(iter)});\n      var originalSet = this;\n      return this.withMutations(function(set ) {\n        originalSet.forEach(function(value ) {\n          if (!iters.every(function(iter ) {return iter.includes(value)})) {\n            set.remove(value);\n          }\n        });\n      });\n    };\n\n    Set.prototype.subtract = function() {var iters = SLICE$0.call(arguments, 0);\n      if (iters.length === 0) {\n        return this;\n      }\n      iters = iters.map(function(iter ) {return SetIterable(iter)});\n      var originalSet = this;\n      return this.withMutations(function(set ) {\n        originalSet.forEach(function(value ) {\n          if (iters.some(function(iter ) {return iter.includes(value)})) {\n            set.remove(value);\n          }\n        });\n      });\n    };\n\n    Set.prototype.merge = function() {\n      return this.union.apply(this, arguments);\n    };\n\n    Set.prototype.mergeWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return this.union.apply(this, iters);\n    };\n\n    Set.prototype.sort = function(comparator) {\n      // Late binding\n      return OrderedSet(sortFactory(this, comparator));\n    };\n\n    Set.prototype.sortBy = function(mapper, comparator) {\n      // Late binding\n      return OrderedSet(sortFactory(this, comparator, mapper));\n    };\n\n    Set.prototype.wasAltered = function() {\n      return this._map.wasAltered();\n    };\n\n    Set.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._map.__iterate(function(_, k)  {return fn(k, k, this$0)}, reverse);\n    };\n\n    Set.prototype.__iterator = function(type, reverse) {\n      return this._map.map(function(_, k)  {return k}).__iterator(type, reverse);\n    };\n\n    Set.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      var newMap = this._map.__ensureOwner(ownerID);\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this._map = newMap;\n        return this;\n      }\n      return this.__make(newMap, ownerID);\n    };\n\n\n  function isSet(maybeSet) {\n    return !!(maybeSet && maybeSet[IS_SET_SENTINEL]);\n  }\n\n  Set.isSet = isSet;\n\n  var IS_SET_SENTINEL = '@@__IMMUTABLE_SET__@@';\n\n  var SetPrototype = Set.prototype;\n  SetPrototype[IS_SET_SENTINEL] = true;\n  SetPrototype[DELETE] = SetPrototype.remove;\n  SetPrototype.mergeDeep = SetPrototype.merge;\n  SetPrototype.mergeDeepWith = SetPrototype.mergeWith;\n  SetPrototype.withMutations = MapPrototype.withMutations;\n  SetPrototype.asMutable = MapPrototype.asMutable;\n  SetPrototype.asImmutable = MapPrototype.asImmutable;\n\n  SetPrototype.__empty = emptySet;\n  SetPrototype.__make = makeSet;\n\n  function updateSet(set, newMap) {\n    if (set.__ownerID) {\n      set.size = newMap.size;\n      set._map = newMap;\n      return set;\n    }\n    return newMap === set._map ? set :\n      newMap.size === 0 ? set.__empty() :\n      set.__make(newMap);\n  }\n\n  function makeSet(map, ownerID) {\n    var set = Object.create(SetPrototype);\n    set.size = map ? map.size : 0;\n    set._map = map;\n    set.__ownerID = ownerID;\n    return set;\n  }\n\n  var EMPTY_SET;\n  function emptySet() {\n    return EMPTY_SET || (EMPTY_SET = makeSet(emptyMap()));\n  }\n\n  createClass(OrderedSet, Set);\n\n    // @pragma Construction\n\n    function OrderedSet(value) {\n      return value === null || value === undefined ? emptyOrderedSet() :\n        isOrderedSet(value) ? value :\n        emptyOrderedSet().withMutations(function(set ) {\n          var iter = SetIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v ) {return set.add(v)});\n        });\n    }\n\n    OrderedSet.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    OrderedSet.fromKeys = function(value) {\n      return this(KeyedIterable(value).keySeq());\n    };\n\n    OrderedSet.prototype.toString = function() {\n      return this.__toString('OrderedSet {', '}');\n    };\n\n\n  function isOrderedSet(maybeOrderedSet) {\n    return isSet(maybeOrderedSet) && isOrdered(maybeOrderedSet);\n  }\n\n  OrderedSet.isOrderedSet = isOrderedSet;\n\n  var OrderedSetPrototype = OrderedSet.prototype;\n  OrderedSetPrototype[IS_ORDERED_SENTINEL] = true;\n\n  OrderedSetPrototype.__empty = emptyOrderedSet;\n  OrderedSetPrototype.__make = makeOrderedSet;\n\n  function makeOrderedSet(map, ownerID) {\n    var set = Object.create(OrderedSetPrototype);\n    set.size = map ? map.size : 0;\n    set._map = map;\n    set.__ownerID = ownerID;\n    return set;\n  }\n\n  var EMPTY_ORDERED_SET;\n  function emptyOrderedSet() {\n    return EMPTY_ORDERED_SET || (EMPTY_ORDERED_SET = makeOrderedSet(emptyOrderedMap()));\n  }\n\n  createClass(Stack, IndexedCollection);\n\n    // @pragma Construction\n\n    function Stack(value) {\n      return value === null || value === undefined ? emptyStack() :\n        isStack(value) ? value :\n        emptyStack().unshiftAll(value);\n    }\n\n    Stack.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    Stack.prototype.toString = function() {\n      return this.__toString('Stack [', ']');\n    };\n\n    // @pragma Access\n\n    Stack.prototype.get = function(index, notSetValue) {\n      var head = this._head;\n      index = wrapIndex(this, index);\n      while (head && index--) {\n        head = head.next;\n      }\n      return head ? head.value : notSetValue;\n    };\n\n    Stack.prototype.peek = function() {\n      return this._head && this._head.value;\n    };\n\n    // @pragma Modification\n\n    Stack.prototype.push = function(/*...values*/) {\n      if (arguments.length === 0) {\n        return this;\n      }\n      var newSize = this.size + arguments.length;\n      var head = this._head;\n      for (var ii = arguments.length - 1; ii >= 0; ii--) {\n        head = {\n          value: arguments[ii],\n          next: head\n        };\n      }\n      if (this.__ownerID) {\n        this.size = newSize;\n        this._head = head;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return makeStack(newSize, head);\n    };\n\n    Stack.prototype.pushAll = function(iter) {\n      iter = IndexedIterable(iter);\n      if (iter.size === 0) {\n        return this;\n      }\n      assertNotInfinite(iter.size);\n      var newSize = this.size;\n      var head = this._head;\n      iter.reverse().forEach(function(value ) {\n        newSize++;\n        head = {\n          value: value,\n          next: head\n        };\n      });\n      if (this.__ownerID) {\n        this.size = newSize;\n        this._head = head;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return makeStack(newSize, head);\n    };\n\n    Stack.prototype.pop = function() {\n      return this.slice(1);\n    };\n\n    Stack.prototype.unshift = function(/*...values*/) {\n      return this.push.apply(this, arguments);\n    };\n\n    Stack.prototype.unshiftAll = function(iter) {\n      return this.pushAll(iter);\n    };\n\n    Stack.prototype.shift = function() {\n      return this.pop.apply(this, arguments);\n    };\n\n    Stack.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = 0;\n        this._head = undefined;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return emptyStack();\n    };\n\n    Stack.prototype.slice = function(begin, end) {\n      if (wholeSlice(begin, end, this.size)) {\n        return this;\n      }\n      var resolvedBegin = resolveBegin(begin, this.size);\n      var resolvedEnd = resolveEnd(end, this.size);\n      if (resolvedEnd !== this.size) {\n        // super.slice(begin, end);\n        return IndexedCollection.prototype.slice.call(this, begin, end);\n      }\n      var newSize = this.size - resolvedBegin;\n      var head = this._head;\n      while (resolvedBegin--) {\n        head = head.next;\n      }\n      if (this.__ownerID) {\n        this.size = newSize;\n        this._head = head;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return makeStack(newSize, head);\n    };\n\n    // @pragma Mutability\n\n    Stack.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this.__altered = false;\n        return this;\n      }\n      return makeStack(this.size, this._head, ownerID, this.__hash);\n    };\n\n    // @pragma Iteration\n\n    Stack.prototype.__iterate = function(fn, reverse) {\n      if (reverse) {\n        return this.reverse().__iterate(fn);\n      }\n      var iterations = 0;\n      var node = this._head;\n      while (node) {\n        if (fn(node.value, iterations++, this) === false) {\n          break;\n        }\n        node = node.next;\n      }\n      return iterations;\n    };\n\n    Stack.prototype.__iterator = function(type, reverse) {\n      if (reverse) {\n        return this.reverse().__iterator(type);\n      }\n      var iterations = 0;\n      var node = this._head;\n      return new Iterator(function()  {\n        if (node) {\n          var value = node.value;\n          node = node.next;\n          return iteratorValue(type, iterations++, value);\n        }\n        return iteratorDone();\n      });\n    };\n\n\n  function isStack(maybeStack) {\n    return !!(maybeStack && maybeStack[IS_STACK_SENTINEL]);\n  }\n\n  Stack.isStack = isStack;\n\n  var IS_STACK_SENTINEL = '@@__IMMUTABLE_STACK__@@';\n\n  var StackPrototype = Stack.prototype;\n  StackPrototype[IS_STACK_SENTINEL] = true;\n  StackPrototype.withMutations = MapPrototype.withMutations;\n  StackPrototype.asMutable = MapPrototype.asMutable;\n  StackPrototype.asImmutable = MapPrototype.asImmutable;\n  StackPrototype.wasAltered = MapPrototype.wasAltered;\n\n\n  function makeStack(size, head, ownerID, hash) {\n    var map = Object.create(StackPrototype);\n    map.size = size;\n    map._head = head;\n    map.__ownerID = ownerID;\n    map.__hash = hash;\n    map.__altered = false;\n    return map;\n  }\n\n  var EMPTY_STACK;\n  function emptyStack() {\n    return EMPTY_STACK || (EMPTY_STACK = makeStack(0));\n  }\n\n  /**\n   * Contributes additional methods to a constructor\n   */\n  function mixin(ctor, methods) {\n    var keyCopier = function(key ) { ctor.prototype[key] = methods[key]; };\n    Object.keys(methods).forEach(keyCopier);\n    Object.getOwnPropertySymbols &&\n      Object.getOwnPropertySymbols(methods).forEach(keyCopier);\n    return ctor;\n  }\n\n  Iterable.Iterator = Iterator;\n\n  mixin(Iterable, {\n\n    // ### Conversion to other types\n\n    toArray: function() {\n      assertNotInfinite(this.size);\n      var array = new Array(this.size || 0);\n      this.valueSeq().__iterate(function(v, i)  { array[i] = v; });\n      return array;\n    },\n\n    toIndexedSeq: function() {\n      return new ToIndexedSequence(this);\n    },\n\n    toJS: function() {\n      return this.toSeq().map(\n        function(value ) {return value && typeof value.toJS === 'function' ? value.toJS() : value}\n      ).__toJS();\n    },\n\n    toJSON: function() {\n      return this.toSeq().map(\n        function(value ) {return value && typeof value.toJSON === 'function' ? value.toJSON() : value}\n      ).__toJS();\n    },\n\n    toKeyedSeq: function() {\n      return new ToKeyedSequence(this, true);\n    },\n\n    toMap: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return Map(this.toKeyedSeq());\n    },\n\n    toObject: function() {\n      assertNotInfinite(this.size);\n      var object = {};\n      this.__iterate(function(v, k)  { object[k] = v; });\n      return object;\n    },\n\n    toOrderedMap: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return OrderedMap(this.toKeyedSeq());\n    },\n\n    toOrderedSet: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return OrderedSet(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n    toSet: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return Set(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n    toSetSeq: function() {\n      return new ToSetSequence(this);\n    },\n\n    toSeq: function() {\n      return isIndexed(this) ? this.toIndexedSeq() :\n        isKeyed(this) ? this.toKeyedSeq() :\n        this.toSetSeq();\n    },\n\n    toStack: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return Stack(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n    toList: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return List(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n\n    // ### Common JavaScript methods and properties\n\n    toString: function() {\n      return '[Iterable]';\n    },\n\n    __toString: function(head, tail) {\n      if (this.size === 0) {\n        return head + tail;\n      }\n      return head + ' ' + this.toSeq().map(this.__toStringMapper).join(', ') + ' ' + tail;\n    },\n\n\n    // ### ES6 Collection methods (ES6 Array and Map)\n\n    concat: function() {var values = SLICE$0.call(arguments, 0);\n      return reify(this, concatFactory(this, values));\n    },\n\n    includes: function(searchValue) {\n      return this.some(function(value ) {return is(value, searchValue)});\n    },\n\n    entries: function() {\n      return this.__iterator(ITERATE_ENTRIES);\n    },\n\n    every: function(predicate, context) {\n      assertNotInfinite(this.size);\n      var returnValue = true;\n      this.__iterate(function(v, k, c)  {\n        if (!predicate.call(context, v, k, c)) {\n          returnValue = false;\n          return false;\n        }\n      });\n      return returnValue;\n    },\n\n    filter: function(predicate, context) {\n      return reify(this, filterFactory(this, predicate, context, true));\n    },\n\n    find: function(predicate, context, notSetValue) {\n      var entry = this.findEntry(predicate, context);\n      return entry ? entry[1] : notSetValue;\n    },\n\n    forEach: function(sideEffect, context) {\n      assertNotInfinite(this.size);\n      return this.__iterate(context ? sideEffect.bind(context) : sideEffect);\n    },\n\n    join: function(separator) {\n      assertNotInfinite(this.size);\n      separator = separator !== undefined ? '' + separator : ',';\n      var joined = '';\n      var isFirst = true;\n      this.__iterate(function(v ) {\n        isFirst ? (isFirst = false) : (joined += separator);\n        joined += v !== null && v !== undefined ? v.toString() : '';\n      });\n      return joined;\n    },\n\n    keys: function() {\n      return this.__iterator(ITERATE_KEYS);\n    },\n\n    map: function(mapper, context) {\n      return reify(this, mapFactory(this, mapper, context));\n    },\n\n    reduce: function(reducer, initialReduction, context) {\n      assertNotInfinite(this.size);\n      var reduction;\n      var useFirst;\n      if (arguments.length < 2) {\n        useFirst = true;\n      } else {\n        reduction = initialReduction;\n      }\n      this.__iterate(function(v, k, c)  {\n        if (useFirst) {\n          useFirst = false;\n          reduction = v;\n        } else {\n          reduction = reducer.call(context, reduction, v, k, c);\n        }\n      });\n      return reduction;\n    },\n\n    reduceRight: function(reducer, initialReduction, context) {\n      var reversed = this.toKeyedSeq().reverse();\n      return reversed.reduce.apply(reversed, arguments);\n    },\n\n    reverse: function() {\n      return reify(this, reverseFactory(this, true));\n    },\n\n    slice: function(begin, end) {\n      return reify(this, sliceFactory(this, begin, end, true));\n    },\n\n    some: function(predicate, context) {\n      return !this.every(not(predicate), context);\n    },\n\n    sort: function(comparator) {\n      return reify(this, sortFactory(this, comparator));\n    },\n\n    values: function() {\n      return this.__iterator(ITERATE_VALUES);\n    },\n\n\n    // ### More sequential methods\n\n    butLast: function() {\n      return this.slice(0, -1);\n    },\n\n    isEmpty: function() {\n      return this.size !== undefined ? this.size === 0 : !this.some(function()  {return true});\n    },\n\n    count: function(predicate, context) {\n      return ensureSize(\n        predicate ? this.toSeq().filter(predicate, context) : this\n      );\n    },\n\n    countBy: function(grouper, context) {\n      return countByFactory(this, grouper, context);\n    },\n\n    equals: function(other) {\n      return deepEqual(this, other);\n    },\n\n    entrySeq: function() {\n      var iterable = this;\n      if (iterable._cache) {\n        // We cache as an entries array, so we can just return the cache!\n        return new ArraySeq(iterable._cache);\n      }\n      var entriesSequence = iterable.toSeq().map(entryMapper).toIndexedSeq();\n      entriesSequence.fromEntrySeq = function()  {return iterable.toSeq()};\n      return entriesSequence;\n    },\n\n    filterNot: function(predicate, context) {\n      return this.filter(not(predicate), context);\n    },\n\n    findEntry: function(predicate, context, notSetValue) {\n      var found = notSetValue;\n      this.__iterate(function(v, k, c)  {\n        if (predicate.call(context, v, k, c)) {\n          found = [k, v];\n          return false;\n        }\n      });\n      return found;\n    },\n\n    findKey: function(predicate, context) {\n      var entry = this.findEntry(predicate, context);\n      return entry && entry[0];\n    },\n\n    findLast: function(predicate, context, notSetValue) {\n      return this.toKeyedSeq().reverse().find(predicate, context, notSetValue);\n    },\n\n    findLastEntry: function(predicate, context, notSetValue) {\n      return this.toKeyedSeq().reverse().findEntry(predicate, context, notSetValue);\n    },\n\n    findLastKey: function(predicate, context) {\n      return this.toKeyedSeq().reverse().findKey(predicate, context);\n    },\n\n    first: function() {\n      return this.find(returnTrue);\n    },\n\n    flatMap: function(mapper, context) {\n      return reify(this, flatMapFactory(this, mapper, context));\n    },\n\n    flatten: function(depth) {\n      return reify(this, flattenFactory(this, depth, true));\n    },\n\n    fromEntrySeq: function() {\n      return new FromEntriesSequence(this);\n    },\n\n    get: function(searchKey, notSetValue) {\n      return this.find(function(_, key)  {return is(key, searchKey)}, undefined, notSetValue);\n    },\n\n    getIn: function(searchKeyPath, notSetValue) {\n      var nested = this;\n      // Note: in an ES6 environment, we would prefer:\n      // for (var key of searchKeyPath) {\n      var iter = forceIterator(searchKeyPath);\n      var step;\n      while (!(step = iter.next()).done) {\n        var key = step.value;\n        nested = nested && nested.get ? nested.get(key, NOT_SET) : NOT_SET;\n        if (nested === NOT_SET) {\n          return notSetValue;\n        }\n      }\n      return nested;\n    },\n\n    groupBy: function(grouper, context) {\n      return groupByFactory(this, grouper, context);\n    },\n\n    has: function(searchKey) {\n      return this.get(searchKey, NOT_SET) !== NOT_SET;\n    },\n\n    hasIn: function(searchKeyPath) {\n      return this.getIn(searchKeyPath, NOT_SET) !== NOT_SET;\n    },\n\n    isSubset: function(iter) {\n      iter = typeof iter.includes === 'function' ? iter : Iterable(iter);\n      return this.every(function(value ) {return iter.includes(value)});\n    },\n\n    isSuperset: function(iter) {\n      iter = typeof iter.isSubset === 'function' ? iter : Iterable(iter);\n      return iter.isSubset(this);\n    },\n\n    keyOf: function(searchValue) {\n      return this.findKey(function(value ) {return is(value, searchValue)});\n    },\n\n    keySeq: function() {\n      return this.toSeq().map(keyMapper).toIndexedSeq();\n    },\n\n    last: function() {\n      return this.toSeq().reverse().first();\n    },\n\n    lastKeyOf: function(searchValue) {\n      return this.toKeyedSeq().reverse().keyOf(searchValue);\n    },\n\n    max: function(comparator) {\n      return maxFactory(this, comparator);\n    },\n\n    maxBy: function(mapper, comparator) {\n      return maxFactory(this, comparator, mapper);\n    },\n\n    min: function(comparator) {\n      return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator);\n    },\n\n    minBy: function(mapper, comparator) {\n      return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator, mapper);\n    },\n\n    rest: function() {\n      return this.slice(1);\n    },\n\n    skip: function(amount) {\n      return this.slice(Math.max(0, amount));\n    },\n\n    skipLast: function(amount) {\n      return reify(this, this.toSeq().reverse().skip(amount).reverse());\n    },\n\n    skipWhile: function(predicate, context) {\n      return reify(this, skipWhileFactory(this, predicate, context, true));\n    },\n\n    skipUntil: function(predicate, context) {\n      return this.skipWhile(not(predicate), context);\n    },\n\n    sortBy: function(mapper, comparator) {\n      return reify(this, sortFactory(this, comparator, mapper));\n    },\n\n    take: function(amount) {\n      return this.slice(0, Math.max(0, amount));\n    },\n\n    takeLast: function(amount) {\n      return reify(this, this.toSeq().reverse().take(amount).reverse());\n    },\n\n    takeWhile: function(predicate, context) {\n      return reify(this, takeWhileFactory(this, predicate, context));\n    },\n\n    takeUntil: function(predicate, context) {\n      return this.takeWhile(not(predicate), context);\n    },\n\n    valueSeq: function() {\n      return this.toIndexedSeq();\n    },\n\n\n    // ### Hashable Object\n\n    hashCode: function() {\n      return this.__hash || (this.__hash = hashIterable(this));\n    }\n\n\n    // ### Internal\n\n    // abstract __iterate(fn, reverse)\n\n    // abstract __iterator(type, reverse)\n  });\n\n  // var IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\n  // var IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\n  // var IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\n  // var IS_ORDERED_SENTINEL = '@@__IMMUTABLE_ORDERED__@@';\n\n  var IterablePrototype = Iterable.prototype;\n  IterablePrototype[IS_ITERABLE_SENTINEL] = true;\n  IterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.values;\n  IterablePrototype.__toJS = IterablePrototype.toArray;\n  IterablePrototype.__toStringMapper = quoteString;\n  IterablePrototype.inspect =\n  IterablePrototype.toSource = function() { return this.toString(); };\n  IterablePrototype.chain = IterablePrototype.flatMap;\n  IterablePrototype.contains = IterablePrototype.includes;\n\n  mixin(KeyedIterable, {\n\n    // ### More sequential methods\n\n    flip: function() {\n      return reify(this, flipFactory(this));\n    },\n\n    mapEntries: function(mapper, context) {var this$0 = this;\n      var iterations = 0;\n      return reify(this,\n        this.toSeq().map(\n          function(v, k)  {return mapper.call(context, [k, v], iterations++, this$0)}\n        ).fromEntrySeq()\n      );\n    },\n\n    mapKeys: function(mapper, context) {var this$0 = this;\n      return reify(this,\n        this.toSeq().flip().map(\n          function(k, v)  {return mapper.call(context, k, v, this$0)}\n        ).flip()\n      );\n    }\n\n  });\n\n  var KeyedIterablePrototype = KeyedIterable.prototype;\n  KeyedIterablePrototype[IS_KEYED_SENTINEL] = true;\n  KeyedIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.entries;\n  KeyedIterablePrototype.__toJS = IterablePrototype.toObject;\n  KeyedIterablePrototype.__toStringMapper = function(v, k)  {return JSON.stringify(k) + ': ' + quoteString(v)};\n\n\n\n  mixin(IndexedIterable, {\n\n    // ### Conversion to other types\n\n    toKeyedSeq: function() {\n      return new ToKeyedSequence(this, false);\n    },\n\n\n    // ### ES6 Collection methods (ES6 Array and Map)\n\n    filter: function(predicate, context) {\n      return reify(this, filterFactory(this, predicate, context, false));\n    },\n\n    findIndex: function(predicate, context) {\n      var entry = this.findEntry(predicate, context);\n      return entry ? entry[0] : -1;\n    },\n\n    indexOf: function(searchValue) {\n      var key = this.keyOf(searchValue);\n      return key === undefined ? -1 : key;\n    },\n\n    lastIndexOf: function(searchValue) {\n      var key = this.lastKeyOf(searchValue);\n      return key === undefined ? -1 : key;\n    },\n\n    reverse: function() {\n      return reify(this, reverseFactory(this, false));\n    },\n\n    slice: function(begin, end) {\n      return reify(this, sliceFactory(this, begin, end, false));\n    },\n\n    splice: function(index, removeNum /*, ...values*/) {\n      var numArgs = arguments.length;\n      removeNum = Math.max(removeNum | 0, 0);\n      if (numArgs === 0 || (numArgs === 2 && !removeNum)) {\n        return this;\n      }\n      // If index is negative, it should resolve relative to the size of the\n      // collection. However size may be expensive to compute if not cached, so\n      // only call count() if the number is in fact negative.\n      index = resolveBegin(index, index < 0 ? this.count() : this.size);\n      var spliced = this.slice(0, index);\n      return reify(\n        this,\n        numArgs === 1 ?\n          spliced :\n          spliced.concat(arrCopy(arguments, 2), this.slice(index + removeNum))\n      );\n    },\n\n\n    // ### More collection methods\n\n    findLastIndex: function(predicate, context) {\n      var entry = this.findLastEntry(predicate, context);\n      return entry ? entry[0] : -1;\n    },\n\n    first: function() {\n      return this.get(0);\n    },\n\n    flatten: function(depth) {\n      return reify(this, flattenFactory(this, depth, false));\n    },\n\n    get: function(index, notSetValue) {\n      index = wrapIndex(this, index);\n      return (index < 0 || (this.size === Infinity ||\n          (this.size !== undefined && index > this.size))) ?\n        notSetValue :\n        this.find(function(_, key)  {return key === index}, undefined, notSetValue);\n    },\n\n    has: function(index) {\n      index = wrapIndex(this, index);\n      return index >= 0 && (this.size !== undefined ?\n        this.size === Infinity || index < this.size :\n        this.indexOf(index) !== -1\n      );\n    },\n\n    interpose: function(separator) {\n      return reify(this, interposeFactory(this, separator));\n    },\n\n    interleave: function(/*...iterables*/) {\n      var iterables = [this].concat(arrCopy(arguments));\n      var zipped = zipWithFactory(this.toSeq(), IndexedSeq.of, iterables);\n      var interleaved = zipped.flatten(true);\n      if (zipped.size) {\n        interleaved.size = zipped.size * iterables.length;\n      }\n      return reify(this, interleaved);\n    },\n\n    keySeq: function() {\n      return Range(0, this.size);\n    },\n\n    last: function() {\n      return this.get(-1);\n    },\n\n    skipWhile: function(predicate, context) {\n      return reify(this, skipWhileFactory(this, predicate, context, false));\n    },\n\n    zip: function(/*, ...iterables */) {\n      var iterables = [this].concat(arrCopy(arguments));\n      return reify(this, zipWithFactory(this, defaultZipper, iterables));\n    },\n\n    zipWith: function(zipper/*, ...iterables */) {\n      var iterables = arrCopy(arguments);\n      iterables[0] = this;\n      return reify(this, zipWithFactory(this, zipper, iterables));\n    }\n\n  });\n\n  IndexedIterable.prototype[IS_INDEXED_SENTINEL] = true;\n  IndexedIterable.prototype[IS_ORDERED_SENTINEL] = true;\n\n\n\n  mixin(SetIterable, {\n\n    // ### ES6 Collection methods (ES6 Array and Map)\n\n    get: function(value, notSetValue) {\n      return this.has(value) ? value : notSetValue;\n    },\n\n    includes: function(value) {\n      return this.has(value);\n    },\n\n\n    // ### More sequential methods\n\n    keySeq: function() {\n      return this.valueSeq();\n    }\n\n  });\n\n  SetIterable.prototype.has = IterablePrototype.includes;\n  SetIterable.prototype.contains = SetIterable.prototype.includes;\n\n\n  // Mixin subclasses\n\n  mixin(KeyedSeq, KeyedIterable.prototype);\n  mixin(IndexedSeq, IndexedIterable.prototype);\n  mixin(SetSeq, SetIterable.prototype);\n\n  mixin(KeyedCollection, KeyedIterable.prototype);\n  mixin(IndexedCollection, IndexedIterable.prototype);\n  mixin(SetCollection, SetIterable.prototype);\n\n\n  // #pragma Helper functions\n\n  function keyMapper(v, k) {\n    return k;\n  }\n\n  function entryMapper(v, k) {\n    return [k, v];\n  }\n\n  function not(predicate) {\n    return function() {\n      return !predicate.apply(this, arguments);\n    }\n  }\n\n  function neg(predicate) {\n    return function() {\n      return -predicate.apply(this, arguments);\n    }\n  }\n\n  function quoteString(value) {\n    return typeof value === 'string' ? JSON.stringify(value) : String(value);\n  }\n\n  function defaultZipper() {\n    return arrCopy(arguments);\n  }\n\n  function defaultNegComparator(a, b) {\n    return a < b ? 1 : a > b ? -1 : 0;\n  }\n\n  function hashIterable(iterable) {\n    if (iterable.size === Infinity) {\n      return 0;\n    }\n    var ordered = isOrdered(iterable);\n    var keyed = isKeyed(iterable);\n    var h = ordered ? 1 : 0;\n    var size = iterable.__iterate(\n      keyed ?\n        ordered ?\n          function(v, k)  { h = 31 * h + hashMerge(hash(v), hash(k)) | 0; } :\n          function(v, k)  { h = h + hashMerge(hash(v), hash(k)) | 0; } :\n        ordered ?\n          function(v ) { h = 31 * h + hash(v) | 0; } :\n          function(v ) { h = h + hash(v) | 0; }\n    );\n    return murmurHashOfSize(size, h);\n  }\n\n  function murmurHashOfSize(size, h) {\n    h = imul(h, 0xCC9E2D51);\n    h = imul(h << 15 | h >>> -15, 0x1B873593);\n    h = imul(h << 13 | h >>> -13, 5);\n    h = (h + 0xE6546B64 | 0) ^ size;\n    h = imul(h ^ h >>> 16, 0x85EBCA6B);\n    h = imul(h ^ h >>> 13, 0xC2B2AE35);\n    h = smi(h ^ h >>> 16);\n    return h;\n  }\n\n  function hashMerge(a, b) {\n    return a ^ b + 0x9E3779B9 + (a << 6) + (a >> 2) | 0; // int\n  }\n\n  var Immutable = {\n\n    Iterable: Iterable,\n\n    Seq: Seq,\n    Collection: Collection,\n    Map: Map,\n    OrderedMap: OrderedMap,\n    List: List,\n    Stack: Stack,\n    Set: Set,\n    OrderedSet: OrderedSet,\n\n    Record: Record,\n    Range: Range,\n    Repeat: Repeat,\n\n    is: is,\n    fromJS: fromJS\n\n  };\n\n  return Immutable;\n\n}));","/**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\nfunction arrayEach(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (iteratee(array[index], index, array) === false) {\n      break;\n    }\n  }\n  return array;\n}\n\nmodule.exports = arrayEach;\n","var copyObject = require('./_copyObject'),\n    keys = require('./keys');\n\n/**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssign(object, source) {\n  return object && copyObject(source, keys(source), object);\n}\n\nmodule.exports = baseAssign;\n","var copyObject = require('./_copyObject'),\n    keysIn = require('./keysIn');\n\n/**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssignIn(object, source) {\n  return object && copyObject(source, keysIn(source), object);\n}\n\nmodule.exports = baseAssignIn;\n","var Stack = require('./_Stack'),\n    arrayEach = require('./_arrayEach'),\n    assignValue = require('./_assignValue'),\n    baseAssign = require('./_baseAssign'),\n    baseAssignIn = require('./_baseAssignIn'),\n    cloneBuffer = require('./_cloneBuffer'),\n    copyArray = require('./_copyArray'),\n    copySymbols = require('./_copySymbols'),\n    copySymbolsIn = require('./_copySymbolsIn'),\n    getAllKeys = require('./_getAllKeys'),\n    getAllKeysIn = require('./_getAllKeysIn'),\n    getTag = require('./_getTag'),\n    initCloneArray = require('./_initCloneArray'),\n    initCloneByTag = require('./_initCloneByTag'),\n    initCloneObject = require('./_initCloneObject'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isMap = require('./isMap'),\n    isObject = require('./isObject'),\n    isSet = require('./isSet'),\n    keys = require('./keys'),\n    keysIn = require('./keysIn');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_FLAT_FLAG = 2,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values supported by `_.clone`. */\nvar cloneableTags = {};\ncloneableTags[argsTag] = cloneableTags[arrayTag] =\ncloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\ncloneableTags[boolTag] = cloneableTags[dateTag] =\ncloneableTags[float32Tag] = cloneableTags[float64Tag] =\ncloneableTags[int8Tag] = cloneableTags[int16Tag] =\ncloneableTags[int32Tag] = cloneableTags[mapTag] =\ncloneableTags[numberTag] = cloneableTags[objectTag] =\ncloneableTags[regexpTag] = cloneableTags[setTag] =\ncloneableTags[stringTag] = cloneableTags[symbolTag] =\ncloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\ncloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\ncloneableTags[errorTag] = cloneableTags[funcTag] =\ncloneableTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Deep clone\n *  2 - Flatten inherited properties\n *  4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\nfunction baseClone(value, bitmask, customizer, key, object, stack) {\n  var result,\n      isDeep = bitmask & CLONE_DEEP_FLAG,\n      isFlat = bitmask & CLONE_FLAT_FLAG,\n      isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n  if (customizer) {\n    result = object ? customizer(value, key, object, stack) : customizer(value);\n  }\n  if (result !== undefined) {\n    return result;\n  }\n  if (!isObject(value)) {\n    return value;\n  }\n  var isArr = isArray(value);\n  if (isArr) {\n    result = initCloneArray(value);\n    if (!isDeep) {\n      return copyArray(value, result);\n    }\n  } else {\n    var tag = getTag(value),\n        isFunc = tag == funcTag || tag == genTag;\n\n    if (isBuffer(value)) {\n      return cloneBuffer(value, isDeep);\n    }\n    if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n      result = (isFlat || isFunc) ? {} : initCloneObject(value);\n      if (!isDeep) {\n        return isFlat\n          ? copySymbolsIn(value, baseAssignIn(result, value))\n          : copySymbols(value, baseAssign(result, value));\n      }\n    } else {\n      if (!cloneableTags[tag]) {\n        return object ? value : {};\n      }\n      result = initCloneByTag(value, tag, isDeep);\n    }\n  }\n  // Check for circular references and return its corresponding clone.\n  stack || (stack = new Stack);\n  var stacked = stack.get(value);\n  if (stacked) {\n    return stacked;\n  }\n  stack.set(value, result);\n\n  if (isSet(value)) {\n    value.forEach(function(subValue) {\n      result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n    });\n  } else if (isMap(value)) {\n    value.forEach(function(subValue, key) {\n      result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n    });\n  }\n\n  var keysFunc = isFull\n    ? (isFlat ? getAllKeysIn : getAllKeys)\n    : (isFlat ? keysIn : keys);\n\n  var props = isArr ? undefined : keysFunc(value);\n  arrayEach(props || value, function(subValue, key) {\n    if (props) {\n      key = subValue;\n      subValue = value[key];\n    }\n    // Recursively populate clone (susceptible to call stack limits).\n    assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n  });\n  return result;\n}\n\nmodule.exports = baseClone;\n","var baseForOwn = require('./_baseForOwn'),\n    createBaseEach = require('./_createBaseEach');\n\n/**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\nvar baseEach = createBaseEach(baseForOwn);\n\nmodule.exports = baseEach;\n","/**\n * This function is like `baseIndexOf` except that it accepts a comparator.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOfWith(array, value, fromIndex, comparator) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (comparator(array[index], value)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = baseIndexOfWith;\n","var getTag = require('./_getTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]';\n\n/**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\nfunction baseIsMap(value) {\n  return isObjectLike(value) && getTag(value) == mapTag;\n}\n\nmodule.exports = baseIsMap;\n","var getTag = require('./_getTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar setTag = '[object Set]';\n\n/**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\nfunction baseIsSet(value) {\n  return isObjectLike(value) && getTag(value) == setTag;\n}\n\nmodule.exports = baseIsSet;\n","var baseEach = require('./_baseEach'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction baseMap(collection, iteratee) {\n  var index = -1,\n      result = isArrayLike(collection) ? Array(collection.length) : [];\n\n  baseEach(collection, function(value, key, collection) {\n    result[++index] = iteratee(value, key, collection);\n  });\n  return result;\n}\n\nmodule.exports = baseMap;\n","var arrayMap = require('./_arrayMap'),\n    baseGet = require('./_baseGet'),\n    baseIteratee = require('./_baseIteratee'),\n    baseMap = require('./_baseMap'),\n    baseSortBy = require('./_baseSortBy'),\n    baseUnary = require('./_baseUnary'),\n    compareMultiple = require('./_compareMultiple'),\n    identity = require('./identity'),\n    isArray = require('./isArray');\n\n/**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\nfunction baseOrderBy(collection, iteratees, orders) {\n  if (iteratees.length) {\n    iteratees = arrayMap(iteratees, function(iteratee) {\n      if (isArray(iteratee)) {\n        return function(value) {\n          return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n        }\n      }\n      return iteratee;\n    });\n  } else {\n    iteratees = [identity];\n  }\n\n  var index = -1;\n  iteratees = arrayMap(iteratees, baseUnary(baseIteratee));\n\n  var result = baseMap(collection, function(value, key, collection) {\n    var criteria = arrayMap(iteratees, function(iteratee) {\n      return iteratee(value);\n    });\n    return { 'criteria': criteria, 'index': ++index, 'value': value };\n  });\n\n  return baseSortBy(result, function(object, other) {\n    return compareMultiple(object, other, orders);\n  });\n}\n\nmodule.exports = baseOrderBy;\n","var arrayMap = require('./_arrayMap'),\n    baseIndexOf = require('./_baseIndexOf'),\n    baseIndexOfWith = require('./_baseIndexOfWith'),\n    baseUnary = require('./_baseUnary'),\n    copyArray = require('./_copyArray');\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * The base implementation of `_.pullAllBy` without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n */\nfunction basePullAll(array, values, iteratee, comparator) {\n  var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n      index = -1,\n      length = values.length,\n      seen = array;\n\n  if (array === values) {\n    values = copyArray(values);\n  }\n  if (iteratee) {\n    seen = arrayMap(array, baseUnary(iteratee));\n  }\n  while (++index < length) {\n    var fromIndex = 0,\n        value = values[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n      if (seen !== array) {\n        splice.call(seen, fromIndex, 1);\n      }\n      splice.call(array, fromIndex, 1);\n    }\n  }\n  return array;\n}\n\nmodule.exports = basePullAll;\n","/**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n *  `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\nfunction baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n  eachFunc(collection, function(value, index, collection) {\n    accumulator = initAccum\n      ? (initAccum = false, value)\n      : iteratee(accumulator, value, index, collection);\n  });\n  return accumulator;\n}\n\nmodule.exports = baseReduce;\n","/**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\nfunction baseSortBy(array, comparer) {\n  var length = array.length;\n\n  array.sort(comparer);\n  while (length--) {\n    array[length] = array[length].value;\n  }\n  return array;\n}\n\nmodule.exports = baseSortBy;\n","var arrayMap = require('./_arrayMap');\n\n/**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\nfunction baseValues(object, props) {\n  return arrayMap(props, function(key) {\n    return object[key];\n  });\n}\n\nmodule.exports = baseValues;\n","var identity = require('./identity');\n\n/**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\nfunction castFunction(value) {\n  return typeof value == 'function' ? value : identity;\n}\n\nmodule.exports = castFunction;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\nfunction cloneDataView(dataView, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n  return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n}\n\nmodule.exports = cloneDataView;\n","/** Used to match `RegExp` flags from their coerced string values. */\nvar reFlags = /\\w*$/;\n\n/**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\nfunction cloneRegExp(regexp) {\n  var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n  result.lastIndex = regexp.lastIndex;\n  return result;\n}\n\nmodule.exports = cloneRegExp;\n","var Symbol = require('./_Symbol');\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\nfunction cloneSymbol(symbol) {\n  return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n}\n\nmodule.exports = cloneSymbol;\n","var isSymbol = require('./isSymbol');\n\n/**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\nfunction compareAscending(value, other) {\n  if (value !== other) {\n    var valIsDefined = value !== undefined,\n        valIsNull = value === null,\n        valIsReflexive = value === value,\n        valIsSymbol = isSymbol(value);\n\n    var othIsDefined = other !== undefined,\n        othIsNull = other === null,\n        othIsReflexive = other === other,\n        othIsSymbol = isSymbol(other);\n\n    if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n        (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n        (valIsNull && othIsDefined && othIsReflexive) ||\n        (!valIsDefined && othIsReflexive) ||\n        !valIsReflexive) {\n      return 1;\n    }\n    if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n        (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n        (othIsNull && valIsDefined && valIsReflexive) ||\n        (!othIsDefined && valIsReflexive) ||\n        !othIsReflexive) {\n      return -1;\n    }\n  }\n  return 0;\n}\n\nmodule.exports = compareAscending;\n","var compareAscending = require('./_compareAscending');\n\n/**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\nfunction compareMultiple(object, other, orders) {\n  var index = -1,\n      objCriteria = object.criteria,\n      othCriteria = other.criteria,\n      length = objCriteria.length,\n      ordersLength = orders.length;\n\n  while (++index < length) {\n    var result = compareAscending(objCriteria[index], othCriteria[index]);\n    if (result) {\n      if (index >= ordersLength) {\n        return result;\n      }\n      var order = orders[index];\n      return result * (order == 'desc' ? -1 : 1);\n    }\n  }\n  // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n  // that causes it, under certain circumstances, to provide the same value for\n  // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n  // for more details.\n  //\n  // This also ensures a stable sort in V8 and other engines.\n  // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n  return object.index - other.index;\n}\n\nmodule.exports = compareMultiple;\n","var copyObject = require('./_copyObject'),\n    getSymbols = require('./_getSymbols');\n\n/**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\nfunction copySymbols(source, object) {\n  return copyObject(source, getSymbols(source), object);\n}\n\nmodule.exports = copySymbols;\n","var copyObject = require('./_copyObject'),\n    getSymbolsIn = require('./_getSymbolsIn');\n\n/**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\nfunction copySymbolsIn(source, object) {\n  return copyObject(source, getSymbolsIn(source), object);\n}\n\nmodule.exports = copySymbolsIn;\n","var isArrayLike = require('./isArrayLike');\n\n/**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseEach(eachFunc, fromRight) {\n  return function(collection, iteratee) {\n    if (collection == null) {\n      return collection;\n    }\n    if (!isArrayLike(collection)) {\n      return eachFunc(collection, iteratee);\n    }\n    var length = collection.length,\n        index = fromRight ? length : -1,\n        iterable = Object(collection);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (iteratee(iterable[index], index, iterable) === false) {\n        break;\n      }\n    }\n    return collection;\n  };\n}\n\nmodule.exports = createBaseEach;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n    getSymbolsIn = require('./_getSymbolsIn'),\n    keysIn = require('./keysIn');\n\n/**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeysIn(object) {\n  return baseGetAllKeys(object, keysIn, getSymbolsIn);\n}\n\nmodule.exports = getAllKeysIn;\n","var arrayPush = require('./_arrayPush'),\n    getPrototype = require('./_getPrototype'),\n    getSymbols = require('./_getSymbols'),\n    stubArray = require('./stubArray');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n  var result = [];\n  while (object) {\n    arrayPush(result, getSymbols(object));\n    object = getPrototype(object);\n  }\n  return result;\n};\n\nmodule.exports = getSymbolsIn;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\nfunction initCloneArray(array) {\n  var length = array.length,\n      result = new array.constructor(length);\n\n  // Add properties assigned by `RegExp#exec`.\n  if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n    result.index = array.index;\n    result.input = array.input;\n  }\n  return result;\n}\n\nmodule.exports = initCloneArray;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer'),\n    cloneDataView = require('./_cloneDataView'),\n    cloneRegExp = require('./_cloneRegExp'),\n    cloneSymbol = require('./_cloneSymbol'),\n    cloneTypedArray = require('./_cloneTypedArray');\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneByTag(object, tag, isDeep) {\n  var Ctor = object.constructor;\n  switch (tag) {\n    case arrayBufferTag:\n      return cloneArrayBuffer(object);\n\n    case boolTag:\n    case dateTag:\n      return new Ctor(+object);\n\n    case dataViewTag:\n      return cloneDataView(object, isDeep);\n\n    case float32Tag: case float64Tag:\n    case int8Tag: case int16Tag: case int32Tag:\n    case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n      return cloneTypedArray(object, isDeep);\n\n    case mapTag:\n      return new Ctor;\n\n    case numberTag:\n    case stringTag:\n      return new Ctor(object);\n\n    case regexpTag:\n      return cloneRegExp(object);\n\n    case setTag:\n      return new Ctor;\n\n    case symbolTag:\n      return cloneSymbol(object);\n  }\n}\n\nmodule.exports = initCloneByTag;\n","var baseClone = require('./_baseClone');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\nfunction cloneDeep(value) {\n  return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n}\n\nmodule.exports = cloneDeep;\n","/**\n * Creates an array with all falsey values removed. The values `false`, `null`,\n * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to compact.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.compact([0, 1, false, 2, '', 3]);\n * // => [1, 2, 3]\n */\nfunction compact(array) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index];\n    if (value) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = compact;\n","var isObject = require('./isObject'),\n    now = require('./now'),\n    toNumber = require('./toNumber');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  var lastArgs,\n      lastThis,\n      maxWait,\n      result,\n      timerId,\n      lastCallTime,\n      lastInvokeTime = 0,\n      leading = false,\n      maxing = false,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  wait = toNumber(wait) || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time) {\n    var args = lastArgs,\n        thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = setTimeout(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime,\n        timeWaiting = wait - timeSinceLastCall;\n\n    return maxing\n      ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n      : timeWaiting;\n  }\n\n  function shouldInvoke(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n      (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n  }\n\n  function timerExpired() {\n    var time = now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = setTimeout(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      clearTimeout(timerId);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(now());\n  }\n\n  function debounced() {\n    var time = now(),\n        isInvoking = shouldInvoke(time);\n\n    lastArgs = arguments;\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        clearTimeout(timerId);\n        timerId = setTimeout(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = setTimeout(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  return debounced;\n}\n\nmodule.exports = debounce;\n","module.exports = require('./forEach');\n","var arrayEach = require('./_arrayEach'),\n    baseEach = require('./_baseEach'),\n    castFunction = require('./_castFunction'),\n    isArray = require('./isArray');\n\n/**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n *   console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\nfunction forEach(collection, iteratee) {\n  var func = isArray(collection) ? arrayEach : baseEach;\n  return func(collection, castFunction(iteratee));\n}\n\nmodule.exports = forEach;\n","var baseForOwn = require('./_baseForOwn'),\n    castFunction = require('./_castFunction');\n\n/**\n * Iterates over own enumerable string keyed properties of an object and\n * invokes `iteratee` for each property. The iteratee is invoked with three\n * arguments: (value, key, object). Iteratee functions may exit iteration\n * early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwnRight\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwn(new Foo, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\nfunction forOwn(object, iteratee) {\n  return object && baseForOwn(object, castFunction(iteratee));\n}\n\nmodule.exports = forOwn;\n","var baseIndexOf = require('./_baseIndexOf'),\n    isArrayLike = require('./isArrayLike'),\n    isString = require('./isString'),\n    toInteger = require('./toInteger'),\n    values = require('./values');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * Checks if `value` is in `collection`. If `collection` is a string, it's\n * checked for a substring of `value`, otherwise\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * is used for equality comparisons. If `fromIndex` is negative, it's used as\n * the offset from the end of `collection`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {boolean} Returns `true` if `value` is found, else `false`.\n * @example\n *\n * _.includes([1, 2, 3], 1);\n * // => true\n *\n * _.includes([1, 2, 3], 1, 2);\n * // => false\n *\n * _.includes({ 'a': 1, 'b': 2 }, 1);\n * // => true\n *\n * _.includes('abcd', 'bc');\n * // => true\n */\nfunction includes(collection, value, fromIndex, guard) {\n  collection = isArrayLike(collection) ? collection : values(collection);\n  fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n  var length = collection.length;\n  if (fromIndex < 0) {\n    fromIndex = nativeMax(length + fromIndex, 0);\n  }\n  return isString(collection)\n    ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n    : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n}\n\nmodule.exports = includes;\n","var baseIsMap = require('./_baseIsMap'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsMap = nodeUtil && nodeUtil.isMap;\n\n/**\n * Checks if `value` is classified as a `Map` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n *\n * _.isMap(new Map);\n * // => true\n *\n * _.isMap(new WeakMap);\n * // => false\n */\nvar isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\nmodule.exports = isMap;\n","var baseIsSet = require('./_baseIsSet'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsSet = nodeUtil && nodeUtil.isSet;\n\n/**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\nvar isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\nmodule.exports = isSet;\n","var baseGetTag = require('./_baseGetTag'),\n    isArray = require('./isArray'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar stringTag = '[object String]';\n\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\nfunction isString(value) {\n  return typeof value == 'string' ||\n    (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n}\n\nmodule.exports = isString;\n","var arrayMap = require('./_arrayMap'),\n    baseIteratee = require('./_baseIteratee'),\n    baseMap = require('./_baseMap'),\n    isArray = require('./isArray');\n\n/**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n *   return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n *   { 'user': 'barney' },\n *   { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\nfunction map(collection, iteratee) {\n  var func = isArray(collection) ? arrayMap : baseMap;\n  return func(collection, baseIteratee(iteratee, 3));\n}\n\nmodule.exports = map;\n","var root = require('./_root');\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\nmodule.exports = now;\n","var baseOrderBy = require('./_baseOrderBy'),\n    isArray = require('./isArray');\n\n/**\n * This method is like `_.sortBy` except that it allows specifying the sort\n * orders of the iteratees to sort by. If `orders` is unspecified, all values\n * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n * descending or \"asc\" for ascending sort order of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n *  The iteratees to sort by.\n * @param {string[]} [orders] The sort orders of `iteratees`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n *   { 'user': 'fred',   'age': 48 },\n *   { 'user': 'barney', 'age': 34 },\n *   { 'user': 'fred',   'age': 40 },\n *   { 'user': 'barney', 'age': 36 }\n * ];\n *\n * // Sort by `user` in ascending order and by `age` in descending order.\n * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n */\nfunction orderBy(collection, iteratees, orders, guard) {\n  if (collection == null) {\n    return [];\n  }\n  if (!isArray(iteratees)) {\n    iteratees = iteratees == null ? [] : [iteratees];\n  }\n  orders = guard ? undefined : orders;\n  if (!isArray(orders)) {\n    orders = orders == null ? [] : [orders];\n  }\n  return baseOrderBy(collection, iteratees, orders);\n}\n\nmodule.exports = orderBy;\n","var baseRest = require('./_baseRest'),\n    pullAll = require('./pullAll');\n\n/**\n * Removes all given values from `array` using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n * to remove elements from an array by predicate.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...*} [values] The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pull(array, 'a', 'c');\n * console.log(array);\n * // => ['b', 'b']\n */\nvar pull = baseRest(pullAll);\n\nmodule.exports = pull;\n","var basePullAll = require('./_basePullAll');\n\n/**\n * This method is like `_.pull` except that it accepts an array of values to remove.\n *\n * **Note:** Unlike `_.difference`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pullAll(array, ['a', 'c']);\n * console.log(array);\n * // => ['b', 'b']\n */\nfunction pullAll(array, values) {\n  return (array && array.length && values && values.length)\n    ? basePullAll(array, values)\n    : array;\n}\n\nmodule.exports = pullAll;\n","var arrayReduce = require('./_arrayReduce'),\n    baseEach = require('./_baseEach'),\n    baseIteratee = require('./_baseIteratee'),\n    baseReduce = require('./_baseReduce'),\n    isArray = require('./isArray');\n\n/**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n *   return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n *   (result[value] || (result[value] = [])).push(key);\n *   return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\nfunction reduce(collection, iteratee, accumulator) {\n  var func = isArray(collection) ? arrayReduce : baseReduce,\n      initAccum = arguments.length < 3;\n\n  return func(collection, baseIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n}\n\nmodule.exports = reduce;\n","var debounce = require('./debounce'),\n    isObject = require('./isObject');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a throttled function that only invokes `func` at most once per\n * every `wait` milliseconds. The throttled function comes with a `cancel`\n * method to cancel delayed `func` invocations and a `flush` method to\n * immediately invoke them. Provide `options` to indicate whether `func`\n * should be invoked on the leading and/or trailing edge of the `wait`\n * timeout. The `func` is invoked with the last arguments provided to the\n * throttled function. Subsequent calls to the throttled function return the\n * result of the last `func` invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the throttled function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.throttle` and `_.debounce`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to throttle.\n * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=true]\n *  Specify invoking on the leading edge of the timeout.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new throttled function.\n * @example\n *\n * // Avoid excessively updating the position while scrolling.\n * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n *\n * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n * jQuery(element).on('click', throttled);\n *\n * // Cancel the trailing throttled invocation.\n * jQuery(window).on('popstate', throttled.cancel);\n */\nfunction throttle(func, wait, options) {\n  var leading = true,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  if (isObject(options)) {\n    leading = 'leading' in options ? !!options.leading : leading;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n  return debounce(func, wait, {\n    'leading': leading,\n    'maxWait': wait,\n    'trailing': trailing\n  });\n}\n\nmodule.exports = throttle;\n","var toFinite = require('./toFinite');\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nmodule.exports = toInteger;\n","var baseValues = require('./_baseValues'),\n    keys = require('./keys');\n\n/**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\nfunction values(object) {\n  return object == null ? [] : baseValues(object, keys(object));\n}\n\nmodule.exports = values;\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\n// If obj.hasOwnProperty has been overridden, then calling\n// obj.hasOwnProperty(prop) will break.\n// See: https://github.com/joyent/node/issues/1707\nfunction hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nmodule.exports = function(qs, sep, eq, options) {\n  sep = sep || '&';\n  eq = eq || '=';\n  var obj = {};\n\n  if (typeof qs !== 'string' || qs.length === 0) {\n    return obj;\n  }\n\n  var regexp = /\\+/g;\n  qs = qs.split(sep);\n\n  var maxKeys = 1000;\n  if (options && typeof options.maxKeys === 'number') {\n    maxKeys = options.maxKeys;\n  }\n\n  var len = qs.length;\n  // maxKeys <= 0 means that we should not limit keys count\n  if (maxKeys > 0 && len > maxKeys) {\n    len = maxKeys;\n  }\n\n  for (var i = 0; i < len; ++i) {\n    var x = qs[i].replace(regexp, '%20'),\n        idx = x.indexOf(eq),\n        kstr, vstr, k, v;\n\n    if (idx >= 0) {\n      kstr = x.substr(0, idx);\n      vstr = x.substr(idx + 1);\n    } else {\n      kstr = x;\n      vstr = '';\n    }\n\n    k = decodeURIComponent(kstr);\n    v = decodeURIComponent(vstr);\n\n    if (!hasOwnProperty(obj, k)) {\n      obj[k] = v;\n    } else if (Array.isArray(obj[k])) {\n      obj[k].push(v);\n    } else {\n      obj[k] = [obj[k], v];\n    }\n  }\n\n  return obj;\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nvar stringifyPrimitive = function(v) {\n  switch (typeof v) {\n    case 'string':\n      return v;\n\n    case 'boolean':\n      return v ? 'true' : 'false';\n\n    case 'number':\n      return isFinite(v) ? v : '';\n\n    default:\n      return '';\n  }\n};\n\nmodule.exports = function(obj, sep, eq, name) {\n  sep = sep || '&';\n  eq = eq || '=';\n  if (obj === null) {\n    obj = undefined;\n  }\n\n  if (typeof obj === 'object') {\n    return Object.keys(obj).map(function(k) {\n      var ks = encodeURIComponent(stringifyPrimitive(k)) + eq;\n      if (Array.isArray(obj[k])) {\n        return obj[k].map(function(v) {\n          return ks + encodeURIComponent(stringifyPrimitive(v));\n        }).join(sep);\n      } else {\n        return ks + encodeURIComponent(stringifyPrimitive(obj[k]));\n      }\n    }).filter(Boolean).join(sep);\n\n  }\n\n  if (!name) return '';\n  return encodeURIComponent(stringifyPrimitive(name)) + eq +\n         encodeURIComponent(stringifyPrimitive(obj));\n};\n","'use strict';\n\nexports.decode = exports.parse = require('./decode');\nexports.encode = exports.stringify = require('./encode');\n","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Alpha = undefined;\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _createClass = function () { 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); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _reactcss = require('reactcss');\n\nvar _reactcss2 = _interopRequireDefault(_reactcss);\n\nvar _alpha = require('../../helpers/alpha');\n\nvar alpha = _interopRequireWildcard(_alpha);\n\nvar _Checkboard = require('./Checkboard');\n\nvar _Checkboard2 = _interopRequireDefault(_Checkboard);\n\nfunction _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\nvar Alpha = exports.Alpha = function (_ref) {\n  _inherits(Alpha, _ref);\n\n  function Alpha() {\n    var _ref2;\n\n    var _temp, _this, _ret;\n\n    _classCallCheck(this, Alpha);\n\n    for (var _len = arguments.length, args = Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return _ret = (_temp = (_this = _possibleConstructorReturn(this, (_ref2 = Alpha.__proto__ || Object.getPrototypeOf(Alpha)).call.apply(_ref2, [this].concat(args))), _this), _this.handleChange = function (e) {\n      var change = alpha.calculateChange(e, _this.props.hsl, _this.props.direction, _this.props.a, _this.container);\n      change && typeof _this.props.onChange === 'function' && _this.props.onChange(change, e);\n    }, _this.handleMouseDown = function (e) {\n      _this.handleChange(e);\n      window.addEventListener('mousemove', _this.handleChange);\n      window.addEventListener('mouseup', _this.handleMouseUp);\n    }, _this.handleMouseUp = function () {\n      _this.unbindEventListeners();\n    }, _this.unbindEventListeners = function () {\n      window.removeEventListener('mousemove', _this.handleChange);\n      window.removeEventListener('mouseup', _this.handleMouseUp);\n    }, _temp), _possibleConstructorReturn(_this, _ret);\n  }\n\n  _createClass(Alpha, [{\n    key: 'componentWillUnmount',\n    value: function componentWillUnmount() {\n      this.unbindEventListeners();\n    }\n  }, {\n    key: 'render',\n    value: function render() {\n      var _this2 = this;\n\n      var rgb = this.props.rgb;\n      var styles = (0, _reactcss2.default)({\n        'default': {\n          alpha: {\n            absolute: '0px 0px 0px 0px',\n            borderRadius: this.props.radius\n          },\n          checkboard: {\n            absolute: '0px 0px 0px 0px',\n            overflow: 'hidden',\n            borderRadius: this.props.radius\n          },\n          gradient: {\n            absolute: '0px 0px 0px 0px',\n            background: 'linear-gradient(to right, rgba(' + rgb.r + ',' + rgb.g + ',' + rgb.b + ', 0) 0%,\\n           rgba(' + rgb.r + ',' + rgb.g + ',' + rgb.b + ', 1) 100%)',\n            boxShadow: this.props.shadow,\n            borderRadius: this.props.radius\n          },\n          container: {\n            position: 'relative',\n            height: '100%',\n            margin: '0 3px'\n          },\n          pointer: {\n            position: 'absolute',\n            left: rgb.a * 100 + '%'\n          },\n          slider: {\n            width: '4px',\n            borderRadius: '1px',\n            height: '8px',\n            boxShadow: '0 0 2px rgba(0, 0, 0, .6)',\n            background: '#fff',\n            marginTop: '1px',\n            transform: 'translateX(-2px)'\n          }\n        },\n        'vertical': {\n          gradient: {\n            background: 'linear-gradient(to bottom, rgba(' + rgb.r + ',' + rgb.g + ',' + rgb.b + ', 0) 0%,\\n           rgba(' + rgb.r + ',' + rgb.g + ',' + rgb.b + ', 1) 100%)'\n          },\n          pointer: {\n            left: 0,\n            top: rgb.a * 100 + '%'\n          }\n        },\n        'overwrite': _extends({}, this.props.style)\n      }, {\n        vertical: this.props.direction === 'vertical',\n        overwrite: true\n      });\n\n      return _react2.default.createElement(\n        'div',\n        { style: styles.alpha },\n        _react2.default.createElement(\n          'div',\n          { style: styles.checkboard },\n          _react2.default.createElement(_Checkboard2.default, { renderers: this.props.renderers })\n        ),\n        _react2.default.createElement('div', { style: styles.gradient }),\n        _react2.default.createElement(\n          'div',\n          {\n            style: styles.container,\n            ref: function ref(container) {\n              return _this2.container = container;\n            },\n            onMouseDown: this.handleMouseDown,\n            onTouchMove: this.handleChange,\n            onTouchStart: this.handleChange\n          },\n          _react2.default.createElement(\n            'div',\n            { style: styles.pointer },\n            this.props.pointer ? _react2.default.createElement(this.props.pointer, this.props) : _react2.default.createElement('div', { style: styles.slider })\n          )\n        )\n      );\n    }\n  }]);\n\n  return Alpha;\n}(_react.PureComponent || _react.Component);\n\nexports.default = Alpha;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Checkboard = undefined;\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _reactcss = require('reactcss');\n\nvar _reactcss2 = _interopRequireDefault(_reactcss);\n\nvar _checkboard = require('../../helpers/checkboard');\n\nvar checkboard = _interopRequireWildcard(_checkboard);\n\nfunction _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar Checkboard = exports.Checkboard = function Checkboard(_ref) {\n  var white = _ref.white,\n      grey = _ref.grey,\n      size = _ref.size,\n      renderers = _ref.renderers,\n      borderRadius = _ref.borderRadius,\n      boxShadow = _ref.boxShadow,\n      children = _ref.children;\n\n  var styles = (0, _reactcss2.default)({\n    'default': {\n      grid: {\n        borderRadius: borderRadius,\n        boxShadow: boxShadow,\n        absolute: '0px 0px 0px 0px',\n        background: 'url(' + checkboard.get(white, grey, size, renderers.canvas) + ') center left'\n      }\n    }\n  });\n  return (0, _react.isValidElement)(children) ? _react2.default.cloneElement(children, _extends({}, children.props, { style: _extends({}, children.props.style, styles.grid) })) : _react2.default.createElement('div', { style: styles.grid });\n};\n\nCheckboard.defaultProps = {\n  size: 8,\n  white: 'transparent',\n  grey: 'rgba(0,0,0,.08)',\n  renderers: {}\n};\n\nexports.default = Checkboard;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ColorWrap = undefined;\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _createClass = function () { 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); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _debounce = require('lodash/debounce');\n\nvar _debounce2 = _interopRequireDefault(_debounce);\n\nvar _color = require('../../helpers/color');\n\nvar color = _interopRequireWildcard(_color);\n\nfunction _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\nvar ColorWrap = exports.ColorWrap = function ColorWrap(Picker) {\n  var ColorPicker = function (_ref) {\n    _inherits(ColorPicker, _ref);\n\n    function ColorPicker(props) {\n      _classCallCheck(this, ColorPicker);\n\n      var _this = _possibleConstructorReturn(this, (ColorPicker.__proto__ || Object.getPrototypeOf(ColorPicker)).call(this));\n\n      _this.handleChange = function (data, event) {\n        var isValidColor = color.simpleCheckForValidColor(data);\n        if (isValidColor) {\n          var colors = color.toState(data, data.h || _this.state.oldHue);\n          _this.setState(colors);\n          _this.props.onChangeComplete && _this.debounce(_this.props.onChangeComplete, colors, event);\n          _this.props.onChange && _this.props.onChange(colors, event);\n        }\n      };\n\n      _this.handleSwatchHover = function (data, event) {\n        var isValidColor = color.simpleCheckForValidColor(data);\n        if (isValidColor) {\n          var colors = color.toState(data, data.h || _this.state.oldHue);\n          _this.props.onSwatchHover && _this.props.onSwatchHover(colors, event);\n        }\n      };\n\n      _this.state = _extends({}, color.toState(props.color, 0));\n\n      _this.debounce = (0, _debounce2.default)(function (fn, data, event) {\n        fn(data, event);\n      }, 100);\n      return _this;\n    }\n\n    _createClass(ColorPicker, [{\n      key: 'render',\n      value: function render() {\n        var optionalEvents = {};\n        if (this.props.onSwatchHover) {\n          optionalEvents.onSwatchHover = this.handleSwatchHover;\n        }\n\n        return _react2.default.createElement(Picker, _extends({}, this.props, this.state, {\n          onChange: this.handleChange\n        }, optionalEvents));\n      }\n    }], [{\n      key: 'getDerivedStateFromProps',\n      value: function getDerivedStateFromProps(nextProps, state) {\n        return _extends({}, color.toState(nextProps.color, state.oldHue));\n      }\n    }]);\n\n    return ColorPicker;\n  }(_react.PureComponent || _react.Component);\n\n  ColorPicker.propTypes = _extends({}, Picker.propTypes);\n\n  ColorPicker.defaultProps = _extends({}, Picker.defaultProps, {\n    color: {\n      h: 250,\n      s: 0.50,\n      l: 0.20,\n      a: 1\n    }\n  });\n\n  return ColorPicker;\n};\n\nexports.default = ColorWrap;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.EditableInput = undefined;\n\nvar _createClass = function () { 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); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _reactcss = require('reactcss');\n\nvar _reactcss2 = _interopRequireDefault(_reactcss);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\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 _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\nvar DEFAULT_ARROW_OFFSET = 1;\n\nvar UP_KEY_CODE = 38;\nvar DOWN_KEY_CODE = 40;\nvar VALID_KEY_CODES = [UP_KEY_CODE, DOWN_KEY_CODE];\nvar isValidKeyCode = function isValidKeyCode(keyCode) {\n  return VALID_KEY_CODES.indexOf(keyCode) > -1;\n};\nvar getNumberValue = function getNumberValue(value) {\n  return Number(String(value).replace(/%/g, ''));\n};\n\nvar idCounter = 1;\n\nvar EditableInput = exports.EditableInput = function (_ref) {\n  _inherits(EditableInput, _ref);\n\n  function EditableInput(props) {\n    _classCallCheck(this, EditableInput);\n\n    var _this = _possibleConstructorReturn(this, (EditableInput.__proto__ || Object.getPrototypeOf(EditableInput)).call(this));\n\n    _this.handleBlur = function () {\n      if (_this.state.blurValue) {\n        _this.setState({ value: _this.state.blurValue, blurValue: null });\n      }\n    };\n\n    _this.handleChange = function (e) {\n      _this.setUpdatedValue(e.target.value, e);\n    };\n\n    _this.handleKeyDown = function (e) {\n      // In case `e.target.value` is a percentage remove the `%` character\n      // and update accordingly with a percentage\n      // https://github.com/casesandberg/react-color/issues/383\n      var value = getNumberValue(e.target.value);\n      if (!isNaN(value) && isValidKeyCode(e.keyCode)) {\n        var offset = _this.getArrowOffset();\n        var updatedValue = e.keyCode === UP_KEY_CODE ? value + offset : value - offset;\n\n        _this.setUpdatedValue(updatedValue, e);\n      }\n    };\n\n    _this.handleDrag = function (e) {\n      if (_this.props.dragLabel) {\n        var newValue = Math.round(_this.props.value + e.movementX);\n        if (newValue >= 0 && newValue <= _this.props.dragMax) {\n          _this.props.onChange && _this.props.onChange(_this.getValueObjectWithLabel(newValue), e);\n        }\n      }\n    };\n\n    _this.handleMouseDown = function (e) {\n      if (_this.props.dragLabel) {\n        e.preventDefault();\n        _this.handleDrag(e);\n        window.addEventListener('mousemove', _this.handleDrag);\n        window.addEventListener('mouseup', _this.handleMouseUp);\n      }\n    };\n\n    _this.handleMouseUp = function () {\n      _this.unbindEventListeners();\n    };\n\n    _this.unbindEventListeners = function () {\n      window.removeEventListener('mousemove', _this.handleDrag);\n      window.removeEventListener('mouseup', _this.handleMouseUp);\n    };\n\n    _this.state = {\n      value: String(props.value).toUpperCase(),\n      blurValue: String(props.value).toUpperCase()\n    };\n\n    _this.inputId = 'rc-editable-input-' + idCounter++;\n    return _this;\n  }\n\n  _createClass(EditableInput, [{\n    key: 'componentDidUpdate',\n    value: function componentDidUpdate(prevProps, prevState) {\n      if (this.props.value !== this.state.value && (prevProps.value !== this.props.value || prevState.value !== this.state.value)) {\n        if (this.input === document.activeElement) {\n          this.setState({ blurValue: String(this.props.value).toUpperCase() });\n        } else {\n          this.setState({ value: String(this.props.value).toUpperCase(), blurValue: !this.state.blurValue && String(this.props.value).toUpperCase() });\n        }\n      }\n    }\n  }, {\n    key: 'componentWillUnmount',\n    value: function componentWillUnmount() {\n      this.unbindEventListeners();\n    }\n  }, {\n    key: 'getValueObjectWithLabel',\n    value: function getValueObjectWithLabel(value) {\n      return _defineProperty({}, this.props.label, value);\n    }\n  }, {\n    key: 'getArrowOffset',\n    value: function getArrowOffset() {\n      return this.props.arrowOffset || DEFAULT_ARROW_OFFSET;\n    }\n  }, {\n    key: 'setUpdatedValue',\n    value: function setUpdatedValue(value, e) {\n      var onChangeValue = this.props.label ? this.getValueObjectWithLabel(value) : value;\n      this.props.onChange && this.props.onChange(onChangeValue, e);\n\n      this.setState({ value: value });\n    }\n  }, {\n    key: 'render',\n    value: function render() {\n      var _this2 = this;\n\n      var styles = (0, _reactcss2.default)({\n        'default': {\n          wrap: {\n            position: 'relative'\n          }\n        },\n        'user-override': {\n          wrap: this.props.style && this.props.style.wrap ? this.props.style.wrap : {},\n          input: this.props.style && this.props.style.input ? this.props.style.input : {},\n          label: this.props.style && this.props.style.label ? this.props.style.label : {}\n        },\n        'dragLabel-true': {\n          label: {\n            cursor: 'ew-resize'\n          }\n        }\n      }, {\n        'user-override': true\n      }, this.props);\n\n      return _react2.default.createElement(\n        'div',\n        { style: styles.wrap },\n        _react2.default.createElement('input', {\n          id: this.inputId,\n          style: styles.input,\n          ref: function ref(input) {\n            return _this2.input = input;\n          },\n          value: this.state.value,\n          onKeyDown: this.handleKeyDown,\n          onChange: this.handleChange,\n          onBlur: this.handleBlur,\n          placeholder: this.props.placeholder,\n          spellCheck: 'false'\n        }),\n        this.props.label && !this.props.hideLabel ? _react2.default.createElement(\n          'label',\n          {\n            htmlFor: this.inputId,\n            style: styles.label,\n            onMouseDown: this.handleMouseDown\n          },\n          this.props.label\n        ) : null\n      );\n    }\n  }]);\n\n  return EditableInput;\n}(_react.PureComponent || _react.Component);\n\nexports.default = EditableInput;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Hue = undefined;\n\nvar _createClass = function () { 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); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _reactcss = require('reactcss');\n\nvar _reactcss2 = _interopRequireDefault(_reactcss);\n\nvar _hue = require('../../helpers/hue');\n\nvar hue = _interopRequireWildcard(_hue);\n\nfunction _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\nvar Hue = exports.Hue = function (_ref) {\n  _inherits(Hue, _ref);\n\n  function Hue() {\n    var _ref2;\n\n    var _temp, _this, _ret;\n\n    _classCallCheck(this, Hue);\n\n    for (var _len = arguments.length, args = Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return _ret = (_temp = (_this = _possibleConstructorReturn(this, (_ref2 = Hue.__proto__ || Object.getPrototypeOf(Hue)).call.apply(_ref2, [this].concat(args))), _this), _this.handleChange = function (e) {\n      var change = hue.calculateChange(e, _this.props.direction, _this.props.hsl, _this.container);\n      change && typeof _this.props.onChange === 'function' && _this.props.onChange(change, e);\n    }, _this.handleMouseDown = function (e) {\n      _this.handleChange(e);\n      window.addEventListener('mousemove', _this.handleChange);\n      window.addEventListener('mouseup', _this.handleMouseUp);\n    }, _this.handleMouseUp = function () {\n      _this.unbindEventListeners();\n    }, _temp), _possibleConstructorReturn(_this, _ret);\n  }\n\n  _createClass(Hue, [{\n    key: 'componentWillUnmount',\n    value: function componentWillUnmount() {\n      this.unbindEventListeners();\n    }\n  }, {\n    key: 'unbindEventListeners',\n    value: function unbindEventListeners() {\n      window.removeEventListener('mousemove', this.handleChange);\n      window.removeEventListener('mouseup', this.handleMouseUp);\n    }\n  }, {\n    key: 'render',\n    value: function render() {\n      var _this2 = this;\n\n      var _props$direction = this.props.direction,\n          direction = _props$direction === undefined ? 'horizontal' : _props$direction;\n\n\n      var styles = (0, _reactcss2.default)({\n        'default': {\n          hue: {\n            absolute: '0px 0px 0px 0px',\n            borderRadius: this.props.radius,\n            boxShadow: this.props.shadow\n          },\n          container: {\n            padding: '0 2px',\n            position: 'relative',\n            height: '100%',\n            borderRadius: this.props.radius\n          },\n          pointer: {\n            position: 'absolute',\n            left: this.props.hsl.h * 100 / 360 + '%'\n          },\n          slider: {\n            marginTop: '1px',\n            width: '4px',\n            borderRadius: '1px',\n            height: '8px',\n            boxShadow: '0 0 2px rgba(0, 0, 0, .6)',\n            background: '#fff',\n            transform: 'translateX(-2px)'\n          }\n        },\n        'vertical': {\n          pointer: {\n            left: '0px',\n            top: -(this.props.hsl.h * 100 / 360) + 100 + '%'\n          }\n        }\n      }, { vertical: direction === 'vertical' });\n\n      return _react2.default.createElement(\n        'div',\n        { style: styles.hue },\n        _react2.default.createElement(\n          'div',\n          {\n            className: 'hue-' + direction,\n            style: styles.container,\n            ref: function ref(container) {\n              return _this2.container = container;\n            },\n            onMouseDown: this.handleMouseDown,\n            onTouchMove: this.handleChange,\n            onTouchStart: this.handleChange\n          },\n          _react2.default.createElement(\n            'style',\n            null,\n            '\\n            .hue-horizontal {\\n              background: linear-gradient(to right, #f00 0%, #ff0 17%, #0f0\\n                33%, #0ff 50%, #00f 67%, #f0f 83%, #f00 100%);\\n              background: -webkit-linear-gradient(to right, #f00 0%, #ff0\\n                17%, #0f0 33%, #0ff 50%, #00f 67%, #f0f 83%, #f00 100%);\\n            }\\n\\n            .hue-vertical {\\n              background: linear-gradient(to top, #f00 0%, #ff0 17%, #0f0 33%,\\n                #0ff 50%, #00f 67%, #f0f 83%, #f00 100%);\\n              background: -webkit-linear-gradient(to top, #f00 0%, #ff0 17%,\\n                #0f0 33%, #0ff 50%, #00f 67%, #f0f 83%, #f00 100%);\\n            }\\n          '\n          ),\n          _react2.default.createElement(\n            'div',\n            { style: styles.pointer },\n            this.props.pointer ? _react2.default.createElement(this.props.pointer, this.props) : _react2.default.createElement('div', { style: styles.slider })\n          )\n        )\n      );\n    }\n  }]);\n\n  return Hue;\n}(_react.PureComponent || _react.Component);\n\nexports.default = Hue;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Raised = undefined;\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _propTypes = require('prop-types');\n\nvar _propTypes2 = _interopRequireDefault(_propTypes);\n\nvar _reactcss = require('reactcss');\n\nvar _reactcss2 = _interopRequireDefault(_reactcss);\n\nvar _merge = require('lodash/merge');\n\nvar _merge2 = _interopRequireDefault(_merge);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar Raised = exports.Raised = function Raised(_ref) {\n  var zDepth = _ref.zDepth,\n      radius = _ref.radius,\n      background = _ref.background,\n      children = _ref.children,\n      _ref$styles = _ref.styles,\n      passedStyles = _ref$styles === undefined ? {} : _ref$styles;\n\n  var styles = (0, _reactcss2.default)((0, _merge2.default)({\n    'default': {\n      wrap: {\n        position: 'relative',\n        display: 'inline-block'\n      },\n      content: {\n        position: 'relative'\n      },\n      bg: {\n        absolute: '0px 0px 0px 0px',\n        boxShadow: '0 ' + zDepth + 'px ' + zDepth * 4 + 'px rgba(0,0,0,.24)',\n        borderRadius: radius,\n        background: background\n      }\n    },\n    'zDepth-0': {\n      bg: {\n        boxShadow: 'none'\n      }\n    },\n\n    'zDepth-1': {\n      bg: {\n        boxShadow: '0 2px 10px rgba(0,0,0,.12), 0 2px 5px rgba(0,0,0,.16)'\n      }\n    },\n    'zDepth-2': {\n      bg: {\n        boxShadow: '0 6px 20px rgba(0,0,0,.19), 0 8px 17px rgba(0,0,0,.2)'\n      }\n    },\n    'zDepth-3': {\n      bg: {\n        boxShadow: '0 17px 50px rgba(0,0,0,.19), 0 12px 15px rgba(0,0,0,.24)'\n      }\n    },\n    'zDepth-4': {\n      bg: {\n        boxShadow: '0 25px 55px rgba(0,0,0,.21), 0 16px 28px rgba(0,0,0,.22)'\n      }\n    },\n    'zDepth-5': {\n      bg: {\n        boxShadow: '0 40px 77px rgba(0,0,0,.22), 0 27px 24px rgba(0,0,0,.2)'\n      }\n    },\n    'square': {\n      bg: {\n        borderRadius: '0'\n      }\n    },\n    'circle': {\n      bg: {\n        borderRadius: '50%'\n      }\n    }\n  }, passedStyles), { 'zDepth-1': zDepth === 1 });\n\n  return _react2.default.createElement(\n    'div',\n    { style: styles.wrap },\n    _react2.default.createElement('div', { style: styles.bg }),\n    _react2.default.createElement(\n      'div',\n      { style: styles.content },\n      children\n    )\n  );\n};\n\nRaised.propTypes = {\n  background: _propTypes2.default.string,\n  zDepth: _propTypes2.default.oneOf([0, 1, 2, 3, 4, 5]),\n  radius: _propTypes2.default.number,\n  styles: _propTypes2.default.object\n};\n\nRaised.defaultProps = {\n  background: '#fff',\n  zDepth: 1,\n  radius: 2,\n  styles: {}\n};\n\nexports.default = Raised;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Saturation = undefined;\n\nvar _createClass = function () { 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); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _reactcss = require('reactcss');\n\nvar _reactcss2 = _interopRequireDefault(_reactcss);\n\nvar _throttle = require('lodash/throttle');\n\nvar _throttle2 = _interopRequireDefault(_throttle);\n\nvar _saturation = require('../../helpers/saturation');\n\nvar saturation = _interopRequireWildcard(_saturation);\n\nfunction _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\nvar Saturation = exports.Saturation = function (_ref) {\n  _inherits(Saturation, _ref);\n\n  function Saturation(props) {\n    _classCallCheck(this, Saturation);\n\n    var _this = _possibleConstructorReturn(this, (Saturation.__proto__ || Object.getPrototypeOf(Saturation)).call(this, props));\n\n    _this.handleChange = function (e) {\n      typeof _this.props.onChange === 'function' && _this.throttle(_this.props.onChange, saturation.calculateChange(e, _this.props.hsl, _this.container), e);\n    };\n\n    _this.handleMouseDown = function (e) {\n      _this.handleChange(e);\n      var renderWindow = _this.getContainerRenderWindow();\n      renderWindow.addEventListener('mousemove', _this.handleChange);\n      renderWindow.addEventListener('mouseup', _this.handleMouseUp);\n    };\n\n    _this.handleMouseUp = function () {\n      _this.unbindEventListeners();\n    };\n\n    _this.throttle = (0, _throttle2.default)(function (fn, data, e) {\n      fn(data, e);\n    }, 50);\n    return _this;\n  }\n\n  _createClass(Saturation, [{\n    key: 'componentWillUnmount',\n    value: function componentWillUnmount() {\n      this.throttle.cancel();\n      this.unbindEventListeners();\n    }\n  }, {\n    key: 'getContainerRenderWindow',\n    value: function getContainerRenderWindow() {\n      var container = this.container;\n\n      var renderWindow = window;\n      while (!renderWindow.document.contains(container) && renderWindow.parent !== renderWindow) {\n        renderWindow = renderWindow.parent;\n      }\n      return renderWindow;\n    }\n  }, {\n    key: 'unbindEventListeners',\n    value: function unbindEventListeners() {\n      var renderWindow = this.getContainerRenderWindow();\n      renderWindow.removeEventListener('mousemove', this.handleChange);\n      renderWindow.removeEventListener('mouseup', this.handleMouseUp);\n    }\n  }, {\n    key: 'render',\n    value: function render() {\n      var _this2 = this;\n\n      var _ref2 = this.props.style || {},\n          color = _ref2.color,\n          white = _ref2.white,\n          black = _ref2.black,\n          pointer = _ref2.pointer,\n          circle = _ref2.circle;\n\n      var styles = (0, _reactcss2.default)({\n        'default': {\n          color: {\n            absolute: '0px 0px 0px 0px',\n            background: 'hsl(' + this.props.hsl.h + ',100%, 50%)',\n            borderRadius: this.props.radius\n          },\n          white: {\n            absolute: '0px 0px 0px 0px',\n            borderRadius: this.props.radius\n          },\n          black: {\n            absolute: '0px 0px 0px 0px',\n            boxShadow: this.props.shadow,\n            borderRadius: this.props.radius\n          },\n          pointer: {\n            position: 'absolute',\n            top: -(this.props.hsv.v * 100) + 100 + '%',\n            left: this.props.hsv.s * 100 + '%',\n            cursor: 'default'\n          },\n          circle: {\n            width: '4px',\n            height: '4px',\n            boxShadow: '0 0 0 1.5px #fff, inset 0 0 1px 1px rgba(0,0,0,.3),\\n            0 0 1px 2px rgba(0,0,0,.4)',\n            borderRadius: '50%',\n            cursor: 'hand',\n            transform: 'translate(-2px, -2px)'\n          }\n        },\n        'custom': {\n          color: color,\n          white: white,\n          black: black,\n          pointer: pointer,\n          circle: circle\n        }\n      }, { 'custom': !!this.props.style });\n\n      return _react2.default.createElement(\n        'div',\n        {\n          style: styles.color,\n          ref: function ref(container) {\n            return _this2.container = container;\n          },\n          onMouseDown: this.handleMouseDown,\n          onTouchMove: this.handleChange,\n          onTouchStart: this.handleChange\n        },\n        _react2.default.createElement(\n          'style',\n          null,\n          '\\n          .saturation-white {\\n            background: -webkit-linear-gradient(to right, #fff, rgba(255,255,255,0));\\n            background: linear-gradient(to right, #fff, rgba(255,255,255,0));\\n          }\\n          .saturation-black {\\n            background: -webkit-linear-gradient(to top, #000, rgba(0,0,0,0));\\n            background: linear-gradient(to top, #000, rgba(0,0,0,0));\\n          }\\n        '\n        ),\n        _react2.default.createElement(\n          'div',\n          { style: styles.white, className: 'saturation-white' },\n          _react2.default.createElement('div', { style: styles.black, className: 'saturation-black' }),\n          _react2.default.createElement(\n            'div',\n            { style: styles.pointer },\n            this.props.pointer ? _react2.default.createElement(this.props.pointer, this.props) : _react2.default.createElement('div', { style: styles.circle })\n          )\n        )\n      );\n    }\n  }]);\n\n  return Saturation;\n}(_react.PureComponent || _react.Component);\n\nexports.default = Saturation;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Swatch = undefined;\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _reactcss = require('reactcss');\n\nvar _reactcss2 = _interopRequireDefault(_reactcss);\n\nvar _interaction = require('../../helpers/interaction');\n\nvar _Checkboard = require('./Checkboard');\n\nvar _Checkboard2 = _interopRequireDefault(_Checkboard);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar ENTER = 13;\n\nvar Swatch = exports.Swatch = function Swatch(_ref) {\n  var color = _ref.color,\n      style = _ref.style,\n      _ref$onClick = _ref.onClick,\n      onClick = _ref$onClick === undefined ? function () {} : _ref$onClick,\n      onHover = _ref.onHover,\n      _ref$title = _ref.title,\n      title = _ref$title === undefined ? color : _ref$title,\n      children = _ref.children,\n      focus = _ref.focus,\n      _ref$focusStyle = _ref.focusStyle,\n      focusStyle = _ref$focusStyle === undefined ? {} : _ref$focusStyle;\n\n  var transparent = color === 'transparent';\n  var styles = (0, _reactcss2.default)({\n    default: {\n      swatch: _extends({\n        background: color,\n        height: '100%',\n        width: '100%',\n        cursor: 'pointer',\n        position: 'relative',\n        outline: 'none'\n      }, style, focus ? focusStyle : {})\n    }\n  });\n\n  var handleClick = function handleClick(e) {\n    return onClick(color, e);\n  };\n  var handleKeyDown = function handleKeyDown(e) {\n    return e.keyCode === ENTER && onClick(color, e);\n  };\n  var handleHover = function handleHover(e) {\n    return onHover(color, e);\n  };\n\n  var optionalEvents = {};\n  if (onHover) {\n    optionalEvents.onMouseOver = handleHover;\n  }\n\n  return _react2.default.createElement(\n    'div',\n    _extends({\n      style: styles.swatch,\n      onClick: handleClick,\n      title: title,\n      tabIndex: 0,\n      onKeyDown: handleKeyDown\n    }, optionalEvents),\n    children,\n    transparent && _react2.default.createElement(_Checkboard2.default, {\n      borderRadius: styles.swatch.borderRadius,\n      boxShadow: 'inset 0 0 0 1px rgba(0,0,0,0.1)'\n    })\n  );\n};\n\nexports.default = (0, _interaction.handleFocus)(Swatch);","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\n\nvar _Alpha = require('./Alpha');\n\nObject.defineProperty(exports, 'Alpha', {\n  enumerable: true,\n  get: function get() {\n    return _interopRequireDefault(_Alpha).default;\n  }\n});\n\nvar _Checkboard = require('./Checkboard');\n\nObject.defineProperty(exports, 'Checkboard', {\n  enumerable: true,\n  get: function get() {\n    return _interopRequireDefault(_Checkboard).default;\n  }\n});\n\nvar _EditableInput = require('./EditableInput');\n\nObject.defineProperty(exports, 'EditableInput', {\n  enumerable: true,\n  get: function get() {\n    return _interopRequireDefault(_EditableInput).default;\n  }\n});\n\nvar _Hue = require('./Hue');\n\nObject.defineProperty(exports, 'Hue', {\n  enumerable: true,\n  get: function get() {\n    return _interopRequireDefault(_Hue).default;\n  }\n});\n\nvar _Raised = require('./Raised');\n\nObject.defineProperty(exports, 'Raised', {\n  enumerable: true,\n  get: function get() {\n    return _interopRequireDefault(_Raised).default;\n  }\n});\n\nvar _Saturation = require('./Saturation');\n\nObject.defineProperty(exports, 'Saturation', {\n  enumerable: true,\n  get: function get() {\n    return _interopRequireDefault(_Saturation).default;\n  }\n});\n\nvar _ColorWrap = require('./ColorWrap');\n\nObject.defineProperty(exports, 'ColorWrap', {\n  enumerable: true,\n  get: function get() {\n    return _interopRequireDefault(_ColorWrap).default;\n  }\n});\n\nvar _Swatch = require('./Swatch');\n\nObject.defineProperty(exports, 'Swatch', {\n  enumerable: true,\n  get: function get() {\n    return _interopRequireDefault(_Swatch).default;\n  }\n});\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.SketchFields = undefined;\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _reactcss = require('reactcss');\n\nvar _reactcss2 = _interopRequireDefault(_reactcss);\n\nvar _color = require('../../helpers/color');\n\nvar color = _interopRequireWildcard(_color);\n\nvar _common = require('../common');\n\nfunction _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\n/* eslint-disable no-param-reassign */\n\nvar SketchFields = exports.SketchFields = function SketchFields(_ref) {\n  var onChange = _ref.onChange,\n      rgb = _ref.rgb,\n      hsl = _ref.hsl,\n      hex = _ref.hex,\n      disableAlpha = _ref.disableAlpha;\n\n  var styles = (0, _reactcss2.default)({\n    'default': {\n      fields: {\n        display: 'flex',\n        paddingTop: '4px'\n      },\n      single: {\n        flex: '1',\n        paddingLeft: '6px'\n      },\n      alpha: {\n        flex: '1',\n        paddingLeft: '6px'\n      },\n      double: {\n        flex: '2'\n      },\n      input: {\n        width: '80%',\n        padding: '4px 10% 3px',\n        border: 'none',\n        boxShadow: 'inset 0 0 0 1px #ccc',\n        fontSize: '11px'\n      },\n      label: {\n        display: 'block',\n        textAlign: 'center',\n        fontSize: '11px',\n        color: '#222',\n        paddingTop: '3px',\n        paddingBottom: '4px',\n        textTransform: 'capitalize'\n      }\n    },\n    'disableAlpha': {\n      alpha: {\n        display: 'none'\n      }\n    }\n  }, { disableAlpha: disableAlpha });\n\n  var handleChange = function handleChange(data, e) {\n    if (data.hex) {\n      color.isValidHex(data.hex) && onChange({\n        hex: data.hex,\n        source: 'hex'\n      }, e);\n    } else if (data.r || data.g || data.b) {\n      onChange({\n        r: data.r || rgb.r,\n        g: data.g || rgb.g,\n        b: data.b || rgb.b,\n        a: rgb.a,\n        source: 'rgb'\n      }, e);\n    } else if (data.a) {\n      if (data.a < 0) {\n        data.a = 0;\n      } else if (data.a > 100) {\n        data.a = 100;\n      }\n\n      data.a /= 100;\n      onChange({\n        h: hsl.h,\n        s: hsl.s,\n        l: hsl.l,\n        a: data.a,\n        source: 'rgb'\n      }, e);\n    }\n  };\n\n  return _react2.default.createElement(\n    'div',\n    { style: styles.fields, className: 'flexbox-fix' },\n    _react2.default.createElement(\n      'div',\n      { style: styles.double },\n      _react2.default.createElement(_common.EditableInput, {\n        style: { input: styles.input, label: styles.label },\n        label: 'hex',\n        value: hex.replace('#', ''),\n        onChange: handleChange\n      })\n    ),\n    _react2.default.createElement(\n      'div',\n      { style: styles.single },\n      _react2.default.createElement(_common.EditableInput, {\n        style: { input: styles.input, label: styles.label },\n        label: 'r',\n        value: rgb.r,\n        onChange: handleChange,\n        dragLabel: 'true',\n        dragMax: '255'\n      })\n    ),\n    _react2.default.createElement(\n      'div',\n      { style: styles.single },\n      _react2.default.createElement(_common.EditableInput, {\n        style: { input: styles.input, label: styles.label },\n        label: 'g',\n        value: rgb.g,\n        onChange: handleChange,\n        dragLabel: 'true',\n        dragMax: '255'\n      })\n    ),\n    _react2.default.createElement(\n      'div',\n      { style: styles.single },\n      _react2.default.createElement(_common.EditableInput, {\n        style: { input: styles.input, label: styles.label },\n        label: 'b',\n        value: rgb.b,\n        onChange: handleChange,\n        dragLabel: 'true',\n        dragMax: '255'\n      })\n    ),\n    _react2.default.createElement(\n      'div',\n      { style: styles.alpha },\n      _react2.default.createElement(_common.EditableInput, {\n        style: { input: styles.input, label: styles.label },\n        label: 'a',\n        value: Math.round(rgb.a * 100),\n        onChange: handleChange,\n        dragLabel: 'true',\n        dragMax: '100'\n      })\n    )\n  );\n};\n\nexports.default = SketchFields;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.SketchPresetColors = undefined;\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _propTypes = require('prop-types');\n\nvar _propTypes2 = _interopRequireDefault(_propTypes);\n\nvar _reactcss = require('reactcss');\n\nvar _reactcss2 = _interopRequireDefault(_reactcss);\n\nvar _common = require('../common');\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar SketchPresetColors = exports.SketchPresetColors = function SketchPresetColors(_ref) {\n  var colors = _ref.colors,\n      _ref$onClick = _ref.onClick,\n      onClick = _ref$onClick === undefined ? function () {} : _ref$onClick,\n      onSwatchHover = _ref.onSwatchHover;\n\n  var styles = (0, _reactcss2.default)({\n    'default': {\n      colors: {\n        margin: '0 -10px',\n        padding: '10px 0 0 10px',\n        borderTop: '1px solid #eee',\n        display: 'flex',\n        flexWrap: 'wrap',\n        position: 'relative'\n      },\n      swatchWrap: {\n        width: '16px',\n        height: '16px',\n        margin: '0 10px 10px 0'\n      },\n      swatch: {\n        borderRadius: '3px',\n        boxShadow: 'inset 0 0 0 1px rgba(0,0,0,.15)'\n      }\n    },\n    'no-presets': {\n      colors: {\n        display: 'none'\n      }\n    }\n  }, {\n    'no-presets': !colors || !colors.length\n  });\n\n  var handleClick = function handleClick(hex, e) {\n    onClick({\n      hex: hex,\n      source: 'hex'\n    }, e);\n  };\n\n  return _react2.default.createElement(\n    'div',\n    { style: styles.colors, className: 'flexbox-fix' },\n    colors.map(function (colorObjOrString) {\n      var c = typeof colorObjOrString === 'string' ? { color: colorObjOrString } : colorObjOrString;\n      var key = '' + c.color + (c.title || '');\n      return _react2.default.createElement(\n        'div',\n        { key: key, style: styles.swatchWrap },\n        _react2.default.createElement(_common.Swatch, _extends({}, c, {\n          style: styles.swatch,\n          onClick: handleClick,\n          onHover: onSwatchHover,\n          focusStyle: {\n            boxShadow: 'inset 0 0 0 1px rgba(0,0,0,.15), 0 0 4px ' + c.color\n          }\n        }))\n      );\n    })\n  );\n};\n\nSketchPresetColors.propTypes = {\n  colors: _propTypes2.default.arrayOf(_propTypes2.default.oneOfType([_propTypes2.default.string, _propTypes2.default.shape({\n    color: _propTypes2.default.string,\n    title: _propTypes2.default.string\n  })])).isRequired\n};\n\nexports.default = SketchPresetColors;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nvar calculateChange = exports.calculateChange = function calculateChange(e, hsl, direction, initialA, container) {\n  var containerWidth = container.clientWidth;\n  var containerHeight = container.clientHeight;\n  var x = typeof e.pageX === 'number' ? e.pageX : e.touches[0].pageX;\n  var y = typeof e.pageY === 'number' ? e.pageY : e.touches[0].pageY;\n  var left = x - (container.getBoundingClientRect().left + window.pageXOffset);\n  var top = y - (container.getBoundingClientRect().top + window.pageYOffset);\n\n  if (direction === 'vertical') {\n    var a = void 0;\n    if (top < 0) {\n      a = 0;\n    } else if (top > containerHeight) {\n      a = 1;\n    } else {\n      a = Math.round(top * 100 / containerHeight) / 100;\n    }\n\n    if (hsl.a !== a) {\n      return {\n        h: hsl.h,\n        s: hsl.s,\n        l: hsl.l,\n        a: a,\n        source: 'rgb'\n      };\n    }\n  } else {\n    var _a = void 0;\n    if (left < 0) {\n      _a = 0;\n    } else if (left > containerWidth) {\n      _a = 1;\n    } else {\n      _a = Math.round(left * 100 / containerWidth) / 100;\n    }\n\n    if (initialA !== _a) {\n      return {\n        h: hsl.h,\n        s: hsl.s,\n        l: hsl.l,\n        a: _a,\n        source: 'rgb'\n      };\n    }\n  }\n  return null;\n};","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nvar checkboardCache = {};\n\nvar render = exports.render = function render(c1, c2, size, serverCanvas) {\n  if (typeof document === 'undefined' && !serverCanvas) {\n    return null;\n  }\n  var canvas = serverCanvas ? new serverCanvas() : document.createElement('canvas');\n  canvas.width = size * 2;\n  canvas.height = size * 2;\n  var ctx = canvas.getContext('2d');\n  if (!ctx) {\n    return null;\n  } // If no context can be found, return early.\n  ctx.fillStyle = c1;\n  ctx.fillRect(0, 0, canvas.width, canvas.height);\n  ctx.fillStyle = c2;\n  ctx.fillRect(0, 0, size, size);\n  ctx.translate(size, size);\n  ctx.fillRect(0, 0, size, size);\n  return canvas.toDataURL();\n};\n\nvar get = exports.get = function get(c1, c2, size, serverCanvas) {\n  var key = c1 + '-' + c2 + '-' + size + (serverCanvas ? '-server' : '');\n\n  if (checkboardCache[key]) {\n    return checkboardCache[key];\n  }\n\n  var checkboard = render(c1, c2, size, serverCanvas);\n  checkboardCache[key] = checkboard;\n  return checkboard;\n};","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isvalidColorString = exports.red = exports.getContrastingColor = exports.isValidHex = exports.toState = exports.simpleCheckForValidColor = undefined;\n\nvar _each = require('lodash/each');\n\nvar _each2 = _interopRequireDefault(_each);\n\nvar _tinycolor = require('tinycolor2');\n\nvar _tinycolor2 = _interopRequireDefault(_tinycolor);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar simpleCheckForValidColor = exports.simpleCheckForValidColor = function simpleCheckForValidColor(data) {\n  var keysToCheck = ['r', 'g', 'b', 'a', 'h', 's', 'l', 'v'];\n  var checked = 0;\n  var passed = 0;\n  (0, _each2.default)(keysToCheck, function (letter) {\n    if (data[letter]) {\n      checked += 1;\n      if (!isNaN(data[letter])) {\n        passed += 1;\n      }\n      if (letter === 's' || letter === 'l') {\n        var percentPatt = /^\\d+%$/;\n        if (percentPatt.test(data[letter])) {\n          passed += 1;\n        }\n      }\n    }\n  });\n  return checked === passed ? data : false;\n};\n\nvar toState = exports.toState = function toState(data, oldHue) {\n  var color = data.hex ? (0, _tinycolor2.default)(data.hex) : (0, _tinycolor2.default)(data);\n  var hsl = color.toHsl();\n  var hsv = color.toHsv();\n  var rgb = color.toRgb();\n  var hex = color.toHex();\n  if (hsl.s === 0) {\n    hsl.h = oldHue || 0;\n    hsv.h = oldHue || 0;\n  }\n  var transparent = hex === '000000' && rgb.a === 0;\n\n  return {\n    hsl: hsl,\n    hex: transparent ? 'transparent' : '#' + hex,\n    rgb: rgb,\n    hsv: hsv,\n    oldHue: data.h || oldHue || hsl.h,\n    source: data.source\n  };\n};\n\nvar isValidHex = exports.isValidHex = function isValidHex(hex) {\n  if (hex === 'transparent') {\n    return true;\n  }\n  // disable hex4 and hex8\n  var lh = String(hex).charAt(0) === '#' ? 1 : 0;\n  return hex.length !== 4 + lh && hex.length < 7 + lh && (0, _tinycolor2.default)(hex).isValid();\n};\n\nvar getContrastingColor = exports.getContrastingColor = function getContrastingColor(data) {\n  if (!data) {\n    return '#fff';\n  }\n  var col = toState(data);\n  if (col.hex === 'transparent') {\n    return 'rgba(0,0,0,0.4)';\n  }\n  var yiq = (col.rgb.r * 299 + col.rgb.g * 587 + col.rgb.b * 114) / 1000;\n  return yiq >= 128 ? '#000' : '#fff';\n};\n\nvar red = exports.red = {\n  hsl: { a: 1, h: 0, l: 0.5, s: 1 },\n  hex: '#ff0000',\n  rgb: { r: 255, g: 0, b: 0, a: 1 },\n  hsv: { h: 0, s: 1, v: 1, a: 1 }\n};\n\nvar isvalidColorString = exports.isvalidColorString = function isvalidColorString(string, type) {\n  var stringWithoutDegree = string.replace('°', '');\n  return (0, _tinycolor2.default)(type + ' (' + stringWithoutDegree + ')')._ok;\n};","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nvar calculateChange = exports.calculateChange = function calculateChange(e, direction, hsl, container) {\n  var containerWidth = container.clientWidth;\n  var containerHeight = container.clientHeight;\n  var x = typeof e.pageX === 'number' ? e.pageX : e.touches[0].pageX;\n  var y = typeof e.pageY === 'number' ? e.pageY : e.touches[0].pageY;\n  var left = x - (container.getBoundingClientRect().left + window.pageXOffset);\n  var top = y - (container.getBoundingClientRect().top + window.pageYOffset);\n\n  if (direction === 'vertical') {\n    var h = void 0;\n    if (top < 0) {\n      h = 359;\n    } else if (top > containerHeight) {\n      h = 0;\n    } else {\n      var percent = -(top * 100 / containerHeight) + 100;\n      h = 360 * percent / 100;\n    }\n\n    if (hsl.h !== h) {\n      return {\n        h: h,\n        s: hsl.s,\n        l: hsl.l,\n        a: hsl.a,\n        source: 'hsl'\n      };\n    }\n  } else {\n    var _h = void 0;\n    if (left < 0) {\n      _h = 0;\n    } else if (left > containerWidth) {\n      _h = 359;\n    } else {\n      var _percent = left * 100 / containerWidth;\n      _h = 360 * _percent / 100;\n    }\n\n    if (hsl.h !== _h) {\n      return {\n        h: _h,\n        s: hsl.s,\n        l: hsl.l,\n        a: hsl.a,\n        source: 'hsl'\n      };\n    }\n  }\n  return null;\n};","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.handleFocus = undefined;\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _createClass = function () { 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); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } /* eslint-disable no-invalid-this */\n\n\nvar handleFocus = exports.handleFocus = function handleFocus(Component) {\n  var Span = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'span';\n  return function (_React$Component) {\n    _inherits(Focus, _React$Component);\n\n    function Focus() {\n      var _ref;\n\n      var _temp, _this, _ret;\n\n      _classCallCheck(this, Focus);\n\n      for (var _len = arguments.length, args = Array(_len), _key = 0; _key < _len; _key++) {\n        args[_key] = arguments[_key];\n      }\n\n      return _ret = (_temp = (_this = _possibleConstructorReturn(this, (_ref = Focus.__proto__ || Object.getPrototypeOf(Focus)).call.apply(_ref, [this].concat(args))), _this), _this.state = { focus: false }, _this.handleFocus = function () {\n        return _this.setState({ focus: true });\n      }, _this.handleBlur = function () {\n        return _this.setState({ focus: false });\n      }, _temp), _possibleConstructorReturn(_this, _ret);\n    }\n\n    _createClass(Focus, [{\n      key: 'render',\n      value: function render() {\n        return _react2.default.createElement(\n          Span,\n          { onFocus: this.handleFocus, onBlur: this.handleBlur },\n          _react2.default.createElement(Component, _extends({}, this.props, this.state))\n        );\n      }\n    }]);\n\n    return Focus;\n  }(_react2.default.Component);\n};","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nvar calculateChange = exports.calculateChange = function calculateChange(e, hsl, container) {\n  var _container$getBoundin = container.getBoundingClientRect(),\n      containerWidth = _container$getBoundin.width,\n      containerHeight = _container$getBoundin.height;\n\n  var x = typeof e.pageX === 'number' ? e.pageX : e.touches[0].pageX;\n  var y = typeof e.pageY === 'number' ? e.pageY : e.touches[0].pageY;\n  var left = x - (container.getBoundingClientRect().left + window.pageXOffset);\n  var top = y - (container.getBoundingClientRect().top + window.pageYOffset);\n\n  if (left < 0) {\n    left = 0;\n  } else if (left > containerWidth) {\n    left = containerWidth;\n  }\n\n  if (top < 0) {\n    top = 0;\n  } else if (top > containerHeight) {\n    top = containerHeight;\n  }\n\n  var saturation = left / containerWidth;\n  var bright = 1 - top / containerHeight;\n\n  return {\n    h: hsl.h,\n    s: saturation,\n    v: bright,\n    a: hsl.a,\n    source: 'hsv'\n  };\n};","import React from 'react';\nexport var ReactReduxContext = /*#__PURE__*/React.createContext(null);\n\nif (process.env.NODE_ENV !== 'production') {\n  ReactReduxContext.displayName = 'ReactRedux';\n}\n\nexport default ReactReduxContext;","// Default to a dummy \"batch\" implementation that just runs the callback\nfunction defaultNoopBatch(callback) {\n  callback();\n}\n\nvar batch = defaultNoopBatch; // Allow injecting another batching function later\n\nexport var setBatch = function setBatch(newBatch) {\n  return batch = newBatch;\n}; // Supply a getter just to skip dealing with ESM bindings\n\nexport var getBatch = function getBatch() {\n  return batch;\n};","import { getBatch } from './batch'; // encapsulates the subscription logic for connecting a component to the redux store, as\n// well as nesting subscriptions of descendant components, so that we can ensure the\n// ancestor components re-render before descendants\n\nvar nullListeners = {\n  notify: function notify() {}\n};\n\nfunction createListenerCollection() {\n  var batch = getBatch();\n  var first = null;\n  var last = null;\n  return {\n    clear: function clear() {\n      first = null;\n      last = null;\n    },\n    notify: function notify() {\n      batch(function () {\n        var listener = first;\n\n        while (listener) {\n          listener.callback();\n          listener = listener.next;\n        }\n      });\n    },\n    get: function get() {\n      var listeners = [];\n      var listener = first;\n\n      while (listener) {\n        listeners.push(listener);\n        listener = listener.next;\n      }\n\n      return listeners;\n    },\n    subscribe: function subscribe(callback) {\n      var isSubscribed = true;\n      var listener = last = {\n        callback: callback,\n        next: null,\n        prev: last\n      };\n\n      if (listener.prev) {\n        listener.prev.next = listener;\n      } else {\n        first = listener;\n      }\n\n      return function unsubscribe() {\n        if (!isSubscribed || first === null) return;\n        isSubscribed = false;\n\n        if (listener.next) {\n          listener.next.prev = listener.prev;\n        } else {\n          last = listener.prev;\n        }\n\n        if (listener.prev) {\n          listener.prev.next = listener.next;\n        } else {\n          first = listener.next;\n        }\n      };\n    }\n  };\n}\n\nvar Subscription = /*#__PURE__*/function () {\n  function Subscription(store, parentSub) {\n    this.store = store;\n    this.parentSub = parentSub;\n    this.unsubscribe = null;\n    this.listeners = nullListeners;\n    this.handleChangeWrapper = this.handleChangeWrapper.bind(this);\n  }\n\n  var _proto = Subscription.prototype;\n\n  _proto.addNestedSub = function addNestedSub(listener) {\n    this.trySubscribe();\n    return this.listeners.subscribe(listener);\n  };\n\n  _proto.notifyNestedSubs = function notifyNestedSubs() {\n    this.listeners.notify();\n  };\n\n  _proto.handleChangeWrapper = function handleChangeWrapper() {\n    if (this.onStateChange) {\n      this.onStateChange();\n    }\n  };\n\n  _proto.isSubscribed = function isSubscribed() {\n    return Boolean(this.unsubscribe);\n  };\n\n  _proto.trySubscribe = function trySubscribe() {\n    if (!this.unsubscribe) {\n      this.unsubscribe = this.parentSub ? this.parentSub.addNestedSub(this.handleChangeWrapper) : this.store.subscribe(this.handleChangeWrapper);\n      this.listeners = createListenerCollection();\n    }\n  };\n\n  _proto.tryUnsubscribe = function tryUnsubscribe() {\n    if (this.unsubscribe) {\n      this.unsubscribe();\n      this.unsubscribe = null;\n      this.listeners.clear();\n      this.listeners = nullListeners;\n    }\n  };\n\n  return Subscription;\n}();\n\nexport { Subscription as default };","import { useEffect, useLayoutEffect } from 'react'; // React currently throws a warning when using useLayoutEffect on the server.\n// To get around it, we can conditionally useEffect on the server (no-op) and\n// useLayoutEffect in the browser. We need useLayoutEffect to ensure the store\n// subscription callback always has the selector from the latest render commit\n// available, otherwise a store update may happen between render and the effect,\n// which may cause missed updates; we also must ensure the store subscription\n// is created synchronously, otherwise a store update may occur before the\n// subscription is created and an inconsistent state may be observed\n\nexport var useIsomorphicLayoutEffect = typeof window !== 'undefined' && typeof window.document !== 'undefined' && typeof window.document.createElement !== 'undefined' ? useLayoutEffect : useEffect;","import React, { useMemo } from 'react';\nimport PropTypes from 'prop-types';\nimport { ReactReduxContext } from './Context';\nimport Subscription from '../utils/Subscription';\nimport { useIsomorphicLayoutEffect } from '../utils/useIsomorphicLayoutEffect';\n\nfunction Provider(_ref) {\n  var store = _ref.store,\n      context = _ref.context,\n      children = _ref.children;\n  var contextValue = useMemo(function () {\n    var subscription = new Subscription(store);\n    subscription.onStateChange = subscription.notifyNestedSubs;\n    return {\n      store: store,\n      subscription: subscription\n    };\n  }, [store]);\n  var previousState = useMemo(function () {\n    return store.getState();\n  }, [store]);\n  useIsomorphicLayoutEffect(function () {\n    var subscription = contextValue.subscription;\n    subscription.trySubscribe();\n\n    if (previousState !== store.getState()) {\n      subscription.notifyNestedSubs();\n    }\n\n    return function () {\n      subscription.tryUnsubscribe();\n      subscription.onStateChange = null;\n    };\n  }, [contextValue, previousState]);\n  var Context = context || ReactReduxContext;\n  return /*#__PURE__*/React.createElement(Context.Provider, {\n    value: contextValue\n  }, children);\n}\n\nif (process.env.NODE_ENV !== 'production') {\n  Provider.propTypes = {\n    store: PropTypes.shape({\n      subscribe: PropTypes.func.isRequired,\n      dispatch: PropTypes.func.isRequired,\n      getState: PropTypes.func.isRequired\n    }),\n    context: PropTypes.object,\n    children: PropTypes.any\n  };\n}\n\nexport default Provider;","export default function _extends() {\n  _extends = Object.assign || function (target) {\n    for (var i = 1; i < arguments.length; i++) {\n      var source = arguments[i];\n\n      for (var key in source) {\n        if (Object.prototype.hasOwnProperty.call(source, key)) {\n          target[key] = source[key];\n        }\n      }\n    }\n\n    return target;\n  };\n\n  return _extends.apply(this, arguments);\n}","export default function _objectWithoutPropertiesLoose(source, excluded) {\n  if (source == null) return {};\n  var target = {};\n  var sourceKeys = Object.keys(source);\n  var key, i;\n\n  for (i = 0; i < sourceKeys.length; i++) {\n    key = sourceKeys[i];\n    if (excluded.indexOf(key) >= 0) continue;\n    target[key] = source[key];\n  }\n\n  return target;\n}","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport _objectWithoutPropertiesLoose from \"@babel/runtime/helpers/esm/objectWithoutPropertiesLoose\";\nimport hoistStatics from 'hoist-non-react-statics';\nimport React, { useContext, useMemo, useRef, useReducer } from 'react';\nimport { isValidElementType, isContextConsumer } from 'react-is';\nimport Subscription from '../utils/Subscription';\nimport { useIsomorphicLayoutEffect } from '../utils/useIsomorphicLayoutEffect';\nimport { ReactReduxContext } from './Context'; // Define some constant arrays just to avoid re-creating these\n\nvar EMPTY_ARRAY = [];\nvar NO_SUBSCRIPTION_ARRAY = [null, null];\n\nvar stringifyComponent = function stringifyComponent(Comp) {\n  try {\n    return JSON.stringify(Comp);\n  } catch (err) {\n    return String(Comp);\n  }\n};\n\nfunction storeStateUpdatesReducer(state, action) {\n  var updateCount = state[1];\n  return [action.payload, updateCount + 1];\n}\n\nfunction useIsomorphicLayoutEffectWithArgs(effectFunc, effectArgs, dependencies) {\n  useIsomorphicLayoutEffect(function () {\n    return effectFunc.apply(void 0, effectArgs);\n  }, dependencies);\n}\n\nfunction captureWrapperProps(lastWrapperProps, lastChildProps, renderIsScheduled, wrapperProps, actualChildProps, childPropsFromStoreUpdate, notifyNestedSubs) {\n  // We want to capture the wrapper props and child props we used for later comparisons\n  lastWrapperProps.current = wrapperProps;\n  lastChildProps.current = actualChildProps;\n  renderIsScheduled.current = false; // If the render was from a store update, clear out that reference and cascade the subscriber update\n\n  if (childPropsFromStoreUpdate.current) {\n    childPropsFromStoreUpdate.current = null;\n    notifyNestedSubs();\n  }\n}\n\nfunction subscribeUpdates(shouldHandleStateChanges, store, subscription, childPropsSelector, lastWrapperProps, lastChildProps, renderIsScheduled, childPropsFromStoreUpdate, notifyNestedSubs, forceComponentUpdateDispatch) {\n  // If we're not subscribed to the store, nothing to do here\n  if (!shouldHandleStateChanges) return; // Capture values for checking if and when this component unmounts\n\n  var didUnsubscribe = false;\n  var lastThrownError = null; // We'll run this callback every time a store subscription update propagates to this component\n\n  var checkForUpdates = function checkForUpdates() {\n    if (didUnsubscribe) {\n      // Don't run stale listeners.\n      // Redux doesn't guarantee unsubscriptions happen until next dispatch.\n      return;\n    }\n\n    var latestStoreState = store.getState();\n    var newChildProps, error;\n\n    try {\n      // Actually run the selector with the most recent store state and wrapper props\n      // to determine what the child props should be\n      newChildProps = childPropsSelector(latestStoreState, lastWrapperProps.current);\n    } catch (e) {\n      error = e;\n      lastThrownError = e;\n    }\n\n    if (!error) {\n      lastThrownError = null;\n    } // If the child props haven't changed, nothing to do here - cascade the subscription update\n\n\n    if (newChildProps === lastChildProps.current) {\n      if (!renderIsScheduled.current) {\n        notifyNestedSubs();\n      }\n    } else {\n      // Save references to the new child props.  Note that we track the \"child props from store update\"\n      // as a ref instead of a useState/useReducer because we need a way to determine if that value has\n      // been processed.  If this went into useState/useReducer, we couldn't clear out the value without\n      // forcing another re-render, which we don't want.\n      lastChildProps.current = newChildProps;\n      childPropsFromStoreUpdate.current = newChildProps;\n      renderIsScheduled.current = true; // If the child props _did_ change (or we caught an error), this wrapper component needs to re-render\n\n      forceComponentUpdateDispatch({\n        type: 'STORE_UPDATED',\n        payload: {\n          error: error\n        }\n      });\n    }\n  }; // Actually subscribe to the nearest connected ancestor (or store)\n\n\n  subscription.onStateChange = checkForUpdates;\n  subscription.trySubscribe(); // Pull data from the store after first render in case the store has\n  // changed since we began.\n\n  checkForUpdates();\n\n  var unsubscribeWrapper = function unsubscribeWrapper() {\n    didUnsubscribe = true;\n    subscription.tryUnsubscribe();\n    subscription.onStateChange = null;\n\n    if (lastThrownError) {\n      // It's possible that we caught an error due to a bad mapState function, but the\n      // parent re-rendered without this component and we're about to unmount.\n      // This shouldn't happen as long as we do top-down subscriptions correctly, but\n      // if we ever do those wrong, this throw will surface the error in our tests.\n      // In that case, throw the error from here so it doesn't get lost.\n      throw lastThrownError;\n    }\n  };\n\n  return unsubscribeWrapper;\n}\n\nvar initStateUpdates = function initStateUpdates() {\n  return [null, 0];\n};\n\nexport default function connectAdvanced(\n/*\r\n  selectorFactory is a func that is responsible for returning the selector function used to\r\n  compute new props from state, props, and dispatch. For example:\r\n      export default connectAdvanced((dispatch, options) => (state, props) => ({\r\n      thing: state.things[props.thingId],\r\n      saveThing: fields => dispatch(actionCreators.saveThing(props.thingId, fields)),\r\n    }))(YourComponent)\r\n    Access to dispatch is provided to the factory so selectorFactories can bind actionCreators\r\n  outside of their selector as an optimization. Options passed to connectAdvanced are passed to\r\n  the selectorFactory, along with displayName and WrappedComponent, as the second argument.\r\n    Note that selectorFactory is responsible for all caching/memoization of inbound and outbound\r\n  props. Do not use connectAdvanced directly without memoizing results between calls to your\r\n  selector, otherwise the Connect component will re-render on every state or props change.\r\n*/\nselectorFactory, // options object:\n_ref) {\n  if (_ref === void 0) {\n    _ref = {};\n  }\n\n  var _ref2 = _ref,\n      _ref2$getDisplayName = _ref2.getDisplayName,\n      getDisplayName = _ref2$getDisplayName === void 0 ? function (name) {\n    return \"ConnectAdvanced(\" + name + \")\";\n  } : _ref2$getDisplayName,\n      _ref2$methodName = _ref2.methodName,\n      methodName = _ref2$methodName === void 0 ? 'connectAdvanced' : _ref2$methodName,\n      _ref2$renderCountProp = _ref2.renderCountProp,\n      renderCountProp = _ref2$renderCountProp === void 0 ? undefined : _ref2$renderCountProp,\n      _ref2$shouldHandleSta = _ref2.shouldHandleStateChanges,\n      shouldHandleStateChanges = _ref2$shouldHandleSta === void 0 ? true : _ref2$shouldHandleSta,\n      _ref2$storeKey = _ref2.storeKey,\n      storeKey = _ref2$storeKey === void 0 ? 'store' : _ref2$storeKey,\n      _ref2$withRef = _ref2.withRef,\n      withRef = _ref2$withRef === void 0 ? false : _ref2$withRef,\n      _ref2$forwardRef = _ref2.forwardRef,\n      forwardRef = _ref2$forwardRef === void 0 ? false : _ref2$forwardRef,\n      _ref2$context = _ref2.context,\n      context = _ref2$context === void 0 ? ReactReduxContext : _ref2$context,\n      connectOptions = _objectWithoutPropertiesLoose(_ref2, [\"getDisplayName\", \"methodName\", \"renderCountProp\", \"shouldHandleStateChanges\", \"storeKey\", \"withRef\", \"forwardRef\", \"context\"]);\n\n  if (process.env.NODE_ENV !== 'production') {\n    if (renderCountProp !== undefined) {\n      throw new Error(\"renderCountProp is removed. render counting is built into the latest React Dev Tools profiling extension\");\n    }\n\n    if (withRef) {\n      throw new Error('withRef is removed. To access the wrapped instance, use a ref on the connected component');\n    }\n\n    var customStoreWarningMessage = 'To use a custom Redux store for specific components, create a custom React context with ' + \"React.createContext(), and pass the context object to React Redux's Provider and specific components\" + ' like: <Provider context={MyContext}><ConnectedComponent context={MyContext} /></Provider>. ' + 'You may also pass a {context : MyContext} option to connect';\n\n    if (storeKey !== 'store') {\n      throw new Error('storeKey has been removed and does not do anything. ' + customStoreWarningMessage);\n    }\n  }\n\n  var Context = context;\n  return function wrapWithConnect(WrappedComponent) {\n    if (process.env.NODE_ENV !== 'production' && !isValidElementType(WrappedComponent)) {\n      throw new Error(\"You must pass a component to the function returned by \" + (methodName + \". Instead received \" + stringifyComponent(WrappedComponent)));\n    }\n\n    var wrappedComponentName = WrappedComponent.displayName || WrappedComponent.name || 'Component';\n    var displayName = getDisplayName(wrappedComponentName);\n\n    var selectorFactoryOptions = _extends({}, connectOptions, {\n      getDisplayName: getDisplayName,\n      methodName: methodName,\n      renderCountProp: renderCountProp,\n      shouldHandleStateChanges: shouldHandleStateChanges,\n      storeKey: storeKey,\n      displayName: displayName,\n      wrappedComponentName: wrappedComponentName,\n      WrappedComponent: WrappedComponent\n    });\n\n    var pure = connectOptions.pure;\n\n    function createChildSelector(store) {\n      return selectorFactory(store.dispatch, selectorFactoryOptions);\n    } // If we aren't running in \"pure\" mode, we don't want to memoize values.\n    // To avoid conditionally calling hooks, we fall back to a tiny wrapper\n    // that just executes the given callback immediately.\n\n\n    var usePureOnlyMemo = pure ? useMemo : function (callback) {\n      return callback();\n    };\n\n    function ConnectFunction(props) {\n      var _useMemo = useMemo(function () {\n        // Distinguish between actual \"data\" props that were passed to the wrapper component,\n        // and values needed to control behavior (forwarded refs, alternate context instances).\n        // To maintain the wrapperProps object reference, memoize this destructuring.\n        var reactReduxForwardedRef = props.reactReduxForwardedRef,\n            wrapperProps = _objectWithoutPropertiesLoose(props, [\"reactReduxForwardedRef\"]);\n\n        return [props.context, reactReduxForwardedRef, wrapperProps];\n      }, [props]),\n          propsContext = _useMemo[0],\n          reactReduxForwardedRef = _useMemo[1],\n          wrapperProps = _useMemo[2];\n\n      var ContextToUse = useMemo(function () {\n        // Users may optionally pass in a custom context instance to use instead of our ReactReduxContext.\n        // Memoize the check that determines which context instance we should use.\n        return propsContext && propsContext.Consumer && isContextConsumer( /*#__PURE__*/React.createElement(propsContext.Consumer, null)) ? propsContext : Context;\n      }, [propsContext, Context]); // Retrieve the store and ancestor subscription via context, if available\n\n      var contextValue = useContext(ContextToUse); // The store _must_ exist as either a prop or in context.\n      // We'll check to see if it _looks_ like a Redux store first.\n      // This allows us to pass through a `store` prop that is just a plain value.\n\n      var didStoreComeFromProps = Boolean(props.store) && Boolean(props.store.getState) && Boolean(props.store.dispatch);\n      var didStoreComeFromContext = Boolean(contextValue) && Boolean(contextValue.store);\n\n      if (process.env.NODE_ENV !== 'production' && !didStoreComeFromProps && !didStoreComeFromContext) {\n        throw new Error(\"Could not find \\\"store\\\" in the context of \" + (\"\\\"\" + displayName + \"\\\". Either wrap the root component in a <Provider>, \") + \"or pass a custom React context provider to <Provider> and the corresponding \" + (\"React context consumer to \" + displayName + \" in connect options.\"));\n      } // Based on the previous check, one of these must be true\n\n\n      var store = didStoreComeFromProps ? props.store : contextValue.store;\n      var childPropsSelector = useMemo(function () {\n        // The child props selector needs the store reference as an input.\n        // Re-create this selector whenever the store changes.\n        return createChildSelector(store);\n      }, [store]);\n\n      var _useMemo2 = useMemo(function () {\n        if (!shouldHandleStateChanges) return NO_SUBSCRIPTION_ARRAY; // This Subscription's source should match where store came from: props vs. context. A component\n        // connected to the store via props shouldn't use subscription from context, or vice versa.\n\n        var subscription = new Subscription(store, didStoreComeFromProps ? null : contextValue.subscription); // `notifyNestedSubs` is duplicated to handle the case where the component is unmounted in\n        // the middle of the notification loop, where `subscription` will then be null. This can\n        // probably be avoided if Subscription's listeners logic is changed to not call listeners\n        // that have been unsubscribed in the  middle of the notification loop.\n\n        var notifyNestedSubs = subscription.notifyNestedSubs.bind(subscription);\n        return [subscription, notifyNestedSubs];\n      }, [store, didStoreComeFromProps, contextValue]),\n          subscription = _useMemo2[0],\n          notifyNestedSubs = _useMemo2[1]; // Determine what {store, subscription} value should be put into nested context, if necessary,\n      // and memoize that value to avoid unnecessary context updates.\n\n\n      var overriddenContextValue = useMemo(function () {\n        if (didStoreComeFromProps) {\n          // This component is directly subscribed to a store from props.\n          // We don't want descendants reading from this store - pass down whatever\n          // the existing context value is from the nearest connected ancestor.\n          return contextValue;\n        } // Otherwise, put this component's subscription instance into context, so that\n        // connected descendants won't update until after this component is done\n\n\n        return _extends({}, contextValue, {\n          subscription: subscription\n        });\n      }, [didStoreComeFromProps, contextValue, subscription]); // We need to force this wrapper component to re-render whenever a Redux store update\n      // causes a change to the calculated child component props (or we caught an error in mapState)\n\n      var _useReducer = useReducer(storeStateUpdatesReducer, EMPTY_ARRAY, initStateUpdates),\n          _useReducer$ = _useReducer[0],\n          previousStateUpdateResult = _useReducer$[0],\n          forceComponentUpdateDispatch = _useReducer[1]; // Propagate any mapState/mapDispatch errors upwards\n\n\n      if (previousStateUpdateResult && previousStateUpdateResult.error) {\n        throw previousStateUpdateResult.error;\n      } // Set up refs to coordinate values between the subscription effect and the render logic\n\n\n      var lastChildProps = useRef();\n      var lastWrapperProps = useRef(wrapperProps);\n      var childPropsFromStoreUpdate = useRef();\n      var renderIsScheduled = useRef(false);\n      var actualChildProps = usePureOnlyMemo(function () {\n        // Tricky logic here:\n        // - This render may have been triggered by a Redux store update that produced new child props\n        // - However, we may have gotten new wrapper props after that\n        // If we have new child props, and the same wrapper props, we know we should use the new child props as-is.\n        // But, if we have new wrapper props, those might change the child props, so we have to recalculate things.\n        // So, we'll use the child props from store update only if the wrapper props are the same as last time.\n        if (childPropsFromStoreUpdate.current && wrapperProps === lastWrapperProps.current) {\n          return childPropsFromStoreUpdate.current;\n        } // TODO We're reading the store directly in render() here. Bad idea?\n        // This will likely cause Bad Things (TM) to happen in Concurrent Mode.\n        // Note that we do this because on renders _not_ caused by store updates, we need the latest store state\n        // to determine what the child props should be.\n\n\n        return childPropsSelector(store.getState(), wrapperProps);\n      }, [store, previousStateUpdateResult, wrapperProps]); // We need this to execute synchronously every time we re-render. However, React warns\n      // about useLayoutEffect in SSR, so we try to detect environment and fall back to\n      // just useEffect instead to avoid the warning, since neither will run anyway.\n\n      useIsomorphicLayoutEffectWithArgs(captureWrapperProps, [lastWrapperProps, lastChildProps, renderIsScheduled, wrapperProps, actualChildProps, childPropsFromStoreUpdate, notifyNestedSubs]); // Our re-subscribe logic only runs when the store/subscription setup changes\n\n      useIsomorphicLayoutEffectWithArgs(subscribeUpdates, [shouldHandleStateChanges, store, subscription, childPropsSelector, lastWrapperProps, lastChildProps, renderIsScheduled, childPropsFromStoreUpdate, notifyNestedSubs, forceComponentUpdateDispatch], [store, subscription, childPropsSelector]); // Now that all that's done, we can finally try to actually render the child component.\n      // We memoize the elements for the rendered child component as an optimization.\n\n      var renderedWrappedComponent = useMemo(function () {\n        return /*#__PURE__*/React.createElement(WrappedComponent, _extends({}, actualChildProps, {\n          ref: reactReduxForwardedRef\n        }));\n      }, [reactReduxForwardedRef, WrappedComponent, actualChildProps]); // If React sees the exact same element reference as last time, it bails out of re-rendering\n      // that child, same as if it was wrapped in React.memo() or returned false from shouldComponentUpdate.\n\n      var renderedChild = useMemo(function () {\n        if (shouldHandleStateChanges) {\n          // If this component is subscribed to store updates, we need to pass its own\n          // subscription instance down to our descendants. That means rendering the same\n          // Context instance, and putting a different value into the context.\n          return /*#__PURE__*/React.createElement(ContextToUse.Provider, {\n            value: overriddenContextValue\n          }, renderedWrappedComponent);\n        }\n\n        return renderedWrappedComponent;\n      }, [ContextToUse, renderedWrappedComponent, overriddenContextValue]);\n      return renderedChild;\n    } // If we're in \"pure\" mode, ensure our wrapper component only re-renders when incoming props have changed.\n\n\n    var Connect = pure ? React.memo(ConnectFunction) : ConnectFunction;\n    Connect.WrappedComponent = WrappedComponent;\n    Connect.displayName = ConnectFunction.displayName = displayName;\n\n    if (forwardRef) {\n      var forwarded = React.forwardRef(function forwardConnectRef(props, ref) {\n        return /*#__PURE__*/React.createElement(Connect, _extends({}, props, {\n          reactReduxForwardedRef: ref\n        }));\n      });\n      forwarded.displayName = displayName;\n      forwarded.WrappedComponent = WrappedComponent;\n      return hoistStatics(forwarded, WrappedComponent);\n    }\n\n    return hoistStatics(Connect, WrappedComponent);\n  };\n}","function is(x, y) {\n  if (x === y) {\n    return x !== 0 || y !== 0 || 1 / x === 1 / y;\n  } else {\n    return x !== x && y !== y;\n  }\n}\n\nexport default function shallowEqual(objA, objB) {\n  if (is(objA, objB)) return true;\n\n  if (typeof objA !== 'object' || objA === null || typeof objB !== 'object' || objB === null) {\n    return false;\n  }\n\n  var keysA = Object.keys(objA);\n  var keysB = Object.keys(objB);\n  if (keysA.length !== keysB.length) return false;\n\n  for (var i = 0; i < keysA.length; i++) {\n    if (!Object.prototype.hasOwnProperty.call(objB, keysA[i]) || !is(objA[keysA[i]], objB[keysA[i]])) {\n      return false;\n    }\n  }\n\n  return true;\n}","import verifyPlainObject from '../utils/verifyPlainObject';\nexport function wrapMapToPropsConstant(getConstant) {\n  return function initConstantSelector(dispatch, options) {\n    var constant = getConstant(dispatch, options);\n\n    function constantSelector() {\n      return constant;\n    }\n\n    constantSelector.dependsOnOwnProps = false;\n    return constantSelector;\n  };\n} // dependsOnOwnProps is used by createMapToPropsProxy to determine whether to pass props as args\n// to the mapToProps function being wrapped. It is also used by makePurePropsSelector to determine\n// whether mapToProps needs to be invoked when props have changed.\n//\n// A length of one signals that mapToProps does not depend on props from the parent component.\n// A length of zero is assumed to mean mapToProps is getting args via arguments or ...args and\n// therefore not reporting its length accurately..\n\nexport function getDependsOnOwnProps(mapToProps) {\n  return mapToProps.dependsOnOwnProps !== null && mapToProps.dependsOnOwnProps !== undefined ? Boolean(mapToProps.dependsOnOwnProps) : mapToProps.length !== 1;\n} // Used by whenMapStateToPropsIsFunction and whenMapDispatchToPropsIsFunction,\n// this function wraps mapToProps in a proxy function which does several things:\n//\n//  * Detects whether the mapToProps function being called depends on props, which\n//    is used by selectorFactory to decide if it should reinvoke on props changes.\n//\n//  * On first call, handles mapToProps if returns another function, and treats that\n//    new function as the true mapToProps for subsequent calls.\n//\n//  * On first call, verifies the first result is a plain object, in order to warn\n//    the developer that their mapToProps function is not returning a valid result.\n//\n\nexport function wrapMapToPropsFunc(mapToProps, methodName) {\n  return function initProxySelector(dispatch, _ref) {\n    var displayName = _ref.displayName;\n\n    var proxy = function mapToPropsProxy(stateOrDispatch, ownProps) {\n      return proxy.dependsOnOwnProps ? proxy.mapToProps(stateOrDispatch, ownProps) : proxy.mapToProps(stateOrDispatch);\n    }; // allow detectFactoryAndVerify to get ownProps\n\n\n    proxy.dependsOnOwnProps = true;\n\n    proxy.mapToProps = function detectFactoryAndVerify(stateOrDispatch, ownProps) {\n      proxy.mapToProps = mapToProps;\n      proxy.dependsOnOwnProps = getDependsOnOwnProps(mapToProps);\n      var props = proxy(stateOrDispatch, ownProps);\n\n      if (typeof props === 'function') {\n        proxy.mapToProps = props;\n        proxy.dependsOnOwnProps = getDependsOnOwnProps(props);\n        props = proxy(stateOrDispatch, ownProps);\n      }\n\n      if (process.env.NODE_ENV !== 'production') verifyPlainObject(props, displayName, methodName);\n      return props;\n    };\n\n    return proxy;\n  };\n}","import bindActionCreators from '../utils/bindActionCreators';\nimport { wrapMapToPropsConstant, wrapMapToPropsFunc } from './wrapMapToProps';\nexport function whenMapDispatchToPropsIsFunction(mapDispatchToProps) {\n  return typeof mapDispatchToProps === 'function' ? wrapMapToPropsFunc(mapDispatchToProps, 'mapDispatchToProps') : undefined;\n}\nexport function whenMapDispatchToPropsIsMissing(mapDispatchToProps) {\n  return !mapDispatchToProps ? wrapMapToPropsConstant(function (dispatch) {\n    return {\n      dispatch: dispatch\n    };\n  }) : undefined;\n}\nexport function whenMapDispatchToPropsIsObject(mapDispatchToProps) {\n  return mapDispatchToProps && typeof mapDispatchToProps === 'object' ? wrapMapToPropsConstant(function (dispatch) {\n    return bindActionCreators(mapDispatchToProps, dispatch);\n  }) : undefined;\n}\nexport default [whenMapDispatchToPropsIsFunction, whenMapDispatchToPropsIsMissing, whenMapDispatchToPropsIsObject];","export default function bindActionCreators(actionCreators, dispatch) {\n  var boundActionCreators = {};\n\n  var _loop = function _loop(key) {\n    var actionCreator = actionCreators[key];\n\n    if (typeof actionCreator === 'function') {\n      boundActionCreators[key] = function () {\n        return dispatch(actionCreator.apply(void 0, arguments));\n      };\n    }\n  };\n\n  for (var key in actionCreators) {\n    _loop(key);\n  }\n\n  return boundActionCreators;\n}","import { wrapMapToPropsConstant, wrapMapToPropsFunc } from './wrapMapToProps';\nexport function whenMapStateToPropsIsFunction(mapStateToProps) {\n  return typeof mapStateToProps === 'function' ? wrapMapToPropsFunc(mapStateToProps, 'mapStateToProps') : undefined;\n}\nexport function whenMapStateToPropsIsMissing(mapStateToProps) {\n  return !mapStateToProps ? wrapMapToPropsConstant(function () {\n    return {};\n  }) : undefined;\n}\nexport default [whenMapStateToPropsIsFunction, whenMapStateToPropsIsMissing];","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport verifyPlainObject from '../utils/verifyPlainObject';\nexport function defaultMergeProps(stateProps, dispatchProps, ownProps) {\n  return _extends({}, ownProps, stateProps, dispatchProps);\n}\nexport function wrapMergePropsFunc(mergeProps) {\n  return function initMergePropsProxy(dispatch, _ref) {\n    var displayName = _ref.displayName,\n        pure = _ref.pure,\n        areMergedPropsEqual = _ref.areMergedPropsEqual;\n    var hasRunOnce = false;\n    var mergedProps;\n    return function mergePropsProxy(stateProps, dispatchProps, ownProps) {\n      var nextMergedProps = mergeProps(stateProps, dispatchProps, ownProps);\n\n      if (hasRunOnce) {\n        if (!pure || !areMergedPropsEqual(nextMergedProps, mergedProps)) mergedProps = nextMergedProps;\n      } else {\n        hasRunOnce = true;\n        mergedProps = nextMergedProps;\n        if (process.env.NODE_ENV !== 'production') verifyPlainObject(mergedProps, displayName, 'mergeProps');\n      }\n\n      return mergedProps;\n    };\n  };\n}\nexport function whenMergePropsIsFunction(mergeProps) {\n  return typeof mergeProps === 'function' ? wrapMergePropsFunc(mergeProps) : undefined;\n}\nexport function whenMergePropsIsOmitted(mergeProps) {\n  return !mergeProps ? function () {\n    return defaultMergeProps;\n  } : undefined;\n}\nexport default [whenMergePropsIsFunction, whenMergePropsIsOmitted];","import _objectWithoutPropertiesLoose from \"@babel/runtime/helpers/esm/objectWithoutPropertiesLoose\";\nimport verifySubselectors from './verifySubselectors';\nexport function impureFinalPropsSelectorFactory(mapStateToProps, mapDispatchToProps, mergeProps, dispatch) {\n  return function impureFinalPropsSelector(state, ownProps) {\n    return mergeProps(mapStateToProps(state, ownProps), mapDispatchToProps(dispatch, ownProps), ownProps);\n  };\n}\nexport function pureFinalPropsSelectorFactory(mapStateToProps, mapDispatchToProps, mergeProps, dispatch, _ref) {\n  var areStatesEqual = _ref.areStatesEqual,\n      areOwnPropsEqual = _ref.areOwnPropsEqual,\n      areStatePropsEqual = _ref.areStatePropsEqual;\n  var hasRunAtLeastOnce = false;\n  var state;\n  var ownProps;\n  var stateProps;\n  var dispatchProps;\n  var mergedProps;\n\n  function handleFirstCall(firstState, firstOwnProps) {\n    state = firstState;\n    ownProps = firstOwnProps;\n    stateProps = mapStateToProps(state, ownProps);\n    dispatchProps = mapDispatchToProps(dispatch, ownProps);\n    mergedProps = mergeProps(stateProps, dispatchProps, ownProps);\n    hasRunAtLeastOnce = true;\n    return mergedProps;\n  }\n\n  function handleNewPropsAndNewState() {\n    stateProps = mapStateToProps(state, ownProps);\n    if (mapDispatchToProps.dependsOnOwnProps) dispatchProps = mapDispatchToProps(dispatch, ownProps);\n    mergedProps = mergeProps(stateProps, dispatchProps, ownProps);\n    return mergedProps;\n  }\n\n  function handleNewProps() {\n    if (mapStateToProps.dependsOnOwnProps) stateProps = mapStateToProps(state, ownProps);\n    if (mapDispatchToProps.dependsOnOwnProps) dispatchProps = mapDispatchToProps(dispatch, ownProps);\n    mergedProps = mergeProps(stateProps, dispatchProps, ownProps);\n    return mergedProps;\n  }\n\n  function handleNewState() {\n    var nextStateProps = mapStateToProps(state, ownProps);\n    var statePropsChanged = !areStatePropsEqual(nextStateProps, stateProps);\n    stateProps = nextStateProps;\n    if (statePropsChanged) mergedProps = mergeProps(stateProps, dispatchProps, ownProps);\n    return mergedProps;\n  }\n\n  function handleSubsequentCalls(nextState, nextOwnProps) {\n    var propsChanged = !areOwnPropsEqual(nextOwnProps, ownProps);\n    var stateChanged = !areStatesEqual(nextState, state);\n    state = nextState;\n    ownProps = nextOwnProps;\n    if (propsChanged && stateChanged) return handleNewPropsAndNewState();\n    if (propsChanged) return handleNewProps();\n    if (stateChanged) return handleNewState();\n    return mergedProps;\n  }\n\n  return function pureFinalPropsSelector(nextState, nextOwnProps) {\n    return hasRunAtLeastOnce ? handleSubsequentCalls(nextState, nextOwnProps) : handleFirstCall(nextState, nextOwnProps);\n  };\n} // TODO: Add more comments\n// If pure is true, the selector returned by selectorFactory will memoize its results,\n// allowing connectAdvanced's shouldComponentUpdate to return false if final\n// props have not changed. If false, the selector will always return a new\n// object and shouldComponentUpdate will always return true.\n\nexport default function finalPropsSelectorFactory(dispatch, _ref2) {\n  var initMapStateToProps = _ref2.initMapStateToProps,\n      initMapDispatchToProps = _ref2.initMapDispatchToProps,\n      initMergeProps = _ref2.initMergeProps,\n      options = _objectWithoutPropertiesLoose(_ref2, [\"initMapStateToProps\", \"initMapDispatchToProps\", \"initMergeProps\"]);\n\n  var mapStateToProps = initMapStateToProps(dispatch, options);\n  var mapDispatchToProps = initMapDispatchToProps(dispatch, options);\n  var mergeProps = initMergeProps(dispatch, options);\n\n  if (process.env.NODE_ENV !== 'production') {\n    verifySubselectors(mapStateToProps, mapDispatchToProps, mergeProps, options.displayName);\n  }\n\n  var selectorFactory = options.pure ? pureFinalPropsSelectorFactory : impureFinalPropsSelectorFactory;\n  return selectorFactory(mapStateToProps, mapDispatchToProps, mergeProps, dispatch, options);\n}","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport _objectWithoutPropertiesLoose from \"@babel/runtime/helpers/esm/objectWithoutPropertiesLoose\";\nimport connectAdvanced from '../components/connectAdvanced';\nimport shallowEqual from '../utils/shallowEqual';\nimport defaultMapDispatchToPropsFactories from './mapDispatchToProps';\nimport defaultMapStateToPropsFactories from './mapStateToProps';\nimport defaultMergePropsFactories from './mergeProps';\nimport defaultSelectorFactory from './selectorFactory';\n/*\r\n  connect is a facade over connectAdvanced. It turns its args into a compatible\r\n  selectorFactory, which has the signature:\r\n\r\n    (dispatch, options) => (nextState, nextOwnProps) => nextFinalProps\r\n  \r\n  connect passes its args to connectAdvanced as options, which will in turn pass them to\r\n  selectorFactory each time a Connect component instance is instantiated or hot reloaded.\r\n\r\n  selectorFactory returns a final props selector from its mapStateToProps,\r\n  mapStateToPropsFactories, mapDispatchToProps, mapDispatchToPropsFactories, mergeProps,\r\n  mergePropsFactories, and pure args.\r\n\r\n  The resulting final props selector is called by the Connect component instance whenever\r\n  it receives new props or store state.\r\n */\n\nfunction match(arg, factories, name) {\n  for (var i = factories.length - 1; i >= 0; i--) {\n    var result = factories[i](arg);\n    if (result) return result;\n  }\n\n  return function (dispatch, options) {\n    throw new Error(\"Invalid value of type \" + typeof arg + \" for \" + name + \" argument when connecting component \" + options.wrappedComponentName + \".\");\n  };\n}\n\nfunction strictEqual(a, b) {\n  return a === b;\n} // createConnect with default args builds the 'official' connect behavior. Calling it with\n// different options opens up some testing and extensibility scenarios\n\n\nexport function createConnect(_temp) {\n  var _ref = _temp === void 0 ? {} : _temp,\n      _ref$connectHOC = _ref.connectHOC,\n      connectHOC = _ref$connectHOC === void 0 ? connectAdvanced : _ref$connectHOC,\n      _ref$mapStateToPropsF = _ref.mapStateToPropsFactories,\n      mapStateToPropsFactories = _ref$mapStateToPropsF === void 0 ? defaultMapStateToPropsFactories : _ref$mapStateToPropsF,\n      _ref$mapDispatchToPro = _ref.mapDispatchToPropsFactories,\n      mapDispatchToPropsFactories = _ref$mapDispatchToPro === void 0 ? defaultMapDispatchToPropsFactories : _ref$mapDispatchToPro,\n      _ref$mergePropsFactor = _ref.mergePropsFactories,\n      mergePropsFactories = _ref$mergePropsFactor === void 0 ? defaultMergePropsFactories : _ref$mergePropsFactor,\n      _ref$selectorFactory = _ref.selectorFactory,\n      selectorFactory = _ref$selectorFactory === void 0 ? defaultSelectorFactory : _ref$selectorFactory;\n\n  return function connect(mapStateToProps, mapDispatchToProps, mergeProps, _ref2) {\n    if (_ref2 === void 0) {\n      _ref2 = {};\n    }\n\n    var _ref3 = _ref2,\n        _ref3$pure = _ref3.pure,\n        pure = _ref3$pure === void 0 ? true : _ref3$pure,\n        _ref3$areStatesEqual = _ref3.areStatesEqual,\n        areStatesEqual = _ref3$areStatesEqual === void 0 ? strictEqual : _ref3$areStatesEqual,\n        _ref3$areOwnPropsEqua = _ref3.areOwnPropsEqual,\n        areOwnPropsEqual = _ref3$areOwnPropsEqua === void 0 ? shallowEqual : _ref3$areOwnPropsEqua,\n        _ref3$areStatePropsEq = _ref3.areStatePropsEqual,\n        areStatePropsEqual = _ref3$areStatePropsEq === void 0 ? shallowEqual : _ref3$areStatePropsEq,\n        _ref3$areMergedPropsE = _ref3.areMergedPropsEqual,\n        areMergedPropsEqual = _ref3$areMergedPropsE === void 0 ? shallowEqual : _ref3$areMergedPropsE,\n        extraOptions = _objectWithoutPropertiesLoose(_ref3, [\"pure\", \"areStatesEqual\", \"areOwnPropsEqual\", \"areStatePropsEqual\", \"areMergedPropsEqual\"]);\n\n    var initMapStateToProps = match(mapStateToProps, mapStateToPropsFactories, 'mapStateToProps');\n    var initMapDispatchToProps = match(mapDispatchToProps, mapDispatchToPropsFactories, 'mapDispatchToProps');\n    var initMergeProps = match(mergeProps, mergePropsFactories, 'mergeProps');\n    return connectHOC(selectorFactory, _extends({\n      // used in error messages\n      methodName: 'connect',\n      // used to compute Connect's displayName from the wrapped component's displayName.\n      getDisplayName: function getDisplayName(name) {\n        return \"Connect(\" + name + \")\";\n      },\n      // if mapStateToProps is falsy, the Connect component doesn't subscribe to store state changes\n      shouldHandleStateChanges: Boolean(mapStateToProps),\n      // passed through to selectorFactory\n      initMapStateToProps: initMapStateToProps,\n      initMapDispatchToProps: initMapDispatchToProps,\n      initMergeProps: initMergeProps,\n      pure: pure,\n      areStatesEqual: areStatesEqual,\n      areOwnPropsEqual: areOwnPropsEqual,\n      areStatePropsEqual: areStatePropsEqual,\n      areMergedPropsEqual: areMergedPropsEqual\n    }, extraOptions));\n  };\n}\nexport default /*#__PURE__*/createConnect();","import { useContext } from 'react';\nimport { ReactReduxContext } from '../components/Context';\n/**\r\n * A hook to access the value of the `ReactReduxContext`. This is a low-level\r\n * hook that you should usually not need to call directly.\r\n *\r\n * @returns {any} the value of the `ReactReduxContext`\r\n *\r\n * @example\r\n *\r\n * import React from 'react'\r\n * import { useReduxContext } from 'react-redux'\r\n *\r\n * export const CounterComponent = ({ value }) => {\r\n *   const { store } = useReduxContext()\r\n *   return <div>{store.getState()}</div>\r\n * }\r\n */\n\nexport function useReduxContext() {\n  var contextValue = useContext(ReactReduxContext);\n\n  if (process.env.NODE_ENV !== 'production' && !contextValue) {\n    throw new Error('could not find react-redux context value; please ensure the component is wrapped in a <Provider>');\n  }\n\n  return contextValue;\n}","import { useContext } from 'react';\nimport { ReactReduxContext } from '../components/Context';\nimport { useReduxContext as useDefaultReduxContext } from './useReduxContext';\n/**\r\n * Hook factory, which creates a `useStore` hook bound to a given context.\r\n *\r\n * @param {React.Context} [context=ReactReduxContext] Context passed to your `<Provider>`.\r\n * @returns {Function} A `useStore` hook bound to the specified context.\r\n */\n\nexport function createStoreHook(context) {\n  if (context === void 0) {\n    context = ReactReduxContext;\n  }\n\n  var useReduxContext = context === ReactReduxContext ? useDefaultReduxContext : function () {\n    return useContext(context);\n  };\n  return function useStore() {\n    var _useReduxContext = useReduxContext(),\n        store = _useReduxContext.store;\n\n    return store;\n  };\n}\n/**\r\n * A hook to access the redux store.\r\n *\r\n * @returns {any} the redux store\r\n *\r\n * @example\r\n *\r\n * import React from 'react'\r\n * import { useStore } from 'react-redux'\r\n *\r\n * export const ExampleComponent = () => {\r\n *   const store = useStore()\r\n *   return <div>{store.getState()}</div>\r\n * }\r\n */\n\nexport var useStore = /*#__PURE__*/createStoreHook();","import { ReactReduxContext } from '../components/Context';\nimport { useStore as useDefaultStore, createStoreHook } from './useStore';\n/**\r\n * Hook factory, which creates a `useDispatch` hook bound to a given context.\r\n *\r\n * @param {React.Context} [context=ReactReduxContext] Context passed to your `<Provider>`.\r\n * @returns {Function} A `useDispatch` hook bound to the specified context.\r\n */\n\nexport function createDispatchHook(context) {\n  if (context === void 0) {\n    context = ReactReduxContext;\n  }\n\n  var useStore = context === ReactReduxContext ? useDefaultStore : createStoreHook(context);\n  return function useDispatch() {\n    var store = useStore();\n    return store.dispatch;\n  };\n}\n/**\r\n * A hook to access the redux `dispatch` function.\r\n *\r\n * @returns {any|function} redux store's `dispatch` function\r\n *\r\n * @example\r\n *\r\n * import React, { useCallback } from 'react'\r\n * import { useDispatch } from 'react-redux'\r\n *\r\n * export const CounterComponent = ({ value }) => {\r\n *   const dispatch = useDispatch()\r\n *   const increaseCounter = useCallback(() => dispatch({ type: 'increase-counter' }), [])\r\n *   return (\r\n *     <div>\r\n *       <span>{value}</span>\r\n *       <button onClick={increaseCounter}>Increase counter</button>\r\n *     </div>\r\n *   )\r\n * }\r\n */\n\nexport var useDispatch = /*#__PURE__*/createDispatchHook();","import { useReducer, useRef, useMemo, useContext, useDebugValue } from 'react';\nimport { useReduxContext as useDefaultReduxContext } from './useReduxContext';\nimport Subscription from '../utils/Subscription';\nimport { useIsomorphicLayoutEffect } from '../utils/useIsomorphicLayoutEffect';\nimport { ReactReduxContext } from '../components/Context';\n\nvar refEquality = function refEquality(a, b) {\n  return a === b;\n};\n\nfunction useSelectorWithStoreAndSubscription(selector, equalityFn, store, contextSub) {\n  var _useReducer = useReducer(function (s) {\n    return s + 1;\n  }, 0),\n      forceRender = _useReducer[1];\n\n  var subscription = useMemo(function () {\n    return new Subscription(store, contextSub);\n  }, [store, contextSub]);\n  var latestSubscriptionCallbackError = useRef();\n  var latestSelector = useRef();\n  var latestStoreState = useRef();\n  var latestSelectedState = useRef();\n  var storeState = store.getState();\n  var selectedState;\n\n  try {\n    if (selector !== latestSelector.current || storeState !== latestStoreState.current || latestSubscriptionCallbackError.current) {\n      var newSelectedState = selector(storeState); // ensure latest selected state is reused so that a custom equality function can result in identical references\n\n      if (latestSelectedState.current === undefined || !equalityFn(newSelectedState, latestSelectedState.current)) {\n        selectedState = newSelectedState;\n      } else {\n        selectedState = latestSelectedState.current;\n      }\n    } else {\n      selectedState = latestSelectedState.current;\n    }\n  } catch (err) {\n    if (latestSubscriptionCallbackError.current) {\n      err.message += \"\\nThe error may be correlated with this previous error:\\n\" + latestSubscriptionCallbackError.current.stack + \"\\n\\n\";\n    }\n\n    throw err;\n  }\n\n  useIsomorphicLayoutEffect(function () {\n    latestSelector.current = selector;\n    latestStoreState.current = storeState;\n    latestSelectedState.current = selectedState;\n    latestSubscriptionCallbackError.current = undefined;\n  });\n  useIsomorphicLayoutEffect(function () {\n    function checkForUpdates() {\n      try {\n        var newStoreState = store.getState();\n\n        var _newSelectedState = latestSelector.current(newStoreState);\n\n        if (equalityFn(_newSelectedState, latestSelectedState.current)) {\n          return;\n        }\n\n        latestSelectedState.current = _newSelectedState;\n        latestStoreState.current = newStoreState;\n      } catch (err) {\n        // we ignore all errors here, since when the component\n        // is re-rendered, the selectors are called again, and\n        // will throw again, if neither props nor store state\n        // changed\n        latestSubscriptionCallbackError.current = err;\n      }\n\n      forceRender();\n    }\n\n    subscription.onStateChange = checkForUpdates;\n    subscription.trySubscribe();\n    checkForUpdates();\n    return function () {\n      return subscription.tryUnsubscribe();\n    };\n  }, [store, subscription]);\n  return selectedState;\n}\n/**\r\n * Hook factory, which creates a `useSelector` hook bound to a given context.\r\n *\r\n * @param {React.Context} [context=ReactReduxContext] Context passed to your `<Provider>`.\r\n * @returns {Function} A `useSelector` hook bound to the specified context.\r\n */\n\n\nexport function createSelectorHook(context) {\n  if (context === void 0) {\n    context = ReactReduxContext;\n  }\n\n  var useReduxContext = context === ReactReduxContext ? useDefaultReduxContext : function () {\n    return useContext(context);\n  };\n  return function useSelector(selector, equalityFn) {\n    if (equalityFn === void 0) {\n      equalityFn = refEquality;\n    }\n\n    if (process.env.NODE_ENV !== 'production') {\n      if (!selector) {\n        throw new Error(\"You must pass a selector to useSelector\");\n      }\n\n      if (typeof selector !== 'function') {\n        throw new Error(\"You must pass a function as a selector to useSelector\");\n      }\n\n      if (typeof equalityFn !== 'function') {\n        throw new Error(\"You must pass a function as an equality function to useSelector\");\n      }\n    }\n\n    var _useReduxContext = useReduxContext(),\n        store = _useReduxContext.store,\n        contextSub = _useReduxContext.subscription;\n\n    var selectedState = useSelectorWithStoreAndSubscription(selector, equalityFn, store, contextSub);\n    useDebugValue(selectedState);\n    return selectedState;\n  };\n}\n/**\r\n * A hook to access the redux store's state. This hook takes a selector function\r\n * as an argument. The selector is called with the store state.\r\n *\r\n * This hook takes an optional equality comparison function as the second parameter\r\n * that allows you to customize the way the selected state is compared to determine\r\n * whether the component needs to be re-rendered.\r\n *\r\n * @param {Function} selector the selector function\r\n * @param {Function=} equalityFn the function that will be used to determine equality\r\n *\r\n * @returns {any} the selected state\r\n *\r\n * @example\r\n *\r\n * import React from 'react'\r\n * import { useSelector } from 'react-redux'\r\n *\r\n * export const CounterComponent = () => {\r\n *   const counter = useSelector(state => state.counter)\r\n *   return <div>{counter}</div>\r\n * }\r\n */\n\nexport var useSelector = /*#__PURE__*/createSelectorHook();","import Provider from './components/Provider';\nimport connectAdvanced from './components/connectAdvanced';\nimport { ReactReduxContext } from './components/Context';\nimport connect from './connect/connect';\nimport { useDispatch, createDispatchHook } from './hooks/useDispatch';\nimport { useSelector, createSelectorHook } from './hooks/useSelector';\nimport { useStore, createStoreHook } from './hooks/useStore';\nimport { setBatch } from './utils/batch';\nimport { unstable_batchedUpdates as batch } from './utils/reactBatchedUpdates';\nimport shallowEqual from './utils/shallowEqual';\nsetBatch(batch);\nexport { Provider, connectAdvanced, ReactReduxContext, connect, batch, useDispatch, createDispatchHook, useSelector, createSelectorHook, useStore, createStoreHook, shallowEqual };","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.autoprefix = undefined;\n\nvar _forOwn2 = require('lodash/forOwn');\n\nvar _forOwn3 = _interopRequireDefault(_forOwn2);\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar transforms = {\n  borderRadius: function borderRadius(value) {\n    return {\n      msBorderRadius: value,\n      MozBorderRadius: value,\n      OBorderRadius: value,\n      WebkitBorderRadius: value,\n      borderRadius: value\n    };\n  },\n  boxShadow: function boxShadow(value) {\n    return {\n      msBoxShadow: value,\n      MozBoxShadow: value,\n      OBoxShadow: value,\n      WebkitBoxShadow: value,\n      boxShadow: value\n    };\n  },\n  userSelect: function userSelect(value) {\n    return {\n      WebkitTouchCallout: value,\n      KhtmlUserSelect: value,\n      MozUserSelect: value,\n      msUserSelect: value,\n      WebkitUserSelect: value,\n      userSelect: value\n    };\n  },\n\n  flex: function flex(value) {\n    return {\n      WebkitBoxFlex: value,\n      MozBoxFlex: value,\n      WebkitFlex: value,\n      msFlex: value,\n      flex: value\n    };\n  },\n  flexBasis: function flexBasis(value) {\n    return {\n      WebkitFlexBasis: value,\n      flexBasis: value\n    };\n  },\n  justifyContent: function justifyContent(value) {\n    return {\n      WebkitJustifyContent: value,\n      justifyContent: value\n    };\n  },\n\n  transition: function transition(value) {\n    return {\n      msTransition: value,\n      MozTransition: value,\n      OTransition: value,\n      WebkitTransition: value,\n      transition: value\n    };\n  },\n\n  transform: function transform(value) {\n    return {\n      msTransform: value,\n      MozTransform: value,\n      OTransform: value,\n      WebkitTransform: value,\n      transform: value\n    };\n  },\n  absolute: function absolute(value) {\n    var direction = value && value.split(' ');\n    return {\n      position: 'absolute',\n      top: direction && direction[0],\n      right: direction && direction[1],\n      bottom: direction && direction[2],\n      left: direction && direction[3]\n    };\n  },\n  extend: function extend(name, otherElementStyles) {\n    var otherStyle = otherElementStyles[name];\n    if (otherStyle) {\n      return otherStyle;\n    }\n    return {\n      'extend': name\n    };\n  }\n};\n\nvar autoprefix = exports.autoprefix = function autoprefix(elements) {\n  var prefixed = {};\n  (0, _forOwn3.default)(elements, function (styles, element) {\n    var expanded = {};\n    (0, _forOwn3.default)(styles, function (value, key) {\n      var transform = transforms[key];\n      if (transform) {\n        expanded = _extends({}, expanded, transform(value));\n      } else {\n        expanded[key] = value;\n      }\n    });\n    prefixed[element] = expanded;\n  });\n  return prefixed;\n};\n\nexports.default = autoprefix;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.active = undefined;\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\nvar active = exports.active = function active(Component) {\n  var Span = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'span';\n\n  return function (_React$Component) {\n    _inherits(Active, _React$Component);\n\n    function Active() {\n      var _ref;\n\n      var _temp, _this, _ret;\n\n      _classCallCheck(this, Active);\n\n      for (var _len = arguments.length, args = Array(_len), _key = 0; _key < _len; _key++) {\n        args[_key] = arguments[_key];\n      }\n\n      return _ret = (_temp = (_this = _possibleConstructorReturn(this, (_ref = Active.__proto__ || Object.getPrototypeOf(Active)).call.apply(_ref, [this].concat(args))), _this), _this.state = { active: false }, _this.handleMouseDown = function () {\n        return _this.setState({ active: true });\n      }, _this.handleMouseUp = function () {\n        return _this.setState({ active: false });\n      }, _this.render = function () {\n        return _react2.default.createElement(\n          Span,\n          { onMouseDown: _this.handleMouseDown, onMouseUp: _this.handleMouseUp },\n          _react2.default.createElement(Component, _extends({}, _this.props, _this.state))\n        );\n      }, _temp), _possibleConstructorReturn(_this, _ret);\n    }\n\n    return Active;\n  }(_react2.default.Component);\n};\n\nexports.default = active;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.hover = undefined;\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\nvar hover = exports.hover = function hover(Component) {\n  var Span = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'span';\n\n  return function (_React$Component) {\n    _inherits(Hover, _React$Component);\n\n    function Hover() {\n      var _ref;\n\n      var _temp, _this, _ret;\n\n      _classCallCheck(this, Hover);\n\n      for (var _len = arguments.length, args = Array(_len), _key = 0; _key < _len; _key++) {\n        args[_key] = arguments[_key];\n      }\n\n      return _ret = (_temp = (_this = _possibleConstructorReturn(this, (_ref = Hover.__proto__ || Object.getPrototypeOf(Hover)).call.apply(_ref, [this].concat(args))), _this), _this.state = { hover: false }, _this.handleMouseOver = function () {\n        return _this.setState({ hover: true });\n      }, _this.handleMouseOut = function () {\n        return _this.setState({ hover: false });\n      }, _this.render = function () {\n        return _react2.default.createElement(\n          Span,\n          { onMouseOver: _this.handleMouseOver, onMouseOut: _this.handleMouseOut },\n          _react2.default.createElement(Component, _extends({}, _this.props, _this.state))\n        );\n      }, _temp), _possibleConstructorReturn(_this, _ret);\n    }\n\n    return Hover;\n  }(_react2.default.Component);\n};\n\nexports.default = hover;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.flattenNames = undefined;\n\nvar _isString2 = require('lodash/isString');\n\nvar _isString3 = _interopRequireDefault(_isString2);\n\nvar _forOwn2 = require('lodash/forOwn');\n\nvar _forOwn3 = _interopRequireDefault(_forOwn2);\n\nvar _isPlainObject2 = require('lodash/isPlainObject');\n\nvar _isPlainObject3 = _interopRequireDefault(_isPlainObject2);\n\nvar _map2 = require('lodash/map');\n\nvar _map3 = _interopRequireDefault(_map2);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar flattenNames = exports.flattenNames = function flattenNames() {\n  var things = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];\n\n  var names = [];\n\n  (0, _map3.default)(things, function (thing) {\n    if (Array.isArray(thing)) {\n      flattenNames(thing).map(function (name) {\n        return names.push(name);\n      });\n    } else if ((0, _isPlainObject3.default)(thing)) {\n      (0, _forOwn3.default)(thing, function (value, key) {\n        value === true && names.push(key);\n        names.push(key + '-' + value);\n      });\n    } else if ((0, _isString3.default)(thing)) {\n      names.push(thing);\n    }\n  });\n\n  return names;\n};\n\nexports.default = flattenNames;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ReactCSS = exports.loop = exports.handleActive = exports.handleHover = exports.hover = undefined;\n\nvar _flattenNames = require('./flattenNames');\n\nvar _flattenNames2 = _interopRequireDefault(_flattenNames);\n\nvar _mergeClasses = require('./mergeClasses');\n\nvar _mergeClasses2 = _interopRequireDefault(_mergeClasses);\n\nvar _autoprefix = require('./autoprefix');\n\nvar _autoprefix2 = _interopRequireDefault(_autoprefix);\n\nvar _hover2 = require('./components/hover');\n\nvar _hover3 = _interopRequireDefault(_hover2);\n\nvar _active = require('./components/active');\n\nvar _active2 = _interopRequireDefault(_active);\n\nvar _loop2 = require('./loop');\n\nvar _loop3 = _interopRequireDefault(_loop2);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nexports.hover = _hover3.default;\nexports.handleHover = _hover3.default;\nexports.handleActive = _active2.default;\nexports.loop = _loop3.default;\nvar ReactCSS = exports.ReactCSS = function ReactCSS(classes) {\n  for (var _len = arguments.length, activations = Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    activations[_key - 1] = arguments[_key];\n  }\n\n  var activeNames = (0, _flattenNames2.default)(activations);\n  var merged = (0, _mergeClasses2.default)(classes, activeNames);\n  return (0, _autoprefix2.default)(merged);\n};\n\nexports.default = ReactCSS;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nvar loopable = function loopable(i, length) {\n  var props = {};\n  var setProp = function setProp(name) {\n    var value = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;\n\n    props[name] = value;\n  };\n\n  i === 0 && setProp('first-child');\n  i === length - 1 && setProp('last-child');\n  (i === 0 || i % 2 === 0) && setProp('even');\n  Math.abs(i % 2) === 1 && setProp('odd');\n  setProp('nth-child', i);\n\n  return props;\n};\n\nexports.default = loopable;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.mergeClasses = undefined;\n\nvar _forOwn2 = require('lodash/forOwn');\n\nvar _forOwn3 = _interopRequireDefault(_forOwn2);\n\nvar _cloneDeep2 = require('lodash/cloneDeep');\n\nvar _cloneDeep3 = _interopRequireDefault(_cloneDeep2);\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar mergeClasses = exports.mergeClasses = function mergeClasses(classes) {\n  var activeNames = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];\n\n  var styles = classes.default && (0, _cloneDeep3.default)(classes.default) || {};\n  activeNames.map(function (name) {\n    var toMerge = classes[name];\n    if (toMerge) {\n      (0, _forOwn3.default)(toMerge, function (value, key) {\n        if (!styles[key]) {\n          styles[key] = {};\n        }\n\n        styles[key] = _extends({}, styles[key], toMerge[key]);\n      });\n    }\n\n    return name;\n  });\n  return styles;\n};\n\nexports.default = mergeClasses;","(function (global, undefined) {\n    \"use strict\";\n\n    if (global.setImmediate) {\n        return;\n    }\n\n    var nextHandle = 1; // Spec says greater than zero\n    var tasksByHandle = {};\n    var currentlyRunningATask = false;\n    var doc = global.document;\n    var registerImmediate;\n\n    function setImmediate(callback) {\n      // Callback can either be a function or a string\n      if (typeof callback !== \"function\") {\n        callback = new Function(\"\" + callback);\n      }\n      // Copy function arguments\n      var args = new Array(arguments.length - 1);\n      for (var i = 0; i < args.length; i++) {\n          args[i] = arguments[i + 1];\n      }\n      // Store and register the task\n      var task = { callback: callback, args: args };\n      tasksByHandle[nextHandle] = task;\n      registerImmediate(nextHandle);\n      return nextHandle++;\n    }\n\n    function clearImmediate(handle) {\n        delete tasksByHandle[handle];\n    }\n\n    function run(task) {\n        var callback = task.callback;\n        var args = task.args;\n        switch (args.length) {\n        case 0:\n            callback();\n            break;\n        case 1:\n            callback(args[0]);\n            break;\n        case 2:\n            callback(args[0], args[1]);\n            break;\n        case 3:\n            callback(args[0], args[1], args[2]);\n            break;\n        default:\n            callback.apply(undefined, args);\n            break;\n        }\n    }\n\n    function runIfPresent(handle) {\n        // From the spec: \"Wait until any invocations of this algorithm started before this one have completed.\"\n        // So if we're currently running a task, we'll need to delay this invocation.\n        if (currentlyRunningATask) {\n            // Delay by doing a setTimeout. setImmediate was tried instead, but in Firefox 7 it generated a\n            // \"too much recursion\" error.\n            setTimeout(runIfPresent, 0, handle);\n        } else {\n            var task = tasksByHandle[handle];\n            if (task) {\n                currentlyRunningATask = true;\n                try {\n                    run(task);\n                } finally {\n                    clearImmediate(handle);\n                    currentlyRunningATask = false;\n                }\n            }\n        }\n    }\n\n    function installNextTickImplementation() {\n        registerImmediate = function(handle) {\n            process.nextTick(function () { runIfPresent(handle); });\n        };\n    }\n\n    function canUsePostMessage() {\n        // The test against `importScripts` prevents this implementation from being installed inside a web worker,\n        // where `global.postMessage` means something completely different and can't be used for this purpose.\n        if (global.postMessage && !global.importScripts) {\n            var postMessageIsAsynchronous = true;\n            var oldOnMessage = global.onmessage;\n            global.onmessage = function() {\n                postMessageIsAsynchronous = false;\n            };\n            global.postMessage(\"\", \"*\");\n            global.onmessage = oldOnMessage;\n            return postMessageIsAsynchronous;\n        }\n    }\n\n    function installPostMessageImplementation() {\n        // Installs an event handler on `global` for the `message` event: see\n        // * https://developer.mozilla.org/en/DOM/window.postMessage\n        // * http://www.whatwg.org/specs/web-apps/current-work/multipage/comms.html#crossDocumentMessages\n\n        var messagePrefix = \"setImmediate$\" + Math.random() + \"$\";\n        var onGlobalMessage = function(event) {\n            if (event.source === global &&\n                typeof event.data === \"string\" &&\n                event.data.indexOf(messagePrefix) === 0) {\n                runIfPresent(+event.data.slice(messagePrefix.length));\n            }\n        };\n\n        if (global.addEventListener) {\n            global.addEventListener(\"message\", onGlobalMessage, false);\n        } else {\n            global.attachEvent(\"onmessage\", onGlobalMessage);\n        }\n\n        registerImmediate = function(handle) {\n            global.postMessage(messagePrefix + handle, \"*\");\n        };\n    }\n\n    function installMessageChannelImplementation() {\n        var channel = new MessageChannel();\n        channel.port1.onmessage = function(event) {\n            var handle = event.data;\n            runIfPresent(handle);\n        };\n\n        registerImmediate = function(handle) {\n            channel.port2.postMessage(handle);\n        };\n    }\n\n    function installReadyStateChangeImplementation() {\n        var html = doc.documentElement;\n        registerImmediate = function(handle) {\n            // Create a <script> element; its readystatechange event will be fired asynchronously once it is inserted\n            // into the document. Do so, thus queuing up the task. Remember to clean up once it's been called.\n            var script = doc.createElement(\"script\");\n            script.onreadystatechange = function () {\n                runIfPresent(handle);\n                script.onreadystatechange = null;\n                html.removeChild(script);\n                script = null;\n            };\n            html.appendChild(script);\n        };\n    }\n\n    function installSetTimeoutImplementation() {\n        registerImmediate = function(handle) {\n            setTimeout(runIfPresent, 0, handle);\n        };\n    }\n\n    // If supported, we should attach to the prototype of global, since that is where setTimeout et al. live.\n    var attachTo = Object.getPrototypeOf && Object.getPrototypeOf(global);\n    attachTo = attachTo && attachTo.setTimeout ? attachTo : global;\n\n    // Don't get fooled by e.g. browserify environments.\n    if ({}.toString.call(global.process) === \"[object process]\") {\n        // For Node.js before 0.9\n        installNextTickImplementation();\n\n    } else if (canUsePostMessage()) {\n        // For non-IE10 modern browsers\n        installPostMessageImplementation();\n\n    } else if (global.MessageChannel) {\n        // For web workers, where supported\n        installMessageChannelImplementation();\n\n    } else if (doc && \"onreadystatechange\" in doc.createElement(\"script\")) {\n        // For IE 6–8\n        installReadyStateChangeImplementation();\n\n    } else {\n        // For older browsers\n        installSetTimeoutImplementation();\n    }\n\n    attachTo.setImmediate = setImmediate;\n    attachTo.clearImmediate = clearImmediate;\n}(typeof self === \"undefined\" ? typeof global === \"undefined\" ? this : global : self));\n","// TinyColor v1.4.1\n// https://github.com/bgrins/TinyColor\n// Brian Grinstead, MIT License\n\n(function(Math) {\n\nvar trimLeft = /^\\s+/,\n    trimRight = /\\s+$/,\n    tinyCounter = 0,\n    mathRound = Math.round,\n    mathMin = Math.min,\n    mathMax = Math.max,\n    mathRandom = Math.random;\n\nfunction tinycolor (color, opts) {\n\n    color = (color) ? color : '';\n    opts = opts || { };\n\n    // If input is already a tinycolor, return itself\n    if (color instanceof tinycolor) {\n       return color;\n    }\n    // If we are called as a function, call using new instead\n    if (!(this instanceof tinycolor)) {\n        return new tinycolor(color, opts);\n    }\n\n    var rgb = inputToRGB(color);\n    this._originalInput = color,\n    this._r = rgb.r,\n    this._g = rgb.g,\n    this._b = rgb.b,\n    this._a = rgb.a,\n    this._roundA = mathRound(100*this._a) / 100,\n    this._format = opts.format || rgb.format;\n    this._gradientType = opts.gradientType;\n\n    // Don't let the range of [0,255] come back in [0,1].\n    // Potentially lose a little bit of precision here, but will fix issues where\n    // .5 gets interpreted as half of the total, instead of half of 1\n    // If it was supposed to be 128, this was already taken care of by `inputToRgb`\n    if (this._r < 1) { this._r = mathRound(this._r); }\n    if (this._g < 1) { this._g = mathRound(this._g); }\n    if (this._b < 1) { this._b = mathRound(this._b); }\n\n    this._ok = rgb.ok;\n    this._tc_id = tinyCounter++;\n}\n\ntinycolor.prototype = {\n    isDark: function() {\n        return this.getBrightness() < 128;\n    },\n    isLight: function() {\n        return !this.isDark();\n    },\n    isValid: function() {\n        return this._ok;\n    },\n    getOriginalInput: function() {\n      return this._originalInput;\n    },\n    getFormat: function() {\n        return this._format;\n    },\n    getAlpha: function() {\n        return this._a;\n    },\n    getBrightness: function() {\n        //http://www.w3.org/TR/AERT#color-contrast\n        var rgb = this.toRgb();\n        return (rgb.r * 299 + rgb.g * 587 + rgb.b * 114) / 1000;\n    },\n    getLuminance: function() {\n        //http://www.w3.org/TR/2008/REC-WCAG20-20081211/#relativeluminancedef\n        var rgb = this.toRgb();\n        var RsRGB, GsRGB, BsRGB, R, G, B;\n        RsRGB = rgb.r/255;\n        GsRGB = rgb.g/255;\n        BsRGB = rgb.b/255;\n\n        if (RsRGB <= 0.03928) {R = RsRGB / 12.92;} else {R = Math.pow(((RsRGB + 0.055) / 1.055), 2.4);}\n        if (GsRGB <= 0.03928) {G = GsRGB / 12.92;} else {G = Math.pow(((GsRGB + 0.055) / 1.055), 2.4);}\n        if (BsRGB <= 0.03928) {B = BsRGB / 12.92;} else {B = Math.pow(((BsRGB + 0.055) / 1.055), 2.4);}\n        return (0.2126 * R) + (0.7152 * G) + (0.0722 * B);\n    },\n    setAlpha: function(value) {\n        this._a = boundAlpha(value);\n        this._roundA = mathRound(100*this._a) / 100;\n        return this;\n    },\n    toHsv: function() {\n        var hsv = rgbToHsv(this._r, this._g, this._b);\n        return { h: hsv.h * 360, s: hsv.s, v: hsv.v, a: this._a };\n    },\n    toHsvString: function() {\n        var hsv = rgbToHsv(this._r, this._g, this._b);\n        var h = mathRound(hsv.h * 360), s = mathRound(hsv.s * 100), v = mathRound(hsv.v * 100);\n        return (this._a == 1) ?\n          \"hsv(\"  + h + \", \" + s + \"%, \" + v + \"%)\" :\n          \"hsva(\" + h + \", \" + s + \"%, \" + v + \"%, \"+ this._roundA + \")\";\n    },\n    toHsl: function() {\n        var hsl = rgbToHsl(this._r, this._g, this._b);\n        return { h: hsl.h * 360, s: hsl.s, l: hsl.l, a: this._a };\n    },\n    toHslString: function() {\n        var hsl = rgbToHsl(this._r, this._g, this._b);\n        var h = mathRound(hsl.h * 360), s = mathRound(hsl.s * 100), l = mathRound(hsl.l * 100);\n        return (this._a == 1) ?\n          \"hsl(\"  + h + \", \" + s + \"%, \" + l + \"%)\" :\n          \"hsla(\" + h + \", \" + s + \"%, \" + l + \"%, \"+ this._roundA + \")\";\n    },\n    toHex: function(allow3Char) {\n        return rgbToHex(this._r, this._g, this._b, allow3Char);\n    },\n    toHexString: function(allow3Char) {\n        return '#' + this.toHex(allow3Char);\n    },\n    toHex8: function(allow4Char) {\n        return rgbaToHex(this._r, this._g, this._b, this._a, allow4Char);\n    },\n    toHex8String: function(allow4Char) {\n        return '#' + this.toHex8(allow4Char);\n    },\n    toRgb: function() {\n        return { r: mathRound(this._r), g: mathRound(this._g), b: mathRound(this._b), a: this._a };\n    },\n    toRgbString: function() {\n        return (this._a == 1) ?\n          \"rgb(\"  + mathRound(this._r) + \", \" + mathRound(this._g) + \", \" + mathRound(this._b) + \")\" :\n          \"rgba(\" + mathRound(this._r) + \", \" + mathRound(this._g) + \", \" + mathRound(this._b) + \", \" + this._roundA + \")\";\n    },\n    toPercentageRgb: function() {\n        return { r: mathRound(bound01(this._r, 255) * 100) + \"%\", g: mathRound(bound01(this._g, 255) * 100) + \"%\", b: mathRound(bound01(this._b, 255) * 100) + \"%\", a: this._a };\n    },\n    toPercentageRgbString: function() {\n        return (this._a == 1) ?\n          \"rgb(\"  + mathRound(bound01(this._r, 255) * 100) + \"%, \" + mathRound(bound01(this._g, 255) * 100) + \"%, \" + mathRound(bound01(this._b, 255) * 100) + \"%)\" :\n          \"rgba(\" + mathRound(bound01(this._r, 255) * 100) + \"%, \" + mathRound(bound01(this._g, 255) * 100) + \"%, \" + mathRound(bound01(this._b, 255) * 100) + \"%, \" + this._roundA + \")\";\n    },\n    toName: function() {\n        if (this._a === 0) {\n            return \"transparent\";\n        }\n\n        if (this._a < 1) {\n            return false;\n        }\n\n        return hexNames[rgbToHex(this._r, this._g, this._b, true)] || false;\n    },\n    toFilter: function(secondColor) {\n        var hex8String = '#' + rgbaToArgbHex(this._r, this._g, this._b, this._a);\n        var secondHex8String = hex8String;\n        var gradientType = this._gradientType ? \"GradientType = 1, \" : \"\";\n\n        if (secondColor) {\n            var s = tinycolor(secondColor);\n            secondHex8String = '#' + rgbaToArgbHex(s._r, s._g, s._b, s._a);\n        }\n\n        return \"progid:DXImageTransform.Microsoft.gradient(\"+gradientType+\"startColorstr=\"+hex8String+\",endColorstr=\"+secondHex8String+\")\";\n    },\n    toString: function(format) {\n        var formatSet = !!format;\n        format = format || this._format;\n\n        var formattedString = false;\n        var hasAlpha = this._a < 1 && this._a >= 0;\n        var needsAlphaFormat = !formatSet && hasAlpha && (format === \"hex\" || format === \"hex6\" || format === \"hex3\" || format === \"hex4\" || format === \"hex8\" || format === \"name\");\n\n        if (needsAlphaFormat) {\n            // Special case for \"transparent\", all other non-alpha formats\n            // will return rgba when there is transparency.\n            if (format === \"name\" && this._a === 0) {\n                return this.toName();\n            }\n            return this.toRgbString();\n        }\n        if (format === \"rgb\") {\n            formattedString = this.toRgbString();\n        }\n        if (format === \"prgb\") {\n            formattedString = this.toPercentageRgbString();\n        }\n        if (format === \"hex\" || format === \"hex6\") {\n            formattedString = this.toHexString();\n        }\n        if (format === \"hex3\") {\n            formattedString = this.toHexString(true);\n        }\n        if (format === \"hex4\") {\n            formattedString = this.toHex8String(true);\n        }\n        if (format === \"hex8\") {\n            formattedString = this.toHex8String();\n        }\n        if (format === \"name\") {\n            formattedString = this.toName();\n        }\n        if (format === \"hsl\") {\n            formattedString = this.toHslString();\n        }\n        if (format === \"hsv\") {\n            formattedString = this.toHsvString();\n        }\n\n        return formattedString || this.toHexString();\n    },\n    clone: function() {\n        return tinycolor(this.toString());\n    },\n\n    _applyModification: function(fn, args) {\n        var color = fn.apply(null, [this].concat([].slice.call(args)));\n        this._r = color._r;\n        this._g = color._g;\n        this._b = color._b;\n        this.setAlpha(color._a);\n        return this;\n    },\n    lighten: function() {\n        return this._applyModification(lighten, arguments);\n    },\n    brighten: function() {\n        return this._applyModification(brighten, arguments);\n    },\n    darken: function() {\n        return this._applyModification(darken, arguments);\n    },\n    desaturate: function() {\n        return this._applyModification(desaturate, arguments);\n    },\n    saturate: function() {\n        return this._applyModification(saturate, arguments);\n    },\n    greyscale: function() {\n        return this._applyModification(greyscale, arguments);\n    },\n    spin: function() {\n        return this._applyModification(spin, arguments);\n    },\n\n    _applyCombination: function(fn, args) {\n        return fn.apply(null, [this].concat([].slice.call(args)));\n    },\n    analogous: function() {\n        return this._applyCombination(analogous, arguments);\n    },\n    complement: function() {\n        return this._applyCombination(complement, arguments);\n    },\n    monochromatic: function() {\n        return this._applyCombination(monochromatic, arguments);\n    },\n    splitcomplement: function() {\n        return this._applyCombination(splitcomplement, arguments);\n    },\n    triad: function() {\n        return this._applyCombination(triad, arguments);\n    },\n    tetrad: function() {\n        return this._applyCombination(tetrad, arguments);\n    }\n};\n\n// If input is an object, force 1 into \"1.0\" to handle ratios properly\n// String input requires \"1.0\" as input, so 1 will be treated as 1\ntinycolor.fromRatio = function(color, opts) {\n    if (typeof color == \"object\") {\n        var newColor = {};\n        for (var i in color) {\n            if (color.hasOwnProperty(i)) {\n                if (i === \"a\") {\n                    newColor[i] = color[i];\n                }\n                else {\n                    newColor[i] = convertToPercentage(color[i]);\n                }\n            }\n        }\n        color = newColor;\n    }\n\n    return tinycolor(color, opts);\n};\n\n// Given a string or object, convert that input to RGB\n// Possible string inputs:\n//\n//     \"red\"\n//     \"#f00\" or \"f00\"\n//     \"#ff0000\" or \"ff0000\"\n//     \"#ff000000\" or \"ff000000\"\n//     \"rgb 255 0 0\" or \"rgb (255, 0, 0)\"\n//     \"rgb 1.0 0 0\" or \"rgb (1, 0, 0)\"\n//     \"rgba (255, 0, 0, 1)\" or \"rgba 255, 0, 0, 1\"\n//     \"rgba (1.0, 0, 0, 1)\" or \"rgba 1.0, 0, 0, 1\"\n//     \"hsl(0, 100%, 50%)\" or \"hsl 0 100% 50%\"\n//     \"hsla(0, 100%, 50%, 1)\" or \"hsla 0 100% 50%, 1\"\n//     \"hsv(0, 100%, 100%)\" or \"hsv 0 100% 100%\"\n//\nfunction inputToRGB(color) {\n\n    var rgb = { r: 0, g: 0, b: 0 };\n    var a = 1;\n    var s = null;\n    var v = null;\n    var l = null;\n    var ok = false;\n    var format = false;\n\n    if (typeof color == \"string\") {\n        color = stringInputToObject(color);\n    }\n\n    if (typeof color == \"object\") {\n        if (isValidCSSUnit(color.r) && isValidCSSUnit(color.g) && isValidCSSUnit(color.b)) {\n            rgb = rgbToRgb(color.r, color.g, color.b);\n            ok = true;\n            format = String(color.r).substr(-1) === \"%\" ? \"prgb\" : \"rgb\";\n        }\n        else if (isValidCSSUnit(color.h) && isValidCSSUnit(color.s) && isValidCSSUnit(color.v)) {\n            s = convertToPercentage(color.s);\n            v = convertToPercentage(color.v);\n            rgb = hsvToRgb(color.h, s, v);\n            ok = true;\n            format = \"hsv\";\n        }\n        else if (isValidCSSUnit(color.h) && isValidCSSUnit(color.s) && isValidCSSUnit(color.l)) {\n            s = convertToPercentage(color.s);\n            l = convertToPercentage(color.l);\n            rgb = hslToRgb(color.h, s, l);\n            ok = true;\n            format = \"hsl\";\n        }\n\n        if (color.hasOwnProperty(\"a\")) {\n            a = color.a;\n        }\n    }\n\n    a = boundAlpha(a);\n\n    return {\n        ok: ok,\n        format: color.format || format,\n        r: mathMin(255, mathMax(rgb.r, 0)),\n        g: mathMin(255, mathMax(rgb.g, 0)),\n        b: mathMin(255, mathMax(rgb.b, 0)),\n        a: a\n    };\n}\n\n\n// Conversion Functions\n// --------------------\n\n// `rgbToHsl`, `rgbToHsv`, `hslToRgb`, `hsvToRgb` modified from:\n// <http://mjijackson.com/2008/02/rgb-to-hsl-and-rgb-to-hsv-color-model-conversion-algorithms-in-javascript>\n\n// `rgbToRgb`\n// Handle bounds / percentage checking to conform to CSS color spec\n// <http://www.w3.org/TR/css3-color/>\n// *Assumes:* r, g, b in [0, 255] or [0, 1]\n// *Returns:* { r, g, b } in [0, 255]\nfunction rgbToRgb(r, g, b){\n    return {\n        r: bound01(r, 255) * 255,\n        g: bound01(g, 255) * 255,\n        b: bound01(b, 255) * 255\n    };\n}\n\n// `rgbToHsl`\n// Converts an RGB color value to HSL.\n// *Assumes:* r, g, and b are contained in [0, 255] or [0, 1]\n// *Returns:* { h, s, l } in [0,1]\nfunction rgbToHsl(r, g, b) {\n\n    r = bound01(r, 255);\n    g = bound01(g, 255);\n    b = bound01(b, 255);\n\n    var max = mathMax(r, g, b), min = mathMin(r, g, b);\n    var h, s, l = (max + min) / 2;\n\n    if(max == min) {\n        h = s = 0; // achromatic\n    }\n    else {\n        var d = max - min;\n        s = l > 0.5 ? d / (2 - max - min) : d / (max + min);\n        switch(max) {\n            case r: h = (g - b) / d + (g < b ? 6 : 0); break;\n            case g: h = (b - r) / d + 2; break;\n            case b: h = (r - g) / d + 4; break;\n        }\n\n        h /= 6;\n    }\n\n    return { h: h, s: s, l: l };\n}\n\n// `hslToRgb`\n// Converts an HSL color value to RGB.\n// *Assumes:* h is contained in [0, 1] or [0, 360] and s and l are contained [0, 1] or [0, 100]\n// *Returns:* { r, g, b } in the set [0, 255]\nfunction hslToRgb(h, s, l) {\n    var r, g, b;\n\n    h = bound01(h, 360);\n    s = bound01(s, 100);\n    l = bound01(l, 100);\n\n    function hue2rgb(p, q, t) {\n        if(t < 0) t += 1;\n        if(t > 1) t -= 1;\n        if(t < 1/6) return p + (q - p) * 6 * t;\n        if(t < 1/2) return q;\n        if(t < 2/3) return p + (q - p) * (2/3 - t) * 6;\n        return p;\n    }\n\n    if(s === 0) {\n        r = g = b = l; // achromatic\n    }\n    else {\n        var q = l < 0.5 ? l * (1 + s) : l + s - l * s;\n        var p = 2 * l - q;\n        r = hue2rgb(p, q, h + 1/3);\n        g = hue2rgb(p, q, h);\n        b = hue2rgb(p, q, h - 1/3);\n    }\n\n    return { r: r * 255, g: g * 255, b: b * 255 };\n}\n\n// `rgbToHsv`\n// Converts an RGB color value to HSV\n// *Assumes:* r, g, and b are contained in the set [0, 255] or [0, 1]\n// *Returns:* { h, s, v } in [0,1]\nfunction rgbToHsv(r, g, b) {\n\n    r = bound01(r, 255);\n    g = bound01(g, 255);\n    b = bound01(b, 255);\n\n    var max = mathMax(r, g, b), min = mathMin(r, g, b);\n    var h, s, v = max;\n\n    var d = max - min;\n    s = max === 0 ? 0 : d / max;\n\n    if(max == min) {\n        h = 0; // achromatic\n    }\n    else {\n        switch(max) {\n            case r: h = (g - b) / d + (g < b ? 6 : 0); break;\n            case g: h = (b - r) / d + 2; break;\n            case b: h = (r - g) / d + 4; break;\n        }\n        h /= 6;\n    }\n    return { h: h, s: s, v: v };\n}\n\n// `hsvToRgb`\n// Converts an HSV color value to RGB.\n// *Assumes:* h is contained in [0, 1] or [0, 360] and s and v are contained in [0, 1] or [0, 100]\n// *Returns:* { r, g, b } in the set [0, 255]\n function hsvToRgb(h, s, v) {\n\n    h = bound01(h, 360) * 6;\n    s = bound01(s, 100);\n    v = bound01(v, 100);\n\n    var i = Math.floor(h),\n        f = h - i,\n        p = v * (1 - s),\n        q = v * (1 - f * s),\n        t = v * (1 - (1 - f) * s),\n        mod = i % 6,\n        r = [v, q, p, p, t, v][mod],\n        g = [t, v, v, q, p, p][mod],\n        b = [p, p, t, v, v, q][mod];\n\n    return { r: r * 255, g: g * 255, b: b * 255 };\n}\n\n// `rgbToHex`\n// Converts an RGB color to hex\n// Assumes r, g, and b are contained in the set [0, 255]\n// Returns a 3 or 6 character hex\nfunction rgbToHex(r, g, b, allow3Char) {\n\n    var hex = [\n        pad2(mathRound(r).toString(16)),\n        pad2(mathRound(g).toString(16)),\n        pad2(mathRound(b).toString(16))\n    ];\n\n    // Return a 3 character hex if possible\n    if (allow3Char && hex[0].charAt(0) == hex[0].charAt(1) && hex[1].charAt(0) == hex[1].charAt(1) && hex[2].charAt(0) == hex[2].charAt(1)) {\n        return hex[0].charAt(0) + hex[1].charAt(0) + hex[2].charAt(0);\n    }\n\n    return hex.join(\"\");\n}\n\n// `rgbaToHex`\n// Converts an RGBA color plus alpha transparency to hex\n// Assumes r, g, b are contained in the set [0, 255] and\n// a in [0, 1]. Returns a 4 or 8 character rgba hex\nfunction rgbaToHex(r, g, b, a, allow4Char) {\n\n    var hex = [\n        pad2(mathRound(r).toString(16)),\n        pad2(mathRound(g).toString(16)),\n        pad2(mathRound(b).toString(16)),\n        pad2(convertDecimalToHex(a))\n    ];\n\n    // Return a 4 character hex if possible\n    if (allow4Char && hex[0].charAt(0) == hex[0].charAt(1) && hex[1].charAt(0) == hex[1].charAt(1) && hex[2].charAt(0) == hex[2].charAt(1) && hex[3].charAt(0) == hex[3].charAt(1)) {\n        return hex[0].charAt(0) + hex[1].charAt(0) + hex[2].charAt(0) + hex[3].charAt(0);\n    }\n\n    return hex.join(\"\");\n}\n\n// `rgbaToArgbHex`\n// Converts an RGBA color to an ARGB Hex8 string\n// Rarely used, but required for \"toFilter()\"\nfunction rgbaToArgbHex(r, g, b, a) {\n\n    var hex = [\n        pad2(convertDecimalToHex(a)),\n        pad2(mathRound(r).toString(16)),\n        pad2(mathRound(g).toString(16)),\n        pad2(mathRound(b).toString(16))\n    ];\n\n    return hex.join(\"\");\n}\n\n// `equals`\n// Can be called with any tinycolor input\ntinycolor.equals = function (color1, color2) {\n    if (!color1 || !color2) { return false; }\n    return tinycolor(color1).toRgbString() == tinycolor(color2).toRgbString();\n};\n\ntinycolor.random = function() {\n    return tinycolor.fromRatio({\n        r: mathRandom(),\n        g: mathRandom(),\n        b: mathRandom()\n    });\n};\n\n\n// Modification Functions\n// ----------------------\n// Thanks to less.js for some of the basics here\n// <https://github.com/cloudhead/less.js/blob/master/lib/less/functions.js>\n\nfunction desaturate(color, amount) {\n    amount = (amount === 0) ? 0 : (amount || 10);\n    var hsl = tinycolor(color).toHsl();\n    hsl.s -= amount / 100;\n    hsl.s = clamp01(hsl.s);\n    return tinycolor(hsl);\n}\n\nfunction saturate(color, amount) {\n    amount = (amount === 0) ? 0 : (amount || 10);\n    var hsl = tinycolor(color).toHsl();\n    hsl.s += amount / 100;\n    hsl.s = clamp01(hsl.s);\n    return tinycolor(hsl);\n}\n\nfunction greyscale(color) {\n    return tinycolor(color).desaturate(100);\n}\n\nfunction lighten (color, amount) {\n    amount = (amount === 0) ? 0 : (amount || 10);\n    var hsl = tinycolor(color).toHsl();\n    hsl.l += amount / 100;\n    hsl.l = clamp01(hsl.l);\n    return tinycolor(hsl);\n}\n\nfunction brighten(color, amount) {\n    amount = (amount === 0) ? 0 : (amount || 10);\n    var rgb = tinycolor(color).toRgb();\n    rgb.r = mathMax(0, mathMin(255, rgb.r - mathRound(255 * - (amount / 100))));\n    rgb.g = mathMax(0, mathMin(255, rgb.g - mathRound(255 * - (amount / 100))));\n    rgb.b = mathMax(0, mathMin(255, rgb.b - mathRound(255 * - (amount / 100))));\n    return tinycolor(rgb);\n}\n\nfunction darken (color, amount) {\n    amount = (amount === 0) ? 0 : (amount || 10);\n    var hsl = tinycolor(color).toHsl();\n    hsl.l -= amount / 100;\n    hsl.l = clamp01(hsl.l);\n    return tinycolor(hsl);\n}\n\n// Spin takes a positive or negative amount within [-360, 360] indicating the change of hue.\n// Values outside of this range will be wrapped into this range.\nfunction spin(color, amount) {\n    var hsl = tinycolor(color).toHsl();\n    var hue = (hsl.h + amount) % 360;\n    hsl.h = hue < 0 ? 360 + hue : hue;\n    return tinycolor(hsl);\n}\n\n// Combination Functions\n// ---------------------\n// Thanks to jQuery xColor for some of the ideas behind these\n// <https://github.com/infusion/jQuery-xcolor/blob/master/jquery.xcolor.js>\n\nfunction complement(color) {\n    var hsl = tinycolor(color).toHsl();\n    hsl.h = (hsl.h + 180) % 360;\n    return tinycolor(hsl);\n}\n\nfunction triad(color) {\n    var hsl = tinycolor(color).toHsl();\n    var h = hsl.h;\n    return [\n        tinycolor(color),\n        tinycolor({ h: (h + 120) % 360, s: hsl.s, l: hsl.l }),\n        tinycolor({ h: (h + 240) % 360, s: hsl.s, l: hsl.l })\n    ];\n}\n\nfunction tetrad(color) {\n    var hsl = tinycolor(color).toHsl();\n    var h = hsl.h;\n    return [\n        tinycolor(color),\n        tinycolor({ h: (h + 90) % 360, s: hsl.s, l: hsl.l }),\n        tinycolor({ h: (h + 180) % 360, s: hsl.s, l: hsl.l }),\n        tinycolor({ h: (h + 270) % 360, s: hsl.s, l: hsl.l })\n    ];\n}\n\nfunction splitcomplement(color) {\n    var hsl = tinycolor(color).toHsl();\n    var h = hsl.h;\n    return [\n        tinycolor(color),\n        tinycolor({ h: (h + 72) % 360, s: hsl.s, l: hsl.l}),\n        tinycolor({ h: (h + 216) % 360, s: hsl.s, l: hsl.l})\n    ];\n}\n\nfunction analogous(color, results, slices) {\n    results = results || 6;\n    slices = slices || 30;\n\n    var hsl = tinycolor(color).toHsl();\n    var part = 360 / slices;\n    var ret = [tinycolor(color)];\n\n    for (hsl.h = ((hsl.h - (part * results >> 1)) + 720) % 360; --results; ) {\n        hsl.h = (hsl.h + part) % 360;\n        ret.push(tinycolor(hsl));\n    }\n    return ret;\n}\n\nfunction monochromatic(color, results) {\n    results = results || 6;\n    var hsv = tinycolor(color).toHsv();\n    var h = hsv.h, s = hsv.s, v = hsv.v;\n    var ret = [];\n    var modification = 1 / results;\n\n    while (results--) {\n        ret.push(tinycolor({ h: h, s: s, v: v}));\n        v = (v + modification) % 1;\n    }\n\n    return ret;\n}\n\n// Utility Functions\n// ---------------------\n\ntinycolor.mix = function(color1, color2, amount) {\n    amount = (amount === 0) ? 0 : (amount || 50);\n\n    var rgb1 = tinycolor(color1).toRgb();\n    var rgb2 = tinycolor(color2).toRgb();\n\n    var p = amount / 100;\n\n    var rgba = {\n        r: ((rgb2.r - rgb1.r) * p) + rgb1.r,\n        g: ((rgb2.g - rgb1.g) * p) + rgb1.g,\n        b: ((rgb2.b - rgb1.b) * p) + rgb1.b,\n        a: ((rgb2.a - rgb1.a) * p) + rgb1.a\n    };\n\n    return tinycolor(rgba);\n};\n\n\n// Readability Functions\n// ---------------------\n// <http://www.w3.org/TR/2008/REC-WCAG20-20081211/#contrast-ratiodef (WCAG Version 2)\n\n// `contrast`\n// Analyze the 2 colors and returns the color contrast defined by (WCAG Version 2)\ntinycolor.readability = function(color1, color2) {\n    var c1 = tinycolor(color1);\n    var c2 = tinycolor(color2);\n    return (Math.max(c1.getLuminance(),c2.getLuminance())+0.05) / (Math.min(c1.getLuminance(),c2.getLuminance())+0.05);\n};\n\n// `isReadable`\n// Ensure that foreground and background color combinations meet WCAG2 guidelines.\n// The third argument is an optional Object.\n//      the 'level' property states 'AA' or 'AAA' - if missing or invalid, it defaults to 'AA';\n//      the 'size' property states 'large' or 'small' - if missing or invalid, it defaults to 'small'.\n// If the entire object is absent, isReadable defaults to {level:\"AA\",size:\"small\"}.\n\n// *Example*\n//    tinycolor.isReadable(\"#000\", \"#111\") => false\n//    tinycolor.isReadable(\"#000\", \"#111\",{level:\"AA\",size:\"large\"}) => false\ntinycolor.isReadable = function(color1, color2, wcag2) {\n    var readability = tinycolor.readability(color1, color2);\n    var wcag2Parms, out;\n\n    out = false;\n\n    wcag2Parms = validateWCAG2Parms(wcag2);\n    switch (wcag2Parms.level + wcag2Parms.size) {\n        case \"AAsmall\":\n        case \"AAAlarge\":\n            out = readability >= 4.5;\n            break;\n        case \"AAlarge\":\n            out = readability >= 3;\n            break;\n        case \"AAAsmall\":\n            out = readability >= 7;\n            break;\n    }\n    return out;\n\n};\n\n// `mostReadable`\n// Given a base color and a list of possible foreground or background\n// colors for that base, returns the most readable color.\n// Optionally returns Black or White if the most readable color is unreadable.\n// *Example*\n//    tinycolor.mostReadable(tinycolor.mostReadable(\"#123\", [\"#124\", \"#125\"],{includeFallbackColors:false}).toHexString(); // \"#112255\"\n//    tinycolor.mostReadable(tinycolor.mostReadable(\"#123\", [\"#124\", \"#125\"],{includeFallbackColors:true}).toHexString();  // \"#ffffff\"\n//    tinycolor.mostReadable(\"#a8015a\", [\"#faf3f3\"],{includeFallbackColors:true,level:\"AAA\",size:\"large\"}).toHexString(); // \"#faf3f3\"\n//    tinycolor.mostReadable(\"#a8015a\", [\"#faf3f3\"],{includeFallbackColors:true,level:\"AAA\",size:\"small\"}).toHexString(); // \"#ffffff\"\ntinycolor.mostReadable = function(baseColor, colorList, args) {\n    var bestColor = null;\n    var bestScore = 0;\n    var readability;\n    var includeFallbackColors, level, size ;\n    args = args || {};\n    includeFallbackColors = args.includeFallbackColors ;\n    level = args.level;\n    size = args.size;\n\n    for (var i= 0; i < colorList.length ; i++) {\n        readability = tinycolor.readability(baseColor, colorList[i]);\n        if (readability > bestScore) {\n            bestScore = readability;\n            bestColor = tinycolor(colorList[i]);\n        }\n    }\n\n    if (tinycolor.isReadable(baseColor, bestColor, {\"level\":level,\"size\":size}) || !includeFallbackColors) {\n        return bestColor;\n    }\n    else {\n        args.includeFallbackColors=false;\n        return tinycolor.mostReadable(baseColor,[\"#fff\", \"#000\"],args);\n    }\n};\n\n\n// Big List of Colors\n// ------------------\n// <http://www.w3.org/TR/css3-color/#svg-color>\nvar names = tinycolor.names = {\n    aliceblue: \"f0f8ff\",\n    antiquewhite: \"faebd7\",\n    aqua: \"0ff\",\n    aquamarine: \"7fffd4\",\n    azure: \"f0ffff\",\n    beige: \"f5f5dc\",\n    bisque: \"ffe4c4\",\n    black: \"000\",\n    blanchedalmond: \"ffebcd\",\n    blue: \"00f\",\n    blueviolet: \"8a2be2\",\n    brown: \"a52a2a\",\n    burlywood: \"deb887\",\n    burntsienna: \"ea7e5d\",\n    cadetblue: \"5f9ea0\",\n    chartreuse: \"7fff00\",\n    chocolate: \"d2691e\",\n    coral: \"ff7f50\",\n    cornflowerblue: \"6495ed\",\n    cornsilk: \"fff8dc\",\n    crimson: \"dc143c\",\n    cyan: \"0ff\",\n    darkblue: \"00008b\",\n    darkcyan: \"008b8b\",\n    darkgoldenrod: \"b8860b\",\n    darkgray: \"a9a9a9\",\n    darkgreen: \"006400\",\n    darkgrey: \"a9a9a9\",\n    darkkhaki: \"bdb76b\",\n    darkmagenta: \"8b008b\",\n    darkolivegreen: \"556b2f\",\n    darkorange: \"ff8c00\",\n    darkorchid: \"9932cc\",\n    darkred: \"8b0000\",\n    darksalmon: \"e9967a\",\n    darkseagreen: \"8fbc8f\",\n    darkslateblue: \"483d8b\",\n    darkslategray: \"2f4f4f\",\n    darkslategrey: \"2f4f4f\",\n    darkturquoise: \"00ced1\",\n    darkviolet: \"9400d3\",\n    deeppink: \"ff1493\",\n    deepskyblue: \"00bfff\",\n    dimgray: \"696969\",\n    dimgrey: \"696969\",\n    dodgerblue: \"1e90ff\",\n    firebrick: \"b22222\",\n    floralwhite: \"fffaf0\",\n    forestgreen: \"228b22\",\n    fuchsia: \"f0f\",\n    gainsboro: \"dcdcdc\",\n    ghostwhite: \"f8f8ff\",\n    gold: \"ffd700\",\n    goldenrod: \"daa520\",\n    gray: \"808080\",\n    green: \"008000\",\n    greenyellow: \"adff2f\",\n    grey: \"808080\",\n    honeydew: \"f0fff0\",\n    hotpink: \"ff69b4\",\n    indianred: \"cd5c5c\",\n    indigo: \"4b0082\",\n    ivory: \"fffff0\",\n    khaki: \"f0e68c\",\n    lavender: \"e6e6fa\",\n    lavenderblush: \"fff0f5\",\n    lawngreen: \"7cfc00\",\n    lemonchiffon: \"fffacd\",\n    lightblue: \"add8e6\",\n    lightcoral: \"f08080\",\n    lightcyan: \"e0ffff\",\n    lightgoldenrodyellow: \"fafad2\",\n    lightgray: \"d3d3d3\",\n    lightgreen: \"90ee90\",\n    lightgrey: \"d3d3d3\",\n    lightpink: \"ffb6c1\",\n    lightsalmon: \"ffa07a\",\n    lightseagreen: \"20b2aa\",\n    lightskyblue: \"87cefa\",\n    lightslategray: \"789\",\n    lightslategrey: \"789\",\n    lightsteelblue: \"b0c4de\",\n    lightyellow: \"ffffe0\",\n    lime: \"0f0\",\n    limegreen: \"32cd32\",\n    linen: \"faf0e6\",\n    magenta: \"f0f\",\n    maroon: \"800000\",\n    mediumaquamarine: \"66cdaa\",\n    mediumblue: \"0000cd\",\n    mediumorchid: \"ba55d3\",\n    mediumpurple: \"9370db\",\n    mediumseagreen: \"3cb371\",\n    mediumslateblue: \"7b68ee\",\n    mediumspringgreen: \"00fa9a\",\n    mediumturquoise: \"48d1cc\",\n    mediumvioletred: \"c71585\",\n    midnightblue: \"191970\",\n    mintcream: \"f5fffa\",\n    mistyrose: \"ffe4e1\",\n    moccasin: \"ffe4b5\",\n    navajowhite: \"ffdead\",\n    navy: \"000080\",\n    oldlace: \"fdf5e6\",\n    olive: \"808000\",\n    olivedrab: \"6b8e23\",\n    orange: \"ffa500\",\n    orangered: \"ff4500\",\n    orchid: \"da70d6\",\n    palegoldenrod: \"eee8aa\",\n    palegreen: \"98fb98\",\n    paleturquoise: \"afeeee\",\n    palevioletred: \"db7093\",\n    papayawhip: \"ffefd5\",\n    peachpuff: \"ffdab9\",\n    peru: \"cd853f\",\n    pink: \"ffc0cb\",\n    plum: \"dda0dd\",\n    powderblue: \"b0e0e6\",\n    purple: \"800080\",\n    rebeccapurple: \"663399\",\n    red: \"f00\",\n    rosybrown: \"bc8f8f\",\n    royalblue: \"4169e1\",\n    saddlebrown: \"8b4513\",\n    salmon: \"fa8072\",\n    sandybrown: \"f4a460\",\n    seagreen: \"2e8b57\",\n    seashell: \"fff5ee\",\n    sienna: \"a0522d\",\n    silver: \"c0c0c0\",\n    skyblue: \"87ceeb\",\n    slateblue: \"6a5acd\",\n    slategray: \"708090\",\n    slategrey: \"708090\",\n    snow: \"fffafa\",\n    springgreen: \"00ff7f\",\n    steelblue: \"4682b4\",\n    tan: \"d2b48c\",\n    teal: \"008080\",\n    thistle: \"d8bfd8\",\n    tomato: \"ff6347\",\n    turquoise: \"40e0d0\",\n    violet: \"ee82ee\",\n    wheat: \"f5deb3\",\n    white: \"fff\",\n    whitesmoke: \"f5f5f5\",\n    yellow: \"ff0\",\n    yellowgreen: \"9acd32\"\n};\n\n// Make it easy to access colors via `hexNames[hex]`\nvar hexNames = tinycolor.hexNames = flip(names);\n\n\n// Utilities\n// ---------\n\n// `{ 'name1': 'val1' }` becomes `{ 'val1': 'name1' }`\nfunction flip(o) {\n    var flipped = { };\n    for (var i in o) {\n        if (o.hasOwnProperty(i)) {\n            flipped[o[i]] = i;\n        }\n    }\n    return flipped;\n}\n\n// Return a valid alpha value [0,1] with all invalid values being set to 1\nfunction boundAlpha(a) {\n    a = parseFloat(a);\n\n    if (isNaN(a) || a < 0 || a > 1) {\n        a = 1;\n    }\n\n    return a;\n}\n\n// Take input from [0, n] and return it as [0, 1]\nfunction bound01(n, max) {\n    if (isOnePointZero(n)) { n = \"100%\"; }\n\n    var processPercent = isPercentage(n);\n    n = mathMin(max, mathMax(0, parseFloat(n)));\n\n    // Automatically convert percentage into number\n    if (processPercent) {\n        n = parseInt(n * max, 10) / 100;\n    }\n\n    // Handle floating point rounding errors\n    if ((Math.abs(n - max) < 0.000001)) {\n        return 1;\n    }\n\n    // Convert into [0, 1] range if it isn't already\n    return (n % max) / parseFloat(max);\n}\n\n// Force a number between 0 and 1\nfunction clamp01(val) {\n    return mathMin(1, mathMax(0, val));\n}\n\n// Parse a base-16 hex value into a base-10 integer\nfunction parseIntFromHex(val) {\n    return parseInt(val, 16);\n}\n\n// Need to handle 1.0 as 100%, since once it is a number, there is no difference between it and 1\n// <http://stackoverflow.com/questions/7422072/javascript-how-to-detect-number-as-a-decimal-including-1-0>\nfunction isOnePointZero(n) {\n    return typeof n == \"string\" && n.indexOf('.') != -1 && parseFloat(n) === 1;\n}\n\n// Check to see if string passed in is a percentage\nfunction isPercentage(n) {\n    return typeof n === \"string\" && n.indexOf('%') != -1;\n}\n\n// Force a hex value to have 2 characters\nfunction pad2(c) {\n    return c.length == 1 ? '0' + c : '' + c;\n}\n\n// Replace a decimal with it's percentage value\nfunction convertToPercentage(n) {\n    if (n <= 1) {\n        n = (n * 100) + \"%\";\n    }\n\n    return n;\n}\n\n// Converts a decimal to a hex value\nfunction convertDecimalToHex(d) {\n    return Math.round(parseFloat(d) * 255).toString(16);\n}\n// Converts a hex value to a decimal\nfunction convertHexToDecimal(h) {\n    return (parseIntFromHex(h) / 255);\n}\n\nvar matchers = (function() {\n\n    // <http://www.w3.org/TR/css3-values/#integers>\n    var CSS_INTEGER = \"[-\\\\+]?\\\\d+%?\";\n\n    // <http://www.w3.org/TR/css3-values/#number-value>\n    var CSS_NUMBER = \"[-\\\\+]?\\\\d*\\\\.\\\\d+%?\";\n\n    // Allow positive/negative integer/number.  Don't capture the either/or, just the entire outcome.\n    var CSS_UNIT = \"(?:\" + CSS_NUMBER + \")|(?:\" + CSS_INTEGER + \")\";\n\n    // Actual matching.\n    // Parentheses and commas are optional, but not required.\n    // Whitespace can take the place of commas or opening paren\n    var PERMISSIVE_MATCH3 = \"[\\\\s|\\\\(]+(\" + CSS_UNIT + \")[,|\\\\s]+(\" + CSS_UNIT + \")[,|\\\\s]+(\" + CSS_UNIT + \")\\\\s*\\\\)?\";\n    var PERMISSIVE_MATCH4 = \"[\\\\s|\\\\(]+(\" + CSS_UNIT + \")[,|\\\\s]+(\" + CSS_UNIT + \")[,|\\\\s]+(\" + CSS_UNIT + \")[,|\\\\s]+(\" + CSS_UNIT + \")\\\\s*\\\\)?\";\n\n    return {\n        CSS_UNIT: new RegExp(CSS_UNIT),\n        rgb: new RegExp(\"rgb\" + PERMISSIVE_MATCH3),\n        rgba: new RegExp(\"rgba\" + PERMISSIVE_MATCH4),\n        hsl: new RegExp(\"hsl\" + PERMISSIVE_MATCH3),\n        hsla: new RegExp(\"hsla\" + PERMISSIVE_MATCH4),\n        hsv: new RegExp(\"hsv\" + PERMISSIVE_MATCH3),\n        hsva: new RegExp(\"hsva\" + PERMISSIVE_MATCH4),\n        hex3: /^#?([0-9a-fA-F]{1})([0-9a-fA-F]{1})([0-9a-fA-F]{1})$/,\n        hex6: /^#?([0-9a-fA-F]{2})([0-9a-fA-F]{2})([0-9a-fA-F]{2})$/,\n        hex4: /^#?([0-9a-fA-F]{1})([0-9a-fA-F]{1})([0-9a-fA-F]{1})([0-9a-fA-F]{1})$/,\n        hex8: /^#?([0-9a-fA-F]{2})([0-9a-fA-F]{2})([0-9a-fA-F]{2})([0-9a-fA-F]{2})$/\n    };\n})();\n\n// `isValidCSSUnit`\n// Take in a single string / number and check to see if it looks like a CSS unit\n// (see `matchers` above for definition).\nfunction isValidCSSUnit(color) {\n    return !!matchers.CSS_UNIT.exec(color);\n}\n\n// `stringInputToObject`\n// Permissive string parsing.  Take in a number of formats, and output an object\n// based on detected format.  Returns `{ r, g, b }` or `{ h, s, l }` or `{ h, s, v}`\nfunction stringInputToObject(color) {\n\n    color = color.replace(trimLeft,'').replace(trimRight, '').toLowerCase();\n    var named = false;\n    if (names[color]) {\n        color = names[color];\n        named = true;\n    }\n    else if (color == 'transparent') {\n        return { r: 0, g: 0, b: 0, a: 0, format: \"name\" };\n    }\n\n    // Try to match string input using regular expressions.\n    // Keep most of the number bounding out of this function - don't worry about [0,1] or [0,100] or [0,360]\n    // Just return an object and let the conversion functions handle that.\n    // This way the result will be the same whether the tinycolor is initialized with string or object.\n    var match;\n    if ((match = matchers.rgb.exec(color))) {\n        return { r: match[1], g: match[2], b: match[3] };\n    }\n    if ((match = matchers.rgba.exec(color))) {\n        return { r: match[1], g: match[2], b: match[3], a: match[4] };\n    }\n    if ((match = matchers.hsl.exec(color))) {\n        return { h: match[1], s: match[2], l: match[3] };\n    }\n    if ((match = matchers.hsla.exec(color))) {\n        return { h: match[1], s: match[2], l: match[3], a: match[4] };\n    }\n    if ((match = matchers.hsv.exec(color))) {\n        return { h: match[1], s: match[2], v: match[3] };\n    }\n    if ((match = matchers.hsva.exec(color))) {\n        return { h: match[1], s: match[2], v: match[3], a: match[4] };\n    }\n    if ((match = matchers.hex8.exec(color))) {\n        return {\n            r: parseIntFromHex(match[1]),\n            g: parseIntFromHex(match[2]),\n            b: parseIntFromHex(match[3]),\n            a: convertHexToDecimal(match[4]),\n            format: named ? \"name\" : \"hex8\"\n        };\n    }\n    if ((match = matchers.hex6.exec(color))) {\n        return {\n            r: parseIntFromHex(match[1]),\n            g: parseIntFromHex(match[2]),\n            b: parseIntFromHex(match[3]),\n            format: named ? \"name\" : \"hex\"\n        };\n    }\n    if ((match = matchers.hex4.exec(color))) {\n        return {\n            r: parseIntFromHex(match[1] + '' + match[1]),\n            g: parseIntFromHex(match[2] + '' + match[2]),\n            b: parseIntFromHex(match[3] + '' + match[3]),\n            a: convertHexToDecimal(match[4] + '' + match[4]),\n            format: named ? \"name\" : \"hex8\"\n        };\n    }\n    if ((match = matchers.hex3.exec(color))) {\n        return {\n            r: parseIntFromHex(match[1] + '' + match[1]),\n            g: parseIntFromHex(match[2] + '' + match[2]),\n            b: parseIntFromHex(match[3] + '' + match[3]),\n            format: named ? \"name\" : \"hex\"\n        };\n    }\n\n    return false;\n}\n\nfunction validateWCAG2Parms(parms) {\n    // return valid WCAG2 parms for isReadable.\n    // If input parms are invalid, return {\"level\":\"AA\", \"size\":\"small\"}\n    var level, size;\n    parms = parms || {\"level\":\"AA\", \"size\":\"small\"};\n    level = (parms.level || \"AA\").toUpperCase();\n    size = (parms.size || \"small\").toLowerCase();\n    if (level !== \"AA\" && level !== \"AAA\") {\n        level = \"AA\";\n    }\n    if (size !== \"small\" && size !== \"large\") {\n        size = \"small\";\n    }\n    return {\"level\":level, \"size\":size};\n}\n\n// Node: Export function\nif (typeof module !== \"undefined\" && module.exports) {\n    module.exports = tinycolor;\n}\n// AMD/requirejs: Define the module\nelse if (typeof define === 'function' && define.amd) {\n    define(function () {return tinycolor;});\n}\n// Browser: Expose to window\nelse {\n    window.tinycolor = tinycolor;\n}\n\n})(Math);\n","/*global module:true*/\n/*jslint nomen:true*/\n/**\n * @module Utility\n */\n(function (context, undefined) {\n    'use strict';\n\n    var DEFAULT_TRUNCATE_SYMBOL = '…',\n        // Limit emails to no more than about 600 chars, well over the max of ~300.\n        // cf. RFC: https://www.rfc-editor.org/errata_search.php?eid=1690\n        URL_REGEX = /(((ftp|https?):\\/\\/)[\\-\\w@:%_\\+.~#?,&\\/\\/=]+)|((mailto:)?[_.\\w-]{1,300}@(.{1,300}\\.)[a-zA-Z]{2,3})/g;\n\n    function __appendEllipsis(string, options, content) {\n        if (content.length === string.length || !options.ellipsis) {\n            return content;\n        }\n        content += options.ellipsis;\n        return content;\n    }\n    /**\n     * Truncate HTML string and keep tag safe.\n     *\n     * @method truncate\n     * @param {String} string string needs to be truncated\n     * @param {Number} maxLength length of truncated string\n     * @param {Object} options (optional)\n     * @param {Boolean|String} [options.ellipsis] omission symbol for truncated string, '...' by default\n     * @return {String} truncated string\n     */\n    function truncate(string, maxLength, options) {\n        var content = '', // truncated text storage\n            matches = true,\n            remainingLength = maxLength,\n            result,\n            index;\n\n        options = options || {};\n        options.ellipsis = (typeof options.ellipsis === \"undefined\") ? DEFAULT_TRUNCATE_SYMBOL : options.ellipsis;\n\n        if (!string || string.length === 0) {\n            return '';\n        }\n\n        matches = true;\n        while (matches) {\n            URL_REGEX.lastIndex = content.length;\n            matches = URL_REGEX.exec(string);\n            // Don't try to retain URLs longer than 3k chars, well over the 99th percentile of ~347\n            if (!matches || (matches.index - content.length) >= remainingLength || URL_REGEX.lastIndex >= (maxLength + 3000)) {\n                content += string.substring(content.length, maxLength);\n                return __appendEllipsis(string, options, content, maxLength);\n            }\n\n            result = matches[0];\n            index = matches.index;\n            content += string.substring(content.length, index + result.length);\n            remainingLength -= index + result.length;\n\n            if (remainingLength <= 0) {\n                break;\n            }\n        }\n\n        return __appendEllipsis(string, options, content, maxLength);\n    }\n\n    if ('undefined' !== typeof module && module.exports) {\n        module.exports = truncate;\n    } else {\n        context.truncate = truncate;\n    }\n}(String));\n","/////////////////////////////////////////////////////////////////////////////////\n/* UAParser.js v0.7.33\n   Copyright © 2012-2021 Faisal Salman <f@faisalman.com>\n   MIT License *//*\n   Detect Browser, Engine, OS, CPU, and Device type/model from User-Agent data.\n   Supports browser & node.js environment. \n   Demo   : https://faisalman.github.io/ua-parser-js\n   Source : https://github.com/faisalman/ua-parser-js */\n/////////////////////////////////////////////////////////////////////////////////\n\n(function (window, undefined) {\n\n    'use strict';\n\n    //////////////\n    // Constants\n    /////////////\n\n\n    var LIBVERSION  = '0.7.33',\n        EMPTY       = '',\n        UNKNOWN     = '?',\n        FUNC_TYPE   = 'function',\n        UNDEF_TYPE  = 'undefined',\n        OBJ_TYPE    = 'object',\n        STR_TYPE    = 'string',\n        MAJOR       = 'major',\n        MODEL       = 'model',\n        NAME        = 'name',\n        TYPE        = 'type',\n        VENDOR      = 'vendor',\n        VERSION     = 'version',\n        ARCHITECTURE= 'architecture',\n        CONSOLE     = 'console',\n        MOBILE      = 'mobile',\n        TABLET      = 'tablet',\n        SMARTTV     = 'smarttv',\n        WEARABLE    = 'wearable',\n        EMBEDDED    = 'embedded',\n        UA_MAX_LENGTH = 350;\n\n    var AMAZON  = 'Amazon',\n        APPLE   = 'Apple',\n        ASUS    = 'ASUS',\n        BLACKBERRY = 'BlackBerry',\n        BROWSER = 'Browser',\n        CHROME  = 'Chrome',\n        EDGE    = 'Edge',\n        FIREFOX = 'Firefox',\n        GOOGLE  = 'Google',\n        HUAWEI  = 'Huawei',\n        LG      = 'LG',\n        MICROSOFT = 'Microsoft',\n        MOTOROLA  = 'Motorola',\n        OPERA   = 'Opera',\n        SAMSUNG = 'Samsung',\n        SHARP   = 'Sharp',\n        SONY    = 'Sony',\n        XIAOMI  = 'Xiaomi',\n        ZEBRA   = 'Zebra',\n        FACEBOOK   = 'Facebook';\n\n    ///////////\n    // Helper\n    //////////\n\n    var extend = function (regexes, extensions) {\n            var mergedRegexes = {};\n            for (var i in regexes) {\n                if (extensions[i] && extensions[i].length % 2 === 0) {\n                    mergedRegexes[i] = extensions[i].concat(regexes[i]);\n                } else {\n                    mergedRegexes[i] = regexes[i];\n                }\n            }\n            return mergedRegexes;\n        },\n        enumerize = function (arr) {\n            var enums = {};\n            for (var i=0; i<arr.length; i++) {\n                enums[arr[i].toUpperCase()] = arr[i];\n            }\n            return enums;\n        },\n        has = function (str1, str2) {\n            return typeof str1 === STR_TYPE ? lowerize(str2).indexOf(lowerize(str1)) !== -1 : false;\n        },\n        lowerize = function (str) {\n            return str.toLowerCase();\n        },\n        majorize = function (version) {\n            return typeof(version) === STR_TYPE ? version.replace(/[^\\d\\.]/g, EMPTY).split('.')[0] : undefined;\n        },\n        trim = function (str, len) {\n            if (typeof(str) === STR_TYPE) {\n                str = str.replace(/^\\s\\s*/, EMPTY);\n                return typeof(len) === UNDEF_TYPE ? str : str.substring(0, UA_MAX_LENGTH);\n            }\n    };\n\n    ///////////////\n    // Map helper\n    //////////////\n\n    var rgxMapper = function (ua, arrays) {\n\n            var i = 0, j, k, p, q, matches, match;\n\n            // loop through all regexes maps\n            while (i < arrays.length && !matches) {\n\n                var regex = arrays[i],       // even sequence (0,2,4,..)\n                    props = arrays[i + 1];   // odd sequence (1,3,5,..)\n                j = k = 0;\n\n                // try matching uastring with regexes\n                while (j < regex.length && !matches) {\n\n                    matches = regex[j++].exec(ua);\n\n                    if (!!matches) {\n                        for (p = 0; p < props.length; p++) {\n                            match = matches[++k];\n                            q = props[p];\n                            // check if given property is actually array\n                            if (typeof q === OBJ_TYPE && q.length > 0) {\n                                if (q.length === 2) {\n                                    if (typeof q[1] == FUNC_TYPE) {\n                                        // assign modified match\n                                        this[q[0]] = q[1].call(this, match);\n                                    } else {\n                                        // assign given value, ignore regex match\n                                        this[q[0]] = q[1];\n                                    }\n                                } else if (q.length === 3) {\n                                    // check whether function or regex\n                                    if (typeof q[1] === FUNC_TYPE && !(q[1].exec && q[1].test)) {\n                                        // call function (usually string mapper)\n                                        this[q[0]] = match ? q[1].call(this, match, q[2]) : undefined;\n                                    } else {\n                                        // sanitize match using given regex\n                                        this[q[0]] = match ? match.replace(q[1], q[2]) : undefined;\n                                    }\n                                } else if (q.length === 4) {\n                                        this[q[0]] = match ? q[3].call(this, match.replace(q[1], q[2])) : undefined;\n                                }\n                            } else {\n                                this[q] = match ? match : undefined;\n                            }\n                        }\n                    }\n                }\n                i += 2;\n            }\n        },\n\n        strMapper = function (str, map) {\n\n            for (var i in map) {\n                // check if current value is array\n                if (typeof map[i] === OBJ_TYPE && map[i].length > 0) {\n                    for (var j = 0; j < map[i].length; j++) {\n                        if (has(map[i][j], str)) {\n                            return (i === UNKNOWN) ? undefined : i;\n                        }\n                    }\n                } else if (has(map[i], str)) {\n                    return (i === UNKNOWN) ? undefined : i;\n                }\n            }\n            return str;\n    };\n\n    ///////////////\n    // String map\n    //////////////\n\n    // Safari < 3.0\n    var oldSafariMap = {\n            '1.0'   : '/8',\n            '1.2'   : '/1',\n            '1.3'   : '/3',\n            '2.0'   : '/412',\n            '2.0.2' : '/416',\n            '2.0.3' : '/417',\n            '2.0.4' : '/419',\n            '?'     : '/'\n        },\n        windowsVersionMap = {\n            'ME'        : '4.90',\n            'NT 3.11'   : 'NT3.51',\n            'NT 4.0'    : 'NT4.0',\n            '2000'      : 'NT 5.0',\n            'XP'        : ['NT 5.1', 'NT 5.2'],\n            'Vista'     : 'NT 6.0',\n            '7'         : 'NT 6.1',\n            '8'         : 'NT 6.2',\n            '8.1'       : 'NT 6.3',\n            '10'        : ['NT 6.4', 'NT 10.0'],\n            'RT'        : 'ARM'\n    };\n\n    //////////////\n    // Regex map\n    /////////////\n\n    var regexes = {\n\n        browser : [[\n\n            /\\b(?:crmo|crios)\\/([\\w\\.]+)/i                                      // Chrome for Android/iOS\n            ], [VERSION, [NAME, 'Chrome']], [\n            /edg(?:e|ios|a)?\\/([\\w\\.]+)/i                                       // Microsoft Edge\n            ], [VERSION, [NAME, 'Edge']], [\n\n            // Presto based\n            /(opera mini)\\/([-\\w\\.]+)/i,                                        // Opera Mini\n            /(opera [mobiletab]{3,6})\\b.+version\\/([-\\w\\.]+)/i,                 // Opera Mobi/Tablet\n            /(opera)(?:.+version\\/|[\\/ ]+)([\\w\\.]+)/i                           // Opera\n            ], [NAME, VERSION], [\n            /opios[\\/ ]+([\\w\\.]+)/i                                             // Opera mini on iphone >= 8.0\n            ], [VERSION, [NAME, OPERA+' Mini']], [\n            /\\bopr\\/([\\w\\.]+)/i                                                 // Opera Webkit\n            ], [VERSION, [NAME, OPERA]], [\n\n            // Mixed\n            /(kindle)\\/([\\w\\.]+)/i,                                             // Kindle\n            /(lunascape|maxthon|netfront|jasmine|blazer)[\\/ ]?([\\w\\.]*)/i,      // Lunascape/Maxthon/Netfront/Jasmine/Blazer\n            // Trident based\n            /(avant |iemobile|slim)(?:browser)?[\\/ ]?([\\w\\.]*)/i,               // Avant/IEMobile/SlimBrowser\n            /(ba?idubrowser)[\\/ ]?([\\w\\.]+)/i,                                  // Baidu Browser\n            /(?:ms|\\()(ie) ([\\w\\.]+)/i,                                         // Internet Explorer\n\n            // Webkit/KHTML based                                               // Flock/RockMelt/Midori/Epiphany/Silk/Skyfire/Bolt/Iron/Iridium/PhantomJS/Bowser/QupZilla/Falkon\n            /(flock|rockmelt|midori|epiphany|silk|skyfire|ovibrowser|bolt|iron|vivaldi|iridium|phantomjs|bowser|quark|qupzilla|falkon|rekonq|puffin|brave|whale|qqbrowserlite|qq|duckduckgo)\\/([-\\w\\.]+)/i,\n                                                                                // Rekonq/Puffin/Brave/Whale/QQBrowserLite/QQ, aka ShouQ\n            /(weibo)__([\\d\\.]+)/i                                               // Weibo\n            ], [NAME, VERSION], [\n            /(?:\\buc? ?browser|(?:juc.+)ucweb)[\\/ ]?([\\w\\.]+)/i                 // UCBrowser\n            ], [VERSION, [NAME, 'UC'+BROWSER]], [\n            /microm.+\\bqbcore\\/([\\w\\.]+)/i,                                     // WeChat Desktop for Windows Built-in Browser\n            /\\bqbcore\\/([\\w\\.]+).+microm/i\n            ], [VERSION, [NAME, 'WeChat(Win) Desktop']], [\n            /micromessenger\\/([\\w\\.]+)/i                                        // WeChat\n            ], [VERSION, [NAME, 'WeChat']], [\n            /konqueror\\/([\\w\\.]+)/i                                             // Konqueror\n            ], [VERSION, [NAME, 'Konqueror']], [\n            /trident.+rv[: ]([\\w\\.]{1,9})\\b.+like gecko/i                       // IE11\n            ], [VERSION, [NAME, 'IE']], [\n            /yabrowser\\/([\\w\\.]+)/i                                             // Yandex\n            ], [VERSION, [NAME, 'Yandex']], [\n            /(avast|avg)\\/([\\w\\.]+)/i                                           // Avast/AVG Secure Browser\n            ], [[NAME, /(.+)/, '$1 Secure '+BROWSER], VERSION], [\n            /\\bfocus\\/([\\w\\.]+)/i                                               // Firefox Focus\n            ], [VERSION, [NAME, FIREFOX+' Focus']], [\n            /\\bopt\\/([\\w\\.]+)/i                                                 // Opera Touch\n            ], [VERSION, [NAME, OPERA+' Touch']], [\n            /coc_coc\\w+\\/([\\w\\.]+)/i                                            // Coc Coc Browser\n            ], [VERSION, [NAME, 'Coc Coc']], [\n            /dolfin\\/([\\w\\.]+)/i                                                // Dolphin\n            ], [VERSION, [NAME, 'Dolphin']], [\n            /coast\\/([\\w\\.]+)/i                                                 // Opera Coast\n            ], [VERSION, [NAME, OPERA+' Coast']], [\n            /miuibrowser\\/([\\w\\.]+)/i                                           // MIUI Browser\n            ], [VERSION, [NAME, 'MIUI '+BROWSER]], [\n            /fxios\\/([-\\w\\.]+)/i                                                // Firefox for iOS\n            ], [VERSION, [NAME, FIREFOX]], [\n            /\\bqihu|(qi?ho?o?|360)browser/i                                     // 360\n            ], [[NAME, '360 '+BROWSER]], [\n            /(oculus|samsung|sailfish|huawei)browser\\/([\\w\\.]+)/i\n            ], [[NAME, /(.+)/, '$1 '+BROWSER], VERSION], [                      // Oculus/Samsung/Sailfish/Huawei Browser\n            /(comodo_dragon)\\/([\\w\\.]+)/i                                       // Comodo Dragon\n            ], [[NAME, /_/g, ' '], VERSION], [\n            /(electron)\\/([\\w\\.]+) safari/i,                                    // Electron-based App\n            /(tesla)(?: qtcarbrowser|\\/(20\\d\\d\\.[-\\w\\.]+))/i,                   // Tesla\n            /m?(qqbrowser|baiduboxapp|2345Explorer)[\\/ ]?([\\w\\.]+)/i            // QQBrowser/Baidu App/2345 Browser\n            ], [NAME, VERSION], [\n            /(metasr)[\\/ ]?([\\w\\.]+)/i,                                         // SouGouBrowser\n            /(lbbrowser)/i,                                                     // LieBao Browser\n            /\\[(linkedin)app\\]/i                                                // LinkedIn App for iOS & Android\n            ], [NAME], [\n\n            // WebView\n            /((?:fban\\/fbios|fb_iab\\/fb4a)(?!.+fbav)|;fbav\\/([\\w\\.]+);)/i       // Facebook App for iOS & Android\n            ], [[NAME, FACEBOOK], VERSION], [\n            /safari (line)\\/([\\w\\.]+)/i,                                        // Line App for iOS\n            /\\b(line)\\/([\\w\\.]+)\\/iab/i,                                        // Line App for Android\n            /(chromium|instagram)[\\/ ]([-\\w\\.]+)/i                              // Chromium/Instagram\n            ], [NAME, VERSION], [\n            /\\bgsa\\/([\\w\\.]+) .*safari\\//i                                      // Google Search Appliance on iOS\n            ], [VERSION, [NAME, 'GSA']], [\n\n            /headlesschrome(?:\\/([\\w\\.]+)| )/i                                  // Chrome Headless\n            ], [VERSION, [NAME, CHROME+' Headless']], [\n\n            / wv\\).+(chrome)\\/([\\w\\.]+)/i                                       // Chrome WebView\n            ], [[NAME, CHROME+' WebView'], VERSION], [\n\n            /droid.+ version\\/([\\w\\.]+)\\b.+(?:mobile safari|safari)/i           // Android Browser\n            ], [VERSION, [NAME, 'Android '+BROWSER]], [\n\n            /(chrome|omniweb|arora|[tizenoka]{5} ?browser)\\/v?([\\w\\.]+)/i       // Chrome/OmniWeb/Arora/Tizen/Nokia\n            ], [NAME, VERSION], [\n\n            /version\\/([\\w\\.\\,]+) .*mobile\\/\\w+ (safari)/i                      // Mobile Safari\n            ], [VERSION, [NAME, 'Mobile Safari']], [\n            /version\\/([\\w(\\.|\\,)]+) .*(mobile ?safari|safari)/i                // Safari & Safari Mobile\n            ], [VERSION, NAME], [\n            /webkit.+?(mobile ?safari|safari)(\\/[\\w\\.]+)/i                      // Safari < 3.0\n            ], [NAME, [VERSION, strMapper, oldSafariMap]], [\n\n            /(webkit|khtml)\\/([\\w\\.]+)/i\n            ], [NAME, VERSION], [\n\n            // Gecko based\n            /(navigator|netscape\\d?)\\/([-\\w\\.]+)/i                              // Netscape\n            ], [[NAME, 'Netscape'], VERSION], [\n            /mobile vr; rv:([\\w\\.]+)\\).+firefox/i                               // Firefox Reality\n            ], [VERSION, [NAME, FIREFOX+' Reality']], [\n            /ekiohf.+(flow)\\/([\\w\\.]+)/i,                                       // Flow\n            /(swiftfox)/i,                                                      // Swiftfox\n            /(icedragon|iceweasel|camino|chimera|fennec|maemo browser|minimo|conkeror|klar)[\\/ ]?([\\w\\.\\+]+)/i,\n                                                                                // IceDragon/Iceweasel/Camino/Chimera/Fennec/Maemo/Minimo/Conkeror/Klar\n            /(seamonkey|k-meleon|icecat|iceape|firebird|phoenix|palemoon|basilisk|waterfox)\\/([-\\w\\.]+)$/i,\n                                                                                // Firefox/SeaMonkey/K-Meleon/IceCat/IceApe/Firebird/Phoenix\n            /(firefox)\\/([\\w\\.]+)/i,                                            // Other Firefox-based\n            /(mozilla)\\/([\\w\\.]+) .+rv\\:.+gecko\\/\\d+/i,                         // Mozilla\n\n            // Other\n            /(polaris|lynx|dillo|icab|doris|amaya|w3m|netsurf|sleipnir|obigo|mosaic|(?:go|ice|up)[\\. ]?browser)[-\\/ ]?v?([\\w\\.]+)/i,\n                                                                                // Polaris/Lynx/Dillo/iCab/Doris/Amaya/w3m/NetSurf/Sleipnir/Obigo/Mosaic/Go/ICE/UP.Browser\n            /(links) \\(([\\w\\.]+)/i                                              // Links\n            ], [NAME, VERSION], [\n            \n            /(cobalt)\\/([\\w\\.]+)/i                                              // Cobalt\n            ], [NAME, [VERSION, /master.|lts./, \"\"]]\n        ],\n\n        cpu : [[\n\n            /(?:(amd|x(?:(?:86|64)[-_])?|wow|win)64)[;\\)]/i                     // AMD64 (x64)\n            ], [[ARCHITECTURE, 'amd64']], [\n\n            /(ia32(?=;))/i                                                      // IA32 (quicktime)\n            ], [[ARCHITECTURE, lowerize]], [\n\n            /((?:i[346]|x)86)[;\\)]/i                                            // IA32 (x86)\n            ], [[ARCHITECTURE, 'ia32']], [\n\n            /\\b(aarch64|arm(v?8e?l?|_?64))\\b/i                                 // ARM64\n            ], [[ARCHITECTURE, 'arm64']], [\n\n            /\\b(arm(?:v[67])?ht?n?[fl]p?)\\b/i                                   // ARMHF\n            ], [[ARCHITECTURE, 'armhf']], [\n\n            // PocketPC mistakenly identified as PowerPC\n            /windows (ce|mobile); ppc;/i\n            ], [[ARCHITECTURE, 'arm']], [\n\n            /((?:ppc|powerpc)(?:64)?)(?: mac|;|\\))/i                            // PowerPC\n            ], [[ARCHITECTURE, /ower/, EMPTY, lowerize]], [\n\n            /(sun4\\w)[;\\)]/i                                                    // SPARC\n            ], [[ARCHITECTURE, 'sparc']], [\n\n            /((?:avr32|ia64(?=;))|68k(?=\\))|\\barm(?=v(?:[1-7]|[5-7]1)l?|;|eabi)|(?=atmel )avr|(?:irix|mips|sparc)(?:64)?\\b|pa-risc)/i\n                                                                                // IA64, 68K, ARM/64, AVR/32, IRIX/64, MIPS/64, SPARC/64, PA-RISC\n            ], [[ARCHITECTURE, lowerize]]\n        ],\n\n        device : [[\n\n            //////////////////////////\n            // MOBILES & TABLETS\n            // Ordered by popularity\n            /////////////////////////\n\n            // Samsung\n            /\\b(sch-i[89]0\\d|shw-m380s|sm-[ptx]\\w{2,4}|gt-[pn]\\d{2,4}|sgh-t8[56]9|nexus 10)/i\n            ], [MODEL, [VENDOR, SAMSUNG], [TYPE, TABLET]], [\n            /\\b((?:s[cgp]h|gt|sm)-\\w+|galaxy nexus)/i,\n            /samsung[- ]([-\\w]+)/i,\n            /sec-(sgh\\w+)/i\n            ], [MODEL, [VENDOR, SAMSUNG], [TYPE, MOBILE]], [\n\n            // Apple\n            /\\((ip(?:hone|od)[\\w ]*);/i                                         // iPod/iPhone\n            ], [MODEL, [VENDOR, APPLE], [TYPE, MOBILE]], [\n            /\\((ipad);[-\\w\\),; ]+apple/i,                                       // iPad\n            /applecoremedia\\/[\\w\\.]+ \\((ipad)/i,\n            /\\b(ipad)\\d\\d?,\\d\\d?[;\\]].+ios/i\n            ], [MODEL, [VENDOR, APPLE], [TYPE, TABLET]], [\n            /(macintosh);/i\n            ], [MODEL, [VENDOR, APPLE]], [\n\n            // Huawei\n            /\\b((?:ag[rs][23]?|bah2?|sht?|btv)-a?[lw]\\d{2})\\b(?!.+d\\/s)/i\n            ], [MODEL, [VENDOR, HUAWEI], [TYPE, TABLET]], [\n            /(?:huawei|honor)([-\\w ]+)[;\\)]/i,\n            /\\b(nexus 6p|\\w{2,4}e?-[atu]?[ln][\\dx][012359c][adn]?)\\b(?!.+d\\/s)/i\n            ], [MODEL, [VENDOR, HUAWEI], [TYPE, MOBILE]], [\n\n            // Xiaomi\n            /\\b(poco[\\w ]+)(?: bui|\\))/i,                                       // Xiaomi POCO\n            /\\b; (\\w+) build\\/hm\\1/i,                                           // Xiaomi Hongmi 'numeric' models\n            /\\b(hm[-_ ]?note?[_ ]?(?:\\d\\w)?) bui/i,                             // Xiaomi Hongmi\n            /\\b(redmi[\\-_ ]?(?:note|k)?[\\w_ ]+)(?: bui|\\))/i,                   // Xiaomi Redmi\n            /\\b(mi[-_ ]?(?:a\\d|one|one[_ ]plus|note lte|max|cc)?[_ ]?(?:\\d?\\w?)[_ ]?(?:plus|se|lite)?)(?: bui|\\))/i // Xiaomi Mi\n            ], [[MODEL, /_/g, ' '], [VENDOR, XIAOMI], [TYPE, MOBILE]], [\n            /\\b(mi[-_ ]?(?:pad)(?:[\\w_ ]+))(?: bui|\\))/i                        // Mi Pad tablets\n            ],[[MODEL, /_/g, ' '], [VENDOR, XIAOMI], [TYPE, TABLET]], [\n\n            // OPPO\n            /; (\\w+) bui.+ oppo/i,\n            /\\b(cph[12]\\d{3}|p(?:af|c[al]|d\\w|e[ar])[mt]\\d0|x9007|a101op)\\b/i\n            ], [MODEL, [VENDOR, 'OPPO'], [TYPE, MOBILE]], [\n\n            // Vivo\n            /vivo (\\w+)(?: bui|\\))/i,\n            /\\b(v[12]\\d{3}\\w?[at])(?: bui|;)/i\n            ], [MODEL, [VENDOR, 'Vivo'], [TYPE, MOBILE]], [\n\n            // Realme\n            /\\b(rmx[12]\\d{3})(?: bui|;|\\))/i\n            ], [MODEL, [VENDOR, 'Realme'], [TYPE, MOBILE]], [\n\n            // Motorola\n            /\\b(milestone|droid(?:[2-4x]| (?:bionic|x2|pro|razr))?:?( 4g)?)\\b[\\w ]+build\\//i,\n            /\\bmot(?:orola)?[- ](\\w*)/i,\n            /((?:moto[\\w\\(\\) ]+|xt\\d{3,4}|nexus 6)(?= bui|\\)))/i\n            ], [MODEL, [VENDOR, MOTOROLA], [TYPE, MOBILE]], [\n            /\\b(mz60\\d|xoom[2 ]{0,2}) build\\//i\n            ], [MODEL, [VENDOR, MOTOROLA], [TYPE, TABLET]], [\n\n            // LG\n            /((?=lg)?[vl]k\\-?\\d{3}) bui| 3\\.[-\\w; ]{10}lg?-([06cv9]{3,4})/i\n            ], [MODEL, [VENDOR, LG], [TYPE, TABLET]], [\n            /(lm(?:-?f100[nv]?|-[\\w\\.]+)(?= bui|\\))|nexus [45])/i,\n            /\\blg[-e;\\/ ]+((?!browser|netcast|android tv)\\w+)/i,\n            /\\blg-?([\\d\\w]+) bui/i\n            ], [MODEL, [VENDOR, LG], [TYPE, MOBILE]], [\n\n            // Lenovo\n            /(ideatab[-\\w ]+)/i,\n            /lenovo ?(s[56]000[-\\w]+|tab(?:[\\w ]+)|yt[-\\d\\w]{6}|tb[-\\d\\w]{6})/i\n            ], [MODEL, [VENDOR, 'Lenovo'], [TYPE, TABLET]], [\n\n            // Nokia\n            /(?:maemo|nokia).*(n900|lumia \\d+)/i,\n            /nokia[-_ ]?([-\\w\\.]*)/i\n            ], [[MODEL, /_/g, ' '], [VENDOR, 'Nokia'], [TYPE, MOBILE]], [\n\n            // Google\n            /(pixel c)\\b/i                                                      // Google Pixel C\n            ], [MODEL, [VENDOR, GOOGLE], [TYPE, TABLET]], [\n            /droid.+; (pixel[\\daxl ]{0,6})(?: bui|\\))/i                         // Google Pixel\n            ], [MODEL, [VENDOR, GOOGLE], [TYPE, MOBILE]], [\n\n            // Sony\n            /droid.+ (a?\\d[0-2]{2}so|[c-g]\\d{4}|so[-gl]\\w+|xq-a\\w[4-7][12])(?= bui|\\).+chrome\\/(?![1-6]{0,1}\\d\\.))/i\n            ], [MODEL, [VENDOR, SONY], [TYPE, MOBILE]], [\n            /sony tablet [ps]/i,\n            /\\b(?:sony)?sgp\\w+(?: bui|\\))/i\n            ], [[MODEL, 'Xperia Tablet'], [VENDOR, SONY], [TYPE, TABLET]], [\n\n            // OnePlus\n            / (kb2005|in20[12]5|be20[12][59])\\b/i,\n            /(?:one)?(?:plus)? (a\\d0\\d\\d)(?: b|\\))/i\n            ], [MODEL, [VENDOR, 'OnePlus'], [TYPE, MOBILE]], [\n\n            // Amazon\n            /(alexa)webm/i,\n            /(kf[a-z]{2}wi)( bui|\\))/i,                                         // Kindle Fire without Silk\n            /(kf[a-z]+)( bui|\\)).+silk\\//i                                      // Kindle Fire HD\n            ], [MODEL, [VENDOR, AMAZON], [TYPE, TABLET]], [\n            /((?:sd|kf)[0349hijorstuw]+)( bui|\\)).+silk\\//i                     // Fire Phone\n            ], [[MODEL, /(.+)/g, 'Fire Phone $1'], [VENDOR, AMAZON], [TYPE, MOBILE]], [\n\n            // BlackBerry\n            /(playbook);[-\\w\\),; ]+(rim)/i                                      // BlackBerry PlayBook\n            ], [MODEL, VENDOR, [TYPE, TABLET]], [\n            /\\b((?:bb[a-f]|st[hv])100-\\d)/i,\n            /\\(bb10; (\\w+)/i                                                    // BlackBerry 10\n            ], [MODEL, [VENDOR, BLACKBERRY], [TYPE, MOBILE]], [\n\n            // Asus\n            /(?:\\b|asus_)(transfo[prime ]{4,10} \\w+|eeepc|slider \\w+|nexus 7|padfone|p00[cj])/i\n            ], [MODEL, [VENDOR, ASUS], [TYPE, TABLET]], [\n            / (z[bes]6[027][012][km][ls]|zenfone \\d\\w?)\\b/i\n            ], [MODEL, [VENDOR, ASUS], [TYPE, MOBILE]], [\n\n            // HTC\n            /(nexus 9)/i                                                        // HTC Nexus 9\n            ], [MODEL, [VENDOR, 'HTC'], [TYPE, TABLET]], [\n            /(htc)[-;_ ]{1,2}([\\w ]+(?=\\)| bui)|\\w+)/i,                         // HTC\n\n            // ZTE\n            /(zte)[- ]([\\w ]+?)(?: bui|\\/|\\))/i,\n            /(alcatel|geeksphone|nexian|panasonic|sony(?!-bra))[-_ ]?([-\\w]*)/i         // Alcatel/GeeksPhone/Nexian/Panasonic/Sony\n            ], [VENDOR, [MODEL, /_/g, ' '], [TYPE, MOBILE]], [\n\n            // Acer\n            /droid.+; ([ab][1-7]-?[0178a]\\d\\d?)/i\n            ], [MODEL, [VENDOR, 'Acer'], [TYPE, TABLET]], [\n\n            // Meizu\n            /droid.+; (m[1-5] note) bui/i,\n            /\\bmz-([-\\w]{2,})/i\n            ], [MODEL, [VENDOR, 'Meizu'], [TYPE, MOBILE]], [\n\n            // Sharp\n            /\\b(sh-?[altvz]?\\d\\d[a-ekm]?)/i\n            ], [MODEL, [VENDOR, SHARP], [TYPE, MOBILE]], [\n\n            // MIXED\n            /(blackberry|benq|palm(?=\\-)|sonyericsson|acer|asus|dell|meizu|motorola|polytron)[-_ ]?([-\\w]*)/i,\n                                                                                // BlackBerry/BenQ/Palm/Sony-Ericsson/Acer/Asus/Dell/Meizu/Motorola/Polytron\n            /(hp) ([\\w ]+\\w)/i,                                                 // HP iPAQ\n            /(asus)-?(\\w+)/i,                                                   // Asus\n            /(microsoft); (lumia[\\w ]+)/i,                                      // Microsoft Lumia\n            /(lenovo)[-_ ]?([-\\w]+)/i,                                          // Lenovo\n            /(jolla)/i,                                                         // Jolla\n            /(oppo) ?([\\w ]+) bui/i                                             // OPPO\n            ], [VENDOR, MODEL, [TYPE, MOBILE]], [\n\n            /(archos) (gamepad2?)/i,                                            // Archos\n            /(hp).+(touchpad(?!.+tablet)|tablet)/i,                             // HP TouchPad\n            /(kindle)\\/([\\w\\.]+)/i,                                             // Kindle\n            /(nook)[\\w ]+build\\/(\\w+)/i,                                        // Nook\n            /(dell) (strea[kpr\\d ]*[\\dko])/i,                                   // Dell Streak\n            /(le[- ]+pan)[- ]+(\\w{1,9}) bui/i,                                  // Le Pan Tablets\n            /(trinity)[- ]*(t\\d{3}) bui/i,                                      // Trinity Tablets\n            /(gigaset)[- ]+(q\\w{1,9}) bui/i,                                    // Gigaset Tablets\n            /(vodafone) ([\\w ]+)(?:\\)| bui)/i                                   // Vodafone\n            ], [VENDOR, MODEL, [TYPE, TABLET]], [\n\n            /(surface duo)/i                                                    // Surface Duo\n            ], [MODEL, [VENDOR, MICROSOFT], [TYPE, TABLET]], [\n            /droid [\\d\\.]+; (fp\\du?)(?: b|\\))/i                                 // Fairphone\n            ], [MODEL, [VENDOR, 'Fairphone'], [TYPE, MOBILE]], [\n            /(u304aa)/i                                                         // AT&T\n            ], [MODEL, [VENDOR, 'AT&T'], [TYPE, MOBILE]], [\n            /\\bsie-(\\w*)/i                                                      // Siemens\n            ], [MODEL, [VENDOR, 'Siemens'], [TYPE, MOBILE]], [\n            /\\b(rct\\w+) b/i                                                     // RCA Tablets\n            ], [MODEL, [VENDOR, 'RCA'], [TYPE, TABLET]], [\n            /\\b(venue[\\d ]{2,7}) b/i                                            // Dell Venue Tablets\n            ], [MODEL, [VENDOR, 'Dell'], [TYPE, TABLET]], [\n            /\\b(q(?:mv|ta)\\w+) b/i                                              // Verizon Tablet\n            ], [MODEL, [VENDOR, 'Verizon'], [TYPE, TABLET]], [\n            /\\b(?:barnes[& ]+noble |bn[rt])([\\w\\+ ]*) b/i                       // Barnes & Noble Tablet\n            ], [MODEL, [VENDOR, 'Barnes & Noble'], [TYPE, TABLET]], [\n            /\\b(tm\\d{3}\\w+) b/i\n            ], [MODEL, [VENDOR, 'NuVision'], [TYPE, TABLET]], [\n            /\\b(k88) b/i                                                        // ZTE K Series Tablet\n            ], [MODEL, [VENDOR, 'ZTE'], [TYPE, TABLET]], [\n            /\\b(nx\\d{3}j) b/i                                                   // ZTE Nubia\n            ], [MODEL, [VENDOR, 'ZTE'], [TYPE, MOBILE]], [\n            /\\b(gen\\d{3}) b.+49h/i                                              // Swiss GEN Mobile\n            ], [MODEL, [VENDOR, 'Swiss'], [TYPE, MOBILE]], [\n            /\\b(zur\\d{3}) b/i                                                   // Swiss ZUR Tablet\n            ], [MODEL, [VENDOR, 'Swiss'], [TYPE, TABLET]], [\n            /\\b((zeki)?tb.*\\b) b/i                                              // Zeki Tablets\n            ], [MODEL, [VENDOR, 'Zeki'], [TYPE, TABLET]], [\n            /\\b([yr]\\d{2}) b/i,\n            /\\b(dragon[- ]+touch |dt)(\\w{5}) b/i                                // Dragon Touch Tablet\n            ], [[VENDOR, 'Dragon Touch'], MODEL, [TYPE, TABLET]], [\n            /\\b(ns-?\\w{0,9}) b/i                                                // Insignia Tablets\n            ], [MODEL, [VENDOR, 'Insignia'], [TYPE, TABLET]], [\n            /\\b((nxa|next)-?\\w{0,9}) b/i                                        // NextBook Tablets\n            ], [MODEL, [VENDOR, 'NextBook'], [TYPE, TABLET]], [\n            /\\b(xtreme\\_)?(v(1[045]|2[015]|[3469]0|7[05])) b/i                  // Voice Xtreme Phones\n            ], [[VENDOR, 'Voice'], MODEL, [TYPE, MOBILE]], [\n            /\\b(lvtel\\-)?(v1[12]) b/i                                           // LvTel Phones\n            ], [[VENDOR, 'LvTel'], MODEL, [TYPE, MOBILE]], [\n            /\\b(ph-1) /i                                                        // Essential PH-1\n            ], [MODEL, [VENDOR, 'Essential'], [TYPE, MOBILE]], [\n            /\\b(v(100md|700na|7011|917g).*\\b) b/i                               // Envizen Tablets\n            ], [MODEL, [VENDOR, 'Envizen'], [TYPE, TABLET]], [\n            /\\b(trio[-\\w\\. ]+) b/i                                              // MachSpeed Tablets\n            ], [MODEL, [VENDOR, 'MachSpeed'], [TYPE, TABLET]], [\n            /\\btu_(1491) b/i                                                    // Rotor Tablets\n            ], [MODEL, [VENDOR, 'Rotor'], [TYPE, TABLET]], [\n            /(shield[\\w ]+) b/i                                                 // Nvidia Shield Tablets\n            ], [MODEL, [VENDOR, 'Nvidia'], [TYPE, TABLET]], [\n            /(sprint) (\\w+)/i                                                   // Sprint Phones\n            ], [VENDOR, MODEL, [TYPE, MOBILE]], [\n            /(kin\\.[onetw]{3})/i                                                // Microsoft Kin\n            ], [[MODEL, /\\./g, ' '], [VENDOR, MICROSOFT], [TYPE, MOBILE]], [\n            /droid.+; (cc6666?|et5[16]|mc[239][23]x?|vc8[03]x?)\\)/i             // Zebra\n            ], [MODEL, [VENDOR, ZEBRA], [TYPE, TABLET]], [\n            /droid.+; (ec30|ps20|tc[2-8]\\d[kx])\\)/i\n            ], [MODEL, [VENDOR, ZEBRA], [TYPE, MOBILE]], [\n\n            ///////////////////\n            // CONSOLES\n            ///////////////////\n\n            /(ouya)/i,                                                          // Ouya\n            /(nintendo) ([wids3utch]+)/i                                        // Nintendo\n            ], [VENDOR, MODEL, [TYPE, CONSOLE]], [\n            /droid.+; (shield) bui/i                                            // Nvidia\n            ], [MODEL, [VENDOR, 'Nvidia'], [TYPE, CONSOLE]], [\n            /(playstation [345portablevi]+)/i                                   // Playstation\n            ], [MODEL, [VENDOR, SONY], [TYPE, CONSOLE]], [\n            /\\b(xbox(?: one)?(?!; xbox))[\\); ]/i                                // Microsoft Xbox\n            ], [MODEL, [VENDOR, MICROSOFT], [TYPE, CONSOLE]], [\n\n            ///////////////////\n            // SMARTTVS\n            ///////////////////\n\n            /smart-tv.+(samsung)/i                                              // Samsung\n            ], [VENDOR, [TYPE, SMARTTV]], [\n            /hbbtv.+maple;(\\d+)/i\n            ], [[MODEL, /^/, 'SmartTV'], [VENDOR, SAMSUNG], [TYPE, SMARTTV]], [\n            /(nux; netcast.+smarttv|lg (netcast\\.tv-201\\d|android tv))/i        // LG SmartTV\n            ], [[VENDOR, LG], [TYPE, SMARTTV]], [\n            /(apple) ?tv/i                                                      // Apple TV\n            ], [VENDOR, [MODEL, APPLE+' TV'], [TYPE, SMARTTV]], [\n            /crkey/i                                                            // Google Chromecast\n            ], [[MODEL, CHROME+'cast'], [VENDOR, GOOGLE], [TYPE, SMARTTV]], [\n            /droid.+aft(\\w)( bui|\\))/i                                          // Fire TV\n            ], [MODEL, [VENDOR, AMAZON], [TYPE, SMARTTV]], [\n            /\\(dtv[\\);].+(aquos)/i,\n            /(aquos-tv[\\w ]+)\\)/i                                               // Sharp\n            ], [MODEL, [VENDOR, SHARP], [TYPE, SMARTTV]],[\n            /(bravia[\\w ]+)( bui|\\))/i                                              // Sony\n            ], [MODEL, [VENDOR, SONY], [TYPE, SMARTTV]], [\n            /(mitv-\\w{5}) bui/i                                                 // Xiaomi\n            ], [MODEL, [VENDOR, XIAOMI], [TYPE, SMARTTV]], [\n            /\\b(roku)[\\dx]*[\\)\\/]((?:dvp-)?[\\d\\.]*)/i,                          // Roku\n            /hbbtv\\/\\d+\\.\\d+\\.\\d+ +\\([\\w ]*; *(\\w[^;]*);([^;]*)/i               // HbbTV devices\n            ], [[VENDOR, trim], [MODEL, trim], [TYPE, SMARTTV]], [\n            /\\b(android tv|smart[- ]?tv|opera tv|tv; rv:)\\b/i                   // SmartTV from Unidentified Vendors\n            ], [[TYPE, SMARTTV]], [\n\n            ///////////////////\n            // WEARABLES\n            ///////////////////\n\n            /((pebble))app/i                                                    // Pebble\n            ], [VENDOR, MODEL, [TYPE, WEARABLE]], [\n            /droid.+; (glass) \\d/i                                              // Google Glass\n            ], [MODEL, [VENDOR, GOOGLE], [TYPE, WEARABLE]], [\n            /droid.+; (wt63?0{2,3})\\)/i\n            ], [MODEL, [VENDOR, ZEBRA], [TYPE, WEARABLE]], [\n            /(quest( 2)?)/i                                                     // Oculus Quest\n            ], [MODEL, [VENDOR, FACEBOOK], [TYPE, WEARABLE]], [\n\n            ///////////////////\n            // EMBEDDED\n            ///////////////////\n\n            /(tesla)(?: qtcarbrowser|\\/[-\\w\\.]+)/i                              // Tesla\n            ], [VENDOR, [TYPE, EMBEDDED]], [\n\n            ////////////////////\n            // MIXED (GENERIC)\n            ///////////////////\n\n            /droid .+?; ([^;]+?)(?: bui|\\) applew).+? mobile safari/i           // Android Phones from Unidentified Vendors\n            ], [MODEL, [TYPE, MOBILE]], [\n            /droid .+?; ([^;]+?)(?: bui|\\) applew).+?(?! mobile) safari/i       // Android Tablets from Unidentified Vendors\n            ], [MODEL, [TYPE, TABLET]], [\n            /\\b((tablet|tab)[;\\/]|focus\\/\\d(?!.+mobile))/i                      // Unidentifiable Tablet\n            ], [[TYPE, TABLET]], [\n            /(phone|mobile(?:[;\\/]| [ \\w\\/\\.]*safari)|pda(?=.+windows ce))/i    // Unidentifiable Mobile\n            ], [[TYPE, MOBILE]], [\n            /(android[-\\w\\. ]{0,9});.+buil/i                                    // Generic Android Device\n            ], [MODEL, [VENDOR, 'Generic']]\n        ],\n\n        engine : [[\n\n            /windows.+ edge\\/([\\w\\.]+)/i                                       // EdgeHTML\n            ], [VERSION, [NAME, EDGE+'HTML']], [\n\n            /webkit\\/537\\.36.+chrome\\/(?!27)([\\w\\.]+)/i                         // Blink\n            ], [VERSION, [NAME, 'Blink']], [\n\n            /(presto)\\/([\\w\\.]+)/i,                                             // Presto\n            /(webkit|trident|netfront|netsurf|amaya|lynx|w3m|goanna)\\/([\\w\\.]+)/i, // WebKit/Trident/NetFront/NetSurf/Amaya/Lynx/w3m/Goanna\n            /ekioh(flow)\\/([\\w\\.]+)/i,                                          // Flow\n            /(khtml|tasman|links)[\\/ ]\\(?([\\w\\.]+)/i,                           // KHTML/Tasman/Links\n            /(icab)[\\/ ]([23]\\.[\\d\\.]+)/i                                       // iCab\n            ], [NAME, VERSION], [\n\n            /rv\\:([\\w\\.]{1,9})\\b.+(gecko)/i                                     // Gecko\n            ], [VERSION, NAME]\n        ],\n\n        os : [[\n\n            // Windows\n            /microsoft (windows) (vista|xp)/i                                   // Windows (iTunes)\n            ], [NAME, VERSION], [\n            /(windows) nt 6\\.2; (arm)/i,                                        // Windows RT\n            /(windows (?:phone(?: os)?|mobile))[\\/ ]?([\\d\\.\\w ]*)/i,            // Windows Phone\n            /(windows)[\\/ ]?([ntce\\d\\. ]+\\w)(?!.+xbox)/i\n            ], [NAME, [VERSION, strMapper, windowsVersionMap]], [\n            /(win(?=3|9|n)|win 9x )([nt\\d\\.]+)/i\n            ], [[NAME, 'Windows'], [VERSION, strMapper, windowsVersionMap]], [\n\n            // iOS/macOS\n            /ip[honead]{2,4}\\b(?:.*os ([\\w]+) like mac|; opera)/i,              // iOS\n            /cfnetwork\\/.+darwin/i\n            ], [[VERSION, /_/g, '.'], [NAME, 'iOS']], [\n            /(mac os x) ?([\\w\\. ]*)/i,\n            /(macintosh|mac_powerpc\\b)(?!.+haiku)/i                             // Mac OS\n            ], [[NAME, 'Mac OS'], [VERSION, /_/g, '.']], [\n\n            // Mobile OSes\n            /droid ([\\w\\.]+)\\b.+(android[- ]x86|harmonyos)/i                    // Android-x86/HarmonyOS\n            ], [VERSION, NAME], [                                               // Android/WebOS/QNX/Bada/RIM/Maemo/MeeGo/Sailfish OS\n            /(android|webos|qnx|bada|rim tablet os|maemo|meego|sailfish)[-\\/ ]?([\\w\\.]*)/i,\n            /(blackberry)\\w*\\/([\\w\\.]*)/i,                                      // Blackberry\n            /(tizen|kaios)[\\/ ]([\\w\\.]+)/i,                                     // Tizen/KaiOS\n            /\\((series40);/i                                                    // Series 40\n            ], [NAME, VERSION], [\n            /\\(bb(10);/i                                                        // BlackBerry 10\n            ], [VERSION, [NAME, BLACKBERRY]], [\n            /(?:symbian ?os|symbos|s60(?=;)|series60)[-\\/ ]?([\\w\\.]*)/i         // Symbian\n            ], [VERSION, [NAME, 'Symbian']], [\n            /mozilla\\/[\\d\\.]+ \\((?:mobile|tablet|tv|mobile; [\\w ]+); rv:.+ gecko\\/([\\w\\.]+)/i // Firefox OS\n            ], [VERSION, [NAME, FIREFOX+' OS']], [\n            /web0s;.+rt(tv)/i,\n            /\\b(?:hp)?wos(?:browser)?\\/([\\w\\.]+)/i                              // WebOS\n            ], [VERSION, [NAME, 'webOS']], [\n\n            // Google Chromecast\n            /crkey\\/([\\d\\.]+)/i                                                 // Google Chromecast\n            ], [VERSION, [NAME, CHROME+'cast']], [\n            /(cros) [\\w]+ ([\\w\\.]+\\w)/i                                         // Chromium OS\n            ], [[NAME, 'Chromium OS'], VERSION],[\n\n            // Console\n            /(nintendo|playstation) ([wids345portablevuch]+)/i,                 // Nintendo/Playstation\n            /(xbox); +xbox ([^\\);]+)/i,                                         // Microsoft Xbox (360, One, X, S, Series X, Series S)\n\n            // Other\n            /\\b(joli|palm)\\b ?(?:os)?\\/?([\\w\\.]*)/i,                            // Joli/Palm\n            /(mint)[\\/\\(\\) ]?(\\w*)/i,                                           // Mint\n            /(mageia|vectorlinux)[; ]/i,                                        // Mageia/VectorLinux\n            /([kxln]?ubuntu|debian|suse|opensuse|gentoo|arch(?= linux)|slackware|fedora|mandriva|centos|pclinuxos|red ?hat|zenwalk|linpus|raspbian|plan 9|minix|risc os|contiki|deepin|manjaro|elementary os|sabayon|linspire)(?: gnu\\/linux)?(?: enterprise)?(?:[- ]linux)?(?:-gnu)?[-\\/ ]?(?!chrom|package)([-\\w\\.]*)/i,\n                                                                                // Ubuntu/Debian/SUSE/Gentoo/Arch/Slackware/Fedora/Mandriva/CentOS/PCLinuxOS/RedHat/Zenwalk/Linpus/Raspbian/Plan9/Minix/RISCOS/Contiki/Deepin/Manjaro/elementary/Sabayon/Linspire\n            /(hurd|linux) ?([\\w\\.]*)/i,                                         // Hurd/Linux\n            /(gnu) ?([\\w\\.]*)/i,                                                // GNU\n            /\\b([-frentopcghs]{0,5}bsd|dragonfly)[\\/ ]?(?!amd|[ix346]{1,2}86)([\\w\\.]*)/i, // FreeBSD/NetBSD/OpenBSD/PC-BSD/GhostBSD/DragonFly\n            /(haiku) (\\w+)/i                                                    // Haiku\n            ], [NAME, VERSION], [\n            /(sunos) ?([\\w\\.\\d]*)/i                                             // Solaris\n            ], [[NAME, 'Solaris'], VERSION], [\n            /((?:open)?solaris)[-\\/ ]?([\\w\\.]*)/i,                              // Solaris\n            /(aix) ((\\d)(?=\\.|\\)| )[\\w\\.])*/i,                                  // AIX\n            /\\b(beos|os\\/2|amigaos|morphos|openvms|fuchsia|hp-ux)/i,            // BeOS/OS2/AmigaOS/MorphOS/OpenVMS/Fuchsia/HP-UX\n            /(unix) ?([\\w\\.]*)/i                                                // UNIX\n            ], [NAME, VERSION]\n        ]\n    };\n\n    /////////////////\n    // Constructor\n    ////////////////\n\n    var UAParser = function (ua, extensions) {\n\n        if (typeof ua === OBJ_TYPE) {\n            extensions = ua;\n            ua = undefined;\n        }\n\n        if (!(this instanceof UAParser)) {\n            return new UAParser(ua, extensions).getResult();\n        }\n\n        var _ua = ua || ((typeof window !== UNDEF_TYPE && window.navigator && window.navigator.userAgent) ? window.navigator.userAgent : EMPTY);\n        var _rgxmap = extensions ? extend(regexes, extensions) : regexes;\n\n        this.getBrowser = function () {\n            var _browser = {};\n            _browser[NAME] = undefined;\n            _browser[VERSION] = undefined;\n            rgxMapper.call(_browser, _ua, _rgxmap.browser);\n            _browser.major = majorize(_browser.version);\n            return _browser;\n        };\n        this.getCPU = function () {\n            var _cpu = {};\n            _cpu[ARCHITECTURE] = undefined;\n            rgxMapper.call(_cpu, _ua, _rgxmap.cpu);\n            return _cpu;\n        };\n        this.getDevice = function () {\n            var _device = {};\n            _device[VENDOR] = undefined;\n            _device[MODEL] = undefined;\n            _device[TYPE] = undefined;\n            rgxMapper.call(_device, _ua, _rgxmap.device);\n            return _device;\n        };\n        this.getEngine = function () {\n            var _engine = {};\n            _engine[NAME] = undefined;\n            _engine[VERSION] = undefined;\n            rgxMapper.call(_engine, _ua, _rgxmap.engine);\n            return _engine;\n        };\n        this.getOS = function () {\n            var _os = {};\n            _os[NAME] = undefined;\n            _os[VERSION] = undefined;\n            rgxMapper.call(_os, _ua, _rgxmap.os);\n            return _os;\n        };\n        this.getResult = function () {\n            return {\n                ua      : this.getUA(),\n                browser : this.getBrowser(),\n                engine  : this.getEngine(),\n                os      : this.getOS(),\n                device  : this.getDevice(),\n                cpu     : this.getCPU()\n            };\n        };\n        this.getUA = function () {\n            return _ua;\n        };\n        this.setUA = function (ua) {\n            _ua = (typeof ua === STR_TYPE && ua.length > UA_MAX_LENGTH) ? trim(ua, UA_MAX_LENGTH) : ua;\n            return this;\n        };\n        this.setUA(_ua);\n        return this;\n    };\n\n    UAParser.VERSION = LIBVERSION;\n    UAParser.BROWSER =  enumerize([NAME, VERSION, MAJOR]);\n    UAParser.CPU = enumerize([ARCHITECTURE]);\n    UAParser.DEVICE = enumerize([MODEL, VENDOR, TYPE, CONSOLE, MOBILE, SMARTTV, TABLET, WEARABLE, EMBEDDED]);\n    UAParser.ENGINE = UAParser.OS = enumerize([NAME, VERSION]);\n\n    ///////////\n    // Export\n    //////////\n\n    // check js environment\n    if (typeof(exports) !== UNDEF_TYPE) {\n        // nodejs env\n        if (typeof module !== UNDEF_TYPE && module.exports) {\n            exports = module.exports = UAParser;\n        }\n        exports.UAParser = UAParser;\n    } else {\n        // requirejs env (optional)\n        if (typeof(define) === FUNC_TYPE && define.amd) {\n            define(function () {\n                return UAParser;\n            });\n        } else if (typeof window !== UNDEF_TYPE) {\n            // browser env\n            window.UAParser = UAParser;\n        }\n    }\n\n    // jQuery/Zepto specific (optional)\n    // Note:\n    //   In AMD env the global scope should be kept clean, but jQuery is an exception.\n    //   jQuery always exports to global scope, unless jQuery.noConflict(true) is used,\n    //   and we should catch that.\n    var $ = typeof window !== UNDEF_TYPE && (window.jQuery || window.Zepto);\n    if ($ && !$.ua) {\n        var parser = new UAParser();\n        $.ua = parser.getResult();\n        $.ua.get = function () {\n            return parser.getUA();\n        };\n        $.ua.set = function (ua) {\n            parser.setUA(ua);\n            var result = parser.getResult();\n            for (var prop in result) {\n                $.ua[prop] = result[prop];\n            }\n        };\n    }\n\n})(typeof window === 'object' ? window : this);\n"],"names":["r","e","t","f","n","Array","isArray","length","arguments","_extends","Object","assign","target","i","source","key","prototype","hasOwnProperty","call","apply","this","createBlockAlignmentButton","_ref","alignment","children","props","theme","_props$buttonProps","buttonProps","className","button","active","buttonWrapper","onMouseDown","event","preventDefault","onClick","setAlignment","type","AlignBlockCenterButton","height","viewBox","width","xmlns","d","fill","AlignBlockDefaultButton","AlignBlockLeftButton","AlignBlockRightButton","createTextAlignmentButton","getEditorState","getCurrentInlineStyle","has","removeStyles","filter","style","currentEditorState","currentContent","getCurrentContent","selection","getSelection","focusBlock","getBlockForKey","getFocusKey","anchorBlock","getAnchorKey","selectionIsBackward","getIsBackward","changes","anchorOffset","focusOffset","getLength","selectWholeBlocks","merge","modifiedContent","Modifier","applyInlineStyle","finalContent","reduce","content","removeInlineStyle","nextEditorState","EditorState","push","setEditorState","AlignTextCenterButton","AlignTextLeftButton","AlignTextRightButton","createBlockStyleButton","blockType","editorState","getStartKey","getType","blockTypeIsActive","RichUtils","toggleBlockType","BlockquoteButton","createInlineStyleButton","toggleInlineStyle","BoldButton","CodeBlockButton","CodeButton","HeadlineOneButton","HeadlineThreeButton","HeadlineTwoButton","ItalicButton","OrderedListButton","SubButton","SupButton","UnderlineButton","UnorderedListButton","_setPrototypeOf","o","p","setPrototypeOf","__proto__","_objectWithoutPropertiesLoose","excluded","sourceKeys","keys","indexOf","keyBindingFn","getDefaultKeyBinding","handleKeyCommand","command","eventTimeStamp","newState","onBackspace","onDelete","_excluded$1","_excluded2","createPluginHooks","plugins","pluginFunction","pluginHooks","handledAttributes","Set","forEach","plugin","attrName","add","startsWith","methodName","pluginMethods","_len2","args","_key2","some","fn","concat","createEventHooks","isEditorHandleKey","endsWith","isEditorFnKey","blockRendererFn","block","resultBlock","result","undefined","pluginProps","pluginRest","_resultBlock","rest","component","blockRendererFnHook","blockStyleFn","styles","join","blockStyleFnHook","customStyleFn","customStyleFnHook","keyBindingFnHook","_len","_key","createHandleHooks","KEY_SEPARATOR","MultiDecorator","decorators","_proto","getDecorations","contentState","decorations","getText","decorator","offset","getComponentForKey","getDecoratorForKey","getInnerKey","getPropsForKey","parts","split","index","Number","get","slice","decoratorIsCustom","resolveDecorators","onChange","_ref$plugins","List","flatMap","getDecoratorsFromProps","compositeDecorator","convertedDecorators","map","Component","toJS","CompositeDecorator","createCompositeDecorator","customDecorators","_excluded","getDecoratorLength","obj","_obj$decorators","_obj$_decorators","size","_decorators","PluginEditor","_Component","subClass","superClass","_props","_this","editor","state","readOnly","newEditorState","resolvePlugins","getPluginMethods","getPlugins","getProps","getReadOnly","setReadOnly","setState","getEditorRef","defaultKeyBindings","defaultKeyCommands","resolveCustomStyleMap","plug","customStyleMap","resolveblockRenderMap","blockRenderMap","maps","Map","defaultBlockRenderMap","DefaultDraftBlockRenderMap","resolveAccessibilityProps","accessibilityProps","getAccessibilityProps","popupProps","ariaHasPopup","ariaExpanded","initialize","create","constructor","focus","blur","componentDidMount","set","moveSelectionToEnd","componentDidUpdate","prevProps","next","currDec","getDecorator","nextDec","componentWillUnmount","_this2","willUnmount","render","_this3","_this$props","editorProps","Editor","ref","element","propTypes","isRequired","defaultProps","PluginEditor$1","createEditorStateWithText","text","createWithText","createWithContent","ContentState","createFromText","composeDecorators","funcs","arg","last","module","exports","SLICE$0","createClass","ctor","Iterable","value","isIterable","Seq","KeyedIterable","isKeyed","KeyedSeq","IndexedIterable","isIndexed","IndexedSeq","SetIterable","isAssociative","SetSeq","maybeIterable","IS_ITERABLE_SENTINEL","maybeKeyed","IS_KEYED_SENTINEL","maybeIndexed","IS_INDEXED_SENTINEL","maybeAssociative","isOrdered","maybeOrdered","IS_ORDERED_SENTINEL","Keyed","Indexed","DELETE","SHIFT","SIZE","MASK","NOT_SET","CHANGE_LENGTH","DID_ALTER","MakeRef","SetRef","OwnerID","arrCopy","arr","len","Math","max","newArr","ii","ensureSize","iter","__iterate","returnTrue","wrapIndex","uint32Index","NaN","wholeSlice","begin","end","resolveBegin","resolveIndex","resolveEnd","defaultIndex","min","ITERATE_KEYS","ITERATE_VALUES","ITERATE_ENTRIES","REAL_ITERATOR_SYMBOL","Symbol","iterator","FAUX_ITERATOR_SYMBOL","ITERATOR_SYMBOL","Iterator","iteratorValue","k","v","iteratorResult","done","iteratorDone","hasIterator","getIteratorFn","isIterator","maybeIterator","getIterator","iterable","iteratorFn","isArrayLike","emptySequence","toSeq","seqFromValue","toKeyedSeq","fromEntrySeq","keyedSeqFromValue","entrySeq","toIndexedSeq","indexedSeqFromValue","toSetSeq","toString","KEYS","VALUES","ENTRIES","inspect","toSource","of","__toString","cacheResult","_cache","__iterateUncached","toArray","reverse","seqIterate","__iterator","seqIterator","isSeq","EMPTY_SEQ","EMPTY_REPEAT","EMPTY_RANGE","IS_SEQ_SENTINEL","ArraySeq","array","_array","ObjectSeq","object","_object","_keys","IterableSeq","_iterable","IteratorSeq","_iterator","_iteratorCache","maybeSeq","seq","TypeError","maybeIndexedSeqFromValue","useKeys","cache","maxIndex","entry","__iteratorUncached","fromJS","json","converter","fromJSWith","fromJSDefault","parentJSON","isPlainObj","toList","toMap","is","valueA","valueB","valueOf","equals","deepEqual","a","b","__hash","notAssociative","entries","every","flipped","_","allEqual","bSize","Repeat","times","_value","Infinity","invariant","condition","error","Error","Range","start","step","abs","_start","_end","_step","ceil","Collection","KeyedCollection","IndexedCollection","SetCollection","notSetValue","iterations","val","includes","searchValue","lastIndexOf","this$0","other","possibleIndex","floor","offsetValue","imul","c","smi","i32","hash","h","STRING_HASH_CACHE_MIN_STRLEN","cachedHashString","hashString","hashCode","hashJSObj","string","stringHashCache","STRING_HASH_CACHE_SIZE","STRING_HASH_CACHE_MAX_SIZE","charCodeAt","usingWeakMap","weakMap","UID_HASH_KEY","canDefineProperty","propertyIsEnumerable","getIENodeHash","objHashUID","isExtensible","defineProperty","nodeType","node","uniqueID","documentElement","WeakMap","assertNotInfinite","emptyMap","isMap","withMutations","maybeMap","IS_MAP_SENTINEL","_root","updateMap","setIn","keyPath","updateIn","remove","deleteIn","update","updater","updatedValue","updateInDeepMap","forceIterator","clear","__ownerID","__altered","mergeIntoMapWith","mergeWith","merger","mergeIn","iters","m","mergeDeep","deepMerger","mergeDeepWith","deepMergerWith","mergeDeepIn","sort","comparator","OrderedMap","sortFactory","sortBy","mapper","mutable","asMutable","wasAltered","__ensureOwner","asImmutable","MapIterator","iterate","ownerID","makeMap","EMPTY_MAP","MapPrototype","ArrayMapNode","BitmapIndexedNode","bitmap","nodes","HashArrayMapNode","count","HashCollisionNode","keyHash","ValueNode","_type","_reverse","_stack","mapIteratorFrame","mapIteratorValue","prev","__prev","root","newRoot","newSize","didChangeSize","didAlter","updateNode","shift","isLeafNode","mergeIntoNode","newNode","idx1","idx2","createNodes","packNodes","excluding","packedII","packedNodes","bit","expandNodes","including","expandedNodes","iterables","mergeIntoCollectionWith","existing","nextValue","collection","x","mergeIntoMap","keyPathIter","isNotSet","existingValue","newValue","nextExisting","nextUpdated","popCount","idx","canEdit","newArray","spliceIn","newLen","after","spliceOut","pop","removeIn","removed","exists","MAX_ARRAY_MAP_SIZE","isEditable","newEntries","keyHashFrag","MAX_BITMAP_INDEXED_SIZE","newBitmap","newNodes","newCount","MIN_HASH_ARRAY_MAP_SIZE","keyMatch","stack","subNode","empty","emptyList","isList","makeList","VNode","list","setSize","maybeList","IS_LIST_SENTINEL","listNodeFor","_origin","updateList","splice","insert","_capacity","_level","_tail","values","oldSize","setListBounds","unshift","mergeIntoListWith","iterateList","DONE","ListPrototype","removeBefore","level","originIndex","newChild","removingFirst","oldChild","editable","editableVNode","removeAfter","sizeIndex","EMPTY_LIST","EMPTY_ORDERED_MAP","left","right","tailPos","getTailOffset","tail","iterateNodeOrLeaf","iterateLeaf","iterateNode","from","to","origin","capacity","newTail","updateVNode","nodeHas","lowerNode","newLowerNode","rawIndex","owner","oldOrigin","oldCapacity","newOrigin","newCapacity","newLevel","offsetShift","oldTailOffset","newTailOffset","oldTail","beginIndex","maxSize","emptyOrderedMap","isOrderedMap","maybeOrderedMap","makeOrderedMap","omap","_map","_list","updateOrderedMap","newMap","newList","flip","ToKeyedSequence","indexed","_iter","_useKeys","ToIndexedSequence","ToSetSequence","FromEntriesSequence","flipFactory","flipSequence","makeSequence","reversedSequence","cacheResultThrough","mapFactory","context","mappedSequence","reverseFactory","filterFactory","predicate","filterSequence","countByFactory","grouper","groups","groupByFactory","isKeyedIter","coerce","iterableClass","reify","sliceFactory","originalSize","resolvedBegin","resolvedEnd","sliceSize","resolvedSize","sliceSeq","skipped","isSkipping","takeWhileFactory","takeSequence","iterating","skipWhileFactory","skipSequence","skipping","concatFactory","isKeyedIterable","singleton","concatSeq","flatten","sum","flattenFactory","depth","flatSequence","stopped","flatDeep","currentDepth","flatMapFactory","interposeFactory","separator","interposedSequence","defaultComparator","maxFactory","maxCompare","comp","zipWithFactory","keyIter","zipper","zipSequence","iterators","isDone","steps","s","validateEntry","resolveSize","Record","defaultValues","name","hasInitialized","RecordType","setProps","RecordTypePrototype","_name","_defaultValues","RecordPrototype","valueSeq","indexedIterable","recordName","defaultVal","_empty","makeRecord","likeRecord","record","getPrototypeOf","names","setProp","bind","emptySet","isSet","maybeSet","IS_SET_SENTINEL","fromKeys","keySeq","updateSet","union","intersect","originalSet","subtract","OrderedSet","__make","EMPTY_SET","SetPrototype","__empty","makeSet","emptyOrderedSet","isOrderedSet","maybeOrderedSet","EMPTY_ORDERED_SET","OrderedSetPrototype","makeOrderedSet","Stack","emptyStack","isStack","unshiftAll","maybeStack","IS_STACK_SENTINEL","head","_head","peek","makeStack","pushAll","EMPTY_STACK","StackPrototype","mixin","methods","keyCopier","getOwnPropertySymbols","__toJS","toJSON","toObject","toOrderedMap","toOrderedSet","toSet","toStack","__toStringMapper","returnValue","find","findEntry","found","findLastEntry","sideEffect","joined","isFirst","reducer","initialReduction","reduction","useFirst","reduceRight","reversed","not","butLast","isEmpty","countBy","entriesSequence","entryMapper","filterNot","findLast","first","searchKey","getIn","searchKeyPath","nested","groupBy","hasIn","isSubset","isSuperset","keyMapper","maxBy","neg","defaultNegComparator","minBy","skip","amount","skipLast","skipWhile","skipUntil","take","takeLast","takeWhile","takeUntil","hashIterable","IterablePrototype","quoteString","chain","contains","noLengthWarning","console","warn","findKey","findLastKey","keyOf","lastKeyOf","mapEntries","mapKeys","KeyedIterablePrototype","JSON","stringify","defaultZipper","ordered","keyed","murmurHashOfSize","hashMerge","findIndex","removeNum","numArgs","spliced","findLastIndex","interpose","interleave","zipped","interleaved","zip","zipWith","factory","Toolbar","_React$Component","overrideContent","onOverrideContent","renderDefaultButtons","externalProps","store","OverrideContent","childrenProps","buttonStyles","getItem","toolbarStyles","toolbar","Seperator","_ref$className","defaultTheme","config","initialState","listeners","subscribeToItem","callback","unsubscribeFromItem","listener","currentListener","updateItem","item","_extends2","createStore","_config$theme","clsx","_toConsumableArray","arr2","_arrayWithoutHoles","_iterableToArray","_nonIterableSpread","ownKeys","enumerableOnly","sym","getOwnPropertyDescriptor","enumerable","_objectSpread","_defineProperty","getOwnPropertyDescriptors","defineProperties","configurable","writable","_slicedToArray","_arrayWithHoles","_arr","_n","_d","_e","_s","_i","err","_iterableToArrayLimit","_nonIterableRest","customMap","defaults","_defaults","defaultStyleMap","defaultStyleOrder","styleMap","styleOrder","_i2","_Object$keys","_styleName","defaultStyles","ATTR_NAME_MAP","acceptCharset","htmlFor","httpEquiv","attributes","normalized","didNormalize","newName","VENDOR_PREFIX","NUMERIC_STRING","UPPERCASE_PATTERN","isUnitlessNumber","animationIterationCount","borderImageOutset","borderImageSlice","borderImageWidth","boxFlex","boxFlexGroup","boxOrdinalGroup","columnCount","flex","flexGrow","flexPositive","flexShrink","flexNegative","flexOrder","gridRow","gridRowEnd","gridRowSpan","gridRowStart","gridColumn","gridColumnEnd","gridColumnSpan","gridColumnStart","fontWeight","lineClamp","lineHeight","opacity","order","orphans","tabSize","widows","zIndex","zoom","fillOpacity","floodOpacity","stopOpacity","strokeDasharray","strokeDashoffset","strokeMiterlimit","strokeOpacity","strokeWidth","styleDescr","styleValue","isNumeric","test","String","processStyleValue","styleName","replace","toLowerCase","processStyleName","BLOCK_TYPE","UNSTYLED","HEADER_ONE","HEADER_TWO","HEADER_THREE","HEADER_FOUR","HEADER_FIVE","HEADER_SIX","UNORDERED_LIST_ITEM","ORDERED_LIST_ITEM","BLOCKQUOTE","PULLQUOTE","CODE","ATOMIC","ENTITY_TYPE","LINK","IMAGE","EMBED","INLINE_STYLE","BOLD","ITALIC","STRIKETHROUGH","UNDERLINE","getStyleRanges","charMetaList","charStyle","prevCharStyle","ranges","rangeStart","meta","getStyle","_DEFAULT_STYLE_MAP","_ENTITY_ATTR_MAP","_DATA_TO_ATTR","_defineProperties","descriptor","BREAK","DATA_ATTRIBUTE","DEFAULT_STYLE_MAP","DEFAULT_STYLE_ORDER","ENTITY_ATTR_MAP","url","href","rel","title","src","alt","DATA_TO_ATTR","entityType","entity","attrMap","data","getData","attrs","dataKey","dataValue","_Object$keys2","getTags","defaultBlockTag","MarkupGenerator","options","instance","Constructor","_classCallCheck","_combineOrderedStyles2","inlineStyles","inlineStyleFn","protoProps","staticProps","output","blocks","getBlocksAsArray","totalBlocks","currentBlock","indentLevel","wrapperTag","processBlock","closeWrapperTag","trim","_this$options","blockRenderers","newWrapperTag","getWrapperTag","openWrapperTag","indent","customRenderer","customRendererOutput","writeStartTag","renderBlockContent","nextBlock","getNextBlock","canHaveDepth","getDepth","thisWrapperTag","processBlocksAtDepth","writeEndTag","attrString","tags","_style","styleAttr","stringifyAttrs","_iteratorNormalCompletion","_didIteratorError","_iteratorError","tag","_iteratorNormalCompletion2","_didIteratorError2","_iteratorError2","_step2","_iterator2","repeat","styleSet","renderConfig","_renderConfig$element","entityPieces","charEntity","prevCharEntity","getEntity","getEntityRanges","preserveWhitespace","getCharacterList","_ref2","entityStyle","_ref3","entityKey","_ref4","_ref5","encodeContent","_iteratorNormalCompletion3","_didIteratorError3","_iteratorError3","_step3","_iterator3","_this$inlineStyles$_s","_style2","withCustomInlineStyles","toUpperCase","entityStyleFn","_entityStyle","_style3","_attrString","_attrString2","newText","_i3","_Object$keys3","stateToHTML","generate","BlockMapBuilder","CharacterMetadata","ContentBlock","ContentBlockNode","DraftModifier","generateRandomKey","gkx","Immutable","moveBlockInContentState","experimentalTreeDataSupport","ContentBlockRecord","AtomicBlockUtils","insertAtomicBlock","character","selectionState","afterRemoval","removeRange","targetSelection","getSelectionAfter","afterSplit","splitBlock","insertionTarget","asAtomicBlock","setBlockType","charData","atomicBlockConfig","characterList","atomicDividerBlockConfig","nextSibling","prevSibling","fragmentArray","fragment","createFromArray","withAtomicBlock","replaceWithFragment","newContent","selectionBefore","selectionAfter","moveAtomicBlock","atomicBlock","targetRange","insertionMode","withMovedAtomicBlock","targetBlock","getEndKey","selectionAfterRemoval","_targetBlock","getStartOffset","getEndOffset","selectionAfterSplit","_targetBlock2","getKey","findRangesImmutable","getOwnObjectValues","LeafRange","DecoratorRange","decoratorKey","leaves","BlockTree","textLength","leafSets","chars","areEqual","generateLeaves","leaf","characters","_require","defaultRecord","_CharacterMetadataRec","hasStyle","applyStyle","withStyle","removeStyle","withoutStyle","applyEntity","withEntity","EMPTY","configMap","pool","newCharacter","CompositeDraftDecorator","counter","strategy","canOccupySlice","targetArr","componentKey","occupySlice","parseInt","_ContentBlockRecord","decorateCharacterList","getInlineStyleAt","getEntityAt","findStyleRanges","filterFn","haveEqualStyle","findEntityRanges","haveEqualEntity","charA","charB","parent","getChildKeys","getParentKey","getPrevSiblingKey","getNextSiblingKey","DraftEntity","SelectionState","sanitizeDraftText","ImmutableMap","ContentStateRecord","entityMap","blockMap","ContentBlockNodeRecord","_ContentStateRecord","getEntityMap","getBlockMap","getSelectionBefore","getKeyBefore","getKeyAfter","getBlockAfter","getBlockBefore","getFirstBlock","getLastBlock","getPlainText","delimiter","getLastCreatedEntityKey","__getLastCreatedEntityKey","hasText","escape","createEntity","mutability","__create","mergeEntityData","toMerge","__mergeData","replaceEntityData","newData","__replaceData","addEntity","__add","__get","getAllEntities","__getAll","loadWithEntities","entities","__loadWithEntities","createFromBlockArray","theBlocks","contentBlocks","createEmpty","createContentBlockFromJS","ContentStateInlineStyle","inlineStyle","modifyInlineStyle","addOrRemove","startKey","startOffset","endKey","endOffset","newBlocks","blockKey","sliceStart","sliceEnd","current","UserAgent","findAncestorOffsetKey","getWindowForNode","nullthrows","DOM_OBSERVER_OPTIONS","subtree","characterData","childList","characterDataOldValue","USE_CHAR_DATA","isBrowser","DOMObserver","container","mutations","containerWindow","MutationObserver","observer","registerMutations","onCharData","Node","registerMutation","observe","addEventListener","stopAndFlushMutations","takeRecords","disconnect","removeEventListener","getMutationTextContent","mutation","removedNodes","textContent","offsetKey","React","cx","section","article","wrapper","createElement","blockquote","atomic","unstyled","aliasedElements","fontFamily","wordWrap","fontStyle","textDecoration","DefaultDraftInlineStyle","DraftEditor","DraftEditorBlock","DraftEntityInstance","KeyBindingUtil","RawDraftContentState","RichTextEditorUtil","convertFromDraftStateToRaw","convertFromRawToDraftState","getVisibleSelectionRect","DraftPublic","EditorBlock","Entity","EntityInstance","convertFromHTML","convertFromRaw","convertToRaw","genKey","_assign","_assertThisInitialized","self","ReferenceError","_inheritsLoose","DraftEditorCompositionHandler","DraftEditorContents","DraftEditorDragHandler","DraftEditorEditHandler","flushControlled","DraftEditorPlaceholder","DraftEffects","Scroll","Style","getScrollPosition","isHTMLElement","isIE","allowSpellCheck","handlerMap","edit","composite","drag","cut","didInitODS","UpdateDraftEditorFlags","_update","_latestEditorState","_blockSelectEvents","_React$Component2","editorContainer","firstChild","scrollPosition","alreadyHasFocus","getHasFocus","editorNode","scrollParent","getScrollParent","y","window","scrollTo","setTop","forceSelection","mode","onPaste","onCut","onCopy","editHandler","handler","_handler","setMode","contentsKey","clipboard","_clipboard","_dragCount","exitCurrentMode","_editorKey","editorKey","_placeholderAccessibilityID","_latestCommittedEditorState","_onBeforeInput","_buildHandler","_onBlur","_onCharacterData","_onCompositionEnd","_onCompositionStart","_onCopy","_onCut","_onDragEnd","_onDragOver","_onDragStart","_onDrop","_onInput","_onFocus","_onKeyDown","_onKeyPress","_onKeyUp","_onMouseDown","_onMouseUp","_onPaste","_onSelect","getEditorKey","_proto2","eventName","method","_showPlaceholder","placeholder","isInCompositionMode","_renderPlaceholder","placeHolderProps","textAlignment","accessibilityID","_renderARIADescribedBy","describedBy","ariaDescribedBy","placeholderID","_this$props2","preventScroll","textDirectionality","rootClass","ariaRole","role","editorContentsProps","_handleEditorContainerRef","ariaActiveDescendantID","ariaAutoComplete","ariaControls","ariaLabel","ariaLabelledBy","ariaMultiline","ariaOwneeID","autoCapitalize","autoComplete","autoCorrect","notranslate","contentEditable","webDriverTestID","onBeforeInput","onBlur","onCompositionEnd","onCompositionStart","onDragEnd","onDragEnter","onDragLeave","onDragOver","onDragStart","onDrop","onFocus","onInput","onKeyDown","onKeyPress","onKeyUp","onMouseUp","onSelect","editorRef","spellCheck","outline","userSelect","WebkitUserSelect","whiteSpace","suppressContentEditableWarning","tabIndex","initODS","ownerDocument","execCommand","g","stripPastedStyles","DraftEditorLeaf","DraftOffsetKey","UnicodeBidi","UnicodeBidiDirection","getElementPosition","getViewportDimensions","isBlockOnSelectionEdge","shouldComponentUpdate","nextProps","tree","direction","blockNode","_node","scrollDelta","nodePosition","offsetHeight","offsetTop","getTop","_renderChildren","lastLeafSet","hasSelection","leafSet","leavesForLeafSet","lastLeaf","jj","encode","isLast","DecoratorComponent","decoratorProps","decoratorOffsetKey","decoratedText","dir","getHTMLDirIfDifferent","getDirection","commonProps","DraftEditorNode","getDraftRenderConfig","configForType","wrapperTemplate","Element","getCustomRenderConfig","CustomComponent","customProps","customEditable","getElementPropsConfig","customConfig","elementProps","customClass","DraftEditorBlockNode","createRef","isContainerNode","blockHasChanged","wrapperRef","htmlBlockNode","acc","child","_getDraftRenderConfig","childProps","getBlockTree","blockProps","nextSiblingKey","shouldNotAddWrapperElement","wrappedSiblings","sibling","childrenIs","cloneElement","applyWrapperElementToSiblings","Keys","editOnSelect","getContentEditableContainer","getDraftEditorSelection","getEntityKeyForSelection","resolved","stillComposing","domObserver","startDOMObserver","setTimeout","resolveComposition","which","RIGHT","LEFT","_editor","RETURN","inCompositionMode","composedChars","_DraftOffsetKey$decod","decode","leafKey","_editorState$getBlock","replacementRange","anchorKey","focusKey","isBackward","currentStyle","replaceText","compositionEndSelectionState","restoreEditorDOM","editorStateWithUpdatedSelection","acceptSelection","joinClasses","getListItemClasses","shouldResetCount","prevEditorState","getDirectionMap","nextNativeContent","getNativelyRenderedContent","wasComposing","nowComposing","prevContent","nextContent","prevDecorator","nextDecorator","mustForceSelection","directionMap","blocksAsArray","processedBlocks","lastWrapperTemplate","_block","componentProps","_className","outputBlocks","_ii","info","wrapperElement","DraftEditorContentsExperimental","nodeBlock","nextBlockKey","DraftEditorDecoratedLeaves","DataTransfer","getCorrectDocumentFromNode","getTextContentFromFiles","getUpdatedSelectionState","isEventHandled","endDrag","nativeEvent","dataTransfer","dropSelection","eventTargetDocument","currentTarget","caretRangeFromPoint","dropRange","startContainer","rangeParent","rangeOffset","getSelectionForEvent","files","getFiles","handleDroppedFiles","fileText","insertTextAtSelection","dragType","_internalDrag","handleDrop","newContentState","moveText","mouseUpEvent","MouseEvent","view","bubbles","cancelable","dispatchEvent","insertText","isChrome","isFirefox","selectionHandler","unstable_flushControlled","DraftEditorTextNode","isHTMLBRElement","setDraftEditorSelection","_setSelection","hasEdgeWithin","targetNode","TEXT_NODE","leafNode","styleObj","mergedStyles","newStyles","Leaves","hasFocus","id","isElement","useNewlineChar","_forceFlag","shouldBeNewline","elementNode","tagName","isNewline","NEWLINE_B","handleExtensionCausedError","uuid","instances","instanceKey","logWarning","oldMethodCall","newMethodCall","mergeData","replaceData","newInstance","_DraftEntityInstanceR","getMutability","getRemovalRange","selectionStart","selectionEnd","entityStart","segments","segment","segmentEnd","segmentStart","removalStart","removalEnd","entityEnd","atStart","atEnd","logBlockedSelectionEvent","logSelectionStateFailure","applyEntityToContentState","getCharacterRemovalRange","getContentStateFragment","insertFragmentIntoContentState","insertTextIntoContentState","modifyBlockForContentState","removeEntitiesAtEdges","removeRangeFromContentState","splitBlockInContentState","rangeToReplace","withoutEntities","withoutText","isCollapsed","removalRange","movedFragment","mergeBlockData","rangeToRemove","removalDirection","startBlock","endBlock","getFocusOffset","getAnchorOffset","startEntityKey","endEntityKey","adjustedRemovalRange","setBlockData","blockData","KEY_DELIMITER","_offsetKey$split$reve","convertFromHTMLToContentBlocks","getSafeBodyFromHTML","DraftPasteProcessor","processHTML","html","processText","textBlocks","textLine","blockNodeConfig","prevSiblingIndex","CHAMELEON_CHARS","WHITESPACE_AND_PUNCTUATION","getPunctuation","DELETE_REGEX","RegExp","BACKSPACE_REGEX","getRemovableWord","matches","exec","DraftRemovableWord","getBackward","getForward","DraftStringKey","unstringify","isListBlock","DraftTreeAdapter","fromRawTreeStateToRawState","draftTreeState","transformedBlocks","traverseInDepthOrder","newBlock","addDepthToChildren","fromRawStateToRawTreeState","draftState","parentStack","treeBlock","lastParent","newParent","entityRanges","inlineStyleRanges","isValidBlock","parentKey","prevSiblingKey","isConnectedTree","eligibleFirstNodes","nodesSeen","currentKey","visitedStack","currentNode","childKeys","_firstNode","isValidTree","bidiService","UnicodeBidiService","EditorBidiService","prevBidiMap","reset","nextBidi","bidiMap","EditorStateRecord","allowUndo","inlineStyleOverride","lastChangeType","nativelyRenderedContent","redoStack","treeMap","undoStack","firstKey","recordConfig","generateNewTreeMap","put","getImmutable","existingDecorator","newTreeMap","previousTreeMap","regenerateTreeForNewDecorator","newBlockMap","newEntityMap","prevBlockMap","prevTreeMap","regenerateTreeForNewBlocks","immutable","_immutable","getAllowUndo","getUndoStack","getRedoStack","getLastChangeType","getInlineStyleOverride","setInlineStyleOverride","override","lookUpwardForInlineStyle","getInlineStyleForCollapsedSelection","getInlineStyleForNonCollapsedSelection","isSelectionAtStartOfContent","isSelectionAtEndOfContent","updateSelection","lastBlock","lastKey","moveFocusToEnd","afterSelectionMove","changeType","mustBecomeBoundary","editorStateChanges","undo","newCurrentContent","redo","fromKey","lastNonEmpty","isSoftNewlineEvent","isOSX","isPlatform","isCtrlKeyCommand","ctrlKey","altKey","isOptionKeyCommand","usesMacOSHeuristics","hasCommandModifier","metaKey","adjustBlockDepthForContentState","currentBlockContainsLink","getCurrentBlockType","getDataObjectForLinkURL","uri","toggleCode","insertSoftNewline","blockBefore","withoutAtomicBlock","withoutBlockStyle","tryToRemoveBlockStyle","blockAfter","atomicBlockTarget","onTab","maxDepth","shiftKey","withAdjustment","typeToSet","toggleLink","withoutLink","SecondaryClipboard","blockEnd","keyAfter","paste","_SelectionStateRecord","serialize","offsetToCheck","adjustment","contentBlock","startArg","applyEntityToContentBlock","encodeEntityRanges","encodeInlineStyleRanges","createRawBlock","entityStorageMap","insertRawBlock","rawBlocks","blockCacheRef","rawBlock","rawDraftContentState","rawState","entityCacheRef","entityStorageKey","stringifiedEntityKey","encodeRawBlocks","rawEntityMap","encodeRawEntityMap","_knownListItemDepthCl","URI","isHTMLAnchorElement","isHTMLImageElement","REGEX_CR","REGEX_LF","REGEX_LEADING_LF","REGEX_NBSP","REGEX_CARRIAGE","REGEX_ZWS","boldValues","notBoldValues","anchorAttr","imgAttr","knownListItemDepthClasses","HTMLTagToRawInlineStyleMap","code","del","em","strike","strong","u","mark","detectInlineStyle","getListItemDepth","depthClass","classList","isValidAnchor","anchorNode","protocol","isValidImage","imageNode","getNamedItem","styleFromNodeAttributes","htmlElement","isListNode","nodeName","ContentBlocksBuilder","blockTypeMap","disambiguate","blockConfigs","currentBlockType","currentEntity","currentText","addDOMNode","_this$blockConfigs","_toBlockConfigs","_trimCurrentText","_makeBlockConfig","getContentBlocks","_toContentBlocks","_toFlatContentBlocks","childConfigs","wasCurrentDepth","wasWrapper","childNodes","_addImgNode","_addAnchorNode","newStyle","_addBreakNode","_addTextNode","_wasCurrentDepth","_wasWrapper","_appendText","_this$characterList","characterMetadata","l","trimLeft","trimRight","image","entityConfig","attr","imageAttribute","getAttribute","anchor","anchorAttribute","_hoistContainersInBlockConfigs","blockConfig","_this2$_extractTextFr","_extractTextFromBlockConfigs","safeBody","desc","elements","buildBlockTypeMap","createCharacterList","decodeEntityRanges","decodeInlineStyleRanges","decodeBlockNodeConfig","decodeCharacterList","rawEntityRanges","rawInlineStyleRanges","range","addKeyIfMissing","updateNodeStack","parentRef","nodesWithParentRef","decodeRawBlocks","isTreeRawBlock","decodeContentBlocks","contentBlockNode","siblings","_index","_children","_contentBlockNode","decodeContentBlockNodes","rawEntityKey","_rawEntityMap$rawEnti","decodeRawEntityMap","characterArray","substr","UnicodeUtils","cursor","notEmptyKey","isSelectionAtLeafStart","setImmediate","FF_QUICKFIND_CHAR","FF_QUICKFIND_LINK_CHAR","_pendingStateFromBeforeInput","handleBeforeInput","timeStamp","mustPreventNative","oldBlockTree","newBlockTree","oldLeafSet","newLeafSet","oldStart","adjustedStart","oldEnd","adjustedEnd","newStart","newEnd","newDecoratorKey","containsNode","getActiveElement","Boolean","preserveSelectionOnBlur","body","_selection","defaultView","rangeCount","focusNode","removeAllRanges","currentSelection","getFragmentFromSelection","setClipboard","isNode","removeFragment","keyCommandPlainBackspace","isGecko","isEngine","domSelection","isNotTextOrElementNode","ELEMENT_NODE","previousSibling","span","parentNode","nodeValue","removeChild","domText","modelText","preserveEntity","charDelta","contentWithAdjustedDOMSelection","inputType","onInputType","keyCommandBackspaceToStartOfLine","keyCommandBackspaceWord","keyCommandDeleteWord","keyCommandInsertNewline","keyCommandMoveSelectionToEndOfBlock","keyCommandMoveSelectionToStartOfBlock","keyCommandPlainDelete","keyCommandTransposeCharacters","keyCommandUndo","keyCode","callDeprecatedHandler","handlerName","deprecatedHandler","handleReturn","ESC","TAB","UP","DOWN","SPACE","onKeyCommand","splitTextIntoTextBlocks","insertFragment","clipboardData","isRichText","defaultFileText","handlePastedFiles","withInsertedText","getHTML","formatPastedText","_editor$props$formatP","handlePastedText","_html","internalClipboard","getClipboard","types","areTextBlocksAndClipboardEqual","htmlFragment","htmlMap","textFragment","textMap","DraftJsDebugLogging","anonymizedDom","extraParams","stacktrace","documentSelection","updatedSelectionState","needsRecovery","strlen","storageMap","encoded","isTruthy","EMPTY_ARRAY","styleList","styleToEncode","filteredInlines","getEncodedInlinesForType","getRangeClientRects","areRectsOnOneLine","rects","minTop","minBottom","maxTop","maxBottom","rect","top","bottom","getNodeLength","DOCUMENT_TYPE_NODE","PROCESSING_INSTRUCTION_NODE","COMMENT_NODE","collapsed","containingElement","cloneRange","computed","getComputedStyle","correctDocument","div","fontSize","position","documentBody","appendChild","getBoundingClientRect","getLineHeightPx","bestContainer","endContainer","bestOffset","setStart","setStartBefore","display","currentContainer","maxIndexToConsider","isSurrogatePair","getSelectionOffsetKeyForNode","searchNode","haystack","areEqualFn","foundFn","nextIndex","seenKeys","MULTIPLIER","pow","isNaN","random","DraftEntitySegments","getRangesForDraftEntity","getEntityRemovalRange","isEntireSelectionWithinEntity","isEntityAtStart","sideToConsider","entityRange","newSelectionState","startSelectionState","endSelectionState","_startSelectionState","_endSelectionState","randomizeBlockMapKeys","blockKeys","startIndex","endIndex","document","shouldFixFirefoxMovement","shouldRemoveWord","getZCommand","getDeleteCommand","BACKSPACE","getBackspaceCommand","getDraftEditorSelectionWithNodes","getPointForNonTextNode","editorRoot","startNode","childOffset","firstLeaf","getFirstLeaf","nodeBeforeCursor","lastChild","getLastLeaf","getTextContentLength","anchorIsTextNode","focusIsTextNode","anchorPoint","focusPoint","filterKey","nextNonDescendantBlock","_rects$","_rects$2","tempRange","clientRects","ancestor","atCommonAncestor","commonAncestorContainer","getClientRects","setEndBefore","isOldIE","doc","implementation","createHTMLDocument","innerHTML","getElementsByTagName","castedNode","childOffsetKey","TEXT_CLIPPING_REGEX","TEXT_TYPES","readCount","results","file","FileReader","_contents","reader","onload","onerror","readAsText","readFile","anchorPath","anchorBlockKey","anchorLeafBlockTree","anchorLeaf","focusPath","focusBlockKey","focusLeafBlockTree","focusLeaf","anchorLeafStart","focusLeafStart","anchorBlockOffset","focusBlockOffset","anchorLeafEnd","focusLeafEnd","getRangeBoundingClientRect","global","getRangeAt","boundingRect","__DRAFT_GKX","insertIntoList","targetKey","targetOffset","isTreeBasedBlockMap","newBlockArr","fragmentSize","finalOffset","finalKey","shouldNotUpdateFromFragmentBlock","headText","headCharacters","appendToHead","updateHead","fragmentBlock","blockSize","tailText","tailCharacters","prependToTail","updateTail","updatedBlockMap","originalBlockMap","fragmentHeadBlock","blockMapState","headKey","targetNextKey","targetParentKey","fragmentRootBlocks","rootBlock","rootBlocks","lastSiblingKey","getRootBlocks","lastRootFragmentBlockKey","originalTargetParentChildKeys","insertionIndex","newChildrenKeysArray","updateBlockMapLinks","fragmentBlockMap","updateExistingBlock","targetListArg","toInsert","targetList","blockText","newOffset","HTMLElement","blockTree","isAtStart","leafStart","getModifierState","expandRangeToStartOfLine","moveSelectionBackward","removeTextWithStrategy","strategyState","toRemove","moveSelectionForward","charBehind","getUTF16Length","charAhead","finalSelection","afterInsert","updateFn","undoneState","operation","getNextDelimiterBlockKey","transformBlock","func","originalBlockToBeMoved","originalTargetBlock","isExperimentalTreeBlock","isInsertedAfterTarget","originalBlockKey","originalTargetKey","originalParentKey","originalNextSiblingKey","originalPrevSiblingKey","newParentKey","newNextSiblingKey","newPrevSiblingKey","parentChildrenList","newParentChildrenList","targetBlockIndex","newChildrenArray","blockToBeMoved","blocksToBeMoved","blockMapWithoutBlocksToBeMoved","nextDelimiterBlockKey","isBlockToBeMoved","hasNextSiblingAndIsNotNextSibling","doesNotHaveNextSiblingAndIsNotDelimiter","blocksBefore","blocksAfter","slicedBlocks","maxDistance","keyBefore","lastRootBlock","newKeysRef","oldKey","nextKey","prevKey","childrenKeys","childKey","randomizeContentBlockNodeKeys","randomizeContentBlockKeys","removeForBlock","charBefore","charAfter","entityBeforeCursor","entityAfterCursor","_getRemovalRange","updatedBlocks","updatedStart","updatedEnd","getAncestorsKeys","parents","getNextValidSibling","nextValidSiblingKey","getPrevValidSibling","prevValidSiblingKey","nextDelimiters","nextDelimiter","getNextDelimitersBlockKeys","delimiterKey","removeFromList","parentAncestors","endBlockchildrenKeys","endBlockAncestors","modifiedStart","anchorBlockSibling","REGEX_BLOCK_DELIMITER","input","getAnonymizedDOM","getNodeLabels","anonymized","anonymizeTextWithin","outerHTML","labels","createTextNode","clone","cloneNode","setAttribute","getAnonymizedEditorDOM","hasAttribute","addFocusToSelection","activeElement","extend","nodeWasFocus","activeElementName","nodeIsFocus","selectionRangeCount","selectionAnchorNodeName","selectionAnchorOffset","selectionFocusNodeName","selectionFocusOffset","message","setEnd","addRange","addPointToSelection","createRange","nodeStart","nodeEnd","documentObject","tempKey","tempOffset","hasAnchor","storedFocusNode","storedFocusOffset","blockToSplit","keyBelow","blockAbove","blockBelow","originalBlock","belowBlock","belowBlockKey","NEWLINE_REGEX","PhotosMimeType","createArrayFromMixed","emptyFunction","CR_LF_REGEX","RICH_TEXT_TYPES","getFileFromDataTransfer","kind","getAsFile","isImage","isLink","getLink","items","getCount","mozItemCount","thatReturnsArgument","hasFiles","ALT","PAGE_UP","PAGE_DOWN","END","HOME","COMMA","PERIOD","A","Z","ZERO","NUMPAD_0","NUMPAD_9","mimeString","getParts","isJpeg","_isViewportScrollElement","scrollTop","newTop","getLeft","scrollLeft","setLeft","newLeft","_isNodeScrollable","overflow","parentWindow","_uri","RANGE_BY_BIDI_TYPE","REGEX_STRONG","REGEX_RTL","firstStrongChar","str","match","firstStrongCharDir","strongChar","NEUTRAL","RTL","LTR","resolveBlockDir","fallback","blockDir","strongFallback","getGlobalDir","isStrong","isDirectionLTR","isDirectionRTL","globalDir","getHTMLDir","setGlobalDir","otherDir","initGlobalDir","defaultDir","_defaultDir","_lastDir","SURROGATE_HIGH_START","SURROGATE_LOW_END","SURROGATE_UNITS_REGEX","isCodeUnitInSurrogateRange","codeUnit","hasSurrogateUnit","pos","posA","posB","substring","getCodePoints","codePoints","codePointAt","second","UserAgentData","VersionRange","mapObject","memoizeStringOnly","compare","version","query","normalizer","normalizePlatformVersion","platformName","browserName","browserFullVersion","isBrowserArchitecture","browserArchitecture","isDevice","deviceName","engineName","engineVersion","platformFullVersion","isPlatformArchitecture","platformArchitecture","UAParser","UNKNOWN","PLATFORM_MAP","getResult","browserVersionData","major","minor","getBrowserVersion","browser","uaData","cpu","architecture","browserMinorVersion","browserVersion","device","model","engine","os","platformVersion","componentRegex","orRegex","rangeRegex","modifierRegex","numericRegex","checkOrExpression","expressions","checkSimpleExpression","startVersion","endVersion","isSimpleVersion","checkRangeExpression","versionComponents","_getModifierAndCompon","getModifierAndComponents","modifier","rangeComponents","checkLessThan","compareComponents","checkGreaterThanOrEqual","checkGreaterThan","lowerBound","upperBound","lastIndex","numeric","isNumber","checkApproximateVersion","checkEqual","number","isFinite","zeroPad","compareNumeric","aPrefix","bPrefix","aNumeric","bNumeric","_normalizeVersions","j","normalizeVersions","aNormalized","bNormalized","_hyphenPattern","isTextNode","outerNode","innerNode","compareDocumentPosition","hasArrayNature","callee","ret","classNames","makeEmptyFunction","thatReturns","thatReturnsFalse","thatReturnsTrue","thatReturnsNull","thatReturnsThis","isWebkit","navigator","userAgent","scrollingElement","compatMode","getElementRect","elem","docElem","round","clientLeft","clientTop","getDocumentScrollElement","getUnboundedScrollPosition","scrollable","documentScrollElement","Window","viewport","xMax","scrollWidth","clientWidth","yMax","scrollHeight","clientHeight","camelize","hyphenate","asString","computedStyle","getPropertyValue","cssFloat","styleFloat","pageXOffset","pageYOffset","getViewportWidth","getViewportHeight","innerWidth","innerHeight","withoutScrollbars","_uppercasePattern","validateFormat","format","argIndex","framesToPop","newClassName","argLength","nextClass","warning","keyValues","iteratee","copyObject","keysIn","arrayEach","assignValue","baseAssign","baseAssignIn","cloneBuffer","copyArray","copySymbols","copySymbolsIn","getAllKeys","getAllKeysIn","getTag","initCloneArray","initCloneByTag","initCloneObject","isBuffer","isObject","argsTag","funcTag","objectTag","cloneableTags","baseClone","bitmask","customizer","isDeep","isFlat","isFull","isArr","isFunc","stacked","subValue","baseForOwn","baseEach","createBaseEach","fromIndex","isObjectLike","arrayMap","baseGet","baseIteratee","baseMap","baseSortBy","baseUnary","compareMultiple","identity","iteratees","orders","baseIndexOf","baseIndexOfWith","seen","accumulator","initAccum","eachFunc","comparer","cloneArrayBuffer","dataView","buffer","byteOffset","byteLength","reFlags","regexp","symbolProto","symbolValueOf","symbol","isSymbol","valIsDefined","valIsNull","valIsReflexive","valIsSymbol","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","compareAscending","objCriteria","criteria","othCriteria","ordersLength","getSymbols","getSymbolsIn","fromRight","baseGetAllKeys","arrayPush","getPrototype","stubArray","cloneDataView","cloneRegExp","cloneSymbol","cloneTypedArray","Ctor","CLONE_DEEP_FLAG","resIndex","now","toNumber","nativeMax","nativeMin","wait","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","trailing","invokeFunc","time","thisArg","shouldInvoke","timeSinceLastCall","timerExpired","trailingEdge","timeWaiting","remainingWait","debounced","isInvoking","leadingEdge","clearTimeout","cancel","flush","castFunction","isString","toInteger","guard","baseIsMap","nodeUtil","nodeIsMap","baseIsSet","nodeIsSet","baseGetTag","Date","baseOrderBy","pull","baseRest","basePullAll","arrayReduce","baseReduce","debounce","toFinite","remainder","baseValues","prop","qs","sep","eq","maxKeys","kstr","vstr","decodeURIComponent","stringifyPrimitive","ks","encodeURIComponent","parse","Alpha","_createClass","_react","_react2","_interopRequireDefault","_reactcss2","alpha","__esModule","newObj","default","_interopRequireWildcard","_Checkboard2","_possibleConstructorReturn","_temp","handleChange","change","calculateChange","hsl","handleMouseDown","handleMouseUp","unbindEventListeners","_inherits","rgb","absolute","borderRadius","radius","checkboard","gradient","background","boxShadow","shadow","margin","pointer","slider","marginTop","transform","vertical","overwrite","renderers","onTouchMove","onTouchStart","PureComponent","Checkboard","white","grey","grid","canvas","isValidElement","ColorWrap","_debounce2","color","Picker","ColorPicker","simpleCheckForValidColor","colors","toState","oldHue","onChangeComplete","handleSwatchHover","onSwatchHover","optionalEvents","EditableInput","VALID_KEY_CODES","idCounter","handleBlur","blurValue","setUpdatedValue","handleKeyDown","getNumberValue","getArrowOffset","handleDrag","dragLabel","movementX","dragMax","getValueObjectWithLabel","inputId","prevState","label","arrowOffset","onChangeValue","wrap","hideLabel","Hue","hue","_props$direction","padding","Raised","_propTypes2","_merge2","zDepth","_ref$styles","passedStyles","bg","oneOf","Saturation","_throttle2","saturation","throttle","renderWindow","getContainerRenderWindow","black","circle","hsv","Swatch","_interaction","_ref$onClick","onHover","_ref$title","_ref$focusStyle","focusStyle","transparent","swatch","onMouseOver","handleFocus","_Alpha","_Checkboard","_EditableInput","_Hue","_Raised","_Saturation","_ColorWrap","_Swatch","SketchFields","_common","hex","disableAlpha","fields","paddingTop","single","paddingLeft","double","border","textAlign","paddingBottom","textTransform","isValidHex","SketchPresetColors","borderTop","flexWrap","swatchWrap","handleClick","colorObjOrString","arrayOf","oneOfType","shape","initialA","containerWidth","containerHeight","pageX","touches","pageY","_a","checkboardCache","c1","c2","serverCanvas","ctx","getContext","fillStyle","fillRect","translate","toDataURL","isvalidColorString","red","getContrastingColor","_each2","_tinycolor2","checked","passed","letter","toHsl","toHsv","toRgb","toHex","lh","charAt","isValid","col","stringWithoutDegree","_ok","_h","Span","Focus","_container$getBoundin","bright","ReactReduxContext","batch","getBatch","nullListeners","notify","Subscription","parentSub","unsubscribe","handleChangeWrapper","addNestedSub","trySubscribe","subscribe","notifyNestedSubs","onStateChange","isSubscribed","createListenerCollection","tryUnsubscribe","useIsomorphicLayoutEffect","useLayoutEffect","useEffect","contextValue","useMemo","subscription","previousState","getState","Context","Provider","NO_SUBSCRIPTION_ARRAY","storeStateUpdatesReducer","action","updateCount","payload","useIsomorphicLayoutEffectWithArgs","effectFunc","effectArgs","dependencies","captureWrapperProps","lastWrapperProps","lastChildProps","renderIsScheduled","wrapperProps","actualChildProps","childPropsFromStoreUpdate","subscribeUpdates","shouldHandleStateChanges","childPropsSelector","forceComponentUpdateDispatch","didUnsubscribe","lastThrownError","checkForUpdates","newChildProps","latestStoreState","initStateUpdates","connectAdvanced","selectorFactory","_ref2$getDisplayName","getDisplayName","_ref2$methodName","_ref2$renderCountProp","renderCountProp","_ref2$shouldHandleSta","_ref2$storeKey","storeKey","_ref2$forwardRef","withRef","forwardRef","_ref2$context","connectOptions","WrappedComponent","wrappedComponentName","displayName","selectorFactoryOptions","pure","usePureOnlyMemo","ConnectFunction","_useMemo","reactReduxForwardedRef","propsContext","ContextToUse","Consumer","isContextConsumer","useContext","didStoreComeFromProps","dispatch","createChildSelector","_useMemo2","overriddenContextValue","_useReducer","useReducer","previousStateUpdateResult","useRef","renderedWrappedComponent","Connect","forwarded","shallowEqual","objA","objB","keysA","keysB","wrapMapToPropsConstant","getConstant","constant","constantSelector","dependsOnOwnProps","getDependsOnOwnProps","mapToProps","wrapMapToPropsFunc","proxy","stateOrDispatch","ownProps","mapDispatchToProps","actionCreators","boundActionCreators","_loop","actionCreator","bindActionCreators","mapStateToProps","defaultMergeProps","stateProps","dispatchProps","mergeProps","mergedProps","areMergedPropsEqual","hasRunOnce","nextMergedProps","wrapMergePropsFunc","impureFinalPropsSelectorFactory","pureFinalPropsSelectorFactory","areStatesEqual","areOwnPropsEqual","areStatePropsEqual","hasRunAtLeastOnce","handleSubsequentCalls","nextState","nextOwnProps","nextStateProps","statePropsChanged","propsChanged","stateChanged","finalPropsSelectorFactory","initMapStateToProps","initMapDispatchToProps","initMergeProps","factories","strictEqual","createConnect","_ref$connectHOC","connectHOC","_ref$mapStateToPropsF","mapStateToPropsFactories","_ref$mapDispatchToPro","mapDispatchToPropsFactories","_ref$mergePropsFactor","mergePropsFactories","_ref$selectorFactory","_ref3$pure","_ref3$areStatesEqual","_ref3$areOwnPropsEqua","_ref3$areStatePropsEq","_ref3$areMergedPropsE","extraOptions","createStoreHook","useReduxContext","createDispatchHook","useStore","useDispatch","refEquality","createSelectorHook","selector","equalityFn","_useReduxContext","selectedState","contextSub","forceRender","latestSubscriptionCallbackError","latestSelector","latestSelectedState","storeState","newSelectedState","newStoreState","_newSelectedState","useSelectorWithStoreAndSubscription","useDebugValue","newBatch","useSelector","autoprefix","_forOwn2","_forOwn3","transforms","msBorderRadius","MozBorderRadius","OBorderRadius","WebkitBorderRadius","msBoxShadow","MozBoxShadow","OBoxShadow","WebkitBoxShadow","WebkitTouchCallout","KhtmlUserSelect","MozUserSelect","msUserSelect","WebkitBoxFlex","MozBoxFlex","WebkitFlex","msFlex","flexBasis","WebkitFlexBasis","justifyContent","WebkitJustifyContent","transition","msTransition","MozTransition","OTransition","WebkitTransition","msTransform","MozTransform","OTransform","WebkitTransform","otherElementStyles","otherStyle","prefixed","expanded","Active","hover","Hover","handleMouseOver","handleMouseOut","onMouseOut","flattenNames","_isString3","_isPlainObject3","_map3","things","thing","ReactCSS","loop","handleActive","handleHover","_flattenNames2","_mergeClasses2","_autoprefix2","_hover3","_active2","_loop3","classes","activations","activeNames","merged","mergeClasses","_cloneDeep3","registerImmediate","channel","messagePrefix","onGlobalMessage","nextHandle","tasksByHandle","currentlyRunningATask","attachTo","process","handle","nextTick","runIfPresent","postMessage","importScripts","postMessageIsAsynchronous","oldOnMessage","onmessage","canUsePostMessage","MessageChannel","port1","port2","script","onreadystatechange","attachEvent","Function","task","clearImmediate","run","tinyCounter","mathRound","mathMin","mathMax","mathRandom","tinycolor","opts","ok","named","matchers","rgba","hsla","hsva","hex8","parseIntFromHex","convertHexToDecimal","hex6","hex4","hex3","stringInputToObject","isValidCSSUnit","bound01","convertToPercentage","q","mod","hsvToRgb","hue2rgb","hslToRgb","boundAlpha","inputToRGB","_originalInput","_r","_g","_b","_roundA","_format","_gradientType","gradientType","_tc_id","rgbToHsl","rgbToHsv","rgbToHex","allow3Char","pad2","rgbaToArgbHex","convertDecimalToHex","desaturate","clamp01","saturate","greyscale","lighten","brighten","darken","spin","complement","triad","tetrad","splitcomplement","analogous","slices","part","monochromatic","modification","isDark","getBrightness","isLight","getOriginalInput","getFormat","getAlpha","getLuminance","RsRGB","GsRGB","BsRGB","setAlpha","toHsvString","toHslString","toHexString","toHex8","allow4Char","rgbaToHex","toHex8String","toRgbString","toPercentageRgb","toPercentageRgbString","toName","hexNames","toFilter","secondColor","hex8String","secondHex8String","formatSet","formattedString","hasAlpha","_applyModification","_applyCombination","fromRatio","newColor","color1","color2","mix","rgb1","rgb2","readability","isReadable","wcag2","wcag2Parms","out","parms","validateWCAG2Parms","mostReadable","baseColor","colorList","includeFallbackColors","bestColor","bestScore","aliceblue","antiquewhite","aqua","aquamarine","azure","beige","bisque","blanchedalmond","blue","blueviolet","brown","burlywood","burntsienna","cadetblue","chartreuse","chocolate","coral","cornflowerblue","cornsilk","crimson","cyan","darkblue","darkcyan","darkgoldenrod","darkgray","darkgreen","darkgrey","darkkhaki","darkmagenta","darkolivegreen","darkorange","darkorchid","darkred","darksalmon","darkseagreen","darkslateblue","darkslategray","darkslategrey","darkturquoise","darkviolet","deeppink","deepskyblue","dimgray","dimgrey","dodgerblue","firebrick","floralwhite","forestgreen","fuchsia","gainsboro","ghostwhite","gold","goldenrod","gray","green","greenyellow","honeydew","hotpink","indianred","indigo","ivory","khaki","lavender","lavenderblush","lawngreen","lemonchiffon","lightblue","lightcoral","lightcyan","lightgoldenrodyellow","lightgray","lightgreen","lightgrey","lightpink","lightsalmon","lightseagreen","lightskyblue","lightslategray","lightslategrey","lightsteelblue","lightyellow","lime","limegreen","linen","magenta","maroon","mediumaquamarine","mediumblue","mediumorchid","mediumpurple","mediumseagreen","mediumslateblue","mediumspringgreen","mediumturquoise","mediumvioletred","midnightblue","mintcream","mistyrose","moccasin","navajowhite","navy","oldlace","olive","olivedrab","orange","orangered","orchid","palegoldenrod","palegreen","paleturquoise","palevioletred","papayawhip","peachpuff","peru","pink","plum","powderblue","purple","rebeccapurple","rosybrown","royalblue","saddlebrown","salmon","sandybrown","seagreen","seashell","sienna","silver","skyblue","slateblue","slategray","slategrey","snow","springgreen","steelblue","tan","teal","thistle","tomato","turquoise","violet","wheat","whitesmoke","yellow","yellowgreen","parseFloat","isOnePointZero","processPercent","isPercentage","CSS_UNIT","PERMISSIVE_MATCH3","PERMISSIVE_MATCH4","URL_REGEX","__appendEllipsis","ellipsis","truncate","maxLength","remainingLength","FUNC_TYPE","UNDEF_TYPE","OBJ_TYPE","STR_TYPE","MODEL","NAME","TYPE","VENDOR","VERSION","ARCHITECTURE","CONSOLE","MOBILE","TABLET","SMARTTV","WEARABLE","EMBEDDED","AMAZON","APPLE","ASUS","BLACKBERRY","BROWSER","CHROME","FIREFOX","GOOGLE","HUAWEI","LG","MICROSOFT","MOTOROLA","OPERA","SAMSUNG","SHARP","SONY","XIAOMI","ZEBRA","FACEBOOK","enumerize","enums","str1","str2","lowerize","rgxMapper","ua","arrays","regex","strMapper","windowsVersionMap","regexes","EDGE","extensions","_ua","_rgxmap","mergedRegexes","getBrowser","_browser","getCPU","_cpu","getDevice","_device","getEngine","_engine","getOS","_os","getUA","setUA","CPU","DEVICE","ENGINE","OS","$","jQuery","Zepto","parser"],"sourceRoot":""}