{"version":3,"file":"static/js/vendors-20cce568.fcf95805.js","mappings":"mGAoBAA,EAAOC,QARP,SAAmBC,GACjB,SAAKA,IAASA,EAAKC,gBAIZD,EAAKE,WAAaC,KAAKC,YAChC,C,aCEAN,EAAOC,QAJP,SAAwBM,GACtB,MAAiB,YAAVA,IAAiC,IAAVA,CAChC,C,mBCNA,IAAIC,EAAYC,EAAQ,QAUxBT,EAAOC,QARP,SAA6BC,GAC3B,SAAKA,IAASA,EAAKC,iBAIZK,EAAUN,IAA2B,MAAlBA,EAAKQ,SACjC,C,mBCRA,IAAIF,EAAYC,EAAQ,QAUxBT,EAAOC,QARP,SAAyBC,GACvB,SAAKA,IAASA,EAAKC,iBAIZK,EAAUN,IAA2B,OAAlBA,EAAKQ,SACjC,C,aCQAV,EAAOC,QAhBP,SAAuBC,GACrB,SAAKA,IAASA,EAAKC,iBAIdD,EAAKC,cAAcQ,YAIpBT,aAAgBA,EAAKC,cAAcQ,YAAYC,YAH1CV,aAAgBU,YAQ3B,C,mBCdA,IAAIJ,EAAYC,EAAQ,QAUxBT,EAAOC,QARP,SAA4BC,GAC1B,SAAKA,IAASA,EAAKC,iBAIZK,EAAUN,IAA2B,QAAlBA,EAAKQ,SACjC,C,aCaAV,EAAOC,QArBP,SAA0BY,GAExB,IAAKA,KAAY,kBAAmBA,GAClC,OAAO,EAGT,GAAI,kBAAmBA,EAAQ,CAC7B,IAAIX,EAAOW,EAEX,IAAKX,EAAKC,cAAcQ,YACtB,OAAOT,aAAgBG,KAGzB,GAAIH,aAAgBA,EAAKC,cAAcQ,YAAYN,KACjD,OAAO,CAEX,CAEA,OAAO,CACT,C,YCWAL,EAAOC,QA9BP,SAAgCa,GAC9B,IAAIC,EAAYD,EAAYE,eACxBC,EAAYF,EAAUG,eACtBC,EAAYL,EAAYM,aAAaH,GACrCI,EAASN,EAAUO,iBACnBC,GAAY,EAsBhB,OArBAJ,EAAUK,MAAK,SAAUC,GACvB,OAAIJ,IAAWI,EAAQC,IAAI,UACzBH,GAAY,GACL,GAGLF,EAASI,EAAQC,IAAI,QAChBD,EAAQC,IAAI,UAAUF,MAAK,SAAUG,GAC1C,IAAIC,EAAYD,EAAKD,IAAI,SAEzB,OAAIL,IAAWO,IACbL,GAAY,GACL,EAIX,GAIJ,IACOA,CACT,C,mBC5BA,IAAIM,EAAOpB,EAAQ,QAMnBT,EAAOC,QAJP,SAA4B6B,GAC1B,OAAOA,EAAEC,QAAUF,EAAKG,SAAWF,EAAEG,iBAAiB,UAAYH,EAAEG,iBAAiB,QAAUH,EAAEG,iBAAiB,WACpH,C,mBCJA,IAAIC,EAAczB,EAAQ,QAEtB0B,EAA2B1B,EAAQ,QAEnC2B,EAAmC3B,EAAQ,QAE3C4B,EAAwB5B,EAAQ,QAEhC6B,EAAyB7B,EAAQ,QA4BrCT,EAAOC,QA1BP,SAA0Ca,EAAagB,GACrD,IAAIS,EAAeD,EAAuBxB,GAAa,SAAU0B,GAC/D,IAAIzB,EAAYyB,EAAcxB,eAE9B,GAAID,EAAU0B,eAAiD,IAAhC1B,EAAU2B,kBACvC,OAAOL,EAAsBG,EAAe,GAG9C,IAMIG,EANgBb,EAAEc,cAAczC,cACHQ,YAAYK,eAKpB6B,WAAW,GAEpC,OADAF,EAAQR,EAAyBQ,GAC1BP,EAAiCI,EAAe,KAAMG,EAAMG,aAAcH,EAAMI,UAAWJ,EAAMK,eAAgBL,EAAMM,aAAaC,cAC7I,GAAG,YAEH,OAAIX,IAAiBzB,EAAYqC,oBACxBrC,EAGFoB,EAAYkB,KAAKtC,EAAayB,EAAc,eACrD,C,mBClCA,IAAIc,EAAqB5C,EAAQ,QAE7ByB,EAAczB,EAAQ,QAEtB4B,EAAwB5B,EAAQ,QAEhC6B,EAAyB7B,EAAQ,QA8BrCT,EAAOC,QAvBP,SAAiCa,GAC/B,IAAIyB,EAAeD,EAAuBxB,GAAa,SAAU0B,GAC/D,IAAIzB,EAAYyB,EAAcxB,eAC1BK,EAASN,EAAUO,iBAEvB,GAAe,IAAXD,EACF,OAAOgB,EAAsBG,EAAe,GAG9C,IAAIc,EAAMvC,EAAUwC,cAEhBC,EADUhB,EAAcW,oBACTM,eAAeH,GAAKI,UAAUC,MAAM,EAAGtC,GACtDuC,EAAWP,EAAmBQ,YAAYL,GAC9C,OAAOnB,EAAsBG,EAAeoB,EAASE,QAAU,EACjE,GAAG,YAEH,OAAIvB,IAAiBzB,EAAYqC,oBACxBrC,EAGFoB,EAAYkB,KAAKtC,EAAayB,EAAc,eACrD,C,mBClCA,IAAIc,EAAqB5C,EAAQ,QAE7ByB,EAAczB,EAAQ,QAEtBsD,EAAuBtD,EAAQ,QAE/B6B,EAAyB7B,EAAQ,QA0BrCT,EAAOC,QAnBP,SAA8Ba,GAC5B,IAAIyB,EAAeD,EAAuBxB,GAAa,SAAU0B,GAC/D,IAAIzB,EAAYyB,EAAcxB,eAC1BK,EAASN,EAAUO,iBACnBgC,EAAMvC,EAAUwC,cAEhBC,EADUhB,EAAcW,oBACTM,eAAeH,GAAKI,UAAUC,MAAMtC,GACnDuC,EAAWP,EAAmBW,WAAWR,GAE7C,OAAOO,EAAqBvB,EAAeoB,EAASE,QAAU,EAChE,GAAG,WAEH,OAAIvB,IAAiBzB,EAAYqC,oBACxBrC,EAGFoB,EAAYkB,KAAKtC,EAAayB,EAAc,eACrD,C,mBC9BA,IAAI0B,EAAgBxD,EAAQ,QAExByB,EAAczB,EAAQ,QAO1BT,EAAOC,QALP,SAAiCa,GAC/B,IAAIoD,EAAeD,EAAcE,WAAWrD,EAAYqC,oBAAqBrC,EAAYE,gBACzF,OAAOkB,EAAYkB,KAAKtC,EAAaoD,EAAc,cACrD,C,kBCPA,IAAIhC,EAAczB,EAAQ,QAuB1BT,EAAOC,QAjBP,SAA6Ca,GAC3C,IAAIC,EAAYD,EAAYE,eACxBoD,EAASrD,EAAUsD,YAEnBC,EADUxD,EAAYqC,oBACDM,eAAeW,GAAQG,YAChD,OAAOrC,EAAYsC,IAAI1D,EAAa,CAClCC,UAAWA,EAAU0D,MAAM,CACzBxD,UAAWmD,EACXM,aAAcJ,EACdK,SAAUP,EACVQ,YAAaN,EACbO,YAAY,IAEdC,gBAAgB,GAEpB,C,mBCrBA,IAAI5C,EAAczB,EAAQ,QAuB1BT,EAAOC,QAfP,SAA+Ca,GAC7C,IAAIC,EAAYD,EAAYE,eACxB+D,EAAWhE,EAAUwC,cACzB,OAAOrB,EAAYsC,IAAI1D,EAAa,CAClCC,UAAWA,EAAU0D,MAAM,CACzBxD,UAAW8D,EACXL,aAAc,EACdC,SAAUI,EACVH,YAAa,EACbC,YAAY,IAEdC,gBAAgB,GAEpB,C,kBCrBA,IAAI5C,EAAczB,EAAQ,QAEtBuE,EAAevE,EAAQ,QAEvB4B,EAAwB5B,EAAQ,QAEhC6B,EAAyB7B,EAAQ,QA0BrCT,EAAOC,QAlBP,SAAkCa,GAChC,IAAIyB,EAAeD,EAAuBxB,GAAa,SAAU0B,GAC/D,IAAIzB,EAAYyB,EAAcxB,eAC1BiE,EAAUzC,EAAcW,oBACxBG,EAAMvC,EAAUG,eAChBG,EAASN,EAAU2B,kBACnBwC,EAAaD,EAAQxB,eAAeH,GAAKI,UAAUrC,EAAS,GAChE,OAAOgB,EAAsBG,EAAe0C,EAAaF,EAAaG,eAAeD,EAAY,GAAK,EACxG,GAAG,YAEH,GAAI3C,IAAiBzB,EAAYqC,oBAC/B,OAAOrC,EAGT,IAAIC,EAAYD,EAAYE,eAC5B,OAAOkB,EAAYkB,KAAKtC,EAAayB,EAAaiC,IAAI,kBAAmBzD,GAAYA,EAAU0B,cAAgB,sBAAwB,eACzI,C,mBC9BA,IAAIP,EAAczB,EAAQ,QAEtBuE,EAAevE,EAAQ,QAEvBsD,EAAuBtD,EAAQ,QAE/B6B,EAAyB7B,EAAQ,QA0BrCT,EAAOC,QAlBP,SAA+Ba,GAC7B,IAAIyB,EAAeD,EAAuBxB,GAAa,SAAU0B,GAC/D,IAAIzB,EAAYyB,EAAcxB,eAC1BiE,EAAUzC,EAAcW,oBACxBG,EAAMvC,EAAUG,eAChBG,EAASN,EAAU2B,kBACnB0C,EAAYH,EAAQxB,eAAeH,GAAKI,UAAUrC,GACtD,OAAO0C,EAAqBvB,EAAe4C,EAAYJ,EAAaG,eAAeC,EAAW,GAAK,EACrG,GAAG,WAEH,GAAI7C,IAAiBzB,EAAYqC,oBAC/B,OAAOrC,EAGT,IAAIC,EAAYD,EAAYE,eAC5B,OAAOkB,EAAYkB,KAAKtC,EAAayB,EAAaiC,IAAI,kBAAmBzD,GAAYA,EAAU0B,cAAgB,mBAAqB,eACtI,C,mBC9BA,IAAIwB,EAAgBxD,EAAQ,QAExByB,EAAczB,EAAQ,QAEtB4E,EAA0B5E,EAAQ,QA0DtCT,EAAOC,QAlDP,SAAuCa,GACrC,IAAIC,EAAYD,EAAYE,eAE5B,IAAKD,EAAU0B,cACb,OAAO3B,EAGT,IAAIO,EAASN,EAAU2B,kBAEvB,GAAe,IAAXrB,EACF,OAAOP,EAGT,IASIwE,EACAC,EAVAC,EAAWzE,EAAUG,eACrB+D,EAAUnE,EAAYqC,oBAEtBW,EADQmB,EAAQxB,eAAe+B,GAChBjB,YAEnB,GAAIT,GAAU,EACZ,OAAOhD,EAMLO,IAAWyC,GAEbwB,EAAevE,EAAUyD,IAAI,eAAgBnD,EAAS,GACtDkE,EAAiBxE,GAGjBwE,GADAD,EAAevE,EAAUyD,IAAI,cAAenD,EAAS,IACvBmD,IAAI,eAAgBnD,EAAS,GAK7D,IAAIoE,EAAgBJ,EAAwBJ,EAASK,GACjD/C,EAAe0B,EAAcyB,YAAYT,EAASK,EAAc,YAEhEK,EAAiBpD,EAAaqD,oBAC9BC,EAAeF,EAAejD,kBAAoB,EAClDoD,EAAcH,EAAelB,MAAM,CACrCC,aAAcmB,EACdjB,YAAaiB,IAEXE,EAAc9B,EAAc+B,oBAAoBzD,EAAcuD,EAAaL,GAC3EQ,EAAiB/D,EAAYkB,KAAKtC,EAAaiF,EAAa,mBAChE,OAAO7D,EAAYgE,gBAAgBD,EAAgBV,EACrD,C,mBC5DA,IAAIrD,EAAczB,EAAQ,QAoC1BT,EAAOC,QAlCP,SAAwB6B,EAAGhB,EAAaqF,GACtC,IAAIC,EAAclE,EAAYmE,KAAKvF,GAKnC,GAAwC,sBAApCA,EAAYwF,oBAShBxE,EAAEyE,iBAEGzF,EAAY0F,8BAOjBL,EAASjE,EAAYsC,IAAI1D,EAAa,CACpC2F,wBAAyB,QAI3BC,YAAW,WACTP,EAASC,EACX,GAAG,IAbDD,EAASC,OAZX,CACE,IAAIK,EAA0BL,EAAYjD,oBAC1CgD,EAASjE,EAAYsC,IAAI4B,EAAa,CACpCK,wBAAyBA,IAG7B,CAoBF,C,mBClCA,IAEIE,EAFYlG,EAAQ,QAEJkG,IAkBpB3G,EAAOC,QAhBP,SAAoCiE,EAAchB,EAAgB0D,GAChE,IAAI7B,EAAW7B,EAAeK,cAC1Ba,EAASlB,EAAemB,YACxBwC,EAAW3C,EAAa4C,cACxBC,EAAYF,EAASG,QAAQC,WAAU,SAAUC,EAAGC,GACtD,OAAOA,IAAMpC,CACf,IAAGqC,WAAU,SAAUF,EAAGC,GACxB,OAAOA,IAAM/C,CACf,IAAGiD,OAAOV,EAAI,CAAC,CAACvC,EAAQyC,EAASnF,IAAI0C,OAAYkD,IAAIV,GACrD,OAAO1C,EAAaO,MAAM,CACxBoC,SAAUA,EAASpC,MAAMsC,GACzBQ,gBAAiBrE,EACjByC,eAAgBzC,GAEpB,C,mBClBA,IAAIsE,EAAmB/G,EAAQ,QAE3BgH,EAA2BhH,EAAQ,QAEnCiH,EAAYjH,EAAQ,QAEpBkH,EAAYlH,EAAQ,QAEpBmH,EAAaF,EAAUE,WACvBC,EAAOH,EAAUG,KAEjBC,EAAiB,SAAwBxE,EAAKuD,EAAUkB,GAC1D,GAAKzE,EAAL,CAIA,IAAI0E,EAAQnB,EAASnF,IAAI4B,GAEpB0E,GAILnB,EAASrC,IAAIlB,EAAKyE,EAAKC,GARvB,CASF,EAEIC,EAAsB,SAA6BpB,EAAUqB,EAAwBC,EAAqBC,EAAeC,GAC3H,IAAKA,EACH,OAAOxB,EAIT,IAAIyB,EAA0C,UAAlBF,EACxBG,EAAmBL,EAAuBM,SAC1CC,EAAoBN,EAAoBK,SACxCE,EAAoBR,EAAuBS,eAC3CC,EAAyBV,EAAuBW,oBAChDC,EAAyBZ,EAAuBa,oBAChDC,EAAeb,EAAoBQ,eACnCM,EAAoBX,EAAwBH,EAAoBU,oBAAsBJ,EACtFS,EAAoBZ,EAAwBG,EAAoBN,EAAoBY,oBACxF,OAAOlC,EAASsC,eAAc,SAAUC,GAEtCtB,EAAeY,EAAmBU,GAAQ,SAAUpB,GAClD,IAAIqB,EAAqBrB,EAAMsB,eAC/B,OAAOtB,EAAMvD,MAAM,CACjB8E,SAAUF,EAA2B,OAAEA,EAAmBG,QAAQjB,KAEtE,IAEAT,EAAegB,EAAwBM,GAAQ,SAAUpB,GACvD,OAAOA,EAAMvD,MAAM,CACjBgF,YAAab,GAEjB,IAEAd,EAAec,EAAwBQ,GAAQ,SAAUpB,GACvD,OAAOA,EAAMvD,MAAM,CACjBiF,YAAaZ,GAEjB,IAEAhB,EAAemB,EAAmBG,GAAQ,SAAUpB,GAClD,OAAOA,EAAMvD,MAAM,CACjBiF,YAAanB,GAEjB,IAEAT,EAAeoB,EAAmBE,GAAQ,SAAUpB,GAClD,OAAOA,EAAMvD,MAAM,CACjBgF,YAAalB,GAEjB,IAEAT,EAAekB,EAAcI,GAAQ,SAAUpB,GAC7C,IAAI2B,EAAwB3B,EAAMsB,eAC9BM,EAAmBD,EAAsBH,QAAQf,GACjDoB,EAAiBvB,EAAwBsB,EAAmB,EAAyB,IAArBA,EAAyBA,EAAmB,EAAI,EAChHE,EAAmBH,EAAsBI,UAE7C,OADAD,EAAiBE,OAAOH,EAAgB,EAAGtB,GACpCP,EAAMvD,MAAM,CACjB8E,SAAU1B,EAAKiC,IAEnB,IAEAhC,EAAeS,EAAkBa,GAAQ,SAAUpB,GACjD,OAAOA,EAAMvD,MAAM,CACjBgF,YAAaR,EACbS,YAAaR,EACbe,OAAQjB,GAEZ,GACF,GACF,EA+DAhJ,EAAOC,QA7DuB,SAAiCiE,EAAcgG,EAAgBC,EAAa/B,GACpF,YAAlBA,GAAgIT,GAAU,GAC5I,IAAIyC,EAAYD,EAAY3B,SACxBhD,EAAW0E,EAAe1B,SAC5BhD,IAAa4E,GAAiHzC,GAAU,GAC1I,IAAId,EAAW3C,EAAa4C,cACxBuB,EAA0B6B,aAA0B1C,EACpD6C,EAAkB,CAACH,GACnBI,EAAiCzD,EAAiB,OAAErB,GAEpD6C,IACFgC,EAAkB,GAClBC,EAAiCzD,EAASsC,eAAc,SAAUC,GAChE,IAAImB,EAAiBL,EAAerB,oBAChC2B,EAAwB/C,EAAyByC,EAAgBd,GACrEA,EAAOpC,QAAQC,WAAU,SAAUe,GACjC,OAAOA,EAAMQ,WAAahD,CAC5B,IAAGiF,WAAU,SAAUzC,GACrB,IAAI1E,EAAM0E,EAAMQ,SACZkC,EAAmBpH,IAAQkC,EAC3BmF,EAAoCJ,GAAkBjH,IAAQiH,EAC9DK,GAA2CL,GAAkBvC,EAAMW,kBAAoB6B,GAAyBlH,IAAQkH,GAC5H,SAAUE,GAAoBC,GAAqCC,EACrE,IAAGC,SAAQ,SAAU7C,GACnBqC,EAAgBjH,KAAK4E,GACrBoB,EAAe,OAAEpB,EAAMQ,SACzB,GACF,KAGF,IAAIsC,EAAeR,EAA+BtD,QAAQI,WAAU,SAAU2D,GAC5E,OAAOA,IAAMZ,CACf,IACIa,EAAcV,EAA+BtD,QAAQC,WAAU,SAAU8D,GAC3E,OAAOA,IAAMZ,CACf,IAAGc,KAAK,GACJC,EAAeb,EAAgB/C,KAAI,SAAUU,GAC/C,MAAO,CAACA,EAAMQ,SAAUR,EAC1B,IACIjB,EAAYa,IAEhB,GAAsB,WAAlBQ,EAA4B,CAC9B,IAAI+C,EAAcjH,EAAakH,eAAehB,GAC3Ce,GAAeA,EAAY3C,WAAa0B,EAAe1B,UAAgHb,GAAU,GACpLZ,EAAY+D,EAAazD,OAAO,GAAGA,OAAO6D,EAAc,CAAC,CAACd,EAAWD,KAAgBa,GAAaK,cACpG,MAAO,GAAsB,UAAlBjD,EAA2B,CACpC,IAAIkD,EAAapH,EAAaqH,cAAcnB,GACzCkB,GAAcA,EAAW9C,WAAahD,GAAgHmC,GAAU,GACnKZ,EAAY+D,EAAazD,OAAO,CAAC,CAAC+C,EAAWD,IAAc9C,OAAO6D,GAAeF,GAAaK,cAChG,CAEA,OAAOnH,EAAaO,MAAM,CACxBoC,SAAUoB,EAAoBlB,EAAWmD,EAAgBC,EAAa/B,EAAeC,GACrFd,gBAAiBrD,EAAa0B,oBAC9BD,eAAgBzB,EAAa0B,oBAAoBnB,MAAM,CACrDxD,UAAWuE,EACXb,SAAUa,KAGhB,C,mBCzJc/E,EAAQ,QA0CtBT,EAAOC,QA/BP,SAA+Ba,EAAa0K,GAC1C,IAAIzK,EAAYD,EAAYE,eAGxBiE,EAAUnE,EAAYqC,oBACtBG,EAAMvC,EAAUwC,cAChBlC,EAASN,EAAUO,iBACnBqD,EAAWrB,EACXsB,EAAc,EAElB,GAAI4G,EAAcnK,EAAQ,CACxB,IAAIoK,EAAYxG,EAAQyG,aAAapI,GAErC,GAAiB,MAAbmI,EACF9G,EAAWrB,OAEXqB,EAAW8G,EAEX7G,EADkBK,EAAQxB,eAAegI,GACf/H,UAAUI,MAExC,MACEc,EAAcvD,EAASmK,EAGzB,OAAOzK,EAAU0D,MAAM,CACrBE,SAAUA,EACVC,YAAaA,EACbC,YAAY,GAEhB,C,mBCxCcpE,EAAQ,QAmCtBT,EAAOC,QAxBP,SAA8Ba,EAAa0K,GACzC,IAOI5G,EAPA7D,EAAYD,EAAYE,eAGxBsC,EAAMvC,EAAUwC,cAChBlC,EAASN,EAAUO,iBACnB2D,EAAUnE,EAAYqC,oBACtBwB,EAAWrB,EAWf,OAPIkI,EAFQvG,EAAQxB,eAAeH,GAEXI,UAAUI,OAASzC,GACzCsD,EAAWM,EAAQ0G,YAAYrI,GAC/BsB,EAAc,GAEdA,EAAcvD,EAASmK,EAGlBzK,EAAU0D,MAAM,CACrBE,SAAUA,EACVC,YAAaA,GAEjB,C,mBCjCA,IAAI4C,EAAmB/G,EAAQ,QAE3BmL,EAAoBnL,EAAQ,OAI5BmH,EAFYnH,EAAQ,QAEGmH,WA0F3B5H,EAAOC,QAVqB,SAA+B4G,GAGzD,OAF0BA,EAASgF,kBAAmBrE,EA/EpB,SAAuCX,GACzE,IAEIiF,EAFAC,EAAa,CAAC,EAGlB,OAAOnE,EAAWf,EAASsC,eAAc,SAAU6C,GACjDA,EAAcnB,SAAQ,SAAU7C,EAAOiE,GACrC,IAAIC,EAASlE,EAAMQ,SACf2D,EAAUnE,EAAMa,oBAChBuD,EAAUpE,EAAMe,oBAChBsD,EAAerE,EAAMsB,eACrBgD,EAAYtE,EAAMW,eAElBrF,EAAMsI,IA0BV,GAxBAG,EAAWG,GAAU5I,EAEjB6I,IACcH,EAActK,IAAIyK,GAGhCH,EAAcO,MAAM,CAACJ,EAAS,eAAgB7I,GAG9C0I,EAAcO,MAAM,CAACL,EAAQ,eAAgB,OAI7CE,IACcJ,EAActK,IAAI0K,GAGhCJ,EAAcO,MAAM,CAACH,EAAS,eAAgB9I,GAG9C0I,EAAcO,MAAM,CAACL,EAAQ,eAAgB,OAI7CI,GAAaN,EAActK,IAAI4K,GAAY,CAC7C,IACIjD,EADc2C,EAActK,IAAI4K,GACChD,eACrC0C,EAAcO,MAAM,CAACD,EAAW,YAAajD,EAAmB7E,IAAI6E,EAAmBG,QAAQxB,EAAMQ,UAAWlF,GAClH,MAEE0I,EAAcO,MAAM,CAACL,EAAQ,UAAW,MAEpCJ,IACFE,EAAcO,MAAM,CAACT,EAActD,SAAU,eAAgBlF,GAC7D0I,EAAcO,MAAM,CAACL,EAAQ,eAAgBH,EAAWD,EAActD,YAGxEsD,EAAgBE,EAActK,IAAIwK,GAGpCG,EAAaxB,SAAQ,SAAU2B,GACZR,EAActK,IAAI8K,GAGjCR,EAAcO,MAAM,CAACC,EAAU,UAAWlJ,GAE1C0I,EAAcO,MAAM,CAACL,EAAQ,YAAalE,EAAMsB,eAAemD,QAAO,SAAUC,GAC9E,OAAOA,IAAUF,CACnB,IAEJ,GACF,GACF,IAAGzC,UAAUzC,KAAI,SAAUU,GACzB,MAAO,CAAC+D,EAAW/D,EAAMQ,UAAWR,EAAMxD,IAAI,MAAOuH,EAAW/D,EAAMQ,WACxE,IACF,CAgBSmE,CAA8B9F,GAdP,SAAmCA,GACjE,OAAOe,EAAWf,EAASkD,UAAUzC,KAAI,SAAUU,GACjD,IAAI1E,EAAMsI,IACV,MAAO,CAACtI,EAAK0E,EAAMxD,IAAI,MAAOlB,GAChC,IACF,CAMWsJ,CAA0B/F,EAIrC,C,mBC9FA,IAAIgG,EAAoBpM,EAAQ,QAE5BqM,EAAsBrM,EAAQ,QAE9BkH,EAAYlH,EAAQ,QA2ExB,SAASsM,EAAeC,EAAWhF,EAAO3G,GACxC,IAAI4L,EAAQjF,EAAMkF,mBACdC,EAAa9L,EAAS,EAAI4L,EAAMvL,IAAIL,EAAS,QAAK+L,EAClDC,EAAYhM,EAAS4L,EAAMK,QAAUL,EAAMvL,IAAIL,QAAU+L,EACzDG,EAAqBJ,EAAaA,EAAWK,iBAAcJ,EAC3DK,EAAoBJ,EAAYA,EAAUG,iBAAcJ,EAE5D,GAAIK,GAAqBA,IAAsBF,GAGd,YAFlBP,EAAUU,MAAMD,GAElBE,gBAA+B,CAOxC,IANA,IAIIC,EAJAC,EAzCV,SAAyBC,EAAYC,EAAW1M,GAC9C,IAAIiE,EA0BJ,OAlBAwH,EAAoBgB,GACpB,SAAUE,EAAGC,GACX,OAAOD,EAAER,cAAgBS,EAAET,WAC7B,IACA,SAAUU,GACR,OAAOA,EAAQV,cAAgBO,CACjC,IACA,SAAUI,EAAOC,GAEXD,GAAS9M,GAAU+M,GAAO/M,IAE5BiE,EAAe,CACb6I,MAAOA,EACPC,IAAKA,GAGX,IAC0B,iBAAjB9I,GAA2IqC,GAAU,GACvJrC,CACT,CAa6B+I,CAAgBpB,EAAOQ,EAAmBpM,GAC7D8M,EAAQN,EAAiBM,MACzBC,EAAMP,EAAiBO,IAIpBD,EAAQC,GACbR,EAAUX,EAAMvL,IAAIyM,GACpBlB,EAAQA,EAAMzI,IAAI2J,EAAOtB,EAAkByB,YAAYV,EAAS,OAChEO,IAGF,OAAOnG,EAAMxD,IAAI,gBAAiByI,EACpC,CAGF,OAAOjF,CACT,CAEAhI,EAAOC,QAvGP,SAA+BiE,EAAchB,GAC3C,IAAI2D,EAAW3C,EAAa4C,cACxBkG,EAAY9I,EAAaqK,eACzBC,EAAgB,CAAC,EACjBzJ,EAAW7B,EAAeK,cAC1BN,EAAcC,EAAe5B,iBAC7BmN,EAAa5H,EAASnF,IAAIqD,GAC1B2J,EAAe3B,EAAeC,EAAWyB,EAAYxL,GAErDyL,IAAiBD,IACnBD,EAAczJ,GAAY2J,GAG5B,IAAItK,EAASlB,EAAemB,YACxBtB,EAAYG,EAAeyL,eAC3BC,EAAW/H,EAASnF,IAAI0C,GAExBW,IAAaX,IACfwK,EAAWF,GAGb,IAAIG,EAAa9B,EAAeC,EAAW4B,EAAU7L,GAMrD,OAJI8L,IAAeD,IACjBJ,EAAcpK,GAAUyK,GAGrBC,OAAOC,KAAKP,GAAe1K,OAIzBI,EAAaO,MAAM,CACxBoC,SAAUA,EAASpC,MAAM+J,GACzB7I,eAAgBzC,IALTgB,EAAaM,IAAI,iBAAkBtB,EAO9C,C,mBCzCA,IAAIsE,EAAmB/G,EAAQ,QAE3BgH,EAA2BhH,EAAQ,QAEnCiH,EAAYjH,EAAQ,QAGpBkG,GADOe,EAAUG,KACXH,EAAUf,KAEhBmB,EAAiB,SAAwBxE,EAAKuD,EAAUkB,GAC1D,GAAKzE,EAAL,CAIA,IAAI0E,EAAQnB,EAASnF,IAAI4B,GAEpB0E,GAILnB,EAASrC,IAAIlB,EAAKyE,EAAKC,GARvB,CASF,EAOIgH,EAAmB,SAA0BxJ,EAAUqB,GACzD,IAAIoI,EAAU,GAEd,IAAKzJ,EACH,OAAOyJ,EAKT,IAFA,IAAIC,EAAYrI,EAASnF,IAAI8D,GAEtB0J,GAAaA,EAAUvG,gBAAgB,CAC5C,IAAI2D,EAAY4C,EAAUvG,eAEtB2D,GACF2C,EAAQ7L,KAAKkJ,GAGf4C,EAAY5C,EAAYzF,EAASnF,IAAI4K,GAAa,IACpD,CAEA,OAAO2C,CACT,EA2BIE,EAAsB,SAA6BnH,EAAOnB,EAAUuI,GACtE,IAAKpH,EACH,OAAO,KAOT,IAFA,IAAIqH,EAAsBD,EAAiB1N,IAAIsG,EAAMQ,UAAUK,oBAExDwG,IAAwBxI,EAASnF,IAAI2N,IAC1CA,EAAsBD,EAAiB1N,IAAI2N,GAAqBxG,qBAAuB,KAGzF,OAAOwG,CACT,EAEIC,EAAsB,SAA6BtH,EAAOnB,EAAUuI,GACtE,IAAKpH,EACH,OAAO,KAOT,IAFA,IAAIuH,EAAsBH,EAAiB1N,IAAIsG,EAAMQ,UAAUO,oBAExDwG,IAAwB1I,EAASnF,IAAI6N,IAC1CA,EAAsBH,EAAiB1N,IAAI6N,GAAqBxG,qBAAuB,KAGzF,OAAOwG,CACT,EAEItH,EAAsB,SAA6BpB,EAAU4H,EAAYG,EAAUQ,GACrF,OAAOvI,EAASsC,eAAc,SAAUC,GAyEtC,GAvEAtB,EAAe2G,EAAWjG,SAAUY,GAAQ,SAAUpB,GACpD,OAAOA,EAAMvD,MAAM,CACjBgF,YAAa0F,EAAoBnH,EAAOoB,EAAQgG,GAChD1F,YAAa4F,EAAoBtH,EAAOoB,EAAQgG,IAEpD,IAEAtH,EAAe8G,EAASpG,SAAUY,GAAQ,SAAUpB,GAClD,OAAOA,EAAMvD,MAAM,CACjBgF,YAAa0F,EAAoBnH,EAAOoB,EAAQgG,GAChD1F,YAAa4F,EAAoBtH,EAAOoB,EAAQgG,IAEpD,IAEAJ,EAAiBP,EAAWjG,SAAU4G,GAAkBvE,SAAQ,SAAUyB,GACxE,OAAOxE,EAAewE,EAAWlD,GAAQ,SAAUpB,GACjD,OAAOA,EAAMvD,MAAM,CACjB8E,SAAUvB,EAAMsB,eAAemD,QAAO,SAAUnJ,GAC9C,OAAO8F,EAAO1H,IAAI4B,EACpB,IACAmG,YAAa0F,EAAoBnH,EAAOoB,EAAQgG,GAChD1F,YAAa4F,EAAoBtH,EAAOoB,EAAQgG,IAEpD,GACF,IAEAtH,EAAe2G,EAAW5F,oBAAqBO,GAAQ,SAAUpB,GAC/D,OAAOA,EAAMvD,MAAM,CACjBiF,YAAa+E,EAAW1F,qBAE5B,IAEAjB,EAAe2G,EAAW1F,oBAAqBK,GAAQ,SAAUpB,GAC/D,OAAOA,EAAMvD,MAAM,CACjBgF,YAAa0F,EAAoBnH,EAAOoB,EAAQgG,IAEpD,IAEAtH,EAAe8G,EAAS/F,oBAAqBO,GAAQ,SAAUpB,GAC7D,OAAOA,EAAMvD,MAAM,CACjBiF,YAAa4F,EAAoBtH,EAAOoB,EAAQgG,IAEpD,IAEAtH,EAAe8G,EAAS7F,oBAAqBK,GAAQ,SAAUpB,GAC7D,OAAOA,EAAMvD,MAAM,CACjBgF,YAAamF,EAAS/F,qBAE1B,IAEAmG,EAAiBJ,EAASpG,SAAU4G,GAAkBvE,SAAQ,SAAUyB,GACtExE,EAAewE,EAAWlD,GAAQ,SAAUpB,GAC1C,OAAOA,EAAMvD,MAAM,CACjB8E,SAAUvB,EAAMsB,eAAemD,QAAO,SAAUnJ,GAC9C,OAAO8F,EAAO1H,IAAI4B,EACpB,IACAmG,YAAa0F,EAAoBnH,EAAOoB,EAAQgG,GAChD1F,YAAa4F,EAAoBtH,EAAOoB,EAAQgG,IAEpD,GACF,IAnH6B,SAAoCpH,EAAOnB,GAC1E,IAAI2I,EAAiB,GAErB,IAAKxH,EACH,OAAOwH,EAKT,IAFA,IAAIC,EAAgBhI,EAAyBO,EAAOnB,GAE7C4I,GAAiB5I,EAASnF,IAAI+N,IAAgB,CACnD,IAAIC,EAAS7I,EAASnF,IAAI+N,GAE1BD,EAAepM,KAAKqM,GAEpBA,EAAgBC,EAAO/G,eAAiBlB,EAAyBiI,EAAQ7I,GAAY,IACvF,CAEA,OAAO2I,CACT,CAmGIG,CAA2Bf,EAAUQ,GAAkBvE,SAAQ,SAAU+E,GACvE,OAAO9H,EAAe8H,EAAcxG,GAAQ,SAAUpB,GACpD,OAAOA,EAAMvD,MAAM,CACjBgF,YAAa0F,EAAoBnH,EAAOoB,EAAQgG,GAChD1F,YAAa4F,EAAoBtH,EAAOoB,EAAQgG,IAEpD,GACF,IAEyC,MAArCvI,EAASnF,IAAI+M,EAAWjG,WAAwD,MAAnC3B,EAASnF,IAAIkN,EAASpG,WAAqBoG,EAASjG,iBAAmB8F,EAAWjG,UAA4C,MAAhCoG,EAAS7F,oBAA6B,CACnL,IAAI8G,EAAiBpB,EAAW1F,oBAEhCjB,EAAe8G,EAASpG,SAAUY,GAAQ,SAAUpB,GAClD,OAAOA,EAAMvD,MAAM,CACjBiF,YAAamG,GAEjB,IACA/H,EAAe+H,EAAgBzG,GAAQ,SAAUpB,GAC/C,OAAOA,EAAMvD,MAAM,CACjBgF,YAAamF,EAASpG,UAE1B,IAEA,IAAIkB,EAAcmG,EAAiBhJ,EAASnF,IAAImO,GAAkB,KAC9D7G,EAAeU,EAAcA,EAAYf,eAAiB,KAU9D,GATA8F,EAAWnF,eAAeuB,SAAQ,SAAU2B,GAC1C1E,EAAe0E,EAAUpD,GAAQ,SAAUpB,GACzC,OAAOA,EAAMvD,MAAM,CACjBwF,OAAQjB,GAGZ,GACF,IAEoB,MAAhBA,EAAsB,CACxB,IAAI8G,EAAYjJ,EAASnF,IAAIsH,GAC7BlB,EAAekB,EAAcI,GAAQ,SAAUpB,GAC7C,OAAOA,EAAMvD,MAAM,CACjB8E,SAAUuG,EAAUxG,eAAejC,OAAOoH,EAAWnF,iBAEzD,GACF,CAGAxB,EAAe2G,EAAWnF,eAAeyG,MAAK,SAAUzM,GAEtD,OAAqC,OADzBuD,EAASnF,IAAI4B,GACZuF,mBACf,IAAIO,GAAQ,SAAUpB,GACpB,OAAOA,EAAMvD,MAAM,CACjBgF,YAAagF,EAAW5F,qBAE5B,GACF,CACF,GACF,EAsFImH,EAAiB,SAAwBC,EAAYhN,EAAaF,GACpE,GAAoB,IAAhBE,EACF,KAAOA,EAAcF,GACnBkN,EAAaA,EAAWC,QACxBjN,SAEG,GAAIF,IAAckN,EAAW3C,QAClC,KAAOvK,EAAYE,GACjBgN,EAAaA,EAAWE,MACxBpN,QAEG,CACL,IAAIqN,EAAOH,EAAWtM,MAAM,EAAGV,GAC3BoN,EAAOJ,EAAWtM,MAAMZ,GAC5BkN,EAAaG,EAAK/I,OAAOgJ,GAAMC,QACjC,CAEA,OAAOL,CACT,EAEAjQ,EAAOC,QAxG2B,SAAqCiE,EAAchB,GACnF,GAAIA,EAAeT,cACjB,OAAOyB,EAGT,IA6BIqM,EA7BA1J,EAAW3C,EAAa4C,cACxB/B,EAAW7B,EAAeK,cAC1BN,EAAcC,EAAe5B,iBAC7B8C,EAASlB,EAAemB,YACxBtB,EAAYG,EAAeyL,eAC3BF,EAAa5H,EAASnF,IAAIqD,GAC1B6J,EAAW/H,EAASnF,IAAI0C,GAExBiE,EAA0BoG,aAAsBjH,EAEhDgJ,EAAkB,GAEtB,GAAInI,EAAyB,CAC3B,IAAIoI,EAAuB7B,EAAStF,eAChCoH,EAAoB1B,EAAiB5K,EAAQyC,GAE7C+H,EAAS/F,sBACX2H,EAAkBA,EAAgBnJ,OAAOqJ,IAItCD,EAAqBE,YACxBH,EAAkBA,EAAgBnJ,OAAOqJ,EAAkBrJ,OAAO,CAACjD,MAIrEoM,EAAkBA,EAAgBnJ,OAAO2H,EAAiBvH,EAAyBmH,EAAU/H,GAAWA,GAC1G,CAKE0J,EADE9B,IAAeG,EACDoB,EAAevB,EAAWvB,mBAAoBjK,EAAaF,GAE3D0L,EAAWvB,mBAAmBvJ,MAAM,EAAGV,GAAaoE,OAAOuH,EAAS1B,mBAAmBvJ,MAAMZ,IAG/G,IAAI6N,EAAgBnC,EAAWhK,MAAM,CACnCjB,KAAMiL,EAAW/K,UAAUC,MAAM,EAAGV,GAAe2L,EAASlL,UAAUC,MAAMZ,GAC5EwN,cAAeA,IAKbxJ,EADqBsB,GAA2C,IAAhBpF,GAAmC,IAAdF,GAAmB6L,EAASjG,iBAAmB5D,GAA4C,MAAhC6J,EAAS7F,oBACxGpC,EAAI,CAAC,CAAC5B,EAAU,QAAU8B,EAASG,QAAQC,WAAU,SAAUC,EAAGC,GACrG,OAAOA,IAAMpC,CACf,IAAGqC,WAAU,SAAUF,EAAGC,GACxB,OAAOA,IAAM/C,CACf,IAAGqI,QAAO,SAAUvF,EAAGC,GACrB,OAAuC,IAAhCqJ,EAAgBhH,QAAQrC,EACjC,IAAGE,OAAOV,EAAI,CAAC,CAACvC,EAAQ,SAASkD,KAAI,SAAUJ,EAAGC,GAChD,OAAOA,IAAMpC,EAAW6L,EAAgB,IAC1C,IACIC,EAAkBhK,EAASpC,MAAMsC,GAAW0F,QAAO,SAAUzE,GAC/D,QAASA,CACX,IAMA,OAJIK,GAA2BoG,IAAeG,IAC5CiC,EAAkB5I,EAAoB4I,EAAiBpC,EAAYG,EAAU/H,IAGxE3C,EAAaO,MAAM,CACxBoC,SAAUgK,EACVtJ,gBAAiBrE,EACjByC,eAAgBzC,EAAeuB,MAAM,CACnCxD,UAAW8D,EACXL,aAAczB,EACd0B,SAAUI,EACVH,YAAa3B,EACb4B,YAAY,KAGlB,C,mBCjTA,IAAIZ,EAAgBxD,EAAQ,QAIxBqQ,EAFMrQ,EAAQ,OAEgBsQ,CAAI,2BAyDtC/Q,EAAOC,QAnDP,SAAgCa,EAAakQ,EAAUC,GACrD,IAAIlQ,EAAYD,EAAYE,eACxBiE,EAAUnE,EAAYqC,oBACtBtC,EAASE,EACTE,EAAYF,EAAUG,eACtByD,EAAW5D,EAAUmQ,cACrBC,EAAclM,EAAQxB,eAAexC,GAEzC,GAAI6P,GACgB,YAAdG,GACEhQ,IAAc0D,EAGhB,OAAOM,EAKb,GAAIlE,EAAU0B,cAAe,CAC3B,GAAkB,YAAdwO,EAAyB,CAC3B,GAAInQ,EAAYsQ,4BACd,OAAOnM,EAGT,GAAI6L,EAGF,GAFqB/P,EAAU2B,oBAAsBuC,EAAQxB,eAAexC,GAAWsD,YAEnE,CAClB,IAAI8M,EAAqBpM,EAAQxB,eAAe0N,EAAY1H,aAE5D,IAAK4H,GAAyD,IAAnCA,EAAmB9M,YAG5C,OAAOU,CAEX,CAEJ,MAAO,GAAInE,EAAYwQ,8BACrB,OAAOrM,EAKT,IAFApE,EAASmQ,EAASlQ,MAEHC,EACb,OAAOkE,CAEX,CAEA,OAAOhB,EAAcyB,YAAYT,EAASpE,EAAQoQ,EACpD,C,WC3DA,IAAIM,EAAwB,IAAIC,OAAO,KAAM,KAM7CxR,EAAOC,QAJP,SAA2BwR,GACzB,OAAOA,EAAMC,QAAQH,EAAuB,GAC9C,C,mBCJA,IAAII,EAAelR,EAAQ,QAEvBmR,EAAsBnR,EAAQ,QAE9BoR,EAAYpR,EAAQ,QAEpBqR,EAAerR,EAAQ,QAEvBsR,EAAmBtR,EAAQ,QAE3BuR,EAA6BvR,EAAQ,QAErCkH,EAAYlH,EAAQ,QAEpBD,EAAYC,EAAQ,QAEpBwR,EAAOJ,EAAUK,UAAU,MAE/B,SAASC,EAAiBjS,EAAMkS,GAC9B,IAAKlS,EACH,MAAO,UAGT,IAAImS,EAAaC,EAAoBpS,EAAMkS,GAE3C,OAAIC,EAAWjS,WAAaC,KAAKkS,UACxBF,EAAWG,aAGnBhS,EAAU6R,IAA8H1K,GAAU,GAC/H0K,EACCI,UACvB,CAEA,SAASH,EAAoBpS,EAAMkS,GACjC,IAAIM,OAA2BtF,IAAlBgF,EAA8BA,EAAclS,GAAQ,GAEjE,GAAIA,EAAKE,WAAaC,KAAKkS,UAAW,CACpC,IAAIzO,EAAS5D,EAAKsS,YAAY1O,OAC9B,OAAOkO,EAA2B9R,GAAMyS,eAAe,SAAW7O,GAAU4O,EAAO5O,OAAS,MAAQ4O,EAAOE,KAAK,MAAQ,IAAM,IAChI,CAEA,IAAIC,EAAQ3S,EAAK4S,YAEM,IAAnBD,EAAMzS,UAAkBsS,EAAO5O,QACjC+O,EAAME,aAAa,cAAeL,EAAOE,KAAK,OAKhD,IAFA,IAAII,EAAa9S,EAAK8S,WAEbC,EAAK,EAAGA,EAAKD,EAAWlP,OAAQmP,IACvCJ,EAAMK,YAAYZ,EAAoBU,EAAWC,GAAKb,IAGxD,OAAOS,CACT,CAEA,SAASM,EAAuBjT,EAAMkS,GAMpC,IAJA,IAAIgB,EAAclT,EAEdmT,EAAaD,EAEVA,GAAa,CAClB,GAAI5S,EAAU4S,IAAgBC,EAAWC,aAAa,mBAEpD,OAAOnB,EAAiBiB,EAAahB,GAGrCiB,EADAD,EAAcA,EAAYG,UAG9B,CAEA,MAAO,+CACT,CAEA,SAASC,EAActT,GACrB,OAA0B,OAAnBA,EAAKuT,UAAqBvT,EAAK8S,WAAWlP,OAAS5D,EAAKuT,UAAU3P,MAC3E,CA0FA,SAAS4P,EAAoB3S,EAAWb,EAAMmB,EAAQ6B,GACpD,IAAIyQ,EAAgB5B,IAIpB,GAHahR,EAAU6S,QAGD,MAAR1T,GAAgB4R,EAAa6B,EAAezT,GAAO,CAO3DmB,EAASmS,EAActT,IAEzB0R,EAAoBiC,yBAAyB,CAC3CC,cAAeX,EAAuBjT,GACtC6T,YAAaC,KAAKC,UAAU,CAC1B5S,OAAQA,IAEV6B,eAAgB8Q,KAAKC,UAAU/Q,EAAegR,UAKlD,IAAIC,EAAejU,IAASa,EAAUqT,UAEtC,IAIMrT,EAAUsT,WAAa,GAAKtT,EAAU6S,QACxC7S,EAAU6S,OAAO1T,EAAMmB,EAE3B,CAAE,MAAOS,GAmCP,MAlCA8P,EAAoBiC,yBAAyB,CAC3CC,cAAeX,EAAuBjT,GAAM,SAAUoU,GACpD,IAAI5B,EAAS,GAcb,OAZI4B,IAAMX,GACRjB,EAAOtP,KAAK,kBAGVkR,IAAMvT,EAAUwT,YAClB7B,EAAOtP,KAAK,yBAGVkR,IAAMvT,EAAUqT,WAClB1B,EAAOtP,KAAK,wBAGPsP,CACT,IACAqB,YAAaC,KAAKC,UAAU,CAC1BO,kBAAmBb,EAAgBA,EAAcjT,SAAW,KAC5D+T,YAAavU,IAASa,EAAUqT,UAChCD,aAAcA,EACdO,oBAAqB3T,EAAUsT,WAC/BM,wBAAyB5T,EAAUwT,WAAaxT,EAAUwT,WAAW7T,SAAW,KAChFkU,sBAAuB7T,EAAU2D,aACjCmQ,uBAAwB9T,EAAUqT,UAAYrT,EAAUqT,UAAU1T,SAAW,KAC7EoU,qBAAsB/T,EAAU6D,YAChCmQ,QAASjT,EAAI,GAAKA,EAAI,KACtBT,OAAQA,GACP,KAAM,GACT6B,eAAgB8Q,KAAKC,UAAU/Q,EAAegR,OAAQ,KAAM,KAIxDpS,CACR,CACF,MAME,GAAI5B,GAAQa,EAAUsT,WAAa,EAAG,CACpC,IAAI1R,EAAQ5B,EAAU8B,WAAW,GACjCF,EAAMqS,OAAO9U,EAAMmB,GACnBN,EAAUkU,SAAStS,EAAMuS,aAC3B,CAEJ,CAEA,SAASC,EAAoBpU,EAAWb,EAAMmB,EAAQ6B,GACpD,IAAIP,EAAQqP,EAA2B9R,GAAMkV,cAgB7C,GAdI/T,EAASmS,EAActT,KAEzB0R,EAAoBiC,yBAAyB,CAC3CC,cAAeX,EAAuBjT,GACtC6T,YAAaC,KAAKC,UAAU,CAC1B5S,OAAQA,IAEV6B,eAAgB8Q,KAAKC,UAAU/Q,EAAegR,UAEhDvC,EAAa0D,8BAGf1S,EAAM2S,SAASpV,EAAMmB,GAEjB4Q,EACF,IACElR,EAAUkU,SAAStS,EACrB,CAAE,MAAOb,GACHyT,CAIN,MAEAxU,EAAUkU,SAAStS,EAEvB,CAEA3C,EAAOC,QAAU,CACfuV,wBAlMF,SAAiCtS,EAAgBhD,EAAMsF,EAAUiQ,EAAWC,GAI1E,IAAIC,EAAiB3D,EAA2B9R,GAEhD,GAAK4R,EAAa6D,EAAeC,gBAAiB1V,GAAlD,CAIA,IAAIa,EAAY4U,EAAehV,YAAYK,eACvCC,EAAYiC,EAAehC,eAC3BwD,EAAexB,EAAeR,kBAC9BiC,EAAWzB,EAAegO,cAC1BtM,EAAc1B,EAAe2S,iBAC7BhR,EAAa3B,EAAe4S,gBAEhC,IAAK/U,EAAU6S,QAAU/O,EAAY,CACnC,IAAIkR,EAAU9U,EACV+U,EAAatR,EACjBzD,EAAY0D,EACZD,EAAeE,EACfD,EAAWoR,EACXnR,EAAcoR,EACdnR,GAAa,CACf,CAEA,IAAIoR,EAAYhV,IAAcuE,GAAYiQ,GAAa/Q,GAAgBgR,GAAWhR,EAC9EwR,EAAWvR,IAAaa,GAAYiQ,GAAa7Q,GAAe8Q,GAAW9Q,EAG/E,GAAIqR,GAAaC,EAIf,OAHAnV,EAAUoV,kBACVhB,EAAoBpU,EAAWb,EAAMwE,EAAe+Q,EAAWvS,QAC/DwQ,EAAoB3S,EAAWb,EAAM0E,EAAc6Q,EAAWvS,GAIhE,GAAK2B,GA0BH,GATIqR,IACFnV,EAAUoV,kBACVhB,EAAoBpU,EAAWb,EAAM0E,EAAc6Q,EAAWvS,IAO5D+S,EAAW,CACb,IAAIG,EAAkBrV,EAAUqT,UAC5BiC,EAAoBtV,EAAU6D,YAClC7D,EAAUoV,kBACVhB,EAAoBpU,EAAWb,EAAMwE,EAAe+Q,EAAWvS,GAC/DwQ,EAAoB3S,EAAWqV,EAAiBC,EAAmBnT,EACrE,OA9BI+S,IACFlV,EAAUoV,kBACVhB,EAAoBpU,EAAWb,EAAMwE,EAAe+Q,EAAWvS,IAM7DgT,GACFxC,EAAoB3S,EAAWb,EAAM0E,EAAc6Q,EAAWvS,EAzClE,CAgEF,EA2HEwQ,oBAAqBA,E,mBC7RvB,IAAIlM,EAAmB/G,EAAQ,QAE3BmL,EAAoBnL,EAAQ,OAE5BiH,EAAYjH,EAAQ,QAEpBkH,EAAYlH,EAAQ,QAEpB6V,EAA6B7V,EAAQ,QAErCoH,EAAOH,EAAUG,KACjBlB,EAAMe,EAAUf,IAEhBmB,EAAiB,SAAwBxE,EAAKuD,EAAUkB,GAC1D,GAAKzE,EAAL,CAIA,IAAI0E,EAAQnB,EAASnF,IAAI4B,GAEpB0E,GAILnB,EAASrC,IAAIlB,EAAKyE,EAAKC,GARvB,CASF,EAiGAhI,EAAOC,QA5DwB,SAAkCiE,EAAchB,GAC5EA,EAAeT,eAAiHkF,GAAU,GAC3I,IAAIrE,EAAMJ,EAAehC,eACrB2F,EAAW3C,EAAa4C,cACxByP,EAAe1P,EAASnF,IAAI4B,GAC5BE,EAAO+S,EAAa7S,UAExB,IAAKF,EAAM,CACT,IAAIgT,EAAYD,EAAaE,UAE7B,GAAkB,wBAAdD,GAAqD,sBAAdA,EACzC,OAAOF,EAA2BpS,EAAchB,GAAgB,SAAU8E,GACxE,OAAOA,EAAMvD,MAAM,CACjBiS,KAAM,WACNC,MAAO,GAEX,GAEJ,CAEA,IAAItV,EAAS6B,EAAeR,kBACxBuK,EAAQsJ,EAAarJ,mBACrB0J,EAAWhL,IACXvD,EAA0BkO,aAAwB/O,EAClDqP,EAAaN,EAAa9R,MAAM,CAClCjB,KAAMA,EAAKG,MAAM,EAAGtC,GACpBkP,cAAetD,EAAMtJ,MAAM,EAAGtC,KAE5ByV,EAAaD,EAAWpS,MAAM,CAChCnB,IAAKsT,EACLpT,KAAMA,EAAKG,MAAMtC,GACjBkP,cAAetD,EAAMtJ,MAAMtC,GAC3B0V,KAAMpQ,MAEJmE,EAAejE,EAASG,QAAQI,WAAU,SAAU2D,GACtD,OAAOA,IAAMwL,CACf,IACIvL,EAAcnE,EAASG,QAAQC,WAAU,SAAU8D,GACrD,OAAOA,IAAMwL,CACf,IAAGS,OACCjQ,EAAY+D,EAAazD,OAAO,CAAC,CAAC/D,EAAKuT,GAAa,CAACD,EAAUE,IAAc9L,GAAaK,eAO9F,OALIhD,IACDkO,EAAajN,eAAeqH,WAAkHhJ,GAAU,GACzJZ,EA/EsB,SAA6BF,EAAUoQ,EAAeC,GAC9E,OAAOrQ,EAASsC,eAAc,SAAUC,GACtC,IAAIb,EAAmB0O,EAAczO,SACjC2O,EAAgBD,EAAW1O,SAE/BV,EAAemP,EAActO,eAAgBS,GAAQ,SAAUpB,GAC7D,IAAIqB,EAAqBrB,EAAMsB,eAC3BO,EAAiBR,EAAmBG,QAAQjB,GAAoB,EAChEuB,EAAmBT,EAAmBU,UAE1C,OADAD,EAAiBE,OAAOH,EAAgB,EAAGsN,GACpCnP,EAAMvD,MAAM,CACjB8E,SAAU1B,EAAKiC,IAEnB,IAEAhC,EAAemP,EAAcpO,oBAAqBO,GAAQ,SAAUpB,GAClE,OAAOA,EAAMvD,MAAM,CACjBiF,YAAayN,GAEjB,IAEArP,EAAeS,EAAkBa,GAAQ,SAAUpB,GACjD,OAAOA,EAAMvD,MAAM,CACjBgF,YAAa0N,GAEjB,IAEArP,EAAeqP,EAAe/N,GAAQ,SAAUpB,GAC9C,OAAOA,EAAMvD,MAAM,CACjBiF,YAAanB,GAEjB,GACF,GACF,CA8CgBN,CAAoBlB,EAAW8P,EAAYC,IAGlD5S,EAAaO,MAAM,CACxBoC,SAAUE,EACVQ,gBAAiBrE,EACjByC,eAAgBzC,EAAeuB,MAAM,CACnCxD,UAAW2V,EACXlS,aAAc,EACdC,SAAUiS,EACVhS,YAAa,EACbC,YAAY,KAGlB,C,YCxHA,IAAIuS,EAAgB,YAMpBpX,EAAOC,QAJP,SAAiCuD,GAC/B,OAAOA,EAAK6T,MAAMD,EACpB,C,aCQApX,EAAOC,QARP,WACE,MAAO,uCAAuCyR,QAAQ,SAAS,SAAU4F,GACvE,IAAIC,EAAoB,GAAhBC,KAAKC,SAAgB,EAE7B,OADa,KAALH,EAAWC,EAAQ,EAAJA,EAAU,GACxBG,SAAS,GACpB,GACF,C","sources":["../node_modules/draft-js/lib/isElement.js","../node_modules/draft-js/lib/isEventHandled.js","../node_modules/draft-js/lib/isHTMLAnchorElement.js","../node_modules/draft-js/lib/isHTMLBRElement.js","../node_modules/draft-js/lib/isHTMLElement.js","../node_modules/draft-js/lib/isHTMLImageElement.js","../node_modules/draft-js/lib/isInstanceOfNode.js","../node_modules/draft-js/lib/isSelectionAtLeafStart.js","../node_modules/draft-js/lib/isSoftNewlineEvent.js","../node_modules/draft-js/lib/keyCommandBackspaceToStartOfLine.js","../node_modules/draft-js/lib/keyCommandBackspaceWord.js","../node_modules/draft-js/lib/keyCommandDeleteWord.js","../node_modules/draft-js/lib/keyCommandInsertNewline.js","../node_modules/draft-js/lib/keyCommandMoveSelectionToEndOfBlock.js","../node_modules/draft-js/lib/keyCommandMoveSelectionToStartOfBlock.js","../node_modules/draft-js/lib/keyCommandPlainBackspace.js","../node_modules/draft-js/lib/keyCommandPlainDelete.js","../node_modules/draft-js/lib/keyCommandTransposeCharacters.js","../node_modules/draft-js/lib/keyCommandUndo.js","../node_modules/draft-js/lib/modifyBlockForContentState.js","../node_modules/draft-js/lib/moveBlockInContentState.js","../node_modules/draft-js/lib/moveSelectionBackward.js","../node_modules/draft-js/lib/moveSelectionForward.js","../node_modules/draft-js/lib/randomizeBlockMapKeys.js","../node_modules/draft-js/lib/removeEntitiesAtEdges.js","../node_modules/draft-js/lib/removeRangeFromContentState.js","../node_modules/draft-js/lib/removeTextWithStrategy.js","../node_modules/draft-js/lib/sanitizeDraftText.js","../node_modules/draft-js/lib/setDraftEditorSelection.js","../node_modules/draft-js/lib/splitBlockInContentState.js","../node_modules/draft-js/lib/splitTextIntoTextBlocks.js","../node_modules/draft-js/lib/uuid.js"],"sourcesContent":["\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nfunction isElement(node) {\n  if (!node || !node.ownerDocument) {\n    return false;\n  }\n\n  return node.nodeType === Node.ELEMENT_NODE;\n}\n\nmodule.exports = isElement;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\n/**\n * Utility method for determining whether or not the value returned\n * from a handler indicates that it was handled.\n */\nfunction isEventHandled(value) {\n  return value === 'handled' || value === true;\n}\n\nmodule.exports = isEventHandled;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nvar isElement = require(\"./isElement\");\n\nfunction isHTMLAnchorElement(node) {\n  if (!node || !node.ownerDocument) {\n    return false;\n  }\n\n  return isElement(node) && node.nodeName === 'A';\n}\n\nmodule.exports = isHTMLAnchorElement;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nvar isElement = require(\"./isElement\");\n\nfunction isHTMLBRElement(node) {\n  if (!node || !node.ownerDocument) {\n    return false;\n  }\n\n  return isElement(node) && node.nodeName === 'BR';\n}\n\nmodule.exports = isHTMLBRElement;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nfunction isHTMLElement(node) {\n  if (!node || !node.ownerDocument) {\n    return false;\n  }\n\n  if (!node.ownerDocument.defaultView) {\n    return node instanceof HTMLElement;\n  }\n\n  if (node instanceof node.ownerDocument.defaultView.HTMLElement) {\n    return true;\n  }\n\n  return false;\n}\n\nmodule.exports = isHTMLElement;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nvar isElement = require(\"./isElement\");\n\nfunction isHTMLImageElement(node) {\n  if (!node || !node.ownerDocument) {\n    return false;\n  }\n\n  return isElement(node) && node.nodeName === 'IMG';\n}\n\nmodule.exports = isHTMLImageElement;","\"use strict\";\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\nfunction isInstanceOfNode(target) {\n  // we changed the name because of having duplicate module provider (fbjs)\n  if (!target || !('ownerDocument' in target)) {\n    return false;\n  }\n\n  if ('ownerDocument' in target) {\n    var node = target;\n\n    if (!node.ownerDocument.defaultView) {\n      return node instanceof Node;\n    }\n\n    if (node instanceof node.ownerDocument.defaultView.Node) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\nmodule.exports = isInstanceOfNode;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nfunction isSelectionAtLeafStart(editorState) {\n  var selection = editorState.getSelection();\n  var anchorKey = selection.getAnchorKey();\n  var blockTree = editorState.getBlockTree(anchorKey);\n  var offset = selection.getStartOffset();\n  var isAtStart = false;\n  blockTree.some(function (leafSet) {\n    if (offset === leafSet.get('start')) {\n      isAtStart = true;\n      return true;\n    }\n\n    if (offset < leafSet.get('end')) {\n      return leafSet.get('leaves').some(function (leaf) {\n        var leafStart = leaf.get('start');\n\n        if (offset === leafStart) {\n          isAtStart = true;\n          return true;\n        }\n\n        return false;\n      });\n    }\n\n    return false;\n  });\n  return isAtStart;\n}\n\nmodule.exports = isSelectionAtLeafStart;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar Keys = require(\"fbjs/lib/Keys\");\n\nfunction isSoftNewlineEvent(e) {\n  return e.which === Keys.RETURN && (e.getModifierState('Shift') || e.getModifierState('Alt') || e.getModifierState('Control'));\n}\n\nmodule.exports = isSoftNewlineEvent;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n\nvar expandRangeToStartOfLine = require(\"./expandRangeToStartOfLine\");\n\nvar getDraftEditorSelectionWithNodes = require(\"./getDraftEditorSelectionWithNodes\");\n\nvar moveSelectionBackward = require(\"./moveSelectionBackward\");\n\nvar removeTextWithStrategy = require(\"./removeTextWithStrategy\");\n\nfunction keyCommandBackspaceToStartOfLine(editorState, e) {\n  var afterRemoval = removeTextWithStrategy(editorState, function (strategyState) {\n    var selection = strategyState.getSelection();\n\n    if (selection.isCollapsed() && selection.getAnchorOffset() === 0) {\n      return moveSelectionBackward(strategyState, 1);\n    }\n\n    var ownerDocument = e.currentTarget.ownerDocument;\n    var domSelection = ownerDocument.defaultView.getSelection(); // getRangeAt can technically throw if there's no selection, but we know\n    // there is one here because text editor has focus (the cursor is a\n    // selection of length 0). Therefore, we don't need to wrap this in a\n    // try-catch block.\n\n    var range = domSelection.getRangeAt(0);\n    range = expandRangeToStartOfLine(range);\n    return getDraftEditorSelectionWithNodes(strategyState, null, range.endContainer, range.endOffset, range.startContainer, range.startOffset).selectionState;\n  }, 'backward');\n\n  if (afterRemoval === editorState.getCurrentContent()) {\n    return editorState;\n  }\n\n  return EditorState.push(editorState, afterRemoval, 'remove-range');\n}\n\nmodule.exports = keyCommandBackspaceToStartOfLine;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftRemovableWord = require(\"./DraftRemovableWord\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar moveSelectionBackward = require(\"./moveSelectionBackward\");\n\nvar removeTextWithStrategy = require(\"./removeTextWithStrategy\");\n/**\n * Delete the word that is left of the cursor, as well as any spaces or\n * punctuation after the word.\n */\n\n\nfunction keyCommandBackspaceWord(editorState) {\n  var afterRemoval = removeTextWithStrategy(editorState, function (strategyState) {\n    var selection = strategyState.getSelection();\n    var offset = selection.getStartOffset(); // If there are no words before the cursor, remove the preceding newline.\n\n    if (offset === 0) {\n      return moveSelectionBackward(strategyState, 1);\n    }\n\n    var key = selection.getStartKey();\n    var content = strategyState.getCurrentContent();\n    var text = content.getBlockForKey(key).getText().slice(0, offset);\n    var toRemove = DraftRemovableWord.getBackward(text);\n    return moveSelectionBackward(strategyState, toRemove.length || 1);\n  }, 'backward');\n\n  if (afterRemoval === editorState.getCurrentContent()) {\n    return editorState;\n  }\n\n  return EditorState.push(editorState, afterRemoval, 'remove-range');\n}\n\nmodule.exports = keyCommandBackspaceWord;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftRemovableWord = require(\"./DraftRemovableWord\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar moveSelectionForward = require(\"./moveSelectionForward\");\n\nvar removeTextWithStrategy = require(\"./removeTextWithStrategy\");\n/**\n * Delete the word that is right of the cursor, as well as any spaces or\n * punctuation before the word.\n */\n\n\nfunction keyCommandDeleteWord(editorState) {\n  var afterRemoval = removeTextWithStrategy(editorState, function (strategyState) {\n    var selection = strategyState.getSelection();\n    var offset = selection.getStartOffset();\n    var key = selection.getStartKey();\n    var content = strategyState.getCurrentContent();\n    var text = content.getBlockForKey(key).getText().slice(offset);\n    var toRemove = DraftRemovableWord.getForward(text); // If there are no words in front of the cursor, remove the newline.\n\n    return moveSelectionForward(strategyState, toRemove.length || 1);\n  }, 'forward');\n\n  if (afterRemoval === editorState.getCurrentContent()) {\n    return editorState;\n  }\n\n  return EditorState.push(editorState, afterRemoval, 'remove-range');\n}\n\nmodule.exports = keyCommandDeleteWord;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar EditorState = require(\"./EditorState\");\n\nfunction keyCommandInsertNewline(editorState) {\n  var contentState = DraftModifier.splitBlock(editorState.getCurrentContent(), editorState.getSelection());\n  return EditorState.push(editorState, contentState, 'split-block');\n}\n\nmodule.exports = keyCommandInsertNewline;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n/**\n * See comment for `moveSelectionToStartOfBlock`.\n */\n\n\nfunction keyCommandMoveSelectionToEndOfBlock(editorState) {\n  var selection = editorState.getSelection();\n  var endKey = selection.getEndKey();\n  var content = editorState.getCurrentContent();\n  var textLength = content.getBlockForKey(endKey).getLength();\n  return EditorState.set(editorState, {\n    selection: selection.merge({\n      anchorKey: endKey,\n      anchorOffset: textLength,\n      focusKey: endKey,\n      focusOffset: textLength,\n      isBackward: false\n    }),\n    forceSelection: true\n  });\n}\n\nmodule.exports = keyCommandMoveSelectionToEndOfBlock;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n/**\n * Collapse selection at the start of the first selected block. This is used\n * for Firefox versions that attempt to navigate forward/backward instead of\n * moving the cursor. Other browsers are able to move the cursor natively.\n */\n\n\nfunction keyCommandMoveSelectionToStartOfBlock(editorState) {\n  var selection = editorState.getSelection();\n  var startKey = selection.getStartKey();\n  return EditorState.set(editorState, {\n    selection: selection.merge({\n      anchorKey: startKey,\n      anchorOffset: 0,\n      focusKey: startKey,\n      focusOffset: 0,\n      isBackward: false\n    }),\n    forceSelection: true\n  });\n}\n\nmodule.exports = keyCommandMoveSelectionToStartOfBlock;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n\nvar UnicodeUtils = require(\"fbjs/lib/UnicodeUtils\");\n\nvar moveSelectionBackward = require(\"./moveSelectionBackward\");\n\nvar removeTextWithStrategy = require(\"./removeTextWithStrategy\");\n/**\n * Remove the selected range. If the cursor is collapsed, remove the preceding\n * character. This operation is Unicode-aware, so removing a single character\n * will remove a surrogate pair properly as well.\n */\n\n\nfunction keyCommandPlainBackspace(editorState) {\n  var afterRemoval = removeTextWithStrategy(editorState, function (strategyState) {\n    var selection = strategyState.getSelection();\n    var content = strategyState.getCurrentContent();\n    var key = selection.getAnchorKey();\n    var offset = selection.getAnchorOffset();\n    var charBehind = content.getBlockForKey(key).getText()[offset - 1];\n    return moveSelectionBackward(strategyState, charBehind ? UnicodeUtils.getUTF16Length(charBehind, 0) : 1);\n  }, 'backward');\n\n  if (afterRemoval === editorState.getCurrentContent()) {\n    return editorState;\n  }\n\n  var selection = editorState.getSelection();\n  return EditorState.push(editorState, afterRemoval.set('selectionBefore', selection), selection.isCollapsed() ? 'backspace-character' : 'remove-range');\n}\n\nmodule.exports = keyCommandPlainBackspace;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n\nvar UnicodeUtils = require(\"fbjs/lib/UnicodeUtils\");\n\nvar moveSelectionForward = require(\"./moveSelectionForward\");\n\nvar removeTextWithStrategy = require(\"./removeTextWithStrategy\");\n/**\n * Remove the selected range. If the cursor is collapsed, remove the following\n * character. This operation is Unicode-aware, so removing a single character\n * will remove a surrogate pair properly as well.\n */\n\n\nfunction keyCommandPlainDelete(editorState) {\n  var afterRemoval = removeTextWithStrategy(editorState, function (strategyState) {\n    var selection = strategyState.getSelection();\n    var content = strategyState.getCurrentContent();\n    var key = selection.getAnchorKey();\n    var offset = selection.getAnchorOffset();\n    var charAhead = content.getBlockForKey(key).getText()[offset];\n    return moveSelectionForward(strategyState, charAhead ? UnicodeUtils.getUTF16Length(charAhead, 0) : 1);\n  }, 'forward');\n\n  if (afterRemoval === editorState.getCurrentContent()) {\n    return editorState;\n  }\n\n  var selection = editorState.getSelection();\n  return EditorState.push(editorState, afterRemoval.set('selectionBefore', selection), selection.isCollapsed() ? 'delete-character' : 'remove-range');\n}\n\nmodule.exports = keyCommandPlainDelete;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar EditorState = require(\"./EditorState\");\n\nvar getContentStateFragment = require(\"./getContentStateFragment\");\n/**\n * Transpose the characters on either side of a collapsed cursor, or\n * if the cursor is at the end of the block, transpose the last two\n * characters.\n */\n\n\nfunction keyCommandTransposeCharacters(editorState) {\n  var selection = editorState.getSelection();\n\n  if (!selection.isCollapsed()) {\n    return editorState;\n  }\n\n  var offset = selection.getAnchorOffset();\n\n  if (offset === 0) {\n    return editorState;\n  }\n\n  var blockKey = selection.getAnchorKey();\n  var content = editorState.getCurrentContent();\n  var block = content.getBlockForKey(blockKey);\n  var length = block.getLength(); // Nothing to transpose if there aren't two characters.\n\n  if (length <= 1) {\n    return editorState;\n  }\n\n  var removalRange;\n  var finalSelection;\n\n  if (offset === length) {\n    // The cursor is at the end of the block. Swap the last two characters.\n    removalRange = selection.set('anchorOffset', offset - 1);\n    finalSelection = selection;\n  } else {\n    removalRange = selection.set('focusOffset', offset + 1);\n    finalSelection = removalRange.set('anchorOffset', offset + 1);\n  } // Extract the character to move as a fragment. This preserves its\n  // styling and entity, if any.\n\n\n  var movedFragment = getContentStateFragment(content, removalRange);\n  var afterRemoval = DraftModifier.removeRange(content, removalRange, 'backward'); // After the removal, the insertion target is one character back.\n\n  var selectionAfter = afterRemoval.getSelectionAfter();\n  var targetOffset = selectionAfter.getAnchorOffset() - 1;\n  var targetRange = selectionAfter.merge({\n    anchorOffset: targetOffset,\n    focusOffset: targetOffset\n  });\n  var afterInsert = DraftModifier.replaceWithFragment(afterRemoval, targetRange, movedFragment);\n  var newEditorState = EditorState.push(editorState, afterInsert, 'insert-fragment');\n  return EditorState.acceptSelection(newEditorState, finalSelection);\n}\n\nmodule.exports = keyCommandTransposeCharacters;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar EditorState = require(\"./EditorState\");\n\nfunction keyCommandUndo(e, editorState, updateFn) {\n  var undoneState = EditorState.undo(editorState); // If the last change to occur was a spellcheck change, allow the undo\n  // event to fall through to the browser. This allows the browser to record\n  // the unwanted change, which should soon lead it to learn not to suggest\n  // the correction again.\n\n  if (editorState.getLastChangeType() === 'spellcheck-change') {\n    var nativelyRenderedContent = undoneState.getCurrentContent();\n    updateFn(EditorState.set(undoneState, {\n      nativelyRenderedContent: nativelyRenderedContent\n    }));\n    return;\n  } // Otheriwse, manage the undo behavior manually.\n\n\n  e.preventDefault();\n\n  if (!editorState.getNativelyRenderedContent()) {\n    updateFn(undoneState);\n    return;\n  } // Trigger a re-render with the current content state to ensure that the\n  // component tree has up-to-date props for comparison.\n\n\n  updateFn(EditorState.set(editorState, {\n    nativelyRenderedContent: null\n  })); // Wait to ensure that the re-render has occurred before performing\n  // the undo action.\n\n  setTimeout(function () {\n    updateFn(undoneState);\n  }, 0);\n}\n\nmodule.exports = keyCommandUndo;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar Immutable = require(\"immutable\");\n\nvar Map = Immutable.Map;\n\nfunction modifyBlockForContentState(contentState, selectionState, operation) {\n  var startKey = selectionState.getStartKey();\n  var endKey = selectionState.getEndKey();\n  var blockMap = contentState.getBlockMap();\n  var newBlocks = blockMap.toSeq().skipUntil(function (_, k) {\n    return k === startKey;\n  }).takeUntil(function (_, k) {\n    return k === endKey;\n  }).concat(Map([[endKey, blockMap.get(endKey)]])).map(operation);\n  return contentState.merge({\n    blockMap: blockMap.merge(newBlocks),\n    selectionBefore: selectionState,\n    selectionAfter: selectionState\n  });\n}\n\nmodule.exports = modifyBlockForContentState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar getNextDelimiterBlockKey = require(\"./getNextDelimiterBlockKey\");\n\nvar Immutable = require(\"immutable\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar OrderedMap = Immutable.OrderedMap,\n    List = Immutable.List;\n\nvar transformBlock = function transformBlock(key, blockMap, func) {\n  if (!key) {\n    return;\n  }\n\n  var block = blockMap.get(key);\n\n  if (!block) {\n    return;\n  }\n\n  blockMap.set(key, func(block));\n};\n\nvar updateBlockMapLinks = function updateBlockMapLinks(blockMap, originalBlockToBeMoved, originalTargetBlock, insertionMode, isExperimentalTreeBlock) {\n  if (!isExperimentalTreeBlock) {\n    return blockMap;\n  } // possible values of 'insertionMode' are: 'after', 'before'\n\n\n  var isInsertedAfterTarget = insertionMode === 'after';\n  var originalBlockKey = originalBlockToBeMoved.getKey();\n  var originalTargetKey = originalTargetBlock.getKey();\n  var originalParentKey = originalBlockToBeMoved.getParentKey();\n  var originalNextSiblingKey = originalBlockToBeMoved.getNextSiblingKey();\n  var originalPrevSiblingKey = originalBlockToBeMoved.getPrevSiblingKey();\n  var newParentKey = originalTargetBlock.getParentKey();\n  var newNextSiblingKey = isInsertedAfterTarget ? originalTargetBlock.getNextSiblingKey() : originalTargetKey;\n  var newPrevSiblingKey = isInsertedAfterTarget ? originalTargetKey : originalTargetBlock.getPrevSiblingKey();\n  return blockMap.withMutations(function (blocks) {\n    // update old parent\n    transformBlock(originalParentKey, blocks, function (block) {\n      var parentChildrenList = block.getChildKeys();\n      return block.merge({\n        children: parentChildrenList[\"delete\"](parentChildrenList.indexOf(originalBlockKey))\n      });\n    }); // update old prev\n\n    transformBlock(originalPrevSiblingKey, blocks, function (block) {\n      return block.merge({\n        nextSibling: originalNextSiblingKey\n      });\n    }); // update old next\n\n    transformBlock(originalNextSiblingKey, blocks, function (block) {\n      return block.merge({\n        prevSibling: originalPrevSiblingKey\n      });\n    }); // update new next\n\n    transformBlock(newNextSiblingKey, blocks, function (block) {\n      return block.merge({\n        prevSibling: originalBlockKey\n      });\n    }); // update new prev\n\n    transformBlock(newPrevSiblingKey, blocks, function (block) {\n      return block.merge({\n        nextSibling: originalBlockKey\n      });\n    }); // update new parent\n\n    transformBlock(newParentKey, blocks, function (block) {\n      var newParentChildrenList = block.getChildKeys();\n      var targetBlockIndex = newParentChildrenList.indexOf(originalTargetKey);\n      var insertionIndex = isInsertedAfterTarget ? targetBlockIndex + 1 : targetBlockIndex !== 0 ? targetBlockIndex - 1 : 0;\n      var newChildrenArray = newParentChildrenList.toArray();\n      newChildrenArray.splice(insertionIndex, 0, originalBlockKey);\n      return block.merge({\n        children: List(newChildrenArray)\n      });\n    }); // update block\n\n    transformBlock(originalBlockKey, blocks, function (block) {\n      return block.merge({\n        nextSibling: newNextSiblingKey,\n        prevSibling: newPrevSiblingKey,\n        parent: newParentKey\n      });\n    });\n  });\n};\n\nvar moveBlockInContentState = function moveBlockInContentState(contentState, blockToBeMoved, targetBlock, insertionMode) {\n  !(insertionMode !== 'replace') ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Replacing blocks is not supported.') : invariant(false) : void 0;\n  var targetKey = targetBlock.getKey();\n  var blockKey = blockToBeMoved.getKey();\n  !(blockKey !== targetKey) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Block cannot be moved next to itself.') : invariant(false) : void 0;\n  var blockMap = contentState.getBlockMap();\n  var isExperimentalTreeBlock = blockToBeMoved instanceof ContentBlockNode;\n  var blocksToBeMoved = [blockToBeMoved];\n  var blockMapWithoutBlocksToBeMoved = blockMap[\"delete\"](blockKey);\n\n  if (isExperimentalTreeBlock) {\n    blocksToBeMoved = [];\n    blockMapWithoutBlocksToBeMoved = blockMap.withMutations(function (blocks) {\n      var nextSiblingKey = blockToBeMoved.getNextSiblingKey();\n      var nextDelimiterBlockKey = getNextDelimiterBlockKey(blockToBeMoved, blocks);\n      blocks.toSeq().skipUntil(function (block) {\n        return block.getKey() === blockKey;\n      }).takeWhile(function (block) {\n        var key = block.getKey();\n        var isBlockToBeMoved = key === blockKey;\n        var hasNextSiblingAndIsNotNextSibling = nextSiblingKey && key !== nextSiblingKey;\n        var doesNotHaveNextSiblingAndIsNotDelimiter = !nextSiblingKey && block.getParentKey() && (!nextDelimiterBlockKey || key !== nextDelimiterBlockKey);\n        return !!(isBlockToBeMoved || hasNextSiblingAndIsNotNextSibling || doesNotHaveNextSiblingAndIsNotDelimiter);\n      }).forEach(function (block) {\n        blocksToBeMoved.push(block);\n        blocks[\"delete\"](block.getKey());\n      });\n    });\n  }\n\n  var blocksBefore = blockMapWithoutBlocksToBeMoved.toSeq().takeUntil(function (v) {\n    return v === targetBlock;\n  });\n  var blocksAfter = blockMapWithoutBlocksToBeMoved.toSeq().skipUntil(function (v) {\n    return v === targetBlock;\n  }).skip(1);\n  var slicedBlocks = blocksToBeMoved.map(function (block) {\n    return [block.getKey(), block];\n  });\n  var newBlocks = OrderedMap();\n\n  if (insertionMode === 'before') {\n    var blockBefore = contentState.getBlockBefore(targetKey);\n    !(!blockBefore || blockBefore.getKey() !== blockToBeMoved.getKey()) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Block cannot be moved next to itself.') : invariant(false) : void 0;\n    newBlocks = blocksBefore.concat([].concat(slicedBlocks, [[targetKey, targetBlock]]), blocksAfter).toOrderedMap();\n  } else if (insertionMode === 'after') {\n    var blockAfter = contentState.getBlockAfter(targetKey);\n    !(!blockAfter || blockAfter.getKey() !== blockKey) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Block cannot be moved next to itself.') : invariant(false) : void 0;\n    newBlocks = blocksBefore.concat([[targetKey, targetBlock]].concat(slicedBlocks), blocksAfter).toOrderedMap();\n  }\n\n  return contentState.merge({\n    blockMap: updateBlockMapLinks(newBlocks, blockToBeMoved, targetBlock, insertionMode, isExperimentalTreeBlock),\n    selectionBefore: contentState.getSelectionAfter(),\n    selectionAfter: contentState.getSelectionAfter().merge({\n      anchorKey: blockKey,\n      focusKey: blockKey\n    })\n  });\n};\n\nmodule.exports = moveBlockInContentState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar warning = require(\"fbjs/lib/warning\");\n/**\n * Given a collapsed selection, move the focus `maxDistance` backward within\n * the selected block. If the selection will go beyond the start of the block,\n * move focus to the end of the previous block, but no further.\n *\n * This function is not Unicode-aware, so surrogate pairs will be treated\n * as having length 2.\n */\n\n\nfunction moveSelectionBackward(editorState, maxDistance) {\n  var selection = editorState.getSelection(); // Should eventually make this an invariant\n\n  process.env.NODE_ENV !== \"production\" ? warning(selection.isCollapsed(), 'moveSelectionBackward should only be called with a collapsed SelectionState') : void 0;\n  var content = editorState.getCurrentContent();\n  var key = selection.getStartKey();\n  var offset = selection.getStartOffset();\n  var focusKey = key;\n  var focusOffset = 0;\n\n  if (maxDistance > offset) {\n    var keyBefore = content.getKeyBefore(key);\n\n    if (keyBefore == null) {\n      focusKey = key;\n    } else {\n      focusKey = keyBefore;\n      var blockBefore = content.getBlockForKey(keyBefore);\n      focusOffset = blockBefore.getText().length;\n    }\n  } else {\n    focusOffset = offset - maxDistance;\n  }\n\n  return selection.merge({\n    focusKey: focusKey,\n    focusOffset: focusOffset,\n    isBackward: true\n  });\n}\n\nmodule.exports = moveSelectionBackward;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar warning = require(\"fbjs/lib/warning\");\n/**\n * Given a collapsed selection, move the focus `maxDistance` forward within\n * the selected block. If the selection will go beyond the end of the block,\n * move focus to the start of the next block, but no further.\n *\n * This function is not Unicode-aware, so surrogate pairs will be treated\n * as having length 2.\n */\n\n\nfunction moveSelectionForward(editorState, maxDistance) {\n  var selection = editorState.getSelection(); // Should eventually make this an invariant\n\n  process.env.NODE_ENV !== \"production\" ? warning(selection.isCollapsed(), 'moveSelectionForward should only be called with a collapsed SelectionState') : void 0;\n  var key = selection.getStartKey();\n  var offset = selection.getStartOffset();\n  var content = editorState.getCurrentContent();\n  var focusKey = key;\n  var focusOffset;\n  var block = content.getBlockForKey(key);\n\n  if (maxDistance > block.getText().length - offset) {\n    focusKey = content.getKeyAfter(key);\n    focusOffset = 0;\n  } else {\n    focusOffset = offset + maxDistance;\n  }\n\n  return selection.merge({\n    focusKey: focusKey,\n    focusOffset: focusOffset\n  });\n}\n\nmodule.exports = moveSelectionForward;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar generateRandomKey = require(\"./generateRandomKey\");\n\nvar Immutable = require(\"immutable\");\n\nvar OrderedMap = Immutable.OrderedMap;\n\nvar randomizeContentBlockNodeKeys = function randomizeContentBlockNodeKeys(blockMap) {\n  var newKeysRef = {}; // we keep track of root blocks in order to update subsequent sibling links\n\n  var lastRootBlock;\n  return OrderedMap(blockMap.withMutations(function (blockMapState) {\n    blockMapState.forEach(function (block, index) {\n      var oldKey = block.getKey();\n      var nextKey = block.getNextSiblingKey();\n      var prevKey = block.getPrevSiblingKey();\n      var childrenKeys = block.getChildKeys();\n      var parentKey = block.getParentKey(); // new key that we will use to build linking\n\n      var key = generateRandomKey(); // we will add it here to re-use it later\n\n      newKeysRef[oldKey] = key;\n\n      if (nextKey) {\n        var nextBlock = blockMapState.get(nextKey);\n\n        if (nextBlock) {\n          blockMapState.setIn([nextKey, 'prevSibling'], key);\n        } else {\n          // this can happen when generating random keys for fragments\n          blockMapState.setIn([oldKey, 'nextSibling'], null);\n        }\n      }\n\n      if (prevKey) {\n        var prevBlock = blockMapState.get(prevKey);\n\n        if (prevBlock) {\n          blockMapState.setIn([prevKey, 'nextSibling'], key);\n        } else {\n          // this can happen when generating random keys for fragments\n          blockMapState.setIn([oldKey, 'prevSibling'], null);\n        }\n      }\n\n      if (parentKey && blockMapState.get(parentKey)) {\n        var parentBlock = blockMapState.get(parentKey);\n        var parentChildrenList = parentBlock.getChildKeys();\n        blockMapState.setIn([parentKey, 'children'], parentChildrenList.set(parentChildrenList.indexOf(block.getKey()), key));\n      } else {\n        // blocks will then be treated as root block nodes\n        blockMapState.setIn([oldKey, 'parent'], null);\n\n        if (lastRootBlock) {\n          blockMapState.setIn([lastRootBlock.getKey(), 'nextSibling'], key);\n          blockMapState.setIn([oldKey, 'prevSibling'], newKeysRef[lastRootBlock.getKey()]);\n        }\n\n        lastRootBlock = blockMapState.get(oldKey);\n      }\n\n      childrenKeys.forEach(function (childKey) {\n        var childBlock = blockMapState.get(childKey);\n\n        if (childBlock) {\n          blockMapState.setIn([childKey, 'parent'], key);\n        } else {\n          blockMapState.setIn([oldKey, 'children'], block.getChildKeys().filter(function (child) {\n            return child !== childKey;\n          }));\n        }\n      });\n    });\n  }).toArray().map(function (block) {\n    return [newKeysRef[block.getKey()], block.set('key', newKeysRef[block.getKey()])];\n  }));\n};\n\nvar randomizeContentBlockKeys = function randomizeContentBlockKeys(blockMap) {\n  return OrderedMap(blockMap.toArray().map(function (block) {\n    var key = generateRandomKey();\n    return [key, block.set('key', key)];\n  }));\n};\n\nvar randomizeBlockMapKeys = function randomizeBlockMapKeys(blockMap) {\n  var isTreeBasedBlockMap = blockMap.first() instanceof ContentBlockNode;\n\n  if (!isTreeBasedBlockMap) {\n    return randomizeContentBlockKeys(blockMap);\n  }\n\n  return randomizeContentBlockNodeKeys(blockMap);\n};\n\nmodule.exports = randomizeBlockMapKeys;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar CharacterMetadata = require(\"./CharacterMetadata\");\n\nvar findRangesImmutable = require(\"./findRangesImmutable\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nfunction removeEntitiesAtEdges(contentState, selectionState) {\n  var blockMap = contentState.getBlockMap();\n  var entityMap = contentState.getEntityMap();\n  var updatedBlocks = {};\n  var startKey = selectionState.getStartKey();\n  var startOffset = selectionState.getStartOffset();\n  var startBlock = blockMap.get(startKey);\n  var updatedStart = removeForBlock(entityMap, startBlock, startOffset);\n\n  if (updatedStart !== startBlock) {\n    updatedBlocks[startKey] = updatedStart;\n  }\n\n  var endKey = selectionState.getEndKey();\n  var endOffset = selectionState.getEndOffset();\n  var endBlock = blockMap.get(endKey);\n\n  if (startKey === endKey) {\n    endBlock = updatedStart;\n  }\n\n  var updatedEnd = removeForBlock(entityMap, endBlock, endOffset);\n\n  if (updatedEnd !== endBlock) {\n    updatedBlocks[endKey] = updatedEnd;\n  }\n\n  if (!Object.keys(updatedBlocks).length) {\n    return contentState.set('selectionAfter', selectionState);\n  }\n\n  return contentState.merge({\n    blockMap: blockMap.merge(updatedBlocks),\n    selectionAfter: selectionState\n  });\n}\n/**\n * Given a list of characters and an offset that is in the middle of an entity,\n * returns the start and end of the entity that is overlapping the offset.\n * Note: This method requires that the offset be in an entity range.\n */\n\n\nfunction getRemovalRange(characters, entityKey, offset) {\n  var removalRange; // Iterates through a list looking for ranges of matching items\n  // based on the 'isEqual' callback.\n  // Then instead of returning the result, call the 'found' callback\n  // with each range.\n  // Then filters those ranges based on the 'filter' callback\n  //\n  // Here we use it to find ranges of characters with the same entity key.\n\n  findRangesImmutable(characters, // the list to iterate through\n  function (a, b) {\n    return a.getEntity() === b.getEntity();\n  }, // 'isEqual' callback\n  function (element) {\n    return element.getEntity() === entityKey;\n  }, // 'filter' callback\n  function (start, end) {\n    // 'found' callback\n    if (start <= offset && end >= offset) {\n      // this entity overlaps the offset index\n      removalRange = {\n        start: start,\n        end: end\n      };\n    }\n  });\n  !(typeof removalRange === 'object') ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Removal range must exist within character list.') : invariant(false) : void 0;\n  return removalRange;\n}\n\nfunction removeForBlock(entityMap, block, offset) {\n  var chars = block.getCharacterList();\n  var charBefore = offset > 0 ? chars.get(offset - 1) : undefined;\n  var charAfter = offset < chars.count() ? chars.get(offset) : undefined;\n  var entityBeforeCursor = charBefore ? charBefore.getEntity() : undefined;\n  var entityAfterCursor = charAfter ? charAfter.getEntity() : undefined;\n\n  if (entityAfterCursor && entityAfterCursor === entityBeforeCursor) {\n    var entity = entityMap.__get(entityAfterCursor);\n\n    if (entity.getMutability() !== 'MUTABLE') {\n      var _getRemovalRange = getRemovalRange(chars, entityAfterCursor, offset),\n          start = _getRemovalRange.start,\n          end = _getRemovalRange.end;\n\n      var current;\n\n      while (start < end) {\n        current = chars.get(start);\n        chars = chars.set(start, CharacterMetadata.applyEntity(current, null));\n        start++;\n      }\n\n      return block.set('characterList', chars);\n    }\n  }\n\n  return block;\n}\n\nmodule.exports = removeEntitiesAtEdges;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar getNextDelimiterBlockKey = require(\"./getNextDelimiterBlockKey\");\n\nvar Immutable = require(\"immutable\");\n\nvar List = Immutable.List,\n    Map = Immutable.Map;\n\nvar transformBlock = function transformBlock(key, blockMap, func) {\n  if (!key) {\n    return;\n  }\n\n  var block = blockMap.get(key);\n\n  if (!block) {\n    return;\n  }\n\n  blockMap.set(key, func(block));\n};\n/**\n * Ancestors needs to be preserved when there are non selected\n * children to make sure we do not leave any orphans behind\n */\n\n\nvar getAncestorsKeys = function getAncestorsKeys(blockKey, blockMap) {\n  var parents = [];\n\n  if (!blockKey) {\n    return parents;\n  }\n\n  var blockNode = blockMap.get(blockKey);\n\n  while (blockNode && blockNode.getParentKey()) {\n    var parentKey = blockNode.getParentKey();\n\n    if (parentKey) {\n      parents.push(parentKey);\n    }\n\n    blockNode = parentKey ? blockMap.get(parentKey) : null;\n  }\n\n  return parents;\n};\n/**\n * Get all next delimiter keys until we hit a root delimiter and return\n * an array of key references\n */\n\n\nvar getNextDelimitersBlockKeys = function getNextDelimitersBlockKeys(block, blockMap) {\n  var nextDelimiters = [];\n\n  if (!block) {\n    return nextDelimiters;\n  }\n\n  var nextDelimiter = getNextDelimiterBlockKey(block, blockMap);\n\n  while (nextDelimiter && blockMap.get(nextDelimiter)) {\n    var _block = blockMap.get(nextDelimiter);\n\n    nextDelimiters.push(nextDelimiter); // we do not need to keep checking all root node siblings, just the first occurance\n\n    nextDelimiter = _block.getParentKey() ? getNextDelimiterBlockKey(_block, blockMap) : null;\n  }\n\n  return nextDelimiters;\n};\n\nvar getNextValidSibling = function getNextValidSibling(block, blockMap, originalBlockMap) {\n  if (!block) {\n    return null;\n  } // note that we need to make sure we refer to the original block since this\n  // function is called within a withMutations\n\n\n  var nextValidSiblingKey = originalBlockMap.get(block.getKey()).getNextSiblingKey();\n\n  while (nextValidSiblingKey && !blockMap.get(nextValidSiblingKey)) {\n    nextValidSiblingKey = originalBlockMap.get(nextValidSiblingKey).getNextSiblingKey() || null;\n  }\n\n  return nextValidSiblingKey;\n};\n\nvar getPrevValidSibling = function getPrevValidSibling(block, blockMap, originalBlockMap) {\n  if (!block) {\n    return null;\n  } // note that we need to make sure we refer to the original block since this\n  // function is called within a withMutations\n\n\n  var prevValidSiblingKey = originalBlockMap.get(block.getKey()).getPrevSiblingKey();\n\n  while (prevValidSiblingKey && !blockMap.get(prevValidSiblingKey)) {\n    prevValidSiblingKey = originalBlockMap.get(prevValidSiblingKey).getPrevSiblingKey() || null;\n  }\n\n  return prevValidSiblingKey;\n};\n\nvar updateBlockMapLinks = function updateBlockMapLinks(blockMap, startBlock, endBlock, originalBlockMap) {\n  return blockMap.withMutations(function (blocks) {\n    // update start block if its retained\n    transformBlock(startBlock.getKey(), blocks, function (block) {\n      return block.merge({\n        nextSibling: getNextValidSibling(block, blocks, originalBlockMap),\n        prevSibling: getPrevValidSibling(block, blocks, originalBlockMap)\n      });\n    }); // update endblock if its retained\n\n    transformBlock(endBlock.getKey(), blocks, function (block) {\n      return block.merge({\n        nextSibling: getNextValidSibling(block, blocks, originalBlockMap),\n        prevSibling: getPrevValidSibling(block, blocks, originalBlockMap)\n      });\n    }); // update start block parent ancestors\n\n    getAncestorsKeys(startBlock.getKey(), originalBlockMap).forEach(function (parentKey) {\n      return transformBlock(parentKey, blocks, function (block) {\n        return block.merge({\n          children: block.getChildKeys().filter(function (key) {\n            return blocks.get(key);\n          }),\n          nextSibling: getNextValidSibling(block, blocks, originalBlockMap),\n          prevSibling: getPrevValidSibling(block, blocks, originalBlockMap)\n        });\n      });\n    }); // update start block next - can only happen if startBlock == endBlock\n\n    transformBlock(startBlock.getNextSiblingKey(), blocks, function (block) {\n      return block.merge({\n        prevSibling: startBlock.getPrevSiblingKey()\n      });\n    }); // update start block prev\n\n    transformBlock(startBlock.getPrevSiblingKey(), blocks, function (block) {\n      return block.merge({\n        nextSibling: getNextValidSibling(block, blocks, originalBlockMap)\n      });\n    }); // update end block next\n\n    transformBlock(endBlock.getNextSiblingKey(), blocks, function (block) {\n      return block.merge({\n        prevSibling: getPrevValidSibling(block, blocks, originalBlockMap)\n      });\n    }); // update end block prev\n\n    transformBlock(endBlock.getPrevSiblingKey(), blocks, function (block) {\n      return block.merge({\n        nextSibling: endBlock.getNextSiblingKey()\n      });\n    }); // update end block parent ancestors\n\n    getAncestorsKeys(endBlock.getKey(), originalBlockMap).forEach(function (parentKey) {\n      transformBlock(parentKey, blocks, function (block) {\n        return block.merge({\n          children: block.getChildKeys().filter(function (key) {\n            return blocks.get(key);\n          }),\n          nextSibling: getNextValidSibling(block, blocks, originalBlockMap),\n          prevSibling: getPrevValidSibling(block, blocks, originalBlockMap)\n        });\n      });\n    }); // update next delimiters all the way to a root delimiter\n\n    getNextDelimitersBlockKeys(endBlock, originalBlockMap).forEach(function (delimiterKey) {\n      return transformBlock(delimiterKey, blocks, function (block) {\n        return block.merge({\n          nextSibling: getNextValidSibling(block, blocks, originalBlockMap),\n          prevSibling: getPrevValidSibling(block, blocks, originalBlockMap)\n        });\n      });\n    }); // if parent (startBlock) was deleted\n\n    if (blockMap.get(startBlock.getKey()) == null && blockMap.get(endBlock.getKey()) != null && endBlock.getParentKey() === startBlock.getKey() && endBlock.getPrevSiblingKey() == null) {\n      var prevSiblingKey = startBlock.getPrevSiblingKey(); // endBlock becomes next sibling of parent's prevSibling\n\n      transformBlock(endBlock.getKey(), blocks, function (block) {\n        return block.merge({\n          prevSibling: prevSiblingKey\n        });\n      });\n      transformBlock(prevSiblingKey, blocks, function (block) {\n        return block.merge({\n          nextSibling: endBlock.getKey()\n        });\n      }); // Update parent for previous parent's children, and children for that parent\n\n      var prevSibling = prevSiblingKey ? blockMap.get(prevSiblingKey) : null;\n      var newParentKey = prevSibling ? prevSibling.getParentKey() : null;\n      startBlock.getChildKeys().forEach(function (childKey) {\n        transformBlock(childKey, blocks, function (block) {\n          return block.merge({\n            parent: newParentKey // set to null if there is no parent\n\n          });\n        });\n      });\n\n      if (newParentKey != null) {\n        var newParent = blockMap.get(newParentKey);\n        transformBlock(newParentKey, blocks, function (block) {\n          return block.merge({\n            children: newParent.getChildKeys().concat(startBlock.getChildKeys())\n          });\n        });\n      } // last child of deleted parent should point to next sibling\n\n\n      transformBlock(startBlock.getChildKeys().find(function (key) {\n        var block = blockMap.get(key);\n        return block.getNextSiblingKey() === null;\n      }), blocks, function (block) {\n        return block.merge({\n          nextSibling: startBlock.getNextSiblingKey()\n        });\n      });\n    }\n  });\n};\n\nvar removeRangeFromContentState = function removeRangeFromContentState(contentState, selectionState) {\n  if (selectionState.isCollapsed()) {\n    return contentState;\n  }\n\n  var blockMap = contentState.getBlockMap();\n  var startKey = selectionState.getStartKey();\n  var startOffset = selectionState.getStartOffset();\n  var endKey = selectionState.getEndKey();\n  var endOffset = selectionState.getEndOffset();\n  var startBlock = blockMap.get(startKey);\n  var endBlock = blockMap.get(endKey); // we assume that ContentBlockNode and ContentBlocks are not mixed together\n\n  var isExperimentalTreeBlock = startBlock instanceof ContentBlockNode; // used to retain blocks that should not be deleted to avoid orphan children\n\n  var parentAncestors = [];\n\n  if (isExperimentalTreeBlock) {\n    var endBlockchildrenKeys = endBlock.getChildKeys();\n    var endBlockAncestors = getAncestorsKeys(endKey, blockMap); // endBlock has unselected siblings so we can not remove its ancestors parents\n\n    if (endBlock.getNextSiblingKey()) {\n      parentAncestors = parentAncestors.concat(endBlockAncestors);\n    } // endBlock has children so can not remove this block or any of its ancestors\n\n\n    if (!endBlockchildrenKeys.isEmpty()) {\n      parentAncestors = parentAncestors.concat(endBlockAncestors.concat([endKey]));\n    } // we need to retain all ancestors of the next delimiter block\n\n\n    parentAncestors = parentAncestors.concat(getAncestorsKeys(getNextDelimiterBlockKey(endBlock, blockMap), blockMap));\n  }\n\n  var characterList;\n\n  if (startBlock === endBlock) {\n    characterList = removeFromList(startBlock.getCharacterList(), startOffset, endOffset);\n  } else {\n    characterList = startBlock.getCharacterList().slice(0, startOffset).concat(endBlock.getCharacterList().slice(endOffset));\n  }\n\n  var modifiedStart = startBlock.merge({\n    text: startBlock.getText().slice(0, startOffset) + endBlock.getText().slice(endOffset),\n    characterList: characterList\n  }); // If cursor (collapsed) is at the start of the first child, delete parent\n  // instead of child\n\n  var shouldDeleteParent = isExperimentalTreeBlock && startOffset === 0 && endOffset === 0 && endBlock.getParentKey() === startKey && endBlock.getPrevSiblingKey() == null;\n  var newBlocks = shouldDeleteParent ? Map([[startKey, null]]) : blockMap.toSeq().skipUntil(function (_, k) {\n    return k === startKey;\n  }).takeUntil(function (_, k) {\n    return k === endKey;\n  }).filter(function (_, k) {\n    return parentAncestors.indexOf(k) === -1;\n  }).concat(Map([[endKey, null]])).map(function (_, k) {\n    return k === startKey ? modifiedStart : null;\n  });\n  var updatedBlockMap = blockMap.merge(newBlocks).filter(function (block) {\n    return !!block;\n  }); // Only update tree block pointers if the range is across blocks\n\n  if (isExperimentalTreeBlock && startBlock !== endBlock) {\n    updatedBlockMap = updateBlockMapLinks(updatedBlockMap, startBlock, endBlock, blockMap);\n  }\n\n  return contentState.merge({\n    blockMap: updatedBlockMap,\n    selectionBefore: selectionState,\n    selectionAfter: selectionState.merge({\n      anchorKey: startKey,\n      anchorOffset: startOffset,\n      focusKey: startKey,\n      focusOffset: startOffset,\n      isBackward: false\n    })\n  });\n};\n/**\n * Maintain persistence for target list when removing characters on the\n * head and tail of the character list.\n */\n\n\nvar removeFromList = function removeFromList(targetList, startOffset, endOffset) {\n  if (startOffset === 0) {\n    while (startOffset < endOffset) {\n      targetList = targetList.shift();\n      startOffset++;\n    }\n  } else if (endOffset === targetList.count()) {\n    while (endOffset > startOffset) {\n      targetList = targetList.pop();\n      endOffset--;\n    }\n  } else {\n    var head = targetList.slice(0, startOffset);\n    var tail = targetList.slice(endOffset);\n    targetList = head.concat(tail).toList();\n  }\n\n  return targetList;\n};\n\nmodule.exports = removeRangeFromContentState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftModifier = require(\"./DraftModifier\");\n\nvar gkx = require(\"./gkx\");\n\nvar experimentalTreeDataSupport = gkx('draft_tree_data_support');\n/**\n * For a collapsed selection state, remove text based on the specified strategy.\n * If the selection state is not collapsed, remove the entire selected range.\n */\n\nfunction removeTextWithStrategy(editorState, strategy, direction) {\n  var selection = editorState.getSelection();\n  var content = editorState.getCurrentContent();\n  var target = selection;\n  var anchorKey = selection.getAnchorKey();\n  var focusKey = selection.getFocusKey();\n  var anchorBlock = content.getBlockForKey(anchorKey);\n\n  if (experimentalTreeDataSupport) {\n    if (direction === 'forward') {\n      if (anchorKey !== focusKey) {\n        // For now we ignore forward delete across blocks,\n        // if there is demand for this we will implement it.\n        return content;\n      }\n    }\n  }\n\n  if (selection.isCollapsed()) {\n    if (direction === 'forward') {\n      if (editorState.isSelectionAtEndOfContent()) {\n        return content;\n      }\n\n      if (experimentalTreeDataSupport) {\n        var isAtEndOfBlock = selection.getAnchorOffset() === content.getBlockForKey(anchorKey).getLength();\n\n        if (isAtEndOfBlock) {\n          var anchorBlockSibling = content.getBlockForKey(anchorBlock.nextSibling);\n\n          if (!anchorBlockSibling || anchorBlockSibling.getLength() === 0) {\n            // For now we ignore forward delete at the end of a block,\n            // if there is demand for this we will implement it.\n            return content;\n          }\n        }\n      }\n    } else if (editorState.isSelectionAtStartOfContent()) {\n      return content;\n    }\n\n    target = strategy(editorState);\n\n    if (target === selection) {\n      return content;\n    }\n  }\n\n  return DraftModifier.removeRange(content, target, direction);\n}\n\nmodule.exports = removeTextWithStrategy;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar REGEX_BLOCK_DELIMITER = new RegExp('\\r', 'g');\n\nfunction sanitizeDraftText(input) {\n  return input.replace(REGEX_BLOCK_DELIMITER, '');\n}\n\nmodule.exports = sanitizeDraftText;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar DraftEffects = require(\"./DraftEffects\");\n\nvar DraftJsDebugLogging = require(\"./DraftJsDebugLogging\");\n\nvar UserAgent = require(\"fbjs/lib/UserAgent\");\n\nvar containsNode = require(\"fbjs/lib/containsNode\");\n\nvar getActiveElement = require(\"fbjs/lib/getActiveElement\");\n\nvar getCorrectDocumentFromNode = require(\"./getCorrectDocumentFromNode\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar isElement = require(\"./isElement\");\n\nvar isIE = UserAgent.isBrowser('IE');\n\nfunction getAnonymizedDOM(node, getNodeLabels) {\n  if (!node) {\n    return '[empty]';\n  }\n\n  var anonymized = anonymizeTextWithin(node, getNodeLabels);\n\n  if (anonymized.nodeType === Node.TEXT_NODE) {\n    return anonymized.textContent;\n  }\n\n  !isElement(anonymized) ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Node must be an Element if it is not a text node.') : invariant(false) : void 0;\n  var castedElement = anonymized;\n  return castedElement.outerHTML;\n}\n\nfunction anonymizeTextWithin(node, getNodeLabels) {\n  var labels = getNodeLabels !== undefined ? getNodeLabels(node) : [];\n\n  if (node.nodeType === Node.TEXT_NODE) {\n    var length = node.textContent.length;\n    return getCorrectDocumentFromNode(node).createTextNode('[text ' + length + (labels.length ? ' | ' + labels.join(', ') : '') + ']');\n  }\n\n  var clone = node.cloneNode();\n\n  if (clone.nodeType === 1 && labels.length) {\n    clone.setAttribute('data-labels', labels.join(', '));\n  }\n\n  var childNodes = node.childNodes;\n\n  for (var ii = 0; ii < childNodes.length; ii++) {\n    clone.appendChild(anonymizeTextWithin(childNodes[ii], getNodeLabels));\n  }\n\n  return clone;\n}\n\nfunction getAnonymizedEditorDOM(node, getNodeLabels) {\n  // grabbing the DOM content of the Draft editor\n  var currentNode = node; // this should only be used after checking with isElement\n\n  var castedNode = currentNode;\n\n  while (currentNode) {\n    if (isElement(currentNode) && castedNode.hasAttribute('contenteditable')) {\n      // found the Draft editor container\n      return getAnonymizedDOM(currentNode, getNodeLabels);\n    } else {\n      currentNode = currentNode.parentNode;\n      castedNode = currentNode;\n    }\n  }\n\n  return 'Could not find contentEditable parent of node';\n}\n\nfunction getNodeLength(node) {\n  return node.nodeValue === null ? node.childNodes.length : node.nodeValue.length;\n}\n/**\n * In modern non-IE browsers, we can support both forward and backward\n * selections.\n *\n * Note: IE10+ supports the Selection object, but it does not support\n * the `extend` method, which means that even in modern IE, it's not possible\n * to programatically create a backward selection. Thus, for all IE\n * versions, we use the old IE API to create our selections.\n */\n\n\nfunction setDraftEditorSelection(selectionState, node, blockKey, nodeStart, nodeEnd) {\n  // It's possible that the editor has been removed from the DOM but\n  // our selection code doesn't know it yet. Forcing selection in\n  // this case may lead to errors, so just bail now.\n  var documentObject = getCorrectDocumentFromNode(node);\n\n  if (!containsNode(documentObject.documentElement, node)) {\n    return;\n  }\n\n  var selection = documentObject.defaultView.getSelection();\n  var anchorKey = selectionState.getAnchorKey();\n  var anchorOffset = selectionState.getAnchorOffset();\n  var focusKey = selectionState.getFocusKey();\n  var focusOffset = selectionState.getFocusOffset();\n  var isBackward = selectionState.getIsBackward(); // IE doesn't support backward selection. Swap key/offset pairs.\n\n  if (!selection.extend && isBackward) {\n    var tempKey = anchorKey;\n    var tempOffset = anchorOffset;\n    anchorKey = focusKey;\n    anchorOffset = focusOffset;\n    focusKey = tempKey;\n    focusOffset = tempOffset;\n    isBackward = false;\n  }\n\n  var hasAnchor = anchorKey === blockKey && nodeStart <= anchorOffset && nodeEnd >= anchorOffset;\n  var hasFocus = focusKey === blockKey && nodeStart <= focusOffset && nodeEnd >= focusOffset; // If the selection is entirely bound within this node, set the selection\n  // and be done.\n\n  if (hasAnchor && hasFocus) {\n    selection.removeAllRanges();\n    addPointToSelection(selection, node, anchorOffset - nodeStart, selectionState);\n    addFocusToSelection(selection, node, focusOffset - nodeStart, selectionState);\n    return;\n  }\n\n  if (!isBackward) {\n    // If the anchor is within this node, set the range start.\n    if (hasAnchor) {\n      selection.removeAllRanges();\n      addPointToSelection(selection, node, anchorOffset - nodeStart, selectionState);\n    } // If the focus is within this node, we can assume that we have\n    // already set the appropriate start range on the selection, and\n    // can simply extend the selection.\n\n\n    if (hasFocus) {\n      addFocusToSelection(selection, node, focusOffset - nodeStart, selectionState);\n    }\n  } else {\n    // If this node has the focus, set the selection range to be a\n    // collapsed range beginning here. Later, when we encounter the anchor,\n    // we'll use this information to extend the selection.\n    if (hasFocus) {\n      selection.removeAllRanges();\n      addPointToSelection(selection, node, focusOffset - nodeStart, selectionState);\n    } // If this node has the anchor, we may assume that the correct\n    // focus information is already stored on the selection object.\n    // We keep track of it, reset the selection range, and extend it\n    // back to the focus point.\n\n\n    if (hasAnchor) {\n      var storedFocusNode = selection.focusNode;\n      var storedFocusOffset = selection.focusOffset;\n      selection.removeAllRanges();\n      addPointToSelection(selection, node, anchorOffset - nodeStart, selectionState);\n      addFocusToSelection(selection, storedFocusNode, storedFocusOffset, selectionState);\n    }\n  }\n}\n/**\n * Extend selection towards focus point.\n */\n\n\nfunction addFocusToSelection(selection, node, offset, selectionState) {\n  var activeElement = getActiveElement();\n  var extend = selection.extend; // containsNode returns false if node is null.\n  // Let's refine the type of this value out here so flow knows.\n\n  if (extend && node != null && containsNode(activeElement, node)) {\n    // If `extend` is called while another element has focus, an error is\n    // thrown. We therefore disable `extend` if the active element is somewhere\n    // other than the node we are selecting. This should only occur in Firefox,\n    // since it is the only browser to support multiple selections.\n    // See https://bugzilla.mozilla.org/show_bug.cgi?id=921444.\n    // logging to catch bug that is being reported in t16250795\n    if (offset > getNodeLength(node)) {\n      // the call to 'selection.extend' is about to throw\n      DraftJsDebugLogging.logSelectionStateFailure({\n        anonymizedDom: getAnonymizedEditorDOM(node),\n        extraParams: JSON.stringify({\n          offset: offset\n        }),\n        selectionState: JSON.stringify(selectionState.toJS())\n      });\n    } // logging to catch bug that is being reported in t18110632\n\n\n    var nodeWasFocus = node === selection.focusNode;\n\n    try {\n      // Fixes some reports of \"InvalidStateError: Failed to execute 'extend' on\n      // 'Selection': This Selection object doesn't have any Ranges.\"\n      // Note: selection.extend does not exist in IE.\n      if (selection.rangeCount > 0 && selection.extend) {\n        selection.extend(node, offset);\n      }\n    } catch (e) {\n      DraftJsDebugLogging.logSelectionStateFailure({\n        anonymizedDom: getAnonymizedEditorDOM(node, function (n) {\n          var labels = [];\n\n          if (n === activeElement) {\n            labels.push('active element');\n          }\n\n          if (n === selection.anchorNode) {\n            labels.push('selection anchor node');\n          }\n\n          if (n === selection.focusNode) {\n            labels.push('selection focus node');\n          }\n\n          return labels;\n        }),\n        extraParams: JSON.stringify({\n          activeElementName: activeElement ? activeElement.nodeName : null,\n          nodeIsFocus: node === selection.focusNode,\n          nodeWasFocus: nodeWasFocus,\n          selectionRangeCount: selection.rangeCount,\n          selectionAnchorNodeName: selection.anchorNode ? selection.anchorNode.nodeName : null,\n          selectionAnchorOffset: selection.anchorOffset,\n          selectionFocusNodeName: selection.focusNode ? selection.focusNode.nodeName : null,\n          selectionFocusOffset: selection.focusOffset,\n          message: e ? '' + e : null,\n          offset: offset\n        }, null, 2),\n        selectionState: JSON.stringify(selectionState.toJS(), null, 2)\n      }); // allow the error to be thrown -\n      // better than continuing in a broken state\n\n      throw e;\n    }\n  } else {\n    // IE doesn't support extend. This will mean no backward selection.\n    // Extract the existing selection range and add focus to it.\n    // Additionally, clone the selection range. IE11 throws an\n    // InvalidStateError when attempting to access selection properties\n    // after the range is detached.\n    if (node && selection.rangeCount > 0) {\n      var range = selection.getRangeAt(0);\n      range.setEnd(node, offset);\n      selection.addRange(range.cloneRange());\n    }\n  }\n}\n\nfunction addPointToSelection(selection, node, offset, selectionState) {\n  var range = getCorrectDocumentFromNode(node).createRange(); // logging to catch bug that is being reported in t16250795\n\n  if (offset > getNodeLength(node)) {\n    // in this case we know that the call to 'range.setStart' is about to throw\n    DraftJsDebugLogging.logSelectionStateFailure({\n      anonymizedDom: getAnonymizedEditorDOM(node),\n      extraParams: JSON.stringify({\n        offset: offset\n      }),\n      selectionState: JSON.stringify(selectionState.toJS())\n    });\n    DraftEffects.handleExtensionCausedError();\n  }\n\n  range.setStart(node, offset); // IE sometimes throws Unspecified Error when trying to addRange\n\n  if (isIE) {\n    try {\n      selection.addRange(range);\n    } catch (e) {\n      if (process.env.NODE_ENV !== \"production\") {\n        /* eslint-disable-next-line no-console */\n        console.warn('Call to selection.addRange() threw exception: ', e);\n      }\n    }\n  } else {\n    selection.addRange(range);\n  }\n}\n\nmodule.exports = {\n  setDraftEditorSelection: setDraftEditorSelection,\n  addFocusToSelection: addFocusToSelection\n};","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar ContentBlockNode = require(\"./ContentBlockNode\");\n\nvar generateRandomKey = require(\"./generateRandomKey\");\n\nvar Immutable = require(\"immutable\");\n\nvar invariant = require(\"fbjs/lib/invariant\");\n\nvar modifyBlockForContentState = require(\"./modifyBlockForContentState\");\n\nvar List = Immutable.List,\n    Map = Immutable.Map;\n\nvar transformBlock = function transformBlock(key, blockMap, func) {\n  if (!key) {\n    return;\n  }\n\n  var block = blockMap.get(key);\n\n  if (!block) {\n    return;\n  }\n\n  blockMap.set(key, func(block));\n};\n\nvar updateBlockMapLinks = function updateBlockMapLinks(blockMap, originalBlock, belowBlock) {\n  return blockMap.withMutations(function (blocks) {\n    var originalBlockKey = originalBlock.getKey();\n    var belowBlockKey = belowBlock.getKey(); // update block parent\n\n    transformBlock(originalBlock.getParentKey(), blocks, function (block) {\n      var parentChildrenList = block.getChildKeys();\n      var insertionIndex = parentChildrenList.indexOf(originalBlockKey) + 1;\n      var newChildrenArray = parentChildrenList.toArray();\n      newChildrenArray.splice(insertionIndex, 0, belowBlockKey);\n      return block.merge({\n        children: List(newChildrenArray)\n      });\n    }); // update original next block\n\n    transformBlock(originalBlock.getNextSiblingKey(), blocks, function (block) {\n      return block.merge({\n        prevSibling: belowBlockKey\n      });\n    }); // update original block\n\n    transformBlock(originalBlockKey, blocks, function (block) {\n      return block.merge({\n        nextSibling: belowBlockKey\n      });\n    }); // update below block\n\n    transformBlock(belowBlockKey, blocks, function (block) {\n      return block.merge({\n        prevSibling: originalBlockKey\n      });\n    });\n  });\n};\n\nvar splitBlockInContentState = function splitBlockInContentState(contentState, selectionState) {\n  !selectionState.isCollapsed() ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'Selection range must be collapsed.') : invariant(false) : void 0;\n  var key = selectionState.getAnchorKey();\n  var blockMap = contentState.getBlockMap();\n  var blockToSplit = blockMap.get(key);\n  var text = blockToSplit.getText();\n\n  if (!text) {\n    var blockType = blockToSplit.getType();\n\n    if (blockType === 'unordered-list-item' || blockType === 'ordered-list-item') {\n      return modifyBlockForContentState(contentState, selectionState, function (block) {\n        return block.merge({\n          type: 'unstyled',\n          depth: 0\n        });\n      });\n    }\n  }\n\n  var offset = selectionState.getAnchorOffset();\n  var chars = blockToSplit.getCharacterList();\n  var keyBelow = generateRandomKey();\n  var isExperimentalTreeBlock = blockToSplit instanceof ContentBlockNode;\n  var blockAbove = blockToSplit.merge({\n    text: text.slice(0, offset),\n    characterList: chars.slice(0, offset)\n  });\n  var blockBelow = blockAbove.merge({\n    key: keyBelow,\n    text: text.slice(offset),\n    characterList: chars.slice(offset),\n    data: Map()\n  });\n  var blocksBefore = blockMap.toSeq().takeUntil(function (v) {\n    return v === blockToSplit;\n  });\n  var blocksAfter = blockMap.toSeq().skipUntil(function (v) {\n    return v === blockToSplit;\n  }).rest();\n  var newBlocks = blocksBefore.concat([[key, blockAbove], [keyBelow, blockBelow]], blocksAfter).toOrderedMap();\n\n  if (isExperimentalTreeBlock) {\n    !blockToSplit.getChildKeys().isEmpty() ? process.env.NODE_ENV !== \"production\" ? invariant(false, 'ContentBlockNode must not have children') : invariant(false) : void 0;\n    newBlocks = updateBlockMapLinks(newBlocks, blockAbove, blockBelow);\n  }\n\n  return contentState.merge({\n    blockMap: newBlocks,\n    selectionBefore: selectionState,\n    selectionAfter: selectionState.merge({\n      anchorKey: keyBelow,\n      anchorOffset: 0,\n      focusKey: keyBelow,\n      focusOffset: 0,\n      isBackward: false\n    })\n  });\n};\n\nmodule.exports = splitBlockInContentState;","/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @format\n * \n * @emails oncall+draft_js\n */\n'use strict';\n\nvar NEWLINE_REGEX = /\\r\\n?|\\n/g;\n\nfunction splitTextIntoTextBlocks(text) {\n  return text.split(NEWLINE_REGEX);\n}\n\nmodule.exports = splitTextIntoTextBlocks;","\"use strict\";\n\n/**\n * Copyright 2004-present Facebook. All Rights Reserved.\n *\n * @typechecks\n * \n * @format\n */\n\n/*eslint-disable no-bitwise */\n\n/**\n * Based on the rfc4122-compliant solution posted at\n * http://stackoverflow.com/questions/105034\n */\nfunction uuid() {\n  return 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx'.replace(/[xy]/g, function (c) {\n    var r = Math.random() * 16 | 0;\n    var v = c == 'x' ? r : r & 0x3 | 0x8;\n    return v.toString(16);\n  });\n}\n\nmodule.exports = uuid;"],"names":["module","exports","node","ownerDocument","nodeType","Node","ELEMENT_NODE","value","isElement","require","nodeName","defaultView","HTMLElement","target","editorState","selection","getSelection","anchorKey","getAnchorKey","blockTree","getBlockTree","offset","getStartOffset","isAtStart","some","leafSet","get","leaf","leafStart","Keys","e","which","RETURN","getModifierState","EditorState","expandRangeToStartOfLine","getDraftEditorSelectionWithNodes","moveSelectionBackward","removeTextWithStrategy","afterRemoval","strategyState","isCollapsed","getAnchorOffset","range","currentTarget","getRangeAt","endContainer","endOffset","startContainer","startOffset","selectionState","getCurrentContent","push","DraftRemovableWord","key","getStartKey","text","getBlockForKey","getText","slice","toRemove","getBackward","length","moveSelectionForward","getForward","DraftModifier","contentState","splitBlock","endKey","getEndKey","textLength","getLength","set","merge","anchorOffset","focusKey","focusOffset","isBackward","forceSelection","startKey","UnicodeUtils","content","charBehind","getUTF16Length","charAhead","getContentStateFragment","removalRange","finalSelection","blockKey","movedFragment","removeRange","selectionAfter","getSelectionAfter","targetOffset","targetRange","afterInsert","replaceWithFragment","newEditorState","acceptSelection","updateFn","undoneState","undo","getLastChangeType","preventDefault","getNativelyRenderedContent","nativelyRenderedContent","setTimeout","Map","operation","blockMap","getBlockMap","newBlocks","toSeq","skipUntil","_","k","takeUntil","concat","map","selectionBefore","ContentBlockNode","getNextDelimiterBlockKey","Immutable","invariant","OrderedMap","List","transformBlock","func","block","updateBlockMapLinks","originalBlockToBeMoved","originalTargetBlock","insertionMode","isExperimentalTreeBlock","isInsertedAfterTarget","originalBlockKey","getKey","originalTargetKey","originalParentKey","getParentKey","originalNextSiblingKey","getNextSiblingKey","originalPrevSiblingKey","getPrevSiblingKey","newParentKey","newNextSiblingKey","newPrevSiblingKey","withMutations","blocks","parentChildrenList","getChildKeys","children","indexOf","nextSibling","prevSibling","newParentChildrenList","targetBlockIndex","insertionIndex","newChildrenArray","toArray","splice","parent","blockToBeMoved","targetBlock","targetKey","blocksToBeMoved","blockMapWithoutBlocksToBeMoved","nextSiblingKey","nextDelimiterBlockKey","takeWhile","isBlockToBeMoved","hasNextSiblingAndIsNotNextSibling","doesNotHaveNextSiblingAndIsNotDelimiter","forEach","blocksBefore","v","blocksAfter","skip","slicedBlocks","blockBefore","getBlockBefore","toOrderedMap","blockAfter","getBlockAfter","maxDistance","keyBefore","getKeyBefore","getKeyAfter","generateRandomKey","first","lastRootBlock","newKeysRef","blockMapState","index","oldKey","nextKey","prevKey","childrenKeys","parentKey","setIn","childKey","filter","child","randomizeContentBlockNodeKeys","randomizeContentBlockKeys","CharacterMetadata","findRangesImmutable","removeForBlock","entityMap","chars","getCharacterList","charBefore","undefined","charAfter","count","entityBeforeCursor","getEntity","entityAfterCursor","__get","getMutability","current","_getRemovalRange","characters","entityKey","a","b","element","start","end","getRemovalRange","applyEntity","getEntityMap","updatedBlocks","startBlock","updatedStart","getEndOffset","endBlock","updatedEnd","Object","keys","getAncestorsKeys","parents","blockNode","getNextValidSibling","originalBlockMap","nextValidSiblingKey","getPrevValidSibling","prevValidSiblingKey","nextDelimiters","nextDelimiter","_block","getNextDelimitersBlockKeys","delimiterKey","prevSiblingKey","newParent","find","removeFromList","targetList","shift","pop","head","tail","toList","characterList","parentAncestors","endBlockchildrenKeys","endBlockAncestors","isEmpty","modifiedStart","updatedBlockMap","experimentalTreeDataSupport","gkx","strategy","direction","getFocusKey","anchorBlock","isSelectionAtEndOfContent","anchorBlockSibling","isSelectionAtStartOfContent","REGEX_BLOCK_DELIMITER","RegExp","input","replace","DraftEffects","DraftJsDebugLogging","UserAgent","containsNode","getActiveElement","getCorrectDocumentFromNode","isIE","isBrowser","getAnonymizedDOM","getNodeLabels","anonymized","anonymizeTextWithin","TEXT_NODE","textContent","outerHTML","labels","createTextNode","join","clone","cloneNode","setAttribute","childNodes","ii","appendChild","getAnonymizedEditorDOM","currentNode","castedNode","hasAttribute","parentNode","getNodeLength","nodeValue","addFocusToSelection","activeElement","extend","logSelectionStateFailure","anonymizedDom","extraParams","JSON","stringify","toJS","nodeWasFocus","focusNode","rangeCount","n","anchorNode","activeElementName","nodeIsFocus","selectionRangeCount","selectionAnchorNodeName","selectionAnchorOffset","selectionFocusNodeName","selectionFocusOffset","message","setEnd","addRange","cloneRange","addPointToSelection","createRange","handleExtensionCausedError","setStart","process","setDraftEditorSelection","nodeStart","nodeEnd","documentObject","documentElement","getFocusOffset","getIsBackward","tempKey","tempOffset","hasAnchor","hasFocus","removeAllRanges","storedFocusNode","storedFocusOffset","modifyBlockForContentState","blockToSplit","blockType","getType","type","depth","keyBelow","blockAbove","blockBelow","data","rest","originalBlock","belowBlock","belowBlockKey","NEWLINE_REGEX","split","c","r","Math","random","toString"],"sourceRoot":""}