@reltio/remotes 1.4.1647 → 1.4.1649

package/6860.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"6860.js","mappings":";imBAEIA,EAAyB,EAAQ,OAIrCC,EAAQ,OAAU,EAClB,IAAIC,EAAiBF,EAAuB,EAAQ,QAChDG,EAAc,EAAQ,OACtBC,GAAW,EAAIF,EAAeG,UAAuB,EAAIF,EAAYG,KAAK,OAAQ,CACpFC,EAAG,kEACD,iBACJN,EAAQ,EAAUG,oCCVdJ,EAAyB,EAAQ,OAIrCC,EAAQ,OAAU,EAClB,IAAIC,EAAiBF,EAAuB,EAAQ,QAChDG,EAAc,EAAQ,OACtBC,GAAW,EAAIF,EAAeG,UAAuB,EAAIF,EAAYG,KAAK,OAAQ,CACpFC,EAAG,gEACD,eACJN,EAAQ,EAAUG,oCCVdJ,EAAyB,EAAQ,OAIrCC,EAAQ,OAAU,EAClB,IAAIC,EAAiBF,EAAuB,EAAQ,QAChDG,EAAc,EAAQ,OACtBC,GAAW,EAAIF,EAAeG,UAAuB,EAAIF,EAAYG,KAAK,OAAQ,CACpFC,EAAG,mDACD,cACJN,EAAQ,EAAUG,oCCVdJ,EAAyB,EAAQ,OAIrCC,EAAQ,OAAU,EAClB,IAAIC,EAAiBF,EAAuB,EAAQ,QAChDG,EAAc,EAAQ,OACtBC,GAAW,EAAIF,EAAeG,UAAuB,EAAIF,EAAYG,KAAK,OAAQ,CACpFC,EAAG,yJACD,gBACJN,EAAQ,EAAUG,oCCVdJ,EAAyB,EAAQ,OAIrCC,EAAQ,OAAU,EAClB,IAAIC,EAAiBF,EAAuB,EAAQ,QAChDG,EAAc,EAAQ,OACtBC,GAAW,EAAIF,EAAeG,UAAuB,EAAIF,EAAYG,KAAK,OAAQ,CACpFC,EAAG,0JACD,eACJN,EAAQ,EAAUG,oCCVdJ,EAAyB,EAAQ,OAIrCC,EAAQ,OAAU,EAClB,IAAIC,EAAiBF,EAAuB,EAAQ,QAChDG,EAAc,EAAQ,OACtBC,GAAW,EAAIF,EAAeG,UAAuB,EAAIF,EAAYG,KAAK,OAAQ,CACpFC,EAAG,gSACD,cACJN,EAAQ,EAAUG,oCCVdJ,EAAyB,EAAQ,OAIrCC,EAAQ,OAAU,EAClB,IAAIC,EAAiBF,EAAuB,EAAQ,QAChDG,EAAc,EAAQ,OACtBC,GAAW,EAAIF,EAAeG,UAAuB,EAAIF,EAAYG,KAAK,OAAQ,CACpFC,EAAG,sBACD,UACJN,EAAQ,EAAUG,iMCLlB,SAAe,EAAAI,EAAA,IAA4B,SAAK,OAAQ,CACtDD,EAAG,wJACD,4BCPJ,MAAME,EAAY,CAAC,QAAS,aAQtBC,GAA4B,EAAAC,EAAA,IAAOC,EAAA,EAAP,EAAmB,EACnDC,MAAAA,MACI,OAAS,CACbC,QAAS,OACTC,WAAY,QAAQF,EAAMG,QAAQ,YAClCC,YAAa,QAAQJ,EAAMG,QAAQ,aACX,UAAvBH,EAAMK,QAAQC,KAAmB,CAClCC,gBAAiBP,EAAMK,QAAQG,KAAK,KACpCC,MAAOT,EAAMK,QAAQG,KAAK,MACxB,CACFD,gBAAiBP,EAAMK,QAAQG,KAAK,KACpCC,MAAOT,EAAMK,QAAQG,KAAK,MACzB,CACDE,aAAc,EACd,oBAAoB,OAAS,GAA2B,UAAvBV,EAAMK,QAAQC,KAAmB,CAChEC,gBAAiBP,EAAMK,QAAQG,KAAK,MAClC,CACFD,gBAAiBP,EAAMK,QAAQG,KAAK,OAEtC,YAAY,OAAS,CACnBG,UAAWX,EAAMY,QAAQ,IACD,UAAvBZ,EAAMK,QAAQC,KAAmB,CAClCC,iBAAiB,QAAUP,EAAMK,QAAQG,KAAK,KAAM,MAClD,CACFD,iBAAiB,QAAUP,EAAMK,QAAQG,KAAK,KAAM,WAGlDK,GAA0B,EAAAf,EAAA,IAAOgB,EAAP,CAAsB,CACpDC,MAAO,GACPC,OAAQ,KA8CV,EAxCA,SAA6BC,GAC3B,MAAM,MACFC,EAAQ,GAAE,UACVC,EAAY,IACVF,EACJG,GAAa,OAA8BH,EAAOrB,GAC9CyB,EAAaJ,EACnB,OAAoB,SAAK,KAAM,CAC7BK,UAAuB,SAAKzB,GAA2B,OAAS,CAC9D0B,aAAa,GACZH,EAAY,CACbC,WAAYA,EACZC,UAAuB,SAAKT,GAAyB,OAAS,CAC5DW,GAAIN,EAAMO,cACVJ,WAAYA,GACXF,EAAUO,qCC1DnB,MAAM,EAAY,CAAC,WAAY,YAAa,YAAa,QAAS,YAAa,aAAc,qBAAsB,sBAAuB,WAAY,aAyBhJC,GAAkB,EAAA7B,EAAA,IAAO8B,EAAA,EAAY,CACzCC,KAAM,iBACNC,KAAM,OACNC,kBAAmB,CAACd,EAAOe,IAClB,CAAC,CACN,CAAC,MAAMC,EAAA,QAA0BD,EAAOE,IACvCF,EAAOG,OANU,CAQrB,IACGC,GAAgB,EAAAtC,EAAA,IAAO,KAAM,CACjC+B,KAAM,iBACNC,KAAM,KACNC,kBAAmB,CAACd,EAAOe,IAAWA,EAAOK,IAHzB,CAInB,CACDpC,QAAS,OACTqC,SAAU,OACVC,WAAY,SACZC,QAAS,EACTC,OAAQ,EACRC,UAAW,SAEPC,GAAuB,EAAA7C,EAAA,IAAO,KAAM,CACxC+B,KAAM,iBACNC,KAAM,YACNC,kBAAmB,CAACd,EAAOe,IAAWA,EAAOY,WAHlB,CAI1B,CACD3C,QAAS,OACT4C,WAAY,OACZ3C,WAAY,EACZE,YAAa,IAEf,SAAS0C,EAAiBC,EAAOC,EAAWJ,EAAWvB,GACrD,OAAO0B,EAAME,QAAO,CAACC,EAAKC,EAASC,KAC7BA,EAAQL,EAAMM,OAAS,EACzBH,EAAMA,EAAII,OAAOH,GAAsB,SAAKR,EAAsB,CAChE,eAAe,EACfK,UAAWA,EACX3B,WAAYA,EACZC,SAAUsB,GACT,aAAaQ,MAEhBF,EAAIK,KAAKJ,GAEJD,IACN,IAEL,MAqKA,EArKiC,cAAiB,SAAqBM,EAASC,GAC9E,MAAMxC,GAAQ,EAAAyC,EAAA,GAAc,CAC1BzC,MAAOuC,EACP3B,KAAM,oBAEF,SACFP,EAAQ,UACR0B,EAAS,UACTW,EAAY,MAAK,MACjBzC,EAAQ,GAAE,UACVC,EAAY,GAAE,WACdyC,EAAa,YAAW,mBACxBC,EAAqB,EAAC,oBACtBC,EAAsB,EAAC,SACvBC,EAAW,EAAC,UACZnB,EAAY,KACV3B,EACJ+C,GAAQ,OAA8B/C,EAAO,IACxCgD,EAAUC,GAAe,YAAe,GACzC7C,GAAa,OAAS,GAAIJ,EAAO,CACrC0C,UAAAA,EACAM,SAAAA,EACAL,WAAAA,EACAC,mBAAAA,EACAC,oBAAAA,EACAC,SAAAA,EACAnB,UAAAA,IAEIuB,EAtFkB9C,CAAAA,IACxB,MAAM,QACJ8C,GACE9C,EAOJ,OAAO,EAAA+C,EAAA,GANO,CACZjC,KAAM,CAAC,QACPD,GAAI,CAAC,MACLG,GAAI,CAAC,MACLO,UAAW,CAAC,cAEe,IAA4BuB,IA4EzCE,CAAkBhD,GAC5BiD,GAAyB,EAAAC,EAAA,GAAa,CAC1CC,YAAatD,EAAMO,cACnBgD,kBAAmBtD,EAAUO,cAC7BL,WAAAA,IAEIqD,EAAU,SAAa,MAkCvBC,EAAW,mBAAuBrD,GAAUsD,QAAOC,GAMnC,iBAAqBA,KACxCC,KAAI,CAACD,EAAOzB,KAAuB,SAAK,KAAM,CAC/CJ,UAAWmB,EAAQjC,GACnBZ,SAAUuD,GACT,SAASzB,OACZ,OAAoB,SAAKzB,GAAiB,OAAS,CACjD8B,IAAKA,EACLE,UAAWA,EACXlD,MAAO,iBACPuC,WAAW,aAAKmB,EAAQhC,KAAMa,GAC9B3B,WAAYA,GACX2C,EAAO,CACR1C,UAAuB,SAAKc,EAAe,CACzCY,UAAWmB,EAAQ9B,GACnBoB,IAAKiB,EACLrD,WAAYA,EACZC,SAAUwB,EAAiBmB,GAAYF,GAAYY,EAAStB,QAAUU,EAAWY,EAvDnDA,CAAAA,GAgB5Bb,EAAsBD,GAAsBc,EAAStB,OAIhDsB,EAEF,IAAIA,EAASI,MAAM,EAAGjB,IAAmC,SAAK,EAAqB,CACxF,aAAcF,EACd1C,MAAO,CACLO,cAAeP,EAAMO,eAEvBN,UAAW,CACTO,cAAe4C,GAEjBU,QA7BwB,KACxBd,GAAY,GAMZ,MAAMe,EAAYP,EAAQvB,QAAQ+B,cAAc,6BAC5CD,GACFA,EAAUE,UAqBX,eAAgBR,EAASI,MAAMJ,EAAStB,OAASQ,EAAoBc,EAAStB,SAwBa+B,CAA0BT,GAAWR,EAAQvB,UAAWA,EAAWvB,4FCjK9J,SAASgE,EAA2BvD,GACzC,OAAO,OAAqB,iBAAkBA,GAEhD,MACA,GAD2B,OAAuB,iBAAkB,CAAC,OAAQ,KAAM,KAAM,8FCDzF,MAAMwD,EAAiB,CAErBC,EAAG,OACHC,GAAI,OACJC,KAAM,OAENC,EAAG,CACDC,YAAa,QACbC,YAAa,QACbC,UAAW,GAEbC,GAAI,QACJC,IAAK,CACHJ,YAAa,QACbC,YAAa,UAEfI,KAAM,CACJL,YAAa,QACbC,YAAa,UAGfK,EAAG,CACDN,YAAa,MACbC,YAAa,QACbC,UAAW,GAEbK,GAAI,MACJC,GAAI,CACFR,YAAa,MACbC,YAAa,qBAGfQ,EAAG,CACDT,YAAa,UACbC,YAAa,QACbC,UAAW,GAEbQ,EAAG,CACDV,YAAa,UACbC,YAAa,QACbC,UAAW,GAEbnG,EAAG,CACDiG,YAAa,UACbC,YAAa,QACbC,UAAW,GAEbS,GAAI,CACFX,YAAa,UACbC,YAAa,UAEfW,IAAK,CACHZ,YAAa,UACbC,YAAa,UAEfY,KAAM,CACJb,YAAa,UACbC,YAAa,UAGfa,EAAG,WACHC,EAAG,WAEHC,EAAG,CACDhB,YAAa,QACbC,YAAa,QACbC,UAAW,GAEbe,GAAI,QACJC,EAAG,CACDlB,YAAa,QACbC,YAAa,QACbC,UAAW,GAEbiB,GAAI,QAEJC,EAAG,CACDpB,YAAa,UACbC,YAAa,QACbC,UAAW,GAEbmB,GAAI,UAEJC,EAAG,CACDtB,YAAa,UACbC,YAAa,QACbC,UAAW,GAEbqB,GAAI,WAEAC,EAAiB,CACrBC,KAAM,OACNC,MAAO,OACPC,WAAY,MACZC,WAAY,IACZC,QAAS,OACTC,aAAc,MACdC,SAAU,KACVC,SAAU,KACVC,SAAU,IACVC,QAAS,KACTC,QAAS,KACTC,SAAU,KACVC,oBAAqB,WACrBC,aAAc,IACdC,UAAW,QACXC,WAAY,SACZC,sBAAuB,aACvBC,aAAc,YACdC,aAAc,SACdC,SAAU,KACVC,YAAa,UACbC,YAAa,QACbC,aAAc,MACdC,gBAAiB,aACjBC,gBAAiB,WACjBC,iBAAkB,OAClBC,oBAAqB,YACrBC,oBAAqB,WAEjBC,EAA0B,CAAC,0BAA2B,kJAAmJ,+FAA+FC,KAAK,MA2B5S,MAAMC,EACXC,aAAY,OACVC,EAAM,QACNC,EAAO,SACPC,GACE,IACFC,KAAKC,cAAe,EACpBD,KAAKE,sBAAuB,EAC5BF,KAAKG,IAAM,SACXH,KAAKI,YAAS,EACdJ,KAAKH,YAAS,EACdG,KAAKF,aAAU,EACfE,KAAKK,kBAAoB,CACvBC,MAAO,IACPC,IAAK,KAEPP,KAAKjE,eAAiBA,EACtBiE,KAAKQ,iBAAmBC,IACtB,MAAMC,EAAiBV,KAAKW,uBAC5B,OAAID,IAAmBD,EAAMZ,SACpBY,EAEFA,EAAMZ,OAAOa,IAEtBV,KAAKY,kBAAoB,SAAgC,IAAnBZ,KAAKI,OAAOS,GAClDb,KAAKc,iBAAmBL,IACtB,MAAMM,EAAcf,KAAKI,OAAOK,GAAOO,QACvC,YAAoBC,IAAhBjB,KAAKH,OACAkB,EAEFA,EAAYlB,OAAOG,KAAKH,SAEjCG,KAAKkB,cAAgBT,IACnB,MAAMM,EAAcf,KAAKI,OAAOe,IAAIV,GACpC,YAAoBQ,IAAhBjB,KAAKH,OACAkB,EAEFA,EAAYlB,OAAOG,KAAKH,SAEjCG,KAAKoB,aAAe,CAACX,EAAOY,KAE1B,IAAKrB,KAAKY,oBACR,MAAM,IAAIU,MAAM7B,GAElB,MAAMsB,EAA2B,YAAbM,EAAyBrB,KAAKI,OAAOK,GAAST,KAAKI,OAAOS,GAAGJ,EAAOY,GACxF,YAAoBJ,IAAhBjB,KAAKH,OACAkB,EAEFA,EAAYlB,OAAOG,KAAKH,SAEjCG,KAAKuB,KAAOd,IACV,GAAc,OAAVA,EACF,OAAO,KAET,MAAML,EAASJ,KAAKI,OAAOK,GAE3B,OADAL,EAAOP,OAAOG,KAAKW,wBACZP,GAETJ,KAAKwB,iBAAmB,CAACf,EAAOY,IAChB,OAAVZ,EACK,KAEQ,QAAbY,EACKrB,KAAKkB,cAAcT,GAEX,WAAbY,GAAsC,YAAbA,IAA2BrB,KAAKY,oBACpDZ,KAAKc,iBAAiBL,GAExBT,KAAKoB,aAAaX,EAAOY,GAElCrB,KAAKyB,YAAchB,IACjB,IAAIiB,EAAWC,EAAMC,EACrB,GAAInB,EAAMoB,QACR,MAAO,MAKT,MAAMC,EAAiC,OAAzBJ,EAAYjB,EAAMsB,SAAc,EAASL,EAAUpJ,KAGjE,OAAyI,OAAjIqJ,EAAe,MAARG,EAAeA,EAA4D,OAApDF,EAAwB5B,KAAKI,OAAO4B,kBAAuB,EAASJ,EAAsBtJ,MAAgBqJ,EAAO,UAEzJ3B,KAAKiC,YAAc,CAACxB,EAAOY,KACzB,IAAIa,EAAwBC,EAC5B,GAAiB,QAAbd,EACF,OAAOZ,EAAM2B,QAAQjB,MAEvB,GAAiB,WAAbE,EACF,OAAOZ,EAAM2B,QAAQpB,QAEvB,IAAKhB,KAAKY,oBAAqB,CAC7B,GAAiB,YAAbS,EACF,OAAOZ,EAIT,MAAM,IAAIa,MAAM7B,GAElB,MAAM4C,EAAyB,YAAbhB,EAC8G,OAA/Ha,EAA+E,OAArDC,EAAyBnC,KAAKI,OAAO4B,kBAAuB,EAASG,EAAuB7J,MAAgB4J,EAAyB,SAAWb,EACrKiB,EAAW7B,EAAM2B,QAEvB,OADAE,EAASzB,GAAGwB,GACLC,GAETtC,KAAKuC,SAAW9B,GACPA,EAAM+B,SAEfxC,KAAKyC,SAAWC,GACP1C,KAAKI,OAAOsC,GAAW,GAEhC1C,KAAK2C,MAAQlC,GACJA,EAAMmC,cAEf5C,KAAK6C,MAAQ,CAACpC,EAAOqC,IACL,KAAVrC,EACK,KAELT,KAAKH,OACAG,KAAKI,OAAOK,EAAOqC,EAAQ9C,KAAKH,QAAQ,GAE1CG,KAAKI,OAAOK,EAAOqC,GAAQ,GAEpC9C,KAAKW,qBAAuB,IACnBX,KAAKH,QAAU,aAExBG,KAAK+C,6BAA+B,IAC3B,MAAMC,KAAK,eAAyBhD,KAAKW,wBAAwBsC,eAAe,OAEzFjD,KAAKkD,aAAeJ,GAGXA,EAAOK,MADgB,+CACa5H,KAAI6H,IAC7C,MAAMC,EAAiBD,EAAM,GAC7B,MAAuB,MAAnBC,GAA6C,MAAnBA,EACrB,eAAyBrD,KAAKW,wBAAwBsC,eAAeG,GAEvEA,KACN1D,KAAK,IAEVM,KAAKsD,oBAAsBR,GAClB9C,KAAKkD,aAAaJ,GAAQS,QAAQ,MAAO,UAAUC,oBAE5DxD,KAAKyD,OAAShD,GACK,OAAVA,EAETT,KAAK0D,QAAUjD,GACNT,KAAKI,OAAOK,GAAOiD,UAE5B1D,KAAK8C,OAAS,CAACrC,EAAOkD,IACb3D,KAAK4D,eAAenD,EAAOT,KAAKF,QAAQ6D,IAEjD3D,KAAK4D,eAAiB,CAACnD,EAAOoD,KAC5B,MAAMC,EAAarD,EAAM2B,QAEzB,OADA0B,EAAWjE,OAAOG,KAAKW,wBAChBmD,EAAWhB,OAAOe,IAE3B7D,KAAK+D,aAAeC,GACXA,EAEThE,KAAKiE,QAAU,CAACxD,EAAOyD,EAAWC,IACzB1D,EAAM2D,KAAKF,EAAWC,GAE/BnE,KAAKqE,QAAU,CAAC5D,EAAOyD,IACP,OAAVzD,GAAgC,OAAdyD,GAGflE,KAAKI,OAAOK,GAAO6D,OAAOJ,GAEnClE,KAAKuE,WAAa,CAAC9D,EAAOyD,IACjBzD,EAAM6D,OAAOJ,EAAW,QAEjClE,KAAKwE,YAAc,CAAC/D,EAAOyD,IAClBzD,EAAM6D,OAAOJ,EAAW,SAEjClE,KAAKyE,UAAY,CAAChE,EAAOyD,IAChBzD,EAAM6D,OAAOJ,EAAW,OAEjClE,KAAK0E,WAAa,CAACjE,EAAOyD,IACjBzD,EAAM6D,OAAOJ,EAAW,QAEjClE,KAAK2E,QAAU,CAAClE,EAAOyD,IACdzD,EAAMkE,QAAQT,GAEvBlE,KAAK4E,YAAc,CAACnE,EAAOyD,IAClBzD,EAAMkE,QAAQT,EAAW,QAElClE,KAAK6E,WAAa,CAACpE,EAAOyD,IACjBzD,EAAMkE,QAAQT,EAAW,OAElClE,KAAK8E,SAAW,CAACrE,EAAOyD,IACfzD,EAAMqE,SAASZ,GAExBlE,KAAK+E,aAAe,CAACtE,EAAOyD,IACnBzD,EAAMqE,SAASZ,EAAW,QAEnClE,KAAKgF,YAAc,CAACvE,EAAOyD,IAClBzD,EAAMqE,SAASZ,EAAW,OAEnClE,KAAKiF,cAAgB,CAACxE,GAAQH,EAAOC,KAC5BE,EAAMyE,UAAU5E,EAAOC,EAAK,KAAM,MAE3CP,KAAKmF,YAAc1E,GACVA,EAAM2B,QAAQgD,QAAQ,QAE/BpF,KAAKqF,aAAe5E,GACXA,EAAM2B,QAAQgD,QAAQ,SAE/BpF,KAAKsF,YAAc7E,GACVA,EAAM2B,QAAQgD,QAAQ,QAE/BpF,KAAKuF,WAAa9E,GACTA,EAAM2B,QAAQgD,QAAQ,OAE/BpF,KAAKwF,UAAY/E,GACRA,EAAM2B,QAAQqD,MAAM,QAE7BzF,KAAK0F,WAAajF,GACTA,EAAM2B,QAAQqD,MAAM,SAE7BzF,KAAK2F,UAAYlF,GACRA,EAAM2B,QAAQqD,MAAM,QAE7BzF,KAAK4F,SAAWnF,GACPA,EAAM2B,QAAQqD,MAAM,OAE7BzF,KAAK6F,SAAW,CAACpF,EAAOqF,IACfA,EAAS,EAAIrF,EAAM2B,QAAQ2D,SAASC,KAAKC,IAAIH,GAAS,SAAWrF,EAAM2B,QAAQ8D,IAAIJ,EAAQ,SAEpG9F,KAAKmG,UAAY,CAAC1F,EAAOqF,IAChBA,EAAS,EAAIrF,EAAM2B,QAAQ2D,SAASC,KAAKC,IAAIH,GAAS,UAAYrF,EAAM2B,QAAQ8D,IAAIJ,EAAQ,UAErG9F,KAAKoG,SAAW,CAAC3F,EAAOqF,IACfA,EAAS,EAAIrF,EAAM2B,QAAQ2D,SAASC,KAAKC,IAAIH,GAAS,SAAWrF,EAAM2B,QAAQ8D,IAAIJ,EAAQ,SAEpG9F,KAAKqG,QAAU,CAAC5F,EAAOqF,IACdA,EAAS,EAAIrF,EAAM2B,QAAQ2D,SAASC,KAAKC,IAAIH,GAAS,QAAUrF,EAAM2B,QAAQ8D,IAAIJ,EAAQ,QAEnG9F,KAAKsG,SAAW,CAAC7F,EAAOqF,IACfA,EAAS,EAAIrF,EAAM2B,QAAQ2D,SAASC,KAAKC,IAAIH,GAAS,SAAWrF,EAAM2B,QAAQ8D,IAAIJ,EAAQ,SAEpG9F,KAAKuG,WAAa,CAAC9F,EAAOqF,IACjBA,EAAS,EAAIrF,EAAM2B,QAAQ2D,SAASC,KAAKC,IAAIH,GAAS,WAAarF,EAAM2B,QAAQ8D,IAAIJ,EAAQ,WAEtG9F,KAAKwG,WAAa,CAAC/F,EAAOqF,IACjBA,EAAS,EAAIrF,EAAM2B,QAAQ2D,SAASC,KAAKC,IAAIH,GAAS,WAAarF,EAAM2B,QAAQ8D,IAAIJ,EAAQ,WAEtG9F,KAAKyG,QAAUhG,GACNA,EAAMiG,IAAI,QAEnB1G,KAAK2G,SAAWlG,GACPA,EAAMiG,IAAI,SAEnB1G,KAAK4G,QAAUnG,GACNA,EAAMiG,IAAI,QAEnB1G,KAAK6G,SAAWpG,GACPA,EAAMiG,IAAI,SAEnB1G,KAAK8G,WAAarG,GACTA,EAAMiG,IAAI,WAEnB1G,KAAK+G,WAAatG,GACTA,EAAMiG,IAAI,WAEnB1G,KAAKgH,gBAAkBvG,GACdA,EAAMiG,IAAI,gBAEnB1G,KAAKiH,QAAU,CAACxG,EAAO5C,IACd4C,EAAM2B,QAAQvE,KAAKA,GAE5BmC,KAAKkH,SAAW,CAACzG,EAAO3C,IACf2C,EAAM2B,QAAQtE,MAAMA,GAE7BkC,KAAKmH,QAAU,CAAC1G,EAAOc,IACdd,EAAM2B,QAAQb,KAAKA,GAE5BvB,KAAKoH,SAAW,CAAC3G,EAAO4G,IACf5G,EAAM2B,QAAQiF,MAAMA,GAE7BrH,KAAKsH,WAAa,CAAC7G,EAAOnC,IACjBmC,EAAM2B,QAAQ9D,QAAQA,GAE/B0B,KAAKuH,WAAa,CAAC9G,EAAOlC,IACjBkC,EAAM2B,QAAQ7D,QAAQA,GAE/ByB,KAAKwH,gBAAkB,CAAC/G,EAAOgH,IACtBhH,EAAM2B,QAAQqF,aAAaA,GAEpCzH,KAAK0H,eAAiBjH,GACbA,EAAMkH,cAEf3H,KAAK4H,aAAenH,GACXA,EAAM2B,QAAQ8D,IAAI,EAAG,SAE9BlG,KAAK6H,iBAAmBpH,GACfA,EAAM2B,QAAQ2D,SAAS,EAAG,SAEnC/F,KAAK8H,cAAgBrH,IACnB,MACMsH,EAAa,CADA/H,KAAKmF,YAAY1E,IAEpC,KAAOsH,EAAWjO,OAAS,IAAI,CAC7B,MAAMkO,EAAYD,EAAWA,EAAWjO,OAAS,GACjDiO,EAAW/N,KAAKgG,KAAK4H,aAAaI,IAEpC,OAAOD,GAET/H,KAAKiI,iBAAmB,CAACC,EAAWC,IAC3BD,EAAU9F,QAAQgG,KAAKD,EAAUC,QAAQC,OAAOF,EAAUE,UAAUC,OAAOH,EAAUG,UAE9FtI,KAAKuI,YAAc,IACV,mBAA4B,GAErCvI,KAAKwI,aAAe/H,IAClB,MAAMgI,EAAczI,KAAKQ,iBAAiBC,GACpCH,EAAQmI,EAAYrG,QAAQgD,QAAQ,SAASA,QAAQ,QACrD7E,EAAMkI,EAAYrG,QAAQqD,MAAM,SAASA,MAAM,QACrD,IAAIiD,EAAQ,EACR9O,EAAU0G,EACd,MAAMqI,EAAc,GACpB,KAAO/O,EAAQkL,SAASvE,IAAM,CAC5B,MAAMqI,EAAa5C,KAAK6C,MAAMH,EAAQ,GACtCC,EAAYC,GAAcD,EAAYC,IAAe,GACrDD,EAAYC,GAAY5O,KAAKJ,GAC7BA,EAAUA,EAAQwI,QAAQ8D,IAAI,EAAG,OACjCwC,GAAS,EAEX,OAAOC,GAET3I,KAAK8I,cAAgBrI,GACZA,EAAMsI,OAEf/I,KAAKgJ,aAAe,CAAC1I,EAAOC,KAC1B,MAAM0I,EAAYjJ,KAAKI,OAAOE,GAAO8E,QAAQ,QACvC8D,EAAUlJ,KAAKI,OAAOG,GAAKkF,MAAM,QACjC0D,EAAQ,GACd,IAAIvP,EAAUqP,EACd,KAAOrP,EAAQkL,SAASoE,IACtBC,EAAMnP,KAAKJ,GACXA,EAAUA,EAAQwI,QAAQ8D,IAAI,EAAG,QAEnC,OAAOiD,GAETnJ,KAAKoJ,gBAAkBC,GACjBrJ,KAAK+C,+BAEA,eAAyB/C,KAAKW,wBAAwBtC,SAAkB,OAATgL,EAAgB,EAAI,GAAI,GAAG,GAEnF,OAATA,EAAgB,KAAO,KAEhCrJ,KAAKI,OAASL,GAAY,IAC1BC,KAAKH,OAASA,EACdG,KAAKF,SAAU,OAAS,GAAIlC,EAAgBkC,6KCvf0O,MAAMxC,GAAE,mBAAE,MAAMgM,EAAEhM,EAAEiM,SAAS,SAASC,IAAI,MAAM1M,GAAE,gBAAEQ,GAAG,GAAG,MAAMR,EAAE,MAAM,IAAIwE,MAAM,+FAA+F,OAAOxE,EAAE,SAAS2M,IAAI,OAAOD,IAAIE,MAAM,SAASC,IAAI,MAAMD,MAAM5M,EAAE8M,UAAUC,GAAGL,KAAKM,EAAE3M,IAAG,cAAE,IAAI,OAAO,gBAAE,KAAM,IAAIL,IAAIgN,EAAE,OAAO,MAAM3M,EAAE,GAAG,OAAO4M,OAAOC,KAAKF,GAAGG,SAASJ,IAAI1M,EAAE0M,GAAGC,EAAED,GAAG/M,EAAEoN,WAAWL,EAAEC,EAAED,OAAO,KAAK/M,GAAG+M,GAAGA,EAAEM,YAAY,GAAGN,EAAEO,aAAa,GAAGL,OAAOC,KAAK7M,GAAG8M,SAASJ,IAAI/M,EAAEoN,WAAWL,EAAE1M,EAAE0M,UAAU,CAAC/M,EAAEgN,EAAED,IAAI1M,EAAE,MAAMN,EAAE,CAAC,YAAY,iBAAiB,WAAW,YAAY,YAAY,kBAAkB,YAAY,YAAY,iBAAiB,WAAW,YAAY,YAAY,kBAAkB,YAAY,aAAa,kBAAkB,YAAY,mBAAmB,aAAa,eAAe,cAAc,QAAQwN,EAAE,CAAC,QAAQ,aAAa,UAAU,YAAY,YAAY,gBAAgB,cAAc,SAASC,EAAE,CAAC,UAAU,YAAY,aAAaC,EAAE,CAAC,WAAW,SAASC,IAAI,MAAM1N,EAAE2M,IAAII,EAAEF,KAAKG,EAAE3M,IAAG,cAAE,IAAI,OAAO,gBAAE,KAAM,IAAIL,IAAIgN,EAAE,OAAO,MAAM3M,EAAE2M,EAAEW,EAAEV,OAAOC,KAAK7M,GAAGO,EAAE,GAAGgN,EAAE,GAAGC,EAAE7N,EAAE8N,cAAc,OAAOH,EAAEI,MAAM/N,GAAG,CAAC,YAAY,iBAAiB,kBAAkB,YAAYgO,SAAShO,OAAM,IAAK6N,EAAEI,wBAAwBrN,EAAEqN,uBAAsB,EAAGL,EAAEK,uBAAsB,GAAIN,EAAEI,MAAM/N,GAAG,CAAC,YAAY,aAAagO,SAAShO,OAAM,IAAK6N,EAAEK,wBAAwBtN,EAAEsN,uBAAsB,EAAGN,EAAEM,uBAAsB,GAAIP,EAAEI,MAAM/N,GAAG,CAAC,aAAagO,SAAShO,OAAM,IAAK6N,EAAEM,wBAAwBvN,EAAEuN,uBAAsB,EAAGP,EAAEO,uBAAsB,GAAIlB,OAAOC,KAAKtM,GAAG5D,OAAO,GAAG+P,EAAEnM,GAAG+M,EAAER,SAASJ,IAAI,MAAMC,EAAE3M,EAAE0M,GAAGhN,EAAEqO,MAAMpO,GAAGA,IAAI+M,KAAK/M,EAAEqO,GAAGtB,EAAEC,GAAGO,EAAEa,MAAMpO,GAAGA,IAAI+M,KAAK/M,EAAEsO,iBAAiBD,GAAGtB,EAAEC,GAAGQ,EAAEY,MAAMpO,GAAGA,IAAI+M,KAAK/M,EAAEuO,iBAAiBF,GAAGtB,EAAEC,GAAGS,EAAEW,MAAMpO,GAAGA,IAAI+M,KAAK/M,EAAEwO,YAAYH,GAAGtB,EAAEC,MAAM,KAAKC,OAAOC,KAAKU,GAAG5Q,OAAO,GAAG+P,EAAEa,GAAG5N,GAAG2N,EAAER,SAASJ,IAAI,MAAMC,EAAE3M,EAAE0M,GAAGhN,EAAEqO,MAAMpO,GAAGA,IAAI+M,KAAK/M,EAAEyO,IAAI1B,EAAEC,GAAGO,EAAEa,MAAMpO,GAAGA,IAAI+M,KAAK/M,EAAEsO,iBAAiBG,IAAI1B,EAAEC,GAAGQ,EAAEY,MAAMpO,GAAGA,IAAI+M,KAAK/M,EAAEuO,iBAAiBE,IAAI1B,EAAEC,GAAGS,EAAEW,MAAMpO,GAAGA,IAAI+M,KAAK/M,EAAEwO,YAAYC,IAAI1B,EAAEC,SAAS,CAAChN,EAAEgN,EAAED,IAAI1M,EAAE,SAASqO,IAAI,MAAM1O,EAAE2M,IAAI,OAAO,kBAAE,CAAEI,EAAEC,GAAE,KAAMhN,GAAG+M,IAAIC,GAAGhN,EAAE2O,WAAWC,MAAM,GAAG5O,EAAE2O,WAAWE,QAAQ7O,EAAE2O,WAAWG,OAAO/B,GAAG/M,EAAE+O,aAAa,CAAC/O,IAAI,SAASgP,EAAEhP,GAAG,MAAM+M,EAAEJ,IAAIK,GAAE,eAAI,aAAEA,EAAElQ,QAAQkD,KAAKgN,EAAElQ,QAAQkD,GAAG,MAAMK,GAAE,kBAAGL,IAAI+M,EAAEyB,YAAYS,aAAahC,OAAOiC,OAAOjC,OAAOiC,OAAO,GAAGlC,EAAElQ,SAASkD,MAAM,CAAC+M,EAAEC,IAAIW,GAAE,kBAAG3N,IAAI+M,EAAEyB,YAAYW,eAAelC,OAAOiC,OAAOjC,OAAOiC,OAAO,GAAGlC,EAAElQ,SAASkD,MAAM,CAAC+M,EAAEC,IAAIpM,GAAE,kBAAGZ,IAAI+M,EAAEyB,YAAYY,cAAcnC,OAAOiC,OAAOjC,OAAOiC,OAAO,GAAGlC,EAAElQ,SAASkD,MAAM,CAAC+M,EAAEC,IAAIqC,GAAE,kBAAE,CAAErP,EAAEK,KAAK0M,EAAEyB,YAAYc,QAAQtP,EAAEiN,OAAOiC,OAAOjC,OAAOiC,OAAO,GAAGlC,EAAElQ,SAASuD,MAAM,CAAC0M,EAAEC,IAAIuC,GAAE,kBAAE,CAAEvP,EAAEK,KAAK,MAAMsN,EAAEZ,EAAEyC,mBAAmBxP,GAAG2N,EAAEZ,EAAEyB,YAAYc,QAAQ3B,EAAEV,OAAOiC,OAAOjC,OAAOiC,OAAO,GAAGlC,EAAElQ,SAASuD,IAAIoP,QAAQC,IAAI,QAAQ1P,iBAAiB,CAAC+M,EAAEC,IAAI,MAAM,CAAC2C,OAAOtP,EAAEuP,QAAQjC,EAAEkC,MAAMjP,EAAEkP,KAAKT,EAAEU,SAASR,GAAqZ,MAAMS,GAAE,iBAAE,EAAGC,MAAMjQ,EAAEkQ,GAAGlD,EAAErQ,UAAU0D,EAAE8P,MAAMvC,EAAEwC,SAASf,EAAEpU,SAASuF,GAAGkM,KAAK,MAAMC,GAAE,YAAE,MAAME,GAAE,YAAE,MAAM9M,EAAE,CAACpD,UAAU,eAAe0D,GAAG,KAAK6P,GAAGlD,EAAEmD,MAAMvC,IAAIL,EAAEC,IAAG,cAAE,MAAMC,GAAE,YAAE,KAAI,aAAEA,EAAE3Q,QAAQuS,KAAK5B,EAAE3Q,QAAQuS,GAAG,KAAI,gBAAE,KAAM,IAAItC,EAAE,KAAK,GAAG,OAAOF,EAAE/P,QAAQ,CAAC,MAAMkQ,EAAEhN,EAAE,mBAAmBA,EAAE,IAAIA,EAAEA,EAAE,IAAI,KAAE+M,EAAE,IAAI,QAAEC,EAAEH,EAAE/P,QAAQmQ,OAAOiC,OAAO,CAACmB,uBAAsB,GAAI5C,EAAE3Q,UAAUyQ,GAAGR,EAAEyB,YAAY8B,SAAS/C,EAAEiB,YAAY+B,YAAY,OAAO/C,EAAET,GAAG,KAAKA,GAAGA,EAAEyD,OAAOhD,EAAE,SAAS,CAACX,EAAE7M,EAAEyN,KAAI,yBAAEf,GAAE,IAAKa,GAAG,CAACA,IAAI,MAAMG,GAAE,cAAE,IAAKH,GAAGZ,EAAE7P,QAAQ,CAAC8P,MAAMW,EAAET,UAAUH,EAAE7P,SAAS,MAAM,CAACyQ,EAAEZ,EAAE7P,UAAU4R,EAAE,OAAOhB,EAAE,kBAAgBlB,EAAE,CAAC7I,MAAM+J,GAAGlN,GAAG,KAAK,OAAO,kBAAgB,MAAMyM,OAAOiC,OAAO,GAAGnP,EAAE,CAAC3C,IAAIuP,IAAI,kBAAgB,MAAM,CAAChQ,UAAU,kBAAkBS,IAAIyP,IAAI6B,gBC4B/mI+B,EAAO1X,QAAU,SAAgB2X,EAAOC,GACtC,IAAIC,EAAKD,EAAO3T,OAEhB,GAAW,IAAP4T,EAAJ,CAGA,IAAIC,EAAKH,EAAM1T,OAEf0T,EAAM1T,QAAU4T,EAEhB,IAAK,IAAIrB,EAAI,EAAGA,EAAIqB,EAAIrB,IACtBmB,EAAMG,EAAKtB,GAAKoB,EAAOpB,gBCnC3BkB,EAAO1X,QAAU,CACf+X,YAAY,EACZC,gCAAgC,EAChCC,aAAa,EACbC,oBAAqB,EACrBC,aAAc,EACdC,mBAAmB,EACnBC,QAAS,EACTC,SAAU,EACVC,mBAAmB,EACnBC,eAAgB,mBCMlBxY,EAAQmW,OAAS,SAAUsC,GACzBA,EAASA,GAAU,GAEnB,IACEjC,EACAS,EACAnC,EAHE4D,EAAUC,MAAMC,UAAUjT,MAAMkT,KAAKC,WAAWnT,MAAM,GAK1D,IAAK6Q,EAAI,EAAG1B,EAAI4D,EAAQzU,OAAQuS,EAAI1B,EAAG0B,IACrC,GAAKkC,EAAQlC,GAEb,IAAKS,KAAKyB,EAAQlC,GAAIiC,EAAOxB,GAAKyB,EAAQlC,GAAGS,GAG/C,OAAOwB,GASTzY,EAAQ+Y,iBAAmB,SAAU1B,GACnC,MAAI,eAAgBA,GAA2C,kBAAxBA,EAASU,WACvC,CAACiB,QAAS,iDAGjB,mCAAoC3B,GACe,kBAA5CA,EAASW,+BAET,CACLgB,QACE,qEAGF,gBAAiB3B,GAA4C,kBAAzBA,EAASY,YACxC,CAACe,QAAS,kDAGjB,wBAAyB3B,GACe,iBAAjCA,EAASa,oBAET,CACLc,QAAS,2DAIX,iBAAkB3B,IACiB,iBAA1BA,EAASc,cAA6Bd,EAASc,cAAgB,EAKxE,sBAAuBd,GACe,kBAA/BA,EAASe,kBAET,CAACY,QAAS,0DAGjB,YAAa3B,IACiB,iBAArBA,EAASgB,SAAwBhB,EAASgB,SAAW,EAK9D,aAAchB,KACiB,iBAAtBA,EAASiB,UAAyBjB,EAASiB,UAAY,GAEzD,CAACU,QAAS,mDAGjB,sBAAuB3B,GACe,kBAA/BA,EAASkB,kBAET,CAACS,QAAS,0DAGjB,mBAAoB3B,IAEiB,iBAA5BA,EAASmB,gBAChBnB,EAASmB,gBAAkB,EAKxB,KAFE,CAACQ,QAAS,yDArBV,CAACA,QAAS,kDAZV,CAACA,QAAS,wDA6CrBhZ,EAAQiZ,kBAAoB,SAAU/B,EAAOgC,GAC3C,IAGIjD,EAHAJ,EAAQqB,EAAMrB,MACdsD,EAAOjC,EAAMiC,KACbnV,EAAQ,GAKRoV,EAAa,IAAIC,aAlHb,GAkH0BxD,GAC9ByD,EAAa,IAAID,aAlHb,EAkH0BF,GAyClC,OAtCAlD,EAAI,EACJiB,EAAMqC,aAAY,SAAUC,EAAMC,GAEhCzV,EAAMwV,GAAQvD,EAGdmD,EAAWnD,GAAKwD,EAAKC,EACrBN,EAAWnD,EAAI,GAAKwD,EAAK9D,EACzByD,EAAWnD,EAAI,GAAK,EACpBmD,EAAWnD,EAAI,GAAK,EACpBmD,EAAWnD,EAAI,GAAK,EACpBmD,EAAWnD,EAAI,GAAK,EACpBmD,EAAWnD,EAAI,GAAK,EACpBmD,EAAWnD,EAAI,GAAK,EACpBmD,EAAWnD,EAAI,GAAKwD,EAAKN,MAAQ,EACjCC,EAAWnD,EAAI,GAAKwD,EAAKE,MAAQ,EAAI,EACrC1D,GAtIM,MA0IRA,EAAI,EACJiB,EAAM0C,aAAY,SAAUC,EAAMJ,EAAMK,EAAQrB,EAAQsB,EAAIC,EAAIC,GAC9D,IAAIC,EAAKlW,EAAM8V,GACXK,EAAKnW,EAAMyU,GAEX2B,EAASlB,EAAcW,EAAMJ,EAAMK,EAAQrB,EAAQsB,EAAIC,EAAIC,GAG/Db,EAAWc,EAAK,IAAME,EACtBhB,EAAWe,EAAK,IAAMC,EAGtBd,EAAWrD,GAAKiE,EAChBZ,EAAWrD,EAAI,GAAKkE,EACpBb,EAAWrD,EAAI,GAAKmE,EACpBnE,GAxJM,KA2JD,CACLoE,MAAOjB,EACPkB,MAAOhB,IAWXtZ,EAAQua,oBAAsB,SAAUrD,EAAOkC,EAAYoB,GACzD,IAAIhE,EAAI,EAERU,EAAMuD,0BAAyB,SAAUjB,EAAMC,GAM7C,OALAA,EAAKC,EAAIN,EAAW5C,GACpBiD,EAAK9D,EAAIyD,EAAW5C,EAAI,GAExBA,GAhLM,GAkLCgE,EAAgBA,EAAchB,EAAMC,GAAQA,MAUvDzZ,EAAQ0a,mBAAqB,SAAUxD,EAAOkC,GAC5C,IAAI5C,EAAI,EAERU,EAAMqC,aAAY,SAAUC,EAAMC,GAChCL,EAAW5C,GAAKiD,EAAKC,EACrBN,EAAW5C,EAAI,GAAKiD,EAAK9D,EAEzBa,GAnMM,OA+MVxW,EAAQ2a,qBAAuB,SAAUzD,EAAOkC,EAAYoB,GAI1D,IAHA,IAAIH,EAAQnD,EAAMmD,QAChBO,EAAY,GAELpE,EAAI,EAAGP,EAAI,EAAGnB,EAAIsE,EAAWnV,OAAQuS,EAAI1B,EAAG0B,GAnN7C,GAmNuD,CAC7D,GAAIgE,EAAe,CACjB,IAAIK,EAAU3G,OAAOiC,OAAO,GAAIe,EAAM4D,kBAAkBT,EAAMpE,KAC9D4E,EAAQnB,EAAIN,EAAW5C,GACvBqE,EAAQlF,EAAIyD,EAAW5C,EAAI,GAC3BqE,EAAUL,EAAcH,EAAMpE,GAAI4E,GAClCD,EAAUP,EAAMpE,IAAM,CACpByD,EAAGmB,EAAQnB,EACX/D,EAAGkF,EAAQlF,QAGbiF,EAAUP,EAAMpE,IAAM,CACpByD,EAAGN,EAAW5C,GACdb,EAAGyD,EAAW5C,EAAI,IAItBP,IAGF,OAAO2E,GAST5a,EAAQ+a,aAAe,SAAsBC,GAC3C,IAAIC,EAAOC,OAAOC,KAAOD,OAAOE,UAC5BC,EAAOL,EAAGM,WACVC,EAAYN,EAAKO,gBACnB,IAAIC,KAAK,CAAC,IAAMJ,EAAO,iBAAkB,CAACK,KAAM,qBAE9CC,EAAS,IAAIC,OAAOL,GAGxB,OAFAN,EAAKY,gBAAgBN,GAEdI,mBC7PT,IAAIG,EAAU,EAAQ,OAClBC,EACF,WACEC,EAAU,EAAQ,MAClBC,EAAU,EAAQ,OAElBC,EAAmB,EAAQ,OAc/B,SAASC,EAA0BhG,EAAQe,EAAOkF,GAChD,IAAKN,EAAQ5E,GACX,MAAM,IAAIzL,MACR,sFAGkB,iBAAX2Q,IAAqBA,EAAS,CAACC,WAAYD,IAEtD,IAAIC,EAAaD,EAAOC,WAExB,GAA0B,iBAAfA,EACT,MAAM,IAAI5Q,MACR,gEAGJ,GAAI4Q,GAAc,EAChB,MAAM,IAAI5Q,MACR,sFAGJ,IAAIyN,EAAgB6C,EAClB,kBAAmBK,EAASA,EAAOlD,cAAgB,UACnDoD,UAEE9B,EAC8B,mBAAzB4B,EAAO5B,cAA+B4B,EAAO5B,cAAgB,KAGlEnD,EAAW4E,EAAQ9F,OAAO,GAAI+F,EAAkBE,EAAO/E,UACvDkF,EAAkBN,EAAQlD,iBAAiB1B,GAE/C,GAAIkF,EACF,MAAM,IAAI9Q,MACR,kCAAoC8Q,EAAgBvD,SAIxD,IAEIxC,EAFAgG,EAAWP,EAAQhD,kBAAkB/B,EAAOgC,GAKhD,IAAK1C,EAAI,EAAGA,EAAI6F,EAAY7F,IAC1BwF,EAAQ3E,EAAUmF,EAASnC,MAAOmC,EAASlC,OAG7C,IAAInE,EAKJ,OAAO8F,EAAQtB,qBAAqBzD,EAAOsF,EAASnC,OAJlD4B,EAAQ1B,oBAAoBrD,EAAOsF,EAASnC,MAAOG,GA4BvD,IAAIiC,EAAoBN,EAA0BO,KAAK,MAAM,GAC7DD,EAAkBtG,OAASgG,EAA0BO,KAAK,MAAM,GAChED,EAAkBE,cAjBlB,SAAuBzF,GACrB,IAAIrB,EAAyB,iBAAVqB,EAAqBA,EAAQA,EAAMrB,MAEtD,MAAO,CACL0C,kBAAmB1C,EAAQ,IAC3BuC,mBAAmB,EACnBC,QAAS,IACTF,aAAc,GACdG,SAAU,EAAInI,KAAKwG,IAAId,KAW3B6B,EAAO1X,QAAUyc,YC9FjB,IA8BIG,EAAM,GAcVlF,EAAO1X,QAAU,SAAiB6c,EAASzD,EAAYE,GAErD,IAAIxE,EAAGF,EAAGX,EAAG6I,EAAIC,EAAIC,EAAI/V,EAAGuN,EAAGyI,EAAGpV,EAS9BqV,EAAyBC,EAAaC,EAAOC,EAAOC,EAAKC,EAAUC,EAknBnEC,EAAOC,EAAUC,EAAUC,EAAWC,EAAMC,EAznB5CjI,EAAQuD,EAAWnV,OACrBkV,EAAOG,EAAWrV,OAEhBgU,EAAc4E,EAAQ5E,YAEtB8F,EAAelB,EAAQrE,eAAiBqE,EAAQrE,eAIhDwF,EAAe,GAMnB,IAAK/J,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EAC1BxD,EAAWnF,EA5DG,GA4DgBmF,EAAWnF,EA9D/B,GA+DVmF,EAAWnF,EA5DG,GA4DgBmF,EAAWnF,EA9D/B,GA+DVmF,EAAWnF,EAhED,GAgEgB,EAC1BmF,EAAWnF,EAhED,GAgEgB,EAI5B,GAAI4I,EAAQ7E,+BAAgC,CAE1C,IADAkF,EAA0B,EACrBjJ,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EAC1BM,GAA2B9D,EAAWnF,EApE5B,GAuEZiJ,GAA2BrH,EAAQ+G,EAMrC,GAAIC,EAAQtE,kBAAmB,CAE7B,IAIE0F,EACAC,EACAC,EANEC,EAAOC,EAAAA,EACTC,GAAO,IACPC,EAAOF,EAAAA,EACPG,GAAO,IAMT,IAAKvK,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EAC1BwB,EAAOjO,KAAKsO,IAAIL,EAAMhF,EAAWnF,EA/F1B,IAgGPqK,EAAOnO,KAAKuO,IAAIJ,EAAMlF,EAAWnF,EAhG1B,IAiGPsK,EAAOpO,KAAKsO,IAAIF,EAAMnF,EAAWnF,EAhG1B,IAiGPuK,EAAOrO,KAAKuO,IAAIF,EAAMpF,EAAWnF,EAjG1B,IAqGT,IAAI0K,EAAKL,EAAOF,EACdQ,EAAKJ,EAAOD,EAsBd,IArBII,EAAKC,EAEPJ,GADAD,IAASI,EAAKC,GAAM,GACND,EAGdL,GADAF,IAASQ,EAAKD,GAAM,GACNC,EAIhBZ,EAAa,IAAoB,EACjCA,EAAa,IAAwBI,EAAOE,GAAQ,EACpDN,EAAa,IAAwBO,EAAOC,GAAQ,EACpDR,EAAa,GAAmB7N,KAAKuO,IAAIJ,EAAOF,EAAMI,EAAOD,GAC7DP,EAAa,IAA4B,EACzCA,EAAa,IAA2B,EACxCA,EAAa,GAAmB,EAChCA,EAAa,GAA4B,EACzCA,EAAa,GAA4B,EAGzClJ,EAAI,EACCb,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EAK1B,IAHAhI,EAAI,EACJuJ,EAvGqB,IAyGR,CAIX,KAAIH,EAAapJ,EAlHA,IAkH2B,GAA5C,CAgDE,GAAIoJ,EAAapJ,EAvKT,GAuK4B,EAAG,CAGrCoJ,EAAapJ,EA1KP,GA0K0BX,EAChC,MA0IA,GAhIA+J,EAAapJ,EAhLA,GAYf,EAoKyCE,EACvCN,EAAIwJ,EAAapJ,EAnLX,GAmL8B,EAQpCoJ,GAFAf,EAAIe,EAAapJ,EAvLJ,IALP,IA8L2B,EACjCoJ,EAAaf,EA9LH,GA+LRe,EAAapJ,EA/LL,GA+L4BJ,EACtCwJ,EAAaf,EA/LH,GAgMRe,EAAapJ,EAhML,GAgM4BJ,EACtCwJ,EAAaf,EAhMP,GAgM0BzI,EAChCwJ,EAAaf,EAhMC,GAgM0BA,EAnL1C,EAoLEe,EAAaf,EAhMA,IAgM2B,EACxCe,EAAaf,EAhMP,GAgM0B,EAChCe,EAAaf,EAhME,GAgM0B,EACzCe,EAAaf,EAhME,GAgM0B,EAIzCe,GADAf,GA1LF,GAjBQ,IA4M2B,EACjCe,EAAaf,EA5MH,GA6MRe,EAAapJ,EA7ML,GA6M4BJ,EACtCwJ,EAAaf,EA7MH,GA8MRe,EAAapJ,EA9ML,GA8M4BJ,EACtCwJ,EAAaf,EA9MP,GA8M0BzI,EAChCwJ,EAAaf,EA9MC,GA8M0BA,EAjM1C,EAkMEe,EAAaf,EA9MA,IA8M2B,EACxCe,EAAaf,EA9MP,GA8M0B,EAChCe,EAAaf,EA9ME,GA8M0B,EACzCe,EAAaf,EA9ME,GA8M0B,EAIzCe,GADAf,GAxMF,GAjBQ,IA0N2B,EACjCe,EAAaf,EA1NH,GA2NRe,EAAapJ,EA3NL,GA2N4BJ,EACtCwJ,EAAaf,EA3NH,GA4NRe,EAAapJ,EA5NL,GA4N4BJ,EACtCwJ,EAAaf,EA5NP,GA4N0BzI,EAChCwJ,EAAaf,EA5NC,GA4N0BA,EA/M1C,EAgNEe,EAAaf,EA5NA,IA4N2B,EACxCe,EAAaf,EA5NP,GA4N0B,EAChCe,EAAaf,EA5NE,GA4N0B,EACzCe,EAAaf,EA5NE,GA4N0B,EAIzCe,GADAf,GAtNF,GAjBQ,IAwO2B,EACjCe,EAAaf,EAxOH,GAyORe,EAAapJ,EAzOL,GAyO4BJ,EACtCwJ,EAAaf,EAzOH,GA0ORe,EAAapJ,EA1OL,GA0O4BJ,EACtCwJ,EAAaf,EA1OP,GA0O0BzI,EAChCwJ,EAAaf,EA1OC,GA2OZe,EAAapJ,EA3OD,GA4OdoJ,EAAaf,EA3OA,IA2O2B,EACxCe,EAAaf,EA3OP,GA2O0B,EAChCe,EAAaf,EA3OE,GA2O0B,EACzCe,EAAaf,EA3OE,GA2O0B,EAEzCnI,GAAK,EAgBDmJ,EARF7E,EAAW4E,EAAapJ,EA7PpB,GAfL,GA6QCoJ,EAAapJ,EA7PL,GAgQNwE,EAAW4E,EAAapJ,EAjQtB,GAdL,GAgRGoJ,EAAapJ,EAhQP,GAmQFoJ,EAAapJ,EAhQR,GAmQLoJ,EAAapJ,EAnQR,GAYf,EA2PMwE,EAAW4E,EAAapJ,EA5QtB,GAdL,GA2RGoJ,EAAapJ,EA3QP,GA8QFoJ,EAAapJ,EA3QR,GA2QkCiK,GAGvCb,EAAapJ,EA9QR,GA8QkCiK,GAK/Cb,EAAapJ,EAlRP,GAmRJwE,EAAW4E,EAAapJ,EAzRpB,GATF,GAmSJoJ,EAAapJ,EAnRE,GAoRbwE,EAAW4E,EAAapJ,EA3RpB,GAfL,GA2SDoJ,EAAapJ,EApRE,GAqRbwE,EAAW4E,EAAapJ,EA7RpB,GAdL,GA6SDoJ,EAAaC,EA/RP,GA+R0BD,EAAapJ,EA/RvC,GAgSNoJ,EAAapJ,EAhSP,IAgS2B,EAqB7BqJ,KAfAC,EAHA9E,EAAWnF,EAlTd,GAkT4B+J,EAAapJ,EAlShC,GAmSJwE,EAAWnF,EAlThB,GAkT8B+J,EAAapJ,EAlSlC,GAoSDoJ,EAAapJ,EAjST,GAoSJoJ,EAAapJ,EApST,GAYf,EA2RQwE,EAAWnF,EA1ThB,GA0T8B+J,EAAapJ,EA1SlC,GA4SDoJ,EAAapJ,EAzST,GAySmCiK,GAGvCb,EAAapJ,EA5ST,GA4SmCiK,IAIlC,CAGZ,GAAIV,IAAuB,CACzBvJ,EAAIqJ,EACJ,SAIAE,EApTW,EAqTX,MAMJH,EAAaE,EArUP,GAqU2BjK,EACjC,MApMEgK,EAHA7E,EAAWnF,EA9IZ,GA8I0B+J,EAAapJ,EA9H9B,GA+HNwE,EAAWnF,EA9Id,GA8I4B+J,EAAapJ,EA9HhC,GAgIJoJ,EAAapJ,EA7HN,GAgIPoJ,EAAapJ,EAhIN,GAYf,EAuHMwE,EAAWnF,EAtJd,GAsJ4B+J,EAAapJ,EAtIhC,GAwIJoJ,EAAapJ,EArIN,GAqIgCiK,GAGvCb,EAAapJ,EAxIN,GAwIgCiK,GAK/Cb,EAAapJ,EA3II,IA4IdoJ,EAAapJ,EA5IC,GA6IboJ,EAAapJ,EA9IT,GA+IJwE,EAAWnF,EApKZ,GAoK0BmF,EAAWnF,EA9JlC,KA+JH+J,EAAapJ,EAhJR,GAgJ2BwE,EAAWnF,EA/JxC,IAiKN+J,EAAapJ,EAhJI,IAiJdoJ,EAAapJ,EAjJC,GAkJboJ,EAAapJ,EApJT,GAqJJwE,EAAWnF,EAzKZ,GAyK0BmF,EAAWnF,EApKlC,KAqKH+J,EAAapJ,EAtJR,GAsJ2BwE,EAAWnF,EArKxC,IAuKN+J,EAAapJ,EAxJL,IAwJyBwE,EAAWnF,EAvKtC,GA0KNW,EAAIqJ,GAgLZ,GAAIpB,EAAQtE,mBAIV,IAHA4E,EAAcN,EAAQ1E,aAGjBlE,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EAI1B,IADAhI,EAAI,IAEF,GAAIoJ,EAAapJ,EArVA,IAqV2B,EAA5C,CAgBE,GAZA2I,EACEpN,KAAK2O,IACH1F,EAAWnF,EA/WZ,GA+W0B+J,EAAapJ,EAzVzB,GA0Vb,GAEFzE,KAAK2O,IACH1F,EAAWnF,EAlXZ,GAkX0B+J,EAAapJ,EA5VzB,GA6Vb,GAKC,GAFL/M,EAAImW,EAAapJ,EArWT,IAuWK/M,EAAK0V,EAAWQ,EAAc,CA6CzC,GA1CAX,EACEhE,EAAWnF,EA7XZ,GA6X0B+J,EAAapJ,EAvWzB,GAwWfyI,EACEjE,EAAWnF,EA9XZ,GA8X0B+J,EAAapJ,EAxWzB,IA0WK,IAAhBqD,EAEEsF,EAAW,GACbC,EACGL,EACC/D,EAAWnF,EAhYf,GAiYI+J,EAAapJ,EAlXf,GAmXA2I,EAEFnE,EAAWnF,EAxYb,IAwY6BmJ,EAAQI,EACnCpE,EAAWnF,EAxYb,IAwY6BoJ,EAAQG,GAC1BD,EAAW,IACpBC,GACIL,EACA/D,EAAWnF,EAzYf,GA0YI+J,EAAapJ,EA3Xf,GA4XAzE,KAAK4O,KAAKxB,GAEZnE,EAAWnF,EAjZb,IAiZ6BmJ,EAAQI,EACnCpE,EAAWnF,EAjZb,IAiZ6BoJ,EAAQG,GAIjCD,EAAW,IACbC,EACGL,EACC/D,EAAWnF,EArZf,GAsZI+J,EAAapJ,EAvYf,GAwYA2I,EAEFnE,EAAWnF,EA7Zb,IA6Z6BmJ,EAAQI,EACnCpE,EAAWnF,EA7Zb,IA6Z6BoJ,EAAQG,IAKvC5I,EAAIoJ,EAAapJ,EAlZH,IAmZN,EAAG,MAEX,SAGAA,EAAIoJ,EAAapJ,EAvZJ,QA4cf,IA/CAoI,EAAKgB,EAAapJ,EAlaV,KAoaE,GAAKoI,IAAO/I,IAIpBsJ,GAHAH,EAAQhE,EAAWnF,EApblB,GAobgCmF,EAAW4D,EApb3C,IAubkBI,GAFnBC,EAAQjE,EAAWnF,EApblB,GAobgCmF,EAAW4D,EApb3C,IAsbkCK,GAEf,IAAhBpF,EAEEsF,EAAW,GACbC,EACGL,EACC/D,EAAWnF,EAxbf,GAybImF,EAAW4D,EAzbf,GA0bEO,EAEFnE,EAAWnF,EAhcb,IAgc6BmJ,EAAQI,EACnCpE,EAAWnF,EAhcb,IAgc6BoJ,EAAQG,GAC1BD,EAAW,IACpBC,GACIL,EACA/D,EAAWnF,EAjcf,GAkcImF,EAAW4D,EAlcf,GAmcE7M,KAAK4O,KAAKxB,GAEZnE,EAAWnF,EAzcb,IAyc6BmJ,EAAQI,EACnCpE,EAAWnF,EAzcb,IAyc6BoJ,EAAQG,GAIjCD,EAAW,IACbC,EACGL,EACC/D,EAAWnF,EA7cf,GA8cImF,EAAW4D,EA9cf,GA+cEO,EAEFnE,EAAWnF,EArdb,IAqd6BmJ,EAAQI,EACnCpE,EAAWnF,EArdb,IAqd6BoJ,EAAQG,KAMzC5I,EAAIoJ,EAAapJ,EA3cD,IA6cR,EAAG,WAUjB,IAHAuI,EAAcN,EAAQ1E,aAGjB2E,EAAK,EAAGA,EAAKjH,EAAOiH,GAAMF,EAC7B,IAAKG,EAAK,EAAGA,EAAKD,EAAIC,GAAMH,EAE1BQ,EAAQhE,EAAW0D,EA7ed,GA6e6B1D,EAAW2D,EA7exC,GA8eLM,EAAQjE,EAAW0D,EA7ed,GA6e6B1D,EAAW2D,EA7exC,IA+ee,IAAhB9E,GAEFsF,EACEpN,KAAK4O,KAAK3B,EAAQA,EAAQC,EAAQA,GAClCjE,EAAW0D,EA5eP,GA6eJ1D,EAAW2D,EA7eP,IA+eS,GACbS,EACGL,EACC/D,EAAW0D,EApfX,GAqfA1D,EAAW2D,EArfX,GAsfFQ,EACAA,EAGFnE,EAAW0D,EA9fT,IA8f0BM,EAAQI,EACpCpE,EAAW0D,EA9fT,IA8f0BO,EAAQG,EAEpCpE,EAAW2D,EAjgBT,IAigB0BK,EAAQI,EACpCpE,EAAW2D,EAjgBT,IAigB0BM,EAAQG,GAC3BD,EAAW,IACpBC,EACE,IACAL,EACA/D,EAAW0D,EAngBT,GAogBF1D,EAAW2D,EApgBT,GAugBJ3D,EAAW0D,EA3gBT,IA2gB0BM,EAAQI,EACpCpE,EAAW0D,EA3gBT,IA2gB0BO,EAAQG,EAEpCpE,EAAW2D,EA9gBT,IA8gB0BK,EAAQI,EACpCpE,EAAW2D,EA9gBT,IA8gB0BM,EAAQG,IAItCD,EAAWpN,KAAK4O,KAAK3B,EAAQA,EAAQC,EAAQA,IAE9B,IACbG,EACGL,EACC/D,EAAW0D,EAphBX,GAqhBA1D,EAAW2D,EArhBX,GAshBFQ,EACAA,EAGFnE,EAAW0D,EA9hBT,IA8hB0BM,EAAQI,EACpCpE,EAAW0D,EA9hBT,IA8hB0BO,EAAQG,EAEpCpE,EAAW2D,EAjiBT,IAiiB0BK,EAAQI,EACpCpE,EAAW2D,EAjiBT,IAiiB0BM,EAAQG,GAW9C,IAFAP,EAAIJ,EAAQxE,QAAUwE,EAAQ1E,aAC9BgF,EAAcN,EAAQ1E,aACjBlE,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EAC1BY,EAAS,EAGTJ,EAAQhE,EAAWnF,EAnjBV,GAojBToJ,EAAQjE,EAAWnF,EAnjBV,GAojBTsJ,EAAWpN,KAAK4O,KAAK5O,KAAK2O,IAAI1B,EAAO,GAAKjN,KAAK2O,IAAIzB,EAAO,IAEtDR,EAAQzE,kBAENmF,EAAW,IAAGC,EAASL,EAAc/D,EAAWnF,EAnjB1C,GAmjB2DgJ,GAGjEM,EAAW,IACbC,EAAUL,EAAc/D,EAAWnF,EAvjB3B,GAujB4CgJ,EAAKM,GAI7DnE,EAAWnF,EA/jBD,IA+jBiBmJ,EAAQI,EACnCpE,EAAWnF,EA/jBD,IA+jBiBoJ,EAAQG,EAUrC,IALAL,EACE,GAAKN,EAAQ7E,+BAAiCkF,EAA0B,GAIrEjW,EAAI,EAAGA,EAAIkS,EAAMlS,GA7iBd,EA8iBN6V,EAAKxD,EAAWrS,EAlkBF,GAmkBd8V,EAAKzD,EAAWrS,EAlkBF,GAmkBduN,EAAI8E,EAAWrS,EAlkBD,GAqkBdqW,EAAMnN,KAAK2O,IAAItK,EAAGqI,EAAQ3E,qBAG1BkF,EAAQhE,EAAW0D,EArlBV,GAqlByB1D,EAAW2D,EArlBpC,GAslBTM,EAAQjE,EAAW0D,EArlBV,GAqlByB1D,EAAW2D,EArlBpC,IAwlBW,IAAhB9E,GACFsF,EACEpN,KAAK4O,KAAK3B,EAAQA,EAAQC,EAAQA,GAClCjE,EAAW0D,EAplBH,GAqlBR1D,EAAW2D,EArlBH,GAulBNF,EAAQ9E,WACN8E,EAAQ7E,+BAENuF,EAAW,IACbC,GACIL,EAAcG,EAAMnN,KAAKwG,IAAI,EAAI4G,GACnCA,EACAnE,EAAW0D,EAhmBT,IAomBFS,EAAW,IACbC,GAAWL,EAAcG,EAAMnN,KAAKwG,IAAI,EAAI4G,GAAaA,GAIzDV,EAAQ7E,+BAENuF,EAAW,IACbC,GAAWL,EAAcG,EAAOlE,EAAW0D,EA5mBvC,IAgnBFS,EAAW,IACbC,GAAUL,EAAcG,KAK9BC,EAAWpN,KAAK4O,KAAK5O,KAAK2O,IAAI1B,EAAO,GAAKjN,KAAK2O,IAAIzB,EAAO,IAEtDR,EAAQ9E,WACN8E,EAAQ7E,+BAENuF,EAAW,IACbC,GACIL,EAAcG,EAAMnN,KAAKwG,IAAI,EAAI4G,GACnCA,EACAnE,EAAW0D,EA/nBT,IAmoBFS,EAAW,IACbC,GAAWL,EAAcG,EAAMnN,KAAKwG,IAAI,EAAI4G,GAAaA,GAGzDV,EAAQ7E,gCAGVuF,EAAW,EACXC,GAAWL,EAAcG,EAAOlE,EAAW0D,EA3oBrC,KA+oBNS,EAAW,EACXC,GAAUL,EAAcG,IAO1BC,EAAW,IAEbnE,EAAW0D,EA7pBH,IA6pBoBM,EAAQI,EACpCpE,EAAW0D,EA7pBH,IA6pBoBO,EAAQG,EAEpCpE,EAAW2D,EAhqBH,IAgqBoBK,EAAQI,EACpCpE,EAAW2D,EAhqBH,IAgqBoBM,EAAQG,GASxC,IAAoB,IAAhBvF,EACF,IAAKhE,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EACS,IAA/BxD,EAAWnF,EArqBJ,MAsqBTwJ,EAAQtN,KAAK4O,KACX5O,KAAK2O,IAAI1F,EAAWnF,EA9qBhB,GA8qB8B,GAChC9D,KAAK2O,IAAI1F,EAAWnF,EA9qBlB,GA8qBgC,KA/oB9B,KAmpBNmF,EAAWnF,EAnrBP,GAgCE,GAopBHmF,EAAWnF,EAprBV,GAorBsCwJ,EAC1CrE,EAAWnF,EAprBP,GA+BE,GAspBHmF,EAAWnF,EArrBV,GAqrBsCwJ,GAG5CC,EACEtE,EAAWnF,EAtrBL,GAurBN9D,KAAK4O,MACF3F,EAAWnF,EA1rBN,GA0rByBmF,EAAWnF,EA5rBxC,KA6rBCmF,EAAWnF,EA3rBR,GA2rB2BmF,EAAWnF,EA7rB1C,KA8rBCmF,EAAWnF,EA3rBR,GA2rB2BmF,EAAWnF,EA7rB1C,KA8rBGmF,EAAWnF,EA5rBV,GA4rB6BmF,EAAWnF,EA9rB5C,KAisBN0J,EACExN,KAAK4O,MACF3F,EAAWnF,EAlsBN,GAksByBmF,EAAWnF,EApsBxC,KAqsBCmF,EAAWnF,EAnsBR,GAmsB2BmF,EAAWnF,EArsB1C,KAssBCmF,EAAWnF,EAnsBR,GAmsB2BmF,EAAWnF,EArsB1C,KAssBGmF,EAAWnF,EApsBV,GAosB6BmF,EAAWnF,EAtsB5C,KAusBA,EAEN2J,EAAa,GAAMzN,KAAKwG,IAAI,EAAIgH,IAAc,EAAIxN,KAAK4O,KAAKrB,IAG5DG,EACEzE,EAAWnF,EAhtBR,GAitBHmF,EAAWnF,EA/sBP,IA+sBuB2J,EAAYf,EAAQvE,UACjDc,EAAWnF,EAltBN,GAktBoB4J,EAEzBC,EACE1E,EAAWnF,EAptBR,GAqtBHmF,EAAWnF,EAntBP,IAmtBuB2J,EAAYf,EAAQvE,UACjDc,EAAWnF,EAttBN,GAstBoB6J,QAI7B,IAAK7J,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EACS,IAA/BxD,EAAWnF,EAntBJ,KAotBTyJ,EACEtE,EAAWnF,EAxtBL,GAytBN9D,KAAK4O,MACF3F,EAAWnF,EA5tBN,GA4tByBmF,EAAWnF,EA9tBxC,KA+tBCmF,EAAWnF,EA7tBR,GA6tB2BmF,EAAWnF,EA/tB1C,KAguBCmF,EAAWnF,EA7tBR,GA6tB2BmF,EAAWnF,EA/tB1C,KAguBGmF,EAAWnF,EA9tBV,GA8tB6BmF,EAAWnF,EAhuB5C,KAmuBN0J,EACExN,KAAK4O,MACF3F,EAAWnF,EApuBN,GAouByBmF,EAAWnF,EAtuBxC,KAuuBCmF,EAAWnF,EAruBR,GAquB2BmF,EAAWnF,EAvuB1C,KAwuBCmF,EAAWnF,EAruBR,GAquB2BmF,EAAWnF,EAvuB1C,KAwuBGmF,EAAWnF,EAtuBV,GAsuB6BmF,EAAWnF,EAxuB5C,KAyuBA,EAEN2J,EACGxE,EAAWnF,EAxuBC,GAwuBuB9D,KAAKwG,IAAI,EAAIgH,IAChD,EAAIxN,KAAK4O,KAAKrB,IAGjBtE,EAAWnF,EA5uBI,GA4uBoB9D,KAAKsO,IACtC,EACAtO,KAAK4O,KACFnB,GACEzN,KAAK2O,IAAI1F,EAAWnF,EArvBrB,GAqvBmC,GACjC9D,KAAK2O,IAAI1F,EAAWnF,EArvBtB,GAqvBoC,KACnC,EAAI9D,KAAK4O,KAAKrB,MAKrBG,EACEzE,EAAWnF,EA/vBR,GAgwBHmF,EAAWnF,EA9vBP,IA8vBuB2J,EAAYf,EAAQvE,UACjDc,EAAWnF,EAjwBN,GAiwBoB4J,EAEzBC,EACE1E,EAAWnF,EAnwBR,GAowBHmF,EAAWnF,EAlwBP,IAkwBuB2J,EAAYf,EAAQvE,UACjDc,EAAWnF,EArwBN,GAqwBoB6J,GAM/B,MAAO,eCjxBTpG,EAAO1X,QAAU,WACf,IAAIgf,EAAOC,EA8CTrC,EA5CEsC,EAAa,GA4CftC,EAAM,GAcVsC,EAAWlf,QAAU,SAAiB6c,EAASzD,EAAYE,GAEzD,IAAIxE,EAAGF,EAAGX,EAAG6I,EAAIC,EAAIC,EAAI/V,EAAGuN,EAAGyI,EAAGpV,EAS9BqV,EAAyBC,EAAaC,EAAOC,EAAOC,EAAKC,EAAUC,EAknBnEC,EAAOC,EAAUC,EAAUC,EAAWC,EAAMC,EAznB5CjI,EAAQuD,EAAWnV,OACrBkV,EAAOG,EAAWrV,OAEhBgU,EAAc4E,EAAQ5E,YAEtB8F,EAAelB,EAAQrE,eAAiBqE,EAAQrE,eAIhDwF,EAAe,GAMnB,IAAK/J,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EAC1BxD,EAAWnF,EA5DG,GA4DgBmF,EAAWnF,EA9D/B,GA+DVmF,EAAWnF,EA5DG,GA4DgBmF,EAAWnF,EA9D/B,GA+DVmF,EAAWnF,EAhED,GAgEgB,EAC1BmF,EAAWnF,EAhED,GAgEgB,EAI5B,GAAI4I,EAAQ7E,+BAAgC,CAE1C,IADAkF,EAA0B,EACrBjJ,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EAC1BM,GAA2B9D,EAAWnF,EApE5B,GAuEZiJ,GAA2BrH,EAAQ+G,EAMrC,GAAIC,EAAQtE,kBAAmB,CAE7B,IAIE0F,EACAC,EACAC,EANEC,EAAOC,EAAAA,EACTC,GAAO,IACPC,EAAOF,EAAAA,EACPG,GAAO,IAMT,IAAKvK,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EAC1BwB,EAAOjO,KAAKsO,IAAIL,EAAMhF,EAAWnF,EA/F1B,IAgGPqK,EAAOnO,KAAKuO,IAAIJ,EAAMlF,EAAWnF,EAhG1B,IAiGPsK,EAAOpO,KAAKsO,IAAIF,EAAMnF,EAAWnF,EAhG1B,IAiGPuK,EAAOrO,KAAKuO,IAAIF,EAAMpF,EAAWnF,EAjG1B,IAqGT,IAAI0K,EAAKL,EAAOF,EACdQ,EAAKJ,EAAOD,EAsBd,IArBII,EAAKC,EAEPJ,GADAD,IAASI,EAAKC,GAAM,GACND,EAGdL,GADAF,IAASQ,EAAKD,GAAM,GACNC,EAIhBZ,EAAa,IAAoB,EACjCA,EAAa,IAAwBI,EAAOE,GAAQ,EACpDN,EAAa,IAAwBO,EAAOC,GAAQ,EACpDR,EAAa,GAAmB7N,KAAKuO,IAAIJ,EAAOF,EAAMI,EAAOD,GAC7DP,EAAa,IAA4B,EACzCA,EAAa,IAA2B,EACxCA,EAAa,GAAmB,EAChCA,EAAa,GAA4B,EACzCA,EAAa,GAA4B,EAGzClJ,EAAI,EACCb,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EAK1B,IAHAhI,EAAI,EACJuJ,EAvGqB,IAyGR,CAIX,KAAIH,EAAapJ,EAlHA,IAkH2B,GAA5C,CAgDE,GAAIoJ,EAAapJ,EAvKT,GAuK4B,EAAG,CAGrCoJ,EAAapJ,EA1KP,GA0K0BX,EAChC,MA0IA,GAhIA+J,EAAapJ,EAhLA,GAYf,EAoKyCE,EACvCN,EAAIwJ,EAAapJ,EAnLX,GAmL8B,EAQpCoJ,GAFAf,EAAIe,EAAapJ,EAvLJ,IALP,IA8L2B,EACjCoJ,EAAaf,EA9LH,GA+LRe,EAAapJ,EA/LL,GA+L4BJ,EACtCwJ,EAAaf,EA/LH,GAgMRe,EAAapJ,EAhML,GAgM4BJ,EACtCwJ,EAAaf,EAhMP,GAgM0BzI,EAChCwJ,EAAaf,EAhMC,GAgM0BA,EAnL1C,EAoLEe,EAAaf,EAhMA,IAgM2B,EACxCe,EAAaf,EAhMP,GAgM0B,EAChCe,EAAaf,EAhME,GAgM0B,EACzCe,EAAaf,EAhME,GAgM0B,EAIzCe,GADAf,GA1LF,GAjBQ,IA4M2B,EACjCe,EAAaf,EA5MH,GA6MRe,EAAapJ,EA7ML,GA6M4BJ,EACtCwJ,EAAaf,EA7MH,GA8MRe,EAAapJ,EA9ML,GA8M4BJ,EACtCwJ,EAAaf,EA9MP,GA8M0BzI,EAChCwJ,EAAaf,EA9MC,GA8M0BA,EAjM1C,EAkMEe,EAAaf,EA9MA,IA8M2B,EACxCe,EAAaf,EA9MP,GA8M0B,EAChCe,EAAaf,EA9ME,GA8M0B,EACzCe,EAAaf,EA9ME,GA8M0B,EAIzCe,GADAf,GAxMF,GAjBQ,IA0N2B,EACjCe,EAAaf,EA1NH,GA2NRe,EAAapJ,EA3NL,GA2N4BJ,EACtCwJ,EAAaf,EA3NH,GA4NRe,EAAapJ,EA5NL,GA4N4BJ,EACtCwJ,EAAaf,EA5NP,GA4N0BzI,EAChCwJ,EAAaf,EA5NC,GA4N0BA,EA/M1C,EAgNEe,EAAaf,EA5NA,IA4N2B,EACxCe,EAAaf,EA5NP,GA4N0B,EAChCe,EAAaf,EA5NE,GA4N0B,EACzCe,EAAaf,EA5NE,GA4N0B,EAIzCe,GADAf,GAtNF,GAjBQ,IAwO2B,EACjCe,EAAaf,EAxOH,GAyORe,EAAapJ,EAzOL,GAyO4BJ,EACtCwJ,EAAaf,EAzOH,GA0ORe,EAAapJ,EA1OL,GA0O4BJ,EACtCwJ,EAAaf,EA1OP,GA0O0BzI,EAChCwJ,EAAaf,EA1OC,GA2OZe,EAAapJ,EA3OD,GA4OdoJ,EAAaf,EA3OA,IA2O2B,EACxCe,EAAaf,EA3OP,GA2O0B,EAChCe,EAAaf,EA3OE,GA2O0B,EACzCe,EAAaf,EA3OE,GA2O0B,EAEzCnI,GAAK,EAgBDmJ,EARF7E,EAAW4E,EAAapJ,EA7PpB,GAfL,GA6QCoJ,EAAapJ,EA7PL,GAgQNwE,EAAW4E,EAAapJ,EAjQtB,GAdL,GAgRGoJ,EAAapJ,EAhQP,GAmQFoJ,EAAapJ,EAhQR,GAmQLoJ,EAAapJ,EAnQR,GAYf,EA2PMwE,EAAW4E,EAAapJ,EA5QtB,GAdL,GA2RGoJ,EAAapJ,EA3QP,GA8QFoJ,EAAapJ,EA3QR,GA2QkCiK,GAGvCb,EAAapJ,EA9QR,GA8QkCiK,GAK/Cb,EAAapJ,EAlRP,GAmRJwE,EAAW4E,EAAapJ,EAzRpB,GATF,GAmSJoJ,EAAapJ,EAnRE,GAoRbwE,EAAW4E,EAAapJ,EA3RpB,GAfL,GA2SDoJ,EAAapJ,EApRE,GAqRbwE,EAAW4E,EAAapJ,EA7RpB,GAdL,GA6SDoJ,EAAaC,EA/RP,GA+R0BD,EAAapJ,EA/RvC,GAgSNoJ,EAAapJ,EAhSP,IAgS2B,EAqB7BqJ,KAfAC,EAHA9E,EAAWnF,EAlTd,GAkT4B+J,EAAapJ,EAlShC,GAmSJwE,EAAWnF,EAlThB,GAkT8B+J,EAAapJ,EAlSlC,GAoSDoJ,EAAapJ,EAjST,GAoSJoJ,EAAapJ,EApST,GAYf,EA2RQwE,EAAWnF,EA1ThB,GA0T8B+J,EAAapJ,EA1SlC,GA4SDoJ,EAAapJ,EAzST,GAySmCiK,GAGvCb,EAAapJ,EA5ST,GA4SmCiK,IAIlC,CAGZ,GAAIV,IAAuB,CACzBvJ,EAAIqJ,EACJ,SAIAE,EApTW,EAqTX,MAMJH,EAAaE,EArUP,GAqU2BjK,EACjC,MApMEgK,EAHA7E,EAAWnF,EA9IZ,GA8I0B+J,EAAapJ,EA9H9B,GA+HNwE,EAAWnF,EA9Id,GA8I4B+J,EAAapJ,EA9HhC,GAgIJoJ,EAAapJ,EA7HN,GAgIPoJ,EAAapJ,EAhIN,GAYf,EAuHMwE,EAAWnF,EAtJd,GAsJ4B+J,EAAapJ,EAtIhC,GAwIJoJ,EAAapJ,EArIN,GAqIgCiK,GAGvCb,EAAapJ,EAxIN,GAwIgCiK,GAK/Cb,EAAapJ,EA3II,IA4IdoJ,EAAapJ,EA5IC,GA6IboJ,EAAapJ,EA9IT,GA+IJwE,EAAWnF,EApKZ,GAoK0BmF,EAAWnF,EA9JlC,KA+JH+J,EAAapJ,EAhJR,GAgJ2BwE,EAAWnF,EA/JxC,IAiKN+J,EAAapJ,EAhJI,IAiJdoJ,EAAapJ,EAjJC,GAkJboJ,EAAapJ,EApJT,GAqJJwE,EAAWnF,EAzKZ,GAyK0BmF,EAAWnF,EApKlC,KAqKH+J,EAAapJ,EAtJR,GAsJ2BwE,EAAWnF,EArKxC,IAuKN+J,EAAapJ,EAxJL,IAwJyBwE,EAAWnF,EAvKtC,GA0KNW,EAAIqJ,GAgLZ,GAAIpB,EAAQtE,mBAIV,IAHA4E,EAAcN,EAAQ1E,aAGjBlE,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EAI1B,IADAhI,EAAI,IAEF,GAAIoJ,EAAapJ,EArVA,IAqV2B,EAA5C,CAgBE,GAZA2I,EACEpN,KAAK2O,IACH1F,EAAWnF,EA/WZ,GA+W0B+J,EAAapJ,EAzVzB,GA0Vb,GAEFzE,KAAK2O,IACH1F,EAAWnF,EAlXZ,GAkX0B+J,EAAapJ,EA5VzB,GA6Vb,GAKC,GAFL/M,EAAImW,EAAapJ,EArWT,IAuWK/M,EAAK0V,EAAWQ,EAAc,CA6CzC,GA1CAX,EACEhE,EAAWnF,EA7XZ,GA6X0B+J,EAAapJ,EAvWzB,GAwWfyI,EACEjE,EAAWnF,EA9XZ,GA8X0B+J,EAAapJ,EAxWzB,IA0WK,IAAhBqD,EAEEsF,EAAW,GACbC,EACGL,EACC/D,EAAWnF,EAhYf,GAiYI+J,EAAapJ,EAlXf,GAmXA2I,EAEFnE,EAAWnF,EAxYb,IAwY6BmJ,EAAQI,EACnCpE,EAAWnF,EAxYb,IAwY6BoJ,EAAQG,GAC1BD,EAAW,IACpBC,GACIL,EACA/D,EAAWnF,EAzYf,GA0YI+J,EAAapJ,EA3Xf,GA4XAzE,KAAK4O,KAAKxB,GAEZnE,EAAWnF,EAjZb,IAiZ6BmJ,EAAQI,EACnCpE,EAAWnF,EAjZb,IAiZ6BoJ,EAAQG,GAIjCD,EAAW,IACbC,EACGL,EACC/D,EAAWnF,EArZf,GAsZI+J,EAAapJ,EAvYf,GAwYA2I,EAEFnE,EAAWnF,EA7Zb,IA6Z6BmJ,EAAQI,EACnCpE,EAAWnF,EA7Zb,IA6Z6BoJ,EAAQG,IAKvC5I,EAAIoJ,EAAapJ,EAlZH,IAmZN,EAAG,MAEX,SAGAA,EAAIoJ,EAAapJ,EAvZJ,QA4cf,IA/CAoI,EAAKgB,EAAapJ,EAlaV,KAoaE,GAAKoI,IAAO/I,IAIpBsJ,GAHAH,EAAQhE,EAAWnF,EApblB,GAobgCmF,EAAW4D,EApb3C,IAubkBI,GAFnBC,EAAQjE,EAAWnF,EApblB,GAobgCmF,EAAW4D,EApb3C,IAsbkCK,GAEf,IAAhBpF,EAEEsF,EAAW,GACbC,EACGL,EACC/D,EAAWnF,EAxbf,GAybImF,EAAW4D,EAzbf,GA0bEO,EAEFnE,EAAWnF,EAhcb,IAgc6BmJ,EAAQI,EACnCpE,EAAWnF,EAhcb,IAgc6BoJ,EAAQG,GAC1BD,EAAW,IACpBC,GACIL,EACA/D,EAAWnF,EAjcf,GAkcImF,EAAW4D,EAlcf,GAmcE7M,KAAK4O,KAAKxB,GAEZnE,EAAWnF,EAzcb,IAyc6BmJ,EAAQI,EACnCpE,EAAWnF,EAzcb,IAyc6BoJ,EAAQG,GAIjCD,EAAW,IACbC,EACGL,EACC/D,EAAWnF,EA7cf,GA8cImF,EAAW4D,EA9cf,GA+cEO,EAEFnE,EAAWnF,EArdb,IAqd6BmJ,EAAQI,EACnCpE,EAAWnF,EArdb,IAqd6BoJ,EAAQG,KAMzC5I,EAAIoJ,EAAapJ,EA3cD,IA6cR,EAAG,WAUjB,IAHAuI,EAAcN,EAAQ1E,aAGjB2E,EAAK,EAAGA,EAAKjH,EAAOiH,GAAMF,EAC7B,IAAKG,EAAK,EAAGA,EAAKD,EAAIC,GAAMH,EAE1BQ,EAAQhE,EAAW0D,EA7ed,GA6e6B1D,EAAW2D,EA7exC,GA8eLM,EAAQjE,EAAW0D,EA7ed,GA6e6B1D,EAAW2D,EA7exC,IA+ee,IAAhB9E,GAEFsF,EACEpN,KAAK4O,KAAK3B,EAAQA,EAAQC,EAAQA,GAClCjE,EAAW0D,EA5eP,GA6eJ1D,EAAW2D,EA7eP,IA+eS,GACbS,EACGL,EACC/D,EAAW0D,EApfX,GAqfA1D,EAAW2D,EArfX,GAsfFQ,EACAA,EAGFnE,EAAW0D,EA9fT,IA8f0BM,EAAQI,EACpCpE,EAAW0D,EA9fT,IA8f0BO,EAAQG,EAEpCpE,EAAW2D,EAjgBT,IAigB0BK,EAAQI,EACpCpE,EAAW2D,EAjgBT,IAigB0BM,EAAQG,GAC3BD,EAAW,IACpBC,EACE,IACAL,EACA/D,EAAW0D,EAngBT,GAogBF1D,EAAW2D,EApgBT,GAugBJ3D,EAAW0D,EA3gBT,IA2gB0BM,EAAQI,EACpCpE,EAAW0D,EA3gBT,IA2gB0BO,EAAQG,EAEpCpE,EAAW2D,EA9gBT,IA8gB0BK,EAAQI,EACpCpE,EAAW2D,EA9gBT,IA8gB0BM,EAAQG,IAItCD,EAAWpN,KAAK4O,KAAK3B,EAAQA,EAAQC,EAAQA,IAE9B,IACbG,EACGL,EACC/D,EAAW0D,EAphBX,GAqhBA1D,EAAW2D,EArhBX,GAshBFQ,EACAA,EAGFnE,EAAW0D,EA9hBT,IA8hB0BM,EAAQI,EACpCpE,EAAW0D,EA9hBT,IA8hB0BO,EAAQG,EAEpCpE,EAAW2D,EAjiBT,IAiiB0BK,EAAQI,EACpCpE,EAAW2D,EAjiBT,IAiiB0BM,EAAQG,GAW9C,IAFAP,EAAIJ,EAAQxE,QAAUwE,EAAQ1E,aAC9BgF,EAAcN,EAAQ1E,aACjBlE,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EAC1BY,EAAS,EAGTJ,EAAQhE,EAAWnF,EAnjBV,GAojBToJ,EAAQjE,EAAWnF,EAnjBV,GAojBTsJ,EAAWpN,KAAK4O,KAAK5O,KAAK2O,IAAI1B,EAAO,GAAKjN,KAAK2O,IAAIzB,EAAO,IAEtDR,EAAQzE,kBAENmF,EAAW,IAAGC,EAASL,EAAc/D,EAAWnF,EAnjB1C,GAmjB2DgJ,GAGjEM,EAAW,IACbC,EAAUL,EAAc/D,EAAWnF,EAvjB3B,GAujB4CgJ,EAAKM,GAI7DnE,EAAWnF,EA/jBD,IA+jBiBmJ,EAAQI,EACnCpE,EAAWnF,EA/jBD,IA+jBiBoJ,EAAQG,EAUrC,IALAL,EACE,GAAKN,EAAQ7E,+BAAiCkF,EAA0B,GAIrEjW,EAAI,EAAGA,EAAIkS,EAAMlS,GA7iBd,EA8iBN6V,EAAKxD,EAAWrS,EAlkBF,GAmkBd8V,EAAKzD,EAAWrS,EAlkBF,GAmkBduN,EAAI8E,EAAWrS,EAlkBD,GAqkBdqW,EAAMnN,KAAK2O,IAAItK,EAAGqI,EAAQ3E,qBAG1BkF,EAAQhE,EAAW0D,EArlBV,GAqlByB1D,EAAW2D,EArlBpC,GAslBTM,EAAQjE,EAAW0D,EArlBV,GAqlByB1D,EAAW2D,EArlBpC,IAwlBW,IAAhB9E,GACFsF,EACEpN,KAAK4O,KAAK3B,EAAQA,EAAQC,EAAQA,GAClCjE,EAAW0D,EAplBH,GAqlBR1D,EAAW2D,EArlBH,GAulBNF,EAAQ9E,WACN8E,EAAQ7E,+BAENuF,EAAW,IACbC,GACIL,EAAcG,EAAMnN,KAAKwG,IAAI,EAAI4G,GACnCA,EACAnE,EAAW0D,EAhmBT,IAomBFS,EAAW,IACbC,GAAWL,EAAcG,EAAMnN,KAAKwG,IAAI,EAAI4G,GAAaA,GAIzDV,EAAQ7E,+BAENuF,EAAW,IACbC,GAAWL,EAAcG,EAAOlE,EAAW0D,EA5mBvC,IAgnBFS,EAAW,IACbC,GAAUL,EAAcG,KAK9BC,EAAWpN,KAAK4O,KAAK5O,KAAK2O,IAAI1B,EAAO,GAAKjN,KAAK2O,IAAIzB,EAAO,IAEtDR,EAAQ9E,WACN8E,EAAQ7E,+BAENuF,EAAW,IACbC,GACIL,EAAcG,EAAMnN,KAAKwG,IAAI,EAAI4G,GACnCA,EACAnE,EAAW0D,EA/nBT,IAmoBFS,EAAW,IACbC,GAAWL,EAAcG,EAAMnN,KAAKwG,IAAI,EAAI4G,GAAaA,GAGzDV,EAAQ7E,gCAGVuF,EAAW,EACXC,GAAWL,EAAcG,EAAOlE,EAAW0D,EA3oBrC,KA+oBNS,EAAW,EACXC,GAAUL,EAAcG,IAO1BC,EAAW,IAEbnE,EAAW0D,EA7pBH,IA6pBoBM,EAAQI,EACpCpE,EAAW0D,EA7pBH,IA6pBoBO,EAAQG,EAEpCpE,EAAW2D,EAhqBH,IAgqBoBK,EAAQI,EACpCpE,EAAW2D,EAhqBH,IAgqBoBM,EAAQG,GASxC,IAAoB,IAAhBvF,EACF,IAAKhE,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EACS,IAA/BxD,EAAWnF,EArqBJ,MAsqBTwJ,EAAQtN,KAAK4O,KACX5O,KAAK2O,IAAI1F,EAAWnF,EA9qBhB,GA8qB8B,GAChC9D,KAAK2O,IAAI1F,EAAWnF,EA9qBlB,GA8qBgC,KA/oB9B,KAmpBNmF,EAAWnF,EAnrBP,GAgCE,GAopBHmF,EAAWnF,EAprBV,GAorBsCwJ,EAC1CrE,EAAWnF,EAprBP,GA+BE,GAspBHmF,EAAWnF,EArrBV,GAqrBsCwJ,GAG5CC,EACEtE,EAAWnF,EAtrBL,GAurBN9D,KAAK4O,MACF3F,EAAWnF,EA1rBN,GA0rByBmF,EAAWnF,EA5rBxC,KA6rBCmF,EAAWnF,EA3rBR,GA2rB2BmF,EAAWnF,EA7rB1C,KA8rBCmF,EAAWnF,EA3rBR,GA2rB2BmF,EAAWnF,EA7rB1C,KA8rBGmF,EAAWnF,EA5rBV,GA4rB6BmF,EAAWnF,EA9rB5C,KAisBN0J,EACExN,KAAK4O,MACF3F,EAAWnF,EAlsBN,GAksByBmF,EAAWnF,EApsBxC,KAqsBCmF,EAAWnF,EAnsBR,GAmsB2BmF,EAAWnF,EArsB1C,KAssBCmF,EAAWnF,EAnsBR,GAmsB2BmF,EAAWnF,EArsB1C,KAssBGmF,EAAWnF,EApsBV,GAosB6BmF,EAAWnF,EAtsB5C,KAusBA,EAEN2J,EAAa,GAAMzN,KAAKwG,IAAI,EAAIgH,IAAc,EAAIxN,KAAK4O,KAAKrB,IAG5DG,EACEzE,EAAWnF,EAhtBR,GAitBHmF,EAAWnF,EA/sBP,IA+sBuB2J,EAAYf,EAAQvE,UACjDc,EAAWnF,EAltBN,GAktBoB4J,EAEzBC,EACE1E,EAAWnF,EAptBR,GAqtBHmF,EAAWnF,EAntBP,IAmtBuB2J,EAAYf,EAAQvE,UACjDc,EAAWnF,EAttBN,GAstBoB6J,QAI7B,IAAK7J,EAAI,EAAGA,EAAI4B,EAAO5B,GAAK2I,EACS,IAA/BxD,EAAWnF,EAntBJ,KAotBTyJ,EACEtE,EAAWnF,EAxtBL,GAytBN9D,KAAK4O,MACF3F,EAAWnF,EA5tBN,GA4tByBmF,EAAWnF,EA9tBxC,KA+tBCmF,EAAWnF,EA7tBR,GA6tB2BmF,EAAWnF,EA/tB1C,KAguBCmF,EAAWnF,EA7tBR,GA6tB2BmF,EAAWnF,EA/tB1C,KAguBGmF,EAAWnF,EA9tBV,GA8tB6BmF,EAAWnF,EAhuB5C,KAmuBN0J,EACExN,KAAK4O,MACF3F,EAAWnF,EApuBN,GAouByBmF,EAAWnF,EAtuBxC,KAuuBCmF,EAAWnF,EAruBR,GAquB2BmF,EAAWnF,EAvuB1C,KAwuBCmF,EAAWnF,EAruBR,GAquB2BmF,EAAWnF,EAvuB1C,KAwuBGmF,EAAWnF,EAtuBV,GAsuB6BmF,EAAWnF,EAxuB5C,KAyuBA,EAEN2J,EACGxE,EAAWnF,EAxuBC,GAwuBuB9D,KAAKwG,IAAI,EAAIgH,IAChD,EAAIxN,KAAK4O,KAAKrB,IAGjBtE,EAAWnF,EA5uBI,GA4uBoB9D,KAAKsO,IACtC,EACAtO,KAAK4O,KACFnB,GACEzN,KAAK2O,IAAI1F,EAAWnF,EArvBrB,GAqvBmC,GACjC9D,KAAK2O,IAAI1F,EAAWnF,EArvBtB,GAqvBoC,KACnC,EAAI9D,KAAK4O,KAAKrB,MAKrBG,EACEzE,EAAWnF,EA/vBR,GAgwBHmF,EAAWnF,EA9vBP,IA8vBuB2J,EAAYf,EAAQvE,UACjDc,EAAWnF,EAjwBN,GAiwBoB4J,EAEzBC,EACE1E,EAAWnF,EAnwBR,GAowBHmF,EAAWnF,EAlwBP,IAkwBuB2J,EAAYf,EAAQvE,UACjDc,EAAWnF,EArwBN,GAqwBoB6J,GAM/B,MAAO,IAKP,IAAI9B,EAAUkD,EAAWlf,QAEzBmf,KAAKC,iBAAiB,WAAW,SAAUC,GACzC,IAAIC,EAAOD,EAAMC,KAEjBN,EAAQ,IAAI3F,aAAaiG,EAAKjF,OAE1BiF,EAAKhF,QAAO2E,EAAQ,IAAI5F,aAAaiG,EAAKhF,QAG9C0B,EAAQsD,EAAKjI,SAAU2H,EAAOC,GAG9BE,KAAKI,YACH,CACElF,MAAO2E,EAAMQ,QAEf,CAACR,EAAMQ,8BClzBb,IAAIC,EAAiB,EAAQ,OACzB3D,EAAU,EAAQ,OAClBC,EACF,WACEE,EAAU,EAAQ,OAElBC,EAAmB,EAAQ,OAU/B,SAASwD,EAAoBxI,EAAOkF,GAIlC,GAHAA,EAASA,GAAU,IAGdN,EAAQ5E,GACX,MAAM,IAAIzL,MACR,6FAGJ,IAAIyN,EAAgB6C,EAClB,kBAAmBK,EAASA,EAAOlD,cAAgB,UACnDoD,UAGEjF,EAAW4E,EAAQ9F,OAAO,GAAI+F,EAAkBE,EAAO/E,UACvDkF,EAAkBN,EAAQlD,iBAAiB1B,GAE/C,GAAIkF,EACF,MAAM,IAAI9Q,MACR,yCAA2C8Q,EAAgBvD,SAI/D7O,KAAKwR,OAAS,KACdxR,KAAK+M,MAAQA,EACb/M,KAAKkN,SAAWA,EAChBlN,KAAK+O,cAAgBA,EACrB/O,KAAKqS,SAAW,KAChBrS,KAAKwV,SAAU,EACfxV,KAAKyV,QAAS,EACdzV,KAAKqQ,cAC6B,mBAAzB4B,EAAO5B,cAA+B4B,EAAO5B,cAAgB,KAGtErQ,KAAK0V,cAAgB1V,KAAK0V,cAAcnD,KAAKvS,MAE7C,IAAI2V,OAAe1U,EACf+T,EAAOhV,KAEXA,KAAK4V,kBAAoB,WACnBZ,EAAKxD,QAAQwD,EAAKxD,OAAOqE,YAEzBF,GAAcG,aAAaH,GAE/BA,EAAeI,YAAW,WACxBJ,OAAe1U,EACf+T,EAAKgB,gBACJ,IAGLjJ,EAAM5B,GAAG,YAAanL,KAAK4V,mBAC3B7I,EAAM5B,GAAG,YAAanL,KAAK4V,mBAC3B7I,EAAM5B,GAAG,cAAenL,KAAK4V,mBAC7B7I,EAAM5B,GAAG,cAAenL,KAAK4V,mBAG7B5V,KAAKgW,cAGPT,EAAoB9G,UAAUwH,UAAY,WACxC,OAAOjW,KAAKwV,SAMdD,EAAoB9G,UAAUuH,YAAc,WACtChW,KAAKwR,QAAQxR,KAAKwR,OAAOqE,YAE7B7V,KAAKwR,OAASM,EAAQlB,aAAa0E,GACnCtV,KAAKwR,OAAOyD,iBAAiB,UAAWjV,KAAK0V,eAEzC1V,KAAKwV,UACPxV,KAAKwV,SAAU,EACfxV,KAAKM,UASTiV,EAAoB9G,UAAUiH,cAAgB,SAAUR,GACtD,GAAKlV,KAAKwV,QAAV,CAEA,IAAIU,EAAS,IAAIhH,aAAagG,EAAMC,KAAKjF,OAEzC4B,EAAQ1B,oBAAoBpQ,KAAK+M,MAAOmJ,EAAQlW,KAAKqQ,eACjDrQ,KAAKqQ,eAAeyB,EAAQvB,mBAAmBvQ,KAAK+M,MAAOmJ,GAC/DlW,KAAKqS,SAASnC,MAAQgG,EAGtBlW,KAAKmW,qBASPZ,EAAoB9G,UAAU0H,iBAAmB,SAAUC,GACzD,IAAI/D,EAAWrS,KAAKqS,SAEhBgE,EAAU,CACZnJ,SAAUlN,KAAKkN,SACfgD,MAAOmC,EAASnC,MAAMmF,QAGpBiB,EAAU,CAACjE,EAASnC,MAAMmF,QAS9B,OAPIe,IACFC,EAAQlG,MAAQkC,EAASlC,MAAMkF,OAC/BiB,EAAQtc,KAAKqY,EAASlC,MAAMkF,SAG9BrV,KAAKwR,OAAO4D,YAAYiB,EAASC,GAE1BtW,MAQTuV,EAAoB9G,UAAUnO,MAAQ,WACpC,GAAIN,KAAKyV,OACP,MAAM,IAAInU,MACR,kEAGJ,OAAItB,KAAKwV,UAGTxV,KAAKqS,SAAWP,EAAQhD,kBAAkB9O,KAAK+M,MAAO/M,KAAK+O,eAE3D/O,KAAKwV,SAAU,EACfxV,KAAKmW,kBAAiB,IANGnW,MAgB3BuV,EAAoB9G,UAAU8H,KAAO,WAGnC,OAFAvW,KAAKwV,SAAU,EAERxV,MAQTuV,EAAoB9G,UAAUnB,KAAO,WACnC,GAAItN,KAAKyV,OAAQ,OAAOzV,KAExBA,KAAKwV,SAAU,EACfxV,KAAKyV,QAAS,EAGdzV,KAAKqS,SAAW,KAGhBrS,KAAKwR,OAAOqE,YAGZ7V,KAAK+M,MAAMyJ,eAAe,YAAaxW,KAAK4V,mBAC5C5V,KAAK+M,MAAMyJ,eAAe,YAAaxW,KAAK4V,mBAC5C5V,KAAK+M,MAAMyJ,eAAe,cAAexW,KAAK4V,mBAC9C5V,KAAK+M,MAAMyJ,eAAe,cAAexW,KAAK4V,oBAMhDrI,EAAO1X,QAAU0f,mBCvMjB,IAAIkB,EAAkB,EAAQ,OAC1B9E,EAAU,EAAQ,OAClB+E,EAAU,EAAQ,OAKlBC,EAAW,CACbC,WAAY,CACVrH,EAAG,IACH/D,EAAG,KAELqL,OAAQ,EACRC,oBAAqB,GACrBC,IAAK/Q,KAAKgR,OACVC,MAAO,GAMT,SAASC,EAAWlK,EAAIuC,EAAG/D,EAAGf,EAAG0M,GAC/BnX,KAAKoX,cAAgBD,GAAc,KAEnCnX,KAAKjI,SAAW,GAChBiI,KAAKqX,cAAgB,EACrBrX,KAAKgN,GAAKA,GAAM,KAChBhN,KAAKsX,KAAO,KACZtX,KAAKuX,SAAW,KAEhBvX,KAAKuP,EAAIA,GAAK,KACdvP,KAAKwL,EAAIA,GAAK,KACExL,KAAKyK,EAAjB0M,EAAqB,QAEX1M,GAAK,IAiCrB,SAAS+M,EAAkBzK,EAAsB0K,EAAsBC,GACrE,IAAK,IAAIC,KAAOF,EAAa1f,SAAU,CACrC,IAAI6f,EAASH,EAAa1f,SAAS4f,GAC/BC,EAAOC,cACTL,EAAQzK,EAAO6K,EAAQF,GAEvBA,EAAOE,EAAO5K,IAAM,CAACuC,EAAGqI,EAAOrI,EAAG/D,EAAGoM,EAAOpM,IAKlD,SAASsM,EAA2B3a,EAAkBwM,GACpD,IAAIoO,EAAK5a,EAAEsN,EAAId,EAAEc,EACb+J,EAAK7K,EAAE4F,EAAIpS,EAAEoS,EACbkF,EAAK9K,EAAE6B,EAAIrO,EAAEqO,EACjB,OAAOuM,EAAK,GAAKA,EAAKA,EAAKvD,EAAKA,EAAKC,EAAKA,EAG5C,SAASuD,EAA4B7a,EAAkBwM,GACrD,IAAIoO,EAAK5a,EAAEsN,EAAId,EAAEc,EAAI,KACjB+J,EAAK7K,EAAE4F,EAAIpS,EAAEoS,EACbkF,EAAK9K,EAAE6B,EAAIrO,EAAEqO,EACjB,OAAOuM,EAAK,GAAKA,EAAKA,EAAKvD,EAAKA,EAAKC,EAAKA,EAG5C,SAASwD,EAA+B9a,EAAyB+a,GAC/D,IAAK,IAAI7L,EAAI,EAAGA,EAAI6L,EAAEpe,SAAUuS,EAC9B,IAAK2L,EAAa7a,EAAG+a,EAAE7L,IACrB,OAAO,EAGX,OAAO,EAOT,SAAS8L,EAA6Bhb,EAAkBwM,GACtD,IAAIyO,EAAKjb,EAAEoS,EACT8I,EAAKlb,EAAEqO,EACP8M,EAAKnb,EAAEsN,EACP8N,EAAK5O,EAAE4F,EACPiJ,EAAK7O,EAAE6B,EACPiN,EAAK9O,EAAEc,EACPiO,EAAMH,EAAKH,EACXO,EAAMH,EAAKH,EACXO,EAAMH,EAAKH,EACX3N,EAAI3E,KAAK4O,KAAK8D,EAAMA,EAAMC,EAAMA,GAClC,OAAO,IAAIzB,EACT,MACCkB,EAAKG,EAAMG,EAAM/N,EAAKiO,GAAO,GAC7BP,EAAKG,EAAMG,EAAMhO,EAAKiO,GAAO,GAC7BjO,EAAI2N,EAAKG,GAAM,GAIpB,SAASI,EAA6B1b,EAAkBwM,EAAkBe,GACxE,IAAI0N,EAAKjb,EAAEoS,EACT8I,EAAKlb,EAAEqO,EACP8M,EAAKnb,EAAEsN,EACP8N,EAAK5O,EAAE4F,EACPiJ,EAAK7O,EAAE6B,EACPiN,EAAK9O,EAAEc,EACPqO,EAAKpO,EAAE6E,EACPwJ,EAAKrO,EAAEc,EACPwN,EAAKtO,EAAED,EACPwO,EAAKb,EAAKG,EACVW,EAAKd,EAAKU,EACVK,EAAKd,EAAKG,EACVY,EAAKf,EAAKU,EACVM,EAAKZ,EAAKH,EACVgB,EAAKN,EAAKV,EACViB,EAAKnB,EAAKA,EAAKC,EAAKA,EAAKC,EAAKA,EAC9BkB,EAAKD,EAAKhB,EAAKA,EAAKC,EAAKA,EAAKC,EAAKA,EACnCgB,EAAKF,EAAKT,EAAKA,EAAKC,EAAKA,EAAKC,EAAKA,EACnCU,EAAKR,EAAKC,EAAKF,EAAKG,EACpBO,GAAMR,EAAKM,EAAKL,EAAKI,IAAY,EAALE,GAAUtB,EACtCwB,GAAMR,EAAKC,EAAKF,EAAKG,GAAMI,EAC3BG,GAAMX,EAAKM,EAAKP,EAAKQ,IAAY,EAALC,GAAUrB,EACtCyB,GAAMb,EAAKK,EAAKJ,EAAKG,GAAMK,EAC3Bxc,EAAI0c,EAAKA,EAAKE,EAAKA,EAAK,EACxB5B,EAAI,GAAKI,EAAKqB,EAAKC,EAAKC,EAAKC,GAC7BxP,EAAIqP,EAAKA,EAAKE,EAAKA,EAAKvB,EAAKA,EAC7B7N,IAAMvN,GAAKgb,EAAIlS,KAAK4O,KAAKsD,EAAIA,EAAI,EAAIhb,EAAIoN,KAAO,EAAIpN,GAAKoN,EAAI4N,GAC/D,OAAO,IAAIhB,EAAW,KAAMkB,EAAKuB,EAAKC,EAAKnP,EAAG4N,EAAKwB,EAAKC,EAAKrP,EAAGA,GAGlE,SAASsP,EAAmC7B,GAC1C,OAAQA,EAAEpe,QACR,KAAK,EACH,OAxDG,IAAIod,EAAW,MADc/Z,EAyDX+a,EAAE,IAxDG3I,EAAGpS,EAAEqO,EAAGrO,EAAEsN,GAyDtC,KAAK,EACH,OAAO0N,EAAcD,EAAE,GAAIA,EAAE,IAC/B,KAAK,EACH,OAAOW,EAAcX,EAAE,GAAIA,EAAE,GAAIA,EAAE,IACrC,QACE,MAAM,IAAI5W,MACR,sDAAwD4W,EAAEpe,QAhElE,IAAsCqD,EAqEtC,SAAS6c,EAAkC9B,EAAkBzO,GAC3D,IAAI4C,EAAGP,EAEP,GAAImM,EAAgBxO,EAAGyO,GAAI,MAAO,CAACzO,GAGnC,IAAK4C,EAAI,EAAGA,EAAI6L,EAAEpe,SAAUuS,EAC1B,GAAIyL,EAAYrO,EAAGyO,EAAE7L,KAAO4L,EAAgBE,EAAcD,EAAE7L,GAAI5C,GAAIyO,GAClE,MAAO,CAACA,EAAE7L,GAAI5C,GAKlB,IAAK4C,EAAI,EAAGA,EAAI6L,EAAEpe,OAAS,IAAKuS,EAC9B,IAAKP,EAAIO,EAAI,EAAGP,EAAIoM,EAAEpe,SAAUgS,EAC9B,GACEgM,EAAYK,EAAcD,EAAE7L,GAAI6L,EAAEpM,IAAKrC,IACvCqO,EAAYK,EAAcD,EAAE7L,GAAI5C,GAAIyO,EAAEpM,KACtCgM,EAAYK,EAAcD,EAAEpM,GAAIrC,GAAIyO,EAAE7L,KACtC4L,EAAgBY,EAAcX,EAAE7L,GAAI6L,EAAEpM,GAAIrC,GAAIyO,GAE9C,MAAO,CAACA,EAAE7L,GAAI6L,EAAEpM,GAAIrC,GAM1B,MAAM,IAAInI,MAAM,uDAGlB,SAAS2Y,EAAqB5K,GAC5B,IAAIlS,EAAIkS,EAAK+H,cACTzN,EAAI0F,EAAKiI,KAAKF,cACdsC,EAAKvc,EAAEsN,EAAId,EAAEc,EACb+J,GAAMrX,EAAEoS,EAAI5F,EAAEc,EAAId,EAAE4F,EAAIpS,EAAEsN,GAAKiP,EAC/BjF,GAAMtX,EAAEqO,EAAI7B,EAAEc,EAAId,EAAE6B,EAAIrO,EAAEsN,GAAKiP,EACnC,OAAOlF,EAAKA,EAAKC,EAAKA,EAyBxB,SAASyF,EAAqBvQ,EAAkBxM,EAAkBuN,GAChE,IACE6E,EACA0J,EAEAzN,EACA2N,EALE3E,EAAK7K,EAAE4F,EAAIpS,EAAEoS,EAGfkF,EAAK9K,EAAE6B,EAAIrO,EAAEqO,EAGbgO,EAAKhF,EAAKA,EAAKC,EAAKA,EAClB+E,GACFP,EAAK9b,EAAEsN,EAAIC,EAAED,EACbwO,GAAMA,EACNE,EAAKxP,EAAEc,EAAIC,EAAED,EAETwO,GADJE,GAAMA,IAEJ5J,GAAKiK,EAAKL,EAAKF,IAAO,EAAIO,GAC1BhO,EAAIxF,KAAK4O,KAAK5O,KAAKuO,IAAI,EAAG4E,EAAKK,EAAKjK,EAAIA,IACxC7E,EAAE6E,EAAI5F,EAAE4F,EAAIA,EAAIiF,EAAKhJ,EAAIiJ,EACzB/J,EAAEc,EAAI7B,EAAE6B,EAAI+D,EAAIkF,EAAKjJ,EAAIgJ,IAEzBjF,GAAKiK,EAAKP,EAAKE,IAAO,EAAIK,GAC1BhO,EAAIxF,KAAK4O,KAAK5O,KAAKuO,IAAI,EAAG0E,EAAKO,EAAKjK,EAAIA,IACxC7E,EAAE6E,EAAIpS,EAAEoS,EAAIA,EAAIiF,EAAKhJ,EAAIiJ,EACzB/J,EAAEc,EAAIrO,EAAEqO,EAAI+D,EAAIkF,EAAKjJ,EAAIgJ,KAG3B9J,EAAE6E,EAAIpS,EAAEoS,EAAI7E,EAAED,EACdC,EAAEc,EAAIrO,EAAEqO,GAIZ,SAAS2O,EAA0Bhd,EAAkBwM,GACnD,IAAIoO,EAAK5a,EAAEsN,EAAId,EAAEc,EAAI,KACnB+J,EAAK7K,EAAE4F,EAAIpS,EAAEoS,EACbkF,EAAK9K,EAAE6B,EAAIrO,EAAEqO,EACf,OAAOuM,EAAK,GAAKA,EAAKA,EAAKvD,EAAKA,EAAKC,EAAKA,EA4G5C,SAAS2F,EAA6B3C,EAAc4C,GAClD,IAAI5P,EAAI,EACR,GAAIgN,EAAaI,cAAe,CAE9B,IAAK,IAAIF,KAAOF,EAAa1f,SAAU,CACrC,IAAI6f,EAASH,EAAa1f,SAAS4f,GAC/BC,EAAOC,gBACTD,EAAOnN,EAAI2P,EAAcxC,EAAQyC,IAIrC5P,EApHJ,SAA2C6P,EAASD,GAClD,IAGIld,EAAGwM,EAAGe,EAAG6P,EAAIC,EAAInO,EAAGP,EAAGgB,EAAGiD,EAAI0K,EAH9B3Q,EAAIwQ,EAAQxgB,OAChB,GAAU,IAANgQ,EAAS,OAAO,EAQpB,IAHA3M,EAAImd,EAAQ,IACV/K,EAAI,EACNpS,EAAEqO,EAAI,EACF1B,GAAK,EAAG,OAAO3M,EAAEsN,EAOrB,GAJAd,EAAI2Q,EAAQ,GACZnd,EAAEoS,GAAK5F,EAAEc,EACTd,EAAE4F,EAAIpS,EAAEsN,EACRd,EAAE6B,EAAI,EACF1B,GAAK,EAAG,OAAO3M,EAAEsN,EAAId,EAAEc,EAI3ByP,EAAMvQ,EAAGxM,EADTuN,EAAI4P,EAAQ,IAIZnd,EAAI,IAAI+Z,EAAW,KAAM,KAAM,KAAM,KAAM/Z,GAC3CwM,EAAI,IAAIuN,EAAW,KAAM,KAAM,KAAM,KAAMvN,GAC3Ce,EAAI,IAAIwM,EAAW,KAAM,KAAM,KAAM,KAAMxM,GAC3CvN,EAAEma,KAAO5M,EAAE6M,SAAW5N,EACtBA,EAAE2N,KAAOna,EAAEoa,SAAW7M,EACtBA,EAAE4M,KAAO3N,EAAE4N,SAAWpa,EAGtBud,EAAM,IAAKrO,EAAI,EAAGA,EAAIvC,IAAKuC,EAAG,CAC5B3B,EAAI4P,EAAQjO,GACZ6N,EAAM/c,EAAEia,cAAezN,EAAEyN,cAAe1M,GACxCA,EAAI,IAAIwM,EAAW,KAAM,KAAM,KAAM,KAAMxM,GAK3CoB,EAAInC,EAAE2N,KACNxK,EAAI3P,EAAEoa,SACNxH,EAAKpG,EAAEyN,cAAc3M,EACrBgQ,EAAKtd,EAAEia,cAAc3M,EACrB,GACE,GAAIsF,GAAM0K,EAAI,CACZ,GAAIN,EAAWrO,EAAEsL,cAAe1M,EAAE0M,eAAgB,CAChDzN,EAAImC,EACJ3O,EAAEma,KAAO3N,EACTA,EAAE4N,SAAWpa,IACXkP,EACF,SAASqO,EAEX3K,GAAMjE,EAAEsL,cAAc3M,EACtBqB,EAAIA,EAAEwL,SACD,CACL,GAAI6C,EAAWrN,EAAEsK,cAAe1M,EAAE0M,eAAgB,EAChDja,EAAI2P,GACFwK,KAAO3N,EACTA,EAAE4N,SAAWpa,IACXkP,EACF,SAASqO,EAEXD,GAAM3N,EAAEsK,cAAc3M,EACtBqC,EAAIA,EAAEyK,gBAEDzL,IAAMgB,EAAEwK,MASjB,IANA5M,EAAE6M,SAAWpa,EACbuN,EAAE4M,KAAO3N,EACTxM,EAAEma,KAAO3N,EAAE4N,SAAW5N,EAAIe,EAG1B6P,EAAKN,EAAM9c,IACHuN,EAAIA,EAAE4M,QAAU3N,IACjB6Q,EAAKP,EAAMvP,IAAM6P,IACpBpd,EAAIuN,EACJ6P,EAAKC,GAGT7Q,EAAIxM,EAAEma,KAIRna,EAAI,CAACwM,EAAEyN,eACP1M,EAAIf,EAEJ,IADA,IAAIgR,EAAS,KACLjQ,EAAIA,EAAE4M,QAAU3N,GACL,KAAXgR,GAGNxd,EAAEnD,KAAK0Q,EAAE0M,eAKX,IAHA1M,EAzJF,SAAiB4P,EAASD,GACxB,IAKI5Q,EACA3M,EANAuP,EAAI,EACJuO,EAAaN,EAAQ9e,QAErBsO,EAAIwQ,EAAQxgB,OACZoe,EAAI,GAIR,IADAmC,EAAYO,GACLvO,EAAIvC,GACTL,EAAImR,EAAWvO,GACXvP,GAAKkb,EAAalb,EAAG2M,KACrB4C,GAGFvP,EAAIid,EADJ7B,EAAI8B,EAAY9B,EAAGzO,IAEnB4C,EAAI,GAGR,OAAOvP,EAsIH+d,CAAQ1d,EAAGkd,GAGVhO,EAAI,EAAGA,EAAIvC,IAAKuC,GACnBlP,EAAImd,EAAQjO,IACVkD,GAAK7E,EAAE6E,EACTpS,EAAEqO,GAAKd,EAAEc,EAEX,OAAOd,EAAED,EAcHqQ,CAAY/Q,OAAO0D,OAAOgK,EAAa1f,UAAWsiB,GAExD,OAAO5P,EAuBT,SAASsQ,EAAwB/O,EAAQe,EAAO2F,GAC9C,IAAKf,EAAQ5E,GACX,MAAM,IAAIzL,MACR,qFAGJoR,EAAU+D,EAAgB/D,EAASiE,GAEnC,IAAIe,EAAS,GACXjH,EAAY,GACZP,EAAQnD,EAAMmD,QACd2G,EAASnE,EAAQmE,OACjBC,EAAsBpE,EAAQoE,oBAC9BuD,EAAc3D,EAAQsE,qBAAqBtI,EAAQqE,KACnDE,EAAQvE,EAAQuE,MAEdrN,EAAY,IAAIsN,EAEpBnK,EAAMqC,aAAY,SAAUuI,EAAKf,GAC/B,IACIqE,EAAgB,IAAI/D,EAAWS,EAAK,KAAM,KADtCf,EAAW5H,KAAO4H,EAAW5H,KAAO,GAExCkM,EAAkBtR,EAEtBkN,EAAoB7M,SAAQ,SAAUX,GACpC,IAAIgG,EAAOsH,EAAWtN,GACtB4R,EAAkBA,EAAgBC,SAAS7L,MAG7C4L,EAAgBE,SAASzD,EAAKsD,MAhDlC,SAA8CxD,EAAc4C,GAE1D,IAAK,IAAI1C,KADTyC,EAAc3C,EAAc4C,GACZ5C,EAAa1f,SACd0f,EAAa1f,SAAS4f,GAC5B0D,0BA8CTC,CAAsB1R,EAAWyQ,GACjC7C,EAAQzK,EAAOnD,EAAW8N,GAC1B,IACEnI,EACA/D,EACAa,EAHE1B,EAAIuF,EAAMpW,OAId,IAAKuS,EAAI,EAAGA,EAAI1B,EAAG0B,IAAK,CACtB,IAAIgD,EAAOa,EAAM7D,GAEjBkD,EAAIsH,EAASI,EAAQS,EAAOrI,GAAME,EAClC/D,EAAIqL,EAASI,EAAQS,EAAOrI,GAAM7D,EAElCiF,EAAUpB,GAAQ,CAChBE,EAAGA,EACH/D,EAAGA,GAGDQ,IACFe,EAAMwO,iBAAiBlM,EAAMqD,EAAQkE,WAAWrH,EAAGA,GACnDxC,EAAMwO,iBAAiBlM,EAAMqD,EAAQkE,WAAWpL,EAAGA,IAGvD,OAAOiF,EAxaTyG,EAAWzI,UAAUoJ,YAAc,WACjC,OAAO7X,KAAKqX,cAAgB,GAG9BH,EAAWzI,UAAU2M,SAAW,SAAUpO,EAAI1R,GAC5C0E,KAAKjI,SAASiV,GAAM1R,IAClB0E,KAAKqX,eAGTH,EAAWzI,UAAU0M,SAAW,SAAUnO,GACxC,IAAKhN,KAAKjI,SAASyjB,eAAexO,GAAK,CACrC,IAAImK,EAAa,IAAID,EACrBlX,KAAKjI,SAASiV,GAAMmK,IAClBnX,KAAKqX,cAET,OAAOrX,KAAKjI,SAASiV,IAGvBkK,EAAWzI,UAAU4M,wBAA0B,WAC7C,GAAIrb,KAAK6X,cAAe,CACtB,IAAIjf,EAAOoH,KACX,IAAK,IAAI2X,KAAO/e,EAAKb,SAAU,CAC7B,IAAIuD,EAAQ1C,EAAKb,SAAS4f,GAC1Brc,EAAMiU,GAAK3W,EAAK2W,EAChBjU,EAAMkQ,GAAK5S,EAAK4S,EAChBlQ,EAAM+f,6BAkZZ,IAAII,EAAmBV,EAAwBxI,KAAK,MAAM,GAC1DkJ,EAAiBzP,OAAS+O,EAAwBxI,KAAK,MAAM,GAE7DhF,EAAO1X,QAAU4lB,mBCndjB,IAAIhF,EAAkB,EAAQ,OAC1B9E,EAAU,EAAQ,OAKlBgF,EAAW,CACb+E,WAAY,CAAC,IAAK,KAClB7E,OAAQ,GACRI,MAAO,GAaT,SAAS0E,EAAsB3P,EAAQe,EAAO2F,GAC5C,IAAKf,EAAQ5E,GACX,MAAM,IAAIzL,MACR,iFAKJ,IAAIoa,GAFJhJ,EAAU+D,EAAgB/D,EAASiE,IAEV+E,WAEzB,IAAKlN,MAAMoN,QAAQF,IAAqC,IAAtBA,EAAW5hB,OAC3C,MAAM,IAAIwH,MAAM,2DAElB,IAAIuV,EAASnE,EAAQmE,OACjBI,EAAQvE,EAAQuE,MAChB4E,EAAgB,EAAV7V,KAAK8V,GAEXC,GAAUlF,EAAS,IAAOI,EAC1BtM,EAAIoC,EAAMrB,MAEV6D,EAAImM,EAAW,GACflQ,EAAIkQ,EAAW,GAEnB,SAASM,EAAe3P,EAAGiC,GAIzB,OAHAA,EAAOiB,GAAK0H,EAAQjR,KAAKiW,IAAK5P,EAAIwP,EAAOlR,GAAKoR,EAC9CzN,EAAO9C,GAAKyL,EAAQjR,KAAKkW,IAAK7P,EAAIwP,EAAOlR,GAAKoR,EAEvCzN,EAGT,IAAIjC,EAAI,EAER,IAAKL,EAAQ,CACX,IAAIyE,EAAY,GAMhB,OAJA1D,EAAMqC,aAAY,SAAUC,GAC1BoB,EAAUpB,GAAQ2M,EAAe3P,IAAK,OAGjCoE,EAGT1D,EAAMuD,0BACJ,SAAU9F,EAAG8E,GAEX,OADA0M,EAAe3P,IAAKiD,GACbA,IAET,CACEsH,WAAY8E,IAKlB,IAAIS,EAAiBR,EAAsBpJ,KAAK,MAAM,GACtD4J,EAAenQ,OAAS2P,EAAsBpJ,KAAK,MAAM,GAEzDhF,EAAO1X,QAAUsmB,mBC9EjB,SACA,SACA,SACAtmB,EAAQumB,SAAW,EAAnB,wBCHA,IAAI3F,EAAkB,EAAQ,OAC1B9E,EAAU,EAAQ,OAKlBgF,EAAW,CACb+E,WAAY,CAAC,IAAK,KAClB7E,OAAQ,GACRE,IAAK/Q,KAAKgR,OACVC,MAAO,GAcT,SAASoF,EAAoBrQ,EAAQe,EAAO2F,GAC1C,IAAKf,EAAQ5E,GACX,MAAM,IAAIzL,MACR,iFAKJ,IAAIoa,GAFJhJ,EAAU+D,EAAgB/D,EAASiE,IAEV+E,WAEzB,IAAKlN,MAAMoN,QAAQF,IAAeA,EAAW5hB,OAAS,EACpD,MAAM,IAAIwH,MAAM,2DAElB,IAAInL,EAAIulB,EAAW5hB,OACf+c,EAASnE,EAAQmE,OACjBE,EAAMrE,EAAQqE,IACdE,EAAQvE,EAAQuE,MAEhB8E,GAAUlF,EAAS,IAAOI,EAE9B,SAAS+E,EAAe1N,GACtB,IAAK,IAAIjC,EAAI,EAAGA,EAAIlW,EAAGkW,IACrBiC,EAAOoN,EAAWrP,IAAM0K,IAAQE,EAAQ8E,EAG1C,OAAOzN,EAGT,IAAKtC,EAAQ,CACX,IAAIyE,EAAY,GAMhB,OAJA1D,EAAMqC,aAAY,SAAUC,GAC1BoB,EAAUpB,GAAQ2M,EAAe,OAG5BvL,EAGT1D,EAAMuD,0BACJ,SAAU9F,EAAG8E,GAEX,OADA0M,EAAe1M,GACRA,IAET,CACEsH,WAAY8E,IAKlB,IAAIY,EAAeD,EAAoB9J,KAAK,MAAM,GAClD+J,EAAatQ,OAASqQ,EAAoB9J,KAAK,MAAM,GAErDhF,EAAO1X,QAAUymB,mBC5EjB,IAAI7F,EAAkB,EAAQ,OAC1B9E,EAAU,EAAQ,OAKlB4K,EAAiBvW,KAAK8V,GAAK,IAK3BnF,EAAW,CACb+E,WAAY,CAAC,IAAK,KAClBc,gBAAgB,EAChBC,SAAS,GAWX,SAASC,EAAgB1Q,EAAQe,EAAO4P,EAAOjK,GAC7C,IAAKf,EAAQ5E,GACX,MAAM,IAAIzL,MACR,oFAGJoR,EAAU+D,EAAgB/D,EAASiE,IAEvB8F,UAASE,GAASJ,GAE9B,IAAIb,EAAahJ,EAAQgJ,WAEzB,IAAKlN,MAAMoN,QAAQF,IAAqC,IAAtBA,EAAW5hB,OAC3C,MAAM,IAAIwH,MAAM,2DAGlB,GAAoB,IAAhByL,EAAMrB,MAAa,CACrB,GAAIM,EAAQ,OAEZ,MAAO,GAGT,IAAI4Q,EAAKlB,EAAW,GAChBmB,EAAKnB,EAAW,GAEhBoB,EAAU,EACVC,EAAU,EAEd,IAAKrK,EAAQ8J,eAAgB,CAE3B,IAAIQ,EAAO9I,EAAAA,EACP+I,GAAO,IACPC,EAAOhJ,EAAAA,EACPiJ,GAAO,IAEXpQ,EAAMqC,aAAY,SAAUC,EAAMC,GAChC,IAAIC,EAAID,EAAKsN,GACTpR,EAAI8D,EAAKuN,GAETtN,EAAIyN,IAAMA,EAAOzN,GACjBA,EAAI0N,IAAMA,EAAO1N,GACjB/D,EAAI0R,IAAMA,EAAO1R,GACjBA,EAAI2R,IAAMA,EAAO3R,MAGvBsR,GAAWE,EAAOC,GAAQ,EAC1BF,GAAWG,EAAOC,GAAQ,EAG5B,IAAIlB,EAAMjW,KAAKiW,IAAIU,GACfT,EAAMlW,KAAKkW,IAAIS,GAEnB,SAASX,EAAe1N,GACtB,IAAIiB,EAAIjB,EAAOsO,GACXpR,EAAI8C,EAAOuO,GAKf,OAHAvO,EAAOsO,GAAME,GAAWvN,EAAIuN,GAAWb,GAAOzQ,EAAIuR,GAAWb,EAC7D5N,EAAOuO,GAAME,GAAWxN,EAAIuN,GAAWZ,GAAO1Q,EAAIuR,GAAWd,EAEtD3N,EAGT,IAAKtC,EAAQ,CACX,IAAIyE,EAAY,GAShB,OAPA1D,EAAMqC,aAAY,SAAUC,EAAMC,GAChC,IAAInD,EAAI,GACRA,EAAEyQ,GAAMtN,EAAKsN,GACbzQ,EAAE0Q,GAAMvN,EAAKuN,GACbpM,EAAUpB,GAAQ2M,EAAe7P,MAG5BsE,EAGT1D,EAAMuD,0BACJ,SAAU9F,EAAG8E,GAEX,OADA0M,EAAe1M,GACRA,IAET,CACEsH,WAAY8E,IAKlB,IAAIU,EAAWM,EAAgBnK,KAAK,MAAM,GAC1C6J,EAASpQ,OAAS0Q,EAAgBnK,KAAK,MAAM,GAE7ChF,EAAO1X,QAAUumB,mBCpHjB,IAAIzK,EAAU,EAAQ,OAClByL,EAAW,WACXC,EAAW,YAUf9P,EAAO1X,QAAU,SAAuBynB,EAAGlgB,GACzC,IAAKuU,EAAQ2L,KAAO3L,EAAQvU,GAC1B,MAAM,IAAIkE,MAAM,uDAElB,GAAIgc,EAAEC,QAAUngB,EAAEmgB,MAChB,MAAM,IAAIjc,MACR,8EAGJ,IAAIkc,EAAIF,EAAEG,WAGVD,EAAEE,gBAAgBJ,EAAEK,iBAEpB,IAAIC,EAAU,GACVC,EAAU,GAEVxR,EAAI,EA8CR,OA3CAiR,EAAElO,aAAY,SAAUuI,EAAKrI,GAC3BsO,EAAQjG,GAAOtL,EAEf+Q,EAASI,EAAGnR,EAAGiD,GAEfjD,OAGFjP,EAAEgS,aAAY,SAAUuI,EAAKrI,GAC3BuO,EAAQlG,GAAOtL,EAEf+Q,EAASI,EAAGnR,EAAGiD,GAEfjD,OAIFA,EAAI,EAEJiR,EAAE7N,aAAY,SAAUkI,EAAKrI,EAAMK,EAAQrB,EAAQwP,EAAIC,EAAIC,GACzDX,EACEG,EACAQ,EACA3R,IACAuR,EAAQjO,GACRiO,EAAQtP,GACRA,EACAgB,MAIJlS,EAAEqS,aAAY,SAAUkI,EAAKrI,EAAMK,EAAQrB,EAAQwP,EAAIC,EAAIC,GACzDX,EACEG,EACAQ,EACA3R,IACAwR,EAAQlO,GACRkO,EAAQvP,GACRA,EACAgB,MAIGkO,oBCzET,SACA,QACA,SACA,SACA,SACA,SACA,SACA3nB,EAAQooB,aAAe,EAAvB,OACA,yBCVA,IAAItM,EAAU,EAAQ,OAClB0L,EAAW,YAQf9P,EAAO1X,QAAU,SAAiBkX,GAChC,IAAK4E,EAAQ5E,GACX,MAAM,IAAIzL,MAAM,gDAElB,IAAI4c,EAAWnR,EAAMoR,YAYrB,OATApR,EAAMqR,uBAAsB,SAAUzG,EAAKrI,EAAMK,EAAQrB,GACvD+O,EAASa,GAAU,EAAMvG,EAAKhI,EAAQrB,EAAQgB,MAIhDvC,EAAMsR,qBAAoB,SAAU1G,EAAKrI,EAAMK,EAAQrB,GACrD+O,EAASa,GAAU,EAAOvG,EAAKrJ,EAAQqB,EAAQL,MAG1C4O,oBCvBT,IAAIvM,EAAU,EAAQ,OAClByL,EAAW,WACXC,EAAW,YAEf9P,EAAO1X,QAAU,SAAkBkX,EAAOmD,GACxC,IAAKyB,EAAQ5E,GACX,MAAM,IAAIzL,MAAM,0DAElB,IAAIgd,EAAIvR,EAAM0Q,WAEVc,EAAarO,EAEjB,GAAI1B,MAAMoN,QAAQ1L,GAAQ,CACxB,GAAqB,IAAjBA,EAAMpW,OAAc,OAAOwkB,EAE/BpO,EAAQ,IAAIsO,IAAItO,GAGlB,GAAIA,aAAiBsO,IAAK,CACxB,GAAmB,IAAftO,EAAMlB,KAAY,OAAOsP,EAE7BC,EAAa,SAAU5G,GACrB,OAAOzH,EAAMuO,IAAI9G,IAInB,IAAI+G,EAAMxO,EACVA,EAAQ,IAAIsO,IAEZE,EAAIzU,SAAQ,SAAUoF,GACpBa,EAAMhK,IAAI,GAAKmJ,MAInB,GAA0B,mBAAfkP,EACT,MAAM,IAAIjd,MACR,sGAGJ,GAAqB,mBAAV4O,GAQT,GAPAnD,EAAMqC,aAAY,SAAUuI,EAAKrI,GAC1BiP,EAAW5G,EAAKrI,IAErB8N,EAASkB,EAAG3G,EAAKrI,MAIH,IAAZgP,EAAE5S,MAAa,OAAO4S,OAE1BpO,EAAMjG,SAAQ,SAAU0N,GACtB,IAAK5K,EAAM4R,QAAQhH,GACjB,MAAM,IAAIrW,MACR,uCACEqW,EACA,sCAGNyF,EAASkB,EAAG3G,EAAK5K,EAAM4D,kBAAkBgH,OAoB7C,OAhBA5K,EAAM0C,aAAY,SAChBkI,EACArI,EACAK,EACArB,EACAsQ,EACAC,EACAb,GAEKO,EAAW5O,EAAQiP,KAEpBtQ,IAAWqB,GAAW4O,EAAWjQ,EAAQuQ,KAE7CxB,EAASiB,EAAGN,EAAYrG,EAAKhI,EAAQrB,EAAQgB,MAGxCgP,oBC7ET,IAAI3M,EAAU,EAAQ,OAClB0L,EAAW,YAEf9P,EAAO1X,QAAU,SAAoBkX,EAAO2F,GAC1C,IAAKf,EAAQ5E,GACX,MAAM,IAAIzL,MACR,4EAGmB,mBAAZoR,IAAwBA,EAAU,CAACoM,UAAWpM,IAIzD,IAAIoM,EAC2B,mBAH/BpM,EAAUA,GAAW,IAGJoM,UAA2BpM,EAAQoM,UAAY,KAEhE,GAAmB,aAAf/R,EAAMwE,KAAqB,OAAOxE,EAAMgS,OAE5C,IAAIC,EAAgBjS,EAAMoR,UAAU,CAAC5M,KAAM,aAyC3C,OAtCAxE,EAAMsR,qBAAoB,SAAU3O,EAAMJ,EAAMK,EAAQrB,GACtD+O,EAAS2B,GAAe,EAAOtP,EAAMC,EAAQrB,EAAQgB,MAIvDvC,EAAMqR,uBAAsB,SAAU5T,EAAG8E,EAAMK,EAAQrB,GACrD,IAAI2Q,GACDlS,EAAMwQ,OACQ,UAAfxQ,EAAMwE,MACNyN,EAActP,KAAKC,EAAQrB,GAEzB4Q,GACDnS,EAAMwQ,OACQ,UAAfxQ,EAAMwE,MACNyN,EAActP,KAAKpB,EAAQqB,GAEzBsP,EACFD,EAAcG,sBACZF,EACAH,EAAUE,EAAcI,kBAAkBH,GAAkB3P,IAG9D+N,EAAS2B,GAAe,EAAO,KAAMrP,EAAQrB,EAAQgB,GAInDK,IAAWrB,IAEX4Q,EACFF,EAAcG,sBACZD,EACAJ,EAAUE,EAAcI,kBAAkBF,GAAiB5P,IAG7D+N,EAAS2B,GAAe,EAAO,KAAM1Q,EAAQqB,EAAQL,OAIlD0P,oBC3DT,IAAIrN,EAAU,EAAQ,OAEtBpE,EAAO1X,QAAU,SAAiBkX,GAChC,IAAK4E,EAAQ5E,GACX,MAAM,IAAIzL,MACR,yEAGJ,OAAOyL,EAAMgS,KAAK,CAACxN,KAAM,4BCR3B,IAAII,EAAU,EAAQ,OAEtBpE,EAAO1X,QAAU,SAAiBkX,GAChC,IAAK4E,EAAQ5E,GACX,MAAM,IAAIzL,MACR,yEAGJ,OAAOyL,EAAMgS,KAAK,CAACxB,OAAO,sBCR5B,IAAI5L,EAAU,EAAQ,OAClB0L,EAAW,YAEf9P,EAAO1X,QAAU,SAAkBwpB,EAAY3M,GAC7C,IAAKf,EAAQ0N,GACX,MAAM,IAAI/d,MACR,0EAGmB,mBAAZoR,IAAwBA,EAAU,CAACoM,UAAWpM,IAIzD,IAAIoM,EAC2B,mBAH/BpM,EAAUA,GAAW,IAGJoM,UAA2BpM,EAAQoM,UAAY,KAGhE,IAAKO,EAAW9B,MAAO,OAAO8B,EAAWN,OAGzC,IAAIO,EAAcD,EAAWlB,UAAU,CAACZ,OAAO,IA6B/C,OA1BA8B,EAAW5P,aAAY,SACrBC,EACAJ,EACAK,EACArB,EACAiR,EACAC,EACAxB,GAEA,IAAIyB,EAAezB,EACfsB,EAAYI,eAAe/P,EAAQrB,GACnCgR,EAAYK,aAAahQ,EAAQrB,GAEjCmR,EACEX,GACFQ,EAAYH,sBACVM,EACAX,EAAUQ,EAAYF,kBAAkBK,GAAenQ,IAM7D+N,EAASiC,EAAatB,EAAYtO,EAAMC,EAAQrB,EAAQgB,MAGnDgQ,oBCjDT,IAAI3N,EAAU,EAAQ,OAClB0L,EAAW,YAEf9P,EAAO1X,QAAU,SAAsBkX,EAAO2F,GAC5C,IAAKf,EAAQ5E,GACX,MAAM,IAAIzL,MACR,8EAGmB,mBAAZoR,IAAwBA,EAAU,CAACoM,UAAWpM,IAIzD,IAAIoM,EAC2B,mBAH/BpM,EAAUA,GAAW,IAGJoM,UAA2BpM,EAAQoM,UAAY,KAEhE,GAAmB,eAAf/R,EAAMwE,KAAuB,OAAOxE,EAAMgS,OAE9C,IAAIa,EAAkB7S,EAAMoR,UAAU,CAAC5M,KAAM,eA6B7C,OA1BAxE,EAAMqR,uBAAsB,SAAU1O,EAAMJ,EAAMK,EAAQrB,GACxD+O,EAASuC,GAAiB,EAAMlQ,EAAMC,EAAQrB,EAAQgB,MAMxDvC,EAAMsR,qBAAoB,SAAU3O,EAAMJ,EAAMK,EAAQrB,GACtD,IAAKvB,EAAMwQ,MAAO,CAChB,IAAIkC,EAAeG,EAAgBlQ,KAAKC,EAAQrB,GAEhD,GAAImR,EAQF,YANIX,GACFc,EAAgBT,sBACdM,EACAX,EAAUc,EAAgBR,kBAAkBK,GAAenQ,KAOnE+N,EAASuC,GAAiB,EAAM,KAAMjQ,EAAQrB,EAAQgB,MAGjDsQ,oBCjDT,IAAIjO,EAAU,EAAQ,OAStBpE,EAAO1X,QAAU,SAAeynB,EAAGlgB,GACjC,IAAKuU,EAAQ2L,KAAO3L,EAAQvU,GAC1B,MAAM,IAAIkE,MAAM,8CAElB,GAAIgc,EAAEC,QAAUngB,EAAEmgB,MAChB,MAAM,IAAIjc,MACR,qEAGJ,IAAIkc,EAAIF,EAAEyB,OAGV,OAFAvB,EAAE5R,OAAOxO,GAAG,GAELogB,oBCnBK,EAAQ,OAEpB,WACS,EAAQ,4BCHfqC,EAAa,EAAQ,OACrBC,EAAQ,EAAQ,OAGpB,SAEAjqB,EAAQ,GAAgBgqB,EAAWE,cACZF,EAAWG,aACLH,EAAWI,mBACDJ,EAAWK,6BAChCL,EAAWM,QAEEL,EAAMM,sCCXrC,IAAIzO,EAAU,EAAQ,OAClB0O,EAAQ,EAAQ,MAChBC,EAAS,EAAQ,MAgNrB,SAASC,EAA2BC,EAAQzT,EAAO4C,GACjD,IAAKgC,EAAQ5E,GACX,MAAM,IAAIzL,MAAM,0DAElB,IAAKyL,EAAM4R,QAAQhP,GACjB,MAAM,IAAIrO,MACR,kCACEqO,EACA,oDAGNA,EAAS,GAAKA,EAGd,IAAI8Q,EAAO,IAAIjC,IAEXkC,EAAU,GACZC,EAAQ,EAEVD,EAAQ/Q,GAAU,EAMlB,IAJA,IAEItD,EAAG1B,EAAG0E,EAFNuR,EAAe,CAACjR,GAIW,IAAxBiR,EAAa9mB,QAAc,CAChC,IAAI+mB,EAAY,GAEhB,IAAKxU,EAAI,EAAG1B,EAAIiW,EAAa9mB,OAAQuS,EAAI1B,EAAG0B,IAC1CgD,EAAOuR,EAAavU,GAEhBoU,EAAKhC,IAAIpP,KAEboR,EAAKva,IAAImJ,GACTiR,EAAOO,EAAW9T,EAAMyT,GAAQnR,IAEhCqR,EAAQrR,GAAQsR,GAGlBA,IACAC,EAAeC,EAGjB,OAAOH,EAGT,IAAIT,EAAqBM,EAA2BhO,KAClD,KACA,qBAEE2N,EAA+BK,EAA2BhO,KAC5D,KACA,aA4EF1c,EAAQkqB,cArUR,SAAuBhT,EAAO4C,EAAQrB,GACpC,IAAKqD,EAAQ5E,GACX,MAAM,IAAIzL,MAAM,0DAElB,GAAIqN,UAAU7U,OAAS,EACrB,MAAM,IAAIwH,MACR,gFAGJ,IAAKyL,EAAM4R,QAAQhP,GACjB,MAAM,IAAIrO,MACR,kCACEqO,EACA,oDAGN,IAAK5C,EAAM4R,QAAQrQ,GACjB,MAAM,IAAIhN,MACR,kCACEgN,EACA,oDAON,IAJAqB,EAAS,GAAKA,KACdrB,EAAS,GAAKA,GAIZ,MAAO,CAACqB,GAIV,IAAImR,EAAkB/T,EAAMgU,iBAAiBxO,KAAKxF,GAChDiU,EAAgBjU,EAAMkU,kBAAkB1O,KAAKxF,GAE3CmU,EAAc,GAChBC,EAAY,GAGdD,EAAYvR,GAAU,KACtBwR,EAAU7S,GAAU,KAGpB,IAEE8S,EACA/R,EACAgS,EACAC,EACAjV,EACAP,EACAnB,EACAnN,EATE+jB,EAAgB,CAAC5R,GACnB6R,EAAgB,CAAClT,GAUfmT,GAAQ,EAEZC,EAAO,KAAOH,EAAcznB,QAAU0nB,EAAc1nB,QAClD,GAAIynB,EAAcznB,QAAU0nB,EAAc1nB,QAIxC,IAHAsnB,EAAgBG,EAChBA,EAAgB,GAEXlV,EAAI,EAAG1B,EAAIyW,EAActnB,OAAQuS,EAAI1B,EAAG0B,IAI3C,IAAKP,EAAI,EAAGtO,GAFZ6jB,EAAYL,EADZ3R,EAAO+R,EAAc/U,KAGKvS,OAAQgS,EAAItO,EAAGsO,IAQvC,IAPAwV,EAAWD,EAAUvV,MAEHoV,IAChBK,EAAcvnB,KAAKsnB,GACnBJ,EAAYI,GAAYjS,GAGtBiS,KAAYH,EAAW,CAEzBM,GAAQ,EACR,MAAMC,QAQZ,IAHAN,EAAgBI,EAChBA,EAAgB,GAEXnV,EAAI,EAAG1B,EAAIyW,EAActnB,OAAQuS,EAAI1B,EAAG0B,IAI3C,IAAKP,EAAI,EAAGtO,GAFZ6jB,EAAYP,EADZzR,EAAO+R,EAAc/U,KAGKvS,OAAQgS,EAAItO,EAAGsO,IAQvC,IAPAwV,EAAWD,EAAUvV,MAEHqV,IAChBK,EAAcxnB,KAAKsnB,GACnBH,EAAUG,GAAYjS,GAGpBiS,KAAYJ,EAAa,CAE3BO,GAAQ,EACR,MAAMC,EAOhB,IAAKD,EAAO,OAAO,KAInB,IAFA,IAAIE,EAAO,GAEJL,GACLK,EAAKC,QAAQN,GACbA,EAAWJ,EAAYI,GAKzB,IAFAA,EAAWH,EAAUQ,EAAKA,EAAK7nB,OAAS,IAEjCwnB,GACLK,EAAK3nB,KAAKsnB,GACVA,EAAWH,EAAUG,GAGvB,OAAOK,EAAK7nB,OAAS6nB,EAAO,MA4M9B9rB,EAAQmqB,aA/LR,SAAsBjT,EAAO4C,GAC3B,IAAKgC,EAAQ5E,GACX,MAAM,IAAIzL,MAAM,0DAElB,GAAIqN,UAAU7U,OAAS,EACrB,MAAM,IAAIwH,MACR,gFAGJ,IAAKyL,EAAM4R,QAAQhP,GACjB,MAAM,IAAIrO,MACR,kCACEqO,EACA,oDAKN,IAEEiR,EACAS,EACA/X,EACAe,EACAgC,EACA1B,EAPEkW,EAAY,GACdgB,EAAQ,GAWV,IAHAhB,EAXAlR,EAAS,GAAKA,IAWM,EACpBkS,EAAMlS,GAAU,CAACA,GAEV5F,OAAOC,KAAK6W,GAAW/mB,QAI5B,IAAKwP,KAHLsX,EAAeC,EACfA,EAAY,GAEFD,EAGR,IAAKvU,EAAI,EAAG1B,GAFZ0W,EAAYtU,EAAMkU,kBAAkB3X,IAEVxP,OAAQuS,EAAI1B,EAAG0B,IAGlCwV,EAFLxX,EAAIgX,EAAUhV,MAGZwV,EAAMxX,GAAKwX,EAAMvY,GAAGvP,OAAOsQ,GAC3BwW,EAAUxW,IAAK,GAMvB,OAAOwX,GAgJThsB,EAAQoqB,mBAAqBA,EAC7BpqB,EAAQqqB,6BAA+BA,EACvCrqB,EAAQsqB,QAjER,SAAiBpT,EAAO4C,GACtBA,EAAS,GAAKA,EAEd,IAKEmS,EACAC,EACAV,EACA/X,EACAe,EACAgC,EACAP,EACAnB,EACAnN,EAbE8gB,EAAI,GACN0D,EAAI,GACJtY,EAAQ,GAENwG,EAAQnD,EAAMmD,QAWlB,IAAK7D,EAAI,EAAG1B,EAAIuF,EAAMpW,OAAQuS,EAAI1B,EAAG0B,IAEnC2V,EADA1Y,EAAI4G,EAAM7D,IACH,GACP3C,EAAMJ,GAAK,EAGb,IAAI5M,EAAI,GAERgN,EAAMiG,GAAU,EAChBjT,EAAEiT,GAAU,EAIZ,IAFA,IAAIsS,EAAQ5B,EAAM6B,GAAGvS,GAEdsS,EAAMjT,MASX,IARA1F,EAAI2Y,EAAME,UACV7D,EAAEtkB,KAAKsP,GAEPwY,EAAKplB,EAAE4M,GACPyY,EAASrY,EAAMJ,GAIVwC,EAAI,EAAGtO,GAFZ6jB,EAAYtU,EAAMkU,kBAAkB3X,IAEVxP,OAAQgS,EAAItO,EAAGsO,KACvCzB,EAAIgX,EAAUvV,MAEHpP,IACTulB,EAAMG,QAAQ/X,GACd3N,EAAE2N,GAAKyX,EAAK,GAGVplB,EAAE2N,KAAOyX,EAAK,IAChBpY,EAAMW,IAAM0X,EACZC,EAAE3X,GAAGrQ,KAAKsP,IAKhB,MAAO,CAACgV,EAAG0D,EAAGtY,mBC7UhB,IAAI2Y,EAAa,WACf,OAAO,GAGTxsB,EAAQuqB,qBAAuB,SAAUrT,EAAOuV,GAC9C,IAEIjW,EAAGsD,EAAQrB,EAAQoB,EAFnB/E,EAAI2X,EAASxoB,OAKjB,GAAI6Q,EAAI,EAON,OANAgF,EAAS2S,EAAS,IAElB5S,EAAO3C,EAAMwQ,MACTxQ,EAAMwV,SAAS5S,EAAQA,EAAQ0S,GAC/BtV,EAAM2C,KAAKC,EAAQA,IAEN,CAACD,GAEX,GAGT/E,IAEA,IAAI6X,EAAW,IAAIhU,MAAM7D,GAEzB,IAAK0B,EAAI,EAAGA,EAAI1B,EAAG0B,IAAK,CAQtB,GAPAsD,EAAS2S,EAASjW,GAClBiC,EAASgU,EAASjW,EAAI,QAMTpL,KAJbyO,EAAO3C,EAAMwQ,MACTxQ,EAAM0V,iBAAiB9S,EAAQrB,EAAQ+T,GACvCtV,EAAM2C,KAAKC,EAAQrB,IAGrB,MAAM,IAAIhN,MACR,sEAGJkhB,EAASnW,GAAKqD,EAGhB,OAAO8S,kBCtBT3sB,EAAQ,GAAW,SACjBkX,EACAiR,EACArG,EACAhI,EACArB,EACAsI,GAIA,OAFAA,EAAa7M,OAAOiC,OAAO,GAAI4K,GAE3BoH,EACErG,MAAAA,EACK5K,EAAM2V,kBAAkB/S,EAAQrB,EAAQsI,GACrC7J,EAAM4V,yBAAyBhL,EAAKhI,EAAQrB,EAAQsI,GAE5De,MAAAA,EACK5K,EAAM6V,gBAAgBjT,EAAQrB,EAAQsI,GACnC7J,EAAM8V,uBAAuBlL,EAAKhI,EAAQrB,EAAQsI,mBCpClE/gB,EAAQ,EAAW,SAAUkX,EAAO4K,EAAKf,GAEvC,OADAA,EAAa7M,OAAOiC,OAAO,GAAI4K,GACxB7J,EAAM+V,QAAQnL,EAAKf,eCqC5BrJ,EAAO1X,QA3BP,SAAS4gB,EAAgBnI,EAAQyU,GAC/BzU,EAASA,GAAU,GAEnB,IAhBcnC,EAgBV6W,EAAS,GAEb,IAAK,IAAIlW,KAAKiW,EAAU,CACtB,IAAIE,EAAW3U,EAAOxB,GAClBoW,EAAMH,EAASjW,KApBPX,EAuBA+W,IApBC,iBAAN/W,GACM,mBAANA,GACPqC,MAAMoN,QAAQzP,IACdA,aAAaqS,KACbrS,aAAagX,KACbhX,aAAaiX,QACbjX,aAAakX,KAsBXL,EAAOlW,QADQ7L,IAAbgiB,EACUC,EAEAD,EATZD,EAAOlW,GAAK2J,EAAgBwM,EAAUC,GAa1C,OAAOF,iBCrCT,SAASM,EAAa7iB,GAEpB,MAAqB,iBAAVA,GAAsB8iB,MAAM9iB,GAAe,EAE/CA,EA4HT5K,EAAQ,GAAyB,SAAUyC,GACzC,OAxEF,SAA+BkrB,EAAgBC,GAC7C,IAAIC,EAAS,GAETC,EAAkB,SAAUra,GAC9B,YAAiB,IAANA,EAA0Bma,EAE9Bna,GAGmB,mBAAjBma,IAA6BE,EAAkBF,GAE1D,IAAI/c,EAAM,SAAUkQ,GAClB,OAAO+M,EAAgB/M,EAAW4M,KAGhCI,EAAgB,WAClB,OAAOD,OAAgB1iB,IAkDzB,MA/C8B,iBAAnBuiB,GACTE,EAAOG,eAAiBnd,EACxBgd,EAAOI,UAAY,SAAU/W,EAAO2C,GAClC,OAAOhJ,EAAIqG,EAAMqS,kBAAkB1P,KAErCgU,EAAOvR,UAAY,SAAUzC,EAAMkH,GACjC,OAAOlQ,EAAIkQ,IAEb8M,EAAOK,iBAAmBL,EAAOvR,UACjCuR,EAAOM,iBAAmBN,EAAOvR,WACE,mBAAnBqR,GAChBE,EAAOG,eAAiB,WACtB,MAAM,IAAIviB,MACR,sEAGJoiB,EAAOI,UAAY,SAAU/W,EAAO2C,GAElC,IAAIuU,EAAclX,EAAMkX,YAAYvU,GACpC,OAAOiU,EACLH,EACE9T,EACA3C,EAAMqS,kBAAkB1P,GACxBuU,EAAY,GACZA,EAAY,GACZlX,EAAM4D,kBAAkBsT,EAAY,IACpClX,EAAM4D,kBAAkBsT,EAAY,IACpClX,EAAMmX,aAAaxU,MAIzBgU,EAAOvR,UAAY,SAAUrV,EAAGK,EAAGO,EAAGmM,EAAG+F,EAAIC,EAAIC,GAC/C,OAAO6T,EAAgBH,EAAe1mB,EAAGK,EAAGO,EAAGmM,EAAG+F,EAAIC,EAAIC,KAE5D4T,EAAOK,iBAAmB,SAAUjnB,EAAGK,EAAGO,EAAGmM,GAC3C,OAAO8Z,EAAgBH,EAAe1mB,EAAGK,EAAGO,EAAGmM,KAEjD6Z,EAAOM,iBAAmB,SAAUlnB,EAAGK,GACrC,OAAOwmB,EAAgBH,EAAe1mB,EAAGK,OAG3CumB,EAAOG,eAAiBD,EACxBF,EAAOI,UAAYF,EACnBF,EAAOvR,UAAYyR,EACnBF,EAAOM,iBAAmBJ,GAGrBF,EAMAS,CAAsB7rB,EAAMgrB,eCzHrC/V,EAAO1X,QAAU,SAAiB4K,GAChC,OACY,OAAVA,GACiB,iBAAVA,GACmC,mBAAnCA,EAAMkiB,0BACa,mBAAnBliB,EAAM2jB,UACU,kBAAhB3jB,EAAM8c,0BCpBmDhQ,EAAO1X,QAAuI,WAAY,aAAa,SAASgU,EAAE/M,GAAG,OAAO+M,EAAE,mBAAmBwa,QAAQ,iBAAiBA,OAAOC,SAAS,SAASza,GAAG,cAAcA,GAAG,SAASA,GAAG,OAAOA,GAAG,mBAAmBwa,QAAQxa,EAAEjK,cAAcykB,QAAQxa,IAAIwa,OAAO5V,UAAU,gBAAgB5E,IAAK/M,GAAG,SAASA,EAAE+M,EAAE/M,GAAG+M,EAAE4E,UAAU1E,OAAOwa,OAAOznB,EAAE2R,WAAW5E,EAAE4E,UAAU7O,YAAYiK,EAAEY,EAAEZ,EAAE/M,GAAG,SAASgN,EAAED,GAAG,OAAOC,EAAEC,OAAOya,eAAeza,OAAO0a,eAAelS,OAAO,SAAS1I,GAAG,OAAOA,EAAE6a,WAAW3a,OAAO0a,eAAe5a,IAAIC,EAAED,GAAG,SAASY,EAAEZ,EAAE/M,GAAG,OAAO2N,EAAEV,OAAOya,eAAeza,OAAOya,eAAejS,OAAO,SAAS1I,EAAE/M,GAAG,OAAO+M,EAAE6a,UAAU5nB,EAAE+M,GAAGY,EAAEZ,EAAE/M,GAAG,SAASuP,IAAI,GAAG,oBAAoBsY,UAAUA,QAAQC,UAAU,OAAM,EAAG,GAAGD,QAAQC,UAAUC,KAAK,OAAM,EAAG,GAAG,mBAAmBC,MAAM,OAAM,EAAG,IAAI,OAAOC,QAAQtW,UAAUuW,QAAQtW,KAAKiW,QAAQC,UAAUG,QAAQ,IAAG,iBAAiB,EAAG,MAAMlb,GAAG,OAAM,GAAI,SAASsC,EAAEtC,EAAE/M,EAAEgN,GAAG,OAAOqC,EAAEE,IAAIsY,QAAQC,UAAUrS,OAAO,SAAS1I,EAAE/M,EAAEgN,GAAG,IAAIuC,EAAE,CAAC,MAAMA,EAAErS,KAAKirB,MAAM5Y,EAAEvP,GAAG,IAAIqP,EAAE,IAAI+Y,SAAS3S,KAAK0S,MAAMpb,EAAEwC,IAAI,OAAOvC,GAAGW,EAAE0B,EAAErC,EAAE2E,WAAWtC,GAAGA,EAAE8Y,MAAM,KAAKtW,WAAW,SAASxR,EAAE0M,GAAG,IAAI/M,EAAE,mBAAmBqmB,IAAI,IAAIA,SAAI,EAAO,OAAOhmB,EAAE,SAAS0M,GAAG,GAAG,OAAOA,IAAIwC,EAAExC,GAAG,IAAIqb,SAAS/T,SAASzC,KAAKrC,GAAG8Y,QAAQ,kBAAkB,OAAOtb,EAAE,IAAIwC,EAAE,GAAG,mBAAmBxC,EAAE,MAAM,IAAIub,UAAU,sDAAsD,QAAG,IAAStoB,EAAE,CAAC,GAAGA,EAAE2hB,IAAI5U,GAAG,OAAO/M,EAAE4J,IAAImD,GAAG/M,EAAEuoB,IAAIxb,EAAE1M,GAAG,SAASA,IAAI,OAAOgP,EAAEtC,EAAE8E,UAAU7E,EAAE9J,MAAMJ,aAAa,OAAOzC,EAAEsR,UAAU1E,OAAOwa,OAAO1a,EAAE4E,UAAU,CAAC7O,YAAY,CAACa,MAAMtD,EAAEmoB,YAAW,EAAGC,UAAS,EAAGC,cAAa,KAAM/a,EAAEtN,EAAE0M,IAAI1M,EAAE0M,GAAG,SAASa,EAAEb,GAAG,QAAG,IAASA,EAAE,MAAM,IAAI4b,eAAe,6DAA6D,OAAO5b,EAAE,IAAIiG,EAAE,WAAW,IAAI,IAAIjG,EAAE8E,UAAU,GAAG7R,EAAE,EAAEgN,EAAE6E,UAAU7U,OAAOgD,EAAEgN,EAAEhN,IAAI,GAAG6R,UAAU7R,GAAG,IAAI,IAAI2N,KAAKkE,UAAU7R,GAAG+M,EAAEY,GAAGkE,UAAU7R,GAAG2N,GAAG,OAAOZ,GAAG,SAAS1T,EAAE0T,EAAE/M,EAAEgN,EAAEW,GAAG,IAAI4B,EAAExC,EAAE6b,OAAOhf,IAAI5J,GAAGqP,EAAE,KAAK,OAAOE,EAAEF,EAAE,UAAU1B,EAAE4B,EAAEsZ,KAAKtZ,EAAEsZ,IAAI7b,IAAIuC,EAAE2R,YAAY3R,EAAE2R,WAAWlU,GAAG,aAAaW,EAAE4B,EAAEsZ,KAAKtZ,EAAEsZ,IAAI7b,GAAGuC,EAAE2R,YAAY3R,EAAE2R,WAAWlU,GAAGqC,EAAE,SAASzO,EAAEZ,GAAG,MAAM,WAAW+M,EAAE/M,IAAI,OAAOA,GAAGA,EAAE8C,cAAcmK,OAAO,SAASzM,EAAEuM,GAAG,IAAI/M,EAAE,IAAIA,KAAK+M,EAAE,OAAM,EAAG,OAAM,EAAG,SAASJ,EAAEI,EAAE/M,EAAEgN,GAAGC,OAAO6b,eAAe/b,EAAE/M,EAAE,CAACwoB,YAAW,EAAGE,cAAa,EAAGD,UAAS,EAAG9kB,MAAMqJ,IAAI,SAASN,EAAEK,EAAE/M,EAAEgN,GAAG,IAAIW,EAAE,CAAC6a,YAAW,EAAGE,cAAa,GAAI,mBAAmB1b,EAAEW,EAAE/D,IAAIoD,GAAGW,EAAEhK,MAAMqJ,EAAEW,EAAE8a,UAAS,GAAIxb,OAAO6b,eAAe/b,EAAE/M,EAAE2N,GAAG,SAASE,EAAEd,GAAG,SAAQnM,EAAEmM,IAAMA,EAAE+M,aAAapI,MAAMoN,QAAQ/R,EAAE+M,aAAa,mBAAmB7M,OAAOiC,SAAS8D,EAAE/F,OAAOiC,QAAQ,IAAI8G,EAAEtH,EAAE,CAAC3V,QAAQ,IAAIwU,EAAE,iBAAiBsa,QAAQA,QAAQ,KAAKrb,EAAEe,GAAG,mBAAmBA,EAAE4a,MAAM5a,EAAE4a,MAAM,SAASpb,EAAE/M,EAAEgN,GAAG,OAAOob,SAASzW,UAAUwW,MAAMvW,KAAK7E,EAAE/M,EAAEgN,IAAIgJ,EAAEzI,GAAG,mBAAmBA,EAAEwb,QAAQxb,EAAEwb,QAAQ9b,OAAO+b,sBAAsB,SAASjc,GAAG,OAAOE,OAAOgc,oBAAoBlc,GAAG9P,OAAOgQ,OAAO+b,sBAAsBjc,KAAK,SAASA,GAAG,OAAOE,OAAOgc,oBAAoBlc,IAAI,IAAIF,EAAEqc,OAAOzC,OAAO,SAAS1Z,GAAG,OAAOA,GAAGA,GAAG,SAASrM,IAAIA,EAAEyoB,KAAKvX,KAAK1O,MAAMwL,EAAE3V,QAAQ2H,EAAEgO,EAAE3V,QAAQqwB,KAAK,SAASrc,EAAE/M,GAAG,OAAO,IAAIqpB,SAAQ,SAAUrc,EAAEW,GAAG,SAAS4B,EAAEvC,GAAGD,EAAE2M,eAAe1Z,EAAEqP,GAAG1B,EAAEX,GAAG,SAASqC,IAAI,mBAAmBtC,EAAE2M,gBAAgB3M,EAAE2M,eAAe,QAAQnK,GAAGvC,EAAE,GAAGtO,MAAMkT,KAAKC,YAAYyX,EAAEvc,EAAE/M,EAAEqP,EAAE,CAAC+Z,MAAK,IAAK,UAAUppB,GAAG,SAAS+M,EAAE/M,EAAEgN,GAAG,mBAAmBD,EAAEsB,IAAIib,EAAEvc,EAAE,QAAQ/M,EAAU,CAACopB,MAAK,IAArE,CAA2Drc,EAAEwC,OAAiB7O,EAAE6oB,aAAa7oB,EAAEA,EAAEiR,UAAU6X,aAAQ,EAAO9oB,EAAEiR,UAAU8X,aAAa,EAAE/oB,EAAEiR,UAAU+X,mBAAc,EAAO,IAAI1Z,EAAE,GAAG,SAAStC,EAAEX,GAAG,GAAG,mBAAmBA,EAAE,MAAM,IAAIub,UAAU,0EAA0Evb,GAAG,SAASyT,EAAEzT,GAAG,YAAO,IAASA,EAAE2c,cAAchpB,EAAEipB,oBAAoB5c,EAAE2c,cAAc,SAASjX,EAAE1F,EAAE/M,EAAEgN,EAAEW,GAAG,IAAI4B,EAAEF,EAAEhP,EAAEuN,EAAE,GAAGF,EAAEV,QAAG,KAAUqC,EAAEtC,EAAEyc,UAAUna,EAAEtC,EAAEyc,QAAQvc,OAAOwa,OAAO,MAAM1a,EAAE0c,aAAa,SAAI,IAASpa,EAAEua,cAAc7c,EAAE8c,KAAK,cAAc7pB,EAAEgN,EAAE8c,SAAS9c,EAAE8c,SAAS9c,GAAGqC,EAAEtC,EAAEyc,SAASnpB,EAAEgP,EAAErP,SAAI,IAASK,EAAEA,EAAEgP,EAAErP,GAAGgN,IAAID,EAAE0c,kBAAkB,GAAG,mBAAmBppB,EAAEA,EAAEgP,EAAErP,GAAG2N,EAAE,CAACX,EAAE3M,GAAG,CAACA,EAAE2M,GAAGW,EAAEtN,EAAEykB,QAAQ9X,GAAG3M,EAAEnD,KAAK8P,IAAIuC,EAAEiR,EAAEzT,IAAI,GAAG1M,EAAErD,OAAOuS,IAAIlP,EAAE0pB,OAAO,CAAC1pB,EAAE0pB,QAAO,EAAG,IAAI/W,EAAE,IAAIxO,MAAM,+CAA+CnE,EAAErD,OAAO,IAAIgtB,OAAOhqB,GAAG,qEAAqEgT,EAAExX,KAAK,8BAA8BwX,EAAEiX,QAAQld,EAAEiG,EAAEyB,KAAKzU,EAAEgT,EAAEpH,MAAMvL,EAAErD,OAAO4Q,EAAEoF,EAAEvD,SAASA,QAAQya,MAAMza,QAAQya,KAAKtc,GAAG,OAAOb,EAAE,SAAShN,IAAI,IAAImD,KAAKinB,MAAM,OAAOjnB,KAAKsO,OAAOkI,eAAexW,KAAKuR,KAAKvR,KAAKknB,QAAQlnB,KAAKinB,OAAM,EAAG,IAAItY,UAAU7U,OAAOkG,KAAK4mB,SAASlY,KAAK1O,KAAKsO,QAAQtO,KAAK4mB,SAAS3B,MAAMjlB,KAAKsO,OAAOK,WAAW,SAASzR,EAAE2M,EAAE/M,EAAEgN,GAAG,IAAIW,EAAE,CAACwc,OAAM,EAAGC,YAAO,EAAO5Y,OAAOzE,EAAE0H,KAAKzU,EAAE8pB,SAAS9c,GAAGuC,EAAExP,EAAE0V,KAAK9H,GAAG,OAAO4B,EAAEua,SAAS9c,EAAEW,EAAEyc,OAAO7a,EAAEA,EAAE,SAAS8a,EAAEtd,EAAE/M,EAAEgN,GAAG,IAAIW,EAAEZ,EAAEyc,QAAQ,QAAG,IAAS7b,EAAE,MAAM,GAAG,IAAI4B,EAAE5B,EAAE3N,GAAG,YAAO,IAASuP,EAAE,GAAG,mBAAmBA,EAAEvC,EAAE,CAACuC,EAAEua,UAAUva,GAAG,CAACA,GAAGvC,EAAE,SAASD,GAAG,IAAI,IAAI/M,EAAE,IAAI0R,MAAM3E,EAAE/P,QAAQgQ,EAAE,EAAEA,EAAEhN,EAAEhD,SAASgQ,EAAEhN,EAAEgN,GAAGD,EAAEC,GAAG8c,UAAU/c,EAAEC,GAAG,OAAOhN,EAA7F,CAAgGuP,GAAG3P,EAAE2P,EAAEA,EAAEvS,QAAQ,SAASwkB,EAAEzU,GAAG,IAAI/M,EAAEkD,KAAKsmB,QAAQ,QAAG,IAASxpB,EAAE,CAAC,IAAIgN,EAAEhN,EAAE+M,GAAG,GAAG,mBAAmBC,EAAE,OAAO,EAAE,QAAG,IAASA,EAAE,OAAOA,EAAEhQ,OAAO,OAAO,EAAE,SAAS4C,EAAEmN,EAAE/M,GAAG,IAAI,IAAIgN,EAAE,IAAI0E,MAAM1R,GAAG2N,EAAE,EAAEA,EAAE3N,IAAI2N,EAAEX,EAAEW,GAAGZ,EAAEY,GAAG,OAAOX,EAAE,SAASsc,EAAEvc,EAAE/M,EAAEgN,EAAEW,GAAG,GAAG,mBAAmBZ,EAAEsB,GAAGV,EAAEyb,KAAKrc,EAAEqc,KAAKppB,EAAEgN,GAAGD,EAAEsB,GAAGrO,EAAEgN,OAAO,CAAC,GAAG,mBAAmBD,EAAEoL,iBAAiB,MAAM,IAAImQ,UAAU,6EAA6Evb,GAAGA,EAAEoL,iBAAiBnY,GAAE,SAAUuP,EAAEF,GAAG1B,EAAEyb,MAAMrc,EAAEud,oBAAoBtqB,EAAEuP,GAAGvC,EAAEqC,OAAO,SAASkb,EAAExd,GAAG,GAAG,mBAAmBA,EAAE,MAAM,IAAIvI,MAAM,+CAA+CtB,KAAKsX,KAAKzN,EAAEE,OAAO6b,eAAepoB,EAAE,sBAAsB,CAAC8nB,YAAW,EAAG5e,IAAI,WAAW,OAAOoG,GAAGuY,IAAI,SAASxb,GAAG,GAAG,iBAAiBA,GAAGA,EAAE,GAAGF,EAAEE,GAAG,MAAM,IAAIyd,WAAW,kGAAkGzd,EAAE,KAAKiD,EAAEjD,KAAKrM,EAAEyoB,KAAK,gBAAW,IAASjmB,KAAKsmB,SAAStmB,KAAKsmB,UAAUvc,OAAO0a,eAAezkB,MAAMsmB,UAAUtmB,KAAKsmB,QAAQvc,OAAOwa,OAAO,MAAMvkB,KAAKumB,aAAa,GAAGvmB,KAAKwmB,cAAcxmB,KAAKwmB,oBAAe,GAAQhpB,EAAEiR,UAAU8Y,gBAAgB,SAAS1d,GAAG,GAAG,iBAAiBA,GAAGA,EAAE,GAAGF,EAAEE,GAAG,MAAM,IAAIyd,WAAW,gFAAgFzd,EAAE,KAAK,OAAO7J,KAAKwmB,cAAc3c,EAAE7J,MAAMxC,EAAEiR,UAAU+Y,gBAAgB,WAAW,OAAOlK,EAAEtd,OAAOxC,EAAEiR,UAAUkY,KAAK,SAAS9c,GAAG,IAAI,IAAI/M,EAAE,GAAGgN,EAAE,EAAEA,EAAE6E,UAAU7U,OAAOgQ,IAAIhN,EAAE9C,KAAK2U,UAAU7E,IAAI,IAAIW,EAAE,UAAUZ,EAAEwC,EAAErM,KAAKsmB,QAAQ,QAAG,IAASja,EAAE5B,EAAEA,QAAG,IAAS4B,EAAEob,WAAW,IAAIhd,EAAE,OAAM,EAAG,GAAGA,EAAE,CAAC,IAAI0B,EAAE,GAAGrP,EAAEhD,OAAO,IAAIqS,EAAErP,EAAE,IAAIqP,aAAa7K,MAAM,MAAM6K,EAAE,IAAIhP,EAAE,IAAImE,MAAM,oBAAoB6K,EAAE,KAAKA,EAAE0C,QAAQ,IAAI,KAAK,MAAM1R,EAAEuqB,QAAQvb,EAAEhP,EAAE,IAAIuN,EAAE2B,EAAExC,GAAG,QAAG,IAASa,EAAE,OAAM,EAAG,GAAG,mBAAmBA,EAAEpB,EAAEoB,EAAE1K,KAAKlD,OAAO,CAAC,IAAIgT,EAAEpF,EAAE5Q,OAAO3D,EAAEuG,EAAEgO,EAAEoF,GAAG,IAAIhG,EAAE,EAAEA,EAAEgG,IAAIhG,EAAER,EAAEnT,EAAE2T,GAAG9J,KAAKlD,GAAG,OAAM,GAAIU,EAAEiR,UAAUkZ,YAAY,SAAS9d,EAAE/M,GAAG,OAAOyS,EAAEvP,KAAK6J,EAAE/M,GAAE,IAAKU,EAAEiR,UAAUtD,GAAG3N,EAAEiR,UAAUkZ,YAAYnqB,EAAEiR,UAAUmZ,gBAAgB,SAAS/d,EAAE/M,GAAG,OAAOyS,EAAEvP,KAAK6J,EAAE/M,GAAE,IAAKU,EAAEiR,UAAUyX,KAAK,SAASrc,EAAE/M,GAAG,OAAO0N,EAAE1N,GAAGkD,KAAKmL,GAAGtB,EAAE3M,EAAE8C,KAAK6J,EAAE/M,IAAIkD,MAAMxC,EAAEiR,UAAUoZ,oBAAoB,SAAShe,EAAE/M,GAAG,OAAO0N,EAAE1N,GAAGkD,KAAK4nB,gBAAgB/d,EAAE3M,EAAE8C,KAAK6J,EAAE/M,IAAIkD,MAAMxC,EAAEiR,UAAU+H,eAAe,SAAS3M,EAAE/M,GAAG,IAAIgN,EAAEW,EAAE4B,EAAEF,EAAEhP,EAAE,GAAGqN,EAAE1N,QAAG,KAAU2N,EAAEzK,KAAKsmB,SAAS,OAAOtmB,KAAK,QAAG,KAAU8J,EAAEW,EAAEZ,IAAI,OAAO7J,KAAK,GAAG8J,IAAIhN,GAAGgN,EAAE8c,WAAW9pB,EAAE,KAAKkD,KAAKumB,aAAavmB,KAAKsmB,QAAQvc,OAAOwa,OAAO,cAAc9Z,EAAEZ,GAAGY,EAAE+L,gBAAgBxW,KAAK2mB,KAAK,iBAAiB9c,EAAEC,EAAE8c,UAAU9pB,SAAS,GAAG,mBAAmBgN,EAAE,CAAC,IAAIuC,GAAG,EAAEF,EAAErC,EAAEhQ,OAAO,EAAEqS,GAAG,EAAEA,IAAI,GAAGrC,EAAEqC,KAAKrP,GAAGgN,EAAEqC,GAAGya,WAAW9pB,EAAE,CAACK,EAAE2M,EAAEqC,GAAGya,SAASva,EAAEF,EAAE,MAAM,GAAGE,EAAE,EAAE,OAAOrM,KAAK,IAAIqM,EAAEvC,EAAEge,QAAQ,SAASje,EAAE/M,GAAG,KAAKA,EAAE,EAAE+M,EAAE/P,OAAOgD,IAAI+M,EAAE/M,GAAG+M,EAAE/M,EAAE,GAAG+M,EAAEke,MAAlD,CAAyDje,EAAEuC,GAAG,IAAIvC,EAAEhQ,SAAS2Q,EAAEZ,GAAGC,EAAE,SAAI,IAASW,EAAE+L,gBAAgBxW,KAAK2mB,KAAK,iBAAiB9c,EAAE1M,GAAGL,GAAG,OAAOkD,MAAMxC,EAAEiR,UAAUlD,IAAI/N,EAAEiR,UAAU+H,eAAehZ,EAAEiR,UAAUuZ,mBAAmB,SAASne,GAAG,IAAI/M,EAAEgN,EAAEW,EAAE,QAAG,KAAUX,EAAE9J,KAAKsmB,SAAS,OAAOtmB,KAAK,QAAG,IAAS8J,EAAE0M,eAAe,OAAO,IAAI7H,UAAU7U,QAAQkG,KAAKsmB,QAAQvc,OAAOwa,OAAO,MAAMvkB,KAAKumB,aAAa,QAAG,IAASzc,EAAED,KAAK,KAAK7J,KAAKumB,aAAavmB,KAAKsmB,QAAQvc,OAAOwa,OAAO,aAAaza,EAAED,IAAI7J,KAAK,GAAG,IAAI2O,UAAU7U,OAAO,CAAC,IAAIuS,EAAEF,EAAEpC,OAAOC,KAAKF,GAAG,IAAIW,EAAE,EAAEA,EAAE0B,EAAErS,SAAS2Q,EAAE,oBAAoB4B,EAAEF,EAAE1B,KAAKzK,KAAKgoB,mBAAmB3b,GAAG,OAAOrM,KAAKgoB,mBAAmB,kBAAkBhoB,KAAKsmB,QAAQvc,OAAOwa,OAAO,MAAMvkB,KAAKumB,aAAa,EAAEvmB,KAAK,GAAG,mBAAmBlD,EAAEgN,EAAED,IAAI7J,KAAKwW,eAAe3M,EAAE/M,QAAQ,QAAG,IAASA,EAAE,IAAI2N,EAAE3N,EAAEhD,OAAO,EAAE2Q,GAAG,EAAEA,IAAIzK,KAAKwW,eAAe3M,EAAE/M,EAAE2N,IAAI,OAAOzK,MAAMxC,EAAEiR,UAAUwZ,UAAU,SAASpe,GAAG,OAAOsd,EAAEnnB,KAAK6J,GAAE,IAAKrM,EAAEiR,UAAUyZ,aAAa,SAASre,GAAG,OAAOsd,EAAEnnB,KAAK6J,GAAE,IAAKrM,EAAE2qB,cAAc,SAASte,EAAE/M,GAAG,MAAM,mBAAmB+M,EAAEse,cAActe,EAAEse,cAAcrrB,GAAGwhB,EAAE5P,KAAK7E,EAAE/M,IAAIU,EAAEiR,UAAU0Z,cAAc7J,EAAE9gB,EAAEiR,UAAU2Z,WAAW,WAAW,OAAOpoB,KAAKumB,aAAa,EAAEzT,EAAE9S,KAAKsmB,SAAS,IAAI,oBAAoBjC,SAASgD,EAAE5Y,UAAU4V,OAAOC,UAAU,WAAW,OAAOtkB,OAAOqnB,EAAEnF,GAAG,WAAW,IAAIrY,EAAE8E,UAAU7R,EAAE+M,EAAE/P,OAAOgQ,EAAE,EAAE,OAAO,IAAIud,GAAE,WAAY,OAAOvd,GAAGhN,EAAE,CAACurB,MAAK,GAAI,CAACA,MAAK,EAAG5nB,MAAMoJ,EAAEC,UAAUud,EAAEiB,MAAM,WAAW,OAAO,IAAIjB,GAAE,WAAY,MAAM,CAACgB,MAAK,OAAQhB,EAAEkB,aAAa,SAAS1e,GAAG,IAAI/M,EAAE,EAAEgN,EAAED,EAAE/P,OAAO,OAAO,IAAIutB,GAAE,WAAY,OAAOvqB,GAAGgN,EAAE,CAACue,MAAK,GAAI,CAACA,MAAK,EAAG5nB,MAAMoJ,EAAE/M,UAAUuqB,EAAEmB,GAAG,SAAS3e,GAAG,OAAOA,aAAawd,GAAG,iBAAiBxd,GAAG,OAAOA,GAAG,mBAAmBA,EAAEyN,MAAM,IAAI/M,EAAE8c,EAAEvb,EAAE,GAAGA,EAAE2c,qBAAqB,oBAAoBC,YAAY5c,EAAE6c,eAAe,oBAAoBtE,OAAO,IAAI/Z,EAAEC,EAAEpO,EAAE2P,EAAE8c,EAAEzsB,EAAEssB,qBAAqBI,EAAE1sB,EAAEwsB,eAAmB3G,EAAE,SAASnY,GAAG,IAAI/M,EAAE,SAAS+M,GAAG,MAAM,iBAAiBA,GAAG2E,MAAMoN,QAAQ/R,IAAI+e,GAAGF,YAAYI,OAAOjf,GAAGS,EAAEie,aAAa1e,GAAG,iBAAiBA,GAAG,OAAOA,EAAE,KAAKgf,GAAG,mBAAmBhf,EAAEwa,OAAOC,UAAUza,EAAEwa,OAAOC,YAAY,mBAAmBza,EAAEyN,KAAKzN,EAAE,KAA/N,CAAqOA,GAAG,IAAI/M,EAAE,MAAM,IAAIwE,MAAM,6DAA6D,OAAOxE,GAAG0gB,EAAEwE,EAAE+G,EAAE,SAASlf,EAAE/M,GAAG,IAAI,IAAIgN,EAAEW,EAAEkE,UAAU7U,OAAO,EAAEgD,EAAE,IAAIuP,EAAE5B,IAAI,IAAI,IAAI+D,MAAM/D,GAAG,GAAG0B,EAAE,EAAEhP,EAAEqgB,EAAE3T,KAAK,CAAC,GAAGsC,IAAI1B,EAAE,OAAO4B,EAAE,IAAIvC,EAAE3M,EAAEma,QAAQ+Q,KAAK,OAAOlc,IAAIrP,IAAIuP,EAAEvS,OAAOqS,GAAGE,EAAEA,EAAEF,KAAKrC,EAAErJ,QAAQuoB,EAAE,SAASnf,GAAG,SAASC,EAAEhN,GAAG,IAAIgN,EAAE,OAAOA,EAAED,EAAE6E,KAAK1O,OAAOA,MAAM1H,KAAK,aAAawR,EAAE+E,QAAQ/R,EAAEgN,EAAE,OAAOhN,EAAEgN,EAAED,GAAGC,EAA3G,CAA8G3M,EAAEmE,QAAQ4W,EAAE,SAASrO,GAAG,SAASC,EAAEhN,GAAG,IAAI2N,EAAE,OAAOA,EAAEZ,EAAE6E,KAAK1O,KAAKlD,IAAIkD,MAAM1H,KAAK,6BAA6B,mBAAmBgJ,MAAM2nB,mBAAmB3nB,MAAM2nB,kBAAkBve,EAAED,GAAGX,EAAE2E,UAAU7O,aAAa6K,EAAE,OAAO3N,EAAEgN,EAAED,GAAGC,EAAnN,CAAsNkf,GAAGE,EAAE,SAASrf,GAAG,SAASC,EAAEhN,GAAG,IAAI2N,EAAE,OAAOA,EAAEZ,EAAE6E,KAAK1O,KAAKlD,IAAIkD,MAAM1H,KAAK,qBAAqB,mBAAmBgJ,MAAM2nB,mBAAmB3nB,MAAM2nB,kBAAkBve,EAAED,GAAGX,EAAE2E,UAAU7O,aAAa6K,EAAE,OAAO3N,EAAEgN,EAAED,GAAGC,EAA3M,CAA8Mkf,GAAGG,EAAE,SAAStf,GAAG,SAASC,EAAEhN,GAAG,IAAI2N,EAAE,OAAOA,EAAEZ,EAAE6E,KAAK1O,KAAKlD,IAAIkD,MAAM1H,KAAK,kBAAkB,mBAAmBgJ,MAAM2nB,mBAAmB3nB,MAAM2nB,kBAAkBve,EAAED,GAAGX,EAAE2E,UAAU7O,aAAa6K,EAAE,OAAO3N,EAAEgN,EAAED,GAAGC,EAAxM,CAA2Mkf,GAAG,SAAShtB,EAAE6N,EAAE/M,GAAGkD,KAAK2X,IAAI9N,EAAE7J,KAAK4W,WAAW9Z,EAAEkD,KAAK2L,QAAQ,SAASmI,EAAEjK,EAAE/M,GAAGkD,KAAK2X,IAAI9N,EAAE7J,KAAK4W,WAAW9Z,EAAEkD,KAAK2L,QAAQ,SAASyd,EAAEvf,EAAE/M,GAAGkD,KAAK2X,IAAI9N,EAAE7J,KAAK4W,WAAW9Z,EAAEkD,KAAK2L,QAAQ,SAAS0d,EAAExf,EAAE/M,EAAEgN,EAAEW,EAAE4B,GAAGrM,KAAK2X,IAAI7a,EAAEkD,KAAK4W,WAAWvK,EAAErM,KAAKge,WAAWnU,EAAE7J,KAAK2P,OAAO7F,EAAE9J,KAAKsO,OAAO7D,EAAi6C,SAASrN,EAAEyM,EAAE/M,EAAEgN,EAAEW,EAAE4B,EAAEF,EAAEhP,GAAG,IAAIuN,EAAEoF,EAAE3Z,EAAEuH,EAAE,GAAG+M,EAAE,GAAGA,EAAE,IAAIX,EAAE,CAAC,KAAKY,EAAEb,EAAE6b,OAAOhf,IAAI+D,IAAI,MAAM,IAAIye,EAAE,SAASnvB,OAAO+C,EAAE,0BAA0B/C,OAAO0Q,EAAE,yBAAyBtU,EAAEkW,EAAE3O,EAAEyO,OAAO,GAAG,IAAIrC,EAAE,CAAC,GAAGuC,EAAE,GAAGA,IAAIyD,EAAEjG,EAAEyf,OAAO5iB,IAAI2F,IAAI,MAAM,IAAI6c,EAAE,SAASnvB,OAAO+C,EAAE,0BAA0B/C,OAAOsS,EAAE,yBAAyB,IAAI/O,EAAEwS,EAAEH,OAAOgI,IAAIlO,EAAEqG,EAAExB,OAAOqJ,IAAI,GAAGlN,IAAInN,EAAEoN,EAAEoF,EAAExB,WAAW,CAAC,GAAG7D,IAAIhB,EAAE,MAAM,IAAIyf,EAAE,SAASnvB,OAAO+C,EAAE,WAAW/C,OAAO0Q,EAAE,mCAAmC1Q,OAAOsS,EAAE,YAAYtS,OAAOuD,EAAE,MAAMvD,OAAO0P,EAAE,OAAOiB,EAAEoF,EAAEH,OAAOxZ,EAAEgW,EAAEzO,EAAEP,MAAM,CAAC,KAAK2S,EAAEjG,EAAEyf,OAAO5iB,IAAI+D,IAAI,MAAM,IAAIye,EAAE,SAASnvB,OAAO+C,EAAE,0BAA0B/C,OAAO0Q,EAAE,yBAAyBC,EAAE,IAAIZ,EAAEgG,EAAEH,OAAOG,EAAExB,OAAOnY,EAAEkW,EAAE3O,EAAEyO,EAAE,MAAM,CAACzB,EAAEvU,EAAEuH,GAA5lE1B,EAAEyS,UAAU9C,MAAM,WAAW3L,KAAKupB,SAAS,EAAEvpB,KAAKwpB,UAAU,EAAExpB,KAAKypB,iBAAiB,EAAEzpB,KAAK0pB,gBAAgB,EAAE1pB,KAAK2pB,cAAc,EAAE3pB,KAAK4pB,GAAG,GAAG5pB,KAAK2lB,IAAI,GAAG3lB,KAAKge,WAAW,IAAIlK,EAAErF,UAAU9C,MAAM,WAAW3L,KAAKupB,SAAS,EAAEvpB,KAAKwpB,UAAU,EAAExpB,KAAK2pB,cAAc,EAAE3pB,KAAK4pB,GAAG,GAAG5pB,KAAK2lB,IAAI,IAAIyD,EAAE3a,UAAU9C,MAAM,WAAW3L,KAAKypB,iBAAiB,EAAEzpB,KAAK0pB,gBAAgB,EAAE1pB,KAAKge,WAAW,IAAIqL,EAAE5a,UAAUob,OAAO,WAAW,IAAIhgB,EAAE,MAAM/M,EAAE,KAAKkD,KAAKge,aAAanU,EAAE/M,EAAE,cAAc,IAAIgN,EAAE9J,KAAK2P,OAAOgI,IAAIlN,EAAEzK,KAAKsO,OAAOqJ,IAAI3X,KAAK2P,OAAO9F,GAAGY,GAAGzK,KAAKA,KAAKge,YAAYlU,IAAIW,IAAIzK,KAAKsO,OAAOxR,GAAGgN,GAAG9J,OAAOqpB,EAAE5a,UAAUqb,YAAY,WAAW,IAAIjgB,EAAE,MAAM/M,EAAE,KAAKgN,EAAE9J,KAAK2P,OAAOgI,IAAIlN,EAAEzK,KAAKsO,OAAOqJ,IAAI3X,KAAKge,aAAanU,EAAE/M,EAAE,cAAc,IAAIuP,EAAErM,KAAK2P,OAAO9F,GAAGsC,EAAEE,EAAE5B,GAAG,QAAG,IAAS0B,EAAE,OAAOE,EAAE5B,GAAGzK,UAAUA,KAAKge,YAAYlU,IAAIW,IAAIzK,KAAKsO,OAAOxR,GAAGgN,GAAG9J,OAAOmM,EAAEoL,SAASvX,KAAKA,KAAKsX,KAAKnL,EAAEE,EAAE5B,GAAGzK,KAAKA,KAAKsO,OAAOxR,GAAGgN,GAAG9J,MAAMqpB,EAAE5a,UAAUsb,OAAO,WAAW,IAAIlgB,EAAE7J,KAAK2P,OAAOgI,IAAI7a,EAAEkD,KAAKsO,OAAOqJ,IAAI7N,EAAE,MAAMW,EAAE,KAAKzK,KAAKge,aAAalU,EAAEW,EAAE,qBAAqBzK,KAAK2P,OAAO7F,GAAGhN,UAAUkD,KAAKsO,OAAO7D,GAAGZ,IAAIwf,EAAE5a,UAAUub,YAAY,WAAW,IAAIngB,EAAE7J,KAAK2P,OAAOgI,IAAI7a,EAAEkD,KAAKsO,OAAOqJ,IAAI7N,EAAE,MAAMW,EAAE,KAAKzK,KAAKge,aAAalU,EAAEW,EAAE,mBAAc,IAASzK,KAAKuX,cAAS,IAASvX,KAAKsX,aAAatX,KAAK2P,OAAO7F,GAAGhN,UAAUkD,KAAKsO,OAAO7D,GAAGZ,KAAK7J,KAAKsX,KAAKC,cAAS,EAAOvX,KAAK2P,OAAO7F,GAAGhN,GAAGkD,KAAKsX,KAAKtX,KAAKsO,OAAO7D,GAAGZ,GAAG7J,KAAKsX,OAAOtX,KAAKuX,SAASD,KAAKtX,KAAKsX,UAAK,IAAStX,KAAKsX,OAAOtX,KAAKsX,KAAKC,SAASvX,KAAKuX,YAA4sB,IAAI0S,EAAE,CAAC,CAAC3xB,KAAK,SAASuR,GAAG,MAAM,MAAM9P,OAAO8P,EAAE,cAAcqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,EAAE4B,GAAG,IAAIF,EAAE/O,EAAE4C,KAAKlD,EAAEgN,EAAED,EAAEY,EAAE4B,GAAGlP,EAAEgP,EAAE,GAAGzB,EAAEyB,EAAE,GAAG,OAAOhP,EAAEyZ,WAAWlM,MAAM,CAACpS,KAAK,SAASuR,GAAG,MAAM,MAAM9P,OAAO8P,EAAE,eAAeqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,GAAG,OAAOrN,EAAE4C,KAAKlD,EAAEgN,EAAED,EAAEY,GAAG,GAAGmM,cAAc,CAACte,KAAK,SAASuR,GAAG,MAAM,MAAM9P,OAAO8P,EAAE,cAAcqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,EAAE4B,GAAG,IAAIF,EAAE/O,EAAE4C,KAAKlD,EAAEgN,EAAED,EAAEY,EAAE4B,GAAGlP,EAAEgP,EAAE,GAAGzB,EAAEyB,EAAE,GAAG,OAAOhP,EAAEyZ,WAAW4E,eAAe9Q,MAAM,CAACpS,KAAK,SAASuR,GAAG,MAAM,MAAM9P,OAAO8P,EAAE,cAAcqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,EAAE4B,EAAEF,GAAG,IAAIhP,EAAEC,EAAE4C,KAAKlD,EAAEgN,EAAED,EAAEY,EAAE4B,EAAEF,GAAGzB,EAAEvN,EAAE,GAAG2S,EAAE3S,EAAE,GAAGhH,EAAEgH,EAAE,GAAG,OAAOuN,EAAEkM,WAAW9G,GAAG3Z,EAAE6J,KAAK2mB,KAAK,wBAAwB,CAAChP,IAAIjN,EAAEiN,IAAIpG,KAAK,MAAMqF,WAAWlM,EAAEkM,WAAWte,KAAKwX,IAAI9P,QAAQ,CAAC1H,KAAK,SAASuR,GAAG,MAAM,SAAS9P,OAAO8P,EAAE,cAAcqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,EAAE4B,EAAEF,GAAG,IAAIhP,EAAEC,EAAE4C,KAAKlD,EAAEgN,EAAED,EAAEY,EAAE4B,EAAEF,GAAGzB,EAAEvN,EAAE,GAAG2S,EAAE3S,EAAE,GAAGhH,EAAEgH,EAAE,GAAG,GAAG,mBAAmBhH,EAAE,MAAM,IAAI+hB,EAAE,SAASne,OAAO+C,EAAE,oCAAoC,IAAIY,EAAEgN,EAAEkM,WAAWtZ,EAAEnH,EAAEuH,EAAEoS,IAAI,OAAOpS,EAAEoS,GAAGxS,EAAE0C,KAAK2mB,KAAK,wBAAwB,CAAChP,IAAIjN,EAAEiN,IAAIpG,KAAK,MAAMqF,WAAWlM,EAAEkM,WAAWte,KAAKwX,IAAI9P,QAAQ,CAAC1H,KAAK,SAASuR,GAAG,MAAM,SAAS9P,OAAO8P,EAAE,cAAcqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,EAAE4B,GAAG,IAAIF,EAAE/O,EAAE4C,KAAKlD,EAAEgN,EAAED,EAAEY,EAAE4B,GAAGlP,EAAEgP,EAAE,GAAGzB,EAAEyB,EAAE,GAAG,cAAchP,EAAEyZ,WAAWlM,GAAG1K,KAAK2mB,KAAK,wBAAwB,CAAChP,IAAIxa,EAAEwa,IAAIpG,KAAK,SAASqF,WAAWzZ,EAAEyZ,WAAWte,KAAKoS,IAAI1K,QAAQ,CAAC1H,KAAK,SAASuR,GAAG,MAAM,UAAU9P,OAAO8P,EAAE,eAAeqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,EAAE4B,GAAG,IAAIF,EAAE/O,EAAE4C,KAAKlD,EAAEgN,EAAED,EAAEY,EAAE4B,GAAGlP,EAAEgP,EAAE,GAAGzB,EAAEyB,EAAE,GAAG,IAAIzO,EAAEgN,GAAG,MAAM,IAAIwN,EAAE,SAASne,OAAO+C,EAAE,kDAAkD,OAAOK,EAAEyZ,WAAWlM,EAAE1K,KAAK2mB,KAAK,wBAAwB,CAAChP,IAAIxa,EAAEwa,IAAIpG,KAAK,UAAUqF,WAAWzZ,EAAEyZ,aAAa5W,QAAQ,CAAC1H,KAAK,SAASuR,GAAG,MAAM,QAAQ9P,OAAO8P,EAAE,eAAeqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,EAAE4B,GAAG,IAAIF,EAAE/O,EAAE4C,KAAKlD,EAAEgN,EAAED,EAAEY,EAAE4B,GAAGlP,EAAEgP,EAAE,GAAGzB,EAAEyB,EAAE,GAAG,IAAIzO,EAAEgN,GAAG,MAAM,IAAIwN,EAAE,SAASne,OAAO+C,EAAE,kDAAkD,OAAOgT,EAAE3S,EAAEyZ,WAAWlM,GAAG1K,KAAK2mB,KAAK,wBAAwB,CAAChP,IAAIxa,EAAEwa,IAAIpG,KAAK,QAAQqF,WAAWzZ,EAAEyZ,WAAWzB,KAAKzK,IAAI1K,QAAQ,CAAC1H,KAAK,SAASuR,GAAG,MAAM,SAAS9P,OAAO8P,EAAE,eAAeqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,EAAE4B,GAAG,IAAIF,EAAE/O,EAAE4C,KAAKlD,EAAEgN,EAAED,EAAEY,EAAE4B,GAAGlP,EAAEgP,EAAE,GAAGzB,EAAEyB,EAAE,GAAG,GAAG,mBAAmBzB,EAAE,MAAM,IAAIwN,EAAE,SAASne,OAAO+C,EAAE,0CAA0C,OAAOK,EAAEyZ,WAAWlM,EAAEvN,EAAEyZ,YAAY5W,KAAK2mB,KAAK,wBAAwB,CAAChP,IAAIxa,EAAEwa,IAAIpG,KAAK,SAASqF,WAAWzZ,EAAEyZ,aAAa5W,SAAamqB,EAAE,CAAC,CAAC7xB,KAAK,SAASuR,GAAG,MAAM,MAAM9P,OAAO8P,EAAE,cAAcqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,GAAG,IAAI4B,EAAE,GAAG,UAAUrM,KAAKuR,MAAM,UAAUzH,GAAGA,IAAI9J,KAAKuR,KAAK,MAAM,IAAI4X,EAAE,SAASpvB,OAAO+C,EAAE,6CAA6C/C,OAAOiG,KAAKuR,KAAK,YAAY,GAAG5C,UAAU7U,OAAO,EAAE,CAAC,GAAGkG,KAAKud,MAAM,MAAM,IAAI4L,EAAE,SAASpvB,OAAO+C,EAAE,0JAA0J,IAAIqP,EAAE,GAAGtC,EAAE1M,EAAE,GAAGsN,EAAE,GAAGA,EAAEkE,UAAU,KAAKtC,EAAElW,EAAE6J,KAAKmM,EAAEhP,EAAE2M,IAAI,MAAM,IAAIof,EAAE,SAASnvB,OAAO+C,EAAE,kDAAkD/C,OAAOoS,EAAE,SAASpS,OAAOoD,EAAE,YAAY,CAAC,GAAG,UAAU2M,EAAE,MAAM,IAAIqf,EAAE,SAASpvB,OAAO+C,EAAE,+IAA+I,GAAG+M,EAAE,GAAGA,IAAIwC,EAAErM,KAAKspB,OAAO5iB,IAAImD,IAAI,MAAM,IAAIqf,EAAE,SAASnvB,OAAO+C,EAAE,0BAA0B/C,OAAO8P,EAAE,yBAAyB,OAAOwC,EAAEuK,WAAWnM,MAAM,CAACnS,KAAK,SAASuR,GAAG,MAAM,MAAM9P,OAAO8P,EAAE,eAAeqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,GAAG,IAAIY,EAAE,GAAG,UAAUzK,KAAKuR,MAAM,UAAUzH,GAAGA,IAAI9J,KAAKuR,KAAK,MAAM,IAAI4X,EAAE,SAASpvB,OAAO+C,EAAE,6CAA6C/C,OAAOiG,KAAKuR,KAAK,YAAY,GAAG5C,UAAU7U,OAAO,EAAE,CAAC,GAAGkG,KAAKud,MAAM,MAAM,IAAI4L,EAAE,SAASpvB,OAAO+C,EAAE,0JAA0J,IAAIuP,EAAE,GAAGxC,EAAEsC,EAAE,GAAGwC,UAAU,GAAG,KAAKlE,EAAEtU,EAAE6J,KAAKqM,EAAEF,EAAErC,IAAI,MAAM,IAAIof,EAAE,SAASnvB,OAAO+C,EAAE,kDAAkD/C,OAAOsS,EAAE,SAAStS,OAAOoS,EAAE,YAAY,CAAC,GAAG,UAAUrC,EAAE,MAAM,IAAIqf,EAAE,SAASpvB,OAAO+C,EAAE,+IAA+I,GAAG+M,EAAE,GAAGA,IAAIY,EAAEzK,KAAKspB,OAAO5iB,IAAImD,IAAI,MAAM,IAAIqf,EAAE,SAASnvB,OAAO+C,EAAE,0BAA0B/C,OAAO8P,EAAE,yBAAyB,OAAOY,EAAEmM,cAAc,CAACte,KAAK,SAASuR,GAAG,MAAM,MAAM9P,OAAO8P,EAAE,cAAcqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,GAAG,IAAI4B,EAAE,GAAG,UAAUrM,KAAKuR,MAAM,UAAUzH,GAAGA,IAAI9J,KAAKuR,KAAK,MAAM,IAAI4X,EAAE,SAASpvB,OAAO+C,EAAE,6CAA6C/C,OAAOiG,KAAKuR,KAAK,YAAY,GAAG5C,UAAU7U,OAAO,EAAE,CAAC,GAAGkG,KAAKud,MAAM,MAAM,IAAI4L,EAAE,SAASpvB,OAAO+C,EAAE,0JAA0J,IAAIqP,EAAE,GAAGtC,EAAE1M,EAAE,GAAGsN,EAAE,GAAGA,EAAEkE,UAAU,KAAKtC,EAAElW,EAAE6J,KAAKmM,EAAEhP,EAAE2M,IAAI,MAAM,IAAIof,EAAE,SAASnvB,OAAO+C,EAAE,kDAAkD/C,OAAOoS,EAAE,SAASpS,OAAOoD,EAAE,YAAY,CAAC,GAAG,UAAU2M,EAAE,MAAM,IAAIqf,EAAE,SAASpvB,OAAO+C,EAAE,+IAA+I,GAAG+M,EAAE,GAAGA,IAAIwC,EAAErM,KAAKspB,OAAO5iB,IAAImD,IAAI,MAAM,IAAIqf,EAAE,SAASnvB,OAAO+C,EAAE,0BAA0B/C,OAAO8P,EAAE,yBAAyB,OAAOwC,EAAEuK,WAAW4E,eAAe/Q,MAAM,CAACnS,KAAK,SAASuR,GAAG,MAAM,MAAM9P,OAAO8P,EAAE,cAAcqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,EAAE4B,GAAG,IAAIF,EAAE,GAAG,UAAUnM,KAAKuR,MAAM,UAAUzH,GAAGA,IAAI9J,KAAKuR,KAAK,MAAM,IAAI4X,EAAE,SAASpvB,OAAO+C,EAAE,6CAA6C/C,OAAOiG,KAAKuR,KAAK,YAAY,GAAG5C,UAAU7U,OAAO,EAAE,CAAC,GAAGkG,KAAKud,MAAM,MAAM,IAAI4L,EAAE,SAASpvB,OAAO+C,EAAE,0JAA0J,IAAIK,EAAE,GAAG0M,EAAEa,EAAE,GAAGD,EAAE,GAAGA,EAAEkE,UAAU,GAAGtC,EAAEsC,UAAU,KAAKxC,EAAEhW,EAAE6J,KAAK7C,EAAEuN,EAAEZ,IAAI,MAAM,IAAIof,EAAE,SAASnvB,OAAO+C,EAAE,kDAAkD/C,OAAOoD,EAAE,SAASpD,OAAO2Q,EAAE,YAAY,CAAC,GAAG,UAAUZ,EAAE,MAAM,IAAIqf,EAAE,SAASpvB,OAAO+C,EAAE,+IAA+I,GAAG+M,EAAE,GAAGA,IAAIsC,EAAEnM,KAAKspB,OAAO5iB,IAAImD,IAAI,MAAM,IAAIqf,EAAE,SAASnvB,OAAO+C,EAAE,0BAA0B/C,OAAO8P,EAAE,yBAAyB,OAAOsC,EAAEyK,WAAWnM,GAAG4B,EAAErM,KAAK2mB,KAAK,wBAAwB,CAAChP,IAAIxL,EAAEwL,IAAIpG,KAAK,MAAMqF,WAAWzK,EAAEyK,WAAWte,KAAKmS,IAAIzK,QAAQ,CAAC1H,KAAK,SAASuR,GAAG,MAAM,SAAS9P,OAAO8P,EAAE,cAAcqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,EAAE4B,GAAG,IAAIF,EAAE,GAAG,UAAUnM,KAAKuR,MAAM,UAAUzH,GAAGA,IAAI9J,KAAKuR,KAAK,MAAM,IAAI4X,EAAE,SAASpvB,OAAO+C,EAAE,6CAA6C/C,OAAOiG,KAAKuR,KAAK,YAAY,GAAG5C,UAAU7U,OAAO,EAAE,CAAC,GAAGkG,KAAKud,MAAM,MAAM,IAAI4L,EAAE,SAASpvB,OAAO+C,EAAE,0JAA0J,IAAIK,EAAE,GAAG0M,EAAEa,EAAE,GAAGD,EAAE,GAAGA,EAAEkE,UAAU,GAAGtC,EAAEsC,UAAU,KAAKxC,EAAEhW,EAAE6J,KAAK7C,EAAEuN,EAAEZ,IAAI,MAAM,IAAIof,EAAE,SAASnvB,OAAO+C,EAAE,kDAAkD/C,OAAOoD,EAAE,SAASpD,OAAO2Q,EAAE,YAAY,CAAC,GAAG,UAAUZ,EAAE,MAAM,IAAIqf,EAAE,SAASpvB,OAAO+C,EAAE,+IAA+I,GAAG+M,EAAE,GAAGA,IAAIsC,EAAEnM,KAAKspB,OAAO5iB,IAAImD,IAAI,MAAM,IAAIqf,EAAE,SAASnvB,OAAO+C,EAAE,0BAA0B/C,OAAO8P,EAAE,yBAAyB,GAAG,mBAAmBwC,EAAE,MAAM,IAAI6L,EAAE,SAASne,OAAO+C,EAAE,oCAAoC,OAAOqP,EAAEyK,WAAWnM,GAAG4B,EAAEF,EAAEyK,WAAWnM,IAAIzK,KAAK2mB,KAAK,wBAAwB,CAAChP,IAAIxL,EAAEwL,IAAIpG,KAAK,MAAMqF,WAAWzK,EAAEyK,WAAWte,KAAKmS,IAAIzK,QAAQ,CAAC1H,KAAK,SAASuR,GAAG,MAAM,SAAS9P,OAAO8P,EAAE,cAAcqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,GAAG,IAAI4B,EAAE,GAAG,UAAUrM,KAAKuR,MAAM,UAAUzH,GAAGA,IAAI9J,KAAKuR,KAAK,MAAM,IAAI4X,EAAE,SAASpvB,OAAO+C,EAAE,6CAA6C/C,OAAOiG,KAAKuR,KAAK,YAAY,GAAG5C,UAAU7U,OAAO,EAAE,CAAC,GAAGkG,KAAKud,MAAM,MAAM,IAAI4L,EAAE,SAASpvB,OAAO+C,EAAE,0JAA0J,IAAIqP,EAAE,GAAGtC,EAAE1M,EAAE,GAAGsN,EAAE,GAAGA,EAAEkE,UAAU,KAAKtC,EAAElW,EAAE6J,KAAKmM,EAAEhP,EAAE2M,IAAI,MAAM,IAAIof,EAAE,SAASnvB,OAAO+C,EAAE,kDAAkD/C,OAAOoS,EAAE,SAASpS,OAAOoD,EAAE,YAAY,CAAC,GAAG,UAAU2M,EAAE,MAAM,IAAIqf,EAAE,SAASpvB,OAAO+C,EAAE,+IAA+I,GAAG+M,EAAE,GAAGA,IAAIwC,EAAErM,KAAKspB,OAAO5iB,IAAImD,IAAI,MAAM,IAAIqf,EAAE,SAASnvB,OAAO+C,EAAE,0BAA0B/C,OAAO8P,EAAE,yBAAyB,cAAcwC,EAAEuK,WAAWnM,GAAGzK,KAAK2mB,KAAK,wBAAwB,CAAChP,IAAItL,EAAEsL,IAAIpG,KAAK,SAASqF,WAAWvK,EAAEuK,WAAWte,KAAKmS,IAAIzK,QAAQ,CAAC1H,KAAK,SAASuR,GAAG,MAAM,UAAU9P,OAAO8P,EAAE,eAAeqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,GAAG,IAAI4B,EAAE,GAAG,UAAUrM,KAAKuR,MAAM,UAAUzH,GAAGA,IAAI9J,KAAKuR,KAAK,MAAM,IAAI4X,EAAE,SAASpvB,OAAO+C,EAAE,6CAA6C/C,OAAOiG,KAAKuR,KAAK,YAAY,GAAG5C,UAAU7U,OAAO,EAAE,CAAC,GAAGkG,KAAKud,MAAM,MAAM,IAAI4L,EAAE,SAASpvB,OAAO+C,EAAE,0JAA0J,IAAIqP,EAAE,GAAGtC,EAAE1M,EAAE,GAAGsN,EAAE,GAAGA,EAAEkE,UAAU,KAAKtC,EAAElW,EAAE6J,KAAKmM,EAAEhP,EAAE2M,IAAI,MAAM,IAAIof,EAAE,SAASnvB,OAAO+C,EAAE,kDAAkD/C,OAAOoS,EAAE,SAASpS,OAAOoD,EAAE,YAAY,CAAC,GAAG,UAAU2M,EAAE,MAAM,IAAIqf,EAAE,SAASpvB,OAAO+C,EAAE,+IAA+I,GAAG+M,EAAE,GAAGA,IAAIwC,EAAErM,KAAKspB,OAAO5iB,IAAImD,IAAI,MAAM,IAAIqf,EAAE,SAASnvB,OAAO+C,EAAE,0BAA0B/C,OAAO8P,EAAE,yBAAyB,IAAInM,EAAE+M,GAAG,MAAM,IAAIyN,EAAE,SAASne,OAAO+C,EAAE,kDAAkD,OAAOuP,EAAEuK,WAAWnM,EAAEzK,KAAK2mB,KAAK,wBAAwB,CAAChP,IAAItL,EAAEsL,IAAIpG,KAAK,UAAUqF,WAAWvK,EAAEuK,aAAa5W,QAAQ,CAAC1H,KAAK,SAASuR,GAAG,MAAM,QAAQ9P,OAAO8P,EAAE,eAAeqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,GAAG,IAAI4B,EAAE,GAAG,UAAUrM,KAAKuR,MAAM,UAAUzH,GAAGA,IAAI9J,KAAKuR,KAAK,MAAM,IAAI4X,EAAE,SAASpvB,OAAO+C,EAAE,6CAA6C/C,OAAOiG,KAAKuR,KAAK,YAAY,GAAG5C,UAAU7U,OAAO,EAAE,CAAC,GAAGkG,KAAKud,MAAM,MAAM,IAAI4L,EAAE,SAASpvB,OAAO+C,EAAE,0JAA0J,IAAIqP,EAAE,GAAGtC,EAAE1M,EAAE,GAAGsN,EAAE,GAAGA,EAAEkE,UAAU,KAAKtC,EAAElW,EAAE6J,KAAKmM,EAAEhP,EAAE2M,IAAI,MAAM,IAAIof,EAAE,SAASnvB,OAAO+C,EAAE,kDAAkD/C,OAAOoS,EAAE,SAASpS,OAAOoD,EAAE,YAAY,CAAC,GAAG,UAAU2M,EAAE,MAAM,IAAIqf,EAAE,SAASpvB,OAAO+C,EAAE,+IAA+I,GAAG+M,EAAE,GAAGA,IAAIwC,EAAErM,KAAKspB,OAAO5iB,IAAImD,IAAI,MAAM,IAAIqf,EAAE,SAASnvB,OAAO+C,EAAE,0BAA0B/C,OAAO8P,EAAE,yBAAyB,IAAInM,EAAE+M,GAAG,MAAM,IAAIyN,EAAE,SAASne,OAAO+C,EAAE,kDAAkD,OAAOgT,EAAEzD,EAAEuK,WAAWnM,GAAGzK,KAAK2mB,KAAK,wBAAwB,CAAChP,IAAItL,EAAEsL,IAAIpG,KAAK,QAAQqF,WAAWvK,EAAEuK,WAAWzB,KAAK1K,IAAIzK,QAAQ,CAAC1H,KAAK,SAASuR,GAAG,MAAM,SAAS9P,OAAO8P,EAAE,eAAeqgB,SAAS,SAASrgB,EAAE/M,EAAEgN,GAAGD,EAAE4E,UAAU3R,GAAG,SAAS+M,EAAEY,GAAG,IAAI4B,EAAE,GAAG,UAAUrM,KAAKuR,MAAM,UAAUzH,GAAGA,IAAI9J,KAAKuR,KAAK,MAAM,IAAI4X,EAAE,SAASpvB,OAAO+C,EAAE,6CAA6C/C,OAAOiG,KAAKuR,KAAK,YAAY,GAAG5C,UAAU7U,OAAO,EAAE,CAAC,GAAGkG,KAAKud,MAAM,MAAM,IAAI4L,EAAE,SAASpvB,OAAO+C,EAAE,0JAA0J,IAAIqP,EAAE,GAAGtC,EAAE1M,EAAE,GAAGsN,EAAE,GAAGA,EAAEkE,UAAU,KAAKtC,EAAElW,EAAE6J,KAAKmM,EAAEhP,EAAE2M,IAAI,MAAM,IAAIof,EAAE,SAASnvB,OAAO+C,EAAE,kDAAkD/C,OAAOoS,EAAE,SAASpS,OAAOoD,EAAE,YAAY,CAAC,GAAG,UAAU2M,EAAE,MAAM,IAAIqf,EAAE,SAASpvB,OAAO+C,EAAE,+IAA+I,GAAG+M,EAAE,GAAGA,IAAIwC,EAAErM,KAAKspB,OAAO5iB,IAAImD,IAAI,MAAM,IAAIqf,EAAE,SAASnvB,OAAO+C,EAAE,0BAA0B/C,OAAO8P,EAAE,yBAAyB,GAAG,mBAAmBY,EAAE,MAAM,IAAIyN,EAAE,SAASne,OAAO+C,EAAE,0CAA0C,OAAOuP,EAAEuK,WAAWnM,EAAE4B,EAAEuK,YAAY5W,KAAK2mB,KAAK,wBAAwB,CAAChP,IAAItL,EAAEsL,IAAIpG,KAAK,SAASqF,WAAWvK,EAAEuK,aAAa5W,SAAaoqB,EAAE7f,EAAE8f,EAAErI,EAAEsI,GAAG,WAAW,IAAIzgB,EAAE8E,UAAU7R,EAAE,KAAKgN,GAAG,EAAE,OAAO,IAAIsgB,GAAE,WAAY,IAAI,IAAI3f,EAAE,OAAO,CAAC,GAAG,OAAO3N,EAAE,CAAC,KAAKgN,GAAGD,EAAE/P,OAAO,MAAM,CAACuuB,MAAK,GAAIvrB,EAAEutB,EAAExgB,EAAEC,IAAI,IAAG,KAAMW,EAAE3N,EAAEwa,QAAQ+Q,KAAK,MAAMvrB,EAAE,KAAK,OAAO2N,MAAM8f,GAAG,CAAC,CAACjyB,KAAK,QAAQiZ,KAAK,SAAS,CAACjZ,KAAK,UAAUiZ,KAAK,WAAWiZ,UAAU,MAAM,CAAClyB,KAAK,WAAWiZ,KAAK,WAAWiZ,UAAU,OAAO,CAAClyB,KAAK,eAAeiZ,KAAK,QAAQiZ,UAAU,MAAM,CAAClyB,KAAK,gBAAgBiZ,KAAK,QAAQiZ,UAAU,OAAO,CAAClyB,KAAK,gBAAgBiZ,KAAK,YAAY,CAACjZ,KAAK,kBAAkBiZ,KAAK,eAAe,SAASkZ,GAAG5gB,EAAE/M,EAAEgN,EAAEW,GAAG,IAAI4B,GAAE,EAAG,IAAI,IAAIF,KAAKrP,EAAE,GAAGqP,IAAI1B,EAAE,CAAC,IAAItN,EAAEL,EAAEqP,GAAG,GAAGE,EAAEvC,EAAE3M,EAAEwa,IAAIxa,EAAEyZ,WAAWzZ,EAAEwS,OAAOgI,IAAIxa,EAAEmR,OAAOqJ,IAAIxa,EAAEwS,OAAOiH,WAAWzZ,EAAEmR,OAAOsI,WAAWzZ,EAAE6gB,YAAYnU,GAAGwC,EAAE,OAAOlP,EAAEwa,KAAK,SAAS+S,GAAG7gB,EAAE/M,EAAEgN,EAAEW,GAAG,IAAI4B,EAAEF,EAAEhP,EAAEuN,GAAE,EAAG,IAAI,IAAIoF,KAAKhT,EAAE,GAAGgT,IAAIrF,EAAE,CAAC4B,EAAEvP,EAAEgT,GAAG,EAAE,CAAC,GAAG3D,EAAEE,EAAEsD,OAAOxS,EAAEkP,EAAEiC,OAAO5D,EAAEZ,EAAEuC,EAAEsL,IAAItL,EAAEuK,WAAWzK,EAAEwL,IAAIxa,EAAEwa,IAAIxL,EAAEyK,WAAWzZ,EAAEyZ,WAAWvK,EAAE2R,YAAYnU,GAAGa,EAAE,OAAO2B,EAAEsL,IAAItL,EAAEA,EAAEiL,gBAAW,IAASjL,IAAI,SAASse,GAAG9gB,EAAE/M,GAAG,IAAIgN,EAAEW,EAAEV,OAAOC,KAAKH,GAAGwC,EAAE5B,EAAE3Q,OAAOqS,EAAE,EAAE,OAAO,IAAI5B,GAAE,WAAY,GAAG,GAAGT,EAAEA,EAAEA,EAAEwN,SAAS,CAAC,GAAGnL,GAAGE,EAAE,MAAM,CAACgc,MAAK,GAAI,IAAIlrB,EAAEsN,EAAE0B,KAAK,GAAGhP,IAAIL,EAAE,CAACgN,OAAE,EAAO,SAASA,EAAED,EAAE1M,WAAW2M,GAAG,MAAM,CAACue,MAAK,EAAG5nB,MAAM,CAACiP,KAAK5F,EAAE6N,IAAIf,WAAW9M,EAAE8M,WAAWjH,OAAO7F,EAAE6F,OAAOgI,IAAIrJ,OAAOxE,EAAEwE,OAAOqJ,IAAIiT,iBAAiB9gB,EAAE6F,OAAOiH,WAAWiU,iBAAiB/gB,EAAEwE,OAAOsI,WAAWoH,WAAWlU,EAAEkU,gBAAgB,SAAS8M,GAAGjhB,EAAE/M,EAAEgN,EAAEW,GAAG,IAAI4B,EAAEvP,EAAEgN,GAAG,GAAGuC,EAAE,CAAC,IAAIF,EAAEE,EAAEsD,OAAOxS,EAAEkP,EAAEiC,OAAO,OAAO7D,EAAE4B,EAAEsL,IAAItL,EAAEuK,WAAWzK,EAAEwL,IAAIxa,EAAEwa,IAAIxL,EAAEyK,WAAWzZ,EAAEyZ,WAAWvK,EAAE2R,aAAanU,EAAEwC,EAAEsL,SAAI,GAAQ,SAASoT,GAAGlhB,EAAE/M,EAAEgN,EAAEW,GAAG,IAAI4B,EAAEvP,EAAEgN,GAAG,GAAGuC,EAAE,CAAC,IAAIF,GAAE,EAAG,EAAE,CAAC,GAAGA,EAAE1B,EAAE4B,EAAEsL,IAAItL,EAAEuK,WAAWvK,EAAEsD,OAAOgI,IAAItL,EAAEiC,OAAOqJ,IAAItL,EAAEsD,OAAOiH,WAAWvK,EAAEiC,OAAOsI,WAAWvK,EAAE2R,YAAYnU,GAAGsC,EAAE,OAAOE,EAAEsL,IAAItL,EAAEA,EAAEiL,gBAAW,IAASjL,IAAI,SAAS2e,GAAGnhB,EAAE/M,GAAG,IAAIgN,EAAED,EAAE/M,GAAG,YAAO,IAASgN,EAAEwN,KAAK,IAAI/M,GAAE,WAAY,IAAIT,EAAE,MAAM,CAACue,MAAK,GAAI,IAAIxe,EAAE,CAAC6F,KAAK5F,EAAE6N,IAAIf,WAAW9M,EAAE8M,WAAWjH,OAAO7F,EAAE6F,OAAOgI,IAAIrJ,OAAOxE,EAAEwE,OAAOqJ,IAAIiT,iBAAiB9gB,EAAE6F,OAAOiH,WAAWiU,iBAAiB/gB,EAAEwE,OAAOsI,WAAWoH,WAAWlU,EAAEkU,YAAY,OAAOlU,EAAEA,EAAEwN,KAAK,CAAC+Q,MAAK,EAAG5nB,MAAMoJ,MAAMU,EAAE2X,GAAG,CAACxS,KAAK5F,EAAE6N,IAAIf,WAAW9M,EAAE8M,WAAWjH,OAAO7F,EAAE6F,OAAOgI,IAAIrJ,OAAOxE,EAAEwE,OAAOqJ,IAAIiT,iBAAiB9gB,EAAE6F,OAAOiH,WAAWiU,iBAAiB/gB,EAAEwE,OAAOsI,WAAWoH,WAAWlU,EAAEkU,aAAa,SAASiN,GAAGphB,EAAE/M,GAAG,GAAG,IAAI+M,EAAEmF,KAAK,MAAM,GAAG,GAAG,UAAUlS,GAAGA,IAAI+M,EAAE0H,KAAK,MAAM,mBAAmB/C,MAAM0c,KAAK1c,MAAM0c,KAAKrhB,EAAEyf,OAAOtf,QAAQ+e,EAAElf,EAAEyf,OAAOtf,OAAOH,EAAEyf,OAAOta,MAAM,IAAI,IAAIlF,EAAEW,EAAE4B,EAAE,eAAevP,EAAE+M,EAAEshB,eAAethB,EAAEuhB,aAAajf,EAAE,IAAIqC,MAAMnC,GAAGlP,EAAE,eAAeL,EAAE4N,EAAEb,EAAEyf,OAAO7b,SAASqC,EAAE,GAAE,KAAMhG,EAAEY,EAAE4M,QAAQ+Q,OAAO5d,EAAEX,EAAErJ,OAAOud,aAAa7gB,IAAIgP,EAAE2D,KAAKrF,EAAEkN,KAAK,OAAOxL,EAAE,SAASkf,GAAGxhB,EAAE/M,EAAEgN,EAAEW,GAAG,GAAG,IAAI3N,EAAEkS,KAAK,IAAI,IAAI3C,EAAEF,EAAEhP,EAAE,UAAU2M,GAAGA,IAAIhN,EAAEyU,KAAK7G,EAAE,eAAeZ,EAAEgG,GAAE,EAAG3Z,EAAE2G,EAAEwsB,OAAO7b,UAAS,KAAMpB,EAAElW,EAAEmhB,QAAQ+Q,MAAM,GAAGlc,EAAEE,EAAE5L,OAAOtD,GAAGgP,EAAE6R,aAAatT,EAAE,CAAC,IAAIhN,EAAEyO,EAAE7O,EAAEI,EAAEia,IAAIlO,EAAE/L,EAAEkZ,WAAWpN,EAAE9L,EAAEiS,OAAOhF,EAAEjN,EAAE4Q,OAAO,GAAGwB,EAAErF,EAAEnN,EAAEmM,EAAED,EAAEmO,IAAIhN,EAAEgN,IAAInO,EAAEoN,WAAWjM,EAAEiM,WAAWzK,EAAE6R,YAAYnU,GAAGiG,EAAE,OAAOxS,GAAG,SAASguB,GAAGzhB,EAAE/M,GAAG,GAAG,IAAI+M,EAAEmF,KAAK,OAAOzE,EAAE+d,QAAQ,IAAIxe,EAAE,UAAUhN,GAAGA,IAAI+M,EAAE0H,KAAK9G,EAAE,eAAe3N,EAAEuP,EAAExC,EAAEyf,OAAO7b,SAAS,OAAO,IAAIlD,GAAE,WAAY,IAAI,IAAIV,EAAE/M,IAAI,CAAC,IAAI+M,EAAEwC,EAAEiL,QAAQ+Q,KAAK,OAAOxe,EAAE,GAAG/M,EAAE+M,EAAEpJ,OAAOqJ,GAAGhN,EAAEkhB,aAAavT,EAAE,MAAM,MAAM,CAAChK,MAAM,CAACiP,KAAK5S,EAAE6a,IAAIf,WAAW9Z,EAAE8Z,WAAWjH,OAAO7S,EAAE6S,OAAOgI,IAAIrJ,OAAOxR,EAAEwR,OAAOqJ,IAAIiT,iBAAiB9tB,EAAE6S,OAAOiH,WAAWiU,iBAAiB/tB,EAAEwR,OAAOsI,WAAWoH,WAAWlhB,EAAEkhB,YAAYqK,MAAK,MAAO,SAASkD,GAAG1hB,EAAE/M,EAAEgN,EAAEW,EAAE4B,EAAEF,GAAG,IAAIhP,EAAEuN,EAAE5N,EAAE4tB,GAAGD,GAAG,GAAG,eAAe3gB,EAAE,CAAC,GAAG,QAAQW,IAAItN,EAAEuN,EAAEb,EAAEwC,EAAEud,GAAGzd,GAAGtC,GAAG1M,GAAG,OAAOA,EAAE,GAAG,OAAOsN,IAAItN,EAAEuN,EAAEb,EAAEwC,EAAEsZ,IAAIxZ,EAAE1B,OAAE,EAAO4B,EAAEsL,KAAK9N,GAAG1M,GAAG,OAAOA,EAAE,GAAG,aAAa2M,IAAI3M,EAAEuN,EAAEb,EAAEwC,EAAE2R,WAAW7R,GAAGtC,GAAG1M,GAAG,OAAOA,EAAE,SAASquB,GAAG3hB,EAAE/M,EAAEgN,EAAEW,GAAG,IAAI4B,EAAE,GAAG,OAAOkf,IAAG,EAAG1hB,EAAE/M,EAAEgN,EAAEW,GAAE,SAAUZ,GAAGwC,EAAErS,KAAK6P,MAAMwC,EAAE,SAASof,GAAG5hB,EAAE/M,EAAEgN,GAAG,IAAIW,EAAEF,EAAE+d,QAAQ,MAAM,eAAeze,IAAI,QAAQ/M,QAAG,IAASgN,EAAE8f,KAAKnf,EAAE6f,GAAG7f,EAAEkgB,GAAG7gB,EAAE8f,MAAM,OAAO9sB,QAAG,IAASgN,EAAE6b,MAAMlb,EAAE6f,GAAG7f,EAAEkgB,GAAG7gB,EAAE6b,IAAI7oB,OAAE,EAAOgN,EAAE6N,QAAQ,aAAa9N,QAAG,IAASC,EAAEkU,aAAavT,EAAE6f,GAAG7f,EAAEkgB,GAAG7gB,EAAEkU,cAAcvT,EAAE,SAASihB,GAAG7hB,EAAE/M,EAAEgN,EAAEW,EAAE4B,EAAEF,EAAEhP,GAAG,IAAIuN,EAAEoF,EAAEhG,EAAEihB,GAAGD,GAAG,GAAG,eAAehuB,EAAE,CAAC,QAAG,IAASuP,EAAEud,IAAI,QAAQnf,IAAIC,EAAEoF,EAAEjG,EAAEwC,EAAEud,GAAGzd,EAAEhP,GAAG0M,GAAGa,GAAG,OAAOA,EAAE,QAAG,IAAS2B,EAAEsZ,KAAK,OAAOlb,IAAIA,GAAG4B,EAAEsL,MAAMxL,KAAKzB,EAAEoF,EAAEjG,EAAEwC,EAAEsZ,IAAIxZ,EAAEhP,GAAG0M,GAAGa,GAAG,OAAOA,EAAE,GAAG,aAAa5N,QAAG,IAASuP,EAAE2R,aAAatT,EAAEoF,EAAEjG,EAAEwC,EAAE2R,WAAW7R,EAAEhP,GAAG0M,GAAGa,GAAG,OAAOA,EAAE,SAASihB,GAAG9hB,EAAE/M,EAAEgN,EAAEW,EAAE4B,GAAG,IAAIF,EAAE,GAAG,OAAOuf,IAAG,EAAG7hB,EAAE/M,EAAEgN,EAAEW,EAAE4B,GAAE,SAAUxC,GAAGsC,EAAEnS,KAAK6P,MAAMsC,EAAE,SAASyf,GAAG/hB,EAAE/M,EAAEgN,EAAEW,GAAG,IAAI4B,EAAE9B,EAAE+d,QAAQ,MAAM,eAAeze,SAAI,IAASC,EAAE8f,IAAI,QAAQ9sB,GAAG2N,KAAKX,EAAE8f,KAAKvd,EAAEie,GAAGje,EAAE2e,GAAGlhB,EAAE8f,GAAGnf,UAAK,IAASX,EAAE6b,KAAK,OAAO7oB,GAAG2N,KAAKX,EAAE6b,MAAM7oB,GAAGgN,EAAE6N,MAAMlN,KAAK4B,EAAEie,GAAGje,EAAE2e,GAAGlhB,EAAE6b,IAAIlb,MAAM,aAAaZ,QAAG,IAASC,EAAEkU,YAAYvT,KAAKX,EAAEkU,aAAa3R,EAAEie,GAAGje,EAAE2e,GAAGlhB,EAAEkU,WAAWvT,KAAK4B,EAAE,IAAIwf,GAAG,CAAC,CAACvzB,KAAK,YAAYiZ,KAAK,SAAS,CAACjZ,KAAK,cAAciZ,KAAK,WAAWiZ,UAAU,MAAM,CAAClyB,KAAK,eAAeiZ,KAAK,WAAWiZ,UAAU,OAAO,CAAClyB,KAAK,mBAAmBiZ,KAAK,QAAQiZ,UAAU,MAAM,CAAClyB,KAAK,oBAAoBiZ,KAAK,QAAQiZ,UAAU,OAAO,CAAClyB,KAAK,oBAAoBiZ,KAAK,YAAY,CAACjZ,KAAK,sBAAsBiZ,KAAK,eAAe,SAASua,KAAK9rB,KAAK9C,EAAE,KAAK8C,KAAKkY,EAAE,KAAK,SAAS6T,GAAGliB,EAAE/M,EAAEgN,EAAEW,EAAE4B,GAAG,IAAI,IAAIF,KAAK1B,EAAE,CAAC,IAAItN,EAAEsN,EAAE0B,GAAGzB,EAAEvN,EAAEwS,OAAOG,EAAE3S,EAAEmR,OAAOnY,EAAEuU,IAAIZ,EAAEgG,EAAEpF,EAAE,IAAI5N,IAAIA,EAAE2hB,IAAItoB,EAAEwhB,KAAK,CAAC,IAAIja,EAAE2O,EAAElW,EAAEwhB,IAAIxhB,EAAEygB,YAAY,GAAG/M,GAAGnM,EAAE,OAAOvH,EAAEwhB,MAAM,SAASqU,GAAGniB,EAAE/M,EAAEgN,EAAEW,EAAE4B,GAAG,GAAG,UAAUvP,EAAE,CAAC,GAAG,eAAeA,EAAE,OAAOivB,GAAGliB,EAAE,KAAKY,EAAEA,EAAEuT,WAAW3R,GAAG,GAAG,iBAAiBvC,EAAE,OAAOiiB,GAAGliB,EAAE,KAAKY,EAAEA,EAAEX,GAAGuC,GAAG,IAAIF,EAAEhP,EAAE,IAAI2uB,GAAG,GAAG,eAAehvB,EAAE,CAAC,GAAG,QAAQgN,EAAE,CAAC,GAAGqC,EAAE4f,GAAGliB,EAAE,KAAKY,EAAEA,EAAEmf,GAAGvd,GAAGxC,GAAGsC,EAAE,OAAOA,EAAEhP,EAAE8uB,KAAKxhB,EAAEmf,IAAI,GAAG,OAAO9f,EAAE,CAAC,GAAGqC,EAAE4f,GAAGliB,EAAE1M,EAAEsN,EAAEA,EAAEkb,IAAItZ,GAAGxC,GAAGsC,EAAE,OAAOA,EAAEhP,EAAE8uB,KAAKxhB,EAAEkb,MAAM,GAAG,aAAa7oB,IAAIqP,EAAE4f,GAAGliB,EAAE1M,EAAEsN,EAAEA,EAAEuT,WAAW3R,GAAGxC,GAAGsC,GAAG,OAAOA,EAAE,SAAS+f,GAAGriB,EAAE/M,EAAEgN,GAAG,IAAIW,EAAEV,OAAOC,KAAKF,GAAGuC,EAAE5B,EAAE3Q,OAAOqS,EAAE,EAAE,OAAO,IAAI5B,GAAE,WAAY,IAAIpN,EAAE,KAAK,EAAE,CAAC,GAAGgP,GAAGE,EAAE,OAAOxC,GAAGA,EAAEoiB,KAAKniB,GAAG,CAACue,MAAK,GAAI,IAAI3d,EAAEZ,EAAEW,EAAE0B,MAAM2D,EAAEpF,EAAEiF,OAAOxZ,EAAEuU,EAAE4D,OAAOnR,EAAE2S,IAAIhT,EAAE3G,EAAE2Z,EAAEjG,GAAGA,EAAE4U,IAAIthB,EAAEwa,OAAOxa,EAAE,YAAY,OAAOA,GAAG,MAAM,CAACkrB,MAAK,EAAG5nB,MAAM,CAAC6gB,SAASnkB,EAAEwa,IAAIf,WAAWzZ,EAAEyZ,gBAA0oC,SAASuV,GAAGtiB,EAAE/M,EAAEgN,EAAEW,EAAE4B,GAAG,IAAI,IAAIF,EAAEhP,EAAEuN,EAAEoF,EAAE3Z,EAAEuH,EAAEJ,EAAEmM,EAAEgB,EAAEib,OAAOjY,SAASjE,EAAEiB,EAAE8G,MAAK,KAAMpF,EAAE1C,EAAE6N,QAAQ+Q,MAAM,CAAC,IAAI1d,GAAE,EAAG,GAAGxN,EAAEgP,EAAE1L,MAAM,eAAe+I,EAAE,IAAIkB,KAAKoF,EAAE3S,EAAEwoB,IAAI,CAACxvB,EAAE2Z,EAAEpF,GAAG,EAAE,CAAC,GAAGhN,EAAEvH,EAAEmY,OAAO3D,GAAE,EAAGrN,EAAE+O,EAAElP,EAAEwa,IAAIja,EAAEia,IAAIxa,EAAEyZ,WAAWlZ,EAAEkZ,WAAWzgB,EAAEwhB,IAAIxhB,EAAEygB,WAAWzgB,EAAE6nB,YAAYnU,GAAGvM,EAAE,OAAOnH,EAAEA,EAAEA,EAAEmhB,WAAWnhB,GAAG,GAAG,aAAaqT,EAAE,IAAIkB,KAAKoF,EAAE3S,EAAE6gB,WAAW,KAAKlhB,GAAGK,EAAEwa,IAAIjN,GAAG,CAACvU,EAAE2Z,EAAEpF,GAAG,EAAE,CAAC,IAAIhN,EAAEvH,EAAEmY,QAAQqJ,MAAMjN,IAAIhN,EAAEvH,EAAEwZ,QAAQhF,GAAE,EAAGrN,EAAE+O,EAAElP,EAAEwa,IAAIja,EAAEia,IAAIxa,EAAEyZ,WAAWlZ,EAAEkZ,WAAWzgB,EAAEwhB,IAAIxhB,EAAEygB,WAAWzgB,EAAE6nB,YAAYnU,GAAGvM,EAAE,OAAOnH,EAAEA,EAAEA,EAAEmhB,WAAWnhB,GAAG,GAAG2T,IAAIa,IAAIrN,EAAE+O,EAAElP,EAAEwa,IAAI,KAAKxa,EAAEyZ,WAAW,KAAK,KAAK,KAAK,MAAM/M,GAAGvM,GAAG,OAAO,MAAM,SAAS8uB,GAAGviB,GAAG,IAAInM,EAAEmM,GAAG,MAAM,IAAIqO,EAAE,qHAAqH,KAAK,QAAQrO,GAAG,MAAM,IAAIqO,EAAE,qDAAqD,GAAG,eAAerO,KAAKnM,EAAEmM,EAAE+M,aAAa,OAAO/M,EAAE+M,YAAY,MAAM,IAAIsB,EAAE,2FAA2F,SAASmU,GAAGxiB,GAAG,IAAInM,EAAEmM,GAAG,MAAM,IAAIqO,EAAE,mIAAmI,KAAK,WAAWrO,GAAG,MAAM,IAAIqO,EAAE,wDAAwD,KAAK,WAAWrO,GAAG,MAAM,IAAIqO,EAAE,wDAAwD,GAAG,eAAerO,KAAKnM,EAAEmM,EAAE+M,aAAa,OAAO/M,EAAE+M,YAAY,MAAM,IAAIsB,EAAE,2FAA2F,GAAG,eAAerO,GAAG,kBAAkBA,EAAEmU,WAAW,MAAM,IAAI9F,EAAE,8FAA8F4T,GAAGrd,UAAUwd,KAAK,SAASpiB,GAAG,OAAO7J,KAAK9C,EAAE8C,KAAK9C,EAAE2M,EAAE,OAAO7J,KAAKkY,IAAIlY,KAAKkY,EAAErO,IAAIiiB,GAAGrd,UAAUgQ,IAAI,SAAS5U,GAAG,OAAO,OAAO7J,KAAK9C,GAAG2M,KAAK7J,KAAK9C,GAAG,OAAO8C,KAAKkY,GAAGrO,KAAK7J,KAAKkY,GAAG,IAAIoU,GAAGC,IAAID,GAAG,IAAItmB,KAAK6C,MAAM,IAAI7C,KAAKgR,UAAU,WAAW,OAAOsV,OAAOE,GAAG,IAAIhO,IAAI,CAAC,WAAW,aAAa,UAAUiO,GAAG,IAAIjO,IAAI,CAAC,SAAS,UAAU,eAAe,kBAAkBkO,GAAG,CAACC,gBAAe,EAAGpP,OAAM,EAAGhM,KAAK,SAAS,SAASqb,GAAG/iB,EAAE/M,EAAEgN,GAAG,IAAIW,EAAE,IAAIZ,EAAEgjB,cAAc/vB,EAAEgN,GAAG,OAAOD,EAAE6b,OAAOL,IAAIvoB,EAAE2N,GAAGZ,EAAE8c,KAAK,YAAY,CAAChP,IAAI7a,EAAE8Z,WAAW9M,IAAIW,EAAE,SAASqiB,GAAGjjB,EAAE/M,EAAEgN,EAAEW,EAAE4B,EAAEF,EAAEhP,EAAEuN,GAAG,IAAID,GAAG,eAAeZ,EAAE0H,KAAK,MAAM,IAAI4X,EAAE,SAASpvB,OAAO+C,EAAE,+GAA+G,GAAG2N,GAAG,aAAaZ,EAAE0H,KAAK,MAAM,IAAI4X,EAAE,SAASpvB,OAAO+C,EAAE,6GAA6G,GAAG4N,IAAIhN,EAAEgN,GAAG,MAAM,IAAIwN,EAAE,SAASne,OAAO+C,EAAE,uDAAuD/C,OAAO2Q,EAAE,MAAM,GAAGyB,EAAE,GAAGA,EAAEhP,EAAE,GAAGA,EAAEuN,EAAEA,GAAG,IAAIb,EAAE8iB,gBAAgBxgB,IAAIhP,EAAE,MAAM,IAAIgsB,EAAE,SAASpvB,OAAO+C,EAAE,qCAAqC/C,OAAOoS,EAAE,uGAAuG,IAAI2D,EAAEjG,EAAE6b,OAAOhf,IAAIyF,GAAGhW,EAAE0T,EAAE6b,OAAOhf,IAAIvJ,GAAG,IAAI2S,EAAE,MAAM,IAAIoZ,EAAE,SAASnvB,OAAO+C,EAAE,mBAAmB/C,OAAOoS,EAAE,iBAAiB,IAAIhW,EAAE,MAAM,IAAI+yB,EAAE,SAASnvB,OAAO+C,EAAE,mBAAmB/C,OAAOoD,EAAE,iBAAiB,IAAIG,EAAE,CAACqa,IAAI,KAAKqG,WAAWvT,EAAEkF,OAAOxD,EAAEmC,OAAOnR,EAAEyZ,WAAWlM,GAAG,GAAGZ,EAAEuC,EAAExC,EAAEkjB,yBAAyB,GAAG1gB,EAAE,GAAGA,EAAExC,EAAEyf,OAAO7K,IAAIpS,GAAG,MAAM,IAAI8c,EAAE,SAASpvB,OAAO+C,EAAE,WAAW/C,OAAOsS,EAAE,wCAAwC,IAAIxC,EAAE0T,QAAQ9S,OAAE,IAASqF,EAAEkO,WAAW7gB,QAAG,IAAS2S,EAAE6V,IAAIxoB,IAAI,MAAM,IAAIgsB,EAAE,SAASpvB,OAAO+C,EAAE,uBAAuB/C,OAAOoS,EAAE,UAAUpS,OAAOoD,EAAE,kJAAkJ,IAAIsM,EAAE,IAAI4f,EAAE5e,EAAE4B,EAAEyD,EAAE3Z,EAAEuU,GAAGb,EAAEyf,OAAOjE,IAAIhZ,EAAE5C,GAAG,IAAID,EAAE2C,IAAIhP,EAAE,OAAOsN,GAAGqF,EAAE2Z,mBAAmBtzB,EAAEszB,mBAAmBjgB,IAAIsG,EAAE4Z,kBAAkB7f,EAAEmjB,8BAA8Bld,EAAE0Z,YAAYrzB,EAAEozB,WAAW/f,IAAIsG,EAAE6Z,gBAAgB9f,EAAEojB,2BAA2BpjB,EAAE0T,MAAM9T,EAAEqgB,cAAcrgB,EAAEogB,SAASpf,EAAEZ,EAAEqjB,kBAAkBrjB,EAAEsjB,gBAAgB7vB,EAAEqa,IAAItL,EAAExC,EAAE8c,KAAK,YAAYrpB,GAAG+O,EAAE,SAAS+gB,GAAGvjB,EAAE/M,EAAEgN,EAAEW,EAAE4B,EAAEF,EAAEhP,EAAEuN,EAAEvU,GAAG,IAAIsU,GAAG,eAAeZ,EAAE0H,KAAK,MAAM,IAAI4X,EAAE,SAASpvB,OAAO+C,EAAE,uIAAuI,GAAG2N,GAAG,aAAaZ,EAAE0H,KAAK,MAAM,IAAI4X,EAAE,SAASpvB,OAAO+C,EAAE,qIAAqI,GAAG4N,EAAE,GAAGvU,GAAG,GAAG,mBAAmBuU,EAAE,MAAM,IAAIwN,EAAE,SAASne,OAAO+C,EAAE,8DAA8D/C,OAAO2Q,EAAE,WAAW,IAAIhN,EAAEgN,GAAG,MAAM,IAAIwN,EAAE,SAASne,OAAO+C,EAAE,uDAAuD/C,OAAO2Q,EAAE,MAAM,IAAIpN,EAAE,GAAG6O,EAAE,GAAGA,EAAEhP,EAAE,GAAGA,EAAEhH,IAAImH,EAAEoN,EAAEA,OAAE,IAASb,EAAE8iB,gBAAgBxgB,IAAIhP,EAAE,MAAM,IAAIgsB,EAAE,SAASpvB,OAAO+C,EAAE,qCAAqC/C,OAAOoS,EAAE,uGAAuG,IAAI1C,EAAED,EAAEmB,EAAEd,EAAE6b,OAAOhf,IAAIyF,GAAG2G,EAAEjJ,EAAE6b,OAAOhf,IAAIvJ,GAAG,IAAI2M,IAAIL,EAAEI,EAAEyf,OAAO5iB,IAAI2F,IAAI,CAAC,KAAK5C,EAAEkG,OAAOgI,MAAMxL,GAAG1C,EAAE6E,OAAOqJ,MAAMxa,GAAGsN,GAAGhB,EAAEkG,OAAOgI,MAAMxa,GAAGsM,EAAE6E,OAAOqJ,MAAMxL,GAAG,MAAM,IAAIgd,EAAE,SAASpvB,OAAO+C,EAAE,2DAA2D/C,OAAOsS,EAAE,iBAAiBtS,OAAOoS,EAAE,gBAAgBpS,OAAOoD,EAAE,mBAAmBpD,OAAO0P,EAAEkG,OAAOgI,IAAI,QAAQ5d,OAAO0P,EAAE6E,OAAOqJ,IAAI,QAAQnO,EAAEC,EAAE,GAAGD,GAAGK,EAAE0T,QAAQ5S,IAAInB,EAAEiB,EAAEE,EAAEqT,WAAW7gB,GAAGwN,EAAEgb,IAAIxoB,IAAIqM,EAAE,CAAC,IAAIgC,EAAE,CAAChC,EAAEmO,KAAI,GAAG,GAAG,GAAI,GAAGxhB,GAAGmH,GAAGoN,EAAE,OAAOc,EAAE,GAAGrV,EAAE,CAAC,IAAIkU,EAAEb,EAAEoN,WAAWpN,EAAEoN,WAAWtZ,EAAE+M,GAAGR,EAAE8c,KAAK,wBAAwB,CAACpV,KAAK,UAAUoG,IAAInO,EAAEmO,IAAIf,WAAWpN,EAAEoN,kBAAkB9G,EAAEtG,EAAEoN,WAAWlM,GAAGb,EAAE8c,KAAK,wBAAwB,CAACpV,KAAK,QAAQoG,IAAInO,EAAEmO,IAAIf,WAAWpN,EAAEoN,WAAWzB,KAAKzK,IAAI,OAAOc,EAAEd,EAAEA,GAAG,GAAGvU,GAAGmH,IAAIoN,EAAEpN,EAAEoN,IAAI,IAAIpB,EAAE,CAACqO,IAAI,KAAKqG,WAAWvT,EAAEkF,OAAOxD,EAAEmC,OAAOnR,EAAEyZ,WAAWlM,GAAG,GAAGZ,EAAEuC,EAAExC,EAAEkjB,yBAAyB,GAAG1gB,EAAE,GAAGA,EAAExC,EAAEyf,OAAO7K,IAAIpS,GAAG,MAAM,IAAI8c,EAAE,SAASpvB,OAAO+C,EAAE,WAAW/C,OAAOsS,EAAE,wCAAwC,IAAI1C,GAAE,EAAGnM,GAAE,EAAGmN,IAAIA,EAAEiiB,GAAG/iB,EAAEsC,EAAE,IAAIxC,GAAE,EAAGwC,IAAIhP,IAAI2V,EAAEnI,EAAEnN,GAAE,IAAKsV,IAAIA,EAAE8Z,GAAG/iB,EAAE1M,EAAE,IAAIK,GAAE,GAAIiM,EAAE,IAAI4f,EAAE5e,EAAE4B,EAAE1B,EAAEmI,EAAEpI,GAAGb,EAAEyf,OAAOjE,IAAIhZ,EAAE5C,GAAG,IAAIqD,EAAEX,IAAIhP,EAAE,OAAOsN,GAAGE,EAAE8e,mBAAmB3W,EAAE2W,mBAAmB3c,IAAInC,EAAE+e,kBAAkB7f,EAAEmjB,8BAA8BriB,EAAE6e,YAAY1W,EAAEyW,WAAWzc,IAAInC,EAAEgf,gBAAgB9f,EAAEojB,2BAA2BpjB,EAAE0T,MAAM9T,EAAEqgB,cAAcrgB,EAAEogB,SAASpf,EAAEZ,EAAEqjB,kBAAkBrjB,EAAEsjB,gBAAgB7jB,EAAEqO,IAAItL,EAAExC,EAAE8c,KAAK,YAAYrd,GAAG,CAAC+C,GAAE,EAAG1C,EAAEnM,GAAG,SAAS6vB,GAAGxjB,EAAE/M,GAAG+M,EAAEyf,OAAOgE,OAAOxwB,EAAE6a,KAAK,IAAI7N,EAAEhN,EAAE6S,OAAOlF,EAAE3N,EAAEwR,OAAOjC,EAAEvP,EAAE8Z,WAAWzK,EAAErP,EAAEkhB,WAAW7gB,EAAE2M,IAAIW,EAAE0B,GAAGrC,EAAE2f,mBAAmBhf,EAAEgf,mBAAmBtsB,IAAI2M,EAAE4f,kBAAkB7f,EAAEmjB,8BAA8BljB,EAAE0f,YAAY/e,EAAE8e,WAAWpsB,IAAI2M,EAAE6f,gBAAgB9f,EAAEojB,2BAA2BpjB,EAAE0T,MAAMzgB,EAAEktB,cAAcltB,EAAEitB,SAAS5d,EAAEtC,EAAEqjB,kBAAkBrjB,EAAEsjB,gBAAgBtjB,EAAE8c,KAAK,cAAc,CAAChP,IAAI7a,EAAE6a,IAAIf,WAAWvK,EAAEsD,OAAO7F,EAAE6N,IAAIrJ,OAAO7D,EAAEkN,IAAIqG,WAAW7R,IAAI,IAAIohB,GAAG,SAASzjB,GAAG,SAASW,EAAEZ,GAAG,IAAI/M,EAAE,GAAGA,EAAEgN,EAAE4E,KAAK1O,OAAOA,KAAK,kBAAkB6J,EAAEiG,EAAE,GAAG4c,GAAG7iB,IAAI0T,MAAM,MAAM,IAAIrF,EAAE,4EAA4Ene,OAAO8P,EAAE0T,MAAM,OAAO,IAAIiP,GAAG/N,IAAI5U,EAAE0H,MAAM,MAAM,IAAI2G,EAAE,6GAA6Gne,OAAO8P,EAAE0H,KAAK,OAAO,GAAG,kBAAkB1H,EAAE8iB,eAAe,MAAM,IAAIzU,EAAE,qFAAqFne,OAAO8P,EAAE8iB,eAAe,OAAO,IAAIliB,EAAE,UAAUZ,EAAE0H,KAAKvV,EAAE,aAAa6N,EAAE0H,KAAKuC,EAAEsV,EAAE3f,EAAEiB,EAAE5N,GAAG,gBAAgB2N,GAAG,IAAI4B,EAAE,QAAQkgB,KAAK,IAAIpgB,EAAE,EAAE,OAAO1C,EAAEiB,EAAE5N,GAAG,cAAc,IAAI2M,EAAEiB,EAAE5N,GAAG,SAAS,IAAIqmB,KAAK1Z,EAAEiB,EAAE5N,GAAG,SAAS,IAAIqmB,KAAK1Z,EAAEiB,EAAE5N,GAAG,gBAAgB,GAAG2M,EAAEiB,EAAE5N,GAAG,kBAAkB,GAAG2M,EAAEiB,EAAE5N,GAAG,yBAAyB,GAAG2M,EAAEiB,EAAE5N,GAAG,2BAA2B,GAAG2M,EAAEiB,EAAE5N,GAAG,qBAAoB,WAAY,IAAI+M,EAAE,GAAGA,EAAEwC,EAAEF,UAAUrP,EAAEwsB,OAAO7K,IAAI5U,IAAI,OAAOA,KAAKJ,EAAEiB,EAAE5N,GAAG,WAAW+M,GAAG4iB,GAAGxiB,SAAQ,SAAUJ,GAAG,OAAOJ,EAAEiB,EAAE5N,GAAG+M,EAAE/M,EAAE+M,OAAOL,EAAEkB,EAAE5N,GAAG,SAAQ,WAAY,OAAOA,EAAE4oB,OAAO1W,QAAQxF,EAAEkB,EAAE5N,GAAG,QAAO,WAAY,OAAOA,EAAEwsB,OAAOta,QAAQxF,EAAEkB,EAAE5N,GAAG,gBAAe,WAAY,OAAOA,EAAEqwB,iBAAiB3jB,EAAEkB,EAAE5N,GAAG,kBAAiB,WAAY,OAAOA,EAAEowB,mBAAmB1jB,EAAEkB,EAAE5N,GAAG,iBAAgB,WAAY,OAAOA,EAAEmwB,uBAAuBnwB,EAAEkwB,4BAA4BxjB,EAAEkB,EAAE5N,GAAG,yBAAwB,WAAY,OAAOA,EAAEmwB,0BAA0BzjB,EAAEkB,EAAE5N,GAAG,2BAA0B,WAAY,OAAOA,EAAEkwB,4BAA4BxjB,EAAEkB,EAAE5N,GAAG,QAAQA,EAAE0wB,SAASjQ,OAAO/T,EAAEkB,EAAE5N,GAAG,OAAOA,EAAE0wB,SAASjc,MAAM/H,EAAEkB,EAAE5N,GAAG,iBAAiBA,EAAE0wB,SAASb,gBAAgBnjB,EAAEkB,EAAE5N,GAAG,kBAAiB,WAAY,MAAM,gBAAgBA,EAAEA,EAAE2N,EAAEX,GAAG,IAAIuC,EAAE5B,EAAEgE,UAAU,OAAOpC,EAAEohB,uBAAuB,WAAWztB,KAAKmtB,cAAc,EAAEntB,KAAKktB,gBAAgB,EAAEltB,KAAKitB,uBAAuB,EAAEjtB,KAAKgtB,yBAAyB,GAAG3gB,EAAEsS,QAAQ,SAAS9U,GAAG,OAAO7J,KAAK0lB,OAAOjH,IAAI,GAAG5U,IAAIwC,EAAEqhB,gBAAgB,SAAS7jB,EAAE/M,GAAG,GAAG,eAAekD,KAAKuR,KAAK,OAAM,EAAG,GAAG,IAAI5C,UAAU7U,OAAO,CAAC,IAAIgQ,EAAE,GAAGD,EAAEY,EAAEzK,KAAKspB,OAAO5iB,IAAIoD,GAAG,QAAQW,IAAIA,EAAEuT,WAAW,GAAG,IAAIrP,UAAU7U,OAAO,CAAC+P,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAIuP,EAAErM,KAAK0lB,OAAOhf,IAAImD,GAAG,QAAQwC,GAAGA,EAAEsZ,IAAInK,eAAe1e,GAAG,MAAM,IAAIob,EAAE,yCAAyCne,OAAO4U,UAAU7U,OAAO,0HAA0HuS,EAAEshB,kBAAkB,SAAS9jB,EAAE/M,GAAG,GAAG,aAAakD,KAAKuR,KAAK,OAAM,EAAG,GAAG,IAAI5C,UAAU7U,OAAO,CAAC,IAAIgQ,EAAE,GAAGD,EAAEY,EAAEzK,KAAKspB,OAAO5iB,IAAIoD,GAAG,QAAQW,GAAGA,EAAEuT,WAAW,GAAG,IAAIrP,UAAU7U,OAAO,CAAC+P,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAIuP,EAAErM,KAAK0lB,OAAOhf,IAAImD,GAAG,QAAQwC,GAAGA,EAAE2R,WAAWxC,eAAe1e,GAAG,MAAM,IAAIob,EAAE,yCAAyCne,OAAO4U,UAAU7U,OAAO,0HAA0HuS,EAAEuhB,QAAQ,SAAS/jB,EAAE/M,GAAG,GAAG,IAAI6R,UAAU7U,OAAO,CAAC,IAAIgQ,EAAE,GAAGD,EAAE,OAAO7J,KAAKspB,OAAO7K,IAAI3U,GAAG,GAAG,IAAI6E,UAAU7U,OAAO,CAAC+P,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAI2N,EAAEzK,KAAK0lB,OAAOhf,IAAImD,GAAG,QAAQY,SAAI,IAASA,EAAEkb,KAAKlb,EAAEkb,IAAInK,eAAe1e,SAAI,IAAS2N,EAAEuT,YAAYvT,EAAEuT,WAAWxC,eAAe1e,IAAI,MAAM,IAAIob,EAAE,iCAAiCne,OAAO4U,UAAU7U,OAAO,0HAA0HuS,EAAEsT,aAAa,SAAS9V,EAAE/M,GAAG,GAAG,eAAekD,KAAKuR,KAAK,CAAC,GAAG1H,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAEkD,KAAKud,MAAM,MAAM,IAAI4L,EAAE,4JAA4J,IAAIrf,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAIC,EAAE,MAAM,IAAIof,EAAE,2CAA2CnvB,OAAO8P,EAAE,gCAAgC,IAAI7J,KAAK0lB,OAAOjH,IAAI3hB,GAAG,MAAM,IAAIosB,EAAE,2CAA2CnvB,OAAO+C,EAAE,gCAAgC,IAAI2N,EAAEX,EAAE6b,KAAK7b,EAAE6b,IAAI7oB,SAAI,EAAO,OAAO2N,EAAEA,EAAEkN,SAAI,IAAStL,EAAEqT,eAAe,SAAS7V,EAAE/M,GAAG,GAAG,aAAakD,KAAKuR,KAAK,CAAC,GAAG1H,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAEkD,KAAKud,MAAM,MAAM,IAAI4L,EAAE,gKAAgK,IAAIrf,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAIC,EAAE,MAAM,IAAIof,EAAE,6CAA6CnvB,OAAO8P,EAAE,gCAAgC,IAAI7J,KAAK0lB,OAAOjH,IAAI3hB,GAAG,MAAM,IAAIosB,EAAE,6CAA6CnvB,OAAO+C,EAAE,gCAAgC,IAAI2N,EAAEX,EAAEkU,YAAYlU,EAAEkU,WAAWlhB,SAAI,EAAO,OAAO2N,EAAEA,EAAEkN,SAAI,IAAStL,EAAEqD,KAAK,SAAS7F,EAAE/M,GAAG,GAAGkD,KAAKud,MAAM,MAAM,IAAI4L,EAAE,4IAA4Itf,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAIgN,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAIC,EAAE,MAAM,IAAIof,EAAE,mCAAmCnvB,OAAO8P,EAAE,gCAAgC,IAAI7J,KAAK0lB,OAAOjH,IAAI3hB,GAAG,MAAM,IAAIosB,EAAE,mCAAmCnvB,OAAO+C,EAAE,gCAAgC,IAAI2N,EAAEX,EAAE6b,KAAK7b,EAAE6b,IAAI7oB,IAAIgN,EAAEkU,YAAYlU,EAAEkU,WAAWlhB,SAAI,EAAO,GAAG2N,EAAE,OAAOA,EAAEkN,KAAKtL,EAAEwhB,qBAAqB,SAAShkB,EAAE/M,GAAG+M,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAIgN,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAIC,EAAE,MAAM,IAAIof,EAAE,mDAAmDnvB,OAAO8P,EAAE,yBAAyB,MAAM,eAAe7J,KAAKuR,OAAOzU,KAAKgN,EAAE8f,IAAI9sB,KAAKgN,EAAE6b,MAAMtZ,EAAEyhB,gBAAgB,SAASjkB,EAAE/M,GAAG+M,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAIgN,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAIC,EAAE,MAAM,IAAIof,EAAE,8CAA8CnvB,OAAO8P,EAAE,yBAAyB,MAAM,eAAe7J,KAAKuR,MAAMzU,KAAKgN,EAAE6b,KAAKtZ,EAAE0hB,eAAe,SAASlkB,EAAE/M,GAAG+M,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAIgN,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAIC,EAAE,MAAM,IAAIof,EAAE,6CAA6CnvB,OAAO8P,EAAE,yBAAyB,MAAM,eAAe7J,KAAKuR,MAAMzU,KAAKgN,EAAE8f,IAAIvd,EAAE2hB,uBAAuB,SAASnkB,EAAE/M,GAAG+M,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAIgN,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAIC,EAAE,MAAM,IAAIof,EAAE,qDAAqDnvB,OAAO8P,EAAE,yBAAyB,MAAM,aAAa7J,KAAKuR,MAAMzU,KAAKgN,EAAEkU,YAAY3R,EAAE4hB,aAAa,SAASpkB,EAAE/M,GAAG+M,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAIgN,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAIC,EAAE,MAAM,IAAIof,EAAE,2CAA2CnvB,OAAO8P,EAAE,yBAAyB,MAAM,eAAe7J,KAAKuR,OAAOzU,KAAKgN,EAAE8f,IAAI9sB,KAAKgN,EAAE6b,MAAM,aAAa3lB,KAAKuR,MAAMzU,KAAKgN,EAAEkU,YAAY3R,EAAE6hB,oBAAoB,SAASrkB,EAAE/M,GAAG+M,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAIgN,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAIC,EAAE,MAAM,IAAIof,EAAE,kDAAkDnvB,OAAO8P,EAAE,yBAAyB,MAAM,eAAe7J,KAAKuR,MAAMzU,KAAKgN,EAAE8f,IAAI,aAAa5pB,KAAKuR,MAAMzU,KAAKgN,EAAEkU,YAAY3R,EAAE8hB,qBAAqB,SAAStkB,EAAE/M,GAAG+M,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAIgN,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAIC,EAAE,MAAM,IAAIof,EAAE,mDAAmDnvB,OAAO8P,EAAE,yBAAyB,MAAM,eAAe7J,KAAKuR,MAAMzU,KAAKgN,EAAE6b,KAAK,aAAa3lB,KAAKuR,MAAMzU,KAAKgN,EAAEkU,YAAY3R,EAAEkd,SAAS,SAAS1f,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,uCAAuCnvB,OAAO8P,EAAE,yBAAyB,MAAM,eAAe7J,KAAKuR,KAAK,EAAEzU,EAAEysB,UAAUld,EAAEmd,UAAU,SAAS3f,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,wCAAwCnvB,OAAO8P,EAAE,yBAAyB,MAAM,eAAe7J,KAAKuR,KAAK,EAAEzU,EAAE0sB,WAAWnd,EAAE+hB,eAAe,SAASvkB,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,6CAA6CnvB,OAAO8P,EAAE,yBAAyB,MAAM,eAAe7J,KAAKuR,KAAK,EAAEzU,EAAEysB,SAASzsB,EAAE0sB,WAAWnd,EAAEod,iBAAiB,SAAS5f,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,+CAA+CnvB,OAAO8P,EAAE,yBAAyB,MAAM,aAAa7J,KAAKuR,KAAK,EAAEzU,EAAE2sB,kBAAkBpd,EAAEgiB,cAAc,SAASxkB,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,4CAA4CnvB,OAAO8P,EAAE,yBAAyB,IAAIC,EAAE,EAAE,MAAM,aAAa9J,KAAKuR,OAAOzH,GAAGhN,EAAE2sB,kBAAkB,eAAezpB,KAAKuR,OAAOzH,GAAGhN,EAAEysB,UAAUzf,GAAGuC,EAAEiiB,eAAe,SAASzkB,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,6CAA6CnvB,OAAO8P,EAAE,yBAAyB,IAAIC,EAAE,EAAE,MAAM,aAAa9J,KAAKuR,OAAOzH,GAAGhN,EAAE2sB,kBAAkB,eAAezpB,KAAKuR,OAAOzH,GAAGhN,EAAE0sB,WAAW1f,GAAGuC,EAAEkiB,OAAO,SAAS1kB,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,qCAAqCnvB,OAAO8P,EAAE,yBAAyB,IAAIC,EAAE,EAAE,MAAM,aAAa9J,KAAKuR,OAAOzH,GAAGhN,EAAE2sB,kBAAkB,eAAezpB,KAAKuR,OAAOzH,GAAGhN,EAAEysB,SAASzsB,EAAE0sB,WAAW1f,GAAGuC,EAAEmiB,yBAAyB,SAAS3kB,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,uDAAuDnvB,OAAO8P,EAAE,yBAAyB,MAAM,eAAe7J,KAAKuR,KAAK,EAAEzU,EAAEysB,SAASzsB,EAAE6sB,eAAetd,EAAEoiB,0BAA0B,SAAS5kB,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,wDAAwDnvB,OAAO8P,EAAE,yBAAyB,MAAM,eAAe7J,KAAKuR,KAAK,EAAEzU,EAAE0sB,UAAU1sB,EAAE6sB,eAAetd,EAAEqiB,+BAA+B,SAAS7kB,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,6DAA6DnvB,OAAO8P,EAAE,yBAAyB,MAAM,eAAe7J,KAAKuR,KAAK,EAAEzU,EAAEysB,SAASzsB,EAAE0sB,UAAU,EAAE1sB,EAAE6sB,eAAetd,EAAEsiB,iCAAiC,SAAS9kB,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,+DAA+DnvB,OAAO8P,EAAE,yBAAyB,MAAM,aAAa7J,KAAKuR,KAAK,EAAEzU,EAAE2sB,iBAAiB,EAAE3sB,EAAE4sB,iBAAiBrd,EAAEuiB,8BAA8B,SAAS/kB,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,4DAA4DnvB,OAAO8P,EAAE,yBAAyB,IAAIC,EAAE,EAAEW,EAAE,EAAE,MAAM,aAAazK,KAAKuR,OAAOzH,GAAGhN,EAAE2sB,iBAAiBhf,GAAG,EAAE3N,EAAE4sB,iBAAiB,eAAe1pB,KAAKuR,OAAOzH,GAAGhN,EAAEysB,SAAS9e,GAAG3N,EAAE6sB,eAAe7f,EAAEW,GAAG4B,EAAEwiB,+BAA+B,SAAShlB,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,6DAA6DnvB,OAAO8P,EAAE,yBAAyB,IAAIC,EAAE,EAAEW,EAAE,EAAE,MAAM,aAAazK,KAAKuR,OAAOzH,GAAGhN,EAAE2sB,iBAAiBhf,GAAG,EAAE3N,EAAE4sB,iBAAiB,eAAe1pB,KAAKuR,OAAOzH,GAAGhN,EAAE0sB,UAAU/e,GAAG3N,EAAE6sB,eAAe7f,EAAEW,GAAG4B,EAAEyiB,uBAAuB,SAASjlB,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,qDAAqDnvB,OAAO8P,EAAE,yBAAyB,IAAIC,EAAE,EAAEW,EAAE,EAAE,MAAM,aAAazK,KAAKuR,OAAOzH,GAAGhN,EAAE2sB,iBAAiBhf,GAAG,EAAE3N,EAAE4sB,iBAAiB,eAAe1pB,KAAKuR,OAAOzH,GAAGhN,EAAEysB,SAASzsB,EAAE0sB,UAAU/e,GAAG,EAAE3N,EAAE6sB,eAAe7f,EAAEW,GAAG4B,EAAEsD,OAAO,SAAS9F,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAKspB,OAAO5iB,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,qCAAqCnvB,OAAO8P,EAAE,yBAAyB,OAAO/M,EAAE6S,OAAOgI,KAAKtL,EAAEiC,OAAO,SAASzE,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAKspB,OAAO5iB,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,qCAAqCnvB,OAAO8P,EAAE,yBAAyB,OAAO/M,EAAEwR,OAAOqJ,KAAKtL,EAAE4X,YAAY,SAASpa,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAKspB,OAAO5iB,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,0CAA0CnvB,OAAO8P,EAAE,yBAAyB,MAAM,CAAC/M,EAAE6S,OAAOgI,IAAI7a,EAAEwR,OAAOqJ,MAAMtL,EAAE0iB,SAAS,SAASllB,EAAE/M,GAAG+M,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAIgN,EAAE9J,KAAKspB,OAAO5iB,IAAI5J,GAAG,IAAIgN,EAAE,MAAM,IAAIof,EAAE,uCAAuCnvB,OAAO+C,EAAE,yBAAyB,IAAI2N,EAAEX,EAAE6F,OAAOgI,IAAItL,EAAEvC,EAAEwE,OAAOqJ,IAAI,GAAG9N,IAAIY,EAAE,OAAO4B,EAAE,GAAGxC,IAAIwC,EAAE,OAAO5B,EAAE,MAAM,IAAIye,EAAE,wBAAwBnvB,OAAO8P,EAAE,mCAAmC9P,OAAO+C,EAAE,YAAY/C,OAAO0Q,EAAE,MAAM1Q,OAAOsS,EAAE,QAAQA,EAAE2iB,aAAa,SAASnlB,EAAE/M,GAAG+M,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAIgN,EAAE9J,KAAKspB,OAAO5iB,IAAImD,GAAG,IAAIC,EAAE,MAAM,IAAIof,EAAE,2CAA2CnvB,OAAO8P,EAAE,yBAAyB,OAAOC,EAAE6F,OAAOgI,MAAM7a,GAAGgN,EAAEwE,OAAOqJ,MAAM7a,GAAGuP,EAAE6X,aAAa,SAASra,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAKspB,OAAO5iB,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,2CAA2CnvB,OAAO8P,EAAE,yBAAyB,OAAO/M,EAAEkhB,YAAY3R,EAAE4iB,WAAW,SAASplB,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAKspB,OAAO5iB,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,yCAAyCnvB,OAAO8P,EAAE,yBAAyB,OAAO/M,EAAEkhB,YAAY3R,EAAE6iB,WAAW,SAASrlB,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAKspB,OAAO5iB,IAAImD,GAAG,IAAI/M,EAAE,MAAM,IAAIosB,EAAE,yCAAyCnvB,OAAO8P,EAAE,yBAAyB,OAAO/M,EAAE6S,SAAS7S,EAAEwR,QAAQjC,EAAEyW,QAAQ,SAASjZ,EAAE/M,GAAG,IAAIgN,EAAE,SAASD,EAAE/M,EAAEgN,GAAG,GAAGA,IAAIpM,EAAEoM,GAAG,MAAM,IAAIoO,EAAE,mEAAmEne,OAAO+P,EAAE,MAAM,GAAGhN,EAAE,GAAGA,EAAEgN,EAAEA,GAAG,GAAGD,EAAE6b,OAAOjH,IAAI3hB,GAAG,MAAM,IAAIqsB,EAAE,uBAAuBpvB,OAAO+C,EAAE,uCAAuC,IAAI2N,EAAE,IAAIZ,EAAEgjB,cAAc/vB,EAAEgN,GAAG,OAAOD,EAAE6b,OAAOL,IAAIvoB,EAAE2N,GAAGZ,EAAE8c,KAAK,YAAY,CAAChP,IAAI7a,EAAE8Z,WAAW9M,IAAIW,EAAhV,CAAmVzK,KAAK6J,EAAE/M,GAAG,OAAOgN,EAAE6N,KAAKtL,EAAE8iB,UAAU,SAAStlB,EAAE/M,GAAG,GAAGA,IAAIY,EAAEZ,GAAG,MAAM,IAAIob,EAAE,qEAAqEne,OAAO+C,EAAE,MAAM+M,EAAE,GAAGA,EAAE/M,EAAEA,GAAG,GAAG,IAAIgN,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,OAAOC,GAAGhN,IAAIgT,EAAEhG,EAAE8M,WAAW9Z,GAAGkD,KAAK2mB,KAAK,wBAAwB,CAACpV,KAAK,QAAQoG,IAAI9N,EAAE+M,WAAW9M,EAAE8M,WAAWzB,KAAKrY,KAAK,CAAC+M,GAAE,KAAMC,EAAE,IAAI9J,KAAK6sB,cAAchjB,EAAE/M,GAAGkD,KAAK0lB,OAAOL,IAAIxb,EAAEC,GAAG9J,KAAK2mB,KAAK,YAAY,CAAChP,IAAI9N,EAAE+M,WAAW9Z,IAAI,CAAC+M,GAAE,KAAMwC,EAAE+iB,WAAW,SAASvlB,EAAE/M,GAAG,GAAGA,GAAG,mBAAmBA,EAAE,MAAM,IAAIob,EAAE,6EAA6Ene,OAAO+C,EAAE,MAAM+M,EAAE,GAAGA,EAAE,IAAIC,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,GAAGC,EAAE,CAAC,GAAGhN,EAAE,CAAC,IAAI2N,EAAEX,EAAE8M,WAAW9M,EAAE8M,WAAW9Z,EAAE2N,GAAGzK,KAAK2mB,KAAK,wBAAwB,CAACpV,KAAK,UAAUoG,IAAI9N,EAAE+M,WAAW9M,EAAE8M,aAAa,MAAM,CAAC/M,GAAE,GAAI,IAAIwC,EAAEvP,EAAEA,EAAE,IAAI,GAAG,OAAOgN,EAAE,IAAI9J,KAAK6sB,cAAchjB,EAAEwC,GAAGrM,KAAK0lB,OAAOL,IAAIxb,EAAEC,GAAG9J,KAAK2mB,KAAK,YAAY,CAAChP,IAAI9N,EAAE+M,WAAWvK,IAAI,CAACxC,GAAE,IAAKwC,EAAE+X,SAAS,SAASva,GAAGA,EAAE,GAAGA,EAAE,IAAI/M,EAAEgN,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAIC,EAAE,MAAM,IAAIof,EAAE,uCAAuCnvB,OAAO8P,EAAE,yBAAyB,GAAG,eAAe7J,KAAKuR,KAAK,CAAC,IAAI,IAAI9G,KAAKX,EAAE6b,IAAI,CAAC7oB,EAAEgN,EAAE6b,IAAIlb,GAAG,GAAG4iB,GAAGrtB,KAAKlD,GAAGA,EAAEA,EAAEwa,WAAWxa,GAAG,IAAI,IAAIuP,KAAKvC,EAAE8f,GAAG,CAAC9sB,EAAEgN,EAAE8f,GAAGvd,GAAG,GAAGghB,GAAGrtB,KAAKlD,GAAGA,EAAEA,EAAEwa,WAAWxa,IAAI,GAAG,aAAakD,KAAKuR,KAAK,IAAI,IAAIpF,KAAKrC,EAAEkU,WAAW,CAAClhB,EAAEgN,EAAEkU,WAAW7R,GAAG,GAAGkhB,GAAGrtB,KAAKlD,GAAGA,EAAEA,EAAEwa,WAAWxa,GAAGkD,KAAK0lB,OAAO4H,OAAOzjB,GAAG7J,KAAK2mB,KAAK,cAAc,CAAChP,IAAI9N,EAAE+M,WAAW9M,EAAE8M,cAAcvK,EAAEgjB,SAAS,SAASxlB,GAAG,IAAI/M,EAAE,GAAG6R,UAAU7U,OAAO,EAAE,CAAC,IAAIgQ,EAAE,GAAG6E,UAAU,GAAGlE,EAAE,GAAGkE,UAAU,GAAG,KAAK7R,EAAE3G,EAAE6J,KAAK8J,EAAEW,EAAEzK,KAAKuR,OAAO,MAAM,IAAI2X,EAAE,uCAAuCnvB,OAAO+P,EAAE,UAAU/P,OAAO0Q,EAAE,8BAA8B,GAAGZ,EAAE,GAAGA,IAAI/M,EAAEkD,KAAKspB,OAAO5iB,IAAImD,IAAI,MAAM,IAAIqf,EAAE,uCAAuCnvB,OAAO8P,EAAE,yBAAyB,OAAOwjB,GAAGrtB,KAAKlD,GAAGkD,MAAMqM,EAAEijB,iBAAiB,SAASzlB,EAAE/M,GAAG,GAAG6R,UAAU7U,OAAO,EAAE,MAAM,IAAIqvB,EAAE,iLAAiL,GAAGnpB,KAAKud,MAAM,MAAM,IAAI4L,EAAE,sLAAsL,IAAIrf,EAAE3T,EAAE6J,KAAK6J,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,YAAY,IAAIgN,EAAE,MAAM,IAAIof,EAAE,6CAA6CnvB,OAAO8P,EAAE,UAAU9P,OAAO+C,EAAE,yBAAyB,OAAOuwB,GAAGrtB,KAAK8J,GAAG9J,MAAMqM,EAAEkjB,mBAAmB,SAAS1lB,EAAE/M,GAAG,GAAG6R,UAAU7U,OAAO,EAAE,MAAM,IAAIqvB,EAAE,2KAA2K,GAAGnpB,KAAKud,MAAM,MAAM,IAAI4L,EAAE,wLAAwL,IAAIrf,EAAE3T,EAAE6J,KAAK6J,EAAE/M,EAAE,cAAc,IAAIgN,EAAE,MAAM,IAAIof,EAAE,+CAA+CnvB,OAAO8P,EAAE,UAAU9P,OAAO+C,EAAE,yBAAyB,OAAOuwB,GAAGrtB,KAAK8J,GAAG9J,MAAMqM,EAAEV,MAAM,WAAW3L,KAAKspB,OAAO3d,QAAQ3L,KAAK0lB,OAAO/Z,QAAQ3L,KAAKytB,yBAAyBztB,KAAK2mB,KAAK,YAAYta,EAAEmjB,WAAW,WAAW,IAAI,IAAI3lB,EAAE/M,EAAEkD,KAAK0lB,OAAOjY,UAAS,KAAM5D,EAAE/M,EAAEwa,QAAQ+Q,MAAMxe,EAAEpJ,MAAMkL,QAAQ3L,KAAKspB,OAAO3d,QAAQ3L,KAAKytB,yBAAyBztB,KAAK2mB,KAAK,iBAAiBta,EAAEojB,aAAa,SAAS5lB,GAAG,OAAO7J,KAAK0vB,YAAY7lB,IAAIwC,EAAEsR,cAAc,WAAW,OAAO3d,KAAK0vB,aAAarjB,EAAEsjB,aAAa,SAAS9lB,GAAG,OAAO7J,KAAK0vB,YAAYlU,eAAe3R,IAAIwC,EAAEujB,aAAa,SAAS/lB,EAAE/M,GAAG,OAAOkD,KAAK0vB,YAAY7lB,GAAG/M,EAAEkD,KAAK2mB,KAAK,oBAAoB,CAACpV,KAAK,MAAMqF,WAAW5W,KAAK0vB,YAAYp3B,KAAKuR,IAAI7J,MAAMqM,EAAEwjB,gBAAgB,SAAShmB,EAAE/M,GAAG,GAAG,mBAAmBA,EAAE,MAAM,IAAIob,EAAE,wDAAwD,IAAIpO,EAAE9J,KAAK0vB,YAAY7lB,GAAG,OAAO7J,KAAK0vB,YAAY7lB,GAAG/M,EAAEgN,GAAG9J,KAAK2mB,KAAK,oBAAoB,CAACpV,KAAK,MAAMqF,WAAW5W,KAAK0vB,YAAYp3B,KAAKuR,IAAI7J,MAAMqM,EAAEyjB,gBAAgB,SAASjmB,GAAG,cAAc7J,KAAK0vB,YAAY7lB,GAAG7J,KAAK2mB,KAAK,oBAAoB,CAACpV,KAAK,SAASqF,WAAW5W,KAAK0vB,YAAYp3B,KAAKuR,IAAI7J,MAAMqM,EAAE0jB,kBAAkB,SAASlmB,GAAG,IAAInM,EAAEmM,GAAG,MAAM,IAAIqO,EAAE,wEAAwE,OAAOlY,KAAK0vB,YAAY7lB,EAAE7J,KAAK2mB,KAAK,oBAAoB,CAACpV,KAAK,UAAUqF,WAAW5W,KAAK0vB,cAAc1vB,MAAMqM,EAAEqR,gBAAgB,SAAS7T,GAAG,IAAInM,EAAEmM,GAAG,MAAM,IAAIqO,EAAE,sEAAsE,OAAOpI,EAAE9P,KAAK0vB,YAAY7lB,GAAG7J,KAAK2mB,KAAK,oBAAoB,CAACpV,KAAK,QAAQqF,WAAW5W,KAAK0vB,YAAYva,KAAKtL,IAAI7J,MAAMqM,EAAE2jB,iBAAiB,SAASnmB,GAAG,GAAG,mBAAmBA,EAAE,MAAM,IAAIqO,EAAE,+DAA+D,OAAOlY,KAAK0vB,YAAY7lB,EAAE7J,KAAK0vB,aAAa1vB,KAAK2mB,KAAK,oBAAoB,CAACpV,KAAK,SAASqF,WAAW5W,KAAK0vB,cAAc1vB,MAAMqM,EAAEiE,yBAAyB,SAASzG,EAAE/M,GAAG,GAAG,mBAAmB+M,EAAE,MAAM,IAAIqO,EAAE,kEAAkE,GAAGpb,IAAI6N,EAAE7N,GAAG,MAAM,IAAIob,EAAE,0HAA0H,IAAI,IAAIpO,EAAEW,EAAE4B,EAAErM,KAAK0lB,OAAOjY,UAAS,KAAM3D,EAAEuC,EAAEiL,QAAQ+Q,OAAO5d,EAAEX,EAAErJ,OAAOmW,WAAW/M,EAAEY,EAAEkN,IAAIlN,EAAEmM,YAAY5W,KAAK2mB,KAAK,4BAA4B,CAACsJ,MAAMnzB,GAAG,QAAQuP,EAAE6jB,yBAAyB,SAASrmB,EAAE/M,GAAG,GAAG,mBAAmB+M,EAAE,MAAM,IAAIqO,EAAE,kEAAkE,GAAGpb,IAAI6N,EAAE7N,GAAG,MAAM,IAAIob,EAAE,0HAA0H,IAAI,IAAIpO,EAAEW,EAAE4B,EAAEF,EAAEhP,EAAE6C,KAAKspB,OAAO7b,UAAS,KAAM3D,EAAE3M,EAAEma,QAAQ+Q,MAAMhc,GAAG5B,EAAEX,EAAErJ,OAAOkP,OAAOxD,EAAE1B,EAAE6D,OAAO7D,EAAEmM,WAAW/M,EAAEY,EAAEkN,IAAIlN,EAAEmM,WAAWvK,EAAEsL,IAAIxL,EAAEwL,IAAItL,EAAEuK,WAAWzK,EAAEyK,WAAWnM,EAAEuT,YAAYhe,KAAK2mB,KAAK,4BAA4B,CAACsJ,MAAMnzB,GAAG,QAAQuP,EAAE8jB,sBAAsB,SAAStmB,GAAG,GAAG,mBAAmBA,EAAE,MAAM,IAAIqO,EAAE,sDAAsDiU,IAAG,GAAG,GAAG,EAAGnsB,KAAK6J,IAAIwC,EAAE+jB,iCAAiC,SAASvmB,GAAG,GAAG,mBAAmBA,EAAE,MAAM,IAAIqO,EAAE,iEAAiEiU,IAAG,GAAG,GAAG,EAAGnsB,KAAK6J,IAAIwC,EAAEgkB,gCAAgC,SAASxmB,GAAG,GAAG,mBAAmBA,EAAE,MAAM,IAAIqO,EAAE,gEAAgEiU,IAAG,GAAG,GAAG,EAAGnsB,KAAK6J,IAAIwC,EAAEikB,2CAA2C,SAASzmB,GAAG,GAAG,mBAAmBA,EAAE,MAAM,IAAIqO,EAAE,2EAA2EiU,IAAG,GAAG,GAAG,EAAGnsB,KAAK6J,IAAIwC,EAAE6D,MAAM,WAAW,MAAM,mBAAmB1B,MAAM0c,KAAK1c,MAAM0c,KAAKlrB,KAAK0lB,OAAO1b,QAAQ+e,EAAE/oB,KAAK0lB,OAAO1b,OAAOhK,KAAK0lB,OAAO1W,OAAO3C,EAAE+C,YAAY,SAASvF,GAAG,GAAG,mBAAmBA,EAAE,MAAM,IAAIqO,EAAE,4CAA4C,IAAI,IAAIpb,EAAEgN,EAAEW,EAAEzK,KAAK0lB,OAAOjY,UAAS,KAAM3Q,EAAE2N,EAAE6M,QAAQ+Q,MAAMxe,GAAGC,EAAEhN,EAAE2D,OAAOkX,IAAI7N,EAAE8M,aAAavK,EAAEkkB,SAAS,SAAS1mB,GAAG,GAAG,mBAAmBA,EAAE,MAAM,IAAIqO,EAAE,yCAAyC,IAAI,IAAIpb,EAAEgN,EAAEW,EAAEzK,KAAK0lB,OAAOjY,UAAS,KAAM3Q,EAAE2N,EAAE6M,QAAQ+Q,MAAM,GAAGxe,GAAGC,EAAEhN,EAAE2D,OAAOkX,IAAI7N,EAAE8M,YAAY,OAAO9M,EAAE6N,KAAKtL,EAAEmkB,SAAS,SAAS3mB,GAAG,GAAG,mBAAmBA,EAAE,MAAM,IAAIqO,EAAE,wCAAwC,IAAI,IAAIpb,EAAEgN,EAAEW,EAAEzK,KAAK0lB,OAAOjY,SAASpB,EAAE,IAAImC,MAAMxO,KAAK0L,OAAOS,EAAE,GAAE,KAAMrP,EAAE2N,EAAE6M,QAAQ+Q,MAAMve,EAAEhN,EAAE2D,MAAM4L,EAAEF,KAAKtC,EAAEC,EAAE6N,IAAI7N,EAAE8M,YAAY,OAAOvK,GAAGA,EAAEokB,SAAS,SAAS5mB,GAAG,GAAG,mBAAmBA,EAAE,MAAM,IAAIqO,EAAE,yCAAyC,IAAI,IAAIpb,EAAEgN,EAAEW,EAAEzK,KAAK0lB,OAAOjY,UAAS,KAAM3Q,EAAE2N,EAAE6M,QAAQ+Q,MAAM,GAAGxe,GAAGC,EAAEhN,EAAE2D,OAAOkX,IAAI7N,EAAE8M,YAAY,OAAM,EAAG,OAAM,GAAIvK,EAAEqkB,UAAU,SAAS7mB,GAAG,GAAG,mBAAmBA,EAAE,MAAM,IAAIqO,EAAE,0CAA0C,IAAI,IAAIpb,EAAEgN,EAAEW,EAAEzK,KAAK0lB,OAAOjY,UAAS,KAAM3Q,EAAE2N,EAAE6M,QAAQ+Q,MAAM,IAAIxe,GAAGC,EAAEhN,EAAE2D,OAAOkX,IAAI7N,EAAE8M,YAAY,OAAM,EAAG,OAAM,GAAIvK,EAAEskB,YAAY,SAAS9mB,GAAG,GAAG,mBAAmBA,EAAE,MAAM,IAAIqO,EAAE,4CAA4C,IAAI,IAAIpb,EAAEgN,EAAEW,EAAEzK,KAAK0lB,OAAOjY,SAASpB,EAAE,IAAG,KAAMvP,EAAE2N,EAAE6M,QAAQ+Q,MAAMxe,GAAGC,EAAEhN,EAAE2D,OAAOkX,IAAI7N,EAAE8M,aAAavK,EAAErS,KAAK8P,EAAE6N,KAAK,OAAOtL,GAAGA,EAAEukB,YAAY,SAAS/mB,EAAE/M,GAAG,GAAG,mBAAmB+M,EAAE,MAAM,IAAIqO,EAAE,4CAA4C,GAAGvJ,UAAU7U,OAAO,EAAE,MAAM,IAAIoe,EAAE,qNAAqN,IAAI,IAAIpO,EAAEW,EAAE4B,EAAEvP,EAAEqP,EAAEnM,KAAK0lB,OAAOjY,UAAS,KAAM3D,EAAEqC,EAAEmL,QAAQ+Q,MAAMhc,EAAExC,EAAEwC,GAAG5B,EAAEX,EAAErJ,OAAOkX,IAAIlN,EAAEmM,YAAY,OAAOvK,GAAGA,EAAEwkB,YAAY,WAAW,IAAIhnB,EAAE7J,KAAK0lB,OAAOjY,SAAS,OAAO,IAAIlD,GAAE,WAAY,IAAIzN,EAAE+M,EAAEyN,OAAO,GAAGxa,EAAEurB,KAAK,OAAOvrB,EAAE,IAAIgN,EAAEhN,EAAE2D,MAAM,MAAM,CAACA,MAAM,CAAC4O,KAAKvF,EAAE6N,IAAIf,WAAW9M,EAAE8M,YAAYyR,MAAK,OAAQhc,EAAEykB,OAAO,WAAW,IAAIjnB,EAAE7J,KAAKlD,EAAE,IAAI0R,MAAMxO,KAAK0lB,OAAO1W,MAAMlF,EAAE,EAAE9J,KAAK0lB,OAAOzb,SAAQ,SAAUJ,EAAEY,GAAG3N,EAAEgN,KAAK,SAASD,EAAE/M,GAAG,IAAIgN,EAAE,CAAC6N,IAAI9N,GAAG,OAAOvM,EAAER,EAAE8Z,cAAc9M,EAAE8M,WAAW9G,EAAE,GAAGhT,EAAE8Z,aAAa9M,EAAtF,CAAyFW,EAAEZ,MAAM,IAAIY,EAAE,IAAI+D,MAAMxO,KAAKspB,OAAOta,MAAM,OAAOlF,EAAE,EAAE9J,KAAKspB,OAAOrf,SAAQ,SAAUnN,EAAEuP,GAAG5B,EAAEX,KAAK,SAASD,EAAE/M,EAAEgN,GAAG,IAAIW,EAAE,CAACkN,IAAI7a,EAAE6S,OAAO7F,EAAE6F,OAAOgI,IAAIrJ,OAAOxE,EAAEwE,OAAOqJ,KAAK,OAAOra,EAAEwM,EAAE8M,cAAcnM,EAAEmM,WAAW9G,EAAE,GAAGhG,EAAE8M,aAAa,UAAU/M,GAAGC,EAAEkU,aAAavT,EAAEuT,YAAW,GAAIvT,EAA7K,CAAgLZ,EAAE0H,KAAKlF,EAAEvP,MAAM,CAAC4V,QAAQ,CAACnB,KAAKvR,KAAKuR,KAAKgM,MAAMvd,KAAKud,MAAMoP,eAAe3sB,KAAK2sB,gBAAgB/V,WAAW5W,KAAK2d,gBAAgBzN,MAAMpT,EAAEqT,MAAM1F,IAAI4B,EAAET,OAAO,SAAS/B,GAAG,IAAI/M,EAAEgN,EAAEuC,EAAEF,EAAEhP,EAAEuN,EAAE1K,KAAK8P,EAAEnB,UAAU7U,OAAO,QAAG,IAAS6U,UAAU,IAAIA,UAAU,GAAG,GAAG9E,aAAaY,EAAE,OAAOZ,EAAEuF,aAAY,SAAUvF,EAAE/M,GAAGgT,EAAEpF,EAAEykB,UAAUtlB,EAAE/M,GAAG4N,EAAEoY,QAAQjZ,EAAE/M,MAAM+M,EAAE4F,aAAY,SAAU5F,EAAE/M,EAAEgN,EAAEW,EAAE4B,EAAEF,EAAEhP,GAAG2S,EAAE3S,EAAEuN,EAAEqmB,2BAA2BlnB,EAAEC,EAAEW,EAAE3N,GAAG4N,EAAEsmB,yBAAyBnnB,EAAEC,EAAEW,EAAE3N,GAAGK,EAAEuN,EAAEiY,yBAAyB9Y,EAAEC,EAAEW,EAAE3N,GAAG4N,EAAEmY,uBAAuBhZ,EAAEC,EAAEW,EAAE3N,MAAMkD,KAAK,IAAItC,EAAEmM,GAAG,MAAM,IAAIqO,EAAE,qGAAqG,GAAGrO,EAAE+M,WAAW,CAAC,IAAIlZ,EAAEmM,EAAE+M,YAAY,MAAM,IAAIsB,EAAE,+DAA+DpI,EAAE9P,KAAK0d,gBAAgB7T,EAAE+M,YAAY5W,KAAK+vB,kBAAkBlmB,EAAE+M,YAAY,GAAG/M,EAAEqG,MAAM,CAAC,GAAG7D,EAAExC,EAAEqG,OAAO1B,MAAMoN,QAAQvP,GAAG,MAAM,IAAI6L,EAAE,oDAAoD,IAAIpb,EAAE,EAAEgN,EAAEuC,EAAEvS,OAAOgD,EAAEgN,EAAEhN,IAAI,CAACsvB,GAAGjgB,EAAEE,EAAEvP,IAAI,IAAI3G,EAAEgW,EAAE7O,EAAEnH,EAAEwhB,IAAIlO,EAAEtT,EAAEygB,WAAW9G,EAAE9P,KAAKmvB,UAAU7xB,EAAEmM,GAAGzJ,KAAK8iB,QAAQxlB,EAAEmM,IAAI,GAAGI,EAAEsG,MAAM,CAAC,IAAI3G,GAAE,EAAG,GAAG,eAAexJ,KAAKuR,OAAO/H,GAAE,GAAI6C,EAAExC,EAAEsG,OAAO3B,MAAMoN,QAAQvP,GAAG,MAAM,IAAI6L,EAAE,oDAAoD,IAAIpb,EAAE,EAAEgN,EAAEuC,EAAEvS,OAAOgD,EAAEgN,EAAEhN,IAAI,CAACuvB,GAAGlvB,EAAEkP,EAAEvP,IAAI,IAAI6N,EAAExN,EAAE2V,EAAEnI,EAAEgF,OAAOnE,EAAEb,EAAE2D,OAAOjE,EAAEM,EAAEiM,WAAWtN,EAAEqB,EAAEqT,WAAWrU,OAAE,IAASL,EAAEE,EAAEF,EAAE,QAAQnM,GAAG2S,EAAEnG,EAAE3J,KAAK+wB,2BAA2B/wB,KAAKgxB,yBAAyBrnB,EAAE3J,KAAK2iB,yBAAyB3iB,KAAK6iB,wBAAwBnU,KAAK1O,KAAK7C,EAAEwa,IAAI7E,EAAEtH,EAAEnB,IAAIyF,EAAEnG,EAAE3J,KAAKixB,oBAAoBjxB,KAAKkxB,kBAAkBvnB,EAAE3J,KAAK0iB,kBAAkB1iB,KAAK4iB,iBAAiBlU,KAAK1O,KAAK8S,EAAEtH,EAAEnB,IAAI,OAAOrK,MAAMqM,EAAEoR,SAAS,SAAS5T,GAAG,IAAI/M,EAAE,IAAI2N,EAAEqF,EAAE,GAAG9P,KAAKwtB,SAAS3jB,IAAI,OAAO/M,EAAEizB,kBAAkBjgB,EAAE,GAAG9P,KAAK2d,kBAAkB7gB,GAAGuP,EAAE8R,UAAU,SAAStU,GAAG,IAAI/M,EAAEkD,KAAKyd,SAAS5T,GAAG,OAAO7J,KAAK0lB,OAAOzb,SAAQ,SAAUJ,EAAEC,GAAG,IAAIW,EAAEqF,EAAE,GAAGjG,EAAE+M,YAAY/M,EAAE,IAAI/M,EAAE+vB,cAAc/iB,EAAEW,GAAG3N,EAAE4oB,OAAOL,IAAIvb,EAAED,MAAM/M,GAAGuP,EAAE0S,KAAK,SAASlV,GAAG,GAAG,iBAAiBA,EAAEA,GAAG,IAAI0H,MAAM1H,EAAE0H,OAAOvR,KAAKuR,MAAM,UAAU1H,EAAE0H,KAAK,MAAM,IAAI4X,EAAE,wDAAwDpvB,OAAOiG,KAAKuR,KAAK,eAAexX,OAAO8P,EAAE0H,KAAK,0EAA0E,GAAG,kBAAkB1H,EAAE0T,OAAO1T,EAAE0T,QAAQvd,KAAKud,QAAO,IAAK1T,EAAE0T,MAAM,MAAM,IAAI4L,EAAE,mKAAmK,GAAG,kBAAkBtf,EAAE8iB,gBAAgB9iB,EAAE8iB,iBAAiB3sB,KAAK2sB,iBAAgB,IAAK9iB,EAAE8iB,eAAe,MAAM,IAAIxD,EAAE,4KAA4K,IAAI,IAAIrsB,EAAEgN,EAAEW,EAAEzK,KAAKme,UAAUtU,GAAGwC,EAAErM,KAAKspB,OAAO7b,UAAS,KAAM3Q,EAAEuP,EAAEiL,QAAQ+Q,MAAMyE,GAAGriB,EAAE,QAAO,GAAIX,EAAEhN,EAAE2D,OAAOud,WAAWlU,EAAE6N,IAAI7N,EAAE6F,OAAOgI,IAAI7N,EAAEwE,OAAOqJ,IAAI7H,EAAE,GAAGhG,EAAE8M,aAAa,OAAOnM,GAAG4B,EAAE8kB,OAAO,WAAW,OAAOnxB,KAAK8wB,UAAUzkB,EAAE8E,SAAS,WAAW,MAAM,kBAAkB9E,EAAE+kB,QAAQ,WAAW,IAAIt0B,EAAEkD,KAAK8J,EAAE,GAAG9J,KAAK0lB,OAAOzb,SAAQ,SAAUJ,EAAE/M,GAAGgN,EAAEhN,GAAG+M,EAAE+M,cAAc,IAAInM,EAAE,GAAG4B,EAAE,GAAGrM,KAAKspB,OAAOrf,SAAQ,SAAUJ,EAAEC,GAAG,IAAIqC,EAAEhP,EAAE0M,EAAEmU,WAAW,KAAK,KAAKtT,EAAE,GAAGoF,EAAEjG,EAAE8F,OAAOgI,IAAIxhB,EAAE0T,EAAEyE,OAAOqJ,IAAI9N,EAAEmU,YAAYlO,EAAE3Z,IAAIgW,EAAE2D,EAAEA,EAAE3Z,EAAEA,EAAEgW,GAAG,IAAIzO,EAAE,IAAI3D,OAAO+V,EAAE,KAAK/V,OAAOoD,EAAE,KAAKpD,OAAO5D,EAAE,KAAK2T,EAAEunB,WAAW,SAASv0B,EAAEygB,aAAQ,IAASlR,EAAE3O,GAAG2O,EAAE3O,GAAG,EAAE2O,EAAE3O,KAAKgN,GAAG,GAAG3Q,OAAOsS,EAAE3O,GAAG,OAAOgN,GAAG,IAAI3Q,OAAO+P,EAAE,OAAOW,EAAEC,GAAGhN,GAAGmM,EAAE+M,cAAc,IAAIzK,EAAE,GAAG,IAAI,IAAIhP,KAAK6C,KAAKA,KAAKwb,eAAere,KAAKsvB,GAAGhO,IAAIthB,IAAI,mBAAmB6C,KAAK7C,IAAI,WAAW0M,EAAE1M,KAAKgP,EAAEhP,GAAG6C,KAAK7C,IAAI,OAAOgP,EAAEyK,WAAW5W,KAAK0vB,YAAYvjB,EAAE+D,MAAMpG,EAAEqC,EAAEgE,MAAM1F,EAAEhB,EAAE0C,EAAE,cAAcnM,KAAKJ,aAAauM,GAAG1B,EAA5pwB,CAA+pwBe,EAAE3V,QAAQwwB,cAAc,oBAAoBhC,SAASkJ,GAAG9e,UAAU4V,OAAOiN,IAAI,+BAA+B/D,GAAG9e,UAAU2iB,SAAS,CAAC,CAAC94B,KAAK,SAASuR,GAAG,MAAM,GAAG9P,OAAO8P,EAAE,SAAS0nB,aAAY,GAAI,CAACj5B,KAAK,SAASuR,GAAG,MAAM,GAAG9P,OAAO8P,EAAE,iBAAiB0nB,aAAY,EAAGhgB,KAAK,YAAY,CAACjZ,KAAK,SAASuR,GAAG,MAAM,GAAG9P,OAAO8P,EAAE,mBAAmB0nB,aAAY,EAAGhgB,KAAK,cAAc,CAACjZ,KAAK,SAASuR,GAAG,MAAM,GAAG9P,OAAO8P,EAAE,iBAAiB,CAACvR,KAAK,SAASuR,GAAG,MAAM,GAAG9P,OAAO8P,EAAE,wBAAwB0H,KAAK,YAAY,CAACjZ,KAAK,SAASuR,GAAG,MAAM,GAAG9P,OAAO8P,EAAE,0BAA0B0H,KAAK,eAAetH,SAAQ,SAAUJ,GAAG,CAAC,MAAM,QAAQ,UAAUI,SAAQ,SAAUnN,GAAG,IAAIgN,EAAED,EAAEvR,KAAKwE,GAAG2N,EAAE,QAAQ3N,EAAEgwB,GAAGM,GAAGvjB,EAAE0nB,YAAYhE,GAAG9e,UAAU3E,GAAG,SAASuC,EAAEF,EAAEhP,GAAG,OAAOsN,EAAEzK,KAAK8J,GAAE,EAAG,gBAAgBD,EAAE0H,MAAMvR,KAAKuR,MAAM,KAAKlF,EAAEF,EAAEhP,EAAE,WAAWL,IAAIywB,GAAG9e,UAAU3E,GAAG,SAASuC,EAAEF,EAAEhP,EAAEuN,GAAG,OAAOD,EAAEzK,KAAK8J,GAAE,EAAG,gBAAgBD,EAAE0H,MAAMvR,KAAKuR,MAAMlF,EAAEF,EAAEhP,EAAEuN,EAAE,WAAW5N,UAAU,SAAS+M,GAAGogB,EAAEhgB,SAAQ,SAAUnN,GAAG,IAAIgN,EAAEhN,EAAExE,KAAKmS,EAAE3N,EAAEotB,SAASzf,EAAEZ,EAAEC,EAAE,QAAQ,GAAGW,EAAEZ,EAAEC,EAAE,UAAU,GAAGW,EAAEZ,EAAEC,EAAE,UAAU,GAAGW,EAAEZ,EAAEC,EAAE,YAAY,MAAtI,CAA6IyjB,IAAI,SAAS1jB,GAAGsgB,EAAElgB,SAAQ,SAAUnN,GAAG,IAAIgN,EAAEhN,EAAExE,KAAKmS,EAAE3N,EAAEotB,SAASzf,EAAEZ,EAAEC,EAAE,QAAQ,SAASW,EAAEZ,EAAEC,EAAE,gBAAgB,YAAYW,EAAEZ,EAAEC,EAAE,kBAAkB,iBAA9I,CAAgKyjB,IAAI,SAAS1jB,GAAG0gB,GAAGtgB,SAAQ,SAAUnN,IAAI,SAAS+M,EAAE/M,GAAG,IAAIgN,EAAEhN,EAAExE,KAAKmS,EAAE3N,EAAEyU,KAAKlF,EAAEvP,EAAE0tB,UAAU3gB,EAAE4E,UAAU3E,GAAG,SAASD,EAAE/M,GAAG,GAAG,UAAU2N,GAAG,UAAUzK,KAAKuR,MAAM9G,IAAIzK,KAAKuR,KAAK,MAAM,GAAG,IAAI5C,UAAU7U,OAAO,OAAOmxB,GAAGjrB,KAAKyK,GAAG,GAAG,IAAIkE,UAAU7U,OAAO,CAAC+P,EAAE,GAAGA,EAAE,IAAIsC,EAAEnM,KAAK0lB,OAAOhf,IAAImD,GAAG,QAAG,IAASsC,EAAE,MAAM,IAAI+c,EAAE,SAASnvB,OAAO+P,EAAE,0BAA0B/P,OAAO8P,EAAE,yBAAyB,OAAO2hB,GAAGxrB,KAAKud,MAAM,UAAU9S,EAAEzK,KAAKuR,KAAK9G,EAAE4B,EAAEF,GAAG,GAAG,IAAIwC,UAAU7U,OAAO,CAAC+P,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAIK,EAAE6C,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI1M,EAAE,MAAM,IAAI+rB,EAAE,SAASnvB,OAAO+P,EAAE,2BAA2B/P,OAAO8P,EAAE,gCAAgC,IAAI7J,KAAK0lB,OAAOjH,IAAI3hB,GAAG,MAAM,IAAIosB,EAAE,SAASnvB,OAAO+P,EAAE,2BAA2B/P,OAAO+C,EAAE,gCAAgC,OAAO6uB,GAAGlhB,EAAEzK,KAAKud,MAAMlR,EAAElP,EAAEL,GAAG,MAAM,IAAIob,EAAE,SAASne,OAAO+P,EAAE,sDAAsD/P,OAAO4U,UAAU7U,OAAO,QAAhzB,CAAyzB+P,EAAE/M,GAAG,SAAS+M,EAAE/M,GAAG,IAAIgN,EAAEhN,EAAExE,KAAKmS,EAAE3N,EAAEyU,KAAKlF,EAAEvP,EAAE0tB,UAAUre,EAAE,UAAUrC,EAAE,GAAG0nB,cAAc1nB,EAAEtO,MAAM,GAAG,GAAGqO,EAAE4E,UAAUtC,GAAG,SAAStC,EAAE/M,EAAEgN,GAAG,GAAG,UAAUW,GAAG,UAAUzK,KAAKuR,MAAM9G,IAAIzK,KAAKuR,KAAK,CAAC,GAAG,IAAI5C,UAAU7U,OAAO,OAAOuxB,IAAG,EAAGrrB,KAAKyK,EAAEX,EAAED,GAAG,GAAG,IAAI8E,UAAU7U,OAAO,CAAC+P,EAAE,GAAGA,EAAEC,EAAEhN,EAAE,IAAIK,EAAE6C,KAAK0lB,OAAOhf,IAAImD,GAAG,QAAG,IAAS1M,EAAE,MAAM,IAAI+rB,EAAE,SAASnvB,OAAOoS,EAAE,0BAA0BpS,OAAO8P,EAAE,yBAAyB,OAAO0hB,IAAG,EAAGvrB,KAAKud,MAAM,UAAU9S,EAAEzK,KAAKuR,KAAK9G,EAAE4B,EAAElP,EAAE2M,GAAG,GAAG,IAAI6E,UAAU7U,OAAO,CAAC+P,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAI4N,EAAE1K,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAIa,EAAE,MAAM,IAAIwe,EAAE,SAASnvB,OAAOoS,EAAE,2BAA2BpS,OAAO8P,EAAE,gCAAgC,IAAI7J,KAAK0lB,OAAOjH,IAAI3hB,GAAG,MAAM,IAAIosB,EAAE,SAASnvB,OAAOoS,EAAE,2BAA2BpS,OAAO+C,EAAE,gCAAgC,OAAO4uB,IAAG,EAAGjhB,EAAEzK,KAAKud,MAAMlR,EAAE3B,EAAE5N,EAAEgN,GAAG,MAAM,IAAIoO,EAAE,SAASne,OAAOoS,EAAE,sDAAsDpS,OAAO4U,UAAU7U,OAAO,SAAS,IAAIqD,EAAE,MAAM2M,EAAE,GAAG0nB,cAAc1nB,EAAEtO,MAAM,GAAGqO,EAAE4E,UAAUtR,GAAG,WAAW,IAAI0M,EAAE/M,EAAE0R,MAAMC,UAAUjT,MAAMkT,KAAKC,WAAW7E,EAAEhN,EAAEirB,MAAM,GAAG,IAAIjrB,EAAEhD,OAAO,CAAC,IAAIuS,EAAE,EAAE,aAAa5B,IAAI4B,GAAGrM,KAAKmrB,gBAAgB,eAAe1gB,IAAI4B,GAAGrM,KAAKorB,cAAcvhB,EAAE,IAAI2E,MAAMnC,GAAG,IAAIlP,EAAE,EAAEL,EAAE9C,MAAK,SAAU8C,EAAE2N,EAAE4B,EAAEF,EAAEzB,EAAEoF,EAAE3Z,GAAG0T,EAAE1M,KAAK2M,EAAEhN,EAAE2N,EAAE4B,EAAEF,EAAEzB,EAAEoF,EAAE3Z,WAAW0T,EAAE,GAAG/M,EAAE9C,MAAK,SAAU8C,EAAE2N,EAAE4B,EAAEF,EAAEhP,EAAEuN,EAAEoF,GAAGjG,EAAE7P,KAAK8P,EAAEhN,EAAE2N,EAAE4B,EAAEF,EAAEhP,EAAEuN,EAAEoF,OAAO,OAAO9P,KAAKmM,GAAG8Y,MAAMjlB,KAAKlD,GAAG+M,GAAG,IAAIa,EAAE,SAASZ,EAAE,GAAG0nB,cAAc1nB,EAAEtO,MAAM,GAAGqO,EAAE4E,UAAU/D,GAAG,WAAW,IAAIb,EAAE2E,MAAMC,UAAUjT,MAAMkT,KAAKC,WAAW7R,EAAE+M,EAAEke,MAAMje,EAAE,GAAG,OAAOD,EAAE7P,MAAK,SAAU6P,EAAEY,EAAE4B,EAAEF,EAAEhP,EAAEuN,EAAEoF,GAAGhT,EAAE+M,EAAEY,EAAE4B,EAAEF,EAAEhP,EAAEuN,EAAEoF,IAAIhG,EAAE9P,KAAK6P,MAAM7J,KAAKmM,GAAG8Y,MAAMjlB,KAAK6J,GAAGC,GAAG,IAAIgG,EAAE,SAAShG,EAAE,GAAG0nB,cAAc1nB,EAAEtO,MAAM,GAAGqO,EAAE4E,UAAUqB,GAAG,WAAW,IAAIjG,EAAE/M,EAAEgN,EAAE0E,MAAMC,UAAUjT,MAAMkT,KAAKC,WAAW,GAAG7E,EAAEhQ,OAAO,GAAGgQ,EAAEhQ,OAAO,EAAE,MAAM,IAAIoe,EAAE,SAASne,OAAO+V,EAAE,+DAA+D/V,OAAO+P,EAAEhQ,OAAO,OAAO,GAAG,mBAAmBgQ,EAAEA,EAAEhQ,OAAO,IAAI,mBAAmBgQ,EAAEA,EAAEhQ,OAAO,GAAG,MAAM,IAAIoe,EAAE,SAASne,OAAO+V,EAAE,qMAAqM,IAAIhG,EAAEhQ,QAAQ+P,EAAEC,EAAE,GAAGhN,EAAEgN,EAAE,GAAGA,EAAE,IAAI,IAAIA,EAAEhQ,QAAQ+P,EAAEC,EAAE,GAAGhN,EAAEgN,EAAE,GAAGA,EAAE,CAACA,EAAE,KAAK,IAAIA,EAAEhQ,SAAS+P,EAAEC,EAAE,GAAGhN,EAAEgN,EAAE,GAAGA,EAAE,CAACA,EAAE,GAAGA,EAAE,KAAK,IAAIW,EAAE3N,EAAE,OAAOgN,EAAE9P,MAAK,SAAU8C,EAAEgN,EAAEuC,EAAEF,EAAEhP,EAAEuN,EAAEoF,GAAGrF,EAAEZ,EAAEY,EAAE3N,EAAEgN,EAAEuC,EAAEF,EAAEhP,EAAEuN,EAAEoF,MAAM9P,KAAKmM,GAAG8Y,MAAMjlB,KAAK8J,GAAGW,GAAvvE,CAA2vEZ,EAAE/M,GAAG,SAAS+M,EAAE/M,GAAG,IAAIgN,EAAEhN,EAAExE,KAAKmS,EAAE3N,EAAEyU,KAAKlF,EAAEvP,EAAE0tB,UAAUre,EAAE,OAAOrC,EAAE,GAAG0nB,cAAc1nB,EAAEtO,MAAM,GAAG,GAAGqO,EAAE4E,UAAUtC,GAAG,SAAStC,EAAE/M,EAAEgN,GAAG,GAAG,UAAUW,GAAG,UAAUzK,KAAKuR,MAAM9G,IAAIzK,KAAKuR,KAAK,OAAM,EAAG,GAAG,IAAI5C,UAAU7U,OAAO,OAAOuxB,IAAG,EAAGrrB,KAAKyK,EAAEX,EAAED,GAAG,GAAG,IAAI8E,UAAU7U,OAAO,CAAC+P,EAAE,GAAGA,EAAEC,EAAEhN,EAAE,IAAIK,EAAE6C,KAAK0lB,OAAOhf,IAAImD,GAAG,QAAG,IAAS1M,EAAE,MAAM,IAAI+rB,EAAE,SAASnvB,OAAOoS,EAAE,0BAA0BpS,OAAO8P,EAAE,yBAAyB,OAAO0hB,IAAG,EAAGvrB,KAAKud,MAAM,UAAU9S,EAAEzK,KAAKuR,KAAK9G,EAAE4B,EAAElP,EAAE2M,GAAG,GAAG,IAAI6E,UAAU7U,OAAO,CAAC+P,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAI4N,EAAE1K,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAIa,EAAE,MAAM,IAAIwe,EAAE,SAASnvB,OAAOoS,EAAE,2BAA2BpS,OAAO8P,EAAE,gCAAgC,IAAI7J,KAAK0lB,OAAOjH,IAAI3hB,GAAG,MAAM,IAAIosB,EAAE,SAASnvB,OAAOoS,EAAE,2BAA2BpS,OAAO+C,EAAE,gCAAgC,OAAO4uB,IAAG,EAAGjhB,EAAEzK,KAAKud,MAAMlR,EAAE3B,EAAE5N,EAAEgN,GAAG,MAAM,IAAIoO,EAAE,SAASne,OAAOoS,EAAE,sDAAsDpS,OAAO4U,UAAU7U,OAAO,QAAQ,IAAIqD,EAAE,OAAO2M,EAAE,GAAG0nB,cAAc1nB,EAAEtO,MAAM,GAAG,GAAGqO,EAAE4E,UAAUtR,GAAG,WAAW,IAAI0M,EAAE2E,MAAMC,UAAUjT,MAAMkT,KAAKC,WAAW7R,EAAE+M,EAAEke,MAAM,OAAOle,EAAE7P,MAAK,SAAU6P,EAAEC,EAAEW,EAAE4B,EAAEF,EAAEhP,EAAEuN,GAAG,OAAO5N,EAAE+M,EAAEC,EAAEW,EAAE4B,EAAEF,EAAEhP,EAAEuN,QAAQ1K,KAAKmM,GAAG8Y,MAAMjlB,KAAK6J,IAAI,IAAIa,EAAE,QAAQZ,EAAE,GAAG0nB,cAAc1nB,EAAEtO,MAAM,GAAG,GAAGqO,EAAE4E,UAAU/D,GAAG,WAAW,IAAIb,EAAE2E,MAAMC,UAAUjT,MAAMkT,KAAKC,WAAW7R,EAAE+M,EAAEke,MAAM,OAAOle,EAAE7P,MAAK,SAAU6P,EAAEC,EAAEW,EAAE4B,EAAEF,EAAEhP,EAAEuN,GAAG,OAAO5N,EAAE+M,EAAEC,EAAEW,EAAE4B,EAAEF,EAAEhP,EAAEuN,OAAO1K,KAAKmM,GAAG8Y,MAAMjlB,KAAK6J,IAA1yC,CAA+yCA,EAAE/M,GAAG,SAAS+M,EAAE/M,GAAG,IAAIgN,EAAEhN,EAAExE,KAAKmS,EAAE3N,EAAEyU,KAAKlF,EAAEvP,EAAE0tB,UAAUre,EAAErC,EAAEtO,MAAM,GAAG,GAAG,UAAUqO,EAAE4E,UAAUtC,GAAG,SAAStC,EAAE/M,GAAG,GAAG,UAAU2N,GAAG,UAAUzK,KAAKuR,MAAM9G,IAAIzK,KAAKuR,KAAK,OAAOhH,EAAE+d,QAAQ,IAAI3Z,UAAU7U,OAAO,OAAOwxB,GAAGtrB,KAAKyK,GAAG,GAAG,IAAIkE,UAAU7U,OAAO,CAAC+P,EAAE,GAAGA,EAAE,IAAIC,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAIC,EAAE,MAAM,IAAIof,EAAE,SAASnvB,OAAOoS,EAAE,0BAA0BpS,OAAO8P,EAAE,yBAAyB,OAAO4hB,GAAGhhB,EAAE4B,EAAEvC,GAAG,GAAG,IAAI6E,UAAU7U,OAAO,CAAC+P,EAAE,GAAGA,EAAE/M,EAAE,GAAGA,EAAE,IAAIK,EAAE6C,KAAK0lB,OAAOhf,IAAImD,GAAG,IAAI1M,EAAE,MAAM,IAAI+rB,EAAE,SAASnvB,OAAOoS,EAAE,2BAA2BpS,OAAO8P,EAAE,gCAAgC,IAAI7J,KAAK0lB,OAAOjH,IAAI3hB,GAAG,MAAM,IAAIosB,EAAE,SAASnvB,OAAOoS,EAAE,2BAA2BpS,OAAO+C,EAAE,gCAAgC,OAAO8uB,GAAGnhB,EAAE4B,EAAElP,EAAEL,GAAG,MAAM,IAAIob,EAAE,SAASne,OAAOoS,EAAE,sDAAsDpS,OAAO4U,UAAU7U,OAAO,QAA9xB,CAAuyB+P,EAAE/M,MAAhsK,CAAusKywB,IAAI,SAAS1jB,GAAGgiB,GAAG5hB,SAAQ,SAAUnN,IAApusC,SAAY+M,EAAE/M,GAAG,IAAIgN,EAAEhN,EAAExE,KAAKmS,EAAE3N,EAAEyU,KAAKlF,EAAEvP,EAAE0tB,UAAU3gB,EAAE4E,UAAU3E,GAAG,SAASD,GAAG,GAAG,UAAUY,GAAG,UAAUzK,KAAKuR,MAAM9G,IAAIzK,KAAKuR,KAAK,MAAM,GAAG1H,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,QAAG,IAAS/M,EAAE,MAAM,IAAIosB,EAAE,SAASnvB,OAAO+P,EAAE,0BAA0B/P,OAAO8P,EAAE,yBAAyB,OAAO,SAASA,EAAE/M,EAAEgN,GAAG,GAAG,UAAUD,EAAE,CAAC,GAAG,eAAeA,EAAE,OAAOE,OAAOC,KAAKF,EAAEkU,YAAY,GAAG,iBAAiBlhB,EAAE,OAAOiN,OAAOC,KAAKF,EAAEhN,IAAI,IAAI2N,EAAE,GAAG,OAAOuhB,IAAG,EAAGniB,EAAE/M,EAAEgN,GAAE,SAAUD,GAAGY,EAAEzQ,KAAK6P,MAAMY,EAA1L,CAA6L,UAAUA,EAAEzK,KAAKuR,KAAK9G,EAAE4B,EAAEvP,KAAqvrCihB,CAAGlU,EAAE/M,GAAG,SAAS+M,EAAE/M,GAAG,IAAIgN,EAAEhN,EAAExE,KAAKmS,EAAE3N,EAAEyU,KAAKlF,EAAEvP,EAAE0tB,UAAUre,EAAE,UAAUrC,EAAE,GAAG0nB,cAAc1nB,EAAEtO,MAAM,GAAG,GAAGqO,EAAE4E,UAAUtC,GAAG,SAAStC,EAAE/M,GAAG,GAAG,UAAU2N,GAAG,UAAUzK,KAAKuR,MAAM9G,IAAIzK,KAAKuR,KAAK,CAAC1H,EAAE,GAAGA,EAAE,IAAIC,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,QAAG,IAASC,EAAE,MAAM,IAAIof,EAAE,SAASnvB,OAAOoS,EAAE,0BAA0BpS,OAAO8P,EAAE,yBAAyBmiB,IAAG,EAAG,UAAUvhB,EAAEzK,KAAKuR,KAAK9G,EAAE4B,EAAEvC,EAAEhN,KAAK,IAAIK,EAAE,MAAM2M,EAAE,GAAG0nB,cAAc1nB,EAAEtO,MAAM,GAAGqO,EAAE4E,UAAUtR,GAAG,SAAS0M,EAAE/M,GAAG,IAAIgN,EAAE,GAAG,OAAO9J,KAAKmM,GAAGtC,GAAE,SAAUA,EAAEY,GAAGX,EAAE9P,KAAK8C,EAAE+M,EAAEY,OAAOX,GAAG,IAAIY,EAAE,SAASZ,EAAE,GAAG0nB,cAAc1nB,EAAEtO,MAAM,GAAGqO,EAAE4E,UAAU/D,GAAG,SAASb,EAAE/M,GAAG,IAAIgN,EAAE,GAAG,OAAO9J,KAAKmM,GAAGtC,GAAE,SAAUA,EAAEY,GAAG3N,EAAE+M,EAAEY,IAAIX,EAAE9P,KAAK6P,MAAMC,GAAG,IAAIgG,EAAE,SAAShG,EAAE,GAAG0nB,cAAc1nB,EAAEtO,MAAM,GAAGqO,EAAE4E,UAAUqB,GAAG,SAASjG,EAAE/M,EAAEgN,GAAG,GAAG6E,UAAU7U,OAAO,EAAE,MAAM,IAAIoe,EAAE,SAASne,OAAO+V,EAAE,qMAAqM,IAAIrF,EAAEX,EAAE,OAAO9J,KAAKmM,GAAGtC,GAAE,SAAUA,EAAEC,GAAGW,EAAE3N,EAAE2N,EAAEZ,EAAEC,MAAMW,GAA1+B,CAA8+BZ,EAAE/M,GAAG,SAAS+M,EAAE/M,GAAG,IAAIgN,EAAEhN,EAAExE,KAAKmS,EAAE3N,EAAEyU,KAAKlF,EAAEvP,EAAE0tB,UAAUre,EAAErC,EAAE,GAAG0nB,cAAc1nB,EAAEtO,MAAM,GAAG,GAAG2B,EAAE,OAAOgP,EAAEtC,EAAE4E,UAAUtR,GAAG,SAAS0M,EAAE/M,GAAG,GAAG,UAAU2N,GAAG,UAAUzK,KAAKuR,MAAM9G,IAAIzK,KAAKuR,KAAK,CAAC1H,EAAE,GAAGA,EAAE,IAAIC,EAAE9J,KAAK0lB,OAAOhf,IAAImD,GAAG,QAAG,IAASC,EAAE,MAAM,IAAIof,EAAE,SAASnvB,OAAOoD,EAAE,0BAA0BpD,OAAO8P,EAAE,yBAAyB,OAAOmiB,IAAG,EAAG,UAAUvhB,EAAEzK,KAAKuR,KAAK9G,EAAE4B,EAAEvC,EAAEhN,KAAK,IAAI4N,EAAE,OAAOyB,EAAEtC,EAAE4E,UAAU/D,GAAG,SAASb,EAAE/M,GAAG,QAAQkD,KAAK7C,GAAG0M,EAAE/M,IAAI,IAAIgT,EAAE,QAAQ3D,EAAEtC,EAAE4E,UAAUqB,GAAG,SAASjG,EAAE/M,GAAG,OAAOkD,KAAK7C,GAAG0M,GAAE,SAAUA,EAAEC,GAAG,OAAOhN,EAAE+M,EAAEC,OAAjgB,CAAygBD,EAAE/M,GAAvvuC,SAAY+M,EAAE/M,GAAG,IAAIgN,EAAEhN,EAAExE,KAAKmS,EAAE3N,EAAEyU,KAAKlF,EAAEvP,EAAE0tB,UAAUre,EAAErC,EAAEtO,MAAM,GAAG,GAAG,UAAUqO,EAAE4E,UAAUtC,GAAG,SAAStC,GAAG,GAAG,UAAUY,GAAG,UAAUzK,KAAKuR,MAAM9G,IAAIzK,KAAKuR,KAAK,OAAOhH,EAAE+d,QAAQze,EAAE,GAAGA,EAAE,IAAI/M,EAAEkD,KAAK0lB,OAAOhf,IAAImD,GAAG,QAAG,IAAS/M,EAAE,MAAM,IAAIosB,EAAE,SAASnvB,OAAOoS,EAAE,0BAA0BpS,OAAO8P,EAAE,yBAAyB,OAAO,SAASA,EAAE/M,EAAEgN,GAAG,GAAG,UAAUD,EAAE,CAAC,GAAG,eAAeA,EAAE,OAAOqiB,GAAG,KAAKpiB,EAAEA,EAAEkU,YAAY,GAAG,iBAAiBlhB,EAAE,OAAOovB,GAAG,KAAKpiB,EAAEA,EAAEhN,IAAI,IAAI2N,EAAEF,EAAE+d,QAAQjc,EAAE,IAAIyf,GAAG,MAAM,eAAejiB,IAAI,QAAQ/M,IAAI2N,EAAE6f,GAAG7f,EAAEyhB,GAAG7f,EAAEvC,EAAEA,EAAE8f,MAAM,OAAO9sB,IAAI2N,EAAE6f,GAAG7f,EAAEyhB,GAAG7f,EAAEvC,EAAEA,EAAE6b,QAAQ,aAAa9b,IAAIY,EAAE6f,GAAG7f,EAAEyhB,GAAG7f,EAAEvC,EAAEA,EAAEkU,cAAcvT,EAAtS,CAAyS,UAAUA,EAAEzK,KAAKuR,KAAK9G,EAAE4B,EAAEvP,IAA0ntC20B,CAAG5nB,EAAE/M,MAAljD,CAAyjDywB,IAAI,IAAImE,GAAG,SAAS7nB,GAAG,SAASC,EAAEhN,GAAG,IAAIgN,EAAEgG,EAAE,CAACyB,KAAK,YAAYzU,GAAG,GAAG,UAAUgN,IAAG,IAAKA,EAAEyT,MAAM,MAAM,IAAIrF,EAAE,gGAAgG,GAAG,aAAapO,EAAEyH,KAAK,MAAM,IAAI2G,EAAE,qCAAqCpO,EAAEyH,KAAK,4BAA4B,OAAO1H,EAAE6E,KAAK1O,KAAK8J,IAAI9J,KAAK,OAAOlD,EAAEgN,EAAED,GAAGC,EAArV,CAAwVyjB,IAAIoE,GAAG,SAAS9nB,GAAG,SAASC,EAAEhN,GAAG,IAAIgN,EAAEgG,EAAE,CAACyB,KAAK,cAAczU,GAAG,GAAG,UAAUgN,IAAG,IAAKA,EAAEyT,MAAM,MAAM,IAAIrF,EAAE,kGAAkG,GAAG,eAAepO,EAAEyH,KAAK,MAAM,IAAI2G,EAAE,uCAAuCpO,EAAEyH,KAAK,4BAA4B,OAAO1H,EAAE6E,KAAK1O,KAAK8J,IAAI9J,KAAK,OAAOlD,EAAEgN,EAAED,GAAGC,EAA7V,CAAgWyjB,IAAIqE,GAAG,SAAS/nB,GAAG,SAASC,EAAEhN,GAAG,IAAIgN,EAAEgG,EAAE,CAACyN,OAAM,GAAIzgB,GAAG,GAAG,UAAUgN,IAAG,IAAKA,EAAEyT,MAAM,MAAM,IAAIrF,EAAE,8FAA8F,OAAOrO,EAAE6E,KAAK1O,KAAK8J,IAAI9J,KAAK,OAAOlD,EAAEgN,EAAED,GAAGC,EAAjO,CAAoOyjB,IAAIsE,GAAG,SAAShoB,GAAG,SAASC,EAAEhN,GAAG,IAAIgN,EAAEgG,EAAE,CAACyB,KAAK,WAAWgM,OAAM,GAAIzgB,GAAG,GAAG,UAAUgN,IAAG,IAAKA,EAAEyT,MAAM,MAAM,IAAIrF,EAAE,sGAAsG,GAAG,aAAapO,EAAEyH,KAAK,MAAM,IAAI2G,EAAE,0CAA0CpO,EAAEyH,KAAK,4BAA4B,OAAO1H,EAAE6E,KAAK1O,KAAK8J,IAAI9J,KAAK,OAAOlD,EAAEgN,EAAED,GAAGC,EAAzW,CAA4WyjB,IAAIuE,GAAG,SAASjoB,GAAG,SAASC,EAAEhN,GAAG,IAAIgN,EAAEgG,EAAE,CAACyB,KAAK,aAAagM,OAAM,GAAIzgB,GAAG,GAAG,UAAUgN,IAAG,IAAKA,EAAEyT,MAAM,MAAM,IAAIrF,EAAE,wGAAwG,GAAG,eAAepO,EAAEyH,KAAK,MAAM,IAAI2G,EAAE,4CAA4CpO,EAAEyH,KAAK,4BAA4B,OAAO1H,EAAE6E,KAAK1O,KAAK8J,IAAI9J,KAAK,OAAOlD,EAAEgN,EAAED,GAAGC,EAAjX,CAAoXyjB,IAAI,SAASwE,GAAGloB,GAAGA,EAAEqhB,KAAK,SAASpuB,EAAEgN,GAAG,IAAIW,EAAEqF,EAAE,GAAGhT,EAAE4V,QAAQ5I,GAAGuC,EAAE,IAAIxC,EAAEY,GAAG,OAAO4B,EAAET,OAAO9O,GAAGuP,GAAG,OAAO0lB,GAAGxE,IAAIwE,GAAGL,IAAIK,GAAGJ,IAAII,GAAGH,IAAIG,GAAGF,IAAIE,GAAGD,IAAIvE,GAAGyE,MAAMzE,GAAGA,GAAG0E,cAAcP,GAAGnE,GAAG2E,gBAAgBP,GAAGpE,GAAG4E,WAAWP,GAAGrE,GAAG6E,mBAAmBP,GAAGtE,GAAG8E,qBAAqBP,GAAGvE,GAAG+E,2BAA2Bpa,EAAEqV,GAAGgF,mBAAmBrJ,EAAEqE,GAAGiF,gBAAgBrJ,EAAEoE,GAA53wEzwB,oBCUnF,IAAI21B,EAAkB,sBASlBC,EAAS,aAGTC,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAeC,SAGfC,EAA8B,iBAAV,EAAAlgB,GAAsB,EAAAA,GAAU,EAAAA,EAAO/I,SAAWA,QAAU,EAAA+I,EAGhFmgB,EAA0B,iBAARje,MAAoBA,MAAQA,KAAKjL,SAAWA,QAAUiL,KAGxEpc,EAAOo6B,GAAcC,GAAY/N,SAAS,cAATA,GAUjCgO,EAPcnpB,OAAO0E,UAOQ0C,SAG7BgiB,EAAYntB,KAAKuO,IACjB6e,EAAYptB,KAAKsO,IAkBjB+e,EAAM,WACR,OAAOz6B,EAAKyqB,KAAKgQ,OA0QnB,SAASC,EAAS7yB,GAChB,IAAI8Q,SAAc9Q,EAClB,QAASA,IAAkB,UAAR8Q,GAA4B,YAARA,GA4EzC,SAASgiB,EAAS9yB,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAhCF,SAAkBA,GAChB,MAAuB,iBAATA,GAtBhB,SAAsBA,GACpB,QAASA,GAAyB,iBAATA,EAsBtB+yB,CAAa/yB,IAvXF,mBAuXYyyB,EAAexkB,KAAKjO,GA8B1CgzB,CAAShzB,GACX,OAzZM,IA2ZR,GAAI6yB,EAAS7yB,GAAQ,CACnB,IAAIhG,EAAgC,mBAAjBgG,EAAMukB,QAAwBvkB,EAAMukB,UAAYvkB,EACnEA,EAAQ6yB,EAAS74B,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAATgG,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQA,EAAM8C,QAAQmvB,EAAQ,IAC9B,IAAIgB,EAAWd,EAAW5vB,KAAKvC,GAC/B,OAAQizB,GAAYb,EAAU7vB,KAAKvC,GAC/BqyB,EAAaryB,EAAMjF,MAAM,GAAIk4B,EAAW,EAAI,GAC3Cf,EAAW3vB,KAAKvC,GAtab,KAsa6BA,EAGvC8M,EAAO1X,QA9IP,SAAkB89B,EAAMC,EAAMlhB,GAC5B,IAAImhB,GAAU,EACVC,GAAW,EAEf,GAAmB,mBAARH,EACT,MAAM,IAAIvO,UAAUqN,GAMtB,OAJIa,EAAS5gB,KACXmhB,EAAU,YAAanhB,IAAYA,EAAQmhB,QAAUA,EACrDC,EAAW,aAAcphB,IAAYA,EAAQohB,SAAWA,GA/K5D,SAAkBH,EAAMC,EAAMlhB,GAC5B,IAAIqhB,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAAiB,EACjBR,GAAU,EACVS,GAAS,EACTR,GAAW,EAEf,GAAmB,mBAARH,EACT,MAAM,IAAIvO,UAAUqN,GAUtB,SAAS8B,EAAWC,GAClB,IAAIC,EAAOV,EACPW,EAAUV,EAKd,OAHAD,EAAWC,OAAW/yB,EACtBozB,EAAiBG,EACjBN,EAASP,EAAK1O,MAAMyP,EAASD,GAI/B,SAASE,EAAYH,GAMnB,OAJAH,EAAiBG,EAEjBL,EAAUpe,WAAW6e,EAAchB,GAE5BC,EAAUU,EAAWC,GAAQN,EAWtC,SAASW,EAAaL,GACpB,IAAIM,EAAoBN,EAAOJ,EAM/B,YAAyBnzB,IAAjBmzB,GAA+BU,GAAqBlB,GACzDkB,EAAoB,GAAOR,GANJE,EAAOH,GAM8BJ,EAGjE,SAASW,IACP,IAAIJ,EAAOnB,IACX,GAAIwB,EAAaL,GACf,OAAOO,EAAaP,GAGtBL,EAAUpe,WAAW6e,EAzBvB,SAAuBJ,GACrB,IAEIN,EAASN,GAFWY,EAAOJ,GAI/B,OAAOE,EAASlB,EAAUc,EAAQD,GAHRO,EAAOH,IAGkCH,EAoBhCc,CAAcR,IAGnD,SAASO,EAAaP,GAKpB,OAJAL,OAAUlzB,EAIN6yB,GAAYC,EACPQ,EAAWC,IAEpBT,EAAWC,OAAW/yB,EACfizB,GAeT,SAASe,IACP,IAAIT,EAAOnB,IACP6B,EAAaL,EAAaL,GAM9B,GAJAT,EAAWplB,UACXqlB,EAAWh0B,KACXo0B,EAAeI,EAEXU,EAAY,CACd,QAAgBj0B,IAAZkzB,EACF,OAAOQ,EAAYP,GAErB,GAAIE,EAGF,OADAH,EAAUpe,WAAW6e,EAAchB,GAC5BW,EAAWH,GAMtB,YAHgBnzB,IAAZkzB,IACFA,EAAUpe,WAAW6e,EAAchB,IAE9BM,EAIT,OAxGAN,EAAOL,EAASK,IAAS,EACrBN,EAAS5gB,KACXmhB,IAAYnhB,EAAQmhB,QAEpBI,GADAK,EAAS,YAAa5hB,GACHygB,EAAUI,EAAS7gB,EAAQuhB,UAAY,EAAGL,GAAQK,EACrEH,EAAW,aAAcphB,IAAYA,EAAQohB,SAAWA,GAiG1DmB,EAAUE,OAnCV,gBACkBl0B,IAAZkzB,GACFre,aAAaqe,GAEfE,EAAiB,EACjBN,EAAWK,EAAeJ,EAAWG,OAAUlzB,GA+BjDg0B,EAAUG,MA5BV,WACE,YAAmBn0B,IAAZkzB,EAAwBD,EAASa,EAAa1B,MA4BhD4B,EA0DAI,CAAS1B,EAAMC,EAAM,CAC1B,QAAWC,EACX,QAAWD,EACX,SAAYE,4BCtThB,iBAQE,WAGA,IAAI7yB,EAUAwxB,EAAkB,sBAGlB6C,EAAiB,4BAMjBC,EAAc,yBAiBdC,EAAoB,GAEpBC,EAAgB,IAkBhBC,EAAW,IACXC,EAAmB,iBAEnBC,EAAM,IAGNC,EAAmB,WAKnBC,EAAY,CACd,CAAC,MAAOL,GACR,CAAC,OAtCkB,GAuCnB,CAAC,UAtCsB,GAuCvB,CAAC,QArCmB,GAsCpB,CAAC,aArCyB,IAsC1B,CAAC,OAjCkB,KAkCnB,CAAC,UAAWD,GACZ,CAAC,eAtC2B,IAuC5B,CAAC,QArCmB,MAyClBO,EAAU,qBACVC,EAAW,iBAEXC,EAAU,mBACVC,EAAU,gBAEVC,EAAW,iBACXC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,EAAY,kBAEZC,EAAY,kBACZC,EAAa,mBAEbC,EAAY,kBACZC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBAEZC,EAAa,mBAGbC,EAAiB,uBACjBC,EAAc,oBACdC,EAAa,wBACbC,EAAa,wBACbC,EAAU,qBACVC,EAAW,sBACXC,EAAW,sBACXC,EAAW,sBACXC,EAAkB,6BAClBC,EAAY,uBACZC,EAAY,uBAGZC,EAAuB,iBACvBC,EAAsB,qBACtBC,EAAwB,gCAGxBC,EAAgB,4BAChBC,EAAkB,WAClBC,EAAmB3U,OAAOyU,EAAcloB,QACxCqoB,EAAqB5U,OAAO0U,EAAgBnoB,QAG5CsoB,EAAW,mBACXC,EAAa,kBACbC,EAAgB,mBAGhBC,EAAe,mDACfC,EAAgB,QAChBC,GAAa,mGAMbC,GAAe,sBACfC,GAAkBpV,OAAOmV,GAAa5oB,QAGtC+iB,GAAS,aACT+F,GAAc,OACdC,GAAY,OAGZC,GAAgB,4CAChBC,GAAgB,oCAChBC,GAAiB,QAGjBC,GAAc,4CAGdC,GAAe,WAMfC,GAAe,kCAGfC,GAAU,OAGVtG,GAAa,qBAGbC,GAAa,aAGbsG,GAAe,8BAGfrG,GAAY,cAGZsG,GAAW,mBAGXC,GAAU,8CAGVC,GAAY,OAGZC,GAAoB,yBAOpBC,GAAeC,gDAEfC,GAAe,4BAKfC,GAAe,4BAEfC,GAAeC,8OAKfC,GAAU,IAAMF,GAAe,IAC/BG,GAAU,IAAMP,GAAe,IAC/BQ,GAAW,OAEXC,GAAU,IAAMP,GAAe,IAC/BQ,GAAS,oBAAuBN,GAAeI,GAlB9B,kBAkB0DN,GAAeC,GAAe,IACzGQ,GAAS,2BAETC,GAAc,qBACdC,GAAa,kCACbC,GAAa,qCACbC,GAAU,IAAMZ,GAAe,IAI/Ba,GAAc,MAAQP,GAAU,IAAMC,GAAS,IAC/CO,GAAc,MAAQF,GAAU,IAAML,GAAS,IAC/CQ,GAAkB,gCAClBC,GAAkB,gCAClBC,GAZa,MAAQb,GAAU,IAAMI,GAY1BU,KACXC,GAAW,oBAIXC,GAAQD,GAAWF,GAHP,gBAAwB,CAACR,GAAaC,GAAYC,IAAY36B,KAAK,KAAO,IAAMm7B,GAAWF,GAAW,KAIlHI,GAAU,MAAQ,CAtBN,oBAsBkBX,GAAYC,IAAY36B,KAAK,KAAO,IAAMo7B,GACxEE,GAAW,MAAQ,CAACb,GAAcL,GAAU,IAAKA,GAASM,GAAYC,GA3B3D,qBA2BiF36B,KAAK,KAAO,IAGxGu7B,GAAS7X,OA/BA,OA+Be,KAMxB8X,GAAc9X,OAAO0W,GAAS,KAG9BqB,GAAY/X,OAAO8W,GAAS,MAAQA,GAAS,KAAOc,GAAWF,GAAO,KAGtEM,GAAgBhY,OAAO,CACzBkX,GAAU,IAAMN,GAAU,IAAMS,GAAkB,MAAQ,CAACZ,GAASS,GAAS,KAAK56B,KAAK,KAAO,IAC9F86B,GAAc,IAAME,GAAkB,MAAQ,CAACb,GAASS,GAAUC,GAAa,KAAK76B,KAAK,KAAO,IAChG46B,GAAU,IAAMC,GAAc,IAAME,GACpCH,GAAU,IAAMI,GAtBD,mDADA,mDA0BfX,GACAgB,IACAr7B,KAAK,KAAM,KAGT27B,GAAejY,OAAO,0BAA+BmW,GAA/B,mBAGtB+B,GAAmB,qEAGnBC,GAAe,CACjB,QAAS,SAAU,WAAY,OAAQ,QAAS,eAAgB,eAChE,WAAY,YAAa,aAAc,aAAc,MAAO,OAAQ,SACpE,UAAW,SAAU,MAAO,SAAU,SAAU,YAAa,aAC7D,oBAAqB,cAAe,cAAe,UACnD,IAAK,eAAgB,WAAY,WAAY,cAI3CC,IAAmB,EAGnBC,GAAiB,GACrBA,GAAexE,GAAcwE,GAAevE,GAC5CuE,GAAetE,GAAWsE,GAAerE,GACzCqE,GAAepE,GAAYoE,GAAenE,GAC1CmE,GAAelE,GAAmBkE,GAAejE,GACjDiE,GAAehE,IAAa,EAC5BgE,GAAe1F,GAAW0F,GAAezF,GACzCyF,GAAe1E,GAAkB0E,GAAexF,GAChDwF,GAAezE,GAAeyE,GAAevF,GAC7CuF,GAAetF,GAAYsF,GAAerF,GAC1CqF,GAAenF,GAAUmF,GAAelF,GACxCkF,GAAejF,GAAaiF,GAAe/E,GAC3C+E,GAAe9E,GAAU8E,GAAe7E,GACxC6E,GAAe3E,IAAc,EAG7B,IAAI4E,GAAgB,GACpBA,GAAc3F,GAAW2F,GAAc1F,GACvC0F,GAAc3E,GAAkB2E,GAAc1E,GAC9C0E,GAAczF,GAAWyF,GAAcxF,GACvCwF,GAAczE,GAAcyE,GAAcxE,GAC1CwE,GAAcvE,GAAWuE,GAActE,GACvCsE,GAAcrE,GAAYqE,GAAcpF,GACxCoF,GAAcnF,GAAamF,GAAclF,GACzCkF,GAAchF,GAAagF,GAAc/E,GACzC+E,GAAc9E,GAAa8E,GAAc7E,GACzC6E,GAAcpE,GAAYoE,GAAcnE,GACxCmE,GAAclE,GAAakE,GAAcjE,IAAa,EACtDiE,GAAcvF,GAAYuF,GAActF,GACxCsF,GAAc5E,IAAc,EAG5B,IA4EI6E,GAAgB,CAClB,KAAM,KACN,IAAK,IACL,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAIRC,GAAiBC,WACjB/I,GAAeC,SAGfC,GAA8B,iBAAV,EAAAlgB,GAAsB,EAAAA,GAAU,EAAAA,EAAO/I,SAAWA,QAAU,EAAA+I,EAGhFmgB,GAA0B,iBAARje,MAAoBA,MAAQA,KAAKjL,SAAWA,QAAUiL,KAGxEpc,GAAOo6B,IAAcC,IAAY/N,SAAS,cAATA,GAGjC4W,GAA4CjmC,IAAYA,EAAQkmC,UAAYlmC,EAG5EmmC,GAAaF,IAA4CvuB,IAAWA,EAAOwuB,UAAYxuB,EAGvF0uB,GAAgBD,IAAcA,GAAWnmC,UAAYimC,GAGrDI,GAAcD,IAAiBjJ,GAAWmJ,QAG1CC,GAAY,WACd,IAIE,OAFYJ,IAAcA,GAAWK,SAAWL,GAAWK,QAAQ,QAAQC,OAOpEJ,IAAeA,GAAYK,SAAWL,GAAYK,QAAQ,QACjE,MAAOz/B,KAXI,GAeX0/B,GAAoBJ,IAAYA,GAASK,cACzCC,GAAaN,IAAYA,GAASO,OAClCC,GAAYR,IAAYA,GAASS,MACjCC,GAAeV,IAAYA,GAASW,SACpCC,GAAYZ,IAAYA,GAASa,MACjCC,GAAmBd,IAAYA,GAASe,aAc5C,SAASlY,GAAM0O,EAAMe,EAASD,GAC5B,OAAQA,EAAK36B,QACX,KAAK,EAAG,OAAO65B,EAAKjlB,KAAKgmB,GACzB,KAAK,EAAG,OAAOf,EAAKjlB,KAAKgmB,EAASD,EAAK,IACvC,KAAK,EAAG,OAAOd,EAAKjlB,KAAKgmB,EAASD,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOd,EAAKjlB,KAAKgmB,EAASD,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOd,EAAK1O,MAAMyP,EAASD,GAa7B,SAAS2I,GAAgB5vB,EAAO6vB,EAAQC,EAAUC,GAIhD,IAHA,IAAI1jC,GAAS,EACTC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,SAE9BD,EAAQC,GAAQ,CACvB,IAAI2G,EAAQ+M,EAAM3T,GAClBwjC,EAAOE,EAAa98B,EAAO68B,EAAS78B,GAAQ+M,GAE9C,OAAO+vB,EAYT,SAASC,GAAUhwB,EAAO8vB,GAIxB,IAHA,IAAIzjC,GAAS,EACTC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,SAE9BD,EAAQC,IAC8B,IAAzCwjC,EAAS9vB,EAAM3T,GAAQA,EAAO2T,KAIpC,OAAOA,EAYT,SAASiwB,GAAejwB,EAAO8vB,GAG7B,IAFA,IAAIxjC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OAEhCA,MAC0C,IAA3CwjC,EAAS9vB,EAAM1T,GAASA,EAAQ0T,KAItC,OAAOA,EAaT,SAASkwB,GAAWlwB,EAAOmwB,GAIzB,IAHA,IAAI9jC,GAAS,EACTC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,SAE9BD,EAAQC,GACf,IAAK6jC,EAAUnwB,EAAM3T,GAAQA,EAAO2T,GAClC,OAAO,EAGX,OAAO,EAYT,SAASowB,GAAYpwB,EAAOmwB,GAM1B,IALA,IAAI9jC,GAAS,EACTC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACnC+jC,EAAW,EACX3J,EAAS,KAEJr6B,EAAQC,GAAQ,CACvB,IAAI2G,EAAQ+M,EAAM3T,GACd8jC,EAAUl9B,EAAO5G,EAAO2T,KAC1B0mB,EAAO2J,KAAcp9B,GAGzB,OAAOyzB,EAYT,SAAS4J,GAActwB,EAAO/M,GAE5B,QADsB,MAAT+M,IAAoBA,EAAM1T,SACpBikC,GAAYvwB,EAAO/M,EAAO,IAAM,EAYrD,SAASu9B,GAAkBxwB,EAAO/M,EAAOw9B,GAIvC,IAHA,IAAIpkC,GAAS,EACTC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,SAE9BD,EAAQC,GACf,GAAImkC,EAAWx9B,EAAO+M,EAAM3T,IAC1B,OAAO,EAGX,OAAO,EAYT,SAASqkC,GAAS1wB,EAAO8vB,GAKvB,IAJA,IAAIzjC,GAAS,EACTC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACnCo6B,EAAS1lB,MAAM1U,KAEVD,EAAQC,GACfo6B,EAAOr6B,GAASyjC,EAAS9vB,EAAM3T,GAAQA,EAAO2T,GAEhD,OAAO0mB,EAWT,SAASiK,GAAU3wB,EAAOC,GAKxB,IAJA,IAAI5T,GAAS,EACTC,EAAS2T,EAAO3T,OAChBiiB,EAASvO,EAAM1T,SAEVD,EAAQC,GACf0T,EAAMuO,EAASliB,GAAS4T,EAAO5T,GAEjC,OAAO2T,EAeT,SAAS4wB,GAAY5wB,EAAO8vB,EAAUC,EAAac,GACjD,IAAIxkC,GAAS,EACTC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OAKvC,IAHIukC,GAAavkC,IACfyjC,EAAc/vB,IAAQ3T,MAEfA,EAAQC,GACfyjC,EAAcD,EAASC,EAAa/vB,EAAM3T,GAAQA,EAAO2T,GAE3D,OAAO+vB,EAeT,SAASe,GAAiB9wB,EAAO8vB,EAAUC,EAAac,GACtD,IAAIvkC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OAIvC,IAHIukC,GAAavkC,IACfyjC,EAAc/vB,IAAQ1T,IAEjBA,KACLyjC,EAAcD,EAASC,EAAa/vB,EAAM1T,GAASA,EAAQ0T,GAE7D,OAAO+vB,EAaT,SAASgB,GAAU/wB,EAAOmwB,GAIxB,IAHA,IAAI9jC,GAAS,EACTC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,SAE9BD,EAAQC,GACf,GAAI6jC,EAAUnwB,EAAM3T,GAAQA,EAAO2T,GACjC,OAAO,EAGX,OAAO,EAUT,IAAIgxB,GAAYC,GAAa,UAmC7B,SAASC,GAAYC,EAAYhB,EAAWiB,GAC1C,IAAI1K,EAOJ,OANA0K,EAASD,GAAY,SAASl+B,EAAOkX,EAAKgnB,GACxC,GAAIhB,EAAUl9B,EAAOkX,EAAKgnB,GAExB,OADAzK,EAASvc,GACF,KAGJuc,EAcT,SAAS2K,GAAcrxB,EAAOmwB,EAAWmB,EAAWC,GAIlD,IAHA,IAAIjlC,EAAS0T,EAAM1T,OACfD,EAAQilC,GAAaC,EAAY,GAAK,GAElCA,EAAYllC,MAAYA,EAAQC,GACtC,GAAI6jC,EAAUnwB,EAAM3T,GAAQA,EAAO2T,GACjC,OAAO3T,EAGX,OAAQ,EAYV,SAASkkC,GAAYvwB,EAAO/M,EAAOq+B,GACjC,OAAOr+B,GAAUA,EAocnB,SAAuB+M,EAAO/M,EAAOq+B,GAInC,IAHA,IAAIjlC,EAAQilC,EAAY,EACpBhlC,EAAS0T,EAAM1T,SAEVD,EAAQC,GACf,GAAI0T,EAAM3T,KAAW4G,EACnB,OAAO5G,EAGX,OAAQ,EA5cJmlC,CAAcxxB,EAAO/M,EAAOq+B,GAC5BD,GAAcrxB,EAAOyxB,GAAWH,GAatC,SAASI,GAAgB1xB,EAAO/M,EAAOq+B,EAAWb,GAIhD,IAHA,IAAIpkC,EAAQilC,EAAY,EACpBhlC,EAAS0T,EAAM1T,SAEVD,EAAQC,GACf,GAAImkC,EAAWzwB,EAAM3T,GAAQ4G,GAC3B,OAAO5G,EAGX,OAAQ,EAUV,SAASolC,GAAUx+B,GACjB,OAAOA,GAAUA,EAYnB,SAAS0+B,GAAS3xB,EAAO8vB,GACvB,IAAIxjC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACvC,OAAOA,EAAUslC,GAAQ5xB,EAAO8vB,GAAYxjC,EAAU87B,EAUxD,SAAS6I,GAAa9mB,GACpB,OAAO,SAAS0nB,GACd,OAAiB,MAAVA,EAAiBp+B,EAAYo+B,EAAO1nB,IAW/C,SAAS2nB,GAAeD,GACtB,OAAO,SAAS1nB,GACd,OAAiB,MAAV0nB,EAAiBp+B,EAAYo+B,EAAO1nB,IAiB/C,SAAS4nB,GAAWZ,EAAYrB,EAAUC,EAAac,EAAWO,GAMhE,OALAA,EAASD,GAAY,SAASl+B,EAAO5G,EAAO8kC,GAC1CpB,EAAcc,GACTA,GAAY,EAAO59B,GACpB68B,EAASC,EAAa98B,EAAO5G,EAAO8kC,MAEnCpB,EAgCT,SAAS6B,GAAQ5xB,EAAO8vB,GAKtB,IAJA,IAAIpJ,EACAr6B,GAAS,EACTC,EAAS0T,EAAM1T,SAEVD,EAAQC,GAAQ,CACvB,IAAIF,EAAU0jC,EAAS9vB,EAAM3T,IACzBD,IAAYqH,IACdizB,EAASA,IAAWjzB,EAAYrH,EAAWs6B,EAASt6B,GAGxD,OAAOs6B,EAYT,SAASsL,GAAU11B,EAAGwzB,GAIpB,IAHA,IAAIzjC,GAAS,EACTq6B,EAAS1lB,MAAM1E,KAEVjQ,EAAQiQ,GACfoqB,EAAOr6B,GAASyjC,EAASzjC,GAE3B,OAAOq6B,EAyBT,SAASuL,GAAU9L,GACjB,OAAO,SAASlzB,GACd,OAAOkzB,EAAKlzB,IAchB,SAASi/B,GAAWL,EAAQ3nC,GAC1B,OAAOwmC,GAASxmC,GAAO,SAASigB,GAC9B,OAAO0nB,EAAO1nB,MAYlB,SAASgoB,GAASC,EAAOjoB,GACvB,OAAOioB,EAAMnhB,IAAI9G,GAYnB,SAASkoB,GAAgBC,EAAYC,GAInC,IAHA,IAAIlmC,GAAS,EACTC,EAASgmC,EAAWhmC,SAEfD,EAAQC,GAAUikC,GAAYgC,EAAYD,EAAWjmC,GAAQ,IAAM,IAC5E,OAAOA,EAYT,SAASmmC,GAAcF,EAAYC,GAGjC,IAFA,IAAIlmC,EAAQimC,EAAWhmC,OAEhBD,KAAWkkC,GAAYgC,EAAYD,EAAWjmC,GAAQ,IAAM,IACnE,OAAOA,EAWT,SAASomC,GAAazyB,EAAO0yB,GAI3B,IAHA,IAAIpmC,EAAS0T,EAAM1T,OACfo6B,EAAS,EAENp6B,KACD0T,EAAM1T,KAAYomC,KAClBhM,EAGN,OAAOA,EAWT,IAAIiM,GAAeb,GApwBG,CAEpB,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAC1E,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAC1E,EAAQ,IAAM,EAAQ,IACtB,EAAQ,IAAM,EAAQ,IACtB,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IACtB,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAC1E,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAC1E,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IACnC,EAAQ,KAAM,EAAQ,KACtB,EAAQ,KAAM,EAAQ,KACtB,EAAQ,KAER,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAC1B,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACtF,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACtF,EAAU,IAAM,EAAU,IAC1B,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,KAAM,EAAU,KAC1B,EAAU,KAAM,EAAU,KAC1B,EAAU,KAAM,EAAU,MAutBxBc,GAAiBd,GAntBH,CAChB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,UAutBP,SAASe,GAAiBC,GACxB,MAAO,KAAO3E,GAAc2E,GAsB9B,SAASC,GAAWC,GAClB,OAAOnF,GAAar4B,KAAKw9B,GAsC3B,SAASC,GAAWllC,GAClB,IAAI1B,GAAS,EACTq6B,EAAS1lB,MAAMjT,EAAIyT,MAKvB,OAHAzT,EAAI0O,SAAQ,SAASxJ,EAAOkX,GAC1Buc,IAASr6B,GAAS,CAAC8d,EAAKlX,MAEnByzB,EAWT,SAASwM,GAAQ/M,EAAMgN,GACrB,OAAO,SAASC,GACd,OAAOjN,EAAKgN,EAAUC,KAa1B,SAASC,GAAerzB,EAAO0yB,GAM7B,IALA,IAAIrmC,GAAS,EACTC,EAAS0T,EAAM1T,OACf+jC,EAAW,EACX3J,EAAS,KAEJr6B,EAAQC,GAAQ,CACvB,IAAI2G,EAAQ+M,EAAM3T,GACd4G,IAAUy/B,GAAez/B,IAAU80B,IACrC/nB,EAAM3T,GAAS07B,EACfrB,EAAO2J,KAAchkC,GAGzB,OAAOq6B,EAUT,SAAS4M,GAAWzb,GAClB,IAAIxrB,GAAS,EACTq6B,EAAS1lB,MAAM6W,EAAIrW,MAKvB,OAHAqW,EAAIpb,SAAQ,SAASxJ,GACnByzB,IAASr6B,GAAS4G,KAEbyzB,EAUT,SAAS6M,GAAW1b,GAClB,IAAIxrB,GAAS,EACTq6B,EAAS1lB,MAAM6W,EAAIrW,MAKvB,OAHAqW,EAAIpb,SAAQ,SAASxJ,GACnByzB,IAASr6B,GAAS,CAAC4G,EAAOA,MAErByzB,EAoDT,SAAS8M,GAAWR,GAClB,OAAOD,GAAWC,GAkCpB,SAAqBA,GAEnB,IADA,IAAItM,EAASiH,GAAU8F,UAAY,EAC5B9F,GAAUn4B,KAAKw9B,MAClBtM,EAEJ,OAAOA,EAtCHgN,CAAYV,GACZhC,GAAUgC,GAUhB,SAASW,GAAcX,GACrB,OAAOD,GAAWC,GAoCpB,SAAwBA,GACtB,OAAOA,EAAOr9B,MAAMg4B,KAAc,GApC9BiG,CAAeZ,GAhkBrB,SAAsBA,GACpB,OAAOA,EAAOa,MAAM,IAgkBhBC,CAAad,GAUnB,IAAIe,GAAmBjC,GA/6BH,CAClB,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,MA+ygBP90B,GA/zee,SAAUg3B,EAAa9Z,GAIxC,IA6BM+Z,EA7BFjzB,GAHJkZ,EAAqB,MAAXA,EAAkB9uB,GAAO4R,GAAEuY,SAASnqB,GAAKmR,SAAU2d,EAASld,GAAEk3B,KAAK9oC,GAAM2iC,MAG/D/sB,MAChB6U,GAAOqE,EAAQrE,KACf/hB,GAAQomB,EAAQpmB,MAChB4jB,GAAWwC,EAAQxC,SACnBlf,GAAO0hB,EAAQ1hB,KACf+D,GAAS2d,EAAQ3d,OACjBqZ,GAASsE,EAAQtE,OACjB0D,GAASY,EAAQZ,OACjB1B,GAAYsC,EAAQtC,UAGpBuc,GAAanzB,EAAMC,UACnBmzB,GAAY1c,GAASzW,UACrBozB,GAAc93B,GAAO0E,UAGrBqzB,GAAapa,EAAQ,sBAGrBqa,GAAeH,GAAUzwB,SAGzBqK,GAAiBqmB,GAAYrmB,eAG7BwmB,GAAY,EAGZC,IACER,EAAM,SAASS,KAAKJ,IAAcA,GAAW93B,MAAQ83B,GAAW93B,KAAKm4B,UAAY,KACvE,iBAAmBV,EAAO,GAQtCW,GAAuBP,GAAY1wB,SAGnCkxB,GAAmBN,GAAarzB,KAAK3E,IAGrCu4B,GAAU1pC,GAAK4R,EAGf+3B,GAAanf,GAAO,IACtB2e,GAAarzB,KAAK8M,IAAgBjY,QAAQg1B,GAAc,QACvDh1B,QAAQ,yDAA0D,SAAW,KAI5Ei/B,GAASvG,GAAgBvU,EAAQ8a,OAASvhC,EAC1CojB,GAASqD,EAAQrD,OACjBoe,GAAa/a,EAAQ+a,WACrBC,GAAcF,GAASA,GAAOE,YAAczhC,EAC5C0hC,GAAejC,GAAQ32B,GAAO0a,eAAgB1a,IAC9C64B,GAAe74B,GAAOwa,OACtBse,GAAuBhB,GAAYgB,qBACnCC,GAASnB,GAAWmB,OACpBC,GAAmB1e,GAASA,GAAO2e,mBAAqB/hC,EACxDgiC,GAAc5e,GAASA,GAAOC,SAAWrjB,EACzCiiC,GAAiB7e,GAASA,GAAO8e,YAAcliC,EAE/C2kB,GAAkB,WACpB,IACE,IAAI+N,EAAOyP,GAAUr5B,GAAQ,kBAE7B,OADA4pB,EAAK,GAAI,GAAI,IACNA,EACP,MAAO72B,KALU,GASjBumC,GAAkB3b,EAAQ5R,eAAiBld,GAAKkd,cAAgB4R,EAAQ5R,aACxEwtB,GAASjgB,IAAQA,GAAKgQ,MAAQz6B,GAAKyqB,KAAKgQ,KAAOhQ,GAAKgQ,IACpDkQ,GAAgB7b,EAAQ3R,aAAend,GAAKmd,YAAc2R,EAAQ3R,WAGlEytB,GAAax9B,GAAKy9B,KAClBC,GAAc19B,GAAK6C,MACnB86B,GAAmB55B,GAAO+b,sBAC1B8d,GAAiBpB,GAASA,GAAOqB,SAAW5iC,EAC5C6iC,GAAiBpc,EAAQqc,SACzBC,GAAarC,GAAWjiC,KACxBukC,GAAavD,GAAQ32B,GAAOC,KAAMD,IAClCopB,GAAYntB,GAAKuO,IACjB6e,GAAYptB,GAAKsO,IACjB4vB,GAAY7gB,GAAKgQ,IACjB8Q,GAAiBzc,EAAQqL,SACzBqR,GAAep+B,GAAKgR,OACpBqtB,GAAgB1C,GAAW2C,QAG3BC,GAAWnB,GAAU1b,EAAS,YAC9BvE,GAAMigB,GAAU1b,EAAS,OACzBvB,GAAUid,GAAU1b,EAAS,WAC7BlJ,GAAM4kB,GAAU1b,EAAS,OACzB8c,GAAUpB,GAAU1b,EAAS,WAC7B+c,GAAerB,GAAUr5B,GAAQ,UAGjC26B,GAAUF,IAAW,IAAIA,GAGzBG,GAAY,GAGZC,GAAqBC,GAASN,IAC9BO,GAAgBD,GAAS1hB,IACzB4hB,GAAoBF,GAAS1e,IAC7B6e,GAAgBH,GAASrmB,IACzBymB,GAAoBJ,GAASL,IAG7BU,GAAc7gB,GAASA,GAAO5V,UAAYxN,EAC1CkkC,GAAgBD,GAAcA,GAAYlgB,QAAU/jB,EACpDmkC,GAAiBF,GAAcA,GAAY/zB,SAAWlQ,EAyH1D,SAASokC,GAAO5kC,GACd,GAAI+yB,GAAa/yB,KAAWmb,GAAQnb,MAAYA,aAAiB6kC,IAAc,CAC7E,GAAI7kC,aAAiB8kC,GACnB,OAAO9kC,EAET,GAAI+a,GAAe9M,KAAKjO,EAAO,eAC7B,OAAO+kC,GAAa/kC,GAGxB,OAAO,IAAI8kC,GAAc9kC,GAW3B,IAAIglC,GAAc,WAChB,SAASpG,KACT,OAAO,SAASqG,GACd,IAAKpS,GAASoS,GACZ,MAAO,GAET,GAAI9C,GACF,OAAOA,GAAa8C,GAEtBrG,EAAO5wB,UAAYi3B,EACnB,IAAIxR,EAAS,IAAImL,EAEjB,OADAA,EAAO5wB,UAAYxN,EACZizB,GAZM,GAqBjB,SAASyR,MAWT,SAASJ,GAAc9kC,EAAOmlC,GAC5B5lC,KAAK6lC,YAAcplC,EACnBT,KAAK8lC,YAAc,GACnB9lC,KAAK+lC,YAAcH,EACnB5lC,KAAKgmC,UAAY,EACjBhmC,KAAKimC,WAAahlC,EAgFpB,SAASqkC,GAAY7kC,GACnBT,KAAK6lC,YAAcplC,EACnBT,KAAK8lC,YAAc,GACnB9lC,KAAKkmC,QAAU,EACflmC,KAAKmmC,cAAe,EACpBnmC,KAAKomC,cAAgB,GACrBpmC,KAAKqmC,cAAgBxQ,EACrB71B,KAAKsmC,UAAY,GAgHnB,SAASC,GAAKC,GACZ,IAAI3sC,GAAS,EACTC,EAAoB,MAAX0sC,EAAkB,EAAIA,EAAQ1sC,OAG3C,IADAkG,KAAK2L,UACI9R,EAAQC,GAAQ,CACvB,IAAI2sC,EAAQD,EAAQ3sC,GACpBmG,KAAKqlB,IAAIohB,EAAM,GAAIA,EAAM,KAiG7B,SAASC,GAAUF,GACjB,IAAI3sC,GAAS,EACTC,EAAoB,MAAX0sC,EAAkB,EAAIA,EAAQ1sC,OAG3C,IADAkG,KAAK2L,UACI9R,EAAQC,GAAQ,CACvB,IAAI2sC,EAAQD,EAAQ3sC,GACpBmG,KAAKqlB,IAAIohB,EAAM,GAAIA,EAAM,KA8G7B,SAASE,GAASH,GAChB,IAAI3sC,GAAS,EACTC,EAAoB,MAAX0sC,EAAkB,EAAIA,EAAQ1sC,OAG3C,IADAkG,KAAK2L,UACI9R,EAAQC,GAAQ,CACvB,IAAI2sC,EAAQD,EAAQ3sC,GACpBmG,KAAKqlB,IAAIohB,EAAM,GAAIA,EAAM,KAiG7B,SAASG,GAASn5B,GAChB,IAAI5T,GAAS,EACTC,EAAmB,MAAV2T,EAAiB,EAAIA,EAAO3T,OAGzC,IADAkG,KAAK6mC,SAAW,IAAIF,KACX9sC,EAAQC,GACfkG,KAAKkG,IAAIuH,EAAO5T,IA6CpB,SAASitC,GAAMN,GACb,IAAIrxB,EAAOnV,KAAK6mC,SAAW,IAAIH,GAAUF,GACzCxmC,KAAKgP,KAAOmG,EAAKnG,KAqGnB,SAAS+3B,GAActmC,EAAOumC,GAC5B,IAAIC,EAAQrrB,GAAQnb,GAChBymC,GAASD,GAASE,GAAY1mC,GAC9B2mC,GAAUH,IAAUC,GAASrD,GAASpjC,GACtC4mC,GAAUJ,IAAUC,IAAUE,GAAUjK,GAAa18B,GACrD6mC,EAAcL,GAASC,GAASE,GAAUC,EAC1CnT,EAASoT,EAAc9H,GAAU/+B,EAAM3G,OAAQgtB,IAAU,GACzDhtB,EAASo6B,EAAOp6B,OAEpB,IAAK,IAAI6d,KAAOlX,GACTumC,IAAaxrB,GAAe9M,KAAKjO,EAAOkX,IACvC2vB,IAEQ,UAAP3vB,GAECyvB,IAAkB,UAAPzvB,GAA0B,UAAPA,IAE9B0vB,IAAkB,UAAP1vB,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD4vB,GAAQ5vB,EAAK7d,KAElBo6B,EAAOl6B,KAAK2d,GAGhB,OAAOuc,EAUT,SAASsT,GAAYh6B,GACnB,IAAI1T,EAAS0T,EAAM1T,OACnB,OAAOA,EAAS0T,EAAMi6B,GAAW,EAAG3tC,EAAS,IAAMmH,EAWrD,SAASymC,GAAgBl6B,EAAO1D,GAC9B,OAAO69B,GAAYC,GAAUp6B,GAAQq6B,GAAU/9B,EAAG,EAAG0D,EAAM1T,SAU7D,SAASguC,GAAat6B,GACpB,OAAOm6B,GAAYC,GAAUp6B,IAY/B,SAASu6B,GAAiB1I,EAAQ1nB,EAAKlX,IAChCA,IAAUQ,IAAc+mC,GAAG3I,EAAO1nB,GAAMlX,IACxCA,IAAUQ,KAAe0W,KAAO0nB,KACnC4I,GAAgB5I,EAAQ1nB,EAAKlX,GAcjC,SAASynC,GAAY7I,EAAQ1nB,EAAKlX,GAChC,IAAI0nC,EAAW9I,EAAO1nB,GAChB6D,GAAe9M,KAAK2wB,EAAQ1nB,IAAQqwB,GAAGG,EAAU1nC,KAClDA,IAAUQ,GAAe0W,KAAO0nB,IACnC4I,GAAgB5I,EAAQ1nB,EAAKlX,GAYjC,SAAS2nC,GAAa56B,EAAOmK,GAE3B,IADA,IAAI7d,EAAS0T,EAAM1T,OACZA,KACL,GAAIkuC,GAAGx6B,EAAM1T,GAAQ,GAAI6d,GACvB,OAAO7d,EAGX,OAAQ,EAcV,SAASuuC,GAAe1J,EAAYtB,EAAQC,EAAUC,GAIpD,OAHA+K,GAAS3J,GAAY,SAASl+B,EAAOkX,EAAKgnB,GACxCtB,EAAOE,EAAa98B,EAAO68B,EAAS78B,GAAQk+B,MAEvCpB,EAYT,SAASgL,GAAWlJ,EAAQ1vB,GAC1B,OAAO0vB,GAAUmJ,GAAW74B,EAAQ3F,GAAK2F,GAAS0vB,GAyBpD,SAAS4I,GAAgB5I,EAAQ1nB,EAAKlX,GACzB,aAAPkX,GAAsBiO,GACxBA,GAAeyZ,EAAQ1nB,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAASlX,EACT,UAAY,IAGd4+B,EAAO1nB,GAAOlX,EAYlB,SAASgoC,GAAOpJ,EAAQxd,GAMtB,IALA,IAAIhoB,GAAS,EACTC,EAAS+nB,EAAM/nB,OACfo6B,EAAS1lB,EAAM1U,GACf4uC,EAAiB,MAAVrJ,IAEFxlC,EAAQC,GACfo6B,EAAOr6B,GAAS6uC,EAAOznC,EAAYyF,GAAI24B,EAAQxd,EAAMhoB,IAEvD,OAAOq6B,EAYT,SAAS2T,GAAUc,EAAQC,EAAOC,GAShC,OARIF,GAAWA,IACTE,IAAU5nC,IACZ0nC,EAASA,GAAUE,EAAQF,EAASE,GAElCD,IAAU3nC,IACZ0nC,EAASA,GAAUC,EAAQD,EAASC,IAGjCD,EAmBT,SAASG,GAAUroC,EAAOsoC,EAASC,EAAYrxB,EAAK0nB,EAAQ4J,GAC1D,IAAI/U,EACAgV,EA5hFc,EA4hFLH,EACTI,EA5hFc,EA4hFLJ,EACTK,EA5hFiB,EA4hFRL,EAKb,GAHIC,IACF9U,EAASmL,EAAS2J,EAAWvoC,EAAOkX,EAAK0nB,EAAQ4J,GAASD,EAAWvoC,IAEnEyzB,IAAWjzB,EACb,OAAOizB,EAET,IAAKZ,GAAS7yB,GACZ,OAAOA,EAET,IAAIwmC,EAAQrrB,GAAQnb,GACpB,GAAIwmC,GAEF,GADA/S,EAu7GJ,SAAwB1mB,GACtB,IAAI1T,EAAS0T,EAAM1T,OACfo6B,EAAS,IAAI1mB,EAAM5N,YAAY9F,GAOnC,OAJIA,GAA6B,iBAAZ0T,EAAM,IAAkBgO,GAAe9M,KAAKlB,EAAO,WACtE0mB,EAAOr6B,MAAQ2T,EAAM3T,MACrBq6B,EAAOmV,MAAQ77B,EAAM67B,OAEhBnV,EAh8GIoV,CAAe7oC,IACnByoC,EACH,OAAOtB,GAAUnnC,EAAOyzB,OAErB,CACL,IAAIqV,EAAMC,GAAO/oC,GACbgpC,EAASF,GAAOnT,GAAWmT,GAAOlT,EAEtC,GAAIwN,GAASpjC,GACX,OAAOipC,GAAYjpC,EAAOyoC,GAE5B,GAAIK,GAAO/S,GAAa+S,GAAOxT,GAAY0T,IAAWpK,GAEpD,GADAnL,EAAUiV,GAAUM,EAAU,GAAKE,GAAgBlpC,IAC9CyoC,EACH,OAAOC,EA2mEf,SAAuBx5B,EAAQ0vB,GAC7B,OAAOmJ,GAAW74B,EAAQi6B,GAAaj6B,GAAS0vB,GA3mEtCwK,CAAcppC,EAnH1B,SAAsB4+B,EAAQ1vB,GAC5B,OAAO0vB,GAAUmJ,GAAW74B,EAAQm6B,GAAOn6B,GAAS0vB,GAkHrB0K,CAAa7V,EAAQzzB,IA8lEtD,SAAqBkP,EAAQ0vB,GAC3B,OAAOmJ,GAAW74B,EAAQq6B,GAAWr6B,GAAS0vB,GA9lEpC4K,CAAYxpC,EAAO8nC,GAAWrU,EAAQzzB,QAEvC,CACL,IAAKi7B,GAAc6N,GACjB,OAAOlK,EAAS5+B,EAAQ,GAE1ByzB,EAs8GN,SAAwBmL,EAAQkK,EAAKL,GACnC,IAvlDmBgB,EAulDfC,EAAO9K,EAAOz/B,YAClB,OAAQ2pC,GACN,KAAKxS,EACH,OAAOqT,GAAiB/K,GAE1B,KAAKpJ,EACL,KAAKC,EACH,OAAO,IAAIiU,GAAM9K,GAEnB,KAAKrI,EACH,OA1nDN,SAAuBqT,EAAUnB,GAC/B,IAAI7zB,EAAS6zB,EAASkB,GAAiBC,EAASh1B,QAAUg1B,EAASh1B,OACnE,OAAO,IAAIg1B,EAASzqC,YAAYyV,EAAQg1B,EAASC,WAAYD,EAASE,YAwnD3DC,CAAcnL,EAAQ6J,GAE/B,KAAKjS,EAAY,KAAKC,EACtB,KAAKC,EAAS,KAAKC,EAAU,KAAKC,EAClC,KAAKC,EAAU,KAAKC,EAAiB,KAAKC,EAAW,KAAKC,EACxD,OAAOgT,GAAgBpL,EAAQ6J,GAEjC,KAAK5S,EACH,OAAO,IAAI6T,EAEb,KAAK5T,EACL,KAAKK,EACH,OAAO,IAAIuT,EAAK9K,GAElB,KAAK3I,EACH,OA7nDN,SAAqBgU,GACnB,IAAIxW,EAAS,IAAIwW,EAAO9qC,YAAY8qC,EAAO/6B,OAAQspB,GAAQiJ,KAAKwI,IAEhE,OADAxW,EAAO+M,UAAYyJ,EAAOzJ,UACnB/M,EA0nDIyW,CAAYtL,GAErB,KAAK1I,EACH,OAAO,IAAIwT,EAEb,KAAKtT,EACH,OAtnDeqT,EAsnDI7K,EArnDhB8F,GAAgBp7B,GAAOo7B,GAAcz2B,KAAKw7B,IAAW,IAj3D/CU,CAAenqC,EAAO8oC,EAAKL,IAIxCD,IAAUA,EAAQ,IAAInC,IACtB,IAAI+D,EAAU5B,EAAMviC,IAAIjG,GACxB,GAAIoqC,EACF,OAAOA,EAET5B,EAAM5jB,IAAI5kB,EAAOyzB,GAEb+I,GAAMx8B,GACRA,EAAMwJ,SAAQ,SAAS6gC,GACrB5W,EAAOhuB,IAAI4iC,GAAUgC,EAAU/B,EAASC,EAAY8B,EAAUrqC,EAAOwoC,OAE9DpM,GAAMp8B,IACfA,EAAMwJ,SAAQ,SAAS6gC,EAAUnzB,GAC/Buc,EAAO7O,IAAI1N,EAAKmxB,GAAUgC,EAAU/B,EAASC,EAAYrxB,EAAKlX,EAAOwoC,OAIzE,IAIIvxC,EAAQuvC,EAAQhmC,GAJLmoC,EACVD,EAAS4B,GAAeC,GACxB7B,EAASW,GAAS9/B,IAEkBvJ,GASzC,OARA+8B,GAAU9lC,GAAS+I,GAAO,SAASqqC,EAAUnzB,GACvCjgB,IAEFozC,EAAWrqC,EADXkX,EAAMmzB,IAIR5C,GAAYhU,EAAQvc,EAAKmxB,GAAUgC,EAAU/B,EAASC,EAAYrxB,EAAKlX,EAAOwoC,OAEzE/U,EAyBT,SAAS+W,GAAe5L,EAAQ1vB,EAAQjY,GACtC,IAAIoC,EAASpC,EAAMoC,OACnB,GAAc,MAAVulC,EACF,OAAQvlC,EAGV,IADAulC,EAASt1B,GAAOs1B,GACTvlC,KAAU,CACf,IAAI6d,EAAMjgB,EAAMoC,GACZ6jC,EAAYhuB,EAAOgI,GACnBlX,EAAQ4+B,EAAO1nB,GAEnB,GAAKlX,IAAUQ,KAAe0W,KAAO0nB,KAAa1B,EAAUl9B,GAC1D,OAAO,EAGX,OAAO,EAaT,SAASyqC,GAAUvX,EAAMC,EAAMa,GAC7B,GAAmB,mBAARd,EACT,MAAM,IAAIvO,GAAUqN,GAEtB,OAAO1c,IAAW,WAAa4d,EAAK1O,MAAMhkB,EAAWwzB,KAAUb,GAcjE,SAASuX,GAAe39B,EAAOC,EAAQ6vB,EAAUW,GAC/C,IAAIpkC,GAAS,EACTiR,EAAWgzB,GACXsN,GAAW,EACXtxC,EAAS0T,EAAM1T,OACfo6B,EAAS,GACTmX,EAAe59B,EAAO3T,OAE1B,IAAKA,EACH,OAAOo6B,EAELoJ,IACF7vB,EAASywB,GAASzwB,EAAQgyB,GAAUnC,KAElCW,GACFnzB,EAAWkzB,GACXoN,GAAW,GAEJ39B,EAAO3T,QA5sFG,MA6sFjBgR,EAAW60B,GACXyL,GAAW,EACX39B,EAAS,IAAIm5B,GAASn5B,IAExBiU,EACA,OAAS7nB,EAAQC,GAAQ,CACvB,IAAI2G,EAAQ+M,EAAM3T,GACdyxC,EAAuB,MAAZhO,EAAmB78B,EAAQ68B,EAAS78B,GAGnD,GADAA,EAASw9B,GAAwB,IAAVx9B,EAAeA,EAAQ,EAC1C2qC,GAAYE,GAAaA,EAAU,CAErC,IADA,IAAIC,EAAcF,EACXE,KACL,GAAI99B,EAAO89B,KAAiBD,EAC1B,SAAS5pB,EAGbwS,EAAOl6B,KAAKyG,QAEJqK,EAAS2C,EAAQ69B,EAAUrN,IACnC/J,EAAOl6B,KAAKyG,GAGhB,OAAOyzB,EAjkCTmR,GAAOmG,iBAAmB,CAQxB,OAAUvT,EAQV,SAAYC,EAQZ,YAAeC,EAQf,SAAY,GAQZ,QAAW,CAQT,EAAKkN,KAKTA,GAAO52B,UAAYk3B,GAAWl3B,UAC9B42B,GAAO52B,UAAU7O,YAAcylC,GAE/BE,GAAc92B,UAAYg3B,GAAWE,GAAWl3B,WAChD82B,GAAc92B,UAAU7O,YAAc2lC,GAsHtCD,GAAY72B,UAAYg3B,GAAWE,GAAWl3B,WAC9C62B,GAAY72B,UAAU7O,YAAc0lC,GAoGpCiB,GAAK93B,UAAU9C,MAvEf,WACE3L,KAAK6mC,SAAWpC,GAAeA,GAAa,MAAQ,GACpDzkC,KAAKgP,KAAO,GAsEdu3B,GAAK93B,UAAkB,OAzDvB,SAAoBkJ,GAClB,IAAIuc,EAASl0B,KAAKye,IAAI9G,WAAe3X,KAAK6mC,SAASlvB,GAEnD,OADA3X,KAAKgP,MAAQklB,EAAS,EAAI,EACnBA,GAuDTqS,GAAK93B,UAAU/H,IA3Cf,SAAiBiR,GACf,IAAIxC,EAAOnV,KAAK6mC,SAChB,GAAIpC,GAAc,CAChB,IAAIvQ,EAAS/e,EAAKwC,GAClB,OAAOuc,IAAWoB,EAAiBr0B,EAAYizB,EAEjD,OAAO1Y,GAAe9M,KAAKyG,EAAMwC,GAAOxC,EAAKwC,GAAO1W,GAsCtDslC,GAAK93B,UAAUgQ,IA1Bf,SAAiB9G,GACf,IAAIxC,EAAOnV,KAAK6mC,SAChB,OAAOpC,GAAgBtvB,EAAKwC,KAAS1W,EAAaua,GAAe9M,KAAKyG,EAAMwC,IAyB9E4uB,GAAK93B,UAAU4W,IAZf,SAAiB1N,EAAKlX,GACpB,IAAI0U,EAAOnV,KAAK6mC,SAGhB,OAFA7mC,KAAKgP,MAAQhP,KAAKye,IAAI9G,GAAO,EAAI,EACjCxC,EAAKwC,GAAQ8sB,IAAgBhkC,IAAUQ,EAAaq0B,EAAiB70B,EAC9DT,MAyHT0mC,GAAUj4B,UAAU9C,MApFpB,WACE3L,KAAK6mC,SAAW,GAChB7mC,KAAKgP,KAAO,GAmFd03B,GAAUj4B,UAAkB,OAvE5B,SAAyBkJ,GACvB,IAAIxC,EAAOnV,KAAK6mC,SACZhtC,EAAQuuC,GAAajzB,EAAMwC,GAE/B,QAAI9d,EAAQ,IAIRA,GADYsb,EAAKrb,OAAS,EAE5Bqb,EAAK4S,MAEL+a,GAAOp0B,KAAKyG,EAAMtb,EAAO,KAEzBmG,KAAKgP,KACA,KA0DT03B,GAAUj4B,UAAU/H,IA9CpB,SAAsBiR,GACpB,IAAIxC,EAAOnV,KAAK6mC,SACZhtC,EAAQuuC,GAAajzB,EAAMwC,GAE/B,OAAO9d,EAAQ,EAAIoH,EAAYkU,EAAKtb,GAAO,IA2C7C6sC,GAAUj4B,UAAUgQ,IA/BpB,SAAsB9G,GACpB,OAAOywB,GAAapoC,KAAK6mC,SAAUlvB,IAAQ,GA+B7C+uB,GAAUj4B,UAAU4W,IAlBpB,SAAsB1N,EAAKlX,GACzB,IAAI0U,EAAOnV,KAAK6mC,SACZhtC,EAAQuuC,GAAajzB,EAAMwC,GAQ/B,OANI9d,EAAQ,KACRmG,KAAKgP,KACPmG,EAAKnb,KAAK,CAAC2d,EAAKlX,KAEhB0U,EAAKtb,GAAO,GAAK4G,EAEZT,MA2GT2mC,GAASl4B,UAAU9C,MAtEnB,WACE3L,KAAKgP,KAAO,EACZhP,KAAK6mC,SAAW,CACd,KAAQ,IAAIN,GACZ,IAAO,IAAKpjB,IAAOujB,IACnB,OAAU,IAAIH,KAkElBI,GAASl4B,UAAkB,OArD3B,SAAwBkJ,GACtB,IAAIuc,EAASuX,GAAWzrC,KAAM2X,GAAa,OAAEA,GAE7C,OADA3X,KAAKgP,MAAQklB,EAAS,EAAI,EACnBA,GAmDTyS,GAASl4B,UAAU/H,IAvCnB,SAAqBiR,GACnB,OAAO8zB,GAAWzrC,KAAM2X,GAAKjR,IAAIiR,IAuCnCgvB,GAASl4B,UAAUgQ,IA3BnB,SAAqB9G,GACnB,OAAO8zB,GAAWzrC,KAAM2X,GAAK8G,IAAI9G,IA2BnCgvB,GAASl4B,UAAU4W,IAdnB,SAAqB1N,EAAKlX,GACxB,IAAI0U,EAAOs2B,GAAWzrC,KAAM2X,GACxB3I,EAAOmG,EAAKnG,KAIhB,OAFAmG,EAAKkQ,IAAI1N,EAAKlX,GACdT,KAAKgP,MAAQmG,EAAKnG,MAAQA,EAAO,EAAI,EAC9BhP,MA2DT4mC,GAASn4B,UAAUvI,IAAM0gC,GAASn4B,UAAUzU,KAnB5C,SAAqByG,GAEnB,OADAT,KAAK6mC,SAASxhB,IAAI5kB,EAAO60B,GAClBt1B,MAkBT4mC,GAASn4B,UAAUgQ,IANnB,SAAqBhe,GACnB,OAAOT,KAAK6mC,SAASpoB,IAAIhe,IAuG3BqmC,GAAMr4B,UAAU9C,MA3EhB,WACE3L,KAAK6mC,SAAW,IAAIH,GACpB1mC,KAAKgP,KAAO,GA0Ed83B,GAAMr4B,UAAkB,OA9DxB,SAAqBkJ,GACnB,IAAIxC,EAAOnV,KAAK6mC,SACZ3S,EAAS/e,EAAa,OAAEwC,GAG5B,OADA3X,KAAKgP,KAAOmG,EAAKnG,KACVklB,GA0DT4S,GAAMr4B,UAAU/H,IA9ChB,SAAkBiR,GAChB,OAAO3X,KAAK6mC,SAASngC,IAAIiR,IA8C3BmvB,GAAMr4B,UAAUgQ,IAlChB,SAAkB9G,GAChB,OAAO3X,KAAK6mC,SAASpoB,IAAI9G,IAkC3BmvB,GAAMr4B,UAAU4W,IArBhB,SAAkB1N,EAAKlX,GACrB,IAAI0U,EAAOnV,KAAK6mC,SAChB,GAAI1xB,aAAgBuxB,GAAW,CAC7B,IAAIgF,EAAQv2B,EAAK0xB,SACjB,IAAK1jB,IAAQuoB,EAAM5xC,OAAS6xC,IAG1B,OAFAD,EAAM1xC,KAAK,CAAC2d,EAAKlX,IACjBT,KAAKgP,OAASmG,EAAKnG,KACZhP,KAETmV,EAAOnV,KAAK6mC,SAAW,IAAIF,GAAS+E,GAItC,OAFAv2B,EAAKkQ,IAAI1N,EAAKlX,GACdT,KAAKgP,KAAOmG,EAAKnG,KACVhP,MAscT,IAAIsoC,GAAWsD,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAUrN,EAAYhB,GAC7B,IAAIzJ,GAAS,EAKb,OAJAoU,GAAS3J,GAAY,SAASl+B,EAAO5G,EAAO8kC,GAE1C,OADAzK,IAAWyJ,EAAUl9B,EAAO5G,EAAO8kC,MAG9BzK,EAaT,SAAS+X,GAAaz+B,EAAO8vB,EAAUW,GAIrC,IAHA,IAAIpkC,GAAS,EACTC,EAAS0T,EAAM1T,SAEVD,EAAQC,GAAQ,CACvB,IAAI2G,EAAQ+M,EAAM3T,GACdD,EAAU0jC,EAAS78B,GAEvB,GAAe,MAAX7G,IAAoB0xC,IAAarqC,EAC5BrH,GAAYA,IAAY65B,GAAS75B,GAClCqkC,EAAWrkC,EAAS0xC,IAE1B,IAAIA,EAAW1xC,EACXs6B,EAASzzB,EAGjB,OAAOyzB,EAuCT,SAASgY,GAAWvN,EAAYhB,GAC9B,IAAIzJ,EAAS,GAMb,OALAoU,GAAS3J,GAAY,SAASl+B,EAAO5G,EAAO8kC,GACtChB,EAAUl9B,EAAO5G,EAAO8kC,IAC1BzK,EAAOl6B,KAAKyG,MAGTyzB,EAcT,SAASiY,GAAY3+B,EAAO4+B,EAAOzO,EAAW0O,EAAUnY,GACtD,IAAIr6B,GAAS,EACTC,EAAS0T,EAAM1T,OAKnB,IAHA6jC,IAAcA,EAAY2O,IAC1BpY,IAAWA,EAAS,MAEXr6B,EAAQC,GAAQ,CACvB,IAAI2G,EAAQ+M,EAAM3T,GACduyC,EAAQ,GAAKzO,EAAUl9B,GACrB2rC,EAAQ,EAEVD,GAAY1rC,EAAO2rC,EAAQ,EAAGzO,EAAW0O,EAAUnY,GAEnDiK,GAAUjK,EAAQzzB,GAEV4rC,IACVnY,EAAOA,EAAOp6B,QAAU2G,GAG5B,OAAOyzB,EAcT,IAAIqY,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASX,GAAWxM,EAAQ/B,GAC1B,OAAO+B,GAAUkN,GAAQlN,EAAQ/B,EAAUtzB,IAW7C,SAAS+hC,GAAgB1M,EAAQ/B,GAC/B,OAAO+B,GAAUoN,GAAapN,EAAQ/B,EAAUtzB,IAYlD,SAAS0iC,GAAcrN,EAAQ3nC,GAC7B,OAAOkmC,GAAYlmC,GAAO,SAASigB,GACjC,OAAOg1B,GAAWtN,EAAO1nB,OAY7B,SAASi1B,GAAQvN,EAAQ1d,GAMvB,IAHA,IAAI9nB,EAAQ,EACRC,GAHJ6nB,EAAOkrB,GAASlrB,EAAM0d,IAGJvlC,OAED,MAAVulC,GAAkBxlC,EAAQC,GAC/BulC,EAASA,EAAOyN,GAAMnrB,EAAK9nB,OAE7B,OAAQA,GAASA,GAASC,EAAUulC,EAASp+B,EAc/C,SAAS8rC,GAAe1N,EAAQ2N,EAAUC,GACxC,IAAI/Y,EAAS8Y,EAAS3N,GACtB,OAAOzjB,GAAQyjB,GAAUnL,EAASiK,GAAUjK,EAAQ+Y,EAAY5N,IAUlE,SAAS6N,GAAWzsC,GAClB,OAAa,MAATA,EACKA,IAAUQ,EA14FJ,qBARL,gBAo5FFiiC,IAAkBA,MAAkBn5B,GAAOtJ,GAq2FrD,SAAmBA,GACjB,IAAI0sC,EAAQ3xB,GAAe9M,KAAKjO,EAAOyiC,IACnCqG,EAAM9oC,EAAMyiC,IAEhB,IACEziC,EAAMyiC,IAAkBjiC,EACxB,IAAImsC,GAAW,EACf,MAAOtwC,IAET,IAAIo3B,EAASkO,GAAqB1zB,KAAKjO,GAQvC,OAPI2sC,IACED,EACF1sC,EAAMyiC,IAAkBqG,SAEjB9oC,EAAMyiC,KAGVhP,EAr3FHmZ,CAAU5sC,GAy4GhB,SAAwBA,GACtB,OAAO2hC,GAAqB1zB,KAAKjO,GAz4G7ByyB,CAAezyB,GAYrB,SAAS6sC,GAAO7sC,EAAOhG,GACrB,OAAOgG,EAAQhG,EAWjB,SAAS8yC,GAAQlO,EAAQ1nB,GACvB,OAAiB,MAAV0nB,GAAkB7jB,GAAe9M,KAAK2wB,EAAQ1nB,GAWvD,SAAS61B,GAAUnO,EAAQ1nB,GACzB,OAAiB,MAAV0nB,GAAkB1nB,KAAO5N,GAAOs1B,GA0BzC,SAASoO,GAAiBC,EAAQpQ,EAAUW,GAS1C,IARA,IAAInzB,EAAWmzB,EAAaD,GAAoBF,GAC5ChkC,EAAS4zC,EAAO,GAAG5zC,OACnB6zC,EAAYD,EAAO5zC,OACnB8zC,EAAWD,EACXE,EAASr/B,EAAMm/B,GACfrxC,EAAY4X,EAAAA,EACZggB,EAAS,GAEN0Z,KAAY,CACjB,IAAIpgC,EAAQkgC,EAAOE,GACfA,GAAYtQ,IACd9vB,EAAQ0wB,GAAS1wB,EAAOiyB,GAAUnC,KAEpChhC,EAAY82B,GAAU5lB,EAAM1T,OAAQwC,GACpCuxC,EAAOD,IAAa3P,IAAeX,GAAaxjC,GAAU,KAAO0T,EAAM1T,QAAU,KAC7E,IAAI8sC,GAASgH,GAAYpgC,GACzBvM,EAENuM,EAAQkgC,EAAO,GAEf,IAAI7zC,GAAS,EACT4mB,EAAOotB,EAAO,GAElBnsB,EACA,OAAS7nB,EAAQC,GAAUo6B,EAAOp6B,OAASwC,GAAW,CACpD,IAAImE,EAAQ+M,EAAM3T,GACdyxC,EAAWhO,EAAWA,EAAS78B,GAASA,EAG5C,GADAA,EAASw9B,GAAwB,IAAVx9B,EAAeA,EAAQ,IACxCggB,EACEkf,GAASlf,EAAM6qB,GACfxgC,EAASopB,EAAQoX,EAAUrN,IAC5B,CAEL,IADA2P,EAAWD,IACFC,GAAU,CACjB,IAAIhO,EAAQiO,EAAOD,GACnB,KAAMhO,EACED,GAASC,EAAO0L,GAChBxgC,EAAS4iC,EAAOE,GAAWtC,EAAUrN,IAE3C,SAASvc,EAGTjB,GACFA,EAAKzmB,KAAKsxC,GAEZpX,EAAOl6B,KAAKyG,IAGhB,OAAOyzB,EA+BT,SAAS4Z,GAAWzO,EAAQ1d,EAAM8S,GAGhC,IAAId,EAAiB,OADrB0L,EAAS0O,GAAO1O,EADhB1d,EAAOkrB,GAASlrB,EAAM0d,KAEMA,EAASA,EAAOyN,GAAMkB,GAAKrsB,KACvD,OAAe,MAARgS,EAAe1yB,EAAYgkB,GAAM0O,EAAM0L,EAAQ5K,GAUxD,SAASwZ,GAAgBxtC,GACvB,OAAO+yB,GAAa/yB,IAAUysC,GAAWzsC,IAAUs1B,EAuCrD,SAASmY,GAAYztC,EAAOhG,EAAOsuC,EAASC,EAAYC,GACtD,OAAIxoC,IAAUhG,IAGD,MAATgG,GAA0B,MAAThG,IAAmB+4B,GAAa/yB,KAAW+yB,GAAa/4B,GACpEgG,GAAUA,GAAShG,GAAUA,EAmBxC,SAAyB4kC,EAAQ5kC,EAAOsuC,EAASC,EAAYmF,EAAWlF,GACtE,IAAImF,EAAWxyB,GAAQyjB,GACnBgP,EAAWzyB,GAAQnhB,GACnB6zC,EAASF,EAAWpY,EAAWwT,GAAOnK,GACtCkP,EAASF,EAAWrY,EAAWwT,GAAO/uC,GAKtC+zC,GAHJF,EAASA,GAAUvY,EAAUS,EAAY8X,IAGhB9X,EACrBiY,GAHJF,EAASA,GAAUxY,EAAUS,EAAY+X,IAGhB/X,EACrBkY,EAAYJ,GAAUC,EAE1B,GAAIG,GAAa7K,GAASxE,GAAS,CACjC,IAAKwE,GAASppC,GACZ,OAAO,EAET2zC,GAAW,EACXI,GAAW,EAEb,GAAIE,IAAcF,EAEhB,OADAvF,IAAUA,EAAQ,IAAInC,IACdsH,GAAYjR,GAAakC,GAC7BsP,GAAYtP,EAAQ5kC,EAAOsuC,EAASC,EAAYmF,EAAWlF,GAy0EnE,SAAoB5J,EAAQ5kC,EAAO8uC,EAAKR,EAASC,EAAYmF,EAAWlF,GACtE,OAAQM,GACN,KAAKvS,EACH,GAAKqI,EAAOkL,YAAc9vC,EAAM8vC,YAC3BlL,EAAOiL,YAAc7vC,EAAM6vC,WAC9B,OAAO,EAETjL,EAASA,EAAOhqB,OAChB5a,EAAQA,EAAM4a,OAEhB,KAAK0hB,EACH,QAAKsI,EAAOkL,YAAc9vC,EAAM8vC,aAC3B4D,EAAU,IAAI1L,GAAWpD,GAAS,IAAIoD,GAAWhoC,KAKxD,KAAKw7B,EACL,KAAKC,EACL,KAAKK,EAGH,OAAOyR,IAAI3I,GAAS5kC,GAEtB,KAAK07B,EACH,OAAOkJ,EAAO/mC,MAAQmC,EAAMnC,MAAQ+mC,EAAOxwB,SAAWpU,EAAMoU,QAE9D,KAAK6nB,EACL,KAAKE,EAIH,OAAOyI,GAAW5kC,EAAQ,GAE5B,KAAK67B,EACH,IAAIsY,EAAUnO,GAEhB,KAAK9J,EACH,IAAIkY,EA1jLe,EA0jLH9F,EAGhB,GAFA6F,IAAYA,EAAU9N,IAElBzB,EAAOrwB,MAAQvU,EAAMuU,OAAS6/B,EAChC,OAAO,EAGT,IAAIhE,EAAU5B,EAAMviC,IAAI24B,GACxB,GAAIwL,EACF,OAAOA,GAAWpwC,EAEpBsuC,GApkLqB,EAukLrBE,EAAM5jB,IAAIga,EAAQ5kC,GAClB,IAAIy5B,EAASya,GAAYC,EAAQvP,GAASuP,EAAQn0C,GAAQsuC,EAASC,EAAYmF,EAAWlF,GAE1F,OADAA,EAAc,OAAE5J,GACTnL,EAET,KAAK2C,EACH,GAAIsO,GACF,OAAOA,GAAcz2B,KAAK2wB,IAAW8F,GAAcz2B,KAAKjU,GAG9D,OAAO,EAt4EDq0C,CAAWzP,EAAQ5kC,EAAO6zC,EAAQvF,EAASC,EAAYmF,EAAWlF,GAExE,KA9sGuB,EA8sGjBF,GAAiC,CACrC,IAAIgG,EAAeP,GAAYhzB,GAAe9M,KAAK2wB,EAAQ,eACvD2P,EAAeP,GAAYjzB,GAAe9M,KAAKjU,EAAO,eAE1D,GAAIs0C,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAe1P,EAAO5+B,QAAU4+B,EAC/C6P,EAAeF,EAAev0C,EAAMgG,QAAUhG,EAGlD,OADAwuC,IAAUA,EAAQ,IAAInC,IACfqH,EAAUc,EAAcC,EAAcnG,EAASC,EAAYC,IAGtE,QAAKyF,IAGLzF,IAAUA,EAAQ,IAAInC,IAq4ExB,SAAsBzH,EAAQ5kC,EAAOsuC,EAASC,EAAYmF,EAAWlF,GACnE,IAAI4F,EAnmLmB,EAmmLP9F,EACZoG,EAAWnE,GAAW3L,GACtB+P,EAAYD,EAASr1C,OAIzB,GAAIs1C,GAHWpE,GAAWvwC,GACDX,SAEM+0C,EAC7B,OAAO,EAGT,IADA,IAAIh1C,EAAQu1C,EACLv1C,KAAS,CACd,IAAI8d,EAAMw3B,EAASt1C,GACnB,KAAMg1C,EAAYl3B,KAAOld,EAAQ+gB,GAAe9M,KAAKjU,EAAOkd,IAC1D,OAAO,EAIX,IAAIkzB,EAAU5B,EAAMviC,IAAI24B,GACxB,GAAIwL,GAAW5B,EAAMviC,IAAIjM,GACvB,OAAOowC,GAAWpwC,EAEpB,IAAIy5B,GAAS,EACb+U,EAAM5jB,IAAIga,EAAQ5kC,GAClBwuC,EAAM5jB,IAAI5qB,EAAO4kC,GAGjB,IADA,IAAIgQ,EAAWR,IACNh1C,EAAQu1C,GAAW,CAE1B,IAAIjH,EAAW9I,EADf1nB,EAAMw3B,EAASt1C,IAEXy1C,EAAW70C,EAAMkd,GAErB,GAAIqxB,EACF,IAAIuG,EAAWV,EACX7F,EAAWsG,EAAUnH,EAAUxwB,EAAKld,EAAO4kC,EAAQ4J,GACnDD,EAAWb,EAAUmH,EAAU33B,EAAK0nB,EAAQ5kC,EAAOwuC,GAGzD,KAAMsG,IAAatuC,EACVknC,IAAamH,GAAYnB,EAAUhG,EAAUmH,EAAUvG,EAASC,EAAYC,GAC7EsG,GACD,CACLrb,GAAS,EACT,MAEFmb,IAAaA,EAAkB,eAAP13B,GAE1B,GAAIuc,IAAWmb,EAAU,CACvB,IAAIG,EAAUnQ,EAAOz/B,YACjB6vC,EAAUh1C,EAAMmF,YAGhB4vC,GAAWC,KACV,gBAAiBpQ,MAAU,gBAAiB5kC,IACzB,mBAAX+0C,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvDvb,GAAS,GAKb,OAFA+U,EAAc,OAAE5J,GAChB4J,EAAc,OAAExuC,GACTy5B,EAj8EAwb,CAAarQ,EAAQ5kC,EAAOsuC,EAASC,EAAYmF,EAAWlF,IA3D5D0G,CAAgBlvC,EAAOhG,EAAOsuC,EAASC,EAAYkF,GAAajF,IAmFzE,SAAS2G,GAAYvQ,EAAQ1vB,EAAQkgC,EAAW7G,GAC9C,IAAInvC,EAAQg2C,EAAU/1C,OAClBA,EAASD,EACTi2C,GAAgB9G,EAEpB,GAAc,MAAV3J,EACF,OAAQvlC,EAGV,IADAulC,EAASt1B,GAAOs1B,GACTxlC,KAAS,CACd,IAAIsb,EAAO06B,EAAUh2C,GACrB,GAAKi2C,GAAgB36B,EAAK,GAClBA,EAAK,KAAOkqB,EAAOlqB,EAAK,MACtBA,EAAK,KAAMkqB,GAEnB,OAAO,EAGX,OAASxlC,EAAQC,GAAQ,CAEvB,IAAI6d,GADJxC,EAAO06B,EAAUh2C,IACF,GACXsuC,EAAW9I,EAAO1nB,GAClBo4B,EAAW56B,EAAK,GAEpB,GAAI26B,GAAgB36B,EAAK,IACvB,GAAIgzB,IAAalnC,KAAe0W,KAAO0nB,GACrC,OAAO,MAEJ,CACL,IAAI4J,EAAQ,IAAInC,GAChB,GAAIkC,EACF,IAAI9U,EAAS8U,EAAWb,EAAU4H,EAAUp4B,EAAK0nB,EAAQ1vB,EAAQs5B,GAEnE,KAAM/U,IAAWjzB,EACTitC,GAAY6B,EAAU5H,EAAU6H,EAA+ChH,EAAYC,GAC3F/U,GAEN,OAAO,GAIb,OAAO,EAWT,SAAS+b,GAAaxvC,GACpB,SAAK6yB,GAAS7yB,KAo4FEkzB,EAp4FiBlzB,EAq4FxBwhC,IAAeA,MAActO,MAl4FxBgZ,GAAWlsC,GAAS8hC,GAAarJ,IAChCl2B,KAAK6hC,GAASpkC,IAg4F/B,IAAkBkzB,EAp1FlB,SAASuc,GAAazvC,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACK0vC,GAEW,iBAAT1vC,EACFmb,GAAQnb,GACX2vC,GAAoB3vC,EAAM,GAAIA,EAAM,IACpC4vC,GAAY5vC,GAEX6vC,GAAS7vC,GAUlB,SAAS8vC,GAASlR,GAChB,IAAKmR,GAAYnR,GACf,OAAO4E,GAAW5E,GAEpB,IAAInL,EAAS,GACb,IAAK,IAAIvc,KAAO5N,GAAOs1B,GACjB7jB,GAAe9M,KAAK2wB,EAAQ1nB,IAAe,eAAPA,GACtCuc,EAAOl6B,KAAK2d,GAGhB,OAAOuc,EAkCT,SAASuc,GAAOhwC,EAAOhG,GACrB,OAAOgG,EAAQhG,EAWjB,SAASi2C,GAAQ/R,EAAYrB,GAC3B,IAAIzjC,GAAS,EACTq6B,EAASyc,GAAYhS,GAAcnwB,EAAMmwB,EAAW7kC,QAAU,GAKlE,OAHAwuC,GAAS3J,GAAY,SAASl+B,EAAOkX,EAAKgnB,GACxCzK,IAASr6B,GAASyjC,EAAS78B,EAAOkX,EAAKgnB,MAElCzK,EAUT,SAASmc,GAAY1gC,GACnB,IAAIkgC,EAAYe,GAAajhC,GAC7B,OAAwB,GAApBkgC,EAAU/1C,QAAe+1C,EAAU,GAAG,GACjCgB,GAAwBhB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASxQ,GACd,OAAOA,IAAW1vB,GAAUigC,GAAYvQ,EAAQ1vB,EAAQkgC,IAY5D,SAASO,GAAoBzuB,EAAMouB,GACjC,OAAIe,GAAMnvB,IAASovB,GAAmBhB,GAC7Bc,GAAwB/D,GAAMnrB,GAAOouB,GAEvC,SAAS1Q,GACd,IAAI8I,EAAWzhC,GAAI24B,EAAQ1d,GAC3B,OAAQwmB,IAAalnC,GAAaknC,IAAa4H,EAC3CiB,GAAM3R,EAAQ1d,GACdusB,GAAY6B,EAAU5H,EAAU6H,IAexC,SAASiB,GAAU5R,EAAQ1vB,EAAQuhC,EAAUlI,EAAYC,GACnD5J,IAAW1vB,GAGf48B,GAAQ58B,GAAQ,SAASogC,EAAUp4B,GAEjC,GADAsxB,IAAUA,EAAQ,IAAInC,IAClBxT,GAASyc,IA+BjB,SAAuB1Q,EAAQ1vB,EAAQgI,EAAKu5B,EAAUC,EAAWnI,EAAYC,GAC3E,IAAId,EAAWiJ,GAAQ/R,EAAQ1nB,GAC3Bo4B,EAAWqB,GAAQzhC,EAAQgI,GAC3BkzB,EAAU5B,EAAMviC,IAAIqpC,GAExB,GAAIlF,EACF9C,GAAiB1I,EAAQ1nB,EAAKkzB,OADhC,CAIA,IAAIvoC,EAAW0mC,EACXA,EAAWb,EAAU4H,EAAWp4B,EAAM,GAAK0nB,EAAQ1vB,EAAQs5B,GAC3DhoC,EAEAmqC,EAAW9oC,IAAarB,EAE5B,GAAImqC,EAAU,CACZ,IAAInE,EAAQrrB,GAAQm0B,GAChB3I,GAAUH,GAASpD,GAASkM,GAC5BsB,GAAWpK,IAAUG,GAAUjK,GAAa4S,GAEhDztC,EAAWytC,EACP9I,GAASG,GAAUiK,EACjBz1B,GAAQusB,GACV7lC,EAAW6lC,EAEJmJ,GAAkBnJ,GACzB7lC,EAAWslC,GAAUO,GAEdf,GACPgE,GAAW,EACX9oC,EAAWonC,GAAYqG,GAAU,IAE1BsB,GACPjG,GAAW,EACX9oC,EAAWmoC,GAAgBsF,GAAU,IAGrCztC,EAAW,GAGNivC,GAAcxB,IAAa5I,GAAY4I,IAC9CztC,EAAW6lC,EACPhB,GAAYgB,GACd7lC,EAAWkvC,GAAcrJ,GAEjB7U,GAAS6U,KAAawE,GAAWxE,KACzC7lC,EAAWqnC,GAAgBoG,KAI7B3E,GAAW,EAGXA,IAEFnC,EAAM5jB,IAAI0qB,EAAUztC,GACpB6uC,EAAU7uC,EAAUytC,EAAUmB,EAAUlI,EAAYC,GACpDA,EAAc,OAAE8G,IAElBhI,GAAiB1I,EAAQ1nB,EAAKrV,IAzF1BmvC,CAAcpS,EAAQ1vB,EAAQgI,EAAKu5B,EAAUD,GAAWjI,EAAYC,OAEjE,CACH,IAAI3mC,EAAW0mC,EACXA,EAAWoI,GAAQ/R,EAAQ1nB,GAAMo4B,EAAWp4B,EAAM,GAAK0nB,EAAQ1vB,EAAQs5B,GACvEhoC,EAEAqB,IAAarB,IACfqB,EAAWytC,GAEbhI,GAAiB1I,EAAQ1nB,EAAKrV,MAE/BwnC,IAwFL,SAAS4H,GAAQlkC,EAAO1D,GACtB,IAAIhQ,EAAS0T,EAAM1T,OACnB,GAAKA,EAIL,OAAOytC,GADPz9B,GAAKA,EAAI,EAAIhQ,EAAS,EACJA,GAAU0T,EAAM1D,GAAK7I,EAYzC,SAAS0wC,GAAYhT,EAAYiT,EAAWC,GAC1C,IAAIh4C,GAAS,EACb+3C,EAAY1T,GAAS0T,EAAU93C,OAAS83C,EAAY,CAACzB,IAAW1Q,GAAUqS,OAE1E,IAAI5d,EAASwc,GAAQ/R,GAAY,SAASl+B,EAAOkX,EAAKgnB,GACpD,IAAIoT,EAAW7T,GAAS0T,GAAW,SAAStU,GAC1C,OAAOA,EAAS78B,MAElB,MAAO,CAAE,SAAYsxC,EAAU,QAAWl4C,EAAO,MAAS4G,MAG5D,OAnvFJ,SAAoB+M,EAAOwkC,GACzB,IAAIl4C,EAAS0T,EAAM1T,OAGnB,IADA0T,EAAMykC,MAgvFsB,SAAS5S,EAAQ5kC,GACzC,OAm4BJ,SAAyB4kC,EAAQ5kC,EAAOo3C,GAOtC,IANA,IAAIh4C,GAAS,EACTq4C,EAAc7S,EAAO0S,SACrBI,EAAc13C,EAAMs3C,SACpBj4C,EAASo4C,EAAYp4C,OACrBs4C,EAAeP,EAAO/3C,SAEjBD,EAAQC,GAAQ,CACvB,IAAIo6B,EAASme,GAAiBH,EAAYr4C,GAAQs4C,EAAYt4C,IAC9D,GAAIq6B,EACF,OAAIr6B,GAASu4C,EACJle,EAGFA,GAAmB,QADd2d,EAAOh4C,IACiB,EAAI,GAU5C,OAAOwlC,EAAOxlC,MAAQY,EAAMZ,MA35BnBy4C,CAAgBjT,EAAQ5kC,EAAOo3C,MAhvFnC/3C,KACL0T,EAAM1T,GAAU0T,EAAM1T,GAAQ2G,MAEhC,OAAO+M,EA4uFE+kC,CAAWre,GA6BpB,SAASse,GAAWnT,EAAQxd,EAAO8b,GAKjC,IAJA,IAAI9jC,GAAS,EACTC,EAAS+nB,EAAM/nB,OACfo6B,EAAS,KAEJr6B,EAAQC,GAAQ,CACvB,IAAI6nB,EAAOE,EAAMhoB,GACb4G,EAAQmsC,GAAQvN,EAAQ1d,GAExBgc,EAAUl9B,EAAOkhB,IACnB8wB,GAAQve,EAAQ2Y,GAASlrB,EAAM0d,GAAS5+B,GAG5C,OAAOyzB,EA2BT,SAASwe,GAAYllC,EAAOC,EAAQ6vB,EAAUW,GAC5C,IAAI9Y,EAAU8Y,EAAaiB,GAAkBnB,GACzClkC,GAAS,EACTC,EAAS2T,EAAO3T,OAChB2mB,EAAOjT,EAQX,IANIA,IAAUC,IACZA,EAASm6B,GAAUn6B,IAEjB6vB,IACF7c,EAAOyd,GAAS1wB,EAAOiyB,GAAUnC,OAE1BzjC,EAAQC,GAKf,IAJA,IAAIglC,EAAY,EACZr+B,EAAQgN,EAAO5T,GACfyxC,EAAWhO,EAAWA,EAAS78B,GAASA,GAEpCq+B,EAAY3Z,EAAQ1E,EAAM6qB,EAAUxM,EAAWb,KAAgB,GACjExd,IAASjT,GACXs1B,GAAOp0B,KAAK+R,EAAMqe,EAAW,GAE/BgE,GAAOp0B,KAAKlB,EAAOsxB,EAAW,GAGlC,OAAOtxB,EAYT,SAASmlC,GAAWnlC,EAAOolC,GAIzB,IAHA,IAAI94C,EAAS0T,EAAQolC,EAAQ94C,OAAS,EAClCmnC,EAAYnnC,EAAS,EAElBA,KAAU,CACf,IAAID,EAAQ+4C,EAAQ94C,GACpB,GAAIA,GAAUmnC,GAAapnC,IAAU0d,EAAU,CAC7C,IAAIA,EAAW1d,EACX0tC,GAAQ1tC,GACVipC,GAAOp0B,KAAKlB,EAAO3T,EAAO,GAE1Bg5C,GAAUrlC,EAAO3T,IAIvB,OAAO2T,EAYT,SAASi6B,GAAWmB,EAAOC,GACzB,OAAOD,EAAQlF,GAAYU,MAAkByE,EAAQD,EAAQ,IAkC/D,SAASkK,GAAWtS,EAAQ12B,GAC1B,IAAIoqB,EAAS,GACb,IAAKsM,GAAU12B,EAAI,GAAKA,EAAI6rB,EAC1B,OAAOzB,EAIT,GACMpqB,EAAI,IACNoqB,GAAUsM,IAEZ12B,EAAI45B,GAAY55B,EAAI,MAElB02B,GAAUA,SAEL12B,GAET,OAAOoqB,EAWT,SAAS6e,GAASpf,EAAMrzB,GACtB,OAAO0yC,GAAYC,GAAStf,EAAMrzB,EAAO6vC,IAAWxc,EAAO,IAU7D,SAASuf,GAAWvU,GAClB,OAAO6I,GAAY/5B,GAAOkxB,IAW5B,SAASwU,GAAexU,EAAY70B,GAClC,IAAI0D,EAAQC,GAAOkxB,GACnB,OAAOgJ,GAAYn6B,EAAOq6B,GAAU/9B,EAAG,EAAG0D,EAAM1T,SAalD,SAAS24C,GAAQpT,EAAQ1d,EAAMlhB,EAAOuoC,GACpC,IAAK1V,GAAS+L,GACZ,OAAOA,EAST,IALA,IAAIxlC,GAAS,EACTC,GAHJ6nB,EAAOkrB,GAASlrB,EAAM0d,IAGJvlC,OACdmnC,EAAYnnC,EAAS,EACrBs5C,EAAS/T,EAEI,MAAV+T,KAAoBv5C,EAAQC,GAAQ,CACzC,IAAI6d,EAAMm1B,GAAMnrB,EAAK9nB,IACjByI,EAAW7B,EAEf,GAAI5G,GAASonC,EAAW,CACtB,IAAIkH,EAAWiL,EAAOz7B,IACtBrV,EAAW0mC,EAAaA,EAAWb,EAAUxwB,EAAKy7B,GAAUnyC,KAC3CA,IACfqB,EAAWgxB,GAAS6U,GAChBA,EACCZ,GAAQ5lB,EAAK9nB,EAAQ,IAAM,GAAK,IAGzCquC,GAAYkL,EAAQz7B,EAAKrV,GACzB8wC,EAASA,EAAOz7B,GAElB,OAAO0nB,EAWT,IAAIgU,GAAe3O,GAAqB,SAAS/Q,EAAMxe,GAErD,OADAuvB,GAAQrf,IAAIsO,EAAMxe,GACXwe,GAFoBwc,GAazBmD,GAAmB1tB,GAA4B,SAAS+N,EAAM6M,GAChE,OAAO5a,GAAe+N,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAAS4f,GAAS/S,GAClB,UAAY,KALwB2P,GAgBxC,SAASqD,GAAY7U,GACnB,OAAOgJ,GAAYl6B,GAAOkxB,IAY5B,SAAS8U,GAAUjmC,EAAOlN,EAAOC,GAC/B,IAAI1G,GAAS,EACTC,EAAS0T,EAAM1T,OAEfwG,EAAQ,IACVA,GAASA,EAAQxG,EAAS,EAAKA,EAASwG,IAE1CC,EAAMA,EAAMzG,EAASA,EAASyG,GACpB,IACRA,GAAOzG,GAETA,EAASwG,EAAQC,EAAM,EAAMA,EAAMD,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAI4zB,EAAS1lB,EAAM1U,KACVD,EAAQC,GACfo6B,EAAOr6B,GAAS2T,EAAM3T,EAAQyG,GAEhC,OAAO4zB,EAYT,SAASwf,GAAS/U,EAAYhB,GAC5B,IAAIzJ,EAMJ,OAJAoU,GAAS3J,GAAY,SAASl+B,EAAO5G,EAAO8kC,GAE1C,QADAzK,EAASyJ,EAAUl9B,EAAO5G,EAAO8kC,SAG1BzK,EAeX,SAASyf,GAAgBnmC,EAAO/M,EAAOmzC,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAATtmC,EAAgBqmC,EAAMrmC,EAAM1T,OAEvC,GAAoB,iBAAT2G,GAAqBA,GAAUA,GAASqzC,GAz7H3Bje,WAy7H0D,CAChF,KAAOge,EAAMC,GAAM,CACjB,IAAIC,EAAOF,EAAMC,IAAU,EACvBxI,EAAW99B,EAAMumC,GAEJ,OAAbzI,IAAsB7X,GAAS6X,KAC9BsI,EAActI,GAAY7qC,EAAU6qC,EAAW7qC,GAClDozC,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAOD,EAET,OAAOE,GAAkBxmC,EAAO/M,EAAO0vC,GAAUyD,GAgBnD,SAASI,GAAkBxmC,EAAO/M,EAAO68B,EAAUsW,GACjDnzC,EAAQ68B,EAAS78B,GASjB,IAPA,IAAIozC,EAAM,EACNC,EAAgB,MAATtmC,EAAgB,EAAIA,EAAM1T,OACjCm6C,EAAWxzC,GAAUA,EACrByzC,EAAsB,OAAVzzC,EACZ0zC,EAAc1gB,GAAShzB,GACvB2zC,EAAiB3zC,IAAUQ,EAExB4yC,EAAMC,GAAM,CACjB,IAAIC,EAAMrQ,IAAamQ,EAAMC,GAAQ,GACjCxI,EAAWhO,EAAS9vB,EAAMumC,IAC1BM,EAAe/I,IAAarqC,EAC5BqzC,EAAyB,OAAbhJ,EACZiJ,EAAiBjJ,GAAaA,EAC9BkJ,EAAc/gB,GAAS6X,GAE3B,GAAI2I,EACF,IAAIQ,EAASb,GAAcW,OAE3BE,EADSL,EACAG,IAAmBX,GAAcS,GACjCH,EACAK,GAAkBF,IAAiBT,IAAeU,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcV,IAAeY,IAChEF,IAAaE,IAGbZ,EAActI,GAAY7qC,EAAU6qC,EAAW7qC,GAEtDg0C,EACFZ,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAO3gB,GAAU0gB,EA7/HCje,YAygIpB,SAAS6e,GAAelnC,EAAO8vB,GAM7B,IALA,IAAIzjC,GAAS,EACTC,EAAS0T,EAAM1T,OACf+jC,EAAW,EACX3J,EAAS,KAEJr6B,EAAQC,GAAQ,CACvB,IAAI2G,EAAQ+M,EAAM3T,GACdyxC,EAAWhO,EAAWA,EAAS78B,GAASA,EAE5C,IAAK5G,IAAUmuC,GAAGsD,EAAU7qB,GAAO,CACjC,IAAIA,EAAO6qB,EACXpX,EAAO2J,KAAwB,IAAVp9B,EAAc,EAAIA,GAG3C,OAAOyzB,EAWT,SAASygB,GAAal0C,GACpB,MAAoB,iBAATA,EACFA,EAELgzB,GAAShzB,GACJm1B,GAEDn1B,EAWV,SAASm0C,GAAan0C,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAImb,GAAQnb,GAEV,OAAOy9B,GAASz9B,EAAOm0C,IAAgB,GAEzC,GAAInhB,GAAShzB,GACX,OAAO2kC,GAAiBA,GAAe12B,KAAKjO,GAAS,GAEvD,IAAIyzB,EAAUzzB,EAAQ,GACtB,MAAkB,KAAVyzB,GAAkB,EAAIzzB,IAAU,IAAa,KAAOyzB,EAY9D,SAAS2gB,GAASrnC,EAAO8vB,EAAUW,GACjC,IAAIpkC,GAAS,EACTiR,EAAWgzB,GACXhkC,EAAS0T,EAAM1T,OACfsxC,GAAW,EACXlX,EAAS,GACTzT,EAAOyT,EAEX,GAAI+J,EACFmN,GAAW,EACXtgC,EAAWkzB,QAER,GAAIlkC,GAnpIU,IAmpIkB,CACnC,IAAIurB,EAAMiY,EAAW,KAAOwX,GAAUtnC,GACtC,GAAI6X,EACF,OAAOyb,GAAWzb,GAEpB+lB,GAAW,EACXtgC,EAAW60B,GACXlf,EAAO,IAAImmB,QAGXnmB,EAAO6c,EAAW,GAAKpJ,EAEzBxS,EACA,OAAS7nB,EAAQC,GAAQ,CACvB,IAAI2G,EAAQ+M,EAAM3T,GACdyxC,EAAWhO,EAAWA,EAAS78B,GAASA,EAG5C,GADAA,EAASw9B,GAAwB,IAAVx9B,EAAeA,EAAQ,EAC1C2qC,GAAYE,GAAaA,EAAU,CAErC,IADA,IAAIyJ,EAAYt0B,EAAK3mB,OACdi7C,KACL,GAAIt0B,EAAKs0B,KAAezJ,EACtB,SAAS5pB,EAGT4b,GACF7c,EAAKzmB,KAAKsxC,GAEZpX,EAAOl6B,KAAKyG,QAEJqK,EAAS2V,EAAM6qB,EAAUrN,KAC7Bxd,IAASyT,GACXzT,EAAKzmB,KAAKsxC,GAEZpX,EAAOl6B,KAAKyG,IAGhB,OAAOyzB,EAWT,SAAS2e,GAAUxT,EAAQ1d,GAGzB,OAAiB,OADjB0d,EAAS0O,GAAO1O,EADhB1d,EAAOkrB,GAASlrB,EAAM0d,aAEUA,EAAOyN,GAAMkB,GAAKrsB,KAapD,SAASqzB,GAAW3V,EAAQ1d,EAAMszB,EAASjM,GACzC,OAAOyJ,GAAQpT,EAAQ1d,EAAMszB,EAAQrI,GAAQvN,EAAQ1d,IAAQqnB,GAc/D,SAASkM,GAAU1nC,EAAOmwB,EAAWwX,EAAQpW,GAI3C,IAHA,IAAIjlC,EAAS0T,EAAM1T,OACfD,EAAQklC,EAAYjlC,GAAU,GAE1BilC,EAAYllC,MAAYA,EAAQC,IACtC6jC,EAAUnwB,EAAM3T,GAAQA,EAAO2T,KAEjC,OAAO2nC,EACH1B,GAAUjmC,EAAQuxB,EAAY,EAAIllC,EAASklC,EAAYllC,EAAQ,EAAIC,GACnE25C,GAAUjmC,EAAQuxB,EAAYllC,EAAQ,EAAI,EAAKklC,EAAYjlC,EAASD,GAa1E,SAASu7C,GAAiB30C,EAAO40C,GAC/B,IAAInhB,EAASzzB,EAIb,OAHIyzB,aAAkBoR,KACpBpR,EAASA,EAAOzzB,SAEX29B,GAAYiX,GAAS,SAASnhB,EAAQohB,GAC3C,OAAOA,EAAO3hB,KAAK1O,MAAMqwB,EAAO5gB,QAASyJ,GAAU,CAACjK,GAASohB,EAAO7gB,SACnEP,GAaL,SAASqhB,GAAQ7H,EAAQpQ,EAAUW,GACjC,IAAInkC,EAAS4zC,EAAO5zC,OACpB,GAAIA,EAAS,EACX,OAAOA,EAAS+6C,GAASnH,EAAO,IAAM,GAKxC,IAHA,IAAI7zC,GAAS,EACTq6B,EAAS1lB,EAAM1U,KAEVD,EAAQC,GAIf,IAHA,IAAI0T,EAAQkgC,EAAO7zC,GACf+zC,GAAY,IAEPA,EAAW9zC,GACd8zC,GAAY/zC,IACdq6B,EAAOr6B,GAASsxC,GAAejX,EAAOr6B,IAAU2T,EAAOkgC,EAAOE,GAAWtQ,EAAUW,IAIzF,OAAO4W,GAAS1I,GAAYjY,EAAQ,GAAIoJ,EAAUW,GAYpD,SAASuX,GAAc99C,EAAO+V,EAAQgoC,GAMpC,IALA,IAAI57C,GAAS,EACTC,EAASpC,EAAMoC,OACf47C,EAAajoC,EAAO3T,OACpBo6B,EAAS,KAEJr6B,EAAQC,GAAQ,CACvB,IAAI2G,EAAQ5G,EAAQ67C,EAAajoC,EAAO5T,GAASoH,EACjDw0C,EAAWvhB,EAAQx8B,EAAMmC,GAAQ4G,GAEnC,OAAOyzB,EAUT,SAASyhB,GAAoBl1C,GAC3B,OAAO6wC,GAAkB7wC,GAASA,EAAQ,GAU5C,SAASm1C,GAAan1C,GACpB,MAAuB,mBAATA,EAAsBA,EAAQ0vC,GAW9C,SAAStD,GAASpsC,EAAO4+B,GACvB,OAAIzjB,GAAQnb,GACHA,EAEFqwC,GAAMrwC,EAAO4+B,GAAU,CAAC5+B,GAASo1C,GAAa1kC,GAAS1Q,IAYhE,IAAIq1C,GAAW/C,GAWf,SAASgD,GAAUvoC,EAAOlN,EAAOC,GAC/B,IAAIzG,EAAS0T,EAAM1T,OAEnB,OADAyG,EAAMA,IAAQU,EAAYnH,EAASyG,GAC1BD,GAASC,GAAOzG,EAAU0T,EAAQimC,GAAUjmC,EAAOlN,EAAOC,GASrE,IAAIuV,GAAeutB,IAAmB,SAASr2B,GAC7C,OAAOpU,GAAKkd,aAAa9I,IAW3B,SAAS08B,GAAYr0B,EAAQ6zB,GAC3B,GAAIA,EACF,OAAO7zB,EAAO7Z,QAEhB,IAAI1B,EAASub,EAAOvb,OAChBo6B,EAASwO,GAAcA,GAAY5oC,GAAU,IAAIub,EAAOzV,YAAY9F,GAGxE,OADAub,EAAO0J,KAAKmV,GACLA,EAUT,SAASkW,GAAiB4L,GACxB,IAAI9hB,EAAS,IAAI8hB,EAAYp2C,YAAYo2C,EAAYzL,YAErD,OADA,IAAI9H,GAAWvO,GAAQ7O,IAAI,IAAIod,GAAWuT,IACnC9hB,EAgDT,SAASuW,GAAgBwL,EAAY/M,GACnC,IAAI7zB,EAAS6zB,EAASkB,GAAiB6L,EAAW5gC,QAAU4gC,EAAW5gC,OACvE,OAAO,IAAI4gC,EAAWr2C,YAAYyV,EAAQ4gC,EAAW3L,WAAY2L,EAAWn8C,QAW9E,SAASu4C,GAAiB5xC,EAAOhG,GAC/B,GAAIgG,IAAUhG,EAAO,CACnB,IAAIy7C,EAAez1C,IAAUQ,EACzBizC,EAAsB,OAAVzzC,EACZ01C,EAAiB11C,GAAUA,EAC3B0zC,EAAc1gB,GAAShzB,GAEvB4zC,EAAe55C,IAAUwG,EACzBqzC,EAAsB,OAAV75C,EACZ85C,EAAiB95C,GAAUA,EAC3B+5C,EAAc/gB,GAASh5B,GAE3B,IAAM65C,IAAcE,IAAgBL,GAAe1zC,EAAQhG,GACtD05C,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5B2B,GAAgB3B,IACjB4B,EACH,OAAO,EAET,IAAMjC,IAAcC,IAAgBK,GAAe/zC,EAAQhG,GACtD+5C,GAAe0B,GAAgBC,IAAmBjC,IAAcC,GAChEG,GAAa4B,GAAgBC,IAC5B9B,GAAgB8B,IACjB5B,EACH,OAAQ,EAGZ,OAAO,EAuDT,SAAS6B,GAAY3hB,EAAM4hB,EAAUC,EAASC,GAU5C,IATA,IAAIC,GAAa,EACbC,EAAahiB,EAAK36B,OAClB48C,EAAgBJ,EAAQx8C,OACxB68C,GAAa,EACbC,EAAaP,EAASv8C,OACtB+8C,EAAc1jB,GAAUsjB,EAAaC,EAAe,GACpDxiB,EAAS1lB,EAAMooC,EAAaC,GAC5BC,GAAeP,IAEVI,EAAYC,GACnB1iB,EAAOyiB,GAAaN,EAASM,GAE/B,OAASH,EAAYE,IACfI,GAAeN,EAAYC,KAC7BviB,EAAOoiB,EAAQE,IAAc/hB,EAAK+hB,IAGtC,KAAOK,KACL3iB,EAAOyiB,KAAeliB,EAAK+hB,KAE7B,OAAOtiB,EAcT,SAAS6iB,GAAiBtiB,EAAM4hB,EAAUC,EAASC,GAWjD,IAVA,IAAIC,GAAa,EACbC,EAAahiB,EAAK36B,OAClBk9C,GAAgB,EAChBN,EAAgBJ,EAAQx8C,OACxBm9C,GAAc,EACdC,EAAcb,EAASv8C,OACvB+8C,EAAc1jB,GAAUsjB,EAAaC,EAAe,GACpDxiB,EAAS1lB,EAAMqoC,EAAcK,GAC7BJ,GAAeP,IAEVC,EAAYK,GACnB3iB,EAAOsiB,GAAa/hB,EAAK+hB,GAG3B,IADA,IAAIz6B,EAASy6B,IACJS,EAAaC,GACpBhjB,EAAOnY,EAASk7B,GAAcZ,EAASY,GAEzC,OAASD,EAAeN,IAClBI,GAAeN,EAAYC,KAC7BviB,EAAOnY,EAASu6B,EAAQU,IAAiBviB,EAAK+hB,MAGlD,OAAOtiB,EAWT,SAAS0T,GAAUj4B,EAAQnC,GACzB,IAAI3T,GAAS,EACTC,EAAS6V,EAAO7V,OAGpB,IADA0T,IAAUA,EAAQgB,EAAM1U,MACfD,EAAQC,GACf0T,EAAM3T,GAAS8V,EAAO9V,GAExB,OAAO2T,EAaT,SAASg7B,GAAW74B,EAAQjY,EAAO2nC,EAAQ2J,GACzC,IAAImO,GAAS9X,EACbA,IAAWA,EAAS,IAKpB,IAHA,IAAIxlC,GAAS,EACTC,EAASpC,EAAMoC,SAEVD,EAAQC,GAAQ,CACvB,IAAI6d,EAAMjgB,EAAMmC,GAEZyI,EAAW0mC,EACXA,EAAW3J,EAAO1nB,GAAMhI,EAAOgI,GAAMA,EAAK0nB,EAAQ1vB,GAClD1O,EAEAqB,IAAarB,IACfqB,EAAWqN,EAAOgI,IAEhBw/B,EACFlP,GAAgB5I,EAAQ1nB,EAAKrV,GAE7B4lC,GAAY7I,EAAQ1nB,EAAKrV,GAG7B,OAAO+8B,EAmCT,SAAS+X,GAAiB/Z,EAAQga,GAChC,OAAO,SAAS1Y,EAAYrB,GAC1B,IAAI3J,EAAO/X,GAAQ+iB,GAAcvB,GAAkBiL,GAC/C9K,EAAc8Z,EAAcA,IAAgB,GAEhD,OAAO1jB,EAAKgL,EAAYtB,EAAQyU,GAAYxU,EAAU,GAAIC,IAW9D,SAAS+Z,GAAeC,GACtB,OAAOxE,IAAS,SAAS1T,EAAQmY,GAC/B,IAAI39C,GAAS,EACTC,EAAS09C,EAAQ19C,OACjBkvC,EAAalvC,EAAS,EAAI09C,EAAQ19C,EAAS,GAAKmH,EAChDw2C,EAAQ39C,EAAS,EAAI09C,EAAQ,GAAKv2C,EAWtC,IATA+nC,EAAcuO,EAASz9C,OAAS,GAA0B,mBAAdkvC,GACvClvC,IAAUkvC,GACX/nC,EAEAw2C,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDzO,EAAalvC,EAAS,EAAImH,EAAY+nC,EACtClvC,EAAS,GAEXulC,EAASt1B,GAAOs1B,KACPxlC,EAAQC,GAAQ,CACvB,IAAI6V,EAAS6nC,EAAQ39C,GACjB8V,GACF4nC,EAASlY,EAAQ1vB,EAAQ9V,EAAOmvC,GAGpC,OAAO3J,KAYX,SAASuM,GAAehN,EAAUG,GAChC,OAAO,SAASJ,EAAYrB,GAC1B,GAAkB,MAAdqB,EACF,OAAOA,EAET,IAAKgS,GAAYhS,GACf,OAAOC,EAASD,EAAYrB,GAM9B,IAJA,IAAIxjC,EAAS6kC,EAAW7kC,OACpBD,EAAQklC,EAAYjlC,GAAU,EAC9B69C,EAAW5tC,GAAO40B,IAEdI,EAAYllC,MAAYA,EAAQC,KACa,IAA/CwjC,EAASqa,EAAS99C,GAAQA,EAAO89C,KAIvC,OAAOhZ,GAWX,SAAS6N,GAAczN,GACrB,OAAO,SAASM,EAAQ/B,EAAU0P,GAMhC,IALA,IAAInzC,GAAS,EACT89C,EAAW5tC,GAAOs1B,GAClB3nC,EAAQs1C,EAAS3N,GACjBvlC,EAASpC,EAAMoC,OAEZA,KAAU,CACf,IAAI6d,EAAMjgB,EAAMqnC,EAAYjlC,IAAWD,GACvC,IAA+C,IAA3CyjC,EAASqa,EAAShgC,GAAMA,EAAKggC,GAC/B,MAGJ,OAAOtY,GAgCX,SAASuY,GAAgBC,GACvB,OAAO,SAASrX,GAGd,IAAIV,EAAaS,GAFjBC,EAASrvB,GAASqvB,IAGdW,GAAcX,GACdv/B,EAEAq/B,EAAMR,EACNA,EAAW,GACXU,EAAOsX,OAAO,GAEdhkB,EAAWgM,EACXiW,GAAUjW,EAAY,GAAGpgC,KAAK,IAC9B8gC,EAAOhlC,MAAM,GAEjB,OAAO8kC,EAAIuX,KAAgB/jB,GAW/B,SAASikB,GAAiBC,GACxB,OAAO,SAASxX,GACd,OAAOpC,GAAY6Z,GAAMC,GAAO1X,GAAQj9B,QAAQ03B,GAAQ,KAAM+c,EAAU,KAY5E,SAASG,GAAWhO,GAClB,OAAO,WAIL,IAAI1V,EAAO9lB,UACX,OAAQ8lB,EAAK36B,QACX,KAAK,EAAG,OAAO,IAAIqwC,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAK1V,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAI0V,EAAK1V,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAI0V,EAAK1V,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAI0V,EAAK1V,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAI0V,EAAK1V,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAI0V,EAAK1V,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAI0V,EAAK1V,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAI2jB,EAAc3S,GAAW0E,EAAK17B,WAC9BylB,EAASiW,EAAKllB,MAAMmzB,EAAa3jB,GAIrC,OAAOnB,GAASY,GAAUA,EAASkkB,GAgDvC,SAASC,GAAWC,GAClB,OAAO,SAAS3Z,EAAYhB,EAAWmB,GACrC,IAAI6Y,EAAW5tC,GAAO40B,GACtB,IAAKgS,GAAYhS,GAAa,CAC5B,IAAIrB,EAAWwU,GAAYnU,EAAW,GACtCgB,EAAa30B,GAAK20B,GAClBhB,EAAY,SAAShmB,GAAO,OAAO2lB,EAASqa,EAAShgC,GAAMA,EAAKggC,IAElE,IAAI99C,EAAQy+C,EAAc3Z,EAAYhB,EAAWmB,GACjD,OAAOjlC,GAAS,EAAI89C,EAASra,EAAWqB,EAAW9kC,GAASA,GAASoH,GAWzE,SAASs3C,GAAWxZ,GAClB,OAAOyZ,IAAS,SAASC,GACvB,IAAI3+C,EAAS2+C,EAAM3+C,OACfD,EAAQC,EACR4+C,EAASnT,GAAc92B,UAAUkqC,KAKrC,IAHI5Z,GACF0Z,EAAMnU,UAEDzqC,KAAS,CACd,IAAI85B,EAAO8kB,EAAM5+C,GACjB,GAAmB,mBAAR85B,EACT,MAAM,IAAIvO,GAAUqN,GAEtB,GAAIimB,IAAWE,GAAgC,WAArBC,GAAYllB,GACpC,IAAIilB,EAAU,IAAIrT,GAAc,IAAI,GAIxC,IADA1rC,EAAQ++C,EAAU/+C,EAAQC,IACjBD,EAAQC,GAAQ,CAGvB,IAAIg/C,EAAWD,GAFfllB,EAAO8kB,EAAM5+C,IAGTsb,EAAmB,WAAZ2jC,EAAwBC,GAAQplB,GAAQ1yB,EAMjD23C,EAJEzjC,GAAQ6jC,GAAW7jC,EAAK,KACX,KAAXA,EAAK,KACJA,EAAK,GAAGrb,QAAqB,GAAXqb,EAAK,GAElByjC,EAAQC,GAAY1jC,EAAK,KAAK8P,MAAM2zB,EAASzjC,EAAK,IAElC,GAAfwe,EAAK75B,QAAek/C,GAAWrlB,GACtCilB,EAAQE,KACRF,EAAQD,KAAKhlB,GAGrB,OAAO,WACL,IAAIc,EAAO9lB,UACPlO,EAAQg0B,EAAK,GAEjB,GAAImkB,GAA0B,GAAfnkB,EAAK36B,QAAe8hB,GAAQnb,GACzC,OAAOm4C,EAAQK,MAAMx4C,GAAOA,QAK9B,IAHA,IAAI5G,EAAQ,EACRq6B,EAASp6B,EAAS2+C,EAAM5+C,GAAOorB,MAAMjlB,KAAMy0B,GAAQh0B,IAE9C5G,EAAQC,GACfo6B,EAASukB,EAAM5+C,GAAO6U,KAAK1O,KAAMk0B,GAEnC,OAAOA,MAwBb,SAASglB,GAAavlB,EAAMoV,EAASrU,EAAS2hB,EAAUC,EAAS6C,EAAeC,EAAcC,EAAQC,EAAKC,GACzG,IAAIC,EAAQzQ,EAAUtT,EAClBgkB,EA/+Ja,EA++JJ1Q,EACT2Q,EA/+JiB,EA++JL3Q,EACZwN,EAAsB,GAAVxN,EACZ4Q,EAz+Ja,IAy+JJ5Q,EACToB,EAAOuP,EAAYz4C,EAAYk3C,GAAWxkB,GA6C9C,OA3CA,SAASilB,IAKP,IAJA,IAAI9+C,EAAS6U,UAAU7U,OACnB26B,EAAOjmB,EAAM1U,GACbD,EAAQC,EAELD,KACL46B,EAAK56B,GAAS8U,UAAU9U,GAE1B,GAAI08C,EACF,IAAIrW,EAAc0Z,GAAUhB,GACxBiB,EAAe5Z,GAAaxL,EAAMyL,GASxC,GAPImW,IACF5hB,EAAO2hB,GAAY3hB,EAAM4hB,EAAUC,EAASC,IAE1C4C,IACF1kB,EAAOsiB,GAAiBtiB,EAAM0kB,EAAeC,EAAc7C,IAE7Dz8C,GAAU+/C,EACNtD,GAAaz8C,EAASy/C,EAAO,CAC/B,IAAIO,EAAajZ,GAAepM,EAAMyL,GACtC,OAAO6Z,GACLpmB,EAAMoV,EAASmQ,GAAcN,EAAQ1Y,YAAaxL,EAClDD,EAAMqlB,EAAYT,EAAQC,EAAKC,EAAQz/C,GAG3C,IAAIs+C,EAAcqB,EAAS/kB,EAAU10B,KACjC6Q,EAAK6oC,EAAYtB,EAAYzkB,GAAQA,EAczC,OAZA75B,EAAS26B,EAAK36B,OACVu/C,EACF5kB,EAAOulB,GAAQvlB,EAAM4kB,GACZM,GAAU7/C,EAAS,GAC5B26B,EAAK6P,UAEHkV,GAASF,EAAMx/C,IACjB26B,EAAK36B,OAASw/C,GAEZt5C,MAAQA,OAASpH,IAAQoH,gBAAgB44C,IAC3C/nC,EAAKs5B,GAAQgO,GAAWtnC,IAEnBA,EAAGoU,MAAMmzB,EAAa3jB,IAajC,SAASwlB,GAAe5c,EAAQ6c,GAC9B,OAAO,SAAS7a,EAAQ/B,GACtB,OA59DJ,SAAsB+B,EAAQhC,EAAQC,EAAUC,GAI9C,OAHAsO,GAAWxM,GAAQ,SAAS5+B,EAAOkX,EAAK0nB,GACtChC,EAAOE,EAAaD,EAAS78B,GAAQkX,EAAK0nB,MAErC9B,EAw9DE4c,CAAa9a,EAAQhC,EAAQ6c,EAAW5c,GAAW,KAY9D,SAAS8c,GAAoBC,EAAU52B,GACrC,OAAO,SAAShjB,EAAOhG,GACrB,IAAIy5B,EACJ,GAAIzzB,IAAUQ,GAAaxG,IAAUwG,EACnC,OAAOwiB,EAKT,GAHIhjB,IAAUQ,IACZizB,EAASzzB,GAEPhG,IAAUwG,EAAW,CACvB,GAAIizB,IAAWjzB,EACb,OAAOxG,EAEW,iBAATgG,GAAqC,iBAAThG,GACrCgG,EAAQm0C,GAAan0C,GACrBhG,EAAQm6C,GAAan6C,KAErBgG,EAAQk0C,GAAal0C,GACrBhG,EAAQk6C,GAAal6C,IAEvBy5B,EAASmmB,EAAS55C,EAAOhG,GAE3B,OAAOy5B,GAWX,SAASomB,GAAWC,GAClB,OAAO/B,IAAS,SAAS5G,GAEvB,OADAA,EAAY1T,GAAS0T,EAAWnS,GAAUqS,OACnCiB,IAAS,SAASte,GACvB,IAAIC,EAAU10B,KACd,OAAOu6C,EAAU3I,GAAW,SAAStU,GACnC,OAAOrY,GAAMqY,EAAU5I,EAASD,YAexC,SAAS+lB,GAAc1gD,EAAQ2gD,GAG7B,IAAIC,GAFJD,EAAQA,IAAUx5C,EAAY,IAAM2zC,GAAa6F,IAEzB3gD,OACxB,GAAI4gD,EAAc,EAChB,OAAOA,EAAc5H,GAAW2H,EAAO3gD,GAAU2gD,EAEnD,IAAIvmB,EAAS4e,GAAW2H,EAAOjX,GAAW1pC,EAASknC,GAAWyZ,KAC9D,OAAOla,GAAWka,GACd1E,GAAU5U,GAAcjN,GAAS,EAAGp6B,GAAQ4F,KAAK,IACjDw0B,EAAO14B,MAAM,EAAG1B,GA6CtB,SAAS6gD,GAAY5b,GACnB,OAAO,SAASz+B,EAAOC,EAAKq6C,GAa1B,OAZIA,GAAuB,iBAARA,GAAoBlD,GAAep3C,EAAOC,EAAKq6C,KAChEr6C,EAAMq6C,EAAO35C,GAGfX,EAAQu6C,GAASv6C,GACbC,IAAQU,GACVV,EAAMD,EACNA,EAAQ,GAERC,EAAMs6C,GAASt6C,GAr7CrB,SAAmBD,EAAOC,EAAKq6C,EAAM7b,GAKnC,IAJA,IAAIllC,GAAS,EACTC,EAASq5B,GAAUqQ,IAAYjjC,EAAMD,IAAUs6C,GAAQ,IAAK,GAC5D1mB,EAAS1lB,EAAM1U,GAEZA,KACLo6B,EAAO6K,EAAYjlC,IAAWD,GAASyG,EACvCA,GAASs6C,EAEX,OAAO1mB,EA+6CE4mB,CAAUx6C,EAAOC,EADxBq6C,EAAOA,IAAS35C,EAAaX,EAAQC,EAAM,GAAK,EAAKs6C,GAASD,GAC3B7b,IAWvC,SAASgc,GAA0BV,GACjC,OAAO,SAAS55C,EAAOhG,GAKrB,MAJsB,iBAATgG,GAAqC,iBAAThG,IACvCgG,EAAQ8yB,GAAS9yB,GACjBhG,EAAQ84B,GAAS94B,IAEZ4/C,EAAS55C,EAAOhG,IAqB3B,SAASs/C,GAAcpmB,EAAMoV,EAASiS,EAAU9a,EAAaxL,EAAS2hB,EAAUC,EAAS+C,EAAQC,EAAKC,GACpG,IAAI0B,EAxtKc,EAwtKJlS,EAMdA,GAAYkS,EAAUzlB,EA3tKI,GAJF,GAguKxBuT,KAAakS,EA5tKa,GA4tKuBzlB,MAG/CuT,IAAW,GAEb,IAAImS,EAAU,CACZvnB,EAAMoV,EAASrU,EAVCumB,EAAU5E,EAAWp1C,EAFtBg6C,EAAU3E,EAAUr1C,EAGdg6C,EAAUh6C,EAAYo1C,EAFvB4E,EAAUh6C,EAAYq1C,EAYzB+C,EAAQC,EAAKC,GAG5BrlB,EAAS8mB,EAAS/1B,MAAMhkB,EAAWi6C,GAKvC,OAJIlC,GAAWrlB,IACbwnB,GAAQjnB,EAAQgnB,GAElBhnB,EAAOgM,YAAcA,EACdkb,GAAgBlnB,EAAQP,EAAMoV,GAUvC,SAASsS,GAAYxD,GACnB,IAAIlkB,EAAO3tB,GAAK6xC,GAChB,OAAO,SAASlP,EAAQ2S,GAGtB,GAFA3S,EAASpV,GAASoV,IAClB2S,EAAyB,MAAbA,EAAoB,EAAIloB,GAAUmoB,GAAUD,GAAY,OACnDxX,GAAe6E,GAAS,CAGvC,IAAI6S,GAAQrqC,GAASw3B,GAAU,KAAKtH,MAAM,KAI1C,SADAma,GAAQrqC,GAFIwiB,EAAK6nB,EAAK,GAAK,MAAQA,EAAK,GAAKF,KAEnB,KAAKja,MAAM,MACvB,GAAK,MAAQma,EAAK,GAAKF,IAEvC,OAAO3nB,EAAKgV,IAWhB,IAAImM,GAAct2B,IAAQ,EAAIsiB,GAAW,IAAItiB,GAAI,CAAC,EAAE,KAAK,IAAOkX,EAAmB,SAASjoB,GAC1F,OAAO,IAAI+Q,GAAI/Q,IAD2DguC,GAW5E,SAASC,GAAc1O,GACrB,OAAO,SAAS3N,GACd,IAAIkK,EAAMC,GAAOnK,GACjB,OAAIkK,GAAOjT,EACFmK,GAAWpB,GAEhBkK,GAAO5S,EACFoK,GAAW1B,GAn3I1B,SAAqBA,EAAQ3nC,GAC3B,OAAOwmC,GAASxmC,GAAO,SAASigB,GAC9B,MAAO,CAACA,EAAK0nB,EAAO1nB,OAm3IXgkC,CAAYtc,EAAQ2N,EAAS3N,KA6BxC,SAASuc,GAAWjoB,EAAMoV,EAASrU,EAAS2hB,EAAUC,EAAS+C,EAAQC,EAAKC,GAC1E,IAAIG,EAr0KiB,EAq0KL3Q,EAChB,IAAK2Q,GAA4B,mBAAR/lB,EACvB,MAAM,IAAIvO,GAAUqN,GAEtB,IAAI34B,EAASu8C,EAAWA,EAASv8C,OAAS,EAS1C,GARKA,IACHivC,IAAW,GACXsN,EAAWC,EAAUr1C,GAEvBq4C,EAAMA,IAAQr4C,EAAYq4C,EAAMnmB,GAAUooB,GAAUjC,GAAM,GAC1DC,EAAQA,IAAUt4C,EAAYs4C,EAAQgC,GAAUhC,GAChDz/C,GAAUw8C,EAAUA,EAAQx8C,OAAS,EA30KX,GA60KtBivC,EAAmC,CACrC,IAAIoQ,EAAgB9C,EAChB+C,EAAe9C,EAEnBD,EAAWC,EAAUr1C,EAEvB,IAAIkU,EAAOukC,EAAYz4C,EAAY83C,GAAQplB,GAEvCunB,EAAU,CACZvnB,EAAMoV,EAASrU,EAAS2hB,EAAUC,EAAS6C,EAAeC,EAC1DC,EAAQC,EAAKC,GAkBf,GAfIpkC,GAy6BN,SAAmBA,EAAMxF,GACvB,IAAIo5B,EAAU5zB,EAAK,GACf0mC,EAAalsC,EAAO,GACpBmsC,EAAa/S,EAAU8S,EACvBzQ,EAAW0Q,EAAa,IAExBC,EACAF,GAAcpmB,GA7wMA,GA6wMmBsT,GACjC8S,GAAcpmB,GAzwMA,KAywMmBsT,GAAgC5zB,EAAK,GAAGrb,QAAU6V,EAAO,IAC5E,KAAdksC,GAAqDlsC,EAAO,GAAG7V,QAAU6V,EAAO,IA/wMlE,GA+wM0Eo5B,EAG5F,IAAMqC,IAAY2Q,EAChB,OAAO5mC,EAtxMQ,EAyxMb0mC,IACF1mC,EAAK,GAAKxF,EAAO,GAEjBmsC,GA5xMe,EA4xMD/S,EAA2B,EA1xMnB,GA6xMxB,IAAItoC,EAAQkP,EAAO,GACnB,GAAIlP,EAAO,CACT,IAAI41C,EAAWlhC,EAAK,GACpBA,EAAK,GAAKkhC,EAAWD,GAAYC,EAAU51C,EAAOkP,EAAO,IAAMlP,EAC/D0U,EAAK,GAAKkhC,EAAWxV,GAAe1rB,EAAK,GAAIogB,GAAe5lB,EAAO,IAGrElP,EAAQkP,EAAO,MAEb0mC,EAAWlhC,EAAK,GAChBA,EAAK,GAAKkhC,EAAWU,GAAiBV,EAAU51C,EAAOkP,EAAO,IAAMlP,EACpE0U,EAAK,GAAKkhC,EAAWxV,GAAe1rB,EAAK,GAAIogB,GAAe5lB,EAAO,KAGrElP,EAAQkP,EAAO,MAEbwF,EAAK,GAAK1U,GAGRo7C,EAAapmB,IACftgB,EAAK,GAAgB,MAAXA,EAAK,GAAaxF,EAAO,GAAKyjB,GAAUje,EAAK,GAAIxF,EAAO,KAGrD,MAAXwF,EAAK,KACPA,EAAK,GAAKxF,EAAO,IAGnBwF,EAAK,GAAKxF,EAAO,GACjBwF,EAAK,GAAK2mC,EA19BRE,CAAUd,EAAS/lC,GAErBwe,EAAOunB,EAAQ,GACfnS,EAAUmS,EAAQ,GAClBxmB,EAAUwmB,EAAQ,GAClB7E,EAAW6E,EAAQ,GACnB5E,EAAU4E,EAAQ,KAClB3B,EAAQ2B,EAAQ,GAAKA,EAAQ,KAAOj6C,EAC/By4C,EAAY,EAAI/lB,EAAK75B,OACtBq5B,GAAU+nB,EAAQ,GAAKphD,EAAQ,KAEX,GAAVivC,IACZA,IAAW,IAERA,GA/2KY,GA+2KDA,EAGd7U,EA/2KgB,GA82KP6U,GA72Ka,IA62KiBA,EApgB3C,SAAqBpV,EAAMoV,EAASwQ,GAClC,IAAIpP,EAAOgO,GAAWxkB,GAwBtB,OAtBA,SAASilB,IAMP,IALA,IAAI9+C,EAAS6U,UAAU7U,OACnB26B,EAAOjmB,EAAM1U,GACbD,EAAQC,EACRomC,EAAc0Z,GAAUhB,GAErB/+C,KACL46B,EAAK56B,GAAS8U,UAAU9U,GAE1B,IAAIy8C,EAAWx8C,EAAS,GAAK26B,EAAK,KAAOyL,GAAezL,EAAK36B,EAAS,KAAOomC,EACzE,GACAW,GAAepM,EAAMyL,GAGzB,OADApmC,GAAUw8C,EAAQx8C,QACLy/C,EACJQ,GACLpmB,EAAMoV,EAASmQ,GAAcN,EAAQ1Y,YAAaj/B,EAClDwzB,EAAM6hB,EAASr1C,EAAWA,EAAWs4C,EAAQz/C,GAG1CmrB,GADGjlB,MAAQA,OAASpH,IAAQoH,gBAAgB44C,EAAWzO,EAAOxW,EACpD3zB,KAAMy0B,IA8edwnB,CAAYtoB,EAAMoV,EAASwQ,GAC1BxQ,GAAWvT,GAAgC,IAAXuT,GAAqDuN,EAAQx8C,OAG9Fo/C,GAAaj0B,MAAMhkB,EAAWi6C,GA9O3C,SAAuBvnB,EAAMoV,EAASrU,EAAS2hB,GAC7C,IAAIoD,EAzoKa,EAyoKJ1Q,EACToB,EAAOgO,GAAWxkB,GAkBtB,OAhBA,SAASilB,IAQP,IAPA,IAAIpC,GAAa,EACbC,EAAa9nC,UAAU7U,OACvB68C,GAAa,EACbC,EAAaP,EAASv8C,OACtB26B,EAAOjmB,EAAMooC,EAAaH,GAC1B5lC,EAAM7Q,MAAQA,OAASpH,IAAQoH,gBAAgB44C,EAAWzO,EAAOxW,IAE5DgjB,EAAYC,GACnBniB,EAAKkiB,GAAaN,EAASM,GAE7B,KAAOF,KACLhiB,EAAKkiB,KAAehoC,YAAY6nC,GAElC,OAAOvxB,GAAMpU,EAAI4oC,EAAS/kB,EAAU10B,KAAMy0B,IA0NjCynB,CAAcvoB,EAAMoV,EAASrU,EAAS2hB,QAJ/C,IAAIniB,EAhmBR,SAAoBP,EAAMoV,EAASrU,GACjC,IAAI+kB,EAjxJa,EAixJJ1Q,EACToB,EAAOgO,GAAWxkB,GAMtB,OAJA,SAASilB,IAEP,OADU54C,MAAQA,OAASpH,IAAQoH,gBAAgB44C,EAAWzO,EAAOxW,GAC3D1O,MAAMw0B,EAAS/kB,EAAU10B,KAAM2O,YA0lB5BwtC,CAAWxoB,EAAMoV,EAASrU,GASzC,OAAO0mB,IADMjmC,EAAOk+B,GAAc8H,IACJjnB,EAAQgnB,GAAUvnB,EAAMoV,GAexD,SAASqT,GAAuBjU,EAAU4H,EAAUp4B,EAAK0nB,GACvD,OAAI8I,IAAalnC,GACZ+mC,GAAGG,EAAUtG,GAAYlqB,MAAU6D,GAAe9M,KAAK2wB,EAAQ1nB,GAC3Do4B,EAEF5H,EAiBT,SAASkU,GAAoBlU,EAAU4H,EAAUp4B,EAAK0nB,EAAQ1vB,EAAQs5B,GAOpE,OANI3V,GAAS6U,IAAa7U,GAASyc,KAEjC9G,EAAM5jB,IAAI0qB,EAAU5H,GACpB8I,GAAU9I,EAAU4H,EAAU9uC,EAAWo7C,GAAqBpT,GAC9DA,EAAc,OAAE8G,IAEX5H,EAYT,SAASmU,GAAgB77C,GACvB,OAAO8wC,GAAc9wC,GAASQ,EAAYR,EAgB5C,SAASkuC,GAAYnhC,EAAO/S,EAAOsuC,EAASC,EAAYmF,EAAWlF,GACjE,IAAI4F,EAv8KmB,EAu8KP9F,EACZwT,EAAY/uC,EAAM1T,OAClB6zC,EAAYlzC,EAAMX,OAEtB,GAAIyiD,GAAa5O,KAAekB,GAAalB,EAAY4O,GACvD,OAAO,EAGT,IAAI1R,EAAU5B,EAAMviC,IAAI8G,GACxB,GAAIq9B,GAAW5B,EAAMviC,IAAIjM,GACvB,OAAOowC,GAAWpwC,EAEpB,IAAIZ,GAAS,EACTq6B,GAAS,EACTzT,EAp9KqB,EAo9KbsoB,EAAoC,IAAInC,GAAW3lC,EAM/D,IAJAgoC,EAAM5jB,IAAI7X,EAAO/S,GACjBwuC,EAAM5jB,IAAI5qB,EAAO+S,KAGR3T,EAAQ0iD,GAAW,CAC1B,IAAIC,EAAWhvC,EAAM3T,GACjBy1C,EAAW70C,EAAMZ,GAErB,GAAImvC,EACF,IAAIuG,EAAWV,EACX7F,EAAWsG,EAAUkN,EAAU3iD,EAAOY,EAAO+S,EAAOy7B,GACpDD,EAAWwT,EAAUlN,EAAUz1C,EAAO2T,EAAO/S,EAAOwuC,GAE1D,GAAIsG,IAAatuC,EAAW,CAC1B,GAAIsuC,EACF,SAEFrb,GAAS,EACT,MAGF,GAAIzT,GACF,IAAK8d,GAAU9jC,GAAO,SAAS60C,EAAU1B,GACnC,IAAKjO,GAASlf,EAAMmtB,KACf4O,IAAalN,GAAYnB,EAAUqO,EAAUlN,EAAUvG,EAASC,EAAYC,IAC/E,OAAOxoB,EAAKzmB,KAAK4zC,MAEjB,CACN1Z,GAAS,EACT,YAEG,GACDsoB,IAAalN,IACXnB,EAAUqO,EAAUlN,EAAUvG,EAASC,EAAYC,GACpD,CACL/U,GAAS,EACT,OAKJ,OAFA+U,EAAc,OAAEz7B,GAChBy7B,EAAc,OAAExuC,GACTy5B,EAyKT,SAASskB,GAAS7kB,GAChB,OAAOqf,GAAYC,GAAStf,EAAM1yB,EAAWw7C,IAAU9oB,EAAO,IAUhE,SAASqX,GAAW3L,GAClB,OAAO0N,GAAe1N,EAAQr1B,GAAMggC,IAWtC,SAASe,GAAa1L,GACpB,OAAO0N,GAAe1N,EAAQyK,GAAQF,IAUxC,IAAImP,GAAWrU,GAAiB,SAAS/Q,GACvC,OAAO+Q,GAAQh+B,IAAIitB,IADI8nB,GAWzB,SAAS5C,GAAYllB,GAKnB,IAJA,IAAIO,EAAUP,EAAKr7B,KAAO,GACtBkV,EAAQm3B,GAAUzQ,GAClBp6B,EAAS0hB,GAAe9M,KAAKi2B,GAAWzQ,GAAU1mB,EAAM1T,OAAS,EAE9DA,KAAU,CACf,IAAIqb,EAAO3H,EAAM1T,GACb4iD,EAAYvnC,EAAKwe,KACrB,GAAiB,MAAb+oB,GAAqBA,GAAa/oB,EACpC,OAAOxe,EAAK7c,KAGhB,OAAO47B,EAUT,SAAS0lB,GAAUjmB,GAEjB,OADanY,GAAe9M,KAAK22B,GAAQ,eAAiBA,GAAS1R,GACrDuM,YAchB,SAAS4R,KACP,IAAI5d,EAASmR,GAAO/H,UAAYA,GAEhC,OADApJ,EAASA,IAAWoJ,GAAW4S,GAAehc,EACvCvlB,UAAU7U,OAASo6B,EAAOvlB,UAAU,GAAIA,UAAU,IAAMulB,EAWjE,SAASuX,GAAWlwC,EAAKoc,GACvB,IAgYiBlX,EACb8Q,EAjYA4D,EAAO5Z,EAAIsrC,SACf,OAiYgB,WADZt1B,SADa9Q,EA/XAkX,KAiYmB,UAARpG,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAV9Q,EACU,OAAVA,GAlYD0U,EAAmB,iBAAPwC,EAAkB,SAAW,QACzCxC,EAAK5Z,IAUX,SAASq1C,GAAavR,GAIpB,IAHA,IAAInL,EAASlqB,GAAKq1B,GACdvlC,EAASo6B,EAAOp6B,OAEbA,KAAU,CACf,IAAI6d,EAAMuc,EAAOp6B,GACb2G,EAAQ4+B,EAAO1nB,GAEnBuc,EAAOp6B,GAAU,CAAC6d,EAAKlX,EAAOswC,GAAmBtwC,IAEnD,OAAOyzB,EAWT,SAASkP,GAAU/D,EAAQ1nB,GACzB,IAAIlX,EA7uJR,SAAkB4+B,EAAQ1nB,GACxB,OAAiB,MAAV0nB,EAAiBp+B,EAAYo+B,EAAO1nB,GA4uJ7BglC,CAAStd,EAAQ1nB,GAC7B,OAAOs4B,GAAaxvC,GAASA,EAAQQ,EAqCvC,IAAI+oC,GAAcrG,GAA+B,SAAStE,GACxD,OAAc,MAAVA,EACK,IAETA,EAASt1B,GAAOs1B,GACTzB,GAAY+F,GAAiBtE,IAAS,SAAS6K,GACpD,OAAOrH,GAAqBn0B,KAAK2wB,EAAQ6K,QANR0S,GAiBjChT,GAAgBjG,GAA+B,SAAStE,GAE1D,IADA,IAAInL,EAAS,GACNmL,GACLlB,GAAUjK,EAAQ8V,GAAW3K,IAC7BA,EAASsD,GAAatD,GAExB,OAAOnL,GAN8B0oB,GAgBnCpT,GAAS0D,GA2Eb,SAAS2P,GAAQxd,EAAQ1d,EAAMm7B,GAO7B,IAJA,IAAIjjD,GAAS,EACTC,GAHJ6nB,EAAOkrB,GAASlrB,EAAM0d,IAGJvlC,OACdo6B,GAAS,IAEJr6B,EAAQC,GAAQ,CACvB,IAAI6d,EAAMm1B,GAAMnrB,EAAK9nB,IACrB,KAAMq6B,EAAmB,MAAVmL,GAAkByd,EAAQzd,EAAQ1nB,IAC/C,MAEF0nB,EAASA,EAAO1nB,GAElB,OAAIuc,KAAYr6B,GAASC,EAChBo6B,KAETp6B,EAAmB,MAAVulC,EAAiB,EAAIA,EAAOvlC,SAClBijD,GAASjjD,IAAWytC,GAAQ5vB,EAAK7d,KACjD8hB,GAAQyjB,IAAW8H,GAAY9H,IA6BpC,SAASsK,GAAgBtK,GACvB,MAAqC,mBAAtBA,EAAOz/B,aAA8B4wC,GAAYnR,GAE5D,GADAoG,GAAW9C,GAAatD,IA8E9B,SAASiN,GAAc7rC,GACrB,OAAOmb,GAAQnb,IAAU0mC,GAAY1mC,OAChCsiC,IAAoBtiC,GAASA,EAAMsiC,KAW1C,SAASwE,GAAQ9mC,EAAO3G,GACtB,IAAIyX,SAAc9Q,EAGlB,SAFA3G,EAAmB,MAAVA,EAAiB67B,EAAmB77B,KAGlC,UAARyX,GACU,UAARA,GAAoB4nB,GAASn2B,KAAKvC,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQ3G,EAajD,SAAS49C,GAAej3C,EAAO5G,EAAOwlC,GACpC,IAAK/L,GAAS+L,GACZ,OAAO,EAET,IAAI9tB,SAAc1X,EAClB,SAAY,UAAR0X,EACKo/B,GAAYtR,IAAWkI,GAAQ1tC,EAAOwlC,EAAOvlC,QACrC,UAARyX,GAAoB1X,KAASwlC,IAE7B2I,GAAG3I,EAAOxlC,GAAQ4G,GAa7B,SAASqwC,GAAMrwC,EAAO4+B,GACpB,GAAIzjB,GAAQnb,GACV,OAAO,EAET,IAAI8Q,SAAc9Q,EAClB,QAAY,UAAR8Q,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAAT9Q,IAAiBgzB,GAAShzB,KAGvB43B,EAAcr1B,KAAKvC,KAAW23B,EAAap1B,KAAKvC,IAC1C,MAAV4+B,GAAkB5+B,KAASsJ,GAAOs1B,GAyBvC,SAAS2Z,GAAWrlB,GAClB,IAAImlB,EAAWD,GAAYllB,GACvBl5B,EAAQ4qC,GAAOyT,GAEnB,GAAoB,mBAATr+C,KAAyBq+C,KAAYxT,GAAY72B,WAC1D,OAAO,EAET,GAAIklB,IAASl5B,EACX,OAAO,EAET,IAAI0a,EAAO4jC,GAAQt+C,GACnB,QAAS0a,GAAQwe,IAASxe,EAAK,IA7S5BovB,IAAYiF,GAAO,IAAIjF,GAAS,IAAI7b,YAAY,MAAQsO,GACxD7T,IAAOqmB,GAAO,IAAIrmB,KAAQmT,GAC1BnQ,IAAWqjB,GAAOrjB,GAAQ62B,YAAcvmB,GACxCjY,IAAOgrB,GAAO,IAAIhrB,KAAQmY,GAC1B6N,IAAWgF,GAAO,IAAIhF,KAAY1N,KACrC0S,GAAS,SAAS/oC,GAChB,IAAIyzB,EAASgZ,GAAWzsC,GACpB0pC,EAAOjW,GAAUsC,EAAY/1B,EAAMb,YAAcqB,EACjDg8C,EAAa9S,EAAOtF,GAASsF,GAAQ,GAEzC,GAAI8S,EACF,OAAQA,GACN,KAAKrY,GAAoB,OAAO5N,EAChC,KAAK8N,GAAe,OAAOxO,EAC3B,KAAKyO,GAAmB,OAAOtO,EAC/B,KAAKuO,GAAe,OAAOrO,EAC3B,KAAKsO,GAAmB,OAAOnO,EAGnC,OAAO5C,IA+SX,IAAIgpB,GAAapb,GAAa6K,GAAawQ,GAS3C,SAAS3M,GAAY/vC,GACnB,IAAI0pC,EAAO1pC,GAASA,EAAMb,YAG1B,OAAOa,KAFqB,mBAAR0pC,GAAsBA,EAAK17B,WAAcozB,IAa/D,SAASkP,GAAmBtwC,GAC1B,OAAOA,GAAUA,IAAU6yB,GAAS7yB,GAYtC,SAASowC,GAAwBl5B,EAAKo4B,GACpC,OAAO,SAAS1Q,GACd,OAAc,MAAVA,GAGGA,EAAO1nB,KAASo4B,IACpBA,IAAa9uC,GAAc0W,KAAO5N,GAAOs1B,KAsIhD,SAAS4T,GAAStf,EAAMrzB,EAAOqgC,GAE7B,OADArgC,EAAQ6yB,GAAU7yB,IAAUW,EAAa0yB,EAAK75B,OAAS,EAAKwG,EAAO,GAC5D,WAML,IALA,IAAIm0B,EAAO9lB,UACP9U,GAAS,EACTC,EAASq5B,GAAUsB,EAAK36B,OAASwG,EAAO,GACxCkN,EAAQgB,EAAM1U,KAETD,EAAQC,GACf0T,EAAM3T,GAAS46B,EAAKn0B,EAAQzG,GAE9BA,GAAS,EAET,IADA,IAAIujD,EAAY5uC,EAAMlO,EAAQ,KACrBzG,EAAQyG,GACf88C,EAAUvjD,GAAS46B,EAAK56B,GAG1B,OADAujD,EAAU98C,GAASqgC,EAAUnzB,GACtByX,GAAM0O,EAAM3zB,KAAMo9C,IAY7B,SAASrP,GAAO1O,EAAQ1d,GACtB,OAAOA,EAAK7nB,OAAS,EAAIulC,EAASuN,GAAQvN,EAAQoU,GAAU9xB,EAAM,GAAI,IAaxE,SAASq4B,GAAQxsC,EAAOolC,GAKtB,IAJA,IAAI2J,EAAY/uC,EAAM1T,OAClBA,EAASs5B,GAAUwf,EAAQ94C,OAAQyiD,GACnCc,EAAWzV,GAAUp6B,GAElB1T,KAAU,CACf,IAAID,EAAQ+4C,EAAQ94C,GACpB0T,EAAM1T,GAAUytC,GAAQ1tC,EAAO0iD,GAAac,EAASxjD,GAASoH,EAEhE,OAAOuM,EAWT,SAAS4jC,GAAQ/R,EAAQ1nB,GACvB,IAAY,gBAARA,GAAgD,mBAAhB0nB,EAAO1nB,KAIhC,aAAPA,EAIJ,OAAO0nB,EAAO1nB,GAiBhB,IAAIwjC,GAAUmC,GAASjK,IAUnBt9B,GAAawtB,IAAiB,SAAS5P,EAAMC,GAC/C,OAAOh7B,GAAKmd,WAAW4d,EAAMC,IAW3Bof,GAAcsK,GAAShK,IAY3B,SAAS8H,GAAgBxC,EAAS2E,EAAWxU,GAC3C,IAAIp5B,EAAU4tC,EAAY,GAC1B,OAAOvK,GAAY4F,EA1brB,SAA2BjpC,EAAQ6tC,GACjC,IAAI1jD,EAAS0jD,EAAQ1jD,OACrB,IAAKA,EACH,OAAO6V,EAET,IAAIsxB,EAAYnnC,EAAS,EAGzB,OAFA0jD,EAAQvc,IAAcnnC,EAAS,EAAI,KAAO,IAAM0jD,EAAQvc,GACxDuc,EAAUA,EAAQ99C,KAAK5F,EAAS,EAAI,KAAO,KACpC6V,EAAOpM,QAAQo1B,GAAe,uBAAyB6kB,EAAU,UAkb5CC,CAAkB9tC,EAqHhD,SAA2B6tC,EAASzU,GAOlC,OANAvL,GAAU1H,GAAW,SAAS0lB,GAC5B,IAAI/6C,EAAQ,KAAO+6C,EAAK,GACnBzS,EAAUyS,EAAK,KAAQ1d,GAAc0f,EAAS/8C,IACjD+8C,EAAQxjD,KAAKyG,MAGV+8C,EAAQvL,OA5HuCyL,CAtjBxD,SAAwB/tC,GACtB,IAAIxM,EAAQwM,EAAOxM,MAAMy1B,IACzB,OAAOz1B,EAAQA,EAAM,GAAGk+B,MAAMxI,IAAkB,GAojBwB8kB,CAAehuC,GAASo5B,KAYlG,SAASuU,GAAS3pB,GAChB,IAAIjrB,EAAQ,EACRk1C,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQ3Z,KACR4Z,EAr+MK,IAq+MmBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMp1C,GA1+ME,IA2+MN,OAAOiG,UAAU,QAGnBjG,EAAQ,EAEV,OAAOirB,EAAK1O,MAAMhkB,EAAW0N,YAYjC,SAASg5B,GAAYn6B,EAAOwB,GAC1B,IAAInV,GAAS,EACTC,EAAS0T,EAAM1T,OACfmnC,EAAYnnC,EAAS,EAGzB,IADAkV,EAAOA,IAAS/N,EAAYnH,EAASkV,IAC5BnV,EAAQmV,GAAM,CACrB,IAAI+uC,EAAOtW,GAAW5tC,EAAOonC,GACzBxgC,EAAQ+M,EAAMuwC,GAElBvwC,EAAMuwC,GAAQvwC,EAAM3T,GACpB2T,EAAM3T,GAAS4G,EAGjB,OADA+M,EAAM1T,OAASkV,EACRxB,EAUT,IAtTM0mB,GAOA0L,GA+SFiW,IAtTE3hB,GAAS8pB,IAsTkB,SAASxd,GACxC,IAAItM,EAAS,GAOb,OAN6B,KAAzBsM,EAAOyd,WAAW,IACpB/pB,EAAOl6B,KAAK,IAEdwmC,EAAOj9B,QAAQ+0B,IAAY,SAASn1B,EAAOwlC,EAAQuV,EAAOC,GACxDjqB,EAAOl6B,KAAKkkD,EAAQC,EAAU56C,QAAQw1B,GAAc,MAAS4P,GAAUxlC,MAElE+wB,KA9ToB,SAASvc,GAIlC,OAjwMiB,MA8vMbioB,GAAM5wB,MACR4wB,GAAMj0B,QAEDgM,KAGLioB,GAAQ1L,GAAO0L,MACZ1L,IAgUT,SAAS4Y,GAAMrsC,GACb,GAAoB,iBAATA,GAAqBgzB,GAAShzB,GACvC,OAAOA,EAET,IAAIyzB,EAAUzzB,EAAQ,GACtB,MAAkB,KAAVyzB,GAAkB,EAAIzzB,IAAU,IAAa,KAAOyzB,EAU9D,SAAS2Q,GAASlR,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOoO,GAAarzB,KAAKilB,GACzB,MAAO72B,IACT,IACE,OAAQ62B,EAAO,GACf,MAAO72B,KAEX,MAAO,GA4BT,SAAS0oC,GAAaoT,GACpB,GAAIA,aAAmBtT,GACrB,OAAOsT,EAAQx2C,QAEjB,IAAI8xB,EAAS,IAAIqR,GAAcqT,EAAQ/S,YAAa+S,EAAQ7S,WAI5D,OAHA7R,EAAO4R,YAAc8B,GAAUgR,EAAQ9S,aACvC5R,EAAO8R,UAAa4S,EAAQ5S,UAC5B9R,EAAO+R,WAAa2S,EAAQ3S,WACrB/R,EAsIT,IAAIkqB,GAAarL,IAAS,SAASvlC,EAAOC,GACxC,OAAO6jC,GAAkB9jC,GACrB29B,GAAe39B,EAAO2+B,GAAY1+B,EAAQ,EAAG6jC,IAAmB,IAChE,MA6BF+M,GAAetL,IAAS,SAASvlC,EAAOC,GAC1C,IAAI6vB,EAAW0Q,GAAKvgC,GAIpB,OAHI6jC,GAAkBhU,KACpBA,EAAWr8B,GAENqwC,GAAkB9jC,GACrB29B,GAAe39B,EAAO2+B,GAAY1+B,EAAQ,EAAG6jC,IAAmB,GAAOQ,GAAYxU,EAAU,IAC7F,MA0BFghB,GAAiBvL,IAAS,SAASvlC,EAAOC,GAC5C,IAAIwwB,EAAa+P,GAAKvgC,GAItB,OAHI6jC,GAAkBrT,KACpBA,EAAah9B,GAERqwC,GAAkB9jC,GACrB29B,GAAe39B,EAAO2+B,GAAY1+B,EAAQ,EAAG6jC,IAAmB,GAAOrwC,EAAWg9B,GAClF,MAsON,SAASsgB,GAAU/wC,EAAOmwB,EAAWmB,GACnC,IAAIhlC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAID,EAAqB,MAAbilC,EAAoB,EAAIyc,GAAUzc,GAI9C,OAHIjlC,EAAQ,IACVA,EAAQs5B,GAAUr5B,EAASD,EAAO,IAE7BglC,GAAcrxB,EAAOskC,GAAYnU,EAAW,GAAI9jC,GAsCzD,SAAS2kD,GAAchxC,EAAOmwB,EAAWmB,GACvC,IAAIhlC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAID,EAAQC,EAAS,EAOrB,OANIglC,IAAc79B,IAChBpH,EAAQ0hD,GAAUzc,GAClBjlC,EAAQilC,EAAY,EAChB3L,GAAUr5B,EAASD,EAAO,GAC1Bu5B,GAAUv5B,EAAOC,EAAS,IAEzB+kC,GAAcrxB,EAAOskC,GAAYnU,EAAW,GAAI9jC,GAAO,GAiBhE,SAAS4iD,GAAQjvC,GAEf,OADsB,MAATA,GAAoBA,EAAM1T,OACvBqyC,GAAY3+B,EAAO,GAAK,GAgG1C,SAASixC,GAAKjxC,GACZ,OAAQA,GAASA,EAAM1T,OAAU0T,EAAM,GAAKvM,EA0E9C,IAAIy9C,GAAe3L,IAAS,SAASrF,GACnC,IAAIiR,EAASzgB,GAASwP,EAAQiI,IAC9B,OAAQgJ,EAAO7kD,QAAU6kD,EAAO,KAAOjR,EAAO,GAC1CD,GAAiBkR,GACjB,MA0BFC,GAAiB7L,IAAS,SAASrF,GACrC,IAAIpQ,EAAW0Q,GAAKN,GAChBiR,EAASzgB,GAASwP,EAAQiI,IAO9B,OALIrY,IAAa0Q,GAAK2Q,GACpBrhB,EAAWr8B,EAEX09C,EAAO52B,MAED42B,EAAO7kD,QAAU6kD,EAAO,KAAOjR,EAAO,GAC1CD,GAAiBkR,EAAQ7M,GAAYxU,EAAU,IAC/C,MAwBFuhB,GAAmB9L,IAAS,SAASrF,GACvC,IAAIzP,EAAa+P,GAAKN,GAClBiR,EAASzgB,GAASwP,EAAQiI,IAM9B,OAJA1X,EAAkC,mBAAdA,EAA2BA,EAAah9B,IAE1D09C,EAAO52B,MAED42B,EAAO7kD,QAAU6kD,EAAO,KAAOjR,EAAO,GAC1CD,GAAiBkR,EAAQ19C,EAAWg9B,GACpC,MAoCN,SAAS+P,GAAKxgC,GACZ,IAAI1T,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACvC,OAAOA,EAAS0T,EAAM1T,EAAS,GAAKmH,EAuFtC,IAAI69C,GAAO/L,GAASgM,IAsBpB,SAASA,GAAQvxC,EAAOC,GACtB,OAAQD,GAASA,EAAM1T,QAAU2T,GAAUA,EAAO3T,OAC9C44C,GAAYllC,EAAOC,GACnBD,EAqFN,IAAIwxC,GAASxG,IAAS,SAAShrC,EAAOolC,GACpC,IAAI94C,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACnCo6B,EAASuU,GAAOj7B,EAAOolC,GAM3B,OAJAD,GAAWnlC,EAAO0wB,GAAS0U,GAAS,SAAS/4C,GAC3C,OAAO0tC,GAAQ1tC,EAAOC,IAAWD,EAAQA,KACxCo4C,KAAKI,KAEDne,KA2ET,SAASoQ,GAAQ92B,GACf,OAAgB,MAATA,EAAgBA,EAAQ62B,GAAc31B,KAAKlB,GAkapD,IAAIyxC,GAAQlM,IAAS,SAASrF,GAC5B,OAAOmH,GAAS1I,GAAYuB,EAAQ,EAAG4D,IAAmB,OA0BxD4N,GAAUnM,IAAS,SAASrF,GAC9B,IAAIpQ,EAAW0Q,GAAKN,GAIpB,OAHI4D,GAAkBhU,KACpBA,EAAWr8B,GAEN4zC,GAAS1I,GAAYuB,EAAQ,EAAG4D,IAAmB,GAAOQ,GAAYxU,EAAU,OAwBrF6hB,GAAYpM,IAAS,SAASrF,GAChC,IAAIzP,EAAa+P,GAAKN,GAEtB,OADAzP,EAAkC,mBAAdA,EAA2BA,EAAah9B,EACrD4zC,GAAS1I,GAAYuB,EAAQ,EAAG4D,IAAmB,GAAOrwC,EAAWg9B,MAgG9E,SAASmhB,GAAM5xC,GACb,IAAMA,IAASA,EAAM1T,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANA0T,EAAQowB,GAAYpwB,GAAO,SAAS6xC,GAClC,GAAI/N,GAAkB+N,GAEpB,OADAvlD,EAASq5B,GAAUksB,EAAMvlD,OAAQA,IAC1B,KAGJ0lC,GAAU1lC,GAAQ,SAASD,GAChC,OAAOqkC,GAAS1wB,EAAOixB,GAAa5kC,OAyBxC,SAASylD,GAAU9xC,EAAO8vB,GACxB,IAAM9vB,IAASA,EAAM1T,OACnB,MAAO,GAET,IAAIo6B,EAASkrB,GAAM5xC,GACnB,OAAgB,MAAZ8vB,EACKpJ,EAEFgK,GAAShK,GAAQ,SAASmrB,GAC/B,OAAOp6B,GAAMqY,EAAUr8B,EAAWo+C,MAwBtC,IAAIE,GAAUxM,IAAS,SAASvlC,EAAOC,GACrC,OAAO6jC,GAAkB9jC,GACrB29B,GAAe39B,EAAOC,GACtB,MAqBF+xC,GAAMzM,IAAS,SAASrF,GAC1B,OAAO6H,GAAQ3X,GAAY8P,EAAQ4D,QA0BjCmO,GAAQ1M,IAAS,SAASrF,GAC5B,IAAIpQ,EAAW0Q,GAAKN,GAIpB,OAHI4D,GAAkBhU,KACpBA,EAAWr8B,GAENs0C,GAAQ3X,GAAY8P,EAAQ4D,IAAoBQ,GAAYxU,EAAU,OAwB3EoiB,GAAU3M,IAAS,SAASrF,GAC9B,IAAIzP,EAAa+P,GAAKN,GAEtB,OADAzP,EAAkC,mBAAdA,EAA2BA,EAAah9B,EACrDs0C,GAAQ3X,GAAY8P,EAAQ4D,IAAoBrwC,EAAWg9B,MAmBhE0hB,GAAM5M,GAASqM,IA6DfQ,GAAU7M,IAAS,SAASrF,GAC9B,IAAI5zC,EAAS4zC,EAAO5zC,OAChBwjC,EAAWxjC,EAAS,EAAI4zC,EAAO5zC,EAAS,GAAKmH,EAGjD,OADAq8B,EAA8B,mBAAZA,GAA0BoQ,EAAO3lB,MAAOuV,GAAYr8B,EAC/Dq+C,GAAU5R,EAAQpQ,MAkC3B,SAASuiB,GAAMp/C,GACb,IAAIyzB,EAASmR,GAAO5kC,GAEpB,OADAyzB,EAAO6R,WAAY,EACZ7R,EAsDT,SAASykB,GAAKl4C,EAAOq/C,GACnB,OAAOA,EAAYr/C,GAmBrB,IAAIs/C,GAAYvH,IAAS,SAAS32B,GAChC,IAAI/nB,EAAS+nB,EAAM/nB,OACfwG,EAAQxG,EAAS+nB,EAAM,GAAK,EAC5BphB,EAAQT,KAAK6lC,YACbia,EAAc,SAASzgB,GAAU,OAAOoJ,GAAOpJ,EAAQxd,IAE3D,QAAI/nB,EAAS,GAAKkG,KAAK8lC,YAAYhsC,SAC7B2G,aAAiB6kC,IAAiBiC,GAAQjnC,KAGhDG,EAAQA,EAAMjF,MAAM8E,GAAQA,GAASxG,EAAS,EAAI,KAC5CgsC,YAAY9rC,KAAK,CACrB,KAAQ2+C,GACR,KAAQ,CAACmH,GACT,QAAW7+C,IAEN,IAAIskC,GAAc9kC,EAAOT,KAAK+lC,WAAW4S,MAAK,SAASnrC,GAI5D,OAHI1T,IAAW0T,EAAM1T,QACnB0T,EAAMxT,KAAKiH,GAENuM,MAZAxN,KAAK24C,KAAKmH,MA+PjBE,GAAU5I,IAAiB,SAASljB,EAAQzzB,EAAOkX,GACjD6D,GAAe9M,KAAKwlB,EAAQvc,KAC5Buc,EAAOvc,GAETswB,GAAgB/T,EAAQvc,EAAK,MAmI7BzM,GAAOmtC,GAAWkG,IAqBlB0B,GAAW5H,GAAWmG,IA2G1B,SAASv0C,GAAQ00B,EAAYrB,GAE3B,OADW1hB,GAAQ+iB,GAAcnB,GAAY8K,IACjC3J,EAAYmT,GAAYxU,EAAU,IAuBhD,SAAS4iB,GAAavhB,EAAYrB,GAEhC,OADW1hB,GAAQ+iB,GAAclB,GAAiBqO,IACtCnN,EAAYmT,GAAYxU,EAAU,IA0BhD,IAAI6iB,GAAU/I,IAAiB,SAASljB,EAAQzzB,EAAOkX,GACjD6D,GAAe9M,KAAKwlB,EAAQvc,GAC9Buc,EAAOvc,GAAK3d,KAAKyG,GAEjBwnC,GAAgB/T,EAAQvc,EAAK,CAAClX,OAsE9B2/C,GAAYrN,IAAS,SAASpU,EAAYhd,EAAM8S,GAClD,IAAI56B,GAAS,EACT4vC,EAAwB,mBAAR9nB,EAChBuS,EAASyc,GAAYhS,GAAcnwB,EAAMmwB,EAAW7kC,QAAU,GAKlE,OAHAwuC,GAAS3J,GAAY,SAASl+B,GAC5ByzB,IAASr6B,GAAS4vC,EAASxkB,GAAMtD,EAAMlhB,EAAOg0B,GAAQqZ,GAAWrtC,EAAOkhB,EAAM8S,MAEzEP,KA+BLmsB,GAAQjJ,IAAiB,SAASljB,EAAQzzB,EAAOkX,GACnDswB,GAAgB/T,EAAQvc,EAAKlX,MA6C/B,SAASlF,GAAIojC,EAAYrB,GAEvB,OADW1hB,GAAQ+iB,GAAcT,GAAWwS,IAChC/R,EAAYmT,GAAYxU,EAAU,IAkFhD,IAAIgjB,GAAYlJ,IAAiB,SAASljB,EAAQzzB,EAAOkX,GACvDuc,EAAOvc,EAAM,EAAI,GAAG3d,KAAKyG,MACxB,WAAa,MAAO,CAAC,GAAI,OAmSxB8/C,GAASxN,IAAS,SAASpU,EAAYiT,GACzC,GAAkB,MAAdjT,EACF,MAAO,GAET,IAAI7kC,EAAS83C,EAAU93C,OAMvB,OALIA,EAAS,GAAK49C,GAAe/Y,EAAYiT,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACH93C,EAAS,GAAK49C,GAAe9F,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBD,GAAYhT,EAAYwN,GAAYyF,EAAW,GAAI,OAqBxDve,GAAMiQ,IAAU,WAClB,OAAO1qC,GAAKyqB,KAAKgQ,OA0DnB,SAASimB,GAAI3lB,EAAM7pB,EAAG2tC,GAGpB,OAFA3tC,EAAI2tC,EAAQx2C,EAAY6I,EACxBA,EAAK6pB,GAAa,MAAL7pB,EAAa6pB,EAAK75B,OAASgQ,EACjC8xC,GAAWjoB,EAAM8B,EAAex0B,EAAWA,EAAWA,EAAWA,EAAW6I,GAoBrF,SAAS02C,GAAO12C,EAAG6pB,GACjB,IAAIO,EACJ,GAAmB,mBAARP,EACT,MAAM,IAAIvO,GAAUqN,GAGtB,OADA3oB,EAAIyxC,GAAUzxC,GACP,WAOL,QANMA,EAAI,IACRoqB,EAASP,EAAK1O,MAAMjlB,KAAM2O,YAExB7E,GAAK,IACP6pB,EAAO1yB,GAEFizB,GAuCX,IAAI3hB,GAAOwgC,IAAS,SAASpf,EAAMe,EAAS2hB,GAC1C,IAAItN,EAp0Ta,EAq0TjB,GAAIsN,EAASv8C,OAAQ,CACnB,IAAIw8C,EAAUzV,GAAewV,EAAUuD,GAAUrnC,KACjDw2B,GAAWvT,EAEb,OAAOomB,GAAWjoB,EAAMoV,EAASrU,EAAS2hB,EAAUC,MAgDlDmK,GAAU1N,IAAS,SAAS1T,EAAQ1nB,EAAK0+B,GAC3C,IAAItN,EAAU2X,EACd,GAAIrK,EAASv8C,OAAQ,CACnB,IAAIw8C,EAAUzV,GAAewV,EAAUuD,GAAU6G,KACjD1X,GAAWvT,EAEb,OAAOomB,GAAWjkC,EAAKoxB,EAAS1J,EAAQgX,EAAUC,MAsJpD,SAASjhB,GAAS1B,EAAMC,EAAMlhB,GAC5B,IAAIqhB,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAAiB,EACjBR,GAAU,EACVS,GAAS,EACTR,GAAW,EAEf,GAAmB,mBAARH,EACT,MAAM,IAAIvO,GAAUqN,GAUtB,SAAS8B,EAAWC,GAClB,IAAIC,EAAOV,EACPW,EAAUV,EAKd,OAHAD,EAAWC,EAAW/yB,EACtBozB,EAAiBG,EACjBN,EAASP,EAAK1O,MAAMyP,EAASD,GAI/B,SAASE,EAAYH,GAMnB,OAJAH,EAAiBG,EAEjBL,EAAUpe,GAAW6e,EAAchB,GAE5BC,EAAUU,EAAWC,GAAQN,EAatC,SAASW,EAAaL,GACpB,IAAIM,EAAoBN,EAAOJ,EAM/B,OAAQA,IAAiBnzB,GAAc6zB,GAAqBlB,GACzDkB,EAAoB,GAAOR,GANJE,EAAOH,GAM8BJ,EAGjE,SAASW,IACP,IAAIJ,EAAOnB,KACX,GAAIwB,EAAaL,GACf,OAAOO,EAAaP,GAGtBL,EAAUpe,GAAW6e,EA3BvB,SAAuBJ,GACrB,IAEImsB,EAAc/sB,GAFMY,EAAOJ,GAI/B,OAAOE,EACHlB,GAAUutB,EAAa1sB,GAJDO,EAAOH,IAK7BssB,EAoB+B3rB,CAAcR,IAGnD,SAASO,EAAaP,GAKpB,OAJAL,EAAUlzB,EAIN6yB,GAAYC,EACPQ,EAAWC,IAEpBT,EAAWC,EAAW/yB,EACfizB,GAeT,SAASe,IACP,IAAIT,EAAOnB,KACP6B,EAAaL,EAAaL,GAM9B,GAJAT,EAAWplB,UACXqlB,EAAWh0B,KACXo0B,EAAeI,EAEXU,EAAY,CACd,GAAIf,IAAYlzB,EACd,OAAO0zB,EAAYP,GAErB,GAAIE,EAIF,OAFAxe,GAAaqe,GACbA,EAAUpe,GAAW6e,EAAchB,GAC5BW,EAAWH,GAMtB,OAHID,IAAYlzB,IACdkzB,EAAUpe,GAAW6e,EAAchB,IAE9BM,EAIT,OA3GAN,EAAOL,GAASK,IAAS,EACrBN,GAAS5gB,KACXmhB,IAAYnhB,EAAQmhB,QAEpBI,GADAK,EAAS,YAAa5hB,GACHygB,GAAUI,GAAS7gB,EAAQuhB,UAAY,EAAGL,GAAQK,EACrEH,EAAW,aAAcphB,IAAYA,EAAQohB,SAAWA,GAoG1DmB,EAAUE,OApCV,WACMhB,IAAYlzB,GACd6U,GAAaqe,GAEfE,EAAiB,EACjBN,EAAWK,EAAeJ,EAAWG,EAAUlzB,GAgCjDg0B,EAAUG,MA7BV,WACE,OAAOjB,IAAYlzB,EAAYizB,EAASa,EAAa1B,OA6BhD4B,EAqBT,IAAI2rB,GAAQ7N,IAAS,SAASpf,EAAMc,GAClC,OAAOyW,GAAUvX,EAAM,EAAGc,MAsBxBosB,GAAQ9N,IAAS,SAASpf,EAAMC,EAAMa,GACxC,OAAOyW,GAAUvX,EAAMJ,GAASK,IAAS,EAAGa,MAqE9C,SAASupB,GAAQrqB,EAAMmtB,GACrB,GAAmB,mBAARntB,GAAmC,MAAZmtB,GAAuC,mBAAZA,EAC3D,MAAM,IAAI17B,GAAUqN,GAEtB,IAAIsuB,EAAW,WACb,IAAItsB,EAAO9lB,UACPgJ,EAAMmpC,EAAWA,EAAS77B,MAAMjlB,KAAMy0B,GAAQA,EAAK,GACnDmL,EAAQmhB,EAASnhB,MAErB,GAAIA,EAAMnhB,IAAI9G,GACZ,OAAOioB,EAAMl5B,IAAIiR,GAEnB,IAAIuc,EAASP,EAAK1O,MAAMjlB,KAAMy0B,GAE9B,OADAssB,EAASnhB,MAAQA,EAAMva,IAAI1N,EAAKuc,IAAW0L,EACpC1L,GAGT,OADA6sB,EAASnhB,MAAQ,IAAKoe,GAAQgD,OAASra,IAChCoa,EA0BT,SAASE,GAAOtjB,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAIvY,GAAUqN,GAEtB,OAAO,WACL,IAAIgC,EAAO9lB,UACX,OAAQ8lB,EAAK36B,QACX,KAAK,EAAG,OAAQ6jC,EAAUjvB,KAAK1O,MAC/B,KAAK,EAAG,OAAQ29B,EAAUjvB,KAAK1O,KAAMy0B,EAAK,IAC1C,KAAK,EAAG,OAAQkJ,EAAUjvB,KAAK1O,KAAMy0B,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQkJ,EAAUjvB,KAAK1O,KAAMy0B,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQkJ,EAAU1Y,MAAMjlB,KAAMy0B,IAlClCupB,GAAQgD,MAAQra,GA2FhB,IAAIua,GAAWpL,IAAS,SAASniB,EAAMwtB,GAKrC,IAAIC,GAJJD,EAAmC,GAArBA,EAAWrnD,QAAe8hB,GAAQulC,EAAW,IACvDjjB,GAASijB,EAAW,GAAI1hB,GAAUqS,OAClC5T,GAASiO,GAAYgV,EAAY,GAAI1hB,GAAUqS,QAEtBh4C,OAC7B,OAAOi5C,IAAS,SAASte,GAIvB,IAHA,IAAI56B,GAAS,EACTC,EAASs5B,GAAUqB,EAAK36B,OAAQsnD,KAE3BvnD,EAAQC,GACf26B,EAAK56B,GAASsnD,EAAWtnD,GAAO6U,KAAK1O,KAAMy0B,EAAK56B,IAElD,OAAOorB,GAAM0O,EAAM3zB,KAAMy0B,SAqCzB4sB,GAAUtO,IAAS,SAASpf,EAAM0iB,GACpC,IAAIC,EAAUzV,GAAewV,EAAUuD,GAAUyH,KACjD,OAAOzF,GAAWjoB,EAAM6B,EAAmBv0B,EAAWo1C,EAAUC,MAmC9DgL,GAAevO,IAAS,SAASpf,EAAM0iB,GACzC,IAAIC,EAAUzV,GAAewV,EAAUuD,GAAU0H,KACjD,OAAO1F,GAAWjoB,EAp8UQ,GAo8UuB1yB,EAAWo1C,EAAUC,MAyBpEiL,GAAQ/I,IAAS,SAAS7kB,EAAMif,GAClC,OAAOgJ,GAAWjoB,EA59UA,IA49UuB1yB,EAAWA,EAAWA,EAAW2xC,MAia5E,SAAS5K,GAAGvnC,EAAOhG,GACjB,OAAOgG,IAAUhG,GAAUgG,GAAUA,GAAShG,GAAUA,EA0B1D,IAAIkxB,GAAKovB,GAA0BzN,IAyB/BkU,GAAMzG,IAA0B,SAASt6C,EAAOhG,GAClD,OAAOgG,GAAShG,KAqBd0sC,GAAc8G,GAAgB,WAAa,OAAOt/B,UAApB,IAAsCs/B,GAAkB,SAASxtC,GACjG,OAAO+yB,GAAa/yB,IAAU+a,GAAe9M,KAAKjO,EAAO,YACtDoiC,GAAqBn0B,KAAKjO,EAAO,WA0BlCmb,GAAUpN,EAAMoN,QAmBhB6gB,GAAgBD,GAAoBiD,GAAUjD,IAn4PlD,SAA2B/7B,GACzB,OAAO+yB,GAAa/yB,IAAUysC,GAAWzsC,IAAUs2B,GA65PrD,SAAS4Z,GAAYlwC,GACnB,OAAgB,MAATA,GAAiBs8C,GAASt8C,EAAM3G,UAAY6yC,GAAWlsC,GA4BhE,SAAS6wC,GAAkB7wC,GACzB,OAAO+yB,GAAa/yB,IAAUkwC,GAAYlwC,GA0C5C,IAAIojC,GAAWD,IAAkBuZ,GAmB7BxgB,GAASD,GAAa+C,GAAU/C,IA9+PpC,SAAoBj8B,GAClB,OAAO+yB,GAAa/yB,IAAUysC,GAAWzsC,IAAUy1B,GAqpQrD,SAASurB,GAAQhhD,GACf,IAAK+yB,GAAa/yB,GAChB,OAAO,EAET,IAAI8oC,EAAM2D,GAAWzsC,GACrB,OAAO8oC,GAAOpT,GA3uWF,yBA2uWcoT,GACC,iBAAjB9oC,EAAMoO,SAA4C,iBAAdpO,EAAMnI,OAAqBi5C,GAAc9wC,GAkDzF,SAASksC,GAAWlsC,GAClB,IAAK6yB,GAAS7yB,GACZ,OAAO,EAIT,IAAI8oC,EAAM2D,GAAWzsC,GACrB,OAAO8oC,GAAOnT,GAAWmT,GAAOlT,GAxyWrB,0BAwyW+BkT,GA5xW/B,kBA4xWkDA,EA6B/D,SAASmY,GAAUjhD,GACjB,MAAuB,iBAATA,GAAqBA,GAAS86C,GAAU96C,GA6BxD,SAASs8C,GAASt8C,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASk1B,EA4B7C,SAASrC,GAAS7yB,GAChB,IAAI8Q,SAAc9Q,EAClB,OAAgB,MAATA,IAA0B,UAAR8Q,GAA4B,YAARA,GA2B/C,SAASiiB,GAAa/yB,GACpB,OAAgB,MAATA,GAAiC,iBAATA,EAoBjC,IAAIo8B,GAAQD,GAAY6C,GAAU7C,IAlwQlC,SAAmBn8B,GACjB,OAAO+yB,GAAa/yB,IAAU+oC,GAAO/oC,IAAU61B,GAm9QjD,SAASqrB,GAASlhD,GAChB,MAAuB,iBAATA,GACX+yB,GAAa/yB,IAAUysC,GAAWzsC,IAAU81B,EA+BjD,SAASgb,GAAc9wC,GACrB,IAAK+yB,GAAa/yB,IAAUysC,GAAWzsC,IAAU+1B,EAC/C,OAAO,EAET,IAAIkP,EAAQ/C,GAAaliC,GACzB,GAAc,OAAVilC,EACF,OAAO,EAET,IAAIyE,EAAO3uB,GAAe9M,KAAKg3B,EAAO,gBAAkBA,EAAM9lC,YAC9D,MAAsB,mBAARuqC,GAAsBA,aAAgBA,GAClDpI,GAAarzB,KAAKy7B,IAAS9H,GAoB/B,IAAItF,GAAWD,GAAe2C,GAAU3C,IAl8QxC,SAAsBr8B,GACpB,OAAO+yB,GAAa/yB,IAAUysC,GAAWzsC,IAAUi2B,GAm/QjDuG,GAAQD,GAAYyC,GAAUzC,IAz+QlC,SAAmBv8B,GACjB,OAAO+yB,GAAa/yB,IAAU+oC,GAAO/oC,IAAUk2B,GA2/QjD,SAASirB,GAASnhD,GAChB,MAAuB,iBAATA,IACVmb,GAAQnb,IAAU+yB,GAAa/yB,IAAUysC,GAAWzsC,IAAUm2B,EAoBpE,SAASnD,GAAShzB,GAChB,MAAuB,iBAATA,GACX+yB,GAAa/yB,IAAUysC,GAAWzsC,IAAUo2B,EAoBjD,IAAIsG,GAAeD,GAAmBuC,GAAUvC,IA7hRhD,SAA0Bz8B,GACxB,OAAO+yB,GAAa/yB,IAClBs8C,GAASt8C,EAAM3G,WAAa2hC,GAAeyR,GAAWzsC,KAmnRtDirB,GAAKqvB,GAA0BtK,IAyB/BoR,GAAM9G,IAA0B,SAASt6C,EAAOhG,GAClD,OAAOgG,GAAShG,KA0BlB,SAASqnD,GAAQrhD,GACf,IAAKA,EACH,MAAO,GAET,GAAIkwC,GAAYlwC,GACd,OAAOmhD,GAASnhD,GAAS0gC,GAAc1gC,GAASmnC,GAAUnnC,GAE5D,GAAIwiC,IAAexiC,EAAMwiC,IACvB,OA95VN,SAAyB3e,GAIvB,IAHA,IAAInP,EACA+e,EAAS,KAEJ/e,EAAOmP,EAAShN,QAAQ+Q,MAC/B6L,EAAOl6B,KAAKmb,EAAK1U,OAEnB,OAAOyzB,EAu5VI6tB,CAAgBthD,EAAMwiC,OAE/B,IAAIsG,EAAMC,GAAO/oC,GAGjB,OAFW8oC,GAAOjT,EAASmK,GAAc8I,GAAO5S,EAASmK,GAAarzB,IAE1DhN,GA0Bd,SAASo6C,GAASp6C,GAChB,OAAKA,GAGLA,EAAQ8yB,GAAS9yB,MACHi1B,GAAYj1B,KAAU,IArgYtB,uBAsgYAA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,EAoCjC,SAAS86C,GAAU96C,GACjB,IAAIyzB,EAAS2mB,GAASp6C,GAClBuhD,EAAY9tB,EAAS,EAEzB,OAAOA,GAAWA,EAAU8tB,EAAY9tB,EAAS8tB,EAAY9tB,EAAU,EA8BzE,SAAS+tB,GAASxhD,GAChB,OAAOA,EAAQonC,GAAU0T,GAAU96C,GAAQ,EAAGo1B,GAAoB,EA0BpE,SAAStC,GAAS9yB,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIgzB,GAAShzB,GACX,OAAOm1B,EAET,GAAItC,GAAS7yB,GAAQ,CACnB,IAAIhG,EAAgC,mBAAjBgG,EAAMukB,QAAwBvkB,EAAMukB,UAAYvkB,EACnEA,EAAQ6yB,GAAS74B,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAATgG,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQA,EAAM8C,QAAQmvB,GAAQ,IAC9B,IAAIgB,EAAWd,GAAW5vB,KAAKvC,GAC/B,OAAQizB,GAAYb,GAAU7vB,KAAKvC,GAC/BqyB,GAAaryB,EAAMjF,MAAM,GAAIk4B,EAAW,EAAI,GAC3Cf,GAAW3vB,KAAKvC,GAASm1B,GAAOn1B,EA2BvC,SAAS+wC,GAAc/wC,GACrB,OAAO+nC,GAAW/nC,EAAOqpC,GAAOrpC,IAsDlC,SAAS0Q,GAAS1Q,GAChB,OAAgB,MAATA,EAAgB,GAAKm0C,GAAan0C,GAqC3C,IAAIuL,GAASsrC,IAAe,SAASjY,EAAQ1vB,GAC3C,GAAI6gC,GAAY7gC,IAAWghC,GAAYhhC,GACrC64B,GAAW74B,EAAQ3F,GAAK2F,GAAS0vB,QAGnC,IAAK,IAAI1nB,KAAOhI,EACV6L,GAAe9M,KAAKiB,EAAQgI,IAC9BuwB,GAAY7I,EAAQ1nB,EAAKhI,EAAOgI,OAoClCuqC,GAAW5K,IAAe,SAASjY,EAAQ1vB,GAC7C64B,GAAW74B,EAAQm6B,GAAOn6B,GAAS0vB,MAgCjC8iB,GAAe7K,IAAe,SAASjY,EAAQ1vB,EAAQuhC,EAAUlI,GACnER,GAAW74B,EAAQm6B,GAAOn6B,GAAS0vB,EAAQ2J,MA+BzCoZ,GAAa9K,IAAe,SAASjY,EAAQ1vB,EAAQuhC,EAAUlI,GACjER,GAAW74B,EAAQ3F,GAAK2F,GAAS0vB,EAAQ2J,MAoBvCje,GAAKytB,GAAS/P,IA8Dd1lB,GAAWgwB,IAAS,SAAS1T,EAAQmY,GACvCnY,EAASt1B,GAAOs1B,GAEhB,IAAIxlC,GAAS,EACTC,EAAS09C,EAAQ19C,OACjB29C,EAAQ39C,EAAS,EAAI09C,EAAQ,GAAKv2C,EAMtC,IAJIw2C,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClD39C,EAAS,KAGFD,EAAQC,GAMf,IALA,IAAI6V,EAAS6nC,EAAQ39C,GACjBnC,EAAQoyC,GAAOn6B,GACf0yC,GAAc,EACdC,EAAc5qD,EAAMoC,SAEfuoD,EAAaC,GAAa,CACjC,IAAI3qC,EAAMjgB,EAAM2qD,GACZ5hD,EAAQ4+B,EAAO1nB,IAEflX,IAAUQ,GACT+mC,GAAGvnC,EAAOohC,GAAYlqB,MAAU6D,GAAe9M,KAAK2wB,EAAQ1nB,MAC/D0nB,EAAO1nB,GAAOhI,EAAOgI,IAK3B,OAAO0nB,KAsBLkjB,GAAexP,IAAS,SAASte,GAEnC,OADAA,EAAKz6B,KAAKiH,EAAWo7C,IACdp3B,GAAMu9B,GAAWvhD,EAAWwzB,MAgSrC,SAAS/tB,GAAI24B,EAAQ1d,EAAM8B,GACzB,IAAIyQ,EAAmB,MAAVmL,EAAiBp+B,EAAY2rC,GAAQvN,EAAQ1d,GAC1D,OAAOuS,IAAWjzB,EAAYwiB,EAAeyQ,EA4D/C,SAAS8c,GAAM3R,EAAQ1d,GACrB,OAAiB,MAAV0d,GAAkBwd,GAAQxd,EAAQ1d,EAAM6rB,IAqBjD,IAAIiV,GAASxI,IAAe,SAAS/lB,EAAQzzB,EAAOkX,GACrC,MAATlX,GACyB,mBAAlBA,EAAM0Q,WACf1Q,EAAQ2hC,GAAqB1zB,KAAKjO,IAGpCyzB,EAAOzzB,GAASkX,IACf47B,GAASpD,KA4BRuS,GAAWzI,IAAe,SAAS/lB,EAAQzzB,EAAOkX,GACvC,MAATlX,GACyB,mBAAlBA,EAAM0Q,WACf1Q,EAAQ2hC,GAAqB1zB,KAAKjO,IAGhC+a,GAAe9M,KAAKwlB,EAAQzzB,GAC9ByzB,EAAOzzB,GAAOzG,KAAK2d,GAEnBuc,EAAOzzB,GAAS,CAACkX,KAElBm6B,IAoBC6Q,GAAS5P,GAASjF,IA8BtB,SAAS9jC,GAAKq1B,GACZ,OAAOsR,GAAYtR,GAAU0H,GAAc1H,GAAUkR,GAASlR,GA0BhE,SAASyK,GAAOzK,GACd,OAAOsR,GAAYtR,GAAU0H,GAAc1H,GAAQ,GAxmTrD,SAAoBA,GAClB,IAAK/L,GAAS+L,GACZ,OAo8FJ,SAAsBA,GACpB,IAAInL,EAAS,GACb,GAAc,MAAVmL,EACF,IAAK,IAAI1nB,KAAO5N,GAAOs1B,GACrBnL,EAAOl6B,KAAK2d,GAGhB,OAAOuc,EA38FE0uB,CAAavjB,GAEtB,IAAIwjB,EAAUrS,GAAYnR,GACtBnL,EAAS,GAEb,IAAK,IAAIvc,KAAO0nB,GACD,eAAP1nB,IAAyBkrC,GAAYrnC,GAAe9M,KAAK2wB,EAAQ1nB,KACrEuc,EAAOl6B,KAAK2d,GAGhB,OAAOuc,EA4lToD4uB,CAAWzjB,GAuGxE,IAAI0jB,GAAQzL,IAAe,SAASjY,EAAQ1vB,EAAQuhC,GAClDD,GAAU5R,EAAQ1vB,EAAQuhC,MAkCxBsR,GAAYlL,IAAe,SAASjY,EAAQ1vB,EAAQuhC,EAAUlI,GAChEiI,GAAU5R,EAAQ1vB,EAAQuhC,EAAUlI,MAuBlCga,GAAOxK,IAAS,SAASnZ,EAAQxd,GACnC,IAAIqS,EAAS,GACb,GAAc,MAAVmL,EACF,OAAOnL,EAET,IAAIgV,GAAS,EACbrnB,EAAQqc,GAASrc,GAAO,SAASF,GAG/B,OAFAA,EAAOkrB,GAASlrB,EAAM0d,GACtB6J,IAAWA,EAASvnB,EAAK7nB,OAAS,GAC3B6nB,KAET6mB,GAAWnJ,EAAQ0L,GAAa1L,GAASnL,GACrCgV,IACFhV,EAAS4U,GAAU5U,EAAQ+uB,EAAwD3G,KAGrF,IADA,IAAIxiD,EAAS+nB,EAAM/nB,OACZA,KACL+4C,GAAU3e,EAAQrS,EAAM/nB,IAE1B,OAAOo6B,KA4CLwN,GAAO8W,IAAS,SAASnZ,EAAQxd,GACnC,OAAiB,MAAVwd,EAAiB,GAtlT1B,SAAkBA,EAAQxd,GACxB,OAAO2wB,GAAWnT,EAAQxd,GAAO,SAASphB,EAAOkhB,GAC/C,OAAOqvB,GAAM3R,EAAQ1d,MAolTMuhC,CAAS7jB,EAAQxd,MAqBhD,SAASshC,GAAO9jB,EAAQ1B,GACtB,GAAc,MAAV0B,EACF,MAAO,GAET,IAAI3nC,EAAQwmC,GAAS6M,GAAa1L,IAAS,SAAS+jB,GAClD,MAAO,CAACA,MAGV,OADAzlB,EAAYmU,GAAYnU,GACjB6U,GAAWnT,EAAQ3nC,GAAO,SAAS+I,EAAOkhB,GAC/C,OAAOgc,EAAUl9B,EAAOkhB,EAAK,OA4IjC,IAAI0hC,GAAU3H,GAAc1xC,IA0BxBs5C,GAAY5H,GAAc5R,IA4K9B,SAASr8B,GAAO4xB,GACd,OAAiB,MAAVA,EAAiB,GAAKK,GAAWL,EAAQr1B,GAAKq1B,IAkNvD,IAAIkkB,GAAYxL,IAAiB,SAAS7jB,EAAQsvB,EAAM3pD,GAEtD,OADA2pD,EAAOA,EAAKC,cACLvvB,GAAUr6B,EAAQ6pD,GAAWF,GAAQA,MAkB9C,SAASE,GAAWljB,GAClB,OAAOmjB,GAAWxyC,GAASqvB,GAAQijB,eAqBrC,SAASvL,GAAO1X,GAEd,OADAA,EAASrvB,GAASqvB,KACDA,EAAOj9B,QAAQ61B,GAAS+G,IAAc58B,QAAQ23B,GAAa,IAsH9E,IAAI0oB,GAAY7L,IAAiB,SAAS7jB,EAAQsvB,EAAM3pD,GACtD,OAAOq6B,GAAUr6B,EAAQ,IAAM,IAAM2pD,EAAKC,iBAuBxCI,GAAY9L,IAAiB,SAAS7jB,EAAQsvB,EAAM3pD,GACtD,OAAOq6B,GAAUr6B,EAAQ,IAAM,IAAM2pD,EAAKC,iBAoBxCK,GAAalM,GAAgB,eA0N7BmM,GAAYhM,IAAiB,SAAS7jB,EAAQsvB,EAAM3pD,GACtD,OAAOq6B,GAAUr6B,EAAQ,IAAM,IAAM2pD,EAAKC,iBAgExCO,GAAYjM,IAAiB,SAAS7jB,EAAQsvB,EAAM3pD,GACtD,OAAOq6B,GAAUr6B,EAAQ,IAAM,IAAM8pD,GAAWH,MAkiB9CS,GAAYlM,IAAiB,SAAS7jB,EAAQsvB,EAAM3pD,GACtD,OAAOq6B,GAAUr6B,EAAQ,IAAM,IAAM2pD,EAAKhyB,iBAoBxCmyB,GAAa/L,GAAgB,eAqBjC,SAASK,GAAMzX,EAAQ0jB,EAASzM,GAI9B,OAHAjX,EAASrvB,GAASqvB,IAClB0jB,EAAUzM,EAAQx2C,EAAYijD,KAEdjjD,EAxvbpB,SAAwBu/B,GACtB,OAAOlF,GAAiBt4B,KAAKw9B,GAwvblB2jB,CAAe3jB,GA5hb5B,SAAsBA,GACpB,OAAOA,EAAOr9B,MAAMi4B,KAAkB,GA2hbFgpB,CAAa5jB,GA/ncnD,SAAoBA,GAClB,OAAOA,EAAOr9B,MAAM21B,KAAgB,GA8ncuBurB,CAAW7jB,GAE7DA,EAAOr9B,MAAM+gD,IAAY,GA2BlC,IAAII,GAAUvR,IAAS,SAASpf,EAAMc,GACpC,IACE,OAAOxP,GAAM0O,EAAM1yB,EAAWwzB,GAC9B,MAAO33B,GACP,OAAO2kD,GAAQ3kD,GAAKA,EAAI,IAAIwE,GAAMxE,OA8BlCynD,GAAU/L,IAAS,SAASnZ,EAAQmlB,GAKtC,OAJAhnB,GAAUgnB,GAAa,SAAS7sC,GAC9BA,EAAMm1B,GAAMn1B,GACZswB,GAAgB5I,EAAQ1nB,EAAKpF,GAAK8sB,EAAO1nB,GAAM0nB,OAE1CA,KAqGT,SAASkU,GAAS9yC,GAChB,OAAO,WACL,OAAOA,GAkDX,IAAIgkD,GAAOlM,KAuBPmM,GAAYnM,IAAW,GAkB3B,SAASpI,GAAS1vC,GAChB,OAAOA,EA6CT,SAAS68B,GAAS3J,GAChB,OAAOuc,GAA4B,mBAARvc,EAAqBA,EAAOmV,GAAUnV,EA1oe/C,IAmuepB,IAAInT,GAASuyB,IAAS,SAASpxB,EAAM8S,GACnC,OAAO,SAAS4K,GACd,OAAOyO,GAAWzO,EAAQ1d,EAAM8S,OA2BhCkwB,GAAW5R,IAAS,SAAS1T,EAAQ5K,GACvC,OAAO,SAAS9S,GACd,OAAOmsB,GAAWzO,EAAQ1d,EAAM8S,OAwCpC,SAASmwB,GAAMvlB,EAAQ1vB,EAAQ+C,GAC7B,IAAIhb,EAAQsS,GAAK2F,GACb60C,EAAc9X,GAAc/8B,EAAQjY,GAEzB,MAAXgb,GACE4gB,GAAS3jB,KAAY60C,EAAY1qD,SAAWpC,EAAMoC,UACtD4Y,EAAU/C,EACVA,EAAS0vB,EACTA,EAASr/B,KACTwkD,EAAc9X,GAAc/8B,EAAQ3F,GAAK2F,KAE3C,IAAIkwC,IAAUvsB,GAAS5gB,IAAY,UAAWA,IAAcA,EAAQmtC,OAChEpW,EAASkD,GAAWtN,GAqBxB,OAnBA7B,GAAUgnB,GAAa,SAAS3M,GAC9B,IAAIlkB,EAAOhkB,EAAOkoC,GAClBxY,EAAOwY,GAAclkB,EACjB8V,IACFpK,EAAO5wB,UAAUopC,GAAc,WAC7B,IAAIjS,EAAW5lC,KAAK+lC,UACpB,GAAI8Z,GAASja,EAAU,CACrB,IAAI1R,EAASmL,EAAOr/B,KAAK6lC,aACrBwP,EAAUnhB,EAAO4R,YAAc8B,GAAU5nC,KAAK8lC,aAIlD,OAFAuP,EAAQr7C,KAAK,CAAE,KAAQ25B,EAAM,KAAQhlB,UAAW,QAAW0wB,IAC3DnL,EAAO6R,UAAYH,EACZ1R,EAET,OAAOP,EAAK1O,MAAMoa,EAAQlB,GAAU,CAACn+B,KAAKS,SAAUkO,iBAKnD0wB,EAmCT,SAASoc,MAiDT,IAAIoJ,GAAOvK,GAAWpc,IA0BlB4mB,GAAYxK,GAAW5c,IA0BvBqnB,GAAWzK,GAAW/b,IAwB1B,SAAS+R,GAAS3uB,GAChB,OAAOmvB,GAAMnvB,GAAQ8c,GAAaqO,GAAMnrB,IAt0X1C,SAA0BA,GACxB,OAAO,SAAS0d,GACd,OAAOuN,GAAQvN,EAAQ1d,IAo0XwBqjC,CAAiBrjC,GAuEpE,IAAIsjC,GAAQtK,KAsCRuK,GAAavK,IAAY,GAoB7B,SAASiC,KACP,MAAO,GAgBT,SAASO,KACP,OAAO,EA+JT,IA2oBMxtC,GA3oBFzJ,GAAMk0C,IAAoB,SAAS+K,EAAQC,GAC7C,OAAOD,EAASC,IACf,GAuBC3hB,GAAO4X,GAAY,QAiBnBgK,GAASjL,IAAoB,SAASkL,EAAUC,GAClD,OAAOD,EAAWC,IACjB,GAuBC18C,GAAQwyC,GAAY,SAwKpBmK,GAAWpL,IAAoB,SAASqL,EAAYC,GACtD,OAAOD,EAAaC,IACnB,GAuBCC,GAAQtK,GAAY,SAiBpBt1C,GAAWq0C,IAAoB,SAASwL,EAASC,GACnD,OAAOD,EAAUC,IAChB,GAgmBH,OA1iBAxgB,GAAOygB,MAv4MP,SAAeh8C,EAAG6pB,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAIvO,GAAUqN,GAGtB,OADA3oB,EAAIyxC,GAAUzxC,GACP,WACL,KAAMA,EAAI,EACR,OAAO6pB,EAAK1O,MAAMjlB,KAAM2O,aAi4M9B02B,GAAOiU,IAAMA,GACbjU,GAAOr5B,OAASA,GAChBq5B,GAAO6c,SAAWA,GAClB7c,GAAO8c,aAAeA,GACtB9c,GAAO+c,WAAaA,GACpB/c,GAAOta,GAAKA,GACZsa,GAAOmb,OAASA,GAChBnb,GAAO9yB,KAAOA,GACd8yB,GAAOkf,QAAUA,GACjBlf,GAAOob,QAAUA,GACjBpb,GAAO0gB,UAr6KP,WACE,IAAKp3C,UAAU7U,OACb,MAAO,GAET,IAAI2G,EAAQkO,UAAU,GACtB,OAAOiN,GAAQnb,GAASA,EAAQ,CAACA,IAi6KnC4kC,GAAOwa,MAAQA,GACfxa,GAAO2gB,MAn+SP,SAAex4C,EAAOwB,EAAMyoC,GAExBzoC,GADGyoC,EAAQC,GAAelqC,EAAOwB,EAAMyoC,GAASzoC,IAAS/N,GAClD,EAEAkyB,GAAUooB,GAAUvsC,GAAO,GAEpC,IAAIlV,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACvC,IAAKA,GAAUkV,EAAO,EACpB,MAAO,GAMT,IAJA,IAAInV,EAAQ,EACRgkC,EAAW,EACX3J,EAAS1lB,EAAMg1B,GAAW1pC,EAASkV,IAEhCnV,EAAQC,GACbo6B,EAAO2J,KAAc4V,GAAUjmC,EAAO3T,EAAQA,GAASmV,GAEzD,OAAOklB,GAm9STmR,GAAO4gB,QAj8SP,SAAiBz4C,GAMf,IALA,IAAI3T,GAAS,EACTC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACnC+jC,EAAW,EACX3J,EAAS,KAEJr6B,EAAQC,GAAQ,CACvB,IAAI2G,EAAQ+M,EAAM3T,GACd4G,IACFyzB,EAAO2J,KAAcp9B,GAGzB,OAAOyzB,GAs7STmR,GAAOtrC,OA75SP,WACE,IAAID,EAAS6U,UAAU7U,OACvB,IAAKA,EACH,MAAO,GAMT,IAJA,IAAI26B,EAAOjmB,EAAM1U,EAAS,GACtB0T,EAAQmB,UAAU,GAClB9U,EAAQC,EAELD,KACL46B,EAAK56B,EAAQ,GAAK8U,UAAU9U,GAE9B,OAAOskC,GAAUviB,GAAQpO,GAASo6B,GAAUp6B,GAAS,CAACA,GAAQ2+B,GAAY1X,EAAM,KAk5SlF4Q,GAAO6gB,KAlsCP,SAAcxa,GACZ,IAAI5xC,EAAkB,MAAT4xC,EAAgB,EAAIA,EAAM5xC,OACnCogD,EAAapI,KASjB,OAPApG,EAAS5xC,EAAcokC,GAASwN,GAAO,SAAS8P,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAIp2B,GAAUqN,GAEtB,MAAO,CAACynB,EAAWsB,EAAK,IAAKA,EAAK,OAJlB,GAOXzI,IAAS,SAASte,GAEvB,IADA,IAAI56B,GAAS,IACJA,EAAQC,GAAQ,CACvB,IAAI0hD,EAAO9P,EAAM7xC,GACjB,GAAIorB,GAAMu2B,EAAK,GAAIx7C,KAAMy0B,GACvB,OAAOxP,GAAMu2B,EAAK,GAAIx7C,KAAMy0B,QAmrCpC4Q,GAAO8gB,SArpCP,SAAkBx2C,GAChB,OA33YF,SAAsBA,GACpB,IAAIjY,EAAQsS,GAAK2F,GACjB,OAAO,SAAS0vB,GACd,OAAO4L,GAAe5L,EAAQ1vB,EAAQjY,IAw3YjC0uD,CAAatd,GAAUn5B,EAx+dZ,KA6ngBpB01B,GAAOkO,SAAWA,GAClBlO,GAAO2a,QAAUA,GACjB3a,GAAO9gB,OAzsHP,SAAgB9V,EAAW43C,GACzB,IAAInyB,EAASuR,GAAWh3B,GACxB,OAAqB,MAAd43C,EAAqBnyB,EAASqU,GAAWrU,EAAQmyB,IAwsH1DhhB,GAAOihB,MA5sMP,SAASA,EAAM3yB,EAAM4lB,EAAO9B,GAE1B,IAAIvjB,EAAS0nB,GAAWjoB,EA16TN,EA06T6B1yB,EAAWA,EAAWA,EAAWA,EAAWA,EAD3Fs4C,EAAQ9B,EAAQx2C,EAAYs4C,GAG5B,OADArlB,EAAOgM,YAAcomB,EAAMpmB,YACpBhM,GAysMTmR,GAAOkhB,WAhqMP,SAASA,EAAW5yB,EAAM4lB,EAAO9B,GAE/B,IAAIvjB,EAAS0nB,GAAWjoB,EAt9TA,GAs9T6B1yB,EAAWA,EAAWA,EAAWA,EAAWA,EADjGs4C,EAAQ9B,EAAQx2C,EAAYs4C,GAG5B,OADArlB,EAAOgM,YAAcqmB,EAAWrmB,YACzBhM,GA6pMTmR,GAAOhQ,SAAWA,GAClBgQ,GAAOtiB,SAAWA,GAClBsiB,GAAOkd,aAAeA,GACtBld,GAAOub,MAAQA,GACfvb,GAAOwb,MAAQA,GACfxb,GAAO+Y,WAAaA,GACpB/Y,GAAOgZ,aAAeA,GACtBhZ,GAAOiZ,eAAiBA,GACxBjZ,GAAOmhB,KArySP,SAAch5C,EAAO1D,EAAG2tC,GACtB,IAAI39C,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACvC,OAAKA,EAIE25C,GAAUjmC,GADjB1D,EAAK2tC,GAAS3tC,IAAM7I,EAAa,EAAIs6C,GAAUzxC,IACnB,EAAI,EAAIA,EAAGhQ,GAH9B,IAmySXurC,GAAOohB,UApwSP,SAAmBj5C,EAAO1D,EAAG2tC,GAC3B,IAAI39C,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACvC,OAAKA,EAKE25C,GAAUjmC,EAAO,GADxB1D,EAAIhQ,GADJgQ,EAAK2tC,GAAS3tC,IAAM7I,EAAa,EAAIs6C,GAAUzxC,KAEhB,EAAI,EAAIA,GAJ9B,IAkwSXu7B,GAAOqhB,eAxtSP,SAAwBl5C,EAAOmwB,GAC7B,OAAQnwB,GAASA,EAAM1T,OACnBo7C,GAAU1nC,EAAOskC,GAAYnU,EAAW,IAAI,GAAM,GAClD,IAstSN0H,GAAOshB,UAhrSP,SAAmBn5C,EAAOmwB,GACxB,OAAQnwB,GAASA,EAAM1T,OACnBo7C,GAAU1nC,EAAOskC,GAAYnU,EAAW,IAAI,GAC5C,IA8qSN0H,GAAOuhB,KA9oSP,SAAcp5C,EAAO/M,EAAOH,EAAOC,GACjC,IAAIzG,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACvC,OAAKA,GAGDwG,GAAyB,iBAATA,GAAqBo3C,GAAelqC,EAAO/M,EAAOH,KACpEA,EAAQ,EACRC,EAAMzG,GAnuIV,SAAkB0T,EAAO/M,EAAOH,EAAOC,GACrC,IAAIzG,EAAS0T,EAAM1T,OAWnB,KATAwG,EAAQi7C,GAAUj7C,IACN,IACVA,GAASA,EAAQxG,EAAS,EAAKA,EAASwG,IAE1CC,EAAOA,IAAQU,GAAaV,EAAMzG,EAAUA,EAASyhD,GAAUh7C,IACrD,IACRA,GAAOzG,GAETyG,EAAMD,EAAQC,EAAM,EAAI0hD,GAAS1hD,GAC1BD,EAAQC,GACbiN,EAAMlN,KAAWG,EAEnB,OAAO+M,EAstIAq5C,CAASr5C,EAAO/M,EAAOH,EAAOC,IAN5B,IA4oSX8kC,GAAOhqC,OA9tOP,SAAgBsjC,EAAYhB,GAE1B,OADW/hB,GAAQ+iB,GAAcf,GAAcsO,IACnCvN,EAAYmT,GAAYnU,EAAW,KA6tOjD0H,GAAOyhB,QA1oOP,SAAiBnoB,EAAYrB,GAC3B,OAAO6O,GAAY5wC,GAAIojC,EAAYrB,GAAW,IA0oOhD+H,GAAO0hB,YAnnOP,SAAqBpoB,EAAYrB,GAC/B,OAAO6O,GAAY5wC,GAAIojC,EAAYrB,GAAW5H,IAmnOhD2P,GAAO2hB,aA3lOP,SAAsBroB,EAAYrB,EAAU8O,GAE1C,OADAA,EAAQA,IAAUnrC,EAAY,EAAIs6C,GAAUnP,GACrCD,GAAY5wC,GAAIojC,EAAYrB,GAAW8O,IA0lOhD/G,GAAOoX,QAAUA,GACjBpX,GAAO4hB,YAtgSP,SAAqBz5C,GAEnB,OADsB,MAATA,GAAoBA,EAAM1T,OACvBqyC,GAAY3+B,EAAOkoB,GAAY,IAqgSjD2P,GAAO6hB,aA9+RP,SAAsB15C,EAAO4+B,GAE3B,OADsB,MAAT5+B,GAAoBA,EAAM1T,OAKhCqyC,GAAY3+B,EADnB4+B,EAAQA,IAAUnrC,EAAY,EAAIs6C,GAAUnP,IAFnC,IA4+RX/G,GAAO8hB,KA57LP,SAAcxzB,GACZ,OAAOioB,GAAWjoB,EAzsUD,MAqogBnB0R,GAAOof,KAAOA,GACdpf,GAAOqf,UAAYA,GACnBrf,GAAO+hB,UA19RP,SAAmB1b,GAKjB,IAJA,IAAI7xC,GAAS,EACTC,EAAkB,MAAT4xC,EAAgB,EAAIA,EAAM5xC,OACnCo6B,EAAS,KAEJr6B,EAAQC,GAAQ,CACvB,IAAI0hD,EAAO9P,EAAM7xC,GACjBq6B,EAAOsnB,EAAK,IAAMA,EAAK,GAEzB,OAAOtnB,GAk9RTmR,GAAOgiB,UA96GP,SAAmBhoB,GACjB,OAAiB,MAAVA,EAAiB,GAAKqN,GAAcrN,EAAQr1B,GAAKq1B,KA86G1DgG,GAAOiiB,YAp5GP,SAAqBjoB,GACnB,OAAiB,MAAVA,EAAiB,GAAKqN,GAAcrN,EAAQyK,GAAOzK,KAo5G5DgG,GAAO8a,QAAUA,GACjB9a,GAAOkiB,QA34RP,SAAiB/5C,GAEf,OADsB,MAATA,GAAoBA,EAAM1T,OACvB25C,GAAUjmC,EAAO,GAAI,GAAK,IA04R5C63B,GAAOqZ,aAAeA,GACtBrZ,GAAOuZ,eAAiBA,GACxBvZ,GAAOwZ,iBAAmBA,GAC1BxZ,GAAOod,OAASA,GAChBpd,GAAOqd,SAAWA,GAClBrd,GAAO+a,UAAYA,GACnB/a,GAAO/H,SAAWA,GAClB+H,GAAOgb,MAAQA,GACfhb,GAAOr7B,KAAOA,GACdq7B,GAAOyE,OAASA,GAChBzE,GAAO9pC,IAAMA,GACb8pC,GAAOmiB,QA7pGP,SAAiBnoB,EAAQ/B,GACvB,IAAIpJ,EAAS,GAMb,OALAoJ,EAAWwU,GAAYxU,EAAU,GAEjCuO,GAAWxM,GAAQ,SAAS5+B,EAAOkX,EAAK0nB,GACtC4I,GAAgB/T,EAAQoJ,EAAS78B,EAAOkX,EAAK0nB,GAAS5+B,MAEjDyzB,GAupGTmR,GAAOoiB,UAxnGP,SAAmBpoB,EAAQ/B,GACzB,IAAIpJ,EAAS,GAMb,OALAoJ,EAAWwU,GAAYxU,EAAU,GAEjCuO,GAAWxM,GAAQ,SAAS5+B,EAAOkX,EAAK0nB,GACtC4I,GAAgB/T,EAAQvc,EAAK2lB,EAAS78B,EAAOkX,EAAK0nB,OAE7CnL,GAknGTmR,GAAOqiB,QAlgCP,SAAiB/3C,GACf,OAAO0gC,GAAYvH,GAAUn5B,EA1qeX,KA4qgBpB01B,GAAOsiB,gBAr+BP,SAAyBhmC,EAAMouB,GAC7B,OAAOK,GAAoBzuB,EAAMmnB,GAAUiH,EAxsezB,KA6qgBpB1K,GAAO2Y,QAAUA,GACjB3Y,GAAO0d,MAAQA,GACf1d,GAAOmd,UAAYA,GACnBnd,GAAO7kB,OAASA,GAChB6kB,GAAOsf,SAAWA,GAClBtf,GAAOuf,MAAQA,GACfvf,GAAO4b,OAASA,GAChB5b,GAAOuiB,OA9yBP,SAAgB99C,GAEd,OADAA,EAAIyxC,GAAUzxC,GACPipC,IAAS,SAASte,GACvB,OAAOid,GAAQjd,EAAM3qB,OA4yBzBu7B,GAAO2d,KAAOA,GACd3d,GAAOwiB,OAt/FP,SAAgBxoB,EAAQ1B,GACtB,OAAOwlB,GAAO9jB,EAAQ4hB,GAAOnP,GAAYnU,MAs/F3C0H,GAAOnf,KAh2LP,SAAcyN,GACZ,OAAO6sB,GAAO,EAAG7sB,IAg2LnB0R,GAAOyiB,QAx2NP,SAAiBnpB,EAAYiT,EAAWC,EAAQ4F,GAC9C,OAAkB,MAAd9Y,EACK,IAEJ/iB,GAAQg2B,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAGnCh2B,GADLi2B,EAAS4F,EAAQx2C,EAAY4wC,KAE3BA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BF,GAAYhT,EAAYiT,EAAWC,KA81N5CxM,GAAOwf,KAAOA,GACdxf,GAAO6b,SAAWA,GAClB7b,GAAOyf,UAAYA,GACnBzf,GAAO0f,SAAWA,GAClB1f,GAAOgc,QAAUA,GACjBhc,GAAOic,aAAeA,GACtBjc,GAAOib,UAAYA,GACnBjb,GAAO3D,KAAOA,GACd2D,GAAO8d,OAASA,GAChB9d,GAAOiL,SAAWA,GAClBjL,GAAO0iB,WA/rBP,SAAoB1oB,GAClB,OAAO,SAAS1d,GACd,OAAiB,MAAV0d,EAAiBp+B,EAAY2rC,GAAQvN,EAAQ1d,KA8rBxD0jB,GAAOyZ,KAAOA,GACdzZ,GAAO0Z,QAAUA,GACjB1Z,GAAO2iB,UAnqRP,SAAmBx6C,EAAOC,EAAQ6vB,GAChC,OAAQ9vB,GAASA,EAAM1T,QAAU2T,GAAUA,EAAO3T,OAC9C44C,GAAYllC,EAAOC,EAAQqkC,GAAYxU,EAAU,IACjD9vB,GAiqRN63B,GAAO4iB,YAvoRP,SAAqBz6C,EAAOC,EAAQwwB,GAClC,OAAQzwB,GAASA,EAAM1T,QAAU2T,GAAUA,EAAO3T,OAC9C44C,GAAYllC,EAAOC,EAAQxM,EAAWg9B,GACtCzwB,GAqoRN63B,GAAO2Z,OAASA,GAChB3Z,GAAO4f,MAAQA,GACf5f,GAAO6f,WAAaA,GACpB7f,GAAOkc,MAAQA,GACflc,GAAO6iB,OA3tNP,SAAgBvpB,EAAYhB,GAE1B,OADW/hB,GAAQ+iB,GAAcf,GAAcsO,IACnCvN,EAAYsiB,GAAOnP,GAAYnU,EAAW,MA0tNxD0H,GAAO8iB,OAxkRP,SAAgB36C,EAAOmwB,GACrB,IAAIzJ,EAAS,GACb,IAAM1mB,IAASA,EAAM1T,OACnB,OAAOo6B,EAET,IAAIr6B,GAAS,EACT+4C,EAAU,GACV94C,EAAS0T,EAAM1T,OAGnB,IADA6jC,EAAYmU,GAAYnU,EAAW,KAC1B9jC,EAAQC,GAAQ,CACvB,IAAI2G,EAAQ+M,EAAM3T,GACd8jC,EAAUl9B,EAAO5G,EAAO2T,KAC1B0mB,EAAOl6B,KAAKyG,GACZmyC,EAAQ54C,KAAKH,IAIjB,OADA84C,GAAWnlC,EAAOolC,GACX1e,GAujRTmR,GAAO+iB,KArsLP,SAAcz0B,EAAMrzB,GAClB,GAAmB,mBAARqzB,EACT,MAAM,IAAIvO,GAAUqN,GAGtB,OAAOsgB,GAASpf,EADhBrzB,EAAQA,IAAUW,EAAYX,EAAQi7C,GAAUj7C,KAksLlD+kC,GAAOf,QAAUA,GACjBe,GAAOgjB,WAnrNP,SAAoB1pB,EAAY70B,EAAG2tC,GAOjC,OALE3tC,GADG2tC,EAAQC,GAAe/Y,EAAY70B,EAAG2tC,GAAS3tC,IAAM7I,GACpD,EAEAs6C,GAAUzxC,IAEL8R,GAAQ+iB,GAAc+I,GAAkByL,IACvCxU,EAAY70B,IA6qN1Bu7B,GAAOhgB,IA14FP,SAAaga,EAAQ1d,EAAMlhB,GACzB,OAAiB,MAAV4+B,EAAiBA,EAASoT,GAAQpT,EAAQ1d,EAAMlhB,IA04FzD4kC,GAAOijB,QA/2FP,SAAiBjpB,EAAQ1d,EAAMlhB,EAAOuoC,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa/nC,EAC3C,MAAVo+B,EAAiBA,EAASoT,GAAQpT,EAAQ1d,EAAMlhB,EAAOuoC,IA82FhE3D,GAAO3uB,QA7pNP,SAAiBioB,GAEf,OADW/iB,GAAQ+iB,GAAcmJ,GAAe0L,IACpC7U,IA4pNd0G,GAAO7pC,MA/gRP,SAAegS,EAAOlN,EAAOC,GAC3B,IAAIzG,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACvC,OAAKA,GAGDyG,GAAqB,iBAAPA,GAAmBm3C,GAAelqC,EAAOlN,EAAOC,IAChED,EAAQ,EACRC,EAAMzG,IAGNwG,EAAiB,MAATA,EAAgB,EAAIi7C,GAAUj7C,GACtCC,EAAMA,IAAQU,EAAYnH,EAASyhD,GAAUh7C,IAExCkzC,GAAUjmC,EAAOlN,EAAOC,IAVtB,IA6gRX8kC,GAAOkb,OAASA,GAChBlb,GAAOkjB,WAv1QP,SAAoB/6C,GAClB,OAAQA,GAASA,EAAM1T,OACnB46C,GAAelnC,GACf,IAq1QN63B,GAAOmjB,aAl0QP,SAAsBh7C,EAAO8vB,GAC3B,OAAQ9vB,GAASA,EAAM1T,OACnB46C,GAAelnC,EAAOskC,GAAYxU,EAAU,IAC5C,IAg0QN+H,GAAOhE,MA//DP,SAAeb,EAAQnnC,EAAWovD,GAKhC,OAJIA,GAAyB,iBAATA,GAAqB/Q,GAAelX,EAAQnnC,EAAWovD,KACzEpvD,EAAYovD,EAAQxnD,IAEtBwnD,EAAQA,IAAUxnD,EAAY40B,EAAmB4yB,IAAU,IAI3DjoB,EAASrvB,GAASqvB,MAEQ,iBAAbnnC,GACO,MAAbA,IAAsB0jC,GAAS1jC,OAEpCA,EAAYu7C,GAAav7C,KACPknC,GAAWC,GACpBuV,GAAU5U,GAAcX,GAAS,EAAGioB,GAGxCjoB,EAAOa,MAAMhoC,EAAWovD,GAZtB,IA0/DXpjB,GAAOqjB,OAtqLP,SAAgB/0B,EAAMrzB,GACpB,GAAmB,mBAARqzB,EACT,MAAM,IAAIvO,GAAUqN,GAGtB,OADAnyB,EAAiB,MAATA,EAAgB,EAAI6yB,GAAUooB,GAAUj7C,GAAQ,GACjDyyC,IAAS,SAASte,GACvB,IAAIjnB,EAAQinB,EAAKn0B,GACb88C,EAAYrH,GAAUthB,EAAM,EAAGn0B,GAKnC,OAHIkN,GACF2wB,GAAUif,EAAW5vC,GAEhByX,GAAM0O,EAAM3zB,KAAMo9C,OA2pL7B/X,GAAOsjB,KAjzQP,SAAcn7C,GACZ,IAAI1T,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACvC,OAAOA,EAAS25C,GAAUjmC,EAAO,EAAG1T,GAAU,IAgzQhDurC,GAAOujB,KApxQP,SAAcp7C,EAAO1D,EAAG2tC,GACtB,OAAMjqC,GAASA,EAAM1T,OAId25C,GAAUjmC,EAAO,GADxB1D,EAAK2tC,GAAS3tC,IAAM7I,EAAa,EAAIs6C,GAAUzxC,IAChB,EAAI,EAAIA,GAH9B,IAmxQXu7B,GAAOwjB,UApvQP,SAAmBr7C,EAAO1D,EAAG2tC,GAC3B,IAAI39C,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACvC,OAAKA,EAKE25C,GAAUjmC,GADjB1D,EAAIhQ,GADJgQ,EAAK2tC,GAAS3tC,IAAM7I,EAAa,EAAIs6C,GAAUzxC,KAEnB,EAAI,EAAIA,EAAGhQ,GAJ9B,IAkvQXurC,GAAOyjB,eAxsQP,SAAwBt7C,EAAOmwB,GAC7B,OAAQnwB,GAASA,EAAM1T,OACnBo7C,GAAU1nC,EAAOskC,GAAYnU,EAAW,IAAI,GAAO,GACnD,IAssQN0H,GAAO0jB,UAhqQP,SAAmBv7C,EAAOmwB,GACxB,OAAQnwB,GAASA,EAAM1T,OACnBo7C,GAAU1nC,EAAOskC,GAAYnU,EAAW,IACxC,IA8pQN0H,GAAO2jB,IAnsPP,SAAavoD,EAAOq/C,GAElB,OADAA,EAAYr/C,GACLA,GAksPT4kC,GAAO4jB,SAjnLP,SAAkBt1B,EAAMC,EAAMlhB,GAC5B,IAAImhB,GAAU,EACVC,GAAW,EAEf,GAAmB,mBAARH,EACT,MAAM,IAAIvO,GAAUqN,GAMtB,OAJIa,GAAS5gB,KACXmhB,EAAU,YAAanhB,IAAYA,EAAQmhB,QAAUA,EACrDC,EAAW,aAAcphB,IAAYA,EAAQohB,SAAWA,GAEnDuB,GAAS1B,EAAMC,EAAM,CAC1B,QAAWC,EACX,QAAWD,EACX,SAAYE,KAomLhBuR,GAAOsT,KAAOA,GACdtT,GAAOyc,QAAUA,GACjBzc,GAAOge,QAAUA,GACjBhe,GAAOie,UAAYA,GACnBje,GAAO6jB,OArfP,SAAgBzoD,GACd,OAAImb,GAAQnb,GACHy9B,GAASz9B,EAAOqsC,IAElBrZ,GAAShzB,GAAS,CAACA,GAASmnC,GAAUiO,GAAa1kC,GAAS1Q,MAkfrE4kC,GAAOmM,cAAgBA,GACvBnM,GAAO1E,UA7yFP,SAAmBtB,EAAQ/B,EAAUC,GACnC,IAAI0J,EAAQrrB,GAAQyjB,GAChB8pB,EAAYliB,GAASpD,GAASxE,IAAWlC,GAAakC,GAG1D,GADA/B,EAAWwU,GAAYxU,EAAU,GACd,MAAfC,EAAqB,CACvB,IAAI4M,EAAO9K,GAAUA,EAAOz/B,YAE1B29B,EADE4rB,EACYliB,EAAQ,IAAIkD,EAAO,GAE1B7W,GAAS+L,IACFsN,GAAWxC,GAAQ1E,GAAW9C,GAAatD,IAG3C,GAMlB,OAHC8pB,EAAY3rB,GAAYqO,IAAYxM,GAAQ,SAAS5+B,EAAO5G,EAAOwlC,GAClE,OAAO/B,EAASC,EAAa98B,EAAO5G,EAAOwlC,MAEtC9B,GA0xFT8H,GAAO+jB,MAxlLP,SAAez1B,GACb,OAAO2lB,GAAI3lB,EAAM,IAwlLnB0R,GAAO4Z,MAAQA,GACf5Z,GAAO6Z,QAAUA,GACjB7Z,GAAO8Z,UAAYA,GACnB9Z,GAAOgkB,KAxkQP,SAAc77C,GACZ,OAAQA,GAASA,EAAM1T,OAAU+6C,GAASrnC,GAAS,IAwkQrD63B,GAAOikB,OA9iQP,SAAgB97C,EAAO8vB,GACrB,OAAQ9vB,GAASA,EAAM1T,OAAU+6C,GAASrnC,EAAOskC,GAAYxU,EAAU,IAAM,IA8iQ/E+H,GAAOkkB,SAvhQP,SAAkB/7C,EAAOywB,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAah9B,EACpDuM,GAASA,EAAM1T,OAAU+6C,GAASrnC,EAAOvM,EAAWg9B,GAAc,IAshQ5EoH,GAAOmkB,MAnwFP,SAAenqB,EAAQ1d,GACrB,OAAiB,MAAV0d,GAAwBwT,GAAUxT,EAAQ1d,IAmwFnD0jB,GAAO+Z,MAAQA,GACf/Z,GAAOia,UAAYA,GACnBja,GAAOokB,OAvuFP,SAAgBpqB,EAAQ1d,EAAMszB,GAC5B,OAAiB,MAAV5V,EAAiBA,EAAS2V,GAAW3V,EAAQ1d,EAAMi0B,GAAaX,KAuuFzE5P,GAAOqkB,WA5sFP,SAAoBrqB,EAAQ1d,EAAMszB,EAASjM,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa/nC,EAC3C,MAAVo+B,EAAiBA,EAAS2V,GAAW3V,EAAQ1d,EAAMi0B,GAAaX,GAAUjM,IA2sFnF3D,GAAO53B,OAASA,GAChB43B,GAAOskB,SAnpFP,SAAkBtqB,GAChB,OAAiB,MAAVA,EAAiB,GAAKK,GAAWL,EAAQyK,GAAOzK,KAmpFzDgG,GAAOka,QAAUA,GACjBla,GAAO4S,MAAQA,GACf5S,GAAOpZ,KA9kLP,SAAcxrB,EAAOm4C,GACnB,OAAOyI,GAAQzL,GAAagD,GAAUn4C,IA8kLxC4kC,GAAOma,IAAMA,GACbna,GAAOoa,MAAQA,GACfpa,GAAOqa,QAAUA,GACjBra,GAAOsa,IAAMA,GACbta,GAAOukB,UAh1PP,SAAmBlyD,EAAO+V,GACxB,OAAO+nC,GAAc99C,GAAS,GAAI+V,GAAU,GAAIy6B,KAg1PlD7C,GAAOwkB,cA9zPP,SAAuBnyD,EAAO+V,GAC5B,OAAO+nC,GAAc99C,GAAS,GAAI+V,GAAU,GAAIglC,KA8zPlDpN,GAAOua,QAAUA,GAGjBva,GAAOmB,QAAU6c,GACjBhe,GAAOykB,UAAYxG,GACnBje,GAAO/kB,OAAS4hC,GAChB7c,GAAO0kB,WAAa5H,GAGpByC,GAAMvf,GAAQA,IAKdA,GAAOn/B,IAAMA,GACbm/B,GAAOif,QAAUA,GACjBjf,GAAOke,UAAYA,GACnBle,GAAOqe,WAAaA,GACpBre,GAAO5B,KAAOA,GACd4B,GAAO2kB,MAvpFP,SAAerhB,EAAQC,EAAOC,GAa5B,OAZIA,IAAU5nC,IACZ4nC,EAAQD,EACRA,EAAQ3nC,GAEN4nC,IAAU5nC,IAEZ4nC,GADAA,EAAQtV,GAASsV,KACCA,EAAQA,EAAQ,GAEhCD,IAAU3nC,IAEZ2nC,GADAA,EAAQrV,GAASqV,KACCA,EAAQA,EAAQ,GAE7Bf,GAAUtU,GAASoV,GAASC,EAAOC,IA2oF5CxD,GAAOjjC,MAhiLP,SAAe3B,GACb,OAAOqoC,GAAUroC,EAlvVI,IAkxgBvB4kC,GAAO4kB,UAv+KP,SAAmBxpD,GACjB,OAAOqoC,GAAUroC,EAAOwiD,IAu+K1B5d,GAAO6kB,cAx8KP,SAAuBzpD,EAAOuoC,GAE5B,OAAOF,GAAUroC,EAAOwiD,EADxBja,EAAkC,mBAAdA,EAA2BA,EAAa/nC,IAw8K9DokC,GAAO8kB,UAhgLP,SAAmB1pD,EAAOuoC,GAExB,OAAOF,GAAUroC,EAtxVI,EAqxVrBuoC,EAAkC,mBAAdA,EAA2BA,EAAa/nC,IAggL9DokC,GAAO+kB,WA76KP,SAAoB/qB,EAAQ1vB,GAC1B,OAAiB,MAAVA,GAAkBs7B,GAAe5L,EAAQ1vB,EAAQ3F,GAAK2F,KA66K/D01B,GAAO6S,OAASA,GAChB7S,GAAOglB,UAjwCP,SAAmB5pD,EAAOgjB,GACxB,OAAiB,MAAThjB,GAAiBA,GAAUA,EAASgjB,EAAehjB,GAiwC7D4kC,GAAOggB,OAASA,GAChBhgB,GAAOilB,SA57EP,SAAkB9pB,EAAQlyB,EAAQi8C,GAChC/pB,EAASrvB,GAASqvB,GAClBlyB,EAASsmC,GAAatmC,GAEtB,IAAIxU,EAAS0mC,EAAO1mC,OAKhByG,EAJJgqD,EAAWA,IAAatpD,EACpBnH,EACA+tC,GAAU0T,GAAUgP,GAAW,EAAGzwD,GAItC,OADAywD,GAAYj8C,EAAOxU,SACA,GAAK0mC,EAAOhlC,MAAM+uD,EAAUhqD,IAAQ+N,GAk7EzD+2B,GAAO2C,GAAKA,GACZ3C,GAAOmlB,OAp5EP,SAAgBhqB,GAEd,OADAA,EAASrvB,GAASqvB,KACAxI,EAAmBh1B,KAAKw9B,GACtCA,EAAOj9B,QAAQu0B,EAAiBsI,IAChCI,GAi5EN6E,GAAOolB,aA/3EP,SAAsBjqB,GAEpB,OADAA,EAASrvB,GAASqvB,KACAhI,GAAgBx1B,KAAKw9B,GACnCA,EAAOj9B,QAAQg1B,GAAc,QAC7BiI,GA43EN6E,GAAOqlB,MA35OP,SAAe/rB,EAAYhB,EAAW8Z,GACpC,IAAI9jB,EAAO/X,GAAQ+iB,GAAcjB,GAAasO,GAI9C,OAHIyL,GAASC,GAAe/Y,EAAYhB,EAAW8Z,KACjD9Z,EAAY18B,GAEP0yB,EAAKgL,EAAYmT,GAAYnU,EAAW,KAu5OjD0H,GAAOn6B,KAAOA,GACdm6B,GAAOkZ,UAAYA,GACnBlZ,GAAOslB,QAxvHP,SAAiBtrB,EAAQ1B,GACvB,OAAOe,GAAYW,EAAQyS,GAAYnU,EAAW,GAAIkO,KAwvHxDxG,GAAO4a,SAAWA,GAClB5a,GAAOmZ,cAAgBA,GACvBnZ,GAAOulB,YAptHP,SAAqBvrB,EAAQ1B,GAC3B,OAAOe,GAAYW,EAAQyS,GAAYnU,EAAW,GAAIoO,KAotHxD1G,GAAOx8B,MAAQA,GACfw8B,GAAOp7B,QAAUA,GACjBo7B,GAAO6a,aAAeA,GACtB7a,GAAOwlB,MAxrHP,SAAexrB,EAAQ/B,GACrB,OAAiB,MAAV+B,EACHA,EACAkN,GAAQlN,EAAQyS,GAAYxU,EAAU,GAAIwM,KAsrHhDzE,GAAOylB,WAzpHP,SAAoBzrB,EAAQ/B,GAC1B,OAAiB,MAAV+B,EACHA,EACAoN,GAAapN,EAAQyS,GAAYxU,EAAU,GAAIwM,KAupHrDzE,GAAO0lB,OAxnHP,SAAgB1rB,EAAQ/B,GACtB,OAAO+B,GAAUwM,GAAWxM,EAAQyS,GAAYxU,EAAU,KAwnH5D+H,GAAO2lB,YA3lHP,SAAqB3rB,EAAQ/B,GAC3B,OAAO+B,GAAU0M,GAAgB1M,EAAQyS,GAAYxU,EAAU,KA2lHjE+H,GAAO3+B,IAAMA,GACb2+B,GAAO1Z,GAAKA,GACZ0Z,GAAOmc,IAAMA,GACbnc,GAAO5mB,IA5+GP,SAAa4gB,EAAQ1d,GACnB,OAAiB,MAAV0d,GAAkBwd,GAAQxd,EAAQ1d,EAAM4rB,KA4+GjDlI,GAAO2L,MAAQA,GACf3L,GAAOoZ,KAAOA,GACdpZ,GAAO8K,SAAWA,GAClB9K,GAAOv6B,SA/nOP,SAAkB6zB,EAAYl+B,EAAOq+B,EAAW2Y,GAC9C9Y,EAAagS,GAAYhS,GAAcA,EAAalxB,GAAOkxB,GAC3DG,EAAaA,IAAc2Y,EAAS8D,GAAUzc,GAAa,EAE3D,IAAIhlC,EAAS6kC,EAAW7kC,OAIxB,OAHIglC,EAAY,IACdA,EAAY3L,GAAUr5B,EAASglC,EAAW,IAErC8iB,GAASjjB,GACXG,GAAahlC,GAAU6kC,EAAWxZ,QAAQ1kB,EAAOq+B,IAAc,IAC7DhlC,GAAUikC,GAAYY,EAAYl+B,EAAOq+B,IAAc,GAsnOhEuG,GAAOlgB,QA7jSP,SAAiB3X,EAAO/M,EAAOq+B,GAC7B,IAAIhlC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAID,EAAqB,MAAbilC,EAAoB,EAAIyc,GAAUzc,GAI9C,OAHIjlC,EAAQ,IACVA,EAAQs5B,GAAUr5B,EAASD,EAAO,IAE7BkkC,GAAYvwB,EAAO/M,EAAO5G,IAqjSnCwrC,GAAO4lB,QAroFP,SAAiBtiB,EAAQroC,EAAOC,GAS9B,OARAD,EAAQu6C,GAASv6C,GACbC,IAAQU,GACVV,EAAMD,EACNA,EAAQ,GAERC,EAAMs6C,GAASt6C,GA3qVnB,SAAqBooC,EAAQroC,EAAOC,GAClC,OAAOooC,GAAUvV,GAAU9yB,EAAOC,IAAQooC,EAASxV,GAAU7yB,EAAOC,GA6qV7D2qD,CADPviB,EAASpV,GAASoV,GACSroC,EAAOC,IA6nFpC8kC,GAAOsd,OAASA,GAChBtd,GAAO8B,YAAcA,GACrB9B,GAAOzpB,QAAUA,GACjBypB,GAAO5I,cAAgBA,GACvB4I,GAAOsL,YAAcA,GACrBtL,GAAOiM,kBAAoBA,GAC3BjM,GAAO8lB,UAzuKP,SAAmB1qD,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtB+yB,GAAa/yB,IAAUysC,GAAWzsC,IAAUw1B,GAwuKjDoP,GAAOxB,SAAWA,GAClBwB,GAAO1I,OAASA,GAChB0I,GAAO+lB,UAhrKP,SAAmB3qD,GACjB,OAAO+yB,GAAa/yB,IAA6B,IAAnBA,EAAMs7B,WAAmBwV,GAAc9wC,IAgrKvE4kC,GAAOgmB,QA5oKP,SAAiB5qD,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIkwC,GAAYlwC,KACXmb,GAAQnb,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMqiC,QAC1De,GAASpjC,IAAU08B,GAAa18B,IAAU0mC,GAAY1mC,IAC1D,OAAQA,EAAM3G,OAEhB,IAAIyvC,EAAMC,GAAO/oC,GACjB,GAAI8oC,GAAOjT,GAAUiT,GAAO5S,EAC1B,OAAQl2B,EAAMuO,KAEhB,GAAIwhC,GAAY/vC,GACd,OAAQ8vC,GAAS9vC,GAAO3G,OAE1B,IAAK,IAAI6d,KAAOlX,EACd,GAAI+a,GAAe9M,KAAKjO,EAAOkX,GAC7B,OAAO,EAGX,OAAO,GAwnKT0tB,GAAOhhC,QAzlKP,SAAiB5D,EAAOhG,GACtB,OAAOyzC,GAAYztC,EAAOhG,IAylK5B4qC,GAAOimB,YAtjKP,SAAqB7qD,EAAOhG,EAAOuuC,GAEjC,IAAI9U,GADJ8U,EAAkC,mBAAdA,EAA2BA,EAAa/nC,GAClC+nC,EAAWvoC,EAAOhG,GAASwG,EACrD,OAAOizB,IAAWjzB,EAAYitC,GAAYztC,EAAOhG,EAAOwG,EAAW+nC,KAAgB9U,GAojKrFmR,GAAOoc,QAAUA,GACjBpc,GAAOtB,SA7/JP,SAAkBtjC,GAChB,MAAuB,iBAATA,GAAqBqjC,GAAerjC,IA6/JpD4kC,GAAOsH,WAAaA,GACpBtH,GAAOqc,UAAYA,GACnBrc,GAAO0X,SAAWA,GAClB1X,GAAOxI,MAAQA,GACfwI,GAAOkmB,QA7zJP,SAAiBlsB,EAAQ1vB,GACvB,OAAO0vB,IAAW1vB,GAAUigC,GAAYvQ,EAAQ1vB,EAAQihC,GAAajhC,KA6zJvE01B,GAAOmmB,YA1xJP,SAAqBnsB,EAAQ1vB,EAAQq5B,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa/nC,EACrD2uC,GAAYvQ,EAAQ1vB,EAAQihC,GAAajhC,GAASq5B,IAyxJ3D3D,GAAO9hB,MA1vJP,SAAe9iB,GAIb,OAAOkhD,GAASlhD,IAAUA,IAAUA,GAuvJtC4kC,GAAOomB,SA1tJP,SAAkBhrD,GAChB,GAAIy8C,GAAWz8C,GACb,MAAM,IAAIa,GAloXM,mEAooXlB,OAAO2uC,GAAaxvC,IAutJtB4kC,GAAOqmB,MA3qJP,SAAejrD,GACb,OAAgB,MAATA,GA2qJT4kC,GAAO5hC,OApsJP,SAAgBhD,GACd,OAAiB,OAAVA,GAosJT4kC,GAAOsc,SAAWA,GAClBtc,GAAO/R,SAAWA,GAClB+R,GAAO7R,aAAeA,GACtB6R,GAAOkM,cAAgBA,GACvBlM,GAAOtI,SAAWA,GAClBsI,GAAOsmB,cAxjJP,SAAuBlrD,GACrB,OAAOihD,GAAUjhD,IAAUA,IAAS,kBAAqBA,GAASk1B,GAwjJpE0P,GAAOpI,MAAQA,GACfoI,GAAOuc,SAAWA,GAClBvc,GAAO5R,SAAWA,GAClB4R,GAAOlI,aAAeA,GACtBkI,GAAOumB,YAt9IP,SAAqBnrD,GACnB,OAAOA,IAAUQ,GAs9InBokC,GAAOwmB,UAl8IP,SAAmBprD,GACjB,OAAO+yB,GAAa/yB,IAAU+oC,GAAO/oC,IAAUq2B,GAk8IjDuO,GAAOymB,UA96IP,SAAmBrrD,GACjB,OAAO+yB,GAAa/yB,IAh2XP,oBAg2XiBysC,GAAWzsC,IA86I3C4kC,GAAO3lC,KAx9RP,SAAc8N,EAAOnU,GACnB,OAAgB,MAATmU,EAAgB,GAAKw2B,GAAWt1B,KAAKlB,EAAOnU,IAw9RrDgsC,GAAOue,UAAYA,GACnBve,GAAO2I,KAAOA,GACd3I,GAAO0mB,YA/6RP,SAAqBv+C,EAAO/M,EAAOq+B,GACjC,IAAIhlC,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAID,EAAQC,EAKZ,OAJIglC,IAAc79B,IAEhBpH,GADAA,EAAQ0hD,GAAUzc,IACF,EAAI3L,GAAUr5B,EAASD,EAAO,GAAKu5B,GAAUv5B,EAAOC,EAAS,IAExE2G,GAAUA,EAhtMrB,SAA2B+M,EAAO/M,EAAOq+B,GAEvC,IADA,IAAIjlC,EAAQilC,EAAY,EACjBjlC,KACL,GAAI2T,EAAM3T,KAAW4G,EACnB,OAAO5G,EAGX,OAAOA,EA0sMDmyD,CAAkBx+C,EAAO/M,EAAO5G,GAChCglC,GAAcrxB,EAAOyxB,GAAWplC,GAAO,IAo6R7CwrC,GAAOwe,UAAYA,GACnBxe,GAAOye,WAAaA,GACpBze,GAAO3Z,GAAKA,GACZ2Z,GAAOwc,IAAMA,GACbxc,GAAO9wB,IAhfP,SAAa/G,GACX,OAAQA,GAASA,EAAM1T,OACnBmyC,GAAaz+B,EAAO2iC,GAAU7C,IAC9BrsC,GA8eNokC,GAAO4mB,MApdP,SAAez+C,EAAO8vB,GACpB,OAAQ9vB,GAASA,EAAM1T,OACnBmyC,GAAaz+B,EAAOskC,GAAYxU,EAAU,GAAIgQ,IAC9CrsC,GAkdNokC,GAAO6mB,KAjcP,SAAc1+C,GACZ,OAAO2xB,GAAS3xB,EAAO2iC,KAiczB9K,GAAO8mB,OAvaP,SAAgB3+C,EAAO8vB,GACrB,OAAO6B,GAAS3xB,EAAOskC,GAAYxU,EAAU,KAua/C+H,GAAO/wB,IAlZP,SAAa9G,GACX,OAAQA,GAASA,EAAM1T,OACnBmyC,GAAaz+B,EAAO2iC,GAAUM,IAC9BxvC,GAgZNokC,GAAO+mB,MAtXP,SAAe5+C,EAAO8vB,GACpB,OAAQ9vB,GAASA,EAAM1T,OACnBmyC,GAAaz+B,EAAOskC,GAAYxU,EAAU,GAAImT,IAC9CxvC,GAoXNokC,GAAOuX,UAAYA,GACnBvX,GAAO8X,UAAYA,GACnB9X,GAAOgnB,WAztBP,WACE,MAAO,IAytBThnB,GAAOinB,WAzsBP,WACE,MAAO,IAysBTjnB,GAAOknB,SAzrBP,WACE,OAAO,GAyrBTlnB,GAAOmgB,SAAWA,GAClBngB,GAAOmnB,IA55RP,SAAah/C,EAAO1D,GAClB,OAAQ0D,GAASA,EAAM1T,OAAU43C,GAAQlkC,EAAO+tC,GAAUzxC,IAAM7I,GA45RlEokC,GAAOonB,WAvhCP,WAIE,OAHI7zD,GAAK4R,IAAMxK,OACbpH,GAAK4R,EAAI83B,IAEJtiC,MAohCTqlC,GAAOoW,KAAOA,GACdpW,GAAOhS,IAAMA,GACbgS,GAAOqnB,IAp3EP,SAAalsB,EAAQ1mC,EAAQ2gD,GAC3Bja,EAASrvB,GAASqvB,GAGlB,IAAImsB,GAFJ7yD,EAASyhD,GAAUzhD,IAEMknC,GAAWR,GAAU,EAC9C,IAAK1mC,GAAU6yD,GAAa7yD,EAC1B,OAAO0mC,EAET,IAAIuT,GAAOj6C,EAAS6yD,GAAa,EACjC,OACEnS,GAAc9W,GAAYqQ,GAAM0G,GAChCja,EACAga,GAAchX,GAAWuQ,GAAM0G,IAy2EnCpV,GAAOunB,OA90EP,SAAgBpsB,EAAQ1mC,EAAQ2gD,GAC9Bja,EAASrvB,GAASqvB,GAGlB,IAAImsB,GAFJ7yD,EAASyhD,GAAUzhD,IAEMknC,GAAWR,GAAU,EAC9C,OAAQ1mC,GAAU6yD,EAAY7yD,EACzB0mC,EAASga,GAAc1gD,EAAS6yD,EAAWlS,GAC5Cja,GAw0EN6E,GAAOwnB,SA9yEP,SAAkBrsB,EAAQ1mC,EAAQ2gD,GAChCja,EAASrvB,GAASqvB,GAGlB,IAAImsB,GAFJ7yD,EAASyhD,GAAUzhD,IAEMknC,GAAWR,GAAU,EAC9C,OAAQ1mC,GAAU6yD,EAAY7yD,EACzB0gD,GAAc1gD,EAAS6yD,EAAWlS,GAASja,EAC5CA,GAwyEN6E,GAAOtS,SA7wEP,SAAkByN,EAAQssB,EAAOrV,GAM/B,OALIA,GAAkB,MAATqV,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJ3oB,GAAehzB,GAASqvB,GAAQj9B,QAAQk1B,GAAa,IAAKq0B,GAAS,IAwwE5EznB,GAAOruB,OA7pFP,SAAgB4xB,EAAOC,EAAOkkB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyBrV,GAAe9O,EAAOC,EAAOkkB,KAC3ElkB,EAAQkkB,EAAW9rD,GAEjB8rD,IAAa9rD,IACK,kBAAT4nC,GACTkkB,EAAWlkB,EACXA,EAAQ5nC,GAEe,kBAAT2nC,IACdmkB,EAAWnkB,EACXA,EAAQ3nC,IAGR2nC,IAAU3nC,GAAa4nC,IAAU5nC,GACnC2nC,EAAQ,EACRC,EAAQ,IAGRD,EAAQiS,GAASjS,GACbC,IAAU5nC,GACZ4nC,EAAQD,EACRA,EAAQ,GAERC,EAAQgS,GAAShS,IAGjBD,EAAQC,EAAO,CACjB,IAAImkB,EAAOpkB,EACXA,EAAQC,EACRA,EAAQmkB,EAEV,GAAID,GAAYnkB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAIkV,EAAO3Z,KACX,OAAOhR,GAAUwV,EAASmV,GAAQlV,EAAQD,EAAQhN,GAAe,QAAUmiB,EAAO,IAAIjkD,OAAS,KAAO+uC,GAExG,OAAOpB,GAAWmB,EAAOC,IA0nF3BxD,GAAO3rC,OA/8NP,SAAgBilC,EAAYrB,EAAUC,GACpC,IAAI5J,EAAO/X,GAAQ+iB,GAAcP,GAAcmB,GAC3ClB,EAAY1vB,UAAU7U,OAAS,EAEnC,OAAO65B,EAAKgL,EAAYmT,GAAYxU,EAAU,GAAIC,EAAac,EAAWiK,KA48N5EjD,GAAO4nB,YAn7NP,SAAqBtuB,EAAYrB,EAAUC,GACzC,IAAI5J,EAAO/X,GAAQ+iB,GAAcL,GAAmBiB,GAChDlB,EAAY1vB,UAAU7U,OAAS,EAEnC,OAAO65B,EAAKgL,EAAYmT,GAAYxU,EAAU,GAAIC,EAAac,EAAWyN,KAg7N5EzG,GAAO6nB,OAlvEP,SAAgB1sB,EAAQ12B,EAAG2tC,GAMzB,OAJE3tC,GADG2tC,EAAQC,GAAelX,EAAQ12B,EAAG2tC,GAAS3tC,IAAM7I,GAChD,EAEAs6C,GAAUzxC,GAETgpC,GAAW3hC,GAASqvB,GAAS12B,IA6uEtCu7B,GAAO9hC,QAvtEP,WACE,IAAIkxB,EAAO9lB,UACP6xB,EAASrvB,GAASsjB,EAAK,IAE3B,OAAOA,EAAK36B,OAAS,EAAI0mC,EAASA,EAAOj9B,QAAQkxB,EAAK,GAAIA,EAAK,KAotEjE4Q,GAAOnR,OAzmGP,SAAgBmL,EAAQ1d,EAAM8B,GAG5B,IAAI5pB,GAAS,EACTC,GAHJ6nB,EAAOkrB,GAASlrB,EAAM0d,IAGJvlC,OAOlB,IAJKA,IACHA,EAAS,EACTulC,EAASp+B,KAEFpH,EAAQC,GAAQ,CACvB,IAAI2G,EAAkB,MAAV4+B,EAAiBp+B,EAAYo+B,EAAOyN,GAAMnrB,EAAK9nB,KACvD4G,IAAUQ,IACZpH,EAAQC,EACR2G,EAAQgjB,GAEV4b,EAASsN,GAAWlsC,GAASA,EAAMiO,KAAK2wB,GAAU5+B,EAEpD,OAAO4+B,GAulGTgG,GAAOsgB,MAAQA,GACftgB,GAAO7D,aAAeA,EACtB6D,GAAO8nB,OA73NP,SAAgBxuB,GAEd,OADW/iB,GAAQ+iB,GAAc6I,GAAc0L,IACnCvU,IA43Nd0G,GAAOr2B,KAlzNP,SAAc2vB,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIgS,GAAYhS,GACd,OAAOijB,GAASjjB,GAAcqC,GAAWrC,GAAcA,EAAW7kC,OAEpE,IAAIyvC,EAAMC,GAAO7K,GACjB,OAAI4K,GAAOjT,GAAUiT,GAAO5S,EACnBgI,EAAW3vB,KAEbuhC,GAAS5R,GAAY7kC,QAwyN9BurC,GAAO0e,UAAYA,GACnB1e,GAAOx6B,KAlwNP,SAAc8zB,EAAYhB,EAAW8Z,GACnC,IAAI9jB,EAAO/X,GAAQ+iB,GAAcJ,GAAYmV,GAI7C,OAHI+D,GAASC,GAAe/Y,EAAYhB,EAAW8Z,KACjD9Z,EAAY18B,GAEP0yB,EAAKgL,EAAYmT,GAAYnU,EAAW,KA8vNjD0H,GAAO+nB,YA/pRP,SAAqB5/C,EAAO/M,GAC1B,OAAOkzC,GAAgBnmC,EAAO/M,IA+pRhC4kC,GAAOgoB,cAnoRP,SAAuB7/C,EAAO/M,EAAO68B,GACnC,OAAO0W,GAAkBxmC,EAAO/M,EAAOqxC,GAAYxU,EAAU,KAmoR/D+H,GAAOioB,cAhnRP,SAAuB9/C,EAAO/M,GAC5B,IAAI3G,EAAkB,MAAT0T,EAAgB,EAAIA,EAAM1T,OACvC,GAAIA,EAAQ,CACV,IAAID,EAAQ85C,GAAgBnmC,EAAO/M,GACnC,GAAI5G,EAAQC,GAAUkuC,GAAGx6B,EAAM3T,GAAQ4G,GACrC,OAAO5G,EAGX,OAAQ,GAymRVwrC,GAAOkoB,gBAplRP,SAAyB//C,EAAO/M,GAC9B,OAAOkzC,GAAgBnmC,EAAO/M,GAAO,IAolRvC4kC,GAAOmoB,kBAxjRP,SAA2BhgD,EAAO/M,EAAO68B,GACvC,OAAO0W,GAAkBxmC,EAAO/M,EAAOqxC,GAAYxU,EAAU,IAAI,IAwjRnE+H,GAAOooB,kBAriRP,SAA2BjgD,EAAO/M,GAEhC,GADsB,MAAT+M,GAAoBA,EAAM1T,OAC3B,CACV,IAAID,EAAQ85C,GAAgBnmC,EAAO/M,GAAO,GAAQ,EAClD,GAAIunC,GAAGx6B,EAAM3T,GAAQ4G,GACnB,OAAO5G,EAGX,OAAQ,GA8hRVwrC,GAAO2e,UAAYA,GACnB3e,GAAOhU,WA9mEP,SAAoBmP,EAAQlyB,EAAQi8C,GAOlC,OANA/pB,EAASrvB,GAASqvB,GAClB+pB,EAAuB,MAAZA,EACP,EACA1iB,GAAU0T,GAAUgP,GAAW,EAAG/pB,EAAO1mC,QAE7CwU,EAASsmC,GAAatmC,GACfkyB,EAAOhlC,MAAM+uD,EAAUA,EAAWj8C,EAAOxU,SAAWwU,GAwmE7D+2B,GAAOt/B,SAAWA,GAClBs/B,GAAOqoB,IAzUP,SAAalgD,GACX,OAAQA,GAASA,EAAM1T,OACnBslC,GAAQ5xB,EAAO2iC,IACf,GAuUN9K,GAAOsoB,MA7SP,SAAengD,EAAO8vB,GACpB,OAAQ9vB,GAASA,EAAM1T,OACnBslC,GAAQ5xB,EAAOskC,GAAYxU,EAAU,IACrC,GA2SN+H,GAAOuoB,SAhgEP,SAAkBptB,EAAQ9tB,EAAS+kC,GAIjC,IAAIvqC,EAAWm4B,GAAOmG,iBAElBiM,GAASC,GAAelX,EAAQ9tB,EAAS+kC,KAC3C/kC,EAAUzR,GAEZu/B,EAASrvB,GAASqvB,GAClB9tB,EAAUyvC,GAAa,GAAIzvC,EAASxF,EAAUkvC,IAE9C,IAIIyR,EACAC,EALAC,EAAU5L,GAAa,GAAIzvC,EAAQq7C,QAAS7gD,EAAS6gD,QAAS3R,IAC9D4R,EAAchkD,GAAK+jD,GACnBE,EAAgBvuB,GAAWquB,EAASC,GAIpCn0D,EAAQ,EACRq0D,EAAcx7C,EAAQw7C,aAAe70B,GACrC1pB,EAAS,WAGTw+C,EAAe/qC,IAChB1Q,EAAQ83C,QAAUnxB,IAAW1pB,OAAS,IACvCu+C,EAAYv+C,OAAS,KACpBu+C,IAAgB/1B,EAAgBa,GAAeK,IAAW1pB,OAAS,KACnE+C,EAAQ07C,UAAY/0B,IAAW1pB,OAAS,KACzC,KAME0+C,EAAY,kBACb7yC,GAAe9M,KAAKgE,EAAS,cACzBA,EAAQ27C,UAAY,IAAI9qD,QAAQ,UAAW,KAC3C,6BAA+Bi4B,GAAmB,KACnD,KAENgF,EAAOj9B,QAAQ4qD,GAAc,SAAShrD,EAAOmrD,EAAaC,EAAkBC,EAAiBC,EAAe1yC,GAsB1G,OArBAwyC,IAAqBA,EAAmBC,GAGxC7+C,GAAU6wB,EAAOhlC,MAAM3B,EAAOkiB,GAAQxY,QAAQ+1B,GAAmB+G,IAG7DiuB,IACFT,GAAa,EACbl+C,GAAU,YAAc2+C,EAAc,UAEpCG,IACFX,GAAe,EACfn+C,GAAU,OAAS8+C,EAAgB,eAEjCF,IACF5+C,GAAU,iBAAmB4+C,EAAmB,+BAElD10D,EAAQkiB,EAAS5Y,EAAMrJ,OAIhBqJ,KAGTwM,GAAU,OAMV,IAAI++C,EAAWlzC,GAAe9M,KAAKgE,EAAS,aAAeA,EAAQg8C,SAC9DA,IACH/+C,EAAS,iBAAmBA,EAAS,SAGvCA,GAAUm+C,EAAen+C,EAAOpM,QAAQm0B,EAAsB,IAAM/nB,GACjEpM,QAAQo0B,EAAqB,MAC7Bp0B,QAAQq0B,EAAuB,OAGlCjoB,EAAS,aAAe++C,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACCb,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJn+C,EACA,gBAEF,IAAIukB,EAASowB,IAAQ,WACnB,OAAOp/B,GAAS8oC,EAAaK,EAAY,UAAY1+C,GAClDsV,MAAMhkB,EAAWgtD,MAMtB,GADA/5B,EAAOvkB,OAASA,EACZ8xC,GAAQvtB,GACV,MAAMA,EAER,OAAOA,GAm5DTmR,GAAOspB,MApsBP,SAAe7kD,EAAGwzB,GAEhB,IADAxzB,EAAIyxC,GAAUzxC,IACN,GAAKA,EAAI6rB,EACf,MAAO,GAET,IAAI97B,EAAQg8B,EACR/7B,EAASs5B,GAAUtpB,EAAG+rB,GAE1ByH,EAAWwU,GAAYxU,GACvBxzB,GAAK+rB,EAGL,IADA,IAAI3B,EAASsL,GAAU1lC,EAAQwjC,KACtBzjC,EAAQiQ,GACfwzB,EAASzjC,GAEX,OAAOq6B,GAsrBTmR,GAAOwV,SAAWA,GAClBxV,GAAOkW,UAAYA,GACnBlW,GAAO4c,SAAWA,GAClB5c,GAAOupB,QA/3DP,SAAiBnuD,GACf,OAAO0Q,GAAS1Q,GAAOgjD,eA+3DzBpe,GAAO9R,SAAWA,GAClB8R,GAAOwpB,cAvsIP,SAAuBpuD,GACrB,OAAOA,EACHonC,GAAU0T,GAAU96C,IAAQ,iBAAmBk1B,GACpC,IAAVl1B,EAAcA,EAAQ,GAqsI7B4kC,GAAOl0B,SAAWA,GAClBk0B,GAAOypB,QA12DP,SAAiBruD,GACf,OAAO0Q,GAAS1Q,GAAO+wB,eA02DzB6T,GAAO0pB,KAj1DP,SAAcvuB,EAAQia,EAAOhD,GAE3B,IADAjX,EAASrvB,GAASqvB,MACHiX,GAASgD,IAAUx5C,GAChC,OAAOu/B,EAAOj9B,QAAQmvB,GAAQ,IAEhC,IAAK8N,KAAYia,EAAQ7F,GAAa6F,IACpC,OAAOja,EAET,IAAIV,EAAaqB,GAAcX,GAC3BT,EAAaoB,GAAcsZ,GAI/B,OAAO1E,GAAUjW,EAHLD,GAAgBC,EAAYC,GAC9BC,GAAcF,EAAYC,GAAc,GAETrgC,KAAK,KAq0DhD2lC,GAAO2pB,QA/yDP,SAAiBxuB,EAAQia,EAAOhD,GAE9B,IADAjX,EAASrvB,GAASqvB,MACHiX,GAASgD,IAAUx5C,GAChC,OAAOu/B,EAAOj9B,QAAQm1B,GAAW,IAEnC,IAAK8H,KAAYia,EAAQ7F,GAAa6F,IACpC,OAAOja,EAET,IAAIV,EAAaqB,GAAcX,GAG/B,OAAOuV,GAAUjW,EAAY,EAFnBE,GAAcF,EAAYqB,GAAcsZ,IAAU,GAEvB/6C,KAAK,KAqyD5C2lC,GAAO4pB,UA/wDP,SAAmBzuB,EAAQia,EAAOhD,GAEhC,IADAjX,EAASrvB,GAASqvB,MACHiX,GAASgD,IAAUx5C,GAChC,OAAOu/B,EAAOj9B,QAAQk1B,GAAa,IAErC,IAAK+H,KAAYia,EAAQ7F,GAAa6F,IACpC,OAAOja,EAET,IAAIV,EAAaqB,GAAcX,GAG/B,OAAOuV,GAAUjW,EAFLD,GAAgBC,EAAYqB,GAAcsZ,KAElB/6C,KAAK,KAqwD3C2lC,GAAO6pB,SA7tDP,SAAkB1uB,EAAQ9tB,GACxB,IAAI5Y,EA5qdmB,GA6qdnBq1D,EA5qdqB,MA8qdzB,GAAI77B,GAAS5gB,GAAU,CACrB,IAAIrZ,EAAY,cAAeqZ,EAAUA,EAAQrZ,UAAYA,EAC7DS,EAAS,WAAY4Y,EAAU6oC,GAAU7oC,EAAQ5Y,QAAUA,EAC3Dq1D,EAAW,aAAcz8C,EAAUkiC,GAAaliC,EAAQy8C,UAAYA,EAItE,IAAIxC,GAFJnsB,EAASrvB,GAASqvB,IAEK1mC,OACvB,GAAIymC,GAAWC,GAAS,CACtB,IAAIV,EAAaqB,GAAcX,GAC/BmsB,EAAY7sB,EAAWhmC,OAEzB,GAAIA,GAAU6yD,EACZ,OAAOnsB,EAET,IAAIjgC,EAAMzG,EAASknC,GAAWmuB,GAC9B,GAAI5uD,EAAM,EACR,OAAO4uD,EAET,IAAIj7B,EAAS4L,EACTiW,GAAUjW,EAAY,EAAGv/B,GAAKb,KAAK,IACnC8gC,EAAOhlC,MAAM,EAAG+E,GAEpB,GAAIlH,IAAc4H,EAChB,OAAOizB,EAASi7B,EAKlB,GAHIrvB,IACFv/B,GAAQ2zB,EAAOp6B,OAASyG,GAEtBw8B,GAAS1jC,IACX,GAAImnC,EAAOhlC,MAAM+E,GAAK6uD,OAAO/1D,GAAY,CACvC,IAAI8J,EACAksD,EAAYn7B,EAMhB,IAJK76B,EAAUi2D,SACbj2D,EAAY+pB,GAAO/pB,EAAUsW,OAAQwB,GAAS8nB,GAAQiJ,KAAK7oC,IAAc,MAE3EA,EAAU4nC,UAAY,EACd99B,EAAQ9J,EAAU6oC,KAAKmtB,IAC7B,IAAIE,EAASpsD,EAAMtJ,MAErBq6B,EAASA,EAAO14B,MAAM,EAAG+zD,IAAWtuD,EAAYV,EAAMgvD,SAEnD,GAAI/uB,EAAOrb,QAAQyvB,GAAav7C,GAAYkH,IAAQA,EAAK,CAC9D,IAAI1G,EAAQq6B,EAAO63B,YAAY1yD,GAC3BQ,GAAS,IACXq6B,EAASA,EAAO14B,MAAM,EAAG3B,IAG7B,OAAOq6B,EAASi7B,GAyqDlB9pB,GAAOmqB,SAnpDP,SAAkBhvB,GAEhB,OADAA,EAASrvB,GAASqvB,KACAzI,EAAiB/0B,KAAKw9B,GACpCA,EAAOj9B,QAAQs0B,EAAe0J,IAC9Bf,GAgpDN6E,GAAOoqB,SAvpBP,SAAkBC,GAChB,IAAI1iD,IAAOg1B,GACX,OAAO7wB,GAASu+C,GAAU1iD,GAspB5Bq4B,GAAO4e,UAAYA,GACnB5e,GAAOse,WAAaA,GAGpBte,GAAOsqB,KAAO1lD,GACdo7B,GAAOuqB,UAAY1P,GACnB7a,GAAOwqB,MAAQpR,GAEfmG,GAAMvf,IACA11B,GAAS,GACbk8B,GAAWxG,IAAQ,SAAS1R,EAAMkkB,GAC3Br8B,GAAe9M,KAAK22B,GAAO52B,UAAWopC,KACzCloC,GAAOkoC,GAAclkB,MAGlBhkB,IACH,CAAE,OAAS,IAWjB01B,GAAOyqB,QA98gBK,UAi9gBZtyB,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,iBAAiB,SAASqa,GACxFxS,GAAOwS,GAAY3X,YAAcmF,MAInC7H,GAAU,CAAC,OAAQ,SAAS,SAASqa,EAAYh+C,GAC/CyrC,GAAY72B,UAAUopC,GAAc,SAAS/tC,GAC3CA,EAAIA,IAAM7I,EAAY,EAAIkyB,GAAUooB,GAAUzxC,GAAI,GAElD,IAAIoqB,EAAUl0B,KAAKmmC,eAAiBtsC,EAChC,IAAIyrC,GAAYtlC,MAChBA,KAAKoC,QAUT,OARI8xB,EAAOiS,aACTjS,EAAOmS,cAAgBjT,GAAUtpB,EAAGoqB,EAAOmS,eAE3CnS,EAAOoS,UAAUtsC,KAAK,CACpB,KAAQo5B,GAAUtpB,EAAG+rB,GACrB,KAAQgiB,GAAc3jB,EAAOgS,QAAU,EAAI,QAAU,MAGlDhS,GAGToR,GAAY72B,UAAUopC,EAAa,SAAW,SAAS/tC,GACrD,OAAO9J,KAAKskC,UAAUuT,GAAY/tC,GAAGw6B,cAKzC9G,GAAU,CAAC,SAAU,MAAO,cAAc,SAASqa,EAAYh+C,GAC7D,IAAI0X,EAAO1X,EAAQ,EACfk2D,EAj8gBe,GAi8gBJx+C,GA/7gBG,GA+7gByBA,EAE3C+zB,GAAY72B,UAAUopC,GAAc,SAASva,GAC3C,IAAIpJ,EAASl0B,KAAKoC,QAMlB,OALA8xB,EAAOkS,cAAcpsC,KAAK,CACxB,SAAY83C,GAAYxU,EAAU,GAClC,KAAQ/rB,IAEV2iB,EAAOiS,aAAejS,EAAOiS,cAAgB4pB,EACtC77B,MAKXsJ,GAAU,CAAC,OAAQ,SAAS,SAASqa,EAAYh+C,GAC/C,IAAIm2D,EAAW,QAAUn2D,EAAQ,QAAU,IAE3CyrC,GAAY72B,UAAUopC,GAAc,WAClC,OAAO73C,KAAKgwD,GAAU,GAAGvvD,QAAQ,OAKrC+8B,GAAU,CAAC,UAAW,SAAS,SAASqa,EAAYh+C,GAClD,IAAIo2D,EAAW,QAAUp2D,EAAQ,GAAK,SAEtCyrC,GAAY72B,UAAUopC,GAAc,WAClC,OAAO73C,KAAKmmC,aAAe,IAAIb,GAAYtlC,MAAQA,KAAKiwD,GAAU,OAItE3qB,GAAY72B,UAAUw3C,QAAU,WAC9B,OAAOjmD,KAAK3E,OAAO80C,KAGrB7K,GAAY72B,UAAUvD,KAAO,SAASyyB,GACpC,OAAO39B,KAAK3E,OAAOsiC,GAAW8gB,QAGhCnZ,GAAY72B,UAAUwxC,SAAW,SAAStiB,GACxC,OAAO39B,KAAKskC,UAAUp5B,KAAKyyB,IAG7B2H,GAAY72B,UAAU2xC,UAAYrN,IAAS,SAASpxB,EAAM8S,GACxD,MAAmB,mBAAR9S,EACF,IAAI2jB,GAAYtlC,MAElBA,KAAKzE,KAAI,SAASkF,GACvB,OAAOqtC,GAAWrtC,EAAOkhB,EAAM8S,SAInC6Q,GAAY72B,UAAUy5C,OAAS,SAASvqB,GACtC,OAAO39B,KAAK3E,OAAO4lD,GAAOnP,GAAYnU,MAGxC2H,GAAY72B,UAAUjT,MAAQ,SAAS8E,EAAOC,GAC5CD,EAAQi7C,GAAUj7C,GAElB,IAAI4zB,EAASl0B,KACb,OAAIk0B,EAAOiS,eAAiB7lC,EAAQ,GAAKC,EAAM,GACtC,IAAI+kC,GAAYpR,IAErB5zB,EAAQ,EACV4zB,EAASA,EAAO20B,WAAWvoD,GAClBA,IACT4zB,EAASA,EAAOsyB,KAAKlmD,IAEnBC,IAAQU,IAEVizB,GADA3zB,EAAMg7C,GAAUh7C,IACD,EAAI2zB,EAAOuyB,WAAWlmD,GAAO2zB,EAAO00B,KAAKroD,EAAMD,IAEzD4zB,IAGToR,GAAY72B,UAAUq6C,eAAiB,SAASnrB,GAC9C,OAAO39B,KAAKskC,UAAUykB,UAAUprB,GAAW2G,WAG7CgB,GAAY72B,UAAUqzC,QAAU,WAC9B,OAAO9hD,KAAK4oD,KAAK/yB,IAInBgW,GAAWvG,GAAY72B,WAAW,SAASklB,EAAMkkB,GAC/C,IAAIqY,EAAgB,qCAAqCltD,KAAK60C,GAC1DsY,EAAU,kBAAkBntD,KAAK60C,GACjCuY,EAAa/qB,GAAO8qB,EAAW,QAAwB,QAAdtY,EAAuB,QAAU,IAAOA,GACjFwY,EAAeF,GAAW,QAAQntD,KAAK60C,GAEtCuY,IAGL/qB,GAAO52B,UAAUopC,GAAc,WAC7B,IAAIp3C,EAAQT,KAAK6lC,YACbpR,EAAO07B,EAAU,CAAC,GAAKxhD,UACvB2hD,EAAS7vD,aAAiB6kC,GAC1BhI,EAAW7I,EAAK,GAChB87B,EAAUD,GAAU10C,GAAQnb,GAE5Bq/C,EAAc,SAASr/C,GACzB,IAAIyzB,EAASk8B,EAAWnrC,MAAMogB,GAAQlH,GAAU,CAAC19B,GAAQg0B,IACzD,OAAQ07B,GAAWvqB,EAAY1R,EAAO,GAAKA,GAGzCq8B,GAAWL,GAAoC,mBAAZ5yB,GAA6C,GAAnBA,EAASxjC,SAExEw2D,EAASC,GAAU,GAErB,IAAI3qB,EAAW5lC,KAAK+lC,UAChByqB,IAAaxwD,KAAK8lC,YAAYhsC,OAC9B22D,EAAcJ,IAAiBzqB,EAC/B8qB,EAAWJ,IAAWE,EAE1B,IAAKH,GAAgBE,EAAS,CAC5B9vD,EAAQiwD,EAAWjwD,EAAQ,IAAI6kC,GAAYtlC,MAC3C,IAAIk0B,EAASP,EAAK1O,MAAMxkB,EAAOg0B,GAE/B,OADAP,EAAO4R,YAAY9rC,KAAK,CAAE,KAAQ2+C,GAAM,KAAQ,CAACmH,GAAc,QAAW7+C,IACnE,IAAIskC,GAAcrR,EAAQ0R,GAEnC,OAAI6qB,GAAeC,EACV/8B,EAAK1O,MAAMjlB,KAAMy0B,IAE1BP,EAASl0B,KAAK24C,KAAKmH,GACZ2Q,EAAeN,EAAUj8B,EAAOzzB,QAAQ,GAAKyzB,EAAOzzB,QAAWyzB,QAK1EsJ,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,YAAY,SAASqa,GACxE,IAAIlkB,EAAOgO,GAAWkW,GAClB8Y,EAAY,0BAA0B3tD,KAAK60C,GAAc,MAAQ,OACjEwY,EAAe,kBAAkBrtD,KAAK60C,GAE1CxS,GAAO52B,UAAUopC,GAAc,WAC7B,IAAIpjB,EAAO9lB,UACX,GAAI0hD,IAAiBrwD,KAAK+lC,UAAW,CACnC,IAAItlC,EAAQT,KAAKS,QACjB,OAAOkzB,EAAK1O,MAAMrJ,GAAQnb,GAASA,EAAQ,GAAIg0B,GAEjD,OAAOz0B,KAAK2wD,IAAW,SAASlwD,GAC9B,OAAOkzB,EAAK1O,MAAMrJ,GAAQnb,GAASA,EAAQ,GAAIg0B,UAMrDoX,GAAWvG,GAAY72B,WAAW,SAASklB,EAAMkkB,GAC/C,IAAIuY,EAAa/qB,GAAOwS,GACxB,GAAIuY,EAAY,CACd,IAAIz4C,EAAMy4C,EAAW93D,KAAO,GACvBkjB,GAAe9M,KAAKi2B,GAAWhtB,KAClCgtB,GAAUhtB,GAAO,IAEnBgtB,GAAUhtB,GAAK3d,KAAK,CAAE,KAAQ69C,EAAY,KAAQuY,QAItDzrB,GAAUuU,GAAaj4C,EAlnhBA,GAknhB+B3I,MAAQ,CAAC,CAC7D,KAAQ,UACR,KAAQ2I,IAIVqkC,GAAY72B,UAAUrM,MAz5dtB,WACE,IAAI8xB,EAAS,IAAIoR,GAAYtlC,KAAK6lC,aAOlC,OANA3R,EAAO4R,YAAc8B,GAAU5nC,KAAK8lC,aACpC5R,EAAOgS,QAAUlmC,KAAKkmC,QACtBhS,EAAOiS,aAAenmC,KAAKmmC,aAC3BjS,EAAOkS,cAAgBwB,GAAU5nC,KAAKomC,eACtClS,EAAOmS,cAAgBrmC,KAAKqmC,cAC5BnS,EAAOoS,UAAYsB,GAAU5nC,KAAKsmC,WAC3BpS,GAk5dToR,GAAY72B,UAAU61B,QAv4dtB,WACE,GAAItkC,KAAKmmC,aAAc,CACrB,IAAIjS,EAAS,IAAIoR,GAAYtlC,MAC7Bk0B,EAAOgS,SAAW,EAClBhS,EAAOiS,cAAe,OAEtBjS,EAASl0B,KAAKoC,SACP8jC,UAAY,EAErB,OAAOhS,GA+3dToR,GAAY72B,UAAUhO,MAp3dtB,WACE,IAAI+M,EAAQxN,KAAK6lC,YAAYplC,QACzBmwD,EAAM5wD,KAAKkmC,QACXe,EAAQrrB,GAAQpO,GAChBqjD,EAAUD,EAAM,EAChBrU,EAAYtV,EAAQz5B,EAAM1T,OAAS,EACnCg3D,EAwoIN,SAAiBxwD,EAAOC,EAAK4gD,GAI3B,IAHA,IAAItnD,GAAS,EACTC,EAASqnD,EAAWrnD,SAEfD,EAAQC,GAAQ,CACvB,IAAIqb,EAAOgsC,EAAWtnD,GAClBmV,EAAOmG,EAAKnG,KAEhB,OAAQmG,EAAK5D,MACX,IAAK,OAAajR,GAAS0O,EAAM,MACjC,IAAK,YAAazO,GAAOyO,EAAM,MAC/B,IAAK,OAAazO,EAAM6yB,GAAU7yB,EAAKD,EAAQ0O,GAAO,MACtD,IAAK,YAAa1O,EAAQ6yB,GAAU7yB,EAAOC,EAAMyO,IAGrD,MAAO,CAAE,MAAS1O,EAAO,IAAOC,GAvpIrBwwD,CAAQ,EAAGxU,EAAWv8C,KAAKsmC,WAClChmC,EAAQwwD,EAAKxwD,MACbC,EAAMuwD,EAAKvwD,IACXzG,EAASyG,EAAMD,EACfzG,EAAQg3D,EAAUtwD,EAAOD,EAAQ,EACjCsxC,EAAY5xC,KAAKomC,cACjB4qB,EAAapf,EAAU93C,OACvB+jC,EAAW,EACXozB,EAAY79B,GAAUt5B,EAAQkG,KAAKqmC,eAEvC,IAAKY,IAAW4pB,GAAWtU,GAAaziD,GAAUm3D,GAAan3D,EAC7D,OAAOs7C,GAAiB5nC,EAAOxN,KAAK8lC,aAEtC,IAAI5R,EAAS,GAEbxS,EACA,KAAO5nB,KAAY+jC,EAAWozB,GAAW,CAMvC,IAHA,IAAIC,GAAa,EACbzwD,EAAQ+M,EAHZ3T,GAAS+2D,KAKAM,EAAYF,GAAY,CAC/B,IAAI77C,EAAOy8B,EAAUsf,GACjB5zB,EAAWnoB,EAAKmoB,SAChB/rB,EAAO4D,EAAK5D,KACZ+5B,EAAWhO,EAAS78B,GAExB,GApxDY,GAoxDR8Q,EACF9Q,EAAQ6qC,OACH,IAAKA,EAAU,CACpB,GAxxDa,GAwxDT/5B,EACF,SAASmQ,EAET,MAAMA,GAIZwS,EAAO2J,KAAcp9B,EAEvB,OAAOyzB,GAy0dTmR,GAAO52B,UAAUsc,GAAKg1B,GACtB1a,GAAO52B,UAAUoxC,MAzgQjB,WACE,OAAOA,GAAM7/C,OAygQfqlC,GAAO52B,UAAU0iD,OA5+PjB,WACE,OAAO,IAAI5rB,GAAcvlC,KAAKS,QAAST,KAAK+lC,YA4+P9CV,GAAO52B,UAAU6I,KAn9PjB,WACMtX,KAAKimC,aAAehlC,IACtBjB,KAAKimC,WAAa6b,GAAQ9hD,KAAKS,UAEjC,IAAI4nB,EAAOroB,KAAKgmC,WAAahmC,KAAKimC,WAAWnsC,OAG7C,MAAO,CAAE,KAAQuuB,EAAM,MAFXA,EAAOpnB,EAAYjB,KAAKimC,WAAWjmC,KAAKgmC,eA+8PtDX,GAAO52B,UAAUwqC,MA55PjB,SAAsBx4C,GAIpB,IAHA,IAAIyzB,EACA6Z,EAAS/tC,KAEN+tC,aAAkBpI,IAAY,CACnC,IAAIvjC,EAAQojC,GAAauI,GACzB3rC,EAAM4jC,UAAY,EAClB5jC,EAAM6jC,WAAahlC,EACfizB,EACF3c,EAASsuB,YAAczjC,EAEvB8xB,EAAS9xB,EAEX,IAAImV,EAAWnV,EACf2rC,EAASA,EAAOlI,YAGlB,OADAtuB,EAASsuB,YAAcplC,EAChByzB,GA44PTmR,GAAO52B,UAAU61B,QAr3PjB,WACE,IAAI7jC,EAAQT,KAAK6lC,YACjB,GAAIplC,aAAiB6kC,GAAa,CAChC,IAAI8rB,EAAU3wD,EAUd,OATIT,KAAK8lC,YAAYhsC,SACnBs3D,EAAU,IAAI9rB,GAAYtlC,QAE5BoxD,EAAUA,EAAQ9sB,WACVwB,YAAY9rC,KAAK,CACvB,KAAQ2+C,GACR,KAAQ,CAACrU,IACT,QAAWrjC,IAEN,IAAIskC,GAAc6rB,EAASpxD,KAAK+lC,WAEzC,OAAO/lC,KAAK24C,KAAKrU,KAu2PnBe,GAAO52B,UAAU0iB,OAASkU,GAAO52B,UAAUuW,QAAUqgB,GAAO52B,UAAUhO,MAt1PtE,WACE,OAAO20C,GAAiBp1C,KAAK6lC,YAAa7lC,KAAK8lC,cAw1PjDT,GAAO52B,UAAUohD,MAAQxqB,GAAO52B,UAAUgwC,KAEtCxb,KACFoC,GAAO52B,UAAUw0B,IAh8PnB,WACE,OAAOjjC,OAi8PFqlC,GAMD7D,GAQN5oC,GAAK4R,EAAIA,IAIT,aACE,OAAOA,IACR,mCAaHkE,KAAK1O,uBCjthBP,IAAIiK,EAAU,EAAQ,OAClBonD,EAAc,EAAQ,OACtBC,EAAY,EAAQ,MAEpBC,EAAqBF,EAAYE,mBACjCC,EAAoBH,EAAYG,kBAcpC,SAASC,EAASC,EAASC,EAAMC,EAAYvlD,GAK3C,IAJA,IACIwlD,EACA9jB,EAFA+jB,EAAOH,EAAKtlD,GAITA,EAAIulD,GAILF,EAAQI,EAFZ/jB,EAAS4jB,EADTE,EAAexlD,EAAI,GAAM,IAGG,GAC1BslD,EAAKtlD,GAAK0hC,EACV1hC,EAAIwlD,EAORF,EAAKtlD,GAAKylD,EAUZ,SAASC,EAAOL,EAASC,EAAMtlD,GAO7B,IANA,IAII4qC,EAJA+a,EAAWL,EAAK73D,OAChB83D,EAAavlD,EACbylD,EAAOH,EAAKtlD,GACZ4lD,EAAa,EAAI5lD,EAAI,EAGlB4lD,EAAaD,IAClB/a,EAAagb,EAAa,GAGXD,GACbN,EAAQC,EAAKM,GAAaN,EAAK1a,KAAgB,IAE/Cgb,EAAahb,GAGf0a,EAAKtlD,GAAKslD,EAAKM,GAEfA,EAAa,GADb5lD,EAAI4lD,GACiB,EAGvBN,EAAKtlD,GAAKylD,EACVL,EAASC,EAASC,EAAMC,EAAYvlD,GAUtC,SAASrS,EAAK03D,EAASC,EAAMG,GAC3BH,EAAK33D,KAAK83D,GACVL,EAASC,EAASC,EAAM,EAAGA,EAAK73D,OAAS,GAU3C,SAASiuB,EAAI2pC,EAASC,GACpB,IAAIO,EAAWP,EAAK5pC,MAEpB,GAAoB,IAAhB4pC,EAAK73D,OAAc,CACrB,IAAIg4D,EAAOH,EAAK,GAIhB,OAHAA,EAAK,GAAKO,EACVH,EAAOL,EAASC,EAAM,GAEfG,EAGT,OAAOI,EAYT,SAAS3uD,EAAQmuD,EAASC,EAAMG,GAC9B,GAAoB,IAAhBH,EAAK73D,OACP,MAAM,IAAIwH,MAAM,qDAElB,IAAI6wD,EAASR,EAAK,GAIlB,OAHAA,EAAK,GAAKG,EACVC,EAAOL,EAASC,EAAM,GAEfQ,EAYT,SAASC,EAAQV,EAASC,EAAMG,GAC9B,IAAIO,EASJ,OAPoB,IAAhBV,EAAK73D,QAAgB43D,EAAQC,EAAK,GAAIG,GAAQ,IAChDO,EAAMV,EAAK,GACXA,EAAK,GAAKG,EACVA,EAAOO,EACPN,EAAOL,EAASC,EAAM,IAGjBG,EAST,SAASQ,EAAQZ,EAASlkD,GAKxB,IAJA,IAEInB,EAFImB,EAAM1T,QACD,IAGJuS,GAAK,GACZ0lD,EAAOL,EAASlkD,EAAOnB,GAU3B,SAASkmD,EAAQb,EAASC,GAMxB,IALA,IAAIhnD,EAAIgnD,EAAK73D,OACTuS,EAAI,EAEJmB,EAAQ,IAAIgB,MAAM7D,GAEf0B,EAAI1B,GACT6C,EAAMnB,KAAO0b,EAAI2pC,EAASC,GAE5B,OAAOnkD,EAuMT,SAASglD,EAAKv0B,GAIZ,GAHAj+B,KAAK2L,QACL3L,KAAKi+B,WAAaA,GAAcszB,EAED,mBAApBvxD,KAAKi+B,WACd,MAAM,IAAI38B,MAAM,sEAgHpB,SAASmxD,EAAQx0B,GAIf,GAHAj+B,KAAK2L,QACL3L,KAAKi+B,WAAaA,GAAcszB,EAED,mBAApBvxD,KAAKi+B,WACd,MAAM,IAAI38B,MAAM,yEAElBtB,KAAKi+B,WAAauzB,EAAkBxxD,KAAKi+B,YA/G3Cu0B,EAAK/jD,UAAU9C,MAAQ,WAGrB3L,KAAKxG,MAAQ,GACbwG,KAAKgP,KAAO,GASdwjD,EAAK/jD,UAAUzU,KAAO,SAAS83D,GAE7B,OADA93D,EAAKgG,KAAKi+B,WAAYj+B,KAAKxG,MAAOs4D,KACzB9xD,KAAKgP,MAQhBwjD,EAAK/jD,UAAUikD,KAAO,WACpB,OAAO1yD,KAAKxG,MAAM,IAQpBg5D,EAAK/jD,UAAUsZ,IAAM,WAInB,OAHkB,IAAd/nB,KAAKgP,MACPhP,KAAKgP,OAEA+Y,EAAI/nB,KAAKi+B,WAAYj+B,KAAKxG,QAUnCg5D,EAAK/jD,UAAUlL,QAAU,SAASuuD,GAChC,OAAOvuD,EAAQvD,KAAKi+B,WAAYj+B,KAAKxG,MAAOs4D,IAS9CU,EAAK/jD,UAAU2jD,QAAU,SAASN,GAChC,OAAOM,EAAQpyD,KAAKi+B,WAAYj+B,KAAKxG,MAAOs4D,IAQ9CU,EAAK/jD,UAAU8jD,QAAU,WAEvB,OADAvyD,KAAKgP,KAAO,EACLujD,EAAQvyD,KAAKi+B,WAAYj+B,KAAKxG,QASvCg5D,EAAK/jD,UAAUqzC,QAAU,WACvB,OAAOyQ,EAAQvyD,KAAKi+B,WAAYj+B,KAAKxG,MAAMgC,UAM7Cg3D,EAAK/jD,UAAU2iB,QAAU,WACvB,IAAIuhC,EAAQ3yD,KAAK8hD,UAQjB,OALA/3C,OAAO6b,eAAe+sC,EAAO,cAAe,CAC1ClyD,MAAO+xD,EACPltC,YAAY,IAGPqtC,GAGa,oBAAXtuC,SACTmuC,EAAK/jD,UAAU4V,OAAOiN,IAAI,+BAAiCkhC,EAAK/jD,UAAU2iB,SAkB5EqhC,EAAQhkD,UAAY+jD,EAAK/jD,UAUzB+jD,EAAKtnC,KAAO,SAASysB,EAAU1Z,GAC7B,IAEIzkC,EAFAm4D,EAAO,IAAIa,EAAKv0B,GAcpB,OAREzkC,EADE83D,EAAU3gB,YAAYgH,GAChBA,EAASn8C,QAET81D,EAAUxP,QAAQnK,GAE5B2a,EAAQX,EAAK1zB,WAAYzkC,GACzBm4D,EAAKn4D,MAAQA,EACbm4D,EAAK3iD,KAAOxV,EAAMM,OAEX63D,GAGTc,EAAQvnC,KAAO,SAASysB,EAAU1Z,GAChC,IAEIzkC,EAFAm4D,EAAO,IAAIc,EAAQx0B,GAcvB,OAREzkC,EADE83D,EAAU3gB,YAAYgH,GAChBA,EAASn8C,QAET81D,EAAUxP,QAAQnK,GAE5B2a,EAAQX,EAAK1zB,WAAYzkC,GACzBm4D,EAAKn4D,MAAQA,EACbm4D,EAAK3iD,KAAOxV,EAAMM,OAEX63D,GAMTa,EAAKT,OAASA,EACdS,EAAKf,SAAWA,EAChBe,EAAKx4D,KAAOA,EACZw4D,EAAKzqC,IAAMA,EACXyqC,EAAKjvD,QAAUA,EACfivD,EAAKJ,QAAUA,EACfI,EAAKF,QAAUA,EACfE,EAAKD,QAAUA,EAEfC,EAAKI,UArXL,SAAmBlB,EAAS5nD,EAAG6tC,GACJ,IAArBhpC,UAAU7U,SACZ69C,EAAW7tC,EACXA,EAAI4nD,EACJA,EAAUH,GAGZ,IAEIllD,EAAG1B,EAAGrB,EAIN4qB,EANA2+B,EAAiBrB,EAAkBE,GAInCp9C,EAAMJ,EAAAA,EAKV,GAAU,IAANpK,EAAS,CACX,GAAIwnD,EAAU3gB,YAAYgH,GAAW,CACnC,IAAKtrC,EAAI,EAAG1B,EAAIgtC,EAAS79C,OAAQuS,EAAI1B,EAAG0B,IACtC/C,EAAIquC,EAAStrC,IAETiI,IAAQJ,EAAAA,GAAYw9C,EAAQpoD,EAAGgL,GAAO,KACxCA,EAAMhL,GAMV,OAHA4qB,EAAS,IAAIyjB,EAAS/3C,YAAY,IAC3B,GAAK0U,EAEL4f,EAQT,OALAjqB,EAAQ0tC,GAAU,SAASl3C,IACrB6T,IAAQJ,EAAAA,GAAYw9C,EAAQjxD,EAAO6T,GAAO,KAC5CA,EAAM7T,MAGH,CAAC6T,GAGV,GAAIg9C,EAAU3gB,YAAYgH,GAAW,CAGnC,GAAI7tC,GAAK6tC,EAAS79C,OAChB,OAAO69C,EAASn8C,QAAQy2C,KAAKyf,GAK/B,IAHAx9B,EAASyjB,EAASn8C,MAAM,EAAGsO,GAC3BwoD,EAAQO,EAAgB3+B,GAEnB7nB,EAAIvC,EAAGa,EAAIgtC,EAAS79C,OAAQuS,EAAI1B,EAAG0B,IAClCwmD,EAAelb,EAAStrC,GAAI6nB,EAAO,IAAM,GAC3C3wB,EAAQsvD,EAAgB3+B,EAAQyjB,EAAStrC,IAG7C,OAAO6nB,EAAO+d,KAAKyf,GAIrB,IAAI1iD,EAAOsiD,EAAUwB,YAAYnb,GA2BjC,OAzBa,OAAT3oC,GAAiBA,EAAOlF,IAC1BA,EAAIkF,GAENklB,EAAS,IAAI1lB,MAAM1E,GACnBuC,EAAI,EAEJpC,EAAQ0tC,GAAU,SAASl3C,GACrB4L,EAAIvC,EACNoqB,EAAO7nB,GAAK5L,GAGR4L,IAAMvC,GACRwoD,EAAQO,EAAgB3+B,GAEtB2+B,EAAepyD,EAAOyzB,EAAO,IAAM,GACrC3wB,EAAQsvD,EAAgB3+B,EAAQzzB,IAGpC4L,OAGE6nB,EAAOp6B,OAASuS,IAClB6nB,EAAOp6B,OAASuS,GAGX6nB,EAAO+d,KAAKyf,IAkSrBc,EAAKO,SAvRL,SAAkBrB,EAAS5nD,EAAG6tC,GACH,IAArBhpC,UAAU7U,SACZ69C,EAAW7tC,EACXA,EAAI4nD,EACJA,EAAUH,GAGZ,IAEIllD,EAAG1B,EAAGrB,EAIN4qB,EANA2+B,EAAiBrB,EAAkBE,GAInCn9C,GAAM,IAKV,GAAU,IAANzK,EAAS,CACX,GAAIwnD,EAAU3gB,YAAYgH,GAAW,CACnC,IAAKtrC,EAAI,EAAG1B,EAAIgtC,EAAS79C,OAAQuS,EAAI1B,EAAG0B,IACtC/C,EAAIquC,EAAStrC,IAETkI,KAAQ,KAAam9C,EAAQpoD,EAAGiL,GAAO,KACzCA,EAAMjL,GAMV,OAHA4qB,EAAS,IAAIyjB,EAAS/3C,YAAY,IAC3B,GAAK2U,EAEL2f,EAQT,OALAjqB,EAAQ0tC,GAAU,SAASl3C,IACrB8T,KAAQ,KAAam9C,EAAQjxD,EAAO8T,GAAO,KAC7CA,EAAM9T,MAGH,CAAC8T,GAGV,GAAI+8C,EAAU3gB,YAAYgH,GAAW,CAGnC,GAAI7tC,GAAK6tC,EAAS79C,OAChB,OAAO69C,EAASn8C,QAAQy2C,KAAK4gB,GAK/B,IAHA3+B,EAASyjB,EAASn8C,MAAM,EAAGsO,GAC3BwoD,EAAQZ,EAASx9B,GAEZ7nB,EAAIvC,EAAGa,EAAIgtC,EAAS79C,OAAQuS,EAAI1B,EAAG0B,IAClCqlD,EAAQ/Z,EAAStrC,GAAI6nB,EAAO,IAAM,GACpC3wB,EAAQmuD,EAASx9B,EAAQyjB,EAAStrC,IAGtC,OAAO6nB,EAAO+d,KAAK4gB,GAIrB,IAAI7jD,EAAOsiD,EAAUwB,YAAYnb,GA2BjC,OAzBa,OAAT3oC,GAAiBA,EAAOlF,IAC1BA,EAAIkF,GAENklB,EAAS,IAAI1lB,MAAM1E,GACnBuC,EAAI,EAEJpC,EAAQ0tC,GAAU,SAASl3C,GACrB4L,EAAIvC,EACNoqB,EAAO7nB,GAAK5L,GAGR4L,IAAMvC,GACRwoD,EAAQZ,EAASx9B,GAEfw9B,EAAQjxD,EAAOyzB,EAAO,IAAM,GAC9B3wB,EAAQmuD,EAASx9B,EAAQzzB,IAG7B4L,OAGE6nB,EAAOp6B,OAASuS,IAClB6nB,EAAOp6B,OAASuS,GAGX6nB,EAAO+d,KAAK4gB,IAqMrBL,EAAKQ,QAAUR,EACfA,EAAKC,QAAUA,EAEfllD,EAAO1X,QAAU28D,kBCxjBjB,IAAIS,EAAW,EAAQ,OACnBhpD,EAAU,EAAQ,OAOtB,SAASoW,IACPrgB,KAAK2L,QAQP0U,EAAM5R,UAAU9C,MAAQ,WAGtB3L,KAAKxG,MAAQ,GACbwG,KAAK+b,OAAS,EACd/b,KAAKgP,KAAO,GASdqR,EAAM5R,UAAU2T,QAAU,SAAS0vC,GAGjC,OADA9xD,KAAKxG,MAAMQ,KAAK83D,KACP9xD,KAAKgP,MAQhBqR,EAAM5R,UAAU0T,QAAU,WACxB,GAAKniB,KAAKgP,KAAV,CAGA,IAAI8iD,EAAO9xD,KAAKxG,MAAMwG,KAAK+b,QAS3B,OAPoB,IAAd/b,KAAK+b,QAAc/b,KAAKxG,MAAMM,SAClCkG,KAAKxG,MAAQwG,KAAKxG,MAAMgC,MAAMwE,KAAK+b,QACnC/b,KAAK+b,OAAS,GAGhB/b,KAAKgP,OAEE8iD,IAQTzxC,EAAM5R,UAAUikD,KAAO,WACrB,GAAK1yD,KAAKgP,KAGV,OAAOhP,KAAKxG,MAAMwG,KAAK+b,SAUzBsE,EAAM5R,UAAUxE,QAAU,SAAS+tC,EAAUkb,GAC3CA,EAAQvkD,UAAU7U,OAAS,EAAIo5D,EAAQlzD,KAEvC,IAAK,IAAIqM,EAAIrM,KAAK+b,OAAQjQ,EAAI,EAAGnB,EAAI3K,KAAKxG,MAAMM,OAAQuS,EAAI1B,EAAG0B,IAAKP,IAClEksC,EAAStpC,KAAKwkD,EAAOlzD,KAAKxG,MAAM6S,GAAIP,EAAG9L,OAQ3CqgB,EAAM5R,UAAUqzC,QAAU,WACxB,OAAO9hD,KAAKxG,MAAMgC,MAAMwE,KAAK+b,SAQ/BsE,EAAM5R,UAAUhB,OAAS,WACvB,IAAIjU,EAAQwG,KAAKxG,MACb6S,EAAIrM,KAAK+b,OAEb,OAAO,IAAIk3C,GAAS,WAClB,GAAI5mD,GAAK7S,EAAMM,OACb,MAAO,CACLuuB,MAAM,GAGV,IAAI5nB,EAAQjH,EAAM6S,GAGlB,OAFAA,IAEO,CACL5L,MAAOA,EACP4nB,MAAM,OAUZhI,EAAM5R,UAAU+3B,QAAU,WACxB,IAAIhtC,EAAQwG,KAAKxG,MACb6S,EAAIrM,KAAK+b,OACTjQ,EAAI,EAER,OAAO,IAAImnD,GAAS,WAClB,GAAI5mD,GAAK7S,EAAMM,OACb,MAAO,CACLuuB,MAAM,GAGV,IAAI5nB,EAAQjH,EAAM6S,GAGlB,OAFAA,IAEO,CACL5L,MAAO,CAACqL,IAAKrL,GACb4nB,MAAM,OAQU,oBAAXhE,SACThE,EAAM5R,UAAU4V,OAAOC,UAAYjE,EAAM5R,UAAUhB,QAKrD4S,EAAM5R,UAAU0C,SAAW,WACzB,OAAOnR,KAAK8hD,UAAUpiD,KAAK,MAG7B2gB,EAAM5R,UAAU0iB,OAAS,WACvB,OAAOnxB,KAAK8hD,WAGdzhC,EAAM5R,UAAU2iB,QAAU,WACxB,IAAI5jB,EAAQxN,KAAK8hD,UAQjB,OALA/3C,OAAO6b,eAAepY,EAAO,cAAe,CAC1C/M,MAAO4f,EACPiF,YAAY,IAGP9X,GAGa,oBAAX6W,SACThE,EAAM5R,UAAU4V,OAAOiN,IAAI,+BAAiCjR,EAAM5R,UAAU2iB,SAS9E/Q,EAAM6K,KAAO,SAASysB,GACpB,IAAI11B,EAAQ,IAAI5B,EAMhB,OAJApW,EAAQ0tC,GAAU,SAASl3C,GACzBwhB,EAAMG,QAAQ3hB,MAGTwhB,GAUT5B,EAAM6B,GAAK,WACT,OAAO7B,EAAM6K,KAAKvc,YAMpBpB,EAAO1X,QAAUwqB,iBC3IjBxqB,EAAQ07D,mBArEiB,SAASp0D,EAAGwM,GACnC,OAAIxM,EAAIwM,GACE,EACNxM,EAAIwM,EACC,EAEF,GAgET9T,EAAQs9D,2BA7DyB,SAASh2D,EAAGwM,GAC3C,OAAIxM,EAAIwM,EACC,EACLxM,EAAIwM,GACE,EAEH,GAwDT9T,EAAQ27D,kBAlDR,SAA2BvzB,GACzB,OAAO,SAAS9gC,EAAGwM,GACjB,OAAOs0B,EAAWt0B,EAAGxM,KAiDzBtH,EAAQu9D,sBA1CR,SAA+BpkD,GAC7B,OAAa,IAATA,EACK,SAAS7R,EAAGwM,GACjB,OAAIxM,EAAE,GAAKwM,EAAE,IACH,EAENxM,EAAE,GAAKwM,EAAE,GACJ,EAELxM,EAAE,GAAKwM,EAAE,IACH,EAENxM,EAAE,GAAKwM,EAAE,GACJ,EAEF,GAIJ,SAASxM,EAAGwM,GAGjB,IAFA,IAAI0C,EAAI,EAEDA,EAAI2C,GAAM,CACf,GAAI7R,EAAEkP,GAAK1C,EAAE0C,GACX,OAAQ,EAEV,GAAIlP,EAAEkP,GAAK1C,EAAE0C,GACX,OAAO,EAETA,IAGF,OAAO,oBC9DX,IAAIpC,EAAU,EAAQ,OAElBopD,EAAQ,EAAQ,MAoBpB,SAASP,EAAYxkD,GACnB,MAA6B,iBAAlBA,EAAOxU,OACTwU,EAAOxU,OAEW,iBAAhBwU,EAAOU,KACTV,EAAOU,UADhB,EAyDFnZ,EAAQ86C,YAxER,SAAqBriC,GACnB,OAAOE,MAAMoN,QAAQtN,IAAW+kD,EAAMl2B,aAAa7uB,IAwErDzY,EAAQi9D,YAAcA,EACtBj9D,EAAQisD,QA/CR,SAAiBxzC,GACf,IAAI3D,EAAImoD,EAAYxkD,GAEhBd,EAAqB,iBAAN7C,EAAiB,IAAI6D,MAAM7D,GAAK,GAE/C0B,EAAI,EAOR,OAJApC,EAAQqE,GAAQ,SAAS7N,GACvB+M,EAAMnB,KAAO5L,KAGR+M,GAoCT3X,EAAQy9D,mBA3BR,SAA4BhlD,GAC1B,IAAI3D,EAAImoD,EAAYxkD,GAEhBilD,EAA0B,iBAAN5oD,EACtB0oD,EAAMG,gBAAgB7oD,GACtB6D,MAEEhB,EAAqB,iBAAN7C,EAAiB,IAAI6D,MAAM7D,GAAK,GAC/C8oD,EAAuB,iBAAN9oD,EAAiB,IAAI4oD,EAAW5oD,GAAK,GAEtD0B,EAAI,EAQR,OALApC,EAAQqE,GAAQ,SAAS7N,GACvB+M,EAAMnB,GAAK5L,EACXgzD,EAAQpnD,GAAKA,OAGR,CAACmB,EAAOimD,kBClEjB,IAAIC,EAAmB1tD,KAAK2O,IAAI,EAAG,GAAK,EACpCg/C,EAAoB3tD,KAAK2O,IAAI,EAAG,IAAM,EACtCi/C,EAAoB5tD,KAAK2O,IAAI,EAAG,IAAM,EAEtCk/C,EAA0B7tD,KAAK2O,IAAI,EAAG,GAAK,EAC3Cm/C,EAA2B9tD,KAAK2O,IAAI,EAAG,IAAM,EAC7Co/C,EAA2B/tD,KAAK2O,IAAI,EAAG,IAAM,EAEjD9e,EAAQ29D,gBAAkB,SAASxkD,GACjC,IAAIglD,EAAWhlD,EAAO,EAEtB,GAAIglD,GAAYN,EACd,OAAOjxB,WAET,GAAIuxB,GAAYL,EACd,OAAOM,YAET,GAAID,GAAYJ,EACd,OAAOM,YAET,MAAM,IAAI5yD,MAAM,oEAGlBzL,EAAQs+D,sBAAwB,SAASnlD,GACvC,IAAIglD,EAAWhlD,EAAO,EAEtB,OAAIglD,GAAYH,EACPO,UAELJ,GAAYF,EACPO,WAELL,GAAYD,EACPO,WAEFC,cAST1+D,EAAQ2+D,cAAgB,SAAS/zD,GAG/B,OAAIA,KAAmB,EAARA,IAGa,IAAtBuF,KAAKyuD,KAAKh0D,GACRA,GAAS,KAAOA,IAAU,IACrB2zD,UAEL3zD,GAAS,OAASA,IAAU,MACvB4zD,WAEFC,WAIH7zD,GAAS,IACJgiC,WAELhiC,GAAS,MACJwzD,YAEFC,YAMJK,cAWT,IAAIG,EAAgB,CAClBjyB,WAAY,EACZ2xB,UAAW,EACXH,YAAa,EACbI,WAAY,EACZH,YAAa,EACbI,WAAY,EACZplD,aAAc,EACdqlD,aAAc,GAIhB1+D,EAAQ8+D,yBAA2B,SAASnnD,EAAOkW,GACjD,IAEIja,EACAI,EACAP,EACA+C,EACA1B,EANAiqD,EAAU,KACVC,EAAc,EAOlB,IAAKxoD,EAAI,EAAG1B,EAAI6C,EAAM1T,OAAQuS,EAAI1B,EAAG0B,IACnC/C,EAAIoa,EAASA,EAAOlW,EAAMnB,IAAMmB,EAAMnB,GACtCxC,EAAIhU,EAAQ2+D,cAAclrD,IAC1BG,EAAIirD,EAAc7qD,EAAEvR,OAEZu8D,IACNA,EAAcprD,EACdmrD,EAAU/qD,GAId,OAAO+qD,GAST/+D,EAAQsnC,aAAe,SAAS18B,GAC9B,MAA8B,oBAAhBioB,aAA+BA,YAAYI,OAAOroB,IASlE5K,EAAQkE,OAAS,WACf,IACIsS,EACAF,EACAxB,EAHA7Q,EAAS,EAKb,IAAKuS,EAAI,EAAG1B,EAAIgE,UAAU7U,OAAQuS,EAAI1B,EAAG0B,IACvCvS,GAAU6U,UAAUtC,GAAGvS,OAEzB,IAAI0T,EAAQ,IAAKmB,UAAU,GAAc,YAAE7U,GAE3C,IAAKuS,EAAI,EAAGF,EAAI,EAAGE,EAAI1B,EAAG0B,IACxBmB,EAAM6X,IAAI1W,UAAUtC,GAAIF,GACxBA,GAAKwC,UAAUtC,GAAGvS,OAGpB,OAAO0T,GAST3X,EAAQ49D,QAAU,SAAS35D,GAKzB,IAJA,IAEI0T,EAAQ,IAFO3X,EAAQ29D,gBAAgB15D,GAE/B,CAAiBA,GAEpBuS,EAAI,EAAGA,EAAIvS,EAAQuS,IAC1BmB,EAAMnB,GAAKA,EAEb,OAAOmB,oBCnLT,IAAIsnD,EAAU,EAAQ,OAElBrsC,EAAuBqsC,EAAQrsC,qBAC/BE,EAAiBmsC,EAAQnsC,eAQ7Bpb,EAAO1X,QAAU,SAAiB8hD,EAAUK,GAC1C,IAAI1zB,EAAUxX,EAAGT,EAAG1B,EAAGjN,EAEvB,IAAKi6C,EAAU,MAAM,IAAIr2C,MAAM,0CAE/B,GAAwB,mBAAb02C,EACT,MAAM,IAAI12C,MAAM,8CAGlB,GACEkN,MAAMoN,QAAQ+7B,IACblvB,GAAwBC,YAAYI,OAAO6uB,IACxB,iBAAbA,GACiB,uBAAxBA,EAASxmC,WAET,IAAK9E,EAAI,EAAG1B,EAAIgtC,EAAS79C,OAAQuS,EAAI1B,EAAG0B,IAAK2rC,EAASL,EAAStrC,GAAIA,QAKrE,GAAgC,mBAArBsrC,EAAS1tC,QAepB,GARE0e,GACAtE,OAAOC,YAAYqzB,GACM,mBAAlBA,EAASrgC,OAEhBqgC,EAAWA,EAAStzB,OAAOC,aAIA,mBAAlBqzB,EAASrgC,KAapB,IAAKxK,KAAK6qC,EACJA,EAASn8B,eAAe1O,IAC1BkrC,EAASL,EAAS7qC,GAAIA,QAXxB,IAHAwX,EAAWqzB,EACXtrC,EAAI,GAEsC,KAAjC3O,EAAI4mB,EAAShN,QAAW+Q,MAC/B2vB,EAASt6C,EAAE+C,MAAO4L,GAClBA,SApBFsrC,EAAS1tC,QAAQ+tC,eCzBrB,SAASib,EAAS37C,GAChB,GAAoB,mBAATA,EACT,MAAM,IAAIhW,MAAM,+CAElBtB,KAAKsX,KAAOA,EAMQ,oBAAX+M,SACT4uC,EAASxkD,UAAU4V,OAAOC,UAAY,WACpC,OAAOtkB,OASXizD,EAAS/wC,GAAK,WACZ,IAAIuS,EAAO9lB,UACThE,EAAI8pB,EAAK36B,OACTuS,EAAI,EAEN,OAAO,IAAI4mD,GAAS,WAClB,OAAI5mD,GAAK1B,EAAU,CAAC0d,MAAM,GAEnB,CAACA,MAAM,EAAO5nB,MAAOg0B,EAAKpoB,UASrC4mD,EAAS3qC,MAAQ,WAKf,OAJe,IAAI2qC,GAAS,WAC1B,MAAO,CAAC5qC,MAAM,OAYlB4qC,EAAS1qC,aAAe,SAAUwsC,GAChC,IAAI1oD,EAAI,EACN1B,EAAIoqD,EAASj7D,OAEf,OAAO,IAAIm5D,GAAS,WAClB,OAAI5mD,GAAK1B,EAAU,CAAC0d,MAAM,GAEnB,CAACA,MAAM,EAAO5nB,MAAOs0D,EAAS1oD,UAUzC4mD,EAASzqC,GAAK,SAAU/nB,GACtB,OAAIA,aAAiBwyD,GAGF,iBAAVxyD,GACG,OAAVA,GACsB,mBAAfA,EAAM6W,MAOjB/J,EAAO1X,QAAUo9D,iBC/FjBp9D,EAAQ4yB,qBAA8C,oBAAhBC,YACtC7yB,EAAQ8yB,eAAmC,oBAAXtE,kBCYhC,SAAS2wC,EAAaj+C,GAQpB,OAAO,SAAU5Z,EAAGwM,GAClB,OAAOxM,EAAI6I,KAAK6C,MAAMkO,KAASpN,EAAIxM,EAAI,KAO3C,IAAI6Z,EAASg+C,EAAahvD,KAAKgR,QAK/BA,EAAOg+C,aAAeA,EACtBznD,EAAO1X,QAAUmhB,mBC7BjB,IAAIg+C,EAAe,sBAQnB,SAASh6C,EAAqBjE,GAC5B,IAAIk+C,EAAeD,EAAaj+C,GAQhC,OAAO,SAAUg+C,GAMf,IALA,IAAIj7D,EAASi7D,EAASj7D,OACpBmnC,EAAYnnC,EAAS,EAEnBD,GAAS,IAEJA,EAAQC,GAAQ,CACvB,IAAI2Q,EAAIwqD,EAAap7D,EAAOonC,GAC1BxgC,EAAQs0D,EAAStqD,GAEnBsqD,EAAStqD,GAAKsqD,EAASl7D,GACvBk7D,EAASl7D,GAAS4G,IAQxB,IAAIy0D,EAAiBl6C,EAAqBhV,KAAKgR,QAK/Ck+C,EAAel6C,qBAAuBA,EACtCzN,EAAO1X,QAAUq/D,wCC/CjB,WACE,IAAIC,EAAgBC,EAAQC,EAAUC,EAAgBC,EAAcC,EAExC,oBAAhBC,aAA+C,OAAhBA,aAAyBA,YAAYpiC,IAC9E9lB,EAAO1X,QAAU,WACf,OAAO4/D,YAAYpiC,OAEZ,MAAQ8I,GAAgDA,EAAQi5B,QACzE7nD,EAAO1X,QAAU,WACf,OAAQs/D,IAAmBI,GAAgB,KAE7CH,EAASj5B,EAAQi5B,OAMjBE,GALAH,EAAiB,WACf,IAAIO,EAEJ,OAAe,KADfA,EAAKN,KACK,GAAWM,EAAG,OAG1BF,EAA4B,IAAnBr5B,EAAQw5B,SACjBJ,EAAeD,EAAiBE,GACvBnyC,KAAKgQ,KACd9lB,EAAO1X,QAAU,WACf,OAAOwtB,KAAKgQ,MAAQgiC,GAEtBA,EAAWhyC,KAAKgQ,QAEhB9lB,EAAO1X,QAAU,WACf,OAAO,IAAIwtB,MAAOuyC,UAAYP,GAEhCA,GAAW,IAAIhyC,MAAOuyC,aAGvBlnD,KAAK1O,uBC1BR,IAPA,IAAIqzB,EAAM,EAAQ,MACdz6B,EAAyB,oBAAXmY,OAAyB,EAAA+B,EAAS/B,OAChD8kD,EAAU,CAAC,MAAO,UAClBC,EAAS,iBACTC,EAAMn9D,EAAK,UAAYk9D,GACvBE,EAAMp9D,EAAK,SAAWk9D,IAAWl9D,EAAK,gBAAkBk9D,GAEpDzpD,EAAI,GAAI0pD,GAAO1pD,EAAIwpD,EAAQ/7D,OAAQuS,IACzC0pD,EAAMn9D,EAAKi9D,EAAQxpD,GAAK,UAAYypD,GACpCE,EAAMp9D,EAAKi9D,EAAQxpD,GAAK,SAAWypD,IAC5Bl9D,EAAKi9D,EAAQxpD,GAAK,gBAAkBypD,GAI7C,IAAIC,IAAQC,EAAK,CACf,IAAIhoB,EAAO,EACPhhC,EAAK,EACLiV,EAAQ,GAGZ8zC,EAAM,SAAS/d,GACb,GAAoB,IAAjB/1B,EAAMnoB,OAAc,CACrB,IAAIm8D,EAAO5iC,IACP/b,EAAOtR,KAAKuO,IAAI,EALJ,oBAKwB0hD,EAAOjoB,IAC/CA,EAAO12B,EAAO2+C,EACdlgD,YAAW,WACT,IAAImgD,EAAKj0C,EAAMzmB,MAAM,GAIrBymB,EAAMnoB,OAAS,EACf,IAAI,IAAIuS,EAAI,EAAGA,EAAI6pD,EAAGp8D,OAAQuS,IAC5B,IAAI6pD,EAAG7pD,GAAG8pD,UACR,IACED,EAAG7pD,GAAG2rC,SAAShK,GACf,MAAMlxC,GACNiZ,YAAW,WAAa,MAAMjZ,IAAK,MAIxCkJ,KAAK2/C,MAAMruC,IAOhB,OALA2K,EAAMjoB,KAAK,CACTo8D,SAAUppD,EACVgrC,SAAUA,EACVme,WAAW,IAENnpD,GAGTgpD,EAAM,SAASI,GACb,IAAI,IAAI/pD,EAAI,EAAGA,EAAI4V,EAAMnoB,OAAQuS,IAC5B4V,EAAM5V,GAAG+pD,SAAWA,IACrBn0C,EAAM5V,GAAG8pD,WAAY,IAM7B5oD,EAAO1X,QAAU,SAASgb,GAIxB,OAAOklD,EAAIrnD,KAAK9V,EAAMiY,IAExBtD,EAAO1X,QAAQs/B,OAAS,WACtB6gC,EAAI/wC,MAAMrsB,EAAM+V,YAElBpB,EAAO1X,QAAQwgE,SAAW,SAASh3B,GAC5BA,IACHA,EAASzmC,GAEXymC,EAAOi3B,sBAAwBP,EAC/B12B,EAAOk3B,qBAAuBP,uCCxEhC,IACQQ,EADJC,EAAaz2D,MAAQA,KAAKy2D,YACtBD,EAAgB,SAAUrgE,EAAGwT,GAI7B,OAHA6sD,EAAgBzsD,OAAOya,gBAClB,CAAEE,UAAW,cAAgBlW,OAAS,SAAUrY,EAAGwT,GAAKxT,EAAEuuB,UAAY/a,IACvE,SAAUxT,EAAGwT,GAAK,IAAK,IAAIF,KAAKE,EAAOI,OAAO0E,UAAU+M,eAAe9M,KAAK/E,EAAGF,KAAItT,EAAEsT,GAAKE,EAAEF,KACzF+sD,EAAcrgE,EAAGwT,IAErB,SAAUxT,EAAGwT,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIyb,UAAU,uBAAyB0B,OAAOnd,GAAK,iCAE7D,SAAS+sD,IAAO12D,KAAKJ,YAAczJ,EADnCqgE,EAAcrgE,EAAGwT,GAEjBxT,EAAEsY,UAAkB,OAAN9E,EAAaI,OAAOwa,OAAO5a,IAAM+sD,EAAGjoD,UAAY9E,EAAE8E,UAAW,IAAIioD,KAGnFC,EAAmB32D,MAAQA,KAAK22D,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExD7sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IAQtD,IAAIq2D,EAAY,EAAQ,OACpBC,EAAYJ,EAAgB,EAAQ,OACpCK,EAAU,EAAQ,OAClBC,EAAU,EAAQ,OAIlBC,EAAwB,IAMxBC,EAAwB,SAAUC,GAElC,SAASD,IACL,IAAIE,EAAQD,EAAO1oD,KAAK1O,OAASA,KAYjC,OAXAq3D,EAAM9nD,EAAI,GACV8nD,EAAM7rD,EAAI,GACV6rD,EAAM16C,MAAQ,EACd06C,EAAMC,MAAQ,EACdD,EAAME,SAAW,KACjBF,EAAMG,SAAW,KACjBH,EAAMI,UAAY,KAClBJ,EAAMK,cAAgB,KACtBL,EAAMM,SAAU,EAEhBN,EAAMK,cAAgBL,EAAMhqD,WACrBgqD,EAiQX,OA/QAZ,EAAUU,EAAQC,GAsBlBD,EAAOjsC,KAAO,SAAU0sC,GAEpB,OADa,IAAIT,GACH/pD,SAASwqD,IAO3BT,EAAO1oD,UAAUopD,OAAS,WAEtB,OADA73D,KAAK23D,SAAU,EACR33D,MAOXm3D,EAAO1oD,UAAUqpD,QAAU,WAEvB,OADA93D,KAAK23D,SAAU,EACR33D,MAOXm3D,EAAO1oD,UAAUpB,SAAW,WACxB,MAAO,CACHkC,EAAGvP,KAAKuP,EACR/D,EAAGxL,KAAKwL,EACRmR,MAAO3c,KAAK2c,MACZ26C,MAAOt3D,KAAKs3D,QAQpBH,EAAO1oD,UAAUspD,SAAW,SAAUH,GAClC,OAAO53D,KAAKuP,IAAMqoD,EAAMroD,GAAKvP,KAAKwL,IAAMosD,EAAMpsD,GAAKxL,KAAKs3D,QAAUM,EAAMN,OAASt3D,KAAK2c,QAAUi7C,EAAMj7C,OAO1Gw6C,EAAO1oD,UAAUupD,iBAAmB,WAChC,IAAIJ,EAAQ53D,KAAK03D,cACjB,OAAKE,EAEE,CACHroD,EAAGqoD,EAAMroD,EACT/D,EAAGosD,EAAMpsD,EACTmR,MAAOi7C,EAAMj7C,MACb26C,MAAOM,EAAMN,OALN,MAcfH,EAAO1oD,UAAUwpD,gBAAkB,SAAUX,GACzC,IAAI7sD,EAAI6sD,EAKR,MAJ6B,iBAAlBt3D,KAAKu3D,WACZ9sD,EAAIzE,KAAKuO,IAAI9J,EAAGzK,KAAKu3D,WACI,iBAAlBv3D,KAAKw3D,WACZ/sD,EAAIzE,KAAKsO,IAAI7J,EAAGzK,KAAKw3D,WAClB/sD,GAQX0sD,EAAO1oD,UAAUypD,cAAgB,SAAUN,GACvC,IAAIO,EAAiB,GASrB,MARuB,iBAAZP,EAAMroD,IACb4oD,EAAe5oD,EAAIqoD,EAAMroD,GACN,iBAAZqoD,EAAMpsD,IACb2sD,EAAe3sD,EAAIosD,EAAMpsD,GACF,iBAAhBosD,EAAMj7C,QACbw7C,EAAex7C,MAAQi7C,EAAMj7C,OACN,iBAAhBi7C,EAAMN,QACba,EAAeb,MAAQt3D,KAAKi4D,gBAAgBL,EAAMN,QAC/Ca,GAOXhB,EAAO1oD,UAAU2pD,WAAa,WAC1B,QAASp4D,KAAKy3D,WAQlBN,EAAO1oD,UAAUrB,SAAW,SAAUwqD,GAClC,IAAK53D,KAAK23D,QACN,OAAO33D,KAGXA,KAAK03D,cAAgB13D,KAAKqN,WAC1B,IAAIgrD,EAAar4D,KAAKk4D,cAAcN,GAYpC,MAX4B,iBAAjBS,EAAW9oD,IAClBvP,KAAKuP,EAAI8oD,EAAW9oD,GACI,iBAAjB8oD,EAAW7sD,IAClBxL,KAAKwL,EAAI6sD,EAAW7sD,GACQ,iBAArB6sD,EAAW17C,QAClB3c,KAAK2c,MAAQ07C,EAAW17C,OACI,iBAArB07C,EAAWf,QAClBt3D,KAAKs3D,MAAQe,EAAWf,OAEvBt3D,KAAK+3D,SAAS/3D,KAAK03D,gBACpB13D,KAAK2mB,KAAK,UAAW3mB,KAAKqN,YACvBrN,MASXm3D,EAAO1oD,UAAU6pD,YAAc,SAAUrjB,GAErC,OADAj1C,KAAKoN,SAAS6nC,EAAQj1C,KAAKqN,aACpBrN,MAWXm3D,EAAO1oD,UAAUrC,QAAU,SAAUwrD,EAAOW,EAAMvgB,GAC9C,IAAIqf,EAAQr3D,KACZ,GAAKA,KAAK23D,QAAV,CAEA,IAAIjlD,EAAU3I,OAAOiC,OAAO,GAAI8qD,EAAU0B,iBAAkBD,GACxDF,EAAar4D,KAAKk4D,cAAcN,GAChCa,EAAmC,mBAAnB/lD,EAAQ+lD,OAAwB/lD,EAAQ+lD,OAAS1B,EAAU9gE,QAAQyc,EAAQ+lD,QAE3Fn4D,EAAQ+iB,KAAKgQ,MAAOqlC,EAAe14D,KAAKqN,WAExCwD,EAAK,WACL,IAAIhH,GAAKwZ,KAAKgQ,MAAQ/yB,GAASoS,EAAQimD,SAEvC,GAAI9uD,GAAK,EAOL,OANAwtD,EAAMI,UAAY,KAClBJ,EAAMjqD,SAASirD,QACXhB,EAAMuB,oBACNvB,EAAMuB,kBAAkBlqD,KAAK,MAC7B2oD,EAAMuB,uBAAoB33D,IAIlC,IAAI+R,EAAcylD,EAAO5uD,GACrBgvD,EAAW,GACa,iBAAjBR,EAAW9oD,IAClBspD,EAAStpD,EAAImpD,EAAanpD,GAAK8oD,EAAW9oD,EAAImpD,EAAanpD,GAAKyD,GACxC,iBAAjBqlD,EAAW7sD,IAClBqtD,EAASrtD,EAAIktD,EAAaltD,GAAK6sD,EAAW7sD,EAAIktD,EAAaltD,GAAKwH,GACpC,iBAArBqlD,EAAW17C,QAClBk8C,EAASl8C,MAAQ+7C,EAAa/7C,OAAS07C,EAAW17C,MAAQ+7C,EAAa/7C,OAAS3J,GACpD,iBAArBqlD,EAAWf,QAClBuB,EAASvB,MAAQoB,EAAapB,OAASe,EAAWf,MAAQoB,EAAapB,OAAStkD,GACpFqkD,EAAMjqD,SAASyrD,GACfxB,EAAMI,WAAY,EAAIT,EAAQ8B,cAAcjoD,IAE5C7Q,KAAKy3D,YACL,EAAIT,EAAQ+B,aAAa/4D,KAAKy3D,WAC1Bz3D,KAAK44D,mBACL54D,KAAK44D,kBAAkBlqD,KAAK,MAChC1O,KAAKy3D,WAAY,EAAIT,EAAQ8B,cAAcjoD,IAG3CA,IAEJ7Q,KAAK44D,kBAAoB5gB,IAQ7Bmf,EAAO1oD,UAAU1C,aAAe,SAAUitD,GACtC,GAAKA,EAGA,CACD,GAA+B,iBAApBA,EACP,OAAOh5D,KAAKoM,QAAQ,CAAEkrD,MAAOt3D,KAAKs3D,MAAQ0B,IAE1Ch5D,KAAKoM,QAAQ,CACTkrD,MAAOt3D,KAAKs3D,OAAS0B,EAAgB3lD,QAAU6jD,IAChD8B,QARPh5D,KAAKoM,QAAQ,CAAEkrD,MAAOt3D,KAAKs3D,MAAQJ,KAgB3CC,EAAO1oD,UAAUxC,eAAiB,SAAU+sD,GACxC,GAAKA,EAGA,CACD,GAA+B,iBAApBA,EACP,OAAOh5D,KAAKoM,QAAQ,CAAEkrD,MAAOt3D,KAAKs3D,MAAQ0B,IAE1Ch5D,KAAKoM,QAAQ,CACTkrD,MAAOt3D,KAAKs3D,OAAS0B,EAAgB3lD,QAAU6jD,IAChD8B,QARPh5D,KAAKoM,QAAQ,CAAEkrD,MAAOt3D,KAAKs3D,MAAQJ,KAgB3CC,EAAO1oD,UAAUvC,cAAgB,SAAUwG,GACvC1S,KAAKoM,QAAQ,CACTmD,EAAG,GACH/D,EAAG,GACH8rD,MAAO,EACP36C,MAAO,GACRjK,IAOPykD,EAAO1oD,UAAUsQ,KAAO,WACpB,OAAOo4C,EAAOjsC,KAAKlrB,KAAKqN,aAErB8pD,EAhRgB,CAiRzBF,EAAQgC,mBACVpjE,EAAA,QAAkBshE,sCCzTlB,IACQX,EADJC,EAAaz2D,MAAQA,KAAKy2D,YACtBD,EAAgB,SAAUrgE,EAAGwT,GAI7B,OAHA6sD,EAAgBzsD,OAAOya,gBAClB,CAAEE,UAAW,cAAgBlW,OAAS,SAAUrY,EAAGwT,GAAKxT,EAAEuuB,UAAY/a,IACvE,SAAUxT,EAAGwT,GAAK,IAAK,IAAIF,KAAKE,EAAOI,OAAO0E,UAAU+M,eAAe9M,KAAK/E,EAAGF,KAAItT,EAAEsT,GAAKE,EAAEF,KACzF+sD,EAAcrgE,EAAGwT,IAErB,SAAUxT,EAAGwT,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIyb,UAAU,uBAAyB0B,OAAOnd,GAAK,iCAE7D,SAAS+sD,IAAO12D,KAAKJ,YAAczJ,EADnCqgE,EAAcrgE,EAAGwT,GAEjBxT,EAAEsY,UAAkB,OAAN9E,EAAaI,OAAOwa,OAAO5a,IAAM+sD,EAAGjoD,UAAY9E,EAAE8E,UAAW,IAAIioD,KAGnFwC,EAAYl5D,MAAQA,KAAKk5D,UAAa,WAStC,OARAA,EAAWnvD,OAAOiC,QAAU,SAASnC,GACjC,IAAK,IAAInM,EAAG2O,EAAI,EAAGvC,EAAI6E,UAAU7U,OAAQuS,EAAIvC,EAAGuC,IAE5C,IAAK,IAAI5C,KADT/L,EAAIiR,UAAUtC,GACOtC,OAAO0E,UAAU+M,eAAe9M,KAAKhR,EAAG+L,KACzDI,EAAEJ,GAAK/L,EAAE+L,IAEjB,OAAOI,GAEJqvD,EAASj0C,MAAMjlB,KAAM2O,YAEhC5E,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQsjE,cAAgBtjE,EAAQujE,eAAiBvjE,EAAQwjE,gBAAkBxjE,EAAQyjE,eAAiBzjE,EAAQ0jE,eAAiB1jE,EAAQ2jE,iBAAc,EAMnJ,IAAIvC,EAAU,EAAQ,OAetB,SAASuC,EAAY18D,EAAG28D,GACpB,IAAIC,EAAOD,EAAIE,wBACf,MAAO,CACHpqD,EAAGzS,EAAE88D,QAAUF,EAAKG,KACpBruD,EAAG1O,EAAEg9D,QAAUJ,EAAKK,KAW5B,SAASR,EAAez8D,EAAG28D,GACvB,IAAIO,EAAMd,EAASA,EAAS,GAAIM,EAAY18D,EAAG28D,IAAO,CAAEQ,uBAAuB,EAAOC,oBAAqB,WACnGF,EAAIC,uBAAwB,GAC7BE,SAAUr9D,IACjB,OAAOk9D,EAeX,SAASX,EAAgBe,GAErB,IADA,IAAIC,EAAM,GACDhuD,EAAI,EAAG1B,EAAI3E,KAAKsO,IAAI8lD,EAAQtgE,OAHvB,GAG6CuS,EAAI1B,EAAG0B,IAC9DguD,EAAIrgE,KAAKogE,EAAQ/tD,IACrB,OAAOguD,EAuBX,SAASlB,EAAcr8D,GAEnB,QAAwB,IAAbA,EAAEw9D,OACT,OAAoB,EAAZx9D,EAAEw9D,OAAe,IAC7B,QAAwB,IAAbx9D,EAAEy9D,OACT,OAAOz9D,EAAEy9D,QAAU,EACvB,MAAM,IAAIj5D,MAAM,+CA5DpBzL,EAAQ2jE,YAAcA,EActB3jE,EAAQ0jE,eAAiBA,EAWzB1jE,EAAQyjE,eAHR,SAAwBx8D,EAAG28D,GACvB,OAAOP,EAASA,EAAS,GAAIK,EAAez8D,EAAG28D,IAAO,CAAEe,MAAOrB,EAAcr8D,MAUjFjH,EAAQwjE,gBAAkBA,EAc1BxjE,EAAQujE,eANR,SAAwBt8D,EAAG28D,GACvB,MAAO,CACHW,QAASf,EAAgBv8D,EAAEs9D,SAAS7+D,KAAI,SAAUk/D,GAAS,OAAOjB,EAAYiB,EAAOhB,MACrFU,SAAUr9D,IAkBlBjH,EAAQsjE,cAAgBA,EAIxB,IAAIuB,EAAwB,SAAUtD,GAElC,SAASsD,EAAO9wD,EAAW+wD,GACvB,IAAItD,EAAQD,EAAO1oD,KAAK1O,OAASA,KAIjC,OAFAq3D,EAAMztD,UAAYA,EAClBytD,EAAMsD,SAAWA,EACVtD,EAEX,OARAZ,EAAUiE,EAAQtD,GAQXsD,EATgB,CAUzBzD,EAAQgC,mBACVpjE,EAAA,QAAkB6kE,sCCpIlB,IACQlE,EADJC,EAAaz2D,MAAQA,KAAKy2D,YACtBD,EAAgB,SAAUrgE,EAAGwT,GAI7B,OAHA6sD,EAAgBzsD,OAAOya,gBAClB,CAAEE,UAAW,cAAgBlW,OAAS,SAAUrY,EAAGwT,GAAKxT,EAAEuuB,UAAY/a,IACvE,SAAUxT,EAAGwT,GAAK,IAAK,IAAIF,KAAKE,EAAOI,OAAO0E,UAAU+M,eAAe9M,KAAK/E,EAAGF,KAAItT,EAAEsT,GAAKE,EAAEF,KACzF+sD,EAAcrgE,EAAGwT,IAErB,SAAUxT,EAAGwT,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIyb,UAAU,uBAAyB0B,OAAOnd,GAAK,iCAE7D,SAAS+sD,IAAO12D,KAAKJ,YAAczJ,EADnCqgE,EAAcrgE,EAAGwT,GAEjBxT,EAAEsY,UAAkB,OAAN9E,EAAaI,OAAOwa,OAAO5a,IAAM+sD,EAAGjoD,UAAY9E,EAAE8E,UAAW,IAAIioD,KAGnFkE,EAAmB56D,MAAQA,KAAK46D,kBAAqB7wD,OAAOwa,OAAS,SAAUpY,EAAG3O,EAAGsP,EAAG+tD,QAC7E55D,IAAP45D,IAAkBA,EAAK/tD,GAC3B/C,OAAO6b,eAAezZ,EAAG0uD,EAAI,CAAEv1C,YAAY,EAAM5e,IAAK,WAAa,OAAOlJ,EAAEsP,OAC3E,SAAUX,EAAG3O,EAAGsP,EAAG+tD,QACT55D,IAAP45D,IAAkBA,EAAK/tD,GAC3BX,EAAE0uD,GAAMr9D,EAAEsP,KAEVguD,EAAsB96D,MAAQA,KAAK86D,qBAAwB/wD,OAAOwa,OAAS,SAAUpY,EAAG7C,GACxFS,OAAO6b,eAAezZ,EAAG,UAAW,CAAEmZ,YAAY,EAAM7kB,MAAO6I,KAC9D,SAAS6C,EAAG7C,GACb6C,EAAW,QAAI7C,IAEfyxD,EAAgB/6D,MAAQA,KAAK+6D,cAAiB,SAAUnE,GACxD,GAAIA,GAAOA,EAAIC,WAAY,OAAOD,EAClC,IAAI1iC,EAAS,GACb,GAAW,MAAP0iC,EAAa,IAAK,IAAI9pD,KAAK8pD,EAAe,YAAN9pD,GAAmB/C,OAAO0E,UAAU+M,eAAe9M,KAAKkoD,EAAK9pD,IAAI8tD,EAAgB1mC,EAAQ0iC,EAAK9pD,GAEtI,OADAguD,EAAmB5mC,EAAQ0iC,GACpB1iC,GAEXnqB,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD,IAAIu6D,EAAWD,EAAa,EAAQ,QAkBhCE,EAA6B,SAAU7D,GAEvC,SAAS6D,EAAYrxD,EAAW+wD,GAC5B,IAAItD,EAAQD,EAAO1oD,KAAK1O,KAAM4J,EAAW+wD,IAAa36D,KA8BtD,OA5BAq3D,EAAMM,SAAU,EAChBN,EAAM6D,cAAgB,EACtB7D,EAAM8D,cAAgB,KACtB9D,EAAM+D,WAAa,KACnB/D,EAAMgE,WAAa,KACnBhE,EAAMiE,aAAc,EACpBjE,EAAMkE,UAAW,EACjBlE,EAAMmE,cAAgB,KACtBnE,EAAMoE,iBAAmB,KACzBpE,EAAMqE,OAAS,EACfrE,EAAMsE,mBAAqB,KAC3BtE,EAAMuE,sBAAwB,EAE9BvE,EAAMwE,YAAcxE,EAAMwE,YAAYtpD,KAAK8kD,GAC3CA,EAAMyE,iBAAmBzE,EAAMyE,iBAAiBvpD,KAAK8kD,GACrDA,EAAM0E,WAAa1E,EAAM0E,WAAWxpD,KAAK8kD,GACzCA,EAAM2E,SAAW3E,EAAM2E,SAASzpD,KAAK8kD,GACrCA,EAAM4E,WAAa5E,EAAM4E,WAAW1pD,KAAK8kD,GACzCA,EAAM6E,YAAc7E,EAAM6E,YAAY3pD,KAAK8kD,GAC3CA,EAAM8E,UAAY9E,EAAM8E,UAAU5pD,KAAK8kD,GAEvCztD,EAAUqL,iBAAiB,QAASoiD,EAAMwE,aAAa,GACvDjyD,EAAUqL,iBAAiB,cAAeoiD,EAAMyE,kBAAkB,GAClElyD,EAAUqL,iBAAiB,YAAaoiD,EAAM0E,YAAY,GAC1DnyD,EAAUqL,iBAAiB,QAASoiD,EAAM6E,aAAa,GACvDtyD,EAAUqL,iBAAiB,WAAYoiD,EAAM8E,WAAW,GACxDC,SAASnnD,iBAAiB,YAAaoiD,EAAM4E,YAAY,GACzDG,SAASnnD,iBAAiB,UAAWoiD,EAAM2E,UAAU,GAC9C3E,EAiMX,OAjOAZ,EAAUwE,EAAa7D,GAkCvB6D,EAAYxsD,UAAUnB,KAAO,WACzB,IAAI1D,EAAY5J,KAAK4J,UACrBA,EAAUwd,oBAAoB,QAASpnB,KAAK67D,aAC5CjyD,EAAUwd,oBAAoB,cAAepnB,KAAK87D,kBAClDlyD,EAAUwd,oBAAoB,YAAapnB,KAAK+7D,YAChDnyD,EAAUwd,oBAAoB,QAASpnB,KAAKk8D,aAC5CtyD,EAAUwd,oBAAoB,WAAYpnB,KAAKm8D,WAC/CC,SAASh1C,oBAAoB,YAAapnB,KAAKi8D,YAC/CG,SAASh1C,oBAAoB,UAAWpnB,KAAKg8D,WAEjDf,EAAYxsD,UAAUotD,YAAc,SAAU/+D,GAC1C,IAAIu6D,EAAQr3D,KACZ,GAAKA,KAAK23D,QAAV,CAGA,GADA33D,KAAK07D,SACe,IAAhB17D,KAAK07D,OAML,OALA17D,KAAK07D,OAAS,EACyB,iBAA5B17D,KAAK27D,qBACZ7lD,aAAa9V,KAAK27D,oBAClB37D,KAAK27D,mBAAqB,MAEvB37D,KAAKq8D,kBAAkBv/D,GAElCiZ,YAAW,WACPshD,EAAMqE,OAAS,EACfrE,EAAMsE,mBAAqB,OApEZ,KAuEf37D,KAAKk7D,cA5Ec,GA6EnBl7D,KAAK2mB,KAAK,SAAS,EAAIq0C,EAASzB,gBAAgBz8D,EAAGkD,KAAK4J,cAEhEqxD,EAAYxsD,UAAUqtD,iBAAmB,SAAUh/D,GAC1CkD,KAAK23D,SAEV33D,KAAK2mB,KAAK,cAAc,EAAIq0C,EAASzB,gBAAgBz8D,EAAGkD,KAAK4J,aAEjEqxD,EAAYxsD,UAAU4tD,kBAAoB,SAAUv/D,GAChD,GAAKkD,KAAK23D,QAAV,CAEA76D,EAAEw/D,iBACFx/D,EAAEy/D,kBACF,IAAIC,GAAc,EAAIxB,EAASzB,gBAAgBz8D,EAAGkD,KAAK4J,WAEvD,GADA5J,KAAK2mB,KAAK,cAAe61C,IACrBA,EAAYvC,sBAAhB,CAGA,IAAIwC,EAASz8D,KAAK26D,SAASrvD,YACvBoxD,EAAWD,EAAOxE,gBAAgBwE,EAAOpvD,WAAWiqD,MAzF/B,KA0FzBmF,EAAOrwD,QAAQpM,KAAK26D,SAASgC,wBAAuB,EAAI3B,EAASxB,aAAa18D,EAAGkD,KAAK4J,WAAY8yD,GAAW,CACzGjE,OAAQ,iBACRE,SA3FwB,SA8FhCsC,EAAYxsD,UAAUstD,WAAa,SAAUj/D,GACzC,GAAKkD,KAAK23D,QAAV,CAGA,GAAiB,IAAb76D,EAAE8/D,OAAc,CAChB58D,KAAKy7D,iBAAmBz7D,KAAK26D,SAASrvD,YAAY+B,WAClD,IAAIwvD,GAAK,EAAI7B,EAASxB,aAAa18D,EAAGkD,KAAK4J,WAAY2F,EAAIstD,EAAGttD,EAAG/D,EAAIqxD,EAAGrxD,EACxExL,KAAKo7D,WAAa7rD,EAClBvP,KAAKq7D,WAAa7vD,EAClBxL,KAAKk7D,cAAgB,EACrBl7D,KAAKm7D,cAAgB93C,KAAKgQ,MAC1BrzB,KAAKs7D,aAAc,EAEvBt7D,KAAK2mB,KAAK,aAAa,EAAIq0C,EAASzB,gBAAgBz8D,EAAGkD,KAAK4J,cAEhEqxD,EAAYxsD,UAAUutD,SAAW,SAAUl/D,GACvC,IAAIu6D,EAAQr3D,KACZ,GAAKA,KAAK23D,SAAY33D,KAAKs7D,YAA3B,CAEA,IAAImB,EAASz8D,KAAK26D,SAASrvD,YAC3BtL,KAAKs7D,aAAc,EACe,iBAAvBt7D,KAAKw7D,gBACZ1lD,aAAa9V,KAAKw7D,eAClBx7D,KAAKw7D,cAAgB,MAEzB,IAAIqB,GAAK,EAAI7B,EAASxB,aAAa18D,EAAGkD,KAAK4J,WAAY2F,EAAIstD,EAAGttD,EAAG/D,EAAIqxD,EAAGrxD,EACpEsxD,EAAcL,EAAOpvD,WAAY0vD,EAAsBN,EAAOzE,oBAAsB,CAAEzoD,EAAG,EAAG/D,EAAG,GAC/FxL,KAAKu7D,SACLkB,EAAOrwD,QAAQ,CACXmD,EAAGutD,EAAYvtD,EAhIL,GAgIgCutD,EAAYvtD,EAAIwtD,EAAoBxtD,GAC9E/D,EAAGsxD,EAAYtxD,EAjIL,GAiIgCsxD,EAAYtxD,EAAIuxD,EAAoBvxD,IAC/E,CACCmtD,SApIa,IAqIbF,OAAQ,iBAGPz4D,KAAKo7D,aAAe7rD,GAAKvP,KAAKq7D,aAAe7vD,GAClDixD,EAAOrvD,SAAS,CACZmC,EAAGutD,EAAYvtD,EACf/D,EAAGsxD,EAAYtxD,IAGvBxL,KAAKu7D,UAAW,EAChBxlD,YAAW,WACPshD,EAAM6D,cAAgB,EAOtB7D,EAAMsD,SAAS9uD,YAChB,GACH7L,KAAK2mB,KAAK,WAAW,EAAIq0C,EAASzB,gBAAgBz8D,EAAGkD,KAAK4J,cAE9DqxD,EAAYxsD,UAAUwtD,WAAa,SAAUn/D,GACzC,IAAIu6D,EAAQr3D,KACZ,GAAKA,KAAK23D,QAAV,CAEA,IAAI6E,GAAc,EAAIxB,EAASzB,gBAAgBz8D,EAAGkD,KAAK4J,WAWvD,GAPA5J,KAAK2mB,KAAK,gBAAiB61C,GAIvB1/D,EAAEwR,SAAWtO,KAAK4J,WAClB5J,KAAK2mB,KAAK,YAAa61C,IAEvBA,EAAYvC,uBAIZj6D,KAAKs7D,YAAa,CAClBt7D,KAAKu7D,UAAW,EAChBv7D,KAAKk7D,gBAC6B,iBAAvBl7D,KAAKw7D,eACZ1lD,aAAa9V,KAAKw7D,eAEtBx7D,KAAKw7D,cAAgBzqD,OAAOgF,YAAW,WACnCshD,EAAMmE,cAAgB,KACtBnE,EAAMkE,UAAW,IAxLd,KA0LP,IAAIkB,EAASz8D,KAAK26D,SAASrvD,YACvBuxD,GAAK,EAAI7B,EAASxB,aAAa18D,EAAGkD,KAAK4J,WAAYozD,EAAKH,EAAGttD,EAAG0tD,EAAKJ,EAAGrxD,EACtE0xD,EAAYl9D,KAAK26D,SAASwC,sBAAsB,CAChD5tD,EAAGvP,KAAKo7D,WACR5vD,EAAGxL,KAAKq7D,aAER+B,EAAQp9D,KAAK26D,SAASwC,sBAAsB,CAAE5tD,EAAGytD,EAAIxxD,EAAGyxD,IACxDI,EAAUH,EAAU3tD,EAAI6tD,EAAM7tD,EAAG+tD,EAAUJ,EAAU1xD,EAAI4xD,EAAM5xD,EAC/DsxD,EAAcL,EAAOpvD,WACrBkC,EAAIutD,EAAYvtD,EAAI8tD,EAAS7xD,EAAIsxD,EAAYtxD,EAAI8xD,EACrDb,EAAOrvD,SAAS,CAAEmC,EAAGA,EAAG/D,EAAGA,IAC3BxL,KAAKo7D,WAAa4B,EAClBh9D,KAAKq7D,WAAa4B,EAClBngE,EAAEw/D,iBACFx/D,EAAEy/D,qBAGVtB,EAAYxsD,UAAUytD,YAAc,SAAUp/D,GAC1C,IAAIu6D,EAAQr3D,KACZ,GAAKA,KAAK23D,QAAV,CAEA76D,EAAEw/D,iBACFx/D,EAAEy/D,kBACF,IAAI/B,GAAQ,EAAIQ,EAAS7B,eAAer8D,GACxC,GAAK09D,EAAL,CAEA,IAAI+C,GAAc,EAAIvC,EAAS1B,gBAAgBx8D,EAAGkD,KAAK4J,WAEvD,GADA5J,KAAK2mB,KAAK,QAAS42C,IACfA,EAAYtD,sBAAhB,CAGA,IAAIuD,EAAYhD,EAAQ,EAAI,EApNhB,QAqNRiC,EAASz8D,KAAK26D,SAASrvD,YACvBoxD,EAAWD,EAAOxE,gBAAgBwE,EAAOpvD,WAAWiqD,MAAQkG,GAC5DC,EAAiBjD,EAAQ,EAAI,GAAK,EAClCnnC,EAAMhQ,KAAKgQ,MAEXrzB,KAAK47D,wBAA0B6B,GAC/Bz9D,KAAK09D,sBACLrqC,EAAMrzB,KAAK09D,qBAAuBC,KAGtClB,EAAOrwD,QAAQpM,KAAK26D,SAASgC,wBAAuB,EAAI3B,EAASxB,aAAa18D,EAAGkD,KAAK4J,WAAY8yD,GAAW,CACzGjE,OAAQ,eACRE,SAlOc,MAmOf,WACCtB,EAAMuE,sBAAwB,KAElC57D,KAAK47D,sBAAwB6B,EAC7Bz9D,KAAK09D,qBAAuBrqC,OAEhC4nC,EAAYxsD,UAAU0tD,UAAY,aAG3BlB,EAlOqB,CAmO9BD,EAAS/kE,SACXJ,EAAA,QAAkBolE,sCCzRlB,IACQzE,EADJC,EAAaz2D,MAAQA,KAAKy2D,YACtBD,EAAgB,SAAUrgE,EAAGwT,GAI7B,OAHA6sD,EAAgBzsD,OAAOya,gBAClB,CAAEE,UAAW,cAAgBlW,OAAS,SAAUrY,EAAGwT,GAAKxT,EAAEuuB,UAAY/a,IACvE,SAAUxT,EAAGwT,GAAK,IAAK,IAAIF,KAAKE,EAAOI,OAAO0E,UAAU+M,eAAe9M,KAAK/E,EAAGF,KAAItT,EAAEsT,GAAKE,EAAEF,KACzF+sD,EAAcrgE,EAAGwT,IAErB,SAAUxT,EAAGwT,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIyb,UAAU,uBAAyB0B,OAAOnd,GAAK,iCAE7D,SAAS+sD,IAAO12D,KAAKJ,YAAczJ,EADnCqgE,EAAcrgE,EAAGwT,GAEjBxT,EAAEsY,UAAkB,OAAN9E,EAAaI,OAAOwa,OAAO5a,IAAM+sD,EAAGjoD,UAAY9E,EAAE8E,UAAW,IAAIioD,KAGnFkE,EAAmB56D,MAAQA,KAAK46D,kBAAqB7wD,OAAOwa,OAAS,SAAUpY,EAAG3O,EAAGsP,EAAG+tD,QAC7E55D,IAAP45D,IAAkBA,EAAK/tD,GAC3B/C,OAAO6b,eAAezZ,EAAG0uD,EAAI,CAAEv1C,YAAY,EAAM5e,IAAK,WAAa,OAAOlJ,EAAEsP,OAC3E,SAAUX,EAAG3O,EAAGsP,EAAG+tD,QACT55D,IAAP45D,IAAkBA,EAAK/tD,GAC3BX,EAAE0uD,GAAMr9D,EAAEsP,KAEVguD,EAAsB96D,MAAQA,KAAK86D,qBAAwB/wD,OAAOwa,OAAS,SAAUpY,EAAG7C,GACxFS,OAAO6b,eAAezZ,EAAG,UAAW,CAAEmZ,YAAY,EAAM7kB,MAAO6I,KAC9D,SAAS6C,EAAG7C,GACb6C,EAAW,QAAI7C,IAEfyxD,EAAgB/6D,MAAQA,KAAK+6D,cAAiB,SAAUnE,GACxD,GAAIA,GAAOA,EAAIC,WAAY,OAAOD,EAClC,IAAI1iC,EAAS,GACb,GAAW,MAAP0iC,EAAa,IAAK,IAAI9pD,KAAK8pD,EAAe,YAAN9pD,GAAmB/C,OAAO0E,UAAU+M,eAAe9M,KAAKkoD,EAAK9pD,IAAI8tD,EAAgB1mC,EAAQ0iC,EAAK9pD,GAEtI,OADAguD,EAAmB5mC,EAAQ0iC,GACpB1iC,GAEP0pC,EAAU59D,MAAQA,KAAK49D,QAAW,SAAUzxD,EAAGrC,GAC/C,IAAItM,EAAsB,mBAAX6mB,QAAyBlY,EAAEkY,OAAOC,UACjD,IAAK9mB,EAAG,OAAO2O,EACf,IAAmB1B,EAAY3N,EAA3BuP,EAAI7O,EAAEkR,KAAKvC,GAAO0xD,EAAK,GAC3B,IACI,WAAc,IAAN/zD,GAAgBA,KAAM,MAAQW,EAAI4B,EAAEiL,QAAQ+Q,MAAMw1C,EAAG7jE,KAAKyQ,EAAEhK,OAExE,MAAOgnB,GAAS3qB,EAAI,CAAE2qB,MAAOA,GAC7B,QACI,IACQhd,IAAMA,EAAE4d,OAAS7qB,EAAI6O,EAAU,SAAI7O,EAAEkR,KAAKrC,GAElD,QAAU,GAAIvP,EAAG,MAAMA,EAAE2qB,OAE7B,OAAOo2C,GAEX9zD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD,IAAIu6D,EAAWD,EAAa,EAAQ,QAShC+C,EAA6B,SAAU1G,GAEvC,SAAS0G,EAAYl0D,EAAW+wD,GAC5B,IAAItD,EAAQD,EAAO1oD,KAAK1O,KAAM4J,EAAW+wD,IAAa36D,KAetD,OAdAq3D,EAAMM,SAAU,EAChBN,EAAMkE,UAAW,EACjBlE,EAAM0G,UAAW,EACjB1G,EAAM2G,UAAY,EAClB3G,EAAM4G,sBAAwB,GAE9B5G,EAAM6G,YAAc7G,EAAM6G,YAAY3rD,KAAK8kD,GAC3CA,EAAM8G,YAAc9G,EAAM8G,YAAY5rD,KAAK8kD,GAC3CA,EAAM4E,WAAa5E,EAAM4E,WAAW1pD,KAAK8kD,GAEzCztD,EAAUqL,iBAAiB,aAAcoiD,EAAM6G,aAAa,GAC5Dt0D,EAAUqL,iBAAiB,WAAYoiD,EAAM8G,aAAa,GAC1Dv0D,EAAUqL,iBAAiB,cAAeoiD,EAAM8G,aAAa,GAC7Dv0D,EAAUqL,iBAAiB,YAAaoiD,EAAM4E,YAAY,GACnD5E,EAwLX,OAzMAZ,EAAUqH,EAAa1G,GAmBvB0G,EAAYrvD,UAAUnB,KAAO,WACzB,IAAI1D,EAAY5J,KAAK4J,UACrBA,EAAUwd,oBAAoB,aAAcpnB,KAAKk+D,aACjDt0D,EAAUwd,oBAAoB,WAAYpnB,KAAKm+D,aAC/Cv0D,EAAUwd,oBAAoB,cAAepnB,KAAKm+D,aAClDv0D,EAAUwd,oBAAoB,YAAapnB,KAAKi8D,aAEpD6B,EAAYrvD,UAAU2vD,cAAgB,WAClC,MAAO,CACH5mE,MAAOwI,KAAK4J,UAAUO,YACtB1S,OAAQuI,KAAK4J,UAAUQ,eAG/B0zD,EAAYrvD,UAAU4vD,0BAA4B,SAAU9sD,EAAMzU,EAAG29D,EAAO1zC,GACxE,IAAIu3C,EAAgB7D,GAAS39D,EAAEs9D,QAAQ,GACnCmE,EAAa,IAAIC,WAAWjtD,EAAM,CAClCqoD,QAAS0E,EAAc1E,QACvBE,QAASwE,EAAcxE,QACvB2E,OAAQ3hE,EAAE2hE,OACVC,QAAS5hE,EAAE4hE,UAEfH,EAAWI,uBAAwB,GAClC53C,GAAW/mB,KAAK4J,WAAWg1D,cAAcL,IAE9CT,EAAYrvD,UAAUyvD,YAAc,SAAUphE,GAC1C,IAAIu6D,EAAQr3D,KACZ,GAAKA,KAAK23D,QAAV,CAGA76D,EAAEw/D,iBAEuB,IAArBx/D,EAAEs9D,QAAQtgE,QACVkG,KAAKq+D,0BAA0B,YAAavhE,GAChD,IAAIs9D,GAAU,EAAIY,EAAS3B,iBAAiBv8D,EAAEs9D,SAO9C,GANAp6D,KAAKg+D,UAAY5D,EAAQtgE,OACzBkG,KAAKy7D,iBAAmBz7D,KAAK26D,SAASrvD,YAAY+B,WAClDrN,KAAKi+D,sBAAwB7D,EAAQ7+D,KAAI,SAAUk/D,GAAS,OAAO,EAAIO,EAASxB,aAAaiB,EAAOpD,EAAMztD,cAC1G5J,KAAK6+D,YAAczE,EACnBp6D,KAAK8+D,qBAAuB9+D,KAAKi+D,sBAEV,IAAnBj+D,KAAKg+D,UAAiB,CACtB,IAAInB,EAAKe,EAAO59D,KAAKi+D,sBAAuB,GAAIc,EAAKlC,EAAG,GAAImC,EAAKD,EAAGxvD,EAAG0vD,EAAKF,EAAGvzD,EAAG0zD,EAAKrC,EAAG,GAAIzkD,EAAK8mD,EAAG3vD,EAAG8I,EAAK6mD,EAAG1zD,EACjHxL,KAAKm/D,kBAAoBn5D,KAAKo5D,MAAM/mD,EAAK4mD,EAAI7mD,EAAK4mD,GAClDh/D,KAAKq/D,qBAAuBr5D,KAAK4O,KAAK5O,KAAK2O,IAAIyD,EAAK4mD,EAAI,GAAKh5D,KAAK2O,IAAI0D,EAAK4mD,EAAI,IAEnFj/D,KAAK2mB,KAAK,aAAa,EAAIq0C,EAAS5B,gBAAgBt8D,EAAGkD,KAAK4J,cAEhEk0D,EAAYrvD,UAAU0vD,YAAc,SAAUrhE,GAC1C,GAAKkD,KAAK23D,QAAV,CAgBA,OAbA76D,EAAEw/D,iBAEuB,IAArBx/D,EAAEs9D,QAAQtgE,QAAgBkG,KAAK6+D,aAAe7+D,KAAK6+D,YAAY/kE,SAC/DkG,KAAKq+D,0BAA0B,UAAWvhE,EAAGkD,KAAK6+D,YAAY,GAAIzC,UAE7Dp8D,KAAK+9D,UACN/9D,KAAKq+D,0BAA0B,QAASvhE,EAAGkD,KAAK6+D,YAAY,KAGhE7+D,KAAKw7D,gBACLx7D,KAAKu7D,UAAW,EAChBzlD,aAAa9V,KAAKw7D,gBAEdx7D,KAAKg+D,WACT,KAAK,EACD,GAAyB,IAArBlhE,EAAEs9D,QAAQtgE,OAAc,CACxBkG,KAAKk+D,YAAYphE,GACjBA,EAAEw/D,iBACF,MAGR,KAAK,EAGD,GAAIt8D,KAAKu7D,SAAU,CACf,IAAIkB,EAASz8D,KAAK26D,SAASrvD,YACvBwxD,EAAcL,EAAOpvD,WAAY0vD,EAAsBN,EAAOzE,oBAAsB,CAAEzoD,EAAG,EAAG/D,EAAG,GACnGixD,EAAOrwD,QAAQ,CACXmD,EAAGutD,EAAYvtD,EA1Gb,GA0GwCutD,EAAYvtD,EAAIwtD,EAAoBxtD,GAC9E/D,EAAGsxD,EAAYtxD,EA3Gb,GA2GwCsxD,EAAYtxD,EAAIuxD,EAAoBvxD,IAC/E,CACCmtD,SA5GK,IA6GLF,OAAQ,iBAGhBz4D,KAAK+9D,UAAW,EAChB/9D,KAAKu7D,UAAW,EAChBv7D,KAAKg+D,UAAY,EAGzBh+D,KAAK2mB,KAAK,WAAW,EAAIq0C,EAAS5B,gBAAgBt8D,EAAGkD,KAAK4J,cAE9Dk0D,EAAYrvD,UAAUwtD,WAAa,SAAUn/D,GACzC,IAAI+/D,EACAxF,EAAQr3D,KACZ,GAAKA,KAAK23D,QAAV,CAGA76D,EAAEw/D,iBAEuB,IAArBx/D,EAAEs9D,QAAQtgE,QACVkG,KAAKq+D,0BAA0B,YAAavhE,GAChD,IAAIs9D,GAAU,EAAIY,EAAS3B,iBAAiBv8D,EAAEs9D,SAC1CkF,EAAmBlF,EAAQ7+D,KAAI,SAAUk/D,GAAS,OAAO,EAAIO,EAASxB,aAAaiB,EAAOpD,EAAMztD,cAcpG,GAbA5J,KAAK6+D,YAAczE,EACnBp6D,KAAK8+D,qBAAuBQ,EAO5Bt/D,KAAK+9D,WAAa/9D,KAAK+9D,SAAWuB,EAAiBz0D,MAAK,SAAU0/C,EAAUgV,GACxE,IAAIC,EAAgBnI,EAAM4G,sBAAsBsB,GAChD,OAAOhV,EAASh7C,IAAMiwD,EAAcjwD,GAAKg7C,EAAS/+C,IAAMg0D,EAAch0D,MAGrExL,KAAK+9D,SAAV,CAGA/9D,KAAKu7D,UAAW,EACZv7D,KAAKw7D,eACL1lD,aAAa9V,KAAKw7D,eACtBx7D,KAAKw7D,cAAgBzqD,OAAOgF,YAAW,WACnCshD,EAAMkE,UAAW,IAzJV,KA2JX,IAAIkB,EAASz8D,KAAK26D,SAASrvD,YACvBmwD,EAAmBz7D,KAAKy7D,iBAC5B,OAAQz7D,KAAKg+D,WACT,KAAK,EACD,IAAIe,EAAK/+D,KAAK26D,SAASwC,uBAAuBn9D,KAAKi+D,uBAAyB,IAAI,IAAKwB,EAASV,EAAGxvD,EAAGmwD,EAASX,EAAGvzD,EAC5G0zD,EAAKl/D,KAAK26D,SAASwC,sBAAsBmC,EAAiB,IAAK/vD,EAAI2vD,EAAG3vD,EAAG/D,EAAI0zD,EAAG1zD,EACpFixD,EAAOrvD,SAAS,CACZmC,EAAGksD,EAAiBlsD,EAAIkwD,EAASlwD,EACjC/D,EAAGiwD,EAAiBjwD,EAAIk0D,EAASl0D,IAErC,MAEJ,KAAK,EAWD,IAAIm0D,EAAiB,GACjBC,EAAKN,EAAiB,GAAIN,EAAKY,EAAGrwD,EAAG0vD,EAAKW,EAAGp0D,EAC7Cq0D,EAAKP,EAAiB,GAAIlnD,EAAKynD,EAAGtwD,EAAG8I,EAAKwnD,EAAGr0D,EAC7Cs0D,EAAY95D,KAAKo5D,MAAM/mD,EAAK4mD,EAAI7mD,EAAK4mD,GAAMh/D,KAAKm/D,kBAChD3B,EAAYx3D,KAAK+5D,MAAM1nD,EAAK4mD,EAAI7mD,EAAK4mD,GAAMh/D,KAAKq/D,qBAEhD3C,EAAWD,EAAOxE,gBAAgBwD,EAAiBnE,MAAQkG,GAC/DmC,EAAerI,MAAQoF,EACvBiD,EAAehjD,MAAQ8+C,EAAiB9+C,MAAQmjD,EAEhD,IAAIpkD,EAAa1b,KAAKo+D,gBAClB4B,EAAqBhgE,KAAK26D,SAASwC,uBAAuBn9D,KAAKi+D,uBAAyB,IAAI,GAAI,CAAEnB,YAAarB,IAC/GwE,EAAoBj6D,KAAKsO,IAAIoH,EAAWlkB,MAAOkkB,EAAWjkB,QAC1D+c,EAAKyrD,EAAoBvkD,EAAWlkB,MAEpC8/D,EAAQoF,EAAWuD,EAGnBz0D,EAAIyzD,EAAKgB,EAAoB,GAJxBA,EAAoBvkD,EAAWjkB,QASjC8X,GAHPstD,EAAKe,EAAO,EAHRruD,EAAIyvD,EAAKiB,EAAoB,EAAIzrD,GAI7BxO,KAAKiW,KAAK0jD,EAAehjD,OAASnR,EAAIxF,KAAKkW,KAAKyjD,EAAehjD,OACnEnR,EAAIxF,KAAKiW,KAAK0jD,EAAehjD,OAASpN,EAAIvJ,KAAKkW,KAAKyjD,EAAehjD,QACpE,IAAW,GAAInR,EAAIqxD,EAAG,GACzB8C,EAAepwD,EAAIywD,EAAmBzwD,EAAIA,EAAI+nD,EAC9CqI,EAAen0D,EAAIw0D,EAAmBx0D,EAAIA,EAAI8rD,EAC9CmF,EAAOrvD,SAASuyD,GAIxB3/D,KAAK2mB,KAAK,aAAa,EAAIq0C,EAAS5B,gBAAgBt8D,EAAGkD,KAAK4J,eAEzDk0D,EA1MqB,CA2M9B9C,EAAS/kE,SACXJ,EAAA,QAAkBioE,6BCxQlB/zD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQqqE,6BAA+BrqE,EAAQsqE,eAAY,EAO3D,IAAIC,EAAgC,WAChC,SAASA,EAAezoD,EAAK3I,GACzBhP,KAAK2X,IAAMA,EACX3X,KAAKgP,KAAOA,EAehB,OAbAoxD,EAAe1O,QAAU,SAAU7B,EAAOvnD,GAEtC,OAAIunD,EAAM7gD,KAAO1G,EAAO0G,MACZ,EACR6gD,EAAM7gD,KAAO1G,EAAO0G,MAIpB6gD,EAAMl4C,IAAMrP,EAAOqP,IAHZ,GAMH,GAELyoD,EAlBwB,GAuB/BD,EAA2B,WAC3B,SAASA,IACLngE,KAAKxI,MAAQ,EACbwI,KAAKvI,OAAS,EACduI,KAAKqgE,SAAW,EAChBrgE,KAAKsgE,QAAU,EACftgE,KAAKugE,KAAO,EACZvgE,KAAKwgE,MAAQ,GAiDjB,OA/CAL,EAAU1xD,UAAUgyD,eAAiB,SAAU/kD,EAAY2kD,GACvDrgE,KAAKxI,MAAQkkB,EAAWlkB,MACxBwI,KAAKvI,OAASikB,EAAWjkB,OACzBuI,KAAKqgE,SAAWA,EAChBrgE,KAAKsgE,QAAUt6D,KAAKy9B,KAAK/nB,EAAWlkB,MAAQ6oE,GAC5CrgE,KAAKugE,KAAOv6D,KAAKy9B,KAAK/nB,EAAWjkB,OAAS4oE,GAC1CrgE,KAAKwgE,MAAQ,IAEjBL,EAAU1xD,UAAUiyD,SAAW,SAAUC,GACrC,IAAIC,EAAS56D,KAAK6C,MAAM83D,EAAIpxD,EAAIvP,KAAKqgE,UAErC,OADar6D,KAAK6C,MAAM83D,EAAIn1D,EAAIxL,KAAKqgE,UACrBrgE,KAAKsgE,QAAUM,GAEnCT,EAAU1xD,UAAUvI,IAAM,SAAUyR,EAAK3I,EAAM2xD,GAC3C,IAAIE,EAAY,IAAIT,EAAezoD,EAAK3I,GACpCnV,EAAQmG,KAAK0gE,SAASC,GACtBG,EAAO9gE,KAAKwgE,MAAM3mE,GACjBinE,IACDA,EAAO,GACP9gE,KAAKwgE,MAAM3mE,GAASinE,GAExBA,EAAK9mE,KAAK6mE,IAEdV,EAAU1xD,UAAUsyD,SAAW,WAC3B,IAAK,IAAIj0D,KAAK9M,KAAKwgE,MACJxgE,KAAKwgE,MAAM1zD,GACjBmlC,KAAKmuB,EAAe1O,UAGjCyO,EAAU1xD,UAAUuyD,mBAAqB,SAAU1J,EAAO2J,GAKtD,IAAIC,EAAWlhE,KAAKqgE,SAAWrgE,KAAKqgE,SAEhCc,EADiBD,EAAW5J,EAAQA,EACF2J,EAAWC,EAC7CE,EAAyBp7D,KAAKy9B,KAAK09B,GACnCE,EAAS,GACb,IAAK,IAAIv0D,KAAK9M,KAAKwgE,MAEf,IADA,IAAIM,EAAO9gE,KAAKwgE,MAAM1zD,GACbT,EAAI,EAAGA,EAAIrG,KAAKsO,IAAI8sD,EAAwBN,EAAKhnE,QAASuS,IAC/Dg1D,EAAOrnE,KAAK8mE,EAAKz0D,GAAGsL,KAG5B,OAAO0pD,GAEJlB,EAxDmB,GA0D9BtqE,EAAQsqE,UAAYA,EA8BpBtqE,EAAQqqE,6BAlBR,SAAsCjuD,GAClC,IAAIlF,EAAQkF,EAAOlF,MAAOu0D,EAAcrvD,EAAOqvD,YAAaC,EAAmBtvD,EAAOsvD,iBAAkBC,EAAsBvvD,EAAOuvD,oBACjIC,EAAc,GAclB,OATA10D,EAAM0C,aAAY,SAAUC,EAAMlF,EAAGmF,EAAQrB,IACrCqB,IAAW2xD,GACXhzD,IAAWgzD,GACXC,EAAiB9iD,IAAI9O,IACrB4xD,EAAiB9iD,IAAInQ,IACpBkzD,EAAoB/iD,IAAI9O,IAAW6xD,EAAoB/iD,IAAInQ,KAC5DmzD,EAAYznE,KAAK0V,MAGlB+xD,uCCrHX,IAAI9K,EAAmB32D,MAAQA,KAAK22D,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExD7sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQ6rE,0BAA4B7rE,EAAQ8rE,uBAAyB9rE,EAAQ+rE,iCAAmC/rE,EAAQgsE,wBAAqB,EAY7I,IAAIC,EAAWnL,EAAgB,EAAQ,OAgCnCoL,GAA0B,EAU9B,SAASF,EAAmBG,GACxB,OAAOA,EAAK5pD,KAAO4pD,EAAKzpD,IAAMypD,EAAK3pD,KAAO2pD,EAAKxpD,GASnD,SAASopD,EAAiCI,GACtC,IAAIxqE,EAAQwO,KAAK4O,KAAK5O,KAAK2O,IAAIqtD,EAAKzpD,GAAKypD,EAAK5pD,GAAI,GAAKpS,KAAK2O,IAAIqtD,EAAKxpD,GAAKwpD,EAAK3pD,GAAI,IAC/E4pD,GACKD,EAAK3pD,GAAK2pD,EAAKxpD,IAAMwpD,EAAKvqE,OAAUD,EADzCyqE,GAEKD,EAAKzpD,GAAKypD,EAAK5pD,IAAM4pD,EAAKvqE,OAAUD,EAGzC0qE,EAAK,CAAE3yD,EAAGyyD,EAAK5pD,GAAI5M,EAAGw2D,EAAK3pD,IAC3B8pD,EAAK,CAAE5yD,EAAGyyD,EAAKzpD,GAAI/M,EAAGw2D,EAAKxpD,IAC3B4pD,EAAK,CACL7yD,EAAGyyD,EAAK5pD,GAAK6pD,EACbz2D,EAAGw2D,EAAK3pD,GAAK4pD,GAEbI,EAAK,CACL9yD,EAAGyyD,EAAKzpD,GAAK0pD,EACbz2D,EAAGw2D,EAAKxpD,GAAKypD,GAEbK,EAAKt8D,KAAKsO,IAAI4tD,EAAG3yD,EAAG4yD,EAAG5yD,EAAG6yD,EAAG7yD,EAAG8yD,EAAG9yD,GACnCgzD,EAAKv8D,KAAKuO,IAAI2tD,EAAG3yD,EAAG4yD,EAAG5yD,EAAG6yD,EAAG7yD,EAAG8yD,EAAG9yD,GACnCizD,EAAKx8D,KAAKsO,IAAI4tD,EAAG12D,EAAG22D,EAAG32D,EAAG42D,EAAG52D,EAAG62D,EAAG72D,GAEvC,MAAO,CACH4M,GAAIkqD,EACJjqD,GAAImqD,EACJjqD,GAAIgqD,EACJ/pD,GAAIgqD,EACJ/qE,OANKuO,KAAKuO,IAAI2tD,EAAG12D,EAAG22D,EAAG32D,EAAG42D,EAAG52D,EAAG62D,EAAG72D,GAMtBg3D,GAcrB,SAASb,EAAuBvpD,EAAIC,EAAIhO,EAAGo4D,EAAIC,EAAIC,EAAIC,GACnD,OAAOxqD,EAAKqqD,EAAKE,GAAMvqD,EAAK/N,EAAIo4D,GAAMpqD,EAAKqqD,EAAKE,GAAMvqD,EAAKhO,EAAIq4D,EAGnE,SAAShB,EAA0BtpD,EAAIC,EAAIhO,EAAG/M,EAAGmlE,EAAIC,EAAIC,EAAIC,GACzD,OAAOxqD,EAAKqqD,EAAKE,GAAMvqD,EAAK/N,EAAIo4D,GAAMpqD,EAAKqqD,EAAKE,GAAMvqD,EAAK/a,EAAIolE,EAGnE,SAASG,EAActzD,EAAG/D,EAAGi3D,EAAIC,EAAIC,EAAIC,GACrC,IAAyD/I,EAAOtqD,EAAtDkzD,EAAKE,EAAK,EACpB,OADgDn3D,EAAnBk3D,EAAKE,EAAK,EACzB/I,EA1EH,EACC,EAyEiCA,EAxE/B,EACC,EAcnBhkE,EAAQgsE,mBAAqBA,EAoC7BhsE,EAAQ+rE,iCAAmCA,EAc3C/rE,EAAQ8rE,uBAAyBA,EAIjC9rE,EAAQ6rE,0BAA4BA,EA2IpC,IAAIoB,EAA0B,WAC1B,SAASA,EAAS7wD,GACd,IAAI4qD,OACW,IAAX5qD,IAAqBA,EAAS,IAClCjS,KAAK+iE,aAAclG,EAAK,IAAOmG,MAAiB,GAAInG,GACpD78D,KAAK4/B,MAAQ,KACb5/B,KAAKijE,cAAgB,KAErB,IAAI97C,EAAInhB,KAAK2O,IAAI,EAlOT,GAmOR3U,KAAKmV,KAAO,IAAIjG,cAAwB,EAAIiY,EAAI,GAAK,EApOhD,GAqODlV,EAAOixD,WACPljE,KAAKmjE,OAAOlxD,EAAOixD,YAEnBljE,KAAKmjE,OAAO,CACR5zD,EAAG,EACH/D,EAAG,EACHhU,MAAO,EACPC,OAAQ,IAqDpB,OAlDAqrE,EAASr0D,UAAUvI,IAAM,SAAUyR,EAAKpI,EAAG/D,EAAGwD,GAE1C,OAzHR,SAAoBo0D,EAAUjuD,EAAM4tD,EAAYprD,EAAKpI,EAAG/D,EAAGwD,GAGvD,IAFA,IAAIoJ,EAAK7I,EAAIP,EAAMqJ,EAAK7M,EAAIwD,EAAM3E,EAAW,EAAP2E,EAClC2R,EAAQ,EAAG0iD,EAAQ,IACV,CAET,GAAI1iD,GA5HI,EA+HJ,OAFAoiD,EAAWM,GAASN,EAAWM,IAAU,QACzCN,EAAWM,GAAOrpE,KAAK2d,GAG3B,IAAI2rD,EAAe,EAAID,EAlIlB,EAkIkCE,EAAgB,EAAIF,EAAQ,EAAYG,EAAkB,EAAIH,EAAQ,GAAYI,EAAmB,EAAIJ,EAAQ,GACpJK,EAAuB/B,EAAuBvpD,EAAIC,EAAIhO,EAAG8K,EAAKmuD,EA9H3D,GA8HqFnuD,EAAKmuD,EA7H1F,GA6HoHnuD,EAAKmuD,EA5HrH,GA4HmJnuD,EAAKmuD,EA3HvJ,IA4HRK,EAAwBhC,EAAuBvpD,EAAIC,EAAIhO,EAAG8K,EAAKouD,EA/H5D,GA+HuFpuD,EAAKouD,EA9H5F,GA8HuHpuD,EAAKouD,EA7HxH,GA6HuJpuD,EAAKouD,EA5H3J,IA6HRK,EAA0BjC,EAAuBvpD,EAAIC,EAAIhO,EAAG8K,EAAKquD,EAhI9D,GAgI2FruD,EAAKquD,EA/HhG,GA+H6HruD,EAAKquD,EA9H9H,GA8H+JruD,EAAKquD,EA7HnK,IA8HRK,EAA2BlC,EAAuBvpD,EAAIC,EAAIhO,EAAG8K,EAAKsuD,EAjI/D,GAiI6FtuD,EAAKsuD,EAhIlG,GAgIgItuD,EAAKsuD,EA/HjI,GA+HmKtuD,EAAKsuD,EA9HvK,IA+HRK,EAAa,CACbJ,EACAC,EACAC,EACAC,GACFnqE,QAAO,SAAUC,EAAKC,GACpB,OAAIA,EACOD,EAAM,EAENA,IACZ,GAEH,GAAmB,IAAfmqE,GAA8B,IAAVnjD,EAOpB,OANAoiD,EAAWC,MAAehpE,KAAK2d,SAC1BoqD,GAA2BgB,EAAWC,MAAelpE,QAAU,IAChEioE,GAA0B,EAC1Bx1D,QAAQya,KAAK,4KAMrB,GAAmB,IAAf88C,EACA,MAAM,IAAIxiE,MAAM,mDAAmDvH,OAAO4mB,EAAO,WAAW5mB,OAAO4d,EAAK,SAAS5d,OAAOwV,EAAG,SAASxV,OAAOyR,EAAG,YAAYzR,OAAOiV,EAAM,OAE3K,GAAmB,IAAf80D,EACA,MAAM,IAAIxiE,MAAM,8DAA8DvH,OAAO4mB,EAAO,WAAW5mB,OAAO4d,EAAK,SAAS5d,OAAOwV,EAAG,SAASxV,OAAOyR,EAAG,YAAYzR,OAAOiV,EAAM,OAGtL,GAAI80D,EAAa,EAGb,OAFAf,EAAWM,GAASN,EAAWM,IAAU,QACzCN,EAAWM,GAAOrpE,KAAK2d,GAIvBgJ,IAGA+iD,IACAL,EAAQC,GACRK,IACAN,EAAQE,GACRK,IACAP,EAAQG,GACRK,IACAR,EAAQI,IA4DZM,CA/OQ,EA+Oc/jE,KAAKmV,KAAMnV,KAAK+iE,WAAYprD,EAAKpI,EAAG/D,EAAGwD,GACtDhP,MAEX8iE,EAASr0D,UAAU00D,OAAS,SAAUD,GAClCljE,KAAK2L,QAEL3L,KAAKmV,KAjPE,GAiPe+tD,EAAW3zD,EACjCvP,KAAKmV,KAjPE,GAiPe+tD,EAAW13D,EACjCxL,KAAKmV,KAjPM,GAiPe+tD,EAAW1rE,MACrCwI,KAAKmV,KAjPO,GAiPe+tD,EAAWzrE,OAhK9C,SAAwB2rE,EAAUjuD,GAG9B,IADA,IAAI8zB,EAAQ,CAAC,EAAG,GACTA,EAAMnvC,QAAQ,CACjB,IAAI6mB,EAAQsoB,EAAMlhB,MAAOs7C,EAAQp6B,EAAMlhB,MACnCu7C,EAAe,EAAID,EA9FlB,EA8FkCE,EAAgB,EAAIF,EAAQ,EAAYG,EAAkB,EAAIH,EAAQ,GAAYI,EAAmB,EAAIJ,EAAQ,GACpJ9zD,EAAI4F,EAAKkuD,EA1FN,GA0FyB73D,EAAI2J,EAAKkuD,EAzFlC,GAyF+HW,EAAlE7uD,EAAKkuD,EAxF9D,GAwFwI,EAAG9lE,EAA7C4X,EAAKkuD,EAvFlG,GAuFwJ,EACpKluD,EAAKmuD,EA3FE,GA2FyB/zD,EAChC4F,EAAKmuD,EA3FE,GA2FyB93D,EAChC2J,EAAKmuD,EA3FM,GA2FyBU,EACpC7uD,EAAKmuD,EA3FO,GA2FyB/lE,EACrC4X,EAAKouD,EA/FE,GA+F0Bh0D,EAAIy0D,EACrC7uD,EAAKouD,EA/FE,GA+F0B/3D,EACjC2J,EAAKouD,EA/FM,GA+F0BS,EACrC7uD,EAAKouD,EA/FO,GA+F0BhmE,EACtC4X,EAAKquD,EAnGE,GAmG4Bj0D,EACnC4F,EAAKquD,EAnGE,GAmG4Bh4D,EAAIjO,EACvC4X,EAAKquD,EAnGM,GAmG4BQ,EACvC7uD,EAAKquD,EAnGO,GAmG4BjmE,EACxC4X,EAAKsuD,EAvGE,GAuG6Bl0D,EAAIy0D,EACxC7uD,EAAKsuD,EAvGE,GAuG6Bj4D,EAAIjO,EACxC4X,EAAKsuD,EAvGM,GAuG6BO,EACxC7uD,EAAKsuD,EAvGO,GAuG6BlmE,EACrCojB,EAAQyiD,IACRn6B,EAAMjvC,KAAKypE,EAAkB9iD,EAAQ,GACrCsoB,EAAMjvC,KAAKwpE,EAAiB7iD,EAAQ,GACpCsoB,EAAMjvC,KAAKupE,EAAe5iD,EAAQ,GAClCsoB,EAAMjvC,KAAKspE,EAAc3iD,EAAQ,KAsIrCsjD,CAzPQ,EAyPkBjkE,KAAKmV,OAEnC2tD,EAASr0D,UAAU9C,MAAQ,WACvB,IAAIkxD,EAEJ,OADA78D,KAAK+iE,aAAclG,EAAK,IAAOmG,MAAiB,GAAInG,GAC7C78D,MAEX8iE,EAASr0D,UAAUy1D,MAAQ,SAAU30D,EAAG/D,GACpC,IAAI0E,EAAQlQ,KAAK+iE,WAAWC,MAAexnE,QACvC6nE,EAAQ,EAAG1iD,EAAQ,EACvB,GACQ3gB,KAAK+iE,WAAWM,KAChB,EAAIvB,EAAS7rE,SAASia,EAAOlQ,KAAK+iE,WAAWM,IAEjDA,EAAQ,EAAIA,EAxQX,EAuQUR,EAActzD,EAAG/D,EAAGxL,KAAKmV,KAAKkuD,EAlQtC,GAkQyDrjE,KAAKmV,KAAKkuD,EAjQnE,GAiQsFrjE,KAAKmV,KAAKkuD,EAhQ5F,GAgQmHrjE,KAAKmV,KAAKkuD,EA/P5H,IAiQR1iD,UACKA,GAzQD,GA0QR,OAAOzQ,GAEX4yD,EAASr0D,UAAU01D,UAAY,SAAU/rD,EAAIC,EAAIE,EAAIC,EAAI/gB,GACrD,IAAI2sE,EAAKpkE,KAAKijE,cACd,OAAImB,GAAMhsD,IAAOgsD,EAAGhsD,IAAMG,IAAO6rD,EAAG7rD,IAAMF,IAAO+rD,EAAG/rD,IAAMG,IAAO4rD,EAAG5rD,IAAM/gB,IAAW2sE,EAAG3sE,SAGxFuI,KAAKijE,cAAgB,CACjB7qD,GAAIA,EACJC,GAAIA,EACJE,GAAIA,EACJC,GAAIA,EACJ/gB,OAAQA,GAGPoqE,EAAmB7hE,KAAKijE,iBACzBjjE,KAAKijE,cAAgBrB,EAAiC5hE,KAAKijE,gBAC/DjjE,KAAK4/B,MArGb,SAA4CwjC,EAAUjuD,EAAM4tD,EAAY3qD,EAAIC,EAAIhO,EAAG/M,GAK/E,IAHA,IAEIsM,EAFAq/B,EAAQ,CAAC,EAAG,GACZo7B,EAAiB,GAEdp7B,EAAMnvC,QAAQ,CACjB,IAAI6mB,EAAQsoB,EAAMlhB,MAAOs7C,EAAQp6B,EAAMlhB,MAMvC,IAJAne,EAAYm5D,EAAWM,MAEnB,EAAIvB,EAAS7rE,SAASouE,EAAgBz6D,KAEtC+W,GAlMI,GAkMR,CAEA,IAAI2iD,EAAe,EAAID,EArMlB,EAqMkCE,EAAgB,EAAIF,EAAQ,EAAYG,EAAkB,EAAIH,EAAQ,GAAYI,EAAmB,EAAIJ,EAAQ,GACpJK,EAAuBhC,EAA0BtpD,EAAIC,EAAIhO,EAAG/M,EAAG6X,EAAKmuD,EAjMjE,GAiM2FnuD,EAAKmuD,EAhMhG,GAgM0HnuD,EAAKmuD,EA/L3H,GA+LyJnuD,EAAKmuD,EA9L7J,IA+LRK,EAAwBjC,EAA0BtpD,EAAIC,EAAIhO,EAAG/M,EAAG6X,EAAKouD,EAlMlE,GAkM6FpuD,EAAKouD,EAjMlG,GAiM6HpuD,EAAKouD,EAhM9H,GAgM6JpuD,EAAKouD,EA/LjK,IAgMRK,EAA0BlC,EAA0BtpD,EAAIC,EAAIhO,EAAG/M,EAAG6X,EAAKquD,EAnMpE,GAmMiGruD,EAAKquD,EAlMtG,GAkMmIruD,EAAKquD,EAjMpI,GAiMqKruD,EAAKquD,EAhMzK,IAiMRK,EAA2BnC,EAA0BtpD,EAAIC,EAAIhO,EAAG/M,EAAG6X,EAAKsuD,EApMrE,GAoMmGtuD,EAAKsuD,EAnMxG,GAmMsItuD,EAAKsuD,EAlMvI,GAkMyKtuD,EAAKsuD,EAjM7K,IAkMRC,GACAz6B,EAAMjvC,KAAKspE,EAAc3iD,EAAQ,GACjCgjD,GACA16B,EAAMjvC,KAAKupE,EAAe5iD,EAAQ,GAClCijD,GACA36B,EAAMjvC,KAAKwpE,EAAiB7iD,EAAQ,GACpCkjD,GACA56B,EAAMjvC,KAAKypE,EAAkB9iD,EAAQ,IAE7C,OAAO0jD,EAyEUC,CA3RL,EA2RmDtkE,KAAKmV,KAAMnV,KAAK+iE,WAAY3qD,EAAIC,EAAIrS,KAAKC,IAAImS,EAAKG,IAAOvS,KAAKC,IAAIoS,EAAKG,GAAK/gB,IAEvI,EAAIqqE,EAAS7rE,SAAS+J,KAAK4/B,MAAO5/B,KAAK+iE,WAAWC,QAdvChjE,KAAK4/B,OAiBbkjC,EAtEkB,GAwE7BjtE,EAAA,QAAkBitE,sCCtUlB,IAAInM,EAAmB32D,MAAQA,KAAK22D,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExD7sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQ0uE,MAAQ1uE,EAAQolE,YAAcplE,EAAQitE,SAAWjtE,EAAQshE,YAAS,EAQ1E,IAAIqN,EAAU7N,EAAgB,EAAQ,QACtC9gE,EAAQ0uE,MAAQC,EAAQvuE,QACxB,IAAIwuE,EAAW9N,EAAgB,EAAQ,QACvC9gE,EAAQshE,OAASsN,EAASxuE,QAC1B,IAAIyuE,EAAa/N,EAAgB,EAAQ,QACzC9gE,EAAQitE,SAAW4B,EAAWzuE,QAC9B,IAAI0uE,EAAUhO,EAAgB,EAAQ,QACtC9gE,EAAQolE,YAAc0J,EAAQ1uE,QAC9BJ,EAAA,QAAkB2uE,EAAQvuE,oCCpB1B8T,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IAkEtD5K,EAAA,QAjEA,SAAuB6xB,EAASk9C,EAAUC,EAAYC,EAAY53D,GAC9D,IAAI8B,EAAO9B,EAAS63D,cAAeC,EAAO93D,EAAS+3D,cAAeh1D,EAAS/C,EAASg4D,gBAAiBhuE,EAAQgW,EAASi4D,eAAeC,UAC/HR,EAAS13D,EAASi4D,eAAeC,YAAcl4D,EAASi4D,eAAejuE,OAAS,OAChFgW,EAASi4D,eAAejuE,MAC1BmuE,EAAQT,EAASS,MACrB,GAAKA,EAAL,CAEA39C,EAAQ49C,UAAYpuE,EACpBwwB,EAAQs9C,KAAO,GAAGjrE,OAAOkW,EAAQ,KAAKlW,OAAOiV,EAAM,OAAOjV,OAAOirE,GAEjE,IAMIO,EACAC,EAPAC,EAAQZ,EAAW71D,KACnB02D,EAAQZ,EAAW91D,KACnB22D,EAAKd,EAAWt1D,EAChBq2D,EAAKf,EAAWr5D,EAChBq6D,EAAKf,EAAWv1D,EAChBu2D,EAAKhB,EAAWt5D,EAGhBgJ,EAAKqxD,EAAKF,EACVlxD,EAAKqxD,EAAKF,EACVzvE,EAAI6P,KAAK4O,KAAKJ,EAAKA,EAAKC,EAAKA,GACjC,KAAIte,EAAIsvE,EAAQC,GAAhB,CAOAH,IAJAI,GAAOnxD,EAAKixD,EAAStvE,IAErB0vE,GAAOrxD,EAAKkxD,EAASvvE,IAEJ,EACjBqvE,IAJAI,GAAOnxD,EAAKgxD,EAAStvE,IAErB2vE,GAAOrxD,EAAKixD,EAASvvE,IAEJ,EACjBqe,EAAKqxD,EAAKF,EACVlxD,EAAKqxD,EAAKF,EACVzvE,EAAI6P,KAAK4O,KAAKJ,EAAKA,EAAKC,EAAKA,GAE7B,IAYIkI,EAZAopD,EAAar+C,EAAQs+C,YAAYX,GAAO7tE,MAC5C,GAAIuuE,EAAa5vE,EAAG,CAIhB,IAFAkvE,GADe,IAEfU,EAAar+C,EAAQs+C,YAAYX,GAAO7tE,MACjCuuE,EAAa5vE,GAAKkvE,EAAMvrE,OAAS,GACpCurE,EAAQA,EAAM7pE,MAAM,GAAI,GAJb,IAKXuqE,EAAar+C,EAAQs+C,YAAYX,GAAO7tE,MAE5C,GAAI6tE,EAAMvrE,OAAS,EACf,OAKA6iB,EAFJnI,EAAK,EACDC,EAAK,EACGzO,KAAKigE,KAAKzxD,EAAKre,GAEf6P,KAAKkgE,KAAKzxD,EAAKte,GAGvBse,EAAK,EACGzO,KAAKigE,KAAKzxD,EAAKre,GAAK6P,KAAK8V,GAEzB9V,KAAKkgE,KAAK1xD,EAAKre,GAAK6P,KAAK8V,GAAK,EAE9C4L,EAAQy+C,OACRz+C,EAAQ0+C,UAAUb,EAAIC,GACtB99C,EAAQ2+C,OAAO1pD,GACf+K,EAAQ4+C,SAASjB,GAAQU,EAAa,EAAGnB,EAAS51D,KAAO,EAAIA,GAC7D0Y,EAAQ6+C,iDChEZ,IAAI5P,EAAmB32D,MAAQA,KAAK22D,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExD7sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD,IAAI+lE,EAAU7P,EAAgB,EAAQ,QA0CtC9gE,EAAA,QAnCA,SAAmB6xB,EAASvS,EAAMjI,GAC9B,IAAI8B,EAAO9B,EAASu5D,UAAWzB,EAAO93D,EAASw5D,UAAWz2D,EAAS/C,EAASy5D,YAS5E,GARAj/C,EAAQs9C,KAAO,GAAGjrE,OAAOkW,EAAQ,KAAKlW,OAAOiV,EAAM,OAAOjV,OAAOirE,GAEjEt9C,EAAQ49C,UAAY,OACpB59C,EAAQk/C,cAAgB,EACxBl/C,EAAQm/C,cAAgB,EACxBn/C,EAAQo/C,WAAa,EACrBp/C,EAAQq/C,YAAc,OAEI,iBAAf5xD,EAAKkwD,MAAoB,CAChC,IAAI2B,EAAYt/C,EAAQs+C,YAAY7wD,EAAKkwD,OAAO7tE,MAAOyvE,EAAWjhE,KAAK2/C,MAAMqhB,EAAY,GAAIE,EAAYlhE,KAAK2/C,MAAM32C,EAAO,GAAcm4D,EAASnhE,KAAKuO,IAAIY,EAAKnG,KAAMA,EAAO,GAFnK,EAGNo4D,EAAcphE,KAAKkgE,KAAKgB,EAAY,EAAIC,GACxCE,EAAcrhE,KAAK4O,KAAK5O,KAAKC,IAAID,KAAK2O,IAAIwyD,EAAQ,GAAKnhE,KAAK2O,IAAIuyD,EAAY,EAAG,KACnFx/C,EAAQ4/C,YACR5/C,EAAQ6/C,OAAOpyD,EAAK5F,EAAI83D,EAAalyD,EAAK3J,EAAI07D,EAAY,GAC1Dx/C,EAAQ8/C,OAAOryD,EAAK5F,EAAI43D,EAASF,EAAU9xD,EAAK3J,EAAI07D,EAAY,GAChEx/C,EAAQ8/C,OAAOryD,EAAK5F,EAAI43D,EAASF,EAAU9xD,EAAK3J,EAAI07D,EAAY,GAChEx/C,EAAQ8/C,OAAOryD,EAAK5F,EAAI83D,EAAalyD,EAAK3J,EAAI07D,EAAY,GAC1Dx/C,EAAQ+/C,IAAItyD,EAAK5F,EAAG4F,EAAK3J,EAAG27D,EAAQC,GAAcA,GAClD1/C,EAAQggD,YACRhgD,EAAQk/B,YAGRl/B,EAAQ4/C,YACR5/C,EAAQ+/C,IAAItyD,EAAK5F,EAAG4F,EAAK3J,EAAG2J,EAAKnG,KAhBvB,EAgBuC,EAAa,EAAVhJ,KAAK8V,IACzD4L,EAAQggD,YACRhgD,EAAQk/B,OAEZl/B,EAAQk/C,cAAgB,EACxBl/C,EAAQm/C,cAAgB,EACxBn/C,EAAQo/C,WAAa,GAErB,EAAIN,EAAQvwE,SAASyxB,EAASvS,EAAMjI,gCC5CxCnD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IAWtD5K,EAAA,QAVA,SAAmB6xB,EAASvS,EAAMjI,GAC9B,GAAKiI,EAAKkwD,MAAV,CAEA,IAAIr2D,EAAO9B,EAASu5D,UAAWzB,EAAO93D,EAASw5D,UAAWz2D,EAAS/C,EAASy5D,YAAazvE,EAAQgW,EAASy6D,WAAWvC,UAC/GjwD,EAAKjI,EAASy6D,WAAWvC,YAAcl4D,EAASy6D,WAAWzwE,OAAS,OACpEgW,EAASy6D,WAAWzwE,MAC1BwwB,EAAQ49C,UAAYpuE,EACpBwwB,EAAQs9C,KAAO,GAAGjrE,OAAOkW,EAAQ,KAAKlW,OAAOiV,EAAM,OAAOjV,OAAOirE,GACjEt9C,EAAQ4+C,SAASnxD,EAAKkwD,MAAOlwD,EAAK5F,EAAI4F,EAAKnG,KAAO,EAAGmG,EAAK3J,EAAIwD,EAAO,yCCTzE,IACQwnD,EADJC,EAAaz2D,MAAQA,KAAKy2D,YACtBD,EAAgB,SAAUrgE,EAAGwT,GAI7B,OAHA6sD,EAAgBzsD,OAAOya,gBAClB,CAAEE,UAAW,cAAgBlW,OAAS,SAAUrY,EAAGwT,GAAKxT,EAAEuuB,UAAY/a,IACvE,SAAUxT,EAAGwT,GAAK,IAAK,IAAIF,KAAKE,EAAOI,OAAO0E,UAAU+M,eAAe9M,KAAK/E,EAAGF,KAAItT,EAAEsT,GAAKE,EAAEF,KACzF+sD,EAAcrgE,EAAGwT,IAErB,SAAUxT,EAAGwT,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIyb,UAAU,uBAAyB0B,OAAOnd,GAAK,iCAE7D,SAAS+sD,IAAO12D,KAAKJ,YAAczJ,EADnCqgE,EAAcrgE,EAAGwT,GAEjBxT,EAAEsY,UAAkB,OAAN9E,EAAaI,OAAOwa,OAAO5a,IAAM+sD,EAAGjoD,UAAY9E,EAAE8E,UAAW,IAAIioD,KAGvF3sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQ+xE,0BAA4B/xE,EAAQgyE,yBAAsB,EAOlE,IAMIA,EAAqC,SAAUzQ,GAE/C,SAASyQ,EAAoBC,EAAIC,EAAoBC,EAAsBC,EAAQrxD,GAC/E,OAAOwgD,EAAO1oD,KAAK1O,KAAM8nE,EAAIC,EAAoBC,EAAsBC,EAAQrxD,IAAe5W,KAElG,OAJAy2D,EAAUoR,EAAqBzQ,GAIxByQ,EAL6B,CANxB,EAAQ,OAYZK,iBACZryE,EAAQgyE,oBAAsBA,EA+B9BhyE,EAAQ+xE,0BA9BR,SAAmCO,GAC/B,OAAsB,WAClB,SAASC,EAAoBN,EAAInN,GAC7B36D,KAAKqoE,SAAWF,EAAe5sE,KAAI,SAAU+sE,GAAgB,OAAO,IAAIA,EAAaR,EAAInN,MAwB7F,OAtBAyN,EAAoB35D,UAAU85D,WAAa,WACvCvoE,KAAKqoE,SAASp+D,SAAQ,SAAUu+D,GAAW,OAAOA,EAAQD,iBAE9DH,EAAoB35D,UAAUg6D,SAAW,SAAUC,GAC/C1oE,KAAKqoE,SAASp+D,SAAQ,SAAUu+D,GAAW,OAAOA,EAAQC,SAASC,OAEvEN,EAAoB35D,UAAU8D,KAAO,aAGrC61D,EAAoB35D,UAAUk6D,eAAiB,WAC3C3oE,KAAKqoE,SAASp+D,SAAQ,SAAUu+D,GAAW,OAAOA,EAAQG,qBAE9DP,EAAoB35D,UAAUm6D,OAAS,SAAU32D,GAC7CjS,KAAKqoE,SAASp+D,SAAQ,SAAUu+D,GAC5BA,EAAQj2D,OACRi2D,EAAQD,aACRC,EAAQI,OAAO32D,OAGvBm2D,EAAoB35D,UAAU0tB,QAAU,SAAU0oC,EAAYC,EAAY3vD,EAAM0zD,EAAQ9sD,GACpF/b,KAAKqoE,SAASp+D,SAAQ,SAAUu+D,GAAW,OAAOA,EAAQrsC,QAAQ0oC,EAAYC,EAAY3vD,EAAM0zD,EAAQ9sD,OAErGqsD,EA1BU,wCCtCzB,IACQ5R,EADJC,EAAaz2D,MAAQA,KAAKy2D,YACtBD,EAAgB,SAAUrgE,EAAGwT,GAI7B,OAHA6sD,EAAgBzsD,OAAOya,gBAClB,CAAEE,UAAW,cAAgBlW,OAAS,SAAUrY,EAAGwT,GAAKxT,EAAEuuB,UAAY/a,IACvE,SAAUxT,EAAGwT,GAAK,IAAK,IAAIF,KAAKE,EAAOI,OAAO0E,UAAU+M,eAAe9M,KAAK/E,EAAGF,KAAItT,EAAEsT,GAAKE,EAAEF,KACzF+sD,EAAcrgE,EAAGwT,IAErB,SAAUxT,EAAGwT,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIyb,UAAU,uBAAyB0B,OAAOnd,GAAK,iCAE7D,SAAS+sD,IAAO12D,KAAKJ,YAAczJ,EADnCqgE,EAAcrgE,EAAGwT,GAEjBxT,EAAEsY,UAAkB,OAAN9E,EAAaI,OAAOwa,OAAO5a,IAAM+sD,EAAGjoD,UAAY9E,EAAE8E,UAAW,IAAIioD,KAGvF3sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQizE,0BAA4BjzE,EAAQkzE,yBAAsB,EAOlE,IAMIA,EAAqC,SAAU3R,GAE/C,SAAS2R,EAAoBjB,EAAIC,EAAoBC,EAAsBC,EAAQrxD,GAC/E,IAAIygD,EAAQD,EAAO1oD,KAAK1O,KAAM8nE,EAAIC,EAAoBC,EAAsBC,EAAQrxD,IAAe5W,KAEnGq3D,EAAM2R,iBAAmBlB,EAAGmB,kBAAkB5R,EAAMmR,QAAS,cAC7DnR,EAAM6R,aAAepB,EAAGmB,kBAAkB5R,EAAMmR,QAAS,UACzDnR,EAAM8R,cAAgBrB,EAAGmB,kBAAkB5R,EAAMmR,QAAS,WAE1D,IAAIY,EAAiBtB,EAAGuB,mBAAmBhS,EAAMmR,QAAS,YAC1D,GAAuB,OAAnBY,EACA,MAAM,IAAI9nE,MAAM,2DACpB+1D,EAAM+R,eAAiBA,EACvB,IAAIE,EAAgBxB,EAAGuB,mBAAmBhS,EAAMmR,QAAS,WACzD,GAAsB,OAAlBc,EACA,MAAM,IAAIhoE,MAAM,0DACpB+1D,EAAMiS,cAAgBA,EACtB,IAAIC,EAAgBzB,EAAGuB,mBAAmBhS,EAAMmR,QAAS,WACzD,GAAsB,OAAlBe,EACA,MAAM,IAAIjoE,MAAM,0DAEpB,OADA+1D,EAAMkS,cAAgBA,EACflS,EAWX,OA/BAZ,EAAUsS,EAAqB3R,GAsB/B2R,EAAoBt6D,UAAU8D,KAAO,WACjC,IAAIu1D,EAAK9nE,KAAK8nE,GACdA,EAAG0B,wBAAwBxpE,KAAKgpE,kBAChClB,EAAG0B,wBAAwBxpE,KAAKkpE,cAChCpB,EAAG0B,wBAAwBxpE,KAAKmpE,eAChCrB,EAAG2B,oBAAoBzpE,KAAKgpE,iBAAkB,EAAGlB,EAAG4B,OAAO,EAAO1pE,KAAK4W,WAAa1H,aAAay6D,kBAAmB,GACpH7B,EAAG2B,oBAAoBzpE,KAAKkpE,aAAc,EAAGpB,EAAG4B,OAAO,EAAO1pE,KAAK4W,WAAa1H,aAAay6D,kBAAmB,GAChH7B,EAAG2B,oBAAoBzpE,KAAKmpE,cAAe,EAAGrB,EAAG8B,eAAe,EAAM5pE,KAAK4W,WAAa1H,aAAay6D,kBAAmB,KAErHZ,EAhC6B,CANxB,EAAQ,OAuCZb,iBACZryE,EAAQkzE,oBAAsBA,EAoC9BlzE,EAAQizE,0BA3BR,SAAmCX,GAC/B,OAAsB,WAClB,SAAS0B,EAAoB/B,EAAInN,GAC7B36D,KAAKqoE,SAAWF,EAAe5sE,KAAI,SAAU+sE,GAAgB,OAAO,IAAIA,EAAaR,EAAInN,MAqB7F,OAnBAkP,EAAoBp7D,UAAU85D,WAAa,WACvCvoE,KAAKqoE,SAASp+D,SAAQ,SAAUu+D,GAAW,OAAOA,EAAQD,iBAE9DsB,EAAoBp7D,UAAUg6D,SAAW,SAAUC,GAC/C1oE,KAAKqoE,SAASp+D,SAAQ,SAAUu+D,GAAW,OAAOA,EAAQC,SAASC,OAEvEmB,EAAoBp7D,UAAU8D,KAAO,aAGrCs3D,EAAoBp7D,UAAUm6D,OAAS,SAAU32D,GAC7CjS,KAAKqoE,SAASp+D,SAAQ,SAAUu+D,GAC5BA,EAAQj2D,OACRi2D,EAAQD,aACRC,EAAQI,OAAO32D,OAGvB43D,EAAoBp7D,UAAU0tB,QAAU,SAAUhnB,EAAM0zD,EAAQ9sD,GAC5D/b,KAAKqoE,SAASp+D,SAAQ,SAAUu+D,GAAW,OAAOA,EAAQrsC,QAAQhnB,EAAM0zD,EAAQ9sD,OAE7E8tD,EAvBU,kCCzEzB9/D,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQqyE,qBAAkB,EAQ1B,IAAIlR,EAAU,EAAQ,OAMlBkR,EAAiC,WACjC,SAASA,EAAgBJ,EAAIC,EAAoBC,EAAsBC,EAAQrxD,GAC3E5W,KAAKwN,MAAQ,IAAI0B,aACjBlP,KAAKioE,OAASA,EACdjoE,KAAK4W,WAAaA,EAClB5W,KAAK8nE,GAAKA,EACV9nE,KAAK+nE,mBAAqBA,EAC1B/nE,KAAKgoE,qBAAuBA,EAC5B,IAAI3yD,EAASyyD,EAAGgC,eAChB,GAAe,OAAXz0D,EACA,MAAM,IAAI/T,MAAM,oDACpBtB,KAAKqV,OAASA,EACdyyD,EAAGiC,WAAWjC,EAAGkC,aAAchqE,KAAKqV,QACpCrV,KAAKiqE,cAAe,EAAIjT,EAAQkT,kBAAkBpC,EAAI9nE,KAAK+nE,oBAC3D/nE,KAAKmqE,gBAAiB,EAAInT,EAAQoT,oBAAoBtC,EAAI9nE,KAAKgoE,sBAC/DhoE,KAAKwoE,SAAU,EAAIxR,EAAQqT,aAAavC,EAAI,CAAC9nE,KAAKiqE,aAAcjqE,KAAKmqE,iBAYzE,OAVAjC,EAAgBz5D,UAAU85D,WAAa,WACnC,IAAIT,EAAK9nE,KAAK8nE,GACdA,EAAGS,WAAWT,EAAGkC,aAAchqE,KAAKwN,MAAOs6D,EAAGwC,eAElDpC,EAAgBz5D,UAAUg6D,SAAW,SAAUC,GAC3C1oE,KAAKwN,MAAQ,IAAI0B,aAAalP,KAAKioE,OAASjoE,KAAK4W,WAAa8xD,IAElER,EAAgBz5D,UAAU87D,mBAAqB,WAC3C,OAA6B,IAAtBvqE,KAAKwN,MAAM1T,QAEfouE,EA3ByB,GA6BpCryE,EAAQqyE,gBAAkBA,sCC5C1B,IAAIvR,EAAmB32D,MAAQA,KAAK22D,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExD7sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IAQtD,IAAI+pE,EAAS,EAAQ,OACjBC,EAAmB9T,EAAgB,EAAQ,QAC3C+T,EAAiB/T,EAAgB,EAAQ,QACzCgU,GAAmB,EAAIH,EAAO5C,2BAA2B,CAAC8C,EAAez0E,QAASw0E,EAAiBx0E,UACvGJ,EAAA,QAAkB80E,sCCflB,IACQnU,EADJC,EAAaz2D,MAAQA,KAAKy2D,YACtBD,EAAgB,SAAUrgE,EAAGwT,GAI7B,OAHA6sD,EAAgBzsD,OAAOya,gBAClB,CAAEE,UAAW,cAAgBlW,OAAS,SAAUrY,EAAGwT,GAAKxT,EAAEuuB,UAAY/a,IACvE,SAAUxT,EAAGwT,GAAK,IAAK,IAAIF,KAAKE,EAAOI,OAAO0E,UAAU+M,eAAe9M,KAAK/E,EAAGF,KAAItT,EAAEsT,GAAKE,EAAEF,KACzF+sD,EAAcrgE,EAAGwT,IAErB,SAAUxT,EAAGwT,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIyb,UAAU,uBAAyB0B,OAAOnd,GAAK,iCAE7D,SAAS+sD,IAAO12D,KAAKJ,YAAczJ,EADnCqgE,EAAcrgE,EAAGwT,GAEjBxT,EAAEsY,UAAkB,OAAN9E,EAAaI,OAAOwa,OAAO5a,IAAM+sD,EAAGjoD,UAAY9E,EAAE8E,UAAW,IAAIioD,KAGnFC,EAAmB32D,MAAQA,KAAK22D,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExD7sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD,IAAIu2D,EAAU,EAAQ,OAClB4T,EAA6BjU,EAAgB,EAAQ,QACrDkU,EAA6BlU,EAAgB,EAAQ,QAGrDmU,EAAsC,SAAU1T,GAEhD,SAAS0T,EAAqBhD,GAC1B,IAAIzQ,EAAQD,EAAO1oD,KAAK1O,KAAM8nE,EAAI8C,EAA2B30E,QAAS40E,EAA2B50E,QAJ5F,EAAgB,IAI4G+J,KAEjIq3D,EAAM2R,iBAAmBlB,EAAGmB,kBAAkB5R,EAAMmR,QAAS,cAC7DnR,EAAM8R,cAAgBrB,EAAGmB,kBAAkB5R,EAAMmR,QAAS,WAC1DnR,EAAM0T,eAAiBjD,EAAGmB,kBAAkB5R,EAAMmR,QAAS,YAC3DnR,EAAM2T,eAAiBlD,EAAGmB,kBAAkB5R,EAAMmR,QAAS,YAC3DnR,EAAM4T,oBAAsBnD,EAAGmB,kBAAkB5R,EAAMmR,QAAS,iBAEhE,IAAIY,EAAiBtB,EAAGuB,mBAAmBhS,EAAMmR,QAAS,YAC1D,GAAuB,OAAnBY,EACA,MAAM,IAAI9nE,MAAM,4DACpB+1D,EAAM+R,eAAiBA,EACvB,IAAI8B,EAAwBpD,EAAGuB,mBAAmBhS,EAAMmR,QAAS,mBACjE,GAA8B,OAA1B0C,EACA,MAAM,IAAI5pE,MAAM,mEACpB+1D,EAAM6T,sBAAwBA,EAC9B,IAAIC,EAA0BrD,EAAGuB,mBAAmBhS,EAAMmR,QAAS,qBACnE,GAAgC,OAA5B2C,EACA,MAAM,IAAI7pE,MAAM,qEAGpB,OAFA+1D,EAAM8T,wBAA0BA,EAChC9T,EAAM9kD,OACC8kD,EAiFX,OAxGAZ,EAAUqU,EAAsB1T,GAyBhC0T,EAAqBr8D,UAAU8D,KAAO,WAClC,IAAIu1D,EAAK9nE,KAAK8nE,GAEdA,EAAG0B,wBAAwBxpE,KAAKgpE,kBAChClB,EAAG0B,wBAAwBxpE,KAAK+qE,gBAChCjD,EAAG0B,wBAAwBxpE,KAAKgrE,gBAChClD,EAAG0B,wBAAwBxpE,KAAKmpE,eAChCrB,EAAG0B,wBAAwBxpE,KAAKirE,qBAChCnD,EAAG2B,oBAAoBzpE,KAAKgpE,iBAAkB,EAAGlB,EAAG4B,OAAO,EAnCtC,EAmC0Dx6D,aAAay6D,kBAAmB,GAC/G7B,EAAG2B,oBAAoBzpE,KAAK+qE,eAAgB,EAAGjD,EAAG4B,OAAO,EApCpC,EAoCwDx6D,aAAay6D,kBAAmB,GAC7G7B,EAAG2B,oBAAoBzpE,KAAKgrE,eAAgB,EAAGlD,EAAG4B,OAAO,EArCpC,EAqCwDx6D,aAAay6D,kBAAmB,IAC7G7B,EAAG2B,oBAAoBzpE,KAAKmpE,cAAe,EAAGrB,EAAG8B,eAAe,EAtC3C,EAsC8D16D,aAAay6D,kBAAmB,IAEnH7B,EAAG2B,oBAAoBzpE,KAAKirE,oBAAqB,EAAGnD,EAAG4B,OAAO,EAxCzC,EAwC6Dx6D,aAAay6D,kBAAmB,KAEtHmB,EAAqBr8D,UAAUk6D,eAAiB,aAGhDmC,EAAqBr8D,UAAU0tB,QAAU,SAAU0oC,EAAYC,EAAY3vD,EAAM0zD,EAAQ9sD,GACrF,GAAI8sD,EACA,IAAK,IAAIuC,EA/CoBC,GA+CdtvD,EAAiBpR,EAAIygE,EA/CPC,GA+CqBD,EAAMzgE,EAAGygE,IACvDprE,KAAKwN,MAAM49D,GAAO,MAF1B,CAKA,IAAIE,EAAYn2D,EAAKnG,MAAQ,EAAGm4D,EAASrC,EAAW91D,MAAQ,EAAGoJ,EAAKysD,EAAWt1D,EAAG8I,EAAKwsD,EAAWr5D,EAAG+M,EAAKusD,EAAWv1D,EAAGiJ,EAAKssD,EAAWt5D,EAAGtU,GAAQ,EAAI8/D,EAAQuU,YAAYp2D,EAAKje,OAE5Ksd,EAAK+D,EAAKH,EAAI3D,EAAK+D,EAAKH,EACxBmzD,EAAMh3D,EAAKA,EAAKC,EAAKA,EAAI9B,EAAK,EAAGC,EAAK,EACtC44D,IAEA74D,GAAM8B,GADN+2D,EAAM,EAAIxlE,KAAK4O,KAAK42D,IACHF,EACjB14D,EAAK4B,EAAKg3D,EAAMF,GAEpB,IAAIj/D,EAAIg/D,GAAsBtvD,EAC1BvO,EAAQxN,KAAKwN,MAEjBA,EAAMnB,KAAOkM,EACb/K,EAAMnB,KAAOmM,EACbhL,EAAMnB,MAAQsG,EACdnF,EAAMnB,MAAQuG,EACdpF,EAAMnB,KAAO86D,EACb35D,EAAMnB,KAAOnV,EACbsW,EAAMnB,KAAO,EACbmB,EAAMnB,KAAO,EACbmB,EAAMnB,KAAO,EAEbmB,EAAMnB,KAAOkM,EACb/K,EAAMnB,KAAOmM,EACbhL,EAAMnB,MAAQsG,EACdnF,EAAMnB,MAAQuG,EACdpF,EAAMnB,KAAO86D,EACb35D,EAAMnB,KAAOnV,EACbsW,EAAMnB,KAAO,EACbmB,EAAMnB,KAAO,EACbmB,EAAMnB,KAAO,EAEbmB,EAAMnB,KAAOkM,EACb/K,EAAMnB,KAAOmM,EACbhL,EAAMnB,MAAQsG,EACdnF,EAAMnB,MAAQuG,EACdpF,EAAMnB,KAAO86D,EACb35D,EAAMnB,KAAOnV,EACbsW,EAAMnB,KAAO,EACbmB,EAAMnB,KAAO,EACbmB,EAAMnB,GAAK,IAEfy+D,EAAqBr8D,UAAUm6D,OAAS,SAAU32D,GAC9C,IAAIjS,KAAKuqE,qBAAT,CAEA,IAAIzC,EAAK9nE,KAAK8nE,GACVU,EAAUxoE,KAAKwoE,QACnBV,EAAG2D,WAAWjD,GAEdV,EAAG4D,iBAAiB1rE,KAAKopE,gBAAgB,EAAOn3D,EAAOiE,QACvD4xD,EAAG6D,UAAU3rE,KAAKkrE,sBAAuBllE,KAAK4O,KAAK3C,EAAOqlD,QAC1DwQ,EAAG6D,UAAU3rE,KAAKmrE,wBAAyBl5D,EAAO25D,iBAElD9D,EAAG+D,WAAW/D,EAAGgE,UAAW,EAAG9rE,KAAKwN,MAAM1T,OAxGrB,KA0GlBgxE,EAzG8B,CAF5B,EAAQ,OA4GZjD,qBACThyE,EAAA,QAAkBi1E,sCCnIlB,IACQtU,EADJC,EAAaz2D,MAAQA,KAAKy2D,YACtBD,EAAgB,SAAUrgE,EAAGwT,GAI7B,OAHA6sD,EAAgBzsD,OAAOya,gBAClB,CAAEE,UAAW,cAAgBlW,OAAS,SAAUrY,EAAGwT,GAAKxT,EAAEuuB,UAAY/a,IACvE,SAAUxT,EAAGwT,GAAK,IAAK,IAAIF,KAAKE,EAAOI,OAAO0E,UAAU+M,eAAe9M,KAAK/E,EAAGF,KAAItT,EAAEsT,GAAKE,EAAEF,KACzF+sD,EAAcrgE,EAAGwT,IAErB,SAAUxT,EAAGwT,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIyb,UAAU,uBAAyB0B,OAAOnd,GAAK,iCAE7D,SAAS+sD,IAAO12D,KAAKJ,YAAczJ,EADnCqgE,EAAcrgE,EAAGwT,GAEjBxT,EAAEsY,UAAkB,OAAN9E,EAAaI,OAAOwa,OAAO5a,IAAM+sD,EAAGjoD,UAAY9E,EAAE8E,UAAW,IAAIioD,KAGnFC,EAAmB32D,MAAQA,KAAK22D,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExD7sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD,IAAI+pE,EAAS,EAAQ,OACjBxT,EAAU,EAAQ,OAClB+U,EAA2BpV,EAAgB,EAAQ,QACnDqV,EAAmBrV,EAAgB,EAAQ,QAE3CsV,EAAoC,SAAU7U,GAE9C,SAAS6U,EAAmBnE,GACxB,IAAIzQ,EAAQD,EAAO1oD,KAAK1O,KAAM8nE,EAAIiE,EAAyB91E,QAAS+1E,EAAiB/1E,QAJhF,EAAgB,IAIgG+J,KAEjHksE,EAAgBpE,EAAGgC,eACvB,GAAsB,OAAlBoC,EACA,MAAM,IAAI5qE,MAAM,8DACpB+1D,EAAM6U,cAAgBA,EAEtB7U,EAAM2R,iBAAmBlB,EAAGmB,kBAAkB5R,EAAMmR,QAAS,cAC7DnR,EAAM8R,cAAgBrB,EAAGmB,kBAAkB5R,EAAMmR,QAAS,WAC1DnR,EAAM0T,eAAiBjD,EAAGmB,kBAAkB5R,EAAMmR,QAAS,YAC3DnR,EAAM2T,eAAiBlD,EAAGmB,kBAAkB5R,EAAMmR,QAAS,YAE3D,IAAIY,EAAiBtB,EAAGuB,mBAAmBhS,EAAMmR,QAAS,YAC1D,GAAuB,OAAnBY,EACA,MAAM,IAAI9nE,MAAM,0DACpB+1D,EAAM+R,eAAiBA,EACvB,IAAI8B,EAAwBpD,EAAGuB,mBAAmBhS,EAAMmR,QAAS,mBACjE,GAA8B,OAA1B0C,EACA,MAAM,IAAI5pE,MAAM,+DACpB+1D,EAAM6T,sBAAwBA,EAC9B,IAAIC,EAA0BrD,EAAGuB,mBAAmBhS,EAAMmR,QAAS,qBACnE,GAAgC,OAA5B2C,EACA,MAAM,IAAI7pE,MAAM,iEAapB,OAZA+1D,EAAM8T,wBAA0BA,EAOhC9T,EAAM8U,qBAAsB,EAAInV,EAAQmV,qBAAqBrE,GAC7DzQ,EAAM+U,aAAe/U,EAAM8U,oBAAsBjY,YAAcD,YAC/DoD,EAAMgV,aAAe,IAAIhV,EAAM+U,aAC/B/U,EAAMiV,YAAcjV,EAAM8U,oBAAsBrE,EAAGyE,aAAezE,EAAG0E,eACrEnV,EAAM9kD,OACC8kD,EA8FX,OAnIAZ,EAAUwV,EAAoB7U,GAuC9B6U,EAAmBx9D,UAAU8D,KAAO,WAChC,IAAIu1D,EAAK9nE,KAAK8nE,GACdA,EAAGiC,WAAWjC,EAAG2E,qBAAsBzsE,KAAKksE,eAE5CpE,EAAG0B,wBAAwBxpE,KAAKgpE,kBAChClB,EAAG0B,wBAAwBxpE,KAAK+qE,gBAChCjD,EAAG0B,wBAAwBxpE,KAAKmpE,eAChCrB,EAAG0B,wBAAwBxpE,KAAKgrE,gBAChClD,EAAG2B,oBAAoBzpE,KAAKgpE,iBAAkB,EAAGlB,EAAG4B,OAAO,EAjDtC,EAiD0Dx6D,aAAay6D,kBAAmB,GAC/G7B,EAAG2B,oBAAoBzpE,KAAK+qE,eAAgB,EAAGjD,EAAG4B,OAAO,EAlDpC,EAkDwDx6D,aAAay6D,kBAAmB,GAC7G7B,EAAG2B,oBAAoBzpE,KAAKmpE,cAAe,EAAGrB,EAAG8B,eAAe,EAnD3C,EAmD8D16D,aAAay6D,kBAAmB,IACnH7B,EAAG2B,oBAAoBzpE,KAAKgrE,eAAgB,EAAGlD,EAAG4B,OAAO,EApDpC,EAoDwDx6D,aAAay6D,kBAAmB,KAEjHsC,EAAmBx9D,UAAU0tB,QAAU,SAAU0oC,EAAYC,EAAY3vD,EAAM0zD,EAAQ9sD,GACnF,GAAI8sD,EACA,IAAK,IAAIuC,EAxDoBC,GAwDdtvD,EAAiBpR,EAAIygE,EAxDPC,GAwDqBD,EAAMzgE,EAAGygE,IACvDprE,KAAKwN,MAAM49D,GAAO,MAF1B,CAKA,IAAIE,EAAYn2D,EAAKnG,MAAQ,EAAGoJ,EAAKysD,EAAWt1D,EAAG8I,EAAKwsD,EAAWr5D,EAAG+M,EAAKusD,EAAWv1D,EAAGiJ,EAAKssD,EAAWt5D,EAAG27D,EAASrC,EAAW91D,MAAQ,EAAG9X,GAAQ,EAAI8/D,EAAQuU,YAAYp2D,EAAKje,OAE5Ksd,EAAK+D,EAAKH,EAAI3D,EAAK+D,EAAKH,EACxBmzD,EAAMh3D,EAAKA,EAAKC,EAAKA,EAAI9B,EAAK,EAAGC,EAAK,EACtC44D,IAEA74D,GAAM8B,GADN+2D,EAAM,EAAIxlE,KAAK4O,KAAK42D,IACHF,EACjB14D,EAAK4B,EAAKg3D,EAAMF,GAEpB,IAAIj/D,EAAIg/D,GAAsBtvD,EAC1BvO,EAAQxN,KAAKwN,MAEjBA,EAAMnB,KAAO+L,EACb5K,EAAMnB,KAAOgM,EACb7K,EAAMnB,KAAOsG,EACbnF,EAAMnB,KAAOuG,EACbpF,EAAMnB,KAAOnV,EACbsW,EAAMnB,KAAO,EAEbmB,EAAMnB,KAAO+L,EACb5K,EAAMnB,KAAOgM,EACb7K,EAAMnB,MAAQsG,EACdnF,EAAMnB,MAAQuG,EACdpF,EAAMnB,KAAOnV,EACbsW,EAAMnB,KAAO,EAEbmB,EAAMnB,KAAOkM,EACb/K,EAAMnB,KAAOmM,EACbhL,EAAMnB,KAAOsG,EACbnF,EAAMnB,KAAOuG,EACbpF,EAAMnB,KAAOnV,EACbsW,EAAMnB,KAAO86D,EAEb35D,EAAMnB,KAAOkM,EACb/K,EAAMnB,KAAOmM,EACbhL,EAAMnB,MAAQsG,EACdnF,EAAMnB,MAAQuG,EACdpF,EAAMnB,KAAOnV,EACbsW,EAAMnB,IAAM86D,IAEhB8E,EAAmBx9D,UAAUk6D,eAAiB,WAI1C,IAHA,IAAIh+D,EAAI3K,KAAKwN,MAAM1T,OArGE,EAsGjBkV,EAAOrE,EAAIA,EAAI,EACf8oD,EAAU,IAAIzzD,KAAKosE,aAAap9D,GAC3B3C,EAAI,EAAG3B,EAAI,EAAG2B,EAAI1B,EAAG0B,GAAK,EAC/BonD,EAAQ/oD,KAAO2B,EACfonD,EAAQ/oD,KAAO2B,EAAI,EACnBonD,EAAQ/oD,KAAO2B,EAAI,EACnBonD,EAAQ/oD,KAAO2B,EAAI,EACnBonD,EAAQ/oD,KAAO2B,EAAI,EACnBonD,EAAQ/oD,KAAO2B,EAAI,EAEvBrM,KAAKqsE,aAAe5Y,GAExBwY,EAAmBx9D,UAAU85D,WAAa,WACtCnR,EAAO3oD,UAAU85D,WAAW75D,KAAK1O,MAEjC,IAAI8nE,EAAK9nE,KAAK8nE,GACdA,EAAGS,WAAWT,EAAG2E,qBAAsBzsE,KAAKqsE,aAAcvE,EAAG4E,cAEjET,EAAmBx9D,UAAUm6D,OAAS,SAAU32D,GAC5C,IAAIjS,KAAKuqE,qBAAT,CAEA,IAAIzC,EAAK9nE,KAAK8nE,GACVU,EAAUxoE,KAAKwoE,QACnBV,EAAG2D,WAAWjD,GAEdV,EAAG4D,iBAAiB1rE,KAAKopE,gBAAgB,EAAOn3D,EAAOiE,QACvD4xD,EAAG6D,UAAU3rE,KAAKkrE,sBAAuBllE,KAAK4O,KAAK3C,EAAOqlD,QAC1DwQ,EAAG6D,UAAU3rE,KAAKmrE,wBAAyBl5D,EAAO25D,iBAElD9D,EAAG6E,aAAa7E,EAAGgE,UAAW9rE,KAAKqsE,aAAavyE,OAAQkG,KAAKssE,YAAa,KAEvEL,EApI4B,CAqIrCzB,EAAO3C,qBACThyE,EAAA,QAAkBo2E,sCC9JlB,IACQzV,EADJC,EAAaz2D,MAAQA,KAAKy2D,YACtBD,EAAgB,SAAUrgE,EAAGwT,GAI7B,OAHA6sD,EAAgBzsD,OAAOya,gBAClB,CAAEE,UAAW,cAAgBlW,OAAS,SAAUrY,EAAGwT,GAAKxT,EAAEuuB,UAAY/a,IACvE,SAAUxT,EAAGwT,GAAK,IAAK,IAAIF,KAAKE,EAAOI,OAAO0E,UAAU+M,eAAe9M,KAAK/E,EAAGF,KAAItT,EAAEsT,GAAKE,EAAEF,KACzF+sD,EAAcrgE,EAAGwT,IAErB,SAAUxT,EAAGwT,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIyb,UAAU,uBAAyB0B,OAAOnd,GAAK,iCAE7D,SAAS+sD,IAAO12D,KAAKJ,YAAczJ,EADnCqgE,EAAcrgE,EAAGwT,GAEjBxT,EAAEsY,UAAkB,OAAN9E,EAAaI,OAAOwa,OAAO5a,IAAM+sD,EAAGjoD,UAAY9E,EAAE8E,UAAW,IAAIioD,KAGnFC,EAAmB32D,MAAQA,KAAK22D,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExD7sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IAkBtD,IAAIu2D,EAAU,EAAQ,OAClB4V,EAAmBjW,EAAgB,EAAQ,QAC3CqV,EAAmBrV,EAAgB,EAAQ,QAG3CkW,EAA6B,SAAUzV,GAEvC,SAASyV,EAAY/E,GACjB,IAAIzQ,EAAQD,EAAO1oD,KAAK1O,KAAM8nE,EAAI8E,EAAiB32E,QAAS+1E,EAAiB/1E,QAJxE,EAAgB,IAIwF+J,KAEzGksE,EAAgBpE,EAAGgC,eACvB,GAAsB,OAAlBoC,EACA,MAAM,IAAI5qE,MAAM,mDACpB+1D,EAAM6U,cAAgBA,EAEtB7U,EAAM2R,iBAAmBlB,EAAGmB,kBAAkB5R,EAAMmR,QAAS,cAC7DnR,EAAM8R,cAAgBrB,EAAGmB,kBAAkB5R,EAAMmR,QAAS,WAC1DnR,EAAM0T,eAAiBjD,EAAGmB,kBAAkB5R,EAAMmR,QAAS,YAC3D,IAAIY,EAAiBtB,EAAGuB,mBAAmBhS,EAAMmR,QAAS,YAC1D,GAAuB,OAAnBY,EACA,MAAM,IAAI9nE,MAAM,mDACpB+1D,EAAM+R,eAAiBA,EACvB,IAAI+B,EAA0BrD,EAAGuB,mBAAmBhS,EAAMmR,QAAS,qBACnE,GAAgC,OAA5B2C,EACA,MAAM,IAAI7pE,MAAM,4DACpB+1D,EAAM8T,wBAA0BA,EAChC,IAAID,EAAwBpD,EAAGuB,mBAAmBhS,EAAMmR,QAAS,mBACjE,GAA8B,OAA1B0C,EACA,MAAM,IAAI5pE,MAAM,0DAapB,OAZA+1D,EAAM6T,sBAAwBA,EAO9B7T,EAAM8U,qBAAsB,EAAInV,EAAQmV,qBAAqBrE,GAC7DzQ,EAAM+U,aAAe/U,EAAM8U,oBAAsBjY,YAAcD,YAC/DoD,EAAMgV,aAAe,IAAIhV,EAAM+U,aAC/B/U,EAAMiV,YAAcjV,EAAM8U,oBAAsBrE,EAAGyE,aAAezE,EAAG0E,eACrEnV,EAAM9kD,OACC8kD,EAuFX,OA1HAZ,EAAUoW,EAAazV,GAqCvByV,EAAYp+D,UAAU8D,KAAO,WACzB,IAAIu1D,EAAK9nE,KAAK8nE,GACdA,EAAGiC,WAAWjC,EAAG2E,qBAAsBzsE,KAAKksE,eAE5CpE,EAAG0B,wBAAwBxpE,KAAKgpE,kBAChClB,EAAG0B,wBAAwBxpE,KAAK+qE,gBAChCjD,EAAG0B,wBAAwBxpE,KAAKmpE,eAChCrB,EAAG2B,oBAAoBzpE,KAAKgpE,iBAAkB,EAAGlB,EAAG4B,OAAO,EA9CtC,EA8C0Dx6D,aAAay6D,kBAAmB,GAC/G7B,EAAG2B,oBAAoBzpE,KAAK+qE,eAAgB,EAAGjD,EAAG4B,OAAO,EA/CpC,EA+CwDx6D,aAAay6D,kBAAmB,GAC7G7B,EAAG2B,oBAAoBzpE,KAAKmpE,cAAe,EAAGrB,EAAG8B,eAAe,EAhD3C,EAgD8D16D,aAAay6D,kBAAmB,KAEvHkD,EAAYp+D,UAAUk6D,eAAiB,WAInC,IAHA,IAAIh+D,EAAI3K,KAAKwN,MAAM1T,OAnDE,EAoDjBkV,EAAOrE,EAAIA,EAAI,EACf8oD,EAAU,IAAIzzD,KAAKosE,aAAap9D,GAC3B3C,EAAI,EAAG3B,EAAI,EAAG2B,EAAI1B,EAAG0B,GAAK,EAC/BonD,EAAQ/oD,KAAO2B,EACfonD,EAAQ/oD,KAAO2B,EAAI,EACnBonD,EAAQ/oD,KAAO2B,EAAI,EACnBonD,EAAQ/oD,KAAO2B,EAAI,EACnBonD,EAAQ/oD,KAAO2B,EAAI,EACnBonD,EAAQ/oD,KAAO2B,EAAI,EAEvBrM,KAAKqsE,aAAe5Y,GAExBoZ,EAAYp+D,UAAU85D,WAAa,WAC/BnR,EAAO3oD,UAAU85D,WAAW75D,KAAK1O,MAEjC,IAAI8nE,EAAK9nE,KAAK8nE,GACdA,EAAGS,WAAWT,EAAG2E,qBAAsBzsE,KAAKqsE,aAAcvE,EAAG4E,cAEjEG,EAAYp+D,UAAU0tB,QAAU,SAAU0oC,EAAYC,EAAY3vD,EAAM0zD,EAAQ9sD,GAC5E,GAAI8sD,EACA,IAAK,IAAIuC,EAxEoBC,GAwEdtvD,EAAiBpR,EAAIygE,EAxEPC,GAwEqBD,EAAMzgE,EAAGygE,IACvDprE,KAAKwN,MAAM49D,GAAO,MAF1B,CAKA,IAAIE,EAAYn2D,EAAKnG,MAAQ,EAAGoJ,EAAKysD,EAAWt1D,EAAG8I,EAAKwsD,EAAWr5D,EAAG+M,EAAKusD,EAAWv1D,EAAGiJ,EAAKssD,EAAWt5D,EAAGtU,GAAQ,EAAI8/D,EAAQuU,YAAYp2D,EAAKje,OAE7Isd,EAAK+D,EAAKH,EAAI3D,EAAK+D,EAAKH,EACxBmzD,EAAMh3D,EAAKA,EAAKC,EAAKA,EAAI9B,EAAK,EAAGC,EAAK,EACtC44D,IAEA74D,GAAM8B,GADN+2D,EAAM,EAAIxlE,KAAK4O,KAAK42D,IACHF,EACjB14D,EAAK4B,EAAKg3D,EAAMF,GAEpB,IAAIj/D,EAAIg/D,GAAsBtvD,EAC1BvO,EAAQxN,KAAKwN,MAEjBA,EAAMnB,KAAO+L,EACb5K,EAAMnB,KAAOgM,EACb7K,EAAMnB,KAAOsG,EACbnF,EAAMnB,KAAOuG,EACbpF,EAAMnB,KAAOnV,EAEbsW,EAAMnB,KAAO+L,EACb5K,EAAMnB,KAAOgM,EACb7K,EAAMnB,MAAQsG,EACdnF,EAAMnB,MAAQuG,EACdpF,EAAMnB,KAAOnV,EAEbsW,EAAMnB,KAAOkM,EACb/K,EAAMnB,KAAOmM,EACbhL,EAAMnB,KAAOsG,EACbnF,EAAMnB,KAAOuG,EACbpF,EAAMnB,KAAOnV,EAEbsW,EAAMnB,KAAOkM,EACb/K,EAAMnB,KAAOmM,EACbhL,EAAMnB,MAAQsG,EACdnF,EAAMnB,MAAQuG,EACdpF,EAAMnB,GAAKnV,IAEf21E,EAAYp+D,UAAUm6D,OAAS,SAAU32D,GACrC,IAAIjS,KAAKuqE,qBAAT,CAEA,IAAIzC,EAAK9nE,KAAK8nE,GACVU,EAAUxoE,KAAKwoE,QACnBV,EAAG2D,WAAWjD,GACdV,EAAG4D,iBAAiB1rE,KAAKopE,gBAAgB,EAAOn3D,EAAOiE,QACvD4xD,EAAG6D,UAAU3rE,KAAKkrE,sBAAuBllE,KAAK4O,KAAK3C,EAAOqlD,QAC1DwQ,EAAG6D,UAAU3rE,KAAKmrE,wBAAyBl5D,EAAO25D,iBAElD9D,EAAG6E,aAAa7E,EAAGgE,UAAW9rE,KAAKqsE,aAAavyE,OAAQkG,KAAKssE,YAAa,KAEvEO,EA3HqB,CAFnB,EAAQ,OA8HZhF,qBACThyE,EAAA,QAAkBg3E,sCCtKlB,IACQrW,EADJC,EAAaz2D,MAAQA,KAAKy2D,YACtBD,EAAgB,SAAUrgE,EAAGwT,GAI7B,OAHA6sD,EAAgBzsD,OAAOya,gBAClB,CAAEE,UAAW,cAAgBlW,OAAS,SAAUrY,EAAGwT,GAAKxT,EAAEuuB,UAAY/a,IACvE,SAAUxT,EAAGwT,GAAK,IAAK,IAAIF,KAAKE,EAAOI,OAAO0E,UAAU+M,eAAe9M,KAAK/E,EAAGF,KAAItT,EAAEsT,GAAKE,EAAEF,KACzF+sD,EAAcrgE,EAAGwT,IAErB,SAAUxT,EAAGwT,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIyb,UAAU,uBAAyB0B,OAAOnd,GAAK,iCAE7D,SAAS+sD,IAAO12D,KAAKJ,YAAczJ,EADnCqgE,EAAcrgE,EAAGwT,GAEjBxT,EAAEsY,UAAkB,OAAN9E,EAAaI,OAAOwa,OAAO5a,IAAM+sD,EAAGjoD,UAAY9E,EAAE8E,UAAW,IAAIioD,KAGnFC,EAAmB32D,MAAQA,KAAK22D,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExD7sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD,IAAIu2D,EAAU,EAAQ,OAClB8V,EAAwBnW,EAAgB,EAAQ,QAChDoW,EAAwBpW,EAAgB,EAAQ,QAGhDqW,EAAiC,SAAU5V,GAE3C,SAAS4V,EAAgBlF,GACrB,IAAIzQ,EAAQD,EAAO1oD,KAAK1O,KAAM8nE,EAAIgF,EAAsB72E,QAAS82E,EAAsB92E,QAJlF,EAAgB,IAIkG+J,KAEvH,OADAq3D,EAAM9kD,OACC8kD,EA6BX,OAjCAZ,EAAUuW,EAAiB5V,GAM3B4V,EAAgBv+D,UAAU0tB,QAAU,SAAUhnB,EAAM0zD,EAAQ9sD,GACxD,IAAIvO,EAAQxN,KAAKwN,MACbnB,EAVC,EAUG0P,EAVa,EAWrB,GAAI8sD,EAKA,OAJAr7D,EAAMnB,KAAO,EACbmB,EAAMnB,KAAO,EACbmB,EAAMnB,KAAO,OACbmB,EAAMnB,KAAO,GAGjB,IAAInV,GAAQ,EAAI8/D,EAAQuU,YAAYp2D,EAAKje,OACzCsW,EAAMnB,KAAO8I,EAAK5F,EAClB/B,EAAMnB,KAAO8I,EAAK3J,EAClBgC,EAAMnB,KAAO8I,EAAKnG,KAClBxB,EAAMnB,GAAKnV,GAEf81E,EAAgBv+D,UAAUm6D,OAAS,SAAU32D,GACzC,IAAIjS,KAAKuqE,qBAAT,CAEA,IAAIzC,EAAK9nE,KAAK8nE,GACVU,EAAUxoE,KAAKwoE,QACnBV,EAAG2D,WAAWjD,GACdV,EAAG6D,UAAU3rE,KAAKspE,cAAe,EAAItjE,KAAK4O,KAAK3C,EAAOqlD,QACtDwQ,EAAG6D,UAAU3rE,KAAKupE,cAAet3D,EAAOjE,cACxC85D,EAAG4D,iBAAiB1rE,KAAKopE,gBAAgB,EAAOn3D,EAAOiE,QACvD4xD,EAAG+D,WAAW/D,EAAGuD,OAAQ,EAAGrrE,KAAKwN,MAAM1T,OAjClB,KAmClBkzE,EAlCyB,CAFvB,EAAQ,OAqCZjE,qBACTlzE,EAAA,QAAkBm3E,aC7DlB,MAAM,aAAa,IAAIlwE,EAAE,CAAC3G,EAAE,CAACgW,EAAE1B,KAAK,IAAI,IAAIZ,KAAKY,EAAE3N,EAAEqP,EAAE1B,EAAEZ,KAAK/M,EAAEqP,EAAEA,EAAEtC,IAAIE,OAAO6b,eAAezZ,EAAEtC,EAAE,CAACyb,YAAW,EAAG5e,IAAI+D,EAAEZ,MAAMsC,EAAE,CAACrP,EAAEqP,IAAIpC,OAAO0E,UAAU+M,eAAe9M,KAAK5R,EAAEqP,GAAG1B,EAAE3N,IAAI,oBAAoBunB,QAAQA,OAAO8e,aAAap5B,OAAO6b,eAAe9oB,EAAEunB,OAAO8e,YAAY,CAAC1iC,MAAM,WAAWsJ,OAAO6b,eAAe9oB,EAAE,aAAa,CAAC2D,OAAM,MAAO0L,EAAE,GAAGrP,EAAE2N,EAAE0B,GAAGrP,EAAE3G,EAAEgW,EAAE,CAAClW,QAAQ,IAAIwU,IAAI,MAAMA,EAAE,yGAAyG8C,EAAO1X,QAAQsW,GAAzf,cCAA,MAAM,aAAa,IAAIhP,EAAE,CAAChH,EAAE,CAAC2G,EAAE+M,KAAK,IAAI,IAAIsC,KAAKtC,EAAE1M,EAAEgP,EAAEtC,EAAEsC,KAAKhP,EAAEgP,EAAErP,EAAEqP,IAAIpC,OAAO6b,eAAe9oB,EAAEqP,EAAE,CAACmZ,YAAW,EAAG5e,IAAImD,EAAEsC,MAAMA,EAAE,CAAChP,EAAEL,IAAIiN,OAAO0E,UAAU+M,eAAe9M,KAAKvR,EAAEL,GAAG2N,EAAEtN,IAAI,oBAAoBknB,QAAQA,OAAO8e,aAAap5B,OAAO6b,eAAezoB,EAAEknB,OAAO8e,YAAY,CAAC1iC,MAAM,WAAWsJ,OAAO6b,eAAezoB,EAAE,aAAa,CAACsD,OAAM,MAAO3D,EAAE,GAAGK,EAAEsN,EAAE3N,GAAGK,EAAEhH,EAAE2G,EAAE,CAAC7G,QAAQ,IAAI4T,IAAI,MAAMA,EAAE,wlEAAwlE0D,EAAO1X,QAAQiH,GAAx+E,cCAA,MAAM,aAAa,IAAIA,EAAE,CAAC3G,EAAE,CAACgW,EAAErC,KAAK,IAAI,IAAID,KAAKC,EAAEhN,EAAEqP,EAAErC,EAAED,KAAK/M,EAAEqP,EAAEA,EAAEtC,IAAIE,OAAO6b,eAAezZ,EAAEtC,EAAE,CAACyb,YAAW,EAAG5e,IAAIoD,EAAED,MAAMsC,EAAE,CAACrP,EAAEqP,IAAIpC,OAAO0E,UAAU+M,eAAe9M,KAAK5R,EAAEqP,GAAG1B,EAAE3N,IAAI,oBAAoBunB,QAAQA,OAAO8e,aAAap5B,OAAO6b,eAAe9oB,EAAEunB,OAAO8e,YAAY,CAAC1iC,MAAM,WAAWsJ,OAAO6b,eAAe9oB,EAAE,aAAa,CAAC2D,OAAM,MAAO0L,EAAE,GAAGrP,EAAE2N,EAAE0B,GAAGrP,EAAE3G,EAAEgW,EAAE,CAAClW,QAAQ,IAAI6T,IAAI,MAAMA,EAAE,yjDAAyjDyD,EAAO1X,QAAQsW,GAAz8D,cCAA,MAAM,aAAa,IAAIrP,EAAE,CAAC3G,EAAE,CAAC2T,EAAED,KAAK,IAAI,IAAIsC,KAAKtC,EAAE/M,EAAEqP,EAAEtC,EAAEsC,KAAKrP,EAAEqP,EAAErC,EAAEqC,IAAIpC,OAAO6b,eAAe9b,EAAEqC,EAAE,CAACmZ,YAAW,EAAG5e,IAAImD,EAAEsC,MAAMA,EAAE,CAACrP,EAAEgN,IAAIC,OAAO0E,UAAU+M,eAAe9M,KAAK5R,EAAEgN,GAAGW,EAAE3N,IAAI,oBAAoBunB,QAAQA,OAAO8e,aAAap5B,OAAO6b,eAAe9oB,EAAEunB,OAAO8e,YAAY,CAAC1iC,MAAM,WAAWsJ,OAAO6b,eAAe9oB,EAAE,aAAa,CAAC2D,OAAM,MAAOqJ,EAAE,GAAGhN,EAAE2N,EAAEX,GAAGhN,EAAE3G,EAAE2T,EAAE,CAAC7T,QAAQ,IAAI4T,IAAI,MAAMA,EAAE,iZAAiZ0D,EAAO1X,QAAQiU,GAAjyB,cCAA,MAAM,aAAa,IAAIhN,EAAE,CAAC3G,EAAE,CAAC2T,EAAEqC,KAAK,IAAI,IAAItC,KAAKsC,EAAErP,EAAEqP,EAAEA,EAAEtC,KAAK/M,EAAEqP,EAAErC,EAAED,IAAIE,OAAO6b,eAAe9b,EAAED,EAAE,CAACyb,YAAW,EAAG5e,IAAIyF,EAAEtC,MAAMsC,EAAE,CAACrP,EAAEgN,IAAIC,OAAO0E,UAAU+M,eAAe9M,KAAK5R,EAAEgN,GAAGW,EAAE3N,IAAI,oBAAoBunB,QAAQA,OAAO8e,aAAap5B,OAAO6b,eAAe9oB,EAAEunB,OAAO8e,YAAY,CAAC1iC,MAAM,WAAWsJ,OAAO6b,eAAe9oB,EAAE,aAAa,CAAC2D,OAAM,MAAOqJ,EAAE,GAAGhN,EAAE2N,EAAEX,GAAGhN,EAAE3G,EAAE2T,EAAE,CAAC7T,QAAQ,IAAIkW,IAAI,MAAMA,EAAE,ouDAAouDoB,EAAO1X,QAAQiU,GAApnE,cCAA,MAAM,aAAa,IAAIhN,EAAE,CAAC3G,EAAE,CAAC2T,EAAEqC,KAAK,IAAI,IAAItC,KAAKsC,EAAErP,EAAEqP,EAAEA,EAAEtC,KAAK/M,EAAEqP,EAAErC,EAAED,IAAIE,OAAO6b,eAAe9b,EAAED,EAAE,CAACyb,YAAW,EAAG5e,IAAIyF,EAAEtC,MAAMsC,EAAE,CAACrP,EAAEgN,IAAIC,OAAO0E,UAAU+M,eAAe9M,KAAK5R,EAAEgN,GAAGW,EAAE3N,IAAI,oBAAoBunB,QAAQA,OAAO8e,aAAap5B,OAAO6b,eAAe9oB,EAAEunB,OAAO8e,YAAY,CAAC1iC,MAAM,WAAWsJ,OAAO6b,eAAe9oB,EAAE,aAAa,CAAC2D,OAAM,MAAOqJ,EAAE,GAAGhN,EAAE2N,EAAEX,GAAGhN,EAAE3G,EAAE2T,EAAE,CAAC7T,QAAQ,IAAIkW,IAAI,MAAMA,EAAE,saAAsaoB,EAAO1X,QAAQiU,GAAtzB,cCAA,MAAM,aAAa,IAAIqC,EAAE,CAAChW,EAAE,CAAC0T,EAAE/M,KAAK,IAAI,IAAIgN,KAAKhN,EAAEqP,EAAEA,EAAErP,EAAEgN,KAAKqC,EAAEA,EAAEtC,EAAEC,IAAIC,OAAO6b,eAAe/b,EAAEC,EAAE,CAACwb,YAAW,EAAG5e,IAAI5J,EAAEgN,MAAMqC,EAAE,CAACA,EAAEtC,IAAIE,OAAO0E,UAAU+M,eAAe9M,KAAKvC,EAAEtC,GAAGY,EAAE0B,IAAI,oBAAoBkY,QAAQA,OAAO8e,aAAap5B,OAAO6b,eAAezZ,EAAEkY,OAAO8e,YAAY,CAAC1iC,MAAM,WAAWsJ,OAAO6b,eAAezZ,EAAE,aAAa,CAAC1L,OAAM,MAAOoJ,EAAE,GAAGsC,EAAE1B,EAAEZ,GAAGsC,EAAEhW,EAAE0T,EAAE,CAAC5T,QAAQ,IAAI6G,IAAI,MAAMA,EAAE,4oBAA4oByQ,EAAO1X,QAAQgU,GAA5hC,+BCaA,SAASojE,EAAW17D,EAAMu2D,EAAIn4D,GAC1B,IAAIu9D,EAAkB,WAAT37D,EAAoBu2D,EAAGqF,cAAgBrF,EAAGsF,gBAEnDC,EAASvF,EAAGwF,aAAaJ,GAC7B,GAAe,OAAXG,EACA,MAAM,IAAI/rE,MAAM,+CASpB,GANAwmE,EAAGyF,aAAaF,EAAQ19D,GAExBm4D,EAAG0F,cAAcH,IAEUvF,EAAG2F,mBAAmBJ,EAAQvF,EAAG4F,gBAEjC,CACvB,IAAIC,EAAU7F,EAAG8F,iBAAiBP,GAElC,MADAvF,EAAG+F,aAAaR,GACV,IAAI/rE,MAAM,kDAAkDvH,OAAO4zE,EAAS,MAAM5zE,OAAO4V,IAEnG,OAAO09D,EAxBXtjE,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQw0E,YAAcx0E,EAAQu0E,mBAAqBv0E,EAAQq0E,sBAAmB,EA4B9Er0E,EAAQq0E,iBAHR,SAA0BpC,EAAIn4D,GAC1B,OAAOs9D,EAAW,SAAUnF,EAAIn4D,IAMpC9Z,EAAQu0E,mBAHR,SAA4BtC,EAAIn4D,GAC5B,OAAOs9D,EAAW,WAAYnF,EAAIn4D,IAwBtC9Z,EAAQw0E,YAlBR,SAAqBvC,EAAIgG,GACrB,IAIIzhE,EAAG1B,EAJH69D,EAAUV,EAAGiG,gBACjB,GAAgB,OAAZvF,EACA,MAAM,IAAIlnE,MAAM,kDAIpB,IAAK+K,EAAI,EAAG1B,EAAImjE,EAAQh0E,OAAQuS,EAAI1B,EAAG0B,IACnCy7D,EAAGkG,aAAaxF,EAASsF,EAAQzhE,IAIrC,GAHAy7D,EAAGmG,YAAYzF,IAEUV,EAAGoG,oBAAoB1F,EAASV,EAAGqG,aAGxD,MADArG,EAAGsG,cAAc5F,GACX,IAAIlnE,MAAM,iDAEpB,OAAOknE,uCC5DX,IAAI7R,EAAmB32D,MAAQA,KAAK22D,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExD7sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQw4E,gBAAkBx4E,EAAQ+Y,iBAAmB/Y,EAAQy4E,6BAA+Bz4E,EAAQ04E,6BAA+B14E,EAAQkc,sBAAmB,EAC9J,IAAIilD,EAAU,EAAQ,OAClBwP,EAAU7P,EAAgB,EAAQ,QAClC6X,EAAU7X,EAAgB,EAAQ,QAClC8X,EAAe9X,EAAgB,EAAQ,QACvC+X,EAAc/X,EAAgB,EAAQ,QACtC6T,EAAS7T,EAAgB,EAAQ,QACjCgY,EAAehY,EAAgB,EAAQ,QAC3C9gE,EAAQkc,iBAAmB,CAEvB68D,iBAAiB,EACjBC,kBAAkB,EAClBC,cAAc,EACdC,kBAAkB,EAClBhkE,uBAAuB,EACvBE,uBAAuB,EACvBD,uBAAuB,EAEvBgkE,iBAAkB,OAClBC,gBAAiB,SACjBC,iBAAkB,OAClBC,gBAAiB,OACjBzI,UAAW,QACXD,UAAW,GACXE,YAAa,SACbgB,WAAY,CAAEzwE,MAAO,QACrB+tE,cAAe,QACfF,cAAe,GACfG,gBAAiB,SACjBC,eAAgB,CAAEC,UAAW,SAC7BgK,aAAc,GAEdC,aAAc,EACdC,kBAAmB,IACnBC,2BAA4B,EAE5BC,YAAa,KACbC,YAAa,KAEbC,QAAQ,EACRC,eAAgB,KAChBC,eAAgB,KAEhBC,cAAerJ,EAAQvwE,QACvB65E,cAAetB,EAAQv4E,QACvB85E,kBAAmBtB,EAAax4E,QAEhCkX,uBAAuB,EAEvB6iE,mBAAoB,GACpBC,wBAAyB,GACzBC,mBAAoB,IAExBr6E,EAAQ04E,6BAA+B,CACnC32D,OAAQ82D,EAAYz4E,SAExBJ,EAAQy4E,6BAA+B,CACnC6B,MAAOxB,EAAa14E,QACpBm6E,KAAM5F,EAAOv0E,SAWjBJ,EAAQ+Y,iBATR,SAA0B1B,GACtB,GAAqC,iBAA1BA,EAASmiE,cAA6BniE,EAASmiE,aAAe,EACrE,MAAM,IAAI/tE,MAAM,kEAEpB,IAAIquE,EAAiBziE,EAASyiE,eAAgBC,EAAiB1iE,EAAS0iE,eACxE,GAA8B,iBAAnBD,GAAyD,iBAAnBC,GAA+BA,EAAiBD,EAC7F,MAAM,IAAIruE,MAAM,+GAUxBzL,EAAQw4E,gBANR,SAAyBnhE,GACrB,IAAImjE,GAAmB,EAAIrZ,EAAQhrD,QAAQ,GAAInW,EAAQkc,iBAAkB7E,GAGzE,OAFAmjE,EAAiBL,oBAAqB,EAAIhZ,EAAQhrD,QAAQ,GAAInW,EAAQ04E,6BAA8B8B,EAAiBL,oBACrHK,EAAiBH,oBAAqB,EAAIlZ,EAAQhrD,QAAQ,GAAInW,EAAQy4E,6BAA8B+B,EAAiBH,oBAC9GG,uCC9EX,IACQ7Z,EADJC,EAAaz2D,MAAQA,KAAKy2D,YACtBD,EAAgB,SAAUrgE,EAAGwT,GAI7B,OAHA6sD,EAAgBzsD,OAAOya,gBAClB,CAAEE,UAAW,cAAgBlW,OAAS,SAAUrY,EAAGwT,GAAKxT,EAAEuuB,UAAY/a,IACvE,SAAUxT,EAAGwT,GAAK,IAAK,IAAIF,KAAKE,EAAOI,OAAO0E,UAAU+M,eAAe9M,KAAK/E,EAAGF,KAAItT,EAAEsT,GAAKE,EAAEF,KACzF+sD,EAAcrgE,EAAGwT,IAErB,SAAUxT,EAAGwT,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIyb,UAAU,uBAAyB0B,OAAOnd,GAAK,iCAE7D,SAAS+sD,IAAO12D,KAAKJ,YAAczJ,EADnCqgE,EAAcrgE,EAAGwT,GAEjBxT,EAAEsY,UAAkB,OAAN9E,EAAaI,OAAOwa,OAAO5a,IAAM+sD,EAAGjoD,UAAY9E,EAAE8E,UAAW,IAAIioD,KAGnFwC,EAAYl5D,MAAQA,KAAKk5D,UAAa,WAStC,OARAA,EAAWnvD,OAAOiC,QAAU,SAASnC,GACjC,IAAK,IAAInM,EAAG2O,EAAI,EAAGvC,EAAI6E,UAAU7U,OAAQuS,EAAIvC,EAAGuC,IAE5C,IAAK,IAAI5C,KADT/L,EAAIiR,UAAUtC,GACOtC,OAAO0E,UAAU+M,eAAe9M,KAAKhR,EAAG+L,KACzDI,EAAEJ,GAAK/L,EAAE+L,IAEjB,OAAOI,GAEJqvD,EAASj0C,MAAMjlB,KAAM2O,YAE5B2hE,EAAYtwE,MAAQA,KAAKswE,UAAa,SAASnkE,GAC/C,IAAIzO,EAAsB,mBAAX2mB,QAAyBA,OAAOC,SAAU9mB,EAAIE,GAAKyO,EAAEzO,GAAI2O,EAAI,EAC5E,GAAI7O,EAAG,OAAOA,EAAEkR,KAAKvC,GACrB,GAAIA,GAAyB,iBAAbA,EAAErS,OAAqB,MAAO,CAC1Cwd,KAAM,WAEF,OADInL,GAAKE,GAAKF,EAAErS,SAAQqS,OAAI,GACrB,CAAE1L,MAAO0L,GAAKA,EAAEE,KAAMgc,MAAOlc,KAG5C,MAAM,IAAIiZ,UAAU1nB,EAAI,0BAA4B,oCAEpDi5D,EAAmB32D,MAAQA,KAAK22D,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExD7sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD,IAAIqhE,EAAWnL,EAAgB,EAAQ,OACnC8N,EAAW9N,EAAgB,EAAQ,QACnCgO,EAAUhO,EAAgB,EAAQ,QAClC+N,EAAa/N,EAAgB,EAAQ,QACrCM,EAAU,EAAQ,OAClBD,EAAU,EAAQ,OAClBuZ,EAAW,EAAQ,MACnBC,EAAa,EAAQ,OACrBC,EAAU9Z,EAAgB,EAAQ,QAClC+Z,EAAa,EAAQ,OACrBC,EAAoB,EAAQ,OAShC,SAASC,EAAkB1jE,EAAUyK,EAAKxC,GACtC,IAAKA,EAAKqG,eAAe,OAASrG,EAAKqG,eAAe,KAClD,MAAM,IAAIla,MAAM,2DAA4DvH,OAAO4d,EAAK,mJAqB5F,OApBKxC,EAAKje,QACNie,EAAKje,MAAQgW,EAAS8hE,kBACrB75D,EAAKkwD,OAAwB,KAAflwD,EAAKkwD,QACpBlwD,EAAKkwD,MAAQ,WACEpkE,IAAfkU,EAAKkwD,OAAsC,OAAflwD,EAAKkwD,MACjClwD,EAAKkwD,MAAQ,GAAKlwD,EAAKkwD,MAEvBlwD,EAAKkwD,MAAQ,KACZlwD,EAAKnG,OACNmG,EAAKnG,KAAO,GACXmG,EAAKqG,eAAe,YACrBrG,EAAK0zD,QAAS,GACb1zD,EAAKqG,eAAe,iBACrBrG,EAAK07D,aAAc,GAClB17D,EAAKqG,eAAe,gBACrBrG,EAAK27D,YAAa,GACjB37D,EAAK5D,MAAsB,KAAd4D,EAAK5D,OACnB4D,EAAK5D,KAAOrE,EAAS+hE,iBACpB95D,EAAKu6D,SACNv6D,EAAKu6D,OAAS,GACXv6D,EAEX,SAAS47D,EAAkB7jE,EAAUyK,EAAKxC,GAetC,OAdKA,EAAKje,QACNie,EAAKje,MAAQgW,EAASgiE,kBACrB/5D,EAAKkwD,QACNlwD,EAAKkwD,MAAQ,IACZlwD,EAAKnG,OACNmG,EAAKnG,KAAO,IACXmG,EAAKqG,eAAe,YACrBrG,EAAK0zD,QAAS,GACb1zD,EAAKqG,eAAe,gBACrBrG,EAAK27D,YAAa,GACjB37D,EAAK5D,MAAsB,KAAd4D,EAAK5D,OACnB4D,EAAK5D,KAAOrE,EAASiiE,iBACpBh6D,EAAKu6D,SACNv6D,EAAKu6D,OAAS,GACXv6D,EAUX,IAAIovD,EAAuB,SAAUnN,GAEjC,SAASmN,EAAMx3D,EAAOnD,EAAWsD,QACZ,IAAbA,IAAuBA,EAAW,IACtC,IAAImqD,EAAQD,EAAO1oD,KAAK1O,OAASA,KA6CjC,GA5CAq3D,EAAM2Z,SAAW,GACjB3Z,EAAM4Z,eAAiB,GACvB5Z,EAAM6Z,cAAgB,GACtB7Z,EAAM8Z,gBAAkB,GACxB9Z,EAAM+Z,SAAW,IAAI1M,EAAWzuE,QAChCohE,EAAMga,UAAY,IAAId,EAASpQ,UAC/B9I,EAAMia,cAAgB,GACtBja,EAAMka,cAAgB,GACtBla,EAAMma,sBAAwB,GAC9Bna,EAAMoa,sBAAwB,GAC9Bpa,EAAMqa,WAAa,CAAEniE,EAAG,CAAC,EAAG,GAAI/D,EAAG,CAAC,EAAG,IACvC6rD,EAAMnhD,QAAS,EAAIw6D,EAAWvgC,YAC9BknB,EAAMsa,WAAY,EAAIjB,EAAWvgC,YACjCknB,EAAMuU,gBAAkB,EACxBvU,EAAMua,WAAa,KACnBva,EAAMwa,uBAAwB,EAAI7a,EAAQ8a,6BAA6B,CACnEviE,EAAG,CAAC,EAAG,GACP/D,EAAG,CAAC,EAAG,KAGX6rD,EAAM0a,gBAAkB,EAExB1a,EAAM7/D,MAAQ,EACd6/D,EAAM5/D,OAAS,EACf4/D,EAAM2a,YAAa,EAAIhb,EAAQib,iBAE/B5a,EAAM6a,gBAAkB,IAAI1zD,IAC5B64C,EAAMkK,iBAAmB,IAAI/iD,IAC7B64C,EAAMiK,YAAc,KACpBjK,EAAM8a,YAAc,KACpB9a,EAAM+a,YAAc,KACpB/a,EAAMgb,4BAA8B,KACpChb,EAAMib,eAAgB,EACtBjb,EAAMkb,mBAAoB,EAC1Blb,EAAMmb,sBAAwB,KAE9Bnb,EAAMob,aAAe,GACrBpb,EAAMqb,kBAAoB,GAC1Brb,EAAMsb,aAAe,GAErBtb,EAAMnqD,UAAW,EAAIsjE,EAAWnC,iBAAiBnhE,IAEjD,EAAIsjE,EAAW5hE,kBAAkByoD,EAAMnqD,WACvC,EAAI8pD,EAAQ4b,eAAe7lE,KACrBnD,aAAqBipE,aACvB,MAAM,IAAIvxE,MAAM,+CAapB,IAAK,IAAIqW,KAXT0/C,EAAMtqD,MAAQA,EACdsqD,EAAMztD,UAAYA,EAElBytD,EAAMyb,mBAAmB,QAAS,CAAEC,uBAAuB,IAC3D1b,EAAM2b,oBAAoB,cAC1B3b,EAAMyb,mBAAmB,SACzBzb,EAAM2b,oBAAoB,UAC1B3b,EAAM2b,oBAAoB,UAC1B3b,EAAMyb,mBAAmB,cACzBzb,EAAM2b,oBAAoB,SAEV3b,EAAM6Z,cAAe,CACjC,IAAIpJ,EAAKzQ,EAAM6Z,cAAcv5D,GAC7BmwD,EAAGmL,UAAUnL,EAAGoL,IAAKpL,EAAGqL,qBACxBrL,EAAGjQ,OAAOiQ,EAAGsL,OAGjB,IAAK,IAAI7hE,KAAQ8lD,EAAMnqD,SAAS8iE,mBAAoB,CAChD,IAAIqD,EAAmBhc,EAAMnqD,SAAS8iE,mBAAmBz+D,GACzD8lD,EAAMob,aAAalhE,GAAQ,IAAI8hE,EAAiBhc,EAAM6Z,cAAchhE,MAAOmnD,GAC3E,IAAIic,EAAmBD,EACnB9hE,KAAQ8lD,EAAMnqD,SAAS+iE,0BACvBqD,EAAmBjc,EAAMnqD,SAAS+iE,wBAAwB1+D,IAE9D8lD,EAAMqb,kBAAkBnhE,GAAQ,IAAI+hE,EAAiBjc,EAAM6Z,cAAcqC,WAAYlc,GAEzF,IAAK,IAAI9lD,KAAQ8lD,EAAMnqD,SAASgjE,mBAAoB,CAChD,IAAIsD,EAAmBnc,EAAMnqD,SAASgjE,mBAAmB3+D,GACzD8lD,EAAMsb,aAAaphE,GAAQ,IAAIiiE,EAAiBnc,EAAM6Z,cAAc/gE,MAAOknD,GAoB/E,OAjBAA,EAAM8L,SAEN9L,EAAMoF,OAAS,IAAIgI,EAASxuE,QAE5BohE,EAAMoc,qBAENpc,EAAMqc,YAAc,IAAI/O,EAAQ1uE,QAAQohE,EAAM2Z,SAAS5T,MAAO/F,GAC9DA,EAAMsc,YAAc,IAAIlD,EAAQx6E,QAAQohE,EAAM2Z,SAAS5T,MAAO/F,GAE9DA,EAAMuc,oBAENvc,EAAMwc,oBAENxc,EAAMyc,uBAENzc,EAAMl7B,UACNk7B,EAAMuR,SACCvR,EAgvCX,OAn1CAZ,EAAU8N,EAAOnN,GA8GjBmN,EAAM91D,UAAUslE,aAAe,SAAU/mE,GACrC,IAAIgnE,GAAS,EAAIhd,EAAQid,eAAe,SAAU,CAC9C1pB,SAAU,YACX,CACC2pB,MAAO,SAASn6E,OAAOiT,KAI3B,OAFAhN,KAAKgxE,SAAShkE,GAAMgnE,EACpBh0E,KAAK4J,UAAUuqE,YAAYH,GACpBA,GASXzP,EAAM91D,UAAUukE,oBAAsB,SAAUhmE,GAC5C,IAAIgnE,EAASh0E,KAAK+zE,aAAa/mE,GAM/B,OADAhN,KAAKixE,eAAejkE,GAAMgnE,EAAOI,WAAW,KAJvB,CACjBrB,uBAAuB,EACvBsB,WAAW,IAGRr0E,MAUXukE,EAAM91D,UAAUqkE,mBAAqB,SAAU9lE,EAAI0F,GAC/C,IAEIgV,EAFAssD,EAASh0E,KAAK+zE,aAAa/mE,GAC3BsnE,EAAiBpb,EAAS,CAAE6Z,uBAAuB,EAAOsB,WAAW,GAAU3hE,GAAW,IAW9F,OARAgV,EAAUssD,EAAOI,WAAW,SAAUE,MAGlC5sD,EAAUssD,EAAOI,WAAW,QAASE,IAEpC5sD,IACDA,EAAUssD,EAAOI,WAAW,qBAAsBE,IACtDt0E,KAAKkxE,cAAclkE,GAAM0a,EAClB1nB,MAOXukE,EAAM91D,UAAUglE,mBAAqB,WACjC,IAAIpc,EAAQr3D,KAKZ,OAJAA,KAAKmxE,gBAAgB1U,OAAS,WAC1BpF,EAAMkd,oBAEVv0E,KAAKy8D,OAAOtxD,GAAG,UAAWnL,KAAKmxE,gBAAgB1U,QACxCz8D,MAKXukE,EAAM91D,UAAU+lE,cAAgB,SAAU3X,EAAIkC,EAAI/vD,GAC9C,IAAIO,EAAIstD,EAAGttD,EAAG/D,EAAIqxD,EAAGrxD,EACjBipE,EAAQ1V,EAAGxvD,EAAGmlE,EAAQ3V,EAAGvzD,EAC7B,OAAQ+D,EAAIklE,EAAQzlE,GAChBO,EAAIklE,EAAQzlE,GACZxD,EAAIkpE,EAAQ1lE,GACZxD,EAAIkpE,EAAQ1lE,GACZhJ,KAAK4O,KAAK5O,KAAK2O,IAAIpF,EAAIklE,EAAO,GAAKzuE,KAAK2O,IAAInJ,EAAIkpE,EAAO,IAAM1lE,GAKrEu1D,EAAM91D,UAAUkmE,aAAe,SAAUpqB,GACrC,IAAIqqB,EAAqB50E,KAAKm9D,sBAAsB5S,GACpD,OAAOvqD,KAAKoxE,SAASlN,MAAM0Q,EAAmBrlE,EAAG,EAAIqlE,EAAmBppE,IAK5E+4D,EAAM91D,UAAUomE,kBAAoB,SAAUtqB,GAK1C,IAJA,IAAIh7C,EAAIg7C,EAASh7C,EAAG/D,EAAI++C,EAAS/+C,EAC7BspE,EAAY90E,KAAK20E,aAAapqB,GAE9BwqB,EAAc7gE,EAAAA,EAAU8gE,EAAiB,KACpC3oE,EAAI,EAAG1B,EAAImqE,EAAUh7E,OAAQuS,EAAI1B,EAAG0B,IAAK,CAC9C,IAAIgD,EAAOylE,EAAUzoE,GACjB8I,EAAOnV,KAAKsxE,cAAcjiE,GAC1B4lE,EAAej1E,KAAKk1E,sBAAsB//D,GAC1CnG,EAAOhP,KAAKm1E,UAAUhgE,EAAKnG,MAC/B,IAAKmG,EAAK0zD,QAAU7oE,KAAKw0E,cAAcjqB,EAAU0qB,EAAcjmE,GAAO,CAClE,IAAIoE,EAAWpN,KAAK4O,KAAK5O,KAAK2O,IAAIpF,EAAI0lE,EAAa1lE,EAAG,GAAKvJ,KAAK2O,IAAInJ,EAAIypE,EAAazpE,EAAG,IAEpF4H,EAAW2hE,IACXA,EAAc3hE,EACd4hE,EAAiB3lE,IAI7B,OAAO2lE,GAOXzQ,EAAM91D,UAAUmlE,kBAAoB,WAChC,IAAIvc,EAAQr3D,KAEZA,KAAKmxE,gBAAgBiE,aAAe,WAChC/d,EAAMkb,mBAAoB,EAC1Blb,EAAMkd,oBAEVxjE,OAAOkE,iBAAiB,SAAUjV,KAAKmxE,gBAAgBiE,cAEvDp1E,KAAKmxE,gBAAgBlV,WAAa,SAAUn/D,GACxC,IAAIu4E,EAAY,CACZngE,MAAOpY,EACPo9D,oBAAqB,WACjBp9D,EAAEo9D,wBAGNob,EAAcje,EAAMwd,kBAAkB/3E,GAC1C,GAAIw4E,GAAeje,EAAMiK,cAAgBgU,IAAgBje,EAAMia,cAAcgE,GAAazM,OAOtF,OALIxR,EAAMiK,aACNjK,EAAM1wC,KAAK,YAAauyC,EAASA,EAAS,GAAImc,GAAY,CAAEhmE,KAAMgoD,EAAMiK,eAC5EjK,EAAMiK,YAAcgU,EACpBje,EAAM1wC,KAAK,YAAauyC,EAASA,EAAS,GAAImc,GAAY,CAAEhmE,KAAMimE,UAClEje,EAAMke,iCAIV,GAAIle,EAAMiK,YAAa,CACnB,IAAInsD,EAAOkiD,EAAMia,cAAcja,EAAMiK,aACjCX,EAAMtJ,EAAM6d,sBAAsB//D,GAClCnG,EAAOqoD,EAAM8d,UAAUhgE,EAAKnG,MAChC,IAAKqoD,EAAMmd,cAAc13E,EAAG6jE,EAAK3xD,GAAO,CACpC,IAAIK,EAAOgoD,EAAMiK,YAIjB,OAHAjK,EAAMiK,YAAc,KACpBjK,EAAM1wC,KAAK,YAAauyC,EAASA,EAAS,GAAImc,GAAY,CAAEhmE,KAAMA,UAClEgoD,EAAMke,mCAI+B,IAAzCle,EAAMnqD,SAASlC,sBACfqsD,EAAMme,qBAAqBH,GAEmB,aAAzChe,EAAMnqD,SAASlC,wBACfqsD,EAAMmb,wBACPnb,EAAMmb,uBAAwB,EAAIxb,EAAQ8B,eAAc,WACpDzB,EAAMme,qBAAqBH,GAC3Bhe,EAAMmb,sBAAwB,WAK9C,IAAIiD,EAAsB,SAAUC,GAChC,OAAO,SAAU54E,GACb,IAAIu4E,EAAY,CACZngE,MAAOpY,EACPo9D,oBAAqB,WACjBp9D,EAAEo9D,wBAIN8a,EADwBl4E,EAAEq9D,SAASwE,sBACMtH,EAAMwd,kBAAkB/3E,GAAKu6D,EAAMiK,YAChF,GAAI0T,EACA,OAAO3d,EAAM1wC,KAAK,GAAG5sB,OAAO27E,EAAW,QAASxc,EAASA,EAAS,GAAImc,GAAY,CAAEhmE,KAAM2lE,KAC9F,GAAkB,UAAdU,EAAwBre,EAAMnqD,SAASjC,sBAAwBosD,EAAMnqD,SAASnC,sBAAuB,CACrG,IAAI2E,EAAO2nD,EAAMse,eAAe74E,EAAEyS,EAAGzS,EAAE0O,GACvC,GAAIkE,EACA,OAAO2nD,EAAM1wC,KAAK,GAAG5sB,OAAO27E,EAAW,QAASxc,EAASA,EAAS,GAAImc,GAAY,CAAE3lE,KAAMA,KAElG,OAAO2nD,EAAM1wC,KAAK,GAAG5sB,OAAO27E,EAAW,SAAUL,KAgBzD,OAbAr1E,KAAKmxE,gBAAgBtV,YAAc4Z,EAAoB,SACvDz1E,KAAKmxE,gBAAgBrV,iBAAmB2Z,EAAoB,cAC5Dz1E,KAAKmxE,gBAAgB9U,kBAAoBoZ,EAAoB,eAC7Dz1E,KAAKmxE,gBAAgBjV,YAAcuZ,EAAoB,SACvDz1E,KAAKmxE,gBAAgBpV,WAAa0Z,EAAoB,QACtDz1E,KAAK0zE,YAAYvoE,GAAG,YAAanL,KAAKmxE,gBAAgBlV,YACtDj8D,KAAK0zE,YAAYvoE,GAAG,QAASnL,KAAKmxE,gBAAgBtV,aAClD77D,KAAK0zE,YAAYvoE,GAAG,aAAcnL,KAAKmxE,gBAAgBrV,kBACvD97D,KAAK0zE,YAAYvoE,GAAG,cAAenL,KAAKmxE,gBAAgB9U,mBACxDr8D,KAAK0zE,YAAYvoE,GAAG,QAASnL,KAAKmxE,gBAAgBjV,aAClDl8D,KAAK0zE,YAAYvoE,GAAG,YAAanL,KAAKmxE,gBAAgBpV,YAG/C/7D,MAOXukE,EAAM91D,UAAUolE,kBAAoB,WAChC,IAAIxc,EAAQr3D,KACR+M,EAAQ/M,KAAK+M,MAyCjB,OAxCA/M,KAAKmxE,gBAAgByE,YAAc,WAC/Bve,EAAMib,eAAgB,EACtBjb,EAAMkd,oBAEVv0E,KAAKmxE,gBAAgB0E,gBAAkB,WACnCxe,EAAMkb,mBAAoB,EAC1Blb,EAAMkd,oBAEVv0E,KAAKmxE,gBAAgB2E,oBAAsB,SAAUh5E,UAC1Cu6D,EAAMia,cAAcx0E,EAAE6a,KACzB0/C,EAAMiK,cAAgBxkE,EAAE6a,MACxB0/C,EAAMiK,YAAc,MACxBjK,EAAM8Z,gBAAgByE,eAE1B51E,KAAKmxE,gBAAgB4E,oBAAsB,SAAUj5E,UAC1Cu6D,EAAMka,cAAcz0E,EAAE6a,KACzB0/C,EAAM8a,cAAgBr1E,EAAE6a,MACxB0/C,EAAM8a,YAAc,MACxB9a,EAAM8Z,gBAAgByE,eAE1B51E,KAAKmxE,gBAAgB6E,sBAAwB,WACzC3e,EAAMka,cAAgB,GACtBla,EAAM8a,YAAc,KACpB9a,EAAM8Z,gBAAgByE,eAE1B51E,KAAKmxE,gBAAgB8E,iBAAmB,WACpC5e,EAAMia,cAAgB,GACtBja,EAAMiK,YAAc,KACpBjK,EAAM8Z,gBAAgB6E,yBAE1BjpE,EAAM5B,GAAG,YAAanL,KAAKmxE,gBAAgByE,aAC3C7oE,EAAM5B,GAAG,cAAenL,KAAKmxE,gBAAgB2E,qBAC7C/oE,EAAM5B,GAAG,wBAAyBnL,KAAKmxE,gBAAgB0E,iBACvD9oE,EAAM5B,GAAG,4BAA6BnL,KAAKmxE,gBAAgByE,aAC3D7oE,EAAM5B,GAAG,YAAanL,KAAKmxE,gBAAgByE,aAC3C7oE,EAAM5B,GAAG,cAAenL,KAAKmxE,gBAAgB4E,qBAC7ChpE,EAAM5B,GAAG,wBAAyBnL,KAAKmxE,gBAAgB0E,iBACvD9oE,EAAM5B,GAAG,4BAA6BnL,KAAKmxE,gBAAgByE,aAC3D7oE,EAAM5B,GAAG,eAAgBnL,KAAKmxE,gBAAgB6E,uBAC9CjpE,EAAM5B,GAAG,UAAWnL,KAAKmxE,gBAAgB8E,kBAClCj2E,MAOXukE,EAAM91D,UAAUynE,oBAAsB,WAClC,IAAInpE,EAAQ/M,KAAK+M,MACjBA,EAAMyJ,eAAe,YAAaxW,KAAKmxE,gBAAgByE,aACvD7oE,EAAMyJ,eAAe,cAAexW,KAAKmxE,gBAAgB2E,qBACzD/oE,EAAMyJ,eAAe,wBAAyBxW,KAAKmxE,gBAAgB0E,iBACnE9oE,EAAMyJ,eAAe,4BAA6BxW,KAAKmxE,gBAAgByE,aACvE7oE,EAAMyJ,eAAe,YAAaxW,KAAKmxE,gBAAgByE,aACvD7oE,EAAMyJ,eAAe,cAAexW,KAAKmxE,gBAAgB4E,qBACzDhpE,EAAMyJ,eAAe,wBAAyBxW,KAAKmxE,gBAAgB0E,iBACnE9oE,EAAMyJ,eAAe,4BAA6BxW,KAAKmxE,gBAAgByE,aACvE7oE,EAAMyJ,eAAe,eAAgBxW,KAAKmxE,gBAAgB6E,uBAC1DjpE,EAAMyJ,eAAe,UAAWxW,KAAKmxE,gBAAgB8E,mBAOzD1R,EAAM91D,UAAU+mE,qBAAuB,SAAUn/D,GAC7C,IAAI8/D,EAAcn2E,KAAKshE,YAAc,KAAOthE,KAAK21E,eAAet/D,EAAQnB,MAAM3F,EAAG8G,EAAQnB,MAAM1J,GAQ/F,OAPI2qE,IAAgBn2E,KAAKmyE,cACjBnyE,KAAKmyE,aACLnyE,KAAK2mB,KAAK,YAAauyC,EAASA,EAAS,GAAI7iD,GAAU,CAAE3G,KAAM1P,KAAKmyE,eACpEgE,GACAn2E,KAAK2mB,KAAK,YAAauyC,EAASA,EAAS,GAAI7iD,GAAU,CAAE3G,KAAMymE,KACnEn2E,KAAKmyE,YAAcgE,GAEhBn2E,MAMXukE,EAAM91D,UAAUknE,eAAiB,SAAUpmE,EAAG/D,GAC1C,IAAI4qE,EAAKvZ,EACLxF,EAAQr3D,KACGuxE,EAANvxE,KAAyBuxE,cAAeD,EAAxCtxE,KAA2DsxE,cAIpE,KAAK,EAAIX,EAAkB0F,gBAAgBr2E,KAAKkxE,cAAc/gE,MAAOZ,EAAIvP,KAAKgyE,WAAYxmE,EAAIxL,KAAKgyE,YAC/F,OAAO,KAEX,IAAI9S,EAAKl/D,KAAKs2E,gBAAgB,CAAE/mE,EAAGA,EAAG/D,EAAGA,IAAM+qE,EAASrX,EAAG3vD,EAAGinE,EAAStX,EAAG1zD,EAItEirE,EAAsB,EAgB1B,GAfAz2E,KAAK+M,MAAM2pE,UAAS,SAAU/+D,EAAKnN,EAAGmsE,EAAUC,EAAU/Z,EAAIkC,GAC1D,IAAI8X,EAAKha,EAAGttD,EAAGunE,EAAKja,EAAGrxD,EACnB2gB,EAAK4yC,EAAGxvD,EAAGqc,EAAKmzC,EAAGvzD,EACvB,GAAI+lE,EAAc55D,GAAKkxD,QAAUyI,EAAcqF,GAAU9N,QAAUyI,EAAcsF,GAAU/N,OACvF,OAAO,EACX,GAAIgO,IAAO1qD,GAAM2qD,IAAOlrD,EAAI,CACxB,IAAImrD,EAAc/wE,KAAK4O,KAAK5O,KAAK2O,IAAIwX,EAAK0qD,EAAI,GAAK7wE,KAAK2O,IAAIiX,EAAKkrD,EAAI,IACjE5X,EAAK7H,EAAM2f,gBAAgB,CAAEznE,EAAGsnE,EAAIrrE,EAAGsrE,IAAOG,EAAQ/X,EAAG3vD,EAAG2nE,EAAQhY,EAAG1zD,EACvEo0D,EAAKvI,EAAM2f,gBAAgB,CAAEznE,EAAG4c,EAAI3gB,EAAGogB,IAAOurD,EAAQvX,EAAGrwD,EAAG6nE,EAAQxX,EAAGp0D,EACvE6rE,EAAiBrxE,KAAK4O,KAAK5O,KAAK2O,IAAIwiE,EAAQF,EAAO,GAAKjxE,KAAK2O,IAAIyiE,EAAQF,EAAO,IAEpF,OADAT,EAAsBM,EAAcM,GAC7B,OAIVZ,EACD,OAAO,KAEX,IAAItmE,EAAQnQ,KAAK+M,MAAMuqE,aAAY,SAAU3/D,EAAK4/D,EAAgBZ,EAAUC,EAAUY,EAAgBC,GAClG,QAAIlG,EAAc55D,GAAKkxD,QAAUyI,EAAcqF,GAAU9N,QAAUyI,EAAcsF,GAAU/N,aAEvF,EAAI8H,EAAkB+G,wBAAwBnB,EAAQC,EAAQgB,EAAejoE,EAAGioE,EAAehsE,EAAGisE,EAAeloE,EAAGkoE,EAAejsE,EAEtI+lE,EAAc55D,GAAK3I,KAAOynE,EAAuBpf,EAAM0a,uBAFxD,MAMJ,GAAqB,IAAjB5hE,EAAMrW,OACN,OAAO,KAEX,IAAI69E,EAAexnE,EAAMA,EAAMrW,OAAS,GAEpC89E,GAAgB,IACpB,IACI,IAAK,IAAIC,EAAUvH,EAASngE,GAAQ2nE,EAAYD,EAAQvgE,QAASwgE,EAAUzvD,KAAMyvD,EAAYD,EAAQvgE,OAAQ,CACzG,IAAI5H,EAAOooE,EAAUr3E,MACjBivE,EAAS1vE,KAAK+M,MAAMgrE,iBAAiBroE,EAAM,UAC3CggE,GAAUkI,IACVD,EAAejoE,EACfkoE,EAAgBlI,IAI5B,MAAOsI,GAAS5B,EAAM,CAAE3uD,MAAOuwD,GAC/B,QACI,IACQF,IAAcA,EAAUzvD,OAASw0C,EAAKgb,EAAQI,SAASpb,EAAGnuD,KAAKmpE,GAEvE,QAAU,GAAIzB,EAAK,MAAMA,EAAI3uD,OAEjC,OAAOkwD,GAOXpT,EAAM91D,UAAU0tB,QAAU,SAAU+7C,GAChC,IAAI7gB,EAAQr3D,UACO,IAAfk4E,IAAyBA,GAAa,GAC1C,IAAInrE,EAAQ/M,KAAK+M,MACbG,EAAWlN,KAAKkN,SAChBwO,EAAa1b,KAAKo+D,gBAClB+Z,EAAc,CAACjkE,EAAAA,GAAU,KACzBkkE,EAAc,CAAClkE,EAAAA,GAAU,KAE7BlU,KAAKoxE,SAASzlE,QAGd3L,KAAKqxE,UAAU5Q,eAAe/kD,EAAYxO,EAASoiE,mBAEnDtvE,KAAKuhE,iBAAmB,IAAI/iD,IAE5Bxe,KAAK0xE,YAAa,EAAI1a,EAAQqhB,aAAatrE,GAE3C/M,KAAKwxE,sBAAwB,GAC7BxxE,KAAKyxE,sBAAwB,GAG7B,IAAI6G,EAAa,IAAI7T,EAASxuE,QAC1BsiF,GAAmB,EAAIvhB,EAAQwhB,kBAAkBF,EAAWjrE,WAAYrN,KAAKo+D,gBAAiBp+D,KAAKy4E,qBAAsBz4E,KAAK04E,WAAW,iBAAmB,GAEhK14E,KAAK6xE,uBAAwB,EAAI7a,EAAQ8a,6BAA6B9xE,KAAK4xE,YAAc5xE,KAAK0xE,YAG9F,IAFA,IAAIiH,EAAmB,GACnBzoE,EAAQnD,EAAMmD,QACT7D,EAAI,EAAG1B,EAAIuF,EAAMpW,OAAQuS,EAAI1B,EAAG0B,IAAK,CAC1C,IAAIgD,EAAOa,EAAM7D,GAQbiD,EAAOvF,OAAOiC,OAAO,GAAIe,EAAM4D,kBAAkBtB,IACjDnC,EAASsiE,cACTlgE,EAAOpC,EAASsiE,YAAYngE,EAAMC,IAEtCqpE,GADIxjE,EAAOy7D,EAAkB5wE,KAAKkN,SAAUmC,EAAMC,IAC5BiC,OAASonE,EAAiBxjE,EAAK5D,OAAS,GAAK,EACnEvR,KAAKsxE,cAAcjiE,GAAQ8F,EAC3BnV,KAAK6xE,sBAAsB+G,QAAQzjE,GAC/BA,EAAK27D,YACL9wE,KAAKwxE,sBAAsBx3E,KAAKqV,GAChCrP,KAAKkN,SAASwiE,SACVv6D,EAAKu6D,OAASyI,EAAY,KAC1BA,EAAY,GAAKhjE,EAAKu6D,QACtBv6D,EAAKu6D,OAASyI,EAAY,KAC1BA,EAAY,GAAKhjE,EAAKu6D,SAGlC,IAAK,IAAIn+D,KAAQvR,KAAKyyE,aAAc,CAChC,IAAKzyE,KAAKyyE,aAAaj3D,eAAejK,GAClC,MAAM,IAAIjQ,MAAM,2DAA4DvH,OAAOwX,EAAM,OAExF2mE,GACDl4E,KAAKyyE,aAAalhE,GAAMk3D,SAASkQ,EAAiBpnE,IAAS,GAE/DonE,EAAiBpnE,GAAQ,EAM7B,IAFIvR,KAAKkN,SAASwiE,QAAUyI,EAAY,KAAOA,EAAY,KACvDjoE,GAAQ,EAAI8mD,EAAQ6hB,gBAAgBV,GAAa,SAAU9oE,GAAQ,OAAOgoD,EAAMia,cAAcjiE,GAAMqgE,SAAWx/D,IAC1G7D,EAAI,EAAG1B,EAAIuF,EAAMpW,OAAQuS,EAAI1B,EAAG0B,IAAK,CACtCgD,EAAOa,EAAM7D,GAAjB,IACI8I,EAAOnV,KAAKsxE,cAAcjiE,GAC9BrP,KAAKoxE,SAASlrE,IAAImJ,EAAM8F,EAAK5F,EAAG,EAAI4F,EAAK3J,EAAG2J,EAAKnG,KAAOhP,KAAKxI,OACnC,iBAAf2d,EAAKkwD,OAAuBlwD,EAAK0zD,QACxC7oE,KAAKqxE,UAAUnrE,IAAImJ,EAAM8F,EAAKnG,KAAMhP,KAAKk1E,sBAAsB//D,EAAM,CAAEe,OAAQqiE,KACnF,IAAIO,EAAc94E,KAAKyyE,aAAat9D,EAAK5D,MACzC,IAAKunE,EACD,MAAM,IAAIx3E,MAAM,2DAA4DvH,OAAOob,EAAK5D,KAAM,OAClGunE,EAAY38C,QAAQhnB,EAAMA,EAAK0zD,OAAQ8P,EAAiBxjE,EAAK5D,SAEzD4D,EAAK07D,cAAgB17D,EAAK0zD,QAC1B7oE,KAAKuhE,iBAAiBr7D,IAAImJ,GAElCrP,KAAKqxE,UAAUtQ,WACf,IAAIgY,EAAmB,GACnB5oE,EAAQpD,EAAMoD,QAClB,IAAS9D,EAAI,EAAG1B,EAAIwF,EAAMrW,OAAQuS,EAAI1B,EAAG0B,IAAK,CAC1C,IAAIqD,EAAOS,EAAM9D,GAObiD,EAAOvF,OAAOiC,OAAO,GAAIe,EAAMqS,kBAAkB1P,IACjDxC,EAASuiE,cACTngE,EAAOpC,EAASuiE,YAAY//D,EAAMJ,IAEtCypE,GADI5jE,EAAO47D,EAAkB/wE,KAAKkN,SAAUwC,EAAMJ,IAC5BiC,OAASwnE,EAAiB5jE,EAAK5D,OAAS,GAAK,EACnEvR,KAAKuxE,cAAc7hE,GAAQyF,EACvBA,EAAK27D,aAAe37D,EAAK0zD,QACzB7oE,KAAKyxE,sBAAsBz3E,KAAK0V,GAChC1P,KAAKkN,SAASwiE,SACVv6D,EAAKu6D,OAAS0I,EAAY,KAC1BA,EAAY,GAAKjjE,EAAKu6D,QACtBv6D,EAAKu6D,OAAS0I,EAAY,KAC1BA,EAAY,GAAKjjE,EAAKu6D,SAGlC,IAAK,IAAIn+D,KAAQvR,KAAK2yE,aAAc,CAChC,IAAK3yE,KAAK2yE,aAAan3D,eAAejK,GAClC,MAAM,IAAIjQ,MAAM,2DAA4DvH,OAAOwX,EAAM,OAExF2mE,GACDl4E,KAAK2yE,aAAaphE,GAAMk3D,SAASsQ,EAAiBxnE,IAAS,GAE/DwnE,EAAiBxnE,GAAQ,EAK7B,IAFIvR,KAAKkN,SAASwiE,QAAU0I,EAAY,KAAOA,EAAY,KACvDjoE,GAAQ,EAAI6mD,EAAQ6hB,gBAAgBT,GAAa,SAAU1oE,GAAQ,OAAO2nD,EAAMka,cAAc7hE,GAAMggE,SAAWv/D,IAC1G9D,EAAI,EAAG1B,EAAIwF,EAAMrW,OAAQuS,EAAI1B,EAAG0B,IAAK,CACtCqD,EAAOS,EAAM9D,GACb8I,EAAOnV,KAAKuxE,cAAc7hE,GAD9B,IAEIuU,EAAclX,EAAMkX,YAAYvU,GAAOm1D,EAAa7kE,KAAKsxE,cAAcrtD,EAAY,IAAK6gD,EAAa9kE,KAAKsxE,cAAcrtD,EAAY,IACpI4kD,EAAS1zD,EAAK0zD,QAAUhE,EAAWgE,QAAU/D,EAAW+D,OAC5D7oE,KAAK2yE,aAAax9D,EAAK5D,MAAM4qB,QAAQ0oC,EAAYC,EAAY3vD,EAAM0zD,EAAQkQ,EAAiB5jE,EAAK5D,SAErG,IAAK,IAAIA,KAAQvR,KAAK2yE,aAAc,CAChC,IAAInK,EAAUxoE,KAAK2yE,aAAaphE,GAC3B2mE,GAAgD,mBAA3B1P,EAAQG,gBAC9BH,EAAQG,iBAEhB,OAAO3oE,MAMXukE,EAAM91D,UAAUqlE,qBAAuB,WAInC,OAHA9zE,KAAKy8D,OAAOlF,SAAWv3D,KAAKkN,SAASyiE,eACrC3vE,KAAKy8D,OAAOjF,SAAWx3D,KAAKkN,SAAS0iE,eACrC5vE,KAAKy8D,OAAOrvD,SAASpN,KAAKy8D,OAAOvE,cAAcl4D,KAAKy8D,OAAOpvD,aACpDrN,MAQXukE,EAAM91D,UAAUuqE,SAAW,WAavB,OAXIh5E,KAAKsyE,cACLtyE,KAAKm8B,UAEAn8B,KAAKuyE,mBACVvyE,KAAKm8B,SAAQ,GAGjBn8B,KAAKsyE,eAAgB,EACrBtyE,KAAKuyE,mBAAoB,EAEzBvyE,KAAK4oE,SACE5oE,MAQXukE,EAAM91D,UAAU8lE,iBAAmB,WAC/B,IAAIld,EAAQr3D,KAOZ,OANKA,KAAKoyE,cACNpyE,KAAKoyE,aAAc,EAAIpb,EAAQ8B,eAAc,WACzCzB,EAAM2hB,WACN3hB,EAAM+a,YAAc,SAGrBpyE,MAOXukE,EAAM91D,UAAUqgE,aAAe,WAC3B,IAAK9uE,KAAKkN,SAAS4hE,aACf,OAAO9uE,KACX,IAAI88D,EAAc98D,KAAKy8D,OAAOpvD,WAE1B4rE,EAAkBj5E,KAAKqxE,UAAUrQ,mBAAmBlE,EAAYxF,MAAOt3D,KAAKkN,SAASmiE,eACzF,EAAIvN,EAAS7rE,SAASgjF,EAAiBj5E,KAAKwxE,uBAC5CxxE,KAAKkyE,gBAAkB,IAAI1zD,IAG3B,IADA,IAAIkJ,EAAU1nB,KAAKixE,eAAe5P,OACzBh1D,EAAI,EAAG1B,EAAIsuE,EAAgBn/E,OAAQuS,EAAI1B,EAAG0B,IAAK,CACpD,IAAIgD,EAAO4pE,EAAgB5sE,GACvB8I,EAAOnV,KAAKsxE,cAAcjiE,GAI9B,IAAIrP,KAAKkyE,gBAAgBzzD,IAAIpP,KAGzB8F,EAAK0zD,OAAT,CAEA,IAAIhM,EAAK78D,KAAKk1E,sBAAsB//D,GAAO5F,EAAIstD,EAAGttD,EAAG/D,EAAIqxD,EAAGrxD,EAExDwD,EAAOhP,KAAKm1E,UAAUhgE,EAAKnG,OAE1BmG,EAAK27D,YAAc9hE,EAAOhP,KAAKkN,SAASqiE,4BAWzChgE,GAtuBK,KAuuBLA,EAAIvP,KAAKxI,MAvuBJ,KAwuBLgU,GAvuBK,IAwuBLA,EAAIxL,KAAKvI,OAxuBJ,KA+uBTuI,KAAKkyE,gBAAgBhsE,IAAImJ,GACzBrP,KAAKkN,SAAS2iE,cAAcnoD,EAASwxC,EAASA,EAAS,CAAEvhD,IAAKtI,GAAQ8F,GAAO,CAAEnG,KAAMA,EAAMO,EAAGA,EAAG/D,EAAGA,IAAMxL,KAAKkN,YAEnH,OAAOlN,MAQXukE,EAAM91D,UAAUsgE,iBAAmB,WAC/B,IAAK/uE,KAAKkN,SAAS6hE,iBACf,OAAO/uE,KACX,IAAI0nB,EAAU1nB,KAAKixE,eAAeiI,WAElCxxD,EAAQyxD,UAAU,EAAG,EAAGn5E,KAAKxI,MAAOwI,KAAKvI,QAQzC,IAPA,IAAI2hF,GAAsB,EAAI7I,EAASrQ,8BAA8B,CACjEnzD,MAAO/M,KAAK+M,MACZu0D,YAAathE,KAAKshE,YAClBE,oBAAqBxhE,KAAKkyE,gBAC1B3Q,iBAAkBvhE,KAAKuhE,mBACxBxnE,OAAOiG,KAAKyxE,uBACXS,EAAkB,IAAI1zD,IACjBnS,EAAI,EAAG1B,EAAIyuE,EAAoBt/E,OAAQuS,EAAI1B,EAAG0B,IAAK,CACxD,IAAIqD,EAAO0pE,EAAoB/sE,GAAI4X,EAAcjkB,KAAK+M,MAAMkX,YAAYvU,GAAOm1D,EAAa7kE,KAAKsxE,cAAcrtD,EAAY,IAAK6gD,EAAa9kE,KAAKsxE,cAAcrtD,EAAY,IAAK2gD,EAAW5kE,KAAKuxE,cAAc7hE,GAG3MwiE,EAAgBzzD,IAAI/O,IAIpBk1D,EAASiE,QAAUhE,EAAWgE,QAAU/D,EAAW+D,SAGvD7oE,KAAKkN,SAAS6iE,kBAAkBroD,EAASwxC,EAASA,EAAS,CAAEvhD,IAAKjI,GAAQk1D,GAAW,CAAE51D,KAAMhP,KAAKm1E,UAAUvQ,EAAS51D,QAAUkqD,EAASA,EAASA,EAAS,CAAEvhD,IAAKsM,EAAY,IAAM4gD,GAAa7kE,KAAKk1E,sBAAsBrQ,IAAc,CAAE71D,KAAMhP,KAAKm1E,UAAUtQ,EAAW71D,QAAUkqD,EAASA,EAASA,EAAS,CAAEvhD,IAAKsM,EAAY,IAAM6gD,GAAa9kE,KAAKk1E,sBAAsBpQ,IAAc,CAAE91D,KAAMhP,KAAKm1E,UAAUrQ,EAAW91D,QAAUhP,KAAKkN,UAChbglE,EAAgBhsE,IAAIwJ,IAExB,OAAO1P,MAOXukE,EAAM91D,UAAU4qE,uBAAyB,WACrC,IAAIhiB,EAAQr3D,KACR0nB,EAAU1nB,KAAKixE,eAAeqI,OAElC5xD,EAAQyxD,UAAU,EAAG,EAAGn5E,KAAKxI,MAAOwI,KAAKvI,QAEzC,IAMI8hF,EAAgB,GAChBv5E,KAAKshE,cAAgBthE,KAAKsxE,cAActxE,KAAKshE,aAAauH,QAC1D0Q,EAAcv/E,KAAKgG,KAAKshE,aAE5BthE,KAAKuhE,iBAAiBt3D,SAAQ,SAAUoF,GAEhCA,IAASgoD,EAAMiK,aACfiY,EAAcv/E,KAAKqV,MAG3BkqE,EAActvE,SAAQ,SAAUoF,GAAQ,OAhB3B,SAAUA,GACnB,IAAI8F,EAAOkiD,EAAMia,cAAcjiE,GAC3BwtD,EAAKxF,EAAM6d,sBAAsB//D,GAAO5F,EAAIstD,EAAGttD,EAAG/D,EAAIqxD,EAAGrxD,EACzDwD,EAAOqoD,EAAM8d,UAAUhgE,EAAKnG,MAChCqoD,EAAMnqD,SAAS4iE,cAAcpoD,EAASwxC,EAASA,EAAS,CAAEvhD,IAAKtI,GAAQ8F,GAAO,CAAEnG,KAAMA,EAAMO,EAAGA,EAAG/D,EAAGA,IAAM6rD,EAAMnqD,UAYtE07D,CAAOv5D,MAEtD,IAAIspE,EAAmB,GAOvB,IAAK,IAAIpnE,KALTgoE,EAActvE,SAAQ,SAAUoF,GAC5B,IAAIkC,EAAO8lD,EAAMia,cAAcjiE,GAAMkC,KACrConE,EAAiBpnE,IAASonE,EAAiBpnE,IAAS,GAAK,KAG5CvR,KAAK0yE,kBAClB1yE,KAAK0yE,kBAAkBnhE,GAAMk3D,SAASkQ,EAAiBpnE,IAAS,GAEhEonE,EAAiBpnE,GAAQ,EAU7B,IAAK,IAAIA,KAPTgoE,EAActvE,SAAQ,SAAUoF,GAC5B,IAAI8F,EAAOkiD,EAAMia,cAAcjiE,GAC/BgoD,EAAMqb,kBAAkBv9D,EAAK5D,MAAM4qB,QAAQhnB,EAAMA,EAAK0zD,OAAQ8P,EAAiBxjE,EAAK5D,YAGxFvR,KAAKkxE,cAAcqC,WAAW5nE,MAAM3L,KAAKkxE,cAAcqC,WAAWiG,kBAEjDx5E,KAAK0yE,kBAAmB,CACrC,IAAIlK,EAAUxoE,KAAK0yE,kBAAkBnhE,GACrCi3D,EAAQj2D,OACRi2D,EAAQD,aACRC,EAAQI,OAAO,CACX1yD,OAAQlW,KAAKkW,OACb1e,MAAOwI,KAAKxI,MACZC,OAAQuI,KAAKvI,OACb6/D,MAAOt3D,KAAKy8D,OAAOnF,MACnBsU,gBAAiB5rE,KAAK4rE,gBAAkB5rE,KAAKy8D,OAAOnF,MACpDtpD,aAAchO,KAAKgyE,eAQ/BzN,EAAM91D,UAAU8mE,+BAAiC,WAC7C,IAAIle,EAAQr3D,KACRA,KAAKqyE,6BAA+BryE,KAAKoyE,cAE7CpyE,KAAKqyE,6BAA8B,EAAIrb,EAAQ8B,eAAc,WAEzDzB,EAAMgb,4BAA8B,KAEpChb,EAAMgiB,yBACNhiB,EAAM0X,wBAQdxK,EAAM91D,UAAUm6D,OAAS,WACrB,IAAIvR,EAAQr3D,KACZA,KAAK2mB,KAAK,gBACV,IAAI8yD,EAAa,WAEb,OADApiB,EAAM1wC,KAAK,eACJ0wC,GAgBX,GAbIr3D,KAAKoyE,eACL,EAAIpb,EAAQ+B,aAAa/4D,KAAKoyE,aAC9BpyE,KAAKoyE,YAAc,KACnBpyE,KAAKsyE,eAAgB,EACrBtyE,KAAKuyE,mBAAoB,GAG7BvyE,KAAKmjE,SAELnjE,KAAK2L,QAEL3L,KAAK05E,sBAEA15E,KAAK+M,MAAMrB,MACZ,OAAO+tE,IAGX,IAAI/F,EAAc1zE,KAAK0zE,YACnBiG,EAAS35E,KAAKy8D,OAAOrE,cACrBsb,EAAYnY,UACZmY,EAAYxY,eACZwY,EAAY9X,sBAEZkB,EAAc98D,KAAKy8D,OAAOpvD,WAC1BusE,EAAqB55E,KAAKo+D,gBAC1Byb,EAAkB75E,KAAKy4E,qBACvBx/E,EAAU+G,KAAK04E,WAAW,iBAAmB,EAKjD,IAAK,IAAInnE,KAJTvR,KAAKkW,QAAS,EAAI8gD,EAAQwhB,kBAAkB1b,EAAa8c,EAAoBC,EAAiB5gF,GAC9F+G,KAAK2xE,WAAY,EAAI3a,EAAQwhB,kBAAkB1b,EAAa8c,EAAoBC,EAAiB5gF,GAAS,GAC1G+G,KAAK4rE,iBAAkB,EAAI5U,EAAQ8iB,iBAAiB95E,KAAKkW,OAAQ4mD,EAAa8c,GAE7D55E,KAAKyyE,cACdjK,EAAUxoE,KAAKyyE,aAAalhE,IACxBgB,OACRi2D,EAAQD,aACRC,EAAQI,OAAO,CACX1yD,OAAQlW,KAAKkW,OACb1e,MAAOwI,KAAKxI,MACZC,OAAQuI,KAAKvI,OACb6/D,MAAOwF,EAAYxF,MACnBsU,gBAAiB5rE,KAAK4rE,gBAAkB9O,EAAYxF,MACpDtpD,aAAchO,KAAKgyE,aAI3B,IAAKhyE,KAAKkN,SAAS0hE,kBAAoB+K,EACnC,IAAK,IAAIpoE,KAAQvR,KAAK2yE,aAAc,CAChC,IAAInK,GAAAA,EAAUxoE,KAAK2yE,aAAaphE,IACxBgB,OACRi2D,EAAQD,aACRC,EAAQI,OAAO,CACX1yD,OAAQlW,KAAKkW,OACb1e,MAAOwI,KAAKxI,MACZC,OAAQuI,KAAKvI,OACb6/D,MAAOwF,EAAYxF,MACnBsU,gBAAiB5rE,KAAK4rE,gBAAkB9O,EAAYxF,MACpDtpD,aAAchO,KAAKgyE,aAK/B,OAAIhyE,KAAKkN,SAAS2hE,kBAAoB8K,IAEtC35E,KAAK8uE,eACL9uE,KAAK+uE,mBACL/uE,KAAKq5E,0BAHMI,KAUflV,EAAM91D,UAAUirE,mBAAqB,WACjC,IAAIpiB,EAAQt3D,KAAKy8D,OAAOpvD,WAAWiqD,MACnCt3D,KAAK+xE,gBAAkB/rE,KAAK4O,KAAK0iD,IAWrCiN,EAAM91D,UAAUnD,UAAY,WACxB,OAAOtL,KAAKy8D,QAOhB8H,EAAM91D,UAAUsrE,aAAe,WAC3B,OAAO/5E,KAAK4J,WAOhB26D,EAAM91D,UAAUhD,SAAW,WACvB,OAAOzL,KAAK+M,OAOhBw3D,EAAM91D,UAAUurE,SAAW,SAAUjtE,GAC7BA,IAAU/M,KAAK+M,QAGnB/M,KAAKk2E,sBAELl2E,KAAKsxE,cAAgB,GACrBtxE,KAAKuxE,cAAgB,GAErBvxE,KAAKkyE,gBAAgBvmE,QACrB3L,KAAKuhE,iBAAiB51D,QACtB3L,KAAKshE,YAAc,KACnBthE,KAAKmyE,YAAc,KACnBnyE,KAAKwxE,sBAAsB13E,OAAS,EACpCkG,KAAKyxE,sBAAsB33E,OAAS,EACD,OAA/BkG,KAAKwyE,yBACL,EAAIxb,EAAQ+B,aAAa/4D,KAAKwyE,uBAC9BxyE,KAAKwyE,sBAAwB,MAGjCxyE,KAAK+M,MAAQA,EAEb/M,KAAK6zE,oBAEL7zE,KAAKm8B,UACLn8B,KAAK4oE,WAOTrE,EAAM91D,UAAUrD,eAAiB,WAC7B,OAAOpL,KAAK0zE,aAOhBnP,EAAM91D,UAAUpD,eAAiB,WAC7B,OAAOrL,KAAK2zE,aAOhBpP,EAAM91D,UAAU2vD,cAAgB,WAC5B,MAAO,CAAE5mE,MAAOwI,KAAKxI,MAAOC,OAAQuI,KAAKvI,SAO7C8sE,EAAM91D,UAAUgqE,mBAAqB,WACjC,IAAIwB,EAASj6E,KAAK4xE,YAAc5xE,KAAK0xE,WACrC,MAAO,CACHl6E,MAAOyiF,EAAO1qE,EAAE,GAAK0qE,EAAO1qE,EAAE,IAAM,EACpC9X,OAAQwiF,EAAOzuE,EAAE,GAAKyuE,EAAOzuE,EAAE,IAAM,IAW7C+4D,EAAM91D,UAAUnC,mBAAqB,SAAUqL,GAC3C,IAAItI,EAAOrP,KAAKsxE,cAAc35D,GAC9B,OAAOtI,EAAOtF,OAAOiC,OAAO,GAAIqD,QAAQpO,GAS5CsjE,EAAM91D,UAAUyrE,mBAAqB,SAAUviE,GAC3C,IAAIjI,EAAO1P,KAAKuxE,cAAc55D,GAC9B,OAAOjI,EAAO3F,OAAOiC,OAAO,GAAI0D,QAAQzO,GAO5CsjE,EAAM91D,UAAU7D,YAAc,WAC1B,OAAOsuD,EAAS,GAAIl5D,KAAKkN,WAQ7Bq3D,EAAM91D,UAAUiqE,WAAa,SAAU/gE,GACnC,OAAO3X,KAAKkN,SAASyK,IAUzB4sD,EAAM91D,UAAUvE,WAAa,SAAUyN,EAAKlX,GAMxC,OALAT,KAAKkN,SAASyK,GAAOlX,GACrB,EAAI+vE,EAAW5hE,kBAAkB5O,KAAKkN,UACtClN,KAAK8zE,uBACL9zE,KAAKsyE,eAAgB,EACrBtyE,KAAKu0E,mBACEv0E,MAUXukE,EAAM91D,UAAU0rE,cAAgB,SAAUxiE,EAAKs9B,GAM3C,OALAj1C,KAAKkN,SAASyK,GAAOs9B,EAAQj1C,KAAKkN,SAASyK,KAC3C,EAAI64D,EAAW5hE,kBAAkB5O,KAAKkN,UACtClN,KAAK8zE,uBACL9zE,KAAKsyE,eAAgB,EACrBtyE,KAAKu0E,mBACEv0E,MAOXukE,EAAM91D,UAAU00D,OAAS,WACrB,IAAIiX,EAAgBp6E,KAAKxI,MAAO6iF,EAAiBr6E,KAAKvI,OAItD,GAHAuI,KAAKxI,MAAQwI,KAAK4J,UAAUO,YAC5BnK,KAAKvI,OAASuI,KAAK4J,UAAUQ,aAC7BpK,KAAKgyE,YAAa,EAAIhb,EAAQib,iBACX,IAAfjyE,KAAKxI,MAAa,CAClB,IAAIwI,KAAKkN,SAASC,sBAGd,MAAM,IAAI7L,MAAM,mHAFhBtB,KAAKxI,MAAQ,EAIrB,GAAoB,IAAhBwI,KAAKvI,OAAc,CACnB,IAAIuI,KAAKkN,SAASC,sBAGd,MAAM,IAAI7L,MAAM,oHAFhBtB,KAAKvI,OAAS,EAKtB,GAAI2iF,IAAkBp6E,KAAKxI,OAAS6iF,IAAmBr6E,KAAKvI,OACxD,OAAOuI,KAGX,IAAK,IAAIgN,KAFThN,KAAK2mB,KAAK,UAEK3mB,KAAKgxE,SAAU,CAC1B,IAAIsJ,EAAUt6E,KAAKgxE,SAAShkE,GAC5BstE,EAAQrtE,MAAMzV,MAAQwI,KAAKxI,MAAQ,KACnC8iF,EAAQrtE,MAAMxV,OAASuI,KAAKvI,OAAS,KAGzC,IAAK,IAAIuV,KAAMhN,KAAKixE,eAChBjxE,KAAKgxE,SAAShkE,GAAI4iB,aAAa,QAAS5vB,KAAKxI,MAAQwI,KAAKgyE,WAAa,MACvEhyE,KAAKgxE,SAAShkE,GAAI4iB,aAAa,SAAU5vB,KAAKvI,OAASuI,KAAKgyE,WAAa,MACjD,IAApBhyE,KAAKgyE,YACLhyE,KAAKixE,eAAejkE,GAAIiK,MAAMjX,KAAKgyE,WAAYhyE,KAAKgyE,YAG5D,IAAK,IAAIhlE,KAAMhN,KAAKkxE,cAChBlxE,KAAKgxE,SAAShkE,GAAI4iB,aAAa,QAAS5vB,KAAKxI,MAAQwI,KAAKgyE,WAAa,MACvEhyE,KAAKgxE,SAAShkE,GAAI4iB,aAAa,SAAU5vB,KAAKvI,OAASuI,KAAKgyE,WAAa,MACzEhyE,KAAKkxE,cAAclkE,GAAIutE,SAAS,EAAG,EAAGv6E,KAAKxI,MAAQwI,KAAKgyE,WAAYhyE,KAAKvI,OAASuI,KAAKgyE,YAE3F,OAAOhyE,MAOXukE,EAAM91D,UAAU9C,MAAQ,WAOpB,OANA3L,KAAKkxE,cAAchhE,MAAMvE,MAAM3L,KAAKkxE,cAAchhE,MAAMspE,kBACxDx5E,KAAKkxE,cAAc/gE,MAAMxE,MAAM3L,KAAKkxE,cAAc/gE,MAAMqpE,kBACxDx5E,KAAKkxE,cAAcqC,WAAW5nE,MAAM3L,KAAKkxE,cAAcqC,WAAWiG,kBAClEx5E,KAAKixE,eAAe5P,OAAO8X,UAAU,EAAG,EAAGn5E,KAAKxI,MAAOwI,KAAKvI,QAC5DuI,KAAKixE,eAAeqI,OAAOH,UAAU,EAAG,EAAGn5E,KAAKxI,MAAOwI,KAAKvI,QAC5DuI,KAAKixE,eAAeiI,WAAWC,UAAU,EAAG,EAAGn5E,KAAKxI,MAAOwI,KAAKvI,QACzDuI,MAOXukE,EAAM91D,UAAU5C,QAAU,WAGtB,OAFA7L,KAAKsyE,eAAgB,EACrBtyE,KAAKg5E,WACEh5E,MAQXukE,EAAM91D,UAAU+rE,gBAAkB,WAG9B,OAFAx6E,KAAKsyE,eAAgB,EACrBtyE,KAAKu0E,mBACEv0E,MAUXukE,EAAM91D,UAAUkuD,uBAAyB,SAAU8d,EAAgB/d,GAC/D,IAAIG,EAAK78D,KAAKy8D,OAAOpvD,WAAYiqD,EAAQuF,EAAGvF,MAAO36C,EAAQkgD,EAAGlgD,MAAOpN,EAAIstD,EAAGttD,EAAG/D,EAAIqxD,EAAGrxD,EAElFgyD,EAAYd,EAAWpF,EACvBzgD,EAAS,CACTtH,EAAGvP,KAAKxI,MAAQ,EAChBgU,EAAGxL,KAAKvI,OAAS,GAEjBijF,EAAqB16E,KAAKm9D,sBAAsBsd,GAChDE,EAAsB36E,KAAKm9D,sBAAsBtmD,GACrD,MAAO,CACH8F,MAAOA,EACPpN,GAAImrE,EAAmBnrE,EAAIorE,EAAoBprE,IAAM,EAAIiuD,GAAajuD,EACtE/D,GAAIkvE,EAAmBlvE,EAAImvE,EAAoBnvE,IAAM,EAAIgyD,GAAahyD,EACtE8rD,MAAOoF,IASf6H,EAAM91D,UAAUmsE,cAAgB,WAE5B,IAAIC,EAAW,EAAI76E,KAAKxI,MAAS,EAAGsjF,EAAW,EAAI96E,KAAKvI,OAAU,EAC9DsjF,EAAK/6E,KAAKm9D,sBAAsB,CAAE5tD,EAAG,EAAIsrE,EAASrvE,EAAG,EAAIsvE,IAAYE,EAAKh7E,KAAKm9D,sBAAsB,CAAE5tD,EAAGvP,KAAKxI,MAAQqjF,EAASrvE,EAAG,EAAIsvE,IAAYx9E,EAAI0C,KAAKm9D,sBAAsB,CAAE5tD,EAAG,EAAG/D,EAAGxL,KAAKvI,OAASqjF,IAC/M,MAAO,CACH1iE,GAAI2iE,EAAGxrE,EACP8I,GAAI0iE,EAAGvvE,EACP+M,GAAIyiE,EAAGzrE,EACPiJ,GAAIwiE,EAAGxvE,EACP/T,OAAQujF,EAAGxvE,EAAIlO,EAAEkO,IAUzB+4D,EAAM91D,UAAUymE,sBAAwB,SAAU+F,EAAaC,QAC1C,IAAbA,IAAuBA,EAAW,IACtC,IAAIC,IAAoBD,EAASpe,eAAiBoe,EAAStB,sBAAwBsB,EAASrB,gBACxF3jE,EAASglE,EAAShlE,OAChBglE,EAAShlE,OACTilE,GACI,EAAInkB,EAAQwhB,kBAAkB0C,EAASpe,aAAe98D,KAAKy8D,OAAOpvD,WAAY6tE,EAAStB,oBAAsB55E,KAAKo+D,gBAAiB8c,EAASrB,iBAAmB75E,KAAKy4E,qBAAsByC,EAASjiF,SAAW+G,KAAK04E,WAAW,iBAAmB,GACjP14E,KAAKkW,OACXklE,GAAc,EAAI1K,EAAW2K,cAAcnlE,EAAQ+kE,GACvD,MAAO,CACH1rE,GAAK,EAAI6rE,EAAY7rE,GAAKvP,KAAKxI,MAAS,EACxCgU,GAAK,EAAI4vE,EAAY5vE,GAAKxL,KAAKvI,OAAU,IAUjD8sE,EAAM91D,UAAU0uD,sBAAwB,SAAU8d,EAAaC,QAC1C,IAAbA,IAAuBA,EAAW,IACtC,IAAIC,IAAoBD,EAASpe,eAAiBoe,EAAStB,qBAAuBsB,EAASrB,gBACvFlI,EAAYuJ,EAAShlE,OACnBglE,EAAShlE,OACTilE,GACI,EAAInkB,EAAQwhB,kBAAkB0C,EAASpe,aAAe98D,KAAKy8D,OAAOpvD,WAAY6tE,EAAStB,oBAAsB55E,KAAKo+D,gBAAiB8c,EAASrB,iBAAmB75E,KAAKy4E,qBAAsByC,EAASjiF,SAAW+G,KAAK04E,WAAW,iBAAmB,GAAG,GACpP14E,KAAK2xE,UACX3X,GAAM,EAAI0W,EAAW2K,cAAc1J,EAAW,CAC9CpiE,EAAI0rE,EAAY1rE,EAAIvP,KAAKxI,MAAS,EAAI,EACtCgU,EAAG,EAAKyvE,EAAYzvE,EAAIxL,KAAKvI,OAAU,IAM3C,OAJI8rB,MAAMy2C,EAAIzqD,KACVyqD,EAAIzqD,EAAI,GACRgU,MAAMy2C,EAAIxuD,KACVwuD,EAAIxuD,EAAI,GACLwuD,GAYXuK,EAAM91D,UAAU6nE,gBAAkB,SAAUgF,EAAeJ,GAEvD,YADiB,IAAbA,IAAuBA,EAAW,IAC/Bl7E,KAAK6xE,sBAAsB0J,QAAQv7E,KAAKm9D,sBAAsBme,EAAeJ,KAYxF3W,EAAM91D,UAAUuoE,gBAAkB,SAAUwE,EAAYN,GAEpD,YADiB,IAAbA,IAAuBA,EAAW,IAC/Bl7E,KAAKk1E,sBAAsBl1E,KAAK6xE,sBAAsB2J,GAAaN,IAO9E3W,EAAM91D,UAAUgtE,QAAU,WACtB,OAAO,EAAIzkB,EAAQqhB,aAAar4E,KAAK+M,QAOzCw3D,EAAM91D,UAAUitE,cAAgB,WAC5B,OAAO17E,KAAK4xE,YAOhBrN,EAAM91D,UAAUktE,cAAgB,SAAU/J,GAGtC,OAFA5xE,KAAK4xE,WAAaA,EAClB5xE,KAAKu0E,mBACEv0E,MAOXukE,EAAM91D,UAAUnB,KAAO,WAEnBtN,KAAK2mB,KAAK,QAEV3mB,KAAKgoB,qBAELhoB,KAAKy8D,OAAOjmD,eAAe,UAAWxW,KAAKmxE,gBAAgB1U,QAE3D1rD,OAAOqW,oBAAoB,SAAUpnB,KAAKmxE,gBAAgBiE,cAC1Dp1E,KAAK0zE,YAAYpmE,OACjBtN,KAAK2zE,YAAYrmE,OAEjBtN,KAAKk2E,sBAELl2E,KAAKoxE,SAAW,IAAI1M,EAAWzuE,QAC/B+J,KAAKsxE,cAAgB,GACrBtxE,KAAKuxE,cAAgB,GACrBvxE,KAAKwxE,sBAAwB,GAC7BxxE,KAAKyxE,sBAAwB,GAC7BzxE,KAAKuhE,iBAAiB51D,QAElB3L,KAAKoyE,eACL,EAAIpb,EAAQ+B,aAAa/4D,KAAKoyE,aAC9BpyE,KAAKoyE,YAAc,MAEnBpyE,KAAKqyE,+BACL,EAAIrb,EAAQ+B,aAAa/4D,KAAKqyE,6BAC9BryE,KAAKqyE,4BAA8B,MAIvC,IADA,IAAIzoE,EAAY5J,KAAK4J,UACdA,EAAUgyE,YACbhyE,EAAUiyE,YAAYjyE,EAAUgyE,aASxCrX,EAAM91D,UAAU0mE,UAAY,SAAUnmE,GAClC,OAAOA,EAAOhP,KAAK+xE,iBAgBvBxN,EAAM91D,UAAUqtE,YAAc,WAC1B,OAAO5iB,EAAS,GAAIl5D,KAAKgxE,WAEtBzM,EAp1Ce,CAq1CxBtN,EAAQgC,mBACVpjE,EAAA,QAAkB0uE,sCCp8ClB,IACQ/N,EADJC,EAAaz2D,MAAQA,KAAKy2D,YACtBD,EAAgB,SAAUrgE,EAAGwT,GAI7B,OAHA6sD,EAAgBzsD,OAAOya,gBAClB,CAAEE,UAAW,cAAgBlW,OAAS,SAAUrY,EAAGwT,GAAKxT,EAAEuuB,UAAY/a,IACvE,SAAUxT,EAAGwT,GAAK,IAAK,IAAIF,KAAKE,EAAOI,OAAO0E,UAAU+M,eAAe9M,KAAK/E,EAAGF,KAAItT,EAAEsT,GAAKE,EAAEF,KACzF+sD,EAAcrgE,EAAGwT,IAErB,SAAUxT,EAAGwT,GAChB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIyb,UAAU,uBAAyB0B,OAAOnd,GAAK,iCAE7D,SAAS+sD,IAAO12D,KAAKJ,YAAczJ,EADnCqgE,EAAcrgE,EAAGwT,GAEjBxT,EAAEsY,UAAkB,OAAN9E,EAAaI,OAAOwa,OAAO5a,IAAM+sD,EAAGjoD,UAAY9E,EAAE8E,UAAW,IAAIioD,KAGvF3sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQojE,uBAAoB,EAQ5B,IACIA,EAAmC,SAAU7B,GAE7C,SAAS6B,IACL,IAAI5B,EAAQD,EAAO1oD,KAAK1O,OAASA,KAEjC,OADAq3D,EAAM0kB,WAAa1kB,EACZA,EAEX,OANAZ,EAAUwC,EAAmB7B,GAMtB6B,EAP2B,CADvB,EAAQ,OASZ5yC,cACXxwB,EAAQojE,kBAAoBA,sCClC5B,IAAItC,EAAmB32D,MAAQA,KAAK22D,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExD7sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQmmF,aAAenmF,EAAQ2iE,sBAAmB,EAClD,IAAIyjB,EAAU,EAAQ,OAClBllB,EAAYJ,EAAgB,EAAQ,OACxC9gE,EAAQ2iE,iBAAmB,CACvBC,OAAQ,iBACRE,SAAU,KA+Cd9iE,EAAQmmF,aA1CR,SAAsBjvE,EAAOmvE,EAAS3jB,EAAMvgB,GACxC,IAAItlC,EAAU3I,OAAOiC,OAAO,GAAInW,EAAQ2iE,iBAAkBD,GACtDE,EAAmC,mBAAnB/lD,EAAQ+lD,OAAwB/lD,EAAQ+lD,OAAS1B,EAAU9gE,QAAQyc,EAAQ+lD,QAC3Fn4D,EAAQ+iB,KAAKgQ,MACb8oD,EAAiB,GACrB,IAAK,IAAI9sE,KAAQ6sE,EAAS,CACtB,IAAIE,EAAQF,EAAQ7sE,GAEpB,IAAK,IAAIvC,KADTqvE,EAAe9sE,GAAQ,GACT+sE,EACVD,EAAe9sE,GAAMvC,GAAKC,EAAMsvE,iBAAiBhtE,EAAMvC,GAE/D,IAAIwvE,EAAQ,KACR1hC,EAAO,WACP0hC,EAAQ,KACR,IAAI7yE,GAAK4Z,KAAKgQ,MAAQ/yB,GAASoS,EAAQimD,SACvC,GAAIlvD,GAAK,EAAT,CAEI,IAAK,IAAI4F,KAAQ6sE,EAAS,CACtB,IAAIE,EAAQF,EAAQ7sE,GAEpB,IAAK,IAAIvC,KAAKsvE,EACVrvE,EAAMwO,iBAAiBlM,EAAMvC,EAAGsvE,EAAMtvE,IAEtB,mBAAbkrC,GACPA,QATR,CAaA,IAAK,IAAI3oC,KADT5F,EAAIgvD,EAAOhvD,GACMyyE,EAAS,CAClBE,EAAQF,EAAQ7sE,GAApB,IACI3R,EAAIy+E,EAAe9sE,GACvB,IAAK,IAAIvC,KAAKsvE,EACVrvE,EAAMwO,iBAAiBlM,EAAMvC,EAAGsvE,EAAMtvE,GAAKrD,EAAI/L,EAAEoP,IAAM,EAAIrD,IAEnE6yE,GAAQ,EAAIL,EAAQnjB,cAAcle,KAGtC,OADAA,IACO,WACC0hC,IACA,EAAIL,EAAQljB,aAAaujB,iCCrDrCvyE,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQ0mF,iBAAc,EACtB1mF,EAAQ0mF,YAAc,CAClBC,MAAO,UACPC,OAAQ,UACRC,KAAM,UACNzlF,KAAM,UACN0lF,MAAO,UACPC,OAAQ,UACRC,IAAK,UACLC,OAAQ,UACRC,QAAS,UACTC,MAAO,UACPC,KAAM,UACNC,MAAO,UACPC,OAAQ,UACRC,KAAM,UACNC,KAAM,UACNC,KAAM,UACNC,KAAM,UACNC,SAAU,UACVC,WAAY,UACZC,UAAW,UACXC,SAAU,UACVC,YAAa,UACbC,cAAe,UACfC,kBAAmB,UACnBC,YAAa,UACbC,KAAM,UACNC,aAAc,UACdC,WAAY,UACZC,cAAe,UACfC,YAAa,UACbC,SAAU,UACVC,cAAe,UACfC,cAAe,UACfC,UAAW,UACXC,eAAgB,UAChBC,UAAW,UACXC,UAAW,UACXC,UAAW,UACXC,cAAe,UACfC,gBAAiB,UACjBC,OAAQ,UACRC,eAAgB,UAChBC,UAAW,UACXC,eAAgB,UAChBC,cAAe,UACfC,iBAAkB,UAClBC,QAAS,UACTC,QAAS,UACTC,UAAW,UACXC,UAAW,UACXC,UAAW,UACXC,UAAW,UACXC,eAAgB,UAChBC,eAAgB,UAChBC,gBAAiB,UACjBC,UAAW,UACXC,WAAY,UACZC,WAAY,UACZC,QAAS,UACTC,aAAc,UACdC,WAAY,UACZC,QAAS,UACTC,YAAa,UACbC,YAAa,UACbC,aAAc,UACdC,WAAY,UACZC,aAAc,UACdC,WAAY,UACZC,UAAW,UACXC,WAAY,UACZC,YAAa,UACbC,OAAQ,UACRC,MAAO,UACPC,SAAU,UACVC,SAAU,UACVC,UAAW,UACXC,YAAa,UACbC,cAAe,UACfC,eAAgB,UAChBC,WAAY,UACZC,UAAW,UACXC,cAAe,UACfC,aAAc,UACdC,UAAW,UACXC,UAAW,UACXC,gBAAiB,UACjBC,UAAW,UACXC,KAAM,UACNC,UAAW,UACXC,IAAK,UACLC,UAAW,UACXC,UAAW,UACXC,QAAS,UACTC,OAAQ,UACRC,UAAW,UACXC,cAAe,UACfC,QAAS,UACTC,UAAW,UACXC,KAAM,UACNC,UAAW,UACXC,UAAW,UACXC,SAAU,UACVC,WAAY,UACZC,OAAQ,UACRC,cAAe,UACfC,WAAY,UACZC,MAAO,UACPC,UAAW,UACXC,SAAU,UACVC,MAAO,UACPC,WAAY,UACZC,MAAO,UACPC,MAAO,UACPC,WAAY,UACZC,UAAW,UACXC,WAAY,UACZC,OAAQ,UACRC,aAAc,UACdC,MAAO,UACPC,qBAAsB,UACtBC,QAAS,UACTC,QAAS,UACTC,SAAU,UACVC,UAAW,UACXC,OAAQ,UACRC,QAAS,UACTC,MAAO,UACPC,WAAY,UACZC,YAAa,UACbC,OAAQ,UACRC,UAAW,UACXC,KAAM,UACNC,KAAM,UACNC,UAAW,UACXC,YAAa,UACbC,SAAU,UACVC,OAAQ,UACRC,UAAW,UACXC,eAAgB,UAChBC,WAAY,UACZC,cAAe,UACfC,SAAU,UACVC,SAAU,UACVC,aAAc,UACdC,YAAa,UACbC,KAAM,UACNC,YAAa,UACbC,MAAO,sCCtJX37E,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQ8vF,WAAa9vF,EAAQ+vF,SAAW/vF,EAAQgwF,QAAUhwF,EAAQiwF,eAAiBjwF,EAAQkwF,aAAelwF,EAAQmwF,YAAcnwF,EAAQowF,YAAS,EASjJpwF,EAAQowF,OADK,SAAUn5E,GAAK,OAAOA,GAGnCjX,EAAQmwF,YADU,SAAUl5E,GAAK,OAAOA,EAAIA,GAG5CjX,EAAQkwF,aADW,SAAUj5E,GAAK,OAAOA,GAAK,EAAIA,IAOlDjX,EAAQiwF,eALa,SAAUh5E,GAC3B,OAAKA,GAAK,GAAK,EACJ,GAAMA,EAAIA,GACb,MAASA,GAAKA,EAAI,GAAK,IAInCjX,EAAQgwF,QADM,SAAU/4E,GAAK,OAAOA,EAAIA,EAAIA,GAG5CjX,EAAQ+vF,SADO,SAAU94E,GAAK,QAASA,EAAIA,EAAIA,EAAI,GAOnDjX,EAAQ8vF,WALS,SAAU74E,GACvB,OAAKA,GAAK,GAAK,EACJ,GAAMA,EAAIA,EAAIA,EAClB,KAAQA,GAAK,GAAKA,EAAIA,EAAI,IAGrC,IAAIo5E,EAAU,CACVD,OAAQpwF,EAAQowF,OAChBD,YAAanwF,EAAQmwF,YACrBD,aAAclwF,EAAQkwF,aACtBD,eAAgBjwF,EAAQiwF,eACxBD,QAAShwF,EAAQgwF,QACjBD,SAAU/vF,EAAQ+vF,SAClBD,WAAY9vF,EAAQ8vF,YAExB9vF,EAAA,QAAkBqwF,8BCxClBn8E,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQ6hF,uBAAyB7hF,EAAQwgF,oBAAiB,EAU1DxgF,EAAQwgF,eALR,SAAwBvO,EAAIv4D,EAAG/D,GAC3B,IAAI26E,EAAS,IAAI1jD,WAAW,GAE5B,OADAqlC,EAAGse,WAAW72E,EAAGu4D,EAAGue,oBAAsB76E,EAAG,EAAG,EAAGs8D,EAAGwe,KAAMxe,EAAG8B,cAAeuc,GACvEA,EAAO,GAAK,GA2BvBtwF,EAAQ6hF,uBAnBR,SAAgCnoE,EAAG/D,EAAG+6E,EAAIC,EAAIC,EAAIjkB,EAAI8I,GAIlD,QAAI/7D,EAAIg3E,EAAKjb,GAAa/7D,EAAIk3E,EAAKnb,GAE/B9/D,EAAIg7E,EAAKlb,GAAa9/D,EAAIg3D,EAAK8I,GAE/B/7D,EAAIg3E,EAAKjb,GAAa/7D,EAAIk3E,EAAKnb,GAE/B9/D,EAAIg7E,EAAKlb,GAAa9/D,EAAIg3D,EAAK8I,KAMpBtlE,KAAKC,KAAKwgF,EAAKF,IAAOC,EAAKh7E,IAAM+6E,EAAKh3E,IAAMizD,EAAKgkB,IAAOxgF,KAAK4O,KAAK5O,KAAK2O,IAAI8xE,EAAKF,EAAI,GAAKvgF,KAAK2O,IAAI6tD,EAAKgkB,EAAI,IACxGlb,EAAY,yCClClC,IAAI1N,EAAU59D,MAAQA,KAAK49D,QAAW,SAAUzxD,EAAGrC,GAC/C,IAAItM,EAAsB,mBAAX6mB,QAAyBlY,EAAEkY,OAAOC,UACjD,IAAK9mB,EAAG,OAAO2O,EACf,IAAmB1B,EAAY3N,EAA3BuP,EAAI7O,EAAEkR,KAAKvC,GAAO0xD,EAAK,GAC3B,IACI,WAAc,IAAN/zD,GAAgBA,KAAM,MAAQW,EAAI4B,EAAEiL,QAAQ+Q,MAAMw1C,EAAG7jE,KAAKyQ,EAAEhK,OAExE,MAAOgnB,GAAS3qB,EAAI,CAAE2qB,MAAOA,GAC7B,QACI,IACQhd,IAAMA,EAAE4d,OAAS7qB,EAAI6O,EAAU,SAAI7O,EAAEkR,KAAKrC,GAElD,QAAU,GAAIvP,EAAG,MAAMA,EAAE2qB,OAE7B,OAAOo2C,GAEPlH,EAAmB32D,MAAQA,KAAK22D,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExD7sD,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQ+8E,cAAgB/8E,EAAQs2E,oBAAsBt2E,EAAQ6wF,aAAe7wF,EAAQikF,gBAAkBjkF,EAAQ2iF,iBAAmB3iF,EAAQ8wF,mBAAqB9wF,EAAQ01E,WAAa11E,EAAQ+wF,gBAAkB/wF,EAAQgxF,WAAahxF,EAAQgjF,eAAiBhjF,EAAQi8E,4BAA8Bj8E,EAAQwiF,YAAcxiF,EAAQo8E,cAAgBp8E,EAAQo+E,cAAgBp+E,EAAQkjE,YAAcljE,EAAQijE,aAAejjE,EAAQixF,WAAajxF,EAAQmW,OAASnW,EAAQ07C,mBAAgB,EACnd,IAAIw1C,EAAapwB,EAAgB,EAAQ,QACrC+Z,EAAa,EAAQ,OACrBsW,EAAS,EAAQ,OAQrB,SAASz1C,EAAc9wC,GACnB,MAAwB,iBAAVA,GAAgC,OAAVA,GAAkBA,EAAMb,cAAgBmK,OAEhFlU,EAAQ07C,cAAgBA,EAsBxB17C,EAAQmW,OAdR,SAAgBsC,GAEZ,IADA,IAAIC,EAAU,GACL04E,EAAK,EAAGA,EAAKt4E,UAAU7U,OAAQmtF,IACpC14E,EAAQ04E,EAAK,GAAKt4E,UAAUs4E,GAEhC34E,EAASA,GAAU,GACnB,IAAK,IAAIjC,EAAI,EAAG1B,EAAI4D,EAAQzU,OAAQuS,EAAI1B,EAAG0B,IAAK,CAC5C,IAAIF,EAAIoC,EAAQlC,GACXF,GAELpC,OAAOiC,OAAOsC,EAAQnC,GAE1B,OAAOmC,GA+BXzY,EAAQixF,WArBR,SAASA,EAAWx4E,GAEhB,IADA,IAAIC,EAAU,GACL04E,EAAK,EAAGA,EAAKt4E,UAAU7U,OAAQmtF,IACpC14E,EAAQ04E,EAAK,GAAKt4E,UAAUs4E,GAEhC34E,EAASA,GAAU,GACnB,IAAK,IAAIjC,EAAI,EAAG1B,EAAI4D,EAAQzU,OAAQuS,EAAI1B,EAAG0B,IAAK,CAC5C,IAAIF,EAAIoC,EAAQlC,GAChB,GAAKF,EAEL,IAAK,IAAIW,KAAKX,EACNolC,EAAcplC,EAAEW,IAChBwB,EAAOxB,GAAKg6E,EAAWx4E,EAAOxB,GAAIX,EAAEW,IAGpCwB,EAAOxB,GAAKX,EAAEW,GAI1B,OAAOwB,GAMXzY,EAAQijE,aAAgD,oBAA1BxC,sBACxB,SAAUte,GAAY,OAAOse,sBAAsBte,IACnD,SAAUA,GAAY,OAAOjiC,WAAWiiC,EAAU,IACxDniD,EAAQkjE,YAA8C,oBAAzBxC,qBACvB,SAAU2wB,GAAa,OAAO3wB,qBAAqB2wB,IACnD,SAAUA,GAAa,OAAOpxE,aAAaoxE,IAuBjDrxF,EAAQo+E,cAdR,SAAuB1qC,EAAKt8B,EAAO2J,GAC/B,IAAI0jE,EAAUle,SAAS6X,cAAc1qC,GACrC,GAAIt8B,EACA,IAAK,IAAIH,KAAKG,EACVqtE,EAAQrtE,MAAMH,GAAKG,EAAMH,GAGjC,GAAI8J,EACA,IAAK,IAAI9J,KAAK8J,EACV0jE,EAAQ1qD,aAAa9iB,EAAG8J,EAAW9J,IAG3C,OAAOwtE,GAaXzkF,EAAQo8E,cALR,WACI,YAAuC,IAA5BlhE,OAAOo2E,iBACPp2E,OAAOo2E,iBACX,GA6BXtxF,EAAQwiF,YApBR,SAAqBtrE,GACjB,IAAKA,EAAMrB,MACP,MAAO,CAAE6D,EAAG,CAAC,EAAG,GAAI/D,EAAG,CAAC,EAAG,IAC/B,IAAIwR,EAAO9I,EAAAA,EACP+I,GAAO,IACPC,EAAOhJ,EAAAA,EACPiJ,GAAO,IAYX,OAXApQ,EAAMqC,aAAY,SAAU5E,EAAG8E,GAC3B,IAAIC,EAAID,EAAKC,EAAG/D,EAAI8D,EAAK9D,EACrB+D,EAAIyN,IACJA,EAAOzN,GACPA,EAAI0N,IACJA,EAAO1N,GACP/D,EAAI0R,IACJA,EAAO1R,GACPA,EAAI2R,IACJA,EAAO3R,MAER,CAAE+D,EAAG,CAACyN,EAAMC,GAAOzR,EAAG,CAAC0R,EAAMC,KAgCxCtnB,EAAQi8E,4BA7BR,SAAqCmI,GACjC,IAAIpd,EAAKe,EAAOqc,EAAO1qE,EAAG,GAAI0E,EAAO4oD,EAAG,GAAI1oD,EAAO0oD,EAAG,GAAIkC,EAAKnB,EAAOqc,EAAOzuE,EAAG,GAAI4I,EAAO2qD,EAAG,GAAI1qD,EAAO0qD,EAAG,GACxGzH,EAAQtxD,KAAKuO,IAAIJ,EAAOF,EAAMI,EAAOD,GAAOgzE,GAAMjzE,EAAOF,GAAQ,EAAGozE,GAAMhzE,EAAOD,GAAQ,GAC/E,IAAVkjD,GAAetxD,KAAKC,IAAIqxD,KAAWpjD,EAAAA,GAAYqP,MAAM+zC,MACrDA,EAAQ,GACR/zC,MAAM6jE,KACNA,EAAK,GACL7jE,MAAM8jE,KACNA,EAAK,GACT,IAAIx2E,EAAK,SAAUsE,GACf,MAAO,CACH5F,EAAG,IAAO4F,EAAK5F,EAAI63E,GAAM9vB,EACzB9rD,EAAG,IAAO2J,EAAK3J,EAAI67E,GAAM/vB,IAejC,OAXAzmD,EAAG+nE,QAAU,SAAUzjE,GACnBA,EAAK5F,EAAI,IAAO4F,EAAK5F,EAAI63E,GAAM9vB,EAC/BniD,EAAK3J,EAAI,IAAO2J,EAAK3J,EAAI67E,GAAM/vB,GAEnCzmD,EAAG0qE,QAAU,SAAUpmE,GACnB,MAAO,CACH5F,EAAG63E,EAAK9vB,GAASniD,EAAK5F,EAAI,IAC1B/D,EAAG67E,EAAK/vB,GAASniD,EAAK3J,EAAI,MAGlCqF,EAAGymD,MAAQA,EACJzmD,GAwBXhb,EAAQgjF,eAZR,SAAwBoB,EAAQv2D,EAAQstD,GAEpC,OAAOA,EAAS/+B,MAAK,SAAU90C,EAAGwM,GAC9B,IAAI29E,EAAK5jE,EAAOvmB,IAAM,EAAGoqF,EAAK7jE,EAAO/Z,IAAM,EAC3C,OAAI29E,EAAKC,GACG,EACRD,EAAKC,EACE,EACJ,MAaf,IAAIC,EAAO,IAAIpzB,UAAU,GACrBqzB,EAAQ,IAAInzB,WAAWkzB,EAAKnyE,OAAQ,EAAG,GACvCqyE,EAAU,IAAIx4E,aAAas4E,EAAKnyE,OAAQ,EAAG,GAC3CsyE,EAAkB,iBAClBC,EAAqB,iFACzB,SAASf,EAAWgB,GAChB,IAAIp9E,EAAI,EACJqI,EAAI,EACJnJ,EAAI,EACJxM,EAAI,EAER,GAAe,MAAX0qF,EAAI,GACe,IAAfA,EAAI/tF,QACJ2Q,EAAIsoB,SAAS80D,EAAI/vC,OAAO,GAAK+vC,EAAI/vC,OAAO,GAAI,IAC5ChlC,EAAIigB,SAAS80D,EAAI/vC,OAAO,GAAK+vC,EAAI/vC,OAAO,GAAI,IAC5CnuC,EAAIopB,SAAS80D,EAAI/vC,OAAO,GAAK+vC,EAAI/vC,OAAO,GAAI,MAG5CrtC,EAAIsoB,SAAS80D,EAAI/vC,OAAO,GAAK+vC,EAAI/vC,OAAO,GAAI,IAC5ChlC,EAAIigB,SAAS80D,EAAI/vC,OAAO,GAAK+vC,EAAI/vC,OAAO,GAAI,IAC5CnuC,EAAIopB,SAAS80D,EAAI/vC,OAAO,GAAK+vC,EAAI/vC,OAAO,GAAI,KAE7B,IAAf+vC,EAAI/tF,SACJqD,EAAI41B,SAAS80D,EAAI/vC,OAAO,GAAK+vC,EAAI/vC,OAAO,GAAI,IAAM,UAIrD,GAAI6vC,EAAgB3kF,KAAK6kF,GAAM,CAChC,IAAI1kF,EAAQ0kF,EAAI1kF,MAAMykF,GAClBzkF,IACAsH,GAAKtH,EAAM,GACX2P,GAAK3P,EAAM,GACXwG,GAAKxG,EAAM,GACPA,EAAM,KACNhG,GAAKgG,EAAM,KAGvB,MAAO,CAAEsH,EAAGA,EAAGqI,EAAGA,EAAGnJ,EAAGA,EAAGxM,EAAGA,GAElCtH,EAAQgxF,WAAaA,EACrB,IAAIiB,EAAoB,GACxB,IAAK,IAAIC,KAAaf,EAAOzK,YACzBuL,EAAkBC,GAAaxc,EAAWyb,EAAOzK,YAAYwL,IAE7DD,EAAkBd,EAAOzK,YAAYwL,IAAcD,EAAkBC,GASzE,SAASxc,EAAWsc,GAEhB,QAAsC,IAA3BC,EAAkBD,GACzB,OAAOC,EAAkBD,GAC7B,IAAIG,EAASnB,EAAWgB,GACpBp9E,EAAIu9E,EAAOv9E,EAAGqI,EAAIk1E,EAAOl1E,EAAGnJ,EAAIq+E,EAAOr+E,EACvCxM,EAAI6qF,EAAO7qF,EACfA,EAAS,IAAJA,EAAW,EAChBsqF,EAAM,GAA8C,YAAvCtqF,GAAK,GAAOwM,GAAK,GAAOmJ,GAAK,EAAKrI,GAC/C,IAAIvT,EAAQwwF,EAAQ,GAEpB,OADAI,EAAkBD,GAAO3wF,EAClBA,EAWX,SAASyvF,EAAmB/M,EAAoBC,GAC5C,IAAIoO,EAAgBrO,EAAmBniF,OAASmiF,EAAmBpiF,MAC/D0wF,EAAarO,EAAgBpiF,OAASoiF,EAAgBriF,MAG1D,OAAKywF,EAAgB,GAAKC,EAAa,GAAOD,EAAgB,GAAKC,EAAa,EACrE,EAKJliF,KAAKsO,IAAItO,KAAKuO,IAAI2zE,EAAY,EAAIA,GAAaliF,KAAKuO,IAAI,EAAI0zE,EAAeA,IAlCtFpyF,EAAQ+wF,gBANR,SAAyBiB,GAGrB,IAAIhrB,EAAKgqB,EAFTgB,EAAMb,EAAOzK,YAAYsL,IAAQA,GAEPp9E,EAAIoyD,EAAGpyD,EAAGqI,EAAI+pD,EAAG/pD,EAAGnJ,EAAIkzD,EAAGlzD,EAAGxM,EAAI0/D,EAAG1/D,EAC/D,OAAO,IAAI+R,aAAa,CAACzE,EAAI,IAAKqI,EAAI,IAAKnJ,EAAI,IAAKxM,KAgBxDtH,EAAQ01E,WAAaA,EAsBrB11E,EAAQ8wF,mBAAqBA,EAyB7B9wF,EAAQ2iF,iBApBR,SAA0B5gB,EAAOgiB,EAAoBC,EAAiB5gF,EAASsiF,GAC3E,IAAI5+D,EAAQi7C,EAAMj7C,MAAO26C,EAAQM,EAAMN,MAAO/nD,EAAIqoD,EAAMroD,EAAG/D,EAAIosD,EAAMpsD,EACjEhU,EAAQoiF,EAAmBpiF,MAAOC,EAASmiF,EAAmBniF,OAC9Dye,GAAS,EAAIw6D,EAAWvgC,YACxB8vB,EAAoBj6D,KAAKsO,IAAI9c,EAAOC,GAAU,EAAIwB,EAClD2yE,EAAkB+a,EAAmB/M,EAAoBC,GAa7D,OAZK0B,IAOD,EAAI7K,EAAWlrB,UAAUtvC,GAAQ,EAAIw6D,EAAWtK,YAAW,EAAIsK,EAAWvgC,YAAa5gC,EAAG/D,KAC1F,EAAIklE,EAAWlrB,UAAUtvC,GAAQ,EAAIw6D,EAAWz5D,QAAO,EAAIy5D,EAAWvgC,YAAamnB,KACnF,EAAIoZ,EAAWlrB,UAAUtvC,GAAQ,EAAIw6D,EAAWrK,SAAQ,EAAIqK,EAAWvgC,YAAaxzB,KACpF,EAAI+zD,EAAWlrB,UAAUtvC,GAAQ,EAAIw6D,EAAWz5D,QAAO,EAAIy5D,EAAWvgC,YAAa34C,EAAQyoE,EAAoB,EAAI2L,EAAiBn0E,EAASwoE,EAAoB,EAAI2L,OATrK,EAAI8E,EAAWlrB,UAAUtvC,GAAQ,EAAIw6D,EAAWz5D,QAAO,EAAIy5D,EAAWvgC,YAAkB8vB,EAAoBzoE,EAAzB,EAAkCo0E,EAAsB3L,EAAoBxoE,EAAzB,EAAmCm0E,KACzK,EAAI8E,EAAWlrB,UAAUtvC,GAAQ,EAAIw6D,EAAWrK,SAAQ,EAAIqK,EAAWvgC,aAAcxzB,KACrF,EAAI+zD,EAAWlrB,UAAUtvC,GAAQ,EAAIw6D,EAAWz5D,QAAO,EAAIy5D,EAAWvgC,YAAa,EAAImnB,KACvF,EAAIoZ,EAAWlrB,UAAUtvC,GAAQ,EAAIw6D,EAAWtK,YAAW,EAAIsK,EAAWvgC,aAAc5gC,GAAI/D,KAQzF0K,GAwBXrgB,EAAQikF,gBAJR,SAAyB5jE,EAAQ4mD,EAAa8c,GAC1C,IAAI/c,GAAK,EAAI6T,EAAW2K,cAAcnlE,EAAQ,CAAE3G,EAAGvJ,KAAKiW,IAAI6gD,EAAYngD,OAAQnR,EAAGxF,KAAKkW,IAAI4gD,EAAYngD,QAAU,GAAIpN,EAAIstD,EAAGttD,EAAG/D,EAAIqxD,EAAGrxD,EACvI,OAAO,EAAIxF,KAAK4O,KAAK5O,KAAK2O,IAAIpF,EAAG,GAAKvJ,KAAK2O,IAAInJ,EAAG,IAAMouE,EAAmBpiF,OAW/E3B,EAAQ6wF,aALR,SAAsB5e,EAAIv4D,EAAG/D,EAAGgC,GAC5B,IAAI2H,EAAO3H,GAAS,IAAIi1B,WAAW,GAEnC,OADAqlC,EAAGse,WAAW72E,EAAG/D,EAAG,EAAG,EAAGs8D,EAAGwe,KAAMxe,EAAG8B,cAAez0D,GAC9CA,GAUXtf,EAAQs2E,oBAJR,SAA6BrE,GAEzB,MAD+C,oBAA3BqgB,wBAA0CrgB,aAAcqgB,0BACzDrgB,EAAGsgB,aAAa,2BAiBvCvyF,EAAQ+8E,cAXR,SAAuB7lE,GAEnB,KAAK,EAAIg6E,EAAW9wF,SAAS8W,GACzB,MAAM,IAAIzL,MAAM,kCAEpByL,EAAMqC,aAAY,SAAUuI,EAAKf,GAC7B,IAAKoP,OAAO+d,SAASntB,EAAWrH,KAAOyW,OAAO+d,SAASntB,EAAWpL,GAC9D,MAAM,IAAIlK,MAAM,8BAA8BvH,OAAO4d,EAAK,oGC3XtE5N,OAAO6b,eAAe/vB,EAAS,aAAc,CAAE4K,OAAO,IACtD5K,EAAQwlF,aAAexlF,EAAQ2vD,SAAW3vD,EAAQuwE,UAAYvwE,EAAQwwE,OAASxwE,EAAQohB,MAAQphB,EAAQs6C,cAAW,EAIlHt6C,EAAQs6C,SAHR,WACI,OAAOjhC,aAAagT,GAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IASnDrsB,EAAQohB,MALR,SAAezZ,EAAG+R,EAAG/D,GAGjB,OAFAhO,EAAE,GAAK+R,EACP/R,EAAE,GAAkB,iBAANgO,EAAiBA,EAAI+D,EAC5B/R,GAWX3H,EAAQwwE,OARR,SAAgB7oE,EAAGiN,GACf,IAAI/M,EAAIsI,KAAKkW,IAAIzR,GAAIC,EAAI1E,KAAKiW,IAAIxR,GAKlC,OAJAjN,EAAE,GAAKkN,EACPlN,EAAE,GAAKE,EACPF,EAAE,IAAME,EACRF,EAAE,GAAKkN,EACAlN,GAQX3H,EAAQuwE,UALR,SAAmB5oE,EAAG+R,EAAG/D,GAGrB,OAFAhO,EAAE,GAAK+R,EACP/R,EAAE,GAAKgO,EACAhO,GAqBX3H,EAAQ2vD,SAlBR,SAAkBroD,EAAGwM,GACjB,IAAI0+E,EAAMlrF,EAAE,GAAImrF,EAAMnrF,EAAE,GAAIorF,EAAMprF,EAAE,GAChCqrF,EAAMrrF,EAAE,GAAIsrF,EAAMtrF,EAAE,GAAIurF,EAAMvrF,EAAE,GAChCwrF,EAAMxrF,EAAE,GAAIyrF,EAAMzrF,EAAE,GAAI0rF,EAAM1rF,EAAE,GAChC2rF,EAAMn/E,EAAE,GAAIo/E,EAAMp/E,EAAE,GAAIq/E,EAAMr/E,EAAE,GAChCs/E,EAAMt/E,EAAE,GAAIu/E,EAAMv/E,EAAE,GAAIw/E,EAAMx/E,EAAE,GAChCy/E,EAAMz/E,EAAE,GAAI0/E,EAAM1/E,EAAE,GAAI2/E,EAAM3/E,EAAE,GAUpC,OATAxM,EAAE,GAAK2rF,EAAMT,EAAMU,EAAMP,EAAMQ,EAAML,EACrCxrF,EAAE,GAAK2rF,EAAMR,EAAMS,EAAMN,EAAMO,EAAMJ,EACrCzrF,EAAE,GAAK2rF,EAAMP,EAAMQ,EAAML,EAAMM,EAAMH,EACrC1rF,EAAE,GAAK8rF,EAAMZ,EAAMa,EAAMV,EAAMW,EAAMR,EACrCxrF,EAAE,GAAK8rF,EAAMX,EAAMY,EAAMT,EAAMU,EAAMP,EACrCzrF,EAAE,GAAK8rF,EAAMV,EAAMW,EAAMR,EAAMS,EAAMN,EACrC1rF,EAAE,GAAKisF,EAAMf,EAAMgB,EAAMb,EAAMc,EAAMX,EACrCxrF,EAAE,GAAKisF,EAAMd,EAAMe,EAAMZ,EAAMa,EAAMV,EACrCzrF,EAAE,GAAKisF,EAAMb,EAAMc,EAAMX,EAAMY,EAAMT,EAC9B1rF,GAeXtH,EAAQwlF,aAZR,SAAsBl+E,EAAGwM,EAAGif,QACd,IAANA,IAAgBA,EAAI,GACxB,IAAIy/D,EAAMlrF,EAAE,GACRmrF,EAAMnrF,EAAE,GACRqrF,EAAMrrF,EAAE,GACRsrF,EAAMtrF,EAAE,GACRwrF,EAAMxrF,EAAE,GACRyrF,EAAMzrF,EAAE,GACRosF,EAAK5/E,EAAE4F,EACPi6E,EAAK7/E,EAAE6B,EACX,MAAO,CAAE+D,EAAGg6E,EAAKlB,EAAMmB,EAAKhB,EAAMG,EAAM//D,EAAGpd,EAAG+9E,EAAKjB,EAAMkB,EAAKf,EAAMG,EAAMhgE","sources":["webpack://@reltio/remotes/../../node_modules/@mui/icons-material/ArrowDownward.js","webpack://@reltio/remotes/../../node_modules/@mui/icons-material/ArrowUpward.js","webpack://@reltio/remotes/../../node_modules/@mui/icons-material/FilterList.js","webpack://@reltio/remotes/../../node_modules/@mui/icons-material/InfoOutlined.js","webpack://@reltio/remotes/../../node_modules/@mui/icons-material/InfoRounded.js","webpack://@reltio/remotes/../../node_modules/@mui/icons-material/MyLocation.js","webpack://@reltio/remotes/../../node_modules/@mui/icons-material/Remove.js","webpack://@reltio/remotes/../../node_modules/@mui/material/internal/svg-icons/MoreHoriz.js","webpack://@reltio/remotes/../../node_modules/@mui/material/Breadcrumbs/BreadcrumbCollapsed.js","webpack://@reltio/remotes/../../node_modules/@mui/material/Breadcrumbs/Breadcrumbs.js","webpack://@reltio/remotes/../../node_modules/@mui/material/Breadcrumbs/breadcrumbsClasses.js","webpack://@reltio/remotes/../../node_modules/@mui/x-date-pickers/AdapterMoment/AdapterMoment.js","webpack://@reltio/remotes/../../node_modules/@react-sigma/core/lib/react-sigma_core.esm.min.js","webpack://@reltio/remotes/../../node_modules/@yomguithereal/helpers/extend.js","webpack://@reltio/remotes/../../node_modules/graphology-layout-forceatlas2/defaults.js","webpack://@reltio/remotes/../../node_modules/graphology-layout-forceatlas2/helpers.js","webpack://@reltio/remotes/../../node_modules/graphology-layout-forceatlas2/index.js","webpack://@reltio/remotes/../../node_modules/graphology-layout-forceatlas2/iterate.js","webpack://@reltio/remotes/../../node_modules/graphology-layout-forceatlas2/webworker.js","webpack://@reltio/remotes/../../node_modules/graphology-layout-forceatlas2/worker.js","webpack://@reltio/remotes/../../node_modules/graphology-layout/circlepack.js","webpack://@reltio/remotes/../../node_modules/graphology-layout/circular.js","webpack://@reltio/remotes/../../node_modules/graphology-layout/index.js","webpack://@reltio/remotes/../../node_modules/graphology-layout/random.js","webpack://@reltio/remotes/../../node_modules/graphology-layout/rotation.js","webpack://@reltio/remotes/../../node_modules/graphology-operators/disjoint-union.js","webpack://@reltio/remotes/../../node_modules/graphology-operators/index.js","webpack://@reltio/remotes/../../node_modules/graphology-operators/reverse.js","webpack://@reltio/remotes/../../node_modules/graphology-operators/subgraph.js","webpack://@reltio/remotes/../../node_modules/graphology-operators/to-directed.js","webpack://@reltio/remotes/../../node_modules/graphology-operators/to-mixed.js","webpack://@reltio/remotes/../../node_modules/graphology-operators/to-multi.js","webpack://@reltio/remotes/../../node_modules/graphology-operators/to-simple.js","webpack://@reltio/remotes/../../node_modules/graphology-operators/to-undirected.js","webpack://@reltio/remotes/../../node_modules/graphology-operators/union.js","webpack://@reltio/remotes/../../node_modules/graphology-shortest-path/dijkstra.js","webpack://@reltio/remotes/../../node_modules/graphology-shortest-path/index.js","webpack://@reltio/remotes/../../node_modules/graphology-shortest-path/unweighted.js","webpack://@reltio/remotes/../../node_modules/graphology-shortest-path/utils.js","webpack://@reltio/remotes/../../node_modules/graphology-utils/add-edge.js","webpack://@reltio/remotes/../../node_modules/graphology-utils/add-node.js","webpack://@reltio/remotes/../../node_modules/graphology-utils/defaults.js","webpack://@reltio/remotes/../../node_modules/graphology-utils/getters.js","webpack://@reltio/remotes/../../node_modules/graphology-utils/is-graph.js","webpack://@reltio/remotes/../../node_modules/graphology/dist/graphology.umd.min.js","webpack://@reltio/remotes/../../node_modules/lodash.throttle/index.js","webpack://@reltio/remotes/../../node_modules/lodash/lodash.js","webpack://@reltio/remotes/../../node_modules/mnemonist/heap.js","webpack://@reltio/remotes/../../node_modules/mnemonist/queue.js","webpack://@reltio/remotes/../../node_modules/mnemonist/utils/comparators.js","webpack://@reltio/remotes/../../node_modules/mnemonist/utils/iterables.js","webpack://@reltio/remotes/../../node_modules/mnemonist/utils/typed-arrays.js","webpack://@reltio/remotes/../../node_modules/obliterator/foreach.js","webpack://@reltio/remotes/../../node_modules/obliterator/iterator.js","webpack://@reltio/remotes/../../node_modules/obliterator/support.js","webpack://@reltio/remotes/../../node_modules/pandemonium/random.js","webpack://@reltio/remotes/../../node_modules/pandemonium/shuffle-in-place.js","webpack://@reltio/remotes/../../node_modules/performance-now/lib/performance-now.js","webpack://@reltio/remotes/../../node_modules/raf/index.js","webpack://@reltio/remotes/../../node_modules/sigma/core/camera.js","webpack://@reltio/remotes/../../node_modules/sigma/core/captors/captor.js","webpack://@reltio/remotes/../../node_modules/sigma/core/captors/mouse.js","webpack://@reltio/remotes/../../node_modules/sigma/core/captors/touch.js","webpack://@reltio/remotes/../../node_modules/sigma/core/labels.js","webpack://@reltio/remotes/../../node_modules/sigma/core/quadtree.js","webpack://@reltio/remotes/../../node_modules/sigma/index.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/canvas/edge-label.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/canvas/hover.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/canvas/label.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/programs/common/edge.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/programs/common/node.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/programs/common/program.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/programs/edge.arrow.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/programs/edge.arrowHead.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/programs/edge.clamped.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/programs/edge.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/programs/node.fast.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/shaders/edge.arrowHead.frag.glsl.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/shaders/edge.arrowHead.vert.glsl.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/shaders/edge.clamped.vert.glsl.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/shaders/edge.frag.glsl.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/shaders/edge.vert.glsl.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/shaders/node.fast.frag.glsl.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/shaders/node.fast.vert.glsl.js","webpack://@reltio/remotes/../../node_modules/sigma/rendering/webgl/shaders/utils.js","webpack://@reltio/remotes/../../node_modules/sigma/settings.js","webpack://@reltio/remotes/../../node_modules/sigma/sigma.js","webpack://@reltio/remotes/../../node_modules/sigma/types.js","webpack://@reltio/remotes/../../node_modules/sigma/utils/animate.js","webpack://@reltio/remotes/../../node_modules/sigma/utils/data.js","webpack://@reltio/remotes/../../node_modules/sigma/utils/easings.js","webpack://@reltio/remotes/../../node_modules/sigma/utils/edge-collisions.js","webpack://@reltio/remotes/../../node_modules/sigma/utils/index.js","webpack://@reltio/remotes/../../node_modules/sigma/utils/matrices.js"],"sourcesContent":["\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.default = void 0;\nvar _createSvgIcon = _interopRequireDefault(require(\"./utils/createSvgIcon\"));\nvar _jsxRuntime = require(\"react/jsx-runtime\");\nvar _default = (0, _createSvgIcon.default)( /*#__PURE__*/(0, _jsxRuntime.jsx)(\"path\", {\n  d: \"m20 12-1.41-1.41L13 16.17V4h-2v12.17l-5.58-5.59L4 12l8 8 8-8z\"\n}), 'ArrowDownward');\nexports.default = _default;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.default = void 0;\nvar _createSvgIcon = _interopRequireDefault(require(\"./utils/createSvgIcon\"));\nvar _jsxRuntime = require(\"react/jsx-runtime\");\nvar _default = (0, _createSvgIcon.default)( /*#__PURE__*/(0, _jsxRuntime.jsx)(\"path\", {\n  d: \"m4 12 1.41 1.41L11 7.83V20h2V7.83l5.58 5.59L20 12l-8-8-8 8z\"\n}), 'ArrowUpward');\nexports.default = _default;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.default = void 0;\nvar _createSvgIcon = _interopRequireDefault(require(\"./utils/createSvgIcon\"));\nvar _jsxRuntime = require(\"react/jsx-runtime\");\nvar _default = (0, _createSvgIcon.default)( /*#__PURE__*/(0, _jsxRuntime.jsx)(\"path\", {\n  d: \"M10 18h4v-2h-4v2zM3 6v2h18V6H3zm3 7h12v-2H6v2z\"\n}), 'FilterList');\nexports.default = _default;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.default = void 0;\nvar _createSvgIcon = _interopRequireDefault(require(\"./utils/createSvgIcon\"));\nvar _jsxRuntime = require(\"react/jsx-runtime\");\nvar _default = (0, _createSvgIcon.default)( /*#__PURE__*/(0, _jsxRuntime.jsx)(\"path\", {\n  d: \"M11 7h2v2h-2zm0 4h2v6h-2zm1-9C6.48 2 2 6.48 2 12s4.48 10 10 10 10-4.48 10-10S17.52 2 12 2zm0 18c-4.41 0-8-3.59-8-8s3.59-8 8-8 8 3.59 8 8-3.59 8-8 8z\"\n}), 'InfoOutlined');\nexports.default = _default;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.default = void 0;\nvar _createSvgIcon = _interopRequireDefault(require(\"./utils/createSvgIcon\"));\nvar _jsxRuntime = require(\"react/jsx-runtime\");\nvar _default = (0, _createSvgIcon.default)( /*#__PURE__*/(0, _jsxRuntime.jsx)(\"path\", {\n  d: \"M12 2C6.48 2 2 6.48 2 12s4.48 10 10 10 10-4.48 10-10S17.52 2 12 2zm0 15c-.55 0-1-.45-1-1v-4c0-.55.45-1 1-1s1 .45 1 1v4c0 .55-.45 1-1 1zm1-8h-2V7h2v2z\"\n}), 'InfoRounded');\nexports.default = _default;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.default = void 0;\nvar _createSvgIcon = _interopRequireDefault(require(\"./utils/createSvgIcon\"));\nvar _jsxRuntime = require(\"react/jsx-runtime\");\nvar _default = (0, _createSvgIcon.default)( /*#__PURE__*/(0, _jsxRuntime.jsx)(\"path\", {\n  d: \"M12 8c-2.21 0-4 1.79-4 4s1.79 4 4 4 4-1.79 4-4-1.79-4-4-4zm8.94 3c-.46-4.17-3.77-7.48-7.94-7.94V1h-2v2.06C6.83 3.52 3.52 6.83 3.06 11H1v2h2.06c.46 4.17 3.77 7.48 7.94 7.94V23h2v-2.06c4.17-.46 7.48-3.77 7.94-7.94H23v-2h-2.06zM12 19c-3.87 0-7-3.13-7-7s3.13-7 7-7 7 3.13 7 7-3.13 7-7 7z\"\n}), 'MyLocation');\nexports.default = _default;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.default = void 0;\nvar _createSvgIcon = _interopRequireDefault(require(\"./utils/createSvgIcon\"));\nvar _jsxRuntime = require(\"react/jsx-runtime\");\nvar _default = (0, _createSvgIcon.default)( /*#__PURE__*/(0, _jsxRuntime.jsx)(\"path\", {\n  d: \"M19 13H5v-2h14v2z\"\n}), 'Remove');\nexports.default = _default;","import * as React from 'react';\nimport createSvgIcon from '../../utils/createSvgIcon';\n\n/**\n * @ignore - internal component.\n */\nimport { jsx as _jsx } from \"react/jsx-runtime\";\nexport default createSvgIcon( /*#__PURE__*/_jsx(\"path\", {\n  d: \"M6 10c-1.1 0-2 .9-2 2s.9 2 2 2 2-.9 2-2-.9-2-2-2zm12 0c-1.1 0-2 .9-2 2s.9 2 2 2 2-.9 2-2-.9-2-2-2zm-6 0c-1.1 0-2 .9-2 2s.9 2 2 2 2-.9 2-2-.9-2-2-2z\"\n}), 'MoreHoriz');","import _objectWithoutPropertiesLoose from \"@babel/runtime/helpers/esm/objectWithoutPropertiesLoose\";\nimport _extends from \"@babel/runtime/helpers/esm/extends\";\nconst _excluded = [\"slots\", \"slotProps\"];\nimport * as React from 'react';\nimport PropTypes from 'prop-types';\nimport { emphasize } from '@mui/system';\nimport styled from '../styles/styled';\nimport MoreHorizIcon from '../internal/svg-icons/MoreHoriz';\nimport ButtonBase from '../ButtonBase';\nimport { jsx as _jsx } from \"react/jsx-runtime\";\nconst BreadcrumbCollapsedButton = styled(ButtonBase)(({\n  theme\n}) => _extends({\n  display: 'flex',\n  marginLeft: `calc(${theme.spacing(1)} * 0.5)`,\n  marginRight: `calc(${theme.spacing(1)} * 0.5)`\n}, theme.palette.mode === 'light' ? {\n  backgroundColor: theme.palette.grey[100],\n  color: theme.palette.grey[700]\n} : {\n  backgroundColor: theme.palette.grey[700],\n  color: theme.palette.grey[100]\n}, {\n  borderRadius: 2,\n  '&:hover, &:focus': _extends({}, theme.palette.mode === 'light' ? {\n    backgroundColor: theme.palette.grey[200]\n  } : {\n    backgroundColor: theme.palette.grey[600]\n  }),\n  '&:active': _extends({\n    boxShadow: theme.shadows[0]\n  }, theme.palette.mode === 'light' ? {\n    backgroundColor: emphasize(theme.palette.grey[200], 0.12)\n  } : {\n    backgroundColor: emphasize(theme.palette.grey[600], 0.12)\n  })\n}));\nconst BreadcrumbCollapsedIcon = styled(MoreHorizIcon)({\n  width: 24,\n  height: 16\n});\n\n/**\n * @ignore - internal component.\n */\nfunction BreadcrumbCollapsed(props) {\n  const {\n      slots = {},\n      slotProps = {}\n    } = props,\n    otherProps = _objectWithoutPropertiesLoose(props, _excluded);\n  const ownerState = props;\n  return /*#__PURE__*/_jsx(\"li\", {\n    children: /*#__PURE__*/_jsx(BreadcrumbCollapsedButton, _extends({\n      focusRipple: true\n    }, otherProps, {\n      ownerState: ownerState,\n      children: /*#__PURE__*/_jsx(BreadcrumbCollapsedIcon, _extends({\n        as: slots.CollapsedIcon,\n        ownerState: ownerState\n      }, slotProps.collapsedIcon))\n    }))\n  });\n}\nprocess.env.NODE_ENV !== \"production\" ? BreadcrumbCollapsed.propTypes = {\n  /**\n   * The props used for the CollapsedIcon slot.\n   * @default {}\n   */\n  slotProps: PropTypes.shape({\n    collapsedIcon: PropTypes.oneOfType([PropTypes.func, PropTypes.object])\n  }),\n  /**\n   * The components used for each slot inside the BreadcumbCollapsed.\n   * Either a string to use a HTML element or a component.\n   * @default {}\n   */\n  slots: PropTypes.shape({\n    CollapsedIcon: PropTypes.elementType\n  }),\n  /**\n   * The system prop that allows defining system overrides as well as additional CSS styles.\n   */\n  sx: PropTypes.object\n} : void 0;\nexport default BreadcrumbCollapsed;","import _extends from \"@babel/runtime/helpers/esm/extends\";\nimport _objectWithoutPropertiesLoose from \"@babel/runtime/helpers/esm/objectWithoutPropertiesLoose\";\nconst _excluded = [\"children\", \"className\", \"component\", \"slots\", \"slotProps\", \"expandText\", \"itemsAfterCollapse\", \"itemsBeforeCollapse\", \"maxItems\", \"separator\"];\nimport * as React from 'react';\nimport { isFragment } from 'react-is';\nimport PropTypes from 'prop-types';\nimport clsx from 'clsx';\nimport { integerPropType } from '@mui/utils';\nimport { unstable_composeClasses as composeClasses, useSlotProps } from '@mui/base';\nimport styled from '../styles/styled';\nimport useThemeProps from '../styles/useThemeProps';\nimport Typography from '../Typography';\nimport BreadcrumbCollapsed from './BreadcrumbCollapsed';\nimport breadcrumbsClasses, { getBreadcrumbsUtilityClass } from './breadcrumbsClasses';\nimport { jsx as _jsx } from \"react/jsx-runtime\";\nconst useUtilityClasses = ownerState => {\n  const {\n    classes\n  } = ownerState;\n  const slots = {\n    root: ['root'],\n    li: ['li'],\n    ol: ['ol'],\n    separator: ['separator']\n  };\n  return composeClasses(slots, getBreadcrumbsUtilityClass, classes);\n};\nconst BreadcrumbsRoot = styled(Typography, {\n  name: 'MuiBreadcrumbs',\n  slot: 'Root',\n  overridesResolver: (props, styles) => {\n    return [{\n      [`& .${breadcrumbsClasses.li}`]: styles.li\n    }, styles.root];\n  }\n})({});\nconst BreadcrumbsOl = styled('ol', {\n  name: 'MuiBreadcrumbs',\n  slot: 'Ol',\n  overridesResolver: (props, styles) => styles.ol\n})({\n  display: 'flex',\n  flexWrap: 'wrap',\n  alignItems: 'center',\n  padding: 0,\n  margin: 0,\n  listStyle: 'none'\n});\nconst BreadcrumbsSeparator = styled('li', {\n  name: 'MuiBreadcrumbs',\n  slot: 'Separator',\n  overridesResolver: (props, styles) => styles.separator\n})({\n  display: 'flex',\n  userSelect: 'none',\n  marginLeft: 8,\n  marginRight: 8\n});\nfunction insertSeparators(items, className, separator, ownerState) {\n  return items.reduce((acc, current, index) => {\n    if (index < items.length - 1) {\n      acc = acc.concat(current, /*#__PURE__*/_jsx(BreadcrumbsSeparator, {\n        \"aria-hidden\": true,\n        className: className,\n        ownerState: ownerState,\n        children: separator\n      }, `separator-${index}`));\n    } else {\n      acc.push(current);\n    }\n    return acc;\n  }, []);\n}\nconst Breadcrumbs = /*#__PURE__*/React.forwardRef(function Breadcrumbs(inProps, ref) {\n  const props = useThemeProps({\n    props: inProps,\n    name: 'MuiBreadcrumbs'\n  });\n  const {\n      children,\n      className,\n      component = 'nav',\n      slots = {},\n      slotProps = {},\n      expandText = 'Show path',\n      itemsAfterCollapse = 1,\n      itemsBeforeCollapse = 1,\n      maxItems = 8,\n      separator = '/'\n    } = props,\n    other = _objectWithoutPropertiesLoose(props, _excluded);\n  const [expanded, setExpanded] = React.useState(false);\n  const ownerState = _extends({}, props, {\n    component,\n    expanded,\n    expandText,\n    itemsAfterCollapse,\n    itemsBeforeCollapse,\n    maxItems,\n    separator\n  });\n  const classes = useUtilityClasses(ownerState);\n  const collapsedIconSlotProps = useSlotProps({\n    elementType: slots.CollapsedIcon,\n    externalSlotProps: slotProps.collapsedIcon,\n    ownerState\n  });\n  const listRef = React.useRef(null);\n  const renderItemsBeforeAndAfter = allItems => {\n    const handleClickExpand = () => {\n      setExpanded(true);\n\n      // The clicked element received the focus but gets removed from the DOM.\n      // Let's keep the focus in the component after expanding.\n      // Moving it to the <ol> or <nav> does not cause any announcement in NVDA.\n      // By moving it to some link/button at least we have some announcement.\n      const focusable = listRef.current.querySelector('a[href],button,[tabindex]');\n      if (focusable) {\n        focusable.focus();\n      }\n    };\n\n    // This defends against someone passing weird input, to ensure that if all\n    // items would be shown anyway, we just show all items without the EllipsisItem\n    if (itemsBeforeCollapse + itemsAfterCollapse >= allItems.length) {\n      if (process.env.NODE_ENV !== 'production') {\n        console.error(['MUI: You have provided an invalid combination of props to the Breadcrumbs.', `itemsAfterCollapse={${itemsAfterCollapse}} + itemsBeforeCollapse={${itemsBeforeCollapse}} >= maxItems={${maxItems}}`].join('\\n'));\n      }\n      return allItems;\n    }\n    return [...allItems.slice(0, itemsBeforeCollapse), /*#__PURE__*/_jsx(BreadcrumbCollapsed, {\n      \"aria-label\": expandText,\n      slots: {\n        CollapsedIcon: slots.CollapsedIcon\n      },\n      slotProps: {\n        collapsedIcon: collapsedIconSlotProps\n      },\n      onClick: handleClickExpand\n    }, \"ellipsis\"), ...allItems.slice(allItems.length - itemsAfterCollapse, allItems.length)];\n  };\n  const allItems = React.Children.toArray(children).filter(child => {\n    if (process.env.NODE_ENV !== 'production') {\n      if (isFragment(child)) {\n        console.error([\"MUI: The Breadcrumbs component doesn't accept a Fragment as a child.\", 'Consider providing an array instead.'].join('\\n'));\n      }\n    }\n    return /*#__PURE__*/React.isValidElement(child);\n  }).map((child, index) => /*#__PURE__*/_jsx(\"li\", {\n    className: classes.li,\n    children: child\n  }, `child-${index}`));\n  return /*#__PURE__*/_jsx(BreadcrumbsRoot, _extends({\n    ref: ref,\n    component: component,\n    color: \"text.secondary\",\n    className: clsx(classes.root, className),\n    ownerState: ownerState\n  }, other, {\n    children: /*#__PURE__*/_jsx(BreadcrumbsOl, {\n      className: classes.ol,\n      ref: listRef,\n      ownerState: ownerState,\n      children: insertSeparators(expanded || maxItems && allItems.length <= maxItems ? allItems : renderItemsBeforeAndAfter(allItems), classes.separator, separator, ownerState)\n    })\n  }));\n});\nprocess.env.NODE_ENV !== \"production\" ? Breadcrumbs.propTypes /* remove-proptypes */ = {\n  // ----------------------------- Warning --------------------------------\n  // | These PropTypes are generated from the TypeScript type definitions |\n  // |     To update them edit the d.ts file and run \"yarn proptypes\"     |\n  // ----------------------------------------------------------------------\n  /**\n   * The content of the component.\n   */\n  children: PropTypes.node,\n  /**\n   * Override or extend the styles applied to the component.\n   */\n  classes: PropTypes.object,\n  /**\n   * @ignore\n   */\n  className: PropTypes.string,\n  /**\n   * The component used for the root node.\n   * Either a string to use a HTML element or a component.\n   */\n  component: PropTypes.elementType,\n  /**\n   * Override the default label for the expand button.\n   *\n   * For localization purposes, you can use the provided [translations](/material-ui/guides/localization/).\n   * @default 'Show path'\n   */\n  expandText: PropTypes.string,\n  /**\n   * If max items is exceeded, the number of items to show after the ellipsis.\n   * @default 1\n   */\n  itemsAfterCollapse: integerPropType,\n  /**\n   * If max items is exceeded, the number of items to show before the ellipsis.\n   * @default 1\n   */\n  itemsBeforeCollapse: integerPropType,\n  /**\n   * Specifies the maximum number of breadcrumbs to display. When there are more\n   * than the maximum number, only the first `itemsBeforeCollapse` and last `itemsAfterCollapse`\n   * will be shown, with an ellipsis in between.\n   * @default 8\n   */\n  maxItems: integerPropType,\n  /**\n   * Custom separator node.\n   * @default '/'\n   */\n  separator: PropTypes.node,\n  /**\n   * The props used for each slot inside the Breadcumb.\n   * @default {}\n   */\n  slotProps: PropTypes.shape({\n    collapsedIcon: PropTypes.oneOfType([PropTypes.func, PropTypes.object])\n  }),\n  /**\n   * The components used for each slot inside the Breadcumb.\n   * Either a string to use a HTML element or a component.\n   * @default {}\n   */\n  slots: PropTypes.shape({\n    CollapsedIcon: PropTypes.elementType\n  }),\n  /**\n   * The system prop that allows defining system overrides as well as additional CSS styles.\n   */\n  sx: PropTypes.oneOfType([PropTypes.arrayOf(PropTypes.oneOfType([PropTypes.func, PropTypes.object, PropTypes.bool])), PropTypes.func, PropTypes.object])\n} : void 0;\nexport default Breadcrumbs;","import { unstable_generateUtilityClasses as generateUtilityClasses } from '@mui/utils';\nimport generateUtilityClass from '../generateUtilityClass';\nexport function getBreadcrumbsUtilityClass(slot) {\n  return generateUtilityClass('MuiBreadcrumbs', slot);\n}\nconst breadcrumbsClasses = generateUtilityClasses('MuiBreadcrumbs', ['root', 'ol', 'li', 'separator']);\nexport default breadcrumbsClasses;","import _extends from \"@babel/runtime/helpers/esm/extends\";\n/* eslint-disable class-methods-use-this */\nimport defaultMoment from 'moment';\n// From https://momentjs.com/docs/#/displaying/format/\nconst formatTokenMap = {\n  // Year\n  Y: 'year',\n  YY: 'year',\n  YYYY: 'year',\n  // Month\n  M: {\n    sectionType: 'month',\n    contentType: 'digit',\n    maxLength: 2\n  },\n  MM: 'month',\n  MMM: {\n    sectionType: 'month',\n    contentType: 'letter'\n  },\n  MMMM: {\n    sectionType: 'month',\n    contentType: 'letter'\n  },\n  // Day of the month\n  D: {\n    sectionType: 'day',\n    contentType: 'digit',\n    maxLength: 2\n  },\n  DD: 'day',\n  Do: {\n    sectionType: 'day',\n    contentType: 'digit-with-letter'\n  },\n  // Day of the week\n  E: {\n    sectionType: 'weekDay',\n    contentType: 'digit',\n    maxLength: 1\n  },\n  e: {\n    sectionType: 'weekDay',\n    contentType: 'digit',\n    maxLength: 1\n  },\n  d: {\n    sectionType: 'weekDay',\n    contentType: 'digit',\n    maxLength: 1\n  },\n  dd: {\n    sectionType: 'weekDay',\n    contentType: 'letter'\n  },\n  ddd: {\n    sectionType: 'weekDay',\n    contentType: 'letter'\n  },\n  dddd: {\n    sectionType: 'weekDay',\n    contentType: 'letter'\n  },\n  // Meridiem\n  A: 'meridiem',\n  a: 'meridiem',\n  // Hours\n  H: {\n    sectionType: 'hours',\n    contentType: 'digit',\n    maxLength: 2\n  },\n  HH: 'hours',\n  h: {\n    sectionType: 'hours',\n    contentType: 'digit',\n    maxLength: 2\n  },\n  hh: 'hours',\n  // Minutes\n  m: {\n    sectionType: 'minutes',\n    contentType: 'digit',\n    maxLength: 2\n  },\n  mm: 'minutes',\n  // Seconds\n  s: {\n    sectionType: 'seconds',\n    contentType: 'digit',\n    maxLength: 2\n  },\n  ss: 'seconds'\n};\nconst defaultFormats = {\n  year: 'YYYY',\n  month: 'MMMM',\n  monthShort: 'MMM',\n  dayOfMonth: 'D',\n  weekday: 'dddd',\n  weekdayShort: 'ddd',\n  hours24h: 'HH',\n  hours12h: 'hh',\n  meridiem: 'A',\n  minutes: 'mm',\n  seconds: 'ss',\n  fullDate: 'll',\n  fullDateWithWeekday: 'dddd, LL',\n  keyboardDate: 'L',\n  shortDate: 'MMM D',\n  normalDate: 'D MMMM',\n  normalDateWithWeekday: 'ddd, MMM D',\n  monthAndYear: 'MMMM YYYY',\n  monthAndDate: 'MMMM D',\n  fullTime: 'LT',\n  fullTime12h: 'hh:mm A',\n  fullTime24h: 'HH:mm',\n  fullDateTime: 'lll',\n  fullDateTime12h: 'll hh:mm A',\n  fullDateTime24h: 'll HH:mm',\n  keyboardDateTime: 'L LT',\n  keyboardDateTime12h: 'L hh:mm A',\n  keyboardDateTime24h: 'L HH:mm'\n};\nconst MISSING_TIMEZONE_PLUGIN = ['Missing timezone plugin', 'To be able to use timezones, you have to pass the default export from `moment-timezone` to the `dateLibInstance` prop of `LocalizationProvider`', 'Find more information on https://mui.com/x/react-date-pickers/timezone/#moment-and-timezone'].join('\\n');\n\n/**\n * Based on `@date-io/moment`\n *\n * MIT License\n *\n * Copyright (c) 2017 Dmitriy Kovalenko\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\nexport class AdapterMoment {\n  constructor({\n    locale,\n    formats,\n    instance\n  } = {}) {\n    this.isMUIAdapter = true;\n    this.isTimezoneCompatible = true;\n    this.lib = 'moment';\n    this.moment = void 0;\n    this.locale = void 0;\n    this.formats = void 0;\n    this.escapedCharacters = {\n      start: '[',\n      end: ']'\n    };\n    this.formatTokenMap = formatTokenMap;\n    this.setLocaleToValue = value => {\n      const expectedLocale = this.getCurrentLocaleCode();\n      if (expectedLocale === value.locale()) {\n        return value;\n      }\n      return value.locale(expectedLocale);\n    };\n    this.hasTimezonePlugin = () => typeof this.moment.tz !== 'undefined';\n    this.createSystemDate = value => {\n      const parsedValue = this.moment(value).local();\n      if (this.locale === undefined) {\n        return parsedValue;\n      }\n      return parsedValue.locale(this.locale);\n    };\n    this.createUTCDate = value => {\n      const parsedValue = this.moment.utc(value);\n      if (this.locale === undefined) {\n        return parsedValue;\n      }\n      return parsedValue.locale(this.locale);\n    };\n    this.createTZDate = (value, timezone) => {\n      /* istanbul ignore next */\n      if (!this.hasTimezonePlugin()) {\n        throw new Error(MISSING_TIMEZONE_PLUGIN);\n      }\n      const parsedValue = timezone === 'default' ? this.moment(value) : this.moment.tz(value, timezone);\n      if (this.locale === undefined) {\n        return parsedValue;\n      }\n      return parsedValue.locale(this.locale);\n    };\n    this.date = value => {\n      if (value === null) {\n        return null;\n      }\n      const moment = this.moment(value);\n      moment.locale(this.getCurrentLocaleCode());\n      return moment;\n    };\n    this.dateWithTimezone = (value, timezone) => {\n      if (value === null) {\n        return null;\n      }\n      if (timezone === 'UTC') {\n        return this.createUTCDate(value);\n      }\n      if (timezone === 'system' || timezone === 'default' && !this.hasTimezonePlugin()) {\n        return this.createSystemDate(value);\n      }\n      return this.createTZDate(value, timezone);\n    };\n    this.getTimezone = value => {\n      var _value$_z, _ref, _this$moment$defaultZ;\n      if (value.isUTC()) {\n        return 'UTC';\n      }\n\n      // @ts-ignore\n      // eslint-disable-next-line no-underscore-dangle\n      const zone = (_value$_z = value._z) == null ? void 0 : _value$_z.name;\n\n      // @ts-ignore\n      return (_ref = zone != null ? zone : (_this$moment$defaultZ = this.moment.defaultZone) == null ? void 0 : _this$moment$defaultZ.name) != null ? _ref : 'system';\n    };\n    this.setTimezone = (value, timezone) => {\n      var _this$moment$defaultZ2, _this$moment$defaultZ3;\n      if (timezone === 'UTC') {\n        return value.clone().utc();\n      }\n      if (timezone === 'system') {\n        return value.clone().local();\n      }\n      if (!this.hasTimezonePlugin()) {\n        if (timezone === 'default') {\n          return value;\n        }\n\n        /* istanbul ignore next */\n        throw new Error(MISSING_TIMEZONE_PLUGIN);\n      }\n      const cleanZone = timezone === 'default' ? // @ts-ignore\n      (_this$moment$defaultZ2 = (_this$moment$defaultZ3 = this.moment.defaultZone) == null ? void 0 : _this$moment$defaultZ3.name) != null ? _this$moment$defaultZ2 : 'system' : timezone;\n      const newValue = value.clone();\n      newValue.tz(cleanZone);\n      return newValue;\n    };\n    this.toJsDate = value => {\n      return value.toDate();\n    };\n    this.parseISO = isoString => {\n      return this.moment(isoString, true);\n    };\n    this.toISO = value => {\n      return value.toISOString();\n    };\n    this.parse = (value, format) => {\n      if (value === '') {\n        return null;\n      }\n      if (this.locale) {\n        return this.moment(value, format, this.locale, true);\n      }\n      return this.moment(value, format, true);\n    };\n    this.getCurrentLocaleCode = () => {\n      return this.locale || defaultMoment.locale();\n    };\n    this.is12HourCycleInCurrentLocale = () => {\n      return /A|a/.test(defaultMoment.localeData(this.getCurrentLocaleCode()).longDateFormat('LT'));\n    };\n    this.expandFormat = format => {\n      // @see https://github.com/moment/moment/blob/develop/src/lib/format/format.js#L6\n      const localFormattingTokens = /(\\[[^[]*\\])|(\\\\)?(LTS|LT|LL?L?L?|l{1,4})|./g;\n      return format.match(localFormattingTokens).map(token => {\n        const firstCharacter = token[0];\n        if (firstCharacter === 'L' || firstCharacter === ';') {\n          return defaultMoment.localeData(this.getCurrentLocaleCode()).longDateFormat(token);\n        }\n        return token;\n      }).join('');\n    };\n    this.getFormatHelperText = format => {\n      return this.expandFormat(format).replace(/a/gi, '(a|p)m').toLocaleLowerCase();\n    };\n    this.isNull = value => {\n      return value === null;\n    };\n    this.isValid = value => {\n      return this.moment(value).isValid();\n    };\n    this.format = (value, formatKey) => {\n      return this.formatByString(value, this.formats[formatKey]);\n    };\n    this.formatByString = (value, formatString) => {\n      const clonedDate = value.clone();\n      clonedDate.locale(this.getCurrentLocaleCode());\n      return clonedDate.format(formatString);\n    };\n    this.formatNumber = numberToFormat => {\n      return numberToFormat;\n    };\n    this.getDiff = (value, comparing, unit) => {\n      return value.diff(comparing, unit);\n    };\n    this.isEqual = (value, comparing) => {\n      if (value === null && comparing === null) {\n        return true;\n      }\n      return this.moment(value).isSame(comparing);\n    };\n    this.isSameYear = (value, comparing) => {\n      return value.isSame(comparing, 'year');\n    };\n    this.isSameMonth = (value, comparing) => {\n      return value.isSame(comparing, 'month');\n    };\n    this.isSameDay = (value, comparing) => {\n      return value.isSame(comparing, 'day');\n    };\n    this.isSameHour = (value, comparing) => {\n      return value.isSame(comparing, 'hour');\n    };\n    this.isAfter = (value, comparing) => {\n      return value.isAfter(comparing);\n    };\n    this.isAfterYear = (value, comparing) => {\n      return value.isAfter(comparing, 'year');\n    };\n    this.isAfterDay = (value, comparing) => {\n      return value.isAfter(comparing, 'day');\n    };\n    this.isBefore = (value, comparing) => {\n      return value.isBefore(comparing);\n    };\n    this.isBeforeYear = (value, comparing) => {\n      return value.isBefore(comparing, 'year');\n    };\n    this.isBeforeDay = (value, comparing) => {\n      return value.isBefore(comparing, 'day');\n    };\n    this.isWithinRange = (value, [start, end]) => {\n      return value.isBetween(start, end, null, '[]');\n    };\n    this.startOfYear = value => {\n      return value.clone().startOf('year');\n    };\n    this.startOfMonth = value => {\n      return value.clone().startOf('month');\n    };\n    this.startOfWeek = value => {\n      return value.clone().startOf('week');\n    };\n    this.startOfDay = value => {\n      return value.clone().startOf('day');\n    };\n    this.endOfYear = value => {\n      return value.clone().endOf('year');\n    };\n    this.endOfMonth = value => {\n      return value.clone().endOf('month');\n    };\n    this.endOfWeek = value => {\n      return value.clone().endOf('week');\n    };\n    this.endOfDay = value => {\n      return value.clone().endOf('day');\n    };\n    this.addYears = (value, amount) => {\n      return amount < 0 ? value.clone().subtract(Math.abs(amount), 'years') : value.clone().add(amount, 'years');\n    };\n    this.addMonths = (value, amount) => {\n      return amount < 0 ? value.clone().subtract(Math.abs(amount), 'months') : value.clone().add(amount, 'months');\n    };\n    this.addWeeks = (value, amount) => {\n      return amount < 0 ? value.clone().subtract(Math.abs(amount), 'weeks') : value.clone().add(amount, 'weeks');\n    };\n    this.addDays = (value, amount) => {\n      return amount < 0 ? value.clone().subtract(Math.abs(amount), 'days') : value.clone().add(amount, 'days');\n    };\n    this.addHours = (value, amount) => {\n      return amount < 0 ? value.clone().subtract(Math.abs(amount), 'hours') : value.clone().add(amount, 'hours');\n    };\n    this.addMinutes = (value, amount) => {\n      return amount < 0 ? value.clone().subtract(Math.abs(amount), 'minutes') : value.clone().add(amount, 'minutes');\n    };\n    this.addSeconds = (value, amount) => {\n      return amount < 0 ? value.clone().subtract(Math.abs(amount), 'seconds') : value.clone().add(amount, 'seconds');\n    };\n    this.getYear = value => {\n      return value.get('year');\n    };\n    this.getMonth = value => {\n      return value.get('month');\n    };\n    this.getDate = value => {\n      return value.get('date');\n    };\n    this.getHours = value => {\n      return value.get('hours');\n    };\n    this.getMinutes = value => {\n      return value.get('minutes');\n    };\n    this.getSeconds = value => {\n      return value.get('seconds');\n    };\n    this.getMilliseconds = value => {\n      return value.get('milliseconds');\n    };\n    this.setYear = (value, year) => {\n      return value.clone().year(year);\n    };\n    this.setMonth = (value, month) => {\n      return value.clone().month(month);\n    };\n    this.setDate = (value, date) => {\n      return value.clone().date(date);\n    };\n    this.setHours = (value, hours) => {\n      return value.clone().hours(hours);\n    };\n    this.setMinutes = (value, minutes) => {\n      return value.clone().minutes(minutes);\n    };\n    this.setSeconds = (value, seconds) => {\n      return value.clone().seconds(seconds);\n    };\n    this.setMilliseconds = (value, milliseconds) => {\n      return value.clone().milliseconds(milliseconds);\n    };\n    this.getDaysInMonth = value => {\n      return value.daysInMonth();\n    };\n    this.getNextMonth = value => {\n      return value.clone().add(1, 'month');\n    };\n    this.getPreviousMonth = value => {\n      return value.clone().subtract(1, 'month');\n    };\n    this.getMonthArray = value => {\n      const firstMonth = this.startOfYear(value);\n      const monthArray = [firstMonth];\n      while (monthArray.length < 12) {\n        const prevMonth = monthArray[monthArray.length - 1];\n        monthArray.push(this.getNextMonth(prevMonth));\n      }\n      return monthArray;\n    };\n    this.mergeDateAndTime = (dateParam, timeParam) => {\n      return dateParam.clone().hour(timeParam.hour()).minute(timeParam.minute()).second(timeParam.second());\n    };\n    this.getWeekdays = () => {\n      return defaultMoment.weekdaysShort(true);\n    };\n    this.getWeekArray = value => {\n      const cleanLocale = this.setLocaleToValue(value);\n      const start = cleanLocale.clone().startOf('month').startOf('week');\n      const end = cleanLocale.clone().endOf('month').endOf('week');\n      let count = 0;\n      let current = start;\n      const nestedWeeks = [];\n      while (current.isBefore(end)) {\n        const weekNumber = Math.floor(count / 7);\n        nestedWeeks[weekNumber] = nestedWeeks[weekNumber] || [];\n        nestedWeeks[weekNumber].push(current);\n        current = current.clone().add(1, 'day');\n        count += 1;\n      }\n      return nestedWeeks;\n    };\n    this.getWeekNumber = value => {\n      return value.week();\n    };\n    this.getYearRange = (start, end) => {\n      const startDate = this.moment(start).startOf('year');\n      const endDate = this.moment(end).endOf('year');\n      const years = [];\n      let current = startDate;\n      while (current.isBefore(endDate)) {\n        years.push(current);\n        current = current.clone().add(1, 'year');\n      }\n      return years;\n    };\n    this.getMeridiemText = ampm => {\n      if (this.is12HourCycleInCurrentLocale()) {\n        // AM/PM translation only possible in those who have 12 hour cycle in locale.\n        return defaultMoment.localeData(this.getCurrentLocaleCode()).meridiem(ampm === 'am' ? 0 : 13, 0, false);\n      }\n      return ampm === 'am' ? 'AM' : 'PM'; // fallback for de, ru, ...etc\n    };\n    this.moment = instance || defaultMoment;\n    this.locale = locale;\n    this.formats = _extends({}, defaultFormats, formats);\n  }\n}","import*as e from\"react\";import t,{createContext as n,useContext as a,useState as r,useEffect as s,useCallback as c,useRef as l,forwardRef as o,useImperativeHandle as i,useMemo as d}from\"react\";import{isEqual as u}from\"lodash\";import g from\"graphology\";import{Sigma as m}from\"sigma\";const h=n(null),v=h.Provider;function f(){const e=a(h);if(null==e)throw new Error(\"No context provided: useSigmaContext() can only be used in a descendant of <SigmaContainer>\");return e}function p(){return f().sigma}function b(){const{sigma:e,container:t}=f(),[n,a]=r({});return s((()=>{if(!e||!n)return;const a={};return Object.keys(n).forEach((t=>{a[t]=n[t],e.setSetting(t,n[t])})),()=>{e&&t&&t.offsetWidth>0&&t.offsetHeight>0&&Object.keys(a).forEach((t=>{e.setSetting(t,a[t])}))}}),[e,n,t]),a}const E=[\"clickNode\",\"rightClickNode\",\"downNode\",\"enterNode\",\"leaveNode\",\"doubleClickNode\",\"wheelNode\",\"clickEdge\",\"rightClickEdge\",\"downEdge\",\"enterEdge\",\"leaveEdge\",\"doubleClickEdge\",\"wheelEdge\",\"clickStage\",\"rightClickStage\",\"downStage\",\"doubleClickStage\",\"wheelStage\",\"beforeRender\",\"afterRender\",\"kill\"],w=[\"click\",\"rightClick\",\"mouseup\",\"mousedown\",\"mousemove\",\"mousemovebody\",\"doubleClick\",\"wheel\"],C=[\"touchup\",\"touchdown\",\"touchmove\"],O=[\"updated\"];function _(){const e=p(),t=b(),[n,a]=r({});return s((()=>{if(!e||!n)return;const a=n,r=Object.keys(a),s={},c={},l=e.getSettings();return r.some((e=>[\"clickEdge\",\"rightClickEdge\",\"doubleClickEdge\",\"downEdge\"].includes(e)))&&!1===l.enableEdgeClickEvents&&(s.enableEdgeClickEvents=!0,c.enableEdgeClickEvents=!1),r.some((e=>[\"enterEdge\",\"leaveEdge\"].includes(e)))&&!1===l.enableEdgeHoverEvents&&(s.enableEdgeHoverEvents=!0,c.enableEdgeHoverEvents=!1),r.some((e=>[\"wheelEdge\"].includes(e)))&&!1===l.enableEdgeWheelEvents&&(s.enableEdgeWheelEvents=!0,c.enableEdgeWheelEvents=!1),Object.keys(s).length>0&&t(s),r.forEach((t=>{const n=a[t];E.find((e=>e===t))&&e.on(t,n),w.find((e=>e===t))&&e.getMouseCaptor().on(t,n),C.find((e=>e===t))&&e.getTouchCaptor().on(t,n),O.find((e=>e===t))&&e.getCamera().on(t,n)})),()=>{Object.keys(c).length>0&&t(c),e&&r.forEach((t=>{const n=a[t];E.find((e=>e===t))&&e.off(t,n),w.find((e=>e===t))&&e.getMouseCaptor().off(t,n),C.find((e=>e===t))&&e.getTouchCaptor().off(t,n),O.find((e=>e===t))&&e.getCamera().off(t,n)}))}}),[e,n,t]),a}function y(){const e=p();return c(((t,n=!0)=>{e&&t&&(n&&e.getGraph().order>0&&e.getGraph().clear(),e.getGraph().import(t),e.refresh())}),[e])}function j(e){const t=p(),n=l();u(n.current,e)||(n.current=e);const a=c((e=>{t.getCamera().animatedZoom(Object.assign(Object.assign({},n.current),e))}),[t,n]),r=c((e=>{t.getCamera().animatedUnzoom(Object.assign(Object.assign({},n.current),e))}),[t,n]),s=c((e=>{t.getCamera().animatedReset(Object.assign(Object.assign({},n.current),e))}),[t,n]),o=c(((e,a)=>{t.getCamera().animate(e,Object.assign(Object.assign({},n.current),a))}),[t,n]),i=c(((e,a)=>{const r=t.getNodeDisplayData(e);r?t.getCamera().animate(r,Object.assign(Object.assign({},n.current),a)):console.log(`Node ${e} not found`)}),[t,n]);return{zoomIn:a,zoomOut:r,reset:s,goto:o,gotoNode:i}}function x(e){const t=f(),[n,a]=r(!1),[l,o]=r(e||t.container),i=()=>a((e=>!e));return s((()=>(document.addEventListener(\"fullscreenchange\",i),()=>document.removeEventListener(\"fullscreenchange\",i))),[i]),s((()=>{o(e||t.container)}),[e,t.container]),{toggle:c((()=>{var e;e=l,document.fullscreenElement!==e?e.requestFullscreen():document.exitFullscreen&&document.exitFullscreen()}),[l]),isFullScreen:n}}const k=o((({graph:e,id:n,className:a,style:c,settings:o,children:h},f)=>{const p=l(null),b=l(null),E={className:`react-sigma ${a||\"\"}`,id:n,style:c},[w,C]=r(null),O=l({});u(O.current,o)||(O.current=o||{}),s((()=>{let t=null;if(null!==b.current){const n=e?\"function\"==typeof e?new e:e:new g;t=new m(n,b.current,Object.assign({allowInvalidContainer:!0},O.current)),w&&t.getCamera().setState(w.getCamera().getState())}return C(t),()=>{t&&t.kill(),C(null)}}),[b,e,O]),i(f,(()=>w),[w]);const _=d((()=>w&&p.current?{sigma:w,container:p.current}:null),[w,p.current]),y=null!==_?t.createElement(v,{value:_},h):null;return t.createElement(\"div\",Object.assign({},E,{ref:p}),t.createElement(\"div\",{className:\"sigma-container\",ref:b}),y)})),S=({id:e,className:n,style:a,children:r,position:s=\"bottom-left\"})=>{const c={className:`react-sigma-controls ${n||\"\"} ${s}`,id:e,style:a};return t.createElement(\"div\",Object.assign({},c),r)};var N;function z(){return z=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var a in n)Object.prototype.hasOwnProperty.call(n,a)&&(e[a]=n[a])}return e},z.apply(this,arguments)}var H,M=function(t){return e.createElement(\"svg\",z({\"aria-hidden\":\"true\",\"data-prefix\":\"fas\",\"data-icon\":\"plus\",className:\"plus-solid_svg__svg-inline--fa plus-solid_svg__fa-plus plus-solid_svg__fa-w-14\",xmlns:\"http://www.w3.org/2000/svg\",viewBox:\"0 0 448 512\",width:\"1em\",height:\"1em\"},t),N||(N=e.createElement(\"path\",{fill:\"currentColor\",d:\"M416 208H272V64c0-17.67-14.33-32-32-32h-32c-17.67 0-32 14.33-32 32v144H32c-17.67 0-32 14.33-32 32v32c0 17.67 14.33 32 32 32h144v144c0 17.67 14.33 32 32 32h32c17.67 0 32-14.33 32-32V304h144c17.67 0 32-14.33 32-32v-32c0-17.67-14.33-32-32-32z\"})))};function $(){return $=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var a in n)Object.prototype.hasOwnProperty.call(n,a)&&(e[a]=n[a])}return e},$.apply(this,arguments)}var F,V=function(t){return e.createElement(\"svg\",$({\"aria-hidden\":\"true\",\"data-prefix\":\"fas\",\"data-icon\":\"minus\",className:\"minus-solid_svg__svg-inline--fa minus-solid_svg__fa-minus minus-solid_svg__fa-w-14\",xmlns:\"http://www.w3.org/2000/svg\",viewBox:\"0 0 448 512\",width:\"1em\",height:\"1em\"},t),H||(H=e.createElement(\"path\",{fill:\"currentColor\",d:\"M416 208H32c-17.67 0-32 14.33-32 32v32c0 17.67 14.33 32 32 32h384c17.67 0 32-14.33 32-32v-32c0-17.67-14.33-32-32-32z\"})))};function G(){return G=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var a in n)Object.prototype.hasOwnProperty.call(n,a)&&(e[a]=n[a])}return e},G.apply(this,arguments)}var P=function(t){return e.createElement(\"svg\",G({\"aria-hidden\":\"true\",\"data-prefix\":\"far\",\"data-icon\":\"dot-circle\",className:\"dot-circle-regular_svg__svg-inline--fa dot-circle-regular_svg__fa-dot-circle dot-circle-regular_svg__fa-w-16\",xmlns:\"http://www.w3.org/2000/svg\",viewBox:\"0 0 512 512\",width:\"1em\",height:\"1em\"},t),F||(F=e.createElement(\"path\",{fill:\"currentColor\",d:\"M256 56c110.532 0 200 89.451 200 200 0 110.532-89.451 200-200 200-110.532 0-200-89.451-200-200 0-110.532 89.451-200 200-200m0-48C119.033 8 8 119.033 8 256s111.033 248 248 248 248-111.033 248-248S392.967 8 256 8zm0 168c-44.183 0-80 35.817-80 80s35.817 80 80 80 80-35.817 80-80-35.817-80-80-80z\"})))};const I=({className:e,style:n,animationDuration:a=200,children:r,labels:s={}})=>{const{zoomIn:c,zoomOut:l,reset:o}=j({duration:a,factor:1.5}),i={style:n,className:`react-sigma-control ${e||\"\"}`};return t.createElement(t.Fragment,null,t.createElement(\"div\",Object.assign({},i),t.createElement(\"button\",{onClick:()=>c(),title:s.zoomIn||\"Zoom In\"},r?r[0]:t.createElement(M,{style:{width:\"1em\"}}))),t.createElement(\"div\",Object.assign({},i),t.createElement(\"button\",{onClick:()=>l(),title:s.zoomOut||\"Zoom Out\"},r?r[1]:t.createElement(V,{style:{width:\"1em\"}}))),t.createElement(\"div\",Object.assign({},i),t.createElement(\"button\",{onClick:()=>o(),title:s.reset||\"See whole graph\"},r?r[2]:t.createElement(P,{style:{width:\"1em\"}}))))};var R;function B(){return B=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var a in n)Object.prototype.hasOwnProperty.call(n,a)&&(e[a]=n[a])}return e},B.apply(this,arguments)}var L,W=function(t){return e.createElement(\"svg\",B({\"aria-hidden\":\"true\",\"data-prefix\":\"fas\",\"data-icon\":\"expand\",className:\"expand-solid_svg__svg-inline--fa expand-solid_svg__fa-expand expand-solid_svg__fa-w-14\",xmlns:\"http://www.w3.org/2000/svg\",viewBox:\"0 0 448 512\",width:\"1em\",height:\"1em\"},t),R||(R=e.createElement(\"path\",{fill:\"currentColor\",d:\"M0 180V56c0-13.3 10.7-24 24-24h124c6.6 0 12 5.4 12 12v40c0 6.6-5.4 12-12 12H64v84c0 6.6-5.4 12-12 12H12c-6.6 0-12-5.4-12-12zM288 44v40c0 6.6 5.4 12 12 12h84v84c0 6.6 5.4 12 12 12h40c6.6 0 12-5.4 12-12V56c0-13.3-10.7-24-24-24H300c-6.6 0-12 5.4-12 12zm148 276h-40c-6.6 0-12 5.4-12 12v84h-84c-6.6 0-12 5.4-12 12v40c0 6.6 5.4 12 12 12h124c13.3 0 24-10.7 24-24V332c0-6.6-5.4-12-12-12zM160 468v-40c0-6.6-5.4-12-12-12H64v-84c0-6.6-5.4-12-12-12H12c-6.6 0-12 5.4-12 12v124c0 13.3 10.7 24 24 24h124c6.6 0 12-5.4 12-12z\"})))};function Z(){return Z=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var a in n)Object.prototype.hasOwnProperty.call(n,a)&&(e[a]=n[a])}return e},Z.apply(this,arguments)}var D=function(t){return e.createElement(\"svg\",Z({\"aria-hidden\":\"true\",\"data-prefix\":\"fas\",\"data-icon\":\"compress\",className:\"compress-solid_svg__svg-inline--fa compress-solid_svg__fa-compress compress-solid_svg__fa-w-14\",xmlns:\"http://www.w3.org/2000/svg\",viewBox:\"0 0 448 512\",width:\"1em\",height:\"1em\"},t),L||(L=e.createElement(\"path\",{fill:\"currentColor\",d:\"M436 192H312c-13.3 0-24-10.7-24-24V44c0-6.6 5.4-12 12-12h40c6.6 0 12 5.4 12 12v84h84c6.6 0 12 5.4 12 12v40c0 6.6-5.4 12-12 12zm-276-24V44c0-6.6-5.4-12-12-12h-40c-6.6 0-12 5.4-12 12v84H12c-6.6 0-12 5.4-12 12v40c0 6.6 5.4 12 12 12h124c13.3 0 24-10.7 24-24zm0 300V344c0-13.3-10.7-24-24-24H12c-6.6 0-12 5.4-12 12v40c0 6.6 5.4 12 12 12h84v84c0 6.6 5.4 12 12 12h40c6.6 0 12-5.4 12-12zm192 0v-84h84c6.6 0 12-5.4 12-12v-40c0-6.6-5.4-12-12-12H312c-13.3 0-24 10.7-24 24v124c0 6.6 5.4 12 12 12h40c6.6 0 12-5.4 12-12z\"})))};const q=({id:e,className:n,style:a,container:r,children:s,labels:c={}})=>{const{isFullScreen:l,toggle:o}=x(null==r?void 0:r.current),i={className:`react-sigma-control ${n||\"\"}`,id:e,style:a};return document.fullscreenEnabled?t.createElement(\"div\",Object.assign({},i),t.createElement(\"button\",{onClick:o,title:l?c.exit||\"Exit fullscreen\":c.enter||\"Enter fullscreen\"},s&&!l&&s[0],s&&l&&s[1],!s&&!l&&t.createElement(W,{style:{width:\"1em\"}}),!s&&l&&t.createElement(D,{style:{width:\"1em\"}}))):null},A=({id:e,className:n,style:a,labels:c={}})=>{const l=p(),o=_(),{gotoNode:i}=j(),[d,u]=r(\"\"),[g,m]=r([]),[h,v]=r(null),[f,b]=r(\"\");s((()=>{b(`search-${Math.random().toString(36).slice(2)}`)}),[]),s((()=>{const e=[];!h&&d.length>1&&l.getGraph().forEachNode(((t,n)=>{n.label&&n.label.toLowerCase().includes(d.toLowerCase())&&e.push({id:t,label:n.label})})),m(e)}),[d]),s((()=>{o({clickStage:()=>{v(null),u(\"\")}})}),[o]),s((()=>{if(h)return l.getGraph().setNodeAttribute(h,\"highlighted\",!0),i(h),()=>{l.getGraph().setNodeAttribute(h,\"highlighted\",!1)}}),[h]);const E={className:`react-sigma-search ${n||\"\"}`,id:e,style:a};return t.createElement(\"div\",Object.assign({},E),t.createElement(\"label\",{htmlFor:f,style:{display:\"none\"}},c.text||\"Search a node\"),t.createElement(\"input\",{id:f,type:\"text\",placeholder:c.placeholder||\"Search...\",list:`${f}-datalist`,value:d,onChange:e=>{const t=e.target.value,n=g.find((e=>e.label===t));n?(u(n.label),m([]),v(n.id)):(v(null),u(t))}}),t.createElement(\"datalist\",{id:`${f}-datalist`},g.map((e=>t.createElement(\"option\",{key:e.id,value:e.label},e.label)))))};export{S as ControlsContainer,q as FullScreenControl,A as SearchControl,k as SigmaContainer,h as SigmaContext,v as SigmaProvider,I as ZoomControl,j as useCamera,x as useFullScreen,y as useLoadGraph,_ as useRegisterEvents,b as useSetSettings,p as useSigma,f as useSigmaContext};\n//# sourceMappingURL=react-sigma_core.esm.min.js.map\n","/**\n * Extend function\n * ================\n *\n * Function used to push a bunch of values into an array at once.\n *\n * Its strategy is to mutate target array's length then setting the new indices\n * to be the values to add.\n *\n * A benchmark proved that it is faster than the following strategies:\n *   1) `array.push.apply(array, values)`.\n *   2) A loop of pushes.\n *   3) `array = array.concat(values)`, obviously.\n *\n * Intuitively, this is correct because when adding a lot of elements, the\n * chosen strategies does not need to handle the `arguments` object to\n * execute #.apply's variadicity and because the array know its final length\n * at the beginning, avoiding potential multiple reallocations of the underlying\n * contiguous array. Some engines may be able to optimize the loop of push\n * operations but empirically they don't seem to do so.\n */\n\n/**\n * Extends the target array with the given values.\n *\n * @param  {array} array  - Target array.\n * @param  {array} values - Values to add.\n */\nmodule.exports = function extend(array, values) {\n  var l2 = values.length;\n\n  if (l2 === 0)\n    return;\n\n  var l1 = array.length;\n\n  array.length += l2;\n\n  for (var i = 0; i < l2; i++)\n    array[l1 + i] = values[i];\n};\n","/**\n * Graphology ForceAtlas2 Layout Default Settings\n * ===============================================\n */\nmodule.exports = {\n  linLogMode: false,\n  outboundAttractionDistribution: false,\n  adjustSizes: false,\n  edgeWeightInfluence: 1,\n  scalingRatio: 1,\n  strongGravityMode: false,\n  gravity: 1,\n  slowDown: 1,\n  barnesHutOptimize: false,\n  barnesHutTheta: 0.5\n};\n","/**\n * Graphology ForceAtlas2 Helpers\n * ===============================\n *\n * Miscellaneous helper functions.\n */\n\n/**\n * Constants.\n */\nvar PPN = 10;\nvar PPE = 3;\n\n/**\n * Very simple Object.assign-like function.\n *\n * @param  {object} target       - First object.\n * @param  {object} [...objects] - Objects to merge.\n * @return {object}\n */\nexports.assign = function (target) {\n  target = target || {};\n\n  var objects = Array.prototype.slice.call(arguments).slice(1),\n    i,\n    k,\n    l;\n\n  for (i = 0, l = objects.length; i < l; i++) {\n    if (!objects[i]) continue;\n\n    for (k in objects[i]) target[k] = objects[i][k];\n  }\n\n  return target;\n};\n\n/**\n * Function used to validate the given settings.\n *\n * @param  {object}      settings - Settings to validate.\n * @return {object|null}\n */\nexports.validateSettings = function (settings) {\n  if ('linLogMode' in settings && typeof settings.linLogMode !== 'boolean')\n    return {message: 'the `linLogMode` setting should be a boolean.'};\n\n  if (\n    'outboundAttractionDistribution' in settings &&\n    typeof settings.outboundAttractionDistribution !== 'boolean'\n  )\n    return {\n      message:\n        'the `outboundAttractionDistribution` setting should be a boolean.'\n    };\n\n  if ('adjustSizes' in settings && typeof settings.adjustSizes !== 'boolean')\n    return {message: 'the `adjustSizes` setting should be a boolean.'};\n\n  if (\n    'edgeWeightInfluence' in settings &&\n    typeof settings.edgeWeightInfluence !== 'number'\n  )\n    return {\n      message: 'the `edgeWeightInfluence` setting should be a number.'\n    };\n\n  if (\n    'scalingRatio' in settings &&\n    !(typeof settings.scalingRatio === 'number' && settings.scalingRatio >= 0)\n  )\n    return {message: 'the `scalingRatio` setting should be a number >= 0.'};\n\n  if (\n    'strongGravityMode' in settings &&\n    typeof settings.strongGravityMode !== 'boolean'\n  )\n    return {message: 'the `strongGravityMode` setting should be a boolean.'};\n\n  if (\n    'gravity' in settings &&\n    !(typeof settings.gravity === 'number' && settings.gravity >= 0)\n  )\n    return {message: 'the `gravity` setting should be a number >= 0.'};\n\n  if (\n    'slowDown' in settings &&\n    !(typeof settings.slowDown === 'number' || settings.slowDown >= 0)\n  )\n    return {message: 'the `slowDown` setting should be a number >= 0.'};\n\n  if (\n    'barnesHutOptimize' in settings &&\n    typeof settings.barnesHutOptimize !== 'boolean'\n  )\n    return {message: 'the `barnesHutOptimize` setting should be a boolean.'};\n\n  if (\n    'barnesHutTheta' in settings &&\n    !(\n      typeof settings.barnesHutTheta === 'number' &&\n      settings.barnesHutTheta >= 0\n    )\n  )\n    return {message: 'the `barnesHutTheta` setting should be a number >= 0.'};\n\n  return null;\n};\n\n/**\n * Function generating a flat matrix for both nodes & edges of the given graph.\n *\n * @param  {Graph}    graph         - Target graph.\n * @param  {function} getEdgeWeight - Edge weight getter function.\n * @return {object}                 - Both matrices.\n */\nexports.graphToByteArrays = function (graph, getEdgeWeight) {\n  var order = graph.order;\n  var size = graph.size;\n  var index = {};\n  var j;\n\n  // NOTE: float32 could lead to issues if edge array needs to index large\n  // number of nodes.\n  var NodeMatrix = new Float32Array(order * PPN);\n  var EdgeMatrix = new Float32Array(size * PPE);\n\n  // Iterate through nodes\n  j = 0;\n  graph.forEachNode(function (node, attr) {\n    // Node index\n    index[node] = j;\n\n    // Populating byte array\n    NodeMatrix[j] = attr.x;\n    NodeMatrix[j + 1] = attr.y;\n    NodeMatrix[j + 2] = 0; // dx\n    NodeMatrix[j + 3] = 0; // dy\n    NodeMatrix[j + 4] = 0; // old_dx\n    NodeMatrix[j + 5] = 0; // old_dy\n    NodeMatrix[j + 6] = 1; // mass\n    NodeMatrix[j + 7] = 1; // convergence\n    NodeMatrix[j + 8] = attr.size || 1;\n    NodeMatrix[j + 9] = attr.fixed ? 1 : 0;\n    j += PPN;\n  });\n\n  // Iterate through edges\n  j = 0;\n  graph.forEachEdge(function (edge, attr, source, target, sa, ta, u) {\n    var sj = index[source];\n    var tj = index[target];\n\n    var weight = getEdgeWeight(edge, attr, source, target, sa, ta, u);\n\n    // Incrementing mass to be a node's weighted degree\n    NodeMatrix[sj + 6] += weight;\n    NodeMatrix[tj + 6] += weight;\n\n    // Populating byte array\n    EdgeMatrix[j] = sj;\n    EdgeMatrix[j + 1] = tj;\n    EdgeMatrix[j + 2] = weight;\n    j += PPE;\n  });\n\n  return {\n    nodes: NodeMatrix,\n    edges: EdgeMatrix\n  };\n};\n\n/**\n * Function applying the layout back to the graph.\n *\n * @param {Graph}         graph         - Target graph.\n * @param {Float32Array}  NodeMatrix    - Node matrix.\n * @param {function|null} outputReducer - A node reducer.\n */\nexports.assignLayoutChanges = function (graph, NodeMatrix, outputReducer) {\n  var i = 0;\n\n  graph.updateEachNodeAttributes(function (node, attr) {\n    attr.x = NodeMatrix[i];\n    attr.y = NodeMatrix[i + 1];\n\n    i += PPN;\n\n    return outputReducer ? outputReducer(node, attr) : attr;\n  });\n};\n\n/**\n * Function reading the positions (only) from the graph, to write them in the matrix.\n *\n * @param {Graph}        graph      - Target graph.\n * @param {Float32Array} NodeMatrix - Node matrix.\n */\nexports.readGraphPositions = function (graph, NodeMatrix) {\n  var i = 0;\n\n  graph.forEachNode(function (node, attr) {\n    NodeMatrix[i] = attr.x;\n    NodeMatrix[i + 1] = attr.y;\n\n    i += PPN;\n  });\n};\n\n/**\n * Function collecting the layout positions.\n *\n * @param  {Graph}         graph         - Target graph.\n * @param  {Float32Array}  NodeMatrix    - Node matrix.\n * @param  {function|null} outputReducer - A nodes reducer.\n * @return {object}                      - Map to node positions.\n */\nexports.collectLayoutChanges = function (graph, NodeMatrix, outputReducer) {\n  var nodes = graph.nodes(),\n    positions = {};\n\n  for (var i = 0, j = 0, l = NodeMatrix.length; i < l; i += PPN) {\n    if (outputReducer) {\n      var newAttr = Object.assign({}, graph.getNodeAttributes(nodes[j]));\n      newAttr.x = NodeMatrix[i];\n      newAttr.y = NodeMatrix[i + 1];\n      newAttr = outputReducer(nodes[j], newAttr);\n      positions[nodes[j]] = {\n        x: newAttr.x,\n        y: newAttr.y\n      };\n    } else {\n      positions[nodes[j]] = {\n        x: NodeMatrix[i],\n        y: NodeMatrix[i + 1]\n      };\n    }\n\n    j++;\n  }\n\n  return positions;\n};\n\n/**\n * Function returning a web worker from the given function.\n *\n * @param  {function}  fn - Function for the worker.\n * @return {DOMString}\n */\nexports.createWorker = function createWorker(fn) {\n  var xURL = window.URL || window.webkitURL;\n  var code = fn.toString();\n  var objectUrl = xURL.createObjectURL(\n    new Blob(['(' + code + ').call(this);'], {type: 'text/javascript'})\n  );\n  var worker = new Worker(objectUrl);\n  xURL.revokeObjectURL(objectUrl);\n\n  return worker;\n};\n","/**\n * Graphology ForceAtlas2 Layout\n * ==============================\n *\n * Library endpoint.\n */\nvar isGraph = require('graphology-utils/is-graph');\nvar createEdgeWeightGetter =\n  require('graphology-utils/getters').createEdgeWeightGetter;\nvar iterate = require('./iterate.js');\nvar helpers = require('./helpers.js');\n\nvar DEFAULT_SETTINGS = require('./defaults.js');\n\n/**\n * Asbtract function used to run a certain number of iterations.\n *\n * @param  {boolean}       assign          - Whether to assign positions.\n * @param  {Graph}         graph           - Target graph.\n * @param  {object|number} params          - If number, params.iterations, else:\n * @param  {function}        getWeight     - Edge weight getter function.\n * @param  {number}          iterations    - Number of iterations.\n * @param  {function|null}   outputReducer - A node reducer\n * @param  {object}          [settings]    - Settings.\n * @return {object|undefined}\n */\nfunction abstractSynchronousLayout(assign, graph, params) {\n  if (!isGraph(graph))\n    throw new Error(\n      'graphology-layout-forceatlas2: the given graph is not a valid graphology instance.'\n    );\n\n  if (typeof params === 'number') params = {iterations: params};\n\n  var iterations = params.iterations;\n\n  if (typeof iterations !== 'number')\n    throw new Error(\n      'graphology-layout-forceatlas2: invalid number of iterations.'\n    );\n\n  if (iterations <= 0)\n    throw new Error(\n      'graphology-layout-forceatlas2: you should provide a positive number of iterations.'\n    );\n\n  var getEdgeWeight = createEdgeWeightGetter(\n    'getEdgeWeight' in params ? params.getEdgeWeight : 'weight'\n  ).fromEntry;\n\n  var outputReducer =\n    typeof params.outputReducer === 'function' ? params.outputReducer : null;\n\n  // Validating settings\n  var settings = helpers.assign({}, DEFAULT_SETTINGS, params.settings);\n  var validationError = helpers.validateSettings(settings);\n\n  if (validationError)\n    throw new Error(\n      'graphology-layout-forceatlas2: ' + validationError.message\n    );\n\n  // Building matrices\n  var matrices = helpers.graphToByteArrays(graph, getEdgeWeight);\n\n  var i;\n\n  // Iterating\n  for (i = 0; i < iterations; i++)\n    iterate(settings, matrices.nodes, matrices.edges);\n\n  // Applying\n  if (assign) {\n    helpers.assignLayoutChanges(graph, matrices.nodes, outputReducer);\n    return;\n  }\n\n  return helpers.collectLayoutChanges(graph, matrices.nodes);\n}\n\n/**\n * Function returning sane layout settings for the given graph.\n *\n * @param  {Graph|number} graph - Target graph or graph order.\n * @return {object}\n */\nfunction inferSettings(graph) {\n  var order = typeof graph === 'number' ? graph : graph.order;\n\n  return {\n    barnesHutOptimize: order > 2000,\n    strongGravityMode: true,\n    gravity: 0.05,\n    scalingRatio: 10,\n    slowDown: 1 + Math.log(order)\n  };\n}\n\n/**\n * Exporting.\n */\nvar synchronousLayout = abstractSynchronousLayout.bind(null, false);\nsynchronousLayout.assign = abstractSynchronousLayout.bind(null, true);\nsynchronousLayout.inferSettings = inferSettings;\n\nmodule.exports = synchronousLayout;\n","/* eslint no-constant-condition: 0 */\n/**\n * Graphology ForceAtlas2 Iteration\n * =================================\n *\n * Function used to perform a single iteration of the algorithm.\n */\n\n/**\n * Matrices properties accessors.\n */\nvar NODE_X = 0;\nvar NODE_Y = 1;\nvar NODE_DX = 2;\nvar NODE_DY = 3;\nvar NODE_OLD_DX = 4;\nvar NODE_OLD_DY = 5;\nvar NODE_MASS = 6;\nvar NODE_CONVERGENCE = 7;\nvar NODE_SIZE = 8;\nvar NODE_FIXED = 9;\n\nvar EDGE_SOURCE = 0;\nvar EDGE_TARGET = 1;\nvar EDGE_WEIGHT = 2;\n\nvar REGION_NODE = 0;\nvar REGION_CENTER_X = 1;\nvar REGION_CENTER_Y = 2;\nvar REGION_SIZE = 3;\nvar REGION_NEXT_SIBLING = 4;\nvar REGION_FIRST_CHILD = 5;\nvar REGION_MASS = 6;\nvar REGION_MASS_CENTER_X = 7;\nvar REGION_MASS_CENTER_Y = 8;\n\nvar SUBDIVISION_ATTEMPTS = 3;\n\n/**\n * Constants.\n */\nvar PPN = 10;\nvar PPE = 3;\nvar PPR = 9;\n\nvar MAX_FORCE = 10;\n\n/**\n * Function used to perform a single interation of the algorithm.\n *\n * @param  {object}       options    - Layout options.\n * @param  {Float32Array} NodeMatrix - Node data.\n * @param  {Float32Array} EdgeMatrix - Edge data.\n * @return {object}                  - Some metadata.\n */\nmodule.exports = function iterate(options, NodeMatrix, EdgeMatrix) {\n  // Initializing variables\n  var l, r, n, n1, n2, rn, e, w, g, s;\n\n  var order = NodeMatrix.length,\n    size = EdgeMatrix.length;\n\n  var adjustSizes = options.adjustSizes;\n\n  var thetaSquared = options.barnesHutTheta * options.barnesHutTheta;\n\n  var outboundAttCompensation, coefficient, xDist, yDist, ewc, distance, factor;\n\n  var RegionMatrix = [];\n\n  // 1) Initializing layout data\n  //-----------------------------\n\n  // Resetting positions & computing max values\n  for (n = 0; n < order; n += PPN) {\n    NodeMatrix[n + NODE_OLD_DX] = NodeMatrix[n + NODE_DX];\n    NodeMatrix[n + NODE_OLD_DY] = NodeMatrix[n + NODE_DY];\n    NodeMatrix[n + NODE_DX] = 0;\n    NodeMatrix[n + NODE_DY] = 0;\n  }\n\n  // If outbound attraction distribution, compensate\n  if (options.outboundAttractionDistribution) {\n    outboundAttCompensation = 0;\n    for (n = 0; n < order; n += PPN) {\n      outboundAttCompensation += NodeMatrix[n + NODE_MASS];\n    }\n\n    outboundAttCompensation /= order / PPN;\n  }\n\n  // 1.bis) Barnes-Hut computation\n  //------------------------------\n\n  if (options.barnesHutOptimize) {\n    // Setting up\n    var minX = Infinity,\n      maxX = -Infinity,\n      minY = Infinity,\n      maxY = -Infinity,\n      q,\n      q2,\n      subdivisionAttempts;\n\n    // Computing min and max values\n    for (n = 0; n < order; n += PPN) {\n      minX = Math.min(minX, NodeMatrix[n + NODE_X]);\n      maxX = Math.max(maxX, NodeMatrix[n + NODE_X]);\n      minY = Math.min(minY, NodeMatrix[n + NODE_Y]);\n      maxY = Math.max(maxY, NodeMatrix[n + NODE_Y]);\n    }\n\n    // squarify bounds, it's a quadtree\n    var dx = maxX - minX,\n      dy = maxY - minY;\n    if (dx > dy) {\n      minY -= (dx - dy) / 2;\n      maxY = minY + dx;\n    } else {\n      minX -= (dy - dx) / 2;\n      maxX = minX + dy;\n    }\n\n    // Build the Barnes Hut root region\n    RegionMatrix[0 + REGION_NODE] = -1;\n    RegionMatrix[0 + REGION_CENTER_X] = (minX + maxX) / 2;\n    RegionMatrix[0 + REGION_CENTER_Y] = (minY + maxY) / 2;\n    RegionMatrix[0 + REGION_SIZE] = Math.max(maxX - minX, maxY - minY);\n    RegionMatrix[0 + REGION_NEXT_SIBLING] = -1;\n    RegionMatrix[0 + REGION_FIRST_CHILD] = -1;\n    RegionMatrix[0 + REGION_MASS] = 0;\n    RegionMatrix[0 + REGION_MASS_CENTER_X] = 0;\n    RegionMatrix[0 + REGION_MASS_CENTER_Y] = 0;\n\n    // Add each node in the tree\n    l = 1;\n    for (n = 0; n < order; n += PPN) {\n      // Current region, starting with root\n      r = 0;\n      subdivisionAttempts = SUBDIVISION_ATTEMPTS;\n\n      while (true) {\n        // Are there sub-regions?\n\n        // We look at first child index\n        if (RegionMatrix[r + REGION_FIRST_CHILD] >= 0) {\n          // There are sub-regions\n\n          // We just iterate to find a \"leaf\" of the tree\n          // that is an empty region or a region with a single node\n          // (see next case)\n\n          // Find the quadrant of n\n          if (NodeMatrix[n + NODE_X] < RegionMatrix[r + REGION_CENTER_X]) {\n            if (NodeMatrix[n + NODE_Y] < RegionMatrix[r + REGION_CENTER_Y]) {\n              // Top Left quarter\n              q = RegionMatrix[r + REGION_FIRST_CHILD];\n            } else {\n              // Bottom Left quarter\n              q = RegionMatrix[r + REGION_FIRST_CHILD] + PPR;\n            }\n          } else {\n            if (NodeMatrix[n + NODE_Y] < RegionMatrix[r + REGION_CENTER_Y]) {\n              // Top Right quarter\n              q = RegionMatrix[r + REGION_FIRST_CHILD] + PPR * 2;\n            } else {\n              // Bottom Right quarter\n              q = RegionMatrix[r + REGION_FIRST_CHILD] + PPR * 3;\n            }\n          }\n\n          // Update center of mass and mass (we only do it for non-leave regions)\n          RegionMatrix[r + REGION_MASS_CENTER_X] =\n            (RegionMatrix[r + REGION_MASS_CENTER_X] *\n              RegionMatrix[r + REGION_MASS] +\n              NodeMatrix[n + NODE_X] * NodeMatrix[n + NODE_MASS]) /\n            (RegionMatrix[r + REGION_MASS] + NodeMatrix[n + NODE_MASS]);\n\n          RegionMatrix[r + REGION_MASS_CENTER_Y] =\n            (RegionMatrix[r + REGION_MASS_CENTER_Y] *\n              RegionMatrix[r + REGION_MASS] +\n              NodeMatrix[n + NODE_Y] * NodeMatrix[n + NODE_MASS]) /\n            (RegionMatrix[r + REGION_MASS] + NodeMatrix[n + NODE_MASS]);\n\n          RegionMatrix[r + REGION_MASS] += NodeMatrix[n + NODE_MASS];\n\n          // Iterate on the right quadrant\n          r = q;\n          continue;\n        } else {\n          // There are no sub-regions: we are in a \"leaf\"\n\n          // Is there a node in this leave?\n          if (RegionMatrix[r + REGION_NODE] < 0) {\n            // There is no node in region:\n            // we record node n and go on\n            RegionMatrix[r + REGION_NODE] = n;\n            break;\n          } else {\n            // There is a node in this region\n\n            // We will need to create sub-regions, stick the two\n            // nodes (the old one r[0] and the new one n) in two\n            // subregions. If they fall in the same quadrant,\n            // we will iterate.\n\n            // Create sub-regions\n            RegionMatrix[r + REGION_FIRST_CHILD] = l * PPR;\n            w = RegionMatrix[r + REGION_SIZE] / 2; // new size (half)\n\n            // NOTE: we use screen coordinates\n            // from Top Left to Bottom Right\n\n            // Top Left sub-region\n            g = RegionMatrix[r + REGION_FIRST_CHILD];\n\n            RegionMatrix[g + REGION_NODE] = -1;\n            RegionMatrix[g + REGION_CENTER_X] =\n              RegionMatrix[r + REGION_CENTER_X] - w;\n            RegionMatrix[g + REGION_CENTER_Y] =\n              RegionMatrix[r + REGION_CENTER_Y] - w;\n            RegionMatrix[g + REGION_SIZE] = w;\n            RegionMatrix[g + REGION_NEXT_SIBLING] = g + PPR;\n            RegionMatrix[g + REGION_FIRST_CHILD] = -1;\n            RegionMatrix[g + REGION_MASS] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_X] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_Y] = 0;\n\n            // Bottom Left sub-region\n            g += PPR;\n            RegionMatrix[g + REGION_NODE] = -1;\n            RegionMatrix[g + REGION_CENTER_X] =\n              RegionMatrix[r + REGION_CENTER_X] - w;\n            RegionMatrix[g + REGION_CENTER_Y] =\n              RegionMatrix[r + REGION_CENTER_Y] + w;\n            RegionMatrix[g + REGION_SIZE] = w;\n            RegionMatrix[g + REGION_NEXT_SIBLING] = g + PPR;\n            RegionMatrix[g + REGION_FIRST_CHILD] = -1;\n            RegionMatrix[g + REGION_MASS] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_X] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_Y] = 0;\n\n            // Top Right sub-region\n            g += PPR;\n            RegionMatrix[g + REGION_NODE] = -1;\n            RegionMatrix[g + REGION_CENTER_X] =\n              RegionMatrix[r + REGION_CENTER_X] + w;\n            RegionMatrix[g + REGION_CENTER_Y] =\n              RegionMatrix[r + REGION_CENTER_Y] - w;\n            RegionMatrix[g + REGION_SIZE] = w;\n            RegionMatrix[g + REGION_NEXT_SIBLING] = g + PPR;\n            RegionMatrix[g + REGION_FIRST_CHILD] = -1;\n            RegionMatrix[g + REGION_MASS] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_X] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_Y] = 0;\n\n            // Bottom Right sub-region\n            g += PPR;\n            RegionMatrix[g + REGION_NODE] = -1;\n            RegionMatrix[g + REGION_CENTER_X] =\n              RegionMatrix[r + REGION_CENTER_X] + w;\n            RegionMatrix[g + REGION_CENTER_Y] =\n              RegionMatrix[r + REGION_CENTER_Y] + w;\n            RegionMatrix[g + REGION_SIZE] = w;\n            RegionMatrix[g + REGION_NEXT_SIBLING] =\n              RegionMatrix[r + REGION_NEXT_SIBLING];\n            RegionMatrix[g + REGION_FIRST_CHILD] = -1;\n            RegionMatrix[g + REGION_MASS] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_X] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_Y] = 0;\n\n            l += 4;\n\n            // Now the goal is to find two different sub-regions\n            // for the two nodes: the one previously recorded (r[0])\n            // and the one we want to add (n)\n\n            // Find the quadrant of the old node\n            if (\n              NodeMatrix[RegionMatrix[r + REGION_NODE] + NODE_X] <\n              RegionMatrix[r + REGION_CENTER_X]\n            ) {\n              if (\n                NodeMatrix[RegionMatrix[r + REGION_NODE] + NODE_Y] <\n                RegionMatrix[r + REGION_CENTER_Y]\n              ) {\n                // Top Left quarter\n                q = RegionMatrix[r + REGION_FIRST_CHILD];\n              } else {\n                // Bottom Left quarter\n                q = RegionMatrix[r + REGION_FIRST_CHILD] + PPR;\n              }\n            } else {\n              if (\n                NodeMatrix[RegionMatrix[r + REGION_NODE] + NODE_Y] <\n                RegionMatrix[r + REGION_CENTER_Y]\n              ) {\n                // Top Right quarter\n                q = RegionMatrix[r + REGION_FIRST_CHILD] + PPR * 2;\n              } else {\n                // Bottom Right quarter\n                q = RegionMatrix[r + REGION_FIRST_CHILD] + PPR * 3;\n              }\n            }\n\n            // We remove r[0] from the region r, add its mass to r and record it in q\n            RegionMatrix[r + REGION_MASS] =\n              NodeMatrix[RegionMatrix[r + REGION_NODE] + NODE_MASS];\n            RegionMatrix[r + REGION_MASS_CENTER_X] =\n              NodeMatrix[RegionMatrix[r + REGION_NODE] + NODE_X];\n            RegionMatrix[r + REGION_MASS_CENTER_Y] =\n              NodeMatrix[RegionMatrix[r + REGION_NODE] + NODE_Y];\n\n            RegionMatrix[q + REGION_NODE] = RegionMatrix[r + REGION_NODE];\n            RegionMatrix[r + REGION_NODE] = -1;\n\n            // Find the quadrant of n\n            if (NodeMatrix[n + NODE_X] < RegionMatrix[r + REGION_CENTER_X]) {\n              if (NodeMatrix[n + NODE_Y] < RegionMatrix[r + REGION_CENTER_Y]) {\n                // Top Left quarter\n                q2 = RegionMatrix[r + REGION_FIRST_CHILD];\n              } else {\n                // Bottom Left quarter\n                q2 = RegionMatrix[r + REGION_FIRST_CHILD] + PPR;\n              }\n            } else {\n              if (NodeMatrix[n + NODE_Y] < RegionMatrix[r + REGION_CENTER_Y]) {\n                // Top Right quarter\n                q2 = RegionMatrix[r + REGION_FIRST_CHILD] + PPR * 2;\n              } else {\n                // Bottom Right quarter\n                q2 = RegionMatrix[r + REGION_FIRST_CHILD] + PPR * 3;\n              }\n            }\n\n            if (q === q2) {\n              // If both nodes are in the same quadrant,\n              // we have to try it again on this quadrant\n              if (subdivisionAttempts--) {\n                r = q;\n                continue; // while\n              } else {\n                // we are out of precision here, and we cannot subdivide anymore\n                // but we have to break the loop anyway\n                subdivisionAttempts = SUBDIVISION_ATTEMPTS;\n                break; // while\n              }\n            }\n\n            // If both quadrants are different, we record n\n            // in its quadrant\n            RegionMatrix[q2 + REGION_NODE] = n;\n            break;\n          }\n        }\n      }\n    }\n  }\n\n  // 2) Repulsion\n  //--------------\n  // NOTES: adjustSizes = antiCollision & scalingRatio = coefficient\n\n  if (options.barnesHutOptimize) {\n    coefficient = options.scalingRatio;\n\n    // Applying repulsion through regions\n    for (n = 0; n < order; n += PPN) {\n      // Computing leaf quad nodes iteration\n\n      r = 0; // Starting with root region\n      while (true) {\n        if (RegionMatrix[r + REGION_FIRST_CHILD] >= 0) {\n          // The region has sub-regions\n\n          // We run the Barnes Hut test to see if we are at the right distance\n          distance =\n            Math.pow(\n              NodeMatrix[n + NODE_X] - RegionMatrix[r + REGION_MASS_CENTER_X],\n              2\n            ) +\n            Math.pow(\n              NodeMatrix[n + NODE_Y] - RegionMatrix[r + REGION_MASS_CENTER_Y],\n              2\n            );\n\n          s = RegionMatrix[r + REGION_SIZE];\n\n          if ((4 * s * s) / distance < thetaSquared) {\n            // We treat the region as a single body, and we repulse\n\n            xDist =\n              NodeMatrix[n + NODE_X] - RegionMatrix[r + REGION_MASS_CENTER_X];\n            yDist =\n              NodeMatrix[n + NODE_Y] - RegionMatrix[r + REGION_MASS_CENTER_Y];\n\n            if (adjustSizes === true) {\n              //-- Linear Anti-collision Repulsion\n              if (distance > 0) {\n                factor =\n                  (coefficient *\n                    NodeMatrix[n + NODE_MASS] *\n                    RegionMatrix[r + REGION_MASS]) /\n                  distance;\n\n                NodeMatrix[n + NODE_DX] += xDist * factor;\n                NodeMatrix[n + NODE_DY] += yDist * factor;\n              } else if (distance < 0) {\n                factor =\n                  (-coefficient *\n                    NodeMatrix[n + NODE_MASS] *\n                    RegionMatrix[r + REGION_MASS]) /\n                  Math.sqrt(distance);\n\n                NodeMatrix[n + NODE_DX] += xDist * factor;\n                NodeMatrix[n + NODE_DY] += yDist * factor;\n              }\n            } else {\n              //-- Linear Repulsion\n              if (distance > 0) {\n                factor =\n                  (coefficient *\n                    NodeMatrix[n + NODE_MASS] *\n                    RegionMatrix[r + REGION_MASS]) /\n                  distance;\n\n                NodeMatrix[n + NODE_DX] += xDist * factor;\n                NodeMatrix[n + NODE_DY] += yDist * factor;\n              }\n            }\n\n            // When this is done, we iterate. We have to look at the next sibling.\n            r = RegionMatrix[r + REGION_NEXT_SIBLING];\n            if (r < 0) break; // No next sibling: we have finished the tree\n\n            continue;\n          } else {\n            // The region is too close and we have to look at sub-regions\n            r = RegionMatrix[r + REGION_FIRST_CHILD];\n            continue;\n          }\n        } else {\n          // The region has no sub-region\n          // If there is a node r[0] and it is not n, then repulse\n          rn = RegionMatrix[r + REGION_NODE];\n\n          if (rn >= 0 && rn !== n) {\n            xDist = NodeMatrix[n + NODE_X] - NodeMatrix[rn + NODE_X];\n            yDist = NodeMatrix[n + NODE_Y] - NodeMatrix[rn + NODE_Y];\n\n            distance = xDist * xDist + yDist * yDist;\n\n            if (adjustSizes === true) {\n              //-- Linear Anti-collision Repulsion\n              if (distance > 0) {\n                factor =\n                  (coefficient *\n                    NodeMatrix[n + NODE_MASS] *\n                    NodeMatrix[rn + NODE_MASS]) /\n                  distance;\n\n                NodeMatrix[n + NODE_DX] += xDist * factor;\n                NodeMatrix[n + NODE_DY] += yDist * factor;\n              } else if (distance < 0) {\n                factor =\n                  (-coefficient *\n                    NodeMatrix[n + NODE_MASS] *\n                    NodeMatrix[rn + NODE_MASS]) /\n                  Math.sqrt(distance);\n\n                NodeMatrix[n + NODE_DX] += xDist * factor;\n                NodeMatrix[n + NODE_DY] += yDist * factor;\n              }\n            } else {\n              //-- Linear Repulsion\n              if (distance > 0) {\n                factor =\n                  (coefficient *\n                    NodeMatrix[n + NODE_MASS] *\n                    NodeMatrix[rn + NODE_MASS]) /\n                  distance;\n\n                NodeMatrix[n + NODE_DX] += xDist * factor;\n                NodeMatrix[n + NODE_DY] += yDist * factor;\n              }\n            }\n          }\n\n          // When this is done, we iterate. We have to look at the next sibling.\n          r = RegionMatrix[r + REGION_NEXT_SIBLING];\n\n          if (r < 0) break; // No next sibling: we have finished the tree\n\n          continue;\n        }\n      }\n    }\n  } else {\n    coefficient = options.scalingRatio;\n\n    // Square iteration\n    for (n1 = 0; n1 < order; n1 += PPN) {\n      for (n2 = 0; n2 < n1; n2 += PPN) {\n        // Common to both methods\n        xDist = NodeMatrix[n1 + NODE_X] - NodeMatrix[n2 + NODE_X];\n        yDist = NodeMatrix[n1 + NODE_Y] - NodeMatrix[n2 + NODE_Y];\n\n        if (adjustSizes === true) {\n          //-- Anticollision Linear Repulsion\n          distance =\n            Math.sqrt(xDist * xDist + yDist * yDist) -\n            NodeMatrix[n1 + NODE_SIZE] -\n            NodeMatrix[n2 + NODE_SIZE];\n\n          if (distance > 0) {\n            factor =\n              (coefficient *\n                NodeMatrix[n1 + NODE_MASS] *\n                NodeMatrix[n2 + NODE_MASS]) /\n              distance /\n              distance;\n\n            // Updating nodes' dx and dy\n            NodeMatrix[n1 + NODE_DX] += xDist * factor;\n            NodeMatrix[n1 + NODE_DY] += yDist * factor;\n\n            NodeMatrix[n2 + NODE_DX] -= xDist * factor;\n            NodeMatrix[n2 + NODE_DY] -= yDist * factor;\n          } else if (distance < 0) {\n            factor =\n              100 *\n              coefficient *\n              NodeMatrix[n1 + NODE_MASS] *\n              NodeMatrix[n2 + NODE_MASS];\n\n            // Updating nodes' dx and dy\n            NodeMatrix[n1 + NODE_DX] += xDist * factor;\n            NodeMatrix[n1 + NODE_DY] += yDist * factor;\n\n            NodeMatrix[n2 + NODE_DX] -= xDist * factor;\n            NodeMatrix[n2 + NODE_DY] -= yDist * factor;\n          }\n        } else {\n          //-- Linear Repulsion\n          distance = Math.sqrt(xDist * xDist + yDist * yDist);\n\n          if (distance > 0) {\n            factor =\n              (coefficient *\n                NodeMatrix[n1 + NODE_MASS] *\n                NodeMatrix[n2 + NODE_MASS]) /\n              distance /\n              distance;\n\n            // Updating nodes' dx and dy\n            NodeMatrix[n1 + NODE_DX] += xDist * factor;\n            NodeMatrix[n1 + NODE_DY] += yDist * factor;\n\n            NodeMatrix[n2 + NODE_DX] -= xDist * factor;\n            NodeMatrix[n2 + NODE_DY] -= yDist * factor;\n          }\n        }\n      }\n    }\n  }\n\n  // 3) Gravity\n  //------------\n  g = options.gravity / options.scalingRatio;\n  coefficient = options.scalingRatio;\n  for (n = 0; n < order; n += PPN) {\n    factor = 0;\n\n    // Common to both methods\n    xDist = NodeMatrix[n + NODE_X];\n    yDist = NodeMatrix[n + NODE_Y];\n    distance = Math.sqrt(Math.pow(xDist, 2) + Math.pow(yDist, 2));\n\n    if (options.strongGravityMode) {\n      //-- Strong gravity\n      if (distance > 0) factor = coefficient * NodeMatrix[n + NODE_MASS] * g;\n    } else {\n      //-- Linear Anti-collision Repulsion n\n      if (distance > 0)\n        factor = (coefficient * NodeMatrix[n + NODE_MASS] * g) / distance;\n    }\n\n    // Updating node's dx and dy\n    NodeMatrix[n + NODE_DX] -= xDist * factor;\n    NodeMatrix[n + NODE_DY] -= yDist * factor;\n  }\n\n  // 4) Attraction\n  //---------------\n  coefficient =\n    1 * (options.outboundAttractionDistribution ? outboundAttCompensation : 1);\n\n  // TODO: simplify distance\n  // TODO: coefficient is always used as -c --> optimize?\n  for (e = 0; e < size; e += PPE) {\n    n1 = EdgeMatrix[e + EDGE_SOURCE];\n    n2 = EdgeMatrix[e + EDGE_TARGET];\n    w = EdgeMatrix[e + EDGE_WEIGHT];\n\n    // Edge weight influence\n    ewc = Math.pow(w, options.edgeWeightInfluence);\n\n    // Common measures\n    xDist = NodeMatrix[n1 + NODE_X] - NodeMatrix[n2 + NODE_X];\n    yDist = NodeMatrix[n1 + NODE_Y] - NodeMatrix[n2 + NODE_Y];\n\n    // Applying attraction to nodes\n    if (adjustSizes === true) {\n      distance =\n        Math.sqrt(xDist * xDist + yDist * yDist) -\n        NodeMatrix[n1 + NODE_SIZE] -\n        NodeMatrix[n2 + NODE_SIZE];\n\n      if (options.linLogMode) {\n        if (options.outboundAttractionDistribution) {\n          //-- LinLog Degree Distributed Anti-collision Attraction\n          if (distance > 0) {\n            factor =\n              (-coefficient * ewc * Math.log(1 + distance)) /\n              distance /\n              NodeMatrix[n1 + NODE_MASS];\n          }\n        } else {\n          //-- LinLog Anti-collision Attraction\n          if (distance > 0) {\n            factor = (-coefficient * ewc * Math.log(1 + distance)) / distance;\n          }\n        }\n      } else {\n        if (options.outboundAttractionDistribution) {\n          //-- Linear Degree Distributed Anti-collision Attraction\n          if (distance > 0) {\n            factor = (-coefficient * ewc) / NodeMatrix[n1 + NODE_MASS];\n          }\n        } else {\n          //-- Linear Anti-collision Attraction\n          if (distance > 0) {\n            factor = -coefficient * ewc;\n          }\n        }\n      }\n    } else {\n      distance = Math.sqrt(Math.pow(xDist, 2) + Math.pow(yDist, 2));\n\n      if (options.linLogMode) {\n        if (options.outboundAttractionDistribution) {\n          //-- LinLog Degree Distributed Attraction\n          if (distance > 0) {\n            factor =\n              (-coefficient * ewc * Math.log(1 + distance)) /\n              distance /\n              NodeMatrix[n1 + NODE_MASS];\n          }\n        } else {\n          //-- LinLog Attraction\n          if (distance > 0)\n            factor = (-coefficient * ewc * Math.log(1 + distance)) / distance;\n        }\n      } else {\n        if (options.outboundAttractionDistribution) {\n          //-- Linear Attraction Mass Distributed\n          // NOTE: Distance is set to 1 to override next condition\n          distance = 1;\n          factor = (-coefficient * ewc) / NodeMatrix[n1 + NODE_MASS];\n        } else {\n          //-- Linear Attraction\n          // NOTE: Distance is set to 1 to override next condition\n          distance = 1;\n          factor = -coefficient * ewc;\n        }\n      }\n    }\n\n    // Updating nodes' dx and dy\n    // TODO: if condition or factor = 1?\n    if (distance > 0) {\n      // Updating nodes' dx and dy\n      NodeMatrix[n1 + NODE_DX] += xDist * factor;\n      NodeMatrix[n1 + NODE_DY] += yDist * factor;\n\n      NodeMatrix[n2 + NODE_DX] -= xDist * factor;\n      NodeMatrix[n2 + NODE_DY] -= yDist * factor;\n    }\n  }\n\n  // 5) Apply Forces\n  //-----------------\n  var force, swinging, traction, nodespeed, newX, newY;\n\n  // MATH: sqrt and square distances\n  if (adjustSizes === true) {\n    for (n = 0; n < order; n += PPN) {\n      if (NodeMatrix[n + NODE_FIXED] !== 1) {\n        force = Math.sqrt(\n          Math.pow(NodeMatrix[n + NODE_DX], 2) +\n            Math.pow(NodeMatrix[n + NODE_DY], 2)\n        );\n\n        if (force > MAX_FORCE) {\n          NodeMatrix[n + NODE_DX] =\n            (NodeMatrix[n + NODE_DX] * MAX_FORCE) / force;\n          NodeMatrix[n + NODE_DY] =\n            (NodeMatrix[n + NODE_DY] * MAX_FORCE) / force;\n        }\n\n        swinging =\n          NodeMatrix[n + NODE_MASS] *\n          Math.sqrt(\n            (NodeMatrix[n + NODE_OLD_DX] - NodeMatrix[n + NODE_DX]) *\n              (NodeMatrix[n + NODE_OLD_DX] - NodeMatrix[n + NODE_DX]) +\n              (NodeMatrix[n + NODE_OLD_DY] - NodeMatrix[n + NODE_DY]) *\n                (NodeMatrix[n + NODE_OLD_DY] - NodeMatrix[n + NODE_DY])\n          );\n\n        traction =\n          Math.sqrt(\n            (NodeMatrix[n + NODE_OLD_DX] + NodeMatrix[n + NODE_DX]) *\n              (NodeMatrix[n + NODE_OLD_DX] + NodeMatrix[n + NODE_DX]) +\n              (NodeMatrix[n + NODE_OLD_DY] + NodeMatrix[n + NODE_DY]) *\n                (NodeMatrix[n + NODE_OLD_DY] + NodeMatrix[n + NODE_DY])\n          ) / 2;\n\n        nodespeed = (0.1 * Math.log(1 + traction)) / (1 + Math.sqrt(swinging));\n\n        // Updating node's positon\n        newX =\n          NodeMatrix[n + NODE_X] +\n          NodeMatrix[n + NODE_DX] * (nodespeed / options.slowDown);\n        NodeMatrix[n + NODE_X] = newX;\n\n        newY =\n          NodeMatrix[n + NODE_Y] +\n          NodeMatrix[n + NODE_DY] * (nodespeed / options.slowDown);\n        NodeMatrix[n + NODE_Y] = newY;\n      }\n    }\n  } else {\n    for (n = 0; n < order; n += PPN) {\n      if (NodeMatrix[n + NODE_FIXED] !== 1) {\n        swinging =\n          NodeMatrix[n + NODE_MASS] *\n          Math.sqrt(\n            (NodeMatrix[n + NODE_OLD_DX] - NodeMatrix[n + NODE_DX]) *\n              (NodeMatrix[n + NODE_OLD_DX] - NodeMatrix[n + NODE_DX]) +\n              (NodeMatrix[n + NODE_OLD_DY] - NodeMatrix[n + NODE_DY]) *\n                (NodeMatrix[n + NODE_OLD_DY] - NodeMatrix[n + NODE_DY])\n          );\n\n        traction =\n          Math.sqrt(\n            (NodeMatrix[n + NODE_OLD_DX] + NodeMatrix[n + NODE_DX]) *\n              (NodeMatrix[n + NODE_OLD_DX] + NodeMatrix[n + NODE_DX]) +\n              (NodeMatrix[n + NODE_OLD_DY] + NodeMatrix[n + NODE_DY]) *\n                (NodeMatrix[n + NODE_OLD_DY] + NodeMatrix[n + NODE_DY])\n          ) / 2;\n\n        nodespeed =\n          (NodeMatrix[n + NODE_CONVERGENCE] * Math.log(1 + traction)) /\n          (1 + Math.sqrt(swinging));\n\n        // Updating node convergence\n        NodeMatrix[n + NODE_CONVERGENCE] = Math.min(\n          1,\n          Math.sqrt(\n            (nodespeed *\n              (Math.pow(NodeMatrix[n + NODE_DX], 2) +\n                Math.pow(NodeMatrix[n + NODE_DY], 2))) /\n              (1 + Math.sqrt(swinging))\n          )\n        );\n\n        // Updating node's positon\n        newX =\n          NodeMatrix[n + NODE_X] +\n          NodeMatrix[n + NODE_DX] * (nodespeed / options.slowDown);\n        NodeMatrix[n + NODE_X] = newX;\n\n        newY =\n          NodeMatrix[n + NODE_Y] +\n          NodeMatrix[n + NODE_DY] * (nodespeed / options.slowDown);\n        NodeMatrix[n + NODE_Y] = newY;\n      }\n    }\n  }\n\n  // We return the information about the layout (no need to return the matrices)\n  return {};\n};\n","/**\n * Graphology ForceAtlas2 Layout Webworker\n * ========================================\n *\n * Web worker able to run the layout in a separate thread.\n */\nmodule.exports = function worker() {\n  var NODES, EDGES;\n\n  var moduleShim = {};\n\n  (function () {\n    /* eslint no-constant-condition: 0 */\n/**\n * Graphology ForceAtlas2 Iteration\n * =================================\n *\n * Function used to perform a single iteration of the algorithm.\n */\n\n/**\n * Matrices properties accessors.\n */\nvar NODE_X = 0;\nvar NODE_Y = 1;\nvar NODE_DX = 2;\nvar NODE_DY = 3;\nvar NODE_OLD_DX = 4;\nvar NODE_OLD_DY = 5;\nvar NODE_MASS = 6;\nvar NODE_CONVERGENCE = 7;\nvar NODE_SIZE = 8;\nvar NODE_FIXED = 9;\n\nvar EDGE_SOURCE = 0;\nvar EDGE_TARGET = 1;\nvar EDGE_WEIGHT = 2;\n\nvar REGION_NODE = 0;\nvar REGION_CENTER_X = 1;\nvar REGION_CENTER_Y = 2;\nvar REGION_SIZE = 3;\nvar REGION_NEXT_SIBLING = 4;\nvar REGION_FIRST_CHILD = 5;\nvar REGION_MASS = 6;\nvar REGION_MASS_CENTER_X = 7;\nvar REGION_MASS_CENTER_Y = 8;\n\nvar SUBDIVISION_ATTEMPTS = 3;\n\n/**\n * Constants.\n */\nvar PPN = 10;\nvar PPE = 3;\nvar PPR = 9;\n\nvar MAX_FORCE = 10;\n\n/**\n * Function used to perform a single interation of the algorithm.\n *\n * @param  {object}       options    - Layout options.\n * @param  {Float32Array} NodeMatrix - Node data.\n * @param  {Float32Array} EdgeMatrix - Edge data.\n * @return {object}                  - Some metadata.\n */\nmoduleShim.exports = function iterate(options, NodeMatrix, EdgeMatrix) {\n  // Initializing variables\n  var l, r, n, n1, n2, rn, e, w, g, s;\n\n  var order = NodeMatrix.length,\n    size = EdgeMatrix.length;\n\n  var adjustSizes = options.adjustSizes;\n\n  var thetaSquared = options.barnesHutTheta * options.barnesHutTheta;\n\n  var outboundAttCompensation, coefficient, xDist, yDist, ewc, distance, factor;\n\n  var RegionMatrix = [];\n\n  // 1) Initializing layout data\n  //-----------------------------\n\n  // Resetting positions & computing max values\n  for (n = 0; n < order; n += PPN) {\n    NodeMatrix[n + NODE_OLD_DX] = NodeMatrix[n + NODE_DX];\n    NodeMatrix[n + NODE_OLD_DY] = NodeMatrix[n + NODE_DY];\n    NodeMatrix[n + NODE_DX] = 0;\n    NodeMatrix[n + NODE_DY] = 0;\n  }\n\n  // If outbound attraction distribution, compensate\n  if (options.outboundAttractionDistribution) {\n    outboundAttCompensation = 0;\n    for (n = 0; n < order; n += PPN) {\n      outboundAttCompensation += NodeMatrix[n + NODE_MASS];\n    }\n\n    outboundAttCompensation /= order / PPN;\n  }\n\n  // 1.bis) Barnes-Hut computation\n  //------------------------------\n\n  if (options.barnesHutOptimize) {\n    // Setting up\n    var minX = Infinity,\n      maxX = -Infinity,\n      minY = Infinity,\n      maxY = -Infinity,\n      q,\n      q2,\n      subdivisionAttempts;\n\n    // Computing min and max values\n    for (n = 0; n < order; n += PPN) {\n      minX = Math.min(minX, NodeMatrix[n + NODE_X]);\n      maxX = Math.max(maxX, NodeMatrix[n + NODE_X]);\n      minY = Math.min(minY, NodeMatrix[n + NODE_Y]);\n      maxY = Math.max(maxY, NodeMatrix[n + NODE_Y]);\n    }\n\n    // squarify bounds, it's a quadtree\n    var dx = maxX - minX,\n      dy = maxY - minY;\n    if (dx > dy) {\n      minY -= (dx - dy) / 2;\n      maxY = minY + dx;\n    } else {\n      minX -= (dy - dx) / 2;\n      maxX = minX + dy;\n    }\n\n    // Build the Barnes Hut root region\n    RegionMatrix[0 + REGION_NODE] = -1;\n    RegionMatrix[0 + REGION_CENTER_X] = (minX + maxX) / 2;\n    RegionMatrix[0 + REGION_CENTER_Y] = (minY + maxY) / 2;\n    RegionMatrix[0 + REGION_SIZE] = Math.max(maxX - minX, maxY - minY);\n    RegionMatrix[0 + REGION_NEXT_SIBLING] = -1;\n    RegionMatrix[0 + REGION_FIRST_CHILD] = -1;\n    RegionMatrix[0 + REGION_MASS] = 0;\n    RegionMatrix[0 + REGION_MASS_CENTER_X] = 0;\n    RegionMatrix[0 + REGION_MASS_CENTER_Y] = 0;\n\n    // Add each node in the tree\n    l = 1;\n    for (n = 0; n < order; n += PPN) {\n      // Current region, starting with root\n      r = 0;\n      subdivisionAttempts = SUBDIVISION_ATTEMPTS;\n\n      while (true) {\n        // Are there sub-regions?\n\n        // We look at first child index\n        if (RegionMatrix[r + REGION_FIRST_CHILD] >= 0) {\n          // There are sub-regions\n\n          // We just iterate to find a \"leaf\" of the tree\n          // that is an empty region or a region with a single node\n          // (see next case)\n\n          // Find the quadrant of n\n          if (NodeMatrix[n + NODE_X] < RegionMatrix[r + REGION_CENTER_X]) {\n            if (NodeMatrix[n + NODE_Y] < RegionMatrix[r + REGION_CENTER_Y]) {\n              // Top Left quarter\n              q = RegionMatrix[r + REGION_FIRST_CHILD];\n            } else {\n              // Bottom Left quarter\n              q = RegionMatrix[r + REGION_FIRST_CHILD] + PPR;\n            }\n          } else {\n            if (NodeMatrix[n + NODE_Y] < RegionMatrix[r + REGION_CENTER_Y]) {\n              // Top Right quarter\n              q = RegionMatrix[r + REGION_FIRST_CHILD] + PPR * 2;\n            } else {\n              // Bottom Right quarter\n              q = RegionMatrix[r + REGION_FIRST_CHILD] + PPR * 3;\n            }\n          }\n\n          // Update center of mass and mass (we only do it for non-leave regions)\n          RegionMatrix[r + REGION_MASS_CENTER_X] =\n            (RegionMatrix[r + REGION_MASS_CENTER_X] *\n              RegionMatrix[r + REGION_MASS] +\n              NodeMatrix[n + NODE_X] * NodeMatrix[n + NODE_MASS]) /\n            (RegionMatrix[r + REGION_MASS] + NodeMatrix[n + NODE_MASS]);\n\n          RegionMatrix[r + REGION_MASS_CENTER_Y] =\n            (RegionMatrix[r + REGION_MASS_CENTER_Y] *\n              RegionMatrix[r + REGION_MASS] +\n              NodeMatrix[n + NODE_Y] * NodeMatrix[n + NODE_MASS]) /\n            (RegionMatrix[r + REGION_MASS] + NodeMatrix[n + NODE_MASS]);\n\n          RegionMatrix[r + REGION_MASS] += NodeMatrix[n + NODE_MASS];\n\n          // Iterate on the right quadrant\n          r = q;\n          continue;\n        } else {\n          // There are no sub-regions: we are in a \"leaf\"\n\n          // Is there a node in this leave?\n          if (RegionMatrix[r + REGION_NODE] < 0) {\n            // There is no node in region:\n            // we record node n and go on\n            RegionMatrix[r + REGION_NODE] = n;\n            break;\n          } else {\n            // There is a node in this region\n\n            // We will need to create sub-regions, stick the two\n            // nodes (the old one r[0] and the new one n) in two\n            // subregions. If they fall in the same quadrant,\n            // we will iterate.\n\n            // Create sub-regions\n            RegionMatrix[r + REGION_FIRST_CHILD] = l * PPR;\n            w = RegionMatrix[r + REGION_SIZE] / 2; // new size (half)\n\n            // NOTE: we use screen coordinates\n            // from Top Left to Bottom Right\n\n            // Top Left sub-region\n            g = RegionMatrix[r + REGION_FIRST_CHILD];\n\n            RegionMatrix[g + REGION_NODE] = -1;\n            RegionMatrix[g + REGION_CENTER_X] =\n              RegionMatrix[r + REGION_CENTER_X] - w;\n            RegionMatrix[g + REGION_CENTER_Y] =\n              RegionMatrix[r + REGION_CENTER_Y] - w;\n            RegionMatrix[g + REGION_SIZE] = w;\n            RegionMatrix[g + REGION_NEXT_SIBLING] = g + PPR;\n            RegionMatrix[g + REGION_FIRST_CHILD] = -1;\n            RegionMatrix[g + REGION_MASS] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_X] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_Y] = 0;\n\n            // Bottom Left sub-region\n            g += PPR;\n            RegionMatrix[g + REGION_NODE] = -1;\n            RegionMatrix[g + REGION_CENTER_X] =\n              RegionMatrix[r + REGION_CENTER_X] - w;\n            RegionMatrix[g + REGION_CENTER_Y] =\n              RegionMatrix[r + REGION_CENTER_Y] + w;\n            RegionMatrix[g + REGION_SIZE] = w;\n            RegionMatrix[g + REGION_NEXT_SIBLING] = g + PPR;\n            RegionMatrix[g + REGION_FIRST_CHILD] = -1;\n            RegionMatrix[g + REGION_MASS] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_X] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_Y] = 0;\n\n            // Top Right sub-region\n            g += PPR;\n            RegionMatrix[g + REGION_NODE] = -1;\n            RegionMatrix[g + REGION_CENTER_X] =\n              RegionMatrix[r + REGION_CENTER_X] + w;\n            RegionMatrix[g + REGION_CENTER_Y] =\n              RegionMatrix[r + REGION_CENTER_Y] - w;\n            RegionMatrix[g + REGION_SIZE] = w;\n            RegionMatrix[g + REGION_NEXT_SIBLING] = g + PPR;\n            RegionMatrix[g + REGION_FIRST_CHILD] = -1;\n            RegionMatrix[g + REGION_MASS] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_X] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_Y] = 0;\n\n            // Bottom Right sub-region\n            g += PPR;\n            RegionMatrix[g + REGION_NODE] = -1;\n            RegionMatrix[g + REGION_CENTER_X] =\n              RegionMatrix[r + REGION_CENTER_X] + w;\n            RegionMatrix[g + REGION_CENTER_Y] =\n              RegionMatrix[r + REGION_CENTER_Y] + w;\n            RegionMatrix[g + REGION_SIZE] = w;\n            RegionMatrix[g + REGION_NEXT_SIBLING] =\n              RegionMatrix[r + REGION_NEXT_SIBLING];\n            RegionMatrix[g + REGION_FIRST_CHILD] = -1;\n            RegionMatrix[g + REGION_MASS] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_X] = 0;\n            RegionMatrix[g + REGION_MASS_CENTER_Y] = 0;\n\n            l += 4;\n\n            // Now the goal is to find two different sub-regions\n            // for the two nodes: the one previously recorded (r[0])\n            // and the one we want to add (n)\n\n            // Find the quadrant of the old node\n            if (\n              NodeMatrix[RegionMatrix[r + REGION_NODE] + NODE_X] <\n              RegionMatrix[r + REGION_CENTER_X]\n            ) {\n              if (\n                NodeMatrix[RegionMatrix[r + REGION_NODE] + NODE_Y] <\n                RegionMatrix[r + REGION_CENTER_Y]\n              ) {\n                // Top Left quarter\n                q = RegionMatrix[r + REGION_FIRST_CHILD];\n              } else {\n                // Bottom Left quarter\n                q = RegionMatrix[r + REGION_FIRST_CHILD] + PPR;\n              }\n            } else {\n              if (\n                NodeMatrix[RegionMatrix[r + REGION_NODE] + NODE_Y] <\n                RegionMatrix[r + REGION_CENTER_Y]\n              ) {\n                // Top Right quarter\n                q = RegionMatrix[r + REGION_FIRST_CHILD] + PPR * 2;\n              } else {\n                // Bottom Right quarter\n                q = RegionMatrix[r + REGION_FIRST_CHILD] + PPR * 3;\n              }\n            }\n\n            // We remove r[0] from the region r, add its mass to r and record it in q\n            RegionMatrix[r + REGION_MASS] =\n              NodeMatrix[RegionMatrix[r + REGION_NODE] + NODE_MASS];\n            RegionMatrix[r + REGION_MASS_CENTER_X] =\n              NodeMatrix[RegionMatrix[r + REGION_NODE] + NODE_X];\n            RegionMatrix[r + REGION_MASS_CENTER_Y] =\n              NodeMatrix[RegionMatrix[r + REGION_NODE] + NODE_Y];\n\n            RegionMatrix[q + REGION_NODE] = RegionMatrix[r + REGION_NODE];\n            RegionMatrix[r + REGION_NODE] = -1;\n\n            // Find the quadrant of n\n            if (NodeMatrix[n + NODE_X] < RegionMatrix[r + REGION_CENTER_X]) {\n              if (NodeMatrix[n + NODE_Y] < RegionMatrix[r + REGION_CENTER_Y]) {\n                // Top Left quarter\n                q2 = RegionMatrix[r + REGION_FIRST_CHILD];\n              } else {\n                // Bottom Left quarter\n                q2 = RegionMatrix[r + REGION_FIRST_CHILD] + PPR;\n              }\n            } else {\n              if (NodeMatrix[n + NODE_Y] < RegionMatrix[r + REGION_CENTER_Y]) {\n                // Top Right quarter\n                q2 = RegionMatrix[r + REGION_FIRST_CHILD] + PPR * 2;\n              } else {\n                // Bottom Right quarter\n                q2 = RegionMatrix[r + REGION_FIRST_CHILD] + PPR * 3;\n              }\n            }\n\n            if (q === q2) {\n              // If both nodes are in the same quadrant,\n              // we have to try it again on this quadrant\n              if (subdivisionAttempts--) {\n                r = q;\n                continue; // while\n              } else {\n                // we are out of precision here, and we cannot subdivide anymore\n                // but we have to break the loop anyway\n                subdivisionAttempts = SUBDIVISION_ATTEMPTS;\n                break; // while\n              }\n            }\n\n            // If both quadrants are different, we record n\n            // in its quadrant\n            RegionMatrix[q2 + REGION_NODE] = n;\n            break;\n          }\n        }\n      }\n    }\n  }\n\n  // 2) Repulsion\n  //--------------\n  // NOTES: adjustSizes = antiCollision & scalingRatio = coefficient\n\n  if (options.barnesHutOptimize) {\n    coefficient = options.scalingRatio;\n\n    // Applying repulsion through regions\n    for (n = 0; n < order; n += PPN) {\n      // Computing leaf quad nodes iteration\n\n      r = 0; // Starting with root region\n      while (true) {\n        if (RegionMatrix[r + REGION_FIRST_CHILD] >= 0) {\n          // The region has sub-regions\n\n          // We run the Barnes Hut test to see if we are at the right distance\n          distance =\n            Math.pow(\n              NodeMatrix[n + NODE_X] - RegionMatrix[r + REGION_MASS_CENTER_X],\n              2\n            ) +\n            Math.pow(\n              NodeMatrix[n + NODE_Y] - RegionMatrix[r + REGION_MASS_CENTER_Y],\n              2\n            );\n\n          s = RegionMatrix[r + REGION_SIZE];\n\n          if ((4 * s * s) / distance < thetaSquared) {\n            // We treat the region as a single body, and we repulse\n\n            xDist =\n              NodeMatrix[n + NODE_X] - RegionMatrix[r + REGION_MASS_CENTER_X];\n            yDist =\n              NodeMatrix[n + NODE_Y] - RegionMatrix[r + REGION_MASS_CENTER_Y];\n\n            if (adjustSizes === true) {\n              //-- Linear Anti-collision Repulsion\n              if (distance > 0) {\n                factor =\n                  (coefficient *\n                    NodeMatrix[n + NODE_MASS] *\n                    RegionMatrix[r + REGION_MASS]) /\n                  distance;\n\n                NodeMatrix[n + NODE_DX] += xDist * factor;\n                NodeMatrix[n + NODE_DY] += yDist * factor;\n              } else if (distance < 0) {\n                factor =\n                  (-coefficient *\n                    NodeMatrix[n + NODE_MASS] *\n                    RegionMatrix[r + REGION_MASS]) /\n                  Math.sqrt(distance);\n\n                NodeMatrix[n + NODE_DX] += xDist * factor;\n                NodeMatrix[n + NODE_DY] += yDist * factor;\n              }\n            } else {\n              //-- Linear Repulsion\n              if (distance > 0) {\n                factor =\n                  (coefficient *\n                    NodeMatrix[n + NODE_MASS] *\n                    RegionMatrix[r + REGION_MASS]) /\n                  distance;\n\n                NodeMatrix[n + NODE_DX] += xDist * factor;\n                NodeMatrix[n + NODE_DY] += yDist * factor;\n              }\n            }\n\n            // When this is done, we iterate. We have to look at the next sibling.\n            r = RegionMatrix[r + REGION_NEXT_SIBLING];\n            if (r < 0) break; // No next sibling: we have finished the tree\n\n            continue;\n          } else {\n            // The region is too close and we have to look at sub-regions\n            r = RegionMatrix[r + REGION_FIRST_CHILD];\n            continue;\n          }\n        } else {\n          // The region has no sub-region\n          // If there is a node r[0] and it is not n, then repulse\n          rn = RegionMatrix[r + REGION_NODE];\n\n          if (rn >= 0 && rn !== n) {\n            xDist = NodeMatrix[n + NODE_X] - NodeMatrix[rn + NODE_X];\n            yDist = NodeMatrix[n + NODE_Y] - NodeMatrix[rn + NODE_Y];\n\n            distance = xDist * xDist + yDist * yDist;\n\n            if (adjustSizes === true) {\n              //-- Linear Anti-collision Repulsion\n              if (distance > 0) {\n                factor =\n                  (coefficient *\n                    NodeMatrix[n + NODE_MASS] *\n                    NodeMatrix[rn + NODE_MASS]) /\n                  distance;\n\n                NodeMatrix[n + NODE_DX] += xDist * factor;\n                NodeMatrix[n + NODE_DY] += yDist * factor;\n              } else if (distance < 0) {\n                factor =\n                  (-coefficient *\n                    NodeMatrix[n + NODE_MASS] *\n                    NodeMatrix[rn + NODE_MASS]) /\n                  Math.sqrt(distance);\n\n                NodeMatrix[n + NODE_DX] += xDist * factor;\n                NodeMatrix[n + NODE_DY] += yDist * factor;\n              }\n            } else {\n              //-- Linear Repulsion\n              if (distance > 0) {\n                factor =\n                  (coefficient *\n                    NodeMatrix[n + NODE_MASS] *\n                    NodeMatrix[rn + NODE_MASS]) /\n                  distance;\n\n                NodeMatrix[n + NODE_DX] += xDist * factor;\n                NodeMatrix[n + NODE_DY] += yDist * factor;\n              }\n            }\n          }\n\n          // When this is done, we iterate. We have to look at the next sibling.\n          r = RegionMatrix[r + REGION_NEXT_SIBLING];\n\n          if (r < 0) break; // No next sibling: we have finished the tree\n\n          continue;\n        }\n      }\n    }\n  } else {\n    coefficient = options.scalingRatio;\n\n    // Square iteration\n    for (n1 = 0; n1 < order; n1 += PPN) {\n      for (n2 = 0; n2 < n1; n2 += PPN) {\n        // Common to both methods\n        xDist = NodeMatrix[n1 + NODE_X] - NodeMatrix[n2 + NODE_X];\n        yDist = NodeMatrix[n1 + NODE_Y] - NodeMatrix[n2 + NODE_Y];\n\n        if (adjustSizes === true) {\n          //-- Anticollision Linear Repulsion\n          distance =\n            Math.sqrt(xDist * xDist + yDist * yDist) -\n            NodeMatrix[n1 + NODE_SIZE] -\n            NodeMatrix[n2 + NODE_SIZE];\n\n          if (distance > 0) {\n            factor =\n              (coefficient *\n                NodeMatrix[n1 + NODE_MASS] *\n                NodeMatrix[n2 + NODE_MASS]) /\n              distance /\n              distance;\n\n            // Updating nodes' dx and dy\n            NodeMatrix[n1 + NODE_DX] += xDist * factor;\n            NodeMatrix[n1 + NODE_DY] += yDist * factor;\n\n            NodeMatrix[n2 + NODE_DX] -= xDist * factor;\n            NodeMatrix[n2 + NODE_DY] -= yDist * factor;\n          } else if (distance < 0) {\n            factor =\n              100 *\n              coefficient *\n              NodeMatrix[n1 + NODE_MASS] *\n              NodeMatrix[n2 + NODE_MASS];\n\n            // Updating nodes' dx and dy\n            NodeMatrix[n1 + NODE_DX] += xDist * factor;\n            NodeMatrix[n1 + NODE_DY] += yDist * factor;\n\n            NodeMatrix[n2 + NODE_DX] -= xDist * factor;\n            NodeMatrix[n2 + NODE_DY] -= yDist * factor;\n          }\n        } else {\n          //-- Linear Repulsion\n          distance = Math.sqrt(xDist * xDist + yDist * yDist);\n\n          if (distance > 0) {\n            factor =\n              (coefficient *\n                NodeMatrix[n1 + NODE_MASS] *\n                NodeMatrix[n2 + NODE_MASS]) /\n              distance /\n              distance;\n\n            // Updating nodes' dx and dy\n            NodeMatrix[n1 + NODE_DX] += xDist * factor;\n            NodeMatrix[n1 + NODE_DY] += yDist * factor;\n\n            NodeMatrix[n2 + NODE_DX] -= xDist * factor;\n            NodeMatrix[n2 + NODE_DY] -= yDist * factor;\n          }\n        }\n      }\n    }\n  }\n\n  // 3) Gravity\n  //------------\n  g = options.gravity / options.scalingRatio;\n  coefficient = options.scalingRatio;\n  for (n = 0; n < order; n += PPN) {\n    factor = 0;\n\n    // Common to both methods\n    xDist = NodeMatrix[n + NODE_X];\n    yDist = NodeMatrix[n + NODE_Y];\n    distance = Math.sqrt(Math.pow(xDist, 2) + Math.pow(yDist, 2));\n\n    if (options.strongGravityMode) {\n      //-- Strong gravity\n      if (distance > 0) factor = coefficient * NodeMatrix[n + NODE_MASS] * g;\n    } else {\n      //-- Linear Anti-collision Repulsion n\n      if (distance > 0)\n        factor = (coefficient * NodeMatrix[n + NODE_MASS] * g) / distance;\n    }\n\n    // Updating node's dx and dy\n    NodeMatrix[n + NODE_DX] -= xDist * factor;\n    NodeMatrix[n + NODE_DY] -= yDist * factor;\n  }\n\n  // 4) Attraction\n  //---------------\n  coefficient =\n    1 * (options.outboundAttractionDistribution ? outboundAttCompensation : 1);\n\n  // TODO: simplify distance\n  // TODO: coefficient is always used as -c --> optimize?\n  for (e = 0; e < size; e += PPE) {\n    n1 = EdgeMatrix[e + EDGE_SOURCE];\n    n2 = EdgeMatrix[e + EDGE_TARGET];\n    w = EdgeMatrix[e + EDGE_WEIGHT];\n\n    // Edge weight influence\n    ewc = Math.pow(w, options.edgeWeightInfluence);\n\n    // Common measures\n    xDist = NodeMatrix[n1 + NODE_X] - NodeMatrix[n2 + NODE_X];\n    yDist = NodeMatrix[n1 + NODE_Y] - NodeMatrix[n2 + NODE_Y];\n\n    // Applying attraction to nodes\n    if (adjustSizes === true) {\n      distance =\n        Math.sqrt(xDist * xDist + yDist * yDist) -\n        NodeMatrix[n1 + NODE_SIZE] -\n        NodeMatrix[n2 + NODE_SIZE];\n\n      if (options.linLogMode) {\n        if (options.outboundAttractionDistribution) {\n          //-- LinLog Degree Distributed Anti-collision Attraction\n          if (distance > 0) {\n            factor =\n              (-coefficient * ewc * Math.log(1 + distance)) /\n              distance /\n              NodeMatrix[n1 + NODE_MASS];\n          }\n        } else {\n          //-- LinLog Anti-collision Attraction\n          if (distance > 0) {\n            factor = (-coefficient * ewc * Math.log(1 + distance)) / distance;\n          }\n        }\n      } else {\n        if (options.outboundAttractionDistribution) {\n          //-- Linear Degree Distributed Anti-collision Attraction\n          if (distance > 0) {\n            factor = (-coefficient * ewc) / NodeMatrix[n1 + NODE_MASS];\n          }\n        } else {\n          //-- Linear Anti-collision Attraction\n          if (distance > 0) {\n            factor = -coefficient * ewc;\n          }\n        }\n      }\n    } else {\n      distance = Math.sqrt(Math.pow(xDist, 2) + Math.pow(yDist, 2));\n\n      if (options.linLogMode) {\n        if (options.outboundAttractionDistribution) {\n          //-- LinLog Degree Distributed Attraction\n          if (distance > 0) {\n            factor =\n              (-coefficient * ewc * Math.log(1 + distance)) /\n              distance /\n              NodeMatrix[n1 + NODE_MASS];\n          }\n        } else {\n          //-- LinLog Attraction\n          if (distance > 0)\n            factor = (-coefficient * ewc * Math.log(1 + distance)) / distance;\n        }\n      } else {\n        if (options.outboundAttractionDistribution) {\n          //-- Linear Attraction Mass Distributed\n          // NOTE: Distance is set to 1 to override next condition\n          distance = 1;\n          factor = (-coefficient * ewc) / NodeMatrix[n1 + NODE_MASS];\n        } else {\n          //-- Linear Attraction\n          // NOTE: Distance is set to 1 to override next condition\n          distance = 1;\n          factor = -coefficient * ewc;\n        }\n      }\n    }\n\n    // Updating nodes' dx and dy\n    // TODO: if condition or factor = 1?\n    if (distance > 0) {\n      // Updating nodes' dx and dy\n      NodeMatrix[n1 + NODE_DX] += xDist * factor;\n      NodeMatrix[n1 + NODE_DY] += yDist * factor;\n\n      NodeMatrix[n2 + NODE_DX] -= xDist * factor;\n      NodeMatrix[n2 + NODE_DY] -= yDist * factor;\n    }\n  }\n\n  // 5) Apply Forces\n  //-----------------\n  var force, swinging, traction, nodespeed, newX, newY;\n\n  // MATH: sqrt and square distances\n  if (adjustSizes === true) {\n    for (n = 0; n < order; n += PPN) {\n      if (NodeMatrix[n + NODE_FIXED] !== 1) {\n        force = Math.sqrt(\n          Math.pow(NodeMatrix[n + NODE_DX], 2) +\n            Math.pow(NodeMatrix[n + NODE_DY], 2)\n        );\n\n        if (force > MAX_FORCE) {\n          NodeMatrix[n + NODE_DX] =\n            (NodeMatrix[n + NODE_DX] * MAX_FORCE) / force;\n          NodeMatrix[n + NODE_DY] =\n            (NodeMatrix[n + NODE_DY] * MAX_FORCE) / force;\n        }\n\n        swinging =\n          NodeMatrix[n + NODE_MASS] *\n          Math.sqrt(\n            (NodeMatrix[n + NODE_OLD_DX] - NodeMatrix[n + NODE_DX]) *\n              (NodeMatrix[n + NODE_OLD_DX] - NodeMatrix[n + NODE_DX]) +\n              (NodeMatrix[n + NODE_OLD_DY] - NodeMatrix[n + NODE_DY]) *\n                (NodeMatrix[n + NODE_OLD_DY] - NodeMatrix[n + NODE_DY])\n          );\n\n        traction =\n          Math.sqrt(\n            (NodeMatrix[n + NODE_OLD_DX] + NodeMatrix[n + NODE_DX]) *\n              (NodeMatrix[n + NODE_OLD_DX] + NodeMatrix[n + NODE_DX]) +\n              (NodeMatrix[n + NODE_OLD_DY] + NodeMatrix[n + NODE_DY]) *\n                (NodeMatrix[n + NODE_OLD_DY] + NodeMatrix[n + NODE_DY])\n          ) / 2;\n\n        nodespeed = (0.1 * Math.log(1 + traction)) / (1 + Math.sqrt(swinging));\n\n        // Updating node's positon\n        newX =\n          NodeMatrix[n + NODE_X] +\n          NodeMatrix[n + NODE_DX] * (nodespeed / options.slowDown);\n        NodeMatrix[n + NODE_X] = newX;\n\n        newY =\n          NodeMatrix[n + NODE_Y] +\n          NodeMatrix[n + NODE_DY] * (nodespeed / options.slowDown);\n        NodeMatrix[n + NODE_Y] = newY;\n      }\n    }\n  } else {\n    for (n = 0; n < order; n += PPN) {\n      if (NodeMatrix[n + NODE_FIXED] !== 1) {\n        swinging =\n          NodeMatrix[n + NODE_MASS] *\n          Math.sqrt(\n            (NodeMatrix[n + NODE_OLD_DX] - NodeMatrix[n + NODE_DX]) *\n              (NodeMatrix[n + NODE_OLD_DX] - NodeMatrix[n + NODE_DX]) +\n              (NodeMatrix[n + NODE_OLD_DY] - NodeMatrix[n + NODE_DY]) *\n                (NodeMatrix[n + NODE_OLD_DY] - NodeMatrix[n + NODE_DY])\n          );\n\n        traction =\n          Math.sqrt(\n            (NodeMatrix[n + NODE_OLD_DX] + NodeMatrix[n + NODE_DX]) *\n              (NodeMatrix[n + NODE_OLD_DX] + NodeMatrix[n + NODE_DX]) +\n              (NodeMatrix[n + NODE_OLD_DY] + NodeMatrix[n + NODE_DY]) *\n                (NodeMatrix[n + NODE_OLD_DY] + NodeMatrix[n + NODE_DY])\n          ) / 2;\n\n        nodespeed =\n          (NodeMatrix[n + NODE_CONVERGENCE] * Math.log(1 + traction)) /\n          (1 + Math.sqrt(swinging));\n\n        // Updating node convergence\n        NodeMatrix[n + NODE_CONVERGENCE] = Math.min(\n          1,\n          Math.sqrt(\n            (nodespeed *\n              (Math.pow(NodeMatrix[n + NODE_DX], 2) +\n                Math.pow(NodeMatrix[n + NODE_DY], 2))) /\n              (1 + Math.sqrt(swinging))\n          )\n        );\n\n        // Updating node's positon\n        newX =\n          NodeMatrix[n + NODE_X] +\n          NodeMatrix[n + NODE_DX] * (nodespeed / options.slowDown);\n        NodeMatrix[n + NODE_X] = newX;\n\n        newY =\n          NodeMatrix[n + NODE_Y] +\n          NodeMatrix[n + NODE_DY] * (nodespeed / options.slowDown);\n        NodeMatrix[n + NODE_Y] = newY;\n      }\n    }\n  }\n\n  // We return the information about the layout (no need to return the matrices)\n  return {};\n};\n\n  })();\n\n  var iterate = moduleShim.exports;\n\n  self.addEventListener('message', function (event) {\n    var data = event.data;\n\n    NODES = new Float32Array(data.nodes);\n\n    if (data.edges) EDGES = new Float32Array(data.edges);\n\n    // Running the iteration\n    iterate(data.settings, NODES, EDGES);\n\n    // Sending result to supervisor\n    self.postMessage(\n      {\n        nodes: NODES.buffer\n      },\n      [NODES.buffer]\n    );\n  });\n};\n\n","/**\n * Graphology ForceAtlas2 Layout Supervisor\n * =========================================\n *\n * Supervisor class able to spawn a web worker to run the FA2 layout in a\n * separate thread not to block UI with heavy synchronous computations.\n */\nvar workerFunction = require('./webworker.js');\nvar isGraph = require('graphology-utils/is-graph');\nvar createEdgeWeightGetter =\n  require('graphology-utils/getters').createEdgeWeightGetter;\nvar helpers = require('./helpers.js');\n\nvar DEFAULT_SETTINGS = require('./defaults.js');\n\n/**\n * Class representing a FA2 layout run by a webworker.\n *\n * @constructor\n * @param  {Graph}         graph        - Target graph.\n * @param  {object|number} params       - Parameters:\n * @param  {object}          [settings] - Settings.\n */\nfunction FA2LayoutSupervisor(graph, params) {\n  params = params || {};\n\n  // Validation\n  if (!isGraph(graph))\n    throw new Error(\n      'graphology-layout-forceatlas2/worker: the given graph is not a valid graphology instance.'\n    );\n\n  var getEdgeWeight = createEdgeWeightGetter(\n    'getEdgeWeight' in params ? params.getEdgeWeight : 'weight'\n  ).fromEntry;\n\n  // Validating settings\n  var settings = helpers.assign({}, DEFAULT_SETTINGS, params.settings);\n  var validationError = helpers.validateSettings(settings);\n\n  if (validationError)\n    throw new Error(\n      'graphology-layout-forceatlas2/worker: ' + validationError.message\n    );\n\n  // Properties\n  this.worker = null;\n  this.graph = graph;\n  this.settings = settings;\n  this.getEdgeWeight = getEdgeWeight;\n  this.matrices = null;\n  this.running = false;\n  this.killed = false;\n  this.outputReducer =\n    typeof params.outputReducer === 'function' ? params.outputReducer : null;\n\n  // Binding listeners\n  this.handleMessage = this.handleMessage.bind(this);\n\n  var respawnFrame = undefined;\n  var self = this;\n\n  this.handleGraphUpdate = function () {\n    if (self.worker) self.worker.terminate();\n\n    if (respawnFrame) clearTimeout(respawnFrame);\n\n    respawnFrame = setTimeout(function () {\n      respawnFrame = undefined;\n      self.spawnWorker();\n    }, 0);\n  };\n\n  graph.on('nodeAdded', this.handleGraphUpdate);\n  graph.on('edgeAdded', this.handleGraphUpdate);\n  graph.on('nodeDropped', this.handleGraphUpdate);\n  graph.on('edgeDropped', this.handleGraphUpdate);\n\n  // Spawning worker\n  this.spawnWorker();\n}\n\nFA2LayoutSupervisor.prototype.isRunning = function () {\n  return this.running;\n};\n\n/**\n * Internal method used to spawn the web worker.\n */\nFA2LayoutSupervisor.prototype.spawnWorker = function () {\n  if (this.worker) this.worker.terminate();\n\n  this.worker = helpers.createWorker(workerFunction);\n  this.worker.addEventListener('message', this.handleMessage);\n\n  if (this.running) {\n    this.running = false;\n    this.start();\n  }\n};\n\n/**\n * Internal method used to handle the worker's messages.\n *\n * @param {object} event - Event to handle.\n */\nFA2LayoutSupervisor.prototype.handleMessage = function (event) {\n  if (!this.running) return;\n\n  var matrix = new Float32Array(event.data.nodes);\n\n  helpers.assignLayoutChanges(this.graph, matrix, this.outputReducer);\n  if (this.outputReducer) helpers.readGraphPositions(this.graph, matrix);\n  this.matrices.nodes = matrix;\n\n  // Looping\n  this.askForIterations();\n};\n\n/**\n * Internal method used to ask for iterations from the worker.\n *\n * @param  {boolean} withEdges - Should we send edges along?\n * @return {FA2LayoutSupervisor}\n */\nFA2LayoutSupervisor.prototype.askForIterations = function (withEdges) {\n  var matrices = this.matrices;\n\n  var payload = {\n    settings: this.settings,\n    nodes: matrices.nodes.buffer\n  };\n\n  var buffers = [matrices.nodes.buffer];\n\n  if (withEdges) {\n    payload.edges = matrices.edges.buffer;\n    buffers.push(matrices.edges.buffer);\n  }\n\n  this.worker.postMessage(payload, buffers);\n\n  return this;\n};\n\n/**\n * Method used to start the layout.\n *\n * @return {FA2LayoutSupervisor}\n */\nFA2LayoutSupervisor.prototype.start = function () {\n  if (this.killed)\n    throw new Error(\n      'graphology-layout-forceatlas2/worker.start: layout was killed.'\n    );\n\n  if (this.running) return this;\n\n  // Building matrices\n  this.matrices = helpers.graphToByteArrays(this.graph, this.getEdgeWeight);\n\n  this.running = true;\n  this.askForIterations(true);\n\n  return this;\n};\n\n/**\n * Method used to stop the layout.\n *\n * @return {FA2LayoutSupervisor}\n */\nFA2LayoutSupervisor.prototype.stop = function () {\n  this.running = false;\n\n  return this;\n};\n\n/**\n * Method used to kill the layout.\n *\n * @return {FA2LayoutSupervisor}\n */\nFA2LayoutSupervisor.prototype.kill = function () {\n  if (this.killed) return this;\n\n  this.running = false;\n  this.killed = true;\n\n  // Clearing memory\n  this.matrices = null;\n\n  // Terminating worker\n  this.worker.terminate();\n\n  // Unbinding listeners\n  this.graph.removeListener('nodeAdded', this.handleGraphUpdate);\n  this.graph.removeListener('edgeAdded', this.handleGraphUpdate);\n  this.graph.removeListener('nodeDropped', this.handleGraphUpdate);\n  this.graph.removeListener('edgeDropped', this.handleGraphUpdate);\n};\n\n/**\n * Exporting.\n */\nmodule.exports = FA2LayoutSupervisor;\n","/**\n * Graphology CirclePack Layout\n * =============================\n *\n * Circlepack layout from d3-hierarchy/gephi.\n */\nvar resolveDefaults = require('graphology-utils/defaults');\nvar isGraph = require('graphology-utils/is-graph');\nvar shuffle = require('pandemonium/shuffle-in-place');\n\n/**\n * Default options.\n */\nvar DEFAULTS = {\n  attributes: {\n    x: 'x',\n    y: 'y'\n  },\n  center: 0,\n  hierarchyAttributes: [],\n  rng: Math.random,\n  scale: 1\n};\n\n/**\n * Helpers.\n */\nfunction CircleWrap(id, x, y, r, circleWrap) {\n  this.wrappedCircle = circleWrap || null; //hacky d3 reference thing\n\n  this.children = {};\n  this.countChildren = 0;\n  this.id = id || null;\n  this.next = null;\n  this.previous = null;\n\n  this.x = x || null;\n  this.y = y || null;\n  if (circleWrap) this.r = 1010101;\n  // for debugging purposes - should not be used in this case\n  else this.r = r || 999;\n}\n\nCircleWrap.prototype.hasChildren = function () {\n  return this.countChildren > 0;\n};\n\nCircleWrap.prototype.addChild = function (id, child) {\n  this.children[id] = child;\n  ++this.countChildren;\n};\n\nCircleWrap.prototype.getChild = function (id) {\n  if (!this.children.hasOwnProperty(id)) {\n    var circleWrap = new CircleWrap();\n    this.children[id] = circleWrap;\n    ++this.countChildren;\n  }\n  return this.children[id];\n};\n\nCircleWrap.prototype.applyPositionToChildren = function () {\n  if (this.hasChildren()) {\n    var root = this; // using 'this' in Object.keys.forEach seems a bad idea\n    for (var key in root.children) {\n      var child = root.children[key];\n      child.x += root.x;\n      child.y += root.y;\n      child.applyPositionToChildren();\n    }\n  }\n};\n\nfunction setNode(/*Graph*/ graph, /*CircleWrap*/ parentCircle, /*Map*/ posMap) {\n  for (var key in parentCircle.children) {\n    var circle = parentCircle.children[key];\n    if (circle.hasChildren()) {\n      setNode(graph, circle, posMap);\n    } else {\n      posMap[circle.id] = {x: circle.x, y: circle.y};\n    }\n  }\n}\n\nfunction enclosesNot(/*CircleWrap*/ a, /*CircleWrap*/ b) {\n  var dr = a.r - b.r;\n  var dx = b.x - a.x;\n  var dy = b.y - a.y;\n  return dr < 0 || dr * dr < dx * dx + dy * dy;\n}\n\nfunction enclosesWeak(/*CircleWrap*/ a, /*CircleWrap*/ b) {\n  var dr = a.r - b.r + 1e-6;\n  var dx = b.x - a.x;\n  var dy = b.y - a.y;\n  return dr > 0 && dr * dr > dx * dx + dy * dy;\n}\n\nfunction enclosesWeakAll(/*CircleWrap*/ a, /*Array<CircleWrap>*/ B) {\n  for (var i = 0; i < B.length; ++i) {\n    if (!enclosesWeak(a, B[i])) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction encloseBasis1(/*CircleWrap*/ a) {\n  return new CircleWrap(null, a.x, a.y, a.r);\n}\n\nfunction encloseBasis2(/*CircleWrap*/ a, /*CircleWrap*/ b) {\n  var x1 = a.x,\n    y1 = a.y,\n    r1 = a.r,\n    x2 = b.x,\n    y2 = b.y,\n    r2 = b.r,\n    x21 = x2 - x1,\n    y21 = y2 - y1,\n    r21 = r2 - r1,\n    l = Math.sqrt(x21 * x21 + y21 * y21);\n  return new CircleWrap(\n    null,\n    (x1 + x2 + (x21 / l) * r21) / 2,\n    (y1 + y2 + (y21 / l) * r21) / 2,\n    (l + r1 + r2) / 2\n  );\n}\n\nfunction encloseBasis3(/*CircleWrap*/ a, /*CircleWrap*/ b, /*CircleWrap*/ c) {\n  var x1 = a.x,\n    y1 = a.y,\n    r1 = a.r,\n    x2 = b.x,\n    y2 = b.y,\n    r2 = b.r,\n    x3 = c.x,\n    y3 = c.y,\n    r3 = c.r,\n    a2 = x1 - x2,\n    a3 = x1 - x3,\n    b2 = y1 - y2,\n    b3 = y1 - y3,\n    c2 = r2 - r1,\n    c3 = r3 - r1,\n    d1 = x1 * x1 + y1 * y1 - r1 * r1,\n    d2 = d1 - x2 * x2 - y2 * y2 + r2 * r2,\n    d3 = d1 - x3 * x3 - y3 * y3 + r3 * r3,\n    ab = a3 * b2 - a2 * b3,\n    xa = (b2 * d3 - b3 * d2) / (ab * 2) - x1,\n    xb = (b3 * c2 - b2 * c3) / ab,\n    ya = (a3 * d2 - a2 * d3) / (ab * 2) - y1,\n    yb = (a2 * c3 - a3 * c2) / ab,\n    A = xb * xb + yb * yb - 1,\n    B = 2 * (r1 + xa * xb + ya * yb),\n    C = xa * xa + ya * ya - r1 * r1,\n    r = -(A ? (B + Math.sqrt(B * B - 4 * A * C)) / (2 * A) : C / B);\n  return new CircleWrap(null, x1 + xa + xb * r, y1 + ya + yb * r, r);\n}\n\nfunction encloseBasis(/*Array<CircleWrap>*/ B) {\n  switch (B.length) {\n    case 1:\n      return encloseBasis1(B[0]);\n    case 2:\n      return encloseBasis2(B[0], B[1]);\n    case 3:\n      return encloseBasis3(B[0], B[1], B[2]);\n    default:\n      throw new Error(\n        'graphology-layout/circlepack: Invalid basis length ' + B.length\n      );\n  }\n}\n\nfunction extendBasis(/*Array<CircleWrap>*/ B, /*CircleWrap*/ p) {\n  var i, j;\n\n  if (enclosesWeakAll(p, B)) return [p];\n\n  // If we get here then B must have at least one element.\n  for (i = 0; i < B.length; ++i) {\n    if (enclosesNot(p, B[i]) && enclosesWeakAll(encloseBasis2(B[i], p), B)) {\n      return [B[i], p];\n    }\n  }\n\n  // If we get here then B must have at least two elements.\n  for (i = 0; i < B.length - 1; ++i) {\n    for (j = i + 1; j < B.length; ++j) {\n      if (\n        enclosesNot(encloseBasis2(B[i], B[j]), p) &&\n        enclosesNot(encloseBasis2(B[i], p), B[j]) &&\n        enclosesNot(encloseBasis2(B[j], p), B[i]) &&\n        enclosesWeakAll(encloseBasis3(B[i], B[j], p), B)\n      ) {\n        return [B[i], B[j], p];\n      }\n    }\n  }\n\n  // If we get here then something is very wrong.\n  throw new Error('graphology-layout/circlepack: extendBasis failure !');\n}\n\nfunction score(/*CircleWrap*/ node) {\n  var a = node.wrappedCircle;\n  var b = node.next.wrappedCircle;\n  var ab = a.r + b.r;\n  var dx = (a.x * b.r + b.x * a.r) / ab;\n  var dy = (a.y * b.r + b.y * a.r) / ab;\n  return dx * dx + dy * dy;\n}\n\nfunction enclose(circles, shuffleFunc) {\n  var i = 0;\n  var circlesLoc = circles.slice();\n\n  var n = circles.length;\n  var B = [];\n  var p;\n  var e;\n  shuffleFunc(circlesLoc);\n  while (i < n) {\n    p = circlesLoc[i];\n    if (e && enclosesWeak(e, p)) {\n      ++i;\n    } else {\n      B = extendBasis(B, p);\n      e = encloseBasis(B);\n      i = 0;\n    }\n  }\n  return e;\n}\n\nfunction place(/*CircleWrap*/ b, /*CircleWrap*/ a, /*CircleWrap*/ c) {\n  var dx = b.x - a.x,\n    x,\n    a2,\n    dy = b.y - a.y,\n    y,\n    b2,\n    d2 = dx * dx + dy * dy;\n  if (d2) {\n    a2 = a.r + c.r;\n    a2 *= a2;\n    b2 = b.r + c.r;\n    b2 *= b2;\n    if (a2 > b2) {\n      x = (d2 + b2 - a2) / (2 * d2);\n      y = Math.sqrt(Math.max(0, b2 / d2 - x * x));\n      c.x = b.x - x * dx - y * dy;\n      c.y = b.y - x * dy + y * dx;\n    } else {\n      x = (d2 + a2 - b2) / (2 * d2);\n      y = Math.sqrt(Math.max(0, a2 / d2 - x * x));\n      c.x = a.x + x * dx - y * dy;\n      c.y = a.y + x * dy + y * dx;\n    }\n  } else {\n    c.x = a.x + c.r;\n    c.y = a.y;\n  }\n}\n\nfunction intersects(/*CircleWrap*/ a, /*CircleWrap*/ b) {\n  var dr = a.r + b.r - 1e-6,\n    dx = b.x - a.x,\n    dy = b.y - a.y;\n  return dr > 0 && dr * dr > dx * dx + dy * dy;\n}\n\nfunction packEnclose(/*Array<CircleWrap>*/ circles, shuffleFunc) {\n  var n = circles.length;\n  if (n === 0) return 0;\n\n  var a, b, c, aa, ca, i, j, k, sj, sk;\n\n  // Place the first circle.\n  a = circles[0];\n  a.x = 0;\n  a.y = 0;\n  if (n <= 1) return a.r;\n\n  // Place the second circle.\n  b = circles[1];\n  a.x = -b.r;\n  b.x = a.r;\n  b.y = 0;\n  if (n <= 2) return a.r + b.r;\n\n  // Place the third circle.\n  c = circles[2];\n  place(b, a, c);\n\n  // Initialize the front-chain using the first three circles a, b and c.\n  a = new CircleWrap(null, null, null, null, a);\n  b = new CircleWrap(null, null, null, null, b);\n  c = new CircleWrap(null, null, null, null, c);\n  a.next = c.previous = b;\n  b.next = a.previous = c;\n  c.next = b.previous = a;\n\n  // Attempt to place each remaining circle…\n  pack: for (i = 3; i < n; ++i) {\n    c = circles[i];\n    place(a.wrappedCircle, b.wrappedCircle, c);\n    c = new CircleWrap(null, null, null, null, c);\n\n    // Find the closest intersecting circle on the front-chain, if any.\n    // “Closeness” is determined by linear distance along the front-chain.\n    // “Ahead” or “behind” is likewise determined by linear distance.\n    j = b.next;\n    k = a.previous;\n    sj = b.wrappedCircle.r;\n    sk = a.wrappedCircle.r;\n    do {\n      if (sj <= sk) {\n        if (intersects(j.wrappedCircle, c.wrappedCircle)) {\n          b = j;\n          a.next = b;\n          b.previous = a;\n          --i;\n          continue pack;\n        }\n        sj += j.wrappedCircle.r;\n        j = j.next;\n      } else {\n        if (intersects(k.wrappedCircle, c.wrappedCircle)) {\n          a = k;\n          a.next = b;\n          b.previous = a;\n          --i;\n          continue pack;\n        }\n        sk += k.wrappedCircle.r;\n        k = k.previous;\n      }\n    } while (j !== k.next);\n\n    // Success! Insert the new circle c between a and b.\n    c.previous = a;\n    c.next = b;\n    a.next = b.previous = b = c;\n\n    // Compute the new closest circle pair to the centroid.\n    aa = score(a);\n    while ((c = c.next) !== b) {\n      if ((ca = score(c)) < aa) {\n        a = c;\n        aa = ca;\n      }\n    }\n    b = a.next;\n  }\n\n  // Compute the enclosing circle of the front chain.\n  a = [b.wrappedCircle];\n  c = b;\n  var safety = 10000;\n  while ((c = c.next) !== b) {\n    if (--safety === 0) {\n      break;\n    }\n    a.push(c.wrappedCircle);\n  }\n  c = enclose(a, shuffleFunc);\n\n  // Translate the circles to put the enclosing circle around the origin.\n  for (i = 0; i < n; ++i) {\n    a = circles[i];\n    a.x -= c.x;\n    a.y -= c.y;\n  }\n  return c.r;\n}\n\nfunction packHierarchy(/*CircleWrap*/ parentCircle, shuffleFunc) {\n  var r = 0;\n  if (parentCircle.hasChildren()) {\n    //pack the children first because the radius is determined by how the children get packed (recursive)\n    for (var key in parentCircle.children) {\n      var circle = parentCircle.children[key];\n      if (circle.hasChildren()) {\n        circle.r = packHierarchy(circle, shuffleFunc);\n      }\n    }\n    //now that each circle has a radius set by its children, pack the circles at this level\n    r = packEnclose(Object.values(parentCircle.children), shuffleFunc);\n  }\n  return r;\n}\n\nfunction packHierarchyAndShift(/*CircleWrap*/ parentCircle, shuffleFunc) {\n  packHierarchy(parentCircle, shuffleFunc);\n  for (var key in parentCircle.children) {\n    var circle = parentCircle.children[key];\n    circle.applyPositionToChildren();\n  }\n}\n\n/**\n * Abstract function running the layout.\n *\n * @param  {Graph}    graph                   - Target  graph.\n * @param  {object}   [options]               - Options:\n * @param  {object}     [attributes]          - Attributes names to map.\n * @param  {number}     [center]              - Center of the layout.\n * @param  {string[]}   [hierarchyAttributes] - List of attributes used for the layout in decreasing order.\n * @param  {function}   [rng]                 - Custom RNG function to be used.\n * @param  {number}     [scale]               - Scale of the layout.\n * @return {object}                           - The positions by node.\n */\nfunction genericCirclePackLayout(assign, graph, options) {\n  if (!isGraph(graph))\n    throw new Error(\n      'graphology-layout/circlepack: the given graph is not a valid graphology instance.'\n    );\n\n  options = resolveDefaults(options, DEFAULTS);\n\n  var posMap = {},\n    positions = {},\n    nodes = graph.nodes(),\n    center = options.center,\n    hierarchyAttributes = options.hierarchyAttributes,\n    shuffleFunc = shuffle.createShuffleInPlace(options.rng),\n    scale = options.scale;\n\n  var container = new CircleWrap();\n\n  graph.forEachNode(function (key, attributes) {\n    var r = attributes.size ? attributes.size : 1;\n    var newCircleWrap = new CircleWrap(key, null, null, r);\n    var parentContainer = container;\n\n    hierarchyAttributes.forEach(function (v) {\n      var attr = attributes[v];\n      parentContainer = parentContainer.getChild(attr);\n    });\n\n    parentContainer.addChild(key, newCircleWrap);\n  });\n  packHierarchyAndShift(container, shuffleFunc);\n  setNode(graph, container, posMap);\n  var l = nodes.length,\n    x,\n    y,\n    i;\n  for (i = 0; i < l; i++) {\n    var node = nodes[i];\n\n    x = center + scale * posMap[node].x;\n    y = center + scale * posMap[node].y;\n\n    positions[node] = {\n      x: x,\n      y: y\n    };\n\n    if (assign) {\n      graph.setNodeAttribute(node, options.attributes.x, x);\n      graph.setNodeAttribute(node, options.attributes.y, y);\n    }\n  }\n  return positions;\n}\n\nvar circlePackLayout = genericCirclePackLayout.bind(null, false);\ncirclePackLayout.assign = genericCirclePackLayout.bind(null, true);\n\nmodule.exports = circlePackLayout;\n","/**\n * Graphology Circular Layout\n * ===========================\n *\n * Layout arranging the nodes in a circle.\n */\nvar resolveDefaults = require('graphology-utils/defaults');\nvar isGraph = require('graphology-utils/is-graph');\n\n/**\n * Default options.\n */\nvar DEFAULTS = {\n  dimensions: ['x', 'y'],\n  center: 0.5,\n  scale: 1\n};\n\n/**\n * Abstract function running the layout.\n *\n * @param  {Graph}    graph          - Target  graph.\n * @param  {object}   [options]      - Options:\n * @param  {object}     [attributes] - Attributes names to map.\n * @param  {number}     [center]     - Center of the layout.\n * @param  {number}     [scale]      - Scale of the layout.\n * @return {object}                  - The positions by node.\n */\nfunction genericCircularLayout(assign, graph, options) {\n  if (!isGraph(graph))\n    throw new Error(\n      'graphology-layout/random: the given graph is not a valid graphology instance.'\n    );\n\n  options = resolveDefaults(options, DEFAULTS);\n\n  var dimensions = options.dimensions;\n\n  if (!Array.isArray(dimensions) || dimensions.length !== 2)\n    throw new Error('graphology-layout/random: given dimensions are invalid.');\n\n  var center = options.center;\n  var scale = options.scale;\n  var tau = Math.PI * 2;\n\n  var offset = (center - 0.5) * scale;\n  var l = graph.order;\n\n  var x = dimensions[0];\n  var y = dimensions[1];\n\n  function assignPosition(i, target) {\n    target[x] = scale * Math.cos((i * tau) / l) + offset;\n    target[y] = scale * Math.sin((i * tau) / l) + offset;\n\n    return target;\n  }\n\n  var i = 0;\n\n  if (!assign) {\n    var positions = {};\n\n    graph.forEachNode(function (node) {\n      positions[node] = assignPosition(i++, {});\n    });\n\n    return positions;\n  }\n\n  graph.updateEachNodeAttributes(\n    function (_, attr) {\n      assignPosition(i++, attr);\n      return attr;\n    },\n    {\n      attributes: dimensions\n    }\n  );\n}\n\nvar circularLayout = genericCircularLayout.bind(null, false);\ncircularLayout.assign = genericCircularLayout.bind(null, true);\n\nmodule.exports = circularLayout;\n","/**\n * Graphology Layout\n * ==================\n *\n * Library endpoint.\n */\nexports.circlepack = require('./circlepack.js');\nexports.circular = require('./circular.js');\nexports.random = require('./random.js');\nexports.rotation = require('./rotation.js');\n","/**\n * Graphology Random Layout\n * =========================\n *\n * Simple layout giving uniform random positions to the nodes.\n */\nvar resolveDefaults = require('graphology-utils/defaults');\nvar isGraph = require('graphology-utils/is-graph');\n\n/**\n * Default options.\n */\nvar DEFAULTS = {\n  dimensions: ['x', 'y'],\n  center: 0.5,\n  rng: Math.random,\n  scale: 1\n};\n\n/**\n * Abstract function running the layout.\n *\n * @param  {Graph}    graph          - Target  graph.\n * @param  {object}   [options]      - Options:\n * @param  {array}      [dimensions] - List of dimensions of the layout.\n * @param  {number}     [center]     - Center of the layout.\n * @param  {function}   [rng]        - Custom RNG function to be used.\n * @param  {number}     [scale]      - Scale of the layout.\n * @return {object}                  - The positions by node.\n */\nfunction genericRandomLayout(assign, graph, options) {\n  if (!isGraph(graph))\n    throw new Error(\n      'graphology-layout/random: the given graph is not a valid graphology instance.'\n    );\n\n  options = resolveDefaults(options, DEFAULTS);\n\n  var dimensions = options.dimensions;\n\n  if (!Array.isArray(dimensions) || dimensions.length < 1)\n    throw new Error('graphology-layout/random: given dimensions are invalid.');\n\n  var d = dimensions.length;\n  var center = options.center;\n  var rng = options.rng;\n  var scale = options.scale;\n\n  var offset = (center - 0.5) * scale;\n\n  function assignPosition(target) {\n    for (var i = 0; i < d; i++) {\n      target[dimensions[i]] = rng() * scale + offset;\n    }\n\n    return target;\n  }\n\n  if (!assign) {\n    var positions = {};\n\n    graph.forEachNode(function (node) {\n      positions[node] = assignPosition({});\n    });\n\n    return positions;\n  }\n\n  graph.updateEachNodeAttributes(\n    function (_, attr) {\n      assignPosition(attr);\n      return attr;\n    },\n    {\n      attributes: dimensions\n    }\n  );\n}\n\nvar randomLayout = genericRandomLayout.bind(null, false);\nrandomLayout.assign = genericRandomLayout.bind(null, true);\n\nmodule.exports = randomLayout;\n","/**\n * Graphology Rotation Layout Helper\n * ==================================\n *\n * Function rotating the coordinates of the graph.\n */\nvar resolveDefaults = require('graphology-utils/defaults');\nvar isGraph = require('graphology-utils/is-graph');\n\n/**\n * Constants.\n */\nvar RAD_CONVERSION = Math.PI / 180;\n\n/**\n * Default options.\n */\nvar DEFAULTS = {\n  dimensions: ['x', 'y'],\n  centeredOnZero: false,\n  degrees: false\n};\n\n/**\n * Abstract function for rotating a graph's coordinates.\n *\n * @param  {Graph}    graph          - Target  graph.\n * @param  {number}   angle          - Rotation angle.\n * @param  {object}   [options]      - Options.\n * @return {object}                  - The positions by node.\n */\nfunction genericRotation(assign, graph, angle, options) {\n  if (!isGraph(graph))\n    throw new Error(\n      'graphology-layout/rotation: the given graph is not a valid graphology instance.'\n    );\n\n  options = resolveDefaults(options, DEFAULTS);\n\n  if (options.degrees) angle *= RAD_CONVERSION;\n\n  var dimensions = options.dimensions;\n\n  if (!Array.isArray(dimensions) || dimensions.length !== 2)\n    throw new Error('graphology-layout/random: given dimensions are invalid.');\n\n  // Handling null graph\n  if (graph.order === 0) {\n    if (assign) return;\n\n    return {};\n  }\n\n  var xd = dimensions[0];\n  var yd = dimensions[1];\n\n  var xCenter = 0;\n  var yCenter = 0;\n\n  if (!options.centeredOnZero) {\n    // Finding bounds of the graph\n    var xMin = Infinity;\n    var xMax = -Infinity;\n    var yMin = Infinity;\n    var yMax = -Infinity;\n\n    graph.forEachNode(function (node, attr) {\n      var x = attr[xd];\n      var y = attr[yd];\n\n      if (x < xMin) xMin = x;\n      if (x > xMax) xMax = x;\n      if (y < yMin) yMin = y;\n      if (y > yMax) yMax = y;\n    });\n\n    xCenter = (xMin + xMax) / 2;\n    yCenter = (yMin + yMax) / 2;\n  }\n\n  var cos = Math.cos(angle);\n  var sin = Math.sin(angle);\n\n  function assignPosition(target) {\n    var x = target[xd];\n    var y = target[yd];\n\n    target[xd] = xCenter + (x - xCenter) * cos - (y - yCenter) * sin;\n    target[yd] = yCenter + (x - xCenter) * sin + (y - yCenter) * cos;\n\n    return target;\n  }\n\n  if (!assign) {\n    var positions = {};\n\n    graph.forEachNode(function (node, attr) {\n      var o = {};\n      o[xd] = attr[xd];\n      o[yd] = attr[yd];\n      positions[node] = assignPosition(o);\n    });\n\n    return positions;\n  }\n\n  graph.updateEachNodeAttributes(\n    function (_, attr) {\n      assignPosition(attr);\n      return attr;\n    },\n    {\n      attributes: dimensions\n    }\n  );\n}\n\nvar rotation = genericRotation.bind(null, false);\nrotation.assign = genericRotation.bind(null, true);\n\nmodule.exports = rotation;\n","/**\n * Graphology Disjoint Union Operator\n * ===================================\n */\nvar isGraph = require('graphology-utils/is-graph');\nvar copyNode = require('graphology-utils/add-node').copyNode;\nvar copyEdge = require('graphology-utils/add-edge').copyEdge;\n\n/**\n * Function returning the disjoint union of two given graphs by giving new keys\n * to nodes & edges.\n *\n * @param  {Graph} G - The first graph.\n * @param  {Graph} H - The second graph.\n * @return {Graph}\n */\nmodule.exports = function disjointUnion(G, H) {\n  if (!isGraph(G) || !isGraph(H))\n    throw new Error('graphology-operators/disjoint-union: invalid graph.');\n\n  if (G.multi !== H.multi)\n    throw new Error(\n      'graphology-operators/disjoint-union: both graph should be simple or multi.'\n    );\n\n  var R = G.nullCopy();\n\n  // TODO: in the spirit of this operator we should probably prefix something\n  R.mergeAttributes(G.getAttributes());\n\n  var labelsG = {};\n  var labelsH = {};\n\n  var i = 0;\n\n  // Adding nodes\n  G.forEachNode(function (key, attr) {\n    labelsG[key] = i;\n\n    copyNode(R, i, attr);\n\n    i++;\n  });\n\n  H.forEachNode(function (key, attr) {\n    labelsH[key] = i;\n\n    copyNode(R, i, attr);\n\n    i++;\n  });\n\n  // Adding edges\n  i = 0;\n\n  G.forEachEdge(function (key, attr, source, target, _s, _t, undirected) {\n    copyEdge(\n      R,\n      undirected,\n      i++,\n      labelsG[source],\n      labelsG[target],\n      target,\n      attr\n    );\n  });\n\n  H.forEachEdge(function (key, attr, source, target, _s, _t, undirected) {\n    copyEdge(\n      R,\n      undirected,\n      i++,\n      labelsH[source],\n      labelsH[target],\n      target,\n      attr\n    );\n  });\n\n  return R;\n};\n","/**\n * Graphology Operators\n * =====================\n *\n * Library endpoint.\n */\nexports.disjointUnion = require('./disjoint-union.js');\nexports.reverse = require('./reverse.js');\nexports.subgraph = require('./subgraph.js');\nexports.toDirected = require('./to-directed.js');\nexports.toMixed = require('./to-mixed.js');\nexports.toMulti = require('./to-multi.js');\nexports.toSimple = require('./to-simple.js');\nexports.toUndirected = require('./to-undirected.js');\nexports.union = require('./union.js');\n","/**\n * Graphology Revers Operator\n * ===========================\n */\nvar isGraph = require('graphology-utils/is-graph');\nvar copyEdge = require('graphology-utils/add-edge').copyEdge;\n\n/**\n * Function reversing the given graph.\n *\n * @param  {Graph} graph - Target graph.\n * @return {Graph}\n */\nmodule.exports = function reverse(graph) {\n  if (!isGraph(graph))\n    throw new Error('graphology-operators/reverse: invalid graph.');\n\n  var reversed = graph.emptyCopy();\n\n  // Importing undirected edges\n  graph.forEachUndirectedEdge(function (key, attr, source, target) {\n    copyEdge(reversed, true, key, source, target, attr);\n  });\n\n  // Reversing directed edges\n  graph.forEachDirectedEdge(function (key, attr, source, target) {\n    copyEdge(reversed, false, key, target, source, attr);\n  });\n\n  return reversed;\n};\n","/**\n * Graphology Sub Graph\n * =====================\n *\n * Function returning the subgraph composed of the nodes passed as parameters.\n */\nvar isGraph = require('graphology-utils/is-graph');\nvar copyNode = require('graphology-utils/add-node').copyNode;\nvar copyEdge = require('graphology-utils/add-edge').copyEdge;\n\nmodule.exports = function subgraph(graph, nodes) {\n  if (!isGraph(graph))\n    throw new Error('graphology-operators/subgraph: invalid graph instance.');\n\n  var S = graph.nullCopy();\n\n  var filterNode = nodes;\n\n  if (Array.isArray(nodes)) {\n    if (nodes.length === 0) return S;\n\n    nodes = new Set(nodes);\n  }\n\n  if (nodes instanceof Set) {\n    if (nodes.size === 0) return S;\n\n    filterNode = function (key) {\n      return nodes.has(key);\n    };\n\n    // Ensuring given keys are casted to string\n    var old = nodes;\n    nodes = new Set();\n\n    old.forEach(function (node) {\n      nodes.add('' + node);\n    });\n  }\n\n  if (typeof filterNode !== 'function')\n    throw new Error(\n      'graphology-operators/subgraph: invalid nodes. Expecting an array or a set or a filtering function.'\n    );\n\n  if (typeof nodes === 'function') {\n    graph.forEachNode(function (key, attr) {\n      if (!filterNode(key, attr)) return;\n\n      copyNode(S, key, attr);\n    });\n\n    // Early termination\n    if (S.order === 0) return S;\n  } else {\n    nodes.forEach(function (key) {\n      if (!graph.hasNode(key))\n        throw new Error(\n          'graphology-operators/subgraph: the \"' +\n            key +\n            '\" node was not found in the graph.'\n        );\n\n      copyNode(S, key, graph.getNodeAttributes(key));\n    });\n  }\n\n  graph.forEachEdge(function (\n    key,\n    attr,\n    source,\n    target,\n    sourceAttr,\n    targetAttr,\n    undirected\n  ) {\n    if (!filterNode(source, sourceAttr)) return;\n\n    if (target !== source && !filterNode(target, targetAttr)) return;\n\n    copyEdge(S, undirected, key, source, target, attr);\n  });\n\n  return S;\n};\n","/**\n * Graphology Operators To Directed Caster\n * ========================================\n *\n * Function used to cast any graph to a directed one.\n */\nvar isGraph = require('graphology-utils/is-graph');\nvar copyEdge = require('graphology-utils/add-edge').copyEdge;\n\nmodule.exports = function toDirected(graph, options) {\n  if (!isGraph(graph))\n    throw new Error(\n      'graphology-operators/to-directed: expecting a valid graphology instance.'\n    );\n\n  if (typeof options === 'function') options = {mergeEdge: options};\n\n  options = options || {};\n\n  var mergeEdge =\n    typeof options.mergeEdge === 'function' ? options.mergeEdge : null;\n\n  if (graph.type === 'directed') return graph.copy();\n\n  var directedGraph = graph.emptyCopy({type: 'directed'});\n\n  // Adding directed edges\n  graph.forEachDirectedEdge(function (edge, attr, source, target) {\n    copyEdge(directedGraph, false, edge, source, target, attr);\n  });\n\n  // Merging undirected edges\n  graph.forEachUndirectedEdge(function (_, attr, source, target) {\n    var existingOutEdge =\n      !graph.multi &&\n      graph.type === 'mixed' &&\n      directedGraph.edge(source, target);\n\n    var existingInEdge =\n      !graph.multi &&\n      graph.type === 'mixed' &&\n      directedGraph.edge(target, source);\n\n    if (existingOutEdge) {\n      directedGraph.replaceEdgeAttributes(\n        existingOutEdge,\n        mergeEdge(directedGraph.getEdgeAttributes(existingOutEdge), attr)\n      );\n    } else {\n      copyEdge(directedGraph, false, null, source, target, attr);\n    }\n\n    // Don't add self-loops twice\n    if (source === target) return;\n\n    if (existingInEdge) {\n      directedGraph.replaceEdgeAttributes(\n        existingInEdge,\n        mergeEdge(directedGraph.getEdgeAttributes(existingInEdge), attr)\n      );\n    } else {\n      copyEdge(directedGraph, false, null, target, source, attr);\n    }\n  });\n\n  return directedGraph;\n};\n","/**\n * Graphology Operators To Mixed Caster\n * =====================================\n *\n * Function used to cast any graph to a mixed one.\n */\nvar isGraph = require('graphology-utils/is-graph');\n\nmodule.exports = function toMixed(graph) {\n  if (!isGraph(graph))\n    throw new Error(\n      'graphology-operators/to-mixed: expecting a valid graphology instance.'\n    );\n\n  return graph.copy({type: 'mixed'});\n};\n","/**\n * Graphology Operators To Multi Caster\n * =====================================\n *\n * Function used to cast any graph to a multi one.\n */\nvar isGraph = require('graphology-utils/is-graph');\n\nmodule.exports = function toMulti(graph) {\n  if (!isGraph(graph))\n    throw new Error(\n      'graphology-operators/to-multi: expecting a valid graphology instance.'\n    );\n\n  return graph.copy({multi: true});\n};\n","/**\n * Graphology Operators To Simple Caster\n * ======================================\n *\n * Function used to cast a multi graph to a simple one.\n */\nvar isGraph = require('graphology-utils/is-graph');\nvar copyEdge = require('graphology-utils/add-edge').copyEdge;\n\nmodule.exports = function toSimple(multiGraph, options) {\n  if (!isGraph(multiGraph))\n    throw new Error(\n      'graphology-operators/to-simple: expecting a valid graphology instance.'\n    );\n\n  if (typeof options === 'function') options = {mergeEdge: options};\n\n  options = options || {};\n\n  var mergeEdge =\n    typeof options.mergeEdge === 'function' ? options.mergeEdge : null;\n\n  // The graph is not multi. We just return a plain copy\n  if (!multiGraph.multi) return multiGraph.copy();\n\n  // Creating a tweaked empty copy\n  var simpleGraph = multiGraph.emptyCopy({multi: false});\n\n  // Processing edges\n  multiGraph.forEachEdge(function (\n    edge,\n    attr,\n    source,\n    target,\n    _sa,\n    _ta,\n    undirected\n  ) {\n    var existingEdge = undirected\n      ? simpleGraph.undirectedEdge(source, target)\n      : simpleGraph.directedEdge(source, target);\n\n    if (existingEdge) {\n      if (mergeEdge) {\n        simpleGraph.replaceEdgeAttributes(\n          existingEdge,\n          mergeEdge(simpleGraph.getEdgeAttributes(existingEdge), attr)\n        );\n      }\n      return;\n    }\n\n    copyEdge(simpleGraph, undirected, edge, source, target, attr);\n  });\n\n  return simpleGraph;\n};\n","/**\n * Graphology Operators To Undirected Caster\n * ==========================================\n *\n * Function used to cast any graph to an undirected one.\n */\nvar isGraph = require('graphology-utils/is-graph');\nvar copyEdge = require('graphology-utils/add-edge').copyEdge;\n\nmodule.exports = function toUndirected(graph, options) {\n  if (!isGraph(graph))\n    throw new Error(\n      'graphology-operators/to-undirected: expecting a valid graphology instance.'\n    );\n\n  if (typeof options === 'function') options = {mergeEdge: options};\n\n  options = options || {};\n\n  var mergeEdge =\n    typeof options.mergeEdge === 'function' ? options.mergeEdge : null;\n\n  if (graph.type === 'undirected') return graph.copy();\n\n  var undirectedGraph = graph.emptyCopy({type: 'undirected'});\n\n  // Adding undirected edges\n  graph.forEachUndirectedEdge(function (edge, attr, source, target) {\n    copyEdge(undirectedGraph, true, edge, source, target, attr);\n  });\n\n  // TODO: one loop for better performance\n\n  // Merging directed edges\n  graph.forEachDirectedEdge(function (edge, attr, source, target) {\n    if (!graph.multi) {\n      var existingEdge = undirectedGraph.edge(source, target);\n\n      if (existingEdge) {\n        // We need to merge\n        if (mergeEdge)\n          undirectedGraph.replaceEdgeAttributes(\n            existingEdge,\n            mergeEdge(undirectedGraph.getEdgeAttributes(existingEdge), attr)\n          );\n\n        return;\n      }\n    }\n\n    copyEdge(undirectedGraph, true, null, source, target, attr);\n  });\n\n  return undirectedGraph;\n};\n","/**\n * Graphology Union Operator\n * ==========================\n */\nvar isGraph = require('graphology-utils/is-graph');\n\n/**\n * Function returning the union of two given graphs.\n *\n * @param  {Graph} G - The first graph.\n * @param  {Graph} H - The second graph.\n * @return {Graph}\n */\nmodule.exports = function union(G, H) {\n  if (!isGraph(G) || !isGraph(H))\n    throw new Error('graphology-operators/union: invalid graph.');\n\n  if (G.multi !== H.multi)\n    throw new Error(\n      'graphology-operators/union: both graph should be simple or multi.'\n    );\n\n  var R = G.copy();\n  R.import(H, true);\n\n  return R;\n};\n","/**\n * Graphology Dijkstra Shortest Path\n * ==================================\n *\n * Graphology implementation of Dijkstra shortest path for weighted graphs.\n */\nvar isGraph = require('graphology-utils/is-graph');\nvar createEdgeWeightGetter =\n  require('graphology-utils/getters').createEdgeWeightGetter;\nvar Heap = require('mnemonist/heap');\n\n/**\n * Defaults & helpers.\n */\nvar DEFAULT_WEIGHT_ATTRIBUTE = 'weight';\n\nfunction DIJKSTRA_HEAP_COMPARATOR(a, b) {\n  if (a[0] > b[0]) return 1;\n  if (a[0] < b[0]) return -1;\n\n  if (a[1] > b[1]) return 1;\n  if (a[1] < b[1]) return -1;\n\n  if (a[2] > b[2]) return 1;\n  if (a[2] < b[2]) return -1;\n\n  return 0;\n}\n\nfunction BRANDES_DIJKSTRA_HEAP_COMPARATOR(a, b) {\n  if (a[0] > b[0]) return 1;\n  if (a[0] < b[0]) return -1;\n\n  if (a[1] > b[1]) return 1;\n  if (a[1] < b[1]) return -1;\n\n  if (a[2] > b[2]) return 1;\n  if (a[2] < b[2]) return -1;\n\n  if (a[3] > b[3]) return 1;\n  if (a[3] < b[3]) return -1;\n\n  return 0;\n}\n\n/**\n * Bidirectional Dijkstra shortest path between source & target node abstract.\n *\n * Note that this implementation was basically copied from networkx.\n *\n * @param  {Graph}  graph         - The graphology instance.\n * @param  {string} source        - Source node.\n * @param  {string} target        - Target node.\n * @param  {string} getEdgeWeight - Name of the weight attribute or getter function.\n * @param  {array}                - The found path if any and its cost.\n */\nfunction abstractBidirectionalDijkstra(graph, source, target, getEdgeWeight) {\n  source = '' + source;\n  target = '' + target;\n\n  // Sanity checks\n  if (!isGraph(graph))\n    throw new Error(\n      'graphology-shortest-path/dijkstra: invalid graphology instance.'\n    );\n\n  if (source && !graph.hasNode(source))\n    throw new Error(\n      'graphology-shortest-path/dijkstra: the \"' +\n        source +\n        '\" source node does not exist in the given graph.'\n    );\n\n  if (target && !graph.hasNode(target))\n    throw new Error(\n      'graphology-shortest-path/dijkstra: the \"' +\n        target +\n        '\" target node does not exist in the given graph.'\n    );\n\n  getEdgeWeight = createEdgeWeightGetter(\n    getEdgeWeight || DEFAULT_WEIGHT_ATTRIBUTE\n  ).fromMinimalEntry;\n\n  if (source === target) return [0, [source]];\n\n  var distances = [{}, {}],\n    paths = [{}, {}],\n    fringe = [\n      new Heap(DIJKSTRA_HEAP_COMPARATOR),\n      new Heap(DIJKSTRA_HEAP_COMPARATOR)\n    ],\n    seen = [{}, {}];\n\n  paths[0][source] = [source];\n  paths[1][target] = [target];\n\n  seen[0][source] = 0;\n  seen[1][target] = 0;\n\n  var finalPath = [],\n    finalDistance = Infinity;\n\n  var count = 0,\n    dir = 1,\n    item,\n    edges,\n    cost,\n    d,\n    v,\n    u,\n    e,\n    i,\n    l;\n\n  fringe[0].push([0, count++, source]);\n  fringe[1].push([0, count++, target]);\n\n  while (fringe[0].size && fringe[1].size) {\n    // Swapping direction\n    dir = 1 - dir;\n\n    item = fringe[dir].pop();\n    d = item[0];\n    v = item[2];\n\n    if (v in distances[dir]) continue;\n\n    distances[dir][v] = d;\n\n    // Shortest path is found?\n    if (v in distances[1 - dir]) return [finalDistance, finalPath];\n\n    edges = dir === 1 ? graph.inboundEdges(v) : graph.outboundEdges(v);\n\n    for (i = 0, l = edges.length; i < l; i++) {\n      e = edges[i];\n      u = graph.opposite(v, e);\n      cost = distances[dir][v] + getEdgeWeight(e, graph.getEdgeAttributes(e));\n\n      if (u in distances[dir] && cost < distances[dir][u]) {\n        throw Error(\n          'graphology-shortest-path/dijkstra: contradictory paths found. Do some of your edges have a negative weight?'\n        );\n      } else if (!(u in seen[dir]) || cost < seen[dir][u]) {\n        seen[dir][u] = cost;\n        fringe[dir].push([cost, count++, u]);\n        paths[dir][u] = paths[dir][v].concat(u);\n\n        if (u in seen[0] && u in seen[1]) {\n          d = seen[0][u] + seen[1][u];\n\n          if (finalPath.length === 0 || finalDistance > d) {\n            finalDistance = d;\n            finalPath = paths[0][u].concat(paths[1][u].slice(0, -1).reverse());\n          }\n        }\n      }\n    }\n  }\n\n  // No path was found\n  return [Infinity, null];\n}\n\n/**\n * Multisource Dijkstra shortest path abstract function. This function is the\n * basis of the algorithm that every other will use.\n *\n * Note that this implementation was basically copied from networkx.\n * TODO: it might be more performant to use a dedicated objet for the heap's\n * items.\n *\n * @param  {Graph}  graph         - The graphology instance.\n * @param  {array}  sources       - A list of sources.\n * @param  {string} getEdgeWeight - Name of the weight attribute or getter function.\n * @param  {number} cutoff        - Maximum depth of the search.\n * @param  {string} target        - Optional target to reach.\n * @param  {object} paths         - Optional paths object to maintain.\n * @return {object}               - Returns the paths.\n */\nfunction abstractDijkstraMultisource(\n  graph,\n  sources,\n  getEdgeWeight,\n  cutoff,\n  target,\n  paths\n) {\n  if (!isGraph(graph))\n    throw new Error(\n      'graphology-shortest-path/dijkstra: invalid graphology instance.'\n    );\n\n  if (target && !graph.hasNode(target))\n    throw new Error(\n      'graphology-shortest-path/dijkstra: the \"' +\n        target +\n        '\" target node does not exist in the given graph.'\n    );\n\n  getEdgeWeight = createEdgeWeightGetter(\n    getEdgeWeight || DEFAULT_WEIGHT_ATTRIBUTE\n  ).fromMinimalEntry;\n\n  var distances = {},\n    seen = {},\n    fringe = new Heap(DIJKSTRA_HEAP_COMPARATOR);\n\n  var count = 0,\n    edges,\n    item,\n    cost,\n    v,\n    u,\n    e,\n    d,\n    i,\n    j,\n    l,\n    m;\n\n  for (i = 0, l = sources.length; i < l; i++) {\n    v = sources[i];\n    seen[v] = 0;\n    fringe.push([0, count++, v]);\n\n    if (paths) paths[v] = [v];\n  }\n\n  while (fringe.size) {\n    item = fringe.pop();\n    d = item[0];\n    v = item[2];\n\n    if (v in distances) continue;\n\n    distances[v] = d;\n\n    if (v === target) break;\n\n    edges = graph.outboundEdges(v);\n\n    for (j = 0, m = edges.length; j < m; j++) {\n      e = edges[j];\n      u = graph.opposite(v, e);\n      cost = getEdgeWeight(e, graph.getEdgeAttributes(e)) + distances[v];\n\n      if (cutoff && cost > cutoff) continue;\n\n      if (u in distances && cost < distances[u]) {\n        throw Error(\n          'graphology-shortest-path/dijkstra: contradictory paths found. Do some of your edges have a negative weight?'\n        );\n      } else if (!(u in seen) || cost < seen[u]) {\n        seen[u] = cost;\n        fringe.push([cost, count++, u]);\n\n        if (paths) paths[u] = paths[v].concat(u);\n      }\n    }\n  }\n\n  return distances;\n}\n\n/**\n * Single source Dijkstra shortest path between given node & other nodes in\n * the graph.\n *\n * @param  {Graph}  graph         - The graphology instance.\n * @param  {string} source        - Source node.\n * @param  {string} getEdgeWeight - Name of the weight attribute or getter function.\n * @return {object}               - An object of found paths.\n */\nfunction singleSourceDijkstra(graph, source, getEdgeWeight) {\n  var paths = {};\n\n  abstractDijkstraMultisource(graph, [source], getEdgeWeight, 0, null, paths);\n\n  return paths;\n}\n\nfunction bidirectionalDijkstra(graph, source, target, getEdgeWeight) {\n  return abstractBidirectionalDijkstra(graph, source, target, getEdgeWeight)[1];\n}\n\n/**\n * Function using Ulrik Brandes' method to map single source shortest paths\n * from selected node.\n *\n * [Reference]:\n * Ulrik Brandes: A Faster Algorithm for Betweenness Centrality.\n * Journal of Mathematical Sociology 25(2):163-177, 2001.\n *\n * @param  {Graph}  graph         - Target graph.\n * @param  {any}    source        - Source node.\n * @param  {string} getEdgeWeight - Name of the weight attribute or getter function.\n * @return {array}                - [Stack, Paths, Sigma]\n */\nfunction brandes(graph, source, getEdgeWeight) {\n  source = '' + source;\n\n  getEdgeWeight = createEdgeWeightGetter(\n    getEdgeWeight || DEFAULT_WEIGHT_ATTRIBUTE\n  ).fromMinimalEntry;\n\n  var S = [],\n    P = {},\n    sigma = {};\n\n  var nodes = graph.nodes(),\n    edges,\n    item,\n    pred,\n    dist,\n    cost,\n    v,\n    w,\n    e,\n    i,\n    l;\n\n  for (i = 0, l = nodes.length; i < l; i++) {\n    v = nodes[i];\n    P[v] = [];\n    sigma[v] = 0;\n  }\n\n  var D = {};\n\n  sigma[source] = 1;\n\n  var seen = {};\n  seen[source] = 0;\n\n  var count = 0;\n\n  var Q = new Heap(BRANDES_DIJKSTRA_HEAP_COMPARATOR);\n  Q.push([0, count++, source, source]);\n\n  while (Q.size) {\n    item = Q.pop();\n    dist = item[0];\n    pred = item[2];\n    v = item[3];\n\n    if (v in D) continue;\n\n    sigma[v] += sigma[pred];\n    S.push(v);\n    D[v] = dist;\n\n    edges = graph.outboundEdges(v);\n\n    for (i = 0, l = edges.length; i < l; i++) {\n      e = edges[i];\n      w = graph.opposite(v, e);\n      cost = dist + getEdgeWeight(e, graph.getEdgeAttributes(e));\n\n      if (!(w in D) && (!(w in seen) || cost < seen[w])) {\n        seen[w] = cost;\n        Q.push([cost, count++, v, w]);\n        sigma[w] = 0;\n        P[w] = [v];\n      } else if (cost === seen[w]) {\n        sigma[w] += sigma[v];\n        P[w].push(v);\n      }\n    }\n  }\n\n  return [S, P, sigma];\n}\n\n/**\n * Exporting.\n */\nexports.bidirectional = bidirectionalDijkstra;\nexports.singleSource = singleSourceDijkstra;\nexports.brandes = brandes;\n","/**\n * Graphology Shortest Path\n * =========================\n *\n * Library endpoint.\n */\nvar unweighted = require('./unweighted.js');\nvar utils = require('./utils.js');\n\nexports.unweighted = unweighted;\nexports.dijkstra = require('./dijkstra.js');\n\nexports.bidirectional = unweighted.bidirectional;\nexports.singleSource = unweighted.singleSource;\nexports.singleSourceLength = unweighted.singleSourceLength;\nexports.undirectedSingleSourceLength = unweighted.undirectedSingleSourceLength;\nexports.brandes = unweighted.brandes;\n\nexports.edgePathFromNodePath = utils.edgePathFromNodePath;\n","/**\n * Graphology Unweighted Shortest Path\n * ====================================\n *\n * Basic algorithms to find the shortest paths between nodes in a graph\n * whose edges are not weighted.\n */\nvar isGraph = require('graphology-utils/is-graph');\nvar Queue = require('mnemonist/queue');\nvar extend = require('@yomguithereal/helpers/extend');\n\n/**\n * Function attempting to find the shortest path in a graph between\n * given source & target or `null` if such a path does not exist.\n *\n * @param  {Graph}      graph  - Target graph.\n * @param  {any}        source - Source node.\n * @param  {any}        target - Target node.\n * @return {array|null}        - Found path or `null`.\n */\nfunction bidirectional(graph, source, target) {\n  if (!isGraph(graph))\n    throw new Error('graphology-shortest-path: invalid graphology instance.');\n\n  if (arguments.length < 3)\n    throw new Error(\n      'graphology-shortest-path: invalid number of arguments. Expecting at least 3.'\n    );\n\n  if (!graph.hasNode(source))\n    throw new Error(\n      'graphology-shortest-path: the \"' +\n        source +\n        '\" source node does not exist in the given graph.'\n    );\n\n  if (!graph.hasNode(target))\n    throw new Error(\n      'graphology-shortest-path: the \"' +\n        target +\n        '\" target node does not exist in the given graph.'\n    );\n\n  source = '' + source;\n  target = '' + target;\n\n  // TODO: do we need a self loop to go there?\n  if (source === target) {\n    return [source];\n  }\n\n  // Binding functions\n  var getPredecessors = graph.inboundNeighbors.bind(graph),\n    getSuccessors = graph.outboundNeighbors.bind(graph);\n\n  var predecessor = {},\n    successor = {};\n\n  // Predecessor & successor\n  predecessor[source] = null;\n  successor[target] = null;\n\n  // Fringes\n  var forwardFringe = [source],\n    reverseFringe = [target],\n    currentFringe,\n    node,\n    neighbors,\n    neighbor,\n    i,\n    j,\n    l,\n    m;\n\n  var found = false;\n\n  outer: while (forwardFringe.length && reverseFringe.length) {\n    if (forwardFringe.length <= reverseFringe.length) {\n      currentFringe = forwardFringe;\n      forwardFringe = [];\n\n      for (i = 0, l = currentFringe.length; i < l; i++) {\n        node = currentFringe[i];\n        neighbors = getSuccessors(node);\n\n        for (j = 0, m = neighbors.length; j < m; j++) {\n          neighbor = neighbors[j];\n\n          if (!(neighbor in predecessor)) {\n            forwardFringe.push(neighbor);\n            predecessor[neighbor] = node;\n          }\n\n          if (neighbor in successor) {\n            // Path is found!\n            found = true;\n            break outer;\n          }\n        }\n      }\n    } else {\n      currentFringe = reverseFringe;\n      reverseFringe = [];\n\n      for (i = 0, l = currentFringe.length; i < l; i++) {\n        node = currentFringe[i];\n        neighbors = getPredecessors(node);\n\n        for (j = 0, m = neighbors.length; j < m; j++) {\n          neighbor = neighbors[j];\n\n          if (!(neighbor in successor)) {\n            reverseFringe.push(neighbor);\n            successor[neighbor] = node;\n          }\n\n          if (neighbor in predecessor) {\n            // Path is found!\n            found = true;\n            break outer;\n          }\n        }\n      }\n    }\n  }\n\n  if (!found) return null;\n\n  var path = [];\n\n  while (neighbor) {\n    path.unshift(neighbor);\n    neighbor = predecessor[neighbor];\n  }\n\n  neighbor = successor[path[path.length - 1]];\n\n  while (neighbor) {\n    path.push(neighbor);\n    neighbor = successor[neighbor];\n  }\n\n  return path.length ? path : null;\n}\n\n/**\n * Function attempting to find the shortest path in the graph between the\n * given source node & all the other nodes.\n *\n * @param  {Graph}  graph  - Target graph.\n * @param  {any}    source - Source node.\n * @return {object}        - The map of found paths.\n */\n\n// TODO: cutoff option\nfunction singleSource(graph, source) {\n  if (!isGraph(graph))\n    throw new Error('graphology-shortest-path: invalid graphology instance.');\n\n  if (arguments.length < 2)\n    throw new Error(\n      'graphology-shortest-path: invalid number of arguments. Expecting at least 2.'\n    );\n\n  if (!graph.hasNode(source))\n    throw new Error(\n      'graphology-shortest-path: the \"' +\n        source +\n        '\" source node does not exist in the given graph.'\n    );\n\n  source = '' + source;\n\n  var nextLevel = {},\n    paths = {},\n    currentLevel,\n    neighbors,\n    v,\n    w,\n    i,\n    l;\n\n  nextLevel[source] = true;\n  paths[source] = [source];\n\n  while (Object.keys(nextLevel).length) {\n    currentLevel = nextLevel;\n    nextLevel = {};\n\n    for (v in currentLevel) {\n      neighbors = graph.outboundNeighbors(v);\n\n      for (i = 0, l = neighbors.length; i < l; i++) {\n        w = neighbors[i];\n\n        if (!paths[w]) {\n          paths[w] = paths[v].concat(w);\n          nextLevel[w] = true;\n        }\n      }\n    }\n  }\n\n  return paths;\n}\n\n/**\n * Function attempting to find the shortest path lengths in the graph between\n * the given source node & all the other nodes.\n *\n * @param  {string} method - Neighbor collection method name.\n * @param  {Graph}  graph  - Target graph.\n * @param  {any}    source - Source node.\n * @return {object}        - The map of found path lengths.\n */\n\n// TODO: cutoff option\nfunction asbtractSingleSourceLength(method, graph, source) {\n  if (!isGraph(graph))\n    throw new Error('graphology-shortest-path: invalid graphology instance.');\n\n  if (!graph.hasNode(source))\n    throw new Error(\n      'graphology-shortest-path: the \"' +\n        source +\n        '\" source node does not exist in the given graph.'\n    );\n\n  source = '' + source;\n\n  // Performing BFS to count shortest paths\n  var seen = new Set();\n\n  var lengths = {},\n    level = 0;\n\n  lengths[source] = 0;\n\n  var currentLevel = [source];\n\n  var i, l, node;\n\n  while (currentLevel.length !== 0) {\n    var nextLevel = [];\n\n    for (i = 0, l = currentLevel.length; i < l; i++) {\n      node = currentLevel[i];\n\n      if (seen.has(node)) continue;\n\n      seen.add(node);\n      extend(nextLevel, graph[method](node));\n\n      lengths[node] = level;\n    }\n\n    level++;\n    currentLevel = nextLevel;\n  }\n\n  return lengths;\n}\n\nvar singleSourceLength = asbtractSingleSourceLength.bind(\n  null,\n  'outboundNeighbors'\n);\nvar undirectedSingleSourceLength = asbtractSingleSourceLength.bind(\n  null,\n  'neighbors'\n);\n\n/**\n * Function using Ulrik Brandes' method to map single source shortest paths\n * from selected node.\n *\n * [Reference]:\n * Ulrik Brandes: A Faster Algorithm for Betweenness Centrality.\n * Journal of Mathematical Sociology 25(2):163-177, 2001.\n *\n * @param  {Graph}  graph      - Target graph.\n * @param  {any}    source     - Source node.\n * @return {array}             - [Stack, Paths, Sigma]\n */\nfunction brandes(graph, source) {\n  source = '' + source;\n\n  var S = [],\n    P = {},\n    sigma = {};\n\n  var nodes = graph.nodes(),\n    Dv,\n    sigmav,\n    neighbors,\n    v,\n    w,\n    i,\n    j,\n    l,\n    m;\n\n  for (i = 0, l = nodes.length; i < l; i++) {\n    v = nodes[i];\n    P[v] = [];\n    sigma[v] = 0;\n  }\n\n  var D = {};\n\n  sigma[source] = 1;\n  D[source] = 0;\n\n  var queue = Queue.of(source);\n\n  while (queue.size) {\n    v = queue.dequeue();\n    S.push(v);\n\n    Dv = D[v];\n    sigmav = sigma[v];\n\n    neighbors = graph.outboundNeighbors(v);\n\n    for (j = 0, m = neighbors.length; j < m; j++) {\n      w = neighbors[j];\n\n      if (!(w in D)) {\n        queue.enqueue(w);\n        D[w] = Dv + 1;\n      }\n\n      if (D[w] === Dv + 1) {\n        sigma[w] += sigmav;\n        P[w].push(v);\n      }\n    }\n  }\n\n  return [S, P, sigma];\n}\n\n/**\n * Exporting.\n */\nexports.bidirectional = bidirectional;\nexports.singleSource = singleSource;\nexports.singleSourceLength = singleSourceLength;\nexports.undirectedSingleSourceLength = undirectedSingleSourceLength;\nexports.brandes = brandes;\n","/**\n * Graphology Shortest Path Utils\n * ===============================\n *\n * Miscellaneous shortest-path helper functions.\n */\nvar returnTrue = function () {\n  return true;\n};\n\nexports.edgePathFromNodePath = function (graph, nodePath) {\n  var l = nodePath.length;\n\n  var i, source, target, edge;\n\n  // Self loops\n  if (l < 2) {\n    source = nodePath[0];\n\n    edge = graph.multi\n      ? graph.findEdge(source, source, returnTrue)\n      : graph.edge(source, source);\n\n    if (edge) return [edge];\n\n    return [];\n  }\n\n  l--;\n\n  var edgePath = new Array(l);\n\n  for (i = 0; i < l; i++) {\n    source = nodePath[i];\n    target = nodePath[i + 1];\n\n    edge = graph.multi\n      ? graph.findOutboundEdge(source, target, returnTrue)\n      : graph.edge(source, target);\n\n    if (edge === undefined)\n      throw new Error(\n        'graphology-shortest-path: given path is impossible in given graph.'\n      );\n\n    edgePath[i] = edge;\n  }\n\n  return edgePath;\n};\n","/**\n * Graphology Edge Adders\n * =======================\n *\n * Generic edge addition functions that can be used to avoid nasty repetitive\n * conditions.\n */\nexports.addEdge = function addEdge(\n  graph,\n  undirected,\n  key,\n  source,\n  target,\n  attributes\n) {\n  if (undirected) {\n    if (key === null || key === undefined)\n      return graph.addUndirectedEdge(source, target, attributes);\n    else return graph.addUndirectedEdgeWithKey(key, source, target, attributes);\n  } else {\n    if (key === null || key === undefined)\n      return graph.addDirectedEdge(source, target, attributes);\n    else return graph.addDirectedEdgeWithKey(key, source, target, attributes);\n  }\n};\n\nexports.copyEdge = function copyEdge(\n  graph,\n  undirected,\n  key,\n  source,\n  target,\n  attributes\n) {\n  attributes = Object.assign({}, attributes);\n\n  if (undirected) {\n    if (key === null || key === undefined)\n      return graph.addUndirectedEdge(source, target, attributes);\n    else return graph.addUndirectedEdgeWithKey(key, source, target, attributes);\n  } else {\n    if (key === null || key === undefined)\n      return graph.addDirectedEdge(source, target, attributes);\n    else return graph.addDirectedEdgeWithKey(key, source, target, attributes);\n  }\n};\n\nexports.mergeEdge = function mergeEdge(\n  graph,\n  undirected,\n  key,\n  source,\n  target,\n  attributes\n) {\n  if (undirected) {\n    if (key === null || key === undefined)\n      return graph.mergeUndirectedEdge(source, target, attributes);\n    else\n      return graph.mergeUndirectedEdgeWithKey(key, source, target, attributes);\n  } else {\n    if (key === null || key === undefined)\n      return graph.mergeDirectedEdge(source, target, attributes);\n    else return graph.mergeDirectedEdgeWithKey(key, source, target, attributes);\n  }\n};\n\nexports.updateEdge = function updateEdge(\n  graph,\n  undirected,\n  key,\n  source,\n  target,\n  updater\n) {\n  if (undirected) {\n    if (key === null || key === undefined)\n      return graph.updateUndirectedEdge(source, target, updater);\n    else return graph.updateUndirectedEdgeWithKey(key, source, target, updater);\n  } else {\n    if (key === null || key === undefined)\n      return graph.updateDirectedEdge(source, target, updater);\n    else return graph.updateDirectedEdgeWithKey(key, source, target, updater);\n  }\n};\n","/**\n * Graphology Node Adders\n * =======================\n *\n * Generic node addition functions that can be used to avoid nasty repetitive\n * conditions.\n */\nexports.copyNode = function (graph, key, attributes) {\n  attributes = Object.assign({}, attributes);\n  return graph.addNode(key, attributes);\n};\n","/**\n * Graphology Defaults\n * ====================\n *\n * Helper function used throughout the standard lib to resolve defaults.\n */\nfunction isLeaf(o) {\n  return (\n    !o ||\n    typeof o !== 'object' ||\n    typeof o === 'function' ||\n    Array.isArray(o) ||\n    o instanceof Set ||\n    o instanceof Map ||\n    o instanceof RegExp ||\n    o instanceof Date\n  );\n}\n\nfunction resolveDefaults(target, defaults) {\n  target = target || {};\n\n  var output = {};\n\n  for (var k in defaults) {\n    var existing = target[k];\n    var def = defaults[k];\n\n    // Recursion\n    if (!isLeaf(def)) {\n      output[k] = resolveDefaults(existing, def);\n\n      continue;\n    }\n\n    // Leaf\n    if (existing === undefined) {\n      output[k] = def;\n    } else {\n      output[k] = existing;\n    }\n  }\n\n  return output;\n}\n\nmodule.exports = resolveDefaults;\n","/**\n * Graphology Weight Getter\n * =========================\n *\n * Function creating weight getters.\n */\nfunction coerceWeight(value) {\n  // Ensuring target value is a correct number\n  if (typeof value !== 'number' || isNaN(value)) return 1;\n\n  return value;\n}\n\nfunction createNodeValueGetter(nameOrFunction, defaultValue) {\n  var getter = {};\n\n  var coerceToDefault = function (v) {\n    if (typeof v === 'undefined') return defaultValue;\n\n    return v;\n  };\n\n  if (typeof defaultValue === 'function') coerceToDefault = defaultValue;\n\n  var get = function (attributes) {\n    return coerceToDefault(attributes[nameOrFunction]);\n  };\n\n  var returnDefault = function () {\n    return coerceToDefault(undefined);\n  };\n\n  if (typeof nameOrFunction === 'string') {\n    getter.fromAttributes = get;\n    getter.fromGraph = function (graph, node) {\n      return get(graph.getNodeAttributes(node));\n    };\n    getter.fromEntry = function (node, attributes) {\n      return get(attributes);\n    };\n  } else if (typeof nameOrFunction === 'function') {\n    getter.fromAttributes = function () {\n      throw new Error(\n        'graphology-utils/getters/createNodeValueGetter: irrelevant usage.'\n      );\n    };\n    getter.fromGraph = function (graph, node) {\n      return coerceToDefault(\n        nameOrFunction(node, graph.getNodeAttributes(node))\n      );\n    };\n    getter.fromEntry = function (node, attributes) {\n      return coerceToDefault(nameOrFunction(node, attributes));\n    };\n  } else {\n    getter.fromAttributes = returnDefault;\n    getter.fromGraph = returnDefault;\n    getter.fromEntry = returnDefault;\n  }\n\n  return getter;\n}\n\nfunction createEdgeValueGetter(nameOrFunction, defaultValue) {\n  var getter = {};\n\n  var coerceToDefault = function (v) {\n    if (typeof v === 'undefined') return defaultValue;\n\n    return v;\n  };\n\n  if (typeof defaultValue === 'function') coerceToDefault = defaultValue;\n\n  var get = function (attributes) {\n    return coerceToDefault(attributes[nameOrFunction]);\n  };\n\n  var returnDefault = function () {\n    return coerceToDefault(undefined);\n  };\n\n  if (typeof nameOrFunction === 'string') {\n    getter.fromAttributes = get;\n    getter.fromGraph = function (graph, edge) {\n      return get(graph.getEdgeAttributes(edge));\n    };\n    getter.fromEntry = function (edge, attributes) {\n      return get(attributes);\n    };\n    getter.fromPartialEntry = getter.fromEntry;\n    getter.fromMinimalEntry = getter.fromEntry;\n  } else if (typeof nameOrFunction === 'function') {\n    getter.fromAttributes = function () {\n      throw new Error(\n        'graphology-utils/getters/createEdgeValueGetter: irrelevant usage.'\n      );\n    };\n    getter.fromGraph = function (graph, edge) {\n      // TODO: we can do better, check #310\n      var extremities = graph.extremities(edge);\n      return coerceToDefault(\n        nameOrFunction(\n          edge,\n          graph.getEdgeAttributes(edge),\n          extremities[0],\n          extremities[1],\n          graph.getNodeAttributes(extremities[0]),\n          graph.getNodeAttributes(extremities[1]),\n          graph.isUndirected(edge)\n        )\n      );\n    };\n    getter.fromEntry = function (e, a, s, t, sa, ta, u) {\n      return coerceToDefault(nameOrFunction(e, a, s, t, sa, ta, u));\n    };\n    getter.fromPartialEntry = function (e, a, s, t) {\n      return coerceToDefault(nameOrFunction(e, a, s, t));\n    };\n    getter.fromMinimalEntry = function (e, a) {\n      return coerceToDefault(nameOrFunction(e, a));\n    };\n  } else {\n    getter.fromAttributes = returnDefault;\n    getter.fromGraph = returnDefault;\n    getter.fromEntry = returnDefault;\n    getter.fromMinimalEntry = returnDefault;\n  }\n\n  return getter;\n}\n\nexports.createNodeValueGetter = createNodeValueGetter;\nexports.createEdgeValueGetter = createEdgeValueGetter;\nexports.createEdgeWeightGetter = function (name) {\n  return createEdgeValueGetter(name, coerceWeight);\n};\n","/**\n * Graphology isGraph\n * ===================\n *\n * Very simple function aiming at ensuring the given variable is a\n * graphology instance.\n */\n\n/**\n * Checking the value is a graphology instance.\n *\n * @param  {any}     value - Target value.\n * @return {boolean}\n */\nmodule.exports = function isGraph(value) {\n  return (\n    value !== null &&\n    typeof value === 'object' &&\n    typeof value.addUndirectedEdgeWithKey === 'function' &&\n    typeof value.dropNode === 'function' &&\n    typeof value.multi === 'boolean'\n  );\n};\n","!function(t,e){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=e():\"function\"==typeof define&&define.amd?define(e):(t=\"undefined\"!=typeof globalThis?globalThis:t||self).graphology=e()}(this,(function(){\"use strict\";function t(e){return t=\"function\"==typeof Symbol&&\"symbol\"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&\"function\"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?\"symbol\":typeof t},t(e)}function e(t,e){t.prototype=Object.create(e.prototype),t.prototype.constructor=t,r(t,e)}function n(t){return n=Object.setPrototypeOf?Object.getPrototypeOf.bind():function(t){return t.__proto__||Object.getPrototypeOf(t)},n(t)}function r(t,e){return r=Object.setPrototypeOf?Object.setPrototypeOf.bind():function(t,e){return t.__proto__=e,t},r(t,e)}function i(){if(\"undefined\"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if(\"function\"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(t){return!1}}function o(t,e,n){return o=i()?Reflect.construct.bind():function(t,e,n){var i=[null];i.push.apply(i,e);var o=new(Function.bind.apply(t,i));return n&&r(o,n.prototype),o},o.apply(null,arguments)}function a(t){var e=\"function\"==typeof Map?new Map:void 0;return a=function(t){if(null===t||(i=t,-1===Function.toString.call(i).indexOf(\"[native code]\")))return t;var i;if(\"function\"!=typeof t)throw new TypeError(\"Super expression must either be null or a function\");if(void 0!==e){if(e.has(t))return e.get(t);e.set(t,a)}function a(){return o(t,arguments,n(this).constructor)}return a.prototype=Object.create(t.prototype,{constructor:{value:a,enumerable:!1,writable:!0,configurable:!0}}),r(a,t)},a(t)}function c(t){if(void 0===t)throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");return t}var u=function(){for(var t=arguments[0],e=1,n=arguments.length;e<n;e++)if(arguments[e])for(var r in arguments[e])t[r]=arguments[e][r];return t};function d(t,e,n,r){var i=t._nodes.get(e),o=null;return i?o=\"mixed\"===r?i.out&&i.out[n]||i.undirected&&i.undirected[n]:\"directed\"===r?i.out&&i.out[n]:i.undirected&&i.undirected[n]:o}function s(e){return\"object\"===t(e)&&null!==e&&e.constructor===Object}function h(t){var e;for(e in t)return!1;return!0}function p(t,e,n){Object.defineProperty(t,e,{enumerable:!1,configurable:!1,writable:!0,value:n})}function f(t,e,n){var r={enumerable:!0,configurable:!0};\"function\"==typeof n?r.get=n:(r.value=n,r.writable=!1),Object.defineProperty(t,e,r)}function l(t){return!!s(t)&&!(t.attributes&&!Array.isArray(t.attributes))}\"function\"==typeof Object.assign&&(u=Object.assign);var g,y={exports:{}},w=\"object\"==typeof Reflect?Reflect:null,v=w&&\"function\"==typeof w.apply?w.apply:function(t,e,n){return Function.prototype.apply.call(t,e,n)};g=w&&\"function\"==typeof w.ownKeys?w.ownKeys:Object.getOwnPropertySymbols?function(t){return Object.getOwnPropertyNames(t).concat(Object.getOwnPropertySymbols(t))}:function(t){return Object.getOwnPropertyNames(t)};var b=Number.isNaN||function(t){return t!=t};function m(){m.init.call(this)}y.exports=m,y.exports.once=function(t,e){return new Promise((function(n,r){function i(n){t.removeListener(e,o),r(n)}function o(){\"function\"==typeof t.removeListener&&t.removeListener(\"error\",i),n([].slice.call(arguments))}U(t,e,o,{once:!0}),\"error\"!==e&&function(t,e,n){\"function\"==typeof t.on&&U(t,\"error\",e,n)}(t,i,{once:!0})}))},m.EventEmitter=m,m.prototype._events=void 0,m.prototype._eventsCount=0,m.prototype._maxListeners=void 0;var k=10;function _(t){if(\"function\"!=typeof t)throw new TypeError('The \"listener\" argument must be of type Function. Received type '+typeof t)}function G(t){return void 0===t._maxListeners?m.defaultMaxListeners:t._maxListeners}function x(t,e,n,r){var i,o,a,c;if(_(n),void 0===(o=t._events)?(o=t._events=Object.create(null),t._eventsCount=0):(void 0!==o.newListener&&(t.emit(\"newListener\",e,n.listener?n.listener:n),o=t._events),a=o[e]),void 0===a)a=o[e]=n,++t._eventsCount;else if(\"function\"==typeof a?a=o[e]=r?[n,a]:[a,n]:r?a.unshift(n):a.push(n),(i=G(t))>0&&a.length>i&&!a.warned){a.warned=!0;var u=new Error(\"Possible EventEmitter memory leak detected. \"+a.length+\" \"+String(e)+\" listeners added. Use emitter.setMaxListeners() to increase limit\");u.name=\"MaxListenersExceededWarning\",u.emitter=t,u.type=e,u.count=a.length,c=u,console&&console.warn&&console.warn(c)}return t}function E(){if(!this.fired)return this.target.removeListener(this.type,this.wrapFn),this.fired=!0,0===arguments.length?this.listener.call(this.target):this.listener.apply(this.target,arguments)}function A(t,e,n){var r={fired:!1,wrapFn:void 0,target:t,type:e,listener:n},i=E.bind(r);return i.listener=n,r.wrapFn=i,i}function L(t,e,n){var r=t._events;if(void 0===r)return[];var i=r[e];return void 0===i?[]:\"function\"==typeof i?n?[i.listener||i]:[i]:n?function(t){for(var e=new Array(t.length),n=0;n<e.length;++n)e[n]=t[n].listener||t[n];return e}(i):D(i,i.length)}function S(t){var e=this._events;if(void 0!==e){var n=e[t];if(\"function\"==typeof n)return 1;if(void 0!==n)return n.length}return 0}function D(t,e){for(var n=new Array(e),r=0;r<e;++r)n[r]=t[r];return n}function U(t,e,n,r){if(\"function\"==typeof t.on)r.once?t.once(e,n):t.on(e,n);else{if(\"function\"!=typeof t.addEventListener)throw new TypeError('The \"emitter\" argument must be of type EventEmitter. Received type '+typeof t);t.addEventListener(e,(function i(o){r.once&&t.removeEventListener(e,i),n(o)}))}}function N(t){if(\"function\"!=typeof t)throw new Error(\"obliterator/iterator: expecting a function!\");this.next=t}Object.defineProperty(m,\"defaultMaxListeners\",{enumerable:!0,get:function(){return k},set:function(t){if(\"number\"!=typeof t||t<0||b(t))throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received '+t+\".\");k=t}}),m.init=function(){void 0!==this._events&&this._events!==Object.getPrototypeOf(this)._events||(this._events=Object.create(null),this._eventsCount=0),this._maxListeners=this._maxListeners||void 0},m.prototype.setMaxListeners=function(t){if(\"number\"!=typeof t||t<0||b(t))throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received '+t+\".\");return this._maxListeners=t,this},m.prototype.getMaxListeners=function(){return G(this)},m.prototype.emit=function(t){for(var e=[],n=1;n<arguments.length;n++)e.push(arguments[n]);var r=\"error\"===t,i=this._events;if(void 0!==i)r=r&&void 0===i.error;else if(!r)return!1;if(r){var o;if(e.length>0&&(o=e[0]),o instanceof Error)throw o;var a=new Error(\"Unhandled error.\"+(o?\" (\"+o.message+\")\":\"\"));throw a.context=o,a}var c=i[t];if(void 0===c)return!1;if(\"function\"==typeof c)v(c,this,e);else{var u=c.length,d=D(c,u);for(n=0;n<u;++n)v(d[n],this,e)}return!0},m.prototype.addListener=function(t,e){return x(this,t,e,!1)},m.prototype.on=m.prototype.addListener,m.prototype.prependListener=function(t,e){return x(this,t,e,!0)},m.prototype.once=function(t,e){return _(e),this.on(t,A(this,t,e)),this},m.prototype.prependOnceListener=function(t,e){return _(e),this.prependListener(t,A(this,t,e)),this},m.prototype.removeListener=function(t,e){var n,r,i,o,a;if(_(e),void 0===(r=this._events))return this;if(void 0===(n=r[t]))return this;if(n===e||n.listener===e)0==--this._eventsCount?this._events=Object.create(null):(delete r[t],r.removeListener&&this.emit(\"removeListener\",t,n.listener||e));else if(\"function\"!=typeof n){for(i=-1,o=n.length-1;o>=0;o--)if(n[o]===e||n[o].listener===e){a=n[o].listener,i=o;break}if(i<0)return this;0===i?n.shift():function(t,e){for(;e+1<t.length;e++)t[e]=t[e+1];t.pop()}(n,i),1===n.length&&(r[t]=n[0]),void 0!==r.removeListener&&this.emit(\"removeListener\",t,a||e)}return this},m.prototype.off=m.prototype.removeListener,m.prototype.removeAllListeners=function(t){var e,n,r;if(void 0===(n=this._events))return this;if(void 0===n.removeListener)return 0===arguments.length?(this._events=Object.create(null),this._eventsCount=0):void 0!==n[t]&&(0==--this._eventsCount?this._events=Object.create(null):delete n[t]),this;if(0===arguments.length){var i,o=Object.keys(n);for(r=0;r<o.length;++r)\"removeListener\"!==(i=o[r])&&this.removeAllListeners(i);return this.removeAllListeners(\"removeListener\"),this._events=Object.create(null),this._eventsCount=0,this}if(\"function\"==typeof(e=n[t]))this.removeListener(t,e);else if(void 0!==e)for(r=e.length-1;r>=0;r--)this.removeListener(t,e[r]);return this},m.prototype.listeners=function(t){return L(this,t,!0)},m.prototype.rawListeners=function(t){return L(this,t,!1)},m.listenerCount=function(t,e){return\"function\"==typeof t.listenerCount?t.listenerCount(e):S.call(t,e)},m.prototype.listenerCount=S,m.prototype.eventNames=function(){return this._eventsCount>0?g(this._events):[]},\"undefined\"!=typeof Symbol&&(N.prototype[Symbol.iterator]=function(){return this}),N.of=function(){var t=arguments,e=t.length,n=0;return new N((function(){return n>=e?{done:!0}:{done:!1,value:t[n++]}}))},N.empty=function(){return new N((function(){return{done:!0}}))},N.fromSequence=function(t){var e=0,n=t.length;return new N((function(){return e>=n?{done:!0}:{done:!1,value:t[e++]}}))},N.is=function(t){return t instanceof N||\"object\"==typeof t&&null!==t&&\"function\"==typeof t.next};var O=N,j={};j.ARRAY_BUFFER_SUPPORT=\"undefined\"!=typeof ArrayBuffer,j.SYMBOL_SUPPORT=\"undefined\"!=typeof Symbol;var C=O,M=j,z=M.ARRAY_BUFFER_SUPPORT,W=M.SYMBOL_SUPPORT;var P=function(t){var e=function(t){return\"string\"==typeof t||Array.isArray(t)||z&&ArrayBuffer.isView(t)?C.fromSequence(t):\"object\"!=typeof t||null===t?null:W&&\"function\"==typeof t[Symbol.iterator]?t[Symbol.iterator]():\"function\"==typeof t.next?t:null}(t);if(!e)throw new Error(\"obliterator: target is not iterable nor a valid iterator.\");return e},R=P,K=function(t,e){for(var n,r=arguments.length>1?e:1/0,i=r!==1/0?new Array(r):[],o=0,a=R(t);;){if(o===r)return i;if((n=a.next()).done)return o!==e&&(i.length=o),i;i[o++]=n.value}},T=function(t){function n(e){var n;return(n=t.call(this)||this).name=\"GraphError\",n.message=e,n}return e(n,t),n}(a(Error)),B=function(t){function n(e){var r;return(r=t.call(this,e)||this).name=\"InvalidArgumentsGraphError\",\"function\"==typeof Error.captureStackTrace&&Error.captureStackTrace(c(r),n.prototype.constructor),r}return e(n,t),n}(T),F=function(t){function n(e){var r;return(r=t.call(this,e)||this).name=\"NotFoundGraphError\",\"function\"==typeof Error.captureStackTrace&&Error.captureStackTrace(c(r),n.prototype.constructor),r}return e(n,t),n}(T),I=function(t){function n(e){var r;return(r=t.call(this,e)||this).name=\"UsageGraphError\",\"function\"==typeof Error.captureStackTrace&&Error.captureStackTrace(c(r),n.prototype.constructor),r}return e(n,t),n}(T);function Y(t,e){this.key=t,this.attributes=e,this.clear()}function q(t,e){this.key=t,this.attributes=e,this.clear()}function J(t,e){this.key=t,this.attributes=e,this.clear()}function V(t,e,n,r,i){this.key=e,this.attributes=i,this.undirected=t,this.source=n,this.target=r}Y.prototype.clear=function(){this.inDegree=0,this.outDegree=0,this.undirectedDegree=0,this.undirectedLoops=0,this.directedLoops=0,this.in={},this.out={},this.undirected={}},q.prototype.clear=function(){this.inDegree=0,this.outDegree=0,this.directedLoops=0,this.in={},this.out={}},J.prototype.clear=function(){this.undirectedDegree=0,this.undirectedLoops=0,this.undirected={}},V.prototype.attach=function(){var t=\"out\",e=\"in\";this.undirected&&(t=e=\"undirected\");var n=this.source.key,r=this.target.key;this.source[t][r]=this,this.undirected&&n===r||(this.target[e][n]=this)},V.prototype.attachMulti=function(){var t=\"out\",e=\"in\",n=this.source.key,r=this.target.key;this.undirected&&(t=e=\"undirected\");var i=this.source[t],o=i[r];if(void 0===o)return i[r]=this,void(this.undirected&&n===r||(this.target[e][n]=this));o.previous=this,this.next=o,i[r]=this,this.target[e][n]=this},V.prototype.detach=function(){var t=this.source.key,e=this.target.key,n=\"out\",r=\"in\";this.undirected&&(n=r=\"undirected\"),delete this.source[n][e],delete this.target[r][t]},V.prototype.detachMulti=function(){var t=this.source.key,e=this.target.key,n=\"out\",r=\"in\";this.undirected&&(n=r=\"undirected\"),void 0===this.previous?void 0===this.next?(delete this.source[n][e],delete this.target[r][t]):(this.next.previous=void 0,this.source[n][e]=this.next,this.target[r][t]=this.next):(this.previous.next=this.next,void 0!==this.next&&(this.next.previous=this.previous))};function H(t,e,n,r,i,o,a){var c,u,d,s;if(r=\"\"+r,0===n){if(!(c=t._nodes.get(r)))throw new F(\"Graph.\".concat(e,': could not find the \"').concat(r,'\" node in the graph.'));d=i,s=o}else if(3===n){if(i=\"\"+i,!(u=t._edges.get(i)))throw new F(\"Graph.\".concat(e,': could not find the \"').concat(i,'\" edge in the graph.'));var h=u.source.key,p=u.target.key;if(r===h)c=u.target;else{if(r!==p)throw new F(\"Graph.\".concat(e,': the \"').concat(r,'\" node is not attached to the \"').concat(i,'\" edge (').concat(h,\", \").concat(p,\").\"));c=u.source}d=o,s=a}else{if(!(u=t._edges.get(r)))throw new F(\"Graph.\".concat(e,': could not find the \"').concat(r,'\" edge in the graph.'));c=1===n?u.source:u.target,d=i,s=o}return[c,d,s]}var Q=[{name:function(t){return\"get\".concat(t,\"Attribute\")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=H(this,e,n,t,r,i),a=o[0],c=o[1];return a.attributes[c]}}},{name:function(t){return\"get\".concat(t,\"Attributes\")},attacher:function(t,e,n){t.prototype[e]=function(t,r){return H(this,e,n,t,r)[0].attributes}}},{name:function(t){return\"has\".concat(t,\"Attribute\")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=H(this,e,n,t,r,i),a=o[0],c=o[1];return a.attributes.hasOwnProperty(c)}}},{name:function(t){return\"set\".concat(t,\"Attribute\")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i,o){var a=H(this,e,n,t,r,i,o),c=a[0],u=a[1],d=a[2];return c.attributes[u]=d,this.emit(\"nodeAttributesUpdated\",{key:c.key,type:\"set\",attributes:c.attributes,name:u}),this}}},{name:function(t){return\"update\".concat(t,\"Attribute\")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i,o){var a=H(this,e,n,t,r,i,o),c=a[0],u=a[1],d=a[2];if(\"function\"!=typeof d)throw new B(\"Graph.\".concat(e,\": updater should be a function.\"));var s=c.attributes,h=d(s[u]);return s[u]=h,this.emit(\"nodeAttributesUpdated\",{key:c.key,type:\"set\",attributes:c.attributes,name:u}),this}}},{name:function(t){return\"remove\".concat(t,\"Attribute\")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=H(this,e,n,t,r,i),a=o[0],c=o[1];return delete a.attributes[c],this.emit(\"nodeAttributesUpdated\",{key:a.key,type:\"remove\",attributes:a.attributes,name:c}),this}}},{name:function(t){return\"replace\".concat(t,\"Attributes\")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=H(this,e,n,t,r,i),a=o[0],c=o[1];if(!s(c))throw new B(\"Graph.\".concat(e,\": provided attributes are not a plain object.\"));return a.attributes=c,this.emit(\"nodeAttributesUpdated\",{key:a.key,type:\"replace\",attributes:a.attributes}),this}}},{name:function(t){return\"merge\".concat(t,\"Attributes\")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=H(this,e,n,t,r,i),a=o[0],c=o[1];if(!s(c))throw new B(\"Graph.\".concat(e,\": provided attributes are not a plain object.\"));return u(a.attributes,c),this.emit(\"nodeAttributesUpdated\",{key:a.key,type:\"merge\",attributes:a.attributes,data:c}),this}}},{name:function(t){return\"update\".concat(t,\"Attributes\")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=H(this,e,n,t,r,i),a=o[0],c=o[1];if(\"function\"!=typeof c)throw new B(\"Graph.\".concat(e,\": provided updater is not a function.\"));return a.attributes=c(a.attributes),this.emit(\"nodeAttributesUpdated\",{key:a.key,type:\"update\",attributes:a.attributes}),this}}}];var X=[{name:function(t){return\"get\".concat(t,\"Attribute\")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if(\"mixed\"!==this.type&&\"mixed\"!==n&&n!==this.type)throw new I(\"Graph.\".concat(e,\": cannot find this type of edges in your \").concat(this.type,\" graph.\"));if(arguments.length>2){if(this.multi)throw new I(\"Graph.\".concat(e,\": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.\"));var o=\"\"+t,a=\"\"+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new F(\"Graph.\".concat(e,': could not find an edge for the given path (\"').concat(o,'\" - \"').concat(a,'\").'))}else{if(\"mixed\"!==n)throw new I(\"Graph.\".concat(e,\": calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.\"));if(t=\"\"+t,!(i=this._edges.get(t)))throw new F(\"Graph.\".concat(e,': could not find the \"').concat(t,'\" edge in the graph.'))}return i.attributes[r]}}},{name:function(t){return\"get\".concat(t,\"Attributes\")},attacher:function(t,e,n){t.prototype[e]=function(t){var r;if(\"mixed\"!==this.type&&\"mixed\"!==n&&n!==this.type)throw new I(\"Graph.\".concat(e,\": cannot find this type of edges in your \").concat(this.type,\" graph.\"));if(arguments.length>1){if(this.multi)throw new I(\"Graph.\".concat(e,\": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.\"));var i=\"\"+t,o=\"\"+arguments[1];if(!(r=d(this,i,o,n)))throw new F(\"Graph.\".concat(e,': could not find an edge for the given path (\"').concat(i,'\" - \"').concat(o,'\").'))}else{if(\"mixed\"!==n)throw new I(\"Graph.\".concat(e,\": calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.\"));if(t=\"\"+t,!(r=this._edges.get(t)))throw new F(\"Graph.\".concat(e,': could not find the \"').concat(t,'\" edge in the graph.'))}return r.attributes}}},{name:function(t){return\"has\".concat(t,\"Attribute\")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if(\"mixed\"!==this.type&&\"mixed\"!==n&&n!==this.type)throw new I(\"Graph.\".concat(e,\": cannot find this type of edges in your \").concat(this.type,\" graph.\"));if(arguments.length>2){if(this.multi)throw new I(\"Graph.\".concat(e,\": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.\"));var o=\"\"+t,a=\"\"+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new F(\"Graph.\".concat(e,': could not find an edge for the given path (\"').concat(o,'\" - \"').concat(a,'\").'))}else{if(\"mixed\"!==n)throw new I(\"Graph.\".concat(e,\": calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.\"));if(t=\"\"+t,!(i=this._edges.get(t)))throw new F(\"Graph.\".concat(e,': could not find the \"').concat(t,'\" edge in the graph.'))}return i.attributes.hasOwnProperty(r)}}},{name:function(t){return\"set\".concat(t,\"Attribute\")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o;if(\"mixed\"!==this.type&&\"mixed\"!==n&&n!==this.type)throw new I(\"Graph.\".concat(e,\": cannot find this type of edges in your \").concat(this.type,\" graph.\"));if(arguments.length>3){if(this.multi)throw new I(\"Graph.\".concat(e,\": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.\"));var a=\"\"+t,c=\"\"+r;if(r=arguments[2],i=arguments[3],!(o=d(this,a,c,n)))throw new F(\"Graph.\".concat(e,': could not find an edge for the given path (\"').concat(a,'\" - \"').concat(c,'\").'))}else{if(\"mixed\"!==n)throw new I(\"Graph.\".concat(e,\": calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.\"));if(t=\"\"+t,!(o=this._edges.get(t)))throw new F(\"Graph.\".concat(e,': could not find the \"').concat(t,'\" edge in the graph.'))}return o.attributes[r]=i,this.emit(\"edgeAttributesUpdated\",{key:o.key,type:\"set\",attributes:o.attributes,name:r}),this}}},{name:function(t){return\"update\".concat(t,\"Attribute\")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o;if(\"mixed\"!==this.type&&\"mixed\"!==n&&n!==this.type)throw new I(\"Graph.\".concat(e,\": cannot find this type of edges in your \").concat(this.type,\" graph.\"));if(arguments.length>3){if(this.multi)throw new I(\"Graph.\".concat(e,\": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.\"));var a=\"\"+t,c=\"\"+r;if(r=arguments[2],i=arguments[3],!(o=d(this,a,c,n)))throw new F(\"Graph.\".concat(e,': could not find an edge for the given path (\"').concat(a,'\" - \"').concat(c,'\").'))}else{if(\"mixed\"!==n)throw new I(\"Graph.\".concat(e,\": calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.\"));if(t=\"\"+t,!(o=this._edges.get(t)))throw new F(\"Graph.\".concat(e,': could not find the \"').concat(t,'\" edge in the graph.'))}if(\"function\"!=typeof i)throw new B(\"Graph.\".concat(e,\": updater should be a function.\"));return o.attributes[r]=i(o.attributes[r]),this.emit(\"edgeAttributesUpdated\",{key:o.key,type:\"set\",attributes:o.attributes,name:r}),this}}},{name:function(t){return\"remove\".concat(t,\"Attribute\")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if(\"mixed\"!==this.type&&\"mixed\"!==n&&n!==this.type)throw new I(\"Graph.\".concat(e,\": cannot find this type of edges in your \").concat(this.type,\" graph.\"));if(arguments.length>2){if(this.multi)throw new I(\"Graph.\".concat(e,\": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.\"));var o=\"\"+t,a=\"\"+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new F(\"Graph.\".concat(e,': could not find an edge for the given path (\"').concat(o,'\" - \"').concat(a,'\").'))}else{if(\"mixed\"!==n)throw new I(\"Graph.\".concat(e,\": calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.\"));if(t=\"\"+t,!(i=this._edges.get(t)))throw new F(\"Graph.\".concat(e,': could not find the \"').concat(t,'\" edge in the graph.'))}return delete i.attributes[r],this.emit(\"edgeAttributesUpdated\",{key:i.key,type:\"remove\",attributes:i.attributes,name:r}),this}}},{name:function(t){return\"replace\".concat(t,\"Attributes\")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if(\"mixed\"!==this.type&&\"mixed\"!==n&&n!==this.type)throw new I(\"Graph.\".concat(e,\": cannot find this type of edges in your \").concat(this.type,\" graph.\"));if(arguments.length>2){if(this.multi)throw new I(\"Graph.\".concat(e,\": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.\"));var o=\"\"+t,a=\"\"+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new F(\"Graph.\".concat(e,': could not find an edge for the given path (\"').concat(o,'\" - \"').concat(a,'\").'))}else{if(\"mixed\"!==n)throw new I(\"Graph.\".concat(e,\": calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.\"));if(t=\"\"+t,!(i=this._edges.get(t)))throw new F(\"Graph.\".concat(e,': could not find the \"').concat(t,'\" edge in the graph.'))}if(!s(r))throw new B(\"Graph.\".concat(e,\": provided attributes are not a plain object.\"));return i.attributes=r,this.emit(\"edgeAttributesUpdated\",{key:i.key,type:\"replace\",attributes:i.attributes}),this}}},{name:function(t){return\"merge\".concat(t,\"Attributes\")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if(\"mixed\"!==this.type&&\"mixed\"!==n&&n!==this.type)throw new I(\"Graph.\".concat(e,\": cannot find this type of edges in your \").concat(this.type,\" graph.\"));if(arguments.length>2){if(this.multi)throw new I(\"Graph.\".concat(e,\": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.\"));var o=\"\"+t,a=\"\"+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new F(\"Graph.\".concat(e,': could not find an edge for the given path (\"').concat(o,'\" - \"').concat(a,'\").'))}else{if(\"mixed\"!==n)throw new I(\"Graph.\".concat(e,\": calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.\"));if(t=\"\"+t,!(i=this._edges.get(t)))throw new F(\"Graph.\".concat(e,': could not find the \"').concat(t,'\" edge in the graph.'))}if(!s(r))throw new B(\"Graph.\".concat(e,\": provided attributes are not a plain object.\"));return u(i.attributes,r),this.emit(\"edgeAttributesUpdated\",{key:i.key,type:\"merge\",attributes:i.attributes,data:r}),this}}},{name:function(t){return\"update\".concat(t,\"Attributes\")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if(\"mixed\"!==this.type&&\"mixed\"!==n&&n!==this.type)throw new I(\"Graph.\".concat(e,\": cannot find this type of edges in your \").concat(this.type,\" graph.\"));if(arguments.length>2){if(this.multi)throw new I(\"Graph.\".concat(e,\": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.\"));var o=\"\"+t,a=\"\"+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new F(\"Graph.\".concat(e,': could not find an edge for the given path (\"').concat(o,'\" - \"').concat(a,'\").'))}else{if(\"mixed\"!==n)throw new I(\"Graph.\".concat(e,\": calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.\"));if(t=\"\"+t,!(i=this._edges.get(t)))throw new F(\"Graph.\".concat(e,': could not find the \"').concat(t,'\" edge in the graph.'))}if(\"function\"!=typeof r)throw new B(\"Graph.\".concat(e,\": provided updater is not a function.\"));return i.attributes=r(i.attributes),this.emit(\"edgeAttributesUpdated\",{key:i.key,type:\"update\",attributes:i.attributes}),this}}}];var Z=O,$=P,tt=function(){var t=arguments,e=null,n=-1;return new Z((function(){for(var r=null;;){if(null===e){if(++n>=t.length)return{done:!0};e=$(t[n])}if(!0!==(r=e.next()).done)break;e=null}return r}))},et=[{name:\"edges\",type:\"mixed\"},{name:\"inEdges\",type:\"directed\",direction:\"in\"},{name:\"outEdges\",type:\"directed\",direction:\"out\"},{name:\"inboundEdges\",type:\"mixed\",direction:\"in\"},{name:\"outboundEdges\",type:\"mixed\",direction:\"out\"},{name:\"directedEdges\",type:\"directed\"},{name:\"undirectedEdges\",type:\"undirected\"}];function nt(t,e,n,r){var i=!1;for(var o in e)if(o!==r){var a=e[o];if(i=n(a.key,a.attributes,a.source.key,a.target.key,a.source.attributes,a.target.attributes,a.undirected),t&&i)return a.key}}function rt(t,e,n,r){var i,o,a,c=!1;for(var u in e)if(u!==r){i=e[u];do{if(o=i.source,a=i.target,c=n(i.key,i.attributes,o.key,a.key,o.attributes,a.attributes,i.undirected),t&&c)return i.key;i=i.next}while(void 0!==i)}}function it(t,e){var n,r=Object.keys(t),i=r.length,o=0;return new O((function(){do{if(n)n=n.next;else{if(o>=i)return{done:!0};var a=r[o++];if(a===e){n=void 0;continue}n=t[a]}}while(!n);return{done:!1,value:{edge:n.key,attributes:n.attributes,source:n.source.key,target:n.target.key,sourceAttributes:n.source.attributes,targetAttributes:n.target.attributes,undirected:n.undirected}}}))}function ot(t,e,n,r){var i=e[n];if(i){var o=i.source,a=i.target;return r(i.key,i.attributes,o.key,a.key,o.attributes,a.attributes,i.undirected)&&t?i.key:void 0}}function at(t,e,n,r){var i=e[n];if(i){var o=!1;do{if(o=r(i.key,i.attributes,i.source.key,i.target.key,i.source.attributes,i.target.attributes,i.undirected),t&&o)return i.key;i=i.next}while(void 0!==i)}}function ct(t,e){var n=t[e];return void 0!==n.next?new O((function(){if(!n)return{done:!0};var t={edge:n.key,attributes:n.attributes,source:n.source.key,target:n.target.key,sourceAttributes:n.source.attributes,targetAttributes:n.target.attributes,undirected:n.undirected};return n=n.next,{done:!1,value:t}})):O.of({edge:n.key,attributes:n.attributes,source:n.source.key,target:n.target.key,sourceAttributes:n.source.attributes,targetAttributes:n.target.attributes,undirected:n.undirected})}function ut(t,e){if(0===t.size)return[];if(\"mixed\"===e||e===t.type)return\"function\"==typeof Array.from?Array.from(t._edges.keys()):K(t._edges.keys(),t._edges.size);for(var n,r,i=\"undirected\"===e?t.undirectedSize:t.directedSize,o=new Array(i),a=\"undirected\"===e,c=t._edges.values(),u=0;!0!==(n=c.next()).done;)(r=n.value).undirected===a&&(o[u++]=r.key);return o}function dt(t,e,n,r){if(0!==e.size)for(var i,o,a=\"mixed\"!==n&&n!==e.type,c=\"undirected\"===n,u=!1,d=e._edges.values();!0!==(i=d.next()).done;)if(o=i.value,!a||o.undirected===c){var s=o,h=s.key,p=s.attributes,f=s.source,l=s.target;if(u=r(h,p,f.key,l.key,f.attributes,l.attributes,o.undirected),t&&u)return h}}function st(t,e){if(0===t.size)return O.empty();var n=\"mixed\"!==e&&e!==t.type,r=\"undirected\"===e,i=t._edges.values();return new O((function(){for(var t,e;;){if((t=i.next()).done)return t;if(e=t.value,!n||e.undirected===r)break}return{value:{edge:e.key,attributes:e.attributes,source:e.source.key,target:e.target.key,sourceAttributes:e.source.attributes,targetAttributes:e.target.attributes,undirected:e.undirected},done:!1}}))}function ht(t,e,n,r,i,o){var a,c=e?rt:nt;if(\"undirected\"!==n){if(\"out\"!==r&&(a=c(t,i.in,o),t&&a))return a;if(\"in\"!==r&&(a=c(t,i.out,o,r?void 0:i.key),t&&a))return a}if(\"directed\"!==n&&(a=c(t,i.undirected,o),t&&a))return a}function pt(t,e,n,r){var i=[];return ht(!1,t,e,n,r,(function(t){i.push(t)})),i}function ft(t,e,n){var r=O.empty();return\"undirected\"!==t&&(\"out\"!==e&&void 0!==n.in&&(r=tt(r,it(n.in))),\"in\"!==e&&void 0!==n.out&&(r=tt(r,it(n.out,e?void 0:n.key)))),\"directed\"!==t&&void 0!==n.undirected&&(r=tt(r,it(n.undirected))),r}function lt(t,e,n,r,i,o,a){var c,u=n?at:ot;if(\"undirected\"!==e){if(void 0!==i.in&&\"out\"!==r&&(c=u(t,i.in,o,a),t&&c))return c;if(void 0!==i.out&&\"in\"!==r&&(r||i.key!==o)&&(c=u(t,i.out,o,a),t&&c))return c}if(\"directed\"!==e&&void 0!==i.undirected&&(c=u(t,i.undirected,o,a),t&&c))return c}function gt(t,e,n,r,i){var o=[];return lt(!1,t,e,n,r,i,(function(t){o.push(t)})),o}function yt(t,e,n,r){var i=O.empty();return\"undirected\"!==t&&(void 0!==n.in&&\"out\"!==e&&r in n.in&&(i=tt(i,ct(n.in,r))),void 0!==n.out&&\"in\"!==e&&r in n.out&&(e||n.key!==r)&&(i=tt(i,ct(n.out,r)))),\"directed\"!==t&&void 0!==n.undirected&&r in n.undirected&&(i=tt(i,ct(n.undirected,r))),i}var wt=[{name:\"neighbors\",type:\"mixed\"},{name:\"inNeighbors\",type:\"directed\",direction:\"in\"},{name:\"outNeighbors\",type:\"directed\",direction:\"out\"},{name:\"inboundNeighbors\",type:\"mixed\",direction:\"in\"},{name:\"outboundNeighbors\",type:\"mixed\",direction:\"out\"},{name:\"directedNeighbors\",type:\"directed\"},{name:\"undirectedNeighbors\",type:\"undirected\"}];function vt(){this.A=null,this.B=null}function bt(t,e,n,r,i){for(var o in r){var a=r[o],c=a.source,u=a.target,d=c===n?u:c;if(!e||!e.has(d.key)){var s=i(d.key,d.attributes);if(t&&s)return d.key}}}function mt(t,e,n,r,i){if(\"mixed\"!==e){if(\"undirected\"===e)return bt(t,null,r,r.undirected,i);if(\"string\"==typeof n)return bt(t,null,r,r[n],i)}var o,a=new vt;if(\"undirected\"!==e){if(\"out\"!==n){if(o=bt(t,null,r,r.in,i),t&&o)return o;a.wrap(r.in)}if(\"in\"!==n){if(o=bt(t,a,r,r.out,i),t&&o)return o;a.wrap(r.out)}}if(\"directed\"!==e&&(o=bt(t,a,r,r.undirected,i),t&&o))return o}function kt(t,e,n){var r=Object.keys(n),i=r.length,o=0;return new O((function(){var a=null;do{if(o>=i)return t&&t.wrap(n),{done:!0};var c=n[r[o++]],u=c.source,d=c.target;a=u===e?d:u,t&&t.has(a.key)&&(a=null)}while(null===a);return{done:!1,value:{neighbor:a.key,attributes:a.attributes}}}))}function _t(t,e){var n=e.name,r=e.type,i=e.direction;t.prototype[n]=function(t){if(\"mixed\"!==r&&\"mixed\"!==this.type&&r!==this.type)return[];t=\"\"+t;var e=this._nodes.get(t);if(void 0===e)throw new F(\"Graph.\".concat(n,': could not find the \"').concat(t,'\" node in the graph.'));return function(t,e,n){if(\"mixed\"!==t){if(\"undirected\"===t)return Object.keys(n.undirected);if(\"string\"==typeof e)return Object.keys(n[e])}var r=[];return mt(!1,t,e,n,(function(t){r.push(t)})),r}(\"mixed\"===r?this.type:r,i,e)}}function Gt(t,e){var n=e.name,r=e.type,i=e.direction,o=n.slice(0,-1)+\"Entries\";t.prototype[o]=function(t){if(\"mixed\"!==r&&\"mixed\"!==this.type&&r!==this.type)return O.empty();t=\"\"+t;var e=this._nodes.get(t);if(void 0===e)throw new F(\"Graph.\".concat(o,': could not find the \"').concat(t,'\" node in the graph.'));return function(t,e,n){if(\"mixed\"!==t){if(\"undirected\"===t)return kt(null,n,n.undirected);if(\"string\"==typeof e)return kt(null,n,n[e])}var r=O.empty(),i=new vt;return\"undirected\"!==t&&(\"out\"!==e&&(r=tt(r,kt(i,n,n.in))),\"in\"!==e&&(r=tt(r,kt(i,n,n.out)))),\"directed\"!==t&&(r=tt(r,kt(i,n,n.undirected))),r}(\"mixed\"===r?this.type:r,i,e)}}function xt(t,e,n,r,i){for(var o,a,c,u,d,s,h,p=r._nodes.values(),f=r.type;!0!==(o=p.next()).done;){var l=!1;if(a=o.value,\"undirected\"!==f)for(c in u=a.out){d=u[c];do{if(s=d.target,l=!0,h=i(a.key,s.key,a.attributes,s.attributes,d.key,d.attributes,d.undirected),t&&h)return d;d=d.next}while(d)}if(\"directed\"!==f)for(c in u=a.undirected)if(!(e&&a.key>c)){d=u[c];do{if((s=d.target).key!==c&&(s=d.source),l=!0,h=i(a.key,s.key,a.attributes,s.attributes,d.key,d.attributes,d.undirected),t&&h)return d;d=d.next}while(d)}if(n&&!l&&(h=i(a.key,null,a.attributes,null,null,null,null),t&&h))return null}}function Et(t){if(!s(t))throw new B('Graph.import: invalid serialized node. A serialized node should be a plain object with at least a \"key\" property.');if(!(\"key\"in t))throw new B(\"Graph.import: serialized node is missing its key.\");if(\"attributes\"in t&&(!s(t.attributes)||null===t.attributes))throw new B(\"Graph.import: invalid attributes. Attributes should be a plain object, null or omitted.\")}function At(t){if(!s(t))throw new B('Graph.import: invalid serialized edge. A serialized edge should be a plain object with at least a \"source\" & \"target\" property.');if(!(\"source\"in t))throw new B(\"Graph.import: serialized edge is missing its source.\");if(!(\"target\"in t))throw new B(\"Graph.import: serialized edge is missing its target.\");if(\"attributes\"in t&&(!s(t.attributes)||null===t.attributes))throw new B(\"Graph.import: invalid attributes. Attributes should be a plain object, null or omitted.\");if(\"undirected\"in t&&\"boolean\"!=typeof t.undirected)throw new B(\"Graph.import: invalid undirectedness information. Undirected should be boolean or omitted.\")}vt.prototype.wrap=function(t){null===this.A?this.A=t:null===this.B&&(this.B=t)},vt.prototype.has=function(t){return null!==this.A&&t in this.A||null!==this.B&&t in this.B};var Lt,St=(Lt=255&Math.floor(256*Math.random()),function(){return Lt++}),Dt=new Set([\"directed\",\"undirected\",\"mixed\"]),Ut=new Set([\"domain\",\"_events\",\"_eventsCount\",\"_maxListeners\"]),Nt={allowSelfLoops:!0,multi:!1,type:\"mixed\"};function Ot(t,e,n){var r=new t.NodeDataClass(e,n);return t._nodes.set(e,r),t.emit(\"nodeAdded\",{key:e,attributes:n}),r}function jt(t,e,n,r,i,o,a,c){if(!r&&\"undirected\"===t.type)throw new I(\"Graph.\".concat(e,\": you cannot add a directed edge to an undirected graph. Use the #.addEdge or #.addUndirectedEdge instead.\"));if(r&&\"directed\"===t.type)throw new I(\"Graph.\".concat(e,\": you cannot add an undirected edge to a directed graph. Use the #.addEdge or #.addDirectedEdge instead.\"));if(c&&!s(c))throw new B(\"Graph.\".concat(e,': invalid attributes. Expecting an object but got \"').concat(c,'\"'));if(o=\"\"+o,a=\"\"+a,c=c||{},!t.allowSelfLoops&&o===a)throw new I(\"Graph.\".concat(e,': source & target are the same (\"').concat(o,\"\\\"), thus creating a loop explicitly forbidden by this graph 'allowSelfLoops' option set to false.\"));var u=t._nodes.get(o),d=t._nodes.get(a);if(!u)throw new F(\"Graph.\".concat(e,': source node \"').concat(o,'\" not found.'));if(!d)throw new F(\"Graph.\".concat(e,': target node \"').concat(a,'\" not found.'));var h={key:null,undirected:r,source:o,target:a,attributes:c};if(n)i=t._edgeKeyGenerator();else if(i=\"\"+i,t._edges.has(i))throw new I(\"Graph.\".concat(e,': the \"').concat(i,'\" edge already exists in the graph.'));if(!t.multi&&(r?void 0!==u.undirected[a]:void 0!==u.out[a]))throw new I(\"Graph.\".concat(e,': an edge linking \"').concat(o,'\" to \"').concat(a,\"\\\" already exists. If you really want to add multiple edges linking those nodes, you should create a multi graph by using the 'multi' option.\"));var p=new V(r,i,u,d,c);t._edges.set(i,p);var f=o===a;return r?(u.undirectedDegree++,d.undirectedDegree++,f&&(u.undirectedLoops++,t._undirectedSelfLoopCount++)):(u.outDegree++,d.inDegree++,f&&(u.directedLoops++,t._directedSelfLoopCount++)),t.multi?p.attachMulti():p.attach(),r?t._undirectedSize++:t._directedSize++,h.key=i,t.emit(\"edgeAdded\",h),i}function Ct(t,e,n,r,i,o,a,c,d){if(!r&&\"undirected\"===t.type)throw new I(\"Graph.\".concat(e,\": you cannot merge/update a directed edge to an undirected graph. Use the #.mergeEdge/#.updateEdge or #.addUndirectedEdge instead.\"));if(r&&\"directed\"===t.type)throw new I(\"Graph.\".concat(e,\": you cannot merge/update an undirected edge to a directed graph. Use the #.mergeEdge/#.updateEdge or #.addDirectedEdge instead.\"));if(c)if(d){if(\"function\"!=typeof c)throw new B(\"Graph.\".concat(e,': invalid updater function. Expecting a function but got \"').concat(c,'\"'))}else if(!s(c))throw new B(\"Graph.\".concat(e,': invalid attributes. Expecting an object but got \"').concat(c,'\"'));var h;if(o=\"\"+o,a=\"\"+a,d&&(h=c,c=void 0),!t.allowSelfLoops&&o===a)throw new I(\"Graph.\".concat(e,': source & target are the same (\"').concat(o,\"\\\"), thus creating a loop explicitly forbidden by this graph 'allowSelfLoops' option set to false.\"));var p,f,l=t._nodes.get(o),g=t._nodes.get(a);if(!n&&(p=t._edges.get(i))){if(!(p.source.key===o&&p.target.key===a||r&&p.source.key===a&&p.target.key===o))throw new I(\"Graph.\".concat(e,': inconsistency detected when attempting to merge the \"').concat(i,'\" edge with \"').concat(o,'\" source & \"').concat(a,'\" target vs. (\"').concat(p.source.key,'\", \"').concat(p.target.key,'\").'));f=p}if(f||t.multi||!l||(f=r?l.undirected[a]:l.out[a]),f){var y=[f.key,!1,!1,!1];if(d?!h:!c)return y;if(d){var w=f.attributes;f.attributes=h(w),t.emit(\"edgeAttributesUpdated\",{type:\"replace\",key:f.key,attributes:f.attributes})}else u(f.attributes,c),t.emit(\"edgeAttributesUpdated\",{type:\"merge\",key:f.key,attributes:f.attributes,data:c});return y}c=c||{},d&&h&&(c=h(c));var v={key:null,undirected:r,source:o,target:a,attributes:c};if(n)i=t._edgeKeyGenerator();else if(i=\"\"+i,t._edges.has(i))throw new I(\"Graph.\".concat(e,': the \"').concat(i,'\" edge already exists in the graph.'));var b=!1,m=!1;l||(l=Ot(t,o,{}),b=!0,o===a&&(g=l,m=!0)),g||(g=Ot(t,a,{}),m=!0),p=new V(r,i,l,g,c),t._edges.set(i,p);var k=o===a;return r?(l.undirectedDegree++,g.undirectedDegree++,k&&(l.undirectedLoops++,t._undirectedSelfLoopCount++)):(l.outDegree++,g.inDegree++,k&&(l.directedLoops++,t._directedSelfLoopCount++)),t.multi?p.attachMulti():p.attach(),r?t._undirectedSize++:t._directedSize++,v.key=i,t.emit(\"edgeAdded\",v),[i,!0,b,m]}function Mt(t,e){t._edges.delete(e.key);var n=e.source,r=e.target,i=e.attributes,o=e.undirected,a=n===r;o?(n.undirectedDegree--,r.undirectedDegree--,a&&(n.undirectedLoops--,t._undirectedSelfLoopCount--)):(n.outDegree--,r.inDegree--,a&&(n.directedLoops--,t._directedSelfLoopCount--)),t.multi?e.detachMulti():e.detach(),o?t._undirectedSize--:t._directedSize--,t.emit(\"edgeDropped\",{key:e.key,attributes:i,source:n.key,target:r.key,undirected:o})}var zt=function(n){function r(t){var e;if(e=n.call(this)||this,\"boolean\"!=typeof(t=u({},Nt,t)).multi)throw new B(\"Graph.constructor: invalid 'multi' option. Expecting a boolean but got \\\"\".concat(t.multi,'\".'));if(!Dt.has(t.type))throw new B('Graph.constructor: invalid \\'type\\' option. Should be one of \"mixed\", \"directed\" or \"undirected\" but got \"'.concat(t.type,'\".'));if(\"boolean\"!=typeof t.allowSelfLoops)throw new B(\"Graph.constructor: invalid 'allowSelfLoops' option. Expecting a boolean but got \\\"\".concat(t.allowSelfLoops,'\".'));var r=\"mixed\"===t.type?Y:\"directed\"===t.type?q:J;p(c(e),\"NodeDataClass\",r);var i=\"geid_\"+St()+\"_\",o=0;return p(c(e),\"_attributes\",{}),p(c(e),\"_nodes\",new Map),p(c(e),\"_edges\",new Map),p(c(e),\"_directedSize\",0),p(c(e),\"_undirectedSize\",0),p(c(e),\"_directedSelfLoopCount\",0),p(c(e),\"_undirectedSelfLoopCount\",0),p(c(e),\"_edgeKeyGenerator\",(function(){var t;do{t=i+o++}while(e._edges.has(t));return t})),p(c(e),\"_options\",t),Ut.forEach((function(t){return p(c(e),t,e[t])})),f(c(e),\"order\",(function(){return e._nodes.size})),f(c(e),\"size\",(function(){return e._edges.size})),f(c(e),\"directedSize\",(function(){return e._directedSize})),f(c(e),\"undirectedSize\",(function(){return e._undirectedSize})),f(c(e),\"selfLoopCount\",(function(){return e._directedSelfLoopCount+e._undirectedSelfLoopCount})),f(c(e),\"directedSelfLoopCount\",(function(){return e._directedSelfLoopCount})),f(c(e),\"undirectedSelfLoopCount\",(function(){return e._undirectedSelfLoopCount})),f(c(e),\"multi\",e._options.multi),f(c(e),\"type\",e._options.type),f(c(e),\"allowSelfLoops\",e._options.allowSelfLoops),f(c(e),\"implementation\",(function(){return\"graphology\"})),e}e(r,n);var i=r.prototype;return i._resetInstanceCounters=function(){this._directedSize=0,this._undirectedSize=0,this._directedSelfLoopCount=0,this._undirectedSelfLoopCount=0},i.hasNode=function(t){return this._nodes.has(\"\"+t)},i.hasDirectedEdge=function(t,e){if(\"undirected\"===this.type)return!1;if(1===arguments.length){var n=\"\"+t,r=this._edges.get(n);return!!r&&!r.undirected}if(2===arguments.length){t=\"\"+t,e=\"\"+e;var i=this._nodes.get(t);return!!i&&i.out.hasOwnProperty(e)}throw new B(\"Graph.hasDirectedEdge: invalid arity (\".concat(arguments.length,\", instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target.\"))},i.hasUndirectedEdge=function(t,e){if(\"directed\"===this.type)return!1;if(1===arguments.length){var n=\"\"+t,r=this._edges.get(n);return!!r&&r.undirected}if(2===arguments.length){t=\"\"+t,e=\"\"+e;var i=this._nodes.get(t);return!!i&&i.undirected.hasOwnProperty(e)}throw new B(\"Graph.hasDirectedEdge: invalid arity (\".concat(arguments.length,\", instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target.\"))},i.hasEdge=function(t,e){if(1===arguments.length){var n=\"\"+t;return this._edges.has(n)}if(2===arguments.length){t=\"\"+t,e=\"\"+e;var r=this._nodes.get(t);return!!r&&(void 0!==r.out&&r.out.hasOwnProperty(e)||void 0!==r.undirected&&r.undirected.hasOwnProperty(e))}throw new B(\"Graph.hasEdge: invalid arity (\".concat(arguments.length,\", instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target.\"))},i.directedEdge=function(t,e){if(\"undirected\"!==this.type){if(t=\"\"+t,e=\"\"+e,this.multi)throw new I(\"Graph.directedEdge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.directedEdges instead.\");var n=this._nodes.get(t);if(!n)throw new F('Graph.directedEdge: could not find the \"'.concat(t,'\" source node in the graph.'));if(!this._nodes.has(e))throw new F('Graph.directedEdge: could not find the \"'.concat(e,'\" target node in the graph.'));var r=n.out&&n.out[e]||void 0;return r?r.key:void 0}},i.undirectedEdge=function(t,e){if(\"directed\"!==this.type){if(t=\"\"+t,e=\"\"+e,this.multi)throw new I(\"Graph.undirectedEdge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.undirectedEdges instead.\");var n=this._nodes.get(t);if(!n)throw new F('Graph.undirectedEdge: could not find the \"'.concat(t,'\" source node in the graph.'));if(!this._nodes.has(e))throw new F('Graph.undirectedEdge: could not find the \"'.concat(e,'\" target node in the graph.'));var r=n.undirected&&n.undirected[e]||void 0;return r?r.key:void 0}},i.edge=function(t,e){if(this.multi)throw new I(\"Graph.edge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.edges instead.\");t=\"\"+t,e=\"\"+e;var n=this._nodes.get(t);if(!n)throw new F('Graph.edge: could not find the \"'.concat(t,'\" source node in the graph.'));if(!this._nodes.has(e))throw new F('Graph.edge: could not find the \"'.concat(e,'\" target node in the graph.'));var r=n.out&&n.out[e]||n.undirected&&n.undirected[e]||void 0;if(r)return r.key},i.areDirectedNeighbors=function(t,e){t=\"\"+t,e=\"\"+e;var n=this._nodes.get(t);if(!n)throw new F('Graph.areDirectedNeighbors: could not find the \"'.concat(t,'\" node in the graph.'));return\"undirected\"!==this.type&&(e in n.in||e in n.out)},i.areOutNeighbors=function(t,e){t=\"\"+t,e=\"\"+e;var n=this._nodes.get(t);if(!n)throw new F('Graph.areOutNeighbors: could not find the \"'.concat(t,'\" node in the graph.'));return\"undirected\"!==this.type&&e in n.out},i.areInNeighbors=function(t,e){t=\"\"+t,e=\"\"+e;var n=this._nodes.get(t);if(!n)throw new F('Graph.areInNeighbors: could not find the \"'.concat(t,'\" node in the graph.'));return\"undirected\"!==this.type&&e in n.in},i.areUndirectedNeighbors=function(t,e){t=\"\"+t,e=\"\"+e;var n=this._nodes.get(t);if(!n)throw new F('Graph.areUndirectedNeighbors: could not find the \"'.concat(t,'\" node in the graph.'));return\"directed\"!==this.type&&e in n.undirected},i.areNeighbors=function(t,e){t=\"\"+t,e=\"\"+e;var n=this._nodes.get(t);if(!n)throw new F('Graph.areNeighbors: could not find the \"'.concat(t,'\" node in the graph.'));return\"undirected\"!==this.type&&(e in n.in||e in n.out)||\"directed\"!==this.type&&e in n.undirected},i.areInboundNeighbors=function(t,e){t=\"\"+t,e=\"\"+e;var n=this._nodes.get(t);if(!n)throw new F('Graph.areInboundNeighbors: could not find the \"'.concat(t,'\" node in the graph.'));return\"undirected\"!==this.type&&e in n.in||\"directed\"!==this.type&&e in n.undirected},i.areOutboundNeighbors=function(t,e){t=\"\"+t,e=\"\"+e;var n=this._nodes.get(t);if(!n)throw new F('Graph.areOutboundNeighbors: could not find the \"'.concat(t,'\" node in the graph.'));return\"undirected\"!==this.type&&e in n.out||\"directed\"!==this.type&&e in n.undirected},i.inDegree=function(t){t=\"\"+t;var e=this._nodes.get(t);if(!e)throw new F('Graph.inDegree: could not find the \"'.concat(t,'\" node in the graph.'));return\"undirected\"===this.type?0:e.inDegree},i.outDegree=function(t){t=\"\"+t;var e=this._nodes.get(t);if(!e)throw new F('Graph.outDegree: could not find the \"'.concat(t,'\" node in the graph.'));return\"undirected\"===this.type?0:e.outDegree},i.directedDegree=function(t){t=\"\"+t;var e=this._nodes.get(t);if(!e)throw new F('Graph.directedDegree: could not find the \"'.concat(t,'\" node in the graph.'));return\"undirected\"===this.type?0:e.inDegree+e.outDegree},i.undirectedDegree=function(t){t=\"\"+t;var e=this._nodes.get(t);if(!e)throw new F('Graph.undirectedDegree: could not find the \"'.concat(t,'\" node in the graph.'));return\"directed\"===this.type?0:e.undirectedDegree},i.inboundDegree=function(t){t=\"\"+t;var e=this._nodes.get(t);if(!e)throw new F('Graph.inboundDegree: could not find the \"'.concat(t,'\" node in the graph.'));var n=0;return\"directed\"!==this.type&&(n+=e.undirectedDegree),\"undirected\"!==this.type&&(n+=e.inDegree),n},i.outboundDegree=function(t){t=\"\"+t;var e=this._nodes.get(t);if(!e)throw new F('Graph.outboundDegree: could not find the \"'.concat(t,'\" node in the graph.'));var n=0;return\"directed\"!==this.type&&(n+=e.undirectedDegree),\"undirected\"!==this.type&&(n+=e.outDegree),n},i.degree=function(t){t=\"\"+t;var e=this._nodes.get(t);if(!e)throw new F('Graph.degree: could not find the \"'.concat(t,'\" node in the graph.'));var n=0;return\"directed\"!==this.type&&(n+=e.undirectedDegree),\"undirected\"!==this.type&&(n+=e.inDegree+e.outDegree),n},i.inDegreeWithoutSelfLoops=function(t){t=\"\"+t;var e=this._nodes.get(t);if(!e)throw new F('Graph.inDegreeWithoutSelfLoops: could not find the \"'.concat(t,'\" node in the graph.'));return\"undirected\"===this.type?0:e.inDegree-e.directedLoops},i.outDegreeWithoutSelfLoops=function(t){t=\"\"+t;var e=this._nodes.get(t);if(!e)throw new F('Graph.outDegreeWithoutSelfLoops: could not find the \"'.concat(t,'\" node in the graph.'));return\"undirected\"===this.type?0:e.outDegree-e.directedLoops},i.directedDegreeWithoutSelfLoops=function(t){t=\"\"+t;var e=this._nodes.get(t);if(!e)throw new F('Graph.directedDegreeWithoutSelfLoops: could not find the \"'.concat(t,'\" node in the graph.'));return\"undirected\"===this.type?0:e.inDegree+e.outDegree-2*e.directedLoops},i.undirectedDegreeWithoutSelfLoops=function(t){t=\"\"+t;var e=this._nodes.get(t);if(!e)throw new F('Graph.undirectedDegreeWithoutSelfLoops: could not find the \"'.concat(t,'\" node in the graph.'));return\"directed\"===this.type?0:e.undirectedDegree-2*e.undirectedLoops},i.inboundDegreeWithoutSelfLoops=function(t){t=\"\"+t;var e=this._nodes.get(t);if(!e)throw new F('Graph.inboundDegreeWithoutSelfLoops: could not find the \"'.concat(t,'\" node in the graph.'));var n=0,r=0;return\"directed\"!==this.type&&(n+=e.undirectedDegree,r+=2*e.undirectedLoops),\"undirected\"!==this.type&&(n+=e.inDegree,r+=e.directedLoops),n-r},i.outboundDegreeWithoutSelfLoops=function(t){t=\"\"+t;var e=this._nodes.get(t);if(!e)throw new F('Graph.outboundDegreeWithoutSelfLoops: could not find the \"'.concat(t,'\" node in the graph.'));var n=0,r=0;return\"directed\"!==this.type&&(n+=e.undirectedDegree,r+=2*e.undirectedLoops),\"undirected\"!==this.type&&(n+=e.outDegree,r+=e.directedLoops),n-r},i.degreeWithoutSelfLoops=function(t){t=\"\"+t;var e=this._nodes.get(t);if(!e)throw new F('Graph.degreeWithoutSelfLoops: could not find the \"'.concat(t,'\" node in the graph.'));var n=0,r=0;return\"directed\"!==this.type&&(n+=e.undirectedDegree,r+=2*e.undirectedLoops),\"undirected\"!==this.type&&(n+=e.inDegree+e.outDegree,r+=2*e.directedLoops),n-r},i.source=function(t){t=\"\"+t;var e=this._edges.get(t);if(!e)throw new F('Graph.source: could not find the \"'.concat(t,'\" edge in the graph.'));return e.source.key},i.target=function(t){t=\"\"+t;var e=this._edges.get(t);if(!e)throw new F('Graph.target: could not find the \"'.concat(t,'\" edge in the graph.'));return e.target.key},i.extremities=function(t){t=\"\"+t;var e=this._edges.get(t);if(!e)throw new F('Graph.extremities: could not find the \"'.concat(t,'\" edge in the graph.'));return[e.source.key,e.target.key]},i.opposite=function(t,e){t=\"\"+t,e=\"\"+e;var n=this._edges.get(e);if(!n)throw new F('Graph.opposite: could not find the \"'.concat(e,'\" edge in the graph.'));var r=n.source.key,i=n.target.key;if(t===r)return i;if(t===i)return r;throw new F('Graph.opposite: the \"'.concat(t,'\" node is not attached to the \"').concat(e,'\" edge (').concat(r,\", \").concat(i,\").\"))},i.hasExtremity=function(t,e){t=\"\"+t,e=\"\"+e;var n=this._edges.get(t);if(!n)throw new F('Graph.hasExtremity: could not find the \"'.concat(t,'\" edge in the graph.'));return n.source.key===e||n.target.key===e},i.isUndirected=function(t){t=\"\"+t;var e=this._edges.get(t);if(!e)throw new F('Graph.isUndirected: could not find the \"'.concat(t,'\" edge in the graph.'));return e.undirected},i.isDirected=function(t){t=\"\"+t;var e=this._edges.get(t);if(!e)throw new F('Graph.isDirected: could not find the \"'.concat(t,'\" edge in the graph.'));return!e.undirected},i.isSelfLoop=function(t){t=\"\"+t;var e=this._edges.get(t);if(!e)throw new F('Graph.isSelfLoop: could not find the \"'.concat(t,'\" edge in the graph.'));return e.source===e.target},i.addNode=function(t,e){var n=function(t,e,n){if(n&&!s(n))throw new B('Graph.addNode: invalid attributes. Expecting an object but got \"'.concat(n,'\"'));if(e=\"\"+e,n=n||{},t._nodes.has(e))throw new I('Graph.addNode: the \"'.concat(e,'\" node already exist in the graph.'));var r=new t.NodeDataClass(e,n);return t._nodes.set(e,r),t.emit(\"nodeAdded\",{key:e,attributes:n}),r}(this,t,e);return n.key},i.mergeNode=function(t,e){if(e&&!s(e))throw new B('Graph.mergeNode: invalid attributes. Expecting an object but got \"'.concat(e,'\"'));t=\"\"+t,e=e||{};var n=this._nodes.get(t);return n?(e&&(u(n.attributes,e),this.emit(\"nodeAttributesUpdated\",{type:\"merge\",key:t,attributes:n.attributes,data:e})),[t,!1]):(n=new this.NodeDataClass(t,e),this._nodes.set(t,n),this.emit(\"nodeAdded\",{key:t,attributes:e}),[t,!0])},i.updateNode=function(t,e){if(e&&\"function\"!=typeof e)throw new B('Graph.updateNode: invalid updater function. Expecting a function but got \"'.concat(e,'\"'));t=\"\"+t;var n=this._nodes.get(t);if(n){if(e){var r=n.attributes;n.attributes=e(r),this.emit(\"nodeAttributesUpdated\",{type:\"replace\",key:t,attributes:n.attributes})}return[t,!1]}var i=e?e({}):{};return n=new this.NodeDataClass(t,i),this._nodes.set(t,n),this.emit(\"nodeAdded\",{key:t,attributes:i}),[t,!0]},i.dropNode=function(t){t=\"\"+t;var e,n=this._nodes.get(t);if(!n)throw new F('Graph.dropNode: could not find the \"'.concat(t,'\" node in the graph.'));if(\"undirected\"!==this.type){for(var r in n.out){e=n.out[r];do{Mt(this,e),e=e.next}while(e)}for(var i in n.in){e=n.in[i];do{Mt(this,e),e=e.next}while(e)}}if(\"directed\"!==this.type)for(var o in n.undirected){e=n.undirected[o];do{Mt(this,e),e=e.next}while(e)}this._nodes.delete(t),this.emit(\"nodeDropped\",{key:t,attributes:n.attributes})},i.dropEdge=function(t){var e;if(arguments.length>1){var n=\"\"+arguments[0],r=\"\"+arguments[1];if(!(e=d(this,n,r,this.type)))throw new F('Graph.dropEdge: could not find the \"'.concat(n,'\" -> \"').concat(r,'\" edge in the graph.'))}else if(t=\"\"+t,!(e=this._edges.get(t)))throw new F('Graph.dropEdge: could not find the \"'.concat(t,'\" edge in the graph.'));return Mt(this,e),this},i.dropDirectedEdge=function(t,e){if(arguments.length<2)throw new I(\"Graph.dropDirectedEdge: it does not make sense to try and drop a directed edge by key. What if the edge with this key is undirected? Use #.dropEdge for this purpose instead.\");if(this.multi)throw new I(\"Graph.dropDirectedEdge: cannot use a {source,target} combo when dropping an edge in a MultiGraph since we cannot infer the one you want to delete as there could be multiple ones.\");var n=d(this,t=\"\"+t,e=\"\"+e,\"directed\");if(!n)throw new F('Graph.dropDirectedEdge: could not find a \"'.concat(t,'\" -> \"').concat(e,'\" edge in the graph.'));return Mt(this,n),this},i.dropUndirectedEdge=function(t,e){if(arguments.length<2)throw new I(\"Graph.dropUndirectedEdge: it does not make sense to drop a directed edge by key. What if the edge with this key is undirected? Use #.dropEdge for this purpose instead.\");if(this.multi)throw new I(\"Graph.dropUndirectedEdge: cannot use a {source,target} combo when dropping an edge in a MultiGraph since we cannot infer the one you want to delete as there could be multiple ones.\");var n=d(this,t,e,\"undirected\");if(!n)throw new F('Graph.dropUndirectedEdge: could not find a \"'.concat(t,'\" -> \"').concat(e,'\" edge in the graph.'));return Mt(this,n),this},i.clear=function(){this._edges.clear(),this._nodes.clear(),this._resetInstanceCounters(),this.emit(\"cleared\")},i.clearEdges=function(){for(var t,e=this._nodes.values();!0!==(t=e.next()).done;)t.value.clear();this._edges.clear(),this._resetInstanceCounters(),this.emit(\"edgesCleared\")},i.getAttribute=function(t){return this._attributes[t]},i.getAttributes=function(){return this._attributes},i.hasAttribute=function(t){return this._attributes.hasOwnProperty(t)},i.setAttribute=function(t,e){return this._attributes[t]=e,this.emit(\"attributesUpdated\",{type:\"set\",attributes:this._attributes,name:t}),this},i.updateAttribute=function(t,e){if(\"function\"!=typeof e)throw new B(\"Graph.updateAttribute: updater should be a function.\");var n=this._attributes[t];return this._attributes[t]=e(n),this.emit(\"attributesUpdated\",{type:\"set\",attributes:this._attributes,name:t}),this},i.removeAttribute=function(t){return delete this._attributes[t],this.emit(\"attributesUpdated\",{type:\"remove\",attributes:this._attributes,name:t}),this},i.replaceAttributes=function(t){if(!s(t))throw new B(\"Graph.replaceAttributes: provided attributes are not a plain object.\");return this._attributes=t,this.emit(\"attributesUpdated\",{type:\"replace\",attributes:this._attributes}),this},i.mergeAttributes=function(t){if(!s(t))throw new B(\"Graph.mergeAttributes: provided attributes are not a plain object.\");return u(this._attributes,t),this.emit(\"attributesUpdated\",{type:\"merge\",attributes:this._attributes,data:t}),this},i.updateAttributes=function(t){if(\"function\"!=typeof t)throw new B(\"Graph.updateAttributes: provided updater is not a function.\");return this._attributes=t(this._attributes),this.emit(\"attributesUpdated\",{type:\"update\",attributes:this._attributes}),this},i.updateEachNodeAttributes=function(t,e){if(\"function\"!=typeof t)throw new B(\"Graph.updateEachNodeAttributes: expecting an updater function.\");if(e&&!l(e))throw new B(\"Graph.updateEachNodeAttributes: invalid hints. Expecting an object having the following shape: {attributes?: [string]}\");for(var n,r,i=this._nodes.values();!0!==(n=i.next()).done;)(r=n.value).attributes=t(r.key,r.attributes);this.emit(\"eachNodeAttributesUpdated\",{hints:e||null})},i.updateEachEdgeAttributes=function(t,e){if(\"function\"!=typeof t)throw new B(\"Graph.updateEachEdgeAttributes: expecting an updater function.\");if(e&&!l(e))throw new B(\"Graph.updateEachEdgeAttributes: invalid hints. Expecting an object having the following shape: {attributes?: [string]}\");for(var n,r,i,o,a=this._edges.values();!0!==(n=a.next()).done;)i=(r=n.value).source,o=r.target,r.attributes=t(r.key,r.attributes,i.key,o.key,i.attributes,o.attributes,r.undirected);this.emit(\"eachEdgeAttributesUpdated\",{hints:e||null})},i.forEachAdjacencyEntry=function(t){if(\"function\"!=typeof t)throw new B(\"Graph.forEachAdjacencyEntry: expecting a callback.\");xt(!1,!1,!1,this,t)},i.forEachAdjacencyEntryWithOrphans=function(t){if(\"function\"!=typeof t)throw new B(\"Graph.forEachAdjacencyEntryWithOrphans: expecting a callback.\");xt(!1,!1,!0,this,t)},i.forEachAssymetricAdjacencyEntry=function(t){if(\"function\"!=typeof t)throw new B(\"Graph.forEachAssymetricAdjacencyEntry: expecting a callback.\");xt(!1,!0,!1,this,t)},i.forEachAssymetricAdjacencyEntryWithOrphans=function(t){if(\"function\"!=typeof t)throw new B(\"Graph.forEachAssymetricAdjacencyEntryWithOrphans: expecting a callback.\");xt(!1,!0,!0,this,t)},i.nodes=function(){return\"function\"==typeof Array.from?Array.from(this._nodes.keys()):K(this._nodes.keys(),this._nodes.size)},i.forEachNode=function(t){if(\"function\"!=typeof t)throw new B(\"Graph.forEachNode: expecting a callback.\");for(var e,n,r=this._nodes.values();!0!==(e=r.next()).done;)t((n=e.value).key,n.attributes)},i.findNode=function(t){if(\"function\"!=typeof t)throw new B(\"Graph.findNode: expecting a callback.\");for(var e,n,r=this._nodes.values();!0!==(e=r.next()).done;)if(t((n=e.value).key,n.attributes))return n.key},i.mapNodes=function(t){if(\"function\"!=typeof t)throw new B(\"Graph.mapNode: expecting a callback.\");for(var e,n,r=this._nodes.values(),i=new Array(this.order),o=0;!0!==(e=r.next()).done;)n=e.value,i[o++]=t(n.key,n.attributes);return i},i.someNode=function(t){if(\"function\"!=typeof t)throw new B(\"Graph.someNode: expecting a callback.\");for(var e,n,r=this._nodes.values();!0!==(e=r.next()).done;)if(t((n=e.value).key,n.attributes))return!0;return!1},i.everyNode=function(t){if(\"function\"!=typeof t)throw new B(\"Graph.everyNode: expecting a callback.\");for(var e,n,r=this._nodes.values();!0!==(e=r.next()).done;)if(!t((n=e.value).key,n.attributes))return!1;return!0},i.filterNodes=function(t){if(\"function\"!=typeof t)throw new B(\"Graph.filterNodes: expecting a callback.\");for(var e,n,r=this._nodes.values(),i=[];!0!==(e=r.next()).done;)t((n=e.value).key,n.attributes)&&i.push(n.key);return i},i.reduceNodes=function(t,e){if(\"function\"!=typeof t)throw new B(\"Graph.reduceNodes: expecting a callback.\");if(arguments.length<2)throw new B(\"Graph.reduceNodes: missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array.\");for(var n,r,i=e,o=this._nodes.values();!0!==(n=o.next()).done;)i=t(i,(r=n.value).key,r.attributes);return i},i.nodeEntries=function(){var t=this._nodes.values();return new O((function(){var e=t.next();if(e.done)return e;var n=e.value;return{value:{node:n.key,attributes:n.attributes},done:!1}}))},i.export=function(){var t=this,e=new Array(this._nodes.size),n=0;this._nodes.forEach((function(t,r){e[n++]=function(t,e){var n={key:t};return h(e.attributes)||(n.attributes=u({},e.attributes)),n}(r,t)}));var r=new Array(this._edges.size);return n=0,this._edges.forEach((function(e,i){r[n++]=function(t,e,n){var r={key:e,source:n.source.key,target:n.target.key};return h(n.attributes)||(r.attributes=u({},n.attributes)),\"mixed\"===t&&n.undirected&&(r.undirected=!0),r}(t.type,i,e)})),{options:{type:this.type,multi:this.multi,allowSelfLoops:this.allowSelfLoops},attributes:this.getAttributes(),nodes:e,edges:r}},i.import=function(t){var e,n,i,o,a,c=this,u=arguments.length>1&&void 0!==arguments[1]&&arguments[1];if(t instanceof r)return t.forEachNode((function(t,e){u?c.mergeNode(t,e):c.addNode(t,e)})),t.forEachEdge((function(t,e,n,r,i,o,a){u?a?c.mergeUndirectedEdgeWithKey(t,n,r,e):c.mergeDirectedEdgeWithKey(t,n,r,e):a?c.addUndirectedEdgeWithKey(t,n,r,e):c.addDirectedEdgeWithKey(t,n,r,e)})),this;if(!s(t))throw new B(\"Graph.import: invalid argument. Expecting a serialized graph or, alternatively, a Graph instance.\");if(t.attributes){if(!s(t.attributes))throw new B(\"Graph.import: invalid attributes. Expecting a plain object.\");u?this.mergeAttributes(t.attributes):this.replaceAttributes(t.attributes)}if(t.nodes){if(i=t.nodes,!Array.isArray(i))throw new B(\"Graph.import: invalid nodes. Expecting an array.\");for(e=0,n=i.length;e<n;e++){Et(o=i[e]);var d=o,h=d.key,p=d.attributes;u?this.mergeNode(h,p):this.addNode(h,p)}}if(t.edges){var f=!1;if(\"undirected\"===this.type&&(f=!0),i=t.edges,!Array.isArray(i))throw new B(\"Graph.import: invalid edges. Expecting an array.\");for(e=0,n=i.length;e<n;e++){At(a=i[e]);var l=a,g=l.source,y=l.target,w=l.attributes,v=l.undirected,b=void 0===v?f:v;\"key\"in a?(u?b?this.mergeUndirectedEdgeWithKey:this.mergeDirectedEdgeWithKey:b?this.addUndirectedEdgeWithKey:this.addDirectedEdgeWithKey).call(this,a.key,g,y,w):(u?b?this.mergeUndirectedEdge:this.mergeDirectedEdge:b?this.addUndirectedEdge:this.addDirectedEdge).call(this,g,y,w)}}return this},i.nullCopy=function(t){var e=new r(u({},this._options,t));return e.replaceAttributes(u({},this.getAttributes())),e},i.emptyCopy=function(t){var e=this.nullCopy(t);return this._nodes.forEach((function(t,n){var r=u({},t.attributes);t=new e.NodeDataClass(n,r),e._nodes.set(n,t)})),e},i.copy=function(t){if(\"string\"==typeof(t=t||{}).type&&t.type!==this.type&&\"mixed\"!==t.type)throw new I('Graph.copy: cannot create an incompatible copy from \"'.concat(this.type,'\" type to \"').concat(t.type,'\" because this would mean losing information about the current graph.'));if(\"boolean\"==typeof t.multi&&t.multi!==this.multi&&!0!==t.multi)throw new I(\"Graph.copy: cannot create an incompatible copy by downgrading a multi graph to a simple one because this would mean losing information about the current graph.\");if(\"boolean\"==typeof t.allowSelfLoops&&t.allowSelfLoops!==this.allowSelfLoops&&!0!==t.allowSelfLoops)throw new I(\"Graph.copy: cannot create an incompatible copy from a graph allowing self loops to one that does not because this would mean losing information about the current graph.\");for(var e,n,r=this.emptyCopy(t),i=this._edges.values();!0!==(e=i.next()).done;)jt(r,\"copy\",!1,(n=e.value).undirected,n.key,n.source.key,n.target.key,u({},n.attributes));return r},i.toJSON=function(){return this.export()},i.toString=function(){return\"[object Graph]\"},i.inspect=function(){var e=this,n={};this._nodes.forEach((function(t,e){n[e]=t.attributes}));var r={},i={};this._edges.forEach((function(t,n){var o,a=t.undirected?\"--\":\"->\",c=\"\",u=t.source.key,d=t.target.key;t.undirected&&u>d&&(o=u,u=d,d=o);var s=\"(\".concat(u,\")\").concat(a,\"(\").concat(d,\")\");n.startsWith(\"geid_\")?e.multi&&(void 0===i[s]?i[s]=0:i[s]++,c+=\"\".concat(i[s],\". \")):c+=\"[\".concat(n,\"]: \"),r[c+=s]=t.attributes}));var o={};for(var a in this)this.hasOwnProperty(a)&&!Ut.has(a)&&\"function\"!=typeof this[a]&&\"symbol\"!==t(a)&&(o[a]=this[a]);return o.attributes=this._attributes,o.nodes=n,o.edges=r,p(o,\"constructor\",this.constructor),o},r}(y.exports.EventEmitter);\"undefined\"!=typeof Symbol&&(zt.prototype[Symbol.for(\"nodejs.util.inspect.custom\")]=zt.prototype.inspect),[{name:function(t){return\"\".concat(t,\"Edge\")},generateKey:!0},{name:function(t){return\"\".concat(t,\"DirectedEdge\")},generateKey:!0,type:\"directed\"},{name:function(t){return\"\".concat(t,\"UndirectedEdge\")},generateKey:!0,type:\"undirected\"},{name:function(t){return\"\".concat(t,\"EdgeWithKey\")}},{name:function(t){return\"\".concat(t,\"DirectedEdgeWithKey\")},type:\"directed\"},{name:function(t){return\"\".concat(t,\"UndirectedEdgeWithKey\")},type:\"undirected\"}].forEach((function(t){[\"add\",\"merge\",\"update\"].forEach((function(e){var n=t.name(e),r=\"add\"===e?jt:Ct;t.generateKey?zt.prototype[n]=function(i,o,a){return r(this,n,!0,\"undirected\"===(t.type||this.type),null,i,o,a,\"update\"===e)}:zt.prototype[n]=function(i,o,a,c){return r(this,n,!1,\"undirected\"===(t.type||this.type),i,o,a,c,\"update\"===e)}}))})),function(t){Q.forEach((function(e){var n=e.name,r=e.attacher;r(t,n(\"Node\"),0),r(t,n(\"Source\"),1),r(t,n(\"Target\"),2),r(t,n(\"Opposite\"),3)}))}(zt),function(t){X.forEach((function(e){var n=e.name,r=e.attacher;r(t,n(\"Edge\"),\"mixed\"),r(t,n(\"DirectedEdge\"),\"directed\"),r(t,n(\"UndirectedEdge\"),\"undirected\")}))}(zt),function(t){et.forEach((function(e){!function(t,e){var n=e.name,r=e.type,i=e.direction;t.prototype[n]=function(t,e){if(\"mixed\"!==r&&\"mixed\"!==this.type&&r!==this.type)return[];if(!arguments.length)return ut(this,r);if(1===arguments.length){t=\"\"+t;var o=this._nodes.get(t);if(void 0===o)throw new F(\"Graph.\".concat(n,': could not find the \"').concat(t,'\" node in the graph.'));return pt(this.multi,\"mixed\"===r?this.type:r,i,o)}if(2===arguments.length){t=\"\"+t,e=\"\"+e;var a=this._nodes.get(t);if(!a)throw new F(\"Graph.\".concat(n,':  could not find the \"').concat(t,'\" source node in the graph.'));if(!this._nodes.has(e))throw new F(\"Graph.\".concat(n,':  could not find the \"').concat(e,'\" target node in the graph.'));return gt(r,this.multi,i,a,e)}throw new B(\"Graph.\".concat(n,\": too many arguments (expecting 0, 1 or 2 and got \").concat(arguments.length,\").\"))}}(t,e),function(t,e){var n=e.name,r=e.type,i=e.direction,o=\"forEach\"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[o]=function(t,e,n){if(\"mixed\"===r||\"mixed\"===this.type||r===this.type){if(1===arguments.length)return dt(!1,this,r,n=t);if(2===arguments.length){t=\"\"+t,n=e;var a=this._nodes.get(t);if(void 0===a)throw new F(\"Graph.\".concat(o,': could not find the \"').concat(t,'\" node in the graph.'));return ht(!1,this.multi,\"mixed\"===r?this.type:r,i,a,n)}if(3===arguments.length){t=\"\"+t,e=\"\"+e;var c=this._nodes.get(t);if(!c)throw new F(\"Graph.\".concat(o,':  could not find the \"').concat(t,'\" source node in the graph.'));if(!this._nodes.has(e))throw new F(\"Graph.\".concat(o,':  could not find the \"').concat(e,'\" target node in the graph.'));return lt(!1,r,this.multi,i,c,e,n)}throw new B(\"Graph.\".concat(o,\": too many arguments (expecting 1, 2 or 3 and got \").concat(arguments.length,\").\"))}};var a=\"map\"+n[0].toUpperCase()+n.slice(1);t.prototype[a]=function(){var t,e=Array.prototype.slice.call(arguments),n=e.pop();if(0===e.length){var i=0;\"directed\"!==r&&(i+=this.undirectedSize),\"undirected\"!==r&&(i+=this.directedSize),t=new Array(i);var a=0;e.push((function(e,r,i,o,c,u,d){t[a++]=n(e,r,i,o,c,u,d)}))}else t=[],e.push((function(e,r,i,o,a,c,u){t.push(n(e,r,i,o,a,c,u))}));return this[o].apply(this,e),t};var c=\"filter\"+n[0].toUpperCase()+n.slice(1);t.prototype[c]=function(){var t=Array.prototype.slice.call(arguments),e=t.pop(),n=[];return t.push((function(t,r,i,o,a,c,u){e(t,r,i,o,a,c,u)&&n.push(t)})),this[o].apply(this,t),n};var u=\"reduce\"+n[0].toUpperCase()+n.slice(1);t.prototype[u]=function(){var t,e,n=Array.prototype.slice.call(arguments);if(n.length<2||n.length>4)throw new B(\"Graph.\".concat(u,\": invalid number of arguments (expecting 2, 3 or 4 and got \").concat(n.length,\").\"));if(\"function\"==typeof n[n.length-1]&&\"function\"!=typeof n[n.length-2])throw new B(\"Graph.\".concat(u,\": missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array.\"));2===n.length?(t=n[0],e=n[1],n=[]):3===n.length?(t=n[1],e=n[2],n=[n[0]]):4===n.length&&(t=n[2],e=n[3],n=[n[0],n[1]]);var r=e;return n.push((function(e,n,i,o,a,c,u){r=t(r,e,n,i,o,a,c,u)})),this[o].apply(this,n),r}}(t,e),function(t,e){var n=e.name,r=e.type,i=e.direction,o=\"find\"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[o]=function(t,e,n){if(\"mixed\"!==r&&\"mixed\"!==this.type&&r!==this.type)return!1;if(1===arguments.length)return dt(!0,this,r,n=t);if(2===arguments.length){t=\"\"+t,n=e;var a=this._nodes.get(t);if(void 0===a)throw new F(\"Graph.\".concat(o,': could not find the \"').concat(t,'\" node in the graph.'));return ht(!0,this.multi,\"mixed\"===r?this.type:r,i,a,n)}if(3===arguments.length){t=\"\"+t,e=\"\"+e;var c=this._nodes.get(t);if(!c)throw new F(\"Graph.\".concat(o,':  could not find the \"').concat(t,'\" source node in the graph.'));if(!this._nodes.has(e))throw new F(\"Graph.\".concat(o,':  could not find the \"').concat(e,'\" target node in the graph.'));return lt(!0,r,this.multi,i,c,e,n)}throw new B(\"Graph.\".concat(o,\": too many arguments (expecting 1, 2 or 3 and got \").concat(arguments.length,\").\"))};var a=\"some\"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[a]=function(){var t=Array.prototype.slice.call(arguments),e=t.pop();return t.push((function(t,n,r,i,o,a,c){return e(t,n,r,i,o,a,c)})),!!this[o].apply(this,t)};var c=\"every\"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[c]=function(){var t=Array.prototype.slice.call(arguments),e=t.pop();return t.push((function(t,n,r,i,o,a,c){return!e(t,n,r,i,o,a,c)})),!this[o].apply(this,t)}}(t,e),function(t,e){var n=e.name,r=e.type,i=e.direction,o=n.slice(0,-1)+\"Entries\";t.prototype[o]=function(t,e){if(\"mixed\"!==r&&\"mixed\"!==this.type&&r!==this.type)return O.empty();if(!arguments.length)return st(this,r);if(1===arguments.length){t=\"\"+t;var n=this._nodes.get(t);if(!n)throw new F(\"Graph.\".concat(o,': could not find the \"').concat(t,'\" node in the graph.'));return ft(r,i,n)}if(2===arguments.length){t=\"\"+t,e=\"\"+e;var a=this._nodes.get(t);if(!a)throw new F(\"Graph.\".concat(o,':  could not find the \"').concat(t,'\" source node in the graph.'));if(!this._nodes.has(e))throw new F(\"Graph.\".concat(o,':  could not find the \"').concat(e,'\" target node in the graph.'));return yt(r,i,a,e)}throw new B(\"Graph.\".concat(o,\": too many arguments (expecting 0, 1 or 2 and got \").concat(arguments.length,\").\"))}}(t,e)}))}(zt),function(t){wt.forEach((function(e){_t(t,e),function(t,e){var n=e.name,r=e.type,i=e.direction,o=\"forEach\"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[o]=function(t,e){if(\"mixed\"===r||\"mixed\"===this.type||r===this.type){t=\"\"+t;var n=this._nodes.get(t);if(void 0===n)throw new F(\"Graph.\".concat(o,': could not find the \"').concat(t,'\" node in the graph.'));mt(!1,\"mixed\"===r?this.type:r,i,n,e)}};var a=\"map\"+n[0].toUpperCase()+n.slice(1);t.prototype[a]=function(t,e){var n=[];return this[o](t,(function(t,r){n.push(e(t,r))})),n};var c=\"filter\"+n[0].toUpperCase()+n.slice(1);t.prototype[c]=function(t,e){var n=[];return this[o](t,(function(t,r){e(t,r)&&n.push(t)})),n};var u=\"reduce\"+n[0].toUpperCase()+n.slice(1);t.prototype[u]=function(t,e,n){if(arguments.length<3)throw new B(\"Graph.\".concat(u,\": missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array.\"));var r=n;return this[o](t,(function(t,n){r=e(r,t,n)})),r}}(t,e),function(t,e){var n=e.name,r=e.type,i=e.direction,o=n[0].toUpperCase()+n.slice(1,-1),a=\"find\"+o;t.prototype[a]=function(t,e){if(\"mixed\"===r||\"mixed\"===this.type||r===this.type){t=\"\"+t;var n=this._nodes.get(t);if(void 0===n)throw new F(\"Graph.\".concat(a,': could not find the \"').concat(t,'\" node in the graph.'));return mt(!0,\"mixed\"===r?this.type:r,i,n,e)}};var c=\"some\"+o;t.prototype[c]=function(t,e){return!!this[a](t,e)};var u=\"every\"+o;t.prototype[u]=function(t,e){return!this[a](t,(function(t,n){return!e(t,n)}))}}(t,e),Gt(t,e)}))}(zt);var Wt=function(t){function n(e){var n=u({type:\"directed\"},e);if(\"multi\"in n&&!1!==n.multi)throw new B(\"DirectedGraph.from: inconsistent indication that the graph should be multi in given options!\");if(\"directed\"!==n.type)throw new B('DirectedGraph.from: inconsistent \"'+n.type+'\" type in given options!');return t.call(this,n)||this}return e(n,t),n}(zt),Pt=function(t){function n(e){var n=u({type:\"undirected\"},e);if(\"multi\"in n&&!1!==n.multi)throw new B(\"UndirectedGraph.from: inconsistent indication that the graph should be multi in given options!\");if(\"undirected\"!==n.type)throw new B('UndirectedGraph.from: inconsistent \"'+n.type+'\" type in given options!');return t.call(this,n)||this}return e(n,t),n}(zt),Rt=function(t){function n(e){var n=u({multi:!0},e);if(\"multi\"in n&&!0!==n.multi)throw new B(\"MultiGraph.from: inconsistent indication that the graph should be simple in given options!\");return t.call(this,n)||this}return e(n,t),n}(zt),Kt=function(t){function n(e){var n=u({type:\"directed\",multi:!0},e);if(\"multi\"in n&&!0!==n.multi)throw new B(\"MultiDirectedGraph.from: inconsistent indication that the graph should be simple in given options!\");if(\"directed\"!==n.type)throw new B('MultiDirectedGraph.from: inconsistent \"'+n.type+'\" type in given options!');return t.call(this,n)||this}return e(n,t),n}(zt),Tt=function(t){function n(e){var n=u({type:\"undirected\",multi:!0},e);if(\"multi\"in n&&!0!==n.multi)throw new B(\"MultiUndirectedGraph.from: inconsistent indication that the graph should be simple in given options!\");if(\"undirected\"!==n.type)throw new B('MultiUndirectedGraph.from: inconsistent \"'+n.type+'\" type in given options!');return t.call(this,n)||this}return e(n,t),n}(zt);function Bt(t){t.from=function(e,n){var r=u({},e.options,n),i=new t(r);return i.import(e),i}}return Bt(zt),Bt(Wt),Bt(Pt),Bt(Rt),Bt(Kt),Bt(Tt),zt.Graph=zt,zt.DirectedGraph=Wt,zt.UndirectedGraph=Pt,zt.MultiGraph=Rt,zt.MultiDirectedGraph=Kt,zt.MultiUndirectedGraph=Tt,zt.InvalidArgumentsGraphError=B,zt.NotFoundGraphError=F,zt.UsageGraphError=I,zt}));\n//# sourceMappingURL=graphology.umd.min.js.map\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as the `TypeError` message for \"Functions\" methods. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/** Used to match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\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 * 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\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        result = wait - timeSinceLastCall;\n\n    return maxing ? nativeMin(result, maxWait - timeSinceLastInvoke) : result;\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        timerId = setTimeout(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = setTimeout(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  return debounced;\n}\n\n/**\n * 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\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && objectToString.call(value) == symbolTag);\n}\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = value.replace(reTrim, '');\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = throttle;\n","/**\n * @license\n * Lodash <https://lodash.com/>\n * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n  /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n  var undefined;\n\n  /** Used as the semantic version number. */\n  var VERSION = '4.17.15';\n\n  /** Used as the size to enable large array optimizations. */\n  var LARGE_ARRAY_SIZE = 200;\n\n  /** Error message constants. */\n  var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n      FUNC_ERROR_TEXT = 'Expected a function';\n\n  /** Used to stand-in for `undefined` hash values. */\n  var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n  /** Used as the maximum memoize cache size. */\n  var MAX_MEMOIZE_SIZE = 500;\n\n  /** Used as the internal argument placeholder. */\n  var PLACEHOLDER = '__lodash_placeholder__';\n\n  /** Used to compose bitmasks for cloning. */\n  var CLONE_DEEP_FLAG = 1,\n      CLONE_FLAT_FLAG = 2,\n      CLONE_SYMBOLS_FLAG = 4;\n\n  /** Used to compose bitmasks for value comparisons. */\n  var COMPARE_PARTIAL_FLAG = 1,\n      COMPARE_UNORDERED_FLAG = 2;\n\n  /** Used to compose bitmasks for function metadata. */\n  var WRAP_BIND_FLAG = 1,\n      WRAP_BIND_KEY_FLAG = 2,\n      WRAP_CURRY_BOUND_FLAG = 4,\n      WRAP_CURRY_FLAG = 8,\n      WRAP_CURRY_RIGHT_FLAG = 16,\n      WRAP_PARTIAL_FLAG = 32,\n      WRAP_PARTIAL_RIGHT_FLAG = 64,\n      WRAP_ARY_FLAG = 128,\n      WRAP_REARG_FLAG = 256,\n      WRAP_FLIP_FLAG = 512;\n\n  /** Used as default options for `_.truncate`. */\n  var DEFAULT_TRUNC_LENGTH = 30,\n      DEFAULT_TRUNC_OMISSION = '...';\n\n  /** Used to detect hot functions by number of calls within a span of milliseconds. */\n  var HOT_COUNT = 800,\n      HOT_SPAN = 16;\n\n  /** Used to indicate the type of lazy iteratees. */\n  var LAZY_FILTER_FLAG = 1,\n      LAZY_MAP_FLAG = 2,\n      LAZY_WHILE_FLAG = 3;\n\n  /** Used as references for various `Number` constants. */\n  var INFINITY = 1 / 0,\n      MAX_SAFE_INTEGER = 9007199254740991,\n      MAX_INTEGER = 1.7976931348623157e+308,\n      NAN = 0 / 0;\n\n  /** Used as references for the maximum length and index of an array. */\n  var MAX_ARRAY_LENGTH = 4294967295,\n      MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n      HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n  /** Used to associate wrap methods with their bit flags. */\n  var wrapFlags = [\n    ['ary', WRAP_ARY_FLAG],\n    ['bind', WRAP_BIND_FLAG],\n    ['bindKey', WRAP_BIND_KEY_FLAG],\n    ['curry', WRAP_CURRY_FLAG],\n    ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n    ['flip', WRAP_FLIP_FLAG],\n    ['partial', WRAP_PARTIAL_FLAG],\n    ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n    ['rearg', WRAP_REARG_FLAG]\n  ];\n\n  /** `Object#toString` result references. */\n  var argsTag = '[object Arguments]',\n      arrayTag = '[object Array]',\n      asyncTag = '[object AsyncFunction]',\n      boolTag = '[object Boolean]',\n      dateTag = '[object Date]',\n      domExcTag = '[object DOMException]',\n      errorTag = '[object Error]',\n      funcTag = '[object Function]',\n      genTag = '[object GeneratorFunction]',\n      mapTag = '[object Map]',\n      numberTag = '[object Number]',\n      nullTag = '[object Null]',\n      objectTag = '[object Object]',\n      promiseTag = '[object Promise]',\n      proxyTag = '[object Proxy]',\n      regexpTag = '[object RegExp]',\n      setTag = '[object Set]',\n      stringTag = '[object String]',\n      symbolTag = '[object Symbol]',\n      undefinedTag = '[object Undefined]',\n      weakMapTag = '[object WeakMap]',\n      weakSetTag = '[object WeakSet]';\n\n  var arrayBufferTag = '[object ArrayBuffer]',\n      dataViewTag = '[object DataView]',\n      float32Tag = '[object Float32Array]',\n      float64Tag = '[object Float64Array]',\n      int8Tag = '[object Int8Array]',\n      int16Tag = '[object Int16Array]',\n      int32Tag = '[object Int32Array]',\n      uint8Tag = '[object Uint8Array]',\n      uint8ClampedTag = '[object Uint8ClampedArray]',\n      uint16Tag = '[object Uint16Array]',\n      uint32Tag = '[object Uint32Array]';\n\n  /** Used to match empty string literals in compiled template source. */\n  var reEmptyStringLeading = /\\b__p \\+= '';/g,\n      reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n      reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n  /** Used to match HTML entities and HTML characters. */\n  var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n      reUnescapedHtml = /[&<>\"']/g,\n      reHasEscapedHtml = RegExp(reEscapedHtml.source),\n      reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n  /** Used to match template delimiters. */\n  var reEscape = /<%-([\\s\\S]+?)%>/g,\n      reEvaluate = /<%([\\s\\S]+?)%>/g,\n      reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n  /** Used to match property names within property paths. */\n  var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n      reIsPlainProp = /^\\w*$/,\n      rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n  /**\n   * Used to match `RegExp`\n   * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n   */\n  var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n      reHasRegExpChar = RegExp(reRegExpChar.source);\n\n  /** Used to match leading and trailing whitespace. */\n  var reTrim = /^\\s+|\\s+$/g,\n      reTrimStart = /^\\s+/,\n      reTrimEnd = /\\s+$/;\n\n  /** Used to match wrap detail comments. */\n  var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n      reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n      reSplitDetails = /,? & /;\n\n  /** Used to match words composed of alphanumeric characters. */\n  var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n  /** Used to match backslashes in property paths. */\n  var reEscapeChar = /\\\\(\\\\)?/g;\n\n  /**\n   * Used to match\n   * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n   */\n  var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n  /** Used to match `RegExp` flags from their coerced string values. */\n  var reFlags = /\\w*$/;\n\n  /** Used to detect bad signed hexadecimal string values. */\n  var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n  /** Used to detect binary string values. */\n  var reIsBinary = /^0b[01]+$/i;\n\n  /** Used to detect host constructors (Safari). */\n  var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n  /** Used to detect octal string values. */\n  var reIsOctal = /^0o[0-7]+$/i;\n\n  /** Used to detect unsigned integer values. */\n  var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n  /** Used to match Latin Unicode letters (excluding mathematical operators). */\n  var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n  /** Used to ensure capturing order of template delimiters. */\n  var reNoMatch = /($^)/;\n\n  /** Used to match unescaped characters in compiled string literals. */\n  var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n  /** Used to compose unicode character classes. */\n  var rsAstralRange = '\\\\ud800-\\\\udfff',\n      rsComboMarksRange = '\\\\u0300-\\\\u036f',\n      reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n      rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n      rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n      rsDingbatRange = '\\\\u2700-\\\\u27bf',\n      rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n      rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n      rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n      rsPunctuationRange = '\\\\u2000-\\\\u206f',\n      rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n      rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n      rsVarRange = '\\\\ufe0e\\\\ufe0f',\n      rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n  /** Used to compose unicode capture groups. */\n  var rsApos = \"['\\u2019]\",\n      rsAstral = '[' + rsAstralRange + ']',\n      rsBreak = '[' + rsBreakRange + ']',\n      rsCombo = '[' + rsComboRange + ']',\n      rsDigits = '\\\\d+',\n      rsDingbat = '[' + rsDingbatRange + ']',\n      rsLower = '[' + rsLowerRange + ']',\n      rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n      rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n      rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n      rsNonAstral = '[^' + rsAstralRange + ']',\n      rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n      rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n      rsUpper = '[' + rsUpperRange + ']',\n      rsZWJ = '\\\\u200d';\n\n  /** Used to compose unicode regexes. */\n  var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n      rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n      rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n      rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n      reOptMod = rsModifier + '?',\n      rsOptVar = '[' + rsVarRange + ']?',\n      rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n      rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n      rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n      rsSeq = rsOptVar + reOptMod + rsOptJoin,\n      rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n      rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n  /** Used to match apostrophes. */\n  var reApos = RegExp(rsApos, 'g');\n\n  /**\n   * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n   * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n   */\n  var reComboMark = RegExp(rsCombo, 'g');\n\n  /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n  var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n  /** Used to match complex or compound words. */\n  var reUnicodeWord = RegExp([\n    rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n    rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n    rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n    rsUpper + '+' + rsOptContrUpper,\n    rsOrdUpper,\n    rsOrdLower,\n    rsDigits,\n    rsEmoji\n  ].join('|'), 'g');\n\n  /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\n  var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n  /** Used to detect strings that need a more robust regexp to match words. */\n  var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n  /** Used to assign default `context` object properties. */\n  var contextProps = [\n    'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n    'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n    'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n    'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n    '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n  ];\n\n  /** Used to make template sourceURLs easier to identify. */\n  var templateCounter = -1;\n\n  /** Used to identify `toStringTag` values of typed arrays. */\n  var typedArrayTags = {};\n  typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n  typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n  typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n  typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n  typedArrayTags[uint32Tag] = true;\n  typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n  typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n  typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n  typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n  typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n  typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n  typedArrayTags[setTag] = typedArrayTags[stringTag] =\n  typedArrayTags[weakMapTag] = false;\n\n  /** Used to identify `toStringTag` values supported by `_.clone`. */\n  var cloneableTags = {};\n  cloneableTags[argsTag] = cloneableTags[arrayTag] =\n  cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n  cloneableTags[boolTag] = cloneableTags[dateTag] =\n  cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n  cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n  cloneableTags[int32Tag] = cloneableTags[mapTag] =\n  cloneableTags[numberTag] = cloneableTags[objectTag] =\n  cloneableTags[regexpTag] = cloneableTags[setTag] =\n  cloneableTags[stringTag] = cloneableTags[symbolTag] =\n  cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n  cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n  cloneableTags[errorTag] = cloneableTags[funcTag] =\n  cloneableTags[weakMapTag] = false;\n\n  /** Used to map Latin Unicode letters to basic Latin letters. */\n  var deburredLetters = {\n    // Latin-1 Supplement block.\n    '\\xc0': 'A',  '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n    '\\xe0': 'a',  '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n    '\\xc7': 'C',  '\\xe7': 'c',\n    '\\xd0': 'D',  '\\xf0': 'd',\n    '\\xc8': 'E',  '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n    '\\xe8': 'e',  '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n    '\\xcc': 'I',  '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n    '\\xec': 'i',  '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n    '\\xd1': 'N',  '\\xf1': 'n',\n    '\\xd2': 'O',  '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n    '\\xf2': 'o',  '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n    '\\xd9': 'U',  '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n    '\\xf9': 'u',  '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n    '\\xdd': 'Y',  '\\xfd': 'y', '\\xff': 'y',\n    '\\xc6': 'Ae', '\\xe6': 'ae',\n    '\\xde': 'Th', '\\xfe': 'th',\n    '\\xdf': 'ss',\n    // Latin Extended-A block.\n    '\\u0100': 'A',  '\\u0102': 'A', '\\u0104': 'A',\n    '\\u0101': 'a',  '\\u0103': 'a', '\\u0105': 'a',\n    '\\u0106': 'C',  '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n    '\\u0107': 'c',  '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n    '\\u010e': 'D',  '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n    '\\u0112': 'E',  '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n    '\\u0113': 'e',  '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n    '\\u011c': 'G',  '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n    '\\u011d': 'g',  '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n    '\\u0124': 'H',  '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n    '\\u0128': 'I',  '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n    '\\u0129': 'i',  '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n    '\\u0134': 'J',  '\\u0135': 'j',\n    '\\u0136': 'K',  '\\u0137': 'k', '\\u0138': 'k',\n    '\\u0139': 'L',  '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n    '\\u013a': 'l',  '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n    '\\u0143': 'N',  '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n    '\\u0144': 'n',  '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n    '\\u014c': 'O',  '\\u014e': 'O', '\\u0150': 'O',\n    '\\u014d': 'o',  '\\u014f': 'o', '\\u0151': 'o',\n    '\\u0154': 'R',  '\\u0156': 'R', '\\u0158': 'R',\n    '\\u0155': 'r',  '\\u0157': 'r', '\\u0159': 'r',\n    '\\u015a': 'S',  '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n    '\\u015b': 's',  '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n    '\\u0162': 'T',  '\\u0164': 'T', '\\u0166': 'T',\n    '\\u0163': 't',  '\\u0165': 't', '\\u0167': 't',\n    '\\u0168': 'U',  '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n    '\\u0169': 'u',  '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n    '\\u0174': 'W',  '\\u0175': 'w',\n    '\\u0176': 'Y',  '\\u0177': 'y', '\\u0178': 'Y',\n    '\\u0179': 'Z',  '\\u017b': 'Z', '\\u017d': 'Z',\n    '\\u017a': 'z',  '\\u017c': 'z', '\\u017e': 'z',\n    '\\u0132': 'IJ', '\\u0133': 'ij',\n    '\\u0152': 'Oe', '\\u0153': 'oe',\n    '\\u0149': \"'n\", '\\u017f': 's'\n  };\n\n  /** Used to map characters to HTML entities. */\n  var htmlEscapes = {\n    '&': '&amp;',\n    '<': '&lt;',\n    '>': '&gt;',\n    '\"': '&quot;',\n    \"'\": '&#39;'\n  };\n\n  /** Used to map HTML entities to characters. */\n  var htmlUnescapes = {\n    '&amp;': '&',\n    '&lt;': '<',\n    '&gt;': '>',\n    '&quot;': '\"',\n    '&#39;': \"'\"\n  };\n\n  /** Used to escape characters for inclusion in compiled string literals. */\n  var stringEscapes = {\n    '\\\\': '\\\\',\n    \"'\": \"'\",\n    '\\n': 'n',\n    '\\r': 'r',\n    '\\u2028': 'u2028',\n    '\\u2029': 'u2029'\n  };\n\n  /** Built-in method references without a dependency on `root`. */\n  var freeParseFloat = parseFloat,\n      freeParseInt = parseInt;\n\n  /** Detect free variable `global` from Node.js. */\n  var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n  /** Detect free variable `self`. */\n  var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n  /** Used as a reference to the global object. */\n  var root = freeGlobal || freeSelf || Function('return this')();\n\n  /** Detect free variable `exports`. */\n  var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n  /** Detect free variable `module`. */\n  var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n  /** Detect the popular CommonJS extension `module.exports`. */\n  var moduleExports = freeModule && freeModule.exports === freeExports;\n\n  /** Detect free variable `process` from Node.js. */\n  var freeProcess = moduleExports && freeGlobal.process;\n\n  /** Used to access faster Node.js helpers. */\n  var nodeUtil = (function() {\n    try {\n      // Use `util.types` for Node.js 10+.\n      var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n      if (types) {\n        return types;\n      }\n\n      // Legacy `process.binding('util')` for Node.js < 10.\n      return freeProcess && freeProcess.binding && freeProcess.binding('util');\n    } catch (e) {}\n  }());\n\n  /* Node.js helper references. */\n  var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n      nodeIsDate = nodeUtil && nodeUtil.isDate,\n      nodeIsMap = nodeUtil && nodeUtil.isMap,\n      nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n      nodeIsSet = nodeUtil && nodeUtil.isSet,\n      nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n  /*--------------------------------------------------------------------------*/\n\n  /**\n   * A faster alternative to `Function#apply`, this function invokes `func`\n   * with the `this` binding of `thisArg` and the arguments of `args`.\n   *\n   * @private\n   * @param {Function} func The function to invoke.\n   * @param {*} thisArg The `this` binding of `func`.\n   * @param {Array} args The arguments to invoke `func` with.\n   * @returns {*} Returns the result of `func`.\n   */\n  function apply(func, thisArg, args) {\n    switch (args.length) {\n      case 0: return func.call(thisArg);\n      case 1: return func.call(thisArg, args[0]);\n      case 2: return func.call(thisArg, args[0], args[1]);\n      case 3: return func.call(thisArg, args[0], args[1], args[2]);\n    }\n    return func.apply(thisArg, args);\n  }\n\n  /**\n   * A specialized version of `baseAggregator` for arrays.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} setter The function to set `accumulator` values.\n   * @param {Function} iteratee The iteratee to transform keys.\n   * @param {Object} accumulator The initial aggregated object.\n   * @returns {Function} Returns `accumulator`.\n   */\n  function arrayAggregator(array, setter, iteratee, accumulator) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      var value = array[index];\n      setter(accumulator, value, iteratee(value), array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.forEach` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayEach(array, iteratee) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (iteratee(array[index], index, array) === false) {\n        break;\n      }\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.forEachRight` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayEachRight(array, iteratee) {\n    var length = array == null ? 0 : array.length;\n\n    while (length--) {\n      if (iteratee(array[length], length, array) === false) {\n        break;\n      }\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.every` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {boolean} Returns `true` if all elements pass the predicate check,\n   *  else `false`.\n   */\n  function arrayEvery(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (!predicate(array[index], index, array)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  /**\n   * A specialized version of `_.filter` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {Array} Returns the new filtered array.\n   */\n  function arrayFilter(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length,\n        resIndex = 0,\n        result = [];\n\n    while (++index < length) {\n      var value = array[index];\n      if (predicate(value, index, array)) {\n        result[resIndex++] = value;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * A specialized version of `_.includes` for arrays without support for\n   * specifying an index to search from.\n   *\n   * @private\n   * @param {Array} [array] The array to inspect.\n   * @param {*} target The value to search for.\n   * @returns {boolean} Returns `true` if `target` is found, else `false`.\n   */\n  function arrayIncludes(array, value) {\n    var length = array == null ? 0 : array.length;\n    return !!length && baseIndexOf(array, value, 0) > -1;\n  }\n\n  /**\n   * This function is like `arrayIncludes` except that it accepts a comparator.\n   *\n   * @private\n   * @param {Array} [array] The array to inspect.\n   * @param {*} target The value to search for.\n   * @param {Function} comparator The comparator invoked per element.\n   * @returns {boolean} Returns `true` if `target` is found, else `false`.\n   */\n  function arrayIncludesWith(array, value, comparator) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (comparator(value, array[index])) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * A specialized version of `_.map` for arrays without support for iteratee\n   * shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns the new mapped array.\n   */\n  function arrayMap(array, iteratee) {\n    var index = -1,\n        length = array == null ? 0 : array.length,\n        result = Array(length);\n\n    while (++index < length) {\n      result[index] = iteratee(array[index], index, array);\n    }\n    return result;\n  }\n\n  /**\n   * Appends the elements of `values` to `array`.\n   *\n   * @private\n   * @param {Array} array The array to modify.\n   * @param {Array} values The values to append.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayPush(array, values) {\n    var index = -1,\n        length = values.length,\n        offset = array.length;\n\n    while (++index < length) {\n      array[offset + index] = values[index];\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.reduce` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} [accumulator] The initial value.\n   * @param {boolean} [initAccum] Specify using the first element of `array` as\n   *  the initial value.\n   * @returns {*} Returns the accumulated value.\n   */\n  function arrayReduce(array, iteratee, accumulator, initAccum) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    if (initAccum && length) {\n      accumulator = array[++index];\n    }\n    while (++index < length) {\n      accumulator = iteratee(accumulator, array[index], index, array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.reduceRight` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} [accumulator] The initial value.\n   * @param {boolean} [initAccum] Specify using the last element of `array` as\n   *  the initial value.\n   * @returns {*} Returns the accumulated value.\n   */\n  function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n    var length = array == null ? 0 : array.length;\n    if (initAccum && length) {\n      accumulator = array[--length];\n    }\n    while (length--) {\n      accumulator = iteratee(accumulator, array[length], length, array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.some` for arrays without support for iteratee\n   * shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {boolean} Returns `true` if any element passes the predicate check,\n   *  else `false`.\n   */\n  function arraySome(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (predicate(array[index], index, array)) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Gets the size of an ASCII `string`.\n   *\n   * @private\n   * @param {string} string The string inspect.\n   * @returns {number} Returns the string size.\n   */\n  var asciiSize = baseProperty('length');\n\n  /**\n   * Converts an ASCII `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function asciiToArray(string) {\n    return string.split('');\n  }\n\n  /**\n   * Splits an ASCII `string` into an array of its words.\n   *\n   * @private\n   * @param {string} The string to inspect.\n   * @returns {Array} Returns the words of `string`.\n   */\n  function asciiWords(string) {\n    return string.match(reAsciiWord) || [];\n  }\n\n  /**\n   * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n   * without support for iteratee shorthands, which iterates over `collection`\n   * using `eachFunc`.\n   *\n   * @private\n   * @param {Array|Object} collection The collection to inspect.\n   * @param {Function} predicate The function invoked per iteration.\n   * @param {Function} eachFunc The function to iterate over `collection`.\n   * @returns {*} Returns the found element or its key, else `undefined`.\n   */\n  function baseFindKey(collection, predicate, eachFunc) {\n    var result;\n    eachFunc(collection, function(value, key, collection) {\n      if (predicate(value, key, collection)) {\n        result = key;\n        return false;\n      }\n    });\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.findIndex` and `_.findLastIndex` without\n   * support for iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {Function} predicate The function invoked per iteration.\n   * @param {number} fromIndex The index to search from.\n   * @param {boolean} [fromRight] Specify iterating from right to left.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function baseFindIndex(array, predicate, fromIndex, fromRight) {\n    var length = array.length,\n        index = fromIndex + (fromRight ? 1 : -1);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (predicate(array[index], index, array)) {\n        return index;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function baseIndexOf(array, value, fromIndex) {\n    return value === value\n      ? strictIndexOf(array, value, fromIndex)\n      : baseFindIndex(array, baseIsNaN, fromIndex);\n  }\n\n  /**\n   * This function is like `baseIndexOf` except that it accepts a comparator.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @param {Function} comparator The comparator invoked per element.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function baseIndexOfWith(array, value, fromIndex, comparator) {\n    var index = fromIndex - 1,\n        length = array.length;\n\n    while (++index < length) {\n      if (comparator(array[index], value)) {\n        return index;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * The base implementation of `_.isNaN` without support for number objects.\n   *\n   * @private\n   * @param {*} value The value to check.\n   * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n   */\n  function baseIsNaN(value) {\n    return value !== value;\n  }\n\n  /**\n   * The base implementation of `_.mean` and `_.meanBy` without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {number} Returns the mean.\n   */\n  function baseMean(array, iteratee) {\n    var length = array == null ? 0 : array.length;\n    return length ? (baseSum(array, iteratee) / length) : NAN;\n  }\n\n  /**\n   * The base implementation of `_.property` without support for deep paths.\n   *\n   * @private\n   * @param {string} key The key of the property to get.\n   * @returns {Function} Returns the new accessor function.\n   */\n  function baseProperty(key) {\n    return function(object) {\n      return object == null ? undefined : object[key];\n    };\n  }\n\n  /**\n   * The base implementation of `_.propertyOf` without support for deep paths.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @returns {Function} Returns the new accessor function.\n   */\n  function basePropertyOf(object) {\n    return function(key) {\n      return object == null ? undefined : object[key];\n    };\n  }\n\n  /**\n   * The base implementation of `_.reduce` and `_.reduceRight`, without support\n   * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n   *\n   * @private\n   * @param {Array|Object} collection The collection to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} accumulator The initial value.\n   * @param {boolean} initAccum Specify using the first or last element of\n   *  `collection` as the initial value.\n   * @param {Function} eachFunc The function to iterate over `collection`.\n   * @returns {*} Returns the accumulated value.\n   */\n  function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n    eachFunc(collection, function(value, index, collection) {\n      accumulator = initAccum\n        ? (initAccum = false, value)\n        : iteratee(accumulator, value, index, collection);\n    });\n    return accumulator;\n  }\n\n  /**\n   * The base implementation of `_.sortBy` which uses `comparer` to define the\n   * sort order of `array` and replaces criteria objects with their corresponding\n   * values.\n   *\n   * @private\n   * @param {Array} array The array to sort.\n   * @param {Function} comparer The function to define sort order.\n   * @returns {Array} Returns `array`.\n   */\n  function baseSortBy(array, comparer) {\n    var length = array.length;\n\n    array.sort(comparer);\n    while (length--) {\n      array[length] = array[length].value;\n    }\n    return array;\n  }\n\n  /**\n   * The base implementation of `_.sum` and `_.sumBy` without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {number} Returns the sum.\n   */\n  function baseSum(array, iteratee) {\n    var result,\n        index = -1,\n        length = array.length;\n\n    while (++index < length) {\n      var current = iteratee(array[index]);\n      if (current !== undefined) {\n        result = result === undefined ? current : (result + current);\n      }\n    }\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.times` without support for iteratee shorthands\n   * or max array length checks.\n   *\n   * @private\n   * @param {number} n The number of times to invoke `iteratee`.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns the array of results.\n   */\n  function baseTimes(n, iteratee) {\n    var index = -1,\n        result = Array(n);\n\n    while (++index < n) {\n      result[index] = iteratee(index);\n    }\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n   * of key-value pairs for `object` corresponding to the property names of `props`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Array} props The property names to get values for.\n   * @returns {Object} Returns the key-value pairs.\n   */\n  function baseToPairs(object, props) {\n    return arrayMap(props, function(key) {\n      return [key, object[key]];\n    });\n  }\n\n  /**\n   * The base implementation of `_.unary` without support for storing metadata.\n   *\n   * @private\n   * @param {Function} func The function to cap arguments for.\n   * @returns {Function} Returns the new capped function.\n   */\n  function baseUnary(func) {\n    return function(value) {\n      return func(value);\n    };\n  }\n\n  /**\n   * The base implementation of `_.values` and `_.valuesIn` which creates an\n   * array of `object` property values corresponding to the property names\n   * of `props`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Array} props The property names to get values for.\n   * @returns {Object} Returns the array of property values.\n   */\n  function baseValues(object, props) {\n    return arrayMap(props, function(key) {\n      return object[key];\n    });\n  }\n\n  /**\n   * Checks if a `cache` value for `key` exists.\n   *\n   * @private\n   * @param {Object} cache The cache to query.\n   * @param {string} key The key of the entry to check.\n   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n   */\n  function cacheHas(cache, key) {\n    return cache.has(key);\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n   * that is not found in the character symbols.\n   *\n   * @private\n   * @param {Array} strSymbols The string symbols to inspect.\n   * @param {Array} chrSymbols The character symbols to find.\n   * @returns {number} Returns the index of the first unmatched string symbol.\n   */\n  function charsStartIndex(strSymbols, chrSymbols) {\n    var index = -1,\n        length = strSymbols.length;\n\n    while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n    return index;\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n   * that is not found in the character symbols.\n   *\n   * @private\n   * @param {Array} strSymbols The string symbols to inspect.\n   * @param {Array} chrSymbols The character symbols to find.\n   * @returns {number} Returns the index of the last unmatched string symbol.\n   */\n  function charsEndIndex(strSymbols, chrSymbols) {\n    var index = strSymbols.length;\n\n    while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n    return index;\n  }\n\n  /**\n   * Gets the number of `placeholder` occurrences in `array`.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} placeholder The placeholder to search for.\n   * @returns {number} Returns the placeholder count.\n   */\n  function countHolders(array, placeholder) {\n    var length = array.length,\n        result = 0;\n\n    while (length--) {\n      if (array[length] === placeholder) {\n        ++result;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n   * letters to basic Latin letters.\n   *\n   * @private\n   * @param {string} letter The matched letter to deburr.\n   * @returns {string} Returns the deburred letter.\n   */\n  var deburrLetter = basePropertyOf(deburredLetters);\n\n  /**\n   * Used by `_.escape` to convert characters to HTML entities.\n   *\n   * @private\n   * @param {string} chr The matched character to escape.\n   * @returns {string} Returns the escaped character.\n   */\n  var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n  /**\n   * Used by `_.template` to escape characters for inclusion in compiled string literals.\n   *\n   * @private\n   * @param {string} chr The matched character to escape.\n   * @returns {string} Returns the escaped character.\n   */\n  function escapeStringChar(chr) {\n    return '\\\\' + stringEscapes[chr];\n  }\n\n  /**\n   * Gets the value at `key` of `object`.\n   *\n   * @private\n   * @param {Object} [object] The object to query.\n   * @param {string} key The key of the property to get.\n   * @returns {*} Returns the property value.\n   */\n  function getValue(object, key) {\n    return object == null ? undefined : object[key];\n  }\n\n  /**\n   * Checks if `string` contains Unicode symbols.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n   */\n  function hasUnicode(string) {\n    return reHasUnicode.test(string);\n  }\n\n  /**\n   * Checks if `string` contains a word composed of Unicode symbols.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {boolean} Returns `true` if a word is found, else `false`.\n   */\n  function hasUnicodeWord(string) {\n    return reHasUnicodeWord.test(string);\n  }\n\n  /**\n   * Converts `iterator` to an array.\n   *\n   * @private\n   * @param {Object} iterator The iterator to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function iteratorToArray(iterator) {\n    var data,\n        result = [];\n\n    while (!(data = iterator.next()).done) {\n      result.push(data.value);\n    }\n    return result;\n  }\n\n  /**\n   * Converts `map` to its key-value pairs.\n   *\n   * @private\n   * @param {Object} map The map to convert.\n   * @returns {Array} Returns the key-value pairs.\n   */\n  function mapToArray(map) {\n    var index = -1,\n        result = Array(map.size);\n\n    map.forEach(function(value, key) {\n      result[++index] = [key, value];\n    });\n    return result;\n  }\n\n  /**\n   * Creates a unary function that invokes `func` with its argument transformed.\n   *\n   * @private\n   * @param {Function} func The function to wrap.\n   * @param {Function} transform The argument transform.\n   * @returns {Function} Returns the new function.\n   */\n  function overArg(func, transform) {\n    return function(arg) {\n      return func(transform(arg));\n    };\n  }\n\n  /**\n   * Replaces all `placeholder` elements in `array` with an internal placeholder\n   * and returns an array of their indexes.\n   *\n   * @private\n   * @param {Array} array The array to modify.\n   * @param {*} placeholder The placeholder to replace.\n   * @returns {Array} Returns the new array of placeholder indexes.\n   */\n  function replaceHolders(array, placeholder) {\n    var index = -1,\n        length = array.length,\n        resIndex = 0,\n        result = [];\n\n    while (++index < length) {\n      var value = array[index];\n      if (value === placeholder || value === PLACEHOLDER) {\n        array[index] = PLACEHOLDER;\n        result[resIndex++] = index;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Converts `set` to an array of its values.\n   *\n   * @private\n   * @param {Object} set The set to convert.\n   * @returns {Array} Returns the values.\n   */\n  function setToArray(set) {\n    var index = -1,\n        result = Array(set.size);\n\n    set.forEach(function(value) {\n      result[++index] = value;\n    });\n    return result;\n  }\n\n  /**\n   * Converts `set` to its value-value pairs.\n   *\n   * @private\n   * @param {Object} set The set to convert.\n   * @returns {Array} Returns the value-value pairs.\n   */\n  function setToPairs(set) {\n    var index = -1,\n        result = Array(set.size);\n\n    set.forEach(function(value) {\n      result[++index] = [value, value];\n    });\n    return result;\n  }\n\n  /**\n   * A specialized version of `_.indexOf` which performs strict equality\n   * comparisons of values, i.e. `===`.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function strictIndexOf(array, value, fromIndex) {\n    var index = fromIndex - 1,\n        length = array.length;\n\n    while (++index < length) {\n      if (array[index] === value) {\n        return index;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * A specialized version of `_.lastIndexOf` which performs strict equality\n   * comparisons of values, i.e. `===`.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function strictLastIndexOf(array, value, fromIndex) {\n    var index = fromIndex + 1;\n    while (index--) {\n      if (array[index] === value) {\n        return index;\n      }\n    }\n    return index;\n  }\n\n  /**\n   * Gets the number of symbols in `string`.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {number} Returns the string size.\n   */\n  function stringSize(string) {\n    return hasUnicode(string)\n      ? unicodeSize(string)\n      : asciiSize(string);\n  }\n\n  /**\n   * Converts `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function stringToArray(string) {\n    return hasUnicode(string)\n      ? unicodeToArray(string)\n      : asciiToArray(string);\n  }\n\n  /**\n   * Used by `_.unescape` to convert HTML entities to characters.\n   *\n   * @private\n   * @param {string} chr The matched character to unescape.\n   * @returns {string} Returns the unescaped character.\n   */\n  var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n  /**\n   * Gets the size of a Unicode `string`.\n   *\n   * @private\n   * @param {string} string The string inspect.\n   * @returns {number} Returns the string size.\n   */\n  function unicodeSize(string) {\n    var result = reUnicode.lastIndex = 0;\n    while (reUnicode.test(string)) {\n      ++result;\n    }\n    return result;\n  }\n\n  /**\n   * Converts a Unicode `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function unicodeToArray(string) {\n    return string.match(reUnicode) || [];\n  }\n\n  /**\n   * Splits a Unicode `string` into an array of its words.\n   *\n   * @private\n   * @param {string} The string to inspect.\n   * @returns {Array} Returns the words of `string`.\n   */\n  function unicodeWords(string) {\n    return string.match(reUnicodeWord) || [];\n  }\n\n  /*--------------------------------------------------------------------------*/\n\n  /**\n   * Create a new pristine `lodash` function using the `context` object.\n   *\n   * @static\n   * @memberOf _\n   * @since 1.1.0\n   * @category Util\n   * @param {Object} [context=root] The context object.\n   * @returns {Function} Returns a new `lodash` function.\n   * @example\n   *\n   * _.mixin({ 'foo': _.constant('foo') });\n   *\n   * var lodash = _.runInContext();\n   * lodash.mixin({ 'bar': lodash.constant('bar') });\n   *\n   * _.isFunction(_.foo);\n   * // => true\n   * _.isFunction(_.bar);\n   * // => false\n   *\n   * lodash.isFunction(lodash.foo);\n   * // => false\n   * lodash.isFunction(lodash.bar);\n   * // => true\n   *\n   * // Create a suped-up `defer` in Node.js.\n   * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n   */\n  var runInContext = (function runInContext(context) {\n    context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n    /** Built-in constructor references. */\n    var Array = context.Array,\n        Date = context.Date,\n        Error = context.Error,\n        Function = context.Function,\n        Math = context.Math,\n        Object = context.Object,\n        RegExp = context.RegExp,\n        String = context.String,\n        TypeError = context.TypeError;\n\n    /** Used for built-in method references. */\n    var arrayProto = Array.prototype,\n        funcProto = Function.prototype,\n        objectProto = Object.prototype;\n\n    /** Used to detect overreaching core-js shims. */\n    var coreJsData = context['__core-js_shared__'];\n\n    /** Used to resolve the decompiled source of functions. */\n    var funcToString = funcProto.toString;\n\n    /** Used to check objects for own properties. */\n    var hasOwnProperty = objectProto.hasOwnProperty;\n\n    /** Used to generate unique IDs. */\n    var idCounter = 0;\n\n    /** Used to detect methods masquerading as native. */\n    var maskSrcKey = (function() {\n      var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n      return uid ? ('Symbol(src)_1.' + uid) : '';\n    }());\n\n    /**\n     * Used to resolve the\n     * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n     * of values.\n     */\n    var nativeObjectToString = objectProto.toString;\n\n    /** Used to infer the `Object` constructor. */\n    var objectCtorString = funcToString.call(Object);\n\n    /** Used to restore the original `_` reference in `_.noConflict`. */\n    var oldDash = root._;\n\n    /** Used to detect if a method is native. */\n    var reIsNative = RegExp('^' +\n      funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n      .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n    );\n\n    /** Built-in value references. */\n    var Buffer = moduleExports ? context.Buffer : undefined,\n        Symbol = context.Symbol,\n        Uint8Array = context.Uint8Array,\n        allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n        getPrototype = overArg(Object.getPrototypeOf, Object),\n        objectCreate = Object.create,\n        propertyIsEnumerable = objectProto.propertyIsEnumerable,\n        splice = arrayProto.splice,\n        spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n        symIterator = Symbol ? Symbol.iterator : undefined,\n        symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n    var defineProperty = (function() {\n      try {\n        var func = getNative(Object, 'defineProperty');\n        func({}, '', {});\n        return func;\n      } catch (e) {}\n    }());\n\n    /** Mocked built-ins. */\n    var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n        ctxNow = Date && Date.now !== root.Date.now && Date.now,\n        ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n    /* Built-in method references for those with the same name as other `lodash` methods. */\n    var nativeCeil = Math.ceil,\n        nativeFloor = Math.floor,\n        nativeGetSymbols = Object.getOwnPropertySymbols,\n        nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n        nativeIsFinite = context.isFinite,\n        nativeJoin = arrayProto.join,\n        nativeKeys = overArg(Object.keys, Object),\n        nativeMax = Math.max,\n        nativeMin = Math.min,\n        nativeNow = Date.now,\n        nativeParseInt = context.parseInt,\n        nativeRandom = Math.random,\n        nativeReverse = arrayProto.reverse;\n\n    /* Built-in method references that are verified to be native. */\n    var DataView = getNative(context, 'DataView'),\n        Map = getNative(context, 'Map'),\n        Promise = getNative(context, 'Promise'),\n        Set = getNative(context, 'Set'),\n        WeakMap = getNative(context, 'WeakMap'),\n        nativeCreate = getNative(Object, 'create');\n\n    /** Used to store function metadata. */\n    var metaMap = WeakMap && new WeakMap;\n\n    /** Used to lookup unminified function names. */\n    var realNames = {};\n\n    /** Used to detect maps, sets, and weakmaps. */\n    var dataViewCtorString = toSource(DataView),\n        mapCtorString = toSource(Map),\n        promiseCtorString = toSource(Promise),\n        setCtorString = toSource(Set),\n        weakMapCtorString = toSource(WeakMap);\n\n    /** Used to convert symbols to primitives and strings. */\n    var symbolProto = Symbol ? Symbol.prototype : undefined,\n        symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n        symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a `lodash` object which wraps `value` to enable implicit method\n     * chain sequences. Methods that operate on and return arrays, collections,\n     * and functions can be chained together. Methods that retrieve a single value\n     * or may return a primitive value will automatically end the chain sequence\n     * and return the unwrapped value. Otherwise, the value must be unwrapped\n     * with `_#value`.\n     *\n     * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n     * enabled using `_.chain`.\n     *\n     * The execution of chained methods is lazy, that is, it's deferred until\n     * `_#value` is implicitly or explicitly called.\n     *\n     * Lazy evaluation allows several methods to support shortcut fusion.\n     * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n     * the creation of intermediate arrays and can greatly reduce the number of\n     * iteratee executions. Sections of a chain sequence qualify for shortcut\n     * fusion if the section is applied to an array and iteratees accept only\n     * one argument. The heuristic for whether a section qualifies for shortcut\n     * fusion is subject to change.\n     *\n     * Chaining is supported in custom builds as long as the `_#value` method is\n     * directly or indirectly included in the build.\n     *\n     * In addition to lodash methods, wrappers have `Array` and `String` methods.\n     *\n     * The wrapper `Array` methods are:\n     * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n     *\n     * The wrapper `String` methods are:\n     * `replace` and `split`\n     *\n     * The wrapper methods that support shortcut fusion are:\n     * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n     * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n     * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n     *\n     * The chainable wrapper methods are:\n     * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n     * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n     * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n     * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n     * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n     * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n     * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n     * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n     * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n     * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n     * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n     * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n     * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n     * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n     * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n     * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n     * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n     * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n     * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n     * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n     * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n     * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n     * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n     * `zipObject`, `zipObjectDeep`, and `zipWith`\n     *\n     * The wrapper methods that are **not** chainable by default are:\n     * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n     * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n     * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n     * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n     * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n     * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n     * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n     * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n     * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n     * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n     * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n     * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n     * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n     * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n     * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n     * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n     * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n     * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n     * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n     * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n     * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n     * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n     * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n     * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n     * `upperFirst`, `value`, and `words`\n     *\n     * @name _\n     * @constructor\n     * @category Seq\n     * @param {*} value The value to wrap in a `lodash` instance.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var wrapped = _([1, 2, 3]);\n     *\n     * // Returns an unwrapped value.\n     * wrapped.reduce(_.add);\n     * // => 6\n     *\n     * // Returns a wrapped value.\n     * var squares = wrapped.map(square);\n     *\n     * _.isArray(squares);\n     * // => false\n     *\n     * _.isArray(squares.value());\n     * // => true\n     */\n    function lodash(value) {\n      if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n        if (value instanceof LodashWrapper) {\n          return value;\n        }\n        if (hasOwnProperty.call(value, '__wrapped__')) {\n          return wrapperClone(value);\n        }\n      }\n      return new LodashWrapper(value);\n    }\n\n    /**\n     * The base implementation of `_.create` without support for assigning\n     * properties to the created object.\n     *\n     * @private\n     * @param {Object} proto The object to inherit from.\n     * @returns {Object} Returns the new object.\n     */\n    var baseCreate = (function() {\n      function object() {}\n      return function(proto) {\n        if (!isObject(proto)) {\n          return {};\n        }\n        if (objectCreate) {\n          return objectCreate(proto);\n        }\n        object.prototype = proto;\n        var result = new object;\n        object.prototype = undefined;\n        return result;\n      };\n    }());\n\n    /**\n     * The function whose prototype chain sequence wrappers inherit from.\n     *\n     * @private\n     */\n    function baseLodash() {\n      // No operation performed.\n    }\n\n    /**\n     * The base constructor for creating `lodash` wrapper objects.\n     *\n     * @private\n     * @param {*} value The value to wrap.\n     * @param {boolean} [chainAll] Enable explicit method chain sequences.\n     */\n    function LodashWrapper(value, chainAll) {\n      this.__wrapped__ = value;\n      this.__actions__ = [];\n      this.__chain__ = !!chainAll;\n      this.__index__ = 0;\n      this.__values__ = undefined;\n    }\n\n    /**\n     * By default, the template delimiters used by lodash are like those in\n     * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n     * following template settings to use alternative delimiters.\n     *\n     * @static\n     * @memberOf _\n     * @type {Object}\n     */\n    lodash.templateSettings = {\n\n      /**\n       * Used to detect `data` property values to be HTML-escaped.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'escape': reEscape,\n\n      /**\n       * Used to detect code to be evaluated.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'evaluate': reEvaluate,\n\n      /**\n       * Used to detect `data` property values to inject.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'interpolate': reInterpolate,\n\n      /**\n       * Used to reference the data object in the template text.\n       *\n       * @memberOf _.templateSettings\n       * @type {string}\n       */\n      'variable': '',\n\n      /**\n       * Used to import variables into the compiled template.\n       *\n       * @memberOf _.templateSettings\n       * @type {Object}\n       */\n      'imports': {\n\n        /**\n         * A reference to the `lodash` function.\n         *\n         * @memberOf _.templateSettings.imports\n         * @type {Function}\n         */\n        '_': lodash\n      }\n    };\n\n    // Ensure wrappers are instances of `baseLodash`.\n    lodash.prototype = baseLodash.prototype;\n    lodash.prototype.constructor = lodash;\n\n    LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n    LodashWrapper.prototype.constructor = LodashWrapper;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n     *\n     * @private\n     * @constructor\n     * @param {*} value The value to wrap.\n     */\n    function LazyWrapper(value) {\n      this.__wrapped__ = value;\n      this.__actions__ = [];\n      this.__dir__ = 1;\n      this.__filtered__ = false;\n      this.__iteratees__ = [];\n      this.__takeCount__ = MAX_ARRAY_LENGTH;\n      this.__views__ = [];\n    }\n\n    /**\n     * Creates a clone of the lazy wrapper object.\n     *\n     * @private\n     * @name clone\n     * @memberOf LazyWrapper\n     * @returns {Object} Returns the cloned `LazyWrapper` object.\n     */\n    function lazyClone() {\n      var result = new LazyWrapper(this.__wrapped__);\n      result.__actions__ = copyArray(this.__actions__);\n      result.__dir__ = this.__dir__;\n      result.__filtered__ = this.__filtered__;\n      result.__iteratees__ = copyArray(this.__iteratees__);\n      result.__takeCount__ = this.__takeCount__;\n      result.__views__ = copyArray(this.__views__);\n      return result;\n    }\n\n    /**\n     * Reverses the direction of lazy iteration.\n     *\n     * @private\n     * @name reverse\n     * @memberOf LazyWrapper\n     * @returns {Object} Returns the new reversed `LazyWrapper` object.\n     */\n    function lazyReverse() {\n      if (this.__filtered__) {\n        var result = new LazyWrapper(this);\n        result.__dir__ = -1;\n        result.__filtered__ = true;\n      } else {\n        result = this.clone();\n        result.__dir__ *= -1;\n      }\n      return result;\n    }\n\n    /**\n     * Extracts the unwrapped value from its lazy wrapper.\n     *\n     * @private\n     * @name value\n     * @memberOf LazyWrapper\n     * @returns {*} Returns the unwrapped value.\n     */\n    function lazyValue() {\n      var array = this.__wrapped__.value(),\n          dir = this.__dir__,\n          isArr = isArray(array),\n          isRight = dir < 0,\n          arrLength = isArr ? array.length : 0,\n          view = getView(0, arrLength, this.__views__),\n          start = view.start,\n          end = view.end,\n          length = end - start,\n          index = isRight ? end : (start - 1),\n          iteratees = this.__iteratees__,\n          iterLength = iteratees.length,\n          resIndex = 0,\n          takeCount = nativeMin(length, this.__takeCount__);\n\n      if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n        return baseWrapperValue(array, this.__actions__);\n      }\n      var result = [];\n\n      outer:\n      while (length-- && resIndex < takeCount) {\n        index += dir;\n\n        var iterIndex = -1,\n            value = array[index];\n\n        while (++iterIndex < iterLength) {\n          var data = iteratees[iterIndex],\n              iteratee = data.iteratee,\n              type = data.type,\n              computed = iteratee(value);\n\n          if (type == LAZY_MAP_FLAG) {\n            value = computed;\n          } else if (!computed) {\n            if (type == LAZY_FILTER_FLAG) {\n              continue outer;\n            } else {\n              break outer;\n            }\n          }\n        }\n        result[resIndex++] = value;\n      }\n      return result;\n    }\n\n    // Ensure `LazyWrapper` is an instance of `baseLodash`.\n    LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n    LazyWrapper.prototype.constructor = LazyWrapper;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a hash object.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function Hash(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the hash.\n     *\n     * @private\n     * @name clear\n     * @memberOf Hash\n     */\n    function hashClear() {\n      this.__data__ = nativeCreate ? nativeCreate(null) : {};\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the hash.\n     *\n     * @private\n     * @name delete\n     * @memberOf Hash\n     * @param {Object} hash The hash to modify.\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function hashDelete(key) {\n      var result = this.has(key) && delete this.__data__[key];\n      this.size -= result ? 1 : 0;\n      return result;\n    }\n\n    /**\n     * Gets the hash value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf Hash\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function hashGet(key) {\n      var data = this.__data__;\n      if (nativeCreate) {\n        var result = data[key];\n        return result === HASH_UNDEFINED ? undefined : result;\n      }\n      return hasOwnProperty.call(data, key) ? data[key] : undefined;\n    }\n\n    /**\n     * Checks if a hash value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf Hash\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function hashHas(key) {\n      var data = this.__data__;\n      return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n    }\n\n    /**\n     * Sets the hash `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf Hash\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the hash instance.\n     */\n    function hashSet(key, value) {\n      var data = this.__data__;\n      this.size += this.has(key) ? 0 : 1;\n      data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n      return this;\n    }\n\n    // Add methods to `Hash`.\n    Hash.prototype.clear = hashClear;\n    Hash.prototype['delete'] = hashDelete;\n    Hash.prototype.get = hashGet;\n    Hash.prototype.has = hashHas;\n    Hash.prototype.set = hashSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an list cache object.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function ListCache(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the list cache.\n     *\n     * @private\n     * @name clear\n     * @memberOf ListCache\n     */\n    function listCacheClear() {\n      this.__data__ = [];\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the list cache.\n     *\n     * @private\n     * @name delete\n     * @memberOf ListCache\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function listCacheDelete(key) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      if (index < 0) {\n        return false;\n      }\n      var lastIndex = data.length - 1;\n      if (index == lastIndex) {\n        data.pop();\n      } else {\n        splice.call(data, index, 1);\n      }\n      --this.size;\n      return true;\n    }\n\n    /**\n     * Gets the list cache value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf ListCache\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function listCacheGet(key) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      return index < 0 ? undefined : data[index][1];\n    }\n\n    /**\n     * Checks if a list cache value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf ListCache\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function listCacheHas(key) {\n      return assocIndexOf(this.__data__, key) > -1;\n    }\n\n    /**\n     * Sets the list cache `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf ListCache\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the list cache instance.\n     */\n    function listCacheSet(key, value) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      if (index < 0) {\n        ++this.size;\n        data.push([key, value]);\n      } else {\n        data[index][1] = value;\n      }\n      return this;\n    }\n\n    // Add methods to `ListCache`.\n    ListCache.prototype.clear = listCacheClear;\n    ListCache.prototype['delete'] = listCacheDelete;\n    ListCache.prototype.get = listCacheGet;\n    ListCache.prototype.has = listCacheHas;\n    ListCache.prototype.set = listCacheSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a map cache object to store key-value pairs.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function MapCache(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the map.\n     *\n     * @private\n     * @name clear\n     * @memberOf MapCache\n     */\n    function mapCacheClear() {\n      this.size = 0;\n      this.__data__ = {\n        'hash': new Hash,\n        'map': new (Map || ListCache),\n        'string': new Hash\n      };\n    }\n\n    /**\n     * Removes `key` and its value from the map.\n     *\n     * @private\n     * @name delete\n     * @memberOf MapCache\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function mapCacheDelete(key) {\n      var result = getMapData(this, key)['delete'](key);\n      this.size -= result ? 1 : 0;\n      return result;\n    }\n\n    /**\n     * Gets the map value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf MapCache\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function mapCacheGet(key) {\n      return getMapData(this, key).get(key);\n    }\n\n    /**\n     * Checks if a map value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf MapCache\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function mapCacheHas(key) {\n      return getMapData(this, key).has(key);\n    }\n\n    /**\n     * Sets the map `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf MapCache\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the map cache instance.\n     */\n    function mapCacheSet(key, value) {\n      var data = getMapData(this, key),\n          size = data.size;\n\n      data.set(key, value);\n      this.size += data.size == size ? 0 : 1;\n      return this;\n    }\n\n    // Add methods to `MapCache`.\n    MapCache.prototype.clear = mapCacheClear;\n    MapCache.prototype['delete'] = mapCacheDelete;\n    MapCache.prototype.get = mapCacheGet;\n    MapCache.prototype.has = mapCacheHas;\n    MapCache.prototype.set = mapCacheSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     *\n     * Creates an array cache object to store unique values.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [values] The values to cache.\n     */\n    function SetCache(values) {\n      var index = -1,\n          length = values == null ? 0 : values.length;\n\n      this.__data__ = new MapCache;\n      while (++index < length) {\n        this.add(values[index]);\n      }\n    }\n\n    /**\n     * Adds `value` to the array cache.\n     *\n     * @private\n     * @name add\n     * @memberOf SetCache\n     * @alias push\n     * @param {*} value The value to cache.\n     * @returns {Object} Returns the cache instance.\n     */\n    function setCacheAdd(value) {\n      this.__data__.set(value, HASH_UNDEFINED);\n      return this;\n    }\n\n    /**\n     * Checks if `value` is in the array cache.\n     *\n     * @private\n     * @name has\n     * @memberOf SetCache\n     * @param {*} value The value to search for.\n     * @returns {number} Returns `true` if `value` is found, else `false`.\n     */\n    function setCacheHas(value) {\n      return this.__data__.has(value);\n    }\n\n    // Add methods to `SetCache`.\n    SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n    SetCache.prototype.has = setCacheHas;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a stack cache object to store key-value pairs.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function Stack(entries) {\n      var data = this.__data__ = new ListCache(entries);\n      this.size = data.size;\n    }\n\n    /**\n     * Removes all key-value entries from the stack.\n     *\n     * @private\n     * @name clear\n     * @memberOf Stack\n     */\n    function stackClear() {\n      this.__data__ = new ListCache;\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the stack.\n     *\n     * @private\n     * @name delete\n     * @memberOf Stack\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function stackDelete(key) {\n      var data = this.__data__,\n          result = data['delete'](key);\n\n      this.size = data.size;\n      return result;\n    }\n\n    /**\n     * Gets the stack value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf Stack\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function stackGet(key) {\n      return this.__data__.get(key);\n    }\n\n    /**\n     * Checks if a stack value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf Stack\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function stackHas(key) {\n      return this.__data__.has(key);\n    }\n\n    /**\n     * Sets the stack `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf Stack\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the stack cache instance.\n     */\n    function stackSet(key, value) {\n      var data = this.__data__;\n      if (data instanceof ListCache) {\n        var pairs = data.__data__;\n        if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n          pairs.push([key, value]);\n          this.size = ++data.size;\n          return this;\n        }\n        data = this.__data__ = new MapCache(pairs);\n      }\n      data.set(key, value);\n      this.size = data.size;\n      return this;\n    }\n\n    // Add methods to `Stack`.\n    Stack.prototype.clear = stackClear;\n    Stack.prototype['delete'] = stackDelete;\n    Stack.prototype.get = stackGet;\n    Stack.prototype.has = stackHas;\n    Stack.prototype.set = stackSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an array of the enumerable property names of the array-like `value`.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @param {boolean} inherited Specify returning inherited property names.\n     * @returns {Array} Returns the array of property names.\n     */\n    function arrayLikeKeys(value, inherited) {\n      var isArr = isArray(value),\n          isArg = !isArr && isArguments(value),\n          isBuff = !isArr && !isArg && isBuffer(value),\n          isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n          skipIndexes = isArr || isArg || isBuff || isType,\n          result = skipIndexes ? baseTimes(value.length, String) : [],\n          length = result.length;\n\n      for (var key in value) {\n        if ((inherited || hasOwnProperty.call(value, key)) &&\n            !(skipIndexes && (\n               // Safari 9 has enumerable `arguments.length` in strict mode.\n               key == 'length' ||\n               // Node.js 0.10 has enumerable non-index properties on buffers.\n               (isBuff && (key == 'offset' || key == 'parent')) ||\n               // PhantomJS 2 has enumerable non-index properties on typed arrays.\n               (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n               // Skip index properties.\n               isIndex(key, length)\n            ))) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * A specialized version of `_.sample` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to sample.\n     * @returns {*} Returns the random element.\n     */\n    function arraySample(array) {\n      var length = array.length;\n      return length ? array[baseRandom(0, length - 1)] : undefined;\n    }\n\n    /**\n     * A specialized version of `_.sampleSize` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to sample.\n     * @param {number} n The number of elements to sample.\n     * @returns {Array} Returns the random elements.\n     */\n    function arraySampleSize(array, n) {\n      return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n    }\n\n    /**\n     * A specialized version of `_.shuffle` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     */\n    function arrayShuffle(array) {\n      return shuffleSelf(copyArray(array));\n    }\n\n    /**\n     * This function is like `assignValue` except that it doesn't assign\n     * `undefined` values.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {string} key The key of the property to assign.\n     * @param {*} value The value to assign.\n     */\n    function assignMergeValue(object, key, value) {\n      if ((value !== undefined && !eq(object[key], value)) ||\n          (value === undefined && !(key in object))) {\n        baseAssignValue(object, key, value);\n      }\n    }\n\n    /**\n     * Assigns `value` to `key` of `object` if the existing value is not equivalent\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {string} key The key of the property to assign.\n     * @param {*} value The value to assign.\n     */\n    function assignValue(object, key, value) {\n      var objValue = object[key];\n      if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n          (value === undefined && !(key in object))) {\n        baseAssignValue(object, key, value);\n      }\n    }\n\n    /**\n     * Gets the index at which the `key` is found in `array` of key-value pairs.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {*} key The key to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     */\n    function assocIndexOf(array, key) {\n      var length = array.length;\n      while (length--) {\n        if (eq(array[length][0], key)) {\n          return length;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * Aggregates elements of `collection` on `accumulator` with keys transformed\n     * by `iteratee` and values set by `setter`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} setter The function to set `accumulator` values.\n     * @param {Function} iteratee The iteratee to transform keys.\n     * @param {Object} accumulator The initial aggregated object.\n     * @returns {Function} Returns `accumulator`.\n     */\n    function baseAggregator(collection, setter, iteratee, accumulator) {\n      baseEach(collection, function(value, key, collection) {\n        setter(accumulator, value, iteratee(value), collection);\n      });\n      return accumulator;\n    }\n\n    /**\n     * The base implementation of `_.assign` without support for multiple sources\n     * or `customizer` functions.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @returns {Object} Returns `object`.\n     */\n    function baseAssign(object, source) {\n      return object && copyObject(source, keys(source), object);\n    }\n\n    /**\n     * The base implementation of `_.assignIn` without support for multiple sources\n     * or `customizer` functions.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @returns {Object} Returns `object`.\n     */\n    function baseAssignIn(object, source) {\n      return object && copyObject(source, keysIn(source), object);\n    }\n\n    /**\n     * The base implementation of `assignValue` and `assignMergeValue` without\n     * value checks.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {string} key The key of the property to assign.\n     * @param {*} value The value to assign.\n     */\n    function baseAssignValue(object, key, value) {\n      if (key == '__proto__' && defineProperty) {\n        defineProperty(object, key, {\n          'configurable': true,\n          'enumerable': true,\n          'value': value,\n          'writable': true\n        });\n      } else {\n        object[key] = value;\n      }\n    }\n\n    /**\n     * The base implementation of `_.at` without support for individual paths.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {string[]} paths The property paths to pick.\n     * @returns {Array} Returns the picked elements.\n     */\n    function baseAt(object, paths) {\n      var index = -1,\n          length = paths.length,\n          result = Array(length),\n          skip = object == null;\n\n      while (++index < length) {\n        result[index] = skip ? undefined : get(object, paths[index]);\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.clamp` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {number} number The number to clamp.\n     * @param {number} [lower] The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the clamped number.\n     */\n    function baseClamp(number, lower, upper) {\n      if (number === number) {\n        if (upper !== undefined) {\n          number = number <= upper ? number : upper;\n        }\n        if (lower !== undefined) {\n          number = number >= lower ? number : lower;\n        }\n      }\n      return number;\n    }\n\n    /**\n     * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n     * traversed objects.\n     *\n     * @private\n     * @param {*} value The value to clone.\n     * @param {boolean} bitmask The bitmask flags.\n     *  1 - Deep clone\n     *  2 - Flatten inherited properties\n     *  4 - Clone symbols\n     * @param {Function} [customizer] The function to customize cloning.\n     * @param {string} [key] The key of `value`.\n     * @param {Object} [object] The parent object of `value`.\n     * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n     * @returns {*} Returns the cloned value.\n     */\n    function baseClone(value, bitmask, customizer, key, object, stack) {\n      var result,\n          isDeep = bitmask & CLONE_DEEP_FLAG,\n          isFlat = bitmask & CLONE_FLAT_FLAG,\n          isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n      if (customizer) {\n        result = object ? customizer(value, key, object, stack) : customizer(value);\n      }\n      if (result !== undefined) {\n        return result;\n      }\n      if (!isObject(value)) {\n        return value;\n      }\n      var isArr = isArray(value);\n      if (isArr) {\n        result = initCloneArray(value);\n        if (!isDeep) {\n          return copyArray(value, result);\n        }\n      } else {\n        var tag = getTag(value),\n            isFunc = tag == funcTag || tag == genTag;\n\n        if (isBuffer(value)) {\n          return cloneBuffer(value, isDeep);\n        }\n        if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n          result = (isFlat || isFunc) ? {} : initCloneObject(value);\n          if (!isDeep) {\n            return isFlat\n              ? copySymbolsIn(value, baseAssignIn(result, value))\n              : copySymbols(value, baseAssign(result, value));\n          }\n        } else {\n          if (!cloneableTags[tag]) {\n            return object ? value : {};\n          }\n          result = initCloneByTag(value, tag, isDeep);\n        }\n      }\n      // Check for circular references and return its corresponding clone.\n      stack || (stack = new Stack);\n      var stacked = stack.get(value);\n      if (stacked) {\n        return stacked;\n      }\n      stack.set(value, result);\n\n      if (isSet(value)) {\n        value.forEach(function(subValue) {\n          result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n        });\n      } else if (isMap(value)) {\n        value.forEach(function(subValue, key) {\n          result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n        });\n      }\n\n      var keysFunc = isFull\n        ? (isFlat ? getAllKeysIn : getAllKeys)\n        : (isFlat ? keysIn : keys);\n\n      var props = isArr ? undefined : keysFunc(value);\n      arrayEach(props || value, function(subValue, key) {\n        if (props) {\n          key = subValue;\n          subValue = value[key];\n        }\n        // Recursively populate clone (susceptible to call stack limits).\n        assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.conforms` which doesn't clone `source`.\n     *\n     * @private\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseConforms(source) {\n      var props = keys(source);\n      return function(object) {\n        return baseConformsTo(object, source, props);\n      };\n    }\n\n    /**\n     * The base implementation of `_.conformsTo` which accepts `props` to check.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n     */\n    function baseConformsTo(object, source, props) {\n      var length = props.length;\n      if (object == null) {\n        return !length;\n      }\n      object = Object(object);\n      while (length--) {\n        var key = props[length],\n            predicate = source[key],\n            value = object[key];\n\n        if ((value === undefined && !(key in object)) || !predicate(value)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    /**\n     * The base implementation of `_.delay` and `_.defer` which accepts `args`\n     * to provide to `func`.\n     *\n     * @private\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @param {Array} args The arguments to provide to `func`.\n     * @returns {number|Object} Returns the timer id or timeout object.\n     */\n    function baseDelay(func, wait, args) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      return setTimeout(function() { func.apply(undefined, args); }, wait);\n    }\n\n    /**\n     * The base implementation of methods like `_.difference` without support\n     * for excluding multiple arrays or iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Array} values The values to exclude.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     */\n    function baseDifference(array, values, iteratee, comparator) {\n      var index = -1,\n          includes = arrayIncludes,\n          isCommon = true,\n          length = array.length,\n          result = [],\n          valuesLength = values.length;\n\n      if (!length) {\n        return result;\n      }\n      if (iteratee) {\n        values = arrayMap(values, baseUnary(iteratee));\n      }\n      if (comparator) {\n        includes = arrayIncludesWith;\n        isCommon = false;\n      }\n      else if (values.length >= LARGE_ARRAY_SIZE) {\n        includes = cacheHas;\n        isCommon = false;\n        values = new SetCache(values);\n      }\n      outer:\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee == null ? value : iteratee(value);\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (isCommon && computed === computed) {\n          var valuesIndex = valuesLength;\n          while (valuesIndex--) {\n            if (values[valuesIndex] === computed) {\n              continue outer;\n            }\n          }\n          result.push(value);\n        }\n        else if (!includes(values, computed, comparator)) {\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.forEach` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     */\n    var baseEach = createBaseEach(baseForOwn);\n\n    /**\n     * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     */\n    var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n    /**\n     * The base implementation of `_.every` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {boolean} Returns `true` if all elements pass the predicate check,\n     *  else `false`\n     */\n    function baseEvery(collection, predicate) {\n      var result = true;\n      baseEach(collection, function(value, index, collection) {\n        result = !!predicate(value, index, collection);\n        return result;\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of methods like `_.max` and `_.min` which accepts a\n     * `comparator` to determine the extremum value.\n     *\n     * @private\n     * @param {Array} array The array to iterate over.\n     * @param {Function} iteratee The iteratee invoked per iteration.\n     * @param {Function} comparator The comparator used to compare values.\n     * @returns {*} Returns the extremum value.\n     */\n    function baseExtremum(array, iteratee, comparator) {\n      var index = -1,\n          length = array.length;\n\n      while (++index < length) {\n        var value = array[index],\n            current = iteratee(value);\n\n        if (current != null && (computed === undefined\n              ? (current === current && !isSymbol(current))\n              : comparator(current, computed)\n            )) {\n          var computed = current,\n              result = value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.fill` without an iteratee call guard.\n     *\n     * @private\n     * @param {Array} array The array to fill.\n     * @param {*} value The value to fill `array` with.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns `array`.\n     */\n    function baseFill(array, value, start, end) {\n      var length = array.length;\n\n      start = toInteger(start);\n      if (start < 0) {\n        start = -start > length ? 0 : (length + start);\n      }\n      end = (end === undefined || end > length) ? length : toInteger(end);\n      if (end < 0) {\n        end += length;\n      }\n      end = start > end ? 0 : toLength(end);\n      while (start < end) {\n        array[start++] = value;\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.filter` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     */\n    function baseFilter(collection, predicate) {\n      var result = [];\n      baseEach(collection, function(value, index, collection) {\n        if (predicate(value, index, collection)) {\n          result.push(value);\n        }\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.flatten` with support for restricting flattening.\n     *\n     * @private\n     * @param {Array} array The array to flatten.\n     * @param {number} depth The maximum recursion depth.\n     * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n     * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n     * @param {Array} [result=[]] The initial result value.\n     * @returns {Array} Returns the new flattened array.\n     */\n    function baseFlatten(array, depth, predicate, isStrict, result) {\n      var index = -1,\n          length = array.length;\n\n      predicate || (predicate = isFlattenable);\n      result || (result = []);\n\n      while (++index < length) {\n        var value = array[index];\n        if (depth > 0 && predicate(value)) {\n          if (depth > 1) {\n            // Recursively flatten arrays (susceptible to call stack limits).\n            baseFlatten(value, depth - 1, predicate, isStrict, result);\n          } else {\n            arrayPush(result, value);\n          }\n        } else if (!isStrict) {\n          result[result.length] = value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `baseForOwn` which iterates over `object`\n     * properties returned by `keysFunc` and invokes `iteratee` for each property.\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @returns {Object} Returns `object`.\n     */\n    var baseFor = createBaseFor();\n\n    /**\n     * This function is like `baseFor` except that it iterates over properties\n     * in the opposite order.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @returns {Object} Returns `object`.\n     */\n    var baseForRight = createBaseFor(true);\n\n    /**\n     * The base implementation of `_.forOwn` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     */\n    function baseForOwn(object, iteratee) {\n      return object && baseFor(object, iteratee, keys);\n    }\n\n    /**\n     * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     */\n    function baseForOwnRight(object, iteratee) {\n      return object && baseForRight(object, iteratee, keys);\n    }\n\n    /**\n     * The base implementation of `_.functions` which creates an array of\n     * `object` function property names filtered from `props`.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Array} props The property names to filter.\n     * @returns {Array} Returns the function names.\n     */\n    function baseFunctions(object, props) {\n      return arrayFilter(props, function(key) {\n        return isFunction(object[key]);\n      });\n    }\n\n    /**\n     * The base implementation of `_.get` without support for default values.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to get.\n     * @returns {*} Returns the resolved value.\n     */\n    function baseGet(object, path) {\n      path = castPath(path, object);\n\n      var index = 0,\n          length = path.length;\n\n      while (object != null && index < length) {\n        object = object[toKey(path[index++])];\n      }\n      return (index && index == length) ? object : undefined;\n    }\n\n    /**\n     * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n     * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n     * symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @param {Function} symbolsFunc The function to get the symbols of `object`.\n     * @returns {Array} Returns the array of property names and symbols.\n     */\n    function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n      var result = keysFunc(object);\n      return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n    }\n\n    /**\n     * The base implementation of `getTag` without fallbacks for buggy environments.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the `toStringTag`.\n     */\n    function baseGetTag(value) {\n      if (value == null) {\n        return value === undefined ? undefinedTag : nullTag;\n      }\n      return (symToStringTag && symToStringTag in Object(value))\n        ? getRawTag(value)\n        : objectToString(value);\n    }\n\n    /**\n     * The base implementation of `_.gt` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than `other`,\n     *  else `false`.\n     */\n    function baseGt(value, other) {\n      return value > other;\n    }\n\n    /**\n     * The base implementation of `_.has` without support for deep paths.\n     *\n     * @private\n     * @param {Object} [object] The object to query.\n     * @param {Array|string} key The key to check.\n     * @returns {boolean} Returns `true` if `key` exists, else `false`.\n     */\n    function baseHas(object, key) {\n      return object != null && hasOwnProperty.call(object, key);\n    }\n\n    /**\n     * The base implementation of `_.hasIn` without support for deep paths.\n     *\n     * @private\n     * @param {Object} [object] The object to query.\n     * @param {Array|string} key The key to check.\n     * @returns {boolean} Returns `true` if `key` exists, else `false`.\n     */\n    function baseHasIn(object, key) {\n      return object != null && key in Object(object);\n    }\n\n    /**\n     * The base implementation of `_.inRange` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {number} number The number to check.\n     * @param {number} start The start of the range.\n     * @param {number} end The end of the range.\n     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n     */\n    function baseInRange(number, start, end) {\n      return number >= nativeMin(start, end) && number < nativeMax(start, end);\n    }\n\n    /**\n     * The base implementation of methods like `_.intersection`, without support\n     * for iteratee shorthands, that accepts an array of arrays to inspect.\n     *\n     * @private\n     * @param {Array} arrays The arrays to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of shared values.\n     */\n    function baseIntersection(arrays, iteratee, comparator) {\n      var includes = comparator ? arrayIncludesWith : arrayIncludes,\n          length = arrays[0].length,\n          othLength = arrays.length,\n          othIndex = othLength,\n          caches = Array(othLength),\n          maxLength = Infinity,\n          result = [];\n\n      while (othIndex--) {\n        var array = arrays[othIndex];\n        if (othIndex && iteratee) {\n          array = arrayMap(array, baseUnary(iteratee));\n        }\n        maxLength = nativeMin(array.length, maxLength);\n        caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n          ? new SetCache(othIndex && array)\n          : undefined;\n      }\n      array = arrays[0];\n\n      var index = -1,\n          seen = caches[0];\n\n      outer:\n      while (++index < length && result.length < maxLength) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (!(seen\n              ? cacheHas(seen, computed)\n              : includes(result, computed, comparator)\n            )) {\n          othIndex = othLength;\n          while (--othIndex) {\n            var cache = caches[othIndex];\n            if (!(cache\n                  ? cacheHas(cache, computed)\n                  : includes(arrays[othIndex], computed, comparator))\n                ) {\n              continue outer;\n            }\n          }\n          if (seen) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.invert` and `_.invertBy` which inverts\n     * `object` with values transformed by `iteratee` and set by `setter`.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} setter The function to set `accumulator` values.\n     * @param {Function} iteratee The iteratee to transform values.\n     * @param {Object} accumulator The initial inverted object.\n     * @returns {Function} Returns `accumulator`.\n     */\n    function baseInverter(object, setter, iteratee, accumulator) {\n      baseForOwn(object, function(value, key, object) {\n        setter(accumulator, iteratee(value), key, object);\n      });\n      return accumulator;\n    }\n\n    /**\n     * The base implementation of `_.invoke` without support for individual\n     * method arguments.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {Array} args The arguments to invoke the method with.\n     * @returns {*} Returns the result of the invoked method.\n     */\n    function baseInvoke(object, path, args) {\n      path = castPath(path, object);\n      object = parent(object, path);\n      var func = object == null ? object : object[toKey(last(path))];\n      return func == null ? undefined : apply(func, object, args);\n    }\n\n    /**\n     * The base implementation of `_.isArguments`.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n     */\n    function baseIsArguments(value) {\n      return isObjectLike(value) && baseGetTag(value) == argsTag;\n    }\n\n    /**\n     * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n     */\n    function baseIsArrayBuffer(value) {\n      return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n    }\n\n    /**\n     * The base implementation of `_.isDate` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n     */\n    function baseIsDate(value) {\n      return isObjectLike(value) && baseGetTag(value) == dateTag;\n    }\n\n    /**\n     * The base implementation of `_.isEqual` which supports partial comparisons\n     * and tracks traversed objects.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @param {boolean} bitmask The bitmask flags.\n     *  1 - Unordered comparison\n     *  2 - Partial comparison\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     */\n    function baseIsEqual(value, other, bitmask, customizer, stack) {\n      if (value === other) {\n        return true;\n      }\n      if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n        return value !== value && other !== other;\n      }\n      return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n    }\n\n    /**\n     * A specialized version of `baseIsEqual` for arrays and objects which performs\n     * deep comparisons and tracks traversed objects enabling objects with circular\n     * references to be compared.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n      var objIsArr = isArray(object),\n          othIsArr = isArray(other),\n          objTag = objIsArr ? arrayTag : getTag(object),\n          othTag = othIsArr ? arrayTag : getTag(other);\n\n      objTag = objTag == argsTag ? objectTag : objTag;\n      othTag = othTag == argsTag ? objectTag : othTag;\n\n      var objIsObj = objTag == objectTag,\n          othIsObj = othTag == objectTag,\n          isSameTag = objTag == othTag;\n\n      if (isSameTag && isBuffer(object)) {\n        if (!isBuffer(other)) {\n          return false;\n        }\n        objIsArr = true;\n        objIsObj = false;\n      }\n      if (isSameTag && !objIsObj) {\n        stack || (stack = new Stack);\n        return (objIsArr || isTypedArray(object))\n          ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n          : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n      }\n      if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n        var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n            othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n        if (objIsWrapped || othIsWrapped) {\n          var objUnwrapped = objIsWrapped ? object.value() : object,\n              othUnwrapped = othIsWrapped ? other.value() : other;\n\n          stack || (stack = new Stack);\n          return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n        }\n      }\n      if (!isSameTag) {\n        return false;\n      }\n      stack || (stack = new Stack);\n      return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n    }\n\n    /**\n     * The base implementation of `_.isMap` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n     */\n    function baseIsMap(value) {\n      return isObjectLike(value) && getTag(value) == mapTag;\n    }\n\n    /**\n     * The base implementation of `_.isMatch` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @param {Array} matchData The property names, values, and compare flags to match.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     */\n    function baseIsMatch(object, source, matchData, customizer) {\n      var index = matchData.length,\n          length = index,\n          noCustomizer = !customizer;\n\n      if (object == null) {\n        return !length;\n      }\n      object = Object(object);\n      while (index--) {\n        var data = matchData[index];\n        if ((noCustomizer && data[2])\n              ? data[1] !== object[data[0]]\n              : !(data[0] in object)\n            ) {\n          return false;\n        }\n      }\n      while (++index < length) {\n        data = matchData[index];\n        var key = data[0],\n            objValue = object[key],\n            srcValue = data[1];\n\n        if (noCustomizer && data[2]) {\n          if (objValue === undefined && !(key in object)) {\n            return false;\n          }\n        } else {\n          var stack = new Stack;\n          if (customizer) {\n            var result = customizer(objValue, srcValue, key, object, source, stack);\n          }\n          if (!(result === undefined\n                ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n                : result\n              )) {\n            return false;\n          }\n        }\n      }\n      return true;\n    }\n\n    /**\n     * The base implementation of `_.isNative` without bad shim checks.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a native function,\n     *  else `false`.\n     */\n    function baseIsNative(value) {\n      if (!isObject(value) || isMasked(value)) {\n        return false;\n      }\n      var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n      return pattern.test(toSource(value));\n    }\n\n    /**\n     * The base implementation of `_.isRegExp` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n     */\n    function baseIsRegExp(value) {\n      return isObjectLike(value) && baseGetTag(value) == regexpTag;\n    }\n\n    /**\n     * The base implementation of `_.isSet` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n     */\n    function baseIsSet(value) {\n      return isObjectLike(value) && getTag(value) == setTag;\n    }\n\n    /**\n     * The base implementation of `_.isTypedArray` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n     */\n    function baseIsTypedArray(value) {\n      return isObjectLike(value) &&\n        isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n    }\n\n    /**\n     * The base implementation of `_.iteratee`.\n     *\n     * @private\n     * @param {*} [value=_.identity] The value to convert to an iteratee.\n     * @returns {Function} Returns the iteratee.\n     */\n    function baseIteratee(value) {\n      // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n      // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n      if (typeof value == 'function') {\n        return value;\n      }\n      if (value == null) {\n        return identity;\n      }\n      if (typeof value == 'object') {\n        return isArray(value)\n          ? baseMatchesProperty(value[0], value[1])\n          : baseMatches(value);\n      }\n      return property(value);\n    }\n\n    /**\n     * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     */\n    function baseKeys(object) {\n      if (!isPrototype(object)) {\n        return nativeKeys(object);\n      }\n      var result = [];\n      for (var key in Object(object)) {\n        if (hasOwnProperty.call(object, key) && key != 'constructor') {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     */\n    function baseKeysIn(object) {\n      if (!isObject(object)) {\n        return nativeKeysIn(object);\n      }\n      var isProto = isPrototype(object),\n          result = [];\n\n      for (var key in object) {\n        if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.lt` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than `other`,\n     *  else `false`.\n     */\n    function baseLt(value, other) {\n      return value < other;\n    }\n\n    /**\n     * The base implementation of `_.map` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array} Returns the new mapped array.\n     */\n    function baseMap(collection, iteratee) {\n      var index = -1,\n          result = isArrayLike(collection) ? Array(collection.length) : [];\n\n      baseEach(collection, function(value, key, collection) {\n        result[++index] = iteratee(value, key, collection);\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.matches` which doesn't clone `source`.\n     *\n     * @private\n     * @param {Object} source The object of property values to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseMatches(source) {\n      var matchData = getMatchData(source);\n      if (matchData.length == 1 && matchData[0][2]) {\n        return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n      }\n      return function(object) {\n        return object === source || baseIsMatch(object, source, matchData);\n      };\n    }\n\n    /**\n     * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n     *\n     * @private\n     * @param {string} path The path of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseMatchesProperty(path, srcValue) {\n      if (isKey(path) && isStrictComparable(srcValue)) {\n        return matchesStrictComparable(toKey(path), srcValue);\n      }\n      return function(object) {\n        var objValue = get(object, path);\n        return (objValue === undefined && objValue === srcValue)\n          ? hasIn(object, path)\n          : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n      };\n    }\n\n    /**\n     * The base implementation of `_.merge` without support for multiple sources.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @param {number} srcIndex The index of `source`.\n     * @param {Function} [customizer] The function to customize merged values.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     */\n    function baseMerge(object, source, srcIndex, customizer, stack) {\n      if (object === source) {\n        return;\n      }\n      baseFor(source, function(srcValue, key) {\n        stack || (stack = new Stack);\n        if (isObject(srcValue)) {\n          baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n        }\n        else {\n          var newValue = customizer\n            ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n            : undefined;\n\n          if (newValue === undefined) {\n            newValue = srcValue;\n          }\n          assignMergeValue(object, key, newValue);\n        }\n      }, keysIn);\n    }\n\n    /**\n     * A specialized version of `baseMerge` for arrays and objects which performs\n     * deep merges and tracks traversed objects enabling objects with circular\n     * references to be merged.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @param {string} key The key of the value to merge.\n     * @param {number} srcIndex The index of `source`.\n     * @param {Function} mergeFunc The function to merge values.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     */\n    function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n      var objValue = safeGet(object, key),\n          srcValue = safeGet(source, key),\n          stacked = stack.get(srcValue);\n\n      if (stacked) {\n        assignMergeValue(object, key, stacked);\n        return;\n      }\n      var newValue = customizer\n        ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n        : undefined;\n\n      var isCommon = newValue === undefined;\n\n      if (isCommon) {\n        var isArr = isArray(srcValue),\n            isBuff = !isArr && isBuffer(srcValue),\n            isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n        newValue = srcValue;\n        if (isArr || isBuff || isTyped) {\n          if (isArray(objValue)) {\n            newValue = objValue;\n          }\n          else if (isArrayLikeObject(objValue)) {\n            newValue = copyArray(objValue);\n          }\n          else if (isBuff) {\n            isCommon = false;\n            newValue = cloneBuffer(srcValue, true);\n          }\n          else if (isTyped) {\n            isCommon = false;\n            newValue = cloneTypedArray(srcValue, true);\n          }\n          else {\n            newValue = [];\n          }\n        }\n        else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n          newValue = objValue;\n          if (isArguments(objValue)) {\n            newValue = toPlainObject(objValue);\n          }\n          else if (!isObject(objValue) || isFunction(objValue)) {\n            newValue = initCloneObject(srcValue);\n          }\n        }\n        else {\n          isCommon = false;\n        }\n      }\n      if (isCommon) {\n        // Recursively merge objects and arrays (susceptible to call stack limits).\n        stack.set(srcValue, newValue);\n        mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n        stack['delete'](srcValue);\n      }\n      assignMergeValue(object, key, newValue);\n    }\n\n    /**\n     * The base implementation of `_.nth` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {Array} array The array to query.\n     * @param {number} n The index of the element to return.\n     * @returns {*} Returns the nth element of `array`.\n     */\n    function baseNth(array, n) {\n      var length = array.length;\n      if (!length) {\n        return;\n      }\n      n += n < 0 ? length : 0;\n      return isIndex(n, length) ? array[n] : undefined;\n    }\n\n    /**\n     * The base implementation of `_.orderBy` without param guards.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n     * @param {string[]} orders The sort orders of `iteratees`.\n     * @returns {Array} Returns the new sorted array.\n     */\n    function baseOrderBy(collection, iteratees, orders) {\n      var index = -1;\n      iteratees = arrayMap(iteratees.length ? iteratees : [identity], baseUnary(getIteratee()));\n\n      var result = baseMap(collection, function(value, key, collection) {\n        var criteria = arrayMap(iteratees, function(iteratee) {\n          return iteratee(value);\n        });\n        return { 'criteria': criteria, 'index': ++index, 'value': value };\n      });\n\n      return baseSortBy(result, function(object, other) {\n        return compareMultiple(object, other, orders);\n      });\n    }\n\n    /**\n     * The base implementation of `_.pick` without support for individual\n     * property identifiers.\n     *\n     * @private\n     * @param {Object} object The source object.\n     * @param {string[]} paths The property paths to pick.\n     * @returns {Object} Returns the new object.\n     */\n    function basePick(object, paths) {\n      return basePickBy(object, paths, function(value, path) {\n        return hasIn(object, path);\n      });\n    }\n\n    /**\n     * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The source object.\n     * @param {string[]} paths The property paths to pick.\n     * @param {Function} predicate The function invoked per property.\n     * @returns {Object} Returns the new object.\n     */\n    function basePickBy(object, paths, predicate) {\n      var index = -1,\n          length = paths.length,\n          result = {};\n\n      while (++index < length) {\n        var path = paths[index],\n            value = baseGet(object, path);\n\n        if (predicate(value, path)) {\n          baseSet(result, castPath(path, object), value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * A specialized version of `baseProperty` which supports deep paths.\n     *\n     * @private\n     * @param {Array|string} path The path of the property to get.\n     * @returns {Function} Returns the new accessor function.\n     */\n    function basePropertyDeep(path) {\n      return function(object) {\n        return baseGet(object, path);\n      };\n    }\n\n    /**\n     * The base implementation of `_.pullAllBy` without support for iteratee\n     * shorthands.\n     *\n     * @private\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns `array`.\n     */\n    function basePullAll(array, values, iteratee, comparator) {\n      var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n          index = -1,\n          length = values.length,\n          seen = array;\n\n      if (array === values) {\n        values = copyArray(values);\n      }\n      if (iteratee) {\n        seen = arrayMap(array, baseUnary(iteratee));\n      }\n      while (++index < length) {\n        var fromIndex = 0,\n            value = values[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n          if (seen !== array) {\n            splice.call(seen, fromIndex, 1);\n          }\n          splice.call(array, fromIndex, 1);\n        }\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.pullAt` without support for individual\n     * indexes or capturing the removed elements.\n     *\n     * @private\n     * @param {Array} array The array to modify.\n     * @param {number[]} indexes The indexes of elements to remove.\n     * @returns {Array} Returns `array`.\n     */\n    function basePullAt(array, indexes) {\n      var length = array ? indexes.length : 0,\n          lastIndex = length - 1;\n\n      while (length--) {\n        var index = indexes[length];\n        if (length == lastIndex || index !== previous) {\n          var previous = index;\n          if (isIndex(index)) {\n            splice.call(array, index, 1);\n          } else {\n            baseUnset(array, index);\n          }\n        }\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.random` without support for returning\n     * floating-point numbers.\n     *\n     * @private\n     * @param {number} lower The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the random number.\n     */\n    function baseRandom(lower, upper) {\n      return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n    }\n\n    /**\n     * The base implementation of `_.range` and `_.rangeRight` which doesn't\n     * coerce arguments.\n     *\n     * @private\n     * @param {number} start The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} step The value to increment or decrement by.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Array} Returns the range of numbers.\n     */\n    function baseRange(start, end, step, fromRight) {\n      var index = -1,\n          length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n          result = Array(length);\n\n      while (length--) {\n        result[fromRight ? length : ++index] = start;\n        start += step;\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.repeat` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {string} string The string to repeat.\n     * @param {number} n The number of times to repeat the string.\n     * @returns {string} Returns the repeated string.\n     */\n    function baseRepeat(string, n) {\n      var result = '';\n      if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n        return result;\n      }\n      // Leverage the exponentiation by squaring algorithm for a faster repeat.\n      // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n      do {\n        if (n % 2) {\n          result += string;\n        }\n        n = nativeFloor(n / 2);\n        if (n) {\n          string += string;\n        }\n      } while (n);\n\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n     *\n     * @private\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @returns {Function} Returns the new function.\n     */\n    function baseRest(func, start) {\n      return setToString(overRest(func, start, identity), func + '');\n    }\n\n    /**\n     * The base implementation of `_.sample`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to sample.\n     * @returns {*} Returns the random element.\n     */\n    function baseSample(collection) {\n      return arraySample(values(collection));\n    }\n\n    /**\n     * The base implementation of `_.sampleSize` without param guards.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to sample.\n     * @param {number} n The number of elements to sample.\n     * @returns {Array} Returns the random elements.\n     */\n    function baseSampleSize(collection, n) {\n      var array = values(collection);\n      return shuffleSelf(array, baseClamp(n, 0, array.length));\n    }\n\n    /**\n     * The base implementation of `_.set`.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {*} value The value to set.\n     * @param {Function} [customizer] The function to customize path creation.\n     * @returns {Object} Returns `object`.\n     */\n    function baseSet(object, path, value, customizer) {\n      if (!isObject(object)) {\n        return object;\n      }\n      path = castPath(path, object);\n\n      var index = -1,\n          length = path.length,\n          lastIndex = length - 1,\n          nested = object;\n\n      while (nested != null && ++index < length) {\n        var key = toKey(path[index]),\n            newValue = value;\n\n        if (index != lastIndex) {\n          var objValue = nested[key];\n          newValue = customizer ? customizer(objValue, key, nested) : undefined;\n          if (newValue === undefined) {\n            newValue = isObject(objValue)\n              ? objValue\n              : (isIndex(path[index + 1]) ? [] : {});\n          }\n        }\n        assignValue(nested, key, newValue);\n        nested = nested[key];\n      }\n      return object;\n    }\n\n    /**\n     * The base implementation of `setData` without support for hot loop shorting.\n     *\n     * @private\n     * @param {Function} func The function to associate metadata with.\n     * @param {*} data The metadata.\n     * @returns {Function} Returns `func`.\n     */\n    var baseSetData = !metaMap ? identity : function(func, data) {\n      metaMap.set(func, data);\n      return func;\n    };\n\n    /**\n     * The base implementation of `setToString` without support for hot loop shorting.\n     *\n     * @private\n     * @param {Function} func The function to modify.\n     * @param {Function} string The `toString` result.\n     * @returns {Function} Returns `func`.\n     */\n    var baseSetToString = !defineProperty ? identity : function(func, string) {\n      return defineProperty(func, 'toString', {\n        'configurable': true,\n        'enumerable': false,\n        'value': constant(string),\n        'writable': true\n      });\n    };\n\n    /**\n     * The base implementation of `_.shuffle`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     */\n    function baseShuffle(collection) {\n      return shuffleSelf(values(collection));\n    }\n\n    /**\n     * The base implementation of `_.slice` without an iteratee call guard.\n     *\n     * @private\n     * @param {Array} array The array to slice.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function baseSlice(array, start, end) {\n      var index = -1,\n          length = array.length;\n\n      if (start < 0) {\n        start = -start > length ? 0 : (length + start);\n      }\n      end = end > length ? length : end;\n      if (end < 0) {\n        end += length;\n      }\n      length = start > end ? 0 : ((end - start) >>> 0);\n      start >>>= 0;\n\n      var result = Array(length);\n      while (++index < length) {\n        result[index] = array[index + start];\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.some` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {boolean} Returns `true` if any element passes the predicate check,\n     *  else `false`.\n     */\n    function baseSome(collection, predicate) {\n      var result;\n\n      baseEach(collection, function(value, index, collection) {\n        result = predicate(value, index, collection);\n        return !result;\n      });\n      return !!result;\n    }\n\n    /**\n     * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n     * performs a binary search of `array` to determine the index at which `value`\n     * should be inserted into `array` in order to maintain its sort order.\n     *\n     * @private\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {boolean} [retHighest] Specify returning the highest qualified index.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     */\n    function baseSortedIndex(array, value, retHighest) {\n      var low = 0,\n          high = array == null ? low : array.length;\n\n      if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n        while (low < high) {\n          var mid = (low + high) >>> 1,\n              computed = array[mid];\n\n          if (computed !== null && !isSymbol(computed) &&\n              (retHighest ? (computed <= value) : (computed < value))) {\n            low = mid + 1;\n          } else {\n            high = mid;\n          }\n        }\n        return high;\n      }\n      return baseSortedIndexBy(array, value, identity, retHighest);\n    }\n\n    /**\n     * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n     * which invokes `iteratee` for `value` and each element of `array` to compute\n     * their sort ranking. The iteratee is invoked with one argument; (value).\n     *\n     * @private\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} iteratee The iteratee invoked per element.\n     * @param {boolean} [retHighest] Specify returning the highest qualified index.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     */\n    function baseSortedIndexBy(array, value, iteratee, retHighest) {\n      value = iteratee(value);\n\n      var low = 0,\n          high = array == null ? 0 : array.length,\n          valIsNaN = value !== value,\n          valIsNull = value === null,\n          valIsSymbol = isSymbol(value),\n          valIsUndefined = value === undefined;\n\n      while (low < high) {\n        var mid = nativeFloor((low + high) / 2),\n            computed = iteratee(array[mid]),\n            othIsDefined = computed !== undefined,\n            othIsNull = computed === null,\n            othIsReflexive = computed === computed,\n            othIsSymbol = isSymbol(computed);\n\n        if (valIsNaN) {\n          var setLow = retHighest || othIsReflexive;\n        } else if (valIsUndefined) {\n          setLow = othIsReflexive && (retHighest || othIsDefined);\n        } else if (valIsNull) {\n          setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n        } else if (valIsSymbol) {\n          setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n        } else if (othIsNull || othIsSymbol) {\n          setLow = false;\n        } else {\n          setLow = retHighest ? (computed <= value) : (computed < value);\n        }\n        if (setLow) {\n          low = mid + 1;\n        } else {\n          high = mid;\n        }\n      }\n      return nativeMin(high, MAX_ARRAY_INDEX);\n    }\n\n    /**\n     * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n     * support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     */\n    function baseSortedUniq(array, iteratee) {\n      var index = -1,\n          length = array.length,\n          resIndex = 0,\n          result = [];\n\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        if (!index || !eq(computed, seen)) {\n          var seen = computed;\n          result[resIndex++] = value === 0 ? 0 : value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.toNumber` which doesn't ensure correct\n     * conversions of binary, hexadecimal, or octal string values.\n     *\n     * @private\n     * @param {*} value The value to process.\n     * @returns {number} Returns the number.\n     */\n    function baseToNumber(value) {\n      if (typeof value == 'number') {\n        return value;\n      }\n      if (isSymbol(value)) {\n        return NAN;\n      }\n      return +value;\n    }\n\n    /**\n     * The base implementation of `_.toString` which doesn't convert nullish\n     * values to empty strings.\n     *\n     * @private\n     * @param {*} value The value to process.\n     * @returns {string} Returns the string.\n     */\n    function baseToString(value) {\n      // Exit early for strings to avoid a performance hit in some environments.\n      if (typeof value == 'string') {\n        return value;\n      }\n      if (isArray(value)) {\n        // Recursively convert values (susceptible to call stack limits).\n        return arrayMap(value, baseToString) + '';\n      }\n      if (isSymbol(value)) {\n        return symbolToString ? symbolToString.call(value) : '';\n      }\n      var result = (value + '');\n      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n    }\n\n    /**\n     * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     */\n    function baseUniq(array, iteratee, comparator) {\n      var index = -1,\n          includes = arrayIncludes,\n          length = array.length,\n          isCommon = true,\n          result = [],\n          seen = result;\n\n      if (comparator) {\n        isCommon = false;\n        includes = arrayIncludesWith;\n      }\n      else if (length >= LARGE_ARRAY_SIZE) {\n        var set = iteratee ? null : createSet(array);\n        if (set) {\n          return setToArray(set);\n        }\n        isCommon = false;\n        includes = cacheHas;\n        seen = new SetCache;\n      }\n      else {\n        seen = iteratee ? [] : result;\n      }\n      outer:\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (isCommon && computed === computed) {\n          var seenIndex = seen.length;\n          while (seenIndex--) {\n            if (seen[seenIndex] === computed) {\n              continue outer;\n            }\n          }\n          if (iteratee) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n        else if (!includes(seen, computed, comparator)) {\n          if (seen !== result) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.unset`.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The property path to unset.\n     * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n     */\n    function baseUnset(object, path) {\n      path = castPath(path, object);\n      object = parent(object, path);\n      return object == null || delete object[toKey(last(path))];\n    }\n\n    /**\n     * The base implementation of `_.update`.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to update.\n     * @param {Function} updater The function to produce the updated value.\n     * @param {Function} [customizer] The function to customize path creation.\n     * @returns {Object} Returns `object`.\n     */\n    function baseUpdate(object, path, updater, customizer) {\n      return baseSet(object, path, updater(baseGet(object, path)), customizer);\n    }\n\n    /**\n     * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n     * without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to query.\n     * @param {Function} predicate The function invoked per iteration.\n     * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function baseWhile(array, predicate, isDrop, fromRight) {\n      var length = array.length,\n          index = fromRight ? length : -1;\n\n      while ((fromRight ? index-- : ++index < length) &&\n        predicate(array[index], index, array)) {}\n\n      return isDrop\n        ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n        : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n    }\n\n    /**\n     * The base implementation of `wrapperValue` which returns the result of\n     * performing a sequence of actions on the unwrapped `value`, where each\n     * successive action is supplied the return value of the previous.\n     *\n     * @private\n     * @param {*} value The unwrapped value.\n     * @param {Array} actions Actions to perform to resolve the unwrapped value.\n     * @returns {*} Returns the resolved value.\n     */\n    function baseWrapperValue(value, actions) {\n      var result = value;\n      if (result instanceof LazyWrapper) {\n        result = result.value();\n      }\n      return arrayReduce(actions, function(result, action) {\n        return action.func.apply(action.thisArg, arrayPush([result], action.args));\n      }, result);\n    }\n\n    /**\n     * The base implementation of methods like `_.xor`, without support for\n     * iteratee shorthands, that accepts an array of arrays to inspect.\n     *\n     * @private\n     * @param {Array} arrays The arrays to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of values.\n     */\n    function baseXor(arrays, iteratee, comparator) {\n      var length = arrays.length;\n      if (length < 2) {\n        return length ? baseUniq(arrays[0]) : [];\n      }\n      var index = -1,\n          result = Array(length);\n\n      while (++index < length) {\n        var array = arrays[index],\n            othIndex = -1;\n\n        while (++othIndex < length) {\n          if (othIndex != index) {\n            result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n          }\n        }\n      }\n      return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n    }\n\n    /**\n     * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n     *\n     * @private\n     * @param {Array} props The property identifiers.\n     * @param {Array} values The property values.\n     * @param {Function} assignFunc The function to assign values.\n     * @returns {Object} Returns the new object.\n     */\n    function baseZipObject(props, values, assignFunc) {\n      var index = -1,\n          length = props.length,\n          valsLength = values.length,\n          result = {};\n\n      while (++index < length) {\n        var value = index < valsLength ? values[index] : undefined;\n        assignFunc(result, props[index], value);\n      }\n      return result;\n    }\n\n    /**\n     * Casts `value` to an empty array if it's not an array like object.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {Array|Object} Returns the cast array-like object.\n     */\n    function castArrayLikeObject(value) {\n      return isArrayLikeObject(value) ? value : [];\n    }\n\n    /**\n     * Casts `value` to `identity` if it's not a function.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {Function} Returns cast function.\n     */\n    function castFunction(value) {\n      return typeof value == 'function' ? value : identity;\n    }\n\n    /**\n     * Casts `value` to a path array if it's not one.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @param {Object} [object] The object to query keys on.\n     * @returns {Array} Returns the cast property path array.\n     */\n    function castPath(value, object) {\n      if (isArray(value)) {\n        return value;\n      }\n      return isKey(value, object) ? [value] : stringToPath(toString(value));\n    }\n\n    /**\n     * A `baseRest` alias which can be replaced with `identity` by module\n     * replacement plugins.\n     *\n     * @private\n     * @type {Function}\n     * @param {Function} func The function to apply a rest parameter to.\n     * @returns {Function} Returns the new function.\n     */\n    var castRest = baseRest;\n\n    /**\n     * Casts `array` to a slice if it's needed.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {number} start The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the cast slice.\n     */\n    function castSlice(array, start, end) {\n      var length = array.length;\n      end = end === undefined ? length : end;\n      return (!start && end >= length) ? array : baseSlice(array, start, end);\n    }\n\n    /**\n     * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n     *\n     * @private\n     * @param {number|Object} id The timer id or timeout object of the timer to clear.\n     */\n    var clearTimeout = ctxClearTimeout || function(id) {\n      return root.clearTimeout(id);\n    };\n\n    /**\n     * Creates a clone of  `buffer`.\n     *\n     * @private\n     * @param {Buffer} buffer The buffer to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Buffer} Returns the cloned buffer.\n     */\n    function cloneBuffer(buffer, isDeep) {\n      if (isDeep) {\n        return buffer.slice();\n      }\n      var length = buffer.length,\n          result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n      buffer.copy(result);\n      return result;\n    }\n\n    /**\n     * Creates a clone of `arrayBuffer`.\n     *\n     * @private\n     * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n     * @returns {ArrayBuffer} Returns the cloned array buffer.\n     */\n    function cloneArrayBuffer(arrayBuffer) {\n      var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n      new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n      return result;\n    }\n\n    /**\n     * Creates a clone of `dataView`.\n     *\n     * @private\n     * @param {Object} dataView The data view to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the cloned data view.\n     */\n    function cloneDataView(dataView, isDeep) {\n      var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n      return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n    }\n\n    /**\n     * Creates a clone of `regexp`.\n     *\n     * @private\n     * @param {Object} regexp The regexp to clone.\n     * @returns {Object} Returns the cloned regexp.\n     */\n    function cloneRegExp(regexp) {\n      var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n      result.lastIndex = regexp.lastIndex;\n      return result;\n    }\n\n    /**\n     * Creates a clone of the `symbol` object.\n     *\n     * @private\n     * @param {Object} symbol The symbol object to clone.\n     * @returns {Object} Returns the cloned symbol object.\n     */\n    function cloneSymbol(symbol) {\n      return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n    }\n\n    /**\n     * Creates a clone of `typedArray`.\n     *\n     * @private\n     * @param {Object} typedArray The typed array to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the cloned typed array.\n     */\n    function cloneTypedArray(typedArray, isDeep) {\n      var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n      return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n    }\n\n    /**\n     * Compares values to sort them in ascending order.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {number} Returns the sort order indicator for `value`.\n     */\n    function compareAscending(value, other) {\n      if (value !== other) {\n        var valIsDefined = value !== undefined,\n            valIsNull = value === null,\n            valIsReflexive = value === value,\n            valIsSymbol = isSymbol(value);\n\n        var othIsDefined = other !== undefined,\n            othIsNull = other === null,\n            othIsReflexive = other === other,\n            othIsSymbol = isSymbol(other);\n\n        if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n            (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n            (valIsNull && othIsDefined && othIsReflexive) ||\n            (!valIsDefined && othIsReflexive) ||\n            !valIsReflexive) {\n          return 1;\n        }\n        if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n            (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n            (othIsNull && valIsDefined && valIsReflexive) ||\n            (!othIsDefined && valIsReflexive) ||\n            !othIsReflexive) {\n          return -1;\n        }\n      }\n      return 0;\n    }\n\n    /**\n     * Used by `_.orderBy` to compare multiple properties of a value to another\n     * and stable sort them.\n     *\n     * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n     * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n     * of corresponding values.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {boolean[]|string[]} orders The order to sort by for each property.\n     * @returns {number} Returns the sort order indicator for `object`.\n     */\n    function compareMultiple(object, other, orders) {\n      var index = -1,\n          objCriteria = object.criteria,\n          othCriteria = other.criteria,\n          length = objCriteria.length,\n          ordersLength = orders.length;\n\n      while (++index < length) {\n        var result = compareAscending(objCriteria[index], othCriteria[index]);\n        if (result) {\n          if (index >= ordersLength) {\n            return result;\n          }\n          var order = orders[index];\n          return result * (order == 'desc' ? -1 : 1);\n        }\n      }\n      // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n      // that causes it, under certain circumstances, to provide the same value for\n      // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n      // for more details.\n      //\n      // This also ensures a stable sort in V8 and other engines.\n      // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n      return object.index - other.index;\n    }\n\n    /**\n     * Creates an array that is the composition of partially applied arguments,\n     * placeholders, and provided arguments into a single array of arguments.\n     *\n     * @private\n     * @param {Array} args The provided arguments.\n     * @param {Array} partials The arguments to prepend to those provided.\n     * @param {Array} holders The `partials` placeholder indexes.\n     * @params {boolean} [isCurried] Specify composing for a curried function.\n     * @returns {Array} Returns the new array of composed arguments.\n     */\n    function composeArgs(args, partials, holders, isCurried) {\n      var argsIndex = -1,\n          argsLength = args.length,\n          holdersLength = holders.length,\n          leftIndex = -1,\n          leftLength = partials.length,\n          rangeLength = nativeMax(argsLength - holdersLength, 0),\n          result = Array(leftLength + rangeLength),\n          isUncurried = !isCurried;\n\n      while (++leftIndex < leftLength) {\n        result[leftIndex] = partials[leftIndex];\n      }\n      while (++argsIndex < holdersLength) {\n        if (isUncurried || argsIndex < argsLength) {\n          result[holders[argsIndex]] = args[argsIndex];\n        }\n      }\n      while (rangeLength--) {\n        result[leftIndex++] = args[argsIndex++];\n      }\n      return result;\n    }\n\n    /**\n     * This function is like `composeArgs` except that the arguments composition\n     * is tailored for `_.partialRight`.\n     *\n     * @private\n     * @param {Array} args The provided arguments.\n     * @param {Array} partials The arguments to append to those provided.\n     * @param {Array} holders The `partials` placeholder indexes.\n     * @params {boolean} [isCurried] Specify composing for a curried function.\n     * @returns {Array} Returns the new array of composed arguments.\n     */\n    function composeArgsRight(args, partials, holders, isCurried) {\n      var argsIndex = -1,\n          argsLength = args.length,\n          holdersIndex = -1,\n          holdersLength = holders.length,\n          rightIndex = -1,\n          rightLength = partials.length,\n          rangeLength = nativeMax(argsLength - holdersLength, 0),\n          result = Array(rangeLength + rightLength),\n          isUncurried = !isCurried;\n\n      while (++argsIndex < rangeLength) {\n        result[argsIndex] = args[argsIndex];\n      }\n      var offset = argsIndex;\n      while (++rightIndex < rightLength) {\n        result[offset + rightIndex] = partials[rightIndex];\n      }\n      while (++holdersIndex < holdersLength) {\n        if (isUncurried || argsIndex < argsLength) {\n          result[offset + holders[holdersIndex]] = args[argsIndex++];\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Copies the values of `source` to `array`.\n     *\n     * @private\n     * @param {Array} source The array to copy values from.\n     * @param {Array} [array=[]] The array to copy values to.\n     * @returns {Array} Returns `array`.\n     */\n    function copyArray(source, array) {\n      var index = -1,\n          length = source.length;\n\n      array || (array = Array(length));\n      while (++index < length) {\n        array[index] = source[index];\n      }\n      return array;\n    }\n\n    /**\n     * Copies properties of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy properties from.\n     * @param {Array} props The property identifiers to copy.\n     * @param {Object} [object={}] The object to copy properties to.\n     * @param {Function} [customizer] The function to customize copied values.\n     * @returns {Object} Returns `object`.\n     */\n    function copyObject(source, props, object, customizer) {\n      var isNew = !object;\n      object || (object = {});\n\n      var index = -1,\n          length = props.length;\n\n      while (++index < length) {\n        var key = props[index];\n\n        var newValue = customizer\n          ? customizer(object[key], source[key], key, object, source)\n          : undefined;\n\n        if (newValue === undefined) {\n          newValue = source[key];\n        }\n        if (isNew) {\n          baseAssignValue(object, key, newValue);\n        } else {\n          assignValue(object, key, newValue);\n        }\n      }\n      return object;\n    }\n\n    /**\n     * Copies own symbols of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy symbols from.\n     * @param {Object} [object={}] The object to copy symbols to.\n     * @returns {Object} Returns `object`.\n     */\n    function copySymbols(source, object) {\n      return copyObject(source, getSymbols(source), object);\n    }\n\n    /**\n     * Copies own and inherited symbols of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy symbols from.\n     * @param {Object} [object={}] The object to copy symbols to.\n     * @returns {Object} Returns `object`.\n     */\n    function copySymbolsIn(source, object) {\n      return copyObject(source, getSymbolsIn(source), object);\n    }\n\n    /**\n     * Creates a function like `_.groupBy`.\n     *\n     * @private\n     * @param {Function} setter The function to set accumulator values.\n     * @param {Function} [initializer] The accumulator object initializer.\n     * @returns {Function} Returns the new aggregator function.\n     */\n    function createAggregator(setter, initializer) {\n      return function(collection, iteratee) {\n        var func = isArray(collection) ? arrayAggregator : baseAggregator,\n            accumulator = initializer ? initializer() : {};\n\n        return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n      };\n    }\n\n    /**\n     * Creates a function like `_.assign`.\n     *\n     * @private\n     * @param {Function} assigner The function to assign values.\n     * @returns {Function} Returns the new assigner function.\n     */\n    function createAssigner(assigner) {\n      return baseRest(function(object, sources) {\n        var index = -1,\n            length = sources.length,\n            customizer = length > 1 ? sources[length - 1] : undefined,\n            guard = length > 2 ? sources[2] : undefined;\n\n        customizer = (assigner.length > 3 && typeof customizer == 'function')\n          ? (length--, customizer)\n          : undefined;\n\n        if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n          customizer = length < 3 ? undefined : customizer;\n          length = 1;\n        }\n        object = Object(object);\n        while (++index < length) {\n          var source = sources[index];\n          if (source) {\n            assigner(object, source, index, customizer);\n          }\n        }\n        return object;\n      });\n    }\n\n    /**\n     * Creates a `baseEach` or `baseEachRight` function.\n     *\n     * @private\n     * @param {Function} eachFunc The function to iterate over a collection.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new base function.\n     */\n    function createBaseEach(eachFunc, fromRight) {\n      return function(collection, iteratee) {\n        if (collection == null) {\n          return collection;\n        }\n        if (!isArrayLike(collection)) {\n          return eachFunc(collection, iteratee);\n        }\n        var length = collection.length,\n            index = fromRight ? length : -1,\n            iterable = Object(collection);\n\n        while ((fromRight ? index-- : ++index < length)) {\n          if (iteratee(iterable[index], index, iterable) === false) {\n            break;\n          }\n        }\n        return collection;\n      };\n    }\n\n    /**\n     * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new base function.\n     */\n    function createBaseFor(fromRight) {\n      return function(object, iteratee, keysFunc) {\n        var index = -1,\n            iterable = Object(object),\n            props = keysFunc(object),\n            length = props.length;\n\n        while (length--) {\n          var key = props[fromRight ? length : ++index];\n          if (iteratee(iterable[key], key, iterable) === false) {\n            break;\n          }\n        }\n        return object;\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with the optional `this`\n     * binding of `thisArg`.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createBind(func, bitmask, thisArg) {\n      var isBind = bitmask & WRAP_BIND_FLAG,\n          Ctor = createCtor(func);\n\n      function wrapper() {\n        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n        return fn.apply(isBind ? thisArg : this, arguments);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a function like `_.lowerFirst`.\n     *\n     * @private\n     * @param {string} methodName The name of the `String` case method to use.\n     * @returns {Function} Returns the new case function.\n     */\n    function createCaseFirst(methodName) {\n      return function(string) {\n        string = toString(string);\n\n        var strSymbols = hasUnicode(string)\n          ? stringToArray(string)\n          : undefined;\n\n        var chr = strSymbols\n          ? strSymbols[0]\n          : string.charAt(0);\n\n        var trailing = strSymbols\n          ? castSlice(strSymbols, 1).join('')\n          : string.slice(1);\n\n        return chr[methodName]() + trailing;\n      };\n    }\n\n    /**\n     * Creates a function like `_.camelCase`.\n     *\n     * @private\n     * @param {Function} callback The function to combine each word.\n     * @returns {Function} Returns the new compounder function.\n     */\n    function createCompounder(callback) {\n      return function(string) {\n        return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n      };\n    }\n\n    /**\n     * Creates a function that produces an instance of `Ctor` regardless of\n     * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n     *\n     * @private\n     * @param {Function} Ctor The constructor to wrap.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createCtor(Ctor) {\n      return function() {\n        // Use a `switch` statement to work with class constructors. See\n        // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n        // for more details.\n        var args = arguments;\n        switch (args.length) {\n          case 0: return new Ctor;\n          case 1: return new Ctor(args[0]);\n          case 2: return new Ctor(args[0], args[1]);\n          case 3: return new Ctor(args[0], args[1], args[2]);\n          case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n          case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n          case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n          case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n        }\n        var thisBinding = baseCreate(Ctor.prototype),\n            result = Ctor.apply(thisBinding, args);\n\n        // Mimic the constructor's `return` behavior.\n        // See https://es5.github.io/#x13.2.2 for more details.\n        return isObject(result) ? result : thisBinding;\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to enable currying.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {number} arity The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createCurry(func, bitmask, arity) {\n      var Ctor = createCtor(func);\n\n      function wrapper() {\n        var length = arguments.length,\n            args = Array(length),\n            index = length,\n            placeholder = getHolder(wrapper);\n\n        while (index--) {\n          args[index] = arguments[index];\n        }\n        var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n          ? []\n          : replaceHolders(args, placeholder);\n\n        length -= holders.length;\n        if (length < arity) {\n          return createRecurry(\n            func, bitmask, createHybrid, wrapper.placeholder, undefined,\n            args, holders, undefined, undefined, arity - length);\n        }\n        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n        return apply(fn, this, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a `_.find` or `_.findLast` function.\n     *\n     * @private\n     * @param {Function} findIndexFunc The function to find the collection index.\n     * @returns {Function} Returns the new find function.\n     */\n    function createFind(findIndexFunc) {\n      return function(collection, predicate, fromIndex) {\n        var iterable = Object(collection);\n        if (!isArrayLike(collection)) {\n          var iteratee = getIteratee(predicate, 3);\n          collection = keys(collection);\n          predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n        }\n        var index = findIndexFunc(collection, predicate, fromIndex);\n        return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n      };\n    }\n\n    /**\n     * Creates a `_.flow` or `_.flowRight` function.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new flow function.\n     */\n    function createFlow(fromRight) {\n      return flatRest(function(funcs) {\n        var length = funcs.length,\n            index = length,\n            prereq = LodashWrapper.prototype.thru;\n\n        if (fromRight) {\n          funcs.reverse();\n        }\n        while (index--) {\n          var func = funcs[index];\n          if (typeof func != 'function') {\n            throw new TypeError(FUNC_ERROR_TEXT);\n          }\n          if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n            var wrapper = new LodashWrapper([], true);\n          }\n        }\n        index = wrapper ? index : length;\n        while (++index < length) {\n          func = funcs[index];\n\n          var funcName = getFuncName(func),\n              data = funcName == 'wrapper' ? getData(func) : undefined;\n\n          if (data && isLaziable(data[0]) &&\n                data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n                !data[4].length && data[9] == 1\n              ) {\n            wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n          } else {\n            wrapper = (func.length == 1 && isLaziable(func))\n              ? wrapper[funcName]()\n              : wrapper.thru(func);\n          }\n        }\n        return function() {\n          var args = arguments,\n              value = args[0];\n\n          if (wrapper && args.length == 1 && isArray(value)) {\n            return wrapper.plant(value).value();\n          }\n          var index = 0,\n              result = length ? funcs[index].apply(this, args) : value;\n\n          while (++index < length) {\n            result = funcs[index].call(this, result);\n          }\n          return result;\n        };\n      });\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with optional `this`\n     * binding of `thisArg`, partial application, and currying.\n     *\n     * @private\n     * @param {Function|string} func The function or method name to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to prepend to those provided to\n     *  the new function.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [partialsRight] The arguments to append to those provided\n     *  to the new function.\n     * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n      var isAry = bitmask & WRAP_ARY_FLAG,\n          isBind = bitmask & WRAP_BIND_FLAG,\n          isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n          isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n          isFlip = bitmask & WRAP_FLIP_FLAG,\n          Ctor = isBindKey ? undefined : createCtor(func);\n\n      function wrapper() {\n        var length = arguments.length,\n            args = Array(length),\n            index = length;\n\n        while (index--) {\n          args[index] = arguments[index];\n        }\n        if (isCurried) {\n          var placeholder = getHolder(wrapper),\n              holdersCount = countHolders(args, placeholder);\n        }\n        if (partials) {\n          args = composeArgs(args, partials, holders, isCurried);\n        }\n        if (partialsRight) {\n          args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n        }\n        length -= holdersCount;\n        if (isCurried && length < arity) {\n          var newHolders = replaceHolders(args, placeholder);\n          return createRecurry(\n            func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n            args, newHolders, argPos, ary, arity - length\n          );\n        }\n        var thisBinding = isBind ? thisArg : this,\n            fn = isBindKey ? thisBinding[func] : func;\n\n        length = args.length;\n        if (argPos) {\n          args = reorder(args, argPos);\n        } else if (isFlip && length > 1) {\n          args.reverse();\n        }\n        if (isAry && ary < length) {\n          args.length = ary;\n        }\n        if (this && this !== root && this instanceof wrapper) {\n          fn = Ctor || createCtor(fn);\n        }\n        return fn.apply(thisBinding, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a function like `_.invertBy`.\n     *\n     * @private\n     * @param {Function} setter The function to set accumulator values.\n     * @param {Function} toIteratee The function to resolve iteratees.\n     * @returns {Function} Returns the new inverter function.\n     */\n    function createInverter(setter, toIteratee) {\n      return function(object, iteratee) {\n        return baseInverter(object, setter, toIteratee(iteratee), {});\n      };\n    }\n\n    /**\n     * Creates a function that performs a mathematical operation on two values.\n     *\n     * @private\n     * @param {Function} operator The function to perform the operation.\n     * @param {number} [defaultValue] The value used for `undefined` arguments.\n     * @returns {Function} Returns the new mathematical operation function.\n     */\n    function createMathOperation(operator, defaultValue) {\n      return function(value, other) {\n        var result;\n        if (value === undefined && other === undefined) {\n          return defaultValue;\n        }\n        if (value !== undefined) {\n          result = value;\n        }\n        if (other !== undefined) {\n          if (result === undefined) {\n            return other;\n          }\n          if (typeof value == 'string' || typeof other == 'string') {\n            value = baseToString(value);\n            other = baseToString(other);\n          } else {\n            value = baseToNumber(value);\n            other = baseToNumber(other);\n          }\n          result = operator(value, other);\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Creates a function like `_.over`.\n     *\n     * @private\n     * @param {Function} arrayFunc The function to iterate over iteratees.\n     * @returns {Function} Returns the new over function.\n     */\n    function createOver(arrayFunc) {\n      return flatRest(function(iteratees) {\n        iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n        return baseRest(function(args) {\n          var thisArg = this;\n          return arrayFunc(iteratees, function(iteratee) {\n            return apply(iteratee, thisArg, args);\n          });\n        });\n      });\n    }\n\n    /**\n     * Creates the padding for `string` based on `length`. The `chars` string\n     * is truncated if the number of characters exceeds `length`.\n     *\n     * @private\n     * @param {number} length The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padding for `string`.\n     */\n    function createPadding(length, chars) {\n      chars = chars === undefined ? ' ' : baseToString(chars);\n\n      var charsLength = chars.length;\n      if (charsLength < 2) {\n        return charsLength ? baseRepeat(chars, length) : chars;\n      }\n      var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n      return hasUnicode(chars)\n        ? castSlice(stringToArray(result), 0, length).join('')\n        : result.slice(0, length);\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with the `this` binding\n     * of `thisArg` and `partials` prepended to the arguments it receives.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} thisArg The `this` binding of `func`.\n     * @param {Array} partials The arguments to prepend to those provided to\n     *  the new function.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createPartial(func, bitmask, thisArg, partials) {\n      var isBind = bitmask & WRAP_BIND_FLAG,\n          Ctor = createCtor(func);\n\n      function wrapper() {\n        var argsIndex = -1,\n            argsLength = arguments.length,\n            leftIndex = -1,\n            leftLength = partials.length,\n            args = Array(leftLength + argsLength),\n            fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n        while (++leftIndex < leftLength) {\n          args[leftIndex] = partials[leftIndex];\n        }\n        while (argsLength--) {\n          args[leftIndex++] = arguments[++argsIndex];\n        }\n        return apply(fn, isBind ? thisArg : this, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a `_.range` or `_.rangeRight` function.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new range function.\n     */\n    function createRange(fromRight) {\n      return function(start, end, step) {\n        if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n          end = step = undefined;\n        }\n        // Ensure the sign of `-0` is preserved.\n        start = toFinite(start);\n        if (end === undefined) {\n          end = start;\n          start = 0;\n        } else {\n          end = toFinite(end);\n        }\n        step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n        return baseRange(start, end, step, fromRight);\n      };\n    }\n\n    /**\n     * Creates a function that performs a relational operation on two values.\n     *\n     * @private\n     * @param {Function} operator The function to perform the operation.\n     * @returns {Function} Returns the new relational operation function.\n     */\n    function createRelationalOperation(operator) {\n      return function(value, other) {\n        if (!(typeof value == 'string' && typeof other == 'string')) {\n          value = toNumber(value);\n          other = toNumber(other);\n        }\n        return operator(value, other);\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to continue currying.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {Function} wrapFunc The function to create the `func` wrapper.\n     * @param {*} placeholder The placeholder value.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to prepend to those provided to\n     *  the new function.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n      var isCurry = bitmask & WRAP_CURRY_FLAG,\n          newHolders = isCurry ? holders : undefined,\n          newHoldersRight = isCurry ? undefined : holders,\n          newPartials = isCurry ? partials : undefined,\n          newPartialsRight = isCurry ? undefined : partials;\n\n      bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n      bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n      if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n        bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n      }\n      var newData = [\n        func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n        newHoldersRight, argPos, ary, arity\n      ];\n\n      var result = wrapFunc.apply(undefined, newData);\n      if (isLaziable(func)) {\n        setData(result, newData);\n      }\n      result.placeholder = placeholder;\n      return setWrapToString(result, func, bitmask);\n    }\n\n    /**\n     * Creates a function like `_.round`.\n     *\n     * @private\n     * @param {string} methodName The name of the `Math` method to use when rounding.\n     * @returns {Function} Returns the new round function.\n     */\n    function createRound(methodName) {\n      var func = Math[methodName];\n      return function(number, precision) {\n        number = toNumber(number);\n        precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n        if (precision && nativeIsFinite(number)) {\n          // Shift with exponential notation to avoid floating-point issues.\n          // See [MDN](https://mdn.io/round#Examples) for more details.\n          var pair = (toString(number) + 'e').split('e'),\n              value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n          pair = (toString(value) + 'e').split('e');\n          return +(pair[0] + 'e' + (+pair[1] - precision));\n        }\n        return func(number);\n      };\n    }\n\n    /**\n     * Creates a set object of `values`.\n     *\n     * @private\n     * @param {Array} values The values to add to the set.\n     * @returns {Object} Returns the new set.\n     */\n    var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n      return new Set(values);\n    };\n\n    /**\n     * Creates a `_.toPairs` or `_.toPairsIn` function.\n     *\n     * @private\n     * @param {Function} keysFunc The function to get the keys of a given object.\n     * @returns {Function} Returns the new pairs function.\n     */\n    function createToPairs(keysFunc) {\n      return function(object) {\n        var tag = getTag(object);\n        if (tag == mapTag) {\n          return mapToArray(object);\n        }\n        if (tag == setTag) {\n          return setToPairs(object);\n        }\n        return baseToPairs(object, keysFunc(object));\n      };\n    }\n\n    /**\n     * Creates a function that either curries or invokes `func` with optional\n     * `this` binding and partially applied arguments.\n     *\n     * @private\n     * @param {Function|string} func The function or method name to wrap.\n     * @param {number} bitmask The bitmask flags.\n     *    1 - `_.bind`\n     *    2 - `_.bindKey`\n     *    4 - `_.curry` or `_.curryRight` of a bound function\n     *    8 - `_.curry`\n     *   16 - `_.curryRight`\n     *   32 - `_.partial`\n     *   64 - `_.partialRight`\n     *  128 - `_.rearg`\n     *  256 - `_.ary`\n     *  512 - `_.flip`\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to be partially applied.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n      var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n      if (!isBindKey && typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      var length = partials ? partials.length : 0;\n      if (!length) {\n        bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n        partials = holders = undefined;\n      }\n      ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n      arity = arity === undefined ? arity : toInteger(arity);\n      length -= holders ? holders.length : 0;\n\n      if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n        var partialsRight = partials,\n            holdersRight = holders;\n\n        partials = holders = undefined;\n      }\n      var data = isBindKey ? undefined : getData(func);\n\n      var newData = [\n        func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n        argPos, ary, arity\n      ];\n\n      if (data) {\n        mergeData(newData, data);\n      }\n      func = newData[0];\n      bitmask = newData[1];\n      thisArg = newData[2];\n      partials = newData[3];\n      holders = newData[4];\n      arity = newData[9] = newData[9] === undefined\n        ? (isBindKey ? 0 : func.length)\n        : nativeMax(newData[9] - length, 0);\n\n      if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n        bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n      }\n      if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n        var result = createBind(func, bitmask, thisArg);\n      } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n        result = createCurry(func, bitmask, arity);\n      } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n        result = createPartial(func, bitmask, thisArg, partials);\n      } else {\n        result = createHybrid.apply(undefined, newData);\n      }\n      var setter = data ? baseSetData : setData;\n      return setWrapToString(setter(result, newData), func, bitmask);\n    }\n\n    /**\n     * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n     * of source objects to the destination object for all destination properties\n     * that resolve to `undefined`.\n     *\n     * @private\n     * @param {*} objValue The destination value.\n     * @param {*} srcValue The source value.\n     * @param {string} key The key of the property to assign.\n     * @param {Object} object The parent object of `objValue`.\n     * @returns {*} Returns the value to assign.\n     */\n    function customDefaultsAssignIn(objValue, srcValue, key, object) {\n      if (objValue === undefined ||\n          (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n        return srcValue;\n      }\n      return objValue;\n    }\n\n    /**\n     * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n     * objects into destination objects that are passed thru.\n     *\n     * @private\n     * @param {*} objValue The destination value.\n     * @param {*} srcValue The source value.\n     * @param {string} key The key of the property to merge.\n     * @param {Object} object The parent object of `objValue`.\n     * @param {Object} source The parent object of `srcValue`.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     * @returns {*} Returns the value to assign.\n     */\n    function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n      if (isObject(objValue) && isObject(srcValue)) {\n        // Recursively merge objects and arrays (susceptible to call stack limits).\n        stack.set(srcValue, objValue);\n        baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n        stack['delete'](srcValue);\n      }\n      return objValue;\n    }\n\n    /**\n     * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n     * objects.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @param {string} key The key of the property to inspect.\n     * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n     */\n    function customOmitClone(value) {\n      return isPlainObject(value) ? undefined : value;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for arrays with support for\n     * partial deep comparisons.\n     *\n     * @private\n     * @param {Array} array The array to compare.\n     * @param {Array} other The other array to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `array` and `other` objects.\n     * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n     */\n    function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n          arrLength = array.length,\n          othLength = other.length;\n\n      if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(array);\n      if (stacked && stack.get(other)) {\n        return stacked == other;\n      }\n      var index = -1,\n          result = true,\n          seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n      stack.set(array, other);\n      stack.set(other, array);\n\n      // Ignore non-index properties.\n      while (++index < arrLength) {\n        var arrValue = array[index],\n            othValue = other[index];\n\n        if (customizer) {\n          var compared = isPartial\n            ? customizer(othValue, arrValue, index, other, array, stack)\n            : customizer(arrValue, othValue, index, array, other, stack);\n        }\n        if (compared !== undefined) {\n          if (compared) {\n            continue;\n          }\n          result = false;\n          break;\n        }\n        // Recursively compare arrays (susceptible to call stack limits).\n        if (seen) {\n          if (!arraySome(other, function(othValue, othIndex) {\n                if (!cacheHas(seen, othIndex) &&\n                    (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n                  return seen.push(othIndex);\n                }\n              })) {\n            result = false;\n            break;\n          }\n        } else if (!(\n              arrValue === othValue ||\n                equalFunc(arrValue, othValue, bitmask, customizer, stack)\n            )) {\n          result = false;\n          break;\n        }\n      }\n      stack['delete'](array);\n      stack['delete'](other);\n      return result;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for comparing objects of\n     * the same `toStringTag`.\n     *\n     * **Note:** This function only supports comparing values with tags of\n     * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {string} tag The `toStringTag` of the objects to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n      switch (tag) {\n        case dataViewTag:\n          if ((object.byteLength != other.byteLength) ||\n              (object.byteOffset != other.byteOffset)) {\n            return false;\n          }\n          object = object.buffer;\n          other = other.buffer;\n\n        case arrayBufferTag:\n          if ((object.byteLength != other.byteLength) ||\n              !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n            return false;\n          }\n          return true;\n\n        case boolTag:\n        case dateTag:\n        case numberTag:\n          // Coerce booleans to `1` or `0` and dates to milliseconds.\n          // Invalid dates are coerced to `NaN`.\n          return eq(+object, +other);\n\n        case errorTag:\n          return object.name == other.name && object.message == other.message;\n\n        case regexpTag:\n        case stringTag:\n          // Coerce regexes to strings and treat strings, primitives and objects,\n          // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n          // for more details.\n          return object == (other + '');\n\n        case mapTag:\n          var convert = mapToArray;\n\n        case setTag:\n          var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n          convert || (convert = setToArray);\n\n          if (object.size != other.size && !isPartial) {\n            return false;\n          }\n          // Assume cyclic values are equal.\n          var stacked = stack.get(object);\n          if (stacked) {\n            return stacked == other;\n          }\n          bitmask |= COMPARE_UNORDERED_FLAG;\n\n          // Recursively compare objects (susceptible to call stack limits).\n          stack.set(object, other);\n          var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n          stack['delete'](object);\n          return result;\n\n        case symbolTag:\n          if (symbolValueOf) {\n            return symbolValueOf.call(object) == symbolValueOf.call(other);\n          }\n      }\n      return false;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for objects with support for\n     * partial deep comparisons.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n          objProps = getAllKeys(object),\n          objLength = objProps.length,\n          othProps = getAllKeys(other),\n          othLength = othProps.length;\n\n      if (objLength != othLength && !isPartial) {\n        return false;\n      }\n      var index = objLength;\n      while (index--) {\n        var key = objProps[index];\n        if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n          return false;\n        }\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked && stack.get(other)) {\n        return stacked == other;\n      }\n      var result = true;\n      stack.set(object, other);\n      stack.set(other, object);\n\n      var skipCtor = isPartial;\n      while (++index < objLength) {\n        key = objProps[index];\n        var objValue = object[key],\n            othValue = other[key];\n\n        if (customizer) {\n          var compared = isPartial\n            ? customizer(othValue, objValue, key, other, object, stack)\n            : customizer(objValue, othValue, key, object, other, stack);\n        }\n        // Recursively compare objects (susceptible to call stack limits).\n        if (!(compared === undefined\n              ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n              : compared\n            )) {\n          result = false;\n          break;\n        }\n        skipCtor || (skipCtor = key == 'constructor');\n      }\n      if (result && !skipCtor) {\n        var objCtor = object.constructor,\n            othCtor = other.constructor;\n\n        // Non `Object` object instances with different constructors are not equal.\n        if (objCtor != othCtor &&\n            ('constructor' in object && 'constructor' in other) &&\n            !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n              typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n          result = false;\n        }\n      }\n      stack['delete'](object);\n      stack['delete'](other);\n      return result;\n    }\n\n    /**\n     * A specialized version of `baseRest` which flattens the rest array.\n     *\n     * @private\n     * @param {Function} func The function to apply a rest parameter to.\n     * @returns {Function} Returns the new function.\n     */\n    function flatRest(func) {\n      return setToString(overRest(func, undefined, flatten), func + '');\n    }\n\n    /**\n     * Creates an array of own enumerable property names and symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names and symbols.\n     */\n    function getAllKeys(object) {\n      return baseGetAllKeys(object, keys, getSymbols);\n    }\n\n    /**\n     * Creates an array of own and inherited enumerable property names and\n     * symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names and symbols.\n     */\n    function getAllKeysIn(object) {\n      return baseGetAllKeys(object, keysIn, getSymbolsIn);\n    }\n\n    /**\n     * Gets metadata for `func`.\n     *\n     * @private\n     * @param {Function} func The function to query.\n     * @returns {*} Returns the metadata for `func`.\n     */\n    var getData = !metaMap ? noop : function(func) {\n      return metaMap.get(func);\n    };\n\n    /**\n     * Gets the name of `func`.\n     *\n     * @private\n     * @param {Function} func The function to query.\n     * @returns {string} Returns the function name.\n     */\n    function getFuncName(func) {\n      var result = (func.name + ''),\n          array = realNames[result],\n          length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n      while (length--) {\n        var data = array[length],\n            otherFunc = data.func;\n        if (otherFunc == null || otherFunc == func) {\n          return data.name;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Gets the argument placeholder value for `func`.\n     *\n     * @private\n     * @param {Function} func The function to inspect.\n     * @returns {*} Returns the placeholder value.\n     */\n    function getHolder(func) {\n      var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n      return object.placeholder;\n    }\n\n    /**\n     * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n     * this function returns the custom method, otherwise it returns `baseIteratee`.\n     * If arguments are provided, the chosen function is invoked with them and\n     * its result is returned.\n     *\n     * @private\n     * @param {*} [value] The value to convert to an iteratee.\n     * @param {number} [arity] The arity of the created iteratee.\n     * @returns {Function} Returns the chosen function or its result.\n     */\n    function getIteratee() {\n      var result = lodash.iteratee || iteratee;\n      result = result === iteratee ? baseIteratee : result;\n      return arguments.length ? result(arguments[0], arguments[1]) : result;\n    }\n\n    /**\n     * Gets the data for `map`.\n     *\n     * @private\n     * @param {Object} map The map to query.\n     * @param {string} key The reference key.\n     * @returns {*} Returns the map data.\n     */\n    function getMapData(map, key) {\n      var data = map.__data__;\n      return isKeyable(key)\n        ? data[typeof key == 'string' ? 'string' : 'hash']\n        : data.map;\n    }\n\n    /**\n     * Gets the property names, values, and compare flags of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the match data of `object`.\n     */\n    function getMatchData(object) {\n      var result = keys(object),\n          length = result.length;\n\n      while (length--) {\n        var key = result[length],\n            value = object[key];\n\n        result[length] = [key, value, isStrictComparable(value)];\n      }\n      return result;\n    }\n\n    /**\n     * Gets the native function at `key` of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {string} key The key of the method to get.\n     * @returns {*} Returns the function if it's native, else `undefined`.\n     */\n    function getNative(object, key) {\n      var value = getValue(object, key);\n      return baseIsNative(value) ? value : undefined;\n    }\n\n    /**\n     * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the raw `toStringTag`.\n     */\n    function getRawTag(value) {\n      var isOwn = hasOwnProperty.call(value, symToStringTag),\n          tag = value[symToStringTag];\n\n      try {\n        value[symToStringTag] = undefined;\n        var unmasked = true;\n      } catch (e) {}\n\n      var result = nativeObjectToString.call(value);\n      if (unmasked) {\n        if (isOwn) {\n          value[symToStringTag] = tag;\n        } else {\n          delete value[symToStringTag];\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Creates an array of the own enumerable symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of symbols.\n     */\n    var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n      if (object == null) {\n        return [];\n      }\n      object = Object(object);\n      return arrayFilter(nativeGetSymbols(object), function(symbol) {\n        return propertyIsEnumerable.call(object, symbol);\n      });\n    };\n\n    /**\n     * Creates an array of the own and inherited enumerable symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of symbols.\n     */\n    var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n      var result = [];\n      while (object) {\n        arrayPush(result, getSymbols(object));\n        object = getPrototype(object);\n      }\n      return result;\n    };\n\n    /**\n     * Gets the `toStringTag` of `value`.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the `toStringTag`.\n     */\n    var getTag = baseGetTag;\n\n    // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n    if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n        (Map && getTag(new Map) != mapTag) ||\n        (Promise && getTag(Promise.resolve()) != promiseTag) ||\n        (Set && getTag(new Set) != setTag) ||\n        (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n      getTag = function(value) {\n        var result = baseGetTag(value),\n            Ctor = result == objectTag ? value.constructor : undefined,\n            ctorString = Ctor ? toSource(Ctor) : '';\n\n        if (ctorString) {\n          switch (ctorString) {\n            case dataViewCtorString: return dataViewTag;\n            case mapCtorString: return mapTag;\n            case promiseCtorString: return promiseTag;\n            case setCtorString: return setTag;\n            case weakMapCtorString: return weakMapTag;\n          }\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Gets the view, applying any `transforms` to the `start` and `end` positions.\n     *\n     * @private\n     * @param {number} start The start of the view.\n     * @param {number} end The end of the view.\n     * @param {Array} transforms The transformations to apply to the view.\n     * @returns {Object} Returns an object containing the `start` and `end`\n     *  positions of the view.\n     */\n    function getView(start, end, transforms) {\n      var index = -1,\n          length = transforms.length;\n\n      while (++index < length) {\n        var data = transforms[index],\n            size = data.size;\n\n        switch (data.type) {\n          case 'drop':      start += size; break;\n          case 'dropRight': end -= size; break;\n          case 'take':      end = nativeMin(end, start + size); break;\n          case 'takeRight': start = nativeMax(start, end - size); break;\n        }\n      }\n      return { 'start': start, 'end': end };\n    }\n\n    /**\n     * Extracts wrapper details from the `source` body comment.\n     *\n     * @private\n     * @param {string} source The source to inspect.\n     * @returns {Array} Returns the wrapper details.\n     */\n    function getWrapDetails(source) {\n      var match = source.match(reWrapDetails);\n      return match ? match[1].split(reSplitDetails) : [];\n    }\n\n    /**\n     * Checks if `path` exists on `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path to check.\n     * @param {Function} hasFunc The function to check properties.\n     * @returns {boolean} Returns `true` if `path` exists, else `false`.\n     */\n    function hasPath(object, path, hasFunc) {\n      path = castPath(path, object);\n\n      var index = -1,\n          length = path.length,\n          result = false;\n\n      while (++index < length) {\n        var key = toKey(path[index]);\n        if (!(result = object != null && hasFunc(object, key))) {\n          break;\n        }\n        object = object[key];\n      }\n      if (result || ++index != length) {\n        return result;\n      }\n      length = object == null ? 0 : object.length;\n      return !!length && isLength(length) && isIndex(key, length) &&\n        (isArray(object) || isArguments(object));\n    }\n\n    /**\n     * Initializes an array clone.\n     *\n     * @private\n     * @param {Array} array The array to clone.\n     * @returns {Array} Returns the initialized clone.\n     */\n    function initCloneArray(array) {\n      var length = array.length,\n          result = new array.constructor(length);\n\n      // Add properties assigned by `RegExp#exec`.\n      if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n        result.index = array.index;\n        result.input = array.input;\n      }\n      return result;\n    }\n\n    /**\n     * Initializes an object clone.\n     *\n     * @private\n     * @param {Object} object The object to clone.\n     * @returns {Object} Returns the initialized clone.\n     */\n    function initCloneObject(object) {\n      return (typeof object.constructor == 'function' && !isPrototype(object))\n        ? baseCreate(getPrototype(object))\n        : {};\n    }\n\n    /**\n     * Initializes an object clone based on its `toStringTag`.\n     *\n     * **Note:** This function only supports cloning values with tags of\n     * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n     *\n     * @private\n     * @param {Object} object The object to clone.\n     * @param {string} tag The `toStringTag` of the object to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the initialized clone.\n     */\n    function initCloneByTag(object, tag, isDeep) {\n      var Ctor = object.constructor;\n      switch (tag) {\n        case arrayBufferTag:\n          return cloneArrayBuffer(object);\n\n        case boolTag:\n        case dateTag:\n          return new Ctor(+object);\n\n        case dataViewTag:\n          return cloneDataView(object, isDeep);\n\n        case float32Tag: case float64Tag:\n        case int8Tag: case int16Tag: case int32Tag:\n        case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n          return cloneTypedArray(object, isDeep);\n\n        case mapTag:\n          return new Ctor;\n\n        case numberTag:\n        case stringTag:\n          return new Ctor(object);\n\n        case regexpTag:\n          return cloneRegExp(object);\n\n        case setTag:\n          return new Ctor;\n\n        case symbolTag:\n          return cloneSymbol(object);\n      }\n    }\n\n    /**\n     * Inserts wrapper `details` in a comment at the top of the `source` body.\n     *\n     * @private\n     * @param {string} source The source to modify.\n     * @returns {Array} details The details to insert.\n     * @returns {string} Returns the modified source.\n     */\n    function insertWrapDetails(source, details) {\n      var length = details.length;\n      if (!length) {\n        return source;\n      }\n      var lastIndex = length - 1;\n      details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n      details = details.join(length > 2 ? ', ' : ' ');\n      return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n    }\n\n    /**\n     * Checks if `value` is a flattenable `arguments` object or array.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n     */\n    function isFlattenable(value) {\n      return isArray(value) || isArguments(value) ||\n        !!(spreadableSymbol && value && value[spreadableSymbol]);\n    }\n\n    /**\n     * Checks if `value` is a valid array-like index.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n     * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n     */\n    function isIndex(value, length) {\n      var type = typeof value;\n      length = length == null ? MAX_SAFE_INTEGER : length;\n\n      return !!length &&\n        (type == 'number' ||\n          (type != 'symbol' && reIsUint.test(value))) &&\n            (value > -1 && value % 1 == 0 && value < length);\n    }\n\n    /**\n     * Checks if the given arguments are from an iteratee call.\n     *\n     * @private\n     * @param {*} value The potential iteratee value argument.\n     * @param {*} index The potential iteratee index or key argument.\n     * @param {*} object The potential iteratee object argument.\n     * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n     *  else `false`.\n     */\n    function isIterateeCall(value, index, object) {\n      if (!isObject(object)) {\n        return false;\n      }\n      var type = typeof index;\n      if (type == 'number'\n            ? (isArrayLike(object) && isIndex(index, object.length))\n            : (type == 'string' && index in object)\n          ) {\n        return eq(object[index], value);\n      }\n      return false;\n    }\n\n    /**\n     * Checks if `value` is a property name and not a property path.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @param {Object} [object] The object to query keys on.\n     * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n     */\n    function isKey(value, object) {\n      if (isArray(value)) {\n        return false;\n      }\n      var type = typeof value;\n      if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n          value == null || isSymbol(value)) {\n        return true;\n      }\n      return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n        (object != null && value in Object(object));\n    }\n\n    /**\n     * Checks if `value` is suitable for use as unique object key.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n     */\n    function isKeyable(value) {\n      var type = typeof value;\n      return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n        ? (value !== '__proto__')\n        : (value === null);\n    }\n\n    /**\n     * Checks if `func` has a lazy counterpart.\n     *\n     * @private\n     * @param {Function} func The function to check.\n     * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n     *  else `false`.\n     */\n    function isLaziable(func) {\n      var funcName = getFuncName(func),\n          other = lodash[funcName];\n\n      if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n        return false;\n      }\n      if (func === other) {\n        return true;\n      }\n      var data = getData(other);\n      return !!data && func === data[0];\n    }\n\n    /**\n     * Checks if `func` has its source masked.\n     *\n     * @private\n     * @param {Function} func The function to check.\n     * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n     */\n    function isMasked(func) {\n      return !!maskSrcKey && (maskSrcKey in func);\n    }\n\n    /**\n     * Checks if `func` is capable of being masked.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n     */\n    var isMaskable = coreJsData ? isFunction : stubFalse;\n\n    /**\n     * Checks if `value` is likely a prototype object.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n     */\n    function isPrototype(value) {\n      var Ctor = value && value.constructor,\n          proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n      return value === proto;\n    }\n\n    /**\n     * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` if suitable for strict\n     *  equality comparisons, else `false`.\n     */\n    function isStrictComparable(value) {\n      return value === value && !isObject(value);\n    }\n\n    /**\n     * A specialized version of `matchesProperty` for source values suitable\n     * for strict equality comparisons, i.e. `===`.\n     *\n     * @private\n     * @param {string} key The key of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function matchesStrictComparable(key, srcValue) {\n      return function(object) {\n        if (object == null) {\n          return false;\n        }\n        return object[key] === srcValue &&\n          (srcValue !== undefined || (key in Object(object)));\n      };\n    }\n\n    /**\n     * A specialized version of `_.memoize` which clears the memoized function's\n     * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n     *\n     * @private\n     * @param {Function} func The function to have its output memoized.\n     * @returns {Function} Returns the new memoized function.\n     */\n    function memoizeCapped(func) {\n      var result = memoize(func, function(key) {\n        if (cache.size === MAX_MEMOIZE_SIZE) {\n          cache.clear();\n        }\n        return key;\n      });\n\n      var cache = result.cache;\n      return result;\n    }\n\n    /**\n     * Merges the function metadata of `source` into `data`.\n     *\n     * Merging metadata reduces the number of wrappers used to invoke a function.\n     * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n     * may be applied regardless of execution order. Methods like `_.ary` and\n     * `_.rearg` modify function arguments, making the order in which they are\n     * executed important, preventing the merging of metadata. However, we make\n     * an exception for a safe combined case where curried functions have `_.ary`\n     * and or `_.rearg` applied.\n     *\n     * @private\n     * @param {Array} data The destination metadata.\n     * @param {Array} source The source metadata.\n     * @returns {Array} Returns `data`.\n     */\n    function mergeData(data, source) {\n      var bitmask = data[1],\n          srcBitmask = source[1],\n          newBitmask = bitmask | srcBitmask,\n          isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n      var isCombo =\n        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n        ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n      // Exit early if metadata can't be merged.\n      if (!(isCommon || isCombo)) {\n        return data;\n      }\n      // Use source `thisArg` if available.\n      if (srcBitmask & WRAP_BIND_FLAG) {\n        data[2] = source[2];\n        // Set when currying a bound function.\n        newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n      }\n      // Compose partial arguments.\n      var value = source[3];\n      if (value) {\n        var partials = data[3];\n        data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n        data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n      }\n      // Compose partial right arguments.\n      value = source[5];\n      if (value) {\n        partials = data[5];\n        data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n        data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n      }\n      // Use source `argPos` if available.\n      value = source[7];\n      if (value) {\n        data[7] = value;\n      }\n      // Use source `ary` if it's smaller.\n      if (srcBitmask & WRAP_ARY_FLAG) {\n        data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n      }\n      // Use source `arity` if one is not provided.\n      if (data[9] == null) {\n        data[9] = source[9];\n      }\n      // Use source `func` and merge bitmasks.\n      data[0] = source[0];\n      data[1] = newBitmask;\n\n      return data;\n    }\n\n    /**\n     * This function is like\n     * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n     * except that it includes inherited enumerable properties.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     */\n    function nativeKeysIn(object) {\n      var result = [];\n      if (object != null) {\n        for (var key in Object(object)) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Converts `value` to a string using `Object.prototype.toString`.\n     *\n     * @private\n     * @param {*} value The value to convert.\n     * @returns {string} Returns the converted string.\n     */\n    function objectToString(value) {\n      return nativeObjectToString.call(value);\n    }\n\n    /**\n     * A specialized version of `baseRest` which transforms the rest array.\n     *\n     * @private\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @param {Function} transform The rest array transform.\n     * @returns {Function} Returns the new function.\n     */\n    function overRest(func, start, transform) {\n      start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n      return function() {\n        var args = arguments,\n            index = -1,\n            length = nativeMax(args.length - start, 0),\n            array = Array(length);\n\n        while (++index < length) {\n          array[index] = args[start + index];\n        }\n        index = -1;\n        var otherArgs = Array(start + 1);\n        while (++index < start) {\n          otherArgs[index] = args[index];\n        }\n        otherArgs[start] = transform(array);\n        return apply(func, this, otherArgs);\n      };\n    }\n\n    /**\n     * Gets the parent value at `path` of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array} path The path to get the parent value of.\n     * @returns {*} Returns the parent value.\n     */\n    function parent(object, path) {\n      return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n    }\n\n    /**\n     * Reorder `array` according to the specified indexes where the element at\n     * the first index is assigned as the first element, the element at\n     * the second index is assigned as the second element, and so on.\n     *\n     * @private\n     * @param {Array} array The array to reorder.\n     * @param {Array} indexes The arranged array indexes.\n     * @returns {Array} Returns `array`.\n     */\n    function reorder(array, indexes) {\n      var arrLength = array.length,\n          length = nativeMin(indexes.length, arrLength),\n          oldArray = copyArray(array);\n\n      while (length--) {\n        var index = indexes[length];\n        array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n      }\n      return array;\n    }\n\n    /**\n     * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {string} key The key of the property to get.\n     * @returns {*} Returns the property value.\n     */\n    function safeGet(object, key) {\n      if (key === 'constructor' && typeof object[key] === 'function') {\n        return;\n      }\n\n      if (key == '__proto__') {\n        return;\n      }\n\n      return object[key];\n    }\n\n    /**\n     * Sets metadata for `func`.\n     *\n     * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n     * period of time, it will trip its breaker and transition to an identity\n     * function to avoid garbage collection pauses in V8. See\n     * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n     * for more details.\n     *\n     * @private\n     * @param {Function} func The function to associate metadata with.\n     * @param {*} data The metadata.\n     * @returns {Function} Returns `func`.\n     */\n    var setData = shortOut(baseSetData);\n\n    /**\n     * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n     *\n     * @private\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @returns {number|Object} Returns the timer id or timeout object.\n     */\n    var setTimeout = ctxSetTimeout || function(func, wait) {\n      return root.setTimeout(func, wait);\n    };\n\n    /**\n     * Sets the `toString` method of `func` to return `string`.\n     *\n     * @private\n     * @param {Function} func The function to modify.\n     * @param {Function} string The `toString` result.\n     * @returns {Function} Returns `func`.\n     */\n    var setToString = shortOut(baseSetToString);\n\n    /**\n     * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n     * with wrapper details in a comment at the top of the source body.\n     *\n     * @private\n     * @param {Function} wrapper The function to modify.\n     * @param {Function} reference The reference function.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @returns {Function} Returns `wrapper`.\n     */\n    function setWrapToString(wrapper, reference, bitmask) {\n      var source = (reference + '');\n      return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n    }\n\n    /**\n     * Creates a function that'll short out and invoke `identity` instead\n     * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n     * milliseconds.\n     *\n     * @private\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new shortable function.\n     */\n    function shortOut(func) {\n      var count = 0,\n          lastCalled = 0;\n\n      return function() {\n        var stamp = nativeNow(),\n            remaining = HOT_SPAN - (stamp - lastCalled);\n\n        lastCalled = stamp;\n        if (remaining > 0) {\n          if (++count >= HOT_COUNT) {\n            return arguments[0];\n          }\n        } else {\n          count = 0;\n        }\n        return func.apply(undefined, arguments);\n      };\n    }\n\n    /**\n     * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n     *\n     * @private\n     * @param {Array} array The array to shuffle.\n     * @param {number} [size=array.length] The size of `array`.\n     * @returns {Array} Returns `array`.\n     */\n    function shuffleSelf(array, size) {\n      var index = -1,\n          length = array.length,\n          lastIndex = length - 1;\n\n      size = size === undefined ? length : size;\n      while (++index < size) {\n        var rand = baseRandom(index, lastIndex),\n            value = array[rand];\n\n        array[rand] = array[index];\n        array[index] = value;\n      }\n      array.length = size;\n      return array;\n    }\n\n    /**\n     * Converts `string` to a property path array.\n     *\n     * @private\n     * @param {string} string The string to convert.\n     * @returns {Array} Returns the property path array.\n     */\n    var stringToPath = memoizeCapped(function(string) {\n      var result = [];\n      if (string.charCodeAt(0) === 46 /* . */) {\n        result.push('');\n      }\n      string.replace(rePropName, function(match, number, quote, subString) {\n        result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n      });\n      return result;\n    });\n\n    /**\n     * Converts `value` to a string key if it's not a string or symbol.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {string|symbol} Returns the key.\n     */\n    function toKey(value) {\n      if (typeof value == 'string' || isSymbol(value)) {\n        return value;\n      }\n      var result = (value + '');\n      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n    }\n\n    /**\n     * Converts `func` to its source code.\n     *\n     * @private\n     * @param {Function} func The function to convert.\n     * @returns {string} Returns the source code.\n     */\n    function toSource(func) {\n      if (func != null) {\n        try {\n          return funcToString.call(func);\n        } catch (e) {}\n        try {\n          return (func + '');\n        } catch (e) {}\n      }\n      return '';\n    }\n\n    /**\n     * Updates wrapper `details` based on `bitmask` flags.\n     *\n     * @private\n     * @returns {Array} details The details to modify.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @returns {Array} Returns `details`.\n     */\n    function updateWrapDetails(details, bitmask) {\n      arrayEach(wrapFlags, function(pair) {\n        var value = '_.' + pair[0];\n        if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n          details.push(value);\n        }\n      });\n      return details.sort();\n    }\n\n    /**\n     * Creates a clone of `wrapper`.\n     *\n     * @private\n     * @param {Object} wrapper The wrapper to clone.\n     * @returns {Object} Returns the cloned wrapper.\n     */\n    function wrapperClone(wrapper) {\n      if (wrapper instanceof LazyWrapper) {\n        return wrapper.clone();\n      }\n      var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n      result.__actions__ = copyArray(wrapper.__actions__);\n      result.__index__  = wrapper.__index__;\n      result.__values__ = wrapper.__values__;\n      return result;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an array of elements split into groups the length of `size`.\n     * If `array` can't be split evenly, the final chunk will be the remaining\n     * elements.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to process.\n     * @param {number} [size=1] The length of each chunk\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the new array of chunks.\n     * @example\n     *\n     * _.chunk(['a', 'b', 'c', 'd'], 2);\n     * // => [['a', 'b'], ['c', 'd']]\n     *\n     * _.chunk(['a', 'b', 'c', 'd'], 3);\n     * // => [['a', 'b', 'c'], ['d']]\n     */\n    function chunk(array, size, guard) {\n      if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n        size = 1;\n      } else {\n        size = nativeMax(toInteger(size), 0);\n      }\n      var length = array == null ? 0 : array.length;\n      if (!length || size < 1) {\n        return [];\n      }\n      var index = 0,\n          resIndex = 0,\n          result = Array(nativeCeil(length / size));\n\n      while (index < length) {\n        result[resIndex++] = baseSlice(array, index, (index += size));\n      }\n      return result;\n    }\n\n    /**\n     * Creates an array with all falsey values removed. The values `false`, `null`,\n     * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to compact.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.compact([0, 1, false, 2, '', 3]);\n     * // => [1, 2, 3]\n     */\n    function compact(array) {\n      var index = -1,\n          length = array == null ? 0 : array.length,\n          resIndex = 0,\n          result = [];\n\n      while (++index < length) {\n        var value = array[index];\n        if (value) {\n          result[resIndex++] = value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Creates a new array concatenating `array` with any additional arrays\n     * and/or values.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to concatenate.\n     * @param {...*} [values] The values to concatenate.\n     * @returns {Array} Returns the new concatenated array.\n     * @example\n     *\n     * var array = [1];\n     * var other = _.concat(array, 2, [3], [[4]]);\n     *\n     * console.log(other);\n     * // => [1, 2, 3, [4]]\n     *\n     * console.log(array);\n     * // => [1]\n     */\n    function concat() {\n      var length = arguments.length;\n      if (!length) {\n        return [];\n      }\n      var args = Array(length - 1),\n          array = arguments[0],\n          index = length;\n\n      while (index--) {\n        args[index - 1] = arguments[index];\n      }\n      return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n    }\n\n    /**\n     * Creates an array of `array` values not included in the other given arrays\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. The order and references of result values are\n     * determined by the first array.\n     *\n     * **Note:** Unlike `_.pullAll`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.without, _.xor\n     * @example\n     *\n     * _.difference([2, 1], [2, 3]);\n     * // => [1]\n     */\n    var difference = baseRest(function(array, values) {\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n        : [];\n    });\n\n    /**\n     * This method is like `_.difference` except that it accepts `iteratee` which\n     * is invoked for each element of `array` and `values` to generate the criterion\n     * by which they're compared. The order and references of result values are\n     * determined by the first array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n     * // => [{ 'x': 2 }]\n     */\n    var differenceBy = baseRest(function(array, values) {\n      var iteratee = last(values);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n        : [];\n    });\n\n    /**\n     * This method is like `_.difference` except that it accepts `comparator`\n     * which is invoked to compare elements of `array` to `values`. The order and\n     * references of result values are determined by the first array. The comparator\n     * is invoked with two arguments: (arrVal, othVal).\n     *\n     * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     *\n     * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n     * // => [{ 'x': 2, 'y': 1 }]\n     */\n    var differenceWith = baseRest(function(array, values) {\n      var comparator = last(values);\n      if (isArrayLikeObject(comparator)) {\n        comparator = undefined;\n      }\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n        : [];\n    });\n\n    /**\n     * Creates a slice of `array` with `n` elements dropped from the beginning.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to drop.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.drop([1, 2, 3]);\n     * // => [2, 3]\n     *\n     * _.drop([1, 2, 3], 2);\n     * // => [3]\n     *\n     * _.drop([1, 2, 3], 5);\n     * // => []\n     *\n     * _.drop([1, 2, 3], 0);\n     * // => [1, 2, 3]\n     */\n    function drop(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      return baseSlice(array, n < 0 ? 0 : n, length);\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements dropped from the end.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to drop.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.dropRight([1, 2, 3]);\n     * // => [1, 2]\n     *\n     * _.dropRight([1, 2, 3], 2);\n     * // => [1]\n     *\n     * _.dropRight([1, 2, 3], 5);\n     * // => []\n     *\n     * _.dropRight([1, 2, 3], 0);\n     * // => [1, 2, 3]\n     */\n    function dropRight(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      n = length - n;\n      return baseSlice(array, 0, n < 0 ? 0 : n);\n    }\n\n    /**\n     * Creates a slice of `array` excluding elements dropped from the end.\n     * Elements are dropped until `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.dropRightWhile(users, function(o) { return !o.active; });\n     * // => objects for ['barney']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.dropRightWhile(users, ['active', false]);\n     * // => objects for ['barney']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.dropRightWhile(users, 'active');\n     * // => objects for ['barney', 'fred', 'pebbles']\n     */\n    function dropRightWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), true, true)\n        : [];\n    }\n\n    /**\n     * Creates a slice of `array` excluding elements dropped from the beginning.\n     * Elements are dropped until `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': false },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': true }\n     * ];\n     *\n     * _.dropWhile(users, function(o) { return !o.active; });\n     * // => objects for ['pebbles']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.dropWhile(users, { 'user': 'barney', 'active': false });\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.dropWhile(users, ['active', false]);\n     * // => objects for ['pebbles']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.dropWhile(users, 'active');\n     * // => objects for ['barney', 'fred', 'pebbles']\n     */\n    function dropWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), true)\n        : [];\n    }\n\n    /**\n     * Fills elements of `array` with `value` from `start` up to, but not\n     * including, `end`.\n     *\n     * **Note:** This method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Array\n     * @param {Array} array The array to fill.\n     * @param {*} value The value to fill `array` with.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _.fill(array, 'a');\n     * console.log(array);\n     * // => ['a', 'a', 'a']\n     *\n     * _.fill(Array(3), 2);\n     * // => [2, 2, 2]\n     *\n     * _.fill([4, 6, 8, 10], '*', 1, 3);\n     * // => [4, '*', '*', 10]\n     */\n    function fill(array, value, start, end) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n        start = 0;\n        end = length;\n      }\n      return baseFill(array, value, start, end);\n    }\n\n    /**\n     * This method is like `_.find` except that it returns the index of the first\n     * element `predicate` returns truthy for instead of the element itself.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @returns {number} Returns the index of the found element, else `-1`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': false },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': true }\n     * ];\n     *\n     * _.findIndex(users, function(o) { return o.user == 'barney'; });\n     * // => 0\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findIndex(users, { 'user': 'fred', 'active': false });\n     * // => 1\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findIndex(users, ['active', false]);\n     * // => 0\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findIndex(users, 'active');\n     * // => 2\n     */\n    function findIndex(array, predicate, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = fromIndex == null ? 0 : toInteger(fromIndex);\n      if (index < 0) {\n        index = nativeMax(length + index, 0);\n      }\n      return baseFindIndex(array, getIteratee(predicate, 3), index);\n    }\n\n    /**\n     * This method is like `_.findIndex` except that it iterates over elements\n     * of `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=array.length-1] The index to search from.\n     * @returns {number} Returns the index of the found element, else `-1`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n     * // => 2\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n     * // => 0\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findLastIndex(users, ['active', false]);\n     * // => 2\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findLastIndex(users, 'active');\n     * // => 0\n     */\n    function findLastIndex(array, predicate, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = length - 1;\n      if (fromIndex !== undefined) {\n        index = toInteger(fromIndex);\n        index = fromIndex < 0\n          ? nativeMax(length + index, 0)\n          : nativeMin(index, length - 1);\n      }\n      return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n    }\n\n    /**\n     * Flattens `array` a single level deep.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to flatten.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * _.flatten([1, [2, [3, [4]], 5]]);\n     * // => [1, 2, [3, [4]], 5]\n     */\n    function flatten(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseFlatten(array, 1) : [];\n    }\n\n    /**\n     * Recursively flattens `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to flatten.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * _.flattenDeep([1, [2, [3, [4]], 5]]);\n     * // => [1, 2, 3, 4, 5]\n     */\n    function flattenDeep(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseFlatten(array, INFINITY) : [];\n    }\n\n    /**\n     * Recursively flatten `array` up to `depth` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.4.0\n     * @category Array\n     * @param {Array} array The array to flatten.\n     * @param {number} [depth=1] The maximum recursion depth.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * var array = [1, [2, [3, [4]], 5]];\n     *\n     * _.flattenDepth(array, 1);\n     * // => [1, 2, [3, [4]], 5]\n     *\n     * _.flattenDepth(array, 2);\n     * // => [1, 2, 3, [4], 5]\n     */\n    function flattenDepth(array, depth) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      depth = depth === undefined ? 1 : toInteger(depth);\n      return baseFlatten(array, depth);\n    }\n\n    /**\n     * The inverse of `_.toPairs`; this method returns an object composed\n     * from key-value `pairs`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} pairs The key-value pairs.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * _.fromPairs([['a', 1], ['b', 2]]);\n     * // => { 'a': 1, 'b': 2 }\n     */\n    function fromPairs(pairs) {\n      var index = -1,\n          length = pairs == null ? 0 : pairs.length,\n          result = {};\n\n      while (++index < length) {\n        var pair = pairs[index];\n        result[pair[0]] = pair[1];\n      }\n      return result;\n    }\n\n    /**\n     * Gets the first element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @alias first\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {*} Returns the first element of `array`.\n     * @example\n     *\n     * _.head([1, 2, 3]);\n     * // => 1\n     *\n     * _.head([]);\n     * // => undefined\n     */\n    function head(array) {\n      return (array && array.length) ? array[0] : undefined;\n    }\n\n    /**\n     * Gets the index at which the first occurrence of `value` is found in `array`\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. If `fromIndex` is negative, it's used as the\n     * offset from the end of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.indexOf([1, 2, 1, 2], 2);\n     * // => 1\n     *\n     * // Search from the `fromIndex`.\n     * _.indexOf([1, 2, 1, 2], 2, 2);\n     * // => 3\n     */\n    function indexOf(array, value, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = fromIndex == null ? 0 : toInteger(fromIndex);\n      if (index < 0) {\n        index = nativeMax(length + index, 0);\n      }\n      return baseIndexOf(array, value, index);\n    }\n\n    /**\n     * Gets all but the last element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.initial([1, 2, 3]);\n     * // => [1, 2]\n     */\n    function initial(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseSlice(array, 0, -1) : [];\n    }\n\n    /**\n     * Creates an array of unique values that are included in all given arrays\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. The order and references of result values are\n     * determined by the first array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * _.intersection([2, 1], [2, 3]);\n     * // => [2]\n     */\n    var intersection = baseRest(function(arrays) {\n      var mapped = arrayMap(arrays, castArrayLikeObject);\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped)\n        : [];\n    });\n\n    /**\n     * This method is like `_.intersection` except that it accepts `iteratee`\n     * which is invoked for each element of each `arrays` to generate the criterion\n     * by which they're compared. The order and references of result values are\n     * determined by the first array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [2.1]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }]\n     */\n    var intersectionBy = baseRest(function(arrays) {\n      var iteratee = last(arrays),\n          mapped = arrayMap(arrays, castArrayLikeObject);\n\n      if (iteratee === last(mapped)) {\n        iteratee = undefined;\n      } else {\n        mapped.pop();\n      }\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped, getIteratee(iteratee, 2))\n        : [];\n    });\n\n    /**\n     * This method is like `_.intersection` except that it accepts `comparator`\n     * which is invoked to compare elements of `arrays`. The order and references\n     * of result values are determined by the first array. The comparator is\n     * invoked with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.intersectionWith(objects, others, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }]\n     */\n    var intersectionWith = baseRest(function(arrays) {\n      var comparator = last(arrays),\n          mapped = arrayMap(arrays, castArrayLikeObject);\n\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      if (comparator) {\n        mapped.pop();\n      }\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped, undefined, comparator)\n        : [];\n    });\n\n    /**\n     * Converts all elements in `array` into a string separated by `separator`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to convert.\n     * @param {string} [separator=','] The element separator.\n     * @returns {string} Returns the joined string.\n     * @example\n     *\n     * _.join(['a', 'b', 'c'], '~');\n     * // => 'a~b~c'\n     */\n    function join(array, separator) {\n      return array == null ? '' : nativeJoin.call(array, separator);\n    }\n\n    /**\n     * Gets the last element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {*} Returns the last element of `array`.\n     * @example\n     *\n     * _.last([1, 2, 3]);\n     * // => 3\n     */\n    function last(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? array[length - 1] : undefined;\n    }\n\n    /**\n     * This method is like `_.indexOf` except that it iterates over elements of\n     * `array` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=array.length-1] The index to search from.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.lastIndexOf([1, 2, 1, 2], 2);\n     * // => 3\n     *\n     * // Search from the `fromIndex`.\n     * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n     * // => 1\n     */\n    function lastIndexOf(array, value, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = length;\n      if (fromIndex !== undefined) {\n        index = toInteger(fromIndex);\n        index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n      }\n      return value === value\n        ? strictLastIndexOf(array, value, index)\n        : baseFindIndex(array, baseIsNaN, index, true);\n    }\n\n    /**\n     * Gets the element at index `n` of `array`. If `n` is negative, the nth\n     * element from the end is returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.11.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=0] The index of the element to return.\n     * @returns {*} Returns the nth element of `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'd'];\n     *\n     * _.nth(array, 1);\n     * // => 'b'\n     *\n     * _.nth(array, -2);\n     * // => 'c';\n     */\n    function nth(array, n) {\n      return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n    }\n\n    /**\n     * Removes all given values from `array` using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n     * to remove elements from an array by predicate.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {...*} [values] The values to remove.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n     *\n     * _.pull(array, 'a', 'c');\n     * console.log(array);\n     * // => ['b', 'b']\n     */\n    var pull = baseRest(pullAll);\n\n    /**\n     * This method is like `_.pull` except that it accepts an array of values to remove.\n     *\n     * **Note:** Unlike `_.difference`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n     *\n     * _.pullAll(array, ['a', 'c']);\n     * console.log(array);\n     * // => ['b', 'b']\n     */\n    function pullAll(array, values) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values)\n        : array;\n    }\n\n    /**\n     * This method is like `_.pullAll` except that it accepts `iteratee` which is\n     * invoked for each element of `array` and `values` to generate the criterion\n     * by which they're compared. The iteratee is invoked with one argument: (value).\n     *\n     * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n     *\n     * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n     * console.log(array);\n     * // => [{ 'x': 2 }]\n     */\n    function pullAllBy(array, values, iteratee) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values, getIteratee(iteratee, 2))\n        : array;\n    }\n\n    /**\n     * This method is like `_.pullAll` except that it accepts `comparator` which\n     * is invoked to compare elements of `array` to `values`. The comparator is\n     * invoked with two arguments: (arrVal, othVal).\n     *\n     * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n     *\n     * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n     * console.log(array);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n     */\n    function pullAllWith(array, values, comparator) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values, undefined, comparator)\n        : array;\n    }\n\n    /**\n     * Removes elements from `array` corresponding to `indexes` and returns an\n     * array of removed elements.\n     *\n     * **Note:** Unlike `_.at`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n     * @returns {Array} Returns the new array of removed elements.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'd'];\n     * var pulled = _.pullAt(array, [1, 3]);\n     *\n     * console.log(array);\n     * // => ['a', 'c']\n     *\n     * console.log(pulled);\n     * // => ['b', 'd']\n     */\n    var pullAt = flatRest(function(array, indexes) {\n      var length = array == null ? 0 : array.length,\n          result = baseAt(array, indexes);\n\n      basePullAt(array, arrayMap(indexes, function(index) {\n        return isIndex(index, length) ? +index : index;\n      }).sort(compareAscending));\n\n      return result;\n    });\n\n    /**\n     * Removes all elements from `array` that `predicate` returns truthy for\n     * and returns an array of the removed elements. The predicate is invoked\n     * with three arguments: (value, index, array).\n     *\n     * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n     * to pull elements from an array by value.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new array of removed elements.\n     * @example\n     *\n     * var array = [1, 2, 3, 4];\n     * var evens = _.remove(array, function(n) {\n     *   return n % 2 == 0;\n     * });\n     *\n     * console.log(array);\n     * // => [1, 3]\n     *\n     * console.log(evens);\n     * // => [2, 4]\n     */\n    function remove(array, predicate) {\n      var result = [];\n      if (!(array && array.length)) {\n        return result;\n      }\n      var index = -1,\n          indexes = [],\n          length = array.length;\n\n      predicate = getIteratee(predicate, 3);\n      while (++index < length) {\n        var value = array[index];\n        if (predicate(value, index, array)) {\n          result.push(value);\n          indexes.push(index);\n        }\n      }\n      basePullAt(array, indexes);\n      return result;\n    }\n\n    /**\n     * Reverses `array` so that the first element becomes the last, the second\n     * element becomes the second to last, and so on.\n     *\n     * **Note:** This method mutates `array` and is based on\n     * [`Array#reverse`](https://mdn.io/Array/reverse).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _.reverse(array);\n     * // => [3, 2, 1]\n     *\n     * console.log(array);\n     * // => [3, 2, 1]\n     */\n    function reverse(array) {\n      return array == null ? array : nativeReverse.call(array);\n    }\n\n    /**\n     * Creates a slice of `array` from `start` up to, but not including, `end`.\n     *\n     * **Note:** This method is used instead of\n     * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n     * returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to slice.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function slice(array, start, end) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n        start = 0;\n        end = length;\n      }\n      else {\n        start = start == null ? 0 : toInteger(start);\n        end = end === undefined ? length : toInteger(end);\n      }\n      return baseSlice(array, start, end);\n    }\n\n    /**\n     * Uses a binary search to determine the lowest index at which `value`\n     * should be inserted into `array` in order to maintain its sort order.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * _.sortedIndex([30, 50], 40);\n     * // => 1\n     */\n    function sortedIndex(array, value) {\n      return baseSortedIndex(array, value);\n    }\n\n    /**\n     * This method is like `_.sortedIndex` except that it accepts `iteratee`\n     * which is invoked for `value` and each element of `array` to compute their\n     * sort ranking. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * var objects = [{ 'x': 4 }, { 'x': 5 }];\n     *\n     * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n     * // => 0\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n     * // => 0\n     */\n    function sortedIndexBy(array, value, iteratee) {\n      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n    }\n\n    /**\n     * This method is like `_.indexOf` except that it performs a binary\n     * search on a sorted `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n     * // => 1\n     */\n    function sortedIndexOf(array, value) {\n      var length = array == null ? 0 : array.length;\n      if (length) {\n        var index = baseSortedIndex(array, value);\n        if (index < length && eq(array[index], value)) {\n          return index;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * This method is like `_.sortedIndex` except that it returns the highest\n     * index at which `value` should be inserted into `array` in order to\n     * maintain its sort order.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n     * // => 4\n     */\n    function sortedLastIndex(array, value) {\n      return baseSortedIndex(array, value, true);\n    }\n\n    /**\n     * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n     * which is invoked for `value` and each element of `array` to compute their\n     * sort ranking. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * var objects = [{ 'x': 4 }, { 'x': 5 }];\n     *\n     * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n     * // => 1\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n     * // => 1\n     */\n    function sortedLastIndexBy(array, value, iteratee) {\n      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n    }\n\n    /**\n     * This method is like `_.lastIndexOf` except that it performs a binary\n     * search on a sorted `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n     * // => 3\n     */\n    function sortedLastIndexOf(array, value) {\n      var length = array == null ? 0 : array.length;\n      if (length) {\n        var index = baseSortedIndex(array, value, true) - 1;\n        if (eq(array[index], value)) {\n          return index;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * This method is like `_.uniq` except that it's designed and optimized\n     * for sorted arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.sortedUniq([1, 1, 2]);\n     * // => [1, 2]\n     */\n    function sortedUniq(array) {\n      return (array && array.length)\n        ? baseSortedUniq(array)\n        : [];\n    }\n\n    /**\n     * This method is like `_.uniqBy` except that it's designed and optimized\n     * for sorted arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n     * // => [1.1, 2.3]\n     */\n    function sortedUniqBy(array, iteratee) {\n      return (array && array.length)\n        ? baseSortedUniq(array, getIteratee(iteratee, 2))\n        : [];\n    }\n\n    /**\n     * Gets all but the first element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.tail([1, 2, 3]);\n     * // => [2, 3]\n     */\n    function tail(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseSlice(array, 1, length) : [];\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements taken from the beginning.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to take.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.take([1, 2, 3]);\n     * // => [1]\n     *\n     * _.take([1, 2, 3], 2);\n     * // => [1, 2]\n     *\n     * _.take([1, 2, 3], 5);\n     * // => [1, 2, 3]\n     *\n     * _.take([1, 2, 3], 0);\n     * // => []\n     */\n    function take(array, n, guard) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      return baseSlice(array, 0, n < 0 ? 0 : n);\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements taken from the end.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to take.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.takeRight([1, 2, 3]);\n     * // => [3]\n     *\n     * _.takeRight([1, 2, 3], 2);\n     * // => [2, 3]\n     *\n     * _.takeRight([1, 2, 3], 5);\n     * // => [1, 2, 3]\n     *\n     * _.takeRight([1, 2, 3], 0);\n     * // => []\n     */\n    function takeRight(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      n = length - n;\n      return baseSlice(array, n < 0 ? 0 : n, length);\n    }\n\n    /**\n     * Creates a slice of `array` with elements taken from the end. Elements are\n     * taken until `predicate` returns falsey. The predicate is invoked with\n     * three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.takeRightWhile(users, function(o) { return !o.active; });\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n     * // => objects for ['pebbles']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.takeRightWhile(users, ['active', false]);\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.takeRightWhile(users, 'active');\n     * // => []\n     */\n    function takeRightWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), false, true)\n        : [];\n    }\n\n    /**\n     * Creates a slice of `array` with elements taken from the beginning. Elements\n     * are taken until `predicate` returns falsey. The predicate is invoked with\n     * three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': false },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': true }\n     * ];\n     *\n     * _.takeWhile(users, function(o) { return !o.active; });\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.takeWhile(users, { 'user': 'barney', 'active': false });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.takeWhile(users, ['active', false]);\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.takeWhile(users, 'active');\n     * // => []\n     */\n    function takeWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3))\n        : [];\n    }\n\n    /**\n     * Creates an array of unique values, in order, from all given arrays using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * _.union([2], [1, 2]);\n     * // => [2, 1]\n     */\n    var union = baseRest(function(arrays) {\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n    });\n\n    /**\n     * This method is like `_.union` except that it accepts `iteratee` which is\n     * invoked for each element of each `arrays` to generate the criterion by\n     * which uniqueness is computed. Result values are chosen from the first\n     * array in which the value occurs. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n     * // => [2.1, 1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }, { 'x': 2 }]\n     */\n    var unionBy = baseRest(function(arrays) {\n      var iteratee = last(arrays);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n    });\n\n    /**\n     * This method is like `_.union` except that it accepts `comparator` which\n     * is invoked to compare elements of `arrays`. Result values are chosen from\n     * the first array in which the value occurs. The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.unionWith(objects, others, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n     */\n    var unionWith = baseRest(function(arrays) {\n      var comparator = last(arrays);\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n    });\n\n    /**\n     * Creates a duplicate-free version of an array, using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons, in which only the first occurrence of each element\n     * is kept. The order of result values is determined by the order they occur\n     * in the array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.uniq([2, 1, 2]);\n     * // => [2, 1]\n     */\n    function uniq(array) {\n      return (array && array.length) ? baseUniq(array) : [];\n    }\n\n    /**\n     * This method is like `_.uniq` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * uniqueness is computed. The order of result values is determined by the\n     * order they occur in the array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n     * // => [2.1, 1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }, { 'x': 2 }]\n     */\n    function uniqBy(array, iteratee) {\n      return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n    }\n\n    /**\n     * This method is like `_.uniq` except that it accepts `comparator` which\n     * is invoked to compare elements of `array`. The order of result values is\n     * determined by the order they occur in the array.The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.uniqWith(objects, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n     */\n    function uniqWith(array, comparator) {\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n    }\n\n    /**\n     * This method is like `_.zip` except that it accepts an array of grouped\n     * elements and creates an array regrouping the elements to their pre-zip\n     * configuration.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.2.0\n     * @category Array\n     * @param {Array} array The array of grouped elements to process.\n     * @returns {Array} Returns the new array of regrouped elements.\n     * @example\n     *\n     * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n     * // => [['a', 1, true], ['b', 2, false]]\n     *\n     * _.unzip(zipped);\n     * // => [['a', 'b'], [1, 2], [true, false]]\n     */\n    function unzip(array) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      var length = 0;\n      array = arrayFilter(array, function(group) {\n        if (isArrayLikeObject(group)) {\n          length = nativeMax(group.length, length);\n          return true;\n        }\n      });\n      return baseTimes(length, function(index) {\n        return arrayMap(array, baseProperty(index));\n      });\n    }\n\n    /**\n     * This method is like `_.unzip` except that it accepts `iteratee` to specify\n     * how regrouped values should be combined. The iteratee is invoked with the\n     * elements of each group: (...group).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Array\n     * @param {Array} array The array of grouped elements to process.\n     * @param {Function} [iteratee=_.identity] The function to combine\n     *  regrouped values.\n     * @returns {Array} Returns the new array of regrouped elements.\n     * @example\n     *\n     * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n     * // => [[1, 10, 100], [2, 20, 200]]\n     *\n     * _.unzipWith(zipped, _.add);\n     * // => [3, 30, 300]\n     */\n    function unzipWith(array, iteratee) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      var result = unzip(array);\n      if (iteratee == null) {\n        return result;\n      }\n      return arrayMap(result, function(group) {\n        return apply(iteratee, undefined, group);\n      });\n    }\n\n    /**\n     * Creates an array excluding all given values using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * **Note:** Unlike `_.pull`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...*} [values] The values to exclude.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.difference, _.xor\n     * @example\n     *\n     * _.without([2, 1, 2, 3], 1, 2);\n     * // => [3]\n     */\n    var without = baseRest(function(array, values) {\n      return isArrayLikeObject(array)\n        ? baseDifference(array, values)\n        : [];\n    });\n\n    /**\n     * Creates an array of unique values that is the\n     * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n     * of the given arrays. The order of result values is determined by the order\n     * they occur in the arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.difference, _.without\n     * @example\n     *\n     * _.xor([2, 1], [2, 3]);\n     * // => [1, 3]\n     */\n    var xor = baseRest(function(arrays) {\n      return baseXor(arrayFilter(arrays, isArrayLikeObject));\n    });\n\n    /**\n     * This method is like `_.xor` except that it accepts `iteratee` which is\n     * invoked for each element of each `arrays` to generate the criterion by\n     * which by which they're compared. The order of result values is determined\n     * by the order they occur in the arrays. The iteratee is invoked with one\n     * argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [1.2, 3.4]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 2 }]\n     */\n    var xorBy = baseRest(function(arrays) {\n      var iteratee = last(arrays);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n    });\n\n    /**\n     * This method is like `_.xor` except that it accepts `comparator` which is\n     * invoked to compare elements of `arrays`. The order of result values is\n     * determined by the order they occur in the arrays. The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.xorWith(objects, others, _.isEqual);\n     * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n     */\n    var xorWith = baseRest(function(arrays) {\n      var comparator = last(arrays);\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n    });\n\n    /**\n     * Creates an array of grouped elements, the first of which contains the\n     * first elements of the given arrays, the second of which contains the\n     * second elements of the given arrays, and so on.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to process.\n     * @returns {Array} Returns the new array of grouped elements.\n     * @example\n     *\n     * _.zip(['a', 'b'], [1, 2], [true, false]);\n     * // => [['a', 1, true], ['b', 2, false]]\n     */\n    var zip = baseRest(unzip);\n\n    /**\n     * This method is like `_.fromPairs` except that it accepts two arrays,\n     * one of property identifiers and one of corresponding values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.4.0\n     * @category Array\n     * @param {Array} [props=[]] The property identifiers.\n     * @param {Array} [values=[]] The property values.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * _.zipObject(['a', 'b'], [1, 2]);\n     * // => { 'a': 1, 'b': 2 }\n     */\n    function zipObject(props, values) {\n      return baseZipObject(props || [], values || [], assignValue);\n    }\n\n    /**\n     * This method is like `_.zipObject` except that it supports property paths.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.1.0\n     * @category Array\n     * @param {Array} [props=[]] The property identifiers.\n     * @param {Array} [values=[]] The property values.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n     * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n     */\n    function zipObjectDeep(props, values) {\n      return baseZipObject(props || [], values || [], baseSet);\n    }\n\n    /**\n     * This method is like `_.zip` except that it accepts `iteratee` to specify\n     * how grouped values should be combined. The iteratee is invoked with the\n     * elements of each group: (...group).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to process.\n     * @param {Function} [iteratee=_.identity] The function to combine\n     *  grouped values.\n     * @returns {Array} Returns the new array of grouped elements.\n     * @example\n     *\n     * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n     *   return a + b + c;\n     * });\n     * // => [111, 222]\n     */\n    var zipWith = baseRest(function(arrays) {\n      var length = arrays.length,\n          iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n      iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n      return unzipWith(arrays, iteratee);\n    });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n     * chain sequences enabled. The result of such sequences must be unwrapped\n     * with `_#value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.3.0\n     * @category Seq\n     * @param {*} value The value to wrap.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36 },\n     *   { 'user': 'fred',    'age': 40 },\n     *   { 'user': 'pebbles', 'age': 1 }\n     * ];\n     *\n     * var youngest = _\n     *   .chain(users)\n     *   .sortBy('age')\n     *   .map(function(o) {\n     *     return o.user + ' is ' + o.age;\n     *   })\n     *   .head()\n     *   .value();\n     * // => 'pebbles is 1'\n     */\n    function chain(value) {\n      var result = lodash(value);\n      result.__chain__ = true;\n      return result;\n    }\n\n    /**\n     * This method invokes `interceptor` and returns `value`. The interceptor\n     * is invoked with one argument; (value). The purpose of this method is to\n     * \"tap into\" a method chain sequence in order to modify intermediate results.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @param {*} value The value to provide to `interceptor`.\n     * @param {Function} interceptor The function to invoke.\n     * @returns {*} Returns `value`.\n     * @example\n     *\n     * _([1, 2, 3])\n     *  .tap(function(array) {\n     *    // Mutate input array.\n     *    array.pop();\n     *  })\n     *  .reverse()\n     *  .value();\n     * // => [2, 1]\n     */\n    function tap(value, interceptor) {\n      interceptor(value);\n      return value;\n    }\n\n    /**\n     * This method is like `_.tap` except that it returns the result of `interceptor`.\n     * The purpose of this method is to \"pass thru\" values replacing intermediate\n     * results in a method chain sequence.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Seq\n     * @param {*} value The value to provide to `interceptor`.\n     * @param {Function} interceptor The function to invoke.\n     * @returns {*} Returns the result of `interceptor`.\n     * @example\n     *\n     * _('  abc  ')\n     *  .chain()\n     *  .trim()\n     *  .thru(function(value) {\n     *    return [value];\n     *  })\n     *  .value();\n     * // => ['abc']\n     */\n    function thru(value, interceptor) {\n      return interceptor(value);\n    }\n\n    /**\n     * This method is the wrapper version of `_.at`.\n     *\n     * @name at\n     * @memberOf _\n     * @since 1.0.0\n     * @category Seq\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n     *\n     * _(object).at(['a[0].b.c', 'a[1]']).value();\n     * // => [3, 4]\n     */\n    var wrapperAt = flatRest(function(paths) {\n      var length = paths.length,\n          start = length ? paths[0] : 0,\n          value = this.__wrapped__,\n          interceptor = function(object) { return baseAt(object, paths); };\n\n      if (length > 1 || this.__actions__.length ||\n          !(value instanceof LazyWrapper) || !isIndex(start)) {\n        return this.thru(interceptor);\n      }\n      value = value.slice(start, +start + (length ? 1 : 0));\n      value.__actions__.push({\n        'func': thru,\n        'args': [interceptor],\n        'thisArg': undefined\n      });\n      return new LodashWrapper(value, this.__chain__).thru(function(array) {\n        if (length && !array.length) {\n          array.push(undefined);\n        }\n        return array;\n      });\n    });\n\n    /**\n     * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n     *\n     * @name chain\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36 },\n     *   { 'user': 'fred',   'age': 40 }\n     * ];\n     *\n     * // A sequence without explicit chaining.\n     * _(users).head();\n     * // => { 'user': 'barney', 'age': 36 }\n     *\n     * // A sequence with explicit chaining.\n     * _(users)\n     *   .chain()\n     *   .head()\n     *   .pick('user')\n     *   .value();\n     * // => { 'user': 'barney' }\n     */\n    function wrapperChain() {\n      return chain(this);\n    }\n\n    /**\n     * Executes the chain sequence and returns the wrapped result.\n     *\n     * @name commit\n     * @memberOf _\n     * @since 3.2.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var array = [1, 2];\n     * var wrapped = _(array).push(3);\n     *\n     * console.log(array);\n     * // => [1, 2]\n     *\n     * wrapped = wrapped.commit();\n     * console.log(array);\n     * // => [1, 2, 3]\n     *\n     * wrapped.last();\n     * // => 3\n     *\n     * console.log(array);\n     * // => [1, 2, 3]\n     */\n    function wrapperCommit() {\n      return new LodashWrapper(this.value(), this.__chain__);\n    }\n\n    /**\n     * Gets the next value on a wrapped object following the\n     * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n     *\n     * @name next\n     * @memberOf _\n     * @since 4.0.0\n     * @category Seq\n     * @returns {Object} Returns the next iterator value.\n     * @example\n     *\n     * var wrapped = _([1, 2]);\n     *\n     * wrapped.next();\n     * // => { 'done': false, 'value': 1 }\n     *\n     * wrapped.next();\n     * // => { 'done': false, 'value': 2 }\n     *\n     * wrapped.next();\n     * // => { 'done': true, 'value': undefined }\n     */\n    function wrapperNext() {\n      if (this.__values__ === undefined) {\n        this.__values__ = toArray(this.value());\n      }\n      var done = this.__index__ >= this.__values__.length,\n          value = done ? undefined : this.__values__[this.__index__++];\n\n      return { 'done': done, 'value': value };\n    }\n\n    /**\n     * Enables the wrapper to be iterable.\n     *\n     * @name Symbol.iterator\n     * @memberOf _\n     * @since 4.0.0\n     * @category Seq\n     * @returns {Object} Returns the wrapper object.\n     * @example\n     *\n     * var wrapped = _([1, 2]);\n     *\n     * wrapped[Symbol.iterator]() === wrapped;\n     * // => true\n     *\n     * Array.from(wrapped);\n     * // => [1, 2]\n     */\n    function wrapperToIterator() {\n      return this;\n    }\n\n    /**\n     * Creates a clone of the chain sequence planting `value` as the wrapped value.\n     *\n     * @name plant\n     * @memberOf _\n     * @since 3.2.0\n     * @category Seq\n     * @param {*} value The value to plant.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var wrapped = _([1, 2]).map(square);\n     * var other = wrapped.plant([3, 4]);\n     *\n     * other.value();\n     * // => [9, 16]\n     *\n     * wrapped.value();\n     * // => [1, 4]\n     */\n    function wrapperPlant(value) {\n      var result,\n          parent = this;\n\n      while (parent instanceof baseLodash) {\n        var clone = wrapperClone(parent);\n        clone.__index__ = 0;\n        clone.__values__ = undefined;\n        if (result) {\n          previous.__wrapped__ = clone;\n        } else {\n          result = clone;\n        }\n        var previous = clone;\n        parent = parent.__wrapped__;\n      }\n      previous.__wrapped__ = value;\n      return result;\n    }\n\n    /**\n     * This method is the wrapper version of `_.reverse`.\n     *\n     * **Note:** This method mutates the wrapped array.\n     *\n     * @name reverse\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _(array).reverse().value()\n     * // => [3, 2, 1]\n     *\n     * console.log(array);\n     * // => [3, 2, 1]\n     */\n    function wrapperReverse() {\n      var value = this.__wrapped__;\n      if (value instanceof LazyWrapper) {\n        var wrapped = value;\n        if (this.__actions__.length) {\n          wrapped = new LazyWrapper(this);\n        }\n        wrapped = wrapped.reverse();\n        wrapped.__actions__.push({\n          'func': thru,\n          'args': [reverse],\n          'thisArg': undefined\n        });\n        return new LodashWrapper(wrapped, this.__chain__);\n      }\n      return this.thru(reverse);\n    }\n\n    /**\n     * Executes the chain sequence to resolve the unwrapped value.\n     *\n     * @name value\n     * @memberOf _\n     * @since 0.1.0\n     * @alias toJSON, valueOf\n     * @category Seq\n     * @returns {*} Returns the resolved unwrapped value.\n     * @example\n     *\n     * _([1, 2, 3]).value();\n     * // => [1, 2, 3]\n     */\n    function wrapperValue() {\n      return baseWrapperValue(this.__wrapped__, this.__actions__);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The corresponding value of\n     * each key is the number of times the key was returned by `iteratee`. The\n     * iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * _.countBy([6.1, 4.2, 6.3], Math.floor);\n     * // => { '4': 1, '6': 2 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.countBy(['one', 'two', 'three'], 'length');\n     * // => { '3': 2, '5': 1 }\n     */\n    var countBy = createAggregator(function(result, value, key) {\n      if (hasOwnProperty.call(result, key)) {\n        ++result[key];\n      } else {\n        baseAssignValue(result, key, 1);\n      }\n    });\n\n    /**\n     * Checks if `predicate` returns truthy for **all** elements of `collection`.\n     * Iteration is stopped once `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index|key, collection).\n     *\n     * **Note:** This method returns `true` for\n     * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n     * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n     * elements of empty collections.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {boolean} Returns `true` if all elements pass the predicate check,\n     *  else `false`.\n     * @example\n     *\n     * _.every([true, 1, null, 'yes'], Boolean);\n     * // => false\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': false },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.every(users, { 'user': 'barney', 'active': false });\n     * // => false\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.every(users, ['active', false]);\n     * // => true\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.every(users, 'active');\n     * // => false\n     */\n    function every(collection, predicate, guard) {\n      var func = isArray(collection) ? arrayEvery : baseEvery;\n      if (guard && isIterateeCall(collection, predicate, guard)) {\n        predicate = undefined;\n      }\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Iterates over elements of `collection`, returning an array of all elements\n     * `predicate` returns truthy for. The predicate is invoked with three\n     * arguments: (value, index|key, collection).\n     *\n     * **Note:** Unlike `_.remove`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     * @see _.reject\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': true },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * _.filter(users, function(o) { return !o.active; });\n     * // => objects for ['fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.filter(users, { 'age': 36, 'active': true });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.filter(users, ['active', false]);\n     * // => objects for ['fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.filter(users, 'active');\n     * // => objects for ['barney']\n     */\n    function filter(collection, predicate) {\n      var func = isArray(collection) ? arrayFilter : baseFilter;\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Iterates over elements of `collection`, returning the first element\n     * `predicate` returns truthy for. The predicate is invoked with three\n     * arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @returns {*} Returns the matched element, else `undefined`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36, 'active': true },\n     *   { 'user': 'fred',    'age': 40, 'active': false },\n     *   { 'user': 'pebbles', 'age': 1,  'active': true }\n     * ];\n     *\n     * _.find(users, function(o) { return o.age < 40; });\n     * // => object for 'barney'\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.find(users, { 'age': 1, 'active': true });\n     * // => object for 'pebbles'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.find(users, ['active', false]);\n     * // => object for 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.find(users, 'active');\n     * // => object for 'barney'\n     */\n    var find = createFind(findIndex);\n\n    /**\n     * This method is like `_.find` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=collection.length-1] The index to search from.\n     * @returns {*} Returns the matched element, else `undefined`.\n     * @example\n     *\n     * _.findLast([1, 2, 3, 4], function(n) {\n     *   return n % 2 == 1;\n     * });\n     * // => 3\n     */\n    var findLast = createFind(findLastIndex);\n\n    /**\n     * Creates a flattened array of values by running each element in `collection`\n     * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n     * with three arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [n, n];\n     * }\n     *\n     * _.flatMap([1, 2], duplicate);\n     * // => [1, 1, 2, 2]\n     */\n    function flatMap(collection, iteratee) {\n      return baseFlatten(map(collection, iteratee), 1);\n    }\n\n    /**\n     * This method is like `_.flatMap` except that it recursively flattens the\n     * mapped results.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [[[n, n]]];\n     * }\n     *\n     * _.flatMapDeep([1, 2], duplicate);\n     * // => [1, 1, 2, 2]\n     */\n    function flatMapDeep(collection, iteratee) {\n      return baseFlatten(map(collection, iteratee), INFINITY);\n    }\n\n    /**\n     * This method is like `_.flatMap` except that it recursively flattens the\n     * mapped results up to `depth` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {number} [depth=1] The maximum recursion depth.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [[[n, n]]];\n     * }\n     *\n     * _.flatMapDepth([1, 2], duplicate, 2);\n     * // => [[1, 1], [2, 2]]\n     */\n    function flatMapDepth(collection, iteratee, depth) {\n      depth = depth === undefined ? 1 : toInteger(depth);\n      return baseFlatten(map(collection, iteratee), depth);\n    }\n\n    /**\n     * Iterates over elements of `collection` and invokes `iteratee` for each element.\n     * The iteratee is invoked with three arguments: (value, index|key, collection).\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n     * property are iterated like arrays. To avoid this behavior use `_.forIn`\n     * or `_.forOwn` for object iteration.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @alias each\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     * @see _.forEachRight\n     * @example\n     *\n     * _.forEach([1, 2], function(value) {\n     *   console.log(value);\n     * });\n     * // => Logs `1` then `2`.\n     *\n     * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n     */\n    function forEach(collection, iteratee) {\n      var func = isArray(collection) ? arrayEach : baseEach;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.forEach` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @alias eachRight\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     * @see _.forEach\n     * @example\n     *\n     * _.forEachRight([1, 2], function(value) {\n     *   console.log(value);\n     * });\n     * // => Logs `2` then `1`.\n     */\n    function forEachRight(collection, iteratee) {\n      var func = isArray(collection) ? arrayEachRight : baseEachRight;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The order of grouped values\n     * is determined by the order they occur in `collection`. The corresponding\n     * value of each key is an array of elements responsible for generating the\n     * key. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n     * // => { '4': [4.2], '6': [6.1, 6.3] }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.groupBy(['one', 'two', 'three'], 'length');\n     * // => { '3': ['one', 'two'], '5': ['three'] }\n     */\n    var groupBy = createAggregator(function(result, value, key) {\n      if (hasOwnProperty.call(result, key)) {\n        result[key].push(value);\n      } else {\n        baseAssignValue(result, key, [value]);\n      }\n    });\n\n    /**\n     * Checks if `value` is in `collection`. If `collection` is a string, it's\n     * checked for a substring of `value`, otherwise\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * is used for equality comparisons. If `fromIndex` is negative, it's used as\n     * the offset from the end of `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object|string} collection The collection to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n     * @returns {boolean} Returns `true` if `value` is found, else `false`.\n     * @example\n     *\n     * _.includes([1, 2, 3], 1);\n     * // => true\n     *\n     * _.includes([1, 2, 3], 1, 2);\n     * // => false\n     *\n     * _.includes({ 'a': 1, 'b': 2 }, 1);\n     * // => true\n     *\n     * _.includes('abcd', 'bc');\n     * // => true\n     */\n    function includes(collection, value, fromIndex, guard) {\n      collection = isArrayLike(collection) ? collection : values(collection);\n      fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n      var length = collection.length;\n      if (fromIndex < 0) {\n        fromIndex = nativeMax(length + fromIndex, 0);\n      }\n      return isString(collection)\n        ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n        : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n    }\n\n    /**\n     * Invokes the method at `path` of each element in `collection`, returning\n     * an array of the results of each invoked method. Any additional arguments\n     * are provided to each invoked method. If `path` is a function, it's invoked\n     * for, and `this` bound to, each element in `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Array|Function|string} path The path of the method to invoke or\n     *  the function invoked per iteration.\n     * @param {...*} [args] The arguments to invoke each method with.\n     * @returns {Array} Returns the array of results.\n     * @example\n     *\n     * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n     * // => [[1, 5, 7], [1, 2, 3]]\n     *\n     * _.invokeMap([123, 456], String.prototype.split, '');\n     * // => [['1', '2', '3'], ['4', '5', '6']]\n     */\n    var invokeMap = baseRest(function(collection, path, args) {\n      var index = -1,\n          isFunc = typeof path == 'function',\n          result = isArrayLike(collection) ? Array(collection.length) : [];\n\n      baseEach(collection, function(value) {\n        result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n      });\n      return result;\n    });\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The corresponding value of\n     * each key is the last element responsible for generating the key. The\n     * iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * var array = [\n     *   { 'dir': 'left', 'code': 97 },\n     *   { 'dir': 'right', 'code': 100 }\n     * ];\n     *\n     * _.keyBy(array, function(o) {\n     *   return String.fromCharCode(o.code);\n     * });\n     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n     *\n     * _.keyBy(array, 'dir');\n     * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n     */\n    var keyBy = createAggregator(function(result, value, key) {\n      baseAssignValue(result, key, value);\n    });\n\n    /**\n     * Creates an array of values by running each element in `collection` thru\n     * `iteratee`. The iteratee is invoked with three arguments:\n     * (value, index|key, collection).\n     *\n     * Many lodash methods are guarded to work as iteratees for methods like\n     * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n     *\n     * The guarded methods are:\n     * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n     * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n     * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n     * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new mapped array.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * _.map([4, 8], square);\n     * // => [16, 64]\n     *\n     * _.map({ 'a': 4, 'b': 8 }, square);\n     * // => [16, 64] (iteration order is not guaranteed)\n     *\n     * var users = [\n     *   { 'user': 'barney' },\n     *   { 'user': 'fred' }\n     * ];\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.map(users, 'user');\n     * // => ['barney', 'fred']\n     */\n    function map(collection, iteratee) {\n      var func = isArray(collection) ? arrayMap : baseMap;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.sortBy` except that it allows specifying the sort\n     * orders of the iteratees to sort by. If `orders` is unspecified, all values\n     * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n     * descending or \"asc\" for ascending sort order of corresponding values.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n     *  The iteratees to sort by.\n     * @param {string[]} [orders] The sort orders of `iteratees`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n     * @returns {Array} Returns the new sorted array.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'fred',   'age': 48 },\n     *   { 'user': 'barney', 'age': 34 },\n     *   { 'user': 'fred',   'age': 40 },\n     *   { 'user': 'barney', 'age': 36 }\n     * ];\n     *\n     * // Sort by `user` in ascending order and by `age` in descending order.\n     * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n     */\n    function orderBy(collection, iteratees, orders, guard) {\n      if (collection == null) {\n        return [];\n      }\n      if (!isArray(iteratees)) {\n        iteratees = iteratees == null ? [] : [iteratees];\n      }\n      orders = guard ? undefined : orders;\n      if (!isArray(orders)) {\n        orders = orders == null ? [] : [orders];\n      }\n      return baseOrderBy(collection, iteratees, orders);\n    }\n\n    /**\n     * Creates an array of elements split into two groups, the first of which\n     * contains elements `predicate` returns truthy for, the second of which\n     * contains elements `predicate` returns falsey for. The predicate is\n     * invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the array of grouped elements.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36, 'active': false },\n     *   { 'user': 'fred',    'age': 40, 'active': true },\n     *   { 'user': 'pebbles', 'age': 1,  'active': false }\n     * ];\n     *\n     * _.partition(users, function(o) { return o.active; });\n     * // => objects for [['fred'], ['barney', 'pebbles']]\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.partition(users, { 'age': 1, 'active': false });\n     * // => objects for [['pebbles'], ['barney', 'fred']]\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.partition(users, ['active', false]);\n     * // => objects for [['barney', 'pebbles'], ['fred']]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.partition(users, 'active');\n     * // => objects for [['fred'], ['barney', 'pebbles']]\n     */\n    var partition = createAggregator(function(result, value, key) {\n      result[key ? 0 : 1].push(value);\n    }, function() { return [[], []]; });\n\n    /**\n     * Reduces `collection` to a value which is the accumulated result of running\n     * each element in `collection` thru `iteratee`, where each successive\n     * invocation is supplied the return value of the previous. If `accumulator`\n     * is not given, the first element of `collection` is used as the initial\n     * value. The iteratee is invoked with four arguments:\n     * (accumulator, value, index|key, collection).\n     *\n     * Many lodash methods are guarded to work as iteratees for methods like\n     * `_.reduce`, `_.reduceRight`, and `_.transform`.\n     *\n     * The guarded methods are:\n     * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n     * and `sortBy`\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The initial value.\n     * @returns {*} Returns the accumulated value.\n     * @see _.reduceRight\n     * @example\n     *\n     * _.reduce([1, 2], function(sum, n) {\n     *   return sum + n;\n     * }, 0);\n     * // => 3\n     *\n     * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n     *   (result[value] || (result[value] = [])).push(key);\n     *   return result;\n     * }, {});\n     * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n     */\n    function reduce(collection, iteratee, accumulator) {\n      var func = isArray(collection) ? arrayReduce : baseReduce,\n          initAccum = arguments.length < 3;\n\n      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n    }\n\n    /**\n     * This method is like `_.reduce` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The initial value.\n     * @returns {*} Returns the accumulated value.\n     * @see _.reduce\n     * @example\n     *\n     * var array = [[0, 1], [2, 3], [4, 5]];\n     *\n     * _.reduceRight(array, function(flattened, other) {\n     *   return flattened.concat(other);\n     * }, []);\n     * // => [4, 5, 2, 3, 0, 1]\n     */\n    function reduceRight(collection, iteratee, accumulator) {\n      var func = isArray(collection) ? arrayReduceRight : baseReduce,\n          initAccum = arguments.length < 3;\n\n      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n    }\n\n    /**\n     * The opposite of `_.filter`; this method returns the elements of `collection`\n     * that `predicate` does **not** return truthy for.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     * @see _.filter\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': false },\n     *   { 'user': 'fred',   'age': 40, 'active': true }\n     * ];\n     *\n     * _.reject(users, function(o) { return !o.active; });\n     * // => objects for ['fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.reject(users, { 'age': 40, 'active': true });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.reject(users, ['active', false]);\n     * // => objects for ['fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.reject(users, 'active');\n     * // => objects for ['barney']\n     */\n    function reject(collection, predicate) {\n      var func = isArray(collection) ? arrayFilter : baseFilter;\n      return func(collection, negate(getIteratee(predicate, 3)));\n    }\n\n    /**\n     * Gets a random element from `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to sample.\n     * @returns {*} Returns the random element.\n     * @example\n     *\n     * _.sample([1, 2, 3, 4]);\n     * // => 2\n     */\n    function sample(collection) {\n      var func = isArray(collection) ? arraySample : baseSample;\n      return func(collection);\n    }\n\n    /**\n     * Gets `n` random elements at unique keys from `collection` up to the\n     * size of `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to sample.\n     * @param {number} [n=1] The number of elements to sample.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the random elements.\n     * @example\n     *\n     * _.sampleSize([1, 2, 3], 2);\n     * // => [3, 1]\n     *\n     * _.sampleSize([1, 2, 3], 4);\n     * // => [2, 3, 1]\n     */\n    function sampleSize(collection, n, guard) {\n      if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n        n = 1;\n      } else {\n        n = toInteger(n);\n      }\n      var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n      return func(collection, n);\n    }\n\n    /**\n     * Creates an array of shuffled values, using a version of the\n     * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     * @example\n     *\n     * _.shuffle([1, 2, 3, 4]);\n     * // => [4, 1, 3, 2]\n     */\n    function shuffle(collection) {\n      var func = isArray(collection) ? arrayShuffle : baseShuffle;\n      return func(collection);\n    }\n\n    /**\n     * Gets the size of `collection` by returning its length for array-like\n     * values or the number of own enumerable string keyed properties for objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object|string} collection The collection to inspect.\n     * @returns {number} Returns the collection size.\n     * @example\n     *\n     * _.size([1, 2, 3]);\n     * // => 3\n     *\n     * _.size({ 'a': 1, 'b': 2 });\n     * // => 2\n     *\n     * _.size('pebbles');\n     * // => 7\n     */\n    function size(collection) {\n      if (collection == null) {\n        return 0;\n      }\n      if (isArrayLike(collection)) {\n        return isString(collection) ? stringSize(collection) : collection.length;\n      }\n      var tag = getTag(collection);\n      if (tag == mapTag || tag == setTag) {\n        return collection.size;\n      }\n      return baseKeys(collection).length;\n    }\n\n    /**\n     * Checks if `predicate` returns truthy for **any** element of `collection`.\n     * Iteration is stopped once `predicate` returns truthy. The predicate is\n     * invoked with three arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {boolean} Returns `true` if any element passes the predicate check,\n     *  else `false`.\n     * @example\n     *\n     * _.some([null, 0, 'yes', false], Boolean);\n     * // => true\n     *\n     * var users = [\n     *   { 'user': 'barney', 'active': true },\n     *   { 'user': 'fred',   'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.some(users, { 'user': 'barney', 'active': false });\n     * // => false\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.some(users, ['active', false]);\n     * // => true\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.some(users, 'active');\n     * // => true\n     */\n    function some(collection, predicate, guard) {\n      var func = isArray(collection) ? arraySome : baseSome;\n      if (guard && isIterateeCall(collection, predicate, guard)) {\n        predicate = undefined;\n      }\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Creates an array of elements, sorted in ascending order by the results of\n     * running each element in a collection thru each iteratee. This method\n     * performs a stable sort, that is, it preserves the original sort order of\n     * equal elements. The iteratees are invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {...(Function|Function[])} [iteratees=[_.identity]]\n     *  The iteratees to sort by.\n     * @returns {Array} Returns the new sorted array.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'fred',   'age': 48 },\n     *   { 'user': 'barney', 'age': 36 },\n     *   { 'user': 'fred',   'age': 40 },\n     *   { 'user': 'barney', 'age': 34 }\n     * ];\n     *\n     * _.sortBy(users, [function(o) { return o.user; }]);\n     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n     *\n     * _.sortBy(users, ['user', 'age']);\n     * // => objects for [['barney', 34], ['barney', 36], ['fred', 40], ['fred', 48]]\n     */\n    var sortBy = baseRest(function(collection, iteratees) {\n      if (collection == null) {\n        return [];\n      }\n      var length = iteratees.length;\n      if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n        iteratees = [];\n      } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n        iteratees = [iteratees[0]];\n      }\n      return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n    });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Gets the timestamp of the number of milliseconds that have elapsed since\n     * the Unix epoch (1 January 1970 00:00:00 UTC).\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Date\n     * @returns {number} Returns the timestamp.\n     * @example\n     *\n     * _.defer(function(stamp) {\n     *   console.log(_.now() - stamp);\n     * }, _.now());\n     * // => Logs the number of milliseconds it took for the deferred invocation.\n     */\n    var now = ctxNow || function() {\n      return root.Date.now();\n    };\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * The opposite of `_.before`; this method creates a function that invokes\n     * `func` once it's called `n` or more times.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {number} n The number of calls before `func` is invoked.\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * var saves = ['profile', 'settings'];\n     *\n     * var done = _.after(saves.length, function() {\n     *   console.log('done saving!');\n     * });\n     *\n     * _.forEach(saves, function(type) {\n     *   asyncSave({ 'type': type, 'complete': done });\n     * });\n     * // => Logs 'done saving!' after the two async saves have completed.\n     */\n    function after(n, func) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      n = toInteger(n);\n      return function() {\n        if (--n < 1) {\n          return func.apply(this, arguments);\n        }\n      };\n    }\n\n    /**\n     * Creates a function that invokes `func`, with up to `n` arguments,\n     * ignoring any additional arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to cap arguments for.\n     * @param {number} [n=func.length] The arity cap.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new capped function.\n     * @example\n     *\n     * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n     * // => [6, 8, 10]\n     */\n    function ary(func, n, guard) {\n      n = guard ? undefined : n;\n      n = (func && n == null) ? func.length : n;\n      return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n    }\n\n    /**\n     * Creates a function that invokes `func`, with the `this` binding and arguments\n     * of the created function, while it's called less than `n` times. Subsequent\n     * calls to the created function return the result of the last `func` invocation.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {number} n The number of calls at which `func` is no longer invoked.\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * jQuery(element).on('click', _.before(5, addContactToList));\n     * // => Allows adding up to 4 contacts to the list.\n     */\n    function before(n, func) {\n      var result;\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      n = toInteger(n);\n      return function() {\n        if (--n > 0) {\n          result = func.apply(this, arguments);\n        }\n        if (n <= 1) {\n          func = undefined;\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of `thisArg`\n     * and `partials` prepended to the arguments it receives.\n     *\n     * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n     * may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n     * property of bound functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to bind.\n     * @param {*} thisArg The `this` binding of `func`.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new bound function.\n     * @example\n     *\n     * function greet(greeting, punctuation) {\n     *   return greeting + ' ' + this.user + punctuation;\n     * }\n     *\n     * var object = { 'user': 'fred' };\n     *\n     * var bound = _.bind(greet, object, 'hi');\n     * bound('!');\n     * // => 'hi fred!'\n     *\n     * // Bound with placeholders.\n     * var bound = _.bind(greet, object, _, '!');\n     * bound('hi');\n     * // => 'hi fred!'\n     */\n    var bind = baseRest(function(func, thisArg, partials) {\n      var bitmask = WRAP_BIND_FLAG;\n      if (partials.length) {\n        var holders = replaceHolders(partials, getHolder(bind));\n        bitmask |= WRAP_PARTIAL_FLAG;\n      }\n      return createWrap(func, bitmask, thisArg, partials, holders);\n    });\n\n    /**\n     * Creates a function that invokes the method at `object[key]` with `partials`\n     * prepended to the arguments it receives.\n     *\n     * This method differs from `_.bind` by allowing bound functions to reference\n     * methods that may be redefined or don't yet exist. See\n     * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n     * for more details.\n     *\n     * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.10.0\n     * @category Function\n     * @param {Object} object The object to invoke the method on.\n     * @param {string} key The key of the method.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new bound function.\n     * @example\n     *\n     * var object = {\n     *   'user': 'fred',\n     *   'greet': function(greeting, punctuation) {\n     *     return greeting + ' ' + this.user + punctuation;\n     *   }\n     * };\n     *\n     * var bound = _.bindKey(object, 'greet', 'hi');\n     * bound('!');\n     * // => 'hi fred!'\n     *\n     * object.greet = function(greeting, punctuation) {\n     *   return greeting + 'ya ' + this.user + punctuation;\n     * };\n     *\n     * bound('!');\n     * // => 'hiya fred!'\n     *\n     * // Bound with placeholders.\n     * var bound = _.bindKey(object, 'greet', _, '!');\n     * bound('hi');\n     * // => 'hiya fred!'\n     */\n    var bindKey = baseRest(function(object, key, partials) {\n      var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n      if (partials.length) {\n        var holders = replaceHolders(partials, getHolder(bindKey));\n        bitmask |= WRAP_PARTIAL_FLAG;\n      }\n      return createWrap(key, bitmask, object, partials, holders);\n    });\n\n    /**\n     * Creates a function that accepts arguments of `func` and either invokes\n     * `func` returning its result, if at least `arity` number of arguments have\n     * been provided, or returns a function that accepts the remaining `func`\n     * arguments, and so on. The arity of `func` may be specified if `func.length`\n     * is not sufficient.\n     *\n     * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n     * may be used as a placeholder for provided arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of curried functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Function\n     * @param {Function} func The function to curry.\n     * @param {number} [arity=func.length] The arity of `func`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new curried function.\n     * @example\n     *\n     * var abc = function(a, b, c) {\n     *   return [a, b, c];\n     * };\n     *\n     * var curried = _.curry(abc);\n     *\n     * curried(1)(2)(3);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2)(3);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2, 3);\n     * // => [1, 2, 3]\n     *\n     * // Curried with placeholders.\n     * curried(1)(_, 3)(2);\n     * // => [1, 2, 3]\n     */\n    function curry(func, arity, guard) {\n      arity = guard ? undefined : arity;\n      var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n      result.placeholder = curry.placeholder;\n      return result;\n    }\n\n    /**\n     * This method is like `_.curry` except that arguments are applied to `func`\n     * in the manner of `_.partialRight` instead of `_.partial`.\n     *\n     * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for provided arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of curried functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to curry.\n     * @param {number} [arity=func.length] The arity of `func`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new curried function.\n     * @example\n     *\n     * var abc = function(a, b, c) {\n     *   return [a, b, c];\n     * };\n     *\n     * var curried = _.curryRight(abc);\n     *\n     * curried(3)(2)(1);\n     * // => [1, 2, 3]\n     *\n     * curried(2, 3)(1);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2, 3);\n     * // => [1, 2, 3]\n     *\n     * // Curried with placeholders.\n     * curried(3)(1, _)(2);\n     * // => [1, 2, 3]\n     */\n    function curryRight(func, arity, guard) {\n      arity = guard ? undefined : arity;\n      var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n      result.placeholder = curryRight.placeholder;\n      return result;\n    }\n\n    /**\n     * Creates a debounced function that delays invoking `func` until after `wait`\n     * milliseconds have elapsed since the last time the debounced function was\n     * invoked. The debounced function comes with a `cancel` method to cancel\n     * delayed `func` invocations and a `flush` method to immediately invoke them.\n     * Provide `options` to indicate whether `func` should be invoked on the\n     * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n     * with the last arguments provided to the debounced function. Subsequent\n     * calls to the debounced function return the result of the last `func`\n     * invocation.\n     *\n     * **Note:** If `leading` and `trailing` options are `true`, `func` is\n     * invoked on the trailing edge of the timeout only if the debounced function\n     * is invoked more than once during the `wait` timeout.\n     *\n     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n     * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n     *\n     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n     * for details over the differences between `_.debounce` and `_.throttle`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to debounce.\n     * @param {number} [wait=0] The number of milliseconds to delay.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.leading=false]\n     *  Specify invoking on the leading edge of the timeout.\n     * @param {number} [options.maxWait]\n     *  The maximum time `func` is allowed to be delayed before it's invoked.\n     * @param {boolean} [options.trailing=true]\n     *  Specify invoking on the trailing edge of the timeout.\n     * @returns {Function} Returns the new debounced function.\n     * @example\n     *\n     * // Avoid costly calculations while the window size is in flux.\n     * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n     *\n     * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n     * jQuery(element).on('click', _.debounce(sendMail, 300, {\n     *   'leading': true,\n     *   'trailing': false\n     * }));\n     *\n     * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n     * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n     * var source = new EventSource('/stream');\n     * jQuery(source).on('message', debounced);\n     *\n     * // Cancel the trailing debounced invocation.\n     * jQuery(window).on('popstate', debounced.cancel);\n     */\n    function debounce(func, wait, options) {\n      var lastArgs,\n          lastThis,\n          maxWait,\n          result,\n          timerId,\n          lastCallTime,\n          lastInvokeTime = 0,\n          leading = false,\n          maxing = false,\n          trailing = true;\n\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      wait = toNumber(wait) || 0;\n      if (isObject(options)) {\n        leading = !!options.leading;\n        maxing = 'maxWait' in options;\n        maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n        trailing = 'trailing' in options ? !!options.trailing : trailing;\n      }\n\n      function invokeFunc(time) {\n        var args = lastArgs,\n            thisArg = lastThis;\n\n        lastArgs = lastThis = undefined;\n        lastInvokeTime = time;\n        result = func.apply(thisArg, args);\n        return result;\n      }\n\n      function leadingEdge(time) {\n        // Reset any `maxWait` timer.\n        lastInvokeTime = time;\n        // Start the timer for the trailing edge.\n        timerId = setTimeout(timerExpired, wait);\n        // Invoke the leading edge.\n        return leading ? invokeFunc(time) : result;\n      }\n\n      function remainingWait(time) {\n        var timeSinceLastCall = time - lastCallTime,\n            timeSinceLastInvoke = time - lastInvokeTime,\n            timeWaiting = wait - timeSinceLastCall;\n\n        return maxing\n          ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n          : timeWaiting;\n      }\n\n      function shouldInvoke(time) {\n        var timeSinceLastCall = time - lastCallTime,\n            timeSinceLastInvoke = time - lastInvokeTime;\n\n        // Either this is the first call, activity has stopped and we're at the\n        // trailing edge, the system time has gone backwards and we're treating\n        // it as the trailing edge, or we've hit the `maxWait` limit.\n        return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n          (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n      }\n\n      function timerExpired() {\n        var time = now();\n        if (shouldInvoke(time)) {\n          return trailingEdge(time);\n        }\n        // Restart the timer.\n        timerId = setTimeout(timerExpired, remainingWait(time));\n      }\n\n      function trailingEdge(time) {\n        timerId = undefined;\n\n        // Only invoke if we have `lastArgs` which means `func` has been\n        // debounced at least once.\n        if (trailing && lastArgs) {\n          return invokeFunc(time);\n        }\n        lastArgs = lastThis = undefined;\n        return result;\n      }\n\n      function cancel() {\n        if (timerId !== undefined) {\n          clearTimeout(timerId);\n        }\n        lastInvokeTime = 0;\n        lastArgs = lastCallTime = lastThis = timerId = undefined;\n      }\n\n      function flush() {\n        return timerId === undefined ? result : trailingEdge(now());\n      }\n\n      function debounced() {\n        var time = now(),\n            isInvoking = shouldInvoke(time);\n\n        lastArgs = arguments;\n        lastThis = this;\n        lastCallTime = time;\n\n        if (isInvoking) {\n          if (timerId === undefined) {\n            return leadingEdge(lastCallTime);\n          }\n          if (maxing) {\n            // Handle invocations in a tight loop.\n            clearTimeout(timerId);\n            timerId = setTimeout(timerExpired, wait);\n            return invokeFunc(lastCallTime);\n          }\n        }\n        if (timerId === undefined) {\n          timerId = setTimeout(timerExpired, wait);\n        }\n        return result;\n      }\n      debounced.cancel = cancel;\n      debounced.flush = flush;\n      return debounced;\n    }\n\n    /**\n     * Defers invoking the `func` until the current call stack has cleared. Any\n     * additional arguments are provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to defer.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {number} Returns the timer id.\n     * @example\n     *\n     * _.defer(function(text) {\n     *   console.log(text);\n     * }, 'deferred');\n     * // => Logs 'deferred' after one millisecond.\n     */\n    var defer = baseRest(function(func, args) {\n      return baseDelay(func, 1, args);\n    });\n\n    /**\n     * Invokes `func` after `wait` milliseconds. Any additional arguments are\n     * provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {number} Returns the timer id.\n     * @example\n     *\n     * _.delay(function(text) {\n     *   console.log(text);\n     * }, 1000, 'later');\n     * // => Logs 'later' after one second.\n     */\n    var delay = baseRest(function(func, wait, args) {\n      return baseDelay(func, toNumber(wait) || 0, args);\n    });\n\n    /**\n     * Creates a function that invokes `func` with arguments reversed.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to flip arguments for.\n     * @returns {Function} Returns the new flipped function.\n     * @example\n     *\n     * var flipped = _.flip(function() {\n     *   return _.toArray(arguments);\n     * });\n     *\n     * flipped('a', 'b', 'c', 'd');\n     * // => ['d', 'c', 'b', 'a']\n     */\n    function flip(func) {\n      return createWrap(func, WRAP_FLIP_FLAG);\n    }\n\n    /**\n     * Creates a function that memoizes the result of `func`. If `resolver` is\n     * provided, it determines the cache key for storing the result based on the\n     * arguments provided to the memoized function. By default, the first argument\n     * provided to the memoized function is used as the map cache key. The `func`\n     * is invoked with the `this` binding of the memoized function.\n     *\n     * **Note:** The cache is exposed as the `cache` property on the memoized\n     * function. Its creation may be customized by replacing the `_.memoize.Cache`\n     * constructor with one whose instances implement the\n     * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n     * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to have its output memoized.\n     * @param {Function} [resolver] The function to resolve the cache key.\n     * @returns {Function} Returns the new memoized function.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     * var other = { 'c': 3, 'd': 4 };\n     *\n     * var values = _.memoize(_.values);\n     * values(object);\n     * // => [1, 2]\n     *\n     * values(other);\n     * // => [3, 4]\n     *\n     * object.a = 2;\n     * values(object);\n     * // => [1, 2]\n     *\n     * // Modify the result cache.\n     * values.cache.set(object, ['a', 'b']);\n     * values(object);\n     * // => ['a', 'b']\n     *\n     * // Replace `_.memoize.Cache`.\n     * _.memoize.Cache = WeakMap;\n     */\n    function memoize(func, resolver) {\n      if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      var memoized = function() {\n        var args = arguments,\n            key = resolver ? resolver.apply(this, args) : args[0],\n            cache = memoized.cache;\n\n        if (cache.has(key)) {\n          return cache.get(key);\n        }\n        var result = func.apply(this, args);\n        memoized.cache = cache.set(key, result) || cache;\n        return result;\n      };\n      memoized.cache = new (memoize.Cache || MapCache);\n      return memoized;\n    }\n\n    // Expose `MapCache`.\n    memoize.Cache = MapCache;\n\n    /**\n     * Creates a function that negates the result of the predicate `func`. The\n     * `func` predicate is invoked with the `this` binding and arguments of the\n     * created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} predicate The predicate to negate.\n     * @returns {Function} Returns the new negated function.\n     * @example\n     *\n     * function isEven(n) {\n     *   return n % 2 == 0;\n     * }\n     *\n     * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n     * // => [1, 3, 5]\n     */\n    function negate(predicate) {\n      if (typeof predicate != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      return function() {\n        var args = arguments;\n        switch (args.length) {\n          case 0: return !predicate.call(this);\n          case 1: return !predicate.call(this, args[0]);\n          case 2: return !predicate.call(this, args[0], args[1]);\n          case 3: return !predicate.call(this, args[0], args[1], args[2]);\n        }\n        return !predicate.apply(this, args);\n      };\n    }\n\n    /**\n     * Creates a function that is restricted to invoking `func` once. Repeat calls\n     * to the function return the value of the first invocation. The `func` is\n     * invoked with the `this` binding and arguments of the created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * var initialize = _.once(createApplication);\n     * initialize();\n     * initialize();\n     * // => `createApplication` is invoked once\n     */\n    function once(func) {\n      return before(2, func);\n    }\n\n    /**\n     * Creates a function that invokes `func` with its arguments transformed.\n     *\n     * @static\n     * @since 4.0.0\n     * @memberOf _\n     * @category Function\n     * @param {Function} func The function to wrap.\n     * @param {...(Function|Function[])} [transforms=[_.identity]]\n     *  The argument transforms.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * function doubled(n) {\n     *   return n * 2;\n     * }\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var func = _.overArgs(function(x, y) {\n     *   return [x, y];\n     * }, [square, doubled]);\n     *\n     * func(9, 3);\n     * // => [81, 6]\n     *\n     * func(10, 5);\n     * // => [100, 10]\n     */\n    var overArgs = castRest(function(func, transforms) {\n      transforms = (transforms.length == 1 && isArray(transforms[0]))\n        ? arrayMap(transforms[0], baseUnary(getIteratee()))\n        : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n      var funcsLength = transforms.length;\n      return baseRest(function(args) {\n        var index = -1,\n            length = nativeMin(args.length, funcsLength);\n\n        while (++index < length) {\n          args[index] = transforms[index].call(this, args[index]);\n        }\n        return apply(func, this, args);\n      });\n    });\n\n    /**\n     * Creates a function that invokes `func` with `partials` prepended to the\n     * arguments it receives. This method is like `_.bind` except it does **not**\n     * alter the `this` binding.\n     *\n     * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of partially\n     * applied functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.2.0\n     * @category Function\n     * @param {Function} func The function to partially apply arguments to.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new partially applied function.\n     * @example\n     *\n     * function greet(greeting, name) {\n     *   return greeting + ' ' + name;\n     * }\n     *\n     * var sayHelloTo = _.partial(greet, 'hello');\n     * sayHelloTo('fred');\n     * // => 'hello fred'\n     *\n     * // Partially applied with placeholders.\n     * var greetFred = _.partial(greet, _, 'fred');\n     * greetFred('hi');\n     * // => 'hi fred'\n     */\n    var partial = baseRest(function(func, partials) {\n      var holders = replaceHolders(partials, getHolder(partial));\n      return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n    });\n\n    /**\n     * This method is like `_.partial` except that partially applied arguments\n     * are appended to the arguments it receives.\n     *\n     * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of partially\n     * applied functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Function\n     * @param {Function} func The function to partially apply arguments to.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new partially applied function.\n     * @example\n     *\n     * function greet(greeting, name) {\n     *   return greeting + ' ' + name;\n     * }\n     *\n     * var greetFred = _.partialRight(greet, 'fred');\n     * greetFred('hi');\n     * // => 'hi fred'\n     *\n     * // Partially applied with placeholders.\n     * var sayHelloTo = _.partialRight(greet, 'hello', _);\n     * sayHelloTo('fred');\n     * // => 'hello fred'\n     */\n    var partialRight = baseRest(function(func, partials) {\n      var holders = replaceHolders(partials, getHolder(partialRight));\n      return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n    });\n\n    /**\n     * Creates a function that invokes `func` with arguments arranged according\n     * to the specified `indexes` where the argument value at the first index is\n     * provided as the first argument, the argument value at the second index is\n     * provided as the second argument, and so on.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to rearrange arguments for.\n     * @param {...(number|number[])} indexes The arranged argument indexes.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var rearged = _.rearg(function(a, b, c) {\n     *   return [a, b, c];\n     * }, [2, 0, 1]);\n     *\n     * rearged('b', 'c', 'a')\n     * // => ['a', 'b', 'c']\n     */\n    var rearg = flatRest(function(func, indexes) {\n      return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n    });\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of the\n     * created function and arguments from `start` and beyond provided as\n     * an array.\n     *\n     * **Note:** This method is based on the\n     * [rest parameter](https://mdn.io/rest_parameters).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var say = _.rest(function(what, names) {\n     *   return what + ' ' + _.initial(names).join(', ') +\n     *     (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n     * });\n     *\n     * say('hello', 'fred', 'barney', 'pebbles');\n     * // => 'hello fred, barney, & pebbles'\n     */\n    function rest(func, start) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      start = start === undefined ? start : toInteger(start);\n      return baseRest(func, start);\n    }\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of the\n     * create function and an array of arguments much like\n     * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n     *\n     * **Note:** This method is based on the\n     * [spread operator](https://mdn.io/spread_operator).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Function\n     * @param {Function} func The function to spread arguments over.\n     * @param {number} [start=0] The start position of the spread.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var say = _.spread(function(who, what) {\n     *   return who + ' says ' + what;\n     * });\n     *\n     * say(['fred', 'hello']);\n     * // => 'fred says hello'\n     *\n     * var numbers = Promise.all([\n     *   Promise.resolve(40),\n     *   Promise.resolve(36)\n     * ]);\n     *\n     * numbers.then(_.spread(function(x, y) {\n     *   return x + y;\n     * }));\n     * // => a Promise of 76\n     */\n    function spread(func, start) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      start = start == null ? 0 : nativeMax(toInteger(start), 0);\n      return baseRest(function(args) {\n        var array = args[start],\n            otherArgs = castSlice(args, 0, start);\n\n        if (array) {\n          arrayPush(otherArgs, array);\n        }\n        return apply(func, this, otherArgs);\n      });\n    }\n\n    /**\n     * Creates a throttled function that only invokes `func` at most once per\n     * every `wait` milliseconds. The throttled function comes with a `cancel`\n     * method to cancel delayed `func` invocations and a `flush` method to\n     * immediately invoke them. Provide `options` to indicate whether `func`\n     * should be invoked on the leading and/or trailing edge of the `wait`\n     * timeout. The `func` is invoked with the last arguments provided to the\n     * throttled function. Subsequent calls to the throttled function return the\n     * result of the last `func` invocation.\n     *\n     * **Note:** If `leading` and `trailing` options are `true`, `func` is\n     * invoked on the trailing edge of the timeout only if the throttled function\n     * is invoked more than once during the `wait` timeout.\n     *\n     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n     * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n     *\n     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n     * for details over the differences between `_.throttle` and `_.debounce`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to throttle.\n     * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.leading=true]\n     *  Specify invoking on the leading edge of the timeout.\n     * @param {boolean} [options.trailing=true]\n     *  Specify invoking on the trailing edge of the timeout.\n     * @returns {Function} Returns the new throttled function.\n     * @example\n     *\n     * // Avoid excessively updating the position while scrolling.\n     * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n     *\n     * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n     * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n     * jQuery(element).on('click', throttled);\n     *\n     * // Cancel the trailing throttled invocation.\n     * jQuery(window).on('popstate', throttled.cancel);\n     */\n    function throttle(func, wait, options) {\n      var leading = true,\n          trailing = true;\n\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      if (isObject(options)) {\n        leading = 'leading' in options ? !!options.leading : leading;\n        trailing = 'trailing' in options ? !!options.trailing : trailing;\n      }\n      return debounce(func, wait, {\n        'leading': leading,\n        'maxWait': wait,\n        'trailing': trailing\n      });\n    }\n\n    /**\n     * Creates a function that accepts up to one argument, ignoring any\n     * additional arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to cap arguments for.\n     * @returns {Function} Returns the new capped function.\n     * @example\n     *\n     * _.map(['6', '8', '10'], _.unary(parseInt));\n     * // => [6, 8, 10]\n     */\n    function unary(func) {\n      return ary(func, 1);\n    }\n\n    /**\n     * Creates a function that provides `value` to `wrapper` as its first\n     * argument. Any additional arguments provided to the function are appended\n     * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n     * binding of the created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {*} value The value to wrap.\n     * @param {Function} [wrapper=identity] The wrapper function.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var p = _.wrap(_.escape, function(func, text) {\n     *   return '<p>' + func(text) + '</p>';\n     * });\n     *\n     * p('fred, barney, & pebbles');\n     * // => '<p>fred, barney, &amp; pebbles</p>'\n     */\n    function wrap(value, wrapper) {\n      return partial(castFunction(wrapper), value);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Casts `value` as an array if it's not one.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.4.0\n     * @category Lang\n     * @param {*} value The value to inspect.\n     * @returns {Array} Returns the cast array.\n     * @example\n     *\n     * _.castArray(1);\n     * // => [1]\n     *\n     * _.castArray({ 'a': 1 });\n     * // => [{ 'a': 1 }]\n     *\n     * _.castArray('abc');\n     * // => ['abc']\n     *\n     * _.castArray(null);\n     * // => [null]\n     *\n     * _.castArray(undefined);\n     * // => [undefined]\n     *\n     * _.castArray();\n     * // => []\n     *\n     * var array = [1, 2, 3];\n     * console.log(_.castArray(array) === array);\n     * // => true\n     */\n    function castArray() {\n      if (!arguments.length) {\n        return [];\n      }\n      var value = arguments[0];\n      return isArray(value) ? value : [value];\n    }\n\n    /**\n     * Creates a shallow clone of `value`.\n     *\n     * **Note:** This method is loosely based on the\n     * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n     * and supports cloning arrays, array buffers, booleans, date objects, maps,\n     * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n     * arrays. The own enumerable properties of `arguments` objects are cloned\n     * as plain objects. An empty object is returned for uncloneable values such\n     * as error objects, functions, DOM nodes, and WeakMaps.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to clone.\n     * @returns {*} Returns the cloned value.\n     * @see _.cloneDeep\n     * @example\n     *\n     * var objects = [{ 'a': 1 }, { 'b': 2 }];\n     *\n     * var shallow = _.clone(objects);\n     * console.log(shallow[0] === objects[0]);\n     * // => true\n     */\n    function clone(value) {\n      return baseClone(value, CLONE_SYMBOLS_FLAG);\n    }\n\n    /**\n     * This method is like `_.clone` except that it accepts `customizer` which\n     * is invoked to produce the cloned value. If `customizer` returns `undefined`,\n     * cloning is handled by the method instead. The `customizer` is invoked with\n     * up to four arguments; (value [, index|key, object, stack]).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to clone.\n     * @param {Function} [customizer] The function to customize cloning.\n     * @returns {*} Returns the cloned value.\n     * @see _.cloneDeepWith\n     * @example\n     *\n     * function customizer(value) {\n     *   if (_.isElement(value)) {\n     *     return value.cloneNode(false);\n     *   }\n     * }\n     *\n     * var el = _.cloneWith(document.body, customizer);\n     *\n     * console.log(el === document.body);\n     * // => false\n     * console.log(el.nodeName);\n     * // => 'BODY'\n     * console.log(el.childNodes.length);\n     * // => 0\n     */\n    function cloneWith(value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);\n    }\n\n    /**\n     * This method is like `_.clone` except that it recursively clones `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Lang\n     * @param {*} value The value to recursively clone.\n     * @returns {*} Returns the deep cloned value.\n     * @see _.clone\n     * @example\n     *\n     * var objects = [{ 'a': 1 }, { 'b': 2 }];\n     *\n     * var deep = _.cloneDeep(objects);\n     * console.log(deep[0] === objects[0]);\n     * // => false\n     */\n    function cloneDeep(value) {\n      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n    }\n\n    /**\n     * This method is like `_.cloneWith` except that it recursively clones `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to recursively clone.\n     * @param {Function} [customizer] The function to customize cloning.\n     * @returns {*} Returns the deep cloned value.\n     * @see _.cloneWith\n     * @example\n     *\n     * function customizer(value) {\n     *   if (_.isElement(value)) {\n     *     return value.cloneNode(true);\n     *   }\n     * }\n     *\n     * var el = _.cloneDeepWith(document.body, customizer);\n     *\n     * console.log(el === document.body);\n     * // => false\n     * console.log(el.nodeName);\n     * // => 'BODY'\n     * console.log(el.childNodes.length);\n     * // => 20\n     */\n    function cloneDeepWith(value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\n    }\n\n    /**\n     * Checks if `object` conforms to `source` by invoking the predicate\n     * properties of `source` with the corresponding property values of `object`.\n     *\n     * **Note:** This method is equivalent to `_.conforms` when `source` is\n     * partially applied.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.14.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     *\n     * _.conformsTo(object, { 'b': function(n) { return n > 1; } });\n     * // => true\n     *\n     * _.conformsTo(object, { 'b': function(n) { return n > 2; } });\n     * // => false\n     */\n    function conformsTo(object, source) {\n      return source == null || baseConformsTo(object, source, keys(source));\n    }\n\n    /**\n     * Performs a\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * comparison between two values to determine if they are equivalent.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     * var other = { 'a': 1 };\n     *\n     * _.eq(object, object);\n     * // => true\n     *\n     * _.eq(object, other);\n     * // => false\n     *\n     * _.eq('a', 'a');\n     * // => true\n     *\n     * _.eq('a', Object('a'));\n     * // => false\n     *\n     * _.eq(NaN, NaN);\n     * // => true\n     */\n    function eq(value, other) {\n      return value === other || (value !== value && other !== other);\n    }\n\n    /**\n     * Checks if `value` is greater than `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than `other`,\n     *  else `false`.\n     * @see _.lt\n     * @example\n     *\n     * _.gt(3, 1);\n     * // => true\n     *\n     * _.gt(3, 3);\n     * // => false\n     *\n     * _.gt(1, 3);\n     * // => false\n     */\n    var gt = createRelationalOperation(baseGt);\n\n    /**\n     * Checks if `value` is greater than or equal to `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than or equal to\n     *  `other`, else `false`.\n     * @see _.lte\n     * @example\n     *\n     * _.gte(3, 1);\n     * // => true\n     *\n     * _.gte(3, 3);\n     * // => true\n     *\n     * _.gte(1, 3);\n     * // => false\n     */\n    var gte = createRelationalOperation(function(value, other) {\n      return value >= other;\n    });\n\n    /**\n     * Checks if `value` is likely an `arguments` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n     *  else `false`.\n     * @example\n     *\n     * _.isArguments(function() { return arguments; }());\n     * // => true\n     *\n     * _.isArguments([1, 2, 3]);\n     * // => false\n     */\n    var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n      return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n        !propertyIsEnumerable.call(value, 'callee');\n    };\n\n    /**\n     * Checks if `value` is classified as an `Array` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n     * @example\n     *\n     * _.isArray([1, 2, 3]);\n     * // => true\n     *\n     * _.isArray(document.body.children);\n     * // => false\n     *\n     * _.isArray('abc');\n     * // => false\n     *\n     * _.isArray(_.noop);\n     * // => false\n     */\n    var isArray = Array.isArray;\n\n    /**\n     * Checks if `value` is classified as an `ArrayBuffer` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n     * @example\n     *\n     * _.isArrayBuffer(new ArrayBuffer(2));\n     * // => true\n     *\n     * _.isArrayBuffer(new Array(2));\n     * // => false\n     */\n    var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;\n\n    /**\n     * Checks if `value` is array-like. A value is considered array-like if it's\n     * not a function and has a `value.length` that's an integer greater than or\n     * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n     * @example\n     *\n     * _.isArrayLike([1, 2, 3]);\n     * // => true\n     *\n     * _.isArrayLike(document.body.children);\n     * // => true\n     *\n     * _.isArrayLike('abc');\n     * // => true\n     *\n     * _.isArrayLike(_.noop);\n     * // => false\n     */\n    function isArrayLike(value) {\n      return value != null && isLength(value.length) && !isFunction(value);\n    }\n\n    /**\n     * This method is like `_.isArrayLike` except that it also checks if `value`\n     * is an object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array-like object,\n     *  else `false`.\n     * @example\n     *\n     * _.isArrayLikeObject([1, 2, 3]);\n     * // => true\n     *\n     * _.isArrayLikeObject(document.body.children);\n     * // => true\n     *\n     * _.isArrayLikeObject('abc');\n     * // => false\n     *\n     * _.isArrayLikeObject(_.noop);\n     * // => false\n     */\n    function isArrayLikeObject(value) {\n      return isObjectLike(value) && isArrayLike(value);\n    }\n\n    /**\n     * Checks if `value` is classified as a boolean primitive or object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.\n     * @example\n     *\n     * _.isBoolean(false);\n     * // => true\n     *\n     * _.isBoolean(null);\n     * // => false\n     */\n    function isBoolean(value) {\n      return value === true || value === false ||\n        (isObjectLike(value) && baseGetTag(value) == boolTag);\n    }\n\n    /**\n     * Checks if `value` is a buffer.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n     * @example\n     *\n     * _.isBuffer(new Buffer(2));\n     * // => true\n     *\n     * _.isBuffer(new Uint8Array(2));\n     * // => false\n     */\n    var isBuffer = nativeIsBuffer || stubFalse;\n\n    /**\n     * Checks if `value` is classified as a `Date` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n     * @example\n     *\n     * _.isDate(new Date);\n     * // => true\n     *\n     * _.isDate('Mon April 23 2012');\n     * // => false\n     */\n    var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;\n\n    /**\n     * Checks if `value` is likely a DOM element.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.\n     * @example\n     *\n     * _.isElement(document.body);\n     * // => true\n     *\n     * _.isElement('<body>');\n     * // => false\n     */\n    function isElement(value) {\n      return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);\n    }\n\n    /**\n     * Checks if `value` is an empty object, collection, map, or set.\n     *\n     * Objects are considered empty if they have no own enumerable string keyed\n     * properties.\n     *\n     * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n     * jQuery-like collections are considered empty if they have a `length` of `0`.\n     * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n     * @example\n     *\n     * _.isEmpty(null);\n     * // => true\n     *\n     * _.isEmpty(true);\n     * // => true\n     *\n     * _.isEmpty(1);\n     * // => true\n     *\n     * _.isEmpty([1, 2, 3]);\n     * // => false\n     *\n     * _.isEmpty({ 'a': 1 });\n     * // => false\n     */\n    function isEmpty(value) {\n      if (value == null) {\n        return true;\n      }\n      if (isArrayLike(value) &&\n          (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n            isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n        return !value.length;\n      }\n      var tag = getTag(value);\n      if (tag == mapTag || tag == setTag) {\n        return !value.size;\n      }\n      if (isPrototype(value)) {\n        return !baseKeys(value).length;\n      }\n      for (var key in value) {\n        if (hasOwnProperty.call(value, key)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    /**\n     * Performs a deep comparison between two values to determine if they are\n     * equivalent.\n     *\n     * **Note:** This method supports comparing arrays, array buffers, booleans,\n     * date objects, error objects, maps, numbers, `Object` objects, regexes,\n     * sets, strings, symbols, and typed arrays. `Object` objects are compared\n     * by their own, not inherited, enumerable properties. Functions and DOM\n     * nodes are compared by strict equality, i.e. `===`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     * var other = { 'a': 1 };\n     *\n     * _.isEqual(object, other);\n     * // => true\n     *\n     * object === other;\n     * // => false\n     */\n    function isEqual(value, other) {\n      return baseIsEqual(value, other);\n    }\n\n    /**\n     * This method is like `_.isEqual` except that it accepts `customizer` which\n     * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n     * are handled by the method instead. The `customizer` is invoked with up to\n     * six arguments: (objValue, othValue [, index|key, object, other, stack]).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * function isGreeting(value) {\n     *   return /^h(?:i|ello)$/.test(value);\n     * }\n     *\n     * function customizer(objValue, othValue) {\n     *   if (isGreeting(objValue) && isGreeting(othValue)) {\n     *     return true;\n     *   }\n     * }\n     *\n     * var array = ['hello', 'goodbye'];\n     * var other = ['hi', 'goodbye'];\n     *\n     * _.isEqualWith(array, other, customizer);\n     * // => true\n     */\n    function isEqualWith(value, other, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      var result = customizer ? customizer(value, other) : undefined;\n      return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;\n    }\n\n    /**\n     * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,\n     * `SyntaxError`, `TypeError`, or `URIError` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an error object, else `false`.\n     * @example\n     *\n     * _.isError(new Error);\n     * // => true\n     *\n     * _.isError(Error);\n     * // => false\n     */\n    function isError(value) {\n      if (!isObjectLike(value)) {\n        return false;\n      }\n      var tag = baseGetTag(value);\n      return tag == errorTag || tag == domExcTag ||\n        (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));\n    }\n\n    /**\n     * Checks if `value` is a finite primitive number.\n     *\n     * **Note:** This method is based on\n     * [`Number.isFinite`](https://mdn.io/Number/isFinite).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.\n     * @example\n     *\n     * _.isFinite(3);\n     * // => true\n     *\n     * _.isFinite(Number.MIN_VALUE);\n     * // => true\n     *\n     * _.isFinite(Infinity);\n     * // => false\n     *\n     * _.isFinite('3');\n     * // => false\n     */\n    function isFinite(value) {\n      return typeof value == 'number' && nativeIsFinite(value);\n    }\n\n    /**\n     * Checks if `value` is classified as a `Function` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n     * @example\n     *\n     * _.isFunction(_);\n     * // => true\n     *\n     * _.isFunction(/abc/);\n     * // => false\n     */\n    function isFunction(value) {\n      if (!isObject(value)) {\n        return false;\n      }\n      // The use of `Object#toString` avoids issues with the `typeof` operator\n      // in Safari 9 which returns 'object' for typed arrays and other constructors.\n      var tag = baseGetTag(value);\n      return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n    }\n\n    /**\n     * Checks if `value` is an integer.\n     *\n     * **Note:** This method is based on\n     * [`Number.isInteger`](https://mdn.io/Number/isInteger).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an integer, else `false`.\n     * @example\n     *\n     * _.isInteger(3);\n     * // => true\n     *\n     * _.isInteger(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isInteger(Infinity);\n     * // => false\n     *\n     * _.isInteger('3');\n     * // => false\n     */\n    function isInteger(value) {\n      return typeof value == 'number' && value == toInteger(value);\n    }\n\n    /**\n     * Checks if `value` is a valid array-like length.\n     *\n     * **Note:** This method is loosely based on\n     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n     * @example\n     *\n     * _.isLength(3);\n     * // => true\n     *\n     * _.isLength(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isLength(Infinity);\n     * // => false\n     *\n     * _.isLength('3');\n     * // => false\n     */\n    function isLength(value) {\n      return typeof value == 'number' &&\n        value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n    }\n\n    /**\n     * Checks if `value` is the\n     * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n     * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n     * @example\n     *\n     * _.isObject({});\n     * // => true\n     *\n     * _.isObject([1, 2, 3]);\n     * // => true\n     *\n     * _.isObject(_.noop);\n     * // => true\n     *\n     * _.isObject(null);\n     * // => false\n     */\n    function isObject(value) {\n      var type = typeof value;\n      return value != null && (type == 'object' || type == 'function');\n    }\n\n    /**\n     * Checks if `value` is object-like. A value is object-like if it's not `null`\n     * and has a `typeof` result of \"object\".\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n     * @example\n     *\n     * _.isObjectLike({});\n     * // => true\n     *\n     * _.isObjectLike([1, 2, 3]);\n     * // => true\n     *\n     * _.isObjectLike(_.noop);\n     * // => false\n     *\n     * _.isObjectLike(null);\n     * // => false\n     */\n    function isObjectLike(value) {\n      return value != null && typeof value == 'object';\n    }\n\n    /**\n     * Checks if `value` is classified as a `Map` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n     * @example\n     *\n     * _.isMap(new Map);\n     * // => true\n     *\n     * _.isMap(new WeakMap);\n     * // => false\n     */\n    var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\n    /**\n     * Performs a partial deep comparison between `object` and `source` to\n     * determine if `object` contains equivalent property values.\n     *\n     * **Note:** This method is equivalent to `_.matches` when `source` is\n     * partially applied.\n     *\n     * Partial comparisons will match empty array and empty object `source`\n     * values against any array or object value, respectively. See `_.isEqual`\n     * for a list of supported value comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     *\n     * _.isMatch(object, { 'b': 2 });\n     * // => true\n     *\n     * _.isMatch(object, { 'b': 1 });\n     * // => false\n     */\n    function isMatch(object, source) {\n      return object === source || baseIsMatch(object, source, getMatchData(source));\n    }\n\n    /**\n     * This method is like `_.isMatch` except that it accepts `customizer` which\n     * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n     * are handled by the method instead. The `customizer` is invoked with five\n     * arguments: (objValue, srcValue, index|key, object, source).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     * @example\n     *\n     * function isGreeting(value) {\n     *   return /^h(?:i|ello)$/.test(value);\n     * }\n     *\n     * function customizer(objValue, srcValue) {\n     *   if (isGreeting(objValue) && isGreeting(srcValue)) {\n     *     return true;\n     *   }\n     * }\n     *\n     * var object = { 'greeting': 'hello' };\n     * var source = { 'greeting': 'hi' };\n     *\n     * _.isMatchWith(object, source, customizer);\n     * // => true\n     */\n    function isMatchWith(object, source, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseIsMatch(object, source, getMatchData(source), customizer);\n    }\n\n    /**\n     * Checks if `value` is `NaN`.\n     *\n     * **Note:** This method is based on\n     * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as\n     * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for\n     * `undefined` and other non-number values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n     * @example\n     *\n     * _.isNaN(NaN);\n     * // => true\n     *\n     * _.isNaN(new Number(NaN));\n     * // => true\n     *\n     * isNaN(undefined);\n     * // => true\n     *\n     * _.isNaN(undefined);\n     * // => false\n     */\n    function isNaN(value) {\n      // An `NaN` primitive is the only value that is not equal to itself.\n      // Perform the `toStringTag` check first to avoid errors with some\n      // ActiveX objects in IE.\n      return isNumber(value) && value != +value;\n    }\n\n    /**\n     * Checks if `value` is a pristine native function.\n     *\n     * **Note:** This method can't reliably detect native functions in the presence\n     * of the core-js package because core-js circumvents this kind of detection.\n     * Despite multiple requests, the core-js maintainer has made it clear: any\n     * attempt to fix the detection will be obstructed. As a result, we're left\n     * with little choice but to throw an error. Unfortunately, this also affects\n     * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),\n     * which rely on core-js.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a native function,\n     *  else `false`.\n     * @example\n     *\n     * _.isNative(Array.prototype.push);\n     * // => true\n     *\n     * _.isNative(_);\n     * // => false\n     */\n    function isNative(value) {\n      if (isMaskable(value)) {\n        throw new Error(CORE_ERROR_TEXT);\n      }\n      return baseIsNative(value);\n    }\n\n    /**\n     * Checks if `value` is `null`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `null`, else `false`.\n     * @example\n     *\n     * _.isNull(null);\n     * // => true\n     *\n     * _.isNull(void 0);\n     * // => false\n     */\n    function isNull(value) {\n      return value === null;\n    }\n\n    /**\n     * Checks if `value` is `null` or `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is nullish, else `false`.\n     * @example\n     *\n     * _.isNil(null);\n     * // => true\n     *\n     * _.isNil(void 0);\n     * // => true\n     *\n     * _.isNil(NaN);\n     * // => false\n     */\n    function isNil(value) {\n      return value == null;\n    }\n\n    /**\n     * Checks if `value` is classified as a `Number` primitive or object.\n     *\n     * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n     * classified as numbers, use the `_.isFinite` method.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a number, else `false`.\n     * @example\n     *\n     * _.isNumber(3);\n     * // => true\n     *\n     * _.isNumber(Number.MIN_VALUE);\n     * // => true\n     *\n     * _.isNumber(Infinity);\n     * // => true\n     *\n     * _.isNumber('3');\n     * // => false\n     */\n    function isNumber(value) {\n      return typeof value == 'number' ||\n        (isObjectLike(value) && baseGetTag(value) == numberTag);\n    }\n\n    /**\n     * Checks if `value` is a plain object, that is, an object created by the\n     * `Object` constructor or one with a `[[Prototype]]` of `null`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.8.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * _.isPlainObject(new Foo);\n     * // => false\n     *\n     * _.isPlainObject([1, 2, 3]);\n     * // => false\n     *\n     * _.isPlainObject({ 'x': 0, 'y': 0 });\n     * // => true\n     *\n     * _.isPlainObject(Object.create(null));\n     * // => true\n     */\n    function isPlainObject(value) {\n      if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n        return false;\n      }\n      var proto = getPrototype(value);\n      if (proto === null) {\n        return true;\n      }\n      var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n      return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n        funcToString.call(Ctor) == objectCtorString;\n    }\n\n    /**\n     * Checks if `value` is classified as a `RegExp` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n     * @example\n     *\n     * _.isRegExp(/abc/);\n     * // => true\n     *\n     * _.isRegExp('/abc/');\n     * // => false\n     */\n    var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\n    /**\n     * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754\n     * double precision number which isn't the result of a rounded unsafe integer.\n     *\n     * **Note:** This method is based on\n     * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`.\n     * @example\n     *\n     * _.isSafeInteger(3);\n     * // => true\n     *\n     * _.isSafeInteger(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isSafeInteger(Infinity);\n     * // => false\n     *\n     * _.isSafeInteger('3');\n     * // => false\n     */\n    function isSafeInteger(value) {\n      return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;\n    }\n\n    /**\n     * Checks if `value` is classified as a `Set` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n     * @example\n     *\n     * _.isSet(new Set);\n     * // => true\n     *\n     * _.isSet(new WeakSet);\n     * // => false\n     */\n    var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\n    /**\n     * Checks if `value` is classified as a `String` primitive or object.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n     * @example\n     *\n     * _.isString('abc');\n     * // => true\n     *\n     * _.isString(1);\n     * // => false\n     */\n    function isString(value) {\n      return typeof value == 'string' ||\n        (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n    }\n\n    /**\n     * Checks if `value` is classified as a `Symbol` primitive or object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n     * @example\n     *\n     * _.isSymbol(Symbol.iterator);\n     * // => true\n     *\n     * _.isSymbol('abc');\n     * // => false\n     */\n    function isSymbol(value) {\n      return typeof value == 'symbol' ||\n        (isObjectLike(value) && baseGetTag(value) == symbolTag);\n    }\n\n    /**\n     * Checks if `value` is classified as a typed array.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n     * @example\n     *\n     * _.isTypedArray(new Uint8Array);\n     * // => true\n     *\n     * _.isTypedArray([]);\n     * // => false\n     */\n    var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n    /**\n     * Checks if `value` is `undefined`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n     * @example\n     *\n     * _.isUndefined(void 0);\n     * // => true\n     *\n     * _.isUndefined(null);\n     * // => false\n     */\n    function isUndefined(value) {\n      return value === undefined;\n    }\n\n    /**\n     * Checks if `value` is classified as a `WeakMap` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a weak map, else `false`.\n     * @example\n     *\n     * _.isWeakMap(new WeakMap);\n     * // => true\n     *\n     * _.isWeakMap(new Map);\n     * // => false\n     */\n    function isWeakMap(value) {\n      return isObjectLike(value) && getTag(value) == weakMapTag;\n    }\n\n    /**\n     * Checks if `value` is classified as a `WeakSet` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a weak set, else `false`.\n     * @example\n     *\n     * _.isWeakSet(new WeakSet);\n     * // => true\n     *\n     * _.isWeakSet(new Set);\n     * // => false\n     */\n    function isWeakSet(value) {\n      return isObjectLike(value) && baseGetTag(value) == weakSetTag;\n    }\n\n    /**\n     * Checks if `value` is less than `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than `other`,\n     *  else `false`.\n     * @see _.gt\n     * @example\n     *\n     * _.lt(1, 3);\n     * // => true\n     *\n     * _.lt(3, 3);\n     * // => false\n     *\n     * _.lt(3, 1);\n     * // => false\n     */\n    var lt = createRelationalOperation(baseLt);\n\n    /**\n     * Checks if `value` is less than or equal to `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than or equal to\n     *  `other`, else `false`.\n     * @see _.gte\n     * @example\n     *\n     * _.lte(1, 3);\n     * // => true\n     *\n     * _.lte(3, 3);\n     * // => true\n     *\n     * _.lte(3, 1);\n     * // => false\n     */\n    var lte = createRelationalOperation(function(value, other) {\n      return value <= other;\n    });\n\n    /**\n     * Converts `value` to an array.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {Array} Returns the converted array.\n     * @example\n     *\n     * _.toArray({ 'a': 1, 'b': 2 });\n     * // => [1, 2]\n     *\n     * _.toArray('abc');\n     * // => ['a', 'b', 'c']\n     *\n     * _.toArray(1);\n     * // => []\n     *\n     * _.toArray(null);\n     * // => []\n     */\n    function toArray(value) {\n      if (!value) {\n        return [];\n      }\n      if (isArrayLike(value)) {\n        return isString(value) ? stringToArray(value) : copyArray(value);\n      }\n      if (symIterator && value[symIterator]) {\n        return iteratorToArray(value[symIterator]());\n      }\n      var tag = getTag(value),\n          func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);\n\n      return func(value);\n    }\n\n    /**\n     * Converts `value` to a finite number.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.12.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {number} Returns the converted number.\n     * @example\n     *\n     * _.toFinite(3.2);\n     * // => 3.2\n     *\n     * _.toFinite(Number.MIN_VALUE);\n     * // => 5e-324\n     *\n     * _.toFinite(Infinity);\n     * // => 1.7976931348623157e+308\n     *\n     * _.toFinite('3.2');\n     * // => 3.2\n     */\n    function toFinite(value) {\n      if (!value) {\n        return value === 0 ? value : 0;\n      }\n      value = toNumber(value);\n      if (value === INFINITY || value === -INFINITY) {\n        var sign = (value < 0 ? -1 : 1);\n        return sign * MAX_INTEGER;\n      }\n      return value === value ? value : 0;\n    }\n\n    /**\n     * Converts `value` to an integer.\n     *\n     * **Note:** This method is loosely based on\n     * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.toInteger(3.2);\n     * // => 3\n     *\n     * _.toInteger(Number.MIN_VALUE);\n     * // => 0\n     *\n     * _.toInteger(Infinity);\n     * // => 1.7976931348623157e+308\n     *\n     * _.toInteger('3.2');\n     * // => 3\n     */\n    function toInteger(value) {\n      var result = toFinite(value),\n          remainder = result % 1;\n\n      return result === result ? (remainder ? result - remainder : result) : 0;\n    }\n\n    /**\n     * Converts `value` to an integer suitable for use as the length of an\n     * array-like object.\n     *\n     * **Note:** This method is based on\n     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.toLength(3.2);\n     * // => 3\n     *\n     * _.toLength(Number.MIN_VALUE);\n     * // => 0\n     *\n     * _.toLength(Infinity);\n     * // => 4294967295\n     *\n     * _.toLength('3.2');\n     * // => 3\n     */\n    function toLength(value) {\n      return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\n    }\n\n    /**\n     * Converts `value` to a number.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to process.\n     * @returns {number} Returns the number.\n     * @example\n     *\n     * _.toNumber(3.2);\n     * // => 3.2\n     *\n     * _.toNumber(Number.MIN_VALUE);\n     * // => 5e-324\n     *\n     * _.toNumber(Infinity);\n     * // => Infinity\n     *\n     * _.toNumber('3.2');\n     * // => 3.2\n     */\n    function toNumber(value) {\n      if (typeof value == 'number') {\n        return value;\n      }\n      if (isSymbol(value)) {\n        return NAN;\n      }\n      if (isObject(value)) {\n        var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n        value = isObject(other) ? (other + '') : other;\n      }\n      if (typeof value != 'string') {\n        return value === 0 ? value : +value;\n      }\n      value = value.replace(reTrim, '');\n      var isBinary = reIsBinary.test(value);\n      return (isBinary || reIsOctal.test(value))\n        ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n        : (reIsBadHex.test(value) ? NAN : +value);\n    }\n\n    /**\n     * Converts `value` to a plain object flattening inherited enumerable string\n     * keyed properties of `value` to own properties of the plain object.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {Object} Returns the converted plain object.\n     * @example\n     *\n     * function Foo() {\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.assign({ 'a': 1 }, new Foo);\n     * // => { 'a': 1, 'b': 2 }\n     *\n     * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n     * // => { 'a': 1, 'b': 2, 'c': 3 }\n     */\n    function toPlainObject(value) {\n      return copyObject(value, keysIn(value));\n    }\n\n    /**\n     * Converts `value` to a safe integer. A safe integer can be compared and\n     * represented correctly.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.toSafeInteger(3.2);\n     * // => 3\n     *\n     * _.toSafeInteger(Number.MIN_VALUE);\n     * // => 0\n     *\n     * _.toSafeInteger(Infinity);\n     * // => 9007199254740991\n     *\n     * _.toSafeInteger('3.2');\n     * // => 3\n     */\n    function toSafeInteger(value) {\n      return value\n        ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)\n        : (value === 0 ? value : 0);\n    }\n\n    /**\n     * Converts `value` to a string. An empty string is returned for `null`\n     * and `undefined` values. The sign of `-0` is preserved.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.toString(null);\n     * // => ''\n     *\n     * _.toString(-0);\n     * // => '-0'\n     *\n     * _.toString([1, 2, 3]);\n     * // => '1,2,3'\n     */\n    function toString(value) {\n      return value == null ? '' : baseToString(value);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Assigns own enumerable string keyed properties of source objects to the\n     * destination object. Source objects are applied from left to right.\n     * Subsequent sources overwrite property assignments of previous sources.\n     *\n     * **Note:** This method mutates `object` and is loosely based on\n     * [`Object.assign`](https://mdn.io/Object/assign).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.10.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.assignIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * function Bar() {\n     *   this.c = 3;\n     * }\n     *\n     * Foo.prototype.b = 2;\n     * Bar.prototype.d = 4;\n     *\n     * _.assign({ 'a': 0 }, new Foo, new Bar);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    var assign = createAssigner(function(object, source) {\n      if (isPrototype(source) || isArrayLike(source)) {\n        copyObject(source, keys(source), object);\n        return;\n      }\n      for (var key in source) {\n        if (hasOwnProperty.call(source, key)) {\n          assignValue(object, key, source[key]);\n        }\n      }\n    });\n\n    /**\n     * This method is like `_.assign` except that it iterates over own and\n     * inherited source properties.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias extend\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.assign\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * function Bar() {\n     *   this.c = 3;\n     * }\n     *\n     * Foo.prototype.b = 2;\n     * Bar.prototype.d = 4;\n     *\n     * _.assignIn({ 'a': 0 }, new Foo, new Bar);\n     * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\n     */\n    var assignIn = createAssigner(function(object, source) {\n      copyObject(source, keysIn(source), object);\n    });\n\n    /**\n     * This method is like `_.assignIn` except that it accepts `customizer`\n     * which is invoked to produce the assigned values. If `customizer` returns\n     * `undefined`, assignment is handled by the method instead. The `customizer`\n     * is invoked with five arguments: (objValue, srcValue, key, object, source).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias extendWith\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @see _.assignWith\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   return _.isUndefined(objValue) ? srcValue : objValue;\n     * }\n     *\n     * var defaults = _.partialRight(_.assignInWith, customizer);\n     *\n     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\n      copyObject(source, keysIn(source), object, customizer);\n    });\n\n    /**\n     * This method is like `_.assign` except that it accepts `customizer`\n     * which is invoked to produce the assigned values. If `customizer` returns\n     * `undefined`, assignment is handled by the method instead. The `customizer`\n     * is invoked with five arguments: (objValue, srcValue, key, object, source).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @see _.assignInWith\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   return _.isUndefined(objValue) ? srcValue : objValue;\n     * }\n     *\n     * var defaults = _.partialRight(_.assignWith, customizer);\n     *\n     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var assignWith = createAssigner(function(object, source, srcIndex, customizer) {\n      copyObject(source, keys(source), object, customizer);\n    });\n\n    /**\n     * Creates an array of values corresponding to `paths` of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Array} Returns the picked values.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n     *\n     * _.at(object, ['a[0].b.c', 'a[1]']);\n     * // => [3, 4]\n     */\n    var at = flatRest(baseAt);\n\n    /**\n     * Creates an object that inherits from the `prototype` object. If a\n     * `properties` object is given, its own enumerable string keyed properties\n     * are assigned to the created object.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.3.0\n     * @category Object\n     * @param {Object} prototype The object to inherit from.\n     * @param {Object} [properties] The properties to assign to the object.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * function Shape() {\n     *   this.x = 0;\n     *   this.y = 0;\n     * }\n     *\n     * function Circle() {\n     *   Shape.call(this);\n     * }\n     *\n     * Circle.prototype = _.create(Shape.prototype, {\n     *   'constructor': Circle\n     * });\n     *\n     * var circle = new Circle;\n     * circle instanceof Circle;\n     * // => true\n     *\n     * circle instanceof Shape;\n     * // => true\n     */\n    function create(prototype, properties) {\n      var result = baseCreate(prototype);\n      return properties == null ? result : baseAssign(result, properties);\n    }\n\n    /**\n     * Assigns own and inherited enumerable string keyed properties of source\n     * objects to the destination object for all destination properties that\n     * resolve to `undefined`. Source objects are applied from left to right.\n     * Once a property is set, additional values of the same property are ignored.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.defaultsDeep\n     * @example\n     *\n     * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var defaults = baseRest(function(object, sources) {\n      object = Object(object);\n\n      var index = -1;\n      var length = sources.length;\n      var guard = length > 2 ? sources[2] : undefined;\n\n      if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n        length = 1;\n      }\n\n      while (++index < length) {\n        var source = sources[index];\n        var props = keysIn(source);\n        var propsIndex = -1;\n        var propsLength = props.length;\n\n        while (++propsIndex < propsLength) {\n          var key = props[propsIndex];\n          var value = object[key];\n\n          if (value === undefined ||\n              (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n            object[key] = source[key];\n          }\n        }\n      }\n\n      return object;\n    });\n\n    /**\n     * This method is like `_.defaults` except that it recursively assigns\n     * default properties.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.defaults\n     * @example\n     *\n     * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });\n     * // => { 'a': { 'b': 2, 'c': 3 } }\n     */\n    var defaultsDeep = baseRest(function(args) {\n      args.push(undefined, customDefaultsMerge);\n      return apply(mergeWith, undefined, args);\n    });\n\n    /**\n     * This method is like `_.find` except that it returns the key of the first\n     * element `predicate` returns truthy for instead of the element itself.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.1.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {string|undefined} Returns the key of the matched element,\n     *  else `undefined`.\n     * @example\n     *\n     * var users = {\n     *   'barney':  { 'age': 36, 'active': true },\n     *   'fred':    { 'age': 40, 'active': false },\n     *   'pebbles': { 'age': 1,  'active': true }\n     * };\n     *\n     * _.findKey(users, function(o) { return o.age < 40; });\n     * // => 'barney' (iteration order is not guaranteed)\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findKey(users, { 'age': 1, 'active': true });\n     * // => 'pebbles'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findKey(users, ['active', false]);\n     * // => 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findKey(users, 'active');\n     * // => 'barney'\n     */\n    function findKey(object, predicate) {\n      return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);\n    }\n\n    /**\n     * This method is like `_.findKey` except that it iterates over elements of\n     * a collection in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {string|undefined} Returns the key of the matched element,\n     *  else `undefined`.\n     * @example\n     *\n     * var users = {\n     *   'barney':  { 'age': 36, 'active': true },\n     *   'fred':    { 'age': 40, 'active': false },\n     *   'pebbles': { 'age': 1,  'active': true }\n     * };\n     *\n     * _.findLastKey(users, function(o) { return o.age < 40; });\n     * // => returns 'pebbles' assuming `_.findKey` returns 'barney'\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findLastKey(users, { 'age': 36, 'active': true });\n     * // => 'barney'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findLastKey(users, ['active', false]);\n     * // => 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findLastKey(users, 'active');\n     * // => 'pebbles'\n     */\n    function findLastKey(object, predicate) {\n      return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);\n    }\n\n    /**\n     * Iterates over own and inherited enumerable string keyed properties of an\n     * object and invokes `iteratee` for each property. The iteratee is invoked\n     * with three arguments: (value, key, object). Iteratee functions may exit\n     * iteration early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forInRight\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forIn(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n     */\n    function forIn(object, iteratee) {\n      return object == null\n        ? object\n        : baseFor(object, getIteratee(iteratee, 3), keysIn);\n    }\n\n    /**\n     * This method is like `_.forIn` except that it iterates over properties of\n     * `object` in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forInRight(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.\n     */\n    function forInRight(object, iteratee) {\n      return object == null\n        ? object\n        : baseForRight(object, getIteratee(iteratee, 3), keysIn);\n    }\n\n    /**\n     * Iterates over own enumerable string keyed properties of an object and\n     * invokes `iteratee` for each property. The iteratee is invoked with three\n     * arguments: (value, key, object). Iteratee functions may exit iteration\n     * early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forOwnRight\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forOwn(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n     */\n    function forOwn(object, iteratee) {\n      return object && baseForOwn(object, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.forOwn` except that it iterates over properties of\n     * `object` in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forOwn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forOwnRight(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.\n     */\n    function forOwnRight(object, iteratee) {\n      return object && baseForOwnRight(object, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * Creates an array of function property names from own enumerable properties\n     * of `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @returns {Array} Returns the function names.\n     * @see _.functionsIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = _.constant('a');\n     *   this.b = _.constant('b');\n     * }\n     *\n     * Foo.prototype.c = _.constant('c');\n     *\n     * _.functions(new Foo);\n     * // => ['a', 'b']\n     */\n    function functions(object) {\n      return object == null ? [] : baseFunctions(object, keys(object));\n    }\n\n    /**\n     * Creates an array of function property names from own and inherited\n     * enumerable properties of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @returns {Array} Returns the function names.\n     * @see _.functions\n     * @example\n     *\n     * function Foo() {\n     *   this.a = _.constant('a');\n     *   this.b = _.constant('b');\n     * }\n     *\n     * Foo.prototype.c = _.constant('c');\n     *\n     * _.functionsIn(new Foo);\n     * // => ['a', 'b', 'c']\n     */\n    function functionsIn(object) {\n      return object == null ? [] : baseFunctions(object, keysIn(object));\n    }\n\n    /**\n     * Gets the value at `path` of `object`. If the resolved value is\n     * `undefined`, the `defaultValue` is returned in its place.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to get.\n     * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.get(object, 'a[0].b.c');\n     * // => 3\n     *\n     * _.get(object, ['a', '0', 'b', 'c']);\n     * // => 3\n     *\n     * _.get(object, 'a.b.c', 'default');\n     * // => 'default'\n     */\n    function get(object, path, defaultValue) {\n      var result = object == null ? undefined : baseGet(object, path);\n      return result === undefined ? defaultValue : result;\n    }\n\n    /**\n     * Checks if `path` is a direct property of `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path to check.\n     * @returns {boolean} Returns `true` if `path` exists, else `false`.\n     * @example\n     *\n     * var object = { 'a': { 'b': 2 } };\n     * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n     *\n     * _.has(object, 'a');\n     * // => true\n     *\n     * _.has(object, 'a.b');\n     * // => true\n     *\n     * _.has(object, ['a', 'b']);\n     * // => true\n     *\n     * _.has(other, 'a');\n     * // => false\n     */\n    function has(object, path) {\n      return object != null && hasPath(object, path, baseHas);\n    }\n\n    /**\n     * Checks if `path` is a direct or inherited property of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path to check.\n     * @returns {boolean} Returns `true` if `path` exists, else `false`.\n     * @example\n     *\n     * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n     *\n     * _.hasIn(object, 'a');\n     * // => true\n     *\n     * _.hasIn(object, 'a.b');\n     * // => true\n     *\n     * _.hasIn(object, ['a', 'b']);\n     * // => true\n     *\n     * _.hasIn(object, 'b');\n     * // => false\n     */\n    function hasIn(object, path) {\n      return object != null && hasPath(object, path, baseHasIn);\n    }\n\n    /**\n     * Creates an object composed of the inverted keys and values of `object`.\n     * If `object` contains duplicate values, subsequent values overwrite\n     * property assignments of previous values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.7.0\n     * @category Object\n     * @param {Object} object The object to invert.\n     * @returns {Object} Returns the new inverted object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2, 'c': 1 };\n     *\n     * _.invert(object);\n     * // => { '1': 'c', '2': 'b' }\n     */\n    var invert = createInverter(function(result, value, key) {\n      if (value != null &&\n          typeof value.toString != 'function') {\n        value = nativeObjectToString.call(value);\n      }\n\n      result[value] = key;\n    }, constant(identity));\n\n    /**\n     * This method is like `_.invert` except that the inverted object is generated\n     * from the results of running each element of `object` thru `iteratee`. The\n     * corresponding inverted value of each inverted key is an array of keys\n     * responsible for generating the inverted value. The iteratee is invoked\n     * with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.1.0\n     * @category Object\n     * @param {Object} object The object to invert.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Object} Returns the new inverted object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2, 'c': 1 };\n     *\n     * _.invertBy(object);\n     * // => { '1': ['a', 'c'], '2': ['b'] }\n     *\n     * _.invertBy(object, function(value) {\n     *   return 'group' + value;\n     * });\n     * // => { 'group1': ['a', 'c'], 'group2': ['b'] }\n     */\n    var invertBy = createInverter(function(result, value, key) {\n      if (value != null &&\n          typeof value.toString != 'function') {\n        value = nativeObjectToString.call(value);\n      }\n\n      if (hasOwnProperty.call(result, value)) {\n        result[value].push(key);\n      } else {\n        result[value] = [key];\n      }\n    }, getIteratee);\n\n    /**\n     * Invokes the method at `path` of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {*} Returns the result of the invoked method.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };\n     *\n     * _.invoke(object, 'a[0].b.c.slice', 1, 3);\n     * // => [2, 3]\n     */\n    var invoke = baseRest(baseInvoke);\n\n    /**\n     * Creates an array of the own enumerable property names of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects. See the\n     * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n     * for more details.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.keys(new Foo);\n     * // => ['a', 'b'] (iteration order is not guaranteed)\n     *\n     * _.keys('hi');\n     * // => ['0', '1']\n     */\n    function keys(object) {\n      return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n    }\n\n    /**\n     * Creates an array of the own and inherited enumerable property names of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.keysIn(new Foo);\n     * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n     */\n    function keysIn(object) {\n      return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n    }\n\n    /**\n     * The opposite of `_.mapValues`; this method creates an object with the\n     * same values as `object` and keys generated by running each own enumerable\n     * string keyed property of `object` thru `iteratee`. The iteratee is invoked\n     * with three arguments: (value, key, object).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns the new mapped object.\n     * @see _.mapValues\n     * @example\n     *\n     * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {\n     *   return key + value;\n     * });\n     * // => { 'a1': 1, 'b2': 2 }\n     */\n    function mapKeys(object, iteratee) {\n      var result = {};\n      iteratee = getIteratee(iteratee, 3);\n\n      baseForOwn(object, function(value, key, object) {\n        baseAssignValue(result, iteratee(value, key, object), value);\n      });\n      return result;\n    }\n\n    /**\n     * Creates an object with the same keys as `object` and values generated\n     * by running each own enumerable string keyed property of `object` thru\n     * `iteratee`. The iteratee is invoked with three arguments:\n     * (value, key, object).\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns the new mapped object.\n     * @see _.mapKeys\n     * @example\n     *\n     * var users = {\n     *   'fred':    { 'user': 'fred',    'age': 40 },\n     *   'pebbles': { 'user': 'pebbles', 'age': 1 }\n     * };\n     *\n     * _.mapValues(users, function(o) { return o.age; });\n     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.mapValues(users, 'age');\n     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n     */\n    function mapValues(object, iteratee) {\n      var result = {};\n      iteratee = getIteratee(iteratee, 3);\n\n      baseForOwn(object, function(value, key, object) {\n        baseAssignValue(result, key, iteratee(value, key, object));\n      });\n      return result;\n    }\n\n    /**\n     * This method is like `_.assign` except that it recursively merges own and\n     * inherited enumerable string keyed properties of source objects into the\n     * destination object. Source properties that resolve to `undefined` are\n     * skipped if a destination value exists. Array and plain object properties\n     * are merged recursively. Other objects and value types are overridden by\n     * assignment. Source objects are applied from left to right. Subsequent\n     * sources overwrite property assignments of previous sources.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {\n     *   'a': [{ 'b': 2 }, { 'd': 4 }]\n     * };\n     *\n     * var other = {\n     *   'a': [{ 'c': 3 }, { 'e': 5 }]\n     * };\n     *\n     * _.merge(object, other);\n     * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n     */\n    var merge = createAssigner(function(object, source, srcIndex) {\n      baseMerge(object, source, srcIndex);\n    });\n\n    /**\n     * This method is like `_.merge` except that it accepts `customizer` which\n     * is invoked to produce the merged values of the destination and source\n     * properties. If `customizer` returns `undefined`, merging is handled by the\n     * method instead. The `customizer` is invoked with six arguments:\n     * (objValue, srcValue, key, object, source, stack).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} customizer The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   if (_.isArray(objValue)) {\n     *     return objValue.concat(srcValue);\n     *   }\n     * }\n     *\n     * var object = { 'a': [1], 'b': [2] };\n     * var other = { 'a': [3], 'b': [4] };\n     *\n     * _.mergeWith(object, other, customizer);\n     * // => { 'a': [1, 3], 'b': [2, 4] }\n     */\n    var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\n      baseMerge(object, source, srcIndex, customizer);\n    });\n\n    /**\n     * The opposite of `_.pick`; this method creates an object composed of the\n     * own and inherited enumerable property paths of `object` that are not omitted.\n     *\n     * **Note:** This method is considerably slower than `_.pick`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {...(string|string[])} [paths] The property paths to omit.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.omit(object, ['a', 'c']);\n     * // => { 'b': '2' }\n     */\n    var omit = flatRest(function(object, paths) {\n      var result = {};\n      if (object == null) {\n        return result;\n      }\n      var isDeep = false;\n      paths = arrayMap(paths, function(path) {\n        path = castPath(path, object);\n        isDeep || (isDeep = path.length > 1);\n        return path;\n      });\n      copyObject(object, getAllKeysIn(object), result);\n      if (isDeep) {\n        result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\n      }\n      var length = paths.length;\n      while (length--) {\n        baseUnset(result, paths[length]);\n      }\n      return result;\n    });\n\n    /**\n     * The opposite of `_.pickBy`; this method creates an object composed of\n     * the own and inherited enumerable string keyed properties of `object` that\n     * `predicate` doesn't return truthy for. The predicate is invoked with two\n     * arguments: (value, key).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {Function} [predicate=_.identity] The function invoked per property.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.omitBy(object, _.isNumber);\n     * // => { 'b': '2' }\n     */\n    function omitBy(object, predicate) {\n      return pickBy(object, negate(getIteratee(predicate)));\n    }\n\n    /**\n     * Creates an object composed of the picked `object` properties.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.pick(object, ['a', 'c']);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    var pick = flatRest(function(object, paths) {\n      return object == null ? {} : basePick(object, paths);\n    });\n\n    /**\n     * Creates an object composed of the `object` properties `predicate` returns\n     * truthy for. The predicate is invoked with two arguments: (value, key).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {Function} [predicate=_.identity] The function invoked per property.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.pickBy(object, _.isNumber);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    function pickBy(object, predicate) {\n      if (object == null) {\n        return {};\n      }\n      var props = arrayMap(getAllKeysIn(object), function(prop) {\n        return [prop];\n      });\n      predicate = getIteratee(predicate);\n      return basePickBy(object, props, function(value, path) {\n        return predicate(value, path[0]);\n      });\n    }\n\n    /**\n     * This method is like `_.get` except that if the resolved value is a\n     * function it's invoked with the `this` binding of its parent object and\n     * its result is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to resolve.\n     * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };\n     *\n     * _.result(object, 'a[0].b.c1');\n     * // => 3\n     *\n     * _.result(object, 'a[0].b.c2');\n     * // => 4\n     *\n     * _.result(object, 'a[0].b.c3', 'default');\n     * // => 'default'\n     *\n     * _.result(object, 'a[0].b.c3', _.constant('default'));\n     * // => 'default'\n     */\n    function result(object, path, defaultValue) {\n      path = castPath(path, object);\n\n      var index = -1,\n          length = path.length;\n\n      // Ensure the loop is entered when path is empty.\n      if (!length) {\n        length = 1;\n        object = undefined;\n      }\n      while (++index < length) {\n        var value = object == null ? undefined : object[toKey(path[index])];\n        if (value === undefined) {\n          index = length;\n          value = defaultValue;\n        }\n        object = isFunction(value) ? value.call(object) : value;\n      }\n      return object;\n    }\n\n    /**\n     * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\n     * it's created. Arrays are created for missing index properties while objects\n     * are created for all other missing properties. Use `_.setWith` to customize\n     * `path` creation.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.set(object, 'a[0].b.c', 4);\n     * console.log(object.a[0].b.c);\n     * // => 4\n     *\n     * _.set(object, ['x', '0', 'y', 'z'], 5);\n     * console.log(object.x[0].y.z);\n     * // => 5\n     */\n    function set(object, path, value) {\n      return object == null ? object : baseSet(object, path, value);\n    }\n\n    /**\n     * This method is like `_.set` except that it accepts `customizer` which is\n     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`\n     * path creation is handled by the method instead. The `customizer` is invoked\n     * with three arguments: (nsValue, key, nsObject).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {*} value The value to set.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {};\n     *\n     * _.setWith(object, '[0][1]', 'a', Object);\n     * // => { '0': { '1': 'a' } }\n     */\n    function setWith(object, path, value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return object == null ? object : baseSet(object, path, value, customizer);\n    }\n\n    /**\n     * Creates an array of own enumerable string keyed-value pairs for `object`\n     * which can be consumed by `_.fromPairs`. If `object` is a map or set, its\n     * entries are returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias entries\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the key-value pairs.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.toPairs(new Foo);\n     * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)\n     */\n    var toPairs = createToPairs(keys);\n\n    /**\n     * Creates an array of own and inherited enumerable string keyed-value pairs\n     * for `object` which can be consumed by `_.fromPairs`. If `object` is a map\n     * or set, its entries are returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias entriesIn\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the key-value pairs.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.toPairsIn(new Foo);\n     * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)\n     */\n    var toPairsIn = createToPairs(keysIn);\n\n    /**\n     * An alternative to `_.reduce`; this method transforms `object` to a new\n     * `accumulator` object which is the result of running each of its own\n     * enumerable string keyed properties thru `iteratee`, with each invocation\n     * potentially mutating the `accumulator` object. If `accumulator` is not\n     * provided, a new object with the same `[[Prototype]]` will be used. The\n     * iteratee is invoked with four arguments: (accumulator, value, key, object).\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The custom accumulator value.\n     * @returns {*} Returns the accumulated value.\n     * @example\n     *\n     * _.transform([2, 3, 4], function(result, n) {\n     *   result.push(n *= n);\n     *   return n % 2 == 0;\n     * }, []);\n     * // => [4, 9]\n     *\n     * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n     *   (result[value] || (result[value] = [])).push(key);\n     * }, {});\n     * // => { '1': ['a', 'c'], '2': ['b'] }\n     */\n    function transform(object, iteratee, accumulator) {\n      var isArr = isArray(object),\n          isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n      iteratee = getIteratee(iteratee, 4);\n      if (accumulator == null) {\n        var Ctor = object && object.constructor;\n        if (isArrLike) {\n          accumulator = isArr ? new Ctor : [];\n        }\n        else if (isObject(object)) {\n          accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n        }\n        else {\n          accumulator = {};\n        }\n      }\n      (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n        return iteratee(accumulator, value, index, object);\n      });\n      return accumulator;\n    }\n\n    /**\n     * Removes the property at `path` of `object`.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to unset.\n     * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 7 } }] };\n     * _.unset(object, 'a[0].b.c');\n     * // => true\n     *\n     * console.log(object);\n     * // => { 'a': [{ 'b': {} }] };\n     *\n     * _.unset(object, ['a', '0', 'b', 'c']);\n     * // => true\n     *\n     * console.log(object);\n     * // => { 'a': [{ 'b': {} }] };\n     */\n    function unset(object, path) {\n      return object == null ? true : baseUnset(object, path);\n    }\n\n    /**\n     * This method is like `_.set` except that accepts `updater` to produce the\n     * value to set. Use `_.updateWith` to customize `path` creation. The `updater`\n     * is invoked with one argument: (value).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {Function} updater The function to produce the updated value.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.update(object, 'a[0].b.c', function(n) { return n * n; });\n     * console.log(object.a[0].b.c);\n     * // => 9\n     *\n     * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });\n     * console.log(object.x[0].y.z);\n     * // => 0\n     */\n    function update(object, path, updater) {\n      return object == null ? object : baseUpdate(object, path, castFunction(updater));\n    }\n\n    /**\n     * This method is like `_.update` except that it accepts `customizer` which is\n     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`\n     * path creation is handled by the method instead. The `customizer` is invoked\n     * with three arguments: (nsValue, key, nsObject).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {Function} updater The function to produce the updated value.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {};\n     *\n     * _.updateWith(object, '[0][1]', _.constant('a'), Object);\n     * // => { '0': { '1': 'a' } }\n     */\n    function updateWith(object, path, updater, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);\n    }\n\n    /**\n     * Creates an array of the own enumerable string keyed property values of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property values.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.values(new Foo);\n     * // => [1, 2] (iteration order is not guaranteed)\n     *\n     * _.values('hi');\n     * // => ['h', 'i']\n     */\n    function values(object) {\n      return object == null ? [] : baseValues(object, keys(object));\n    }\n\n    /**\n     * Creates an array of the own and inherited enumerable string keyed property\n     * values of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property values.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.valuesIn(new Foo);\n     * // => [1, 2, 3] (iteration order is not guaranteed)\n     */\n    function valuesIn(object) {\n      return object == null ? [] : baseValues(object, keysIn(object));\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Clamps `number` within the inclusive `lower` and `upper` bounds.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Number\n     * @param {number} number The number to clamp.\n     * @param {number} [lower] The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the clamped number.\n     * @example\n     *\n     * _.clamp(-10, -5, 5);\n     * // => -5\n     *\n     * _.clamp(10, -5, 5);\n     * // => 5\n     */\n    function clamp(number, lower, upper) {\n      if (upper === undefined) {\n        upper = lower;\n        lower = undefined;\n      }\n      if (upper !== undefined) {\n        upper = toNumber(upper);\n        upper = upper === upper ? upper : 0;\n      }\n      if (lower !== undefined) {\n        lower = toNumber(lower);\n        lower = lower === lower ? lower : 0;\n      }\n      return baseClamp(toNumber(number), lower, upper);\n    }\n\n    /**\n     * Checks if `n` is between `start` and up to, but not including, `end`. If\n     * `end` is not specified, it's set to `start` with `start` then set to `0`.\n     * If `start` is greater than `end` the params are swapped to support\n     * negative ranges.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.3.0\n     * @category Number\n     * @param {number} number The number to check.\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n     * @see _.range, _.rangeRight\n     * @example\n     *\n     * _.inRange(3, 2, 4);\n     * // => true\n     *\n     * _.inRange(4, 8);\n     * // => true\n     *\n     * _.inRange(4, 2);\n     * // => false\n     *\n     * _.inRange(2, 2);\n     * // => false\n     *\n     * _.inRange(1.2, 2);\n     * // => true\n     *\n     * _.inRange(5.2, 4);\n     * // => false\n     *\n     * _.inRange(-3, -2, -6);\n     * // => true\n     */\n    function inRange(number, start, end) {\n      start = toFinite(start);\n      if (end === undefined) {\n        end = start;\n        start = 0;\n      } else {\n        end = toFinite(end);\n      }\n      number = toNumber(number);\n      return baseInRange(number, start, end);\n    }\n\n    /**\n     * Produces a random number between the inclusive `lower` and `upper` bounds.\n     * If only one argument is provided a number between `0` and the given number\n     * is returned. If `floating` is `true`, or either `lower` or `upper` are\n     * floats, a floating-point number is returned instead of an integer.\n     *\n     * **Note:** JavaScript follows the IEEE-754 standard for resolving\n     * floating-point values which can produce unexpected results.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.7.0\n     * @category Number\n     * @param {number} [lower=0] The lower bound.\n     * @param {number} [upper=1] The upper bound.\n     * @param {boolean} [floating] Specify returning a floating-point number.\n     * @returns {number} Returns the random number.\n     * @example\n     *\n     * _.random(0, 5);\n     * // => an integer between 0 and 5\n     *\n     * _.random(5);\n     * // => also an integer between 0 and 5\n     *\n     * _.random(5, true);\n     * // => a floating-point number between 0 and 5\n     *\n     * _.random(1.2, 5.2);\n     * // => a floating-point number between 1.2 and 5.2\n     */\n    function random(lower, upper, floating) {\n      if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {\n        upper = floating = undefined;\n      }\n      if (floating === undefined) {\n        if (typeof upper == 'boolean') {\n          floating = upper;\n          upper = undefined;\n        }\n        else if (typeof lower == 'boolean') {\n          floating = lower;\n          lower = undefined;\n        }\n      }\n      if (lower === undefined && upper === undefined) {\n        lower = 0;\n        upper = 1;\n      }\n      else {\n        lower = toFinite(lower);\n        if (upper === undefined) {\n          upper = lower;\n          lower = 0;\n        } else {\n          upper = toFinite(upper);\n        }\n      }\n      if (lower > upper) {\n        var temp = lower;\n        lower = upper;\n        upper = temp;\n      }\n      if (floating || lower % 1 || upper % 1) {\n        var rand = nativeRandom();\n        return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);\n      }\n      return baseRandom(lower, upper);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the camel cased string.\n     * @example\n     *\n     * _.camelCase('Foo Bar');\n     * // => 'fooBar'\n     *\n     * _.camelCase('--foo-bar--');\n     * // => 'fooBar'\n     *\n     * _.camelCase('__FOO_BAR__');\n     * // => 'fooBar'\n     */\n    var camelCase = createCompounder(function(result, word, index) {\n      word = word.toLowerCase();\n      return result + (index ? capitalize(word) : word);\n    });\n\n    /**\n     * Converts the first character of `string` to upper case and the remaining\n     * to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to capitalize.\n     * @returns {string} Returns the capitalized string.\n     * @example\n     *\n     * _.capitalize('FRED');\n     * // => 'Fred'\n     */\n    function capitalize(string) {\n      return upperFirst(toString(string).toLowerCase());\n    }\n\n    /**\n     * Deburrs `string` by converting\n     * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n     * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n     * letters to basic Latin letters and removing\n     * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to deburr.\n     * @returns {string} Returns the deburred string.\n     * @example\n     *\n     * _.deburr('déjà vu');\n     * // => 'deja vu'\n     */\n    function deburr(string) {\n      string = toString(string);\n      return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n    }\n\n    /**\n     * Checks if `string` ends with the given target string.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {string} [target] The string to search for.\n     * @param {number} [position=string.length] The position to search up to.\n     * @returns {boolean} Returns `true` if `string` ends with `target`,\n     *  else `false`.\n     * @example\n     *\n     * _.endsWith('abc', 'c');\n     * // => true\n     *\n     * _.endsWith('abc', 'b');\n     * // => false\n     *\n     * _.endsWith('abc', 'b', 2);\n     * // => true\n     */\n    function endsWith(string, target, position) {\n      string = toString(string);\n      target = baseToString(target);\n\n      var length = string.length;\n      position = position === undefined\n        ? length\n        : baseClamp(toInteger(position), 0, length);\n\n      var end = position;\n      position -= target.length;\n      return position >= 0 && string.slice(position, end) == target;\n    }\n\n    /**\n     * Converts the characters \"&\", \"<\", \">\", '\"', and \"'\" in `string` to their\n     * corresponding HTML entities.\n     *\n     * **Note:** No other characters are escaped. To escape additional\n     * characters use a third-party library like [_he_](https://mths.be/he).\n     *\n     * Though the \">\" character is escaped for symmetry, characters like\n     * \">\" and \"/\" don't need escaping in HTML and have no special meaning\n     * unless they're part of a tag or unquoted attribute value. See\n     * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)\n     * (under \"semi-related fun fact\") for more details.\n     *\n     * When working with HTML you should always\n     * [quote attribute values](http://wonko.com/post/html-escaping) to reduce\n     * XSS vectors.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category String\n     * @param {string} [string=''] The string to escape.\n     * @returns {string} Returns the escaped string.\n     * @example\n     *\n     * _.escape('fred, barney, & pebbles');\n     * // => 'fred, barney, &amp; pebbles'\n     */\n    function escape(string) {\n      string = toString(string);\n      return (string && reHasUnescapedHtml.test(string))\n        ? string.replace(reUnescapedHtml, escapeHtmlChar)\n        : string;\n    }\n\n    /**\n     * Escapes the `RegExp` special characters \"^\", \"$\", \"\\\", \".\", \"*\", \"+\",\n     * \"?\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", and \"|\" in `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to escape.\n     * @returns {string} Returns the escaped string.\n     * @example\n     *\n     * _.escapeRegExp('[lodash](https://lodash.com/)');\n     * // => '\\[lodash\\]\\(https://lodash\\.com/\\)'\n     */\n    function escapeRegExp(string) {\n      string = toString(string);\n      return (string && reHasRegExpChar.test(string))\n        ? string.replace(reRegExpChar, '\\\\$&')\n        : string;\n    }\n\n    /**\n     * Converts `string` to\n     * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the kebab cased string.\n     * @example\n     *\n     * _.kebabCase('Foo Bar');\n     * // => 'foo-bar'\n     *\n     * _.kebabCase('fooBar');\n     * // => 'foo-bar'\n     *\n     * _.kebabCase('__FOO_BAR__');\n     * // => 'foo-bar'\n     */\n    var kebabCase = createCompounder(function(result, word, index) {\n      return result + (index ? '-' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Converts `string`, as space separated words, to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the lower cased string.\n     * @example\n     *\n     * _.lowerCase('--Foo-Bar--');\n     * // => 'foo bar'\n     *\n     * _.lowerCase('fooBar');\n     * // => 'foo bar'\n     *\n     * _.lowerCase('__FOO_BAR__');\n     * // => 'foo bar'\n     */\n    var lowerCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Converts the first character of `string` to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.lowerFirst('Fred');\n     * // => 'fred'\n     *\n     * _.lowerFirst('FRED');\n     * // => 'fRED'\n     */\n    var lowerFirst = createCaseFirst('toLowerCase');\n\n    /**\n     * Pads `string` on the left and right sides if it's shorter than `length`.\n     * Padding characters are truncated if they can't be evenly divided by `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.pad('abc', 8);\n     * // => '  abc   '\n     *\n     * _.pad('abc', 8, '_-');\n     * // => '_-abc_-_'\n     *\n     * _.pad('abc', 3);\n     * // => 'abc'\n     */\n    function pad(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      if (!length || strLength >= length) {\n        return string;\n      }\n      var mid = (length - strLength) / 2;\n      return (\n        createPadding(nativeFloor(mid), chars) +\n        string +\n        createPadding(nativeCeil(mid), chars)\n      );\n    }\n\n    /**\n     * Pads `string` on the right side if it's shorter than `length`. Padding\n     * characters are truncated if they exceed `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.padEnd('abc', 6);\n     * // => 'abc   '\n     *\n     * _.padEnd('abc', 6, '_-');\n     * // => 'abc_-_'\n     *\n     * _.padEnd('abc', 3);\n     * // => 'abc'\n     */\n    function padEnd(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      return (length && strLength < length)\n        ? (string + createPadding(length - strLength, chars))\n        : string;\n    }\n\n    /**\n     * Pads `string` on the left side if it's shorter than `length`. Padding\n     * characters are truncated if they exceed `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.padStart('abc', 6);\n     * // => '   abc'\n     *\n     * _.padStart('abc', 6, '_-');\n     * // => '_-_abc'\n     *\n     * _.padStart('abc', 3);\n     * // => 'abc'\n     */\n    function padStart(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      return (length && strLength < length)\n        ? (createPadding(length - strLength, chars) + string)\n        : string;\n    }\n\n    /**\n     * Converts `string` to an integer of the specified radix. If `radix` is\n     * `undefined` or `0`, a `radix` of `10` is used unless `value` is a\n     * hexadecimal, in which case a `radix` of `16` is used.\n     *\n     * **Note:** This method aligns with the\n     * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.1.0\n     * @category String\n     * @param {string} string The string to convert.\n     * @param {number} [radix=10] The radix to interpret `value` by.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.parseInt('08');\n     * // => 8\n     *\n     * _.map(['6', '08', '10'], _.parseInt);\n     * // => [6, 8, 10]\n     */\n    function parseInt(string, radix, guard) {\n      if (guard || radix == null) {\n        radix = 0;\n      } else if (radix) {\n        radix = +radix;\n      }\n      return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);\n    }\n\n    /**\n     * Repeats the given string `n` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to repeat.\n     * @param {number} [n=1] The number of times to repeat the string.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the repeated string.\n     * @example\n     *\n     * _.repeat('*', 3);\n     * // => '***'\n     *\n     * _.repeat('abc', 2);\n     * // => 'abcabc'\n     *\n     * _.repeat('abc', 0);\n     * // => ''\n     */\n    function repeat(string, n, guard) {\n      if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {\n        n = 1;\n      } else {\n        n = toInteger(n);\n      }\n      return baseRepeat(toString(string), n);\n    }\n\n    /**\n     * Replaces matches for `pattern` in `string` with `replacement`.\n     *\n     * **Note:** This method is based on\n     * [`String#replace`](https://mdn.io/String/replace).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to modify.\n     * @param {RegExp|string} pattern The pattern to replace.\n     * @param {Function|string} replacement The match replacement.\n     * @returns {string} Returns the modified string.\n     * @example\n     *\n     * _.replace('Hi Fred', 'Fred', 'Barney');\n     * // => 'Hi Barney'\n     */\n    function replace() {\n      var args = arguments,\n          string = toString(args[0]);\n\n      return args.length < 3 ? string : string.replace(args[1], args[2]);\n    }\n\n    /**\n     * Converts `string` to\n     * [snake case](https://en.wikipedia.org/wiki/Snake_case).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the snake cased string.\n     * @example\n     *\n     * _.snakeCase('Foo Bar');\n     * // => 'foo_bar'\n     *\n     * _.snakeCase('fooBar');\n     * // => 'foo_bar'\n     *\n     * _.snakeCase('--FOO-BAR--');\n     * // => 'foo_bar'\n     */\n    var snakeCase = createCompounder(function(result, word, index) {\n      return result + (index ? '_' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Splits `string` by `separator`.\n     *\n     * **Note:** This method is based on\n     * [`String#split`](https://mdn.io/String/split).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to split.\n     * @param {RegExp|string} separator The separator pattern to split by.\n     * @param {number} [limit] The length to truncate results to.\n     * @returns {Array} Returns the string segments.\n     * @example\n     *\n     * _.split('a-b-c', '-', 2);\n     * // => ['a', 'b']\n     */\n    function split(string, separator, limit) {\n      if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {\n        separator = limit = undefined;\n      }\n      limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;\n      if (!limit) {\n        return [];\n      }\n      string = toString(string);\n      if (string && (\n            typeof separator == 'string' ||\n            (separator != null && !isRegExp(separator))\n          )) {\n        separator = baseToString(separator);\n        if (!separator && hasUnicode(string)) {\n          return castSlice(stringToArray(string), 0, limit);\n        }\n      }\n      return string.split(separator, limit);\n    }\n\n    /**\n     * Converts `string` to\n     * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.1.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the start cased string.\n     * @example\n     *\n     * _.startCase('--foo-bar--');\n     * // => 'Foo Bar'\n     *\n     * _.startCase('fooBar');\n     * // => 'Foo Bar'\n     *\n     * _.startCase('__FOO_BAR__');\n     * // => 'FOO BAR'\n     */\n    var startCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + upperFirst(word);\n    });\n\n    /**\n     * Checks if `string` starts with the given target string.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {string} [target] The string to search for.\n     * @param {number} [position=0] The position to search from.\n     * @returns {boolean} Returns `true` if `string` starts with `target`,\n     *  else `false`.\n     * @example\n     *\n     * _.startsWith('abc', 'a');\n     * // => true\n     *\n     * _.startsWith('abc', 'b');\n     * // => false\n     *\n     * _.startsWith('abc', 'b', 1);\n     * // => true\n     */\n    function startsWith(string, target, position) {\n      string = toString(string);\n      position = position == null\n        ? 0\n        : baseClamp(toInteger(position), 0, string.length);\n\n      target = baseToString(target);\n      return string.slice(position, position + target.length) == target;\n    }\n\n    /**\n     * Creates a compiled template function that can interpolate data properties\n     * in \"interpolate\" delimiters, HTML-escape interpolated data properties in\n     * \"escape\" delimiters, and execute JavaScript in \"evaluate\" delimiters. Data\n     * properties may be accessed as free variables in the template. If a setting\n     * object is given, it takes precedence over `_.templateSettings` values.\n     *\n     * **Note:** In the development build `_.template` utilizes\n     * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)\n     * for easier debugging.\n     *\n     * For more information on precompiling templates see\n     * [lodash's custom builds documentation](https://lodash.com/custom-builds).\n     *\n     * For more information on Chrome extension sandboxes see\n     * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category String\n     * @param {string} [string=''] The template string.\n     * @param {Object} [options={}] The options object.\n     * @param {RegExp} [options.escape=_.templateSettings.escape]\n     *  The HTML \"escape\" delimiter.\n     * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]\n     *  The \"evaluate\" delimiter.\n     * @param {Object} [options.imports=_.templateSettings.imports]\n     *  An object to import into the template as free variables.\n     * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]\n     *  The \"interpolate\" delimiter.\n     * @param {string} [options.sourceURL='lodash.templateSources[n]']\n     *  The sourceURL of the compiled template.\n     * @param {string} [options.variable='obj']\n     *  The data object variable name.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the compiled template function.\n     * @example\n     *\n     * // Use the \"interpolate\" delimiter to create a compiled template.\n     * var compiled = _.template('hello <%= user %>!');\n     * compiled({ 'user': 'fred' });\n     * // => 'hello fred!'\n     *\n     * // Use the HTML \"escape\" delimiter to escape data property values.\n     * var compiled = _.template('<b><%- value %></b>');\n     * compiled({ 'value': '<script>' });\n     * // => '<b>&lt;script&gt;</b>'\n     *\n     * // Use the \"evaluate\" delimiter to execute JavaScript and generate HTML.\n     * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');\n     * compiled({ 'users': ['fred', 'barney'] });\n     * // => '<li>fred</li><li>barney</li>'\n     *\n     * // Use the internal `print` function in \"evaluate\" delimiters.\n     * var compiled = _.template('<% print(\"hello \" + user); %>!');\n     * compiled({ 'user': 'barney' });\n     * // => 'hello barney!'\n     *\n     * // Use the ES template literal delimiter as an \"interpolate\" delimiter.\n     * // Disable support by replacing the \"interpolate\" delimiter.\n     * var compiled = _.template('hello ${ user }!');\n     * compiled({ 'user': 'pebbles' });\n     * // => 'hello pebbles!'\n     *\n     * // Use backslashes to treat delimiters as plain text.\n     * var compiled = _.template('<%= \"\\\\<%- value %\\\\>\" %>');\n     * compiled({ 'value': 'ignored' });\n     * // => '<%- value %>'\n     *\n     * // Use the `imports` option to import `jQuery` as `jq`.\n     * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';\n     * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });\n     * compiled({ 'users': ['fred', 'barney'] });\n     * // => '<li>fred</li><li>barney</li>'\n     *\n     * // Use the `sourceURL` option to specify a custom sourceURL for the template.\n     * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });\n     * compiled(data);\n     * // => Find the source of \"greeting.jst\" under the Sources tab or Resources panel of the web inspector.\n     *\n     * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.\n     * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });\n     * compiled.source;\n     * // => function(data) {\n     * //   var __t, __p = '';\n     * //   __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';\n     * //   return __p;\n     * // }\n     *\n     * // Use custom template delimiters.\n     * _.templateSettings.interpolate = /{{([\\s\\S]+?)}}/g;\n     * var compiled = _.template('hello {{ user }}!');\n     * compiled({ 'user': 'mustache' });\n     * // => 'hello mustache!'\n     *\n     * // Use the `source` property to inline compiled templates for meaningful\n     * // line numbers in error messages and stack traces.\n     * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\\\n     *   var JST = {\\\n     *     \"main\": ' + _.template(mainText).source + '\\\n     *   };\\\n     * ');\n     */\n    function template(string, options, guard) {\n      // Based on John Resig's `tmpl` implementation\n      // (http://ejohn.org/blog/javascript-micro-templating/)\n      // and Laura Doktorova's doT.js (https://github.com/olado/doT).\n      var settings = lodash.templateSettings;\n\n      if (guard && isIterateeCall(string, options, guard)) {\n        options = undefined;\n      }\n      string = toString(string);\n      options = assignInWith({}, options, settings, customDefaultsAssignIn);\n\n      var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),\n          importsKeys = keys(imports),\n          importsValues = baseValues(imports, importsKeys);\n\n      var isEscaping,\n          isEvaluating,\n          index = 0,\n          interpolate = options.interpolate || reNoMatch,\n          source = \"__p += '\";\n\n      // Compile the regexp to match each delimiter.\n      var reDelimiters = RegExp(\n        (options.escape || reNoMatch).source + '|' +\n        interpolate.source + '|' +\n        (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +\n        (options.evaluate || reNoMatch).source + '|$'\n      , 'g');\n\n      // Use a sourceURL for easier debugging.\n      // The sourceURL gets injected into the source that's eval-ed, so be careful\n      // with lookup (in case of e.g. prototype pollution), and strip newlines if any.\n      // A newline wouldn't be a valid sourceURL anyway, and it'd enable code injection.\n      var sourceURL = '//# sourceURL=' +\n        (hasOwnProperty.call(options, 'sourceURL')\n          ? (options.sourceURL + '').replace(/[\\r\\n]/g, ' ')\n          : ('lodash.templateSources[' + (++templateCounter) + ']')\n        ) + '\\n';\n\n      string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {\n        interpolateValue || (interpolateValue = esTemplateValue);\n\n        // Escape characters that can't be included in string literals.\n        source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);\n\n        // Replace delimiters with snippets.\n        if (escapeValue) {\n          isEscaping = true;\n          source += \"' +\\n__e(\" + escapeValue + \") +\\n'\";\n        }\n        if (evaluateValue) {\n          isEvaluating = true;\n          source += \"';\\n\" + evaluateValue + \";\\n__p += '\";\n        }\n        if (interpolateValue) {\n          source += \"' +\\n((__t = (\" + interpolateValue + \")) == null ? '' : __t) +\\n'\";\n        }\n        index = offset + match.length;\n\n        // The JS engine embedded in Adobe products needs `match` returned in\n        // order to produce the correct `offset` value.\n        return match;\n      });\n\n      source += \"';\\n\";\n\n      // If `variable` is not specified wrap a with-statement around the generated\n      // code to add the data object to the top of the scope chain.\n      // Like with sourceURL, we take care to not check the option's prototype,\n      // as this configuration is a code injection vector.\n      var variable = hasOwnProperty.call(options, 'variable') && options.variable;\n      if (!variable) {\n        source = 'with (obj) {\\n' + source + '\\n}\\n';\n      }\n      // Cleanup code by stripping empty strings.\n      source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)\n        .replace(reEmptyStringMiddle, '$1')\n        .replace(reEmptyStringTrailing, '$1;');\n\n      // Frame code as the function body.\n      source = 'function(' + (variable || 'obj') + ') {\\n' +\n        (variable\n          ? ''\n          : 'obj || (obj = {});\\n'\n        ) +\n        \"var __t, __p = ''\" +\n        (isEscaping\n           ? ', __e = _.escape'\n           : ''\n        ) +\n        (isEvaluating\n          ? ', __j = Array.prototype.join;\\n' +\n            \"function print() { __p += __j.call(arguments, '') }\\n\"\n          : ';\\n'\n        ) +\n        source +\n        'return __p\\n}';\n\n      var result = attempt(function() {\n        return Function(importsKeys, sourceURL + 'return ' + source)\n          .apply(undefined, importsValues);\n      });\n\n      // Provide the compiled function's source by its `toString` method or\n      // the `source` property as a convenience for inlining compiled templates.\n      result.source = source;\n      if (isError(result)) {\n        throw result;\n      }\n      return result;\n    }\n\n    /**\n     * Converts `string`, as a whole, to lower case just like\n     * [String#toLowerCase](https://mdn.io/toLowerCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the lower cased string.\n     * @example\n     *\n     * _.toLower('--Foo-Bar--');\n     * // => '--foo-bar--'\n     *\n     * _.toLower('fooBar');\n     * // => 'foobar'\n     *\n     * _.toLower('__FOO_BAR__');\n     * // => '__foo_bar__'\n     */\n    function toLower(value) {\n      return toString(value).toLowerCase();\n    }\n\n    /**\n     * Converts `string`, as a whole, to upper case just like\n     * [String#toUpperCase](https://mdn.io/toUpperCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the upper cased string.\n     * @example\n     *\n     * _.toUpper('--foo-bar--');\n     * // => '--FOO-BAR--'\n     *\n     * _.toUpper('fooBar');\n     * // => 'FOOBAR'\n     *\n     * _.toUpper('__foo_bar__');\n     * // => '__FOO_BAR__'\n     */\n    function toUpper(value) {\n      return toString(value).toUpperCase();\n    }\n\n    /**\n     * Removes leading and trailing whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trim('  abc  ');\n     * // => 'abc'\n     *\n     * _.trim('-_-abc-_-', '_-');\n     * // => 'abc'\n     *\n     * _.map(['  foo  ', '  bar  '], _.trim);\n     * // => ['foo', 'bar']\n     */\n    function trim(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.replace(reTrim, '');\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          chrSymbols = stringToArray(chars),\n          start = charsStartIndex(strSymbols, chrSymbols),\n          end = charsEndIndex(strSymbols, chrSymbols) + 1;\n\n      return castSlice(strSymbols, start, end).join('');\n    }\n\n    /**\n     * Removes trailing whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trimEnd('  abc  ');\n     * // => '  abc'\n     *\n     * _.trimEnd('-_-abc-_-', '_-');\n     * // => '-_-abc'\n     */\n    function trimEnd(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.replace(reTrimEnd, '');\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;\n\n      return castSlice(strSymbols, 0, end).join('');\n    }\n\n    /**\n     * Removes leading whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trimStart('  abc  ');\n     * // => 'abc  '\n     *\n     * _.trimStart('-_-abc-_-', '_-');\n     * // => 'abc-_-'\n     */\n    function trimStart(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.replace(reTrimStart, '');\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          start = charsStartIndex(strSymbols, stringToArray(chars));\n\n      return castSlice(strSymbols, start).join('');\n    }\n\n    /**\n     * Truncates `string` if it's longer than the given maximum string length.\n     * The last characters of the truncated string are replaced with the omission\n     * string which defaults to \"...\".\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to truncate.\n     * @param {Object} [options={}] The options object.\n     * @param {number} [options.length=30] The maximum string length.\n     * @param {string} [options.omission='...'] The string to indicate text is omitted.\n     * @param {RegExp|string} [options.separator] The separator pattern to truncate to.\n     * @returns {string} Returns the truncated string.\n     * @example\n     *\n     * _.truncate('hi-diddly-ho there, neighborino');\n     * // => 'hi-diddly-ho there, neighbo...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'length': 24,\n     *   'separator': ' '\n     * });\n     * // => 'hi-diddly-ho there,...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'length': 24,\n     *   'separator': /,? +/\n     * });\n     * // => 'hi-diddly-ho there...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'omission': ' [...]'\n     * });\n     * // => 'hi-diddly-ho there, neig [...]'\n     */\n    function truncate(string, options) {\n      var length = DEFAULT_TRUNC_LENGTH,\n          omission = DEFAULT_TRUNC_OMISSION;\n\n      if (isObject(options)) {\n        var separator = 'separator' in options ? options.separator : separator;\n        length = 'length' in options ? toInteger(options.length) : length;\n        omission = 'omission' in options ? baseToString(options.omission) : omission;\n      }\n      string = toString(string);\n\n      var strLength = string.length;\n      if (hasUnicode(string)) {\n        var strSymbols = stringToArray(string);\n        strLength = strSymbols.length;\n      }\n      if (length >= strLength) {\n        return string;\n      }\n      var end = length - stringSize(omission);\n      if (end < 1) {\n        return omission;\n      }\n      var result = strSymbols\n        ? castSlice(strSymbols, 0, end).join('')\n        : string.slice(0, end);\n\n      if (separator === undefined) {\n        return result + omission;\n      }\n      if (strSymbols) {\n        end += (result.length - end);\n      }\n      if (isRegExp(separator)) {\n        if (string.slice(end).search(separator)) {\n          var match,\n              substring = result;\n\n          if (!separator.global) {\n            separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');\n          }\n          separator.lastIndex = 0;\n          while ((match = separator.exec(substring))) {\n            var newEnd = match.index;\n          }\n          result = result.slice(0, newEnd === undefined ? end : newEnd);\n        }\n      } else if (string.indexOf(baseToString(separator), end) != end) {\n        var index = result.lastIndexOf(separator);\n        if (index > -1) {\n          result = result.slice(0, index);\n        }\n      }\n      return result + omission;\n    }\n\n    /**\n     * The inverse of `_.escape`; this method converts the HTML entities\n     * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` in `string` to\n     * their corresponding characters.\n     *\n     * **Note:** No other HTML entities are unescaped. To unescape additional\n     * HTML entities use a third-party library like [_he_](https://mths.be/he).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.6.0\n     * @category String\n     * @param {string} [string=''] The string to unescape.\n     * @returns {string} Returns the unescaped string.\n     * @example\n     *\n     * _.unescape('fred, barney, &amp; pebbles');\n     * // => 'fred, barney, & pebbles'\n     */\n    function unescape(string) {\n      string = toString(string);\n      return (string && reHasEscapedHtml.test(string))\n        ? string.replace(reEscapedHtml, unescapeHtmlChar)\n        : string;\n    }\n\n    /**\n     * Converts `string`, as space separated words, to upper case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the upper cased string.\n     * @example\n     *\n     * _.upperCase('--foo-bar');\n     * // => 'FOO BAR'\n     *\n     * _.upperCase('fooBar');\n     * // => 'FOO BAR'\n     *\n     * _.upperCase('__foo_bar__');\n     * // => 'FOO BAR'\n     */\n    var upperCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + word.toUpperCase();\n    });\n\n    /**\n     * Converts the first character of `string` to upper case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.upperFirst('fred');\n     * // => 'Fred'\n     *\n     * _.upperFirst('FRED');\n     * // => 'FRED'\n     */\n    var upperFirst = createCaseFirst('toUpperCase');\n\n    /**\n     * Splits `string` into an array of its words.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {RegExp|string} [pattern] The pattern to match words.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the words of `string`.\n     * @example\n     *\n     * _.words('fred, barney, & pebbles');\n     * // => ['fred', 'barney', 'pebbles']\n     *\n     * _.words('fred, barney, & pebbles', /[^, ]+/g);\n     * // => ['fred', 'barney', '&', 'pebbles']\n     */\n    function words(string, pattern, guard) {\n      string = toString(string);\n      pattern = guard ? undefined : pattern;\n\n      if (pattern === undefined) {\n        return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);\n      }\n      return string.match(pattern) || [];\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Attempts to invoke `func`, returning either the result or the caught error\n     * object. Any additional arguments are provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Function} func The function to attempt.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {*} Returns the `func` result or error object.\n     * @example\n     *\n     * // Avoid throwing errors for invalid selectors.\n     * var elements = _.attempt(function(selector) {\n     *   return document.querySelectorAll(selector);\n     * }, '>_>');\n     *\n     * if (_.isError(elements)) {\n     *   elements = [];\n     * }\n     */\n    var attempt = baseRest(function(func, args) {\n      try {\n        return apply(func, undefined, args);\n      } catch (e) {\n        return isError(e) ? e : new Error(e);\n      }\n    });\n\n    /**\n     * Binds methods of an object to the object itself, overwriting the existing\n     * method.\n     *\n     * **Note:** This method doesn't set the \"length\" property of bound functions.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {Object} object The object to bind and assign the bound methods to.\n     * @param {...(string|string[])} methodNames The object method names to bind.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var view = {\n     *   'label': 'docs',\n     *   'click': function() {\n     *     console.log('clicked ' + this.label);\n     *   }\n     * };\n     *\n     * _.bindAll(view, ['click']);\n     * jQuery(element).on('click', view.click);\n     * // => Logs 'clicked docs' when clicked.\n     */\n    var bindAll = flatRest(function(object, methodNames) {\n      arrayEach(methodNames, function(key) {\n        key = toKey(key);\n        baseAssignValue(object, key, bind(object[key], object));\n      });\n      return object;\n    });\n\n    /**\n     * Creates a function that iterates over `pairs` and invokes the corresponding\n     * function of the first predicate to return truthy. The predicate-function\n     * pairs are invoked with the `this` binding and arguments of the created\n     * function.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {Array} pairs The predicate-function pairs.\n     * @returns {Function} Returns the new composite function.\n     * @example\n     *\n     * var func = _.cond([\n     *   [_.matches({ 'a': 1 }),           _.constant('matches A')],\n     *   [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],\n     *   [_.stubTrue,                      _.constant('no match')]\n     * ]);\n     *\n     * func({ 'a': 1, 'b': 2 });\n     * // => 'matches A'\n     *\n     * func({ 'a': 0, 'b': 1 });\n     * // => 'matches B'\n     *\n     * func({ 'a': '1', 'b': '2' });\n     * // => 'no match'\n     */\n    function cond(pairs) {\n      var length = pairs == null ? 0 : pairs.length,\n          toIteratee = getIteratee();\n\n      pairs = !length ? [] : arrayMap(pairs, function(pair) {\n        if (typeof pair[1] != 'function') {\n          throw new TypeError(FUNC_ERROR_TEXT);\n        }\n        return [toIteratee(pair[0]), pair[1]];\n      });\n\n      return baseRest(function(args) {\n        var index = -1;\n        while (++index < length) {\n          var pair = pairs[index];\n          if (apply(pair[0], this, args)) {\n            return apply(pair[1], this, args);\n          }\n        }\n      });\n    }\n\n    /**\n     * Creates a function that invokes the predicate properties of `source` with\n     * the corresponding property values of a given object, returning `true` if\n     * all predicates return truthy, else `false`.\n     *\n     * **Note:** The created function is equivalent to `_.conformsTo` with\n     * `source` partially applied.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 2, 'b': 1 },\n     *   { 'a': 1, 'b': 2 }\n     * ];\n     *\n     * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));\n     * // => [{ 'a': 1, 'b': 2 }]\n     */\n    function conforms(source) {\n      return baseConforms(baseClone(source, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that returns `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Util\n     * @param {*} value The value to return from the new function.\n     * @returns {Function} Returns the new constant function.\n     * @example\n     *\n     * var objects = _.times(2, _.constant({ 'a': 1 }));\n     *\n     * console.log(objects);\n     * // => [{ 'a': 1 }, { 'a': 1 }]\n     *\n     * console.log(objects[0] === objects[1]);\n     * // => true\n     */\n    function constant(value) {\n      return function() {\n        return value;\n      };\n    }\n\n    /**\n     * Checks `value` to determine whether a default value should be returned in\n     * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,\n     * or `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.14.0\n     * @category Util\n     * @param {*} value The value to check.\n     * @param {*} defaultValue The default value.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * _.defaultTo(1, 10);\n     * // => 1\n     *\n     * _.defaultTo(undefined, 10);\n     * // => 10\n     */\n    function defaultTo(value, defaultValue) {\n      return (value == null || value !== value) ? defaultValue : value;\n    }\n\n    /**\n     * Creates a function that returns the result of invoking the given functions\n     * with the `this` binding of the created function, where each successive\n     * invocation is supplied the return value of the previous.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [funcs] The functions to invoke.\n     * @returns {Function} Returns the new composite function.\n     * @see _.flowRight\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var addSquare = _.flow([_.add, square]);\n     * addSquare(1, 2);\n     * // => 9\n     */\n    var flow = createFlow();\n\n    /**\n     * This method is like `_.flow` except that it creates a function that\n     * invokes the given functions from right to left.\n     *\n     * @static\n     * @since 3.0.0\n     * @memberOf _\n     * @category Util\n     * @param {...(Function|Function[])} [funcs] The functions to invoke.\n     * @returns {Function} Returns the new composite function.\n     * @see _.flow\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var addSquare = _.flowRight([square, _.add]);\n     * addSquare(1, 2);\n     * // => 9\n     */\n    var flowRight = createFlow(true);\n\n    /**\n     * This method returns the first argument it receives.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {*} value Any value.\n     * @returns {*} Returns `value`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     *\n     * console.log(_.identity(object) === object);\n     * // => true\n     */\n    function identity(value) {\n      return value;\n    }\n\n    /**\n     * Creates a function that invokes `func` with the arguments of the created\n     * function. If `func` is a property name, the created function returns the\n     * property value for a given element. If `func` is an array or object, the\n     * created function returns `true` for elements that contain the equivalent\n     * source properties, otherwise it returns `false`.\n     *\n     * @static\n     * @since 4.0.0\n     * @memberOf _\n     * @category Util\n     * @param {*} [func=_.identity] The value to convert to a callback.\n     * @returns {Function} Returns the callback.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': true },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));\n     * // => [{ 'user': 'barney', 'age': 36, 'active': true }]\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.filter(users, _.iteratee(['user', 'fred']));\n     * // => [{ 'user': 'fred', 'age': 40 }]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.map(users, _.iteratee('user'));\n     * // => ['barney', 'fred']\n     *\n     * // Create custom iteratee shorthands.\n     * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {\n     *   return !_.isRegExp(func) ? iteratee(func) : function(string) {\n     *     return func.test(string);\n     *   };\n     * });\n     *\n     * _.filter(['abc', 'def'], /ef/);\n     * // => ['def']\n     */\n    function iteratee(func) {\n      return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that performs a partial deep comparison between a given\n     * object and `source`, returning `true` if the given object has equivalent\n     * property values, else `false`.\n     *\n     * **Note:** The created function is equivalent to `_.isMatch` with `source`\n     * partially applied.\n     *\n     * Partial comparisons will match empty array and empty object `source`\n     * values against any array or object value, respectively. See `_.isEqual`\n     * for a list of supported value comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Object} source The object of property values to match.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 1, 'b': 2, 'c': 3 },\n     *   { 'a': 4, 'b': 5, 'c': 6 }\n     * ];\n     *\n     * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));\n     * // => [{ 'a': 4, 'b': 5, 'c': 6 }]\n     */\n    function matches(source) {\n      return baseMatches(baseClone(source, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that performs a partial deep comparison between the\n     * value at `path` of a given object to `srcValue`, returning `true` if the\n     * object value is equivalent, else `false`.\n     *\n     * **Note:** Partial comparisons will match empty array and empty object\n     * `srcValue` values against any array or object value, respectively. See\n     * `_.isEqual` for a list of supported value comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Util\n     * @param {Array|string} path The path of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 1, 'b': 2, 'c': 3 },\n     *   { 'a': 4, 'b': 5, 'c': 6 }\n     * ];\n     *\n     * _.find(objects, _.matchesProperty('a', 4));\n     * // => { 'a': 4, 'b': 5, 'c': 6 }\n     */\n    function matchesProperty(path, srcValue) {\n      return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that invokes the method at `path` of a given object.\n     * Any additional arguments are provided to the invoked method.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Util\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {Function} Returns the new invoker function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': { 'b': _.constant(2) } },\n     *   { 'a': { 'b': _.constant(1) } }\n     * ];\n     *\n     * _.map(objects, _.method('a.b'));\n     * // => [2, 1]\n     *\n     * _.map(objects, _.method(['a', 'b']));\n     * // => [2, 1]\n     */\n    var method = baseRest(function(path, args) {\n      return function(object) {\n        return baseInvoke(object, path, args);\n      };\n    });\n\n    /**\n     * The opposite of `_.method`; this method creates a function that invokes\n     * the method at a given path of `object`. Any additional arguments are\n     * provided to the invoked method.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Util\n     * @param {Object} object The object to query.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {Function} Returns the new invoker function.\n     * @example\n     *\n     * var array = _.times(3, _.constant),\n     *     object = { 'a': array, 'b': array, 'c': array };\n     *\n     * _.map(['a[2]', 'c[0]'], _.methodOf(object));\n     * // => [2, 0]\n     *\n     * _.map([['a', '2'], ['c', '0']], _.methodOf(object));\n     * // => [2, 0]\n     */\n    var methodOf = baseRest(function(object, args) {\n      return function(path) {\n        return baseInvoke(object, path, args);\n      };\n    });\n\n    /**\n     * Adds all own enumerable string keyed function properties of a source\n     * object to the destination object. If `object` is a function, then methods\n     * are added to its prototype as well.\n     *\n     * **Note:** Use `_.runInContext` to create a pristine `lodash` function to\n     * avoid conflicts caused by modifying the original.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {Function|Object} [object=lodash] The destination object.\n     * @param {Object} source The object of functions to add.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.chain=true] Specify whether mixins are chainable.\n     * @returns {Function|Object} Returns `object`.\n     * @example\n     *\n     * function vowels(string) {\n     *   return _.filter(string, function(v) {\n     *     return /[aeiou]/i.test(v);\n     *   });\n     * }\n     *\n     * _.mixin({ 'vowels': vowels });\n     * _.vowels('fred');\n     * // => ['e']\n     *\n     * _('fred').vowels().value();\n     * // => ['e']\n     *\n     * _.mixin({ 'vowels': vowels }, { 'chain': false });\n     * _('fred').vowels();\n     * // => ['e']\n     */\n    function mixin(object, source, options) {\n      var props = keys(source),\n          methodNames = baseFunctions(source, props);\n\n      if (options == null &&\n          !(isObject(source) && (methodNames.length || !props.length))) {\n        options = source;\n        source = object;\n        object = this;\n        methodNames = baseFunctions(source, keys(source));\n      }\n      var chain = !(isObject(options) && 'chain' in options) || !!options.chain,\n          isFunc = isFunction(object);\n\n      arrayEach(methodNames, function(methodName) {\n        var func = source[methodName];\n        object[methodName] = func;\n        if (isFunc) {\n          object.prototype[methodName] = function() {\n            var chainAll = this.__chain__;\n            if (chain || chainAll) {\n              var result = object(this.__wrapped__),\n                  actions = result.__actions__ = copyArray(this.__actions__);\n\n              actions.push({ 'func': func, 'args': arguments, 'thisArg': object });\n              result.__chain__ = chainAll;\n              return result;\n            }\n            return func.apply(object, arrayPush([this.value()], arguments));\n          };\n        }\n      });\n\n      return object;\n    }\n\n    /**\n     * Reverts the `_` variable to its previous value and returns a reference to\n     * the `lodash` function.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @returns {Function} Returns the `lodash` function.\n     * @example\n     *\n     * var lodash = _.noConflict();\n     */\n    function noConflict() {\n      if (root._ === this) {\n        root._ = oldDash;\n      }\n      return this;\n    }\n\n    /**\n     * This method returns `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.3.0\n     * @category Util\n     * @example\n     *\n     * _.times(2, _.noop);\n     * // => [undefined, undefined]\n     */\n    function noop() {\n      // No operation performed.\n    }\n\n    /**\n     * Creates a function that gets the argument at index `n`. If `n` is negative,\n     * the nth argument from the end is returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {number} [n=0] The index of the argument to return.\n     * @returns {Function} Returns the new pass-thru function.\n     * @example\n     *\n     * var func = _.nthArg(1);\n     * func('a', 'b', 'c', 'd');\n     * // => 'b'\n     *\n     * var func = _.nthArg(-2);\n     * func('a', 'b', 'c', 'd');\n     * // => 'c'\n     */\n    function nthArg(n) {\n      n = toInteger(n);\n      return baseRest(function(args) {\n        return baseNth(args, n);\n      });\n    }\n\n    /**\n     * Creates a function that invokes `iteratees` with the arguments it receives\n     * and returns their results.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [iteratees=[_.identity]]\n     *  The iteratees to invoke.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.over([Math.max, Math.min]);\n     *\n     * func(1, 2, 3, 4);\n     * // => [4, 1]\n     */\n    var over = createOver(arrayMap);\n\n    /**\n     * Creates a function that checks if **all** of the `predicates` return\n     * truthy when invoked with the arguments it receives.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [predicates=[_.identity]]\n     *  The predicates to check.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.overEvery([Boolean, isFinite]);\n     *\n     * func('1');\n     * // => true\n     *\n     * func(null);\n     * // => false\n     *\n     * func(NaN);\n     * // => false\n     */\n    var overEvery = createOver(arrayEvery);\n\n    /**\n     * Creates a function that checks if **any** of the `predicates` return\n     * truthy when invoked with the arguments it receives.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [predicates=[_.identity]]\n     *  The predicates to check.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.overSome([Boolean, isFinite]);\n     *\n     * func('1');\n     * // => true\n     *\n     * func(null);\n     * // => true\n     *\n     * func(NaN);\n     * // => false\n     */\n    var overSome = createOver(arraySome);\n\n    /**\n     * Creates a function that returns the value at `path` of a given object.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Util\n     * @param {Array|string} path The path of the property to get.\n     * @returns {Function} Returns the new accessor function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': { 'b': 2 } },\n     *   { 'a': { 'b': 1 } }\n     * ];\n     *\n     * _.map(objects, _.property('a.b'));\n     * // => [2, 1]\n     *\n     * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n     * // => [1, 2]\n     */\n    function property(path) {\n      return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n    }\n\n    /**\n     * The opposite of `_.property`; this method creates a function that returns\n     * the value at a given path of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Object} object The object to query.\n     * @returns {Function} Returns the new accessor function.\n     * @example\n     *\n     * var array = [0, 1, 2],\n     *     object = { 'a': array, 'b': array, 'c': array };\n     *\n     * _.map(['a[2]', 'c[0]'], _.propertyOf(object));\n     * // => [2, 0]\n     *\n     * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));\n     * // => [2, 0]\n     */\n    function propertyOf(object) {\n      return function(path) {\n        return object == null ? undefined : baseGet(object, path);\n      };\n    }\n\n    /**\n     * Creates an array of numbers (positive and/or negative) progressing from\n     * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n     * `start` is specified without an `end` or `step`. If `end` is not specified,\n     * it's set to `start` with `start` then set to `0`.\n     *\n     * **Note:** JavaScript follows the IEEE-754 standard for resolving\n     * floating-point values which can produce unexpected results.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} [step=1] The value to increment or decrement by.\n     * @returns {Array} Returns the range of numbers.\n     * @see _.inRange, _.rangeRight\n     * @example\n     *\n     * _.range(4);\n     * // => [0, 1, 2, 3]\n     *\n     * _.range(-4);\n     * // => [0, -1, -2, -3]\n     *\n     * _.range(1, 5);\n     * // => [1, 2, 3, 4]\n     *\n     * _.range(0, 20, 5);\n     * // => [0, 5, 10, 15]\n     *\n     * _.range(0, -4, -1);\n     * // => [0, -1, -2, -3]\n     *\n     * _.range(1, 4, 0);\n     * // => [1, 1, 1]\n     *\n     * _.range(0);\n     * // => []\n     */\n    var range = createRange();\n\n    /**\n     * This method is like `_.range` except that it populates values in\n     * descending order.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} [step=1] The value to increment or decrement by.\n     * @returns {Array} Returns the range of numbers.\n     * @see _.inRange, _.range\n     * @example\n     *\n     * _.rangeRight(4);\n     * // => [3, 2, 1, 0]\n     *\n     * _.rangeRight(-4);\n     * // => [-3, -2, -1, 0]\n     *\n     * _.rangeRight(1, 5);\n     * // => [4, 3, 2, 1]\n     *\n     * _.rangeRight(0, 20, 5);\n     * // => [15, 10, 5, 0]\n     *\n     * _.rangeRight(0, -4, -1);\n     * // => [-3, -2, -1, 0]\n     *\n     * _.rangeRight(1, 4, 0);\n     * // => [1, 1, 1]\n     *\n     * _.rangeRight(0);\n     * // => []\n     */\n    var rangeRight = createRange(true);\n\n    /**\n     * This method returns a new empty array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {Array} Returns the new empty array.\n     * @example\n     *\n     * var arrays = _.times(2, _.stubArray);\n     *\n     * console.log(arrays);\n     * // => [[], []]\n     *\n     * console.log(arrays[0] === arrays[1]);\n     * // => false\n     */\n    function stubArray() {\n      return [];\n    }\n\n    /**\n     * This method returns `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {boolean} Returns `false`.\n     * @example\n     *\n     * _.times(2, _.stubFalse);\n     * // => [false, false]\n     */\n    function stubFalse() {\n      return false;\n    }\n\n    /**\n     * This method returns a new empty object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {Object} Returns the new empty object.\n     * @example\n     *\n     * var objects = _.times(2, _.stubObject);\n     *\n     * console.log(objects);\n     * // => [{}, {}]\n     *\n     * console.log(objects[0] === objects[1]);\n     * // => false\n     */\n    function stubObject() {\n      return {};\n    }\n\n    /**\n     * This method returns an empty string.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {string} Returns the empty string.\n     * @example\n     *\n     * _.times(2, _.stubString);\n     * // => ['', '']\n     */\n    function stubString() {\n      return '';\n    }\n\n    /**\n     * This method returns `true`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {boolean} Returns `true`.\n     * @example\n     *\n     * _.times(2, _.stubTrue);\n     * // => [true, true]\n     */\n    function stubTrue() {\n      return true;\n    }\n\n    /**\n     * Invokes the iteratee `n` times, returning an array of the results of\n     * each invocation. The iteratee is invoked with one argument; (index).\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {number} n The number of times to invoke `iteratee`.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the array of results.\n     * @example\n     *\n     * _.times(3, String);\n     * // => ['0', '1', '2']\n     *\n     *  _.times(4, _.constant(0));\n     * // => [0, 0, 0, 0]\n     */\n    function times(n, iteratee) {\n      n = toInteger(n);\n      if (n < 1 || n > MAX_SAFE_INTEGER) {\n        return [];\n      }\n      var index = MAX_ARRAY_LENGTH,\n          length = nativeMin(n, MAX_ARRAY_LENGTH);\n\n      iteratee = getIteratee(iteratee);\n      n -= MAX_ARRAY_LENGTH;\n\n      var result = baseTimes(length, iteratee);\n      while (++index < n) {\n        iteratee(index);\n      }\n      return result;\n    }\n\n    /**\n     * Converts `value` to a property path array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {*} value The value to convert.\n     * @returns {Array} Returns the new property path array.\n     * @example\n     *\n     * _.toPath('a.b.c');\n     * // => ['a', 'b', 'c']\n     *\n     * _.toPath('a[0].b.c');\n     * // => ['a', '0', 'b', 'c']\n     */\n    function toPath(value) {\n      if (isArray(value)) {\n        return arrayMap(value, toKey);\n      }\n      return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));\n    }\n\n    /**\n     * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {string} [prefix=''] The value to prefix the ID with.\n     * @returns {string} Returns the unique ID.\n     * @example\n     *\n     * _.uniqueId('contact_');\n     * // => 'contact_104'\n     *\n     * _.uniqueId();\n     * // => '105'\n     */\n    function uniqueId(prefix) {\n      var id = ++idCounter;\n      return toString(prefix) + id;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Adds two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.4.0\n     * @category Math\n     * @param {number} augend The first number in an addition.\n     * @param {number} addend The second number in an addition.\n     * @returns {number} Returns the total.\n     * @example\n     *\n     * _.add(6, 4);\n     * // => 10\n     */\n    var add = createMathOperation(function(augend, addend) {\n      return augend + addend;\n    }, 0);\n\n    /**\n     * Computes `number` rounded up to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round up.\n     * @param {number} [precision=0] The precision to round up to.\n     * @returns {number} Returns the rounded up number.\n     * @example\n     *\n     * _.ceil(4.006);\n     * // => 5\n     *\n     * _.ceil(6.004, 2);\n     * // => 6.01\n     *\n     * _.ceil(6040, -2);\n     * // => 6100\n     */\n    var ceil = createRound('ceil');\n\n    /**\n     * Divide two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {number} dividend The first number in a division.\n     * @param {number} divisor The second number in a division.\n     * @returns {number} Returns the quotient.\n     * @example\n     *\n     * _.divide(6, 4);\n     * // => 1.5\n     */\n    var divide = createMathOperation(function(dividend, divisor) {\n      return dividend / divisor;\n    }, 1);\n\n    /**\n     * Computes `number` rounded down to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round down.\n     * @param {number} [precision=0] The precision to round down to.\n     * @returns {number} Returns the rounded down number.\n     * @example\n     *\n     * _.floor(4.006);\n     * // => 4\n     *\n     * _.floor(0.046, 2);\n     * // => 0.04\n     *\n     * _.floor(4060, -2);\n     * // => 4000\n     */\n    var floor = createRound('floor');\n\n    /**\n     * Computes the maximum value of `array`. If `array` is empty or falsey,\n     * `undefined` is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {*} Returns the maximum value.\n     * @example\n     *\n     * _.max([4, 2, 8, 6]);\n     * // => 8\n     *\n     * _.max([]);\n     * // => undefined\n     */\n    function max(array) {\n      return (array && array.length)\n        ? baseExtremum(array, identity, baseGt)\n        : undefined;\n    }\n\n    /**\n     * This method is like `_.max` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * the value is ranked. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {*} Returns the maximum value.\n     * @example\n     *\n     * var objects = [{ 'n': 1 }, { 'n': 2 }];\n     *\n     * _.maxBy(objects, function(o) { return o.n; });\n     * // => { 'n': 2 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.maxBy(objects, 'n');\n     * // => { 'n': 2 }\n     */\n    function maxBy(array, iteratee) {\n      return (array && array.length)\n        ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)\n        : undefined;\n    }\n\n    /**\n     * Computes the mean of the values in `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {number} Returns the mean.\n     * @example\n     *\n     * _.mean([4, 2, 8, 6]);\n     * // => 5\n     */\n    function mean(array) {\n      return baseMean(array, identity);\n    }\n\n    /**\n     * This method is like `_.mean` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the value to be averaged.\n     * The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the mean.\n     * @example\n     *\n     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n     *\n     * _.meanBy(objects, function(o) { return o.n; });\n     * // => 5\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.meanBy(objects, 'n');\n     * // => 5\n     */\n    function meanBy(array, iteratee) {\n      return baseMean(array, getIteratee(iteratee, 2));\n    }\n\n    /**\n     * Computes the minimum value of `array`. If `array` is empty or falsey,\n     * `undefined` is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {*} Returns the minimum value.\n     * @example\n     *\n     * _.min([4, 2, 8, 6]);\n     * // => 2\n     *\n     * _.min([]);\n     * // => undefined\n     */\n    function min(array) {\n      return (array && array.length)\n        ? baseExtremum(array, identity, baseLt)\n        : undefined;\n    }\n\n    /**\n     * This method is like `_.min` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * the value is ranked. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {*} Returns the minimum value.\n     * @example\n     *\n     * var objects = [{ 'n': 1 }, { 'n': 2 }];\n     *\n     * _.minBy(objects, function(o) { return o.n; });\n     * // => { 'n': 1 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.minBy(objects, 'n');\n     * // => { 'n': 1 }\n     */\n    function minBy(array, iteratee) {\n      return (array && array.length)\n        ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)\n        : undefined;\n    }\n\n    /**\n     * Multiply two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {number} multiplier The first number in a multiplication.\n     * @param {number} multiplicand The second number in a multiplication.\n     * @returns {number} Returns the product.\n     * @example\n     *\n     * _.multiply(6, 4);\n     * // => 24\n     */\n    var multiply = createMathOperation(function(multiplier, multiplicand) {\n      return multiplier * multiplicand;\n    }, 1);\n\n    /**\n     * Computes `number` rounded to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round.\n     * @param {number} [precision=0] The precision to round to.\n     * @returns {number} Returns the rounded number.\n     * @example\n     *\n     * _.round(4.006);\n     * // => 4\n     *\n     * _.round(4.006, 2);\n     * // => 4.01\n     *\n     * _.round(4060, -2);\n     * // => 4100\n     */\n    var round = createRound('round');\n\n    /**\n     * Subtract two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {number} minuend The first number in a subtraction.\n     * @param {number} subtrahend The second number in a subtraction.\n     * @returns {number} Returns the difference.\n     * @example\n     *\n     * _.subtract(6, 4);\n     * // => 2\n     */\n    var subtract = createMathOperation(function(minuend, subtrahend) {\n      return minuend - subtrahend;\n    }, 0);\n\n    /**\n     * Computes the sum of the values in `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.4.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {number} Returns the sum.\n     * @example\n     *\n     * _.sum([4, 2, 8, 6]);\n     * // => 20\n     */\n    function sum(array) {\n      return (array && array.length)\n        ? baseSum(array, identity)\n        : 0;\n    }\n\n    /**\n     * This method is like `_.sum` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the value to be summed.\n     * The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the sum.\n     * @example\n     *\n     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n     *\n     * _.sumBy(objects, function(o) { return o.n; });\n     * // => 20\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sumBy(objects, 'n');\n     * // => 20\n     */\n    function sumBy(array, iteratee) {\n      return (array && array.length)\n        ? baseSum(array, getIteratee(iteratee, 2))\n        : 0;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    // Add methods that return wrapped values in chain sequences.\n    lodash.after = after;\n    lodash.ary = ary;\n    lodash.assign = assign;\n    lodash.assignIn = assignIn;\n    lodash.assignInWith = assignInWith;\n    lodash.assignWith = assignWith;\n    lodash.at = at;\n    lodash.before = before;\n    lodash.bind = bind;\n    lodash.bindAll = bindAll;\n    lodash.bindKey = bindKey;\n    lodash.castArray = castArray;\n    lodash.chain = chain;\n    lodash.chunk = chunk;\n    lodash.compact = compact;\n    lodash.concat = concat;\n    lodash.cond = cond;\n    lodash.conforms = conforms;\n    lodash.constant = constant;\n    lodash.countBy = countBy;\n    lodash.create = create;\n    lodash.curry = curry;\n    lodash.curryRight = curryRight;\n    lodash.debounce = debounce;\n    lodash.defaults = defaults;\n    lodash.defaultsDeep = defaultsDeep;\n    lodash.defer = defer;\n    lodash.delay = delay;\n    lodash.difference = difference;\n    lodash.differenceBy = differenceBy;\n    lodash.differenceWith = differenceWith;\n    lodash.drop = drop;\n    lodash.dropRight = dropRight;\n    lodash.dropRightWhile = dropRightWhile;\n    lodash.dropWhile = dropWhile;\n    lodash.fill = fill;\n    lodash.filter = filter;\n    lodash.flatMap = flatMap;\n    lodash.flatMapDeep = flatMapDeep;\n    lodash.flatMapDepth = flatMapDepth;\n    lodash.flatten = flatten;\n    lodash.flattenDeep = flattenDeep;\n    lodash.flattenDepth = flattenDepth;\n    lodash.flip = flip;\n    lodash.flow = flow;\n    lodash.flowRight = flowRight;\n    lodash.fromPairs = fromPairs;\n    lodash.functions = functions;\n    lodash.functionsIn = functionsIn;\n    lodash.groupBy = groupBy;\n    lodash.initial = initial;\n    lodash.intersection = intersection;\n    lodash.intersectionBy = intersectionBy;\n    lodash.intersectionWith = intersectionWith;\n    lodash.invert = invert;\n    lodash.invertBy = invertBy;\n    lodash.invokeMap = invokeMap;\n    lodash.iteratee = iteratee;\n    lodash.keyBy = keyBy;\n    lodash.keys = keys;\n    lodash.keysIn = keysIn;\n    lodash.map = map;\n    lodash.mapKeys = mapKeys;\n    lodash.mapValues = mapValues;\n    lodash.matches = matches;\n    lodash.matchesProperty = matchesProperty;\n    lodash.memoize = memoize;\n    lodash.merge = merge;\n    lodash.mergeWith = mergeWith;\n    lodash.method = method;\n    lodash.methodOf = methodOf;\n    lodash.mixin = mixin;\n    lodash.negate = negate;\n    lodash.nthArg = nthArg;\n    lodash.omit = omit;\n    lodash.omitBy = omitBy;\n    lodash.once = once;\n    lodash.orderBy = orderBy;\n    lodash.over = over;\n    lodash.overArgs = overArgs;\n    lodash.overEvery = overEvery;\n    lodash.overSome = overSome;\n    lodash.partial = partial;\n    lodash.partialRight = partialRight;\n    lodash.partition = partition;\n    lodash.pick = pick;\n    lodash.pickBy = pickBy;\n    lodash.property = property;\n    lodash.propertyOf = propertyOf;\n    lodash.pull = pull;\n    lodash.pullAll = pullAll;\n    lodash.pullAllBy = pullAllBy;\n    lodash.pullAllWith = pullAllWith;\n    lodash.pullAt = pullAt;\n    lodash.range = range;\n    lodash.rangeRight = rangeRight;\n    lodash.rearg = rearg;\n    lodash.reject = reject;\n    lodash.remove = remove;\n    lodash.rest = rest;\n    lodash.reverse = reverse;\n    lodash.sampleSize = sampleSize;\n    lodash.set = set;\n    lodash.setWith = setWith;\n    lodash.shuffle = shuffle;\n    lodash.slice = slice;\n    lodash.sortBy = sortBy;\n    lodash.sortedUniq = sortedUniq;\n    lodash.sortedUniqBy = sortedUniqBy;\n    lodash.split = split;\n    lodash.spread = spread;\n    lodash.tail = tail;\n    lodash.take = take;\n    lodash.takeRight = takeRight;\n    lodash.takeRightWhile = takeRightWhile;\n    lodash.takeWhile = takeWhile;\n    lodash.tap = tap;\n    lodash.throttle = throttle;\n    lodash.thru = thru;\n    lodash.toArray = toArray;\n    lodash.toPairs = toPairs;\n    lodash.toPairsIn = toPairsIn;\n    lodash.toPath = toPath;\n    lodash.toPlainObject = toPlainObject;\n    lodash.transform = transform;\n    lodash.unary = unary;\n    lodash.union = union;\n    lodash.unionBy = unionBy;\n    lodash.unionWith = unionWith;\n    lodash.uniq = uniq;\n    lodash.uniqBy = uniqBy;\n    lodash.uniqWith = uniqWith;\n    lodash.unset = unset;\n    lodash.unzip = unzip;\n    lodash.unzipWith = unzipWith;\n    lodash.update = update;\n    lodash.updateWith = updateWith;\n    lodash.values = values;\n    lodash.valuesIn = valuesIn;\n    lodash.without = without;\n    lodash.words = words;\n    lodash.wrap = wrap;\n    lodash.xor = xor;\n    lodash.xorBy = xorBy;\n    lodash.xorWith = xorWith;\n    lodash.zip = zip;\n    lodash.zipObject = zipObject;\n    lodash.zipObjectDeep = zipObjectDeep;\n    lodash.zipWith = zipWith;\n\n    // Add aliases.\n    lodash.entries = toPairs;\n    lodash.entriesIn = toPairsIn;\n    lodash.extend = assignIn;\n    lodash.extendWith = assignInWith;\n\n    // Add methods to `lodash.prototype`.\n    mixin(lodash, lodash);\n\n    /*------------------------------------------------------------------------*/\n\n    // Add methods that return unwrapped values in chain sequences.\n    lodash.add = add;\n    lodash.attempt = attempt;\n    lodash.camelCase = camelCase;\n    lodash.capitalize = capitalize;\n    lodash.ceil = ceil;\n    lodash.clamp = clamp;\n    lodash.clone = clone;\n    lodash.cloneDeep = cloneDeep;\n    lodash.cloneDeepWith = cloneDeepWith;\n    lodash.cloneWith = cloneWith;\n    lodash.conformsTo = conformsTo;\n    lodash.deburr = deburr;\n    lodash.defaultTo = defaultTo;\n    lodash.divide = divide;\n    lodash.endsWith = endsWith;\n    lodash.eq = eq;\n    lodash.escape = escape;\n    lodash.escapeRegExp = escapeRegExp;\n    lodash.every = every;\n    lodash.find = find;\n    lodash.findIndex = findIndex;\n    lodash.findKey = findKey;\n    lodash.findLast = findLast;\n    lodash.findLastIndex = findLastIndex;\n    lodash.findLastKey = findLastKey;\n    lodash.floor = floor;\n    lodash.forEach = forEach;\n    lodash.forEachRight = forEachRight;\n    lodash.forIn = forIn;\n    lodash.forInRight = forInRight;\n    lodash.forOwn = forOwn;\n    lodash.forOwnRight = forOwnRight;\n    lodash.get = get;\n    lodash.gt = gt;\n    lodash.gte = gte;\n    lodash.has = has;\n    lodash.hasIn = hasIn;\n    lodash.head = head;\n    lodash.identity = identity;\n    lodash.includes = includes;\n    lodash.indexOf = indexOf;\n    lodash.inRange = inRange;\n    lodash.invoke = invoke;\n    lodash.isArguments = isArguments;\n    lodash.isArray = isArray;\n    lodash.isArrayBuffer = isArrayBuffer;\n    lodash.isArrayLike = isArrayLike;\n    lodash.isArrayLikeObject = isArrayLikeObject;\n    lodash.isBoolean = isBoolean;\n    lodash.isBuffer = isBuffer;\n    lodash.isDate = isDate;\n    lodash.isElement = isElement;\n    lodash.isEmpty = isEmpty;\n    lodash.isEqual = isEqual;\n    lodash.isEqualWith = isEqualWith;\n    lodash.isError = isError;\n    lodash.isFinite = isFinite;\n    lodash.isFunction = isFunction;\n    lodash.isInteger = isInteger;\n    lodash.isLength = isLength;\n    lodash.isMap = isMap;\n    lodash.isMatch = isMatch;\n    lodash.isMatchWith = isMatchWith;\n    lodash.isNaN = isNaN;\n    lodash.isNative = isNative;\n    lodash.isNil = isNil;\n    lodash.isNull = isNull;\n    lodash.isNumber = isNumber;\n    lodash.isObject = isObject;\n    lodash.isObjectLike = isObjectLike;\n    lodash.isPlainObject = isPlainObject;\n    lodash.isRegExp = isRegExp;\n    lodash.isSafeInteger = isSafeInteger;\n    lodash.isSet = isSet;\n    lodash.isString = isString;\n    lodash.isSymbol = isSymbol;\n    lodash.isTypedArray = isTypedArray;\n    lodash.isUndefined = isUndefined;\n    lodash.isWeakMap = isWeakMap;\n    lodash.isWeakSet = isWeakSet;\n    lodash.join = join;\n    lodash.kebabCase = kebabCase;\n    lodash.last = last;\n    lodash.lastIndexOf = lastIndexOf;\n    lodash.lowerCase = lowerCase;\n    lodash.lowerFirst = lowerFirst;\n    lodash.lt = lt;\n    lodash.lte = lte;\n    lodash.max = max;\n    lodash.maxBy = maxBy;\n    lodash.mean = mean;\n    lodash.meanBy = meanBy;\n    lodash.min = min;\n    lodash.minBy = minBy;\n    lodash.stubArray = stubArray;\n    lodash.stubFalse = stubFalse;\n    lodash.stubObject = stubObject;\n    lodash.stubString = stubString;\n    lodash.stubTrue = stubTrue;\n    lodash.multiply = multiply;\n    lodash.nth = nth;\n    lodash.noConflict = noConflict;\n    lodash.noop = noop;\n    lodash.now = now;\n    lodash.pad = pad;\n    lodash.padEnd = padEnd;\n    lodash.padStart = padStart;\n    lodash.parseInt = parseInt;\n    lodash.random = random;\n    lodash.reduce = reduce;\n    lodash.reduceRight = reduceRight;\n    lodash.repeat = repeat;\n    lodash.replace = replace;\n    lodash.result = result;\n    lodash.round = round;\n    lodash.runInContext = runInContext;\n    lodash.sample = sample;\n    lodash.size = size;\n    lodash.snakeCase = snakeCase;\n    lodash.some = some;\n    lodash.sortedIndex = sortedIndex;\n    lodash.sortedIndexBy = sortedIndexBy;\n    lodash.sortedIndexOf = sortedIndexOf;\n    lodash.sortedLastIndex = sortedLastIndex;\n    lodash.sortedLastIndexBy = sortedLastIndexBy;\n    lodash.sortedLastIndexOf = sortedLastIndexOf;\n    lodash.startCase = startCase;\n    lodash.startsWith = startsWith;\n    lodash.subtract = subtract;\n    lodash.sum = sum;\n    lodash.sumBy = sumBy;\n    lodash.template = template;\n    lodash.times = times;\n    lodash.toFinite = toFinite;\n    lodash.toInteger = toInteger;\n    lodash.toLength = toLength;\n    lodash.toLower = toLower;\n    lodash.toNumber = toNumber;\n    lodash.toSafeInteger = toSafeInteger;\n    lodash.toString = toString;\n    lodash.toUpper = toUpper;\n    lodash.trim = trim;\n    lodash.trimEnd = trimEnd;\n    lodash.trimStart = trimStart;\n    lodash.truncate = truncate;\n    lodash.unescape = unescape;\n    lodash.uniqueId = uniqueId;\n    lodash.upperCase = upperCase;\n    lodash.upperFirst = upperFirst;\n\n    // Add aliases.\n    lodash.each = forEach;\n    lodash.eachRight = forEachRight;\n    lodash.first = head;\n\n    mixin(lodash, (function() {\n      var source = {};\n      baseForOwn(lodash, function(func, methodName) {\n        if (!hasOwnProperty.call(lodash.prototype, methodName)) {\n          source[methodName] = func;\n        }\n      });\n      return source;\n    }()), { 'chain': false });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * The semantic version number.\n     *\n     * @static\n     * @memberOf _\n     * @type {string}\n     */\n    lodash.VERSION = VERSION;\n\n    // Assign default placeholders.\n    arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {\n      lodash[methodName].placeholder = lodash;\n    });\n\n    // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.\n    arrayEach(['drop', 'take'], function(methodName, index) {\n      LazyWrapper.prototype[methodName] = function(n) {\n        n = n === undefined ? 1 : nativeMax(toInteger(n), 0);\n\n        var result = (this.__filtered__ && !index)\n          ? new LazyWrapper(this)\n          : this.clone();\n\n        if (result.__filtered__) {\n          result.__takeCount__ = nativeMin(n, result.__takeCount__);\n        } else {\n          result.__views__.push({\n            'size': nativeMin(n, MAX_ARRAY_LENGTH),\n            'type': methodName + (result.__dir__ < 0 ? 'Right' : '')\n          });\n        }\n        return result;\n      };\n\n      LazyWrapper.prototype[methodName + 'Right'] = function(n) {\n        return this.reverse()[methodName](n).reverse();\n      };\n    });\n\n    // Add `LazyWrapper` methods that accept an `iteratee` value.\n    arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {\n      var type = index + 1,\n          isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;\n\n      LazyWrapper.prototype[methodName] = function(iteratee) {\n        var result = this.clone();\n        result.__iteratees__.push({\n          'iteratee': getIteratee(iteratee, 3),\n          'type': type\n        });\n        result.__filtered__ = result.__filtered__ || isFilter;\n        return result;\n      };\n    });\n\n    // Add `LazyWrapper` methods for `_.head` and `_.last`.\n    arrayEach(['head', 'last'], function(methodName, index) {\n      var takeName = 'take' + (index ? 'Right' : '');\n\n      LazyWrapper.prototype[methodName] = function() {\n        return this[takeName](1).value()[0];\n      };\n    });\n\n    // Add `LazyWrapper` methods for `_.initial` and `_.tail`.\n    arrayEach(['initial', 'tail'], function(methodName, index) {\n      var dropName = 'drop' + (index ? '' : 'Right');\n\n      LazyWrapper.prototype[methodName] = function() {\n        return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);\n      };\n    });\n\n    LazyWrapper.prototype.compact = function() {\n      return this.filter(identity);\n    };\n\n    LazyWrapper.prototype.find = function(predicate) {\n      return this.filter(predicate).head();\n    };\n\n    LazyWrapper.prototype.findLast = function(predicate) {\n      return this.reverse().find(predicate);\n    };\n\n    LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {\n      if (typeof path == 'function') {\n        return new LazyWrapper(this);\n      }\n      return this.map(function(value) {\n        return baseInvoke(value, path, args);\n      });\n    });\n\n    LazyWrapper.prototype.reject = function(predicate) {\n      return this.filter(negate(getIteratee(predicate)));\n    };\n\n    LazyWrapper.prototype.slice = function(start, end) {\n      start = toInteger(start);\n\n      var result = this;\n      if (result.__filtered__ && (start > 0 || end < 0)) {\n        return new LazyWrapper(result);\n      }\n      if (start < 0) {\n        result = result.takeRight(-start);\n      } else if (start) {\n        result = result.drop(start);\n      }\n      if (end !== undefined) {\n        end = toInteger(end);\n        result = end < 0 ? result.dropRight(-end) : result.take(end - start);\n      }\n      return result;\n    };\n\n    LazyWrapper.prototype.takeRightWhile = function(predicate) {\n      return this.reverse().takeWhile(predicate).reverse();\n    };\n\n    LazyWrapper.prototype.toArray = function() {\n      return this.take(MAX_ARRAY_LENGTH);\n    };\n\n    // Add `LazyWrapper` methods to `lodash.prototype`.\n    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n      var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),\n          isTaker = /^(?:head|last)$/.test(methodName),\n          lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],\n          retUnwrapped = isTaker || /^find/.test(methodName);\n\n      if (!lodashFunc) {\n        return;\n      }\n      lodash.prototype[methodName] = function() {\n        var value = this.__wrapped__,\n            args = isTaker ? [1] : arguments,\n            isLazy = value instanceof LazyWrapper,\n            iteratee = args[0],\n            useLazy = isLazy || isArray(value);\n\n        var interceptor = function(value) {\n          var result = lodashFunc.apply(lodash, arrayPush([value], args));\n          return (isTaker && chainAll) ? result[0] : result;\n        };\n\n        if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {\n          // Avoid lazy use if the iteratee has a \"length\" value other than `1`.\n          isLazy = useLazy = false;\n        }\n        var chainAll = this.__chain__,\n            isHybrid = !!this.__actions__.length,\n            isUnwrapped = retUnwrapped && !chainAll,\n            onlyLazy = isLazy && !isHybrid;\n\n        if (!retUnwrapped && useLazy) {\n          value = onlyLazy ? value : new LazyWrapper(this);\n          var result = func.apply(value, args);\n          result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });\n          return new LodashWrapper(result, chainAll);\n        }\n        if (isUnwrapped && onlyLazy) {\n          return func.apply(this, args);\n        }\n        result = this.thru(interceptor);\n        return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;\n      };\n    });\n\n    // Add `Array` methods to `lodash.prototype`.\n    arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {\n      var func = arrayProto[methodName],\n          chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',\n          retUnwrapped = /^(?:pop|shift)$/.test(methodName);\n\n      lodash.prototype[methodName] = function() {\n        var args = arguments;\n        if (retUnwrapped && !this.__chain__) {\n          var value = this.value();\n          return func.apply(isArray(value) ? value : [], args);\n        }\n        return this[chainName](function(value) {\n          return func.apply(isArray(value) ? value : [], args);\n        });\n      };\n    });\n\n    // Map minified method names to their real names.\n    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n      var lodashFunc = lodash[methodName];\n      if (lodashFunc) {\n        var key = lodashFunc.name + '';\n        if (!hasOwnProperty.call(realNames, key)) {\n          realNames[key] = [];\n        }\n        realNames[key].push({ 'name': methodName, 'func': lodashFunc });\n      }\n    });\n\n    realNames[createHybrid(undefined, WRAP_BIND_KEY_FLAG).name] = [{\n      'name': 'wrapper',\n      'func': undefined\n    }];\n\n    // Add methods to `LazyWrapper`.\n    LazyWrapper.prototype.clone = lazyClone;\n    LazyWrapper.prototype.reverse = lazyReverse;\n    LazyWrapper.prototype.value = lazyValue;\n\n    // Add chain sequence methods to the `lodash` wrapper.\n    lodash.prototype.at = wrapperAt;\n    lodash.prototype.chain = wrapperChain;\n    lodash.prototype.commit = wrapperCommit;\n    lodash.prototype.next = wrapperNext;\n    lodash.prototype.plant = wrapperPlant;\n    lodash.prototype.reverse = wrapperReverse;\n    lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;\n\n    // Add lazy aliases.\n    lodash.prototype.first = lodash.prototype.head;\n\n    if (symIterator) {\n      lodash.prototype[symIterator] = wrapperToIterator;\n    }\n    return lodash;\n  });\n\n  /*--------------------------------------------------------------------------*/\n\n  // Export lodash.\n  var _ = runInContext();\n\n  // Some AMD build optimizers, like r.js, check for condition patterns like:\n  if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {\n    // Expose Lodash on the global object to prevent errors when Lodash is\n    // loaded by a script tag in the presence of an AMD loader.\n    // See http://requirejs.org/docs/errors.html#mismatch for more details.\n    // Use `_.noConflict` to remove Lodash from the global object.\n    root._ = _;\n\n    // Define as an anonymous module so, through path mapping, it can be\n    // referenced as the \"underscore\" module.\n    define(function() {\n      return _;\n    });\n  }\n  // Check for `exports` after `define` in case a build optimizer adds it.\n  else if (freeModule) {\n    // Export for Node.js.\n    (freeModule.exports = _)._ = _;\n    // Export for CommonJS support.\n    freeExports._ = _;\n  }\n  else {\n    // Export to the global object.\n    root._ = _;\n  }\n}.call(this));\n","/**\n * Mnemonist Binary Heap\n * ======================\n *\n * Binary heap implementation.\n */\nvar forEach = require('obliterator/foreach'),\n    comparators = require('./utils/comparators.js'),\n    iterables = require('./utils/iterables.js');\n\nvar DEFAULT_COMPARATOR = comparators.DEFAULT_COMPARATOR,\n    reverseComparator = comparators.reverseComparator;\n\n/**\n * Heap helper functions.\n */\n\n/**\n * Function used to sift down.\n *\n * @param {function} compare    - Comparison function.\n * @param {array}    heap       - Array storing the heap's data.\n * @param {number}   startIndex - Starting index.\n * @param {number}   i          - Index.\n */\nfunction siftDown(compare, heap, startIndex, i) {\n  var item = heap[i],\n      parentIndex,\n      parent;\n\n  while (i > startIndex) {\n    parentIndex = (i - 1) >> 1;\n    parent = heap[parentIndex];\n\n    if (compare(item, parent) < 0) {\n      heap[i] = parent;\n      i = parentIndex;\n      continue;\n    }\n\n    break;\n  }\n\n  heap[i] = item;\n}\n\n/**\n * Function used to sift up.\n *\n * @param {function} compare - Comparison function.\n * @param {array}    heap    - Array storing the heap's data.\n * @param {number}   i       - Index.\n */\nfunction siftUp(compare, heap, i) {\n  var endIndex = heap.length,\n      startIndex = i,\n      item = heap[i],\n      childIndex = 2 * i + 1,\n      rightIndex;\n\n  while (childIndex < endIndex) {\n    rightIndex = childIndex + 1;\n\n    if (\n      rightIndex < endIndex &&\n      compare(heap[childIndex], heap[rightIndex]) >= 0\n    ) {\n      childIndex = rightIndex;\n    }\n\n    heap[i] = heap[childIndex];\n    i = childIndex;\n    childIndex = 2 * i + 1;\n  }\n\n  heap[i] = item;\n  siftDown(compare, heap, startIndex, i);\n}\n\n/**\n * Function used to push an item into a heap represented by a raw array.\n *\n * @param {function} compare - Comparison function.\n * @param {array}    heap    - Array storing the heap's data.\n * @param {any}      item    - Item to push.\n */\nfunction push(compare, heap, item) {\n  heap.push(item);\n  siftDown(compare, heap, 0, heap.length - 1);\n}\n\n/**\n * Function used to pop an item from a heap represented by a raw array.\n *\n * @param  {function} compare - Comparison function.\n * @param  {array}    heap    - Array storing the heap's data.\n * @return {any}\n */\nfunction pop(compare, heap) {\n  var lastItem = heap.pop();\n\n  if (heap.length !== 0) {\n    var item = heap[0];\n    heap[0] = lastItem;\n    siftUp(compare, heap, 0);\n\n    return item;\n  }\n\n  return lastItem;\n}\n\n/**\n * Function used to pop the heap then push a new value into it, thus \"replacing\"\n * it.\n *\n * @param  {function} compare - Comparison function.\n * @param  {array}    heap    - Array storing the heap's data.\n * @param  {any}      item    - The item to push.\n * @return {any}\n */\nfunction replace(compare, heap, item) {\n  if (heap.length === 0)\n    throw new Error('mnemonist/heap.replace: cannot pop an empty heap.');\n\n  var popped = heap[0];\n  heap[0] = item;\n  siftUp(compare, heap, 0);\n\n  return popped;\n}\n\n/**\n * Function used to push an item in the heap then pop the heap and return the\n * popped value.\n *\n * @param  {function} compare - Comparison function.\n * @param  {array}    heap    - Array storing the heap's data.\n * @param  {any}      item    - The item to push.\n * @return {any}\n */\nfunction pushpop(compare, heap, item) {\n  var tmp;\n\n  if (heap.length !== 0 && compare(heap[0], item) < 0) {\n    tmp = heap[0];\n    heap[0] = item;\n    item = tmp;\n    siftUp(compare, heap, 0);\n  }\n\n  return item;\n}\n\n/**\n * Converts and array into an abstract heap in linear time.\n *\n * @param {function} compare - Comparison function.\n * @param {array}    array   - Target array.\n */\nfunction heapify(compare, array) {\n  var n = array.length,\n      l = n >> 1,\n      i = l;\n\n  while (--i >= 0)\n    siftUp(compare, array, i);\n}\n\n/**\n * Fully consumes the given heap.\n *\n * @param  {function} compare - Comparison function.\n * @param  {array}    heap    - Array storing the heap's data.\n * @return {array}\n */\nfunction consume(compare, heap) {\n  var l = heap.length,\n      i = 0;\n\n  var array = new Array(l);\n\n  while (i < l)\n    array[i++] = pop(compare, heap);\n\n  return array;\n}\n\n/**\n * Function used to retrieve the n smallest items from the given iterable.\n *\n * @param {function} compare  - Comparison function.\n * @param {number}   n        - Number of top items to retrieve.\n * @param {any}      iterable - Arbitrary iterable.\n * @param {array}\n */\nfunction nsmallest(compare, n, iterable) {\n  if (arguments.length === 2) {\n    iterable = n;\n    n = compare;\n    compare = DEFAULT_COMPARATOR;\n  }\n\n  var reverseCompare = reverseComparator(compare);\n\n  var i, l, v;\n\n  var min = Infinity;\n\n  var result;\n\n  // If n is equal to 1, it's just a matter of finding the minimum\n  if (n === 1) {\n    if (iterables.isArrayLike(iterable)) {\n      for (i = 0, l = iterable.length; i < l; i++) {\n        v = iterable[i];\n\n        if (min === Infinity || compare(v, min) < 0)\n          min = v;\n      }\n\n      result = new iterable.constructor(1);\n      result[0] = min;\n\n      return result;\n    }\n\n    forEach(iterable, function(value) {\n      if (min === Infinity || compare(value, min) < 0)\n        min = value;\n    });\n\n    return [min];\n  }\n\n  if (iterables.isArrayLike(iterable)) {\n\n    // If n > iterable length, we just clone and sort\n    if (n >= iterable.length)\n      return iterable.slice().sort(compare);\n\n    result = iterable.slice(0, n);\n    heapify(reverseCompare, result);\n\n    for (i = n, l = iterable.length; i < l; i++)\n      if (reverseCompare(iterable[i], result[0]) > 0)\n        replace(reverseCompare, result, iterable[i]);\n\n    // NOTE: if n is over some number, it becomes faster to consume the heap\n    return result.sort(compare);\n  }\n\n  // Correct for size\n  var size = iterables.guessLength(iterable);\n\n  if (size !== null && size < n)\n    n = size;\n\n  result = new Array(n);\n  i = 0;\n\n  forEach(iterable, function(value) {\n    if (i < n) {\n      result[i] = value;\n    }\n    else {\n      if (i === n)\n        heapify(reverseCompare, result);\n\n      if (reverseCompare(value, result[0]) > 0)\n        replace(reverseCompare, result, value);\n    }\n\n    i++;\n  });\n\n  if (result.length > i)\n    result.length = i;\n\n  // NOTE: if n is over some number, it becomes faster to consume the heap\n  return result.sort(compare);\n}\n\n/**\n * Function used to retrieve the n largest items from the given iterable.\n *\n * @param {function} compare  - Comparison function.\n * @param {number}   n        - Number of top items to retrieve.\n * @param {any}      iterable - Arbitrary iterable.\n * @param {array}\n */\nfunction nlargest(compare, n, iterable) {\n  if (arguments.length === 2) {\n    iterable = n;\n    n = compare;\n    compare = DEFAULT_COMPARATOR;\n  }\n\n  var reverseCompare = reverseComparator(compare);\n\n  var i, l, v;\n\n  var max = -Infinity;\n\n  var result;\n\n  // If n is equal to 1, it's just a matter of finding the maximum\n  if (n === 1) {\n    if (iterables.isArrayLike(iterable)) {\n      for (i = 0, l = iterable.length; i < l; i++) {\n        v = iterable[i];\n\n        if (max === -Infinity || compare(v, max) > 0)\n          max = v;\n      }\n\n      result = new iterable.constructor(1);\n      result[0] = max;\n\n      return result;\n    }\n\n    forEach(iterable, function(value) {\n      if (max === -Infinity || compare(value, max) > 0)\n        max = value;\n    });\n\n    return [max];\n  }\n\n  if (iterables.isArrayLike(iterable)) {\n\n    // If n > iterable length, we just clone and sort\n    if (n >= iterable.length)\n      return iterable.slice().sort(reverseCompare);\n\n    result = iterable.slice(0, n);\n    heapify(compare, result);\n\n    for (i = n, l = iterable.length; i < l; i++)\n      if (compare(iterable[i], result[0]) > 0)\n        replace(compare, result, iterable[i]);\n\n    // NOTE: if n is over some number, it becomes faster to consume the heap\n    return result.sort(reverseCompare);\n  }\n\n  // Correct for size\n  var size = iterables.guessLength(iterable);\n\n  if (size !== null && size < n)\n    n = size;\n\n  result = new Array(n);\n  i = 0;\n\n  forEach(iterable, function(value) {\n    if (i < n) {\n      result[i] = value;\n    }\n    else {\n      if (i === n)\n        heapify(compare, result);\n\n      if (compare(value, result[0]) > 0)\n        replace(compare, result, value);\n    }\n\n    i++;\n  });\n\n  if (result.length > i)\n    result.length = i;\n\n  // NOTE: if n is over some number, it becomes faster to consume the heap\n  return result.sort(reverseCompare);\n}\n\n/**\n * Binary Minimum Heap.\n *\n * @constructor\n * @param {function} comparator - Comparator function to use.\n */\nfunction Heap(comparator) {\n  this.clear();\n  this.comparator = comparator || DEFAULT_COMPARATOR;\n\n  if (typeof this.comparator !== 'function')\n    throw new Error('mnemonist/Heap.constructor: given comparator should be a function.');\n}\n\n/**\n * Method used to clear the heap.\n *\n * @return {undefined}\n */\nHeap.prototype.clear = function() {\n\n  // Properties\n  this.items = [];\n  this.size = 0;\n};\n\n/**\n * Method used to push an item into the heap.\n *\n * @param  {any}    item - Item to push.\n * @return {number}\n */\nHeap.prototype.push = function(item) {\n  push(this.comparator, this.items, item);\n  return ++this.size;\n};\n\n/**\n * Method used to retrieve the \"first\" item of the heap.\n *\n * @return {any}\n */\nHeap.prototype.peek = function() {\n  return this.items[0];\n};\n\n/**\n * Method used to retrieve & remove the \"first\" item of the heap.\n *\n * @return {any}\n */\nHeap.prototype.pop = function() {\n  if (this.size !== 0)\n    this.size--;\n\n  return pop(this.comparator, this.items);\n};\n\n/**\n * Method used to pop the heap, then push an item and return the popped\n * item.\n *\n * @param  {any} item - Item to push into the heap.\n * @return {any}\n */\nHeap.prototype.replace = function(item) {\n  return replace(this.comparator, this.items, item);\n};\n\n/**\n * Method used to push the heap, the pop it and return the pooped item.\n *\n * @param  {any} item - Item to push into the heap.\n * @return {any}\n */\nHeap.prototype.pushpop = function(item) {\n  return pushpop(this.comparator, this.items, item);\n};\n\n/**\n * Method used to consume the heap fully and return its items as a sorted array.\n *\n * @return {array}\n */\nHeap.prototype.consume = function() {\n  this.size = 0;\n  return consume(this.comparator, this.items);\n};\n\n/**\n * Method used to convert the heap to an array. Note that it basically clone\n * the heap and consumes it completely. This is hardly performant.\n *\n * @return {array}\n */\nHeap.prototype.toArray = function() {\n  return consume(this.comparator, this.items.slice());\n};\n\n/**\n * Convenience known methods.\n */\nHeap.prototype.inspect = function() {\n  var proxy = this.toArray();\n\n  // Trick so that node displays the name of the constructor\n  Object.defineProperty(proxy, 'constructor', {\n    value: Heap,\n    enumerable: false\n  });\n\n  return proxy;\n};\n\nif (typeof Symbol !== 'undefined')\n  Heap.prototype[Symbol.for('nodejs.util.inspect.custom')] = Heap.prototype.inspect;\n\n/**\n * Binary Maximum Heap.\n *\n * @constructor\n * @param {function} comparator - Comparator function to use.\n */\nfunction MaxHeap(comparator) {\n  this.clear();\n  this.comparator = comparator || DEFAULT_COMPARATOR;\n\n  if (typeof this.comparator !== 'function')\n    throw new Error('mnemonist/MaxHeap.constructor: given comparator should be a function.');\n\n  this.comparator = reverseComparator(this.comparator);\n}\n\nMaxHeap.prototype = Heap.prototype;\n\n/**\n * Static @.from function taking an arbitrary iterable & converting it into\n * a heap.\n *\n * @param  {Iterable} iterable   - Target iterable.\n * @param  {function} comparator - Custom comparator function.\n * @return {Heap}\n */\nHeap.from = function(iterable, comparator) {\n  var heap = new Heap(comparator);\n\n  var items;\n\n  // If iterable is an array, we can be clever about it\n  if (iterables.isArrayLike(iterable))\n    items = iterable.slice();\n  else\n    items = iterables.toArray(iterable);\n\n  heapify(heap.comparator, items);\n  heap.items = items;\n  heap.size = items.length;\n\n  return heap;\n};\n\nMaxHeap.from = function(iterable, comparator) {\n  var heap = new MaxHeap(comparator);\n\n  var items;\n\n  // If iterable is an array, we can be clever about it\n  if (iterables.isArrayLike(iterable))\n    items = iterable.slice();\n  else\n    items = iterables.toArray(iterable);\n\n  heapify(heap.comparator, items);\n  heap.items = items;\n  heap.size = items.length;\n\n  return heap;\n};\n\n/**\n * Exporting.\n */\nHeap.siftUp = siftUp;\nHeap.siftDown = siftDown;\nHeap.push = push;\nHeap.pop = pop;\nHeap.replace = replace;\nHeap.pushpop = pushpop;\nHeap.heapify = heapify;\nHeap.consume = consume;\n\nHeap.nsmallest = nsmallest;\nHeap.nlargest = nlargest;\n\nHeap.MinHeap = Heap;\nHeap.MaxHeap = MaxHeap;\n\nmodule.exports = Heap;\n","/**\n * Mnemonist Queue\n * ================\n *\n * Queue implementation based on the ideas of Queue.js that seems to beat\n * a LinkedList one in performance.\n */\nvar Iterator = require('obliterator/iterator'),\n    forEach = require('obliterator/foreach');\n\n/**\n * Queue\n *\n * @constructor\n */\nfunction Queue() {\n  this.clear();\n}\n\n/**\n * Method used to clear the queue.\n *\n * @return {undefined}\n */\nQueue.prototype.clear = function() {\n\n  // Properties\n  this.items = [];\n  this.offset = 0;\n  this.size = 0;\n};\n\n/**\n * Method used to add an item to the queue.\n *\n * @param  {any}    item - Item to enqueue.\n * @return {number}\n */\nQueue.prototype.enqueue = function(item) {\n\n  this.items.push(item);\n  return ++this.size;\n};\n\n/**\n * Method used to retrieve & remove the first item of the queue.\n *\n * @return {any}\n */\nQueue.prototype.dequeue = function() {\n  if (!this.size)\n    return;\n\n  var item = this.items[this.offset];\n\n  if (++this.offset * 2 >= this.items.length) {\n    this.items = this.items.slice(this.offset);\n    this.offset = 0;\n  }\n\n  this.size--;\n\n  return item;\n};\n\n/**\n * Method used to retrieve the first item of the queue.\n *\n * @return {any}\n */\nQueue.prototype.peek = function() {\n  if (!this.size)\n    return;\n\n  return this.items[this.offset];\n};\n\n/**\n * Method used to iterate over the queue.\n *\n * @param  {function}  callback - Function to call for each item.\n * @param  {object}    scope    - Optional scope.\n * @return {undefined}\n */\nQueue.prototype.forEach = function(callback, scope) {\n  scope = arguments.length > 1 ? scope : this;\n\n  for (var i = this.offset, j = 0, l = this.items.length; i < l; i++, j++)\n    callback.call(scope, this.items[i], j, this);\n};\n\n/*\n * Method used to convert the queue to a JavaScript array.\n *\n * @return {array}\n */\nQueue.prototype.toArray = function() {\n  return this.items.slice(this.offset);\n};\n\n/**\n * Method used to create an iterator over a queue's values.\n *\n * @return {Iterator}\n */\nQueue.prototype.values = function() {\n  var items = this.items,\n      i = this.offset;\n\n  return new Iterator(function() {\n    if (i >= items.length)\n      return {\n        done: true\n      };\n\n    var value = items[i];\n    i++;\n\n    return {\n      value: value,\n      done: false\n    };\n  });\n};\n\n/**\n * Method used to create an iterator over a queue's entries.\n *\n * @return {Iterator}\n */\nQueue.prototype.entries = function() {\n  var items = this.items,\n      i = this.offset,\n      j = 0;\n\n  return new Iterator(function() {\n    if (i >= items.length)\n      return {\n        done: true\n      };\n\n    var value = items[i];\n    i++;\n\n    return {\n      value: [j++, value],\n      done: false\n    };\n  });\n};\n\n/**\n * Attaching the #.values method to Symbol.iterator if possible.\n */\nif (typeof Symbol !== 'undefined')\n  Queue.prototype[Symbol.iterator] = Queue.prototype.values;\n\n/**\n * Convenience known methods.\n */\nQueue.prototype.toString = function() {\n  return this.toArray().join(',');\n};\n\nQueue.prototype.toJSON = function() {\n  return this.toArray();\n};\n\nQueue.prototype.inspect = function() {\n  var array = this.toArray();\n\n  // Trick so that node displays the name of the constructor\n  Object.defineProperty(array, 'constructor', {\n    value: Queue,\n    enumerable: false\n  });\n\n  return array;\n};\n\nif (typeof Symbol !== 'undefined')\n  Queue.prototype[Symbol.for('nodejs.util.inspect.custom')] = Queue.prototype.inspect;\n\n/**\n * Static @.from function taking an arbitrary iterable & converting it into\n * a queue.\n *\n * @param  {Iterable} iterable   - Target iterable.\n * @return {Queue}\n */\nQueue.from = function(iterable) {\n  var queue = new Queue();\n\n  forEach(iterable, function(value) {\n    queue.enqueue(value);\n  });\n\n  return queue;\n};\n\n/**\n * Static @.of function taking an arbitrary number of arguments & converting it\n * into a queue.\n *\n * @param  {...any} args\n * @return {Queue}\n */\nQueue.of = function() {\n  return Queue.from(arguments);\n};\n\n/**\n * Exporting.\n */\nmodule.exports = Queue;\n","/**\n * Mnemonist Heap Comparators\n * ===========================\n *\n * Default comparators & functions dealing with comparators reversing etc.\n */\nvar DEFAULT_COMPARATOR = function(a, b) {\n  if (a < b)\n    return -1;\n  if (a > b)\n    return 1;\n\n  return 0;\n};\n\nvar DEFAULT_REVERSE_COMPARATOR = function(a, b) {\n  if (a < b)\n    return 1;\n  if (a > b)\n    return -1;\n\n  return 0;\n};\n\n/**\n * Function used to reverse a comparator.\n */\nfunction reverseComparator(comparator) {\n  return function(a, b) {\n    return comparator(b, a);\n  };\n}\n\n/**\n * Function returning a tuple comparator.\n */\nfunction createTupleComparator(size) {\n  if (size === 2) {\n    return function(a, b) {\n      if (a[0] < b[0])\n        return -1;\n\n      if (a[0] > b[0])\n        return 1;\n\n      if (a[1] < b[1])\n        return -1;\n\n      if (a[1] > b[1])\n        return 1;\n\n      return 0;\n    };\n  }\n\n  return function(a, b) {\n    var i = 0;\n\n    while (i < size) {\n      if (a[i] < b[i])\n        return -1;\n\n      if (a[i] > b[i])\n        return 1;\n\n      i++;\n    }\n\n    return 0;\n  };\n}\n\n/**\n * Exporting.\n */\nexports.DEFAULT_COMPARATOR = DEFAULT_COMPARATOR;\nexports.DEFAULT_REVERSE_COMPARATOR = DEFAULT_REVERSE_COMPARATOR;\nexports.reverseComparator = reverseComparator;\nexports.createTupleComparator = createTupleComparator;\n","/**\n * Mnemonist Iterable Function\n * ============================\n *\n * Harmonized iteration helpers over mixed iterable targets.\n */\nvar forEach = require('obliterator/foreach');\n\nvar typed = require('./typed-arrays.js');\n\n/**\n * Function used to determine whether the given object supports array-like\n * random access.\n *\n * @param  {any} target - Target object.\n * @return {boolean}\n */\nfunction isArrayLike(target) {\n  return Array.isArray(target) || typed.isTypedArray(target);\n}\n\n/**\n * Function used to guess the length of the structure over which we are going\n * to iterate.\n *\n * @param  {any} target - Target object.\n * @return {number|undefined}\n */\nfunction guessLength(target) {\n  if (typeof target.length === 'number')\n    return target.length;\n\n  if (typeof target.size === 'number')\n    return target.size;\n\n  return;\n}\n\n/**\n * Function used to convert an iterable to an array.\n *\n * @param  {any}   target - Iteration target.\n * @return {array}\n */\nfunction toArray(target) {\n  var l = guessLength(target);\n\n  var array = typeof l === 'number' ? new Array(l) : [];\n\n  var i = 0;\n\n  // TODO: we could optimize when given target is array like\n  forEach(target, function(value) {\n    array[i++] = value;\n  });\n\n  return array;\n}\n\n/**\n * Same as above but returns a supplementary indices array.\n *\n * @param  {any}   target - Iteration target.\n * @return {array}\n */\nfunction toArrayWithIndices(target) {\n  var l = guessLength(target);\n\n  var IndexArray = typeof l === 'number' ?\n    typed.getPointerArray(l) :\n    Array;\n\n  var array = typeof l === 'number' ? new Array(l) : [];\n  var indices = typeof l === 'number' ? new IndexArray(l) : [];\n\n  var i = 0;\n\n  // TODO: we could optimize when given target is array like\n  forEach(target, function(value) {\n    array[i] = value;\n    indices[i] = i++;\n  });\n\n  return [array, indices];\n}\n\n/**\n * Exporting.\n */\nexports.isArrayLike = isArrayLike;\nexports.guessLength = guessLength;\nexports.toArray = toArray;\nexports.toArrayWithIndices = toArrayWithIndices;\n","/**\n * Mnemonist Typed Array Helpers\n * ==============================\n *\n * Miscellaneous helpers related to typed arrays.\n */\n\n/**\n * When using an unsigned integer array to store pointers, one might want to\n * choose the optimal word size in regards to the actual numbers of pointers\n * to store.\n *\n * This helpers does just that.\n *\n * @param  {number} size - Expected size of the array to map.\n * @return {TypedArray}\n */\nvar MAX_8BIT_INTEGER = Math.pow(2, 8) - 1,\n    MAX_16BIT_INTEGER = Math.pow(2, 16) - 1,\n    MAX_32BIT_INTEGER = Math.pow(2, 32) - 1;\n\nvar MAX_SIGNED_8BIT_INTEGER = Math.pow(2, 7) - 1,\n    MAX_SIGNED_16BIT_INTEGER = Math.pow(2, 15) - 1,\n    MAX_SIGNED_32BIT_INTEGER = Math.pow(2, 31) - 1;\n\nexports.getPointerArray = function(size) {\n  var maxIndex = size - 1;\n\n  if (maxIndex <= MAX_8BIT_INTEGER)\n    return Uint8Array;\n\n  if (maxIndex <= MAX_16BIT_INTEGER)\n    return Uint16Array;\n\n  if (maxIndex <= MAX_32BIT_INTEGER)\n    return Uint32Array;\n\n  throw new Error('mnemonist: Pointer Array of size > 4294967295 is not supported.');\n};\n\nexports.getSignedPointerArray = function(size) {\n  var maxIndex = size - 1;\n\n  if (maxIndex <= MAX_SIGNED_8BIT_INTEGER)\n    return Int8Array;\n\n  if (maxIndex <= MAX_SIGNED_16BIT_INTEGER)\n    return Int16Array;\n\n  if (maxIndex <= MAX_SIGNED_32BIT_INTEGER)\n    return Int32Array;\n\n  return Float64Array;\n};\n\n/**\n * Function returning the minimal type able to represent the given number.\n *\n * @param  {number} value - Value to test.\n * @return {TypedArrayClass}\n */\nexports.getNumberType = function(value) {\n\n  // <= 32 bits itnteger?\n  if (value === (value | 0)) {\n\n    // Negative\n    if (Math.sign(value) === -1) {\n      if (value <= 127 && value >= -128)\n        return Int8Array;\n\n      if (value <= 32767 && value >= -32768)\n        return Int16Array;\n\n      return Int32Array;\n    }\n    else {\n\n      if (value <= 255)\n        return Uint8Array;\n\n      if (value <= 65535)\n        return Uint16Array;\n\n      return Uint32Array;\n    }\n  }\n\n  // 53 bits integer & floats\n  // NOTE: it's kinda hard to tell whether we could use 32bits or not...\n  return Float64Array;\n};\n\n/**\n * Function returning the minimal type able to represent the given array\n * of JavaScript numbers.\n *\n * @param  {array}    array  - Array to represent.\n * @param  {function} getter - Optional getter.\n * @return {TypedArrayClass}\n */\nvar TYPE_PRIORITY = {\n  Uint8Array: 1,\n  Int8Array: 2,\n  Uint16Array: 3,\n  Int16Array: 4,\n  Uint32Array: 5,\n  Int32Array: 6,\n  Float32Array: 7,\n  Float64Array: 8\n};\n\n// TODO: make this a one-shot for one value\nexports.getMinimalRepresentation = function(array, getter) {\n  var maxType = null,\n      maxPriority = 0,\n      p,\n      t,\n      v,\n      i,\n      l;\n\n  for (i = 0, l = array.length; i < l; i++) {\n    v = getter ? getter(array[i]) : array[i];\n    t = exports.getNumberType(v);\n    p = TYPE_PRIORITY[t.name];\n\n    if (p > maxPriority) {\n      maxPriority = p;\n      maxType = t;\n    }\n  }\n\n  return maxType;\n};\n\n/**\n * Function returning whether the given value is a typed array.\n *\n * @param  {any} value - Value to test.\n * @return {boolean}\n */\nexports.isTypedArray = function(value) {\n  return typeof ArrayBuffer !== 'undefined' && ArrayBuffer.isView(value);\n};\n\n/**\n * Function used to concat byte arrays.\n *\n * @param  {...ByteArray}\n * @return {ByteArray}\n */\nexports.concat = function() {\n  var length = 0,\n      i,\n      o,\n      l;\n\n  for (i = 0, l = arguments.length; i < l; i++)\n    length += arguments[i].length;\n\n  var array = new (arguments[0].constructor)(length);\n\n  for (i = 0, o = 0; i < l; i++) {\n    array.set(arguments[i], o);\n    o += arguments[i].length;\n  }\n\n  return array;\n};\n\n/**\n * Function used to initialize a byte array of indices.\n *\n * @param  {number}    length - Length of target.\n * @return {ByteArray}\n */\nexports.indices = function(length) {\n  var PointerArray = exports.getPointerArray(length);\n\n  var array = new PointerArray(length);\n\n  for (var i = 0; i < length; i++)\n    array[i] = i;\n\n  return array;\n};\n","/**\n * Obliterator ForEach Function\n * =============================\n *\n * Helper function used to easily iterate over mixed values.\n */\nvar support = require('./support.js');\n\nvar ARRAY_BUFFER_SUPPORT = support.ARRAY_BUFFER_SUPPORT;\nvar SYMBOL_SUPPORT = support.SYMBOL_SUPPORT;\n\n/**\n * Function able to iterate over almost any iterable JS value.\n *\n * @param  {any}      iterable - Iterable value.\n * @param  {function} callback - Callback function.\n */\nmodule.exports = function forEach(iterable, callback) {\n  var iterator, k, i, l, s;\n\n  if (!iterable) throw new Error('obliterator/forEach: invalid iterable.');\n\n  if (typeof callback !== 'function')\n    throw new Error('obliterator/forEach: expecting a callback.');\n\n  // The target is an array or a string or function arguments\n  if (\n    Array.isArray(iterable) ||\n    (ARRAY_BUFFER_SUPPORT && ArrayBuffer.isView(iterable)) ||\n    typeof iterable === 'string' ||\n    iterable.toString() === '[object Arguments]'\n  ) {\n    for (i = 0, l = iterable.length; i < l; i++) callback(iterable[i], i);\n    return;\n  }\n\n  // The target has a #.forEach method\n  if (typeof iterable.forEach === 'function') {\n    iterable.forEach(callback);\n    return;\n  }\n\n  // The target is iterable\n  if (\n    SYMBOL_SUPPORT &&\n    Symbol.iterator in iterable &&\n    typeof iterable.next !== 'function'\n  ) {\n    iterable = iterable[Symbol.iterator]();\n  }\n\n  // The target is an iterator\n  if (typeof iterable.next === 'function') {\n    iterator = iterable;\n    i = 0;\n\n    while (((s = iterator.next()), s.done !== true)) {\n      callback(s.value, i);\n      i++;\n    }\n\n    return;\n  }\n\n  // The target is a plain object\n  for (k in iterable) {\n    if (iterable.hasOwnProperty(k)) {\n      callback(iterable[k], k);\n    }\n  }\n\n  return;\n};\n","/**\n * Obliterator Iterator Class\n * ===========================\n *\n * Simple class representing the library's iterators.\n */\n\n/**\n * Iterator class.\n *\n * @constructor\n * @param {function} next - Next function.\n */\nfunction Iterator(next) {\n  if (typeof next !== 'function')\n    throw new Error('obliterator/iterator: expecting a function!');\n\n  this.next = next;\n}\n\n/**\n * If symbols are supported, we add `next` to `Symbol.iterator`.\n */\nif (typeof Symbol !== 'undefined')\n  Iterator.prototype[Symbol.iterator] = function () {\n    return this;\n  };\n\n/**\n * Returning an iterator of the given values.\n *\n * @param  {any...} values - Values.\n * @return {Iterator}\n */\nIterator.of = function () {\n  var args = arguments,\n    l = args.length,\n    i = 0;\n\n  return new Iterator(function () {\n    if (i >= l) return {done: true};\n\n    return {done: false, value: args[i++]};\n  });\n};\n\n/**\n * Returning an empty iterator.\n *\n * @return {Iterator}\n */\nIterator.empty = function () {\n  var iterator = new Iterator(function () {\n    return {done: true};\n  });\n\n  return iterator;\n};\n\n/**\n * Returning an iterator over the given indexed sequence.\n *\n * @param  {string|Array} sequence - Target sequence.\n * @return {Iterator}\n */\nIterator.fromSequence = function (sequence) {\n  var i = 0,\n    l = sequence.length;\n\n  return new Iterator(function () {\n    if (i >= l) return {done: true};\n\n    return {done: false, value: sequence[i++]};\n  });\n};\n\n/**\n * Returning whether the given value is an iterator.\n *\n * @param  {any} value - Value.\n * @return {boolean}\n */\nIterator.is = function (value) {\n  if (value instanceof Iterator) return true;\n\n  return (\n    typeof value === 'object' &&\n    value !== null &&\n    typeof value.next === 'function'\n  );\n};\n\n/**\n * Exporting.\n */\nmodule.exports = Iterator;\n","exports.ARRAY_BUFFER_SUPPORT = typeof ArrayBuffer !== 'undefined';\nexports.SYMBOL_SUPPORT = typeof Symbol !== 'undefined';\n","/**\n * Pandemonium Random\n * ===================\n *\n * Random function.\n */\n\n/**\n * Creating a function returning a random integer such as a <= N <= b.\n *\n * @param  {function} rng - RNG function returning uniform random.\n * @return {function}     - The created function.\n */\nfunction createRandom(rng) {\n  /**\n   * Random function.\n   *\n   * @param  {number} a - From.\n   * @param  {number} b - To.\n   * @return {number}\n   */\n  return function (a, b) {\n    return a + Math.floor(rng() * (b - a + 1));\n  };\n}\n\n/**\n * Default random using `Math.random`.\n */\nvar random = createRandom(Math.random);\n\n/**\n * Exporting.\n */\nrandom.createRandom = createRandom;\nmodule.exports = random;\n","/**\n * Pandemonium Shuffle In Place\n * =============================\n *\n * Shuffle function applying the Fisher-Yates algorithm to the provided array.\n */\nvar createRandom = require('./random.js').createRandom;\n\n/**\n * Creating a function returning the given array shuffled.\n *\n * @param  {function} rng - The RNG to use.\n * @return {function}     - The created function.\n */\nfunction createShuffleInPlace(rng) {\n  var customRandom = createRandom(rng);\n\n  /**\n   * Function returning the shuffled array.\n   *\n   * @param  {array}  sequence - Target sequence.\n   * @return {array}           - The shuffled sequence.\n   */\n  return function (sequence) {\n    var length = sequence.length,\n      lastIndex = length - 1;\n\n    var index = -1;\n\n    while (++index < length) {\n      var r = customRandom(index, lastIndex),\n        value = sequence[r];\n\n      sequence[r] = sequence[index];\n      sequence[index] = value;\n    }\n  };\n}\n\n/**\n * Default shuffle in place using `Math.random`.\n */\nvar shuffleInPlace = createShuffleInPlace(Math.random);\n\n/**\n * Exporting.\n */\nshuffleInPlace.createShuffleInPlace = createShuffleInPlace;\nmodule.exports = shuffleInPlace;\n","// Generated by CoffeeScript 1.12.2\n(function() {\n  var getNanoSeconds, hrtime, loadTime, moduleLoadTime, nodeLoadTime, upTime;\n\n  if ((typeof performance !== \"undefined\" && performance !== null) && performance.now) {\n    module.exports = function() {\n      return performance.now();\n    };\n  } else if ((typeof process !== \"undefined\" && process !== null) && process.hrtime) {\n    module.exports = function() {\n      return (getNanoSeconds() - nodeLoadTime) / 1e6;\n    };\n    hrtime = process.hrtime;\n    getNanoSeconds = function() {\n      var hr;\n      hr = hrtime();\n      return hr[0] * 1e9 + hr[1];\n    };\n    moduleLoadTime = getNanoSeconds();\n    upTime = process.uptime() * 1e9;\n    nodeLoadTime = moduleLoadTime - upTime;\n  } else if (Date.now) {\n    module.exports = function() {\n      return Date.now() - loadTime;\n    };\n    loadTime = Date.now();\n  } else {\n    module.exports = function() {\n      return new Date().getTime() - loadTime;\n    };\n    loadTime = new Date().getTime();\n  }\n\n}).call(this);\n\n//# sourceMappingURL=performance-now.js.map\n","var now = require('performance-now')\n  , root = typeof window === 'undefined' ? global : window\n  , vendors = ['moz', 'webkit']\n  , suffix = 'AnimationFrame'\n  , raf = root['request' + suffix]\n  , caf = root['cancel' + suffix] || root['cancelRequest' + suffix]\n\nfor(var i = 0; !raf && i < vendors.length; i++) {\n  raf = root[vendors[i] + 'Request' + suffix]\n  caf = root[vendors[i] + 'Cancel' + suffix]\n      || root[vendors[i] + 'CancelRequest' + suffix]\n}\n\n// Some versions of FF have rAF but not cAF\nif(!raf || !caf) {\n  var last = 0\n    , id = 0\n    , queue = []\n    , frameDuration = 1000 / 60\n\n  raf = function(callback) {\n    if(queue.length === 0) {\n      var _now = now()\n        , next = Math.max(0, frameDuration - (_now - last))\n      last = next + _now\n      setTimeout(function() {\n        var cp = queue.slice(0)\n        // Clear queue here to prevent\n        // callbacks from appending listeners\n        // to the current frame's queue\n        queue.length = 0\n        for(var i = 0; i < cp.length; i++) {\n          if(!cp[i].cancelled) {\n            try{\n              cp[i].callback(last)\n            } catch(e) {\n              setTimeout(function() { throw e }, 0)\n            }\n          }\n        }\n      }, Math.round(next))\n    }\n    queue.push({\n      handle: ++id,\n      callback: callback,\n      cancelled: false\n    })\n    return id\n  }\n\n  caf = function(handle) {\n    for(var i = 0; i < queue.length; i++) {\n      if(queue[i].handle === handle) {\n        queue[i].cancelled = true\n      }\n    }\n  }\n}\n\nmodule.exports = function(fn) {\n  // Wrap in a new function to prevent\n  // `cancel` potentially being assigned\n  // to the native rAF function\n  return raf.call(root, fn)\n}\nmodule.exports.cancel = function() {\n  caf.apply(root, arguments)\n}\nmodule.exports.polyfill = function(object) {\n  if (!object) {\n    object = root;\n  }\n  object.requestAnimationFrame = raf\n  object.cancelAnimationFrame = caf\n}\n","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        if (typeof b !== \"function\" && b !== null)\n            throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * Sigma.js Camera Class\n * ======================\n *\n * Class designed to store camera information & used to update it.\n * @module\n */\nvar animate_1 = require(\"../utils/animate\");\nvar easings_1 = __importDefault(require(\"../utils/easings\"));\nvar utils_1 = require(\"../utils\");\nvar types_1 = require(\"../types\");\n/**\n * Defaults.\n */\nvar DEFAULT_ZOOMING_RATIO = 1.5;\n/**\n * Camera class\n *\n * @constructor\n */\nvar Camera = /** @class */ (function (_super) {\n    __extends(Camera, _super);\n    function Camera() {\n        var _this = _super.call(this) || this;\n        _this.x = 0.5;\n        _this.y = 0.5;\n        _this.angle = 0;\n        _this.ratio = 1;\n        _this.minRatio = null;\n        _this.maxRatio = null;\n        _this.nextFrame = null;\n        _this.previousState = null;\n        _this.enabled = true;\n        // State\n        _this.previousState = _this.getState();\n        return _this;\n    }\n    /**\n     * Static method used to create a Camera object with a given state.\n     *\n     * @param state\n     * @return {Camera}\n     */\n    Camera.from = function (state) {\n        var camera = new Camera();\n        return camera.setState(state);\n    };\n    /**\n     * Method used to enable the camera.\n     *\n     * @return {Camera}\n     */\n    Camera.prototype.enable = function () {\n        this.enabled = true;\n        return this;\n    };\n    /**\n     * Method used to disable the camera.\n     *\n     * @return {Camera}\n     */\n    Camera.prototype.disable = function () {\n        this.enabled = false;\n        return this;\n    };\n    /**\n     * Method used to retrieve the camera's current state.\n     *\n     * @return {object}\n     */\n    Camera.prototype.getState = function () {\n        return {\n            x: this.x,\n            y: this.y,\n            angle: this.angle,\n            ratio: this.ratio,\n        };\n    };\n    /**\n     * Method used to check whether the camera has the given state.\n     *\n     * @return {object}\n     */\n    Camera.prototype.hasState = function (state) {\n        return this.x === state.x && this.y === state.y && this.ratio === state.ratio && this.angle === state.angle;\n    };\n    /**\n     * Method used to retrieve the camera's previous state.\n     *\n     * @return {object}\n     */\n    Camera.prototype.getPreviousState = function () {\n        var state = this.previousState;\n        if (!state)\n            return null;\n        return {\n            x: state.x,\n            y: state.y,\n            angle: state.angle,\n            ratio: state.ratio,\n        };\n    };\n    /**\n     * Method used to check minRatio and maxRatio values.\n     *\n     * @param ratio\n     * @return {number}\n     */\n    Camera.prototype.getBoundedRatio = function (ratio) {\n        var r = ratio;\n        if (typeof this.minRatio === \"number\")\n            r = Math.max(r, this.minRatio);\n        if (typeof this.maxRatio === \"number\")\n            r = Math.min(r, this.maxRatio);\n        return r;\n    };\n    /**\n     * Method used to check various things to return a legit state candidate.\n     *\n     * @param state\n     * @return {object}\n     */\n    Camera.prototype.validateState = function (state) {\n        var validatedState = {};\n        if (typeof state.x === \"number\")\n            validatedState.x = state.x;\n        if (typeof state.y === \"number\")\n            validatedState.y = state.y;\n        if (typeof state.angle === \"number\")\n            validatedState.angle = state.angle;\n        if (typeof state.ratio === \"number\")\n            validatedState.ratio = this.getBoundedRatio(state.ratio);\n        return validatedState;\n    };\n    /**\n     * Method used to check whether the camera is currently being animated.\n     *\n     * @return {boolean}\n     */\n    Camera.prototype.isAnimated = function () {\n        return !!this.nextFrame;\n    };\n    /**\n     * Method used to set the camera's state.\n     *\n     * @param  {object} state - New state.\n     * @return {Camera}\n     */\n    Camera.prototype.setState = function (state) {\n        if (!this.enabled)\n            return this;\n        // TODO: update by function\n        // Keeping track of last state\n        this.previousState = this.getState();\n        var validState = this.validateState(state);\n        if (typeof validState.x === \"number\")\n            this.x = validState.x;\n        if (typeof validState.y === \"number\")\n            this.y = validState.y;\n        if (typeof validState.angle === \"number\")\n            this.angle = validState.angle;\n        if (typeof validState.ratio === \"number\")\n            this.ratio = validState.ratio;\n        // Emitting\n        if (!this.hasState(this.previousState))\n            this.emit(\"updated\", this.getState());\n        return this;\n    };\n    /**\n     * Method used to update the camera's state using a function.\n     *\n     * @param  {function} updater - Updated function taking current state and\n     *                              returning next state.\n     * @return {Camera}\n     */\n    Camera.prototype.updateState = function (updater) {\n        this.setState(updater(this.getState()));\n        return this;\n    };\n    /**\n     * Method used to animate the camera.\n     *\n     * @param  {object}                    state      - State to reach eventually.\n     * @param  {object}                    opts       - Options:\n     * @param  {number}                      duration - Duration of the animation.\n     * @param  {string | number => number}   easing   - Easing function or name of an existing one\n     * @param  {function}                  callback   - Callback\n     */\n    Camera.prototype.animate = function (state, opts, callback) {\n        var _this = this;\n        if (!this.enabled)\n            return;\n        var options = Object.assign({}, animate_1.ANIMATE_DEFAULTS, opts);\n        var validState = this.validateState(state);\n        var easing = typeof options.easing === \"function\" ? options.easing : easings_1.default[options.easing];\n        // State\n        var start = Date.now(), initialState = this.getState();\n        // Function performing the animation\n        var fn = function () {\n            var t = (Date.now() - start) / options.duration;\n            // The animation is over:\n            if (t >= 1) {\n                _this.nextFrame = null;\n                _this.setState(validState);\n                if (_this.animationCallback) {\n                    _this.animationCallback.call(null);\n                    _this.animationCallback = undefined;\n                }\n                return;\n            }\n            var coefficient = easing(t);\n            var newState = {};\n            if (typeof validState.x === \"number\")\n                newState.x = initialState.x + (validState.x - initialState.x) * coefficient;\n            if (typeof validState.y === \"number\")\n                newState.y = initialState.y + (validState.y - initialState.y) * coefficient;\n            if (typeof validState.angle === \"number\")\n                newState.angle = initialState.angle + (validState.angle - initialState.angle) * coefficient;\n            if (typeof validState.ratio === \"number\")\n                newState.ratio = initialState.ratio + (validState.ratio - initialState.ratio) * coefficient;\n            _this.setState(newState);\n            _this.nextFrame = (0, utils_1.requestFrame)(fn);\n        };\n        if (this.nextFrame) {\n            (0, utils_1.cancelFrame)(this.nextFrame);\n            if (this.animationCallback)\n                this.animationCallback.call(null);\n            this.nextFrame = (0, utils_1.requestFrame)(fn);\n        }\n        else {\n            fn();\n        }\n        this.animationCallback = callback;\n    };\n    /**\n     * Method used to zoom the camera.\n     *\n     * @param  {number|object} factorOrOptions - Factor or options.\n     * @return {function}\n     */\n    Camera.prototype.animatedZoom = function (factorOrOptions) {\n        if (!factorOrOptions) {\n            this.animate({ ratio: this.ratio / DEFAULT_ZOOMING_RATIO });\n        }\n        else {\n            if (typeof factorOrOptions === \"number\")\n                return this.animate({ ratio: this.ratio / factorOrOptions });\n            else\n                this.animate({\n                    ratio: this.ratio / (factorOrOptions.factor || DEFAULT_ZOOMING_RATIO),\n                }, factorOrOptions);\n        }\n    };\n    /**\n     * Method used to unzoom the camera.\n     *\n     * @param  {number|object} factorOrOptions - Factor or options.\n     */\n    Camera.prototype.animatedUnzoom = function (factorOrOptions) {\n        if (!factorOrOptions) {\n            this.animate({ ratio: this.ratio * DEFAULT_ZOOMING_RATIO });\n        }\n        else {\n            if (typeof factorOrOptions === \"number\")\n                return this.animate({ ratio: this.ratio * factorOrOptions });\n            else\n                this.animate({\n                    ratio: this.ratio * (factorOrOptions.factor || DEFAULT_ZOOMING_RATIO),\n                }, factorOrOptions);\n        }\n    };\n    /**\n     * Method used to reset the camera.\n     *\n     * @param  {object} options - Options.\n     */\n    Camera.prototype.animatedReset = function (options) {\n        this.animate({\n            x: 0.5,\n            y: 0.5,\n            ratio: 1,\n            angle: 0,\n        }, options);\n    };\n    /**\n     * Returns a new Camera instance, with the same state as the current camera.\n     *\n     * @return {Camera}\n     */\n    Camera.prototype.copy = function () {\n        return Camera.from(this.getState());\n    };\n    return Camera;\n}(types_1.TypedEventEmitter));\nexports.default = Camera;\n","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        if (typeof b !== \"function\" && b !== null)\n            throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nvar __assign = (this && this.__assign) || function () {\n    __assign = Object.assign || function(t) {\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\n            s = arguments[i];\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))\n                t[p] = s[p];\n        }\n        return t;\n    };\n    return __assign.apply(this, arguments);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getWheelDelta = exports.getTouchCoords = exports.getTouchesArray = exports.getWheelCoords = exports.getMouseCoords = exports.getPosition = void 0;\n/**\n * Sigma.js Captor Class\n * ======================\n * @module\n */\nvar types_1 = require(\"../../types\");\n/**\n * Captor utils functions\n * ======================\n */\n/**\n * Extract the local X and Y coordinates from a mouse event or touch object. If\n * a DOM element is given, it uses this element's offset to compute the position\n * (this allows using events that are not bound to the container itself and\n * still have a proper position).\n *\n * @param  {event}       e - A mouse event or touch object.\n * @param  {HTMLElement} dom - A DOM element to compute offset relatively to.\n * @return {number}      The local Y value of the mouse.\n */\nfunction getPosition(e, dom) {\n    var bbox = dom.getBoundingClientRect();\n    return {\n        x: e.clientX - bbox.left,\n        y: e.clientY - bbox.top,\n    };\n}\nexports.getPosition = getPosition;\n/**\n * Convert mouse coords to sigma coords.\n *\n * @param  {event}       e   - A mouse event or touch object.\n * @param  {HTMLElement} dom - A DOM element to compute offset relatively to.\n * @return {object}\n */\nfunction getMouseCoords(e, dom) {\n    var res = __assign(__assign({}, getPosition(e, dom)), { sigmaDefaultPrevented: false, preventSigmaDefault: function () {\n            res.sigmaDefaultPrevented = true;\n        }, original: e });\n    return res;\n}\nexports.getMouseCoords = getMouseCoords;\n/**\n * Convert mouse wheel event coords to sigma coords.\n *\n * @param  {event}       e   - A wheel mouse event.\n * @param  {HTMLElement} dom - A DOM element to compute offset relatively to.\n * @return {object}\n */\nfunction getWheelCoords(e, dom) {\n    return __assign(__assign({}, getMouseCoords(e, dom)), { delta: getWheelDelta(e) });\n}\nexports.getWheelCoords = getWheelCoords;\nvar MAX_TOUCHES = 2;\nfunction getTouchesArray(touches) {\n    var arr = [];\n    for (var i = 0, l = Math.min(touches.length, MAX_TOUCHES); i < l; i++)\n        arr.push(touches[i]);\n    return arr;\n}\nexports.getTouchesArray = getTouchesArray;\n/**\n * Convert touch coords to sigma coords.\n *\n * @param  {event}       e   - A touch event.\n * @param  {HTMLElement} dom - A DOM element to compute offset relatively to.\n * @return {object}\n */\nfunction getTouchCoords(e, dom) {\n    return {\n        touches: getTouchesArray(e.touches).map(function (touch) { return getPosition(touch, dom); }),\n        original: e,\n    };\n}\nexports.getTouchCoords = getTouchCoords;\n/**\n * Extract the wheel delta from a mouse event or touch object.\n *\n * @param  {event}  e - A mouse event or touch object.\n * @return {number}     The wheel delta of the mouse.\n */\nfunction getWheelDelta(e) {\n    // TODO: check those ratios again to ensure a clean Chrome/Firefox compat\n    if (typeof e.deltaY !== \"undefined\")\n        return (e.deltaY * -3) / 360;\n    if (typeof e.detail !== \"undefined\")\n        return e.detail / -9;\n    throw new Error(\"Captor: could not extract delta from event.\");\n}\nexports.getWheelDelta = getWheelDelta;\n/**\n * Abstract class representing a captor like the user's mouse or touch controls.\n */\nvar Captor = /** @class */ (function (_super) {\n    __extends(Captor, _super);\n    function Captor(container, renderer) {\n        var _this = _super.call(this) || this;\n        // Properties\n        _this.container = container;\n        _this.renderer = renderer;\n        return _this;\n    }\n    return Captor;\n}(types_1.TypedEventEmitter));\nexports.default = Captor;\n","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        if (typeof b !== \"function\" && b !== null)\n            throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar captor_1 = __importStar(require(\"./captor\"));\n/**\n * Constants.\n */\nvar DRAG_TIMEOUT = 100;\nvar DRAGGED_EVENTS_TOLERANCE = 3;\nvar MOUSE_INERTIA_DURATION = 200;\nvar MOUSE_INERTIA_RATIO = 3;\nvar MOUSE_ZOOM_DURATION = 250;\nvar ZOOMING_RATIO = 1.7;\nvar DOUBLE_CLICK_TIMEOUT = 300;\nvar DOUBLE_CLICK_ZOOMING_RATIO = 2.2;\nvar DOUBLE_CLICK_ZOOMING_DURATION = 200;\n/**\n * Mouse captor class.\n *\n * @constructor\n */\nvar MouseCaptor = /** @class */ (function (_super) {\n    __extends(MouseCaptor, _super);\n    function MouseCaptor(container, renderer) {\n        var _this = _super.call(this, container, renderer) || this;\n        // State\n        _this.enabled = true;\n        _this.draggedEvents = 0;\n        _this.downStartTime = null;\n        _this.lastMouseX = null;\n        _this.lastMouseY = null;\n        _this.isMouseDown = false;\n        _this.isMoving = false;\n        _this.movingTimeout = null;\n        _this.startCameraState = null;\n        _this.clicks = 0;\n        _this.doubleClickTimeout = null;\n        _this.currentWheelDirection = 0;\n        // Binding methods\n        _this.handleClick = _this.handleClick.bind(_this);\n        _this.handleRightClick = _this.handleRightClick.bind(_this);\n        _this.handleDown = _this.handleDown.bind(_this);\n        _this.handleUp = _this.handleUp.bind(_this);\n        _this.handleMove = _this.handleMove.bind(_this);\n        _this.handleWheel = _this.handleWheel.bind(_this);\n        _this.handleOut = _this.handleOut.bind(_this);\n        // Binding events\n        container.addEventListener(\"click\", _this.handleClick, false);\n        container.addEventListener(\"contextmenu\", _this.handleRightClick, false);\n        container.addEventListener(\"mousedown\", _this.handleDown, false);\n        container.addEventListener(\"wheel\", _this.handleWheel, false);\n        container.addEventListener(\"mouseout\", _this.handleOut, false);\n        document.addEventListener(\"mousemove\", _this.handleMove, false);\n        document.addEventListener(\"mouseup\", _this.handleUp, false);\n        return _this;\n    }\n    MouseCaptor.prototype.kill = function () {\n        var container = this.container;\n        container.removeEventListener(\"click\", this.handleClick);\n        container.removeEventListener(\"contextmenu\", this.handleRightClick);\n        container.removeEventListener(\"mousedown\", this.handleDown);\n        container.removeEventListener(\"wheel\", this.handleWheel);\n        container.removeEventListener(\"mouseout\", this.handleOut);\n        document.removeEventListener(\"mousemove\", this.handleMove);\n        document.removeEventListener(\"mouseup\", this.handleUp);\n    };\n    MouseCaptor.prototype.handleClick = function (e) {\n        var _this = this;\n        if (!this.enabled)\n            return;\n        this.clicks++;\n        if (this.clicks === 2) {\n            this.clicks = 0;\n            if (typeof this.doubleClickTimeout === \"number\") {\n                clearTimeout(this.doubleClickTimeout);\n                this.doubleClickTimeout = null;\n            }\n            return this.handleDoubleClick(e);\n        }\n        setTimeout(function () {\n            _this.clicks = 0;\n            _this.doubleClickTimeout = null;\n        }, DOUBLE_CLICK_TIMEOUT);\n        // NOTE: this is here to prevent click events on drag\n        if (this.draggedEvents < DRAGGED_EVENTS_TOLERANCE)\n            this.emit(\"click\", (0, captor_1.getMouseCoords)(e, this.container));\n    };\n    MouseCaptor.prototype.handleRightClick = function (e) {\n        if (!this.enabled)\n            return;\n        this.emit(\"rightClick\", (0, captor_1.getMouseCoords)(e, this.container));\n    };\n    MouseCaptor.prototype.handleDoubleClick = function (e) {\n        if (!this.enabled)\n            return;\n        e.preventDefault();\n        e.stopPropagation();\n        var mouseCoords = (0, captor_1.getMouseCoords)(e, this.container);\n        this.emit(\"doubleClick\", mouseCoords);\n        if (mouseCoords.sigmaDefaultPrevented)\n            return;\n        // default behavior\n        var camera = this.renderer.getCamera();\n        var newRatio = camera.getBoundedRatio(camera.getState().ratio / DOUBLE_CLICK_ZOOMING_RATIO);\n        camera.animate(this.renderer.getViewportZoomedState((0, captor_1.getPosition)(e, this.container), newRatio), {\n            easing: \"quadraticInOut\",\n            duration: DOUBLE_CLICK_ZOOMING_DURATION,\n        });\n    };\n    MouseCaptor.prototype.handleDown = function (e) {\n        if (!this.enabled)\n            return;\n        // We only start dragging on left button\n        if (e.button === 0) {\n            this.startCameraState = this.renderer.getCamera().getState();\n            var _a = (0, captor_1.getPosition)(e, this.container), x = _a.x, y = _a.y;\n            this.lastMouseX = x;\n            this.lastMouseY = y;\n            this.draggedEvents = 0;\n            this.downStartTime = Date.now();\n            this.isMouseDown = true;\n        }\n        this.emit(\"mousedown\", (0, captor_1.getMouseCoords)(e, this.container));\n    };\n    MouseCaptor.prototype.handleUp = function (e) {\n        var _this = this;\n        if (!this.enabled || !this.isMouseDown)\n            return;\n        var camera = this.renderer.getCamera();\n        this.isMouseDown = false;\n        if (typeof this.movingTimeout === \"number\") {\n            clearTimeout(this.movingTimeout);\n            this.movingTimeout = null;\n        }\n        var _a = (0, captor_1.getPosition)(e, this.container), x = _a.x, y = _a.y;\n        var cameraState = camera.getState(), previousCameraState = camera.getPreviousState() || { x: 0, y: 0 };\n        if (this.isMoving) {\n            camera.animate({\n                x: cameraState.x + MOUSE_INERTIA_RATIO * (cameraState.x - previousCameraState.x),\n                y: cameraState.y + MOUSE_INERTIA_RATIO * (cameraState.y - previousCameraState.y),\n            }, {\n                duration: MOUSE_INERTIA_DURATION,\n                easing: \"quadraticOut\",\n            });\n        }\n        else if (this.lastMouseX !== x || this.lastMouseY !== y) {\n            camera.setState({\n                x: cameraState.x,\n                y: cameraState.y,\n            });\n        }\n        this.isMoving = false;\n        setTimeout(function () {\n            _this.draggedEvents = 0;\n            // NOTE: this refresh is here to make sure `hideEdgesOnMove` can work\n            // when someone releases camera pan drag after having stopped moving.\n            // See commit: https://github.com/jacomyal/sigma.js/commit/cfd9197f70319109db6b675dd7c82be493ca95a2\n            // See also issue: https://github.com/jacomyal/sigma.js/issues/1290\n            // It could be possible to render instead of scheduling a refresh but for\n            // now it seems good enough.\n            _this.renderer.refresh();\n        }, 0);\n        this.emit(\"mouseup\", (0, captor_1.getMouseCoords)(e, this.container));\n    };\n    MouseCaptor.prototype.handleMove = function (e) {\n        var _this = this;\n        if (!this.enabled)\n            return;\n        var mouseCoords = (0, captor_1.getMouseCoords)(e, this.container);\n        // Always trigger a \"mousemovebody\" event, so that it is possible to develop\n        // a drag-and-drop effect that works even when the mouse is out of the\n        // container:\n        this.emit(\"mousemovebody\", mouseCoords);\n        // Only trigger the \"mousemove\" event when the mouse is actually hovering\n        // the container, to avoid weirdly hovering nodes and/or edges when the\n        // mouse is not hover the container:\n        if (e.target === this.container) {\n            this.emit(\"mousemove\", mouseCoords);\n        }\n        if (mouseCoords.sigmaDefaultPrevented)\n            return;\n        // Handle the case when \"isMouseDown\" all the time, to allow dragging the\n        // stage while the mouse is not hover the container:\n        if (this.isMouseDown) {\n            this.isMoving = true;\n            this.draggedEvents++;\n            if (typeof this.movingTimeout === \"number\") {\n                clearTimeout(this.movingTimeout);\n            }\n            this.movingTimeout = window.setTimeout(function () {\n                _this.movingTimeout = null;\n                _this.isMoving = false;\n            }, DRAG_TIMEOUT);\n            var camera = this.renderer.getCamera();\n            var _a = (0, captor_1.getPosition)(e, this.container), eX = _a.x, eY = _a.y;\n            var lastMouse = this.renderer.viewportToFramedGraph({\n                x: this.lastMouseX,\n                y: this.lastMouseY,\n            });\n            var mouse = this.renderer.viewportToFramedGraph({ x: eX, y: eY });\n            var offsetX = lastMouse.x - mouse.x, offsetY = lastMouse.y - mouse.y;\n            var cameraState = camera.getState();\n            var x = cameraState.x + offsetX, y = cameraState.y + offsetY;\n            camera.setState({ x: x, y: y });\n            this.lastMouseX = eX;\n            this.lastMouseY = eY;\n            e.preventDefault();\n            e.stopPropagation();\n        }\n    };\n    MouseCaptor.prototype.handleWheel = function (e) {\n        var _this = this;\n        if (!this.enabled)\n            return;\n        e.preventDefault();\n        e.stopPropagation();\n        var delta = (0, captor_1.getWheelDelta)(e);\n        if (!delta)\n            return;\n        var wheelCoords = (0, captor_1.getWheelCoords)(e, this.container);\n        this.emit(\"wheel\", wheelCoords);\n        if (wheelCoords.sigmaDefaultPrevented)\n            return;\n        // Default behavior\n        var ratioDiff = delta > 0 ? 1 / ZOOMING_RATIO : ZOOMING_RATIO;\n        var camera = this.renderer.getCamera();\n        var newRatio = camera.getBoundedRatio(camera.getState().ratio * ratioDiff);\n        var wheelDirection = delta > 0 ? 1 : -1;\n        var now = Date.now();\n        // Cancel events that are too close too each other and in the same direction:\n        if (this.currentWheelDirection === wheelDirection &&\n            this.lastWheelTriggerTime &&\n            now - this.lastWheelTriggerTime < MOUSE_ZOOM_DURATION / 5) {\n            return;\n        }\n        camera.animate(this.renderer.getViewportZoomedState((0, captor_1.getPosition)(e, this.container), newRatio), {\n            easing: \"quadraticOut\",\n            duration: MOUSE_ZOOM_DURATION,\n        }, function () {\n            _this.currentWheelDirection = 0;\n        });\n        this.currentWheelDirection = wheelDirection;\n        this.lastWheelTriggerTime = now;\n    };\n    MouseCaptor.prototype.handleOut = function () {\n        // TODO: dispatch event\n    };\n    return MouseCaptor;\n}(captor_1.default));\nexports.default = MouseCaptor;\n","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        if (typeof b !== \"function\" && b !== null)\n            throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nvar __read = (this && this.__read) || function (o, n) {\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n    if (!m) return o;\n    var i = m.call(o), r, ar = [], e;\n    try {\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n    }\n    catch (error) { e = { error: error }; }\n    finally {\n        try {\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\n        }\n        finally { if (e) throw e.error; }\n    }\n    return ar;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar captor_1 = __importStar(require(\"./captor\"));\nvar DRAG_TIMEOUT = 200;\nvar TOUCH_INERTIA_RATIO = 3;\nvar TOUCH_INERTIA_DURATION = 200;\n/**\n * Touch captor class.\n *\n * @constructor\n */\nvar TouchCaptor = /** @class */ (function (_super) {\n    __extends(TouchCaptor, _super);\n    function TouchCaptor(container, renderer) {\n        var _this = _super.call(this, container, renderer) || this;\n        _this.enabled = true;\n        _this.isMoving = false;\n        _this.hasMoved = false;\n        _this.touchMode = 0; // number of touches down\n        _this.startTouchesPositions = [];\n        // Binding methods:\n        _this.handleStart = _this.handleStart.bind(_this);\n        _this.handleLeave = _this.handleLeave.bind(_this);\n        _this.handleMove = _this.handleMove.bind(_this);\n        // Binding events\n        container.addEventListener(\"touchstart\", _this.handleStart, false);\n        container.addEventListener(\"touchend\", _this.handleLeave, false);\n        container.addEventListener(\"touchcancel\", _this.handleLeave, false);\n        container.addEventListener(\"touchmove\", _this.handleMove, false);\n        return _this;\n    }\n    TouchCaptor.prototype.kill = function () {\n        var container = this.container;\n        container.removeEventListener(\"touchstart\", this.handleStart);\n        container.removeEventListener(\"touchend\", this.handleLeave);\n        container.removeEventListener(\"touchcancel\", this.handleLeave);\n        container.removeEventListener(\"touchmove\", this.handleMove);\n    };\n    TouchCaptor.prototype.getDimensions = function () {\n        return {\n            width: this.container.offsetWidth,\n            height: this.container.offsetHeight,\n        };\n    };\n    TouchCaptor.prototype.dispatchRelatedMouseEvent = function (type, e, touch, emitter) {\n        var mousePosition = touch || e.touches[0];\n        var mouseEvent = new MouseEvent(type, {\n            clientX: mousePosition.clientX,\n            clientY: mousePosition.clientY,\n            altKey: e.altKey,\n            ctrlKey: e.ctrlKey,\n        });\n        mouseEvent.isFakeSigmaMouseEvent = true;\n        (emitter || this.container).dispatchEvent(mouseEvent);\n    };\n    TouchCaptor.prototype.handleStart = function (e) {\n        var _this = this;\n        if (!this.enabled)\n            return;\n        // Prevent default to avoid default browser behaviors...\n        e.preventDefault();\n        // ...but simulate mouse behavior anyway, to get the MouseCaptor working as well:\n        if (e.touches.length === 1)\n            this.dispatchRelatedMouseEvent(\"mousedown\", e);\n        var touches = (0, captor_1.getTouchesArray)(e.touches);\n        this.touchMode = touches.length;\n        this.startCameraState = this.renderer.getCamera().getState();\n        this.startTouchesPositions = touches.map(function (touch) { return (0, captor_1.getPosition)(touch, _this.container); });\n        this.lastTouches = touches;\n        this.lastTouchesPositions = this.startTouchesPositions;\n        // When there are two touches down, let's record distance and angle as well:\n        if (this.touchMode === 2) {\n            var _a = __read(this.startTouchesPositions, 2), _b = _a[0], x0 = _b.x, y0 = _b.y, _c = _a[1], x1 = _c.x, y1 = _c.y;\n            this.startTouchesAngle = Math.atan2(y1 - y0, x1 - x0);\n            this.startTouchesDistance = Math.sqrt(Math.pow(x1 - x0, 2) + Math.pow(y1 - y0, 2));\n        }\n        this.emit(\"touchdown\", (0, captor_1.getTouchCoords)(e, this.container));\n    };\n    TouchCaptor.prototype.handleLeave = function (e) {\n        if (!this.enabled)\n            return;\n        // Prevent default to avoid default browser behaviors...\n        e.preventDefault();\n        // ...but simulate mouse behavior anyway, to get the MouseCaptor working as well:\n        if (e.touches.length === 0 && this.lastTouches && this.lastTouches.length) {\n            this.dispatchRelatedMouseEvent(\"mouseup\", e, this.lastTouches[0], document);\n            // ... and only click if no move was made\n            if (!this.hasMoved) {\n                this.dispatchRelatedMouseEvent(\"click\", e, this.lastTouches[0]);\n            }\n        }\n        if (this.movingTimeout) {\n            this.isMoving = false;\n            clearTimeout(this.movingTimeout);\n        }\n        switch (this.touchMode) {\n            case 2:\n                if (e.touches.length === 1) {\n                    this.handleStart(e);\n                    e.preventDefault();\n                    break;\n                }\n            /* falls through */\n            case 1:\n                // TODO\n                // Dispatch event\n                if (this.isMoving) {\n                    var camera = this.renderer.getCamera();\n                    var cameraState = camera.getState(), previousCameraState = camera.getPreviousState() || { x: 0, y: 0 };\n                    camera.animate({\n                        x: cameraState.x + TOUCH_INERTIA_RATIO * (cameraState.x - previousCameraState.x),\n                        y: cameraState.y + TOUCH_INERTIA_RATIO * (cameraState.y - previousCameraState.y),\n                    }, {\n                        duration: TOUCH_INERTIA_DURATION,\n                        easing: \"quadraticOut\",\n                    });\n                }\n                this.hasMoved = false;\n                this.isMoving = false;\n                this.touchMode = 0;\n                break;\n        }\n        this.emit(\"touchup\", (0, captor_1.getTouchCoords)(e, this.container));\n    };\n    TouchCaptor.prototype.handleMove = function (e) {\n        var _a;\n        var _this = this;\n        if (!this.enabled)\n            return;\n        // Prevent default to avoid default browser behaviors...\n        e.preventDefault();\n        // ...but simulate mouse behavior anyway, to get the MouseCaptor working as well:\n        if (e.touches.length === 1)\n            this.dispatchRelatedMouseEvent(\"mousemove\", e);\n        var touches = (0, captor_1.getTouchesArray)(e.touches);\n        var touchesPositions = touches.map(function (touch) { return (0, captor_1.getPosition)(touch, _this.container); });\n        this.lastTouches = touches;\n        this.lastTouchesPositions = touchesPositions;\n        // If a move was initiated at some point and we get back to startpoint,\n        // we should still consider that we did move (which also happens after a\n        // multiple touch when only one touch remains in which case handleStart\n        // is recalled within handleLeave).\n        // Now, some mobile browsers report zero-distance moves so we also check that\n        // one of the touches did actually move from the origin position.\n        this.hasMoved || (this.hasMoved = touchesPositions.some(function (position, idx) {\n            var startPosition = _this.startTouchesPositions[idx];\n            return position.x !== startPosition.x || position.y !== startPosition.y;\n        }));\n        // If there was no move, do not trigger touch moves behavior\n        if (!this.hasMoved) {\n            return;\n        }\n        this.isMoving = true;\n        if (this.movingTimeout)\n            clearTimeout(this.movingTimeout);\n        this.movingTimeout = window.setTimeout(function () {\n            _this.isMoving = false;\n        }, DRAG_TIMEOUT);\n        var camera = this.renderer.getCamera();\n        var startCameraState = this.startCameraState;\n        switch (this.touchMode) {\n            case 1: {\n                var _b = this.renderer.viewportToFramedGraph((this.startTouchesPositions || [])[0]), xStart = _b.x, yStart = _b.y;\n                var _c = this.renderer.viewportToFramedGraph(touchesPositions[0]), x = _c.x, y = _c.y;\n                camera.setState({\n                    x: startCameraState.x + xStart - x,\n                    y: startCameraState.y + yStart - y,\n                });\n                break;\n            }\n            case 2: {\n                /**\n                 * Here is the thinking here:\n                 *\n                 * 1. We can find the new angle and ratio, by comparing the vector from \"touch one\" to \"touch two\" at the start\n                 *    of the d'n'd and now\n                 *\n                 * 2. We can use `Camera#viewportToGraph` inside formula to retrieve the new camera position, using the graph\n                 *    position of a touch at the beginning of the d'n'd (using `startCamera.viewportToGraph`) and the viewport\n                 *    position of this same touch now\n                 */\n                var newCameraState = {};\n                var _d = touchesPositions[0], x0 = _d.x, y0 = _d.y;\n                var _e = touchesPositions[1], x1 = _e.x, y1 = _e.y;\n                var angleDiff = Math.atan2(y1 - y0, x1 - x0) - this.startTouchesAngle;\n                var ratioDiff = Math.hypot(y1 - y0, x1 - x0) / this.startTouchesDistance;\n                // 1.\n                var newRatio = camera.getBoundedRatio(startCameraState.ratio / ratioDiff);\n                newCameraState.ratio = newRatio;\n                newCameraState.angle = startCameraState.angle + angleDiff;\n                // 2.\n                var dimensions = this.getDimensions();\n                var touchGraphPosition = this.renderer.viewportToFramedGraph((this.startTouchesPositions || [])[0], { cameraState: startCameraState });\n                var smallestDimension = Math.min(dimensions.width, dimensions.height);\n                var dx = smallestDimension / dimensions.width;\n                var dy = smallestDimension / dimensions.height;\n                var ratio = newRatio / smallestDimension;\n                // Align with center of the graph:\n                var x = x0 - smallestDimension / 2 / dx;\n                var y = y0 - smallestDimension / 2 / dy;\n                // Rotate:\n                _a = __read([\n                    x * Math.cos(-newCameraState.angle) - y * Math.sin(-newCameraState.angle),\n                    y * Math.cos(-newCameraState.angle) + x * Math.sin(-newCameraState.angle),\n                ], 2), x = _a[0], y = _a[1];\n                newCameraState.x = touchGraphPosition.x - x * ratio;\n                newCameraState.y = touchGraphPosition.y + y * ratio;\n                camera.setState(newCameraState);\n                break;\n            }\n        }\n        this.emit(\"touchmove\", (0, captor_1.getTouchCoords)(e, this.container));\n    };\n    return TouchCaptor;\n}(captor_1.default));\nexports.default = TouchCaptor;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.edgeLabelsToDisplayFromNodes = exports.LabelGrid = void 0;\n/**\n * Class representing a single candidate for the label grid selection.\n *\n * It also describes a deterministic way to compare two candidates to assess\n * which one is better.\n */\nvar LabelCandidate = /** @class */ (function () {\n    function LabelCandidate(key, size) {\n        this.key = key;\n        this.size = size;\n    }\n    LabelCandidate.compare = function (first, second) {\n        // First we compare by size\n        if (first.size > second.size)\n            return -1;\n        if (first.size < second.size)\n            return 1;\n        // Then since no two nodes can have the same key, we use it to\n        // deterministically tie-break by key\n        if (first.key > second.key)\n            return 1;\n        // NOTE: this comparator cannot return 0\n        return -1;\n    };\n    return LabelCandidate;\n}());\n/**\n * Class representing a 2D spatial grid divided into constant-size cells.\n */\nvar LabelGrid = /** @class */ (function () {\n    function LabelGrid() {\n        this.width = 0;\n        this.height = 0;\n        this.cellSize = 0;\n        this.columns = 0;\n        this.rows = 0;\n        this.cells = {};\n    }\n    LabelGrid.prototype.resizeAndClear = function (dimensions, cellSize) {\n        this.width = dimensions.width;\n        this.height = dimensions.height;\n        this.cellSize = cellSize;\n        this.columns = Math.ceil(dimensions.width / cellSize);\n        this.rows = Math.ceil(dimensions.height / cellSize);\n        this.cells = {};\n    };\n    LabelGrid.prototype.getIndex = function (pos) {\n        var xIndex = Math.floor(pos.x / this.cellSize);\n        var yIndex = Math.floor(pos.y / this.cellSize);\n        return yIndex * this.columns + xIndex;\n    };\n    LabelGrid.prototype.add = function (key, size, pos) {\n        var candidate = new LabelCandidate(key, size);\n        var index = this.getIndex(pos);\n        var cell = this.cells[index];\n        if (!cell) {\n            cell = [];\n            this.cells[index] = cell;\n        }\n        cell.push(candidate);\n    };\n    LabelGrid.prototype.organize = function () {\n        for (var k in this.cells) {\n            var cell = this.cells[k];\n            cell.sort(LabelCandidate.compare);\n        }\n    };\n    LabelGrid.prototype.getLabelsToDisplay = function (ratio, density) {\n        // TODO: work on visible nodes to optimize? ^ -> threshold outside so that memoization works?\n        // TODO: adjust threshold lower, but increase cells a bit?\n        // TODO: hunt for geom issue in disguise\n        // TODO: memoize while ratio does not move. method to force recompute\n        var cellArea = this.cellSize * this.cellSize;\n        var scaledCellArea = cellArea / ratio / ratio;\n        var scaledDensity = (scaledCellArea * density) / cellArea;\n        var labelsToDisplayPerCell = Math.ceil(scaledDensity);\n        var labels = [];\n        for (var k in this.cells) {\n            var cell = this.cells[k];\n            for (var i = 0; i < Math.min(labelsToDisplayPerCell, cell.length); i++) {\n                labels.push(cell[i].key);\n            }\n        }\n        return labels;\n    };\n    return LabelGrid;\n}());\nexports.LabelGrid = LabelGrid;\n/**\n * Label heuristic selecting edge labels to display, based on displayed node\n * labels\n *\n * @param  {object} params                 - Parameters:\n * @param  {Set}      displayedNodeLabels  - Currently displayed node labels.\n * @param  {Set}      highlightedNodes     - Highlighted nodes.\n * @param  {Graph}    graph                - The rendered graph.\n * @param  {string}   hoveredNode          - Hovered node (optional)\n * @return {Array}                         - The selected labels.\n */\nfunction edgeLabelsToDisplayFromNodes(params) {\n    var graph = params.graph, hoveredNode = params.hoveredNode, highlightedNodes = params.highlightedNodes, displayedNodeLabels = params.displayedNodeLabels;\n    var worthyEdges = [];\n    // TODO: the code below can be optimized using #.forEach and batching the code per adj\n    // We should display an edge's label if:\n    //   - Any of its extremities is highlighted or hovered\n    //   - Both of its extremities has its label shown\n    graph.forEachEdge(function (edge, _, source, target) {\n        if (source === hoveredNode ||\n            target === hoveredNode ||\n            highlightedNodes.has(source) ||\n            highlightedNodes.has(target) ||\n            (displayedNodeLabels.has(source) && displayedNodeLabels.has(target))) {\n            worthyEdges.push(edge);\n        }\n    });\n    return worthyEdges;\n}\nexports.edgeLabelsToDisplayFromNodes = edgeLabelsToDisplayFromNodes;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.rectangleCollidesWithQuad = exports.squareCollidesWithQuad = exports.getCircumscribedAlignedRectangle = exports.isRectangleAligned = void 0;\n/**\n * Sigma.js Quad Tree Class\n * =========================\n *\n * Class implementing the quad tree data structure used to solve hovers and\n * determine which elements are currently in the scope of the camera so that\n * we don't waste time rendering things the user cannot see anyway.\n * @module\n */\n/* eslint no-nested-ternary: 0 */\n/* eslint no-constant-condition: 0 */\nvar extend_1 = __importDefault(require(\"@yomguithereal/helpers/extend\"));\n/**\n * Notes:\n *\n *   - a square can be represented as topleft + width, saying for the quad blocks,\n *     to reduce overall memory usage (which is already pretty low).\n *   - this implementation of a quadtree is often called a MX-CIF quadtree.\n *   - we could explore spatial hashing (hilbert quadtrees, notably).\n */\n/**\n * Constants.\n *\n * Note that since we are representing a static 4-ary tree, the indices of the\n * quadrants are the following:\n *   - TOP_LEFT:     4i + b\n *   - TOP_RIGHT:    4i + 2b\n *   - BOTTOM_LEFT:  4i + 3b\n *   - BOTTOM_RIGHT: 4i + 4b\n */\nvar BLOCKS = 4;\nvar MAX_LEVEL = 5;\n// Outside block is max block index + 1, i.e.:\n// BLOCKS * ((4 * (4 ** MAX_LEVEL) - 1) / 3)\nvar OUTSIDE_BLOCK = 5460;\nvar X_OFFSET = 0;\nvar Y_OFFSET = 1;\nvar WIDTH_OFFSET = 2;\nvar HEIGHT_OFFSET = 3;\nvar TOP_LEFT = 1;\nvar TOP_RIGHT = 2;\nvar BOTTOM_LEFT = 3;\nvar BOTTOM_RIGHT = 4;\nvar hasWarnedTooMuchOutside = false;\n/**\n * Geometry helpers.\n */\n/**\n * Function returning whether the given rectangle is axis-aligned.\n *\n * @param  {Rectangle} rect\n * @return {boolean}\n */\nfunction isRectangleAligned(rect) {\n    return rect.x1 === rect.x2 || rect.y1 === rect.y2;\n}\nexports.isRectangleAligned = isRectangleAligned;\n/**\n * Function returning the smallest rectangle that contains the given rectangle, and that is aligned with the axis.\n *\n * @param {Rectangle} rect\n * @return {Rectangle}\n */\nfunction getCircumscribedAlignedRectangle(rect) {\n    var width = Math.sqrt(Math.pow(rect.x2 - rect.x1, 2) + Math.pow(rect.y2 - rect.y1, 2));\n    var heightVector = {\n        x: ((rect.y1 - rect.y2) * rect.height) / width,\n        y: ((rect.x2 - rect.x1) * rect.height) / width,\n    };\n    // Compute all corners:\n    var tl = { x: rect.x1, y: rect.y1 };\n    var tr = { x: rect.x2, y: rect.y2 };\n    var bl = {\n        x: rect.x1 + heightVector.x,\n        y: rect.y1 + heightVector.y,\n    };\n    var br = {\n        x: rect.x2 + heightVector.x,\n        y: rect.y2 + heightVector.y,\n    };\n    var xL = Math.min(tl.x, tr.x, bl.x, br.x);\n    var xR = Math.max(tl.x, tr.x, bl.x, br.x);\n    var yT = Math.min(tl.y, tr.y, bl.y, br.y);\n    var yB = Math.max(tl.y, tr.y, bl.y, br.y);\n    return {\n        x1: xL,\n        y1: yT,\n        x2: xR,\n        y2: yT,\n        height: yB - yT,\n    };\n}\nexports.getCircumscribedAlignedRectangle = getCircumscribedAlignedRectangle;\n/**\n *\n * @param x1\n * @param y1\n * @param w\n * @param qx\n * @param qy\n * @param qw\n * @param qh\n */\nfunction squareCollidesWithQuad(x1, y1, w, qx, qy, qw, qh) {\n    return x1 < qx + qw && x1 + w > qx && y1 < qy + qh && y1 + w > qy;\n}\nexports.squareCollidesWithQuad = squareCollidesWithQuad;\nfunction rectangleCollidesWithQuad(x1, y1, w, h, qx, qy, qw, qh) {\n    return x1 < qx + qw && x1 + w > qx && y1 < qy + qh && y1 + h > qy;\n}\nexports.rectangleCollidesWithQuad = rectangleCollidesWithQuad;\nfunction pointIsInQuad(x, y, qx, qy, qw, qh) {\n    var xmp = qx + qw / 2, ymp = qy + qh / 2, top = y < ymp, left = x < xmp;\n    return top ? (left ? TOP_LEFT : TOP_RIGHT) : left ? BOTTOM_LEFT : BOTTOM_RIGHT;\n}\n/**\n * Helper functions that are not bound to the class so an external user\n * cannot mess with them.\n */\nfunction buildQuadrants(maxLevel, data) {\n    // [block, level]\n    var stack = [0, 0];\n    while (stack.length) {\n        var level = stack.pop(), block = stack.pop();\n        var topLeftBlock = 4 * block + BLOCKS, topRightBlock = 4 * block + 2 * BLOCKS, bottomLeftBlock = 4 * block + 3 * BLOCKS, bottomRightBlock = 4 * block + 4 * BLOCKS;\n        var x = data[block + X_OFFSET], y = data[block + Y_OFFSET], width = data[block + WIDTH_OFFSET], height = data[block + HEIGHT_OFFSET], hw = width / 2, hh = height / 2;\n        data[topLeftBlock + X_OFFSET] = x;\n        data[topLeftBlock + Y_OFFSET] = y;\n        data[topLeftBlock + WIDTH_OFFSET] = hw;\n        data[topLeftBlock + HEIGHT_OFFSET] = hh;\n        data[topRightBlock + X_OFFSET] = x + hw;\n        data[topRightBlock + Y_OFFSET] = y;\n        data[topRightBlock + WIDTH_OFFSET] = hw;\n        data[topRightBlock + HEIGHT_OFFSET] = hh;\n        data[bottomLeftBlock + X_OFFSET] = x;\n        data[bottomLeftBlock + Y_OFFSET] = y + hh;\n        data[bottomLeftBlock + WIDTH_OFFSET] = hw;\n        data[bottomLeftBlock + HEIGHT_OFFSET] = hh;\n        data[bottomRightBlock + X_OFFSET] = x + hw;\n        data[bottomRightBlock + Y_OFFSET] = y + hh;\n        data[bottomRightBlock + WIDTH_OFFSET] = hw;\n        data[bottomRightBlock + HEIGHT_OFFSET] = hh;\n        if (level < maxLevel - 1) {\n            stack.push(bottomRightBlock, level + 1);\n            stack.push(bottomLeftBlock, level + 1);\n            stack.push(topRightBlock, level + 1);\n            stack.push(topLeftBlock, level + 1);\n        }\n    }\n}\nfunction insertNode(maxLevel, data, containers, key, x, y, size) {\n    var x1 = x - size, y1 = y - size, w = size * 2;\n    var level = 0, block = 0;\n    while (true) {\n        // If we reached max level\n        if (level >= maxLevel) {\n            containers[block] = containers[block] || [];\n            containers[block].push(key);\n            return;\n        }\n        var topLeftBlock = 4 * block + BLOCKS, topRightBlock = 4 * block + 2 * BLOCKS, bottomLeftBlock = 4 * block + 3 * BLOCKS, bottomRightBlock = 4 * block + 4 * BLOCKS;\n        var collidingWithTopLeft = squareCollidesWithQuad(x1, y1, w, data[topLeftBlock + X_OFFSET], data[topLeftBlock + Y_OFFSET], data[topLeftBlock + WIDTH_OFFSET], data[topLeftBlock + HEIGHT_OFFSET]);\n        var collidingWithTopRight = squareCollidesWithQuad(x1, y1, w, data[topRightBlock + X_OFFSET], data[topRightBlock + Y_OFFSET], data[topRightBlock + WIDTH_OFFSET], data[topRightBlock + HEIGHT_OFFSET]);\n        var collidingWithBottomLeft = squareCollidesWithQuad(x1, y1, w, data[bottomLeftBlock + X_OFFSET], data[bottomLeftBlock + Y_OFFSET], data[bottomLeftBlock + WIDTH_OFFSET], data[bottomLeftBlock + HEIGHT_OFFSET]);\n        var collidingWithBottomRight = squareCollidesWithQuad(x1, y1, w, data[bottomRightBlock + X_OFFSET], data[bottomRightBlock + Y_OFFSET], data[bottomRightBlock + WIDTH_OFFSET], data[bottomRightBlock + HEIGHT_OFFSET]);\n        var collisions = [\n            collidingWithTopLeft,\n            collidingWithTopRight,\n            collidingWithBottomLeft,\n            collidingWithBottomRight,\n        ].reduce(function (acc, current) {\n            if (current)\n                return acc + 1;\n            else\n                return acc;\n        }, 0);\n        // If we have no collision at root level, inject node in the outside block\n        if (collisions === 0 && level === 0) {\n            containers[OUTSIDE_BLOCK].push(key);\n            if (!hasWarnedTooMuchOutside && containers[OUTSIDE_BLOCK].length >= 5) {\n                hasWarnedTooMuchOutside = true;\n                console.warn(\"sigma/quadtree.insertNode: At least 5 nodes are outside the global quadtree zone. \" +\n                    \"You might have a problem with the normalization function or the custom bounding box.\");\n            }\n            return;\n        }\n        // If we don't have at least a collision but deeper, there is an issue\n        if (collisions === 0)\n            throw new Error(\"sigma/quadtree.insertNode: no collision (level: \".concat(level, \", key: \").concat(key, \", x: \").concat(x, \", y: \").concat(y, \", size: \").concat(size, \").\"));\n        // If we have 3 collisions, we have a geometry problem obviously\n        if (collisions === 3)\n            throw new Error(\"sigma/quadtree.insertNode: 3 impossible collisions (level: \".concat(level, \", key: \").concat(key, \", x: \").concat(x, \", y: \").concat(y, \", size: \").concat(size, \").\"));\n        // If we have more that one collision, we stop here and store the node\n        // in the relevant containers\n        if (collisions > 1) {\n            containers[block] = containers[block] || [];\n            containers[block].push(key);\n            return;\n        }\n        else {\n            level++;\n        }\n        // Else we recurse into the correct quads\n        if (collidingWithTopLeft)\n            block = topLeftBlock;\n        if (collidingWithTopRight)\n            block = topRightBlock;\n        if (collidingWithBottomLeft)\n            block = bottomLeftBlock;\n        if (collidingWithBottomRight)\n            block = bottomRightBlock;\n    }\n}\nfunction getNodesInAxisAlignedRectangleArea(maxLevel, data, containers, x1, y1, w, h) {\n    // [block, level]\n    var stack = [0, 0];\n    var collectedNodes = [];\n    var container;\n    while (stack.length) {\n        var level = stack.pop(), block = stack.pop();\n        // Collecting nodes\n        container = containers[block];\n        if (container)\n            (0, extend_1.default)(collectedNodes, container);\n        // If we reached max level\n        if (level >= maxLevel)\n            continue;\n        var topLeftBlock = 4 * block + BLOCKS, topRightBlock = 4 * block + 2 * BLOCKS, bottomLeftBlock = 4 * block + 3 * BLOCKS, bottomRightBlock = 4 * block + 4 * BLOCKS;\n        var collidingWithTopLeft = rectangleCollidesWithQuad(x1, y1, w, h, data[topLeftBlock + X_OFFSET], data[topLeftBlock + Y_OFFSET], data[topLeftBlock + WIDTH_OFFSET], data[topLeftBlock + HEIGHT_OFFSET]);\n        var collidingWithTopRight = rectangleCollidesWithQuad(x1, y1, w, h, data[topRightBlock + X_OFFSET], data[topRightBlock + Y_OFFSET], data[topRightBlock + WIDTH_OFFSET], data[topRightBlock + HEIGHT_OFFSET]);\n        var collidingWithBottomLeft = rectangleCollidesWithQuad(x1, y1, w, h, data[bottomLeftBlock + X_OFFSET], data[bottomLeftBlock + Y_OFFSET], data[bottomLeftBlock + WIDTH_OFFSET], data[bottomLeftBlock + HEIGHT_OFFSET]);\n        var collidingWithBottomRight = rectangleCollidesWithQuad(x1, y1, w, h, data[bottomRightBlock + X_OFFSET], data[bottomRightBlock + Y_OFFSET], data[bottomRightBlock + WIDTH_OFFSET], data[bottomRightBlock + HEIGHT_OFFSET]);\n        if (collidingWithTopLeft)\n            stack.push(topLeftBlock, level + 1);\n        if (collidingWithTopRight)\n            stack.push(topRightBlock, level + 1);\n        if (collidingWithBottomLeft)\n            stack.push(bottomLeftBlock, level + 1);\n        if (collidingWithBottomRight)\n            stack.push(bottomRightBlock, level + 1);\n    }\n    return collectedNodes;\n}\n/**\n * QuadTree class.\n *\n * @constructor\n * @param {object} boundaries - The graph boundaries.\n */\nvar QuadTree = /** @class */ (function () {\n    function QuadTree(params) {\n        var _a;\n        if (params === void 0) { params = {}; }\n        this.containers = (_a = {}, _a[OUTSIDE_BLOCK] = [], _a);\n        this.cache = null;\n        this.lastRectangle = null;\n        // Allocating the underlying byte array\n        var L = Math.pow(4, MAX_LEVEL);\n        this.data = new Float32Array(BLOCKS * ((4 * L - 1) / 3));\n        if (params.boundaries)\n            this.resize(params.boundaries);\n        else\n            this.resize({\n                x: 0,\n                y: 0,\n                width: 1,\n                height: 1,\n            });\n    }\n    QuadTree.prototype.add = function (key, x, y, size) {\n        insertNode(MAX_LEVEL, this.data, this.containers, key, x, y, size);\n        return this;\n    };\n    QuadTree.prototype.resize = function (boundaries) {\n        this.clear();\n        // Building the quadrants\n        this.data[X_OFFSET] = boundaries.x;\n        this.data[Y_OFFSET] = boundaries.y;\n        this.data[WIDTH_OFFSET] = boundaries.width;\n        this.data[HEIGHT_OFFSET] = boundaries.height;\n        buildQuadrants(MAX_LEVEL, this.data);\n    };\n    QuadTree.prototype.clear = function () {\n        var _a;\n        this.containers = (_a = {}, _a[OUTSIDE_BLOCK] = [], _a);\n        return this;\n    };\n    QuadTree.prototype.point = function (x, y) {\n        var nodes = this.containers[OUTSIDE_BLOCK].slice();\n        var block = 0, level = 0;\n        do {\n            if (this.containers[block])\n                (0, extend_1.default)(nodes, this.containers[block]);\n            var quad = pointIsInQuad(x, y, this.data[block + X_OFFSET], this.data[block + Y_OFFSET], this.data[block + WIDTH_OFFSET], this.data[block + HEIGHT_OFFSET]);\n            block = 4 * block + quad * BLOCKS;\n            level++;\n        } while (level <= MAX_LEVEL);\n        return nodes;\n    };\n    QuadTree.prototype.rectangle = function (x1, y1, x2, y2, height) {\n        var lr = this.lastRectangle;\n        if (lr && x1 === lr.x1 && x2 === lr.x2 && y1 === lr.y1 && y2 === lr.y2 && height === lr.height) {\n            return this.cache;\n        }\n        this.lastRectangle = {\n            x1: x1,\n            y1: y1,\n            x2: x2,\n            y2: y2,\n            height: height,\n        };\n        // If the rectangle is shifted, we use the smallest aligned rectangle that contains the shifted one:\n        if (!isRectangleAligned(this.lastRectangle))\n            this.lastRectangle = getCircumscribedAlignedRectangle(this.lastRectangle);\n        this.cache = getNodesInAxisAlignedRectangleArea(MAX_LEVEL, this.data, this.containers, x1, y1, Math.abs(x1 - x2) || Math.abs(y1 - y2), height);\n        // Add all the nodes in the outside block, since they might be relevant, and since they should be very few:\n        (0, extend_1.default)(this.cache, this.containers[OUTSIDE_BLOCK]);\n        return this.cache;\n    };\n    return QuadTree;\n}());\nexports.default = QuadTree;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Sigma = exports.MouseCaptor = exports.QuadTree = exports.Camera = void 0;\n/**\n * Sigma.js Library Endpoint\n * =========================\n *\n * The library endpoint.\n * @module\n */\nvar sigma_1 = __importDefault(require(\"./sigma\"));\nexports.Sigma = sigma_1.default;\nvar camera_1 = __importDefault(require(\"./core/camera\"));\nexports.Camera = camera_1.default;\nvar quadtree_1 = __importDefault(require(\"./core/quadtree\"));\nexports.QuadTree = quadtree_1.default;\nvar mouse_1 = __importDefault(require(\"./core/captors/mouse\"));\nexports.MouseCaptor = mouse_1.default;\nexports.default = sigma_1.default;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nfunction drawEdgeLabel(context, edgeData, sourceData, targetData, settings) {\n    var size = settings.edgeLabelSize, font = settings.edgeLabelFont, weight = settings.edgeLabelWeight, color = settings.edgeLabelColor.attribute\n        ? edgeData[settings.edgeLabelColor.attribute] || settings.edgeLabelColor.color || \"#000\"\n        : settings.edgeLabelColor.color;\n    var label = edgeData.label;\n    if (!label)\n        return;\n    context.fillStyle = color;\n    context.font = \"\".concat(weight, \" \").concat(size, \"px \").concat(font);\n    // Computing positions without considering nodes sizes:\n    var sSize = sourceData.size;\n    var tSize = targetData.size;\n    var sx = sourceData.x;\n    var sy = sourceData.y;\n    var tx = targetData.x;\n    var ty = targetData.y;\n    var cx = (sx + tx) / 2;\n    var cy = (sy + ty) / 2;\n    var dx = tx - sx;\n    var dy = ty - sy;\n    var d = Math.sqrt(dx * dx + dy * dy);\n    if (d < sSize + tSize)\n        return;\n    // Adding nodes sizes:\n    sx += (dx * sSize) / d;\n    sy += (dy * sSize) / d;\n    tx -= (dx * tSize) / d;\n    ty -= (dy * tSize) / d;\n    cx = (sx + tx) / 2;\n    cy = (sy + ty) / 2;\n    dx = tx - sx;\n    dy = ty - sy;\n    d = Math.sqrt(dx * dx + dy * dy);\n    // Handling ellipsis\n    var textLength = context.measureText(label).width;\n    if (textLength > d) {\n        var ellipsis = \"…\";\n        label = label + ellipsis;\n        textLength = context.measureText(label).width;\n        while (textLength > d && label.length > 1) {\n            label = label.slice(0, -2) + ellipsis;\n            textLength = context.measureText(label).width;\n        }\n        if (label.length < 4)\n            return;\n    }\n    var angle;\n    if (dx > 0) {\n        if (dy > 0)\n            angle = Math.acos(dx / d);\n        else\n            angle = Math.asin(dy / d);\n    }\n    else {\n        if (dy > 0)\n            angle = Math.acos(dx / d) + Math.PI;\n        else\n            angle = Math.asin(dx / d) + Math.PI / 2;\n    }\n    context.save();\n    context.translate(cx, cy);\n    context.rotate(angle);\n    context.fillText(label, -textLength / 2, edgeData.size / 2 + size);\n    context.restore();\n}\nexports.default = drawEdgeLabel;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar label_1 = __importDefault(require(\"./label\"));\n/**\n * Draw an hovered node.\n * - if there is no label => display a shadow on the node\n * - if the label box is bigger than node size => display a label box that contains the node with a shadow\n * - else node with shadow and the label box\n */\nfunction drawHover(context, data, settings) {\n    var size = settings.labelSize, font = settings.labelFont, weight = settings.labelWeight;\n    context.font = \"\".concat(weight, \" \").concat(size, \"px \").concat(font);\n    // Then we draw the label background\n    context.fillStyle = \"#FFF\";\n    context.shadowOffsetX = 0;\n    context.shadowOffsetY = 0;\n    context.shadowBlur = 8;\n    context.shadowColor = \"#000\";\n    var PADDING = 2;\n    if (typeof data.label === \"string\") {\n        var textWidth = context.measureText(data.label).width, boxWidth = Math.round(textWidth + 5), boxHeight = Math.round(size + 2 * PADDING), radius = Math.max(data.size, size / 2) + PADDING;\n        var angleRadian = Math.asin(boxHeight / 2 / radius);\n        var xDeltaCoord = Math.sqrt(Math.abs(Math.pow(radius, 2) - Math.pow(boxHeight / 2, 2)));\n        context.beginPath();\n        context.moveTo(data.x + xDeltaCoord, data.y + boxHeight / 2);\n        context.lineTo(data.x + radius + boxWidth, data.y + boxHeight / 2);\n        context.lineTo(data.x + radius + boxWidth, data.y - boxHeight / 2);\n        context.lineTo(data.x + xDeltaCoord, data.y - boxHeight / 2);\n        context.arc(data.x, data.y, radius, angleRadian, -angleRadian);\n        context.closePath();\n        context.fill();\n    }\n    else {\n        context.beginPath();\n        context.arc(data.x, data.y, data.size + PADDING, 0, Math.PI * 2);\n        context.closePath();\n        context.fill();\n    }\n    context.shadowOffsetX = 0;\n    context.shadowOffsetY = 0;\n    context.shadowBlur = 0;\n    // And finally we draw the label\n    (0, label_1.default)(context, data, settings);\n}\nexports.default = drawHover;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nfunction drawLabel(context, data, settings) {\n    if (!data.label)\n        return;\n    var size = settings.labelSize, font = settings.labelFont, weight = settings.labelWeight, color = settings.labelColor.attribute\n        ? data[settings.labelColor.attribute] || settings.labelColor.color || \"#000\"\n        : settings.labelColor.color;\n    context.fillStyle = color;\n    context.font = \"\".concat(weight, \" \").concat(size, \"px \").concat(font);\n    context.fillText(data.label, data.x + data.size + 3, data.y + size / 3);\n}\nexports.default = drawLabel;\n","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        if (typeof b !== \"function\" && b !== null)\n            throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createEdgeCompoundProgram = exports.AbstractEdgeProgram = void 0;\n/**\n * Sigma.js WebGL Abstract Edge Program\n * =====================================\n *\n * @module\n */\nvar program_1 = require(\"./program\");\n/**\n * Edge Program class.\n *\n * @constructor\n */\nvar AbstractEdgeProgram = /** @class */ (function (_super) {\n    __extends(AbstractEdgeProgram, _super);\n    function AbstractEdgeProgram(gl, vertexShaderSource, fragmentShaderSource, points, attributes) {\n        return _super.call(this, gl, vertexShaderSource, fragmentShaderSource, points, attributes) || this;\n    }\n    return AbstractEdgeProgram;\n}(program_1.AbstractProgram));\nexports.AbstractEdgeProgram = AbstractEdgeProgram;\nfunction createEdgeCompoundProgram(programClasses) {\n    return /** @class */ (function () {\n        function EdgeCompoundProgram(gl, renderer) {\n            this.programs = programClasses.map(function (ProgramClass) { return new ProgramClass(gl, renderer); });\n        }\n        EdgeCompoundProgram.prototype.bufferData = function () {\n            this.programs.forEach(function (program) { return program.bufferData(); });\n        };\n        EdgeCompoundProgram.prototype.allocate = function (capacity) {\n            this.programs.forEach(function (program) { return program.allocate(capacity); });\n        };\n        EdgeCompoundProgram.prototype.bind = function () {\n            // nothing todo, it's already done in each program constructor\n        };\n        EdgeCompoundProgram.prototype.computeIndices = function () {\n            this.programs.forEach(function (program) { return program.computeIndices(); });\n        };\n        EdgeCompoundProgram.prototype.render = function (params) {\n            this.programs.forEach(function (program) {\n                program.bind();\n                program.bufferData();\n                program.render(params);\n            });\n        };\n        EdgeCompoundProgram.prototype.process = function (sourceData, targetData, data, hidden, offset) {\n            this.programs.forEach(function (program) { return program.process(sourceData, targetData, data, hidden, offset); });\n        };\n        return EdgeCompoundProgram;\n    }());\n}\nexports.createEdgeCompoundProgram = createEdgeCompoundProgram;\n","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        if (typeof b !== \"function\" && b !== null)\n            throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createNodeCompoundProgram = exports.AbstractNodeProgram = void 0;\n/**\n * Sigma.js WebGL Abstract Node Program\n * =====================================\n *\n * @module\n */\nvar program_1 = require(\"./program\");\n/**\n * Node Program class.\n *\n * @constructor\n */\nvar AbstractNodeProgram = /** @class */ (function (_super) {\n    __extends(AbstractNodeProgram, _super);\n    function AbstractNodeProgram(gl, vertexShaderSource, fragmentShaderSource, points, attributes) {\n        var _this = _super.call(this, gl, vertexShaderSource, fragmentShaderSource, points, attributes) || this;\n        // Locations\n        _this.positionLocation = gl.getAttribLocation(_this.program, \"a_position\");\n        _this.sizeLocation = gl.getAttribLocation(_this.program, \"a_size\");\n        _this.colorLocation = gl.getAttribLocation(_this.program, \"a_color\");\n        // Uniform Location\n        var matrixLocation = gl.getUniformLocation(_this.program, \"u_matrix\");\n        if (matrixLocation === null)\n            throw new Error(\"AbstractNodeProgram: error while getting matrixLocation\");\n        _this.matrixLocation = matrixLocation;\n        var ratioLocation = gl.getUniformLocation(_this.program, \"u_ratio\");\n        if (ratioLocation === null)\n            throw new Error(\"AbstractNodeProgram: error while getting ratioLocation\");\n        _this.ratioLocation = ratioLocation;\n        var scaleLocation = gl.getUniformLocation(_this.program, \"u_scale\");\n        if (scaleLocation === null)\n            throw new Error(\"AbstractNodeProgram: error while getting scaleLocation\");\n        _this.scaleLocation = scaleLocation;\n        return _this;\n    }\n    AbstractNodeProgram.prototype.bind = function () {\n        var gl = this.gl;\n        gl.enableVertexAttribArray(this.positionLocation);\n        gl.enableVertexAttribArray(this.sizeLocation);\n        gl.enableVertexAttribArray(this.colorLocation);\n        gl.vertexAttribPointer(this.positionLocation, 2, gl.FLOAT, false, this.attributes * Float32Array.BYTES_PER_ELEMENT, 0);\n        gl.vertexAttribPointer(this.sizeLocation, 1, gl.FLOAT, false, this.attributes * Float32Array.BYTES_PER_ELEMENT, 8);\n        gl.vertexAttribPointer(this.colorLocation, 4, gl.UNSIGNED_BYTE, true, this.attributes * Float32Array.BYTES_PER_ELEMENT, 12);\n    };\n    return AbstractNodeProgram;\n}(program_1.AbstractProgram));\nexports.AbstractNodeProgram = AbstractNodeProgram;\n/**\n * Helper function combining two or more programs into a single compound one.\n * Note that this is more a quick & easy way to combine program than a really\n * performant option. More performant programs can be written entirely.\n *\n * @param  {array}    programClasses - Program classes to combine.\n * @return {function}\n */\nfunction createNodeCompoundProgram(programClasses) {\n    return /** @class */ (function () {\n        function NodeCompoundProgram(gl, renderer) {\n            this.programs = programClasses.map(function (ProgramClass) { return new ProgramClass(gl, renderer); });\n        }\n        NodeCompoundProgram.prototype.bufferData = function () {\n            this.programs.forEach(function (program) { return program.bufferData(); });\n        };\n        NodeCompoundProgram.prototype.allocate = function (capacity) {\n            this.programs.forEach(function (program) { return program.allocate(capacity); });\n        };\n        NodeCompoundProgram.prototype.bind = function () {\n            // nothing todo, it's already done in each program constructor\n        };\n        NodeCompoundProgram.prototype.render = function (params) {\n            this.programs.forEach(function (program) {\n                program.bind();\n                program.bufferData();\n                program.render(params);\n            });\n        };\n        NodeCompoundProgram.prototype.process = function (data, hidden, offset) {\n            this.programs.forEach(function (program) { return program.process(data, hidden, offset); });\n        };\n        return NodeCompoundProgram;\n    }());\n}\nexports.createNodeCompoundProgram = createNodeCompoundProgram;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AbstractProgram = void 0;\n/**\n * Sigma.js WebGL Renderer Program\n * ================================\n *\n * Class representing a single WebGL program used by sigma's WebGL renderer.\n * @module\n */\nvar utils_1 = require(\"../../shaders/utils\");\n/**\n * Abstract Program class.\n *\n * @constructor\n */\nvar AbstractProgram = /** @class */ (function () {\n    function AbstractProgram(gl, vertexShaderSource, fragmentShaderSource, points, attributes) {\n        this.array = new Float32Array();\n        this.points = points;\n        this.attributes = attributes;\n        this.gl = gl;\n        this.vertexShaderSource = vertexShaderSource;\n        this.fragmentShaderSource = fragmentShaderSource;\n        var buffer = gl.createBuffer();\n        if (buffer === null)\n            throw new Error(\"AbstractProgram: error while creating the buffer\");\n        this.buffer = buffer;\n        gl.bindBuffer(gl.ARRAY_BUFFER, this.buffer);\n        this.vertexShader = (0, utils_1.loadVertexShader)(gl, this.vertexShaderSource);\n        this.fragmentShader = (0, utils_1.loadFragmentShader)(gl, this.fragmentShaderSource);\n        this.program = (0, utils_1.loadProgram)(gl, [this.vertexShader, this.fragmentShader]);\n    }\n    AbstractProgram.prototype.bufferData = function () {\n        var gl = this.gl;\n        gl.bufferData(gl.ARRAY_BUFFER, this.array, gl.DYNAMIC_DRAW);\n    };\n    AbstractProgram.prototype.allocate = function (capacity) {\n        this.array = new Float32Array(this.points * this.attributes * capacity);\n    };\n    AbstractProgram.prototype.hasNothingToRender = function () {\n        return this.array.length === 0;\n    };\n    return AbstractProgram;\n}());\nexports.AbstractProgram = AbstractProgram;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * Sigma.js WebGL Renderer Edge Arrow Program\n * ===========================================\n *\n * Compound program rendering edges as an arrow from the source to the target.\n * @module\n */\nvar edge_1 = require(\"./common/edge\");\nvar edge_arrowHead_1 = __importDefault(require(\"./edge.arrowHead\"));\nvar edge_clamped_1 = __importDefault(require(\"./edge.clamped\"));\nvar EdgeArrowProgram = (0, edge_1.createEdgeCompoundProgram)([edge_clamped_1.default, edge_arrowHead_1.default]);\nexports.default = EdgeArrowProgram;\n","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        if (typeof b !== \"function\" && b !== null)\n            throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar utils_1 = require(\"../../../utils\");\nvar edge_arrowHead_vert_glsl_1 = __importDefault(require(\"../shaders/edge.arrowHead.vert.glsl.js\"));\nvar edge_arrowHead_frag_glsl_1 = __importDefault(require(\"../shaders/edge.arrowHead.frag.glsl.js\"));\nvar edge_1 = require(\"./common/edge\");\nvar POINTS = 3, ATTRIBUTES = 9, STRIDE = POINTS * ATTRIBUTES;\nvar EdgeArrowHeadProgram = /** @class */ (function (_super) {\n    __extends(EdgeArrowHeadProgram, _super);\n    function EdgeArrowHeadProgram(gl) {\n        var _this = _super.call(this, gl, edge_arrowHead_vert_glsl_1.default, edge_arrowHead_frag_glsl_1.default, POINTS, ATTRIBUTES) || this;\n        // Locations\n        _this.positionLocation = gl.getAttribLocation(_this.program, \"a_position\");\n        _this.colorLocation = gl.getAttribLocation(_this.program, \"a_color\");\n        _this.normalLocation = gl.getAttribLocation(_this.program, \"a_normal\");\n        _this.radiusLocation = gl.getAttribLocation(_this.program, \"a_radius\");\n        _this.barycentricLocation = gl.getAttribLocation(_this.program, \"a_barycentric\");\n        // Uniform locations\n        var matrixLocation = gl.getUniformLocation(_this.program, \"u_matrix\");\n        if (matrixLocation === null)\n            throw new Error(\"EdgeArrowHeadProgram: error while getting matrixLocation\");\n        _this.matrixLocation = matrixLocation;\n        var sqrtZoomRatioLocation = gl.getUniformLocation(_this.program, \"u_sqrtZoomRatio\");\n        if (sqrtZoomRatioLocation === null)\n            throw new Error(\"EdgeArrowHeadProgram: error while getting sqrtZoomRatioLocation\");\n        _this.sqrtZoomRatioLocation = sqrtZoomRatioLocation;\n        var correctionRatioLocation = gl.getUniformLocation(_this.program, \"u_correctionRatio\");\n        if (correctionRatioLocation === null)\n            throw new Error(\"EdgeArrowHeadProgram: error while getting correctionRatioLocation\");\n        _this.correctionRatioLocation = correctionRatioLocation;\n        _this.bind();\n        return _this;\n    }\n    EdgeArrowHeadProgram.prototype.bind = function () {\n        var gl = this.gl;\n        // Bindings\n        gl.enableVertexAttribArray(this.positionLocation);\n        gl.enableVertexAttribArray(this.normalLocation);\n        gl.enableVertexAttribArray(this.radiusLocation);\n        gl.enableVertexAttribArray(this.colorLocation);\n        gl.enableVertexAttribArray(this.barycentricLocation);\n        gl.vertexAttribPointer(this.positionLocation, 2, gl.FLOAT, false, ATTRIBUTES * Float32Array.BYTES_PER_ELEMENT, 0);\n        gl.vertexAttribPointer(this.normalLocation, 2, gl.FLOAT, false, ATTRIBUTES * Float32Array.BYTES_PER_ELEMENT, 8);\n        gl.vertexAttribPointer(this.radiusLocation, 1, gl.FLOAT, false, ATTRIBUTES * Float32Array.BYTES_PER_ELEMENT, 16);\n        gl.vertexAttribPointer(this.colorLocation, 4, gl.UNSIGNED_BYTE, true, ATTRIBUTES * Float32Array.BYTES_PER_ELEMENT, 20);\n        // TODO: maybe we can optimize here by packing this in a bit mask\n        gl.vertexAttribPointer(this.barycentricLocation, 3, gl.FLOAT, false, ATTRIBUTES * Float32Array.BYTES_PER_ELEMENT, 24);\n    };\n    EdgeArrowHeadProgram.prototype.computeIndices = function () {\n        // nothing to do\n    };\n    EdgeArrowHeadProgram.prototype.process = function (sourceData, targetData, data, hidden, offset) {\n        if (hidden) {\n            for (var i_1 = offset * STRIDE, l = i_1 + STRIDE; i_1 < l; i_1++)\n                this.array[i_1] = 0;\n            return;\n        }\n        var thickness = data.size || 1, radius = targetData.size || 1, x1 = sourceData.x, y1 = sourceData.y, x2 = targetData.x, y2 = targetData.y, color = (0, utils_1.floatColor)(data.color);\n        // Computing normals\n        var dx = x2 - x1, dy = y2 - y1;\n        var len = dx * dx + dy * dy, n1 = 0, n2 = 0;\n        if (len) {\n            len = 1 / Math.sqrt(len);\n            n1 = -dy * len * thickness;\n            n2 = dx * len * thickness;\n        }\n        var i = POINTS * ATTRIBUTES * offset;\n        var array = this.array;\n        // First point\n        array[i++] = x2;\n        array[i++] = y2;\n        array[i++] = -n1;\n        array[i++] = -n2;\n        array[i++] = radius;\n        array[i++] = color;\n        array[i++] = 1;\n        array[i++] = 0;\n        array[i++] = 0;\n        // Second point\n        array[i++] = x2;\n        array[i++] = y2;\n        array[i++] = -n1;\n        array[i++] = -n2;\n        array[i++] = radius;\n        array[i++] = color;\n        array[i++] = 0;\n        array[i++] = 1;\n        array[i++] = 0;\n        // Third point\n        array[i++] = x2;\n        array[i++] = y2;\n        array[i++] = -n1;\n        array[i++] = -n2;\n        array[i++] = radius;\n        array[i++] = color;\n        array[i++] = 0;\n        array[i++] = 0;\n        array[i] = 1;\n    };\n    EdgeArrowHeadProgram.prototype.render = function (params) {\n        if (this.hasNothingToRender())\n            return;\n        var gl = this.gl;\n        var program = this.program;\n        gl.useProgram(program);\n        // Binding uniforms\n        gl.uniformMatrix3fv(this.matrixLocation, false, params.matrix);\n        gl.uniform1f(this.sqrtZoomRatioLocation, Math.sqrt(params.ratio));\n        gl.uniform1f(this.correctionRatioLocation, params.correctionRatio);\n        // Drawing:\n        gl.drawArrays(gl.TRIANGLES, 0, this.array.length / ATTRIBUTES);\n    };\n    return EdgeArrowHeadProgram;\n}(edge_1.AbstractEdgeProgram));\nexports.default = EdgeArrowHeadProgram;\n","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        if (typeof b !== \"function\" && b !== null)\n            throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar edge_1 = require(\"./common/edge\");\nvar utils_1 = require(\"../../../utils\");\nvar edge_clamped_vert_glsl_1 = __importDefault(require(\"../shaders/edge.clamped.vert.glsl.js\"));\nvar edge_frag_glsl_1 = __importDefault(require(\"../shaders/edge.frag.glsl.js\"));\nvar POINTS = 4, ATTRIBUTES = 6, STRIDE = POINTS * ATTRIBUTES;\nvar EdgeClampedProgram = /** @class */ (function (_super) {\n    __extends(EdgeClampedProgram, _super);\n    function EdgeClampedProgram(gl) {\n        var _this = _super.call(this, gl, edge_clamped_vert_glsl_1.default, edge_frag_glsl_1.default, POINTS, ATTRIBUTES) || this;\n        // Initializing indices buffer\n        var indicesBuffer = gl.createBuffer();\n        if (indicesBuffer === null)\n            throw new Error(\"EdgeClampedProgram: error while getting resolutionLocation\");\n        _this.indicesBuffer = indicesBuffer;\n        // Locations:\n        _this.positionLocation = gl.getAttribLocation(_this.program, \"a_position\");\n        _this.colorLocation = gl.getAttribLocation(_this.program, \"a_color\");\n        _this.normalLocation = gl.getAttribLocation(_this.program, \"a_normal\");\n        _this.radiusLocation = gl.getAttribLocation(_this.program, \"a_radius\");\n        // Uniform locations\n        var matrixLocation = gl.getUniformLocation(_this.program, \"u_matrix\");\n        if (matrixLocation === null)\n            throw new Error(\"EdgeClampedProgram: error while getting matrixLocation\");\n        _this.matrixLocation = matrixLocation;\n        var sqrtZoomRatioLocation = gl.getUniformLocation(_this.program, \"u_sqrtZoomRatio\");\n        if (sqrtZoomRatioLocation === null)\n            throw new Error(\"EdgeClampedProgram: error while getting cameraRatioLocation\");\n        _this.sqrtZoomRatioLocation = sqrtZoomRatioLocation;\n        var correctionRatioLocation = gl.getUniformLocation(_this.program, \"u_correctionRatio\");\n        if (correctionRatioLocation === null)\n            throw new Error(\"EdgeClampedProgram: error while getting viewportRatioLocation\");\n        _this.correctionRatioLocation = correctionRatioLocation;\n        // Enabling the OES_element_index_uint extension\n        // NOTE: on older GPUs, this means that really large graphs won't\n        // have all their edges rendered. But it seems that the\n        // `OES_element_index_uint` is quite everywhere so we'll handle\n        // the potential issue if it really arises.\n        // NOTE: when using webgl2, the extension is enabled by default\n        _this.canUse32BitsIndices = (0, utils_1.canUse32BitsIndices)(gl);\n        _this.IndicesArray = _this.canUse32BitsIndices ? Uint32Array : Uint16Array;\n        _this.indicesArray = new _this.IndicesArray();\n        _this.indicesType = _this.canUse32BitsIndices ? gl.UNSIGNED_INT : gl.UNSIGNED_SHORT;\n        _this.bind();\n        return _this;\n    }\n    EdgeClampedProgram.prototype.bind = function () {\n        var gl = this.gl;\n        gl.bindBuffer(gl.ELEMENT_ARRAY_BUFFER, this.indicesBuffer);\n        // Bindings\n        gl.enableVertexAttribArray(this.positionLocation);\n        gl.enableVertexAttribArray(this.normalLocation);\n        gl.enableVertexAttribArray(this.colorLocation);\n        gl.enableVertexAttribArray(this.radiusLocation);\n        gl.vertexAttribPointer(this.positionLocation, 2, gl.FLOAT, false, ATTRIBUTES * Float32Array.BYTES_PER_ELEMENT, 0);\n        gl.vertexAttribPointer(this.normalLocation, 2, gl.FLOAT, false, ATTRIBUTES * Float32Array.BYTES_PER_ELEMENT, 8);\n        gl.vertexAttribPointer(this.colorLocation, 4, gl.UNSIGNED_BYTE, true, ATTRIBUTES * Float32Array.BYTES_PER_ELEMENT, 16);\n        gl.vertexAttribPointer(this.radiusLocation, 1, gl.FLOAT, false, ATTRIBUTES * Float32Array.BYTES_PER_ELEMENT, 20);\n    };\n    EdgeClampedProgram.prototype.process = function (sourceData, targetData, data, hidden, offset) {\n        if (hidden) {\n            for (var i_1 = offset * STRIDE, l = i_1 + STRIDE; i_1 < l; i_1++)\n                this.array[i_1] = 0;\n            return;\n        }\n        var thickness = data.size || 1, x1 = sourceData.x, y1 = sourceData.y, x2 = targetData.x, y2 = targetData.y, radius = targetData.size || 1, color = (0, utils_1.floatColor)(data.color);\n        // Computing normals\n        var dx = x2 - x1, dy = y2 - y1;\n        var len = dx * dx + dy * dy, n1 = 0, n2 = 0;\n        if (len) {\n            len = 1 / Math.sqrt(len);\n            n1 = -dy * len * thickness;\n            n2 = dx * len * thickness;\n        }\n        var i = POINTS * ATTRIBUTES * offset;\n        var array = this.array;\n        // First point\n        array[i++] = x1;\n        array[i++] = y1;\n        array[i++] = n1;\n        array[i++] = n2;\n        array[i++] = color;\n        array[i++] = 0;\n        // First point flipped\n        array[i++] = x1;\n        array[i++] = y1;\n        array[i++] = -n1;\n        array[i++] = -n2;\n        array[i++] = color;\n        array[i++] = 0;\n        // Second point\n        array[i++] = x2;\n        array[i++] = y2;\n        array[i++] = n1;\n        array[i++] = n2;\n        array[i++] = color;\n        array[i++] = radius;\n        // Second point flipped\n        array[i++] = x2;\n        array[i++] = y2;\n        array[i++] = -n1;\n        array[i++] = -n2;\n        array[i++] = color;\n        array[i] = -radius;\n    };\n    EdgeClampedProgram.prototype.computeIndices = function () {\n        var l = this.array.length / ATTRIBUTES;\n        var size = l + l / 2;\n        var indices = new this.IndicesArray(size);\n        for (var i = 0, c = 0; i < l; i += 4) {\n            indices[c++] = i;\n            indices[c++] = i + 1;\n            indices[c++] = i + 2;\n            indices[c++] = i + 2;\n            indices[c++] = i + 1;\n            indices[c++] = i + 3;\n        }\n        this.indicesArray = indices;\n    };\n    EdgeClampedProgram.prototype.bufferData = function () {\n        _super.prototype.bufferData.call(this);\n        // Indices data\n        var gl = this.gl;\n        gl.bufferData(gl.ELEMENT_ARRAY_BUFFER, this.indicesArray, gl.STATIC_DRAW);\n    };\n    EdgeClampedProgram.prototype.render = function (params) {\n        if (this.hasNothingToRender())\n            return;\n        var gl = this.gl;\n        var program = this.program;\n        gl.useProgram(program);\n        // Binding uniforms\n        gl.uniformMatrix3fv(this.matrixLocation, false, params.matrix);\n        gl.uniform1f(this.sqrtZoomRatioLocation, Math.sqrt(params.ratio));\n        gl.uniform1f(this.correctionRatioLocation, params.correctionRatio);\n        // Drawing:\n        gl.drawElements(gl.TRIANGLES, this.indicesArray.length, this.indicesType, 0);\n    };\n    return EdgeClampedProgram;\n}(edge_1.AbstractEdgeProgram));\nexports.default = EdgeClampedProgram;\n","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        if (typeof b !== \"function\" && b !== null)\n            throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * Sigma.js WebGL Renderer Edge Program\n * =====================================\n *\n * Program rendering edges as thick lines using four points translated\n * orthogonally from the source & target's centers by half thickness.\n *\n * Rendering two triangles by using only four points is made possible through\n * the use of indices.\n *\n * This method should be faster than the 6 points / 2 triangles approach and\n * should handle thickness better than with gl.LINES.\n *\n * This version of the shader balances geometry computation evenly between\n * the CPU & GPU (normals are computed on the CPU side).\n * @module\n */\nvar utils_1 = require(\"../../../utils\");\nvar edge_vert_glsl_1 = __importDefault(require(\"../shaders/edge.vert.glsl.js\"));\nvar edge_frag_glsl_1 = __importDefault(require(\"../shaders/edge.frag.glsl.js\"));\nvar edge_1 = require(\"./common/edge\");\nvar POINTS = 4, ATTRIBUTES = 5, STRIDE = POINTS * ATTRIBUTES;\nvar EdgeProgram = /** @class */ (function (_super) {\n    __extends(EdgeProgram, _super);\n    function EdgeProgram(gl) {\n        var _this = _super.call(this, gl, edge_vert_glsl_1.default, edge_frag_glsl_1.default, POINTS, ATTRIBUTES) || this;\n        // Initializing indices buffer\n        var indicesBuffer = gl.createBuffer();\n        if (indicesBuffer === null)\n            throw new Error(\"EdgeProgram: error while creating indicesBuffer\");\n        _this.indicesBuffer = indicesBuffer;\n        // Locations\n        _this.positionLocation = gl.getAttribLocation(_this.program, \"a_position\");\n        _this.colorLocation = gl.getAttribLocation(_this.program, \"a_color\");\n        _this.normalLocation = gl.getAttribLocation(_this.program, \"a_normal\");\n        var matrixLocation = gl.getUniformLocation(_this.program, \"u_matrix\");\n        if (matrixLocation === null)\n            throw new Error(\"EdgeProgram: error while getting matrixLocation\");\n        _this.matrixLocation = matrixLocation;\n        var correctionRatioLocation = gl.getUniformLocation(_this.program, \"u_correctionRatio\");\n        if (correctionRatioLocation === null)\n            throw new Error(\"EdgeProgram: error while getting correctionRatioLocation\");\n        _this.correctionRatioLocation = correctionRatioLocation;\n        var sqrtZoomRatioLocation = gl.getUniformLocation(_this.program, \"u_sqrtZoomRatio\");\n        if (sqrtZoomRatioLocation === null)\n            throw new Error(\"EdgeProgram: error while getting sqrtZoomRatioLocation\");\n        _this.sqrtZoomRatioLocation = sqrtZoomRatioLocation;\n        // Enabling the OES_element_index_uint extension\n        // NOTE: on older GPUs, this means that really large graphs won't\n        // have all their edges rendered. But it seems that the\n        // `OES_element_index_uint` is quite everywhere so we'll handle\n        // the potential issue if it really arises.\n        // NOTE: when using webgl2, the extension is enabled by default\n        _this.canUse32BitsIndices = (0, utils_1.canUse32BitsIndices)(gl);\n        _this.IndicesArray = _this.canUse32BitsIndices ? Uint32Array : Uint16Array;\n        _this.indicesArray = new _this.IndicesArray();\n        _this.indicesType = _this.canUse32BitsIndices ? gl.UNSIGNED_INT : gl.UNSIGNED_SHORT;\n        _this.bind();\n        return _this;\n    }\n    EdgeProgram.prototype.bind = function () {\n        var gl = this.gl;\n        gl.bindBuffer(gl.ELEMENT_ARRAY_BUFFER, this.indicesBuffer);\n        // Bindings\n        gl.enableVertexAttribArray(this.positionLocation);\n        gl.enableVertexAttribArray(this.normalLocation);\n        gl.enableVertexAttribArray(this.colorLocation);\n        gl.vertexAttribPointer(this.positionLocation, 2, gl.FLOAT, false, ATTRIBUTES * Float32Array.BYTES_PER_ELEMENT, 0);\n        gl.vertexAttribPointer(this.normalLocation, 2, gl.FLOAT, false, ATTRIBUTES * Float32Array.BYTES_PER_ELEMENT, 8);\n        gl.vertexAttribPointer(this.colorLocation, 4, gl.UNSIGNED_BYTE, true, ATTRIBUTES * Float32Array.BYTES_PER_ELEMENT, 16);\n    };\n    EdgeProgram.prototype.computeIndices = function () {\n        var l = this.array.length / ATTRIBUTES;\n        var size = l + l / 2;\n        var indices = new this.IndicesArray(size);\n        for (var i = 0, c = 0; i < l; i += 4) {\n            indices[c++] = i;\n            indices[c++] = i + 1;\n            indices[c++] = i + 2;\n            indices[c++] = i + 2;\n            indices[c++] = i + 1;\n            indices[c++] = i + 3;\n        }\n        this.indicesArray = indices;\n    };\n    EdgeProgram.prototype.bufferData = function () {\n        _super.prototype.bufferData.call(this);\n        // Indices data\n        var gl = this.gl;\n        gl.bufferData(gl.ELEMENT_ARRAY_BUFFER, this.indicesArray, gl.STATIC_DRAW);\n    };\n    EdgeProgram.prototype.process = function (sourceData, targetData, data, hidden, offset) {\n        if (hidden) {\n            for (var i_1 = offset * STRIDE, l = i_1 + STRIDE; i_1 < l; i_1++)\n                this.array[i_1] = 0;\n            return;\n        }\n        var thickness = data.size || 1, x1 = sourceData.x, y1 = sourceData.y, x2 = targetData.x, y2 = targetData.y, color = (0, utils_1.floatColor)(data.color);\n        // Computing normals\n        var dx = x2 - x1, dy = y2 - y1;\n        var len = dx * dx + dy * dy, n1 = 0, n2 = 0;\n        if (len) {\n            len = 1 / Math.sqrt(len);\n            n1 = -dy * len * thickness;\n            n2 = dx * len * thickness;\n        }\n        var i = POINTS * ATTRIBUTES * offset;\n        var array = this.array;\n        // First point\n        array[i++] = x1;\n        array[i++] = y1;\n        array[i++] = n1;\n        array[i++] = n2;\n        array[i++] = color;\n        // First point flipped\n        array[i++] = x1;\n        array[i++] = y1;\n        array[i++] = -n1;\n        array[i++] = -n2;\n        array[i++] = color;\n        // Second point\n        array[i++] = x2;\n        array[i++] = y2;\n        array[i++] = n1;\n        array[i++] = n2;\n        array[i++] = color;\n        // Second point flipped\n        array[i++] = x2;\n        array[i++] = y2;\n        array[i++] = -n1;\n        array[i++] = -n2;\n        array[i] = color;\n    };\n    EdgeProgram.prototype.render = function (params) {\n        if (this.hasNothingToRender())\n            return;\n        var gl = this.gl;\n        var program = this.program;\n        gl.useProgram(program);\n        gl.uniformMatrix3fv(this.matrixLocation, false, params.matrix);\n        gl.uniform1f(this.sqrtZoomRatioLocation, Math.sqrt(params.ratio));\n        gl.uniform1f(this.correctionRatioLocation, params.correctionRatio);\n        // Drawing:\n        gl.drawElements(gl.TRIANGLES, this.indicesArray.length, this.indicesType, 0);\n    };\n    return EdgeProgram;\n}(edge_1.AbstractEdgeProgram));\nexports.default = EdgeProgram;\n","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        if (typeof b !== \"function\" && b !== null)\n            throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar utils_1 = require(\"../../../utils\");\nvar node_fast_vert_glsl_1 = __importDefault(require(\"../shaders/node.fast.vert.glsl.js\"));\nvar node_fast_frag_glsl_1 = __importDefault(require(\"../shaders/node.fast.frag.glsl.js\"));\nvar node_1 = require(\"./common/node\");\nvar POINTS = 1, ATTRIBUTES = 4;\nvar NodeFastProgram = /** @class */ (function (_super) {\n    __extends(NodeFastProgram, _super);\n    function NodeFastProgram(gl) {\n        var _this = _super.call(this, gl, node_fast_vert_glsl_1.default, node_fast_frag_glsl_1.default, POINTS, ATTRIBUTES) || this;\n        _this.bind();\n        return _this;\n    }\n    NodeFastProgram.prototype.process = function (data, hidden, offset) {\n        var array = this.array;\n        var i = offset * POINTS * ATTRIBUTES;\n        if (hidden) {\n            array[i++] = 0;\n            array[i++] = 0;\n            array[i++] = 0;\n            array[i++] = 0;\n            return;\n        }\n        var color = (0, utils_1.floatColor)(data.color);\n        array[i++] = data.x;\n        array[i++] = data.y;\n        array[i++] = data.size;\n        array[i] = color;\n    };\n    NodeFastProgram.prototype.render = function (params) {\n        if (this.hasNothingToRender())\n            return;\n        var gl = this.gl;\n        var program = this.program;\n        gl.useProgram(program);\n        gl.uniform1f(this.ratioLocation, 1 / Math.sqrt(params.ratio));\n        gl.uniform1f(this.scaleLocation, params.scalingRatio);\n        gl.uniformMatrix3fv(this.matrixLocation, false, params.matrix);\n        gl.drawArrays(gl.POINTS, 0, this.array.length / ATTRIBUTES);\n    };\n    return NodeFastProgram;\n}(node_1.AbstractNodeProgram));\nexports.default = NodeFastProgram;\n","(()=>{\"use strict\";var e={d:(o,r)=>{for(var t in r)e.o(r,t)&&!e.o(o,t)&&Object.defineProperty(o,t,{enumerable:!0,get:r[t]})},o:(e,o)=>Object.prototype.hasOwnProperty.call(e,o),r:e=>{\"undefined\"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:\"Module\"}),Object.defineProperty(e,\"__esModule\",{value:!0})}},o={};e.r(o),e.d(o,{default:()=>r});const r=\"precision mediump float;\\n\\nvarying vec4 v_color;\\n\\nvoid main(void) {\\n  gl_FragColor = v_color;\\n}\\n\";module.exports=o})();","(()=>{\"use strict\";var a={d:(e,t)=>{for(var o in t)a.o(t,o)&&!a.o(e,o)&&Object.defineProperty(e,o,{enumerable:!0,get:t[o]})},o:(a,e)=>Object.prototype.hasOwnProperty.call(a,e),r:a=>{\"undefined\"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(a,Symbol.toStringTag,{value:\"Module\"}),Object.defineProperty(a,\"__esModule\",{value:!0})}},e={};a.r(e),a.d(e,{default:()=>t});const t=\"attribute vec2 a_position;\\nattribute vec2 a_normal;\\nattribute float a_radius;\\nattribute vec4 a_color;\\nattribute vec3 a_barycentric;\\n\\nuniform mat3 u_matrix;\\nuniform float u_sqrtZoomRatio;\\nuniform float u_correctionRatio;\\n\\nvarying vec4 v_color;\\n\\nconst float minThickness = 1.7;\\nconst float bias = 255.0 / 254.0;\\nconst float arrowHeadWidthLengthRatio = 0.66;\\nconst float arrowHeadLengthThicknessRatio = 2.5;\\n\\nvoid main() {\\n  float normalLength = length(a_normal);\\n  vec2 unitNormal = a_normal / normalLength;\\n\\n  // These first computations are taken from edge.vert.glsl and\\n  // edge.clamped.vert.glsl. Please read it to get better comments on what's\\n  // happening:\\n  float pixelsThickness = max(normalLength, minThickness * u_sqrtZoomRatio);\\n  float webGLThickness = pixelsThickness * u_correctionRatio;\\n  float adaptedWebGLThickness = webGLThickness * u_sqrtZoomRatio;\\n  float adaptedWebGLNodeRadius = a_radius * 2.0 * u_correctionRatio * u_sqrtZoomRatio;\\n  float adaptedWebGLArrowHeadLength = adaptedWebGLThickness * 2.0 * arrowHeadLengthThicknessRatio;\\n  float adaptedWebGLArrowHeadHalfWidth = adaptedWebGLArrowHeadLength * arrowHeadWidthLengthRatio / 2.0;\\n\\n  float da = a_barycentric.x;\\n  float db = a_barycentric.y;\\n  float dc = a_barycentric.z;\\n\\n  vec2 delta = vec2(\\n      da * (adaptedWebGLNodeRadius * unitNormal.y)\\n    + db * ((adaptedWebGLNodeRadius + adaptedWebGLArrowHeadLength) * unitNormal.y + adaptedWebGLArrowHeadHalfWidth * unitNormal.x)\\n    + dc * ((adaptedWebGLNodeRadius + adaptedWebGLArrowHeadLength) * unitNormal.y - adaptedWebGLArrowHeadHalfWidth * unitNormal.x),\\n\\n      da * (-adaptedWebGLNodeRadius * unitNormal.x)\\n    + db * (-(adaptedWebGLNodeRadius + adaptedWebGLArrowHeadLength) * unitNormal.x + adaptedWebGLArrowHeadHalfWidth * unitNormal.y)\\n    + dc * (-(adaptedWebGLNodeRadius + adaptedWebGLArrowHeadLength) * unitNormal.x - adaptedWebGLArrowHeadHalfWidth * unitNormal.y)\\n  );\\n\\n  vec2 position = (u_matrix * vec3(a_position + delta, 1)).xy;\\n\\n  gl_Position = vec4(position, 0, 1);\\n\\n  // Extract the color:\\n  v_color = a_color;\\n  v_color.a *= bias;\\n}\\n\";module.exports=e})();","(()=>{\"use strict\";var e={d:(o,n)=>{for(var t in n)e.o(n,t)&&!e.o(o,t)&&Object.defineProperty(o,t,{enumerable:!0,get:n[t]})},o:(e,o)=>Object.prototype.hasOwnProperty.call(e,o),r:e=>{\"undefined\"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:\"Module\"}),Object.defineProperty(e,\"__esModule\",{value:!0})}},o={};e.r(o),e.d(o,{default:()=>n});const n=\"attribute vec4 a_color;\\nattribute vec2 a_normal;\\nattribute vec2 a_position;\\nattribute float a_radius;\\n\\nuniform mat3 u_matrix;\\nuniform float u_sqrtZoomRatio;\\nuniform float u_correctionRatio;\\n\\nvarying vec4 v_color;\\nvarying vec2 v_normal;\\nvarying float v_thickness;\\n\\nconst float minThickness = 1.7;\\nconst float bias = 255.0 / 254.0;\\nconst float arrowHeadLengthThicknessRatio = 2.5;\\n\\nvoid main() {\\n  float normalLength = length(a_normal);\\n  vec2 unitNormal = a_normal / normalLength;\\n\\n  // These first computations are taken from edge.vert.glsl. Please read it to\\n  // get better comments on what's happening:\\n  float pixelsThickness = max(normalLength, minThickness * u_sqrtZoomRatio);\\n  float webGLThickness = pixelsThickness * u_correctionRatio;\\n  float adaptedWebGLThickness = webGLThickness * u_sqrtZoomRatio;\\n\\n  // Here, we move the point to leave space for the arrow head:\\n  float direction = sign(a_radius);\\n  float adaptedWebGLNodeRadius = direction * a_radius * 2.0 * u_correctionRatio * u_sqrtZoomRatio;\\n  float adaptedWebGLArrowHeadLength = adaptedWebGLThickness * 2.0 * arrowHeadLengthThicknessRatio;\\n\\n  vec2 compensationVector = vec2(-direction * unitNormal.y, direction * unitNormal.x) * (adaptedWebGLNodeRadius + adaptedWebGLArrowHeadLength);\\n\\n  // Here is the proper position of the vertex\\n  gl_Position = vec4((u_matrix * vec3(a_position + unitNormal * adaptedWebGLThickness + compensationVector, 1)).xy, 0, 1);\\n\\n  v_thickness = webGLThickness / u_sqrtZoomRatio;\\n\\n  v_normal = unitNormal;\\n  v_color = a_color;\\n  v_color.a *= bias;\\n}\\n\";module.exports=o})();","(()=>{\"use strict\";var e={d:(n,t)=>{for(var o in t)e.o(t,o)&&!e.o(n,o)&&Object.defineProperty(n,o,{enumerable:!0,get:t[o]})},o:(e,n)=>Object.prototype.hasOwnProperty.call(e,n),r:e=>{\"undefined\"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:\"Module\"}),Object.defineProperty(e,\"__esModule\",{value:!0})}},n={};e.r(n),e.d(n,{default:()=>t});const t=\"precision mediump float;\\n\\nvarying vec4 v_color;\\nvarying vec2 v_normal;\\nvarying float v_thickness;\\n\\nconst float feather = 0.001;\\nconst vec4 transparent = vec4(0.0, 0.0, 0.0, 0.0);\\n\\nvoid main(void) {\\n  float dist = length(v_normal) * v_thickness;\\n\\n  float t = smoothstep(\\n    v_thickness - feather,\\n    v_thickness,\\n    dist\\n  );\\n\\n  gl_FragColor = mix(v_color, transparent, t);\\n}\\n\";module.exports=n})();","(()=>{\"use strict\";var e={d:(n,o)=>{for(var t in o)e.o(o,t)&&!e.o(n,t)&&Object.defineProperty(n,t,{enumerable:!0,get:o[t]})},o:(e,n)=>Object.prototype.hasOwnProperty.call(e,n),r:e=>{\"undefined\"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:\"Module\"}),Object.defineProperty(e,\"__esModule\",{value:!0})}},n={};e.r(n),e.d(n,{default:()=>o});const o='attribute vec4 a_color;\\nattribute vec2 a_normal;\\nattribute vec2 a_position;\\n\\nuniform mat3 u_matrix;\\nuniform float u_sqrtZoomRatio;\\nuniform float u_correctionRatio;\\n\\nvarying vec4 v_color;\\nvarying vec2 v_normal;\\nvarying float v_thickness;\\n\\nconst float minThickness = 1.7;\\nconst float bias = 255.0 / 254.0;\\n\\nvoid main() {\\n  float normalLength = length(a_normal);\\n  vec2 unitNormal = a_normal / normalLength;\\n\\n  // We require edges to be at least `minThickness` pixels thick *on screen*\\n  // (so we need to compensate the SQRT zoom ratio):\\n  float pixelsThickness = max(normalLength, minThickness * u_sqrtZoomRatio);\\n\\n  // Then, we need to retrieve the normalized thickness of the edge in the WebGL\\n  // referential (in a ([0, 1], [0, 1]) space), using our \"magic\" correction\\n  // ratio:\\n  float webGLThickness = pixelsThickness * u_correctionRatio;\\n\\n  // Finally, we adapt the edge thickness to the \"SQRT rule\" in sigma (so that\\n  // items are not too big when zoomed in, and not too small when zoomed out).\\n  // The exact computation should be `adapted = value * zoom / sqrt(zoom)`, but\\n  // it\\'s simpler like this:\\n  float adaptedWebGLThickness = webGLThickness * u_sqrtZoomRatio;\\n\\n  // Here is the proper position of the vertex\\n  gl_Position = vec4((u_matrix * vec3(a_position + unitNormal * adaptedWebGLThickness, 1)).xy, 0, 1);\\n\\n  // For the fragment shader though, we need a thickness that takes the \"magic\"\\n  // correction ratio into account (as in webGLThickness), but so that the\\n  // antialiasing effect does not depend on the zoom level. So here\\'s yet\\n  // another thickness version:\\n  v_thickness = webGLThickness / u_sqrtZoomRatio;\\n\\n  v_normal = unitNormal;\\n  v_color = a_color;\\n  v_color.a *= bias;\\n}\\n';module.exports=n})();","(()=>{\"use strict\";var e={d:(n,o)=>{for(var t in o)e.o(o,t)&&!e.o(n,t)&&Object.defineProperty(n,t,{enumerable:!0,get:o[t]})},o:(e,n)=>Object.prototype.hasOwnProperty.call(e,n),r:e=>{\"undefined\"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:\"Module\"}),Object.defineProperty(e,\"__esModule\",{value:!0})}},n={};e.r(n),e.d(n,{default:()=>o});const o=\"precision mediump float;\\n\\nvarying vec4 v_color;\\nvarying float v_border;\\n\\nconst float radius = 0.5;\\nconst vec4 transparent = vec4(0.0, 0.0, 0.0, 0.0);\\n\\nvoid main(void) {\\n  vec2 m = gl_PointCoord - vec2(0.5, 0.5);\\n  float dist = radius - length(m);\\n\\n  float t = 0.0;\\n  if (dist > v_border)\\n    t = 1.0;\\n  else if (dist > 0.0)\\n    t = dist / v_border;\\n\\n  gl_FragColor = mix(transparent, v_color, t);\\n}\\n\";module.exports=n})();","(()=>{\"use strict\";var o={d:(t,e)=>{for(var n in e)o.o(e,n)&&!o.o(t,n)&&Object.defineProperty(t,n,{enumerable:!0,get:e[n]})},o:(o,t)=>Object.prototype.hasOwnProperty.call(o,t),r:o=>{\"undefined\"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(o,Symbol.toStringTag,{value:\"Module\"}),Object.defineProperty(o,\"__esModule\",{value:!0})}},t={};o.r(t),o.d(t,{default:()=>e});const e=\"attribute vec2 a_position;\\nattribute float a_size;\\nattribute vec4 a_color;\\n\\nuniform float u_ratio;\\nuniform float u_scale;\\nuniform mat3 u_matrix;\\n\\nvarying vec4 v_color;\\nvarying float v_border;\\n\\nconst float bias = 255.0 / 254.0;\\n\\nvoid main() {\\n  gl_Position = vec4(\\n    (u_matrix * vec3(a_position, 1)).xy,\\n    0,\\n    1\\n  );\\n\\n  // Multiply the point size twice:\\n  //  - x SCALING_RATIO to correct the canvas scaling\\n  //  - x 2 to correct the formulae\\n  gl_PointSize = a_size * u_ratio * u_scale * 2.0;\\n\\n  v_border = (1.0 / u_ratio) * (0.5 / a_size);\\n\\n  // Extract the color:\\n  v_color = a_color;\\n  v_color.a *= bias;\\n}\\n\";module.exports=t})();","\"use strict\";\n/**\n * Sigma.js Shader Utils\n * ======================\n *\n * Code used to load sigma's shaders.\n * @module\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.loadProgram = exports.loadFragmentShader = exports.loadVertexShader = void 0;\n/**\n * Function used to load a shader.\n */\nfunction loadShader(type, gl, source) {\n    var glType = type === \"VERTEX\" ? gl.VERTEX_SHADER : gl.FRAGMENT_SHADER;\n    // Creating the shader\n    var shader = gl.createShader(glType);\n    if (shader === null) {\n        throw new Error(\"loadShader: error while creating the shader\");\n    }\n    // Loading source\n    gl.shaderSource(shader, source);\n    // Compiling the shader\n    gl.compileShader(shader);\n    // Retrieving compilation status\n    var successfullyCompiled = gl.getShaderParameter(shader, gl.COMPILE_STATUS);\n    // Throwing if something went awry\n    if (!successfullyCompiled) {\n        var infoLog = gl.getShaderInfoLog(shader);\n        gl.deleteShader(shader);\n        throw new Error(\"loadShader: error while compiling the shader:\\n\".concat(infoLog, \"\\n\").concat(source));\n    }\n    return shader;\n}\nfunction loadVertexShader(gl, source) {\n    return loadShader(\"VERTEX\", gl, source);\n}\nexports.loadVertexShader = loadVertexShader;\nfunction loadFragmentShader(gl, source) {\n    return loadShader(\"FRAGMENT\", gl, source);\n}\nexports.loadFragmentShader = loadFragmentShader;\n/**\n * Function used to load a program.\n */\nfunction loadProgram(gl, shaders) {\n    var program = gl.createProgram();\n    if (program === null) {\n        throw new Error(\"loadProgram: error while creating the program.\");\n    }\n    var i, l;\n    // Attaching the shaders\n    for (i = 0, l = shaders.length; i < l; i++)\n        gl.attachShader(program, shaders[i]);\n    gl.linkProgram(program);\n    // Checking status\n    var successfullyLinked = gl.getProgramParameter(program, gl.LINK_STATUS);\n    if (!successfullyLinked) {\n        gl.deleteProgram(program);\n        throw new Error(\"loadProgram: error while linking the program.\");\n    }\n    return program;\n}\nexports.loadProgram = loadProgram;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.resolveSettings = exports.validateSettings = exports.DEFAULT_EDGE_PROGRAM_CLASSES = exports.DEFAULT_NODE_PROGRAM_CLASSES = exports.DEFAULT_SETTINGS = void 0;\nvar utils_1 = require(\"./utils\");\nvar label_1 = __importDefault(require(\"./rendering/canvas/label\"));\nvar hover_1 = __importDefault(require(\"./rendering/canvas/hover\"));\nvar edge_label_1 = __importDefault(require(\"./rendering/canvas/edge-label\"));\nvar node_fast_1 = __importDefault(require(\"./rendering/webgl/programs/node.fast\"));\nvar edge_1 = __importDefault(require(\"./rendering/webgl/programs/edge\"));\nvar edge_arrow_1 = __importDefault(require(\"./rendering/webgl/programs/edge.arrow\"));\nexports.DEFAULT_SETTINGS = {\n    // Performance\n    hideEdgesOnMove: false,\n    hideLabelsOnMove: false,\n    renderLabels: true,\n    renderEdgeLabels: false,\n    enableEdgeClickEvents: false,\n    enableEdgeWheelEvents: false,\n    enableEdgeHoverEvents: false,\n    // Component rendering\n    defaultNodeColor: \"#999\",\n    defaultNodeType: \"circle\",\n    defaultEdgeColor: \"#ccc\",\n    defaultEdgeType: \"line\",\n    labelFont: \"Arial\",\n    labelSize: 14,\n    labelWeight: \"normal\",\n    labelColor: { color: \"#000\" },\n    edgeLabelFont: \"Arial\",\n    edgeLabelSize: 14,\n    edgeLabelWeight: \"normal\",\n    edgeLabelColor: { attribute: \"color\" },\n    stagePadding: 30,\n    // Labels\n    labelDensity: 1,\n    labelGridCellSize: 100,\n    labelRenderedSizeThreshold: 6,\n    // Reducers\n    nodeReducer: null,\n    edgeReducer: null,\n    // Features\n    zIndex: false,\n    minCameraRatio: null,\n    maxCameraRatio: null,\n    // Renderers\n    labelRenderer: label_1.default,\n    hoverRenderer: hover_1.default,\n    edgeLabelRenderer: edge_label_1.default,\n    // Lifecycle\n    allowInvalidContainer: false,\n    // Program classes\n    nodeProgramClasses: {},\n    nodeHoverProgramClasses: {},\n    edgeProgramClasses: {},\n};\nexports.DEFAULT_NODE_PROGRAM_CLASSES = {\n    circle: node_fast_1.default,\n};\nexports.DEFAULT_EDGE_PROGRAM_CLASSES = {\n    arrow: edge_arrow_1.default,\n    line: edge_1.default,\n};\nfunction validateSettings(settings) {\n    if (typeof settings.labelDensity !== \"number\" || settings.labelDensity < 0) {\n        throw new Error(\"Settings: invalid `labelDensity`. Expecting a positive number.\");\n    }\n    var minCameraRatio = settings.minCameraRatio, maxCameraRatio = settings.maxCameraRatio;\n    if (typeof minCameraRatio === \"number\" && typeof maxCameraRatio === \"number\" && maxCameraRatio < minCameraRatio) {\n        throw new Error(\"Settings: invalid camera ratio boundaries. Expecting `maxCameraRatio` to be greater than `minCameraRatio`.\");\n    }\n}\nexports.validateSettings = validateSettings;\nfunction resolveSettings(settings) {\n    var resolvedSettings = (0, utils_1.assign)({}, exports.DEFAULT_SETTINGS, settings);\n    resolvedSettings.nodeProgramClasses = (0, utils_1.assign)({}, exports.DEFAULT_NODE_PROGRAM_CLASSES, resolvedSettings.nodeProgramClasses);\n    resolvedSettings.edgeProgramClasses = (0, utils_1.assign)({}, exports.DEFAULT_EDGE_PROGRAM_CLASSES, resolvedSettings.edgeProgramClasses);\n    return resolvedSettings;\n}\nexports.resolveSettings = resolveSettings;\n","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        if (typeof b !== \"function\" && b !== null)\n            throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nvar __assign = (this && this.__assign) || function () {\n    __assign = Object.assign || function(t) {\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\n            s = arguments[i];\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))\n                t[p] = s[p];\n        }\n        return t;\n    };\n    return __assign.apply(this, arguments);\n};\nvar __values = (this && this.__values) || function(o) {\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n    if (m) return m.call(o);\n    if (o && typeof o.length === \"number\") return {\n        next: function () {\n            if (o && i >= o.length) o = void 0;\n            return { value: o && o[i++], done: !o };\n        }\n    };\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar extend_1 = __importDefault(require(\"@yomguithereal/helpers/extend\"));\nvar camera_1 = __importDefault(require(\"./core/camera\"));\nvar mouse_1 = __importDefault(require(\"./core/captors/mouse\"));\nvar quadtree_1 = __importDefault(require(\"./core/quadtree\"));\nvar types_1 = require(\"./types\");\nvar utils_1 = require(\"./utils\");\nvar labels_1 = require(\"./core/labels\");\nvar settings_1 = require(\"./settings\");\nvar touch_1 = __importDefault(require(\"./core/captors/touch\"));\nvar matrices_1 = require(\"./utils/matrices\");\nvar edge_collisions_1 = require(\"./utils/edge-collisions\");\n/**\n * Constants.\n */\nvar X_LABEL_MARGIN = 150;\nvar Y_LABEL_MARGIN = 50;\n/**\n * Important functions.\n */\nfunction applyNodeDefaults(settings, key, data) {\n    if (!data.hasOwnProperty(\"x\") || !data.hasOwnProperty(\"y\"))\n        throw new Error(\"Sigma: could not find a valid position (x, y) for node \\\"\".concat(key, \"\\\". All your nodes must have a number \\\"x\\\" and \\\"y\\\". Maybe your forgot to apply a layout or your \\\"nodeReducer\\\" is not returning the correct data?\"));\n    if (!data.color)\n        data.color = settings.defaultNodeColor;\n    if (!data.label && data.label !== \"\")\n        data.label = null;\n    if (data.label !== undefined && data.label !== null)\n        data.label = \"\" + data.label;\n    else\n        data.label = null;\n    if (!data.size)\n        data.size = 2;\n    if (!data.hasOwnProperty(\"hidden\"))\n        data.hidden = false;\n    if (!data.hasOwnProperty(\"highlighted\"))\n        data.highlighted = false;\n    if (!data.hasOwnProperty(\"forceLabel\"))\n        data.forceLabel = false;\n    if (!data.type || data.type === \"\")\n        data.type = settings.defaultNodeType;\n    if (!data.zIndex)\n        data.zIndex = 0;\n    return data;\n}\nfunction applyEdgeDefaults(settings, key, data) {\n    if (!data.color)\n        data.color = settings.defaultEdgeColor;\n    if (!data.label)\n        data.label = \"\";\n    if (!data.size)\n        data.size = 0.5;\n    if (!data.hasOwnProperty(\"hidden\"))\n        data.hidden = false;\n    if (!data.hasOwnProperty(\"forceLabel\"))\n        data.forceLabel = false;\n    if (!data.type || data.type === \"\")\n        data.type = settings.defaultEdgeType;\n    if (!data.zIndex)\n        data.zIndex = 0;\n    return data;\n}\n/**\n * Main class.\n *\n * @constructor\n * @param {Graph}       graph     - Graph to render.\n * @param {HTMLElement} container - DOM container in which to render.\n * @param {object}      settings  - Optional settings.\n */\nvar Sigma = /** @class */ (function (_super) {\n    __extends(Sigma, _super);\n    function Sigma(graph, container, settings) {\n        if (settings === void 0) { settings = {}; }\n        var _this = _super.call(this) || this;\n        _this.elements = {};\n        _this.canvasContexts = {};\n        _this.webGLContexts = {};\n        _this.activeListeners = {};\n        _this.quadtree = new quadtree_1.default();\n        _this.labelGrid = new labels_1.LabelGrid();\n        _this.nodeDataCache = {};\n        _this.edgeDataCache = {};\n        _this.nodesWithForcedLabels = [];\n        _this.edgesWithForcedLabels = [];\n        _this.nodeExtent = { x: [0, 1], y: [0, 1] };\n        _this.matrix = (0, matrices_1.identity)();\n        _this.invMatrix = (0, matrices_1.identity)();\n        _this.correctionRatio = 1;\n        _this.customBBox = null;\n        _this.normalizationFunction = (0, utils_1.createNormalizationFunction)({\n            x: [0, 1],\n            y: [0, 1],\n        });\n        // Cache:\n        _this.cameraSizeRatio = 1;\n        // Starting dimensions and pixel ratio\n        _this.width = 0;\n        _this.height = 0;\n        _this.pixelRatio = (0, utils_1.getPixelRatio)();\n        // State\n        _this.displayedLabels = new Set();\n        _this.highlightedNodes = new Set();\n        _this.hoveredNode = null;\n        _this.hoveredEdge = null;\n        _this.renderFrame = null;\n        _this.renderHighlightedNodesFrame = null;\n        _this.needToProcess = false;\n        _this.needToSoftProcess = false;\n        _this.checkEdgesEventsFrame = null;\n        // Programs\n        _this.nodePrograms = {};\n        _this.nodeHoverPrograms = {};\n        _this.edgePrograms = {};\n        // Resolving settings\n        _this.settings = (0, settings_1.resolveSettings)(settings);\n        // Validating\n        (0, settings_1.validateSettings)(_this.settings);\n        (0, utils_1.validateGraph)(graph);\n        if (!(container instanceof HTMLElement))\n            throw new Error(\"Sigma: container should be an html element.\");\n        // Properties\n        _this.graph = graph;\n        _this.container = container;\n        // Initializing contexts\n        _this.createWebGLContext(\"edges\", { preserveDrawingBuffer: true });\n        _this.createCanvasContext(\"edgeLabels\");\n        _this.createWebGLContext(\"nodes\");\n        _this.createCanvasContext(\"labels\");\n        _this.createCanvasContext(\"hovers\");\n        _this.createWebGLContext(\"hoverNodes\");\n        _this.createCanvasContext(\"mouse\");\n        // Blending\n        for (var key in _this.webGLContexts) {\n            var gl = _this.webGLContexts[key];\n            gl.blendFunc(gl.ONE, gl.ONE_MINUS_SRC_ALPHA);\n            gl.enable(gl.BLEND);\n        }\n        // Loading programs\n        for (var type in _this.settings.nodeProgramClasses) {\n            var NodeProgramClass = _this.settings.nodeProgramClasses[type];\n            _this.nodePrograms[type] = new NodeProgramClass(_this.webGLContexts.nodes, _this);\n            var NodeHoverProgram = NodeProgramClass;\n            if (type in _this.settings.nodeHoverProgramClasses) {\n                NodeHoverProgram = _this.settings.nodeHoverProgramClasses[type];\n            }\n            _this.nodeHoverPrograms[type] = new NodeHoverProgram(_this.webGLContexts.hoverNodes, _this);\n        }\n        for (var type in _this.settings.edgeProgramClasses) {\n            var EdgeProgramClass = _this.settings.edgeProgramClasses[type];\n            _this.edgePrograms[type] = new EdgeProgramClass(_this.webGLContexts.edges, _this);\n        }\n        // Initial resize\n        _this.resize();\n        // Initializing the camera\n        _this.camera = new camera_1.default();\n        // Binding camera events\n        _this.bindCameraHandlers();\n        // Initializing captors\n        _this.mouseCaptor = new mouse_1.default(_this.elements.mouse, _this);\n        _this.touchCaptor = new touch_1.default(_this.elements.mouse, _this);\n        // Binding event handlers\n        _this.bindEventHandlers();\n        // Binding graph handlers\n        _this.bindGraphHandlers();\n        // Trigger eventual settings-related things\n        _this.handleSettingsUpdate();\n        // Processing data for the first time & render\n        _this.process();\n        _this.render();\n        return _this;\n    }\n    /**---------------------------------------------------------------------------\n     * Internal methods.\n     **---------------------------------------------------------------------------\n     */\n    /**\n     * Internal function used to create a canvas element.\n     * @param  {string} id - Context's id.\n     * @return {Sigma}\n     */\n    Sigma.prototype.createCanvas = function (id) {\n        var canvas = (0, utils_1.createElement)(\"canvas\", {\n            position: \"absolute\",\n        }, {\n            class: \"sigma-\".concat(id),\n        });\n        this.elements[id] = canvas;\n        this.container.appendChild(canvas);\n        return canvas;\n    };\n    /**\n     * Internal function used to create a canvas context and add the relevant\n     * DOM elements.\n     *\n     * @param  {string} id - Context's id.\n     * @return {Sigma}\n     */\n    Sigma.prototype.createCanvasContext = function (id) {\n        var canvas = this.createCanvas(id);\n        var contextOptions = {\n            preserveDrawingBuffer: false,\n            antialias: false,\n        };\n        this.canvasContexts[id] = canvas.getContext(\"2d\", contextOptions);\n        return this;\n    };\n    /**\n     * Internal function used to create a canvas context and add the relevant\n     * DOM elements.\n     *\n     * @param  {string}  id      - Context's id.\n     * @param  {object?} options - #getContext params to override (optional)\n     * @return {Sigma}\n     */\n    Sigma.prototype.createWebGLContext = function (id, options) {\n        var canvas = this.createCanvas(id);\n        var contextOptions = __assign({ preserveDrawingBuffer: false, antialias: false }, (options || {}));\n        var context;\n        // First we try webgl2 for an easy performance boost\n        context = canvas.getContext(\"webgl2\", contextOptions);\n        // Else we fall back to webgl\n        if (!context)\n            context = canvas.getContext(\"webgl\", contextOptions);\n        // Edge, I am looking right at you...\n        if (!context)\n            context = canvas.getContext(\"experimental-webgl\", contextOptions);\n        this.webGLContexts[id] = context;\n        return this;\n    };\n    /**\n     * Method binding camera handlers.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype.bindCameraHandlers = function () {\n        var _this = this;\n        this.activeListeners.camera = function () {\n            _this._scheduleRefresh();\n        };\n        this.camera.on(\"updated\", this.activeListeners.camera);\n        return this;\n    };\n    /**\n     * Method that checks whether or not a node collides with a given position.\n     */\n    Sigma.prototype.mouseIsOnNode = function (_a, _b, size) {\n        var x = _a.x, y = _a.y;\n        var nodeX = _b.x, nodeY = _b.y;\n        return (x > nodeX - size &&\n            x < nodeX + size &&\n            y > nodeY - size &&\n            y < nodeY + size &&\n            Math.sqrt(Math.pow(x - nodeX, 2) + Math.pow(y - nodeY, 2)) < size);\n    };\n    /**\n     * Method that returns all nodes in quad at a given position.\n     */\n    Sigma.prototype.getQuadNodes = function (position) {\n        var mouseGraphPosition = this.viewportToFramedGraph(position);\n        return this.quadtree.point(mouseGraphPosition.x, 1 - mouseGraphPosition.y);\n    };\n    /**\n     * Method that returns the closest node to a given position.\n     */\n    Sigma.prototype.getNodeAtPosition = function (position) {\n        var x = position.x, y = position.y;\n        var quadNodes = this.getQuadNodes(position);\n        // We will hover the node whose center is closest to mouse\n        var minDistance = Infinity, nodeAtPosition = null;\n        for (var i = 0, l = quadNodes.length; i < l; i++) {\n            var node = quadNodes[i];\n            var data = this.nodeDataCache[node];\n            var nodePosition = this.framedGraphToViewport(data);\n            var size = this.scaleSize(data.size);\n            if (!data.hidden && this.mouseIsOnNode(position, nodePosition, size)) {\n                var distance = Math.sqrt(Math.pow(x - nodePosition.x, 2) + Math.pow(y - nodePosition.y, 2));\n                // TODO: sort by min size also for cases where center is the same\n                if (distance < minDistance) {\n                    minDistance = distance;\n                    nodeAtPosition = node;\n                }\n            }\n        }\n        return nodeAtPosition;\n    };\n    /**\n     * Method binding event handlers.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype.bindEventHandlers = function () {\n        var _this = this;\n        // Handling window resize\n        this.activeListeners.handleResize = function () {\n            _this.needToSoftProcess = true;\n            _this._scheduleRefresh();\n        };\n        window.addEventListener(\"resize\", this.activeListeners.handleResize);\n        // Handling mouse move\n        this.activeListeners.handleMove = function (e) {\n            var baseEvent = {\n                event: e,\n                preventSigmaDefault: function () {\n                    e.preventSigmaDefault();\n                },\n            };\n            var nodeToHover = _this.getNodeAtPosition(e);\n            if (nodeToHover && _this.hoveredNode !== nodeToHover && !_this.nodeDataCache[nodeToHover].hidden) {\n                // Handling passing from one node to the other directly\n                if (_this.hoveredNode)\n                    _this.emit(\"leaveNode\", __assign(__assign({}, baseEvent), { node: _this.hoveredNode }));\n                _this.hoveredNode = nodeToHover;\n                _this.emit(\"enterNode\", __assign(__assign({}, baseEvent), { node: nodeToHover }));\n                _this.scheduleHighlightedNodesRender();\n                return;\n            }\n            // Checking if the hovered node is still hovered\n            if (_this.hoveredNode) {\n                var data = _this.nodeDataCache[_this.hoveredNode];\n                var pos = _this.framedGraphToViewport(data);\n                var size = _this.scaleSize(data.size);\n                if (!_this.mouseIsOnNode(e, pos, size)) {\n                    var node = _this.hoveredNode;\n                    _this.hoveredNode = null;\n                    _this.emit(\"leaveNode\", __assign(__assign({}, baseEvent), { node: node }));\n                    _this.scheduleHighlightedNodesRender();\n                    return;\n                }\n            }\n            if (_this.settings.enableEdgeHoverEvents === true) {\n                _this.checkEdgeHoverEvents(baseEvent);\n            }\n            else if (_this.settings.enableEdgeHoverEvents === \"debounce\") {\n                if (!_this.checkEdgesEventsFrame)\n                    _this.checkEdgesEventsFrame = (0, utils_1.requestFrame)(function () {\n                        _this.checkEdgeHoverEvents(baseEvent);\n                        _this.checkEdgesEventsFrame = null;\n                    });\n            }\n        };\n        // Handling click\n        var createMouseListener = function (eventType) {\n            return function (e) {\n                var baseEvent = {\n                    event: e,\n                    preventSigmaDefault: function () {\n                        e.preventSigmaDefault();\n                    },\n                };\n                var isFakeSigmaMouseEvent = e.original.isFakeSigmaMouseEvent;\n                var nodeAtPosition = isFakeSigmaMouseEvent ? _this.getNodeAtPosition(e) : _this.hoveredNode;\n                if (nodeAtPosition)\n                    return _this.emit(\"\".concat(eventType, \"Node\"), __assign(__assign({}, baseEvent), { node: nodeAtPosition }));\n                if (eventType === \"wheel\" ? _this.settings.enableEdgeWheelEvents : _this.settings.enableEdgeClickEvents) {\n                    var edge = _this.getEdgeAtPoint(e.x, e.y);\n                    if (edge)\n                        return _this.emit(\"\".concat(eventType, \"Edge\"), __assign(__assign({}, baseEvent), { edge: edge }));\n                }\n                return _this.emit(\"\".concat(eventType, \"Stage\"), baseEvent);\n            };\n        };\n        this.activeListeners.handleClick = createMouseListener(\"click\");\n        this.activeListeners.handleRightClick = createMouseListener(\"rightClick\");\n        this.activeListeners.handleDoubleClick = createMouseListener(\"doubleClick\");\n        this.activeListeners.handleWheel = createMouseListener(\"wheel\");\n        this.activeListeners.handleDown = createMouseListener(\"down\");\n        this.mouseCaptor.on(\"mousemove\", this.activeListeners.handleMove);\n        this.mouseCaptor.on(\"click\", this.activeListeners.handleClick);\n        this.mouseCaptor.on(\"rightClick\", this.activeListeners.handleRightClick);\n        this.mouseCaptor.on(\"doubleClick\", this.activeListeners.handleDoubleClick);\n        this.mouseCaptor.on(\"wheel\", this.activeListeners.handleWheel);\n        this.mouseCaptor.on(\"mousedown\", this.activeListeners.handleDown);\n        // TODO\n        // Deal with Touch captor events\n        return this;\n    };\n    /**\n     * Method binding graph handlers\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype.bindGraphHandlers = function () {\n        var _this = this;\n        var graph = this.graph;\n        this.activeListeners.graphUpdate = function () {\n            _this.needToProcess = true;\n            _this._scheduleRefresh();\n        };\n        this.activeListeners.softGraphUpdate = function () {\n            _this.needToSoftProcess = true;\n            _this._scheduleRefresh();\n        };\n        this.activeListeners.dropNodeGraphUpdate = function (e) {\n            delete _this.nodeDataCache[e.key];\n            if (_this.hoveredNode === e.key)\n                _this.hoveredNode = null;\n            _this.activeListeners.graphUpdate();\n        };\n        this.activeListeners.dropEdgeGraphUpdate = function (e) {\n            delete _this.edgeDataCache[e.key];\n            if (_this.hoveredEdge === e.key)\n                _this.hoveredEdge = null;\n            _this.activeListeners.graphUpdate();\n        };\n        this.activeListeners.clearEdgesGraphUpdate = function () {\n            _this.edgeDataCache = {};\n            _this.hoveredEdge = null;\n            _this.activeListeners.graphUpdate();\n        };\n        this.activeListeners.clearGraphUpdate = function () {\n            _this.nodeDataCache = {};\n            _this.hoveredNode = null;\n            _this.activeListeners.clearEdgesGraphUpdate();\n        };\n        graph.on(\"nodeAdded\", this.activeListeners.graphUpdate);\n        graph.on(\"nodeDropped\", this.activeListeners.dropNodeGraphUpdate);\n        graph.on(\"nodeAttributesUpdated\", this.activeListeners.softGraphUpdate);\n        graph.on(\"eachNodeAttributesUpdated\", this.activeListeners.graphUpdate);\n        graph.on(\"edgeAdded\", this.activeListeners.graphUpdate);\n        graph.on(\"edgeDropped\", this.activeListeners.dropEdgeGraphUpdate);\n        graph.on(\"edgeAttributesUpdated\", this.activeListeners.softGraphUpdate);\n        graph.on(\"eachEdgeAttributesUpdated\", this.activeListeners.graphUpdate);\n        graph.on(\"edgesCleared\", this.activeListeners.clearEdgesGraphUpdate);\n        graph.on(\"cleared\", this.activeListeners.clearGraphUpdate);\n        return this;\n    };\n    /**\n     * Method used to unbind handlers from the graph.\n     *\n     * @return {undefined}\n     */\n    Sigma.prototype.unbindGraphHandlers = function () {\n        var graph = this.graph;\n        graph.removeListener(\"nodeAdded\", this.activeListeners.graphUpdate);\n        graph.removeListener(\"nodeDropped\", this.activeListeners.dropNodeGraphUpdate);\n        graph.removeListener(\"nodeAttributesUpdated\", this.activeListeners.softGraphUpdate);\n        graph.removeListener(\"eachNodeAttributesUpdated\", this.activeListeners.graphUpdate);\n        graph.removeListener(\"edgeAdded\", this.activeListeners.graphUpdate);\n        graph.removeListener(\"edgeDropped\", this.activeListeners.dropEdgeGraphUpdate);\n        graph.removeListener(\"edgeAttributesUpdated\", this.activeListeners.softGraphUpdate);\n        graph.removeListener(\"eachEdgeAttributesUpdated\", this.activeListeners.graphUpdate);\n        graph.removeListener(\"edgesCleared\", this.activeListeners.clearEdgesGraphUpdate);\n        graph.removeListener(\"cleared\", this.activeListeners.clearGraphUpdate);\n    };\n    /**\n     * Method dealing with \"leaveEdge\" and \"enterEdge\" events.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype.checkEdgeHoverEvents = function (payload) {\n        var edgeToHover = this.hoveredNode ? null : this.getEdgeAtPoint(payload.event.x, payload.event.y);\n        if (edgeToHover !== this.hoveredEdge) {\n            if (this.hoveredEdge)\n                this.emit(\"leaveEdge\", __assign(__assign({}, payload), { edge: this.hoveredEdge }));\n            if (edgeToHover)\n                this.emit(\"enterEdge\", __assign(__assign({}, payload), { edge: edgeToHover }));\n            this.hoveredEdge = edgeToHover;\n        }\n        return this;\n    };\n    /**\n     * Method looking for an edge colliding with a given point at (x, y). Returns\n     * the key of the edge if any, or null else.\n     */\n    Sigma.prototype.getEdgeAtPoint = function (x, y) {\n        var e_1, _a;\n        var _this = this;\n        var _b = this, edgeDataCache = _b.edgeDataCache, nodeDataCache = _b.nodeDataCache;\n        // Check first that pixel is colored:\n        // Note that mouse positions must be corrected by pixel ratio to correctly\n        // index the drawing buffer.\n        if (!(0, edge_collisions_1.isPixelColored)(this.webGLContexts.edges, x * this.pixelRatio, y * this.pixelRatio))\n            return null;\n        // Check for each edge if it collides with the point:\n        var _c = this.viewportToGraph({ x: x, y: y }), graphX = _c.x, graphY = _c.y;\n        // To translate edge thicknesses to the graph system, we observe by how much\n        // the length of a non-null edge is transformed to between the graph system\n        // and the viewport system:\n        var transformationRatio = 0;\n        this.graph.someEdge(function (key, _, sourceId, targetId, _a, _b) {\n            var xs = _a.x, ys = _a.y;\n            var xt = _b.x, yt = _b.y;\n            if (edgeDataCache[key].hidden || nodeDataCache[sourceId].hidden || nodeDataCache[targetId].hidden)\n                return false;\n            if (xs !== xt || ys !== yt) {\n                var graphLength = Math.sqrt(Math.pow(xt - xs, 2) + Math.pow(yt - ys, 2));\n                var _c = _this.graphToViewport({ x: xs, y: ys }), vp_xs = _c.x, vp_ys = _c.y;\n                var _d = _this.graphToViewport({ x: xt, y: yt }), vp_xt = _d.x, vp_yt = _d.y;\n                var viewportLength = Math.sqrt(Math.pow(vp_xt - vp_xs, 2) + Math.pow(vp_yt - vp_ys, 2));\n                transformationRatio = graphLength / viewportLength;\n                return true;\n            }\n        });\n        // If no non-null edge has been found, return null:\n        if (!transformationRatio)\n            return null;\n        // Now we can look for matching edges:\n        var edges = this.graph.filterEdges(function (key, edgeAttributes, sourceId, targetId, sourcePosition, targetPosition) {\n            if (edgeDataCache[key].hidden || nodeDataCache[sourceId].hidden || nodeDataCache[targetId].hidden)\n                return false;\n            if ((0, edge_collisions_1.doEdgeCollideWithPoint)(graphX, graphY, sourcePosition.x, sourcePosition.y, targetPosition.x, targetPosition.y, \n            // Adapt the edge size to the zoom ratio:\n            (edgeDataCache[key].size * transformationRatio) / _this.cameraSizeRatio)) {\n                return true;\n            }\n        });\n        if (edges.length === 0)\n            return null; // no edges found\n        // if none of the edges have a zIndex, selected the most recently created one to match the rendering order\n        var selectedEdge = edges[edges.length - 1];\n        // otherwise select edge with highest zIndex\n        var highestZIndex = -Infinity;\n        try {\n            for (var edges_1 = __values(edges), edges_1_1 = edges_1.next(); !edges_1_1.done; edges_1_1 = edges_1.next()) {\n                var edge = edges_1_1.value;\n                var zIndex = this.graph.getEdgeAttribute(edge, \"zIndex\");\n                if (zIndex >= highestZIndex) {\n                    selectedEdge = edge;\n                    highestZIndex = zIndex;\n                }\n            }\n        }\n        catch (e_1_1) { e_1 = { error: e_1_1 }; }\n        finally {\n            try {\n                if (edges_1_1 && !edges_1_1.done && (_a = edges_1.return)) _a.call(edges_1);\n            }\n            finally { if (e_1) throw e_1.error; }\n        }\n        return selectedEdge;\n    };\n    /**\n     * Method used to process the whole graph's data.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype.process = function (keepArrays) {\n        var _this = this;\n        if (keepArrays === void 0) { keepArrays = false; }\n        var graph = this.graph;\n        var settings = this.settings;\n        var dimensions = this.getDimensions();\n        var nodeZExtent = [Infinity, -Infinity];\n        var edgeZExtent = [Infinity, -Infinity];\n        // Clearing the quad\n        this.quadtree.clear();\n        // Resetting the label grid\n        // TODO: it's probably better to do this explicitly or on resizes for layout and anims\n        this.labelGrid.resizeAndClear(dimensions, settings.labelGridCellSize);\n        // Clear the highlightedNodes\n        this.highlightedNodes = new Set();\n        // Computing extents\n        this.nodeExtent = (0, utils_1.graphExtent)(graph);\n        // Resetting `forceLabel` indices\n        this.nodesWithForcedLabels = [];\n        this.edgesWithForcedLabels = [];\n        // NOTE: it is important to compute this matrix after computing the node's extent\n        // because #.getGraphDimensions relies on it\n        var nullCamera = new camera_1.default();\n        var nullCameraMatrix = (0, utils_1.matrixFromCamera)(nullCamera.getState(), this.getDimensions(), this.getGraphDimensions(), this.getSetting(\"stagePadding\") || 0);\n        // Rescaling function\n        this.normalizationFunction = (0, utils_1.createNormalizationFunction)(this.customBBox || this.nodeExtent);\n        var nodesPerPrograms = {};\n        var nodes = graph.nodes();\n        for (var i = 0, l = nodes.length; i < l; i++) {\n            var node = nodes[i];\n            // Node display data resolution:\n            //   1. First we get the node's attributes\n            //   2. We optionally reduce them using the function provided by the user\n            //      Note that this function must return a total object and won't be merged\n            //   3. We apply our defaults, while running some vital checks\n            //   4. We apply the normalization function\n            // We shallow copy node data to avoid dangerous behaviors from reducers\n            var attr = Object.assign({}, graph.getNodeAttributes(node));\n            if (settings.nodeReducer)\n                attr = settings.nodeReducer(node, attr);\n            var data = applyNodeDefaults(this.settings, node, attr);\n            nodesPerPrograms[data.type] = (nodesPerPrograms[data.type] || 0) + 1;\n            this.nodeDataCache[node] = data;\n            this.normalizationFunction.applyTo(data);\n            if (data.forceLabel)\n                this.nodesWithForcedLabels.push(node);\n            if (this.settings.zIndex) {\n                if (data.zIndex < nodeZExtent[0])\n                    nodeZExtent[0] = data.zIndex;\n                if (data.zIndex > nodeZExtent[1])\n                    nodeZExtent[1] = data.zIndex;\n            }\n        }\n        for (var type in this.nodePrograms) {\n            if (!this.nodePrograms.hasOwnProperty(type)) {\n                throw new Error(\"Sigma: could not find a suitable program for node type \\\"\".concat(type, \"\\\"!\"));\n            }\n            if (!keepArrays)\n                this.nodePrograms[type].allocate(nodesPerPrograms[type] || 0);\n            // We reset that count here, so that we can reuse it while calling the Program#process methods:\n            nodesPerPrograms[type] = 0;\n        }\n        // Handling node z-index\n        // TODO: z-index needs us to compute display data before hand\n        if (this.settings.zIndex && nodeZExtent[0] !== nodeZExtent[1])\n            nodes = (0, utils_1.zIndexOrdering)(nodeZExtent, function (node) { return _this.nodeDataCache[node].zIndex; }, nodes);\n        for (var i = 0, l = nodes.length; i < l; i++) {\n            var node = nodes[i];\n            var data = this.nodeDataCache[node];\n            this.quadtree.add(node, data.x, 1 - data.y, data.size / this.width);\n            if (typeof data.label === \"string\" && !data.hidden)\n                this.labelGrid.add(node, data.size, this.framedGraphToViewport(data, { matrix: nullCameraMatrix }));\n            var nodeProgram = this.nodePrograms[data.type];\n            if (!nodeProgram)\n                throw new Error(\"Sigma: could not find a suitable program for node type \\\"\".concat(data.type, \"\\\"!\"));\n            nodeProgram.process(data, data.hidden, nodesPerPrograms[data.type]++);\n            // Save the node in the highlighted set if needed\n            if (data.highlighted && !data.hidden)\n                this.highlightedNodes.add(node);\n        }\n        this.labelGrid.organize();\n        var edgesPerPrograms = {};\n        var edges = graph.edges();\n        for (var i = 0, l = edges.length; i < l; i++) {\n            var edge = edges[i];\n            // Edge display data resolution:\n            //   1. First we get the edge's attributes\n            //   2. We optionally reduce them using the function provided by the user\n            //      Note that this function must return a total object and won't be merged\n            //   3. We apply our defaults, while running some vital checks\n            // We shallow copy edge data to avoid dangerous behaviors from reducers\n            var attr = Object.assign({}, graph.getEdgeAttributes(edge));\n            if (settings.edgeReducer)\n                attr = settings.edgeReducer(edge, attr);\n            var data = applyEdgeDefaults(this.settings, edge, attr);\n            edgesPerPrograms[data.type] = (edgesPerPrograms[data.type] || 0) + 1;\n            this.edgeDataCache[edge] = data;\n            if (data.forceLabel && !data.hidden)\n                this.edgesWithForcedLabels.push(edge);\n            if (this.settings.zIndex) {\n                if (data.zIndex < edgeZExtent[0])\n                    edgeZExtent[0] = data.zIndex;\n                if (data.zIndex > edgeZExtent[1])\n                    edgeZExtent[1] = data.zIndex;\n            }\n        }\n        for (var type in this.edgePrograms) {\n            if (!this.edgePrograms.hasOwnProperty(type)) {\n                throw new Error(\"Sigma: could not find a suitable program for edge type \\\"\".concat(type, \"\\\"!\"));\n            }\n            if (!keepArrays)\n                this.edgePrograms[type].allocate(edgesPerPrograms[type] || 0);\n            // We reset that count here, so that we can reuse it while calling the Program#process methods:\n            edgesPerPrograms[type] = 0;\n        }\n        // Handling edge z-index\n        if (this.settings.zIndex && edgeZExtent[0] !== edgeZExtent[1])\n            edges = (0, utils_1.zIndexOrdering)(edgeZExtent, function (edge) { return _this.edgeDataCache[edge].zIndex; }, edges);\n        for (var i = 0, l = edges.length; i < l; i++) {\n            var edge = edges[i];\n            var data = this.edgeDataCache[edge];\n            var extremities = graph.extremities(edge), sourceData = this.nodeDataCache[extremities[0]], targetData = this.nodeDataCache[extremities[1]];\n            var hidden = data.hidden || sourceData.hidden || targetData.hidden;\n            this.edgePrograms[data.type].process(sourceData, targetData, data, hidden, edgesPerPrograms[data.type]++);\n        }\n        for (var type in this.edgePrograms) {\n            var program = this.edgePrograms[type];\n            if (!keepArrays && typeof program.computeIndices === \"function\")\n                program.computeIndices();\n        }\n        return this;\n    };\n    /**\n     * Method that backports potential settings updates where it's needed.\n     * @private\n     */\n    Sigma.prototype.handleSettingsUpdate = function () {\n        this.camera.minRatio = this.settings.minCameraRatio;\n        this.camera.maxRatio = this.settings.maxCameraRatio;\n        this.camera.setState(this.camera.validateState(this.camera.getState()));\n        return this;\n    };\n    /**\n     * Method that decides whether to reprocess graph or not, and then render the\n     * graph.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype._refresh = function () {\n        // Do we need to process data?\n        if (this.needToProcess) {\n            this.process();\n        }\n        else if (this.needToSoftProcess) {\n            this.process(true);\n        }\n        // Resetting state\n        this.needToProcess = false;\n        this.needToSoftProcess = false;\n        // Rendering\n        this.render();\n        return this;\n    };\n    /**\n     * Method that schedules a `_refresh` call if none has been scheduled yet. It\n     * will then be processed next available frame.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype._scheduleRefresh = function () {\n        var _this = this;\n        if (!this.renderFrame) {\n            this.renderFrame = (0, utils_1.requestFrame)(function () {\n                _this._refresh();\n                _this.renderFrame = null;\n            });\n        }\n        return this;\n    };\n    /**\n     * Method used to render labels.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype.renderLabels = function () {\n        if (!this.settings.renderLabels)\n            return this;\n        var cameraState = this.camera.getState();\n        // Selecting labels to draw\n        var labelsToDisplay = this.labelGrid.getLabelsToDisplay(cameraState.ratio, this.settings.labelDensity);\n        (0, extend_1.default)(labelsToDisplay, this.nodesWithForcedLabels);\n        this.displayedLabels = new Set();\n        // Drawing labels\n        var context = this.canvasContexts.labels;\n        for (var i = 0, l = labelsToDisplay.length; i < l; i++) {\n            var node = labelsToDisplay[i];\n            var data = this.nodeDataCache[node];\n            // If the node was already drawn (like if it is eligible AND has\n            // `forceLabel`), we don't want to draw it again\n            // NOTE: we can do better probably\n            if (this.displayedLabels.has(node))\n                continue;\n            // If the node is hidden, we don't need to display its label obviously\n            if (data.hidden)\n                continue;\n            var _a = this.framedGraphToViewport(data), x = _a.x, y = _a.y;\n            // NOTE: we can cache the labels we need to render until the camera's ratio changes\n            var size = this.scaleSize(data.size);\n            // Is node big enough?\n            if (!data.forceLabel && size < this.settings.labelRenderedSizeThreshold)\n                continue;\n            // Is node actually on screen (with some margin)\n            // NOTE: we used to rely on the quadtree for this, but the coordinates\n            // conversion make it unreliable and at that point we already converted\n            // to viewport coordinates and since the label grid already culls the\n            // number of potential labels to display this looks like a good\n            // performance compromise.\n            // NOTE: labelGrid.getLabelsToDisplay could probably optimize by not\n            // considering cells obviously outside of the range of the current\n            // view rectangle.\n            if (x < -X_LABEL_MARGIN ||\n                x > this.width + X_LABEL_MARGIN ||\n                y < -Y_LABEL_MARGIN ||\n                y > this.height + Y_LABEL_MARGIN)\n                continue;\n            // Because displayed edge labels depend directly on actually rendered node\n            // labels, we need to only add to this.displayedLabels nodes whose label\n            // is rendered.\n            // This makes this.displayedLabels depend on viewport, which might become\n            // an issue once we start memoizing getLabelsToDisplay.\n            this.displayedLabels.add(node);\n            this.settings.labelRenderer(context, __assign(__assign({ key: node }, data), { size: size, x: x, y: y }), this.settings);\n        }\n        return this;\n    };\n    /**\n     * Method used to render edge labels, based on which node labels were\n     * rendered.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype.renderEdgeLabels = function () {\n        if (!this.settings.renderEdgeLabels)\n            return this;\n        var context = this.canvasContexts.edgeLabels;\n        // Clearing\n        context.clearRect(0, 0, this.width, this.height);\n        var edgeLabelsToDisplay = (0, labels_1.edgeLabelsToDisplayFromNodes)({\n            graph: this.graph,\n            hoveredNode: this.hoveredNode,\n            displayedNodeLabels: this.displayedLabels,\n            highlightedNodes: this.highlightedNodes,\n        }).concat(this.edgesWithForcedLabels);\n        var displayedLabels = new Set();\n        for (var i = 0, l = edgeLabelsToDisplay.length; i < l; i++) {\n            var edge = edgeLabelsToDisplay[i], extremities = this.graph.extremities(edge), sourceData = this.nodeDataCache[extremities[0]], targetData = this.nodeDataCache[extremities[1]], edgeData = this.edgeDataCache[edge];\n            // If the edge was already drawn (like if it is eligible AND has\n            // `forceLabel`), we don't want to draw it again\n            if (displayedLabels.has(edge))\n                continue;\n            // If the edge is hidden we don't need to display its label\n            // NOTE: the test on sourceData & targetData is probably paranoid at this point?\n            if (edgeData.hidden || sourceData.hidden || targetData.hidden) {\n                continue;\n            }\n            this.settings.edgeLabelRenderer(context, __assign(__assign({ key: edge }, edgeData), { size: this.scaleSize(edgeData.size) }), __assign(__assign(__assign({ key: extremities[0] }, sourceData), this.framedGraphToViewport(sourceData)), { size: this.scaleSize(sourceData.size) }), __assign(__assign(__assign({ key: extremities[1] }, targetData), this.framedGraphToViewport(targetData)), { size: this.scaleSize(targetData.size) }), this.settings);\n            displayedLabels.add(edge);\n        }\n        return this;\n    };\n    /**\n     * Method used to render the highlighted nodes.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype.renderHighlightedNodes = function () {\n        var _this = this;\n        var context = this.canvasContexts.hovers;\n        // Clearing\n        context.clearRect(0, 0, this.width, this.height);\n        // Rendering\n        var render = function (node) {\n            var data = _this.nodeDataCache[node];\n            var _a = _this.framedGraphToViewport(data), x = _a.x, y = _a.y;\n            var size = _this.scaleSize(data.size);\n            _this.settings.hoverRenderer(context, __assign(__assign({ key: node }, data), { size: size, x: x, y: y }), _this.settings);\n        };\n        var nodesToRender = [];\n        if (this.hoveredNode && !this.nodeDataCache[this.hoveredNode].hidden) {\n            nodesToRender.push(this.hoveredNode);\n        }\n        this.highlightedNodes.forEach(function (node) {\n            // The hovered node has already been highlighted\n            if (node !== _this.hoveredNode)\n                nodesToRender.push(node);\n        });\n        // Draw labels:\n        nodesToRender.forEach(function (node) { return render(node); });\n        // Draw WebGL nodes on top of the labels:\n        var nodesPerPrograms = {};\n        // 1. Count nodes per type:\n        nodesToRender.forEach(function (node) {\n            var type = _this.nodeDataCache[node].type;\n            nodesPerPrograms[type] = (nodesPerPrograms[type] || 0) + 1;\n        });\n        // 2. Allocate for each type for the proper number of nodes\n        for (var type in this.nodeHoverPrograms) {\n            this.nodeHoverPrograms[type].allocate(nodesPerPrograms[type] || 0);\n            // Also reset count, to use when rendering:\n            nodesPerPrograms[type] = 0;\n        }\n        // 3. Process all nodes to render:\n        nodesToRender.forEach(function (node) {\n            var data = _this.nodeDataCache[node];\n            _this.nodeHoverPrograms[data.type].process(data, data.hidden, nodesPerPrograms[data.type]++);\n        });\n        // 4. Clear hovered nodes layer:\n        this.webGLContexts.hoverNodes.clear(this.webGLContexts.hoverNodes.COLOR_BUFFER_BIT);\n        // 5. Render:\n        for (var type in this.nodeHoverPrograms) {\n            var program = this.nodeHoverPrograms[type];\n            program.bind();\n            program.bufferData();\n            program.render({\n                matrix: this.matrix,\n                width: this.width,\n                height: this.height,\n                ratio: this.camera.ratio,\n                correctionRatio: this.correctionRatio / this.camera.ratio,\n                scalingRatio: this.pixelRatio,\n            });\n        }\n    };\n    /**\n     * Method used to schedule a hover render.\n     *\n     */\n    Sigma.prototype.scheduleHighlightedNodesRender = function () {\n        var _this = this;\n        if (this.renderHighlightedNodesFrame || this.renderFrame)\n            return;\n        this.renderHighlightedNodesFrame = (0, utils_1.requestFrame)(function () {\n            // Resetting state\n            _this.renderHighlightedNodesFrame = null;\n            // Rendering\n            _this.renderHighlightedNodes();\n            _this.renderEdgeLabels();\n        });\n    };\n    /**\n     * Method used to render.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype.render = function () {\n        var _this = this;\n        this.emit(\"beforeRender\");\n        var exitRender = function () {\n            _this.emit(\"afterRender\");\n            return _this;\n        };\n        // If a render was scheduled, we cancel it\n        if (this.renderFrame) {\n            (0, utils_1.cancelFrame)(this.renderFrame);\n            this.renderFrame = null;\n            this.needToProcess = false;\n            this.needToSoftProcess = false;\n        }\n        // First we need to resize\n        this.resize();\n        // Clearing the canvases\n        this.clear();\n        // Recomputing useful camera-related values:\n        this.updateCachedValues();\n        // If we have no nodes we can stop right there\n        if (!this.graph.order)\n            return exitRender();\n        // TODO: improve this heuristic or move to the captor itself?\n        // TODO: deal with the touch captor here as well\n        var mouseCaptor = this.mouseCaptor;\n        var moving = this.camera.isAnimated() ||\n            mouseCaptor.isMoving ||\n            mouseCaptor.draggedEvents ||\n            mouseCaptor.currentWheelDirection;\n        // Then we need to extract a matrix from the camera\n        var cameraState = this.camera.getState();\n        var viewportDimensions = this.getDimensions();\n        var graphDimensions = this.getGraphDimensions();\n        var padding = this.getSetting(\"stagePadding\") || 0;\n        this.matrix = (0, utils_1.matrixFromCamera)(cameraState, viewportDimensions, graphDimensions, padding);\n        this.invMatrix = (0, utils_1.matrixFromCamera)(cameraState, viewportDimensions, graphDimensions, padding, true);\n        this.correctionRatio = (0, utils_1.getMatrixImpact)(this.matrix, cameraState, viewportDimensions);\n        // Drawing nodes\n        for (var type in this.nodePrograms) {\n            var program = this.nodePrograms[type];\n            program.bind();\n            program.bufferData();\n            program.render({\n                matrix: this.matrix,\n                width: this.width,\n                height: this.height,\n                ratio: cameraState.ratio,\n                correctionRatio: this.correctionRatio / cameraState.ratio,\n                scalingRatio: this.pixelRatio,\n            });\n        }\n        // Drawing edges\n        if (!this.settings.hideEdgesOnMove || !moving) {\n            for (var type in this.edgePrograms) {\n                var program = this.edgePrograms[type];\n                program.bind();\n                program.bufferData();\n                program.render({\n                    matrix: this.matrix,\n                    width: this.width,\n                    height: this.height,\n                    ratio: cameraState.ratio,\n                    correctionRatio: this.correctionRatio / cameraState.ratio,\n                    scalingRatio: this.pixelRatio,\n                });\n            }\n        }\n        // Do not display labels on move per setting\n        if (this.settings.hideLabelsOnMove && moving)\n            return exitRender();\n        this.renderLabels();\n        this.renderEdgeLabels();\n        this.renderHighlightedNodes();\n        return exitRender();\n    };\n    /**\n     * Internal method used to update expensive and therefore cached values\n     * each time the camera state is updated.\n     */\n    Sigma.prototype.updateCachedValues = function () {\n        var ratio = this.camera.getState().ratio;\n        this.cameraSizeRatio = Math.sqrt(ratio);\n    };\n    /**---------------------------------------------------------------------------\n     * Public API.\n     **---------------------------------------------------------------------------\n     */\n    /**\n     * Method returning the renderer's camera.\n     *\n     * @return {Camera}\n     */\n    Sigma.prototype.getCamera = function () {\n        return this.camera;\n    };\n    /**\n     * Method returning the container DOM element.\n     *\n     * @return {HTMLElement}\n     */\n    Sigma.prototype.getContainer = function () {\n        return this.container;\n    };\n    /**\n     * Method returning the renderer's graph.\n     *\n     * @return {Graph}\n     */\n    Sigma.prototype.getGraph = function () {\n        return this.graph;\n    };\n    /**\n     * Method used to set the renderer's graph.\n     *\n     * @return {Graph}\n     */\n    Sigma.prototype.setGraph = function (graph) {\n        if (graph === this.graph)\n            return;\n        // Unbinding handlers on the current graph\n        this.unbindGraphHandlers();\n        // Clearing the graph data caches\n        this.nodeDataCache = {};\n        this.edgeDataCache = {};\n        // Cleaning renderer state tied to the current graph\n        this.displayedLabels.clear();\n        this.highlightedNodes.clear();\n        this.hoveredNode = null;\n        this.hoveredEdge = null;\n        this.nodesWithForcedLabels.length = 0;\n        this.edgesWithForcedLabels.length = 0;\n        if (this.checkEdgesEventsFrame !== null) {\n            (0, utils_1.cancelFrame)(this.checkEdgesEventsFrame);\n            this.checkEdgesEventsFrame = null;\n        }\n        // Installing new graph\n        this.graph = graph;\n        // Binding new handlers\n        this.bindGraphHandlers();\n        // Re-rendering now to avoid discrepancies from now to next frame\n        this.process();\n        this.render();\n    };\n    /**\n     * Method returning the mouse captor.\n     *\n     * @return {MouseCaptor}\n     */\n    Sigma.prototype.getMouseCaptor = function () {\n        return this.mouseCaptor;\n    };\n    /**\n     * Method returning the touch captor.\n     *\n     * @return {TouchCaptor}\n     */\n    Sigma.prototype.getTouchCaptor = function () {\n        return this.touchCaptor;\n    };\n    /**\n     * Method returning the current renderer's dimensions.\n     *\n     * @return {Dimensions}\n     */\n    Sigma.prototype.getDimensions = function () {\n        return { width: this.width, height: this.height };\n    };\n    /**\n     * Method returning the current graph's dimensions.\n     *\n     * @return {Dimensions}\n     */\n    Sigma.prototype.getGraphDimensions = function () {\n        var extent = this.customBBox || this.nodeExtent;\n        return {\n            width: extent.x[1] - extent.x[0] || 1,\n            height: extent.y[1] - extent.y[0] || 1,\n        };\n    };\n    /**\n     * Method used to get all the sigma node attributes.\n     * It's usefull for example to get the position of a node\n     * and to get values that are set by the nodeReducer\n     *\n     * @param  {string} key - The node's key.\n     * @return {NodeDisplayData | undefined} A copy of the desired node's attribute or undefined if not found\n     */\n    Sigma.prototype.getNodeDisplayData = function (key) {\n        var node = this.nodeDataCache[key];\n        return node ? Object.assign({}, node) : undefined;\n    };\n    /**\n     * Method used to get all the sigma edge attributes.\n     * It's usefull for example to get values that are set by the edgeReducer.\n     *\n     * @param  {string} key - The edge's key.\n     * @return {EdgeDisplayData | undefined} A copy of the desired edge's attribute or undefined if not found\n     */\n    Sigma.prototype.getEdgeDisplayData = function (key) {\n        var edge = this.edgeDataCache[key];\n        return edge ? Object.assign({}, edge) : undefined;\n    };\n    /**\n     * Method returning a copy of the settings collection.\n     *\n     * @return {Settings} A copy of the settings collection.\n     */\n    Sigma.prototype.getSettings = function () {\n        return __assign({}, this.settings);\n    };\n    /**\n     * Method returning the current value for a given setting key.\n     *\n     * @param  {string} key - The setting key to get.\n     * @return {any} The value attached to this setting key or undefined if not found\n     */\n    Sigma.prototype.getSetting = function (key) {\n        return this.settings[key];\n    };\n    /**\n     * Method setting the value of a given setting key. Note that this will schedule\n     * a new render next frame.\n     *\n     * @param  {string} key - The setting key to set.\n     * @param  {any}    value - The value to set.\n     * @return {Sigma}\n     */\n    Sigma.prototype.setSetting = function (key, value) {\n        this.settings[key] = value;\n        (0, settings_1.validateSettings)(this.settings);\n        this.handleSettingsUpdate();\n        this.needToProcess = true; // TODO: some keys may work with only needToSoftProcess or even nothing\n        this._scheduleRefresh();\n        return this;\n    };\n    /**\n     * Method updating the value of a given setting key using the provided function.\n     * Note that this will schedule a new render next frame.\n     *\n     * @param  {string}   key     - The setting key to set.\n     * @param  {function} updater - The update function.\n     * @return {Sigma}\n     */\n    Sigma.prototype.updateSetting = function (key, updater) {\n        this.settings[key] = updater(this.settings[key]);\n        (0, settings_1.validateSettings)(this.settings);\n        this.handleSettingsUpdate();\n        this.needToProcess = true; // TODO: some keys may work with only needToSoftProcess or even nothing\n        this._scheduleRefresh();\n        return this;\n    };\n    /**\n     * Method used to resize the renderer.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype.resize = function () {\n        var previousWidth = this.width, previousHeight = this.height;\n        this.width = this.container.offsetWidth;\n        this.height = this.container.offsetHeight;\n        this.pixelRatio = (0, utils_1.getPixelRatio)();\n        if (this.width === 0) {\n            if (this.settings.allowInvalidContainer)\n                this.width = 1;\n            else\n                throw new Error(\"Sigma: Container has no width. You can set the allowInvalidContainer setting to true to stop seeing this error.\");\n        }\n        if (this.height === 0) {\n            if (this.settings.allowInvalidContainer)\n                this.height = 1;\n            else\n                throw new Error(\"Sigma: Container has no height. You can set the allowInvalidContainer setting to true to stop seeing this error.\");\n        }\n        // If nothing has changed, we can stop right here\n        if (previousWidth === this.width && previousHeight === this.height)\n            return this;\n        this.emit(\"resize\");\n        // Sizing dom elements\n        for (var id in this.elements) {\n            var element = this.elements[id];\n            element.style.width = this.width + \"px\";\n            element.style.height = this.height + \"px\";\n        }\n        // Sizing canvas contexts\n        for (var id in this.canvasContexts) {\n            this.elements[id].setAttribute(\"width\", this.width * this.pixelRatio + \"px\");\n            this.elements[id].setAttribute(\"height\", this.height * this.pixelRatio + \"px\");\n            if (this.pixelRatio !== 1)\n                this.canvasContexts[id].scale(this.pixelRatio, this.pixelRatio);\n        }\n        // Sizing WebGL contexts\n        for (var id in this.webGLContexts) {\n            this.elements[id].setAttribute(\"width\", this.width * this.pixelRatio + \"px\");\n            this.elements[id].setAttribute(\"height\", this.height * this.pixelRatio + \"px\");\n            this.webGLContexts[id].viewport(0, 0, this.width * this.pixelRatio, this.height * this.pixelRatio);\n        }\n        return this;\n    };\n    /**\n     * Method used to clear all the canvases.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype.clear = function () {\n        this.webGLContexts.nodes.clear(this.webGLContexts.nodes.COLOR_BUFFER_BIT);\n        this.webGLContexts.edges.clear(this.webGLContexts.edges.COLOR_BUFFER_BIT);\n        this.webGLContexts.hoverNodes.clear(this.webGLContexts.hoverNodes.COLOR_BUFFER_BIT);\n        this.canvasContexts.labels.clearRect(0, 0, this.width, this.height);\n        this.canvasContexts.hovers.clearRect(0, 0, this.width, this.height);\n        this.canvasContexts.edgeLabels.clearRect(0, 0, this.width, this.height);\n        return this;\n    };\n    /**\n     * Method used to refresh all computed data.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype.refresh = function () {\n        this.needToProcess = true;\n        this._refresh();\n        return this;\n    };\n    /**\n     * Method used to refresh all computed data, at the next available frame.\n     * If this method has already been called this frame, then it will only render once at the next available frame.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype.scheduleRefresh = function () {\n        this.needToProcess = true;\n        this._scheduleRefresh();\n        return this;\n    };\n    /**\n     * Method used to (un)zoom, while preserving the position of a viewport point.\n     * Used for instance to zoom \"on the mouse cursor\".\n     *\n     * @param viewportTarget\n     * @param newRatio\n     * @return {CameraState}\n     */\n    Sigma.prototype.getViewportZoomedState = function (viewportTarget, newRatio) {\n        var _a = this.camera.getState(), ratio = _a.ratio, angle = _a.angle, x = _a.x, y = _a.y;\n        // TODO: handle max zoom\n        var ratioDiff = newRatio / ratio;\n        var center = {\n            x: this.width / 2,\n            y: this.height / 2,\n        };\n        var graphMousePosition = this.viewportToFramedGraph(viewportTarget);\n        var graphCenterPosition = this.viewportToFramedGraph(center);\n        return {\n            angle: angle,\n            x: (graphMousePosition.x - graphCenterPosition.x) * (1 - ratioDiff) + x,\n            y: (graphMousePosition.y - graphCenterPosition.y) * (1 - ratioDiff) + y,\n            ratio: newRatio,\n        };\n    };\n    /**\n     * Method returning the abstract rectangle containing the graph according\n     * to the camera's state.\n     *\n     * @return {object} - The view's rectangle.\n     */\n    Sigma.prototype.viewRectangle = function () {\n        // TODO: reduce relative margin?\n        var marginX = (0 * this.width) / 8, marginY = (0 * this.height) / 8;\n        var p1 = this.viewportToFramedGraph({ x: 0 - marginX, y: 0 - marginY }), p2 = this.viewportToFramedGraph({ x: this.width + marginX, y: 0 - marginY }), h = this.viewportToFramedGraph({ x: 0, y: this.height + marginY });\n        return {\n            x1: p1.x,\n            y1: p1.y,\n            x2: p2.x,\n            y2: p2.y,\n            height: p2.y - h.y,\n        };\n    };\n    /**\n     * Method returning the coordinates of a point from the framed graph system to the viewport system. It allows\n     * overriding anything that is used to get the translation matrix, or even the matrix itself.\n     *\n     * Be careful if overriding dimensions, padding or cameraState, as the computation of the matrix is not the lightest\n     * of computations.\n     */\n    Sigma.prototype.framedGraphToViewport = function (coordinates, override) {\n        if (override === void 0) { override = {}; }\n        var recomputeMatrix = !!override.cameraState || !!override.viewportDimensions || !!override.graphDimensions;\n        var matrix = override.matrix\n            ? override.matrix\n            : recomputeMatrix\n                ? (0, utils_1.matrixFromCamera)(override.cameraState || this.camera.getState(), override.viewportDimensions || this.getDimensions(), override.graphDimensions || this.getGraphDimensions(), override.padding || this.getSetting(\"stagePadding\") || 0)\n                : this.matrix;\n        var viewportPos = (0, matrices_1.multiplyVec2)(matrix, coordinates);\n        return {\n            x: ((1 + viewportPos.x) * this.width) / 2,\n            y: ((1 - viewportPos.y) * this.height) / 2,\n        };\n    };\n    /**\n     * Method returning the coordinates of a point from the viewport system to the framed graph system. It allows\n     * overriding anything that is used to get the translation matrix, or even the matrix itself.\n     *\n     * Be careful if overriding dimensions, padding or cameraState, as the computation of the matrix is not the lightest\n     * of computations.\n     */\n    Sigma.prototype.viewportToFramedGraph = function (coordinates, override) {\n        if (override === void 0) { override = {}; }\n        var recomputeMatrix = !!override.cameraState || !!override.viewportDimensions || !override.graphDimensions;\n        var invMatrix = override.matrix\n            ? override.matrix\n            : recomputeMatrix\n                ? (0, utils_1.matrixFromCamera)(override.cameraState || this.camera.getState(), override.viewportDimensions || this.getDimensions(), override.graphDimensions || this.getGraphDimensions(), override.padding || this.getSetting(\"stagePadding\") || 0, true)\n                : this.invMatrix;\n        var res = (0, matrices_1.multiplyVec2)(invMatrix, {\n            x: (coordinates.x / this.width) * 2 - 1,\n            y: 1 - (coordinates.y / this.height) * 2,\n        });\n        if (isNaN(res.x))\n            res.x = 0;\n        if (isNaN(res.y))\n            res.y = 0;\n        return res;\n    };\n    /**\n     * Method used to translate a point's coordinates from the viewport system (pixel distance from the top-left of the\n     * stage) to the graph system (the reference system of data as they are in the given graph instance).\n     *\n     * This method accepts an optional camera which can be useful if you need to translate coordinates\n     * based on a different view than the one being currently being displayed on screen.\n     *\n     * @param {Coordinates}                  viewportPoint\n     * @param {CoordinateConversionOverride} override\n     */\n    Sigma.prototype.viewportToGraph = function (viewportPoint, override) {\n        if (override === void 0) { override = {}; }\n        return this.normalizationFunction.inverse(this.viewportToFramedGraph(viewportPoint, override));\n    };\n    /**\n     * Method used to translate a point's coordinates from the graph system (the reference system of data as they are in\n     * the given graph instance) to the viewport system (pixel distance from the top-left of the stage).\n     *\n     * This method accepts an optional camera which can be useful if you need to translate coordinates\n     * based on a different view than the one being currently being displayed on screen.\n     *\n     * @param {Coordinates}                  graphPoint\n     * @param {CoordinateConversionOverride} override\n     */\n    Sigma.prototype.graphToViewport = function (graphPoint, override) {\n        if (override === void 0) { override = {}; }\n        return this.framedGraphToViewport(this.normalizationFunction(graphPoint), override);\n    };\n    /**\n     * Method returning the graph's bounding box.\n     *\n     * @return {{ x: Extent, y: Extent }}\n     */\n    Sigma.prototype.getBBox = function () {\n        return (0, utils_1.graphExtent)(this.graph);\n    };\n    /**\n     * Method returning the graph's custom bounding box, if any.\n     *\n     * @return {{ x: Extent, y: Extent } | null}\n     */\n    Sigma.prototype.getCustomBBox = function () {\n        return this.customBBox;\n    };\n    /**\n     * Method used to override the graph's bounding box with a custom one. Give `null` as the argument to stop overriding.\n     *\n     * @return {Sigma}\n     */\n    Sigma.prototype.setCustomBBox = function (customBBox) {\n        this.customBBox = customBBox;\n        this._scheduleRefresh();\n        return this;\n    };\n    /**\n     * Method used to shut the container & release event listeners.\n     *\n     * @return {undefined}\n     */\n    Sigma.prototype.kill = function () {\n        // Emitting \"kill\" events so that plugins and such can cleanup\n        this.emit(\"kill\");\n        // Releasing events\n        this.removeAllListeners();\n        // Releasing camera handlers\n        this.camera.removeListener(\"updated\", this.activeListeners.camera);\n        // Releasing DOM events & captors\n        window.removeEventListener(\"resize\", this.activeListeners.handleResize);\n        this.mouseCaptor.kill();\n        this.touchCaptor.kill();\n        // Releasing graph handlers\n        this.unbindGraphHandlers();\n        // Releasing cache & state\n        this.quadtree = new quadtree_1.default();\n        this.nodeDataCache = {};\n        this.edgeDataCache = {};\n        this.nodesWithForcedLabels = [];\n        this.edgesWithForcedLabels = [];\n        this.highlightedNodes.clear();\n        // Clearing frames\n        if (this.renderFrame) {\n            (0, utils_1.cancelFrame)(this.renderFrame);\n            this.renderFrame = null;\n        }\n        if (this.renderHighlightedNodesFrame) {\n            (0, utils_1.cancelFrame)(this.renderHighlightedNodesFrame);\n            this.renderHighlightedNodesFrame = null;\n        }\n        // Destroying canvases\n        var container = this.container;\n        while (container.firstChild)\n            container.removeChild(container.firstChild);\n    };\n    /**\n     * Method used to scale the given size according to the camera's ratio, i.e.\n     * zooming state.\n     *\n     * @param  {number} size - The size to scale (node size, edge thickness etc.).\n     * @return {number}      - The scaled size.\n     */\n    Sigma.prototype.scaleSize = function (size) {\n        return size / this.cameraSizeRatio;\n    };\n    /**\n     * Method that returns the collection of all used canvases.\n     * At the moment, the instantiated canvases are the following, and in the\n     * following order in the DOM:\n     * - `edges`\n     * - `nodes`\n     * - `edgeLabels`\n     * - `labels`\n     * - `hovers`\n     * - `hoverNodes`\n     * - `mouse`\n     *\n     * @return {PlainObject<HTMLCanvasElement>} - The collection of canvases.\n     */\n    Sigma.prototype.getCanvases = function () {\n        return __assign({}, this.elements);\n    };\n    return Sigma;\n}(types_1.TypedEventEmitter));\nexports.default = Sigma;\n","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        if (typeof b !== \"function\" && b !== null)\n            throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TypedEventEmitter = void 0;\n/**\n * Sigma.js Types\n * ===============\n *\n * Various type declarations used throughout the library.\n * @module\n */\nvar events_1 = require(\"events\");\nvar TypedEventEmitter = /** @class */ (function (_super) {\n    __extends(TypedEventEmitter, _super);\n    function TypedEventEmitter() {\n        var _this = _super.call(this) || this;\n        _this.rawEmitter = _this;\n        return _this;\n    }\n    return TypedEventEmitter;\n}(events_1.EventEmitter));\nexports.TypedEventEmitter = TypedEventEmitter;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.animateNodes = exports.ANIMATE_DEFAULTS = void 0;\nvar index_1 = require(\"./index\");\nvar easings_1 = __importDefault(require(\"./easings\"));\nexports.ANIMATE_DEFAULTS = {\n    easing: \"quadraticInOut\",\n    duration: 150,\n};\n/**\n * Function used to animate the nodes.\n */\nfunction animateNodes(graph, targets, opts, callback) {\n    var options = Object.assign({}, exports.ANIMATE_DEFAULTS, opts);\n    var easing = typeof options.easing === \"function\" ? options.easing : easings_1.default[options.easing];\n    var start = Date.now();\n    var startPositions = {};\n    for (var node in targets) {\n        var attrs = targets[node];\n        startPositions[node] = {};\n        for (var k in attrs)\n            startPositions[node][k] = graph.getNodeAttribute(node, k);\n    }\n    var frame = null;\n    var step = function () {\n        frame = null;\n        var p = (Date.now() - start) / options.duration;\n        if (p >= 1) {\n            // Animation is done\n            for (var node in targets) {\n                var attrs = targets[node];\n                // We use given values to avoid precision issues and for convenience\n                for (var k in attrs)\n                    graph.setNodeAttribute(node, k, attrs[k]);\n            }\n            if (typeof callback === \"function\")\n                callback();\n            return;\n        }\n        p = easing(p);\n        for (var node in targets) {\n            var attrs = targets[node];\n            var s = startPositions[node];\n            for (var k in attrs)\n                graph.setNodeAttribute(node, k, attrs[k] * p + s[k] * (1 - p));\n        }\n        frame = (0, index_1.requestFrame)(step);\n    };\n    step();\n    return function () {\n        if (frame)\n            (0, index_1.cancelFrame)(frame);\n    };\n}\nexports.animateNodes = animateNodes;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.HTML_COLORS = void 0;\nexports.HTML_COLORS = {\n    black: \"#000000\",\n    silver: \"#C0C0C0\",\n    gray: \"#808080\",\n    grey: \"#808080\",\n    white: \"#FFFFFF\",\n    maroon: \"#800000\",\n    red: \"#FF0000\",\n    purple: \"#800080\",\n    fuchsia: \"#FF00FF\",\n    green: \"#008000\",\n    lime: \"#00FF00\",\n    olive: \"#808000\",\n    yellow: \"#FFFF00\",\n    navy: \"#000080\",\n    blue: \"#0000FF\",\n    teal: \"#008080\",\n    aqua: \"#00FFFF\",\n    darkblue: \"#00008B\",\n    mediumblue: \"#0000CD\",\n    darkgreen: \"#006400\",\n    darkcyan: \"#008B8B\",\n    deepskyblue: \"#00BFFF\",\n    darkturquoise: \"#00CED1\",\n    mediumspringgreen: \"#00FA9A\",\n    springgreen: \"#00FF7F\",\n    cyan: \"#00FFFF\",\n    midnightblue: \"#191970\",\n    dodgerblue: \"#1E90FF\",\n    lightseagreen: \"#20B2AA\",\n    forestgreen: \"#228B22\",\n    seagreen: \"#2E8B57\",\n    darkslategray: \"#2F4F4F\",\n    darkslategrey: \"#2F4F4F\",\n    limegreen: \"#32CD32\",\n    mediumseagreen: \"#3CB371\",\n    turquoise: \"#40E0D0\",\n    royalblue: \"#4169E1\",\n    steelblue: \"#4682B4\",\n    darkslateblue: \"#483D8B\",\n    mediumturquoise: \"#48D1CC\",\n    indigo: \"#4B0082\",\n    darkolivegreen: \"#556B2F\",\n    cadetblue: \"#5F9EA0\",\n    cornflowerblue: \"#6495ED\",\n    rebeccapurple: \"#663399\",\n    mediumaquamarine: \"#66CDAA\",\n    dimgray: \"#696969\",\n    dimgrey: \"#696969\",\n    slateblue: \"#6A5ACD\",\n    olivedrab: \"#6B8E23\",\n    slategray: \"#708090\",\n    slategrey: \"#708090\",\n    lightslategray: \"#778899\",\n    lightslategrey: \"#778899\",\n    mediumslateblue: \"#7B68EE\",\n    lawngreen: \"#7CFC00\",\n    chartreuse: \"#7FFF00\",\n    aquamarine: \"#7FFFD4\",\n    skyblue: \"#87CEEB\",\n    lightskyblue: \"#87CEFA\",\n    blueviolet: \"#8A2BE2\",\n    darkred: \"#8B0000\",\n    darkmagenta: \"#8B008B\",\n    saddlebrown: \"#8B4513\",\n    darkseagreen: \"#8FBC8F\",\n    lightgreen: \"#90EE90\",\n    mediumpurple: \"#9370DB\",\n    darkviolet: \"#9400D3\",\n    palegreen: \"#98FB98\",\n    darkorchid: \"#9932CC\",\n    yellowgreen: \"#9ACD32\",\n    sienna: \"#A0522D\",\n    brown: \"#A52A2A\",\n    darkgray: \"#A9A9A9\",\n    darkgrey: \"#A9A9A9\",\n    lightblue: \"#ADD8E6\",\n    greenyellow: \"#ADFF2F\",\n    paleturquoise: \"#AFEEEE\",\n    lightsteelblue: \"#B0C4DE\",\n    powderblue: \"#B0E0E6\",\n    firebrick: \"#B22222\",\n    darkgoldenrod: \"#B8860B\",\n    mediumorchid: \"#BA55D3\",\n    rosybrown: \"#BC8F8F\",\n    darkkhaki: \"#BDB76B\",\n    mediumvioletred: \"#C71585\",\n    indianred: \"#CD5C5C\",\n    peru: \"#CD853F\",\n    chocolate: \"#D2691E\",\n    tan: \"#D2B48C\",\n    lightgray: \"#D3D3D3\",\n    lightgrey: \"#D3D3D3\",\n    thistle: \"#D8BFD8\",\n    orchid: \"#DA70D6\",\n    goldenrod: \"#DAA520\",\n    palevioletred: \"#DB7093\",\n    crimson: \"#DC143C\",\n    gainsboro: \"#DCDCDC\",\n    plum: \"#DDA0DD\",\n    burlywood: \"#DEB887\",\n    lightcyan: \"#E0FFFF\",\n    lavender: \"#E6E6FA\",\n    darksalmon: \"#E9967A\",\n    violet: \"#EE82EE\",\n    palegoldenrod: \"#EEE8AA\",\n    lightcoral: \"#F08080\",\n    khaki: \"#F0E68C\",\n    aliceblue: \"#F0F8FF\",\n    honeydew: \"#F0FFF0\",\n    azure: \"#F0FFFF\",\n    sandybrown: \"#F4A460\",\n    wheat: \"#F5DEB3\",\n    beige: \"#F5F5DC\",\n    whitesmoke: \"#F5F5F5\",\n    mintcream: \"#F5FFFA\",\n    ghostwhite: \"#F8F8FF\",\n    salmon: \"#FA8072\",\n    antiquewhite: \"#FAEBD7\",\n    linen: \"#FAF0E6\",\n    lightgoldenrodyellow: \"#FAFAD2\",\n    oldlace: \"#FDF5E6\",\n    magenta: \"#FF00FF\",\n    deeppink: \"#FF1493\",\n    orangered: \"#FF4500\",\n    tomato: \"#FF6347\",\n    hotpink: \"#FF69B4\",\n    coral: \"#FF7F50\",\n    darkorange: \"#FF8C00\",\n    lightsalmon: \"#FFA07A\",\n    orange: \"#FFA500\",\n    lightpink: \"#FFB6C1\",\n    pink: \"#FFC0CB\",\n    gold: \"#FFD700\",\n    peachpuff: \"#FFDAB9\",\n    navajowhite: \"#FFDEAD\",\n    moccasin: \"#FFE4B5\",\n    bisque: \"#FFE4C4\",\n    mistyrose: \"#FFE4E1\",\n    blanchedalmond: \"#FFEBCD\",\n    papayawhip: \"#FFEFD5\",\n    lavenderblush: \"#FFF0F5\",\n    seashell: \"#FFF5EE\",\n    cornsilk: \"#FFF8DC\",\n    lemonchiffon: \"#FFFACD\",\n    floralwhite: \"#FFFAF0\",\n    snow: \"#FFFAFA\",\n    lightyellow: \"#FFFFE0\",\n    ivory: \"#FFFFF0\",\n};\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.cubicInOut = exports.cubicOut = exports.cubicIn = exports.quadraticInOut = exports.quadraticOut = exports.quadraticIn = exports.linear = void 0;\n/**\n * Sigma.js Easings\n * =================\n *\n * Handy collection of easing functions.\n * @module\n */\nvar linear = function (k) { return k; };\nexports.linear = linear;\nvar quadraticIn = function (k) { return k * k; };\nexports.quadraticIn = quadraticIn;\nvar quadraticOut = function (k) { return k * (2 - k); };\nexports.quadraticOut = quadraticOut;\nvar quadraticInOut = function (k) {\n    if ((k *= 2) < 1)\n        return 0.5 * k * k;\n    return -0.5 * (--k * (k - 2) - 1);\n};\nexports.quadraticInOut = quadraticInOut;\nvar cubicIn = function (k) { return k * k * k; };\nexports.cubicIn = cubicIn;\nvar cubicOut = function (k) { return --k * k * k + 1; };\nexports.cubicOut = cubicOut;\nvar cubicInOut = function (k) {\n    if ((k *= 2) < 1)\n        return 0.5 * k * k * k;\n    return 0.5 * ((k -= 2) * k * k + 2);\n};\nexports.cubicInOut = cubicInOut;\nvar easings = {\n    linear: exports.linear,\n    quadraticIn: exports.quadraticIn,\n    quadraticOut: exports.quadraticOut,\n    quadraticInOut: exports.quadraticInOut,\n    cubicIn: exports.cubicIn,\n    cubicOut: exports.cubicOut,\n    cubicInOut: exports.cubicInOut,\n};\nexports.default = easings;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.doEdgeCollideWithPoint = exports.isPixelColored = void 0;\n/**\n * This helper returns true is the pixel at (x,y) in the given WebGL context is\n * colored, and false else.\n */\nfunction isPixelColored(gl, x, y) {\n    var pixels = new Uint8Array(4);\n    gl.readPixels(x, gl.drawingBufferHeight - y, 1, 1, gl.RGBA, gl.UNSIGNED_BYTE, pixels);\n    return pixels[3] > 0;\n}\nexports.isPixelColored = isPixelColored;\n/**\n * This helper checks whether or not a point (x, y) collides with an\n * edge, connecting a source (xS, yS) to a target (xT, yT) with a thickness in\n * pixels.\n */\nfunction doEdgeCollideWithPoint(x, y, xS, yS, xT, yT, thickness) {\n    // Check first if point is out of the rectangle which opposite corners are the\n    // source and the target, rectangle we expand by `thickness` in every\n    // directions:\n    if (x < xS - thickness && x < xT - thickness)\n        return false;\n    if (y < yS - thickness && y < yT - thickness)\n        return false;\n    if (x > xS + thickness && x > xT + thickness)\n        return false;\n    if (y > yS + thickness && y > yT + thickness)\n        return false;\n    // Check actual collision now: Since we now the point is in this big rectangle\n    // we \"just\" need to check that the distance between the point and the line\n    // connecting the source and the target is less than `thickness`:\n    // https://en.wikipedia.org/wiki/Distance_from_a_point_to_a_line\n    var distance = Math.abs((xT - xS) * (yS - y) - (xS - x) * (yT - yS)) / Math.sqrt(Math.pow(xT - xS, 2) + Math.pow(yT - yS, 2));\n    return distance < thickness / 2;\n}\nexports.doEdgeCollideWithPoint = doEdgeCollideWithPoint;\n","\"use strict\";\nvar __read = (this && this.__read) || function (o, n) {\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n    if (!m) return o;\n    var i = m.call(o), r, ar = [], e;\n    try {\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n    }\n    catch (error) { e = { error: error }; }\n    finally {\n        try {\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\n        }\n        finally { if (e) throw e.error; }\n    }\n    return ar;\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.validateGraph = exports.canUse32BitsIndices = exports.extractPixel = exports.getMatrixImpact = exports.matrixFromCamera = exports.getCorrectionRatio = exports.floatColor = exports.floatArrayColor = exports.parseColor = exports.zIndexOrdering = exports.createNormalizationFunction = exports.graphExtent = exports.getPixelRatio = exports.createElement = exports.cancelFrame = exports.requestFrame = exports.assignDeep = exports.assign = exports.isPlainObject = void 0;\nvar is_graph_1 = __importDefault(require(\"graphology-utils/is-graph\"));\nvar matrices_1 = require(\"./matrices\");\nvar data_1 = require(\"./data\");\n/**\n * Checks whether the given value is a plain object.\n *\n * @param  {mixed}   value - Target value.\n * @return {boolean}\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/explicit-module-boundary-types\nfunction isPlainObject(value) {\n    return typeof value === \"object\" && value !== null && value.constructor === Object;\n}\nexports.isPlainObject = isPlainObject;\n/**\n * Helper to use Object.assign with more than two objects.\n *\n * @param  {object} target       - First object.\n * @param  {object} [...objects] - Objects to merge.\n * @return {object}\n */\nfunction assign(target) {\n    var objects = [];\n    for (var _i = 1; _i < arguments.length; _i++) {\n        objects[_i - 1] = arguments[_i];\n    }\n    target = target || {};\n    for (var i = 0, l = objects.length; i < l; i++) {\n        var o = objects[i];\n        if (!o)\n            continue;\n        Object.assign(target, o);\n    }\n    return target;\n}\nexports.assign = assign;\n/**\n * Very simple recursive Object.assign-like function.\n *\n * @param  {object} target       - First object.\n * @param  {object} [...objects] - Objects to merge.\n * @return {object}\n */\nfunction assignDeep(target) {\n    var objects = [];\n    for (var _i = 1; _i < arguments.length; _i++) {\n        objects[_i - 1] = arguments[_i];\n    }\n    target = target || {};\n    for (var i = 0, l = objects.length; i < l; i++) {\n        var o = objects[i];\n        if (!o)\n            continue;\n        for (var k in o) {\n            if (isPlainObject(o[k])) {\n                target[k] = assignDeep(target[k], o[k]);\n            }\n            else {\n                target[k] = o[k];\n            }\n        }\n    }\n    return target;\n}\nexports.assignDeep = assignDeep;\n/**\n * Just some dirty trick to make requestAnimationFrame and cancelAnimationFrame \"work\" in Node.js, for unit tests:\n */\nexports.requestFrame = typeof requestAnimationFrame !== \"undefined\"\n    ? function (callback) { return requestAnimationFrame(callback); }\n    : function (callback) { return setTimeout(callback, 0); };\nexports.cancelFrame = typeof cancelAnimationFrame !== \"undefined\"\n    ? function (requestID) { return cancelAnimationFrame(requestID); }\n    : function (requestID) { return clearTimeout(requestID); };\n/**\n * Function used to create DOM elements easily.\n *\n * @param  {string} tag        - Tag name of the element to create.\n * @param  {object} style      - Styles map.\n * @param  {object} attributes - Attributes map.\n * @return {HTMLElement}\n */\nfunction createElement(tag, style, attributes) {\n    var element = document.createElement(tag);\n    if (style) {\n        for (var k in style) {\n            element.style[k] = style[k];\n        }\n    }\n    if (attributes) {\n        for (var k in attributes) {\n            element.setAttribute(k, attributes[k]);\n        }\n    }\n    return element;\n}\nexports.createElement = createElement;\n/**\n * Function returning the browser's pixel ratio.\n *\n * @return {number}\n */\nfunction getPixelRatio() {\n    if (typeof window.devicePixelRatio !== \"undefined\")\n        return window.devicePixelRatio;\n    return 1;\n}\nexports.getPixelRatio = getPixelRatio;\n/**\n * Function returning the graph's node extent in x & y.\n *\n * @param  {Graph}\n * @return {object}\n */\nfunction graphExtent(graph) {\n    if (!graph.order)\n        return { x: [0, 1], y: [0, 1] };\n    var xMin = Infinity;\n    var xMax = -Infinity;\n    var yMin = Infinity;\n    var yMax = -Infinity;\n    graph.forEachNode(function (_, attr) {\n        var x = attr.x, y = attr.y;\n        if (x < xMin)\n            xMin = x;\n        if (x > xMax)\n            xMax = x;\n        if (y < yMin)\n            yMin = y;\n        if (y > yMax)\n            yMax = y;\n    });\n    return { x: [xMin, xMax], y: [yMin, yMax] };\n}\nexports.graphExtent = graphExtent;\nfunction createNormalizationFunction(extent) {\n    var _a = __read(extent.x, 2), minX = _a[0], maxX = _a[1], _b = __read(extent.y, 2), minY = _b[0], maxY = _b[1];\n    var ratio = Math.max(maxX - minX, maxY - minY), dX = (maxX + minX) / 2, dY = (maxY + minY) / 2;\n    if (ratio === 0 || Math.abs(ratio) === Infinity || isNaN(ratio))\n        ratio = 1;\n    if (isNaN(dX))\n        dX = 0;\n    if (isNaN(dY))\n        dY = 0;\n    var fn = function (data) {\n        return {\n            x: 0.5 + (data.x - dX) / ratio,\n            y: 0.5 + (data.y - dY) / ratio,\n        };\n    };\n    // TODO: possibility to apply this in batch over array of indices\n    fn.applyTo = function (data) {\n        data.x = 0.5 + (data.x - dX) / ratio;\n        data.y = 0.5 + (data.y - dY) / ratio;\n    };\n    fn.inverse = function (data) {\n        return {\n            x: dX + ratio * (data.x - 0.5),\n            y: dY + ratio * (data.y - 0.5),\n        };\n    };\n    fn.ratio = ratio;\n    return fn;\n}\nexports.createNormalizationFunction = createNormalizationFunction;\n/**\n * Function ordering the given elements in reverse z-order so they drawn\n * the correct way.\n *\n * @param  {number}   extent   - [min, max] z values.\n * @param  {function} getter   - Z attribute getter function.\n * @param  {array}    elements - The array to sort.\n * @return {array} - The sorted array.\n */\nfunction zIndexOrdering(extent, getter, elements) {\n    // If k is > n, we'll use a standard sort\n    return elements.sort(function (a, b) {\n        var zA = getter(a) || 0, zB = getter(b) || 0;\n        if (zA < zB)\n            return -1;\n        if (zA > zB)\n            return 1;\n        return 0;\n    });\n    // TODO: counting sort optimization\n}\nexports.zIndexOrdering = zIndexOrdering;\n/**\n * WebGL utils\n * ===========\n */\n/**\n * Memoized function returning a float-encoded color from various string\n * formats describing colors.\n */\nvar INT8 = new Int8Array(4);\nvar INT32 = new Int32Array(INT8.buffer, 0, 1);\nvar FLOAT32 = new Float32Array(INT8.buffer, 0, 1);\nvar RGBA_TEST_REGEX = /^\\s*rgba?\\s*\\(/;\nvar RGBA_EXTRACT_REGEX = /^\\s*rgba?\\s*\\(\\s*([0-9]*)\\s*,\\s*([0-9]*)\\s*,\\s*([0-9]*)(?:\\s*,\\s*(.*)?)?\\)\\s*$/;\nfunction parseColor(val) {\n    var r = 0; // byte\n    var g = 0; // byte\n    var b = 0; // byte\n    var a = 1; // float\n    // Handling hexadecimal notation\n    if (val[0] === \"#\") {\n        if (val.length === 4) {\n            r = parseInt(val.charAt(1) + val.charAt(1), 16);\n            g = parseInt(val.charAt(2) + val.charAt(2), 16);\n            b = parseInt(val.charAt(3) + val.charAt(3), 16);\n        }\n        else {\n            r = parseInt(val.charAt(1) + val.charAt(2), 16);\n            g = parseInt(val.charAt(3) + val.charAt(4), 16);\n            b = parseInt(val.charAt(5) + val.charAt(6), 16);\n        }\n        if (val.length === 9) {\n            a = parseInt(val.charAt(7) + val.charAt(8), 16) / 255;\n        }\n    }\n    // Handling rgb notation\n    else if (RGBA_TEST_REGEX.test(val)) {\n        var match = val.match(RGBA_EXTRACT_REGEX);\n        if (match) {\n            r = +match[1];\n            g = +match[2];\n            b = +match[3];\n            if (match[4])\n                a = +match[4];\n        }\n    }\n    return { r: r, g: g, b: b, a: a };\n}\nexports.parseColor = parseColor;\nvar FLOAT_COLOR_CACHE = {};\nfor (var htmlColor in data_1.HTML_COLORS) {\n    FLOAT_COLOR_CACHE[htmlColor] = floatColor(data_1.HTML_COLORS[htmlColor]);\n    // Replicating cache for hex values for free\n    FLOAT_COLOR_CACHE[data_1.HTML_COLORS[htmlColor]] = FLOAT_COLOR_CACHE[htmlColor];\n}\nfunction floatArrayColor(val) {\n    val = data_1.HTML_COLORS[val] || val;\n    // NOTE: this variant is not cached because it is mostly used for uniforms\n    var _a = parseColor(val), r = _a.r, g = _a.g, b = _a.b, a = _a.a;\n    return new Float32Array([r / 255, g / 255, b / 255, a]);\n}\nexports.floatArrayColor = floatArrayColor;\nfunction floatColor(val) {\n    // If the color is already computed, we yield it\n    if (typeof FLOAT_COLOR_CACHE[val] !== \"undefined\")\n        return FLOAT_COLOR_CACHE[val];\n    var parsed = parseColor(val);\n    var r = parsed.r, g = parsed.g, b = parsed.b;\n    var a = parsed.a;\n    a = (a * 255) | 0;\n    INT32[0] = ((a << 24) | (b << 16) | (g << 8) | r) & 0xfeffffff;\n    var color = FLOAT32[0];\n    FLOAT_COLOR_CACHE[val] = color;\n    return color;\n}\nexports.floatColor = floatColor;\n/**\n * In sigma, the graph is normalized into a [0, 1], [0, 1] square, before being given to the various renderers. This\n * helps dealing with quadtree in particular.\n * But at some point, we need to rescale it so that it takes the best place in the screen, ie. we always want to see two\n * nodes \"touching\" opposite sides of the graph, with the camera being at its default state.\n *\n * This function determines this ratio.\n */\nfunction getCorrectionRatio(viewportDimensions, graphDimensions) {\n    var viewportRatio = viewportDimensions.height / viewportDimensions.width;\n    var graphRatio = graphDimensions.height / graphDimensions.width;\n    // If the stage and the graphs are in different directions (such as the graph being wider that tall while the stage\n    // is taller than wide), we can stop here to have indeed nodes touching opposite sides:\n    if ((viewportRatio < 1 && graphRatio > 1) || (viewportRatio > 1 && graphRatio < 1)) {\n        return 1;\n    }\n    // Else, we need to fit the graph inside the stage:\n    // 1. If the graph is \"squarer\" (ie. with a ratio closer to 1), we need to make the largest sides touch;\n    // 2. If the stage is \"squarer\", we need to make the smallest sides touch.\n    return Math.min(Math.max(graphRatio, 1 / graphRatio), Math.max(1 / viewportRatio, viewportRatio));\n}\nexports.getCorrectionRatio = getCorrectionRatio;\n/**\n * Function returning a matrix from the current state of the camera.\n */\n// TODO: it's possible to optimize this drastically!\nfunction matrixFromCamera(state, viewportDimensions, graphDimensions, padding, inverse) {\n    var angle = state.angle, ratio = state.ratio, x = state.x, y = state.y;\n    var width = viewportDimensions.width, height = viewportDimensions.height;\n    var matrix = (0, matrices_1.identity)();\n    var smallestDimension = Math.min(width, height) - 2 * padding;\n    var correctionRatio = getCorrectionRatio(viewportDimensions, graphDimensions);\n    if (!inverse) {\n        (0, matrices_1.multiply)(matrix, (0, matrices_1.scale)((0, matrices_1.identity)(), 2 * (smallestDimension / width) * correctionRatio, 2 * (smallestDimension / height) * correctionRatio));\n        (0, matrices_1.multiply)(matrix, (0, matrices_1.rotate)((0, matrices_1.identity)(), -angle));\n        (0, matrices_1.multiply)(matrix, (0, matrices_1.scale)((0, matrices_1.identity)(), 1 / ratio));\n        (0, matrices_1.multiply)(matrix, (0, matrices_1.translate)((0, matrices_1.identity)(), -x, -y));\n    }\n    else {\n        (0, matrices_1.multiply)(matrix, (0, matrices_1.translate)((0, matrices_1.identity)(), x, y));\n        (0, matrices_1.multiply)(matrix, (0, matrices_1.scale)((0, matrices_1.identity)(), ratio));\n        (0, matrices_1.multiply)(matrix, (0, matrices_1.rotate)((0, matrices_1.identity)(), angle));\n        (0, matrices_1.multiply)(matrix, (0, matrices_1.scale)((0, matrices_1.identity)(), width / smallestDimension / 2 / correctionRatio, height / smallestDimension / 2 / correctionRatio));\n    }\n    return matrix;\n}\nexports.matrixFromCamera = matrixFromCamera;\n/**\n * All these transformations we apply on the matrix to get it rescale the graph\n * as we want make it very hard to get pixel-perfect distances in WebGL. This\n * function returns a factor that properly cancels the matrix effect on lengths.\n *\n * [jacomyal]\n * To be fully honest, I can't really explain happens here... I notice that the\n * following ratio works (ie. it correctly compensates the matrix impact on all\n * camera states I could try):\n * > `R = size(V) / size(M * V) / W`\n * as long as `M * V` is in the direction of W (ie. parallel to (Ox)). It works\n * as well with H and a vector that transforms into something parallel to (Oy).\n *\n * Also, note that we use `angle` and not `-angle` (that would seem logical,\n * since we want to anticipate the rotation), because of the fact that in WebGL,\n * the image is vertically swapped.\n */\nfunction getMatrixImpact(matrix, cameraState, viewportDimensions) {\n    var _a = (0, matrices_1.multiplyVec2)(matrix, { x: Math.cos(cameraState.angle), y: Math.sin(cameraState.angle) }, 0), x = _a.x, y = _a.y;\n    return 1 / Math.sqrt(Math.pow(x, 2) + Math.pow(y, 2)) / viewportDimensions.width;\n}\nexports.getMatrixImpact = getMatrixImpact;\n/**\n * Function extracting the color at the given pixel.\n */\nfunction extractPixel(gl, x, y, array) {\n    var data = array || new Uint8Array(4);\n    gl.readPixels(x, y, 1, 1, gl.RGBA, gl.UNSIGNED_BYTE, data);\n    return data;\n}\nexports.extractPixel = extractPixel;\n/**\n * Function used to know whether given webgl context can use 32 bits indices.\n */\nfunction canUse32BitsIndices(gl) {\n    var webgl2 = typeof WebGL2RenderingContext !== \"undefined\" && gl instanceof WebGL2RenderingContext;\n    return webgl2 || !!gl.getExtension(\"OES_element_index_uint\");\n}\nexports.canUse32BitsIndices = canUse32BitsIndices;\n/**\n * Check if the graph variable is a valid graph, and if sigma can render it.\n */\nfunction validateGraph(graph) {\n    // check if it's a valid graphology instance\n    if (!(0, is_graph_1.default)(graph))\n        throw new Error(\"Sigma: invalid graph instance.\");\n    // check if nodes have x/y attributes\n    graph.forEachNode(function (key, attributes) {\n        if (!Number.isFinite(attributes.x) || !Number.isFinite(attributes.y)) {\n            throw new Error(\"Sigma: Coordinates of node \".concat(key, \" are invalid. A node must have a numeric 'x' and 'y' attribute.\"));\n        }\n    });\n}\nexports.validateGraph = validateGraph;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.multiplyVec2 = exports.multiply = exports.translate = exports.rotate = exports.scale = exports.identity = void 0;\nfunction identity() {\n    return Float32Array.of(1, 0, 0, 0, 1, 0, 0, 0, 1);\n}\nexports.identity = identity;\n// TODO: optimize\nfunction scale(m, x, y) {\n    m[0] = x;\n    m[4] = typeof y === \"number\" ? y : x;\n    return m;\n}\nexports.scale = scale;\nfunction rotate(m, r) {\n    var s = Math.sin(r), c = Math.cos(r);\n    m[0] = c;\n    m[1] = s;\n    m[3] = -s;\n    m[4] = c;\n    return m;\n}\nexports.rotate = rotate;\nfunction translate(m, x, y) {\n    m[6] = x;\n    m[7] = y;\n    return m;\n}\nexports.translate = translate;\nfunction multiply(a, b) {\n    var a00 = a[0], a01 = a[1], a02 = a[2];\n    var a10 = a[3], a11 = a[4], a12 = a[5];\n    var a20 = a[6], a21 = a[7], a22 = a[8];\n    var b00 = b[0], b01 = b[1], b02 = b[2];\n    var b10 = b[3], b11 = b[4], b12 = b[5];\n    var b20 = b[6], b21 = b[7], b22 = b[8];\n    a[0] = b00 * a00 + b01 * a10 + b02 * a20;\n    a[1] = b00 * a01 + b01 * a11 + b02 * a21;\n    a[2] = b00 * a02 + b01 * a12 + b02 * a22;\n    a[3] = b10 * a00 + b11 * a10 + b12 * a20;\n    a[4] = b10 * a01 + b11 * a11 + b12 * a21;\n    a[5] = b10 * a02 + b11 * a12 + b12 * a22;\n    a[6] = b20 * a00 + b21 * a10 + b22 * a20;\n    a[7] = b20 * a01 + b21 * a11 + b22 * a21;\n    a[8] = b20 * a02 + b21 * a12 + b22 * a22;\n    return a;\n}\nexports.multiply = multiply;\nfunction multiplyVec2(a, b, z) {\n    if (z === void 0) { z = 1; }\n    var a00 = a[0];\n    var a01 = a[1];\n    var a10 = a[3];\n    var a11 = a[4];\n    var a20 = a[6];\n    var a21 = a[7];\n    var b0 = b.x;\n    var b1 = b.y;\n    return { x: b0 * a00 + b1 * a10 + a20 * z, y: b0 * a01 + b1 * a11 + a21 * z };\n}\nexports.multiplyVec2 = multiplyVec2;\n"],"names":["_interopRequireDefault","exports","_createSvgIcon","_jsxRuntime","_default","default","jsx","d","createSvgIcon","_excluded","BreadcrumbCollapsedButton","styled","ButtonBase","theme","display","marginLeft","spacing","marginRight","palette","mode","backgroundColor","grey","color","borderRadius","boxShadow","shadows","BreadcrumbCollapsedIcon","MoreHoriz","width","height","props","slots","slotProps","otherProps","ownerState","children","focusRipple","as","CollapsedIcon","collapsedIcon","BreadcrumbsRoot","Typography","name","slot","overridesResolver","styles","breadcrumbsClasses","li","root","BreadcrumbsOl","ol","flexWrap","alignItems","padding","margin","listStyle","BreadcrumbsSeparator","separator","userSelect","insertSeparators","items","className","reduce","acc","current","index","length","concat","push","inProps","ref","useThemeProps","component","expandText","itemsAfterCollapse","itemsBeforeCollapse","maxItems","other","expanded","setExpanded","classes","composeClasses","useUtilityClasses","collapsedIconSlotProps","useSlotProps","elementType","externalSlotProps","listRef","allItems","filter","child","map","slice","onClick","focusable","querySelector","focus","renderItemsBeforeAndAfter","getBreadcrumbsUtilityClass","formatTokenMap","Y","YY","YYYY","M","sectionType","contentType","maxLength","MM","MMM","MMMM","D","DD","Do","E","e","dd","ddd","dddd","A","a","H","HH","h","hh","m","mm","s","ss","defaultFormats","year","month","monthShort","dayOfMonth","weekday","weekdayShort","hours24h","hours12h","meridiem","minutes","seconds","fullDate","fullDateWithWeekday","keyboardDate","shortDate","normalDate","normalDateWithWeekday","monthAndYear","monthAndDate","fullTime","fullTime12h","fullTime24h","fullDateTime","fullDateTime12h","fullDateTime24h","keyboardDateTime","keyboardDateTime12h","keyboardDateTime24h","MISSING_TIMEZONE_PLUGIN","join","AdapterMoment","constructor","locale","formats","instance","this","isMUIAdapter","isTimezoneCompatible","lib","moment","escapedCharacters","start","end","setLocaleToValue","value","expectedLocale","getCurrentLocaleCode","hasTimezonePlugin","tz","createSystemDate","parsedValue","local","undefined","createUTCDate","utc","createTZDate","timezone","Error","date","dateWithTimezone","getTimezone","_value$_z","_ref","_this$moment$defaultZ","isUTC","zone","_z","defaultZone","setTimezone","_this$moment$defaultZ2","_this$moment$defaultZ3","clone","cleanZone","newValue","toJsDate","toDate","parseISO","isoString","toISO","toISOString","parse","format","is12HourCycleInCurrentLocale","test","longDateFormat","expandFormat","match","token","firstCharacter","getFormatHelperText","replace","toLocaleLowerCase","isNull","isValid","formatKey","formatByString","formatString","clonedDate","formatNumber","numberToFormat","getDiff","comparing","unit","diff","isEqual","isSame","isSameYear","isSameMonth","isSameDay","isSameHour","isAfter","isAfterYear","isAfterDay","isBefore","isBeforeYear","isBeforeDay","isWithinRange","isBetween","startOfYear","startOf","startOfMonth","startOfWeek","startOfDay","endOfYear","endOf","endOfMonth","endOfWeek","endOfDay","addYears","amount","subtract","Math","abs","add","addMonths","addWeeks","addDays","addHours","addMinutes","addSeconds","getYear","get","getMonth","getDate","getHours","getMinutes","getSeconds","getMilliseconds","setYear","setMonth","setDate","setHours","hours","setMinutes","setSeconds","setMilliseconds","milliseconds","getDaysInMonth","daysInMonth","getNextMonth","getPreviousMonth","getMonthArray","monthArray","prevMonth","mergeDateAndTime","dateParam","timeParam","hour","minute","second","getWeekdays","getWeekArray","cleanLocale","count","nestedWeeks","weekNumber","floor","getWeekNumber","week","getYearRange","startDate","endDate","years","getMeridiemText","ampm","v","Provider","f","p","sigma","b","container","t","n","Object","keys","forEach","setSetting","offsetWidth","offsetHeight","w","C","O","_","r","c","l","getSettings","some","includes","enableEdgeClickEvents","enableEdgeHoverEvents","enableEdgeWheelEvents","find","on","getMouseCaptor","getTouchCaptor","getCamera","off","y","getGraph","order","clear","import","refresh","j","animatedZoom","assign","animatedUnzoom","animatedReset","o","animate","i","getNodeDisplayData","console","log","zoomIn","zoomOut","reset","goto","gotoNode","k","graph","id","style","settings","allowInvalidContainer","setState","getState","kill","module","array","values","l2","l1","linLogMode","outboundAttractionDistribution","adjustSizes","edgeWeightInfluence","scalingRatio","strongGravityMode","gravity","slowDown","barnesHutOptimize","barnesHutTheta","target","objects","Array","prototype","call","arguments","validateSettings","message","graphToByteArrays","getEdgeWeight","size","NodeMatrix","Float32Array","EdgeMatrix","forEachNode","node","attr","x","fixed","forEachEdge","edge","source","sa","ta","u","sj","tj","weight","nodes","edges","assignLayoutChanges","outputReducer","updateEachNodeAttributes","readGraphPositions","collectLayoutChanges","positions","newAttr","getNodeAttributes","createWorker","fn","xURL","window","URL","webkitURL","code","toString","objectUrl","createObjectURL","Blob","type","worker","Worker","revokeObjectURL","isGraph","createEdgeWeightGetter","iterate","helpers","DEFAULT_SETTINGS","abstractSynchronousLayout","params","iterations","fromEntry","validationError","matrices","synchronousLayout","bind","inferSettings","PPN","options","n1","n2","rn","g","outboundAttCompensation","coefficient","xDist","yDist","ewc","distance","factor","force","swinging","traction","nodespeed","newX","newY","thetaSquared","RegionMatrix","q","q2","subdivisionAttempts","minX","Infinity","maxX","minY","maxY","min","max","dx","dy","PPR","pow","sqrt","NODES","EDGES","moduleShim","self","addEventListener","event","data","postMessage","buffer","workerFunction","FA2LayoutSupervisor","running","killed","handleMessage","respawnFrame","handleGraphUpdate","terminate","clearTimeout","setTimeout","spawnWorker","isRunning","matrix","askForIterations","withEdges","payload","buffers","stop","removeListener","resolveDefaults","shuffle","DEFAULTS","attributes","center","hierarchyAttributes","rng","random","scale","CircleWrap","circleWrap","wrappedCircle","countChildren","next","previous","setNode","parentCircle","posMap","key","circle","hasChildren","enclosesNot","dr","enclosesWeak","enclosesWeakAll","B","encloseBasis2","x1","y1","r1","x2","y2","r2","x21","y21","r21","encloseBasis3","x3","y3","r3","a2","a3","b2","b3","c2","c3","d1","d2","d3","ab","xa","xb","ya","yb","encloseBasis","extendBasis","score","place","intersects","packHierarchy","shuffleFunc","circles","aa","ca","sk","pack","safety","circlesLoc","enclose","packEnclose","genericCirclePackLayout","createShuffleInPlace","newCircleWrap","parentContainer","getChild","addChild","applyPositionToChildren","packHierarchyAndShift","setNodeAttribute","hasOwnProperty","circlePackLayout","dimensions","genericCircularLayout","isArray","tau","PI","offset","assignPosition","cos","sin","circularLayout","rotation","genericRandomLayout","randomLayout","RAD_CONVERSION","centeredOnZero","degrees","genericRotation","angle","xd","yd","xCenter","yCenter","xMin","xMax","yMin","yMax","copyNode","copyEdge","G","multi","R","nullCopy","mergeAttributes","getAttributes","labelsG","labelsH","_s","_t","undirected","toUndirected","reversed","emptyCopy","forEachUndirectedEdge","forEachDirectedEdge","S","filterNode","Set","has","old","hasNode","sourceAttr","targetAttr","mergeEdge","copy","directedGraph","existingOutEdge","existingInEdge","replaceEdgeAttributes","getEdgeAttributes","multiGraph","simpleGraph","_sa","_ta","existingEdge","undirectedEdge","directedEdge","undirectedGraph","unweighted","utils","bidirectional","singleSource","singleSourceLength","undirectedSingleSourceLength","brandes","edgePathFromNodePath","Queue","extend","asbtractSingleSourceLength","method","seen","lengths","level","currentLevel","nextLevel","getPredecessors","inboundNeighbors","getSuccessors","outboundNeighbors","predecessor","successor","currentFringe","neighbors","neighbor","forwardFringe","reverseFringe","found","outer","path","unshift","paths","Dv","sigmav","P","queue","of","dequeue","enqueue","returnTrue","nodePath","findEdge","edgePath","findOutboundEdge","addUndirectedEdge","addUndirectedEdgeWithKey","addDirectedEdge","addDirectedEdgeWithKey","addNode","defaults","output","existing","def","Map","RegExp","Date","coerceWeight","isNaN","nameOrFunction","defaultValue","getter","coerceToDefault","returnDefault","fromAttributes","fromGraph","fromPartialEntry","fromMinimalEntry","extremities","isUndirected","createEdgeValueGetter","dropNode","Symbol","iterator","create","setPrototypeOf","getPrototypeOf","__proto__","Reflect","construct","sham","Proxy","Boolean","valueOf","apply","Function","indexOf","TypeError","set","enumerable","writable","configurable","ReferenceError","_nodes","out","defineProperty","ownKeys","getOwnPropertySymbols","getOwnPropertyNames","Number","init","once","Promise","U","EventEmitter","_events","_eventsCount","_maxListeners","defaultMaxListeners","newListener","emit","listener","warned","String","emitter","warn","fired","wrapFn","L","removeEventListener","N","RangeError","setMaxListeners","getMaxListeners","error","context","addListener","prependListener","prependOnceListener","shift","pop","removeAllListeners","listeners","rawListeners","listenerCount","eventNames","done","empty","fromSequence","is","ARRAY_BUFFER_SUPPORT","ArrayBuffer","SYMBOL_SUPPORT","z","W","isView","K","T","captureStackTrace","F","I","J","V","_edges","inDegree","outDegree","undirectedDegree","undirectedLoops","directedLoops","in","attach","attachMulti","detach","detachMulti","Q","attacher","X","Z","$","tt","et","direction","nt","rt","it","sourceAttributes","targetAttributes","ot","at","ct","ut","from","undirectedSize","directedSize","dt","st","ht","pt","ft","lt","gt","yt","wt","vt","bt","mt","wrap","kt","xt","Et","At","Lt","St","Dt","Ut","Nt","allowSelfLoops","Ot","NodeDataClass","jt","_edgeKeyGenerator","_undirectedSelfLoopCount","_directedSelfLoopCount","_undirectedSize","_directedSize","Ct","Mt","delete","zt","_options","_resetInstanceCounters","hasDirectedEdge","hasUndirectedEdge","hasEdge","areDirectedNeighbors","areOutNeighbors","areInNeighbors","areUndirectedNeighbors","areNeighbors","areInboundNeighbors","areOutboundNeighbors","directedDegree","inboundDegree","outboundDegree","degree","inDegreeWithoutSelfLoops","outDegreeWithoutSelfLoops","directedDegreeWithoutSelfLoops","undirectedDegreeWithoutSelfLoops","inboundDegreeWithoutSelfLoops","outboundDegreeWithoutSelfLoops","degreeWithoutSelfLoops","opposite","hasExtremity","isDirected","isSelfLoop","mergeNode","updateNode","dropEdge","dropDirectedEdge","dropUndirectedEdge","clearEdges","getAttribute","_attributes","hasAttribute","setAttribute","updateAttribute","removeAttribute","replaceAttributes","updateAttributes","hints","updateEachEdgeAttributes","forEachAdjacencyEntry","forEachAdjacencyEntryWithOrphans","forEachAssymetricAdjacencyEntry","forEachAssymetricAdjacencyEntryWithOrphans","findNode","mapNodes","someNode","everyNode","filterNodes","reduceNodes","nodeEntries","export","mergeUndirectedEdgeWithKey","mergeDirectedEdgeWithKey","mergeUndirectedEdge","mergeDirectedEdge","toJSON","inspect","startsWith","for","generateKey","toUpperCase","Gt","Wt","Pt","Rt","Kt","Tt","Bt","Graph","DirectedGraph","UndirectedGraph","MultiGraph","MultiDirectedGraph","MultiUndirectedGraph","InvalidArgumentsGraphError","NotFoundGraphError","UsageGraphError","FUNC_ERROR_TEXT","reTrim","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","parseInt","freeGlobal","freeSelf","objectToString","nativeMax","nativeMin","now","isObject","toNumber","isObjectLike","isSymbol","isBinary","func","wait","leading","trailing","lastArgs","lastThis","maxWait","result","timerId","lastCallTime","lastInvokeTime","maxing","invokeFunc","time","args","thisArg","leadingEdge","timerExpired","shouldInvoke","timeSinceLastCall","trailingEdge","remainingWait","debounced","isInvoking","cancel","flush","debounce","HASH_UNDEFINED","PLACEHOLDER","WRAP_PARTIAL_FLAG","WRAP_ARY_FLAG","INFINITY","MAX_SAFE_INTEGER","NAN","MAX_ARRAY_LENGTH","wrapFlags","argsTag","arrayTag","boolTag","dateTag","errorTag","funcTag","genTag","mapTag","numberTag","objectTag","promiseTag","regexpTag","setTag","stringTag","symbolTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reIsDeepProp","reIsPlainProp","rePropName","reRegExpChar","reHasRegExpChar","reTrimStart","reTrimEnd","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reEscapeChar","reEsTemplate","reFlags","reIsHostCtor","reIsUint","reLatin","reNoMatch","reUnescapedString","rsComboRange","rsComboMarksRange","rsLowerRange","rsUpperRange","rsBreakRange","rsMathOpRange","rsBreak","rsCombo","rsDigits","rsLower","rsMisc","rsFitz","rsNonAstral","rsRegional","rsSurrPair","rsUpper","rsMiscLower","rsMiscUpper","rsOptContrLower","rsOptContrUpper","reOptMod","rsModifier","rsOptVar","rsSeq","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","stringEscapes","freeParseFloat","parseFloat","freeExports","nodeType","freeModule","moduleExports","freeProcess","process","nodeUtil","require","types","binding","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","arrayAggregator","setter","iteratee","accumulator","arrayEach","arrayEachRight","arrayEvery","predicate","arrayFilter","resIndex","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayMap","arrayPush","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","baseFindKey","collection","eachFunc","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","object","basePropertyOf","baseReduce","baseTimes","baseUnary","baseValues","cacheHas","cache","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","countHolders","placeholder","deburrLetter","escapeHtmlChar","escapeStringChar","chr","hasUnicode","string","mapToArray","overArg","transform","arg","replaceHolders","setToArray","setToPairs","stringSize","lastIndex","unicodeSize","stringToArray","unicodeToArray","split","asciiToArray","unescapeHtmlChar","runInContext","uid","pick","arrayProto","funcProto","objectProto","coreJsData","funcToString","idCounter","maskSrcKey","exec","IE_PROTO","nativeObjectToString","objectCtorString","oldDash","reIsNative","Buffer","Uint8Array","allocUnsafe","getPrototype","objectCreate","propertyIsEnumerable","splice","spreadableSymbol","isConcatSpreadable","symIterator","symToStringTag","toStringTag","getNative","ctxClearTimeout","ctxNow","ctxSetTimeout","nativeCeil","ceil","nativeFloor","nativeGetSymbols","nativeIsBuffer","isBuffer","nativeIsFinite","isFinite","nativeJoin","nativeKeys","nativeNow","nativeParseInt","nativeRandom","nativeReverse","reverse","DataView","WeakMap","nativeCreate","metaMap","realNames","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","symbolToString","lodash","LazyWrapper","LodashWrapper","wrapperClone","baseCreate","proto","baseLodash","chainAll","__wrapped__","__actions__","__chain__","__index__","__values__","__dir__","__filtered__","__iteratees__","__takeCount__","__views__","Hash","entries","entry","ListCache","MapCache","SetCache","__data__","Stack","arrayLikeKeys","inherited","isArr","isArg","isArguments","isBuff","isType","skipIndexes","isIndex","arraySample","baseRandom","arraySampleSize","shuffleSelf","copyArray","baseClamp","arrayShuffle","assignMergeValue","eq","baseAssignValue","assignValue","objValue","assocIndexOf","baseAggregator","baseEach","baseAssign","copyObject","baseAt","skip","number","lower","upper","baseClone","bitmask","customizer","stack","isDeep","isFlat","isFull","input","initCloneArray","tag","getTag","isFunc","cloneBuffer","initCloneObject","getSymbolsIn","copySymbolsIn","keysIn","baseAssignIn","getSymbols","copySymbols","symbol","Ctor","cloneArrayBuffer","dataView","byteOffset","byteLength","cloneDataView","cloneTypedArray","regexp","cloneRegExp","initCloneByTag","stacked","subValue","getAllKeysIn","getAllKeys","baseConformsTo","baseDelay","baseDifference","isCommon","valuesLength","computed","valuesIndex","templateSettings","getMapData","pairs","LARGE_ARRAY_SIZE","createBaseEach","baseForOwn","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","baseFilter","baseFlatten","depth","isStrict","isFlattenable","baseFor","createBaseFor","baseForRight","baseFunctions","isFunction","baseGet","castPath","toKey","baseGetAllKeys","keysFunc","symbolsFunc","baseGetTag","isOwn","unmasked","getRawTag","baseGt","baseHas","baseHasIn","baseIntersection","arrays","othLength","othIndex","caches","baseInvoke","parent","last","baseIsArguments","baseIsEqual","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","convert","isPartial","equalByTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","objProps","objLength","skipCtor","othValue","compared","objCtor","othCtor","equalObjects","baseIsEqualDeep","baseIsMatch","matchData","noCustomizer","srcValue","COMPARE_PARTIAL_FLAG","baseIsNative","baseIteratee","identity","baseMatchesProperty","baseMatches","property","baseKeys","isPrototype","baseLt","baseMap","isArrayLike","getMatchData","matchesStrictComparable","isKey","isStrictComparable","hasIn","baseMerge","srcIndex","mergeFunc","safeGet","isTyped","isArrayLikeObject","isPlainObject","toPlainObject","baseMergeDeep","baseNth","baseOrderBy","iteratees","orders","getIteratee","criteria","comparer","sort","objCriteria","othCriteria","ordersLength","compareAscending","compareMultiple","baseSortBy","basePickBy","baseSet","basePullAll","basePullAt","indexes","baseUnset","baseRepeat","baseRest","setToString","overRest","baseSample","baseSampleSize","nested","baseSetData","baseSetToString","constant","baseShuffle","baseSlice","baseSome","baseSortedIndex","retHighest","low","high","mid","baseSortedIndexBy","valIsNaN","valIsNull","valIsSymbol","valIsUndefined","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedUniq","baseToNumber","baseToString","baseUniq","createSet","seenIndex","baseUpdate","updater","baseWhile","isDrop","baseWrapperValue","actions","action","baseXor","baseZipObject","assignFunc","valsLength","castArrayLikeObject","castFunction","stringToPath","castRest","castSlice","arrayBuffer","typedArray","valIsDefined","valIsReflexive","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgsRight","holdersIndex","rightIndex","rightLength","isNew","createAggregator","initializer","createAssigner","assigner","sources","guard","isIterateeCall","iterable","createCaseFirst","methodName","charAt","createCompounder","callback","words","deburr","createCtor","thisBinding","createFind","findIndexFunc","createFlow","flatRest","funcs","prereq","thru","wrapper","getFuncName","funcName","getData","isLaziable","plant","createHybrid","partialsRight","holdersRight","argPos","ary","arity","isAry","isBind","isBindKey","isFlip","getHolder","holdersCount","newHolders","createRecurry","reorder","createInverter","toIteratee","baseInverter","createMathOperation","operator","createOver","arrayFunc","createPadding","chars","charsLength","createRange","step","toFinite","baseRange","createRelationalOperation","wrapFunc","isCurry","newData","setData","setWrapToString","createRound","precision","toInteger","pair","noop","createToPairs","baseToPairs","createWrap","srcBitmask","newBitmask","isCombo","mergeData","createCurry","createPartial","createBind","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","arrLength","arrValue","flatten","otherFunc","getValue","stubArray","hasPath","hasFunc","isLength","resolve","ctorString","isMaskable","stubFalse","otherArgs","oldArray","shortOut","reference","details","insertWrapDetails","updateWrapDetails","getWrapDetails","lastCalled","stamp","remaining","rand","memoize","charCodeAt","quote","subString","difference","differenceBy","differenceWith","findIndex","findLastIndex","head","intersection","mapped","intersectionBy","intersectionWith","pull","pullAll","pullAt","union","unionBy","unionWith","unzip","group","unzipWith","without","xor","xorBy","xorWith","zip","zipWith","chain","interceptor","wrapperAt","countBy","findLast","forEachRight","groupBy","invokeMap","keyBy","partition","sortBy","before","bindKey","WRAP_BIND_FLAG","timeWaiting","defer","delay","resolver","memoized","Cache","negate","overArgs","transforms","funcsLength","partial","partialRight","rearg","gte","isError","isInteger","isNumber","isString","lte","toArray","iteratorToArray","remainder","toLength","assignIn","assignInWith","assignWith","propsIndex","propsLength","defaultsDeep","mergeWith","invert","invertBy","invoke","nativeKeysIn","isProto","baseKeysIn","merge","omit","CLONE_DEEP_FLAG","basePick","pickBy","prop","toPairs","toPairsIn","camelCase","word","toLowerCase","capitalize","upperFirst","kebabCase","lowerCase","lowerFirst","snakeCase","startCase","upperCase","pattern","hasUnicodeWord","unicodeWords","asciiWords","attempt","bindAll","methodNames","flow","flowRight","methodOf","mixin","over","overEvery","overSome","basePropertyDeep","range","rangeRight","augend","addend","divide","dividend","divisor","multiply","multiplier","multiplicand","round","minuend","subtrahend","after","castArray","chunk","compact","cond","conforms","baseConforms","properties","curry","curryRight","drop","dropRight","dropRightWhile","dropWhile","fill","baseFill","flatMap","flatMapDeep","flatMapDepth","flattenDeep","flattenDepth","flip","fromPairs","functions","functionsIn","initial","mapKeys","mapValues","matches","matchesProperty","nthArg","omitBy","orderBy","propertyOf","pullAllBy","pullAllWith","reject","remove","rest","sampleSize","setWith","sortedUniq","sortedUniqBy","limit","spread","tail","take","takeRight","takeRightWhile","takeWhile","tap","throttle","toPath","isArrLike","unary","uniq","uniqBy","uniqWith","unset","update","updateWith","valuesIn","zipObject","zipObjectDeep","entriesIn","extendWith","clamp","cloneDeep","cloneDeepWith","cloneWith","conformsTo","defaultTo","endsWith","position","escape","escapeRegExp","every","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","inRange","baseInRange","isBoolean","isElement","isEmpty","isEqualWith","isMatch","isMatchWith","isNative","isNil","isSafeInteger","isUndefined","isWeakMap","isWeakSet","lastIndexOf","strictLastIndexOf","maxBy","mean","meanBy","minBy","stubObject","stubString","stubTrue","nth","noConflict","pad","strLength","padEnd","padStart","radix","floating","temp","reduceRight","repeat","sample","sortedIndex","sortedIndexBy","sortedIndexOf","sortedLastIndex","sortedLastIndexBy","sortedLastIndexOf","sum","sumBy","template","isEscaping","isEvaluating","imports","importsKeys","importsValues","interpolate","reDelimiters","evaluate","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","variable","times","toLower","toSafeInteger","toUpper","trim","trimEnd","trimStart","truncate","omission","search","substring","global","newEnd","unescape","uniqueId","prefix","each","eachRight","first","VERSION","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isHybrid","isUnwrapped","onlyLazy","chainName","dir","isRight","view","getView","iterLength","takeCount","iterIndex","commit","wrapped","comparators","iterables","DEFAULT_COMPARATOR","reverseComparator","siftDown","compare","heap","startIndex","parentIndex","item","siftUp","endIndex","childIndex","lastItem","popped","pushpop","tmp","heapify","consume","Heap","MaxHeap","peek","proxy","nsmallest","reverseCompare","guessLength","nlargest","MinHeap","Iterator","scope","DEFAULT_REVERSE_COMPARATOR","createTupleComparator","typed","toArrayWithIndices","IndexArray","getPointerArray","indices","MAX_8BIT_INTEGER","MAX_16BIT_INTEGER","MAX_32BIT_INTEGER","MAX_SIGNED_8BIT_INTEGER","MAX_SIGNED_16BIT_INTEGER","MAX_SIGNED_32BIT_INTEGER","maxIndex","Uint16Array","Uint32Array","getSignedPointerArray","Int8Array","Int16Array","Int32Array","Float64Array","getNumberType","sign","TYPE_PRIORITY","getMinimalRepresentation","maxType","maxPriority","support","sequence","createRandom","customRandom","shuffleInPlace","getNanoSeconds","hrtime","loadTime","moduleLoadTime","nodeLoadTime","upTime","performance","hr","uptime","getTime","vendors","suffix","raf","caf","_now","cp","cancelled","handle","polyfill","requestAnimationFrame","cancelAnimationFrame","extendStatics","__extends","__","__importDefault","mod","__esModule","animate_1","easings_1","utils_1","types_1","DEFAULT_ZOOMING_RATIO","Camera","_super","_this","ratio","minRatio","maxRatio","nextFrame","previousState","enabled","state","enable","disable","hasState","getPreviousState","getBoundedRatio","validateState","validatedState","isAnimated","validState","updateState","opts","ANIMATE_DEFAULTS","easing","initialState","duration","animationCallback","newState","requestFrame","cancelFrame","factorOrOptions","TypedEventEmitter","__assign","getWheelDelta","getTouchCoords","getTouchesArray","getWheelCoords","getMouseCoords","getPosition","dom","bbox","getBoundingClientRect","clientX","left","clientY","top","res","sigmaDefaultPrevented","preventSigmaDefault","original","touches","arr","deltaY","detail","delta","touch","Captor","renderer","__createBinding","k2","__setModuleDefault","__importStar","captor_1","MouseCaptor","draggedEvents","downStartTime","lastMouseX","lastMouseY","isMouseDown","isMoving","movingTimeout","startCameraState","clicks","doubleClickTimeout","currentWheelDirection","handleClick","handleRightClick","handleDown","handleUp","handleMove","handleWheel","handleOut","document","handleDoubleClick","preventDefault","stopPropagation","mouseCoords","camera","newRatio","getViewportZoomedState","button","_a","cameraState","previousCameraState","eX","eY","lastMouse","viewportToFramedGraph","mouse","offsetX","offsetY","wheelCoords","ratioDiff","wheelDirection","lastWheelTriggerTime","MOUSE_ZOOM_DURATION","__read","ar","TouchCaptor","hasMoved","touchMode","startTouchesPositions","handleStart","handleLeave","getDimensions","dispatchRelatedMouseEvent","mousePosition","mouseEvent","MouseEvent","altKey","ctrlKey","isFakeSigmaMouseEvent","dispatchEvent","lastTouches","lastTouchesPositions","_b","x0","y0","_c","startTouchesAngle","atan2","startTouchesDistance","touchesPositions","idx","startPosition","xStart","yStart","newCameraState","_d","_e","angleDiff","hypot","touchGraphPosition","smallestDimension","edgeLabelsToDisplayFromNodes","LabelGrid","LabelCandidate","cellSize","columns","rows","cells","resizeAndClear","getIndex","pos","xIndex","candidate","cell","organize","getLabelsToDisplay","density","cellArea","scaledDensity","labelsToDisplayPerCell","labels","hoveredNode","highlightedNodes","displayedNodeLabels","worthyEdges","rectangleCollidesWithQuad","squareCollidesWithQuad","getCircumscribedAlignedRectangle","isRectangleAligned","extend_1","hasWarnedTooMuchOutside","rect","heightVector","tl","tr","bl","br","xL","xR","yT","qx","qy","qw","qh","pointIsInQuad","QuadTree","containers","OUTSIDE_BLOCK","lastRectangle","boundaries","resize","maxLevel","block","topLeftBlock","topRightBlock","bottomLeftBlock","bottomRightBlock","collidingWithTopLeft","collidingWithTopRight","collidingWithBottomLeft","collidingWithBottomRight","collisions","insertNode","hw","buildQuadrants","point","rectangle","lr","collectedNodes","getNodesInAxisAlignedRectangleArea","Sigma","sigma_1","camera_1","quadtree_1","mouse_1","edgeData","sourceData","targetData","edgeLabelSize","font","edgeLabelFont","edgeLabelWeight","edgeLabelColor","attribute","label","fillStyle","cx","cy","sSize","tSize","sx","sy","tx","ty","textLength","measureText","acos","asin","save","translate","rotate","fillText","restore","label_1","labelSize","labelFont","labelWeight","shadowOffsetX","shadowOffsetY","shadowBlur","shadowColor","textWidth","boxWidth","boxHeight","radius","angleRadian","xDeltaCoord","beginPath","moveTo","lineTo","arc","closePath","labelColor","createEdgeCompoundProgram","AbstractEdgeProgram","gl","vertexShaderSource","fragmentShaderSource","points","AbstractProgram","programClasses","EdgeCompoundProgram","programs","ProgramClass","bufferData","program","allocate","capacity","computeIndices","render","hidden","createNodeCompoundProgram","AbstractNodeProgram","positionLocation","getAttribLocation","sizeLocation","colorLocation","matrixLocation","getUniformLocation","ratioLocation","scaleLocation","enableVertexAttribArray","vertexAttribPointer","FLOAT","BYTES_PER_ELEMENT","UNSIGNED_BYTE","NodeCompoundProgram","createBuffer","bindBuffer","ARRAY_BUFFER","vertexShader","loadVertexShader","fragmentShader","loadFragmentShader","loadProgram","DYNAMIC_DRAW","hasNothingToRender","edge_1","edge_arrowHead_1","edge_clamped_1","EdgeArrowProgram","edge_arrowHead_vert_glsl_1","edge_arrowHead_frag_glsl_1","EdgeArrowHeadProgram","normalLocation","radiusLocation","barycentricLocation","sqrtZoomRatioLocation","correctionRatioLocation","i_1","POINTS","thickness","floatColor","len","useProgram","uniformMatrix3fv","uniform1f","correctionRatio","drawArrays","TRIANGLES","edge_clamped_vert_glsl_1","edge_frag_glsl_1","EdgeClampedProgram","indicesBuffer","canUse32BitsIndices","IndicesArray","indicesArray","indicesType","UNSIGNED_INT","UNSIGNED_SHORT","ELEMENT_ARRAY_BUFFER","STATIC_DRAW","drawElements","edge_vert_glsl_1","EdgeProgram","node_fast_vert_glsl_1","node_fast_frag_glsl_1","NodeFastProgram","loadShader","glType","VERTEX_SHADER","FRAGMENT_SHADER","shader","createShader","shaderSource","compileShader","getShaderParameter","COMPILE_STATUS","infoLog","getShaderInfoLog","deleteShader","shaders","createProgram","attachShader","linkProgram","getProgramParameter","LINK_STATUS","deleteProgram","resolveSettings","DEFAULT_EDGE_PROGRAM_CLASSES","DEFAULT_NODE_PROGRAM_CLASSES","hover_1","edge_label_1","node_fast_1","edge_arrow_1","hideEdgesOnMove","hideLabelsOnMove","renderLabels","renderEdgeLabels","defaultNodeColor","defaultNodeType","defaultEdgeColor","defaultEdgeType","stagePadding","labelDensity","labelGridCellSize","labelRenderedSizeThreshold","nodeReducer","edgeReducer","zIndex","minCameraRatio","maxCameraRatio","labelRenderer","hoverRenderer","edgeLabelRenderer","nodeProgramClasses","nodeHoverProgramClasses","edgeProgramClasses","arrow","line","resolvedSettings","__values","labels_1","settings_1","touch_1","matrices_1","edge_collisions_1","applyNodeDefaults","highlighted","forceLabel","applyEdgeDefaults","elements","canvasContexts","webGLContexts","activeListeners","quadtree","labelGrid","nodeDataCache","edgeDataCache","nodesWithForcedLabels","edgesWithForcedLabels","nodeExtent","invMatrix","customBBox","normalizationFunction","createNormalizationFunction","cameraSizeRatio","pixelRatio","getPixelRatio","displayedLabels","hoveredEdge","renderFrame","renderHighlightedNodesFrame","needToProcess","needToSoftProcess","checkEdgesEventsFrame","nodePrograms","nodeHoverPrograms","edgePrograms","validateGraph","HTMLElement","createWebGLContext","preserveDrawingBuffer","createCanvasContext","blendFunc","ONE","ONE_MINUS_SRC_ALPHA","BLEND","NodeProgramClass","NodeHoverProgram","hoverNodes","EdgeProgramClass","bindCameraHandlers","mouseCaptor","touchCaptor","bindEventHandlers","bindGraphHandlers","handleSettingsUpdate","createCanvas","canvas","createElement","class","appendChild","getContext","antialias","contextOptions","_scheduleRefresh","mouseIsOnNode","nodeX","nodeY","getQuadNodes","mouseGraphPosition","getNodeAtPosition","quadNodes","minDistance","nodeAtPosition","nodePosition","framedGraphToViewport","scaleSize","handleResize","baseEvent","nodeToHover","scheduleHighlightedNodesRender","checkEdgeHoverEvents","createMouseListener","eventType","getEdgeAtPoint","graphUpdate","softGraphUpdate","dropNodeGraphUpdate","dropEdgeGraphUpdate","clearEdgesGraphUpdate","clearGraphUpdate","unbindGraphHandlers","edgeToHover","e_1","isPixelColored","viewportToGraph","graphX","graphY","transformationRatio","someEdge","sourceId","targetId","xs","ys","graphLength","graphToViewport","vp_xs","vp_ys","vp_xt","vp_yt","viewportLength","filterEdges","edgeAttributes","sourcePosition","targetPosition","doEdgeCollideWithPoint","selectedEdge","highestZIndex","edges_1","edges_1_1","getEdgeAttribute","e_1_1","return","keepArrays","nodeZExtent","edgeZExtent","graphExtent","nullCamera","nullCameraMatrix","matrixFromCamera","getGraphDimensions","getSetting","nodesPerPrograms","applyTo","zIndexOrdering","nodeProgram","edgesPerPrograms","_refresh","labelsToDisplay","edgeLabels","clearRect","edgeLabelsToDisplay","renderHighlightedNodes","hovers","nodesToRender","COLOR_BUFFER_BIT","exitRender","updateCachedValues","moving","viewportDimensions","graphDimensions","getMatrixImpact","getContainer","setGraph","extent","getEdgeDisplayData","updateSetting","previousWidth","previousHeight","element","viewport","scheduleRefresh","viewportTarget","graphMousePosition","graphCenterPosition","viewRectangle","marginX","marginY","p1","p2","coordinates","override","recomputeMatrix","viewportPos","multiplyVec2","viewportPoint","inverse","graphPoint","getBBox","getCustomBBox","setCustomBBox","firstChild","removeChild","getCanvases","rawEmitter","animateNodes","index_1","targets","startPositions","attrs","getNodeAttribute","frame","HTML_COLORS","black","silver","gray","white","maroon","red","purple","fuchsia","green","lime","olive","yellow","navy","blue","teal","aqua","darkblue","mediumblue","darkgreen","darkcyan","deepskyblue","darkturquoise","mediumspringgreen","springgreen","cyan","midnightblue","dodgerblue","lightseagreen","forestgreen","seagreen","darkslategray","darkslategrey","limegreen","mediumseagreen","turquoise","royalblue","steelblue","darkslateblue","mediumturquoise","indigo","darkolivegreen","cadetblue","cornflowerblue","rebeccapurple","mediumaquamarine","dimgray","dimgrey","slateblue","olivedrab","slategray","slategrey","lightslategray","lightslategrey","mediumslateblue","lawngreen","chartreuse","aquamarine","skyblue","lightskyblue","blueviolet","darkred","darkmagenta","saddlebrown","darkseagreen","lightgreen","mediumpurple","darkviolet","palegreen","darkorchid","yellowgreen","sienna","brown","darkgray","darkgrey","lightblue","greenyellow","paleturquoise","lightsteelblue","powderblue","firebrick","darkgoldenrod","mediumorchid","rosybrown","darkkhaki","mediumvioletred","indianred","peru","chocolate","tan","lightgray","lightgrey","thistle","orchid","goldenrod","palevioletred","crimson","gainsboro","plum","burlywood","lightcyan","lavender","darksalmon","violet","palegoldenrod","lightcoral","khaki","aliceblue","honeydew","azure","sandybrown","wheat","beige","whitesmoke","mintcream","ghostwhite","salmon","antiquewhite","linen","lightgoldenrodyellow","oldlace","magenta","deeppink","orangered","tomato","hotpink","coral","darkorange","lightsalmon","orange","lightpink","pink","gold","peachpuff","navajowhite","moccasin","bisque","mistyrose","blanchedalmond","papayawhip","lavenderblush","seashell","cornsilk","lemonchiffon","floralwhite","snow","lightyellow","ivory","cubicInOut","cubicOut","cubicIn","quadraticInOut","quadraticOut","quadraticIn","linear","easings","pixels","readPixels","drawingBufferHeight","RGBA","xS","yS","xT","extractPixel","getCorrectionRatio","floatArrayColor","parseColor","assignDeep","is_graph_1","data_1","_i","requestID","devicePixelRatio","dX","dY","zA","zB","INT8","INT32","FLOAT32","RGBA_TEST_REGEX","RGBA_EXTRACT_REGEX","val","FLOAT_COLOR_CACHE","htmlColor","parsed","viewportRatio","graphRatio","WebGL2RenderingContext","getExtension","a00","a01","a02","a10","a11","a12","a20","a21","a22","b00","b01","b02","b10","b11","b12","b20","b21","b22","b0","b1"],"sourceRoot":""}